| blob | b849824fcd0fb441f4fe7a26557bb76756230097 |
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
7449 ? DK_PEDWARN
7451 cxx_incomplete_type_diagnostic
7455 {
7458 }
7459 }
7460 }
7463 {
7464 /* Let the name lookup machinery know that we are processing a
7465 class member access expression. */
7467 /* If something went wrong, we want to be able to discern that case,
7468 as opposed to the case where there was no SCOPE due to the type
7469 of expression being dependent. */
7472 /* If the SCOPE was erroneous, make the various semantic analysis
7473 functions exit quickly -- and without issuing additional error
7474 messages. */
7477 }
7478 }
7481 /* Tell cp_parser_lookup_name that there was an object, even though it's
7482 type-dependent. */
7485 /* Assume this expression is not a pseudo-destructor access. */
7488 /* If the SCOPE is a scalar type, then, if this is a valid program,
7489 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7490 is type dependent, it can be pseudo-destructor-name or something else.
7491 Try to parse it as pseudo-destructor-name first. */
7493 {
7494 tree s;
7495 tree type;
7498 /* Parse the pseudo-destructor-name. */
7507 {
7509 postfix_expression
7512 }
7513 }
7516 {
7517 /* If the SCOPE is not a scalar type, we are looking at an
7518 ordinary class member access expression, rather than a
7519 pseudo-destructor-name. */
7522 /* Parse the id-expression. */
7523 name = (cp_parser_id_expression
7530 /* In general, build a SCOPE_REF if the member name is qualified.
7531 However, if the name was not dependent and has already been
7532 resolved; there is no need to build the SCOPE_REF. For example;
7534 struct X { void f(); };
7535 template <typename T> void f(T* t) { t->X::f(); }
7537 Even though "t" is dependent, "X::f" is not and has been resolved
7538 to a BASELINK; there is no need to include scope information. */
7540 /* But we do need to remember that there was an explicit scope for
7541 virtual function calls. */
7545 /* If the name is a template-id that names a type, we will get a
7546 TYPE_DECL here. That is invalid code. */
7548 {
7551 }
7552 else
7553 {
7555 {
7557 {
7561 }
7562 else
7565 name,
7566 template_p);
7570 }
7572 adjust_result_of_qualified_name_lookup
7574 postfix_expression
7576 template_p,
7577 tf_warning_or_error);
7578 /* Build a location e.g.:
7579 ptr->access_expr
7580 ~~~^~~~~~~~~~~~~
7581 where the caret is at the deref token, ranging from
7582 the start of postfix_expression to the end of the access expr. */
7583 location_t end_loc
7585 location_t combined_loc
7588 }
7589 }
7591 /* We no longer need to look up names in the scope of the object on
7592 the left-hand side of the `.' or `->' operator. */
7595 /* Outside of offsetof, these operators may not appear in
7596 constant-expressions. */
7598 && (cp_parser_non_integral_constant_expression
7603 }
7605 /* Parse a parenthesized expression-list.
7607 expression-list:
7608 assignment-expression
7609 expression-list, assignment-expression
7611 attribute-list:
7612 expression-list
7613 identifier
7614 identifier, expression-list
7616 CAST_P is true if this expression is the target of a cast.
7618 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7619 argument pack.
7621 Returns a vector of trees. Each element is a representation of an
7622 assignment-expression. NULL is returned if the ( and or ) are
7623 missing. An empty, but allocated, vector is returned on no
7624 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7625 if we are parsing an attribute list for an attribute that wants a
7626 plain identifier argument, normal_attr for an attribute that wants
7627 an expression, or non_attr if we aren't parsing an attribute list. If
7628 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7629 not all of the expressions in the list were constant.
7630 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7631 will be written to with the location of the closing parenthesis. If
7632 an error occurs, it may or may not be written to. */
7641 {
7647 /* Assume all the expressions will be constant. */
7651 matching_parens parens;
7657 /* Within a parenthesized expression, a `>' token is always
7658 the greater-than operator. */
7659 saved_greater_than_is_operator_p
7663 /* Consume expressions until there are no more. */
7666 {
7667 tree expr;
7669 /* At the beginning of attribute lists, check to see if the
7670 next token is an identifier. */
7673 {
7676 /* Consume the identifier. */
7678 /* Save the identifier. */
7680 }
7681 else
7682 {
7685 /* Parse the next assignment-expression. */
7687 {
7688 /* A braced-init-list. */
7694 }
7696 {
7697 expr = (cp_parser_constant_expression
7702 }
7703 else
7705 cast_p);
7710 /* If we have an ellipsis, then this is an expression
7711 expansion. */
7714 {
7715 /* Consume the `...'. */
7718 /* Build the argument pack. */
7720 }
7722 /* Add it to the list. We add error_mark_node
7723 expressions to the list, so that we can still tell if
7724 the correct form for a parenthesized expression-list
7725 is found. That gives better errors. */
7730 }
7732 /* After the first item, attribute lists look the same as
7733 expression lists. */
7736 get_comma:;
7737 /* If the next token isn't a `,', then we are done. */
7741 /* Otherwise, consume the `,' and keep going. */
7743 }
7749 {
7752 skip_comma:;
7753 /* We try and resync to an unnested comma, as that will give the
7754 user better diagnostics. */
7762 {
7763 parser->greater_than_is_operator_p
7766 }
7767 }
7769 parser->greater_than_is_operator_p
7776 }
7778 /* Parse a pseudo-destructor-name.
7780 pseudo-destructor-name:
7781 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7782 :: [opt] nested-name-specifier template template-id :: ~ type-name
7783 :: [opt] nested-name-specifier [opt] ~ type-name
7785 If either of the first two productions is used, sets *SCOPE to the
7786 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7787 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7788 or ERROR_MARK_NODE if the parse fails. */
7790 static void
7792 tree object,
7795 {
7798 /* Handle ~auto. */
7802 {
7805 "%<~auto%> only available with "
7812 }
7814 /* Assume that things will not work out. */
7817 /* Look for the optional `::' operator. */
7819 /* Look for the optional nested-name-specifier. */
7820 nested_name_specifier_p
7827 /* Now, if we saw a nested-name-specifier, we might be doing the
7828 second production. */
7831 {
7832 /* Consume the `template' keyword. */
7834 /* Parse the template-id. */
7838 class_type,
7840 /* Look for the `::' token. */
7842 }
7843 /* If the next token is not a `~', then there might be some
7844 additional qualification. */
7846 {
7847 /* At this point, we're looking for "type-name :: ~". The type-name
7848 must not be a class-name, since this is a pseudo-destructor. So,
7849 it must be either an enum-name, or a typedef-name -- both of which
7850 are just identifiers. So, we peek ahead to check that the "::"
7851 and "~" tokens are present; if they are not, then we can avoid
7852 calling type_name. */
7856 {
7859 }
7861 /* Look for the type-name. */
7866 /* Look for the `::' token. */
7868 }
7869 else
7872 /* Look for the `~'. */
7875 /* Once we see the ~, this has to be a pseudo-destructor. */
7879 /* Look for the type-name again. We are not responsible for
7880 checking that it matches the first type-name. */
7882 }
7884 /* Parse a unary-expression.
7886 unary-expression:
7887 postfix-expression
7888 ++ cast-expression
7889 -- cast-expression
7890 unary-operator cast-expression
7891 sizeof unary-expression
7892 sizeof ( type-id )
7893 alignof ( type-id ) [C++0x]
7894 new-expression
7895 delete-expression
7897 GNU Extensions:
7899 unary-expression:
7900 __extension__ cast-expression
7901 __alignof__ unary-expression
7902 __alignof__ ( type-id )
7903 alignof unary-expression [C++0x]
7904 __real__ cast-expression
7905 __imag__ cast-expression
7906 && identifier
7907 sizeof ( type-id ) { initializer-list , [opt] }
7908 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7909 __alignof__ ( type-id ) { initializer-list , [opt] }
7911 ADDRESS_P is true iff the unary-expression is appearing as the
7912 operand of the `&' operator. CAST_P is true if this expression is
7913 the target of a cast.
7915 Returns a representation of the expression. */
7917 static cp_expr
7920 {
7924 /* Peek at the next token. */
7926 /* Some keywords give away the kind of expression. */
7928 {
7932 {
7935 {
7941 /* Consume the token. */
7943 /* Parse the operand. */
7948 else
7949 {
7950 /* ISO C++ defines alignof only with types, not with
7951 expressions. So pedwarn if alignof is used with a non-
7952 type expression. However, __alignof__ is ok. */
7955 "ISO C++ does not allow %<alignof%> "
7959 }
7960 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7961 SIZEOF_EXPR with the original operand. */
7963 {
7965 {
7967 {
7970 error_mark_node));
7972 }
7973 else
7977 }
7978 }
7980 /* Construct a location e.g. :
7981 alignof (expr)
7982 ^~~~~~~~~~~~~~
7983 with start == caret at the start of the "alignof"/"sizeof"
7984 token, with the endpoint at the final closing paren. */
7985 location_t finish_loc
7987 location_t compound_loc
7993 }
8002 {
8003 /* The saved value of the PEDANTIC flag. */
8005 tree expr;
8007 /* Save away the PEDANTIC flag. */
8009 /* Parse the cast-expression. */
8011 /* Restore the PEDANTIC flag. */
8015 }
8019 {
8020 tree expression;
8022 /* Consume the `__real__' or `__imag__' token. */
8024 /* Parse the cast-expression. */
8026 /* Create the complete representation. */
8030 expression,
8031 tf_warning_or_error);
8032 }
8040 {
8041 tree expr;
8048 matching_parens parens;
8052 parser->type_definition_forbidden_message
8055 saved_integral_constant_expression_p
8057 saved_non_integral_constant_expression_p
8061 saved_greater_than_is_operator_p
8073 parser->greater_than_is_operator_p
8076 parser->integral_constant_expression_p
8078 parser->non_integral_constant_expression_p
8085 }
8089 }
8090 }
8092 /* Look for the `:: new' and `:: delete', which also signal the
8093 beginning of a new-expression, or delete-expression,
8094 respectively. If the next token is `::', then it might be one of
8095 these. */
8097 {
8100 /* See if the token after the `::' is one of the keywords in
8101 which we're interested. */
8103 /* If it's `new', we have a new-expression. */
8106 /* Similarly, for `delete'. */
8109 }
8111 /* Look for a unary operator. */
8113 /* The `++' and `--' operators can be handled similarly, even though
8114 they are not technically unary-operators in the grammar. */
8116 {
8121 /* Handle the GNU address-of-label extension. */
8124 {
8125 tree identifier;
8126 tree expression;
8129 /* Consume the '&&' token. */
8131 /* Look for the identifier. */
8132 location_t finish_loc
8135 /* Construct a location of the form:
8136 &&label
8137 ^~~~~~~
8138 with caret==start at the "&&", finish at the end of the label. */
8139 location_t combined_loc
8141 /* Create an expression representing the address. */
8144 NIC_ADDR_LABEL))
8147 }
8148 }
8150 {
8151 cp_expr cast_expression;
8157 /* Consume the operator token. */
8161 /* Parse the cast-expression. */
8162 cast_expression
8167 pidk);
8169 /* Make a location:
8170 OP_TOKEN CAST_EXPRESSION
8171 ^~~~~~~~~~~~~~~~~~~~~~~~~
8172 with start==caret at the operator token, and
8173 extending to the end of the cast_expression. */
8176 /* Now, build an appropriate representation. */
8178 {
8182 RO_UNARY_STAR,
8183 complain);
8184 /* TODO: build_x_indirect_ref does not always honor the
8185 location, so ensure it is set. */
8191 /* Fall through. */
8194 cast_expression,
8195 complain);
8196 /* TODO: build_x_unary_op does not always honor the location,
8197 so ensure it is set. */
8205 /* Fall through. */
8207 /* Immediately fold negation of a constant, unless the constant is 0
8208 (since -0 == 0) or it would overflow. */
8213 {
8216 cast_expression);
8218 {
8221 }
8222 }
8223 /* Fall through. */
8232 }
8236 non_constant_p))
8240 }
8244 decltype_p,
8245 pidk);
8246 }
8248 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8249 unary-operator, the corresponding tree code is returned. */
8251 static enum tree_code
8253 {
8255 {
8276 }
8277 }
8279 /* Parse a new-expression.
8281 new-expression:
8282 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8283 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8285 Returns a representation of the expression. */
8287 static tree
8289 {
8292 tree type;
8295 tree ret;
8299 /* Look for the optional `::' operator. */
8300 global_scope_p
8304 /* Look for the `new' operator. */
8306 /* There's no easy way to tell a new-placement from the
8307 `( type-id )' construct. */
8309 /* Look for a new-placement. */
8311 /* If that didn't work out, there's no new-placement. */
8313 {
8317 }
8319 /* If the next token is a `(', then we have a parenthesized
8320 type-id. */
8322 {
8326 /* Consume the `('. */
8327 matching_parens parens;
8330 /* Parse the type-id. */
8331 parser->type_definition_forbidden_message
8333 {
8336 }
8339 /* Look for the closing `)'. */
8342 /* There should not be a direct-new-declarator in this production,
8343 but GCC used to allowed this, so we check and emit a sensible error
8344 message for this case. */
8346 {
8352 }
8353 }
8354 /* Otherwise, there must be a new-type-id. */
8355 else
8358 /* If the next token is a `(' or '{', then we have a new-initializer. */
8363 else
8366 /* A new-expression may not appear in an integral constant
8367 expression. */
8370 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8371 of a new-type-id or type-id of a new-expression, the new-expression shall
8372 contain a new-initializer of the form ( assignment-expression )".
8373 Additionally, consistently with the spirit of DR 1467, we want to accept
8374 'new auto { 2 }' too. */
8380 {
8382 "initialization of new-expression for type %<auto%> "
8385 }
8386 else
8387 {
8388 /* Construct a location e.g.:
8389 ptr = new int[100]
8390 ^~~~~~~~~~~~
8391 with caret == start at the start of the "new" token, and the end
8392 at the end of the final token we consumed. */
8397 /* Create a representation of the new-expression. */
8399 tf_warning_or_error);
8401 }
8409 }
8411 /* Parse a new-placement.
8413 new-placement:
8414 ( expression-list )
8416 Returns the same representation as for an expression-list. */
8420 {
8423 /* Parse the expression-list. */
8424 expression_list = (cp_parser_parenthesized_expression_list
8433 }
8435 /* Parse a new-type-id.
8437 new-type-id:
8438 type-specifier-seq new-declarator [opt]
8440 Returns the TYPE allocated. If the new-type-id indicates an array
8441 type, *NELTS is set to the number of elements in the last array
8442 bound; the TYPE will not include the last array bound. */
8444 static tree
8446 {
8447 cp_decl_specifier_seq type_specifier_seq;
8453 /* The type-specifier sequence must not contain type definitions.
8454 (It cannot contain declarations of new types either, but if they
8455 are not definitions we will catch that because they are not
8456 complete.) */
8458 parser->type_definition_forbidden_message
8460 /* Parse the type-specifier-seq. */
8464 /* Restore the old message. */
8470 /* Parse the new-declarator. */
8473 /* Determine the number of elements in the last array dimension, if
8474 any. */
8476 /* Skip down to the last array dimension. */
8481 {
8484 }
8489 {
8492 }
8495 {
8502 else
8504 }
8507 }
8509 /* Parse an (optional) new-declarator.
8511 new-declarator:
8512 ptr-operator new-declarator [opt]
8513 direct-new-declarator
8515 Returns the declarator. */
8519 {
8522 cp_cv_quals cv_quals;
8524 /* We don't know if there's a ptr-operator next, or not. */
8526 /* Look for a ptr-operator. */
8528 /* If that worked, look for more new-declarators. */
8530 {
8533 /* Parse another optional declarator. */
8536 declarator = cp_parser_make_indirect_declarator
8540 }
8542 /* If the next token is a `[', there is a direct-new-declarator. */
8547 }
8549 /* Parse a direct-new-declarator.
8551 direct-new-declarator:
8552 [ expression ]
8553 direct-new-declarator [constant-expression]
8555 */
8559 {
8563 {
8564 tree expression;
8567 /* Look for the opening `['. */
8572 /* The standard requires that the expression have integral
8573 type. DR 74 adds enumeration types. We believe that the
8574 real intent is that these expressions be handled like the
8575 expression in a `switch' condition, which also allows
8576 classes with a single conversion to integral or
8577 enumeration type. */
8579 {
8580 expression
8582 expression,
8585 {
8587 "expression in new-declarator must have integral "
8590 }
8591 }
8593 /* Look for the closing `]'. */
8596 /* Add this bound to the declarator. */
8599 /* If the next token is not a `[', then there are no more
8600 bounds. */
8603 }
8606 }
8608 /* Parse a new-initializer.
8610 new-initializer:
8611 ( expression-list [opt] )
8612 braced-init-list
8614 Returns a representation of the expression-list. */
8618 {
8622 {
8623 tree t;
8630 }
8631 else
8632 expression_list = (cp_parser_parenthesized_expression_list
8638 }
8640 /* Parse a delete-expression.
8642 delete-expression:
8643 :: [opt] delete cast-expression
8644 :: [opt] delete [ ] cast-expression
8646 Returns a representation of the expression. */
8648 static tree
8650 {
8653 tree expression;
8655 /* Look for the optional `::' operator. */
8656 global_scope_p
8660 /* Look for the `delete' keyword. */
8662 /* See if the array syntax is in use. */
8664 {
8665 /* Consume the `[' token. */
8667 /* Look for the `]' token. */
8669 /* Remember that this is the `[]' construct. */
8671 }
8672 else
8675 /* Parse the cast-expression. */
8678 /* A delete-expression may not appear in an integral constant
8679 expression. */
8684 tf_warning_or_error);
8685 }
8687 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8688 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8689 0 otherwise. */
8691 static int
8693 {
8696 {
8738 /* In ((type ()) () the last () isn't a valid cast-expression,
8739 so the whole must be parsed as postfix-expression. */
8744 /* '[' may start a primary-expression in obj-c++ and in C++11,
8745 as a lambda-expression, eg, '(void)[]{}'. */
8752 /* '++' and '--' may or may not start a cast-expression:
8754 struct T { void operator++(int); };
8755 void f() { (T())++; }
8757 vs
8759 int a;
8760 (int)++a; */
8765 }
8766 }
8768 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8769 in the order: const_cast, static_cast, reinterpret_cast.
8771 Don't suggest dynamic_cast.
8773 Return the first legal cast kind found, or NULL otherwise. */
8777 {
8778 tree trial;
8780 /* Reuse the parser logic by attempting to build the various kinds of
8781 cast, with "complain" disabled.
8782 Identify the first such cast that is valid. */
8784 /* Don't attempt to run such logic within template processing. */
8788 /* First try const_cast. */
8793 /* If that fails, try static_cast. */
8798 /* Finally, try reinterpret_cast. */
8803 /* No such cast possible. */
8805 }
8807 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8808 suggesting how to convert a C-style cast of the form:
8810 (DST_TYPE)ORIG_EXPR
8812 to a C++-style cast.
8814 The primary range of RICHLOC is asssumed to be that of the original
8815 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8816 of the parens in the C-style cast. */
8818 static void
8821 tree dst_type)
8822 {
8823 /* This function is non-trivial, so bail out now if the warning isn't
8824 going to be emitted. */
8828 /* Try to find a legal C++ cast, trying them in order:
8829 const_cast, static_cast, reinterpret_cast. */
8834 /* Replace the open paren with "CAST_SUGGESTION<". */
8835 pretty_printer pp;
8839 /* Replace the close paren with "> (". */
8842 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8844 }
8847 /* Parse a cast-expression.
8849 cast-expression:
8850 unary-expression
8851 ( type-id ) cast-expression
8853 ADDRESS_P is true iff the unary-expression is appearing as the
8854 operand of the `&' operator. CAST_P is true if this expression is
8855 the target of a cast.
8857 Returns a representation of the expression. */
8859 static cp_expr
8862 {
8863 /* If it's a `(', then we might be looking at a cast. */
8865 {
8871 /* There's no way to know yet whether or not this is a cast.
8872 For example, `(int (3))' is a unary-expression, while `(int)
8873 3' is a cast. So, we resort to parsing tentatively. */
8875 /* Types may not be defined in a cast. */
8877 parser->type_definition_forbidden_message
8879 /* Consume the `('. */
8880 matching_parens parens;
8885 /* A very tricky bit is that `(struct S) { 3 }' is a
8886 compound-literal (which we permit in C++ as an extension).
8887 But, that construct is not a cast-expression -- it is a
8888 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8889 is legal; if the compound-literal were a cast-expression,
8890 you'd need an extra set of parentheses.) But, if we parse
8891 the type-id, and it happens to be a class-specifier, then we
8892 will commit to the parse at that point, because we cannot
8893 undo the action that is done when creating a new class. So,
8894 then we cannot back up and do a postfix-expression.
8896 Another tricky case is the following (c++/29234):
8898 struct S { void operator () (); };
8900 void foo ()
8901 {
8902 ( S()() );
8903 }
8905 As a type-id we parse the parenthesized S()() as a function
8906 returning a function, groktypename complains and we cannot
8907 back up in this case either.
8909 Therefore, we scan ahead to the closing `)', and check to see
8910 if the tokens after the `)' can start a cast-expression. Otherwise
8911 we are dealing with an unary-expression, a postfix-expression
8912 or something else.
8914 Yet another tricky case, in C++11, is the following (c++/54891):
8916 (void)[]{};
8918 The issue is that usually, besides the case of lambda-expressions,
8919 the parenthesized type-id cannot be followed by '[', and, eg, we
8920 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8921 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8922 we don't commit, we try a cast-expression, then an unary-expression.
8924 Save tokens so that we can put them back. */
8927 /* We may be looking at a cast-expression. */
8930 cast_expression
8933 /* Roll back the tokens we skipped. */
8935 /* If we aren't looking at a cast-expression, simulate an error so
8936 that the call to cp_parser_error_occurred below returns true. */
8939 else
8940 {
8943 /* Look for the type-id. */
8945 /* Look for the closing `)'. */
8950 }
8952 /* Restore the saved message. */
8955 /* At this point this can only be either a cast or a
8956 parenthesized ctor such as `(T ())' that looks like a cast to
8957 function returning T. */
8959 {
8960 /* Only commit if the cast-expression doesn't start with
8961 '++', '--', or '[' in C++11. */
8969 pidk);
8972 {
8973 /* Warn about old-style casts, if so requested. */
8978 {
8984 }
8986 /* Only type conversions to integral or enumeration types
8987 can be used in constant-expressions. */
8990 NIC_CAST))
8993 /* Perform the cast. */
8994 /* Make a location:
8995 (TYPE) EXPR
8996 ^~~~~~~~~~~
8997 with start==caret at the open paren, extending to the
8998 end of "expr". */
9000 open_paren_loc,
9004 }
9005 }
9006 else
9008 }
9010 /* If we get here, then it's not a cast, so it must be a
9011 unary-expression. */
9014 }
9016 /* Parse a binary expression of the general form:
9018 pm-expression:
9019 cast-expression
9020 pm-expression .* cast-expression
9021 pm-expression ->* cast-expression
9023 multiplicative-expression:
9024 pm-expression
9025 multiplicative-expression * pm-expression
9026 multiplicative-expression / pm-expression
9027 multiplicative-expression % pm-expression
9029 additive-expression:
9030 multiplicative-expression
9031 additive-expression + multiplicative-expression
9032 additive-expression - multiplicative-expression
9034 shift-expression:
9035 additive-expression
9036 shift-expression << additive-expression
9037 shift-expression >> additive-expression
9039 relational-expression:
9040 shift-expression
9041 relational-expression < shift-expression
9042 relational-expression > shift-expression
9043 relational-expression <= shift-expression
9044 relational-expression >= shift-expression
9046 GNU Extension:
9048 relational-expression:
9049 relational-expression <? shift-expression
9050 relational-expression >? shift-expression
9052 equality-expression:
9053 relational-expression
9054 equality-expression == relational-expression
9055 equality-expression != relational-expression
9057 and-expression:
9058 equality-expression
9059 and-expression & equality-expression
9061 exclusive-or-expression:
9062 and-expression
9063 exclusive-or-expression ^ and-expression
9065 inclusive-or-expression:
9066 exclusive-or-expression
9067 inclusive-or-expression | exclusive-or-expression
9069 logical-and-expression:
9070 inclusive-or-expression
9071 logical-and-expression && inclusive-or-expression
9073 logical-or-expression:
9074 logical-and-expression
9075 logical-or-expression || logical-and-expression
9077 All these are implemented with a single function like:
9079 binary-expression:
9080 simple-cast-expression
9081 binary-expression <token> binary-expression
9083 CAST_P is true if this expression is the target of a cast.
9085 The binops_by_token map is used to get the tree codes for each <token> type.
9086 binary-expressions are associated according to a precedence table. */
9088 #define TOKEN_PRECEDENCE(token) \
9089 (((token->type == CPP_GREATER \
9090 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9091 && !parser->greater_than_is_operator_p) \
9092 ? PREC_NOT_OPERATOR \
9093 : binops_by_token[token->type].prec)
9095 static cp_expr
9101 {
9102 cp_parser_expression_stack stack;
9104 cp_parser_expression_stack_entry current;
9105 cp_expr rhs;
9109 tree overload;
9111 /* Parse the first expression. */
9122 {
9123 /* Get an operator token. */
9129 {
9131 "%<>>%> operator is treated"
9135 }
9140 /* This is a fold-expression; handle it later. */
9143 /* Popping an entry off the stack means we completed a subexpression:
9144 - either we found a token which is not an operator (`>' where it is not
9145 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9146 will happen repeatedly;
9147 - or, we found an operator which has lower priority. This is the case
9148 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9149 parsing `3 * 4'. */
9151 {
9154 else
9156 }
9158 get_rhs:
9162 /* We used the operator token. */
9165 /* For "false && x" or "true || x", x will never be executed;
9166 disable warnings while evaluating it. */
9168 c_inhibit_evaluation_warnings +=
9171 c_inhibit_evaluation_warnings +=
9174 /* Extract another operand. It may be the RHS of this expression
9175 or the LHS of a new, higher priority expression. */
9180 /* Get another operator token. Look up its precedence to avoid
9181 building a useless (immediately popped) stack entry for common
9182 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9189 {
9190 /* ... and prepare to parse the RHS of the new, higher priority
9191 expression. Since precedence levels on the stack are
9192 monotonically increasing, we do not have to care about
9193 stack overflows. */
9202 pop:
9204 /* If the stack is not empty, we have parsed into LHS the right side
9205 (`4' in the example above) of an expression we had suspended.
9206 We can use the information on the stack to recover the LHS (`3')
9207 from the stack together with the tree code (`MULT_EXPR'), and
9208 the precedence of the higher level subexpression
9209 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9210 which will be used to actually build the additive expression. */
9215 }
9217 /* Undo the disabling of warnings done above. */
9219 c_inhibit_evaluation_warnings -=
9222 c_inhibit_evaluation_warnings -=
9228 /* Avoid warning for !!x == y. */
9233 /* Avoid warning for !b == y where b is boolean. */
9237 /* Avoid warning for !!b == y where b is boolean. */
9250 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9251 ERROR_MARK for everything that is not a binary expression.
9252 This makes warn_about_parentheses miss some warnings that
9253 involve unary operators. For unary expressions we should
9254 pass the correct tree_code unless the unary expression was
9255 surrounded by parentheses.
9256 */
9263 == tcc_comparison
9266 else
9267 {
9272 /* TODO: build_x_binary_op doesn't always honor the location. */
9274 }
9277 /* If the binary operator required the use of an overloaded operator,
9278 then this expression cannot be an integral constant-expression.
9279 An overloaded operator can be used even if both operands are
9280 otherwise permissible in an integral constant-expression if at
9281 least one of the operands is of enumeration type. */
9285 NIC_OVERLOADED))
9287 }
9290 }
9292 static cp_expr
9297 {
9300 }
9302 /* Parse the `? expression : assignment-expression' part of a
9303 conditional-expression. The LOGICAL_OR_EXPR is the
9304 logical-or-expression that started the conditional-expression.
9305 Returns a representation of the entire conditional-expression.
9307 This routine is used by cp_parser_assignment_expression.
9309 ? expression : assignment-expression
9311 GNU Extensions:
9313 ? : assignment-expression */
9315 static tree
9317 {
9319 cp_expr assignment_expr;
9323 /* Consume the `?' token. */
9328 {
9331 /* Implicit true clause. */
9333 c_inhibit_evaluation_warnings +=
9336 }
9337 else
9338 {
9341 /* Parse the expression. */
9342 c_inhibit_evaluation_warnings +=
9345 c_inhibit_evaluation_warnings +=
9349 }
9351 /* The next token should be a `:'. */
9353 /* Parse the assignment-expression. */
9355 c_inhibit_evaluation_warnings -=
9358 /* Make a location:
9359 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9360 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9361 with the caret at the "?", ranging from the start of
9362 the logical_or_expr to the end of the assignment_expr. */
9367 /* Build the conditional-expression. */
9369 expr,
9370 assignment_expr,
9371 tf_warning_or_error);
9372 }
9374 /* Parse an assignment-expression.
9376 assignment-expression:
9377 conditional-expression
9378 logical-or-expression assignment-operator assignment_expression
9379 throw-expression
9381 CAST_P is true if this expression is the target of a cast.
9382 DECLTYPE_P is true if this expression is the operand of decltype.
9384 Returns a representation for the expression. */
9386 static cp_expr
9389 {
9390 cp_expr expr;
9392 /* If the next token is the `throw' keyword, then we're looking at
9393 a throw-expression. */
9396 /* Otherwise, it must be that we are looking at a
9397 logical-or-expression. */
9398 else
9399 {
9400 /* Parse the binary expressions (logical-or-expression). */
9402 decltype_p,
9404 /* If the next token is a `?' then we're actually looking at a
9405 conditional-expression. */
9408 else
9409 {
9412 /* If it's an assignment-operator, we're using the second
9413 production. */
9414 enum tree_code assignment_operator
9417 {
9420 /* Parse the right-hand side of the assignment. */
9427 /* An assignment may not appear in a
9428 constant-expression. */
9430 NIC_ASSIGNMENT))
9432 /* Build the assignment expression. Its default
9433 location:
9434 LHS = RHS
9435 ~~~~^~~~~
9436 is the location of the '=' token as the
9437 caret, ranging from the start of the lhs to the
9438 end of the rhs. */
9443 assignment_operator,
9444 rhs,
9446 /* TODO: build_x_modify_expr doesn't honor the location,
9447 so we must set it here. */
9449 }
9450 }
9451 }
9454 }
9456 /* Parse an (optional) assignment-operator.
9458 assignment-operator: one of
9459 = *= /= %= += -= >>= <<= &= ^= |=
9461 GNU Extension:
9463 assignment-operator: one of
9464 <?= >?=
9466 If the next token is an assignment operator, the corresponding tree
9467 code is returned, and the token is consumed. For example, for
9468 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9469 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9470 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9471 operator, ERROR_MARK is returned. */
9473 static enum tree_code
9475 {
9479 /* Peek at the next token. */
9483 {
9529 /* Nothing else is an assignment operator. */
9531 }
9533 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9538 /* If it was an assignment operator, consume it. */
9543 }
9545 /* Parse an expression.
9547 expression:
9548 assignment-expression
9549 expression , assignment-expression
9551 CAST_P is true if this expression is the target of a cast.
9552 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9553 except possibly parenthesized or on the RHS of a comma (N3276).
9555 Returns a representation of the expression. */
9557 static cp_expr
9560 {
9565 {
9566 cp_expr assignment_expression;
9568 /* Parse the next assignment-expression. */
9569 assignment_expression
9572 /* We don't create a temporary for a call that is the immediate operand
9573 of decltype or on the RHS of a comma. But when we see a comma, we
9574 need to create a temporary for a call on the LHS. */
9579 assignment_expression
9583 /* If this is the first assignment-expression, we can just
9584 save it away. */
9587 else
9588 {
9589 /* Create a location with caret at the comma, ranging
9590 from the start of the LHS to the end of the RHS. */
9595 assignment_expression,
9598 }
9599 /* If the next token is not a comma, or we're in a fold-expression, then
9600 we are done with the expression. */
9604 /* Consume the `,'. */
9607 /* A comma operator cannot appear in a constant-expression. */
9610 }
9613 }
9615 /* Parse a constant-expression.
9617 constant-expression:
9618 conditional-expression
9620 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9621 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9622 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9623 is false, NON_CONSTANT_P should be NULL. */
9625 static cp_expr
9629 {
9633 cp_expr expression;
9635 /* It might seem that we could simply parse the
9636 conditional-expression, and then check to see if it were
9637 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9638 one that the compiler can figure out is constant, possibly after
9639 doing some simplifications or optimizations. The standard has a
9640 precise definition of constant-expression, and we must honor
9641 that, even though it is somewhat more restrictive.
9643 For example:
9645 int i[(2, 3)];
9647 is not a legal declaration, because `(2, 3)' is not a
9648 constant-expression. The `,' operator is forbidden in a
9649 constant-expression. However, GCC's constant-folding machinery
9650 will fold this operation to an INTEGER_CST for `3'. */
9652 /* Save the old settings. */
9654 saved_allow_non_integral_constant_expression_p
9657 /* We are now parsing a constant-expression. */
9659 parser->allow_non_integral_constant_expression_p
9662 /* Although the grammar says "conditional-expression", we parse an
9663 "assignment-expression", which also permits "throw-expression"
9664 and the use of assignment operators. In the case that
9665 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9666 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9667 actually essential that we look for an assignment-expression.
9668 For example, cp_parser_initializer_clauses uses this function to
9669 determine whether a particular assignment-expression is in fact
9670 constant. */
9672 /* Restore the old settings. */
9673 parser->integral_constant_expression_p
9675 parser->allow_non_integral_constant_expression_p
9678 {
9679 /* Require an rvalue constant expression here; that's what our
9680 callers expect. Reference constant expressions are handled
9681 separately in e.g. cp_parser_template_argument. */
9690 }
9693 parser->non_integral_constant_expression_p
9697 }
9699 /* Parse __builtin_offsetof.
9701 offsetof-expression:
9702 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9704 offsetof-member-designator:
9705 id-expression
9706 | offsetof-member-designator "." id-expression
9707 | offsetof-member-designator "[" expression "]"
9708 | offsetof-member-designator "->" id-expression */
9710 static cp_expr
9712 {
9714 tree type;
9715 cp_expr expr;
9716 cp_id_kind dummy;
9718 location_t finish_loc;
9720 /* We're about to accept non-integral-constant things, but will
9721 definitely yield an integral constant expression. Save and
9722 restore these values around our local parsing. */
9728 /* Consume the "__builtin_offsetof" token. */
9730 /* Consume the opening `('. */
9731 matching_parens parens;
9733 /* Parse the type-id. */
9736 /* Look for the `,'. */
9740 /* Build the (type *)null that begins the traditional offsetof macro. */
9741 tree object_ptr
9743 tf_warning_or_error);
9745 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9749 {
9752 {
9754 /* offsetof-member-designator "[" expression "]" */
9760 /* offsetof-member-designator "->" identifier */
9763 /* FALLTHRU */
9766 /* offsetof-member-designator "." identifier */
9774 /* Consume the ")" token. */
9780 /* Error. We know the following require will fail, but
9781 that gives the proper error message. */
9786 }
9787 }
9789 success:
9790 /* Make a location of the form:
9791 __builtin_offsetof (struct s, f)
9792 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9793 with caret at the type-id, ranging from the start of the
9794 "_builtin_offsetof" token to the close paren. */
9796 /* The result will be an INTEGER_CST, so we need to explicitly
9797 preserve the location. */
9800 failure:
9805 }
9807 /* Parse a trait expression.
9809 Returns a representation of the expression, the underlying type
9810 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9812 static tree
9814 {
9815 cp_trait_kind kind;
9821 {
9923 }
9925 /* Consume the token. */
9928 matching_parens parens;
9931 {
9934 }
9940 {
9943 {
9946 }
9950 }
9952 {
9954 {
9958 {
9961 }
9965 }
9966 }
9970 /* Complete the trait expression, which may mean either processing
9971 the trait expr now or saving it for template instantiation. */
9973 {
9982 }
9983 }
9985 /* Lambdas that appear in variable initializer or default argument scope
9986 get that in their mangling, so we need to record it. We might as well
9987 use the count for function and namespace scopes as well. */
9991 {
9992 tree t;
9994 };
9997 static void
9999 {
10000 tree_int ti;
10002 /* Once we're inside a function, we ignore other scopes and just push
10003 the function again so that popping works properly. */
10010 {
10011 /* Don't reset the count if we're still in the same function. */
10014 }
10015 }
10017 static void
10019 {
10022 }
10024 static void
10026 {
10029 {
10032 }
10034 }
10036 /* Parse a lambda expression.
10038 lambda-expression:
10039 lambda-introducer lambda-declarator [opt] compound-statement
10041 Returns a representation of the expression. */
10043 static cp_expr
10045 {
10047 tree type;
10055 {
10057 {
10061 }
10063 }
10065 {
10067 {
10070 }
10072 }
10074 /* We may be in the middle of deferred access check. Disable
10075 it now. */
10086 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10089 /* Now that we've started the type, add the capture fields for any
10090 explicit captures. */
10093 {
10094 /* Inside the class, surrounding template-parameter-lists do not apply. */
10095 unsigned int saved_num_template_parameter_lists
10099 bool fully_implicit_function_template_p
10103 bool auto_is_implicit_function_template_parm_p
10114 /* By virtue of defining a local class, a lambda expression has access to
10115 the private variables of enclosing classes. */
10123 {
10128 }
10130 {
10133 }
10135 /* The capture list was built up in reverse order; fix that now. */
10147 parser->fully_implicit_function_template_p
10151 parser->auto_is_implicit_function_template_parm_p
10153 }
10155 /* This field is only used during parsing of the lambda. */
10158 /* This lambda shouldn't have any proxies left at this point. */
10160 /* And now that we're done, push proxies for an enclosing lambda. */
10165 else
10173 }
10175 /* Parse the beginning of a lambda expression.
10177 lambda-introducer:
10178 [ lambda-capture [opt] ]
10180 LAMBDA_EXPR is the current representation of the lambda expression. */
10182 static void
10184 {
10185 /* Need commas after the first capture. */
10188 /* Eat the leading `['. */
10191 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10199 {
10202 }
10205 {
10207 tree capture_id;
10208 tree capture_init_expr;
10212 enum capture_kind_type
10213 {
10214 BY_COPY,
10215 BY_REFERENCE
10216 };
10220 {
10223 }
10227 else
10230 /* Possibly capture `this'. */
10232 {
10242 explicit_init_p);
10244 }
10246 /* Possibly capture `*this'. */
10249 {
10260 explicit_init_p);
10262 }
10264 /* Remember whether we want to capture as a reference or not. */
10266 {
10269 }
10271 /* Get the identifier. */
10276 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10277 delimiters, but I modified this to stop on unnested ']' as well. It
10278 was already changed to stop on unnested '}', so the
10279 "closing_parenthesis" name is no more misleading with my change. */
10280 {
10286 }
10288 /* Find the initializer for this capture. */
10292 {
10294 /* An explicit initializer exists. */
10297 "lambda capture initializers "
10303 {
10306 }
10307 }
10308 else
10309 {
10312 /* Turn the identifier into an id-expression. */
10313 capture_init_expr
10318 {
10321 }
10325 {
10328 capture_init_expr);
10332 }
10335 {
10338 capture_init_expr))
10342 }
10344 capture_init_expr
10345 = finish_id_expression
10347 capture_init_expr,
10361 {
10364 }
10365 else
10367 }
10371 {
10376 capture_id);
10380 "capture of %qD redundant with by-reference capture "
10382 }
10385 capture_id,
10386 capture_init_expr,
10388 explicit_init_p);
10389 }
10392 }
10394 /* Parse the (optional) middle of a lambda expression.
10396 lambda-declarator:
10397 < template-parameter-list [opt] >
10398 ( parameter-declaration-clause [opt] )
10399 attribute-specifier [opt]
10400 decl-specifier-seq [opt]
10401 exception-specification [opt]
10402 lambda-return-type-clause [opt]
10404 LAMBDA_EXPR is the current representation of the lambda expression. */
10406 static bool
10408 {
10409 /* 5.1.1.4 of the standard says:
10410 If a lambda-expression does not include a lambda-declarator, it is as if
10411 the lambda-declarator were ().
10412 This means an empty parameter list, no attributes, and no exception
10413 specification. */
10419 cp_decl_specifier_seq lambda_specs;
10422 /* The template-parameter-list is optional, but must begin with
10423 an opening angle if present. */
10425 {
10428 "lambda templates are only available with "
10430 else
10440 /* We just processed one more parameter list. */
10442 }
10444 /* The parameter-declaration-clause is optional (unless
10445 template-parameter-list was given), but must begin with an
10446 opening parenthesis if present. */
10448 {
10449 matching_parens parens;
10454 /* Parse parameters. */
10457 /* Default arguments shall not be specified in the
10458 parameter-declaration-clause of a lambda-declarator. */
10469 /* In the decl-specifier-seq of the lambda-declarator, each
10470 decl-specifier shall either be mutable or constexpr. */
10474 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10477 {
10482 }
10486 /* Parse optional exception specification. */
10489 /* Parse optional trailing return type. */
10491 {
10495 }
10497 /* The function parameters must be in scope all the way until after the
10498 trailing-return-type in case of decltype. */
10500 }
10504 /* Create the function call operator.
10506 Messing with declarators like this is no uglier than building up the
10507 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10508 other code. */
10509 {
10510 cp_decl_specifier_seq return_type_specs;
10512 tree fco;
10519 else
10520 /* Maybe we will deduce the return type later. */
10524 {
10528 else
10531 }
10536 sfk_none);
10541 VIRT_SPEC_UNSPECIFIED,
10542 REF_QUAL_NONE,
10543 tx_qual,
10544 exception_spec,
10550 declarator,
10551 attributes);
10553 {
10556 /* Give the object parameter a different name. */
10560 }
10562 {
10566 }
10575 }
10576 }
10578 /* Parse the body of a lambda expression, which is simply
10580 compound-statement
10582 but which requires special handling.
10583 LAMBDA_EXPR is the current representation of the lambda expression. */
10585 static void
10587 {
10592 else
10593 /* Still increment function_depth so that we don't GC in the
10594 middle of an expression. */
10598 /* Clear this in case we're in the middle of a default argument. */
10601 /* Finish the function call operator
10602 - class_specifier
10603 + late_parsing_for_member
10604 + function_definition_after_declarator
10605 + ctor_initializer_opt_and_function_body */
10606 {
10608 tree body;
10610 tree compound_stmt;
10611 tree cap;
10613 /* Let the front end know that we are going to be defining this
10614 function. */
10616 NULL_TREE,
10622 matching_braces braces;
10626 /* Push the proxies for any explicit captures. */
10633 /* 5.1.1.4 of the standard says:
10634 If a lambda-expression does not include a trailing-return-type, it
10635 is as if the trailing-return-type denotes the following type:
10636 * if the compound-statement is of the form
10637 { return attribute-specifier [opt] expression ; }
10638 the type of the returned expression after lvalue-to-rvalue
10639 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10640 (_conv.array_ 4.2), and function-to-pointer conversion
10641 (_conv.func_ 4.3);
10642 * otherwise, void. */
10644 /* In a lambda that has neither a lambda-return-type-clause
10645 nor a deducible form, errors should be reported for return statements
10646 in the body. Since we used void as the placeholder return type, parsing
10647 the body as usual will give such desired behavior. */
10651 {
10655 /* Parse tentatively in case there's more after the initial return
10656 statement. */
10667 {
10669 {
10674 }
10676 /* Will get error here if type not deduced yet. */
10680 }
10681 }
10684 {
10689 }
10693 out:
10697 /* Finish the function and generate code for it if necessary. */
10700 /* Only expand if the call op is not a template. */
10703 }
10709 else
10711 }
10713 /* Statements [gram.stmt.stmt] */
10715 /* Parse a statement.
10717 statement:
10718 labeled-statement
10719 expression-statement
10720 compound-statement
10721 selection-statement
10722 iteration-statement
10723 jump-statement
10724 declaration-statement
10725 try-block
10727 C++11:
10729 statement:
10730 labeled-statement
10731 attribute-specifier-seq (opt) expression-statement
10732 attribute-specifier-seq (opt) compound-statement
10733 attribute-specifier-seq (opt) selection-statement
10734 attribute-specifier-seq (opt) iteration-statement
10735 attribute-specifier-seq (opt) jump-statement
10736 declaration-statement
10737 attribute-specifier-seq (opt) try-block
10739 init-statement:
10740 expression-statement
10741 simple-declaration
10743 TM Extension:
10745 statement:
10746 atomic-statement
10748 IN_COMPOUND is true when the statement is nested inside a
10749 cp_parser_compound_statement; this matters for certain pragmas.
10751 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10752 is a (possibly labeled) if statement which is not enclosed in braces
10753 and has an else clause. This is used to implement -Wparentheses.
10755 CHAIN is a vector of if-else-if conditions. */
10757 static void
10761 {
10766 restart:
10769 /* There is no statement yet. */
10775 /* In obj-c++, seeing '[[' might be the either the beginning of
10776 c++11 attributes, or a nested objc-message-expression. So
10777 let's parse the c++11 attributes tentatively. */
10781 {
10784 }
10786 /* Peek at the next token. */
10788 /* Remember the location of the first token in the statement. */
10790 /* If this is a keyword, then that will often determine what kind of
10791 statement we have. */
10793 {
10797 {
10800 /* Looks like a labeled-statement with a case label.
10801 Parse the label, and then use tail recursion to parse
10802 the statement. */
10820 {
10825 }
10826 else
10840 {
10845 }
10846 else
10847 {
10851 }
10855 /* Objective-C++ exception-handling constructs. */
10869 /* This must be a namespace alias definition. */
10885 /* It might be a keyword like `int' that can start a
10886 declaration-statement. */
10888 }
10889 }
10891 {
10892 /* If the next token is a `:', then we are looking at a
10893 labeled-statement. */
10896 {
10897 /* Looks like a labeled-statement with an ordinary label.
10898 Parse the label, and then use tail recursion to parse
10899 the statement. */
10904 }
10905 }
10906 /* Anything that starts with a `{' must be a compound-statement. */
10909 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10910 a statement all its own. */
10912 {
10913 /* Only certain OpenMP pragmas are attached to statements, and thus
10914 are considered statements themselves. All others are not. In
10915 the context of a compound, accept the pragma as a "statement" and
10916 return so that we can check for a close brace. Otherwise we
10917 require a real statement and must go back and read one. */
10923 }
10925 {
10928 }
10930 /* Everything else must be a declaration-statement or an
10931 expression-statement. Try for the declaration-statement
10932 first, unless we are looking at a `;', in which case we know that
10933 we have an expression-statement. */
10935 {
10937 {
10939 {
10940 /* Attributes should be parsed as part of the the
10941 declaration, so let's un-parse them. */
10944 }
10947 /* Try to parse the declaration-statement. */
10949 /* If that worked, we're done. */
10952 }
10953 /* All preceding labels have been parsed at this point. */
10957 /* Look for an expression-statement instead. */
10960 /* Handle [[fallthrough]];. */
10962 {
10963 /* The next token after the fallthrough attribute is ';'. */
10965 {
10966 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10968 IFN_FALLTHROUGH,
10971 }
10972 else
10976 }
10977 }
10979 /* Set the line number for the statement. */
10983 /* Allow "[[fallthrough]];", but warn otherwise. */
10986 OPT_Wattributes,
10988 }
10990 /* Parse the label for a labeled-statement, i.e.
10992 identifier :
10993 case constant-expression :
10994 default :
10996 GNU Extension:
10997 case constant-expression ... constant-expression : statement
10999 When a label is parsed without errors, the label is added to the
11000 parse tree by the finish_* functions, so this function doesn't
11001 have to return the label. */
11003 static void
11005 {
11010 /* The next token should be an identifier. */
11014 {
11017 }
11019 /* Remember whether this case or a user-defined label is allowed to fall
11020 through to. */
11025 {
11027 {
11031 /* Consume the `case' token. */
11033 /* Parse the constant-expression. */
11040 {
11041 /* Consume the `...' token. */
11047 /* We don't need to emit warnings here, as the common code
11048 will do this for us. */
11049 }
11050 else
11054 {
11058 }
11059 else
11062 expr);
11063 }
11067 /* Consume the `default' token. */
11071 {
11075 }
11076 else
11081 /* Anything else must be an ordinary label. */
11086 }
11088 /* Require the `:' token. */
11091 /* An ordinary label may optionally be followed by attributes.
11092 However, this is only permitted if the attributes are then
11093 followed by a semicolon. This is because, for backward
11094 compatibility, when parsing
11095 lab: __attribute__ ((unused)) int i;
11096 we want the attribute to attach to "i", not "lab". */
11099 {
11100 tree attrs;
11107 ;
11108 else
11110 }
11116 }
11118 /* Parse an expression-statement.
11120 expression-statement:
11121 expression [opt] ;
11123 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11124 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11125 indicates whether this expression-statement is part of an
11126 expression statement. */
11128 static tree
11130 {
11135 /* There might be attribute fallthrough. */
11138 /* If the next token is a ';', then there is no expression
11139 statement. */
11141 {
11145 {
11148 }
11149 }
11151 /* Handle [[fallthrough]];. */
11153 {
11154 /* The next token after the fallthrough attribute is ';'. */
11156 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11159 else
11163 }
11165 /* Allow "[[fallthrough]];", but warn otherwise. */
11170 /* Give a helpful message for "A<T>::type t;" and the like. */
11173 {
11180 {
11181 /* A::A a; */
11186 }
11187 }
11189 /* Consume the final `;'. */
11194 /* This is the final expression statement of a statement
11195 expression. */
11201 }
11203 /* Parse a compound-statement.
11205 compound-statement:
11206 { statement-seq [opt] }
11208 GNU extension:
11210 compound-statement:
11211 { label-declaration-seq [opt] statement-seq [opt] }
11213 label-declaration-seq:
11214 label-declaration
11215 label-declaration-seq label-declaration
11217 Returns a tree representing the statement. */
11219 static tree
11222 {
11223 tree compound_stmt;
11224 matching_braces braces;
11226 /* Consume the `{'. */
11233 /* Begin the compound-statement. */
11235 /* If the next keyword is `__label__' we have a label declaration. */
11238 /* Parse an (optional) statement-seq. */
11240 /* Finish the compound-statement. */
11242 /* Consume the `}'. */
11246 }
11248 /* Parse an (optional) statement-seq.
11250 statement-seq:
11251 statement
11252 statement-seq [opt] statement */
11254 static void
11256 {
11257 /* Scan statements until there aren't any more. */
11259 {
11262 /* If we are looking at a `}', then we have run out of
11263 statements; the same is true if we have reached the end
11264 of file, or have stumbled upon a stray '@end'. */
11271 /* If we are in a compound statement and find 'else' then
11272 something went wrong. */
11274 {
11277 else
11278 {
11281 }
11282 }
11284 /* Parse the statement. */
11286 }
11287 }
11289 /* Return true if we're looking at (init; cond), false otherwise. */
11291 static bool
11293 {
11294 /* Save tokens so that we can put them back. */
11297 /* Look for ';' that is not nested in () or {}. */
11300 CPP_SEMICOLON,
11303 /* Roll back the tokens we skipped. */
11307 }
11309 /* Parse a selection-statement.
11311 selection-statement:
11312 if ( init-statement [opt] condition ) statement
11313 if ( init-statement [opt] condition ) statement else statement
11314 switch ( init-statement [opt] condition ) statement
11316 Returns the new IF_STMT or SWITCH_STMT.
11318 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11319 is a (possibly labeled) if statement which is not enclosed in
11320 braces and has an else clause. This is used to implement
11321 -Wparentheses.
11323 CHAIN is a vector of if-else-if conditions. This is used to implement
11324 -Wduplicated-cond. */
11326 static tree
11329 {
11332 token_indent_info guard_tinfo;
11337 /* Peek at the next token. */
11341 /* See what kind of keyword it is. */
11344 {
11347 {
11348 tree statement;
11349 tree condition;
11354 RID_CONSTEXPR))
11355 {
11361 }
11363 /* Look for the `('. */
11364 matching_parens parens;
11366 {
11369 }
11371 /* Begin the selection-statement. */
11373 {
11376 }
11377 else
11380 /* Parse the optional init-statement. */
11382 {
11383 tree decl;
11386 "init-statement in selection statements only available "
11389 }
11391 /* Parse the condition. */
11393 /* Look for the `)'. */
11399 {
11403 /* Add the condition. */
11410 /* Parse the then-clause. */
11414 /* Outside a template, the non-selected branch of a constexpr
11415 if is a 'discarded statement', i.e. unevaluated. */
11420 {
11423 }
11426 guard_tinfo);
11433 {
11437 }
11439 /* If the next token is `else', parse the else-clause. */
11441 RID_ELSE))
11442 {
11446 {
11449 }
11451 guard_tinfo
11453 /* Consume the `else' keyword. */
11456 {
11458 RID_IF)
11460 {
11461 /* We've got "if (COND) else if (COND2)". Start
11462 the condition chain and add COND as the first
11463 element. */
11467 {
11468 /* Wrap it in a NOP_EXPR so that we can set the
11469 location of the condition. */
11471 condition);
11474 }
11475 }
11477 RID_IF))
11478 {
11479 /* This is if-else without subsequent if. Zap the
11480 condition chain; we would have already warned at
11481 this point. */
11484 }
11485 }
11487 /* Parse the else-clause. */
11493 /* If we are currently parsing a then-clause, then
11494 IF_P will not be NULL. We set it to true to
11495 indicate that this if statement has an else clause.
11496 This may trigger the Wparentheses warning below
11497 when we get back up to the parent if statement. */
11502 {
11506 }
11507 }
11508 else
11509 {
11510 /* This if statement does not have an else clause. If
11511 NESTED_IF is true, then the then-clause has an if
11512 statement which does have an else clause. We warn
11513 about the potential ambiguity. */
11516 "suggest explicit braces to avoid ambiguous"
11519 {
11520 /* We don't need the condition chain anymore. */
11523 }
11524 }
11526 /* Now we're all done with the if-statement. */
11528 }
11529 else
11530 {
11534 /* Add the condition. */
11537 /* Parse the body of the switch-statement. */
11543 guard_tinfo);
11547 /* Now we're all done with the switch-statement. */
11549 }
11552 }
11558 }
11559 }
11561 /* Parse a condition.
11563 condition:
11564 expression
11565 type-specifier-seq declarator = initializer-clause
11566 type-specifier-seq declarator braced-init-list
11568 GNU Extension:
11570 condition:
11571 type-specifier-seq declarator asm-specification [opt]
11572 attributes [opt] = assignment-expression
11574 Returns the expression that should be tested. */
11576 static tree
11578 {
11579 cp_decl_specifier_seq type_specifiers;
11583 /* Try the declaration first. */
11585 /* New types are not allowed in the type-specifier-seq for a
11586 condition. */
11588 parser->type_definition_forbidden_message
11590 /* Parse the type-specifier-seq. */
11592 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11595 /* Restore the saved message. */
11597 /* If all is well, we might be looking at a declaration. */
11599 {
11600 tree decl;
11601 tree asm_specification;
11602 tree attributes;
11606 /* Parse the declarator. */
11612 /* Parse the attributes. */
11614 /* Parse the asm-specification. */
11616 /* If the next token is not an `=' or '{', then we might still be
11617 looking at an expression. For example:
11619 if (A(a).x)
11621 looks like a decl-specifier-seq and a declarator -- but then
11622 there is no `=', so this is an expression. */
11627 /* If we did see an `=' or '{', then we are looking at a declaration
11628 for sure. */
11630 {
11631 tree pushed_scope;
11635 /* Create the declaration. */
11641 /* Parse the initializer. */
11643 {
11647 }
11648 else
11649 {
11650 /* Consume the `='. */
11653 }
11657 /* Process the initializer. */
11660 asm_specification,
11661 flags);
11667 }
11668 }
11669 /* If we didn't even get past the declarator successfully, we are
11670 definitely not looking at a declaration. */
11671 else
11674 /* Otherwise, we are looking at an expression. */
11676 }
11678 /* Parses a for-statement or range-for-statement until the closing ')',
11679 not included. */
11681 static tree
11683 {
11687 /* Begin the for-statement. */
11690 /* Parse the initialization. */
11695 else
11697 }
11699 static tree
11701 {
11702 /* Normal for loop */
11705 tree stmt;
11708 /* The init-statement has already been parsed in
11709 cp_parser_init_statement, so no work is needed here. */
11712 /* If there's a condition, process it. */
11716 {
11720 }
11722 /* Look for the `;'. */
11725 /* If there's an expression, process it. */
11731 }
11733 /* Tries to parse a range-based for-statement:
11735 range-based-for:
11736 decl-specifier-seq declarator : expression
11738 The decl-specifier-seq declarator and the `:' are already parsed by
11739 cp_parser_init_statement. If processing_template_decl it returns a
11740 newly created RANGE_FOR_STMT; if not, it is converted to a
11741 regular FOR_STMT. */
11743 static tree
11746 {
11753 /* Get the range declaration momentarily out of the way so that
11754 the range expression doesn't clash with it. */
11756 {
11758 {
11760 /* For decomposition declaration get all of the corresponding
11761 declarations out of the way. */
11765 {
11771 {
11777 }
11778 }
11779 }
11781 {
11786 }
11787 }
11790 {
11793 }
11794 else
11797 /* Put the range declaration(s) back into scope. */
11799 {
11803 }
11805 /* If in template, STMT is converted to a normal for-statement
11806 at instantiation. If not, it is done just ahead. */
11808 {
11816 /* do_auto_deduction doesn't mess with template init-lists. */
11819 }
11820 else
11821 {
11825 }
11827 }
11829 /* Subroutine of cp_convert_range_for: given the initializer expression,
11830 builds up the range temporary. */
11832 static tree
11834 {
11837 /* Find out the type deduced by the declaration
11838 `auto &&__range = range_expr'. */
11843 /* Create the __range variable. */
11850 }
11852 /* Used by cp_parser_range_for in template context: we aren't going to
11853 do a full conversion yet, but we still need to resolve auto in the
11854 type of the for-range-declaration if present. This is basically
11855 a shortcut version of cp_convert_range_for. */
11857 static void
11859 {
11862 {
11865 iter_type = (cp_parser_perform_range_for_lookup
11868 {
11870 iter_type);
11872 tf_warning_or_error);
11875 }
11876 }
11877 }
11879 /* Converts a range-based for-statement into a normal
11880 for-statement, as per the definition.
11882 for (RANGE_DECL : RANGE_EXPR)
11883 BLOCK
11885 should be equivalent to:
11887 {
11888 auto &&__range = RANGE_EXPR;
11889 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11890 __begin != __end;
11891 ++__begin)
11892 {
11893 RANGE_DECL = *__begin;
11894 BLOCK
11895 }
11896 }
11898 If RANGE_EXPR is an array:
11899 BEGIN_EXPR = __range
11900 END_EXPR = __range + ARRAY_SIZE(__range)
11901 Else if RANGE_EXPR has a member 'begin' or 'end':
11902 BEGIN_EXPR = __range.begin()
11903 END_EXPR = __range.end()
11904 Else:
11905 BEGIN_EXPR = begin(__range)
11906 END_EXPR = end(__range);
11908 If __range has a member 'begin' but not 'end', or vice versa, we must
11909 still use the second alternative (it will surely fail, however).
11910 When calling begin()/end() in the third alternative we must use
11911 argument dependent lookup, but always considering 'std' as an associated
11912 namespace. */
11914 tree
11918 {
11924 /* If an error happened previously do nothing or else a lot of
11925 unhelpful errors would be issued. */
11927 else
11928 {
11929 tree range_temp;
11933 /* Can't bind a reference to an array of runtime bound. */
11935 else
11936 {
11941 LOOKUP_ONLYCONVERTING);
11943 }
11946 }
11948 /* The new for initialization statement. */
11956 LOOKUP_ONLYCONVERTING);
11967 LOOKUP_ONLYCONVERTING);
11971 /* The new for condition. */
11978 /* The new increment expression. */
11981 tf_warning_or_error);
11984 /* The declaration is initialized with *__begin inside the loop body. */
11987 tf_warning_or_error),
11989 LOOKUP_ONLYCONVERTING);
11994 }
11996 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11997 We need to solve both at the same time because the method used
11998 depends on the existence of members begin or end.
11999 Returns the type deduced for the iterator expression. */
12001 static tree
12003 {
12005 {
12008 }
12011 {
12016 }
12018 {
12019 /* If RANGE is an array, we will use pointer arithmetic. */
12022 range,
12026 }
12027 else
12028 {
12029 /* If it is not an array, we must do a bit of magic. */
12039 tf_warning_or_error);
12042 tf_warning_or_error);
12045 {
12046 /* Use the member functions. */
12049 else
12055 else
12058 }
12059 else
12060 {
12061 /* Use global functions with ADL. */
12068 tf_warning_or_error);
12070 tf_warning_or_error);
12072 tf_warning_or_error);
12074 tf_warning_or_error);
12077 }
12079 /* Last common checks. */
12081 {
12082 /* If one of the expressions is an error do no more checks. */
12085 }
12088 /* Can happen, when, eg, in a template context, Koenig lookup
12089 can't resolve begin/end (c++/58503). */
12091 else
12092 {
12094 /* The unqualified type of the __begin and __end temporaries should
12095 be the same, as required by the multiple auto declaration. */
12097 {
12104 /* P0184R0 allows __begin and __end to have different types,
12105 but make sure they are comparable so we can give a better
12107 else
12111 }
12113 }
12114 }
12115 }
12117 /* Helper function for cp_parser_perform_range_for_lookup.
12118 Builds a tree for RANGE.IDENTIFIER(). */
12120 static tree
12122 {
12135 tf_warning_or_error);
12138 }
12140 /* Parse an iteration-statement.
12142 iteration-statement:
12143 while ( condition ) statement
12144 do statement while ( expression ) ;
12145 for ( init-statement condition [opt] ; expression [opt] )
12146 statement
12148 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12150 static tree
12152 {
12155 tree statement;
12157 token_indent_info guard_tinfo;
12159 /* Peek at the next token. */
12166 /* Remember whether or not we are already within an iteration
12167 statement. */
12170 /* See what kind of keyword it is. */
12173 {
12175 {
12176 tree condition;
12178 /* Begin the while-statement. */
12180 /* Look for the `('. */
12181 matching_parens parens;
12183 /* Parse the condition. */
12186 /* Look for the `)'. */
12188 /* Parse the dependent statement. */
12192 /* We're done with the while-statement. */
12194 }
12198 {
12199 tree expression;
12201 /* Begin the do-statement. */
12203 /* Parse the body of the do-statement. */
12208 /* Look for the `while' keyword. */
12210 /* Look for the `('. */
12211 matching_parens parens;
12213 /* Parse the expression. */
12215 /* We're done with the do-statement. */
12217 /* Look for the `)'. */
12219 /* Look for the `;'. */
12221 }
12225 {
12226 /* Look for the `('. */
12227 matching_parens parens;
12232 /* Look for the `)'. */
12235 /* Parse the body of the for-statement. */
12240 /* We're done with the for-statement. */
12242 }
12249 }
12252 }
12254 /* Parse a init-statement or the declarator of a range-based-for.
12255 Returns true if a range-based-for declaration is seen.
12257 init-statement:
12258 expression-statement
12259 simple-declaration */
12261 static bool
12263 {
12264 /* If the next token is a `;', then we have an empty
12265 expression-statement. Grammatically, this is also a
12266 simple-declaration, but an invalid one, because it does not
12267 declare anything. Therefore, if we did not handle this case
12268 specially, we would issue an error message about an invalid
12269 declaration. */
12271 {
12275 /* A colon is used in range-based for. */
12278 /* We're going to speculatively look for a declaration, falling back
12279 to an expression, if necessary. */
12281 /* Parse the declaration. */
12284 decl);
12287 {
12288 /* It is a range-for, consume the ':' */
12292 {
12294 "range-based %<for%> loops only available with "
12297 }
12298 }
12299 else
12300 /* The ';' is not consumed yet because we told
12301 cp_parser_simple_declaration not to. */
12306 /* If the tentative parse failed, then we shall need to look for an
12307 expression-statement. */
12308 }
12309 /* If we are here, it is an expression-statement. */
12312 }
12314 /* Parse a jump-statement.
12316 jump-statement:
12317 break ;
12318 continue ;
12319 return expression [opt] ;
12320 return braced-init-list ;
12321 goto identifier ;
12323 GNU extension:
12325 jump-statement:
12326 goto * expression ;
12328 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12330 static tree
12332 {
12338 /* Peek at the next token. */
12343 /* See what kind of keyword it is. */
12346 {
12350 {
12370 }
12376 {
12383 /* Fall through. */
12393 }
12398 {
12399 tree expr;
12403 {
12407 }
12410 else
12411 /* If the next token is a `;', then there is no
12412 expression. */
12414 /* Build the return-statement. */
12417 else
12419 /* Look for the final `;'. */
12421 }
12427 {
12430 }
12432 /* Create the goto-statement. */
12434 {
12435 /* Issue a warning about this use of a GNU extension. */
12437 /* Consume the '*' token. */
12439 /* Parse the dependent expression. */
12441 }
12442 else
12444 /* Look for the final `;'. */
12451 }
12454 }
12456 /* Parse a declaration-statement.
12458 declaration-statement:
12459 block-declaration */
12461 static void
12463 {
12466 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12469 /* Parse the block-declaration. */
12472 /* Free any declarators allocated. */
12474 }
12476 /* Some dependent statements (like `if (cond) statement'), are
12477 implicitly in their own scope. In other words, if the statement is
12478 a single statement (as opposed to a compound-statement), it is
12479 none-the-less treated as if it were enclosed in braces. Any
12480 declarations appearing in the dependent statement are out of scope
12481 after control passes that point. This function parses a statement,
12482 but ensures that is in its own scope, even if it is not a
12483 compound-statement.
12485 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12486 is a (possibly labeled) if statement which is not enclosed in
12487 braces and has an else clause. This is used to implement
12488 -Wparentheses.
12490 CHAIN is a vector of if-else-if conditions. This is used to implement
12491 -Wduplicated-cond.
12493 Returns the new statement. */
12495 static tree
12499 {
12500 tree statement;
12503 token_indent_info body_tinfo
12509 /* Mark if () ; with a special NOP_EXPR. */
12511 {
12522 }
12523 /* if a compound is opened, we simply parse the statement directly. */
12526 /* If the token is not a `{', then we must take special action. */
12527 else
12528 {
12529 /* Create a compound-statement. */
12531 /* Parse the dependent-statement. */
12534 /* Finish the dummy compound-statement. */
12536 }
12538 token_indent_info next_tinfo
12547 /* Return the statement. */
12549 }
12551 /* For some dependent statements (like `while (cond) statement'), we
12552 have already created a scope. Therefore, even if the dependent
12553 statement is a compound-statement, we do not want to create another
12554 scope. */
12556 static void
12559 {
12560 /* If the token is a `{', then we must take special action. */
12562 {
12563 token_indent_info body_tinfo
12569 token_indent_info next_tinfo
12578 }
12579 else
12580 {
12581 /* Avoid calling cp_parser_compound_statement, so that we
12582 don't create a new scope. Do everything else by hand. */
12583 matching_braces braces;
12585 /* If the next keyword is `__label__' we have a label declaration. */
12588 /* Parse an (optional) statement-seq. */
12591 }
12592 }
12594 /* Declarations [gram.dcl.dcl] */
12596 /* Parse an optional declaration-sequence.
12598 declaration-seq:
12599 declaration
12600 declaration-seq declaration */
12602 static void
12604 {
12606 {
12617 {
12618 /* A declaration consisting of a single semicolon is
12619 invalid. Allow it unless we're being pedantic. */
12624 }
12626 /* If we're entering or exiting a region that's implicitly
12627 extern "C", modify the lang context appropriately. */
12629 {
12632 }
12634 {
12637 }
12640 {
12641 /* A top-level declaration can consist solely of a #pragma.
12642 A nested declaration cannot, so this is done here and not
12643 in cp_parser_declaration. (A #pragma at block scope is
12644 handled in cp_parser_statement.) */
12647 }
12649 /* Parse the declaration itself. */
12651 }
12652 }
12654 /* Parse a declaration.
12656 declaration:
12657 block-declaration
12658 function-definition
12659 template-declaration
12660 explicit-instantiation
12661 explicit-specialization
12662 linkage-specification
12663 namespace-definition
12665 C++17:
12666 deduction-guide
12668 GNU extension:
12670 declaration:
12671 __extension__ declaration */
12673 static void
12675 {
12676 cp_token token1;
12677 cp_token token2;
12682 /* Check for the `__extension__' keyword. */
12684 {
12685 /* Parse the qualified declaration. */
12687 /* Restore the PEDANTIC flag. */
12691 }
12693 /* Try to figure out what kind of declaration is present. */
12698 else
12699 {
12702 }
12704 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12707 /* If the next token is `extern' and the following token is a string
12708 literal, then we have a linkage specification. */
12712 /* If the next token is `template', then we have either a template
12713 declaration, an explicit instantiation, or an explicit
12714 specialization. */
12716 {
12717 /* `template <>' indicates a template specialization. */
12721 /* `template <' indicates a template declaration. */
12724 /* Anything else must be an explicit instantiation. */
12725 else
12727 }
12728 /* If the next token is `export', then we have a template
12729 declaration. */
12732 /* If the next token is `extern', 'static' or 'inline' and the one
12733 after that is `template', we have a GNU extended explicit
12734 instantiation directive. */
12741 /* If the next token is `namespace', check for a named or unnamed
12742 namespace definition. */
12751 /* An unnamed namespace definition. */
12755 /* An inline (associated) namespace definition. */
12759 /* Objective-C++ declaration/definition. */
12766 /* At this point we may have a template declared by a concept
12767 introduction. */
12772 else
12773 /* Try to parse a block-declaration, or a function-definition. */
12776 /* Free any declarators allocated. */
12778 }
12780 /* Parse a block-declaration.
12782 block-declaration:
12783 simple-declaration
12784 asm-definition
12785 namespace-alias-definition
12786 using-declaration
12787 using-directive
12789 GNU Extension:
12791 block-declaration:
12792 __extension__ block-declaration
12794 C++0x Extension:
12796 block-declaration:
12797 static_assert-declaration
12799 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12800 part of a declaration-statement. */
12802 static void
12805 {
12809 /* Check for the `__extension__' keyword. */
12811 {
12812 /* Parse the qualified declaration. */
12814 /* Restore the PEDANTIC flag. */
12818 }
12820 /* Peek at the next token to figure out which kind of declaration is
12821 present. */
12824 /* If the next keyword is `asm', we have an asm-definition. */
12826 {
12830 }
12831 /* If the next keyword is `namespace', we have a
12832 namespace-alias-definition. */
12835 /* If the next keyword is `using', we have a
12836 using-declaration, a using-directive, or an alias-declaration. */
12838 {
12843 /* If the token after `using' is `namespace', then we have a
12844 using-directive. */
12848 /* If the second token after 'using' is '=', then we have an
12849 alias-declaration. */
12855 /* Otherwise, it's a using-declaration. */
12856 else
12859 }
12860 /* If the next keyword is `__label__' we have a misplaced label
12861 declaration. */
12863 {
12867 /* If the next token is now a `;', consume it. */
12870 }
12871 /* If the next token is `static_assert' we have a static assertion. */
12874 /* Anything else must be a simple-declaration. */
12875 else
12878 }
12880 /* Parse a simple-declaration.
12882 simple-declaration:
12883 decl-specifier-seq [opt] init-declarator-list [opt] ;
12884 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12885 brace-or-equal-initializer ;
12887 init-declarator-list:
12888 init-declarator
12889 init-declarator-list , init-declarator
12891 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12892 function-definition as a simple-declaration.
12894 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12895 parsed declaration if it is an uninitialized single declarator not followed
12896 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12897 if present, will not be consumed. */
12899 static void
12903 {
12904 cp_decl_specifier_seq decl_specifiers;
12913 /* Defer access checks until we know what is being declared; the
12914 checks for names appearing in the decl-specifier-seq should be
12915 done as if we were in the scope of the thing being declared. */
12918 /* Parse the decl-specifier-seq. We have to keep track of whether
12919 or not the decl-specifier-seq declares a named class or
12920 enumeration type, since that is the only case in which the
12921 init-declarator-list is allowed to be empty.
12923 [dcl.dcl]
12925 In a simple-declaration, the optional init-declarator-list can be
12926 omitted only when declaring a class or enumeration, that is when
12927 the decl-specifier-seq contains either a class-specifier, an
12928 elaborated-type-specifier, or an enum-specifier. */
12930 CP_PARSER_FLAGS_OPTIONAL,
12933 /* We no longer need to defer access checks. */
12936 /* In a block scope, a valid declaration must always have a
12937 decl-specifier-seq. By not trying to parse declarators, we can
12938 resolve the declaration/expression ambiguity more quickly. */
12941 {
12944 }
12946 /* If the next two tokens are both identifiers, the code is
12947 erroneous. The usual cause of this situation is code like:
12949 T t;
12951 where "T" should name a type -- but does not. */
12954 {
12955 /* If parsing tentatively, we should commit; we really are
12956 looking at a declaration. */
12958 /* Give up. */
12960 }
12962 /* If we have seen at least one decl-specifier, and the next token
12963 is not a parenthesis, then we must be looking at a declaration.
12964 (After "int (" we might be looking at a functional cast.) */
12971 /* Look for C++17 decomposition declaration. */
12979 {
12980 tree decl
12982 maybe_range_for_decl,
12985 /* The next token should be either a `,' or a `;'. */
12987 /* If it's a `;', we are done. */
12990 /* Anything else is an error. */
12991 else
12992 {
12993 /* If we have already issued an error message we don't need
12994 to issue another one. */
12999 /* Skip tokens until we reach the end of the statement. */
13001 /* If the next token is now a `;', consume it. */
13005 }
13006 }
13007 else
13010 tree last_type;
13012 /* NULL_TREE if both variable and function declaration are allowed,
13013 error_mark_node if function declaration are not allowed and
13014 a FUNCTION_DECL that should be diagnosed if it is followed by
13015 variable declarations. */
13016 tree auto_function_declaration;
13019 auto_specifier_p
13023 /* Keep going until we hit the `;' at the end of the simple
13024 declaration. */
13027 CPP_SEMICOLON))
13028 {
13031 tree decl;
13035 {
13036 /* If we are processing next declarator, comma is expected */
13041 {
13045 }
13046 }
13047 else
13050 /* Parse the init-declarator. */
13053 function_definition_allowed_p,
13055 declares_class_or_enum,
13057 maybe_range_for_decl,
13060 /* If an error occurred while parsing tentatively, exit quickly.
13061 (That usually happens when in the body of a function; each
13062 statement is treated as a declaration-statement until proven
13063 otherwise.) */
13068 {
13069 /* If the init-declarator-list contains more than one
13070 init-declarator, they shall all form declarations of
13071 variables. */
13073 auto_function_declaration
13077 {
13079 "non-variable %qD in declaration with more than one "
13084 }
13085 }
13089 {
13093 {
13094 /* If the list of declarators contains more than one declarator,
13095 the type of each declared variable is determined as described
13096 above. If the type deduced for the template parameter U is not
13097 the same in each deduction, the program is ill-formed. */
13102 }
13103 else
13105 }
13107 /* Handle function definitions specially. */
13109 {
13110 /* If the next token is a `,', then we are probably
13111 processing something like:
13113 void f() {}, *p;
13115 which is erroneous. */
13117 {
13120 "mixing"
13122 }
13123 /* Otherwise, we're done with the list of declarators. */
13124 else
13125 {
13128 }
13129 }
13132 /* The next token should be either a `,' or a `;'. */
13134 /* If it's a `,', there are more declarators to come. */
13137 /* If it's a `;', we are done. */
13141 {
13146 }
13147 /* Anything else is an error. */
13148 else
13149 {
13150 /* If we have already issued an error message we don't need
13151 to issue another one. */
13156 /* Skip tokens until we reach the end of the statement. */
13158 /* If the next token is now a `;', consume it. */
13162 }
13163 /* After the first time around, a function-definition is not
13164 allowed -- even if it was OK at first. For example:
13166 int i, f() {}
13168 is not valid. */
13170 }
13172 /* Issue an error message if no declarators are present, and the
13173 decl-specifier-seq does not itself declare a class or
13174 enumeration: [dcl.dcl]/3. */
13176 {
13178 {
13182 /* Ensure an error is issued anyway when finish_decltype_type,
13183 called via cp_parser_decl_specifier_seq, returns a class or
13184 an enumeration (c++/51786). */
13187 }
13188 /* Perform any deferred access checks. */
13190 }
13192 /* Consume the `;'. */
13193 finish:
13197 {
13203 }
13205 done:
13207 }
13209 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13210 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13211 initializer ; */
13213 static tree
13218 {
13223 /* Parse the identifier-list. */
13227 {
13235 }
13239 {
13245 else
13246 {
13249 }
13250 }
13256 tree pushed_scope;
13263 NULL_TREE);
13270 cp_expr e;
13271 cp_decl_specifier_seq decl_specs;
13276 {
13279 else
13282 tree elt_pushed_scope;
13288 {
13289 /* Ensure we've diagnosed redeclaration if we aren't creating
13290 a new VAR_DECL. */
13293 }
13294 else
13298 }
13301 {
13304 }
13308 {
13318 {
13322 }
13325 {
13329 }
13330 }
13332 {
13334 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13335 the underlying DECL. */
13337 }
13343 {
13346 }
13349 }
13351 /* Parse a decl-specifier-seq.
13353 decl-specifier-seq:
13354 decl-specifier-seq [opt] decl-specifier
13355 decl-specifier attribute-specifier-seq [opt] (C++11)
13357 decl-specifier:
13358 storage-class-specifier
13359 type-specifier
13360 function-specifier
13361 friend
13362 typedef
13364 GNU Extension:
13366 decl-specifier:
13367 attributes
13369 Concepts Extension:
13371 decl-specifier:
13372 concept
13374 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13376 The parser flags FLAGS is used to control type-specifier parsing.
13378 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13379 flags:
13381 1: one of the decl-specifiers is an elaborated-type-specifier
13382 (i.e., a type declaration)
13383 2: one of the decl-specifiers is an enum-specifier or a
13384 class-specifier (i.e., a type definition)
13386 */
13388 static void
13390 cp_parser_flags flags,
13393 {
13397 cp_decl_spec ds;
13399 /* Clear DECL_SPECS. */
13402 /* Assume no class or enumeration type is declared. */
13405 /* Keep reading specifiers until there are no more to read. */
13407 {
13412 /* Peek at the next token. */
13415 /* Save the first token of the decl spec list for error
13416 reporting. */
13419 /* Handle attributes. */
13421 {
13422 /* Parse the attributes. */
13425 /* In a sequence of declaration specifiers, c++11 attributes
13426 appertain to the type that precede them. In that case
13427 [dcl.spec]/1 says:
13429 The attribute-specifier-seq affects the type only for
13430 the declaration it appears in, not other declarations
13431 involving the same type.
13433 But for now let's force the user to position the
13434 attribute either at the beginning of the declaration or
13435 after the declarator-id, which would clearly mean that it
13436 applies to the declarator. */
13438 {
13440 /* The c++11 attribute is at the beginning of the
13441 declaration. It appertains to the entity being
13443 else
13444 {
13446 {
13447 /* This is an attribute following a
13448 class-specifier. */
13453 }
13454 else
13455 {
13456 decl_specs->std_attributes
13458 attrs);
13461 }
13463 }
13464 }
13466 decl_specs->attributes
13468 attrs);
13472 }
13473 /* Assume we will find a decl-specifier keyword. */
13475 /* If the next token is an appropriate keyword, we can simply
13476 add it to the list. */
13478 {
13479 /* decl-specifier:
13480 friend
13481 constexpr */
13484 {
13489 }
13490 else
13491 {
13493 /* Consume the token. */
13495 }
13508 /* function-specifier:
13509 inline
13510 virtual
13511 explicit */
13518 /* decl-specifier:
13519 typedef */
13522 /* Consume the token. */
13524 /* A constructor declarator cannot appear in a typedef. */
13526 /* The "typedef" keyword can only occur in a declaration; we
13527 may as well commit at this point. */
13534 /* storage-class-specifier:
13535 auto
13536 register
13537 static
13538 extern
13539 mutable
13541 GNU Extension:
13542 thread */
13545 {
13546 /* Consume the token. */
13549 /* Complain about `auto' as a storage specifier, if
13550 we're complaining about C++0x compatibility. */
13554 "%<auto%> changes meaning in C++11; "
13557 /* Set the storage class anyway. */
13559 token);
13560 }
13561 else
13562 /* C++0x auto type-specifier. */
13570 /* Consume the token. */
13573 token);
13576 /* Consume the token. */
13582 /* We did not yet find a decl-specifier yet. */
13585 }
13602 /* Constructors are a special case. The `S' in `S()' is not a
13603 decl-specifier; it is the beginning of the declarator. */
13604 constructor_p
13605 = (!found_decl_spec
13606 && constructor_possible_p
13607 && (cp_parser_constructor_declarator_p
13610 /* If we don't have a DECL_SPEC yet, then we must be looking at
13611 a type-specifier. */
13613 {
13616 tree type_spec;
13618 type_spec
13620 decl_specs,
13626 /* If this type-specifier referenced a user-defined type
13627 (a typedef, class-name, etc.), then we can't allow any
13628 more such type-specifiers henceforth.
13630 [dcl.spec]
13632 The longest sequence of decl-specifiers that could
13633 possibly be a type name is taken as the
13634 decl-specifier-seq of a declaration. The sequence shall
13635 be self-consistent as described below.
13637 [dcl.type]
13639 As a general rule, at most one type-specifier is allowed
13640 in the complete decl-specifier-seq of a declaration. The
13641 only exceptions are the following:
13643 -- const or volatile can be combined with any other
13644 type-specifier.
13646 -- signed or unsigned can be combined with char, long,
13647 short, or int.
13649 -- ..
13651 Example:
13653 typedef char* Pc;
13654 void g (const int Pc);
13656 Here, Pc is *not* part of the decl-specifier seq; it's
13657 the declarator. Therefore, once we see a type-specifier
13658 (other than a cv-qualifier), we forbid any additional
13659 user-defined types. We *do* still allow things like `int
13660 int' to be considered a decl-specifier-seq, and issue the
13661 error message later. */
13664 /* A constructor declarator cannot follow a type-specifier. */
13666 {
13671 }
13672 }
13674 /* If we still do not have a DECL_SPEC, then there are no more
13675 decl-specifiers. */
13680 /* After we see one decl-specifier, further decl-specifiers are
13681 always optional. */
13683 }
13685 /* Don't allow a friend specifier with a class definition. */
13690 }
13692 /* Parse an (optional) storage-class-specifier.
13694 storage-class-specifier:
13695 auto
13696 register
13697 static
13698 extern
13699 mutable
13701 GNU Extension:
13703 storage-class-specifier:
13704 thread
13706 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13708 static tree
13710 {
13712 {
13716 /* Fall through for C++98. */
13724 /* Consume the token. */
13729 }
13730 }
13732 /* Parse an (optional) function-specifier.
13734 function-specifier:
13735 inline
13736 virtual
13737 explicit
13739 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13740 Updates DECL_SPECS, if it is non-NULL. */
13742 static tree
13745 {
13748 {
13754 /* 14.5.2.3 [temp.mem]
13756 A member function template shall not be virtual. */
13760 else
13770 }
13772 /* Consume the token. */
13774 }
13776 /* Parse a linkage-specification.
13778 linkage-specification:
13779 extern string-literal { declaration-seq [opt] }
13780 extern string-literal declaration */
13782 static void
13784 {
13785 tree linkage;
13787 /* Look for the `extern' keyword. */
13790 /* Look for the string-literal. */
13793 /* Transform the literal into an identifier. If the literal is a
13794 wide-character string, or contains embedded NULs, then we can't
13795 handle it as the user wants. */
13798 {
13800 /* Assume C++ linkage. */
13802 }
13803 else
13806 /* We're now using the new linkage. */
13809 /* If the next token is a `{', then we're using the first
13810 production. */
13812 {
13816 /* Consume the `{' token. */
13817 matching_braces braces;
13819 /* Parse the declarations. */
13821 /* Look for the closing `}'. */
13823 }
13824 /* Otherwise, there's just one declaration. */
13825 else
13826 {
13829 saved_in_unbraced_linkage_specification_p
13833 parser->in_unbraced_linkage_specification_p
13835 }
13837 /* We're done with the linkage-specification. */
13839 }
13841 /* Parse a static_assert-declaration.
13843 static_assert-declaration:
13844 static_assert ( constant-expression , string-literal ) ;
13845 static_assert ( constant-expression ) ; (C++1Z)
13847 If MEMBER_P, this static_assert is a class member. */
13849 static void
13851 {
13852 tree condition;
13853 tree message;
13855 location_t saved_loc;
13858 /* Peek at the `static_assert' token so we can keep track of exactly
13859 where the static assertion started. */
13863 /* Look for the `static_assert' keyword. */
13865 RT_STATIC_ASSERT))
13868 /* We know we are in a static assertion; commit to any tentative
13869 parse. */
13873 /* Parse the `(' starting the static assertion condition. */
13874 matching_parens parens;
13877 /* Parse the constant-expression. Allow a non-constant expression
13878 here in order to give better diagnostics in finish_static_assert. */
13879 condition =
13885 {
13888 "static_assert without a message "
13890 /* Eat the ')' */
13895 }
13896 else
13897 {
13898 /* Parse the separating `,'. */
13901 /* Parse the string-literal message. */
13906 /* A `)' completes the static assertion. */
13912 }
13914 /* A semicolon terminates the declaration. */
13917 /* Complete the static assertion, which may mean either processing
13918 the static assert now or saving it for template instantiation. */
13920 }
13922 /* Parse the expression in decltype ( expression ). */
13924 static tree
13927 {
13929 tree expr;
13931 /* Since we're going to preserve any side-effects from this parse, set up a
13932 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13933 in the expression. */
13936 /* First, try parsing an id-expression. */
13947 {
13950 cp_id_kind idk;
13954 /* Lookup the name we got back from the id-expression. */
13964 {
13965 /* Complete lookup of the id-expression. */
13966 expr = (finish_id_expression
13979 /* We found an id-expression, but it was something that we
13980 should not have found. This is an error, not something
13981 we can recover from, so note that we found an
13982 id-expression and we'll recover as gracefully as
13983 possible. */
13985 }
13990 /* We have an id-expression. */
13992 }
13995 {
13996 /* Abort the id-expression parse. */
13999 /* Parsing tentatively, again. */
14002 /* Parse a class member access. */
14010 /* We have an id-expression. */
14012 }
14015 /* We have parsed the complete id-expression or member access. */
14017 else
14018 {
14019 /* Abort our attempt to parse an id-expression or member access
14020 expression. */
14023 /* Parse a full expression. */
14026 }
14029 }
14031 /* Parse a `decltype' type. Returns the type.
14033 simple-type-specifier:
14034 decltype ( expression )
14035 C++14 proposal:
14036 decltype ( auto ) */
14038 static tree
14040 {
14041 tree expr;
14050 {
14051 /* Already parsed. */
14054 }
14056 /* Look for the `decltype' token. */
14060 /* Parse the opening `('. */
14061 matching_parens parens;
14065 /* decltype (auto) */
14068 {
14075 }
14077 /* Types cannot be defined in a `decltype' expression. Save away the
14078 old message. */
14081 /* And create the new one. */
14082 parser->type_definition_forbidden_message
14085 /* The restrictions on constant-expressions do not apply inside
14086 decltype expressions. */
14087 saved_integral_constant_expression_p
14089 saved_non_integral_constant_expression_p
14093 /* Within a parenthesized expression, a `>' token is always
14094 the greater-than operator. */
14095 saved_greater_than_is_operator_p
14099 /* Do not actually evaluate the expression. */
14102 /* Do not warn about problems with the expression. */
14107 /* Go back to evaluating expressions. */
14111 /* The `>' token might be the end of a template-id or
14112 template-parameter-list now. */
14113 parser->greater_than_is_operator_p
14116 /* Restore the old message and the integral constant expression
14117 flags. */
14119 parser->integral_constant_expression_p
14121 parser->non_integral_constant_expression_p
14124 /* Parse to the closing `)'. */
14126 {
14130 }
14133 tf_warning_or_error);
14135 rewrite:
14136 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14137 it again. */
14146 }
14148 /* Special member functions [gram.special] */
14150 /* Parse a conversion-function-id.
14152 conversion-function-id:
14153 operator conversion-type-id
14155 Returns an IDENTIFIER_NODE representing the operator. */
14157 static tree
14159 {
14160 tree type;
14161 tree saved_scope;
14162 tree saved_qualifying_scope;
14163 tree saved_object_scope;
14166 /* Look for the `operator' token. */
14169 /* When we parse the conversion-type-id, the current scope will be
14170 reset. However, we need that information in able to look up the
14171 conversion function later, so we save it here. */
14175 /* We must enter the scope of the class so that the names of
14176 entities declared within the class are available in the
14177 conversion-type-id. For example, consider:
14179 struct S {
14180 typedef int I;
14181 operator I();
14182 };
14184 S::operator I() { ... }
14186 In order to see that `I' is a type-name in the definition, we
14187 must be in the scope of `S'. */
14190 /* Parse the conversion-type-id. */
14192 /* Leave the scope of the class, if any. */
14195 /* Restore the saved scope. */
14199 /* If the TYPE is invalid, indicate failure. */
14203 }
14205 /* Parse a conversion-type-id:
14207 conversion-type-id:
14208 type-specifier-seq conversion-declarator [opt]
14210 Returns the TYPE specified. */
14212 static tree
14214 {
14215 tree attributes;
14216 cp_decl_specifier_seq type_specifiers;
14218 tree type_specified;
14221 /* Parse the attributes. */
14225 parser->type_definition_forbidden_message
14228 /* Parse the type-specifiers. */
14235 /* If that didn't work, stop. */
14238 /* Parse the conversion-declarator. */
14246 /* Don't give this error when parsing tentatively. This happens to
14247 work because we always parse this definitively once. */
14250 {
14252 {
14255 }
14259 }
14262 }
14264 /* Parse an (optional) conversion-declarator.
14266 conversion-declarator:
14267 ptr-operator conversion-declarator [opt]
14269 */
14273 {
14276 cp_cv_quals cv_quals;
14278 /* We don't know if there's a ptr-operator next, or not. */
14280 /* Try the ptr-operator. */
14283 /* If it worked, look for more conversion-declarators. */
14285 {
14288 /* Parse another optional declarator. */
14291 declarator = cp_parser_make_indirect_declarator
14295 }
14298 }
14300 /* Parse an (optional) ctor-initializer.
14302 ctor-initializer:
14303 : mem-initializer-list
14305 Returns TRUE iff the ctor-initializer was actually present. */
14307 static bool
14309 {
14310 /* If the next token is not a `:', then there is no
14311 ctor-initializer. */
14313 {
14314 /* Do default initialization of any bases and members. */
14319 }
14321 /* Consume the `:' token. */
14323 /* And the mem-initializer-list. */
14327 }
14329 /* Parse a mem-initializer-list.
14331 mem-initializer-list:
14332 mem-initializer ... [opt]
14333 mem-initializer ... [opt] , mem-initializer-list */
14335 static void
14337 {
14342 /* Let the semantic analysis code know that we are starting the
14343 mem-initializer-list. */
14348 /* Loop through the list. */
14350 {
14351 tree mem_initializer;
14354 /* Parse the mem-initializer. */
14356 /* If the next token is a `...', we're expanding member initializers. */
14358 {
14359 /* Consume the `...'. */
14362 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14363 can be expanded but members cannot. */
14366 {
14371 }
14373 /* Construct the pack expansion type. */
14376 }
14379 {
14383 }
14384 /* Look for a target constructor. */
14388 {
14391 {
14395 }
14397 }
14398 /* Add it to the list, unless it was erroneous. */
14400 {
14403 }
14404 /* If the next token is not a `,', we're done. */
14407 /* Consume the `,' token. */
14409 }
14411 /* Perform semantic analysis. */
14414 }
14416 /* Parse a mem-initializer.
14418 mem-initializer:
14419 mem-initializer-id ( expression-list [opt] )
14420 mem-initializer-id braced-init-list
14422 GNU extension:
14424 mem-initializer:
14425 ( expression-list [opt] )
14427 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14428 class) or FIELD_DECL (for a non-static data member) to initialize;
14429 the TREE_VALUE is the expression-list. An empty initialization
14430 list is represented by void_list_node. */
14432 static tree
14434 {
14435 tree mem_initializer_id;
14436 tree expression_list;
14437 tree member;
14440 /* Find out what is being initialized. */
14442 {
14446 }
14447 else
14448 {
14452 }
14458 {
14465 }
14466 else
14467 {
14477 }
14487 }
14489 /* Parse a mem-initializer-id.
14491 mem-initializer-id:
14492 :: [opt] nested-name-specifier [opt] class-name
14493 decltype-specifier (C++11)
14494 identifier
14496 Returns a TYPE indicating the class to be initialized for the first
14497 production (and the second in C++11). Returns an IDENTIFIER_NODE
14498 indicating the data member to be initialized for the last production. */
14500 static tree
14502 {
14506 tree id;
14510 /* `typename' is not allowed in this context ([temp.res]). */
14512 {
14514 "keyword %<typename%> not allowed in this context (a qualified "
14517 }
14518 /* Look for the optional `::' operator. */
14519 global_scope_p
14523 /* Look for the optional nested-name-specifier. The simplest way to
14524 implement:
14526 [temp.res]
14528 The keyword `typename' is not permitted in a base-specifier or
14529 mem-initializer; in these contexts a qualified name that
14530 depends on a template-parameter is implicitly assumed to be a
14531 type name.
14533 is to assume that we have seen the `typename' keyword at this
14534 point. */
14535 nested_name_specifier_p
14544 /* If there is a `::' operator or a nested-name-specifier, then we
14545 are definitely looking for a class-name. */
14550 typename_type,
14554 /* Otherwise, we could also be looking for an ordinary identifier. */
14557 /* Try a decltype-specifier. */
14559 else
14560 /* Otherwise, try a class-name. */
14564 none_type,
14568 /* If we found one, we're done. */
14571 /* Otherwise, look for an ordinary identifier. */
14573 }
14575 /* Overloading [gram.over] */
14577 /* Parse an operator-function-id.
14579 operator-function-id:
14580 operator operator
14582 Returns an IDENTIFIER_NODE for the operator which is a
14583 human-readable spelling of the identifier, e.g., `operator +'. */
14585 static cp_expr
14587 {
14588 /* Look for the `operator' keyword. */
14591 /* And then the name of the operator itself. */
14593 }
14595 /* Return an identifier node for a user-defined literal operator.
14596 The suffix identifier is chained to the operator name identifier. */
14598 tree
14600 {
14601 tree identifier;
14608 }
14610 /* Parse an operator.
14612 operator:
14613 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14614 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14615 || ++ -- , ->* -> () []
14617 GNU Extensions:
14619 operator:
14620 <? >? <?= >?=
14622 Returns an IDENTIFIER_NODE for the operator which is a
14623 human-readable spelling of the identifier, e.g., `operator +'. */
14625 static cp_expr
14627 {
14632 /* Peek at the next token. */
14637 /* Figure out which operator we have. */
14639 {
14641 {
14644 /* The keyword should be either `new' or `delete'. */
14649 else
14652 /* Consume the `new' or `delete' token. */
14655 /* Peek at the next token. */
14657 /* If it's a `[' token then this is the array variant of the
14658 operator. */
14660 {
14661 /* Consume the `[' token. */
14663 /* Look for the `]' token. */
14669 }
14670 /* Otherwise, we have the non-array variant. */
14671 else
14677 }
14824 {
14825 /* Consume the `('. */
14826 matching_parens parens;
14828 /* Look for the matching `)'. */
14831 }
14834 /* Consume the `['. */
14836 /* Look for the matching `]'. */
14843 /* FALLTHRU */
14852 {
14859 /* Consume the string. */
14865 {
14868 }
14869 else
14870 {
14872 /* Look for the suffix identifier. */
14877 {
14881 }
14882 else
14883 {
14886 }
14887 }
14892 {
14895 }
14898 {
14901 }
14903 {
14906 }
14908 }
14911 /* Anything else is an error. */
14913 }
14915 /* If we have selected an identifier, we need to consume the
14916 operator token. */
14919 /* Otherwise, no valid operator name was present. */
14920 else
14921 {
14924 }
14927 }
14929 /* Parse a template-declaration.
14931 template-declaration:
14932 export [opt] template < template-parameter-list > declaration
14934 If MEMBER_P is TRUE, this template-declaration occurs within a
14935 class-specifier.
14937 The grammar rule given by the standard isn't correct. What
14938 is really meant is:
14940 template-declaration:
14941 export [opt] template-parameter-list-seq
14942 decl-specifier-seq [opt] init-declarator [opt] ;
14943 export [opt] template-parameter-list-seq
14944 function-definition
14946 template-parameter-list-seq:
14947 template-parameter-list-seq [opt]
14948 template < template-parameter-list >
14950 Concept Extensions:
14952 template-parameter-list-seq:
14953 template < template-parameter-list > requires-clause [opt]
14955 requires-clause:
14956 requires logical-or-expression */
14958 static void
14960 {
14961 /* Check for `export'. */
14963 {
14964 /* Consume the `export' token. */
14966 /* Warn that we do not support `export'. */
14968 }
14971 }
14973 /* Parse a template-parameter-list.
14975 template-parameter-list:
14976 template-parameter
14977 template-parameter-list , template-parameter
14979 Returns a TREE_LIST. Each node represents a template parameter.
14980 The nodes are connected via their TREE_CHAINs. */
14982 static tree
14984 {
14989 /* The loop below parses the template parms. We first need to know
14990 the total number of template parms to be able to compute proper
14991 canonical types of each dependent type. So after the loop, when
14992 we know the total number of template parms,
14993 end_template_parm_list computes the proper canonical types and
14994 fixes up the dependent types accordingly. */
14996 {
14997 tree parameter;
15000 location_t parm_loc;
15002 /* Parse the template-parameter. */
15007 /* Add it to the list. */
15010 parm_loc,
15011 parameter,
15012 is_non_type,
15013 is_parameter_pack);
15014 else
15015 {
15018 }
15020 /* If the next token is not a `,', we're done. */
15023 /* Otherwise, consume the `,' token. */
15025 }
15028 }
15030 /* Parse a introduction-list.
15032 introduction-list:
15033 introduced-parameter
15034 introduction-list , introduced-parameter
15036 introduced-parameter:
15037 ...[opt] identifier
15039 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15040 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15041 WILDCARD_DECL will also have DECL_NAME set and token location in
15042 DECL_SOURCE_LOCATION. */
15044 static tree
15046 {
15050 {
15055 /* Build placeholder. */
15063 /* If the next token is not a `,', we're done. */
15066 /* Otherwise, consume the `,' token. */
15068 }
15070 /* Convert the vec into a TREE_VEC. */
15073 tree parm;
15079 }
15081 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15082 is an abstract declarator. */
15086 {
15091 }
15093 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15094 is an abstract declarator. */
15098 {
15102 else
15104 }
15106 /* Returns true if DECL represents a constrained-parameter. */
15110 {
15115 }
15117 /* Returns true if PARM declares a constrained-parameter. */
15121 {
15123 }
15125 /* Check that the type parameter is only a declarator-id, and that its
15126 type is not cv-qualified. */
15128 bool
15131 {
15136 {
15139 }
15141 /* Don't allow cv-qualified type parameters. */
15144 {
15147 }
15150 }
15152 /* Finish parsing/processing a template type parameter and checking
15153 various restrictions. */
15157 tree id,
15159 {
15162 else
15164 }
15166 static tree
15168 {
15169 /* FIXME: This should probably be copied, and we may need to adjust
15170 the template parameter depths. */
15180 }
15182 /* Finish parsing/processing a template template parameter by borrowing
15183 the template parameter list from the prototype parameter. */
15185 static tree
15187 tree proto,
15188 tree id,
15190 {
15194 }
15196 /* Create a new non-type template parameter from the given PARM
15197 declarator. */
15199 static tree
15202 {
15208 }
15210 /* Build a constrained template parameter based on the PARMDECL
15211 declarator. The type of PARMDECL is the constrained type, which
15212 refers to the prototype template parameter that ultimately
15213 specifies the type of the declared parameter. */
15215 static tree
15220 {
15226 /* A template parameter constrained by a variadic concept shall also
15227 be declared as a template parameter pack. */
15232 /* Build the parameter. Return an error if the declarator was invalid. */
15233 tree parm;
15238 parmdecl);
15239 else
15244 /* Finish the parameter decl and create a node attaching the
15245 default argument and constraint. */
15250 }
15252 /* Returns true if the parsed type actually represents the declaration
15253 of a type template-parameter. */
15257 {
15260 }
15263 /* Returns true if the parsed type actually represents the declaration of
15264 a template template-parameter. */
15266 static bool
15268 {
15271 }
15273 /* Parse a default argument for a type template-parameter.
15274 Note that diagnostics are handled in cp_parser_template_parameter. */
15276 static tree
15278 {
15281 /* Consume the `=' token. */
15286 /* Parse the default-argument. */
15292 {
15296 }
15299 }
15301 /* Parse a default argument for a template template-parameter. */
15303 static tree
15305 {
15310 /* Consume the `='. */
15312 /* Parse the id-expression. */
15314 /* save token before parsing the id-expression, for error
15315 reporting */
15317 tree default_argument
15325 /* If the id-expression was a template-id that refers to
15326 a template-class, we already have the declaration here,
15327 so no further lookup is needed. */
15328 ;
15329 else
15330 /* Look up the name. */
15331 default_argument
15333 none_type,
15339 /* See if the default argument is valid. */
15343 }
15345 /* Parse a template-parameter.
15347 template-parameter:
15348 type-parameter
15349 parameter-declaration
15351 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15352 the parameter. The TREE_PURPOSE is the default value, if any.
15353 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15354 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15355 set to true iff this parameter is a parameter pack. */
15357 static tree
15360 {
15363 tree parm;
15365 /* Assume it is a type parameter or a template parameter. */
15367 /* Assume it not a parameter pack. */
15369 /* Peek at the next token. */
15371 /* If it is `template', we have a type-parameter. */
15374 /* If it is `class' or `typename' we do not know yet whether it is a
15375 type parameter or a non-type parameter. Consider:
15377 template <typename T, typename T::X X> ...
15379 or:
15381 template <class C, class D*> ...
15383 Here, the first parameter is a type parameter, and the second is
15384 a non-type parameter. We can tell by looking at the token after
15385 the identifier -- if it is a `,', `=', or `>' then we have a type
15386 parameter. */
15388 {
15389 /* Peek at the token after `class' or `typename'. */
15391 /* If it's an ellipsis, we have a template type parameter
15392 pack. */
15395 /* If it's an identifier, skip it. */
15398 /* Now, see if the token looks like the end of a template
15399 parameter. */
15404 }
15406 /* Otherwise, it is a non-type parameter or a constrained parameter.
15408 [temp.param]
15410 When parsing a default template-argument for a non-type
15411 template-parameter, the first non-nested `>' is taken as the end
15412 of the template parameter-list rather than a greater-than
15413 operator. */
15414 parameter_declarator
15421 /* If the parameter declaration is marked as a parameter pack, set
15422 *IS_PARAMETER_PACK to notify the caller. */
15427 {
15428 /* Can happen in some cases of erroneous input (c++/34892). */
15430 /* Consume the `...' for better error recovery. */
15432 }
15434 // The parameter may have been constrained.
15437 parameter_declarator,
15438 is_non_type,
15439 is_parameter_pack);
15441 // Now we're sure that the parameter is a non-type parameter.
15452 }
15454 /* Parse a type-parameter.
15456 type-parameter:
15457 class identifier [opt]
15458 class identifier [opt] = type-id
15459 typename identifier [opt]
15460 typename identifier [opt] = type-id
15461 template < template-parameter-list > class identifier [opt]
15462 template < template-parameter-list > class identifier [opt]
15463 = id-expression
15465 GNU Extension (variadic templates):
15467 type-parameter:
15468 class ... identifier [opt]
15469 typename ... identifier [opt]
15471 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15472 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15473 the declaration of the parameter.
15475 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15477 static tree
15479 {
15481 tree parameter;
15483 /* Look for a keyword to tell us what kind of parameter this is. */
15489 {
15492 {
15493 tree identifier;
15494 tree default_argument;
15496 /* If the next token is an ellipsis, we have a template
15497 argument pack. */
15499 {
15500 /* Consume the `...' token. */
15505 }
15507 /* If the next token is an identifier, then it names the
15508 parameter. */
15511 else
15514 /* Create the parameter. */
15517 /* If the next token is an `=', we have a default argument. */
15519 {
15520 default_argument
15523 /* Template parameter packs cannot have default
15524 arguments. */
15526 {
15529 "template parameter pack %qD cannot have a "
15531 else
15533 "template parameter packs cannot have "
15536 }
15539 }
15540 else
15543 /* Create the combined representation of the parameter and the
15544 default argument. */
15546 }
15550 {
15551 tree identifier;
15552 tree default_argument;
15554 /* Look for the `<'. */
15556 /* Parse the template-parameter-list. */
15558 /* Look for the `>'. */
15561 // If template requirements are present, parse them.
15563 {
15568 }
15570 /* Look for the `class' or 'typename' keywords. */
15572 /* If the next token is an ellipsis, we have a template
15573 argument pack. */
15575 {
15576 /* Consume the `...' token. */
15581 }
15582 /* If the next token is an `=', then there is a
15583 default-argument. If the next token is a `>', we are at
15584 the end of the parameter-list. If the next token is a `,',
15585 then we are at the end of this parameter. */
15589 {
15591 /* Treat invalid names as if the parameter were nameless. */
15594 }
15595 else
15598 /* Create the template parameter. */
15600 identifier);
15602 /* If the next token is an `=', then there is a
15603 default-argument. */
15605 {
15606 default_argument
15609 /* Template parameter packs cannot have default
15610 arguments. */
15612 {
15615 "template parameter pack %qD cannot "
15617 identifier);
15618 else
15622 }
15623 }
15624 else
15627 /* Create the combined representation of the parameter and the
15628 default argument. */
15630 }
15636 }
15639 }
15641 /* Parse a template-id.
15643 template-id:
15644 template-name < template-argument-list [opt] >
15646 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15647 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15648 returned. Otherwise, if the template-name names a function, or set
15649 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15650 names a class, returns a TYPE_DECL for the specialization.
15652 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15653 uninstantiated templates. */
15655 static tree
15661 {
15662 tree templ;
15663 tree arguments;
15664 tree template_id;
15669 /* If the next token corresponds to a template-id, there is no need
15670 to reparse it. */
15673 {
15676 }
15678 /* Avoid performing name lookup if there is no possibility of
15679 finding a template-id. */
15682 && !cp_parser_nth_token_starts_template_argument_list_p
15684 {
15687 }
15689 /* Remember where the template-id starts. */
15695 /* Parse the template-name. */
15698 check_dependency_p,
15699 is_declaration,
15700 tag_type,
15703 {
15706 }
15708 /* Since we're going to preserve any side-effects from this parse, set up a
15709 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15710 in the template arguments. */
15713 /* If we find the sequence `[:' after a template-name, it's probably
15714 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15715 parse correctly the argument list. */
15722 {
15724 /* Change `:' into `::'. */
15726 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15727 CPP_LESS. */
15730 /* Parse the arguments. */
15733 {
15734 /* If we couldn't parse an argument list, then we revert our changes
15735 and return simply an error. Maybe this is not a template-id
15736 after all. */
15741 }
15742 /* Otherwise, emit an error about the invalid digraph, but continue
15743 parsing because we got our argument list. */
15746 {
15749 "%<<:%> is an alternate spelling for %<[%>."
15752 {
15754 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15757 }
15758 }
15759 }
15760 else
15761 {
15762 /* Look for the `<' that starts the template-argument-list. */
15764 {
15767 }
15768 /* Parse the arguments. */
15770 }
15772 /* Set the location to be of the form:
15773 template-name < template-argument-list [opt] >
15774 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15775 with caret == start at the start of the template-name,
15776 ranging until the closing '>'. */
15777 location_t finish_loc
15779 location_t combined_loc
15782 /* Build a representation of the specialization. */
15785 TEMPLATE_ID_EXPR,
15789 {
15791 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15792 template (rather than some instantiation thereof) only if
15793 is not nested within some other construct. For example, in
15794 "template <typename T> void f(T) { A<T>::", A<T> is just an
15795 instantiation of A. */
15798 CPP_SCOPE));
15799 template_id
15801 }
15802 /* A template-like identifier may be a partial concept id. */
15808 {
15812 }
15813 else
15814 {
15815 /* If it's not a class-template or a template-template, it should be
15816 a function-template. */
15824 }
15826 /* If parsing tentatively, replace the sequence of tokens that makes
15827 up the template-id with a CPP_TEMPLATE_ID token. That way,
15828 should we re-parse the token stream, we will not have to repeat
15829 the effort required to do the parse, nor will we issue duplicate
15830 error messages about problems during instantiation of the
15831 template. */
15833 /* Don't do this if we had a parse error in a declarator; re-parsing
15834 might succeed if a name changes meaning (60361). */
15838 {
15839 /* Reset the contents of the START_OF_ID token. */
15843 /* We must mark the lookup as kept, so we don't throw it away on
15844 the first parse. */
15848 /* Retrieve any deferred checks. Do not pop this access checks yet
15849 so the memory will not be reclaimed during token replacing below. */
15855 /* Purge all subsequent tokens. */
15858 /* ??? Can we actually assume that, if template_id ==
15859 error_mark_node, we will have issued a diagnostic to the
15860 user, as opposed to simply marking the tentative parse as
15861 failed? */
15864 }
15868 }
15870 /* Parse a template-name.
15872 template-name:
15873 identifier
15875 The standard should actually say:
15877 template-name:
15878 identifier
15879 operator-function-id
15881 A defect report has been filed about this issue.
15883 A conversion-function-id cannot be a template name because they cannot
15884 be part of a template-id. In fact, looking at this code:
15886 a.operator K<int>()
15888 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15889 It is impossible to call a templated conversion-function-id with an
15890 explicit argument list, since the only allowed template parameter is
15891 the type to which it is converting.
15893 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15894 `template' keyword, in a construction like:
15896 T::template f<3>()
15898 In that case `f' is taken to be a template-name, even though there
15899 is no way of knowing for sure.
15901 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15902 name refers to a set of overloaded functions, at least one of which
15903 is a template, or an IDENTIFIER_NODE with the name of the template,
15904 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15905 names are looked up inside uninstantiated templates. */
15907 static tree
15914 {
15915 tree identifier;
15916 tree decl;
15919 /* If the next token is `operator', then we have either an
15920 operator-function-id or a conversion-function-id. */
15922 {
15923 /* We don't know whether we're looking at an
15924 operator-function-id or a conversion-function-id. */
15926 /* Try an operator-function-id. */
15928 /* If that didn't work, try a conversion-function-id. */
15930 {
15933 }
15934 }
15935 /* Look for the identifier. */
15936 else
15939 /* If we didn't find an identifier, we don't have a template-id. */
15943 /* If the name immediately followed the `template' keyword, then it
15944 is a template-name. However, if the next token is not `<', then
15945 we do not treat it as a template-name, since it is not being used
15946 as part of a template-id. This enables us to handle constructs
15947 like:
15949 template <typename T> struct S { S(); };
15950 template <typename T> S<T>::S();
15952 correctly. We would treat `S' as a template -- if it were `S<T>'
15953 -- but we do not if there is no `<'. */
15957 {
15958 /* In a declaration, in a dependent context, we pretend that the
15959 "template" keyword was present in order to improve error
15960 recovery. For example, given:
15962 template <typename T> void f(T::X<int>);
15964 we want to treat "X<int>" as a template-id. */
15966 && !template_keyword_p
15968 && check_dependency_p
15970 /* Do not do this for dtors (or ctors), since they never
15971 need the template keyword before their name. */
15973 {
15976 /* Explain what went wrong. */
15978 identifier);
15981 /* If parsing tentatively, find the location of the "<" token. */
15984 /* Parse the template arguments so that we can issue error
15985 messages about them. */
15988 /* Skip tokens until we find a good place from which to
15989 continue parsing. */
15994 /* If parsing tentatively, permanently remove the
15995 template argument list. That will prevent duplicate
15996 error messages from being issued about the missing
15997 "template" keyword. */
16004 }
16006 /* If the "template" keyword is present, then there is generally
16007 no point in doing name-lookup, so we just return IDENTIFIER.
16008 But, if the qualifying scope is non-dependent then we can
16009 (and must) do name-lookup normally. */
16011 {
16017 {
16018 /* We're optimizing away the call to cp_parser_lookup_name, but
16019 we still need to do this. */
16022 }
16023 }
16024 }
16026 /* Look up the name. */
16028 tag_type,
16031 check_dependency_p,
16037 /* If DECL is a template, then the name was a template-name. */
16039 {
16043 }
16044 else
16045 {
16046 /* The standard does not explicitly indicate whether a name that
16047 names a set of overloaded declarations, some of which are
16048 templates, is a template-name. However, such a name should
16049 be a template-name; otherwise, there is no way to form a
16050 template-id for the overloaded templates. */
16059 {
16060 /* The name does not name a template. */
16063 }
16064 }
16066 /* If DECL is dependent, and refers to a function, then just return
16067 its name; we will look it up again during template instantiation. */
16069 {
16073 }
16076 }
16078 /* Parse a template-argument-list.
16080 template-argument-list:
16081 template-argument ... [opt]
16082 template-argument-list , template-argument ... [opt]
16084 Returns a TREE_VEC containing the arguments. */
16086 static tree
16088 {
16093 tree vec;
16100 /* Even if the template-id appears in an integral
16101 constant-expression, the contents of the argument list do
16102 not. */
16108 /* Parse the arguments. */
16109 do
16110 {
16111 tree argument;
16114 /* Consume the comma. */
16117 /* Parse the template-argument. */
16120 /* If the next token is an ellipsis, we're expanding a template
16121 argument pack. */
16123 {
16125 {
16129 }
16130 /* Consume the `...' token. */
16133 /* Make the argument into a TYPE_PACK_EXPANSION or
16134 EXPR_PACK_EXPANSION. */
16136 }
16139 {
16143 {
16146 }
16147 else
16149 }
16151 }
16167 }
16169 /* Parse a template-argument.
16171 template-argument:
16172 assignment-expression
16173 type-id
16174 id-expression
16176 The representation is that of an assignment-expression, type-id, or
16177 id-expression -- except that the qualified id-expression is
16178 evaluated, so that the value returned is either a DECL or an
16179 OVERLOAD.
16181 Although the standard says "assignment-expression", it forbids
16182 throw-expressions or assignments in the template argument.
16183 Therefore, we use "conditional-expression" instead. */
16185 static tree
16187 {
16188 tree argument;
16194 cp_id_kind idk;
16196 /* There's really no way to know what we're looking at, so we just
16197 try each alternative in order.
16199 [temp.arg]
16201 In a template-argument, an ambiguity between a type-id and an
16202 expression is resolved to a type-id, regardless of the form of
16203 the corresponding template-parameter.
16205 Therefore, we try a type-id first. */
16208 /* If there was no error parsing the type-id but the next token is a
16209 '>>', our behavior depends on which dialect of C++ we're
16210 parsing. In C++98, we probably found a typo for '> >'. But there
16211 are type-id which are also valid expressions. For instance:
16213 struct X { int operator >> (int); };
16214 template <int V> struct Foo {};
16215 Foo<X () >> 5> r;
16217 Here 'X()' is a valid type-id of a function type, but the user just
16218 wanted to write the expression "X() >> 5". Thus, we remember that we
16219 found a valid type-id, but we still try to parse the argument as an
16220 expression to see what happens.
16222 In C++0x, the '>>' will be considered two separate '>'
16223 tokens. */
16227 {
16230 }
16231 else
16232 {
16233 /* If the next token isn't a `,' or a `>', then this argument wasn't
16234 really finished. This means that the argument is not a valid
16235 type-id. */
16238 /* If that worked, we're done. */
16241 }
16242 /* We're still not sure what the argument will be. */
16244 /* Try a template. */
16252 /* If the next token isn't a `,' or a `>', then this argument wasn't
16253 really finished. */
16257 {
16258 /* Figure out what is being referred to. If the id-expression
16259 was for a class template specialization, then we will have a
16260 TYPE_DECL at this point. There is no need to do name lookup
16261 at this point in that case. */
16264 none_type,
16270 /* Handle a constrained-type-specifier for a non-type template
16271 parameter. */
16277 }
16279 {
16283 }
16284 /* It must be a non-type argument. In C++17 any constant-expression is
16285 allowed. */
16289 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16291 -- an integral constant-expression of integral or enumeration
16292 type; or
16294 -- the name of a non-type template-parameter; or
16296 -- the name of an object or function with external linkage...
16298 -- the address of an object or function with external linkage...
16300 -- a pointer to member... */
16301 /* Look for a non-type template parameter. */
16303 {
16315 }
16317 /* If the next token is "&", the argument must be the address of an
16318 object or function with external linkage. */
16321 {
16324 }
16325 /* See if we might have an id-expression. */
16332 {
16335 address_p,
16342 else
16343 {
16344 tree probe;
16347 {
16348 /* Strip the dereference temporarily. */
16351 }
16353 /* If we're in a template, we represent a qualified-id referring
16354 to a static data member as a SCOPE_REF even if the scope isn't
16355 dependent so that we can check access control later. */
16360 {
16361 /* A variable without external linkage might still be a
16362 valid constant-expression, so no error is issued here
16363 if the external-linkage check fails. */
16366 }
16368 /* All overloaded functions are allowed; if the external
16369 linkage test does not pass, an error will be issued
16370 later. */
16371 ;
16375 /* A pointer-to-member. */
16376 ;
16378 ;
16379 else
16383 {
16386 tf_warning_or_error);
16387 else
16390 }
16391 }
16392 }
16393 /* If the argument started with "&", there are no other valid
16394 alternatives at this point. */
16396 {
16399 }
16401 general_expr:
16402 /* If the argument wasn't successfully parsed as a type-id followed
16403 by '>>', the argument can only be a constant expression now.
16404 Otherwise, we try parsing the constant-expression tentatively,
16405 because the argument could really be a type-id. */
16411 else
16412 {
16413 /* With C++17 generalized non-type template arguments we need to handle
16414 lvalue constant expressions, too. */
16417 }
16425 /* We did our best to parse the argument as a non type-id, but that
16426 was the only alternative that matched (albeit with a '>' after
16427 it). We can assume it's just a typo from the user, and a
16428 diagnostic will then be issued. */
16430 }
16432 /* Parse an explicit-instantiation.
16434 explicit-instantiation:
16435 template declaration
16437 Although the standard says `declaration', what it really means is:
16439 explicit-instantiation:
16440 template decl-specifier-seq [opt] declarator [opt] ;
16442 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16443 supposed to be allowed. A defect report has been filed about this
16444 issue.
16446 GNU Extension:
16448 explicit-instantiation:
16449 storage-class-specifier template
16450 decl-specifier-seq [opt] declarator [opt] ;
16451 function-specifier template
16452 decl-specifier-seq [opt] declarator [opt] ; */
16454 static void
16456 {
16458 cp_decl_specifier_seq decl_specifiers;
16463 /* Look for an (optional) storage-class-specifier or
16464 function-specifier. */
16466 {
16467 extension_specifier
16470 extension_specifier
16473 }
16475 /* Look for the `template' keyword. */
16477 /* Let the front end know that we are processing an explicit
16478 instantiation. */
16480 /* [temp.explicit] says that we are supposed to ignore access
16481 control while processing explicit instantiation directives. */
16483 /* Parse a decl-specifier-seq. */
16485 CP_PARSER_FLAGS_OPTIONAL,
16488 /* If there was exactly one decl-specifier, and it declared a class,
16489 and there's no declarator, then we have an explicit type
16490 instantiation. */
16492 {
16493 tree type;
16497 /* Turn access control back on for names used during
16498 template instantiation. */
16503 }
16504 else
16505 {
16507 tree decl;
16509 /* Parse the declarator. */
16510 declarator
16521 {
16524 "explicit instantiation shall not use"
16528 "explicit instantiation shall not use"
16533 /* Turn access control back on for names used during
16534 template instantiation. */
16536 /* Do the explicit instantiation. */
16538 }
16539 else
16540 {
16542 /* Skip the body of the explicit instantiation. */
16544 }
16545 }
16546 /* We're done with the instantiation. */
16552 }
16554 /* Parse an explicit-specialization.
16556 explicit-specialization:
16557 template < > declaration
16559 Although the standard says `declaration', what it really means is:
16561 explicit-specialization:
16562 template <> decl-specifier [opt] init-declarator [opt] ;
16563 template <> function-definition
16564 template <> explicit-specialization
16565 template <> template-declaration */
16567 static void
16569 {
16573 /* Look for the `template' keyword. */
16575 /* Look for the `<'. */
16577 /* Look for the `>'. */
16579 /* We have processed another parameter list. */
16581 /* [temp]
16583 A template ... explicit specialization ... shall not have C
16584 linkage. */
16586 {
16588 /* Give it C++ linkage to avoid confusing other parts of the
16589 front end. */
16592 }
16593 else
16595 /* Let the front end know that we are beginning a specialization. */
16597 {
16600 }
16602 /* If the next keyword is `template', we need to figure out whether
16603 or not we're looking a template-declaration. */
16605 {
16610 else
16612 }
16613 else
16614 /* Parse the dependent declaration. */
16620 /* We're done with the specialization. */
16622 /* For the erroneous case of a template with C linkage, we pushed an
16623 implicit C++ linkage scope; exit that scope now. */
16626 /* We're done with this parameter list. */
16628 }
16630 /* Parse a type-specifier.
16632 type-specifier:
16633 simple-type-specifier
16634 class-specifier
16635 enum-specifier
16636 elaborated-type-specifier
16637 cv-qualifier
16639 GNU Extension:
16641 type-specifier:
16642 __complex__
16644 Returns a representation of the type-specifier. For a
16645 class-specifier, enum-specifier, or elaborated-type-specifier, a
16646 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16648 The parser flags FLAGS is used to control type-specifier parsing.
16650 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16651 in a decl-specifier-seq.
16653 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16654 class-specifier, enum-specifier, or elaborated-type-specifier, then
16655 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16656 if a type is declared; 2 if it is defined. Otherwise, it is set to
16657 zero.
16659 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16660 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16661 is set to FALSE. */
16663 static tree
16665 cp_parser_flags flags,
16670 {
16676 /* Assume this type-specifier does not declare a new type. */
16679 /* And that it does not specify a cv-qualifier. */
16682 /* Peek at the next token. */
16685 /* If we're looking at a keyword, we can use that to guide the
16686 production we choose. */
16689 {
16694 /* Look for the enum-specifier. */
16696 /* If that worked, we're done. */
16698 {
16703 type_spec,
16704 token,
16707 }
16708 else
16711 /* Any of these indicate either a class-specifier, or an
16712 elaborated-type-specifier. */
16719 /* Parse tentatively so that we can back up if we don't find a
16720 class-specifier. */
16722 /* Look for the class-specifier. */
16725 /* If that worked, we're done. */
16727 {
16732 type_spec,
16733 token,
16736 }
16738 /* Fall through. */
16739 elaborated_type_specifier:
16740 /* We're declaring (not defining) a class or enum. */
16744 /* Fall through. */
16746 /* Look for an elaborated-type-specifier. */
16747 type_spec
16748 = (cp_parser_elaborated_type_specifier
16751 is_declaration));
16754 type_spec,
16755 token,
16778 /* The `__complex__' keyword is a GNU extension. */
16784 }
16786 /* Handle simple keywords. */
16788 {
16790 {
16793 }
16795 }
16797 /* If we do not already have a type-specifier, assume we are looking
16798 at a simple-type-specifier. */
16800 decl_specs,
16801 flags);
16803 /* If we didn't find a type-specifier, and a type-specifier was not
16804 optional in this context, issue an error message. */
16806 {
16809 }
16812 }
16814 /* Parse a simple-type-specifier.
16816 simple-type-specifier:
16817 :: [opt] nested-name-specifier [opt] type-name
16818 :: [opt] nested-name-specifier template template-id
16819 char
16820 wchar_t
16821 bool
16822 short
16823 int
16824 long
16825 signed
16826 unsigned
16827 float
16828 double
16829 void
16831 C++11 Extension:
16833 simple-type-specifier:
16834 auto
16835 decltype ( expression )
16836 char16_t
16837 char32_t
16838 __underlying_type ( type-id )
16840 C++17 extension:
16842 nested-name-specifier(opt) template-name
16844 GNU Extension:
16846 simple-type-specifier:
16847 __int128
16848 __typeof__ unary-expression
16849 __typeof__ ( type-id )
16850 __typeof__ ( type-id ) { initializer-list , [opt] }
16852 Concepts Extension:
16854 simple-type-specifier:
16855 constrained-type-specifier
16857 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16858 appropriately updated. */
16860 static tree
16863 cp_parser_flags flags)
16864 {
16869 /* Peek at the next token. */
16872 /* If we're looking at a keyword, things are easy. */
16874 {
16909 {
16912 }
16941 {
16942 /* The 'auto' might be the placeholder return type for a function decl
16943 with trailing return type. */
16952 {
16954 {
16961 }
16964 {
16967 }
16970 }
16974 {
16977 }
16980 {
16983 }
16984 else
16988 {
16991 "use of %<auto%> in lambda parameter declaration "
16992 "only available with "
16994 }
16997 "use of %<auto%> in parameter declaration "
16998 "only available with "
17002 "ISO C++ forbids use of %<auto%> in parameter "
17004 }
17005 else
17010 /* Since DR 743, decltype can either be a simple-type-specifier by
17011 itself or begin a nested-name-specifier. Parsing it will replace
17012 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17013 handling below decide what to do. */
17019 /* Consume the `typeof' token. */
17021 /* Parse the operand to `typeof'. */
17023 /* If it is not already a TYPE, take its type. */
17029 token,
17038 token,
17048 token,
17053 }
17055 /* If token is an already-parsed decltype not followed by ::,
17056 it's a simple-type-specifier. */
17059 {
17062 {
17064 token,
17066 /* Remember that we are handling a decltype in order to
17067 implement the resolution of DR 1510 when the argument
17068 isn't instantiation dependent. */
17070 }
17073 }
17075 /* If the type-specifier was for a built-in type, we're done. */
17077 {
17078 /* Record the type. */
17085 type,
17086 token,
17091 /* Consume the token. */
17097 /* There is no valid C++ program where a non-template type is
17098 followed by a "<". That usually indicates that the user thought
17099 that the type was a template. */
17104 }
17106 /* The type-specifier must be a user-defined type. */
17108 {
17112 /* Don't gobble tokens or issue error messages if this is an
17113 optional type-specifier. */
17119 /* Look for the optional `::' operator. */
17120 global_p
17124 /* Look for the nested-name specifier. */
17125 qualified_p
17132 /* If we have seen a nested-name-specifier, and the next token
17133 is `template', then we are using the template-id production. */
17136 {
17137 /* Look for the template-id. */
17141 none_type,
17143 /* If the template-id did not name a type, we are out of
17144 luck. */
17146 {
17149 }
17150 }
17151 /* Otherwise, look for a type-name. */
17152 else
17154 /* Keep track of all name-lookups performed in class scopes. */
17156 && !global_p
17157 && !qualified_p
17161 /* If it didn't work out, we don't have a TYPE. */
17166 {
17180 {
17182 none_type,
17192 else
17193 {
17198 }
17199 }
17200 else
17206 }
17209 token,
17211 }
17213 /* If we didn't get a type-name, issue an error message. */
17215 {
17218 }
17221 {
17222 /* See if TYPE is an Objective-C type, and if so, parse and
17223 accept any protocol references following it. Do this before
17224 the cp_parser_check_for_invalid_template_id() call, because
17225 Objective-C types can be followed by '<...>' which would
17226 enclose protocol names rather than template arguments, and so
17227 everything is fine. */
17230 {
17234 /* Clobber the "unqualified" type previously entered into
17235 DECL_SPECS with the new, improved protocol-qualified version. */
17240 }
17242 /* There is no valid C++ program where a non-template type is
17243 followed by a "<". That usually indicates that the user
17244 thought that the type was a template. */
17246 none_type,
17248 }
17251 }
17253 /* Parse a type-name.
17255 type-name:
17256 class-name
17257 enum-name
17258 typedef-name
17259 simple-template-id [in c++0x]
17261 enum-name:
17262 identifier
17264 typedef-name:
17265 identifier
17267 Concepts:
17269 type-name:
17270 concept-name
17271 partial-concept-id
17273 concept-name:
17274 identifier
17276 Returns a TYPE_DECL for the type. */
17278 static tree
17280 {
17282 }
17284 /* See above. */
17285 static tree
17287 {
17288 tree type_decl;
17290 /* We can't know yet whether it is a class-name or not. */
17292 /* Try a class-name. */
17294 typename_keyword_p,
17296 none_type,
17300 /* If it's not a class-name, keep looking. */
17302 {
17304 /* It must be a typedef-name or an enum-name. */
17308 /* It is either a simple-template-id representing an
17309 instantiation of an alias template... */
17313 none_type,
17315 /* Note that this must be an instantiation of an alias template
17316 because [temp.names]/6 says:
17318 A template-id that names an alias template specialization
17319 is a type-name.
17321 Whereas [temp.names]/7 says:
17323 A simple-template-id that names a class template
17324 specialization is a class-name.
17326 With concepts, this could also be a partial-concept-id that
17327 declares a non-type template parameter. */
17334 else
17338 /* ... Or a typedef-name or an enum-name. */
17340 }
17343 }
17345 /* Check if DECL and ARGS can form a constrained-type-specifier.
17346 If ARGS is non-null, we try to form a concept check of the
17347 form DECL<?, ARGS> where ? is a wildcard that matches any
17348 kind of template argument. If ARGS is NULL, then we try to
17349 form a concept check of the form DECL<?>. */
17351 static tree
17354 {
17357 /* If we a constrained-type-specifier cannot be deduced. */
17361 /* A constrained type specifier can only be found in an
17362 overload set or as a reference to a template declaration.
17364 FIXME: This might be masking a bug. It's possible that
17365 that the deduction below is causing template specializations
17366 to be formed with the wildcard as an argument. */
17370 /* Try to build a call expression that evaluates the
17371 concept. This can fail if the overload set refers
17372 only to non-templates. */
17378 /* Deduce the checked constraint and the prototype parameter.
17380 FIXME: In certain cases, failure to deduce should be a
17381 diagnosable error. */
17382 tree conc;
17383 tree proto;
17387 /* In template parameter scope, this results in a constrained
17388 parameter. Return a descriptor of that parm. */
17392 /* In a parameter-declaration-clause, constrained-type
17393 specifiers result in invented template parameters. */
17395 {
17398 }
17399 else
17400 {
17401 /* Otherwise, we're in a context where the constrained
17402 type name is deduced and the constraint applies
17403 after deduction. */
17405 }
17408 }
17410 /* If DECL refers to a concept, return a TYPE_DECL representing
17411 the result of using the constrained type specifier in the
17412 current context. DECL refers to a concept if
17414 - it is an overload set containing a function concept taking a single
17415 type argument, or
17417 - it is a variable concept taking a single type argument. */
17419 static tree
17421 {
17427 else
17429 }
17431 /* Check if DECL and ARGS form a partial-concept-id. If so,
17432 assign ID to the resulting constrained placeholder.
17434 Returns true if the partial-concept-id designates a placeholder
17435 and false otherwise. Note that *id is set to NULL_TREE in
17436 this case. */
17438 static tree
17440 {
17442 }
17444 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17445 or a concept-name.
17447 enum-name:
17448 identifier
17450 typedef-name:
17451 identifier
17453 concept-name:
17454 identifier
17456 Returns a TYPE_DECL for the type. */
17458 static tree
17460 {
17461 tree type_decl;
17462 tree identifier;
17469 /* Look up the type-name. */
17474 /* If we found an overload set, then it may refer to a concept-name. */
17480 {
17481 /* See if this is an Objective-C type. */
17486 }
17488 /* Issue an error if we did not find a type-name. */
17490 /* In Objective-C, we have the complication that class names are
17491 normally type names and start declarations (eg, the
17492 "NSObject" in "NSObject *object;"), but can be used in an
17493 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17494 is an expression. So, a classname followed by a dot is not a
17495 valid type-name. */
17498 {
17503 }
17504 /* Remember that the name was used in the definition of the
17505 current class so that we can check later to see if the
17506 meaning would have been different after the class was
17507 entirely defined. */
17513 }
17515 /* Parse an elaborated-type-specifier. Note that the grammar given
17516 here incorporates the resolution to DR68.
17518 elaborated-type-specifier:
17519 class-key :: [opt] nested-name-specifier [opt] identifier
17520 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17521 enum-key :: [opt] nested-name-specifier [opt] identifier
17522 typename :: [opt] nested-name-specifier identifier
17523 typename :: [opt] nested-name-specifier template [opt]
17524 template-id
17526 GNU extension:
17528 elaborated-type-specifier:
17529 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17530 class-key attributes :: [opt] nested-name-specifier [opt]
17531 template [opt] template-id
17532 enum attributes :: [opt] nested-name-specifier [opt] identifier
17534 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17535 declared `friend'. If IS_DECLARATION is TRUE, then this
17536 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17537 something is being declared.
17539 Returns the TYPE specified. */
17541 static tree
17545 {
17547 tree identifier;
17550 tree globalscope;
17553 /* See if we're looking at the `enum' keyword. */
17555 {
17556 /* Consume the `enum' token. */
17558 /* Remember that it's an enumeration type. */
17560 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17561 enums) is used here. */
17565 {
17572 /* Consume the `struct' or `class' and parse it anyway. */
17574 }
17575 /* Parse the attributes. */
17577 }
17578 /* Or, it might be `typename'. */
17580 RID_TYPENAME))
17581 {
17582 /* Consume the `typename' token. */
17584 /* Remember that it's a `typename' type. */
17586 }
17587 /* Otherwise it must be a class-key. */
17588 else
17589 {
17593 /* Parse the attributes. */
17595 }
17597 /* Look for the `::' operator. */
17600 /* Look for the nested-name-specifier. */
17601 tree nested_name_specifier;
17603 {
17604 nested_name_specifier
17609 is_declaration);
17612 }
17613 else
17614 /* Even though `typename' is not present, the proposed resolution
17615 to Core Issue 180 says that in `class A<T>::B', `B' should be
17616 considered a type-name, even if `A<T>' is dependent. */
17617 nested_name_specifier
17622 is_declaration);
17623 /* For everything but enumeration types, consider a template-id.
17624 For an enumeration type, consider only a plain identifier. */
17626 {
17628 tree decl;
17630 /* Allow the `template' keyword. */
17632 /* If we didn't see `template', we don't know if there's a
17633 template-id or not. */
17636 /* Parse the template-id. */
17640 tag_type,
17641 is_declaration);
17642 /* If we didn't find a template-id, look for an ordinary
17643 identifier. */
17645 ;
17646 /* We can get here when cp_parser_template_id, called by
17647 cp_parser_class_name with tag_type == none_type, succeeds
17648 and caches a BASELINK. Then, when called again here,
17649 instead of failing and returning an error_mark_node
17650 returns it (see template/typename17.C in C++11).
17651 ??? Could we diagnose this earlier? */
17653 {
17656 }
17657 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17658 in effect, then we must assume that, upon instantiation, the
17659 template will correspond to a class. */
17663 typename_type,
17665 /* If the `typename' keyword is in effect and DECL is not a type
17666 decl, then type is non existent. */
17668 ;
17670 {
17674 /* If the next token is a semicolon, this must be a specialization,
17675 instantiation, or friend declaration. Check the scope while we
17676 still know whether or not we had a nested-name-specifier. */
17681 }
17684 }
17687 {
17692 {
17695 }
17697 /* For a `typename', we needn't call xref_tag. */
17703 /* Template parameter lists apply only if we are not within a
17704 function parameter list. */
17705 bool template_parm_lists_apply
17714 /* Look up a qualified name in the usual way. */
17716 {
17717 tree decl;
17718 tree ambiguous_decls;
17721 tag_type,
17728 /* If the lookup was ambiguous, an error will already have been
17729 issued. */
17733 /* If we are parsing friend declaration, DECL may be a
17734 TEMPLATE_DECL tree node here. However, we need to check
17735 whether this TEMPLATE_DECL results in valid code. Consider
17736 the following example:
17738 namespace N {
17739 template <class T> class C {};
17740 }
17741 class X {
17742 template <class T> friend class N::C; // #1, valid code
17743 };
17744 template <class T> class Y {
17745 friend class N::C; // #2, invalid code
17746 };
17748 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17749 name lookup of `N::C'. We see that friend declaration must
17750 be template for the code to be valid. Note that
17751 processing_template_decl does not work here since it is
17752 always 1 for the above two cases. */
17754 decl = (cp_parser_maybe_treat_template_as_class
17759 {
17761 identifier,
17764 }
17767 {
17771 allow_template);
17775 }
17777 /* Forward declarations of nested types, such as
17779 class C1::C2;
17780 class C1::C2::C3;
17782 are invalid unless all components preceding the final '::'
17783 are complete. If all enclosing types are complete, these
17784 declarations become merely pointless.
17786 Invalid forward declarations of nested types are errors
17787 caught elsewhere in parsing. Those that are pointless arrive
17788 here. */
17795 }
17796 else
17797 {
17798 /* An elaborated-type-specifier sometimes introduces a new type and
17799 sometimes names an existing type. Normally, the rule is that it
17800 introduces a new type only if there is not an existing type of
17801 the same name already in scope. For example, given:
17803 struct S {};
17804 void f() { struct S s; }
17806 the `struct S' in the body of `f' is the same `struct S' as in
17807 the global scope; the existing definition is used. However, if
17808 there were no global declaration, this would introduce a new
17809 local class named `S'.
17811 An exception to this rule applies to the following code:
17813 namespace N { struct S; }
17815 Here, the elaborated-type-specifier names a new type
17816 unconditionally; even if there is already an `S' in the
17817 containing scope this declaration names a new type.
17818 This exception only applies if the elaborated-type-specifier
17819 forms the complete declaration:
17821 [class.name]
17823 A declaration consisting solely of `class-key identifier ;' is
17824 either a redeclaration of the name in the current scope or a
17825 forward declaration of the identifier as a class name. It
17826 introduces the name into the current scope.
17828 We are in this situation precisely when the next token is a `;'.
17830 An exception to the exception is that a `friend' declaration does
17831 *not* name a new type; i.e., given:
17833 struct S { friend struct T; };
17835 `T' is not a new type in the scope of `S'.
17837 Also, `new struct S' or `sizeof (struct S)' never results in the
17838 definition of a new type; a new type can only be declared in a
17839 declaration context. */
17841 tag_scope ts;
17845 /* Friends have special name lookup rules. */
17849 CPP_SEMICOLON))
17850 /* This is a `class-key identifier ;' */
17852 else
17855 template_p =
17856 (template_parm_lists_apply
17859 /* An unqualified name was used to reference this type, so
17860 there were no qualifying templates. */
17868 }
17869 }
17874 /* Allow attributes on forward declarations of classes. */
17876 {
17886 else
17889 }
17892 {
17893 /* Indicate whether this class was declared as a `class' or as a
17894 `struct'. */
17898 }
17900 /* A "<" cannot follow an elaborated type specifier. If that
17901 happens, the user was probably trying to form a template-id. */
17906 }
17908 /* Parse an enum-specifier.
17910 enum-specifier:
17911 enum-head { enumerator-list [opt] }
17912 enum-head { enumerator-list , } [C++0x]
17914 enum-head:
17915 enum-key identifier [opt] enum-base [opt]
17916 enum-key nested-name-specifier identifier enum-base [opt]
17918 enum-key:
17919 enum
17920 enum class [C++0x]
17921 enum struct [C++0x]
17923 enum-base: [C++0x]
17924 : type-specifier-seq
17926 opaque-enum-specifier:
17927 enum-key identifier enum-base [opt] ;
17929 GNU Extensions:
17930 enum-key attributes[opt] identifier [opt] enum-base [opt]
17931 { enumerator-list [opt] }attributes[opt]
17932 enum-key attributes[opt] identifier [opt] enum-base [opt]
17933 { enumerator-list, }attributes[opt] [C++0x]
17935 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17936 if the token stream isn't an enum-specifier after all. */
17938 static tree
17940 {
17941 tree identifier;
17943 tree prev_scope;
17945 tree attributes;
17958 /* Parse tentatively so that we can back up if we don't find a
17959 enum-specifier. */
17962 /* Caller guarantees that the current token is 'enum', an identifier
17963 possibly follows, and the token after that is an opening brace.
17964 If we don't have an identifier, fabricate an anonymous name for
17965 the enumeration being defined. */
17968 /* Parse the "class" or "struct", which indicates a scoped
17969 enumeration type in C++0x. */
17972 {
17976 /* Consume the `struct' or `class' token. */
17980 }
17984 /* Clear the qualification. */
17989 /* Figure out in what scope the declaration is being placed. */
17995 nested_name_specifier
18003 {
18004 tree name;
18008 enum_type,
18013 input_location);
18015 {
18018 {
18019 /* Are template enums allowed in ISO? */
18023 /* ignore a typename reference, for it will be solved by name
18024 in start_enum. */
18026 }
18027 }
18030 else
18031 {
18036 }
18037 }
18038 else
18039 {
18042 else
18043 {
18049 }
18050 }
18053 /* Check for the `:' that denotes a specified underlying type in C++0x.
18054 Note that a ':' could also indicate a bitfield width, however. */
18056 {
18057 cp_decl_specifier_seq type_specifiers;
18059 /* Consume the `:'. */
18062 /* Parse the type-specifier-seq. */
18067 /* At this point this is surely not elaborated type specifier. */
18076 /* If that didn't work, stop. */
18078 {
18084 }
18085 }
18087 /* Look for the `{' but don't consume it yet. */
18089 {
18091 {
18094 {
18097 }
18098 }
18099 /* An opaque-enum-specifier must have a ';' here. */
18102 {
18105 {
18108 }
18109 }
18110 }
18116 {
18118 {
18122 }
18124 {
18126 }
18127 }
18129 /* Issue an error message if type-definitions are forbidden here. */
18132 else
18133 /* Create the new type. We do this before consuming the opening
18134 brace so the enum will be recorded as being on the line of its
18135 tag (or the 'enum' keyword, if there is no tag). */
18139 /* If the next token is not '{' it is an opaque-enum-specifier or an
18140 elaborated-type-specifier. */
18142 {
18146 {
18147 /* The following catches invalid code such as:
18148 enum class S<int>::E { A, B, C }; */
18156 {
18160 nested_name_specifier);
18162 }
18165 {
18167 "%qT for enum declaration does not name a class "
18170 }
18171 /* If that scope does not contain the scope in which the
18172 class was originally declared, the program is invalid. */
18174 nested_name_specifier))
18175 {
18178 "declaration of %qD in namespace %qD which does not "
18181 else
18183 "declaration of %qD in %qD which does not "
18187 }
18188 /* If that scope is the scope where the declaration is being placed
18189 the program is invalid. */
18193 {
18197 }
18198 }
18203 /* Consume the opening brace. */
18204 matching_braces braces;
18211 {
18215 }
18216 else
18217 {
18223 }
18227 /* If the next token is not '}', then there are some enumerators. */
18229 {
18233 }
18234 else
18237 /* Consume the final '}'. */
18243 }
18244 else
18245 {
18246 /* If a ';' follows, then it is an opaque-enum-specifier
18247 and additional restrictions apply. */
18249 {
18256 }
18257 }
18259 /* Look for trailing attributes to apply to this enumeration, and
18260 apply them if appropriate. */
18262 {
18265 trailing_attr,
18267 }
18269 /* Finish up the enumeration. */
18271 {
18276 }
18279 {
18281 {
18284 }
18286 {
18288 }
18289 }
18290 out:
18293 }
18295 /* Parse an enumerator-list. The enumerators all have the indicated
18296 TYPE.
18298 enumerator-list:
18299 enumerator-definition
18300 enumerator-list , enumerator-definition */
18302 static void
18304 {
18306 {
18307 /* Parse an enumerator-definition. */
18310 /* If the next token is not a ',', we've reached the end of
18311 the list. */
18314 /* Otherwise, consume the `,' and keep going. */
18316 /* If the next token is a `}', there is a trailing comma. */
18318 {
18323 }
18324 }
18325 }
18327 /* Parse an enumerator-definition. The enumerator has the indicated
18328 TYPE.
18330 enumerator-definition:
18331 enumerator
18332 enumerator = constant-expression
18334 enumerator:
18335 identifier
18337 GNU Extensions:
18339 enumerator-definition:
18340 enumerator attributes [opt]
18341 enumerator attributes [opt] = constant-expression */
18343 static void
18345 {
18346 tree identifier;
18347 tree value;
18348 location_t loc;
18350 /* Save the input location because we are interested in the location
18351 of the identifier and not the location of the explicit value. */
18354 /* Look for the identifier. */
18359 /* Parse any specified attributes. */
18362 /* If the next token is an '=', then there is an explicit value. */
18364 {
18365 /* Consume the `=' token. */
18367 /* Parse the value. */
18369 }
18370 else
18373 /* If we are processing a template, make sure the initializer of the
18374 enumerator doesn't contain any bare template parameter pack. */
18378 /* Create the enumerator. */
18380 }
18382 /* Parse a namespace-name.
18384 namespace-name:
18385 original-namespace-name
18386 namespace-alias
18388 Returns the NAMESPACE_DECL for the namespace. */
18390 static tree
18392 {
18393 tree identifier;
18394 tree namespace_decl;
18398 /* Get the name of the namespace. */
18403 /* Look up the identifier in the currently active scope. Look only
18404 for namespaces, due to:
18406 [basic.lookup.udir]
18408 When looking up a namespace-name in a using-directive or alias
18409 definition, only namespace names are considered.
18411 And:
18413 [basic.lookup.qual]
18415 During the lookup of a name preceding the :: scope resolution
18416 operator, object, function, and enumerator names are ignored.
18418 (Note that cp_parser_qualifying_entity only calls this
18419 function if the token after the name is the scope resolution
18420 operator.) */
18422 none_type,
18428 /* If it's not a namespace, issue an error. */
18431 {
18436 }
18439 }
18441 /* Parse a namespace-definition.
18443 namespace-definition:
18444 named-namespace-definition
18445 unnamed-namespace-definition
18447 named-namespace-definition:
18448 original-namespace-definition
18449 extension-namespace-definition
18451 original-namespace-definition:
18452 namespace identifier { namespace-body }
18454 extension-namespace-definition:
18455 namespace original-namespace-name { namespace-body }
18457 unnamed-namespace-definition:
18458 namespace { namespace-body } */
18460 static void
18462 {
18463 tree identifier;
18472 {
18475 }
18477 /* Look for the `namespace' keyword. */
18478 cp_token* token
18481 /* Parse any specified attributes before the identifier. */
18485 {
18489 {
18492 /* Parse any attributes specified after the identifier. */
18494 }
18501 "nested namespace definitions only available with "
18504 /* Nested namespace names can create new namespaces (unlike
18505 other qualified-ids). */
18508 else
18511 }
18523 /* Start the namespace. */
18530 /* Look for the `{' to validate starting the namespace. */
18531 matching_braces braces;
18533 {
18534 /* Parse the body of the namespace. */
18537 /* Look for the final `}'. */
18539 }
18544 /* Pop the nested namespace definitions. */
18547 }
18549 /* Parse a namespace-body.
18551 namespace-body:
18552 declaration-seq [opt] */
18554 static void
18556 {
18558 }
18560 /* Parse a namespace-alias-definition.
18562 namespace-alias-definition:
18563 namespace identifier = qualified-namespace-specifier ; */
18565 static void
18567 {
18568 tree identifier;
18569 tree namespace_specifier;
18573 /* Look for the `namespace' keyword. */
18575 /* Look for the identifier. */
18579 /* Look for the `=' token. */
18582 {
18584 /* Skip the definition. */
18589 }
18591 /* Look for the qualified-namespace-specifier. */
18592 namespace_specifier
18594 /* Look for the `;' token. */
18597 /* Register the alias in the symbol table. */
18599 }
18601 /* Parse a qualified-namespace-specifier.
18603 qualified-namespace-specifier:
18604 :: [opt] nested-name-specifier [opt] namespace-name
18606 Returns a NAMESPACE_DECL corresponding to the specified
18607 namespace. */
18609 static tree
18611 {
18612 /* Look for the optional `::'. */
18616 /* Look for the optional nested-name-specifier. */
18624 }
18626 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18627 access declaration.
18629 using-declaration:
18630 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18631 using :: unqualified-id ;
18633 access-declaration:
18634 qualified-id ;
18636 */
18638 static bool
18641 {
18645 tree decl;
18646 tree identifier;
18647 tree qscope;
18652 {
18655 }
18656 else
18657 {
18658 /* Look for the `using' keyword. */
18661 again:
18662 /* Peek at the next token. */
18664 /* See if it's `typename'. */
18666 {
18667 /* Remember that we've seen it. */
18669 /* Consume the `typename' token. */
18671 }
18672 }
18674 /* Look for the optional global scope qualification. */
18675 global_scope_p
18680 /* If we saw `typename', or didn't see `::', then there must be a
18681 nested-name-specifier present. */
18683 {
18689 {
18692 }
18693 }
18694 /* Otherwise, we could be in either of the two productions. In that
18695 case, treat the nested-name-specifier as optional. */
18696 else
18708 /* Something has already gone wrong; there's no need to parse
18709 further. Since an error has occurred, the return value of
18710 cp_parser_parse_definitely will be false, as required. */
18714 /* Parse the unqualified-id. */
18722 {
18727 }
18729 {
18734 "pack expansion in using-declaration only available "
18737 }
18739 /* The function we call to handle a using-declaration is different
18740 depending on what scope we are in. */
18742 ;
18745 /* [namespace.udecl]
18747 A using declaration shall not name a template-id. */
18750 else
18751 {
18753 {
18754 /* Create the USING_DECL. */
18761 {
18764 }
18765 else
18766 /* Add it to the list of members in this class. */
18768 }
18769 else
18770 {
18772 identifier,
18779 {
18782 }
18785 else
18787 }
18788 }
18792 {
18796 "comma-separated list in using-declaration only available "
18799 }
18801 /* Look for the final `;'. */
18806 "access declarations are deprecated "
18807 "in favour of using-declarations; "
18811 }
18813 /* Parse an alias-declaration.
18815 alias-declaration:
18816 using identifier attribute-specifier-seq [opt] = type-id */
18818 static tree
18820 {
18822 location_t id_location;
18824 cp_decl_specifier_seq decl_specs;
18828 /* Look for the `using' keyword. */
18829 cp_token *using_token
18851 /* Now we are going to parse the type-id of the declaration. */
18853 /*
18854 [dcl.type]/3 says:
18856 "A type-specifier-seq shall not define a class or enumeration
18857 unless it appears in the type-id of an alias-declaration (7.1.3) that
18858 is not the declaration of a template-declaration."
18860 In other words, if we currently are in an alias template, the
18861 type-id should not define a type.
18863 So let's set parser->type_definition_forbidden_message in that
18864 case; cp_parser_check_type_definition (called by
18865 cp_parser_class_specifier) will then emit an error if a type is
18866 defined in the type-id. */
18868 {
18872 }
18876 /* Restore the error message if need be. */
18882 {
18885 }
18887 /* A typedef-name can also be introduced by an alias-declaration. The
18888 identifier following the using keyword becomes a typedef-name. It has
18889 the same semantics as if it were introduced by the typedef
18890 specifier. In particular, it does not define a new type and it shall
18891 not appear in the type-id. */
18896 {
18899 ds_attribute,
18900 attrs_token);
18901 }
18903 ds_typedef,
18904 using_token);
18906 ds_alias,
18907 using_token);
18916 else
18922 // Attach constraints to the alias declaration.
18924 {
18928 }
18935 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18936 added into the symbol table; otherwise, return the TYPE_DECL. */
18940 {
18944 }
18947 }
18949 /* Parse a using-directive.
18951 using-directive:
18952 using namespace :: [opt] nested-name-specifier [opt]
18953 namespace-name ; */
18955 static void
18957 {
18958 tree namespace_decl;
18959 tree attribs;
18961 /* Look for the `using' keyword. */
18963 /* And the `namespace' keyword. */
18965 /* Look for the optional `::' operator. */
18967 /* And the optional nested-name-specifier. */
18973 /* Get the namespace being used. */
18975 /* And any specified attributes. */
18978 /* Update the symbol table. */
18981 else
18984 /* Look for the final `;'. */
18986 }
18988 /* Parse an asm-definition.
18990 asm-definition:
18991 asm ( string-literal ) ;
18993 GNU Extension:
18995 asm-definition:
18996 asm volatile [opt] ( string-literal ) ;
18997 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18998 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18999 : asm-operand-list [opt] ) ;
19000 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19001 : asm-operand-list [opt]
19002 : asm-clobber-list [opt] ) ;
19003 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19004 : asm-clobber-list [opt]
19005 : asm-goto-list ) ; */
19007 static void
19009 {
19010 tree string;
19015 tree asm_stmt;
19023 /* Look for the `asm' keyword. */
19028 {
19031 }
19033 /* See if the next token is `volatile'. */
19036 {
19037 /* Remember that we saw the `volatile' keyword. */
19039 /* Consume the token. */
19041 }
19045 {
19046 /* Remember that we saw the `goto' keyword. */
19048 /* Consume the token. */
19050 }
19051 /* Look for the opening `('. */
19054 /* Look for the string. */
19057 {
19061 }
19063 /* If we're allowing GNU extensions, check for the extended assembly
19064 syntax. Unfortunately, the `:' tokens need not be separated by
19065 a space in C, and so, for compatibility, we tolerate that here
19066 too. Doing that means that we have to treat the `::' operator as
19067 two `:' tokens. */
19072 {
19077 /* The extended syntax was used. */
19080 /* Look for outputs. */
19082 {
19083 /* Consume the `:'. */
19085 /* Parse the output-operands. */
19087 CPP_COLON)
19089 CPP_SCOPE)
19091 CPP_CLOSE_PAREN)
19093 {
19097 }
19098 }
19099 /* If the next token is `::', there are no outputs, and the
19100 next token is the beginning of the inputs. */
19102 /* The inputs are coming next. */
19105 /* Look for inputs. */
19108 {
19109 /* Consume the `:' or `::'. */
19111 /* Parse the output-operands. */
19113 CPP_COLON)
19115 CPP_SCOPE)
19117 CPP_CLOSE_PAREN))
19118 {
19122 }
19123 }
19125 /* The clobbers are coming next. */
19128 /* Look for clobbers. */
19131 {
19133 /* Consume the `:' or `::'. */
19135 /* Parse the clobbers. */
19137 CPP_COLON)
19139 CPP_CLOSE_PAREN))
19141 }
19144 /* The labels are coming next. */
19147 /* Look for labels. */
19150 {
19152 /* Consume the `:' or `::'. */
19154 /* Parse the labels. */
19156 }
19160 }
19164 /* Look for the closing `)'. */
19172 {
19173 /* Create the ASM_EXPR. */
19175 {
19178 /* If the extended syntax was not used, mark the ASM_EXPR. */
19180 {
19186 }
19187 }
19188 else
19190 }
19191 }
19193 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19194 type that comes from the decl-specifier-seq. */
19196 static tree
19198 {
19201 {
19214 }
19217 }
19219 /* Declarators [gram.dcl.decl] */
19221 /* Parse an init-declarator.
19223 init-declarator:
19224 declarator initializer [opt]
19226 GNU Extension:
19228 init-declarator:
19229 declarator asm-specification [opt] attributes [opt] initializer [opt]
19231 function-definition:
19232 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19233 function-body
19234 decl-specifier-seq [opt] declarator function-try-block
19236 GNU Extension:
19238 function-definition:
19239 __extension__ function-definition
19241 TM Extension:
19243 function-definition:
19244 decl-specifier-seq [opt] declarator function-transaction-block
19246 The DECL_SPECIFIERS apply to this declarator. Returns a
19247 representation of the entity declared. If MEMBER_P is TRUE, then
19248 this declarator appears in a class scope. The new DECL created by
19249 this declarator is returned.
19251 The CHECKS are access checks that should be performed once we know
19252 what entity is being declared (and, therefore, what classes have
19253 befriended it).
19255 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19256 for a function-definition here as well. If the declarator is a
19257 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19258 be TRUE upon return. By that point, the function-definition will
19259 have been completely parsed.
19261 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19262 is FALSE.
19264 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19265 parsed declaration if it is an uninitialized single declarator not followed
19266 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19267 if present, will not be consumed. If returned, this declarator will be
19268 created with SD_INITIALIZED but will not call cp_finish_decl.
19270 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19271 and there is an initializer, the pointed location_t is set to the
19272 location of the '=' or `(', or '{' in C++11 token introducing the
19273 initializer. */
19275 static tree
19286 {
19290 tree prefix_attributes;
19292 tree asm_specification;
19293 tree initializer;
19295 tree scope;
19297 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19298 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19299 "(...)". */
19310 /* Gather the attributes that were provided with the
19311 decl-specifiers. */
19314 /* Assume that this is not the declarator for a function
19315 definition. */
19319 /* Default arguments are only permitted for function parameters. */
19323 /* Defer access checks while parsing the declarator; we cannot know
19324 what names are accessible until we know what is being
19325 declared. */
19330 /* Parse the declarator. */
19331 declarator
19336 /* Gather up the deferred checks. */
19341 /* If the DECLARATOR was erroneous, there's no need to go
19342 further. */
19346 /* Check that the number of template-parameter-lists is OK. */
19356 /* Figure out what scope the entity declared by the DECLARATOR is
19357 located in. `grokdeclarator' sometimes changes the scope, so
19358 we compute it now. */
19361 /* Perform any lookups in the declared type which were thought to be
19362 dependent, but are not in the scope of the declarator. */
19363 decl_specifiers->type
19366 /* If we're allowing GNU extensions, look for an
19367 asm-specification. */
19369 {
19370 /* Look for an asm-specification. */
19373 }
19374 else
19377 /* Look for attributes. */
19381 /* Peek at the next token. */
19387 {
19388 /* Handle C++17 deduction guides. */
19392 {
19400 {
19404 }
19405 }
19407 /* Check to see if the token indicates the start of a
19408 function-definition. */
19410 {
19412 {
19413 /* If a function-definition should not appear here, issue an
19414 error message. */
19418 }
19420 location_t func_brace_location
19423 /* Neither attributes nor an asm-specification are allowed
19424 on a function-definition. */
19427 "an asm-specification is not allowed "
19431 "attributes are not allowed "
19433 /* This is a function-definition. */
19436 /* Parse the function definition. */
19439 decl_specifiers,
19440 declarator,
19441 prefix_attributes);
19442 else
19443 decl =
19444 (cp_parser_function_definition_from_specifiers_and_declarator
19448 {
19449 /* This is where the prologue starts... */
19452 }
19455 }
19456 }
19458 {
19459 /* A non-template declaration involving a function parameter list
19460 containing an implicit template parameter will be made into a
19461 template. If the resulting declaration is not going to be an
19462 actual function then finish the template scope here to prevent it.
19463 An error message will be issued once we have a decl to talk about.
19465 FIXME probably we should do type deduction rather than create an
19466 implicit template, but the standard currently doesn't allow it. */
19469 }
19471 /* [dcl.dcl]
19473 Only in function declarations for constructors, destructors, type
19474 conversions, and deduction guides can the decl-specifier-seq be omitted.
19476 We explicitly postpone this check past the point where we handle
19477 function-definitions because we tolerate function-definitions
19478 that are missing their return types in some modes. */
19480 {
19484 }
19486 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19490 {
19501 {
19507 }
19508 }
19509 else
19510 {
19511 /* If the init-declarator isn't initialized and isn't followed by a
19512 `,' or `;', it's not a valid init-declarator. */
19515 {
19518 else
19519 {
19523 }
19524 }
19527 }
19529 /* Because start_decl has side-effects, we should only call it if we
19530 know we're going ahead. By this point, we know that we cannot
19531 possibly be looking at any other construct. */
19534 /* Enter the newly declared entry in the symbol table. If we're
19535 processing a declaration in a class-specifier, we wait until
19536 after processing the initializer. */
19538 {
19546 /* Adjust location of decl if declarator->id_loc is more appropriate:
19547 set, and decl wasn't merged with another decl, in which case its
19548 location would be different from input_location, and more accurate. */
19553 }
19555 /* Enter the SCOPE. That way unqualified names appearing in the
19556 initializer will be looked up in SCOPE. */
19559 /* Perform deferred access control checks, now that we know in which
19560 SCOPE the declared entity resides. */
19562 {
19565 /* If the entity being declared is a function, pretend that we
19566 are in its scope. If it is a `friend', it may have access to
19567 things that would not otherwise be accessible. */
19569 {
19572 }
19574 /* Perform access checks for template parameters. */
19577 /* Perform the access control checks for the declarator and the
19578 decl-specifiers. */
19581 /* Restore the saved value. */
19584 }
19586 /* Parse the initializer. */
19591 {
19593 {
19596 else
19597 {
19598 /* If the declaration was erroneous, we don't really
19599 know what the user intended, so just silently
19600 consume the initializer. */
19607 }
19608 }
19609 else
19610 {
19611 /* We want to record the extra mangling scope for in-class
19612 initializers of class members and initializers of static data
19613 member templates. The former involves deferring
19614 parsing of the initializer until end of class as with default
19615 arguments. So right here we only handle the latter. */
19625 }
19626 }
19628 /* The old parser allows attributes to appear after a parenthesized
19629 initializer. Mark Mitchell proposed removing this functionality
19630 on the GCC mailing lists on 2002-08-13. This parser accepts the
19631 attributes -- but ignores them. */
19638 /* And now complain about a non-function implicit template. */
19643 /* For an in-class declaration, use `grokfield' to create the
19644 declaration. */
19646 {
19648 {
19651 }
19660 }
19662 /* Finish processing the declaration. But, skip member
19663 declarations. */
19665 {
19668 asm_specification,
19669 /* If the initializer is in parentheses, then this is
19670 a direct-initialization, which means that an
19671 `explicit' constructor is OK. Otherwise, an
19672 `explicit' constructor cannot be used. */
19675 }
19678 /* Core issue #226 (C++0x only): A default template-argument
19679 shall not be specified in a friend class template
19680 declaration. */
19689 {
19692 else
19694 }
19701 }
19703 /* Parse a declarator.
19705 declarator:
19706 direct-declarator
19707 ptr-operator declarator
19709 abstract-declarator:
19710 ptr-operator abstract-declarator [opt]
19711 direct-abstract-declarator
19713 GNU Extensions:
19715 declarator:
19716 attributes [opt] direct-declarator
19717 attributes [opt] ptr-operator declarator
19719 abstract-declarator:
19720 attributes [opt] ptr-operator abstract-declarator [opt]
19721 attributes [opt] direct-abstract-declarator
19723 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19724 detect constructors, destructors, deduction guides, or conversion operators.
19725 It is set to -1 if the declarator is a name, and +1 if it is a
19726 function. Otherwise it is set to zero. Usually you just want to
19727 test for >0, but internally the negative value is used.
19729 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19730 a decl-specifier-seq unless it declares a constructor, destructor,
19731 or conversion. It might seem that we could check this condition in
19732 semantic analysis, rather than parsing, but that makes it difficult
19733 to handle something like `f()'. We want to notice that there are
19734 no decl-specifiers, and therefore realize that this is an
19735 expression, not a declaration.)
19737 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19738 the declarator is a direct-declarator of the form "(...)".
19740 MEMBER_P is true iff this declarator is a member-declarator.
19742 FRIEND_P is true iff this declarator is a friend. */
19746 cp_parser_declarator_kind dcl_kind,
19750 {
19753 cp_cv_quals cv_quals;
19754 tree class_type;
19757 /* Assume this is not a constructor, destructor, or type-conversion
19758 operator. */
19765 /* Check for the ptr-operator production. */
19767 /* Parse the ptr-operator. */
19773 /* If that worked, then we have a ptr-operator. */
19775 {
19776 /* If a ptr-operator was found, then this declarator was not
19777 parenthesized. */
19780 /* The dependent declarator is optional if we are parsing an
19781 abstract-declarator. */
19785 /* Parse the dependent declarator. */
19790 friend_p);
19792 /* If we are parsing an abstract-declarator, we must handle the
19793 case where the dependent declarator is absent. */
19798 declarator = cp_parser_make_indirect_declarator
19800 }
19801 /* Everything else is a direct-declarator. */
19802 else
19803 {
19806 CPP_OPEN_PAREN);
19808 ctor_dtor_or_conv_p,
19810 }
19815 }
19817 /* Parse a direct-declarator or direct-abstract-declarator.
19819 direct-declarator:
19820 declarator-id
19821 direct-declarator ( parameter-declaration-clause )
19822 cv-qualifier-seq [opt]
19823 ref-qualifier [opt]
19824 exception-specification [opt]
19825 direct-declarator [ constant-expression [opt] ]
19826 ( declarator )
19828 direct-abstract-declarator:
19829 direct-abstract-declarator [opt]
19830 ( parameter-declaration-clause )
19831 cv-qualifier-seq [opt]
19832 ref-qualifier [opt]
19833 exception-specification [opt]
19834 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19835 ( abstract-declarator )
19837 Returns a representation of the declarator. DCL_KIND is
19838 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19839 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19840 we are parsing a direct-declarator. It is
19841 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19842 of ambiguity we prefer an abstract declarator, as per
19843 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19844 as for cp_parser_declarator. */
19848 cp_parser_declarator_kind dcl_kind,
19851 {
19861 {
19862 /* Peek at the next token. */
19865 {
19866 /* This is either a parameter-declaration-clause, or a
19867 parenthesized declarator. When we know we are parsing a
19868 named declarator, it must be a parenthesized declarator
19869 if FIRST is true. For instance, `(int)' is a
19870 parameter-declaration-clause, with an omitted
19871 direct-abstract-declarator. But `((*))', is a
19872 parenthesized abstract declarator. Finally, when T is a
19873 template parameter `(T)' is a
19874 parameter-declaration-clause, and not a parenthesized
19875 named declarator.
19877 We first try and parse a parameter-declaration-clause,
19878 and then try a nested declarator (if FIRST is true).
19880 It is not an error for it not to be a
19881 parameter-declaration-clause, even when FIRST is
19882 false. Consider,
19884 int i (int);
19885 int i (3);
19887 The first is the declaration of a function while the
19888 second is the definition of a variable, including its
19889 initializer.
19891 Having seen only the parenthesis, we cannot know which of
19892 these two alternatives should be selected. Even more
19893 complex are examples like:
19895 int i (int (a));
19896 int i (int (3));
19898 The former is a function-declaration; the latter is a
19899 variable initialization.
19901 Thus again, we try a parameter-declaration-clause, and if
19902 that fails, we back out and return. */
19905 {
19906 tree params;
19909 /* In a member-declarator, the only valid interpretation
19910 of a parenthesis is the start of a
19911 parameter-declaration-clause. (It is invalid to
19912 initialize a static data member with a parenthesized
19913 initializer; only the "=" form of initialization is
19914 permitted.) */
19918 /* Consume the `('. */
19919 matching_parens parens;
19922 {
19923 /* If this is going to be an abstract declarator, we're
19924 in a declarator and we can't have default args. */
19927 }
19931 /* Parse the parameter-declaration-clause. */
19934 /* Consume the `)'. */
19937 /* If all went well, parse the cv-qualifier-seq,
19938 ref-qualifier and the exception-specification. */
19940 {
19941 cp_cv_quals cv_quals;
19942 cp_virt_specifiers virt_specifiers;
19943 cp_ref_qualifier ref_qual;
19944 tree exception_specification;
19945 tree late_return;
19946 tree attrs;
19956 /* Parse the cv-qualifier-seq. */
19958 /* Parse the ref-qualifier. */
19960 /* Parse the tx-qualifier. */
19962 /* And the exception-specification. */
19963 exception_specification
19968 /* In here, we handle cases where attribute is used after
19969 the function declaration. For example:
19970 void func (int x) __attribute__((vector(..))); */
19974 {
19978 CPP_SEMICOLON)
19980 CPP_OPEN_BRACE))
19983 ;
19984 else
19986 }
19988 late_return = (cp_parser_late_return_type_opt
19992 /* Parse the virt-specifier-seq. */
19995 /* Create the function-declarator. */
19997 params,
19998 cv_quals,
19999 virt_specifiers,
20000 ref_qual,
20001 tx_qual,
20002 exception_specification,
20003 late_return,
20004 requires_clause);
20007 /* Any subsequent parameter lists are to do with
20008 return type, so are not those of the declared
20009 function. */
20011 }
20013 /* Remove the function parms from scope. */
20017 /* Repeat the main loop. */
20019 }
20021 /* If this is the first, we can try a parenthesized
20022 declarator. */
20024 {
20030 /* Consume the `('. */
20031 matching_parens parens;
20033 /* Parse the nested declarator. */
20036 declarator
20042 /* Expect a `)'. */
20049 }
20050 /* Otherwise, we must be done. */
20051 else
20053 }
20057 {
20058 /* Parse an array-declarator. */
20067 /* Consume the `['. */
20069 /* Peek at the next token. */
20071 /* If the next token is `]', then there is no
20072 constant-expression. */
20074 {
20076 bounds
20086 {
20087 /* Normally, the array bound must be an integral constant
20088 expression. However, as an extension, we allow VLAs
20089 in function scopes as long as they aren't part of a
20090 parameter declaration. */
20094 }
20097 {
20098 /* Remember this wasn't a constant-expression. */
20101 }
20102 }
20103 else
20105 /* Look for the closing `]'. */
20107 {
20110 }
20115 }
20117 {
20118 {
20119 tree qualifying_scope;
20120 tree unqualified_name;
20121 tree attrs;
20122 special_function_kind sfk;
20127 /* Parse a declarator-id */
20130 {
20133 /* If we see an ellipsis, we should be looking at a
20134 parameter pack. */
20136 {
20137 /* Consume the `...' */
20141 }
20142 }
20145 unqualified_name
20149 {
20153 {
20154 /* Check whether an error occurred. */
20157 /* We already consumed the ellipsis to mark a
20158 parameter pack, but we have no way to report it,
20159 so abort the tentative parse. We will be exiting
20160 immediately anyway. */
20162 }
20163 else
20169 && (qualifying_scope
20171 {
20174 }
20175 }
20180 {
20185 }
20191 {
20192 /* In the declaration of a member of a template class
20193 outside of the class itself, the SCOPE will sometimes
20194 be a TYPENAME_TYPE. For example, given:
20196 template <typename T>
20197 int S<T>::R::i = 3;
20199 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20200 this context, we must resolve S<T>::R to an ordinary
20201 type, rather than a typename type.
20203 The reason we normally avoid resolving TYPENAME_TYPEs
20204 is that a specialization of `S' might render
20205 `S<T>::R' not a type. However, if `S' is
20206 specialized, then this `i' will not be used, so there
20207 is no harm in resolving the types here. */
20208 tree type;
20210 /* Resolve the TYPENAME_TYPE. */
20213 /* If that failed, the declarator is invalid. */
20215 {
20218 "cannot define member of dependent typedef "
20220 else
20225 }
20227 }
20232 {
20233 tree class_type;
20238 else
20242 {
20246 {
20247 /* We do not attempt to print the declarator
20248 here because we do not have enough
20249 information about its original syntactic
20250 form. */
20254 }
20257 {
20261 "use %<%T::%D%> instead of %<%T::%D%> to "
20263 class_type,
20268 }
20270 }
20273 {
20280 for an unnamed type, even if the type
20281 got a name for linkage purposes. */
20283 /* Handle correctly (c++/19200):
20285 struct S {
20286 struct T{};
20287 friend void S(T);
20288 };
20290 and also:
20292 namespace N {
20293 void S();
20294 }
20296 struct S {
20297 friend void N::S();
20298 }; */
20301 class_type))
20310 }
20311 }
20313 unqualified_name,
20314 sfk);
20321 }
20323 handle_declarator:;
20326 {
20327 /* Any names that appear after the declarator-id for a
20328 member are looked up in the containing scope. */
20330 {
20331 /* But declarations with qualified-ids can't appear in a
20332 function. */
20336 }
20338 }
20342 /* Default args are only allowed on function
20343 declarations. */
20345 else
20349 }
20350 /* We're done. */
20351 else
20353 }
20355 /* For an abstract declarator, we might wind up with nothing at this
20356 point. That's an error; the declarator is not optional. */
20360 /* If we entered a scope, we must exit it now. */
20368 }
20370 /* Parse a ptr-operator.
20372 ptr-operator:
20373 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20374 * cv-qualifier-seq [opt]
20375 &
20376 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20377 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20379 GNU Extension:
20381 ptr-operator:
20382 & cv-qualifier-seq [opt]
20384 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20385 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20386 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20387 filled in with the TYPE containing the member. *CV_QUALS is
20388 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20389 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20390 Note that the tree codes returned by this function have nothing
20391 to do with the types of trees that will be eventually be created
20392 to represent the pointer or reference type being parsed. They are
20393 just constants with suggestive names. */
20394 static enum tree_code
20399 {
20404 /* Assume that it's not a pointer-to-member. */
20406 /* And that there are no cv-qualifiers. */
20409 /* Peek at the next token. */
20412 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20422 {
20423 /* Consume the `*', `&' or `&&'. */
20426 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20427 `&', if we are allowing GNU extensions. (The only qualifier
20428 that can legally appear after `&' is `restrict', but that is
20429 enforced during semantic analysis. */
20437 }
20438 else
20439 {
20440 /* Try the pointer-to-member case. */
20442 /* Look for the optional `::' operator. */
20445 /* Look for the nested-name specifier. */
20452 /* If we found it, and the next token is a `*', then we are
20453 indeed looking at a pointer-to-member operator. */
20456 {
20457 /* Indicate that the `*' operator was used. */
20465 else
20466 {
20467 /* The type of which the member is a member is given by the
20468 current SCOPE. */
20470 /* The next name will not be qualified. */
20474 /* Look for optional c++11 attributes. */
20478 /* Look for the optional cv-qualifier-seq. */
20480 }
20481 }
20482 /* If that didn't work we don't have a ptr-operator. */
20485 }
20488 }
20490 /* Parse an (optional) cv-qualifier-seq.
20492 cv-qualifier-seq:
20493 cv-qualifier cv-qualifier-seq [opt]
20495 cv-qualifier:
20496 const
20497 volatile
20499 GNU Extension:
20501 cv-qualifier:
20502 __restrict__
20504 Returns a bitmask representing the cv-qualifiers. */
20506 static cp_cv_quals
20508 {
20512 {
20514 cp_cv_quals cv_qualifier;
20516 /* Peek at the next token. */
20518 /* See if it's a cv-qualifier. */
20520 {
20536 }
20542 {
20547 }
20548 else
20549 {
20552 }
20553 }
20556 }
20558 /* Parse an (optional) ref-qualifier
20560 ref-qualifier:
20561 &
20562 &&
20564 Returns cp_ref_qualifier representing ref-qualifier. */
20566 static cp_ref_qualifier
20568 {
20571 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20576 {
20581 {
20593 }
20598 {
20601 }
20602 else
20603 {
20606 }
20607 }
20610 }
20612 /* Parse an optional tx-qualifier.
20614 tx-qualifier:
20615 transaction_safe
20616 transaction_safe_dynamic */
20618 static tree
20620 {
20623 {
20628 {
20632 {
20635 {
20638 }
20639 else
20641 }
20642 }
20643 }
20645 }
20647 /* Parse an (optional) virt-specifier-seq.
20649 virt-specifier-seq:
20650 virt-specifier virt-specifier-seq [opt]
20652 virt-specifier:
20653 override
20654 final
20656 Returns a bitmask representing the virt-specifiers. */
20658 static cp_virt_specifiers
20660 {
20664 {
20666 cp_virt_specifiers virt_specifier;
20668 /* Peek at the next token. */
20670 /* See if it's a virt-specifier-qualifier. */
20674 {
20677 }
20679 {
20682 }
20684 {
20686 }
20687 else
20691 {
20696 }
20697 else
20698 {
20701 }
20702 }
20704 }
20706 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20707 is in scope even though it isn't real. */
20709 void
20711 {
20712 tree this_parm;
20715 {
20716 /* We don't clear this between NSDMIs. Is it already what we want? */
20721 }
20724 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20726 current_class_ref
20729 }
20731 /* Return true iff our current scope is a non-static data member
20732 initializer. */
20734 bool
20736 {
20737 /* We recognize NSDMI context by the context-less 'this' pointer set up
20738 by the function above. */
20744 }
20746 /* Return true iff our current scope is a default capturing generic lambda
20747 defined within a template. FIXME: This is part of a workaround (see
20748 semantics.c) to handle building lambda closure types correctly in templates
20749 which we ultimately want to defer to instantiation time. */
20751 bool
20753 {
20771 }
20773 /* Parse a late-specified return type, if any. This is not a separate
20774 non-terminal, but part of a function declarator, which looks like
20776 -> trailing-type-specifier-seq abstract-declarator(opt)
20778 Returns the type indicated by the type-id.
20780 In addition to this, parse any queued up #pragma omp declare simd
20781 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20782 #pragma acc routine clauses.
20784 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20785 function. */
20787 static tree
20790 {
20794 && declarator
20801 && declarator
20804 /* Peek at the next token. */
20806 /* A late-specified return type is indicated by an initial '->'. */
20817 {
20818 /* DR 1207: 'this' is in scope in the trailing return type. */
20820 }
20823 {
20824 /* Consume the ->. */
20828 }
20830 /* Function declarations may be followed by a trailing
20831 requires-clause. */
20835 declarator->attributes
20839 declarator->attributes
20843 declarator->attributes
20848 {
20851 }
20854 }
20856 /* Parse a declarator-id.
20858 declarator-id:
20859 id-expression
20860 :: [opt] nested-name-specifier [opt] type-name
20862 In the `id-expression' case, the value returned is as for
20863 cp_parser_id_expression if the id-expression was an unqualified-id.
20864 If the id-expression was a qualified-id, then a SCOPE_REF is
20865 returned. The first operand is the scope (either a NAMESPACE_DECL
20866 or TREE_TYPE), but the second is still just a representation of an
20867 unqualified-id. */
20869 static tree
20871 {
20872 tree id;
20873 /* The expression must be an id-expression. Assume that qualified
20874 names are the names of types so that:
20876 template <class T>
20877 int S<T>::R::i = 3;
20879 will work; we must treat `S<T>::R' as the name of a type.
20880 Similarly, assume that qualified names are templates, where
20881 required, so that:
20883 template <class T>
20884 int S<T>::R<T>::i = 3;
20886 will work, too. */
20892 optional_p);
20896 }
20898 /* Parse a type-id.
20900 type-id:
20901 type-specifier-seq abstract-declarator [opt]
20903 Returns the TYPE specified. */
20905 static tree
20908 {
20909 cp_decl_specifier_seq type_specifier_seq;
20912 /* Parse the type-specifier-seq. */
20914 is_trailing_return,
20919 /* A bare template name as a template argument is a template template
20920 argument, not a placeholder, so fail parsing it as a type argument. */
20921 {
20925 }
20929 /* There might or might not be an abstract declarator. */
20931 /* Look for the declarator. */
20932 abstract_declarator
20937 /* Check to see if there really was a declarator. */
20942 /* The concepts TS allows 'auto' as a type-id. */
20944 /* None of the valid uses of 'auto' in C++14 involve the type-id
20945 nonterminal, but it is valid in a trailing-return-type. */
20948 {
20949 /* A type-id with type 'auto' is only ok if the abstract declarator
20950 is a function declarator with a late-specified return type.
20952 A type-id with 'auto' is also valid in a trailing-return-type
20953 in a compound-requirement. */
20960 else
20961 {
20964 {
20966 auto_node);
20968 tmpl);
20969 }
20970 else
20973 }
20974 }
20977 is_template_arg);
20978 }
20980 static tree
20982 {
20984 }
20986 static tree
20988 {
20989 tree r;
20991 parser->type_definition_forbidden_message
20996 {
20999 }
21001 }
21003 static tree
21005 {
21007 }
21009 /* Parse a type-specifier-seq.
21011 type-specifier-seq:
21012 type-specifier type-specifier-seq [opt]
21014 GNU extension:
21016 type-specifier-seq:
21017 attributes type-specifier-seq [opt]
21019 If IS_DECLARATION is true, we are at the start of a "condition" or
21020 exception-declaration, so we might be followed by a declarator-id.
21022 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21023 i.e. we've just seen "->".
21025 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21027 static void
21032 {
21037 /* Clear the TYPE_SPECIFIER_SEQ. */
21040 /* In the context of a trailing return type, enum E { } is an
21041 elaborated-type-specifier followed by a function-body, not an
21042 enum-specifier. */
21046 /* Parse the type-specifiers and attributes. */
21048 {
21049 tree type_specifier;
21052 /* Check for attributes first. */
21054 {
21059 }
21061 /* record the token of the beginning of the type specifier seq,
21062 for error reporting purposes*/
21066 /* Look for the type-specifier. */
21068 flags,
21069 type_specifier_seq,
21071 NULL,
21074 {
21075 /* If the first type-specifier could not be found, this is not a
21076 type-specifier-seq at all. */
21078 {
21079 /* Set in_declarator_p to avoid skipping to the semicolon. */
21091 }
21092 /* If subsequent type-specifiers could not be found, the
21093 type-specifier-seq is complete. */
21095 }
21098 /* The standard says that a condition can be:
21100 type-specifier-seq declarator = assignment-expression
21102 However, given:
21104 struct S {};
21105 if (int S = ...)
21107 we should treat the "S" as a declarator, not as a
21108 type-specifier. The standard doesn't say that explicitly for
21109 type-specifier-seq, but it does say that for
21110 decl-specifier-seq in an ordinary declaration. Perhaps it
21111 would be clearer just to allow a decl-specifier-seq here, and
21112 then add a semantic restriction that if any decl-specifiers
21113 that are not type-specifiers appear, the program is invalid. */
21116 }
21117 }
21119 /* Return whether the function currently being declared has an associated
21120 template parameter list. */
21122 static bool
21124 {
21137 }
21139 /* Parse a parameter-declaration-clause.
21141 parameter-declaration-clause:
21142 parameter-declaration-list [opt] ... [opt]
21143 parameter-declaration-list , ...
21145 Returns a representation for the parameter declarations. A return
21146 value of NULL indicates a parameter-declaration-clause consisting
21147 only of an ellipsis. */
21149 static tree
21151 {
21152 tree parameters;
21161 parser->auto_is_implicit_function_template_parm_p
21163 }
21169 && !processing_template_parmlist
21175 /* Peek at the next token. */
21177 /* Check for trivial parameter-declaration-clauses. */
21179 {
21180 /* Consume the `...' token. */
21183 }
21185 /* There are no parameters. */
21186 {
21187 #ifndef NO_IMPLICIT_EXTERN_C
21192 else
21193 #endif
21195 }
21196 /* Check for `(void)', too, which is a special case. */
21200 {
21201 /* Consume the `void' token. */
21203 /* There are no parameters. */
21205 }
21207 /* Parse the parameter-declaration-list. */
21209 /* If a parse error occurred while parsing the
21210 parameter-declaration-list, then the entire
21211 parameter-declaration-clause is erroneous. */
21215 /* Peek at the next token. */
21217 /* If it's a `,', the clause should terminate with an ellipsis. */
21219 {
21220 /* Consume the `,'. */
21222 /* Expect an ellipsis. */
21223 ellipsis_p
21225 }
21226 /* It might also be `...' if the optional trailing `,' was
21227 omitted. */
21229 {
21230 /* Consume the `...' token. */
21232 /* And remember that we saw it. */
21234 }
21235 else
21238 /* Finish the parameter list. */
21243 }
21245 /* Parse a parameter-declaration-list.
21247 parameter-declaration-list:
21248 parameter-declaration
21249 parameter-declaration-list , parameter-declaration
21251 Returns a representation of the parameter-declaration-list, as for
21252 cp_parser_parameter_declaration_clause. However, the
21253 `void_list_node' is never appended to the list. Upon return,
21254 *IS_ERROR will be true iff an error occurred. */
21256 static tree
21258 {
21264 /* Assume all will go well. */
21266 /* The special considerations that apply to a function within an
21267 unbraced linkage specifications do not apply to the parameters
21268 to the function. */
21269 saved_in_unbraced_linkage_specification_p
21273 /* Look for more parameters. */
21275 {
21283 /* Parse the parameter. */
21284 parameter
21289 /* We don't know yet if the enclosing context is deprecated, so wait
21290 and warn in grokparms if appropriate. */
21294 {
21295 /* If a function parameter pack was specified and an implicit template
21296 parameter was introduced during cp_parser_parameter_declaration,
21297 change any implicit parameters introduced into packs. */
21301 {
21309 }
21313 PARM,
21316 }
21320 /* If a parse error occurred parsing the parameter declaration,
21321 then the entire parameter-declaration-list is erroneous. */
21323 {
21327 }
21337 {
21341 }
21343 /* Add the new parameter to the list. */
21347 /* Peek at the next token. */
21350 /* These are for Objective-C++ */
21353 /* The parameter-declaration-list is complete. */
21356 {
21359 /* Peek at the next token. */
21361 /* If it's an ellipsis, then the list is complete. */
21364 /* Otherwise, there must be more parameters. Consume the
21365 `,'. */
21367 /* When parsing something like:
21369 int i(float f, double d)
21371 we can tell after seeing the declaration for "f" that we
21372 are not looking at an initialization of a variable "i",
21373 but rather at the declaration of a function "i".
21375 Due to the fact that the parsing of template arguments
21376 (as specified to a template-id) requires backtracking we
21377 cannot use this technique when inside a template argument
21378 list. */
21382 /* However, a parameter-declaration of the form
21383 "float(f)" (which is a valid declaration of a
21384 parameter "f") can also be interpreted as an
21385 expression (the conversion of "f" to "float"). */
21388 }
21389 else
21390 {
21398 }
21399 }
21401 parser->in_unbraced_linkage_specification_p
21404 /* Reset implicit_template_scope if we are about to leave the function
21405 parameter list that introduced it. Note that for out-of-line member
21406 definitions, there will be one or more class scopes before we get to
21407 the template parameter scope. */
21411 {
21415 {
21418 }
21419 }
21422 }
21424 /* Parse a parameter declaration.
21426 parameter-declaration:
21427 decl-specifier-seq ... [opt] declarator
21428 decl-specifier-seq declarator = assignment-expression
21429 decl-specifier-seq ... [opt] abstract-declarator [opt]
21430 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21432 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21433 declares a template parameter. (In that case, a non-nested `>'
21434 token encountered during the parsing of the assignment-expression
21435 is not interpreted as a greater-than operator.)
21437 Returns a representation of the parameter, or NULL if an error
21438 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21439 true iff the declarator is of the form "(p)". */
21445 {
21447 cp_decl_specifier_seq decl_specifiers;
21449 tree default_argument;
21454 /* In a template parameter, `>' is not an operator.
21456 [temp.param]
21458 When parsing a default template-argument for a non-type
21459 template-parameter, the first non-nested `>' is taken as the end
21460 of the template parameter-list rather than a greater-than
21461 operator. */
21463 /* Type definitions may not appear in parameter types. */
21465 parser->type_definition_forbidden_message
21468 /* Parse the declaration-specifiers. */
21470 CP_PARSER_FLAGS_NONE,
21474 /* Complain about missing 'typename' or other invalid type names. */
21479 /* If an error occurred, there's no reason to attempt to parse the
21480 rest of the declaration. */
21482 {
21485 }
21487 /* Peek at the next token. */
21490 /* If the next token is a `)', `,', `=', `>', or `...', then there
21491 is no declarator. However, when variadic templates are enabled,
21492 there may be a declarator following `...'. */
21497 {
21501 }
21502 /* Otherwise, there should be a declarator. */
21503 else
21504 {
21508 /* After seeing a decl-specifier-seq, if the next token is not a
21509 "(", there is no possibility that the code is a valid
21510 expression. Therefore, if parsing tentatively, we commit at
21511 this point. */
21513 /* In an expression context, having seen:
21515 (int((char ...
21517 we cannot be sure whether we are looking at a
21518 function-type (taking a "char" as a parameter) or a cast
21519 of some object of type "char" to "int". */
21525 /* Parse the declarator. */
21528 CP_PARSER_DECLARATOR_EITHER,
21530 parenthesized_p,
21534 /* After the declarator, allow more attributes. */
21535 decl_specifiers.attributes
21539 /* If the declarator is a template parameter pack, remember that and
21540 clear the flag in the declarator itself so we don't get errors
21541 from grokdeclarator. */
21543 {
21546 }
21547 }
21549 /* If the next token is an ellipsis, and we have not seen a declarator
21550 name, and if either the type of the declarator contains parameter
21551 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21552 for, eg, abbreviated integral type names), then we actually have a
21553 parameter pack expansion expression. Otherwise, leave the ellipsis
21554 for a C-style variadic function. */
21557 {
21568 {
21569 /* Consume the `...'. */
21573 /* Build a pack expansion type */
21578 else
21580 }
21581 }
21583 /* The restriction on defining new types applies only to the type
21584 of the parameter, not to the default argument. */
21587 /* If the next token is `=', then process a default argument. */
21589 {
21592 /* If we are defining a class, then the tokens that make up the
21593 default argument must be saved and processed later. */
21599 // A constrained-type-specifier may declare a type template-parameter.
21601 default_argument
21604 // A constrained-type-specifier may declare a template-template-parameter.
21606 default_argument
21609 /* Outside of a class definition, we can just parse the
21610 assignment-expression. */
21611 else
21612 default_argument
21616 {
21618 "default arguments are only "
21620 }
21622 || template_parameter_pack_p
21625 {
21626 /* Find the name of the parameter pack. */
21633 template_parm_p
21639 else
21641 template_parm_p
21648 }
21649 }
21650 else
21654 declarator,
21655 default_argument,
21656 template_parameter_pack_p);
21657 }
21659 /* Parse a default argument and return it.
21661 TEMPLATE_PARM_P is true if this is a default argument for a
21662 non-type template parameter. */
21663 static tree
21665 {
21671 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21672 set correctly. */
21675 /* Local variable names (and the `this' keyword) may not
21676 appear in a default argument. */
21679 /* Parse the assignment-expression. */
21684 /* The "this" pointer is not valid in a default argument. */
21686 {
21691 }
21692 default_argument
21694 /* Restore the "this" pointer. */
21696 {
21699 }
21708 }
21710 /* Parse a function-body.
21712 function-body:
21713 compound_statement */
21715 static void
21717 {
21721 }
21723 /* Parse a ctor-initializer-opt followed by a function-body. Return
21724 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21725 is true we are parsing a function-try-block. */
21727 static bool
21730 {
21738 /* Begin the function body. */
21740 /* Parse the optional ctor-initializer. */
21743 /* If we're parsing a constexpr constructor definition, we need
21744 to check that the constructor body is indeed empty. However,
21745 before we get to cp_parser_function_body lot of junk has been
21746 generated, so we can't just check that we have an empty block.
21747 Rather we take a snapshot of the outermost block, and check whether
21748 cp_parser_function_body changed its state. */
21750 {
21754 }
21755 /* Parse the function-body. */
21759 /* Finish the function body. */
21763 }
21765 /* Parse an initializer.
21767 initializer:
21768 = initializer-clause
21769 ( expression-list )
21771 Returns an expression representing the initializer. If no
21772 initializer is present, NULL_TREE is returned.
21774 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21775 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21776 set to TRUE if there is no initializer present. If there is an
21777 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21778 is set to true; otherwise it is set to false. */
21780 static tree
21783 {
21785 tree init;
21787 /* Peek at the next token. */
21790 /* Let our caller know whether or not this initializer was
21791 parenthesized. */
21793 /* Assume that the initializer is constant. */
21797 {
21798 /* Consume the `='. */
21800 /* Parse the initializer-clause. */
21802 }
21804 {
21809 non_constant_p);
21814 }
21816 {
21821 }
21822 else
21823 {
21824 /* Anything else is an error. */
21827 }
21833 }
21835 /* Parse an initializer-clause.
21837 initializer-clause:
21838 assignment-expression
21839 braced-init-list
21841 Returns an expression representing the initializer.
21843 If the `assignment-expression' production is used the value
21844 returned is simply a representation for the expression.
21846 Otherwise, calls cp_parser_braced_list. */
21848 static cp_expr
21850 {
21851 cp_expr initializer;
21853 /* Assume the expression is constant. */
21856 /* If it is not a `{', then we are looking at an
21857 assignment-expression. */
21859 {
21860 initializer
21863 non_constant_p);
21864 }
21865 else
21869 }
21871 /* Parse a brace-enclosed initializer list.
21873 braced-init-list:
21874 { initializer-list , [opt] }
21875 { }
21877 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21878 the elements of the initializer-list (or NULL, if the last
21879 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21880 NULL_TREE. There is no way to detect whether or not the optional
21881 trailing `,' was provided. NON_CONSTANT_P is as for
21882 cp_parser_initializer. */
21884 static cp_expr
21886 {
21887 tree initializer;
21890 /* Consume the `{' token. */
21891 matching_braces braces;
21893 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21895 /* If it's not a `}', then there is a non-trivial initializer. */
21897 {
21898 /* Parse the initializer list. */
21901 /* A trailing `,' token is allowed. */
21904 }
21905 else
21907 /* Now, there should be a trailing `}'. */
21913 /* Build a location of the form:
21914 { ... }
21915 ^~~~~~~
21916 with caret==start at the open brace, finish at the close brace. */
21920 }
21922 /* Consume tokens up to, and including, the next non-nested closing `]'.
21923 Returns true iff we found a closing `]'. */
21925 static bool
21927 {
21931 {
21935 {
21938 /* If we've run out of tokens, then there is no closing `]'. */
21947 {
21950 }
21955 }
21957 /* Consume the token. */
21959 }
21960 }
21962 /* Return true if we are looking at an array-designator, false otherwise. */
21964 static bool
21966 {
21967 /* Consume the `['. */
21972 /* Skip tokens until the next token is a closing square bracket.
21973 If we find the closing `]', and the next token is a `=', then
21974 we are looking at an array designator. */
21975 bool array_designator_p
21979 /* Roll back the tokens we skipped. */
21983 }
21985 /* Parse an initializer-list.
21987 initializer-list:
21988 initializer-clause ... [opt]
21989 initializer-list , initializer-clause ... [opt]
21991 GNU Extension:
21993 initializer-list:
21994 designation initializer-clause ...[opt]
21995 initializer-list , designation initializer-clause ...[opt]
21997 designation:
21998 . identifier =
21999 identifier :
22000 [ constant-expression ] =
22002 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22003 for the initializer. If the INDEX of the elt is non-NULL, it is the
22004 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22005 as for cp_parser_initializer. */
22009 {
22012 /* Assume all of the expressions are constant. */
22015 /* Parse the rest of the list. */
22017 {
22019 tree designator;
22020 tree initializer;
22023 /* If the next token is an identifier and the following one is a
22024 colon, we are looking at the GNU designated-initializer
22025 syntax. */
22029 {
22030 /* Warn the user that they are using an extension. */
22033 /* Consume the identifier. */
22035 /* Consume the `:'. */
22037 }
22038 /* Also handle the C99 syntax, '. id ='. */
22043 {
22044 /* Warn the user that they are using an extension. */
22047 /* Consume the `.'. */
22049 /* Consume the identifier. */
22051 /* Consume the `='. */
22053 }
22054 /* Also handle C99 array designators, '[ const ] ='. */
22058 {
22059 /* In C++11, [ could start a lambda-introducer. */
22065 {
22068 }
22069 else
22070 {
22075 }
22081 }
22082 else
22085 /* Parse the initializer. */
22088 /* If any clause is non-constant, so is the entire initializer. */
22092 /* If we have an ellipsis, this is an initializer pack
22093 expansion. */
22095 {
22096 /* Consume the `...'. */
22099 /* Turn the initializer into an initializer expansion. */
22101 }
22103 /* Add it to the vector. */
22106 /* If the next token is not a comma, we have reached the end of
22107 the list. */
22111 /* Peek at the next token. */
22113 /* If the next token is a `}', then we're still done. An
22114 initializer-clause can have a trailing `,' after the
22115 initializer-list and before the closing `}'. */
22119 /* Consume the `,' token. */
22121 }
22124 }
22126 /* Classes [gram.class] */
22128 /* Parse a class-name.
22130 class-name:
22131 identifier
22132 template-id
22134 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22135 to indicate that names looked up in dependent types should be
22136 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22137 keyword has been used to indicate that the name that appears next
22138 is a template. TAG_TYPE indicates the explicit tag given before
22139 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22140 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22141 is the class being defined in a class-head. If ENUM_OK is TRUE,
22142 enum-names are also accepted.
22144 Returns the TYPE_DECL representing the class. */
22146 static tree
22155 {
22156 tree decl;
22157 tree scope;
22162 /* All class-names start with an identifier. */
22165 {
22168 }
22170 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22171 to a template-id, so we save it here. */
22176 /* Any name names a type if we're following the `typename' keyword
22177 in a qualified name where the enclosing scope is type-dependent. */
22180 /* Handle the common case (an identifier, but not a template-id)
22181 efficiently. */
22184 {
22188 /* Look for the identifier. */
22192 /* If the next token isn't an identifier, we are certainly not
22193 looking at a class-name. */
22196 /* If we know this is a type-name, there's no need to look it
22197 up. */
22200 else
22201 {
22202 tree ambiguous_decls;
22203 /* If we already know that this lookup is ambiguous, then
22204 we've already issued an error message; there's no reason
22205 to check again. */
22207 {
22210 }
22211 /* If the next token is a `::', then the name must be a type
22212 name.
22214 [basic.lookup.qual]
22216 During the lookup for a name preceding the :: scope
22217 resolution operator, object, function, and enumerator
22218 names are ignored. */
22221 /* Look up the name. */
22223 tag_type,
22226 check_dependency_p,
22230 {
22234 }
22235 }
22236 }
22237 else
22238 {
22239 /* Try a template-id. */
22241 check_dependency_p,
22242 tag_type,
22243 is_declaration);
22246 }
22250 /* If this is a typename, create a TYPENAME_TYPE. */
22252 {
22257 }
22261 /* Check to see that it is really the name of a class. */
22265 /* Situations like this:
22267 template <typename T> struct A {
22268 typename T::template X<int>::I i;
22269 };
22271 are problematic. Is `T::template X<int>' a class-name? The
22272 standard does not seem to be definitive, but there is no other
22273 valid interpretation of the following `::'. Therefore, those
22274 names are considered class-names. */
22275 {
22279 }
22284 /* In Objective-C 2.0, a classname followed by '.' starts a
22285 dot-syntax expression, and it's not a type-name. */
22297 }
22299 /* Parse a class-specifier.
22301 class-specifier:
22302 class-head { member-specification [opt] }
22304 Returns the TREE_TYPE representing the class. */
22306 static tree
22308 {
22309 tree type;
22323 /* Parse the class-head. */
22326 /* If the class-head was a semantic disaster, skip the entire body
22327 of the class. */
22329 {
22333 }
22335 /* Look for the `{'. */
22336 matching_braces braces;
22338 {
22341 }
22346 /* Issue an error message if type-definitions are forbidden here. */
22348 /* Remember that we are defining one more class. */
22350 /* Inside the class, surrounding template-parameter-lists do not
22351 apply. */
22352 saved_num_template_parameter_lists
22355 /* We are not in a function body. */
22358 /* Or in a loop. */
22361 /* Or in a switch. */
22364 /* We are not immediately inside an extern "lang" block. */
22365 saved_in_unbraced_linkage_specification_p
22369 // Associate constraints with the type.
22373 /* Start the class. */
22375 {
22378 }
22382 /* If the type is erroneous, skip the entire body of the class. */
22384 else
22385 /* Parse the member-specification. */
22388 /* Look for the trailing `}'. */
22390 /* Look for trailing attributes to apply to this class. */
22398 /* We've finished a type definition. Check for the common syntax
22399 error of forgetting a semicolon after the definition. We need to
22400 be careful, as we can't just check for not-a-semicolon and be done
22401 with it; the user might have typed:
22403 class X { } c = ...;
22404 class X { } *p = ...;
22406 and so forth. Instead, enumerate all the possible tokens that
22407 might follow this production; if we don't see one of them, then
22408 complain and silently insert the semicolon. */
22409 {
22414 /* Don't try to parse c++11 attributes here. As per the
22415 grammar, that should be a task for
22416 cp_parser_decl_specifier_seq. */
22420 {
22431 /* While it's legal for type qualifiers and storage class
22432 specifiers to follow type definitions in the grammar, only
22433 compiler testsuites contain code like that. Assume that if
22434 we see such code, then what we're really seeing is a case
22435 like:
22437 class X { }
22438 const <type> var = ...;
22440 or
22442 class Y { }
22443 static <type> func (...) ...
22445 i.e. the qualifier or specifier applies to the next
22446 declaration. To do so, however, we need to look ahead one
22447 more token to see if *that* token is a type specifier.
22449 This code could be improved to handle:
22451 class Z { }
22452 static const <type> var = ...; */
22455 {
22458 /* Handling user-defined types here would be nice, but very
22459 tricky. */
22460 want_semicolon
22463 }
22467 }
22469 /* If we don't have a type, then something is very wrong and we
22470 shouldn't try to do anything clever. Likewise for not seeing the
22471 closing brace. */
22473 {
22474 /* Locate the closing brace. */
22475 cp_token_position prev
22480 /* We want to suggest insertion of a ';' immediately *after* the
22481 closing brace, so, if we can, offset the location by 1 column. */
22488 /* If we successfully offset the location, suggest the fix-it. */
22501 else
22504 /* Unget one token and smash it to look as though we encountered
22505 a semicolon in the input stream. */
22510 }
22511 }
22513 /* If this class is not itself within the scope of another class,
22514 then we need to parse the bodies of all of the queued function
22515 definitions. Note that the queued functions defined in a class
22516 are not always processed immediately following the
22517 class-specifier for that class. Consider:
22519 struct A {
22520 struct B { void f() { sizeof (A); } };
22521 };
22523 If `f' were processed before the processing of `A' were
22524 completed, there would be no way to compute the size of `A'.
22525 Note that the nesting we are interested in here is lexical --
22526 not the semantic nesting given by TYPE_CONTEXT. In particular,
22527 for:
22529 struct A { struct B; };
22530 struct A::B { void f() { } };
22532 there is no need to delay the parsing of `A::B::f'. */
22534 {
22535 tree decl;
22542 /* In a first pass, parse default arguments to the functions.
22543 Then, in a second pass, parse the bodies of the functions.
22544 This two-phased approach handles cases like:
22546 struct S {
22547 void f() { g(); }
22548 void g(int i = 3);
22549 };
22551 */
22553 {
22555 /* If there are default arguments that have not yet been processed,
22556 take care of them now. */
22558 {
22563 }
22564 /* Make sure that any template parameters are in scope. */
22566 /* Parse the default argument expressions. */
22568 /* Remove any template parameters from the symbol table. */
22570 }
22572 /* Now parse any NSDMIs. */
22576 {
22578 {
22583 }
22586 }
22593 /* Now do some post-NSDMI bookkeeping. */
22599 /* Now parse the body of the functions. */
22601 {
22602 /* OpenMP UDRs need to be parsed before all other functions. */
22609 }
22610 else
22614 }
22615 else
22618 /* Put back any saved access checks. */
22621 /* Restore saved state. */
22625 parser->num_template_parameter_lists
22627 parser->in_unbraced_linkage_specification_p
22631 }
22633 static tree
22635 {
22636 tree ret;
22641 }
22643 /* Parse a class-head.
22645 class-head:
22646 class-key identifier [opt] base-clause [opt]
22647 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22648 class-key nested-name-specifier [opt] template-id
22649 base-clause [opt]
22651 class-virt-specifier:
22652 final
22654 GNU Extensions:
22655 class-key attributes identifier [opt] base-clause [opt]
22656 class-key attributes nested-name-specifier identifier base-clause [opt]
22657 class-key attributes nested-name-specifier [opt] template-id
22658 base-clause [opt]
22660 Upon return BASES is initialized to the list of base classes (or
22661 NULL, if there are none) in the same form returned by
22662 cp_parser_base_clause.
22664 Returns the TYPE of the indicated class. Sets
22665 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22666 involving a nested-name-specifier was used, and FALSE otherwise.
22668 Returns error_mark_node if this is not a class-head.
22670 Returns NULL_TREE if the class-head is syntactically valid, but
22671 semantically invalid in a way that means we should skip the entire
22672 body of the class. */
22674 static tree
22677 {
22678 tree nested_name_specifier;
22682 tree attributes;
22683 tree bases;
22693 /* Assume no nested-name-specifier will be present. */
22695 /* Assume no template parameter lists will be used in defining the
22696 type. */
22700 /* Look for the class-key. */
22707 /* Parse the attributes. */
22710 /* If the next token is `::', that is invalid -- but sometimes
22711 people do try to write:
22713 struct ::S {};
22715 Handle this gracefully by accepting the extra qualifier, and then
22716 issuing an error about it later if this really is a
22717 class-head. If it turns out just to be an elaborated type
22718 specifier, remain silent. */
22724 /* Determine the name of the class. Begin by looking for an
22725 optional nested-name-specifier. */
22727 nested_name_specifier
22733 /* If there was a nested-name-specifier, then there *must* be an
22734 identifier. */
22739 {
22741 /* Although the grammar says `identifier', it really means
22742 `class-name' or `template-name'. You are only allowed to
22743 define a class that has already been declared with this
22744 syntax.
22746 The proposed resolution for Core Issue 180 says that wherever
22747 you see `class T::X' you should treat `X' as a type-name.
22749 It is OK to define an inaccessible class; for example:
22751 class A { class B; };
22752 class A::B {};
22754 We do not know if we will see a class-name, or a
22755 template-name. We look for a class-name first, in case the
22756 class-name is a template-id; if we looked for the
22757 template-name first we would stop after the template-name. */
22764 class_type,
22768 /* If that didn't work, ignore the nested-name-specifier. */
22770 {
22776 }
22777 /* If we could not find a corresponding TYPE, treat this
22778 declaration like an unqualified declaration. */
22781 /* Otherwise, count the number of templates used in TYPE and its
22782 containing scopes. */
22783 else
22784 {
22785 tree scope;
22797 }
22798 }
22799 /* Otherwise, the identifier is optional. */
22800 else
22801 {
22802 /* We don't know whether what comes next is a template-id,
22803 an identifier, or nothing at all. */
22805 /* Check for a template-id. */
22810 class_key,
22812 /* If that didn't work, it could still be an identifier. */
22814 {
22816 {
22819 }
22820 else
22822 }
22823 else
22824 {
22827 }
22828 }
22833 {
22835 class_key,
22837 }
22840 /* If it's not a `:' or a `{' then we can't really be looking at a
22841 class-head, since a class-head only appears as part of a
22842 class-specifier. We have to detect this situation before calling
22843 xref_tag, since that has irreversible side-effects. */
22845 {
22849 }
22851 /* At this point, we're going ahead with the class-specifier, even
22852 if some other problem occurs. */
22855 {
22860 }
22861 /* Issue the error about the overly-qualified name now. */
22863 {
22868 }
22870 {
22875 }
22877 {
22878 tree scope;
22881 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22882 keyword template shall not appear at the top level. */
22886 /* Reject typedef-names in class heads. */
22888 {
22891 type);
22894 }
22896 /* Figure out in what scope the declaration is being placed. */
22898 /* If that scope does not contain the scope in which the
22899 class was originally declared, the program is invalid. */
22901 {
22904 "declaration of %qD in namespace %qD which does not "
22907 else
22913 }
22914 /* [dcl.meaning]
22916 A declarator-id shall not be qualified except for the
22917 definition of a ... nested class outside of its class
22918 ... [or] the definition or explicit instantiation of a
22919 class member of a namespace outside of its namespace. */
22921 {
22926 }
22927 }
22928 /* An explicit-specialization must be preceded by "template <>". If
22929 it is not, try to recover gracefully. */
22932 && !processing_template_parmlist
22934 {
22935 /* Build a location of this form:
22936 struct typename <ARGS>
22937 ^~~~~~~~~~~~~~~~~~~~~~
22938 with caret==start at the start token, and
22939 finishing at the end of the type. */
22940 location_t reported_loc
22942 class_head_start_location,
22947 error_at_rich_loc
22951 /* Take the same action that would have been taken by
22952 cp_parser_explicit_specialization. */
22955 }
22956 /* There must be no "return" statements between this point and the
22957 end of this function; set "type "to the correct return value and
22958 use "goto done;" to return. */
22959 /* Make sure that the right number of template parameters were
22960 present. */
22964 {
22965 /* If something went wrong, there is no point in even trying to
22966 process the class-definition. */
22969 }
22971 /* Look up the type. */
22973 {
22977 {
22981 }
22982 else
22983 {
22987 /* Check the scope while we still know whether or not we had a
22988 nested-name-specifier. */
22991 }
22994 }
22996 {
22997 tree class_type;
22999 /* Given:
23001 template <typename T> struct S { struct T };
23002 template <typename T> struct S<T>::T { };
23004 we will get a TYPENAME_TYPE when processing the definition of
23005 `S::T'. We need to resolve it to the actual type before we
23006 try to define it. */
23008 {
23013 else
23014 {
23017 }
23018 }
23022 {
23025 }
23028 /* Enter the scope indicated by the nested-name-specifier. */
23030 /* Get the canonical version of this type. */
23032 /* Call push_template_decl if it seems like we should be defining a
23033 template either from the template headers or the type we're
23034 defining, so that we diagnose both extra and missing headers. */
23038 {
23041 {
23044 }
23045 }
23049 }
23051 {
23052 /* If the class was unnamed, create a dummy name. */
23056 ? ts_within_enclosing_non_class
23060 }
23062 /* Indicate whether this class was declared as a `class' or as a
23063 `struct'. */
23068 /* If this type was already complete, and we see another definition,
23069 that's an error. */
23071 {
23073 type);
23075 type);
23078 }
23083 {
23084 /* Apply attributes now, before any use of the class as a template
23085 argument in its base list. */
23088 }
23090 /* We will have entered the scope containing the class; the names of
23091 base classes should be looked up in that context. For example:
23093 struct A { struct B {}; struct C; };
23094 struct A::C : B {};
23096 is valid. */
23098 /* Get the list of base-classes, if there is one. */
23100 {
23101 /* PR59482: enter the class scope so that base-specifiers are looked
23102 up correctly. */
23106 /* PR59482: get out of the previously pushed class scope so that the
23107 subsequent pops pop the right thing. */
23110 }
23111 else
23114 /* If we're really defining a class, process the base classes.
23115 If they're invalid, fail. */
23119 done:
23120 /* Leave the scope given by the nested-name-specifier. We will
23121 enter the class scope itself while processing the members. */
23126 {
23129 }
23135 out:
23138 }
23140 /* Parse a class-key.
23142 class-key:
23143 class
23144 struct
23145 union
23147 Returns the kind of class-key specified, or none_type to indicate
23148 error. */
23150 static enum tag_types
23152 {
23156 /* Look for the class-key. */
23161 /* Check to see if the TOKEN is a class-key. */
23166 }
23168 /* Parse a type-parameter-key.
23170 type-parameter-key:
23171 class
23172 typename
23173 */
23175 static void
23177 {
23178 /* Look for the type-parameter-key. */
23182 {
23185 /* typename is not allowed in a template template parameter
23186 by the standard until C++1Z. */
23188 "ISO C++ forbids typename key in template template parameter;"
23190 }
23191 else
23195 }
23197 /* Parse an (optional) member-specification.
23199 member-specification:
23200 member-declaration member-specification [opt]
23201 access-specifier : member-specification [opt] */
23203 static void
23205 {
23207 {
23211 /* Peek at the next token. */
23213 /* If it's a `}', or EOF then we've seen all the members. */
23219 /* See if this token is a keyword. */
23222 {
23226 /* Consume the access-specifier. */
23228 /* Remember which access-specifier is active. */
23230 /* Look for the `:'. */
23235 /* Accept #pragmas at class scope. */
23237 {
23240 }
23242 /* Otherwise, the next construction must be a
23243 member-declaration. */
23245 }
23246 }
23247 }
23249 /* Parse a member-declaration.
23251 member-declaration:
23252 decl-specifier-seq [opt] member-declarator-list [opt] ;
23253 function-definition ; [opt]
23254 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23255 using-declaration
23256 template-declaration
23257 alias-declaration
23259 member-declarator-list:
23260 member-declarator
23261 member-declarator-list , member-declarator
23263 member-declarator:
23264 declarator pure-specifier [opt]
23265 declarator constant-initializer [opt]
23266 identifier [opt] : constant-expression
23268 GNU Extensions:
23270 member-declaration:
23271 __extension__ member-declaration
23273 member-declarator:
23274 declarator attributes [opt] pure-specifier [opt]
23275 declarator attributes [opt] constant-initializer [opt]
23276 identifier [opt] attributes [opt] : constant-expression
23278 C++0x Extensions:
23280 member-declaration:
23281 static_assert-declaration */
23283 static void
23285 {
23286 cp_decl_specifier_seq decl_specifiers;
23287 tree prefix_attributes;
23288 tree decl;
23297 /* Check for the `__extension__' keyword. */
23299 {
23300 /* Recurse. */
23302 /* Restore the old value of the PEDANTIC flag. */
23306 }
23308 /* Check for a template-declaration. */
23310 {
23311 /* An explicit specialization here is an error condition, and we
23312 expect the specialization handler to detect and report this. */
23316 else
23320 }
23321 /* Check for a template introduction. */
23325 /* Check for a using-declaration. */
23327 {
23329 {
23330 /* Parse the using-declaration. */
23334 }
23335 else
23336 {
23337 tree decl;
23341 /* Note that if we actually see the '=' token after the
23342 identifier, cp_parser_alias_declaration commits the
23343 tentative parse. In that case, we really expect an
23344 alias-declaration. Otherwise, we expect a using
23345 declaration. */
23346 alias_decl_expected =
23352 else
23356 }
23357 }
23359 /* Check for @defs. */
23361 {
23366 {
23371 }
23373 }
23375 /* If the next token is `static_assert' we have a static assertion. */
23377 {
23380 }
23387 /* Parse the decl-specifier-seq. */
23390 CP_PARSER_FLAGS_OPTIONAL,
23393 /* Check for an invalid type-name. */
23397 /* If there is no declarator, then the decl-specifier-seq should
23398 specify a type. */
23400 {
23401 /* If there was no decl-specifier-seq, and the next token is a
23402 `;', then we have something like:
23404 struct S { ; };
23406 [class.mem]
23408 Each member-declaration shall declare at least one member
23409 name of the class. */
23411 {
23414 {
23418 }
23419 }
23420 else
23421 {
23422 tree type;
23424 /* See if this declaration is a friend. */
23426 /* If there were decl-specifiers, check to see if there was
23427 a class-declaration. */
23430 /* Nested classes have already been added to the class, but
23431 a `friend' needs to be explicitly registered. */
23433 {
23434 /* If the `friend' keyword was present, the friend must
23435 be introduced with a class-key. */
23438 "in C++03 a class-key must be used "
23440 /* In this case:
23442 template <typename T> struct A {
23443 friend struct A<T>::B;
23444 };
23446 A<T>::B will be represented by a TYPENAME_TYPE, and
23447 therefore not recognized by check_tag_decl. */
23449 {
23453 }
23456 "friend declaration does not name a class or "
23458 else
23461 }
23462 /* If there is no TYPE, an error message will already have
23463 been issued. */
23465 ;
23466 /* An anonymous aggregate has to be handled specially; such
23467 a declaration really declares a data member (with a
23468 particular type), as opposed to a nested class. */
23470 {
23471 /* C++11 9.5/6. */
23474 "a storage class on an anonymous aggregate "
23477 /* Remove constructors and such from TYPE, now that we
23478 know it is an anonymous aggregate. */
23480 /* And make the corresponding data member. */
23483 /* Add it to the class. */
23485 }
23486 else
23487 cp_parser_check_access_in_redeclaration
23490 }
23491 }
23492 else
23493 {
23496 /* Clear attributes from the decl_specifiers but keep them
23497 around as prefix attributes that apply them to the entity
23498 being declared. */
23502 /* See if these declarations will be friends. */
23505 /* Keep going until we hit the `;' at the end of the
23506 declaration. */
23508 {
23510 tree first_attribute;
23512 /* Peek at the next token. */
23515 /* Check for a bitfield declaration. */
23520 {
23521 tree identifier;
23522 tree width;
23524 /* Get the name of the bitfield. Note that we cannot just
23525 check TOKEN here because it may have been invalidated by
23526 the call to cp_lexer_peek_nth_token above. */
23529 else
23532 /* Consume the `:' token. */
23534 /* Get the width of the bitfield. */
23535 width
23538 /* Look for attributes that apply to the bitfield. */
23540 /* Remember which attributes are prefix attributes and
23541 which are not. */
23543 /* Combine the attributes. */
23546 /* Create the bitfield declaration. */
23549 identifier,
23550 sfk_none)
23553 width,
23554 attributes);
23555 }
23556 else
23557 {
23559 tree initializer;
23560 tree asm_specification;
23563 /* Parse the declarator. */
23564 declarator
23569 friend_p);
23571 /* If something went wrong parsing the declarator, make sure
23572 that we at least consume some tokens. */
23574 {
23575 /* Skip to the end of the statement. */
23577 /* If the next token is not a semicolon, that is
23578 probably because we just skipped over the body of
23579 a function. So, we consume a semicolon if
23580 present, but do not issue an error message if it
23581 is not present. */
23583 CPP_SEMICOLON))
23586 }
23589 cp_parser_check_for_definition_in_return_type
23593 /* Look for an asm-specification. */
23595 /* Look for attributes that apply to the declaration. */
23597 /* Remember which attributes are prefix attributes and
23598 which are not. */
23600 /* Combine the attributes. */
23603 /* If it's an `=', then we have a constant-initializer or a
23604 pure-specifier. It is not correct to parse the
23605 initializer before registering the member declaration
23606 since the member declaration should be in scope while
23607 its initializer is processed. However, the rest of the
23608 front end does not yet provide an interface that allows
23609 us to handle this correctly. */
23611 {
23612 /* In [class.mem]:
23614 A pure-specifier shall be used only in the declaration of
23615 a virtual function.
23617 A member-declarator can contain a constant-initializer
23618 only if it declares a static member of integral or
23619 enumeration type.
23621 Therefore, if the DECLARATOR is for a function, we look
23622 for a pure-specifier; otherwise, we look for a
23623 constant-initializer. When we call `grokfield', it will
23624 perform more stringent semantics checks. */
23636 {
23638 /* Don't require a constant rvalue in C++11, since we
23639 might want a reference constant. We'll enforce
23640 constancy later. */
23642 /* Parse the initializer. */
23645 }
23646 else
23647 /* Parse the initializer. */
23649 }
23652 {
23656 else
23658 }
23659 /* Otherwise, there is no initializer. */
23660 else
23663 /* See if we are probably looking at a function
23664 definition. We are certainly not looking at a
23665 member-declarator. Calling `grokfield' has
23666 side-effects, so we must not do it unless we are sure
23667 that we are looking at a member-declarator. */
23670 {
23671 /* The grammar does not allow a pure-specifier to be
23672 used when a member function is defined. (It is
23673 possible that this fact is an oversight in the
23674 standard, since a pure function may be defined
23675 outside of the class-specifier. */
23681 declarator,
23682 attributes);
23685 /* If the member was not a friend, declare it here. */
23688 /* Peek at the next token. */
23690 /* If the next token is a semicolon, consume it. */
23692 {
23693 location_t semicolon_loc
23698 "extra %<;%> after in-class "
23700 }
23702 }
23703 else
23706 /* Create the declaration. */
23711 {
23714 else
23716 }
23717 }
23722 /* Reset PREFIX_ATTRIBUTES. */
23728 /* If there is any qualification still in effect, clear it
23729 now; we will be starting fresh with the next declarator. */
23733 /* If it's a `,', then there are more declarators. */
23735 {
23738 {
23744 }
23745 }
23746 /* If the next token isn't a `;', then we have a parse error. */
23748 CPP_SEMICOLON))
23749 {
23750 /* The next token might be a ways away from where the
23751 actual semicolon is missing. Find the previous token
23752 and use that for our error position. */
23759 /* Assume that the user meant to provide a semicolon. If
23760 we were to cp_parser_skip_to_end_of_statement, we might
23761 skip to a semicolon inside a member function definition
23762 and issue nonsensical error messages. */
23764 }
23767 {
23768 /* Add DECL to the list of members. */
23770 /* Explicitly include, eg, NSDMIs, for better error
23771 recovery (c++/58650). */
23780 /* Add DECL to the queue of NSDMI to be parsed later. */
23782 }
23786 }
23787 }
23790 out:
23792 }
23794 /* Parse a pure-specifier.
23796 pure-specifier:
23797 = 0
23799 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23800 Otherwise, ERROR_MARK_NODE is returned. */
23802 static tree
23804 {
23807 /* Look for the `=' token. */
23810 /* Look for the `0' token. */
23819 /* Accept = default or = delete in c++0x mode. */
23822 {
23825 }
23827 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23829 {
23834 }
23836 {
23839 }
23842 }
23844 /* Parse a constant-initializer.
23846 constant-initializer:
23847 = constant-expression
23849 Returns a representation of the constant-expression. */
23851 static tree
23853 {
23854 /* Look for the `=' token. */
23858 /* It is invalid to write:
23860 struct S { static const int i = { 7 }; };
23862 */
23864 {
23867 /* Consume the opening brace. */
23868 matching_braces braces;
23870 /* Skip the initializer. */
23872 /* Look for the trailing `}'. */
23876 }
23879 }
23881 /* Derived classes [gram.class.derived] */
23883 /* Parse a base-clause.
23885 base-clause:
23886 : base-specifier-list
23888 base-specifier-list:
23889 base-specifier ... [opt]
23890 base-specifier-list , base-specifier ... [opt]
23892 Returns a TREE_LIST representing the base-classes, in the order in
23893 which they were declared. The representation of each node is as
23894 described by cp_parser_base_specifier.
23896 In the case that no bases are specified, this function will return
23897 NULL_TREE, not ERROR_MARK_NODE. */
23899 static tree
23901 {
23904 /* Look for the `:' that begins the list. */
23907 /* Scan the base-specifier-list. */
23909 {
23911 tree base;
23914 /* Look for the base-specifier. */
23916 /* Look for the (optional) ellipsis. */
23918 {
23919 /* Consume the `...'. */
23923 }
23925 /* Add BASE to the front of the list. */
23927 {
23929 /* Make this a pack expansion type. */
23933 {
23936 }
23937 }
23938 /* Peek at the next token. */
23940 /* If it's not a comma, then the list is complete. */
23943 /* Consume the `,'. */
23945 }
23947 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23948 base class had a qualified name. However, the next name that
23949 appears is certainly not qualified. */
23955 }
23957 /* Parse a base-specifier.
23959 base-specifier:
23960 :: [opt] nested-name-specifier [opt] class-name
23961 virtual access-specifier [opt] :: [opt] nested-name-specifier
23962 [opt] class-name
23963 access-specifier virtual [opt] :: [opt] nested-name-specifier
23964 [opt] class-name
23966 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23967 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23968 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23969 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23971 static tree
23973 {
23981 tree type;
23983 /* Process the optional `virtual' and `access-specifier'. */
23985 {
23986 /* Peek at the next token. */
23988 /* Process `virtual'. */
23990 {
23992 /* If `virtual' appears more than once, issue an error. */
23994 {
23998 }
24002 /* Consume the `virtual' token. */
24010 /* If more than one access specifier appears, issue an
24011 error. */
24014 {
24018 }
24022 /* Consume the access-specifier. */
24030 }
24031 }
24032 /* It is not uncommon to see programs mechanically, erroneously, use
24033 the 'typename' keyword to denote (dependent) qualified types
24034 as base classes. */
24036 {
24041 else
24043 "keyword %<typename%> not allowed in this context "
24046 }
24048 /* Look for the optional `::' operator. */
24050 /* Look for the nested-name-specifier. The simplest way to
24051 implement:
24053 [temp.res]
24055 The keyword `typename' is not permitted in a base-specifier or
24056 mem-initializer; in these contexts a qualified name that
24057 depends on a template-parameter is implicitly assumed to be a
24058 type name.
24060 is to pretend that we have seen the `typename' keyword at this
24061 point. */
24067 /* If the base class is given by a qualified name, assume that names
24068 we see are type names or templates, as appropriate. */
24074 /* DR 950 allows decltype as a base-specifier. */
24076 else
24077 {
24078 /* Otherwise, look for the class-name. */
24080 class_scope_p,
24081 template_p,
24082 typename_type,
24087 }
24093 }
24095 /* Exception handling [gram.exception] */
24097 /* Parse an (optional) noexcept-specification.
24099 noexcept-specification:
24100 noexcept ( constant-expression ) [opt]
24102 If no noexcept-specification is present, returns NULL_TREE.
24103 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24104 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24105 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24106 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24107 in which case a boolean condition is returned instead. */
24109 static tree
24114 {
24118 /* Peek at the next token. */
24121 /* Is it a noexcept-specification? */
24123 {
24124 tree expr;
24128 {
24129 matching_parens parens;
24133 {
24134 /* Types may not be defined in an exception-specification. */
24136 parser->type_definition_forbidden_message
24141 /* Restore the saved message. */
24143 }
24144 else
24145 {
24148 }
24151 }
24152 else
24153 {
24157 }
24159 /* We cannot build a noexcept-spec right away because this will check
24160 that expr is a constexpr. */
24163 else
24165 }
24166 else
24168 }
24170 /* Parse an (optional) exception-specification.
24172 exception-specification:
24173 throw ( type-id-list [opt] )
24175 Returns a TREE_LIST representing the exception-specification. The
24176 TREE_VALUE of each node is a type. */
24178 static tree
24180 {
24182 tree type_id_list;
24185 /* Peek at the next token. */
24188 /* Is it a noexcept-specification? */
24194 /* If it's not `throw', then there's no exception-specification. */
24200 /* Consume the `throw'. */
24203 /* Look for the `('. */
24204 matching_parens parens;
24207 /* Peek at the next token. */
24209 /* If it's not a `)', then there is a type-id-list. */
24211 {
24212 /* Types may not be defined in an exception-specification. */
24214 parser->type_definition_forbidden_message
24216 /* Parse the type-id-list. */
24218 /* Restore the saved message. */
24222 {
24226 }
24229 "dynamic exception specifications are deprecated in "
24231 }
24232 /* In C++17, throw() is equivalent to noexcept (true). throw()
24233 is deprecated in C++11 and above as well, but is still widely used,
24234 so don't warn about it yet. */
24237 else
24240 /* Look for the `)'. */
24244 }
24246 /* Parse an (optional) type-id-list.
24248 type-id-list:
24249 type-id ... [opt]
24250 type-id-list , type-id ... [opt]
24252 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24253 in the order that the types were presented. */
24255 static tree
24257 {
24261 {
24263 tree type;
24267 /* Get the next type-id. */
24269 /* Check for invalid 'auto'. */
24271 {
24275 }
24276 /* Parse the optional ellipsis. */
24278 {
24279 /* Consume the `...'. */
24282 /* Turn the type into a pack expansion expression. */
24284 }
24285 /* Add it to the list. */
24287 /* Peek at the next token. */
24289 /* If it is not a `,', we are done. */
24292 /* Consume the `,'. */
24294 }
24297 }
24299 /* Parse a try-block.
24301 try-block:
24302 try compound-statement handler-seq */
24304 static tree
24306 {
24307 tree try_block;
24321 }
24323 /* Parse a function-try-block.
24325 function-try-block:
24326 try ctor-initializer [opt] function-body handler-seq */
24328 static bool
24330 {
24331 tree compound_stmt;
24332 tree try_block;
24335 /* Look for the `try' keyword. */
24338 /* Let the rest of the front end know where we are. */
24340 /* Parse the function-body. */
24341 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24343 /* We're done with the `try' part. */
24345 /* Parse the handlers. */
24347 /* We're done with the handlers. */
24351 }
24353 /* Parse a handler-seq.
24355 handler-seq:
24356 handler handler-seq [opt] */
24358 static void
24360 {
24362 {
24365 /* Parse the handler. */
24367 /* Peek at the next token. */
24369 /* If it's not `catch' then there are no more handlers. */
24372 }
24373 }
24375 /* Parse a handler.
24377 handler:
24378 catch ( exception-declaration ) compound-statement */
24380 static void
24382 {
24383 tree handler;
24384 tree declaration;
24388 matching_parens parens;
24395 }
24397 /* Parse an exception-declaration.
24399 exception-declaration:
24400 type-specifier-seq declarator
24401 type-specifier-seq abstract-declarator
24402 type-specifier-seq
24403 ...
24405 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24406 ellipsis variant is used. */
24408 static tree
24410 {
24411 cp_decl_specifier_seq type_specifiers;
24415 /* If it's an ellipsis, it's easy to handle. */
24417 {
24418 /* Consume the `...' token. */
24421 }
24423 /* Types may not be defined in exception-declarations. */
24425 parser->type_definition_forbidden_message
24428 /* Parse the type-specifier-seq. */
24432 /* If it's a `)', then there is no declarator. */
24435 else
24442 /* Restore the saved message. */
24449 }
24451 /* Parse a throw-expression.
24453 throw-expression:
24454 throw assignment-expression [opt]
24456 Returns a THROW_EXPR representing the throw-expression. */
24458 static tree
24460 {
24461 tree expression;
24466 /* Figure out whether or not there is an assignment-expression
24467 following the "throw" keyword. */
24475 else
24479 }
24481 /* GNU Extensions */
24483 /* Parse an (optional) asm-specification.
24485 asm-specification:
24486 asm ( string-literal )
24488 If the asm-specification is present, returns a STRING_CST
24489 corresponding to the string-literal. Otherwise, returns
24490 NULL_TREE. */
24492 static tree
24494 {
24496 tree asm_specification;
24498 /* Peek at the next token. */
24500 /* If the next token isn't the `asm' keyword, then there's no
24501 asm-specification. */
24505 /* Consume the `asm' token. */
24507 /* Look for the `('. */
24508 matching_parens parens;
24511 /* Look for the string-literal. */
24514 /* Look for the `)'. */
24518 }
24520 /* Parse an asm-operand-list.
24522 asm-operand-list:
24523 asm-operand
24524 asm-operand-list , asm-operand
24526 asm-operand:
24527 string-literal ( expression )
24528 [ string-literal ] string-literal ( expression )
24530 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24531 each node is the expression. The TREE_PURPOSE is itself a
24532 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24533 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24534 is a STRING_CST for the string literal before the parenthesis. Returns
24535 ERROR_MARK_NODE if any of the operands are invalid. */
24537 static tree
24539 {
24544 {
24545 tree string_literal;
24546 tree expression;
24547 tree name;
24550 {
24551 /* Consume the `[' token. */
24553 /* Read the operand name. */
24558 /* Look for the closing `]'. */
24560 }
24561 else
24563 /* Look for the string-literal. */
24566 /* Look for the `('. */
24567 matching_parens parens;
24569 /* Parse the expression. */
24571 /* Look for the `)'. */
24579 /* Add this operand to the list. */
24581 expression,
24582 asm_operands);
24583 /* If the next token is not a `,', there are no more
24584 operands. */
24587 /* Consume the `,'. */
24589 }
24592 }
24594 /* Parse an asm-clobber-list.
24596 asm-clobber-list:
24597 string-literal
24598 asm-clobber-list , string-literal
24600 Returns a TREE_LIST, indicating the clobbers in the order that they
24601 appeared. The TREE_VALUE of each node is a STRING_CST. */
24603 static tree
24605 {
24609 {
24610 tree string_literal;
24612 /* Look for the string literal. */
24614 /* Add it to the list. */
24616 /* If the next token is not a `,', then the list is
24617 complete. */
24620 /* Consume the `,' token. */
24622 }
24625 }
24627 /* Parse an asm-label-list.
24629 asm-label-list:
24630 identifier
24631 asm-label-list , identifier
24633 Returns a TREE_LIST, indicating the labels in the order that they
24634 appeared. The TREE_VALUE of each node is a label. */
24636 static tree
24638 {
24642 {
24645 /* Look for the identifier. */
24648 {
24651 {
24657 }
24658 }
24659 /* If the next token is not a `,', then the list is
24660 complete. */
24663 /* Consume the `,' token. */
24665 }
24668 }
24670 /* Return TRUE iff the next tokens in the stream are possibly the
24671 beginning of a GNU extension attribute. */
24673 static bool
24675 {
24677 }
24679 /* Return TRUE iff the next tokens in the stream are possibly the
24680 beginning of a standard C++-11 attribute specifier. */
24682 static bool
24684 {
24686 }
24688 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24689 beginning of a standard C++-11 attribute specifier. */
24691 static bool
24693 {
24701 }
24703 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24704 beginning of a GNU extension attribute. */
24706 static bool
24708 {
24712 }
24714 /* Return true iff the next tokens can be the beginning of either a
24715 GNU attribute list, or a standard C++11 attribute sequence. */
24717 static bool
24719 {
24722 }
24724 /* Return true iff the next Nth tokens can be the beginning of either
24725 a GNU attribute list, or a standard C++11 attribute sequence. */
24727 static bool
24729 {
24732 }
24734 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24735 of GNU attributes, or return NULL. */
24737 static tree
24739 {
24743 }
24745 #define CILK_SIMD_FN_CLAUSE_MASK \
24746 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24747 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24748 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24749 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24750 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24752 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24753 vector [(<clauses>)] */
24755 static void
24757 {
24761 {
24767 }
24770 {
24773 paren_scope++;
24774 }
24776 {
24779 paren_scope++;
24781 paren_scope--;
24782 /* Do not push the last ')' */
24785 }
24794 }
24796 /* Parse an (optional) series of attributes.
24798 attributes:
24799 attributes attribute
24801 attribute:
24802 __attribute__ (( attribute-list [opt] ))
24804 The return value is as for cp_parser_gnu_attribute_list. */
24806 static tree
24808 {
24812 {
24814 tree attribute_list;
24817 /* Peek at the next token. */
24819 /* If it's not `__attribute__', then we're done. */
24823 /* Consume the `__attribute__' keyword. */
24825 /* Look for the two `(' tokens. */
24826 matching_parens outer_parens;
24828 matching_parens inner_parens;
24831 /* Peek at the next token. */
24834 /* Parse the attribute-list. */
24836 else
24837 /* If the next token is a `)', then there is no attribute
24838 list. */
24841 /* Look for the two `)' tokens. */
24849 /* Add these new attributes to the list. */
24851 }
24854 }
24856 /* Parse a GNU attribute-list.
24858 attribute-list:
24859 attribute
24860 attribute-list , attribute
24862 attribute:
24863 identifier
24864 identifier ( identifier )
24865 identifier ( identifier , expression-list )
24866 identifier ( expression-list )
24868 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24869 to an attribute. The TREE_PURPOSE of each node is the identifier
24870 indicating which attribute is in use. The TREE_VALUE represents
24871 the arguments, if any. */
24873 static tree
24875 {
24881 {
24883 tree identifier;
24884 tree attribute;
24886 /* Look for the identifier. We also allow keywords here; for
24887 example `__attribute__ ((const))' is legal. */
24891 {
24894 /* Consume the token, but save it since we need it for the
24895 SIMD enabled function parsing. */
24898 /* Save away the identifier that indicates which attribute
24899 this is. */
24901 /* For keywords, use the canonical spelling, not the
24902 parsed identifier. */
24909 /* Peek at the next token. */
24911 /* If it's an `(', then parse the attribute arguments. */
24913 {
24918 {
24921 }
24922 else
24923 vec = cp_parser_parenthesized_expression_list
24929 else
24930 {
24933 }
24934 /* Save the arguments away. */
24936 }
24938 {
24941 }
24944 {
24945 /* Add this attribute to the list. */
24948 }
24951 }
24952 /* Now, look for more attributes. If the next token isn't a
24953 `,', we're done. */
24957 /* Consume the comma and keep going. */
24959 }
24962 /* We built up the list in reverse order. */
24964 }
24966 /* Parse a standard C++11 attribute.
24968 The returned representation is a TREE_LIST which TREE_PURPOSE is
24969 the scoped name of the attribute, and the TREE_VALUE is its
24970 arguments list.
24972 Note that the scoped name of the attribute is itself a TREE_LIST
24973 which TREE_PURPOSE is the namespace of the attribute, and
24974 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24975 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24976 and which TREE_PURPOSE is directly the attribute name.
24978 Clients of the attribute code should use get_attribute_namespace
24979 and get_attribute_name to get the actual namespace and name of
24980 attributes, regardless of their being GNU or C++11 attributes.
24982 attribute:
24983 attribute-token attribute-argument-clause [opt]
24985 attribute-token:
24986 identifier
24987 attribute-scoped-token
24989 attribute-scoped-token:
24990 attribute-namespace :: identifier
24992 attribute-namespace:
24993 identifier
24995 attribute-argument-clause:
24996 ( balanced-token-seq )
24998 balanced-token-seq:
24999 balanced-token [opt]
25000 balanced-token-seq balanced-token
25002 balanced-token:
25003 ( balanced-token-seq )
25004 [ balanced-token-seq ]
25005 { balanced-token-seq }. */
25007 static tree
25009 {
25013 /* First, parse name of the attribute, a.k.a attribute-token. */
25030 {
25031 /* We are seeing a scoped attribute token. */
25046 else
25047 {
25051 }
25055 NULL_TREE);
25057 }
25060 NULL_TREE);
25061 else
25062 {
25065 NULL_TREE);
25066 /* C++11 noreturn attribute is equivalent to GNU's. */
25069 /* C++14 deprecated attribute is equivalent to GNU's. */
25072 /* C++17 fallthrough attribute is equivalent to GNU's. */
25075 /* Transactional Memory TS optimize_for_synchronized attribute is
25076 equivalent to GNU transaction_callable. */
25080 /* Transactional Memory attributes are GNU attributes. */
25083 }
25085 /* Now parse the optional argument clause of the attribute. */
25090 {
25096 /* A GNU attribute that takes an identifier in parameter. */
25099 vec = cp_parser_parenthesized_expression_list
25105 else
25106 {
25109 }
25113 else
25115 }
25118 }
25120 /* Check that the attribute ATTRIBUTE appears at most once in the
25121 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25122 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25123 isn't implemented yet in GCC. */
25125 static void
25127 {
25129 {
25139 }
25140 }
25142 /* Parse a list of standard C++-11 attributes.
25144 attribute-list:
25145 attribute [opt]
25146 attribute-list , attribute[opt]
25147 attribute ...
25148 attribute-list , attribute ...
25149 */
25151 static tree
25153 {
25158 {
25163 {
25167 }
25170 {
25175 else
25176 {
25181 }
25183 }
25187 }
25190 }
25192 /* Parse a standard C++-11 attribute specifier.
25194 attribute-specifier:
25195 [ [ attribute-using-prefix [opt] attribute-list ] ]
25196 alignment-specifier
25198 attribute-using-prefix:
25199 using attribute-namespace :
25201 alignment-specifier:
25202 alignas ( type-id ... [opt] )
25203 alignas ( alignment-expression ... [opt] ). */
25205 static tree
25207 {
25213 {
25220 {
25231 {
25235 "attribute using prefix only available "
25241 }
25242 else
25244 }
25251 else
25252 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25253 when we are sure that we have actually parsed them. */
25255 }
25256 else
25257 {
25258 tree alignas_expr;
25260 /* Look for an alignment-specifier. */
25271 matching_parens parens;
25273 {
25276 }
25282 {
25289 }
25294 /* Handle alignas (pack...). */
25296 {
25299 }
25301 /* Something went wrong, so don't build the attribute. */
25306 {
25309 }
25311 /* Build the C++-11 representation of an 'aligned'
25312 attribute. */
25313 attributes =
25316 alignas_expr);
25317 }
25320 }
25322 /* Parse a standard C++-11 attribute-specifier-seq.
25324 attribute-specifier-seq:
25325 attribute-specifier-seq [opt] attribute-specifier
25326 */
25328 static tree
25330 {
25335 {
25344 else
25347 }
25350 }
25352 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25353 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25354 current value of the PEDANTIC flag, regardless of whether or not
25355 the `__extension__' keyword is present. The caller is responsible
25356 for restoring the value of the PEDANTIC flag. */
25358 static bool
25360 {
25361 /* Save the old value of the PEDANTIC flag. */
25365 {
25366 /* Consume the `__extension__' token. */
25368 /* We're not being pedantic while the `__extension__' keyword is
25369 in effect. */
25373 }
25376 }
25378 /* Parse a label declaration.
25380 label-declaration:
25381 __label__ label-declarator-seq ;
25383 label-declarator-seq:
25384 identifier , label-declarator-seq
25385 identifier */
25387 static void
25389 {
25390 /* Look for the `__label__' keyword. */
25394 {
25395 tree identifier;
25397 /* Look for an identifier. */
25399 /* If we failed, stop. */
25402 /* Declare it as a label. */
25404 /* If the next token is a `;', stop. */
25407 /* Look for the `,' separating the label declarations. */
25409 }
25411 /* Look for the final `;'. */
25413 }
25415 // -------------------------------------------------------------------------- //
25416 // Requires Clause
25418 // Parse a requires clause.
25419 //
25420 // requires-clause:
25421 // 'requires' logical-or-expression
25422 //
25423 // The required logical-or-expression must be a constant expression. Note
25424 // that we don't check that the expression is constepxr here. We defer until
25425 // we analyze constraints and then, we only check atomic constraints.
25426 static tree
25428 {
25429 // Parse the requires clause so that it is not automatically folded.
25437 }
25439 // Optionally parse a requires clause:
25440 static tree
25442 {
25445 {
25448 {
25451 /* Parse and discard the requires-clause. */
25454 }
25456 }
25459 }
25462 /*---------------------------------------------------------------------------
25463 Requires expressions
25464 ---------------------------------------------------------------------------*/
25466 /* Parse a requires expression
25468 requirement-expression:
25469 'requires' requirement-parameter-list [opt] requirement-body */
25470 static tree
25472 {
25476 /* A requires-expression shall appear only within a concept
25477 definition or a requires-clause.
25479 TODO: Implement this diagnostic correctly. */
25481 {
25485 }
25488 {
25489 /* Local parameters are delared as variables within the scope
25490 of the expression. They are not visible past the end of
25491 the expression. Expressions within the requires-expression
25492 are unevaluated. */
25493 struct scope_sentinel
25494 {
25496 {
25499 }
25502 {
25505 }
25508 /* Parse the optional parameter list. */
25510 {
25514 }
25515 else
25518 /* Parse the requirement body. */
25522 }
25524 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25525 the parm chain. */
25528 }
25530 /* Parse a parameterized requirement.
25532 requirement-parameter-list:
25533 '(' parameter-declaration-clause ')' */
25534 static tree
25536 {
25537 matching_parens parens;
25547 }
25549 /* Parse the body of a requirement.
25551 requirement-body:
25552 '{' requirement-list '}' */
25553 static tree
25555 {
25556 matching_braces braces;
25566 }
25568 /* Parse a list of requirements.
25570 requirement-list:
25571 requirement
25572 requirement-list ';' requirement[opt] */
25573 static tree
25575 {
25578 {
25585 /* If we see a semi-colon, consume it. */
25589 /* Stop processing at the end of the list. */
25592 }
25594 /* Reverse the order of requirements so they are analyzed in
25595 declaration order. */
25597 }
25599 /* Parse a syntactic requirement or type requirement.
25601 requirement:
25602 simple-requirement
25603 compound-requirement
25604 type-requirement
25605 nested-requirement */
25606 static tree
25608 {
25615 else
25617 }
25619 /* Parse a simple requirement.
25621 simple-requirement:
25622 expression ';' */
25623 static tree
25625 {
25634 }
25636 /* Parse a type requirement
25638 type-requirement
25639 nested-name-specifier [opt] required-type-name ';'
25641 required-type-name:
25642 type-name
25643 'template' [opt] simple-template-id */
25644 static tree
25646 {
25649 // Save the scope before parsing name specifiers.
25660 tree type;
25662 {
25671 }
25672 else
25691 }
25693 /* Parse a compound requirement
25695 compound-requirement:
25696 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25697 static tree
25699 {
25700 /* Parse an expression enclosed in '{ }'s. */
25701 matching_braces braces;
25712 /* Parse the optional noexcept. */
25715 {
25718 }
25720 /* Parse the optional trailing return type. */
25723 {
25731 }
25734 }
25736 /* Parse a nested requirement. This is the same as a requires clause.
25738 nested-requirement:
25739 requires-clause */
25740 static tree
25742 {
25748 }
25750 /* Support Functions */
25752 /* Return the appropriate prefer_type argument for lookup_name_real based on
25753 tag_type and template_mem_access. */
25757 {
25758 /* DR 141: When looking in the current enclosing context for a template-name
25759 after -> or ., only consider class templates. */
25763 {
25767 }
25768 }
25770 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25771 NAME should have one of the representations used for an
25772 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25773 is returned. If PARSER->SCOPE is a dependent type, then a
25774 SCOPE_REF is returned.
25776 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25777 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25778 was formed. Abstractly, such entities should not be passed to this
25779 function, because they do not need to be looked up, but it is
25780 simpler to check for this special case here, rather than at the
25781 call-sites.
25783 In cases not explicitly covered above, this function returns a
25784 DECL, OVERLOAD, or baselink representing the result of the lookup.
25785 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25786 is returned.
25788 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25789 (e.g., "struct") that was used. In that case bindings that do not
25790 refer to types are ignored.
25792 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25793 ignored.
25795 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25796 are ignored.
25798 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25799 types.
25801 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25802 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25803 NULL_TREE otherwise. */
25805 static cp_expr
25812 location_t name_location)
25813 {
25814 tree decl;
25817 /* Assume that the lookup will be unambiguous. */
25821 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25822 no longer valid. Note that if we are parsing tentatively, and
25823 the parse fails, OBJECT_TYPE will be automatically restored. */
25829 /* A template-id has already been resolved; there is no lookup to
25830 do. */
25834 {
25838 }
25840 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25841 it should already have been checked to make sure that the name
25842 used matches the type being destroyed. */
25844 {
25845 tree type;
25847 /* Figure out to which type this destructor applies. */
25852 else
25854 /* If that's not a class type, there is no destructor. */
25865 }
25867 /* By this point, the NAME should be an ordinary identifier. If
25868 the id-expression was a qualified name, the qualifying scope is
25869 stored in PARSER->SCOPE at this point. */
25872 /* Perform the lookup. */
25874 {
25880 /* If the SCOPE is dependent, the lookup must be deferred until
25881 the template is instantiated -- unless we are explicitly
25882 looking up names in uninstantiated templates. Even then, we
25883 cannot look up the name if the scope is not a class type; it
25884 might, for example, be a template type parameter. */
25889 /* Defer lookup. */
25891 else
25892 {
25895 /* If PARSER->SCOPE is a dependent type, then it must be a
25896 class type, and we must not be checking dependencies;
25897 otherwise, we would have processed this lookup above. So
25898 that PARSER->SCOPE is not considered a dependent base by
25899 lookup_member, we must enter the scope here. */
25903 /* If the PARSER->SCOPE is a template specialization, it
25904 may be instantiated during name lookup. In that case,
25905 errors may be issued. Even if we rollback the current
25906 tentative parse, those errors are valid. */
25911 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25912 lookup result and the nested-name-specifier nominates a class C:
25913 * if the name specified after the nested-name-specifier, when
25914 looked up in C, is the injected-class-name of C (Clause 9), or
25915 * if the name specified after the nested-name-specifier is the
25916 same as the identifier or the simple-template-id's template-
25917 name in the last component of the nested-name-specifier,
25918 the name is instead considered to name the constructor of
25919 class C. [ Note: for example, the constructor is not an
25920 acceptable lookup result in an elaborated-type-specifier so
25921 the constructor would not be used in place of the
25922 injected-class-name. --end note ] Such a constructor name
25923 shall be used only in the declarator-id of a declaration that
25924 names a constructor or in a using-declaration. */
25932 /* If we have a single function from a using decl, pull it out. */
25939 }
25941 /* If the scope is a dependent type and either we deferred lookup or
25942 we did lookup but didn't find the name, rememeber the name. */
25945 {
25947 {
25948 tree type;
25950 /* The resolution to Core Issue 180 says that `struct
25951 A::B' should be considered a type-name, even if `A'
25952 is dependent. */
25957 }
25961 CPP_CLOSE_PAREN)))
25965 else
25968 is_template);
25969 }
25972 }
25974 {
25975 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25976 OBJECT_TYPE is not a class. */
25978 /* If the OBJECT_TYPE is a template specialization, it may
25979 be instantiated during name lookup. In that case, errors
25980 may be issued. Even if we rollback the current tentative
25981 parse, those errors are valid. */
25983 name,
25986 tf_warning_or_error);
25987 else
25991 /* Look it up in the enclosing context. DR 141: When looking for a
25992 template-name after -> or ., only consider class templates. */
25997 /* The object is type-dependent, so we can't look anything up; we used
25998 this to get the DR 141 behavior. */
26002 }
26003 else
26004 {
26010 }
26012 /* If the lookup failed, let our caller know. */
26016 /* Pull out the template from an injected-class-name (or multiple). */
26020 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26022 {
26025 /* The error message we have to print is too complicated for
26026 cp_parser_error, so we incorporate its actions directly. */
26028 {
26030 name);
26032 }
26034 }
26042 /* If we have resolved the name of a member declaration, check to
26043 see if the declaration is accessible. When the name resolves to
26044 set of overloaded functions, accessibility is checked when
26045 overload resolution is done.
26047 During an explicit instantiation, access is not checked at all,
26048 as per [temp.explicit]. */
26055 }
26057 /* Like cp_parser_lookup_name, but for use in the typical case where
26058 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26059 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26061 static tree
26063 {
26065 none_type,
26070 location);
26071 }
26073 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26074 the current context, return the TYPE_DECL. If TAG_NAME_P is
26075 true, the DECL indicates the class being defined in a class-head,
26076 or declared in an elaborated-type-specifier.
26078 Otherwise, return DECL. */
26080 static tree
26082 {
26083 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26084 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26086 struct A {
26087 template <typename T> struct B;
26088 };
26090 template <typename T> struct A::B {};
26092 Similarly, in an elaborated-type-specifier:
26094 namespace N { struct X{}; }
26096 struct A {
26097 template <typename T> friend struct N::X;
26098 };
26100 However, if the DECL refers to a class type, and we are in
26101 the scope of the class, then the name lookup automatically
26102 finds the TYPE_DECL created by build_self_reference rather
26103 than a TEMPLATE_DECL. For example, in:
26105 template <class T> struct S {
26106 S s;
26107 };
26109 there is no need to handle such case. */
26115 }
26117 /* If too many, or too few, template-parameter lists apply to the
26118 declarator, issue an error message. Returns TRUE if all went well,
26119 and FALSE otherwise. */
26121 static bool
26124 location_t declarator_location)
26125 {
26127 {
26129 {
26137 /* If the DECLARATOR has the form `X<y>' then it uses one
26138 additional level of template parameters. */
26141 return cp_parser_check_template_parameters
26143 }
26159 }
26161 }
26163 /* NUM_TEMPLATES were used in the current declaration. If that is
26164 invalid, return FALSE and issue an error messages. Otherwise,
26165 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26166 declarator and we can print more accurate diagnostics. */
26168 static bool
26171 location_t location,
26173 {
26174 /* If there are the same number of template classes and parameter
26175 lists, that's OK. */
26178 /* If there are more, but only one more, then we are referring to a
26179 member template. That's OK too. */
26182 /* If there are more template classes than parameter lists, we have
26183 something like:
26185 template <class T> void S<T>::R<T>::f (); */
26187 {
26197 else
26200 }
26201 /* Otherwise, there are too many template parameter lists. We have
26202 something like:
26204 template <class T> template <class U> void S::f(); */
26207 }
26209 /* Parse an optional `::' token indicating that the following name is
26210 from the global namespace. If so, PARSER->SCOPE is set to the
26211 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26212 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26213 Returns the new value of PARSER->SCOPE, if the `::' token is
26214 present, and NULL_TREE otherwise. */
26216 static tree
26218 {
26221 /* Peek at the next token. */
26223 /* If we're looking at a `::' token then we're starting from the
26224 global namespace, not our current location. */
26226 {
26227 /* Consume the `::' token. */
26229 /* Set the SCOPE so that we know where to start the lookup. */
26235 }
26237 {
26241 }
26244 }
26246 /* Returns TRUE if the upcoming token sequence is the start of a
26247 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26248 declarator is preceded by the `friend' specifier. */
26250 static bool
26252 {
26255 tree nested_name_specifier;
26258 /* The common case is that this is not a constructor declarator, so
26259 try to avoid doing lots of work if at all possible. It's not
26260 valid declare a constructor at function scope. */
26263 /* And only certain tokens can begin a constructor declarator. */
26271 /* Parse tentatively; we are going to roll back all of the tokens
26272 consumed here. */
26274 /* Assume that we are looking at a constructor declarator. */
26277 /* Look for the optional `::' operator. */
26280 /* Look for the nested-name-specifier. */
26281 nested_name_specifier
26292 /* Outside of a class-specifier, there must be a
26293 nested-name-specifier. Except in C++17 mode, where we
26294 might be declaring a guiding declaration. */
26301 /* If we have a class scope, this is easy; DR 147 says that S::S always
26302 names the constructor, and no other qualified name could. */
26305 {
26315 }
26316 /* If we still think that this might be a constructor-declarator,
26317 look for a class-name. */
26319 {
26320 /* If we have:
26322 template <typename T> struct S {
26323 S();
26324 };
26326 we must recognize that the nested `S' names a class. */
26330 tree type_decl;
26334 none_type,
26341 {
26347 none_type,
26352 else
26354 }
26356 /* If there was no class-name, then this is not a constructor.
26357 Otherwise, if we are in a class-specifier and we aren't
26358 handling a friend declaration, check that its type matches
26359 current_class_type (c++/38313). Note: error_mark_node
26360 is left alone for error recovery purposes. */
26362 && (outside_class_specifier_p
26368 /* If we're still considering a constructor, we have to see a `(',
26369 to begin the parameter-declaration-clause, followed by either a
26370 `)', an `...', or a decl-specifier. We need to check for a
26371 type-specifier to avoid being fooled into thinking that:
26373 S (f) (int);
26375 is a constructor. (It is actually a function named `f' that
26376 takes one parameter (of type `int') and returns a value of type
26377 `S'. */
26385 /* A parameter declaration begins with a decl-specifier,
26386 which is either the "attribute" keyword, a storage class
26387 specifier, or (usually) a type-specifier. */
26389 {
26390 tree type;
26394 /* Names appearing in the type-specifier should be looked up
26395 in the scope of the class. */
26399 {
26402 {
26406 {
26409 }
26410 }
26412 }
26414 /* Inside the constructor parameter list, surrounding
26415 template-parameter-lists do not apply. */
26416 saved_num_template_parameter_lists
26420 /* Look for the type-specifier. */
26422 CP_PARSER_FLAGS_NONE,
26428 parser->num_template_parameter_lists
26431 /* Leave the scope of the class. */
26436 }
26437 }
26439 /* We did not really want to consume any tokens. */
26443 }
26445 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26446 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26447 they must be performed once we are in the scope of the function.
26449 Returns the function defined. */
26451 static tree
26452 cp_parser_function_definition_from_specifiers_and_declarator
26455 tree attributes,
26457 {
26458 tree fn;
26461 /* Begin the function-definition. */
26464 /* The things we're about to see are not directly qualified by any
26465 template headers we've seen thus far. */
26468 /* If there were names looked up in the decl-specifier-seq that we
26469 did not check, check them now. We must wait until we are in the
26470 scope of the function to perform the checks, since the function
26471 might be a friend. */
26475 {
26480 }
26483 {
26484 /* Skip the entire function. */
26487 }
26489 {
26490 /* Seen already, skip it. An error message has already been output. */
26494 /* If this is a function from a class, pop the nested class. */
26497 }
26498 else
26499 {
26500 timevar_id_t tv;
26503 else
26509 }
26512 }
26514 /* Parse the part of a function-definition that follows the
26515 declarator. INLINE_P is TRUE iff this function is an inline
26516 function defined within a class-specifier.
26518 Returns the function defined. */
26520 static tree
26523 {
26524 tree fn;
26530 bool fully_implicit_function_template_p
26533 tree implicit_template_parms
26536 cp_binding_level* implicit_template_scope
26542 /* If the next token is `return', then the code may be trying to
26543 make use of the "named return value" extension that G++ used to
26544 support. */
26547 {
26548 /* Consume the `return' keyword. */
26550 /* Look for the identifier that indicates what value is to be
26551 returned. */
26553 /* Issue an error message. */
26556 /* Skip tokens until we reach the start of the function body. */
26558 {
26565 }
26566 }
26567 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26568 anything declared inside `f'. */
26569 saved_in_unbraced_linkage_specification_p
26572 /* Inside the function, surrounding template-parameter-lists do not
26573 apply. */
26574 saved_num_template_parameter_lists
26580 /* If the next token is `try', `__transaction_atomic', or
26581 `__transaction_relaxed`, then we are looking at either function-try-block
26582 or function-transaction-block. Note that all of these include the
26583 function-body. */
26586 RID_TRANSACTION_ATOMIC);
26588 RID_TRANSACTION_RELAXED))
26590 RID_TRANSACTION_RELAXED);
26593 else
26594 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26599 /* Finish the function. */
26602 /* Generate code for it, if necessary. */
26604 /* Restore the saved values. */
26605 parser->in_unbraced_linkage_specification_p
26607 parser->num_template_parameter_lists
26611 parser->fully_implicit_function_template_p
26613 parser->implicit_template_parms
26615 parser->implicit_template_scope
26622 }
26624 /* Parse a template-declaration body (following argument list). */
26626 static void
26628 tree parameter_list,
26630 {
26634 /* We just processed one more parameter list. */
26637 /* Get the deferred access checks from the parameter list. These
26638 will be checked once we know what is being declared, as for a
26639 member template the checks must be performed in the scope of the
26640 class containing the member. */
26643 /* Tentatively parse for a new template parameter list, which can either be
26644 the template keyword or a template introduction. */
26650 else
26651 {
26652 /* There are no access checks when parsing a template, as we do not
26653 know if a specialization will be a friend. */
26657 checks,
26658 member_p,
26663 /* If this is a member template declaration, let the front
26664 end know. */
26666 {
26671 }
26676 }
26677 /* We are done with the current parameter list. */
26682 /* Finish up. */
26685 /* Check the template arguments for a literal operator template. */
26689 {
26693 else
26694 {
26697 {
26703 }
26705 {
26714 }
26715 else
26717 }
26719 {
26722 " Expected non-type template argument pack <char...>"
26724 decl);
26725 else
26728 decl);
26729 }
26730 }
26732 /* Register member declarations. */
26735 /* If DECL is a function template, we must return to parse it later.
26736 (Even though there is no definition, there might be default
26737 arguments that need handling.) */
26741 }
26743 /* Parse a template introduction header for a template-declaration. Returns
26744 false if tentative parse fails. */
26746 static bool
26748 {
26755 /* Look for the optional `::' operator. */
26758 /* Look for the nested-name-specifier. */
26768 /* Look up the concept for which we will be matching
26769 template parameters. */
26779 /* Look for opening brace for introduction. */
26780 matching_braces braces;
26788 /* Build vector of placeholder parameters and grab
26789 matching identifiers. */
26792 /* The introduction-list shall not be empty. */
26795 {
26798 }
26800 /* Look for closing brace for introduction. */
26805 {
26809 }
26811 /* Build and associate the constraint. */
26814 {
26816 member_p);
26818 }
26822 }
26824 /* Parse a normal template-declaration following the template keyword. */
26826 static void
26828 {
26829 tree parameter_list;
26833 /* Look for the `<' token. */
26837 {
26838 /* 14.5.2.2 [temp.mem]
26840 A local class shall not have member templates. */
26845 }
26846 /* [temp]
26848 A template ... shall not have C linkage. */
26850 {
26852 /* Give it C++ linkage to avoid confusing other parts of the
26853 front end. */
26856 }
26857 else
26860 /* We cannot perform access checks on the template parameter
26861 declarations until we know what is being declared, just as we
26862 cannot check the decl-specifier list. */
26865 /* If the next token is `>', then we have an invalid
26866 specialization. Rather than complain about an invalid template
26867 parameter, issue an error message here. */
26869 {
26873 }
26874 else
26875 {
26876 /* Parse the template parameters. */
26878 }
26880 /* Look for the `>'. */
26883 /* Manage template requirements */
26885 {
26890 }
26893 member_p);
26895 /* For the erroneous case of a template with C linkage, we pushed an
26896 implicit C++ linkage scope; exit that scope now. */
26899 }
26901 /* Parse a template-declaration, assuming that the `export' (and
26902 `extern') keywords, if present, has already been scanned. MEMBER_P
26903 is as for cp_parser_template_declaration. */
26905 static bool
26907 {
26909 {
26913 }
26918 }
26920 /* Perform the deferred access checks from a template-parameter-list.
26921 CHECKS is a TREE_LIST of access checks, as returned by
26922 get_deferred_access_checks. */
26924 static void
26925 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26926 {
26930 }
26932 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26933 `function-definition' sequence that follows a template header.
26934 If MEMBER_P is true, this declaration appears in a class scope.
26936 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26937 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26939 static tree
26945 {
26948 cp_decl_specifier_seq decl_specifiers;
26952 /* This function is only used when processing a template
26953 declaration. */
26957 /* Defer access checks until we know what is being declared. */
26960 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26961 alternative. */
26964 CP_PARSER_FLAGS_OPTIONAL,
26970 /* There are no template typedefs. */
26972 {
26976 }
26978 /* Gather up the access checks that occurred the
26979 decl-specifier-seq. */
26982 /* Check for the declaration of a template class. */
26984 {
26987 {
26988 // If this is a declaration, but not a definition, associate
26989 // any constraints with the type declaration. Constraints
26990 // are associated with definitions in cp_parser_class_specifier.
26996 /* In this case:
26998 struct C {
26999 friend template <typename T> struct A<T>::B;
27000 };
27002 A<T>::B will be represented by a TYPENAME_TYPE, and
27003 therefore not recognized by shadow_tag. */
27005 && !decl
27012 else
27015 /* Perform access checks for template parameters. */
27018 /* Give a helpful diagnostic for
27019 template <class T> struct A { } a;
27020 if we aren't already recovering from an error. */
27023 {
27025 "a class template declaration must not declare "
27029 }
27030 }
27031 }
27033 /* Complain about missing 'typename' or other invalid type names. */
27036 {
27037 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27038 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27039 the rest of this declaration. */
27042 }
27044 /* If it's not a template class, try for a template function. If
27045 the next token is a `;', then this declaration does not declare
27046 anything. But, if there were errors in the decl-specifiers, then
27047 the error might well have come from an attempted class-specifier.
27048 In that case, there's no need to warn about a missing declarator. */
27052 {
27055 checks,
27057 member_p,
27058 declares_class_or_enum,
27062 /* 7.1.1-1 [dcl.stc]
27064 A storage-class-specifier shall not be specified in an explicit
27065 specialization... */
27067 && explicit_specialization_p
27069 {
27073 }
27077 }
27079 /* Look for a trailing `;' after the declaration. */
27085 out:
27088 /* Clear any current qualification; whatever comes next is the start
27089 of something new. */
27095 }
27097 /* Parse a cast-expression that is not the operand of a unary "&". */
27099 static cp_expr
27101 {
27104 }
27106 /* Parse a functional cast to TYPE. Returns an expression
27107 representing the cast. */
27109 static cp_expr
27111 {
27113 tree expression_list;
27114 cp_expr cast;
27123 {
27133 /* Create a location of the form:
27134 type_name{i, f}
27135 ^~~~~~~~~~~~~~~
27136 with caret == start at the start of the type name,
27137 finishing at the closing brace. */
27138 location_t finish_loc
27141 finish_loc);
27144 }
27153 else
27154 {
27157 }
27160 tf_warning_or_error);
27161 /* [expr.const]/1: In an integral constant expression "only type
27162 conversions to integral or enumeration type can be used". */
27168 NIC_CONSTRUCTOR))
27171 /* Create a location of the form:
27172 float(i)
27173 ^~~~~~~~
27174 with caret == start at the start of the type name,
27175 finishing at the closing paren. */
27176 location_t finish_loc
27181 }
27183 /* Save the tokens that make up the body of a member function defined
27184 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27185 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27186 specifiers applied to the declaration. Returns the FUNCTION_DECL
27187 for the member function. */
27189 static tree
27193 tree attributes)
27194 {
27197 tree fn;
27200 /* Create the FUNCTION_DECL. */
27204 /* If something went badly wrong, bail out now. */
27206 {
27207 /* If there's a function-body, skip it. */
27212 }
27214 /* Remember it, if there default args to post process. */
27217 /* Save away the tokens that make up the body of the
27218 function. */
27224 RID_TRANSACTION_ATOMIC))
27225 {
27227 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27234 {
27240 }
27241 else
27244 {
27248 }
27249 }
27251 /* Handle function try blocks. */
27253 {
27256 }
27257 /* We can have braced-init-list mem-initializers before the fn body. */
27259 {
27262 {
27263 /* cache_group will stop after an un-nested { } pair, too. */
27267 /* variadic mem-inits have ... after the ')'. */
27270 }
27271 }
27273 /* Handle function try blocks. */
27279 /* Save away the inline definition; we will process it when the
27280 class is complete. */
27284 /* We need to know that this was defined in the class, so that
27285 friend templates are handled correctly. */
27288 /* Add FN to the queue of functions to be parsed later. */
27292 }
27294 /* Save the tokens that make up the in-class initializer for a non-static
27295 data member. Returns a DEFAULT_ARG. */
27297 static tree
27299 {
27301 }
27303 /* Parse a template-argument-list, as well as the trailing ">" (but
27304 not the opening "<"). See cp_parser_template_argument_list for the
27305 return value. */
27307 static tree
27309 {
27310 tree arguments;
27311 tree saved_scope;
27312 tree saved_qualifying_scope;
27313 tree saved_object_scope;
27318 /* [temp.names]
27320 When parsing a template-id, the first non-nested `>' is taken as
27321 the end of the template-argument-list rather than a greater-than
27322 operator. */
27323 saved_greater_than_is_operator_p
27326 /* Parsing the argument list may modify SCOPE, so we save it
27327 here. */
27331 /* We need to evaluate the template arguments, even though this
27332 template-id may be nested within a "sizeof". */
27337 /* Parse the template-argument-list itself. */
27341 else
27343 /* Look for the `>' that ends the template-argument-list. If we find
27344 a '>>' instead, it's probably just a typo. */
27346 {
27348 {
27349 /* In C++0x, a `>>' in a template argument list or cast
27350 expression is considered to be two separate `>'
27351 tokens. So, change the current token to a `>', but don't
27352 consume it: it will be consumed later when the outer
27353 template argument list (or cast expression) is parsed.
27354 Note that this replacement of `>' for `>>' is necessary
27355 even if we are parsing tentatively: in the tentative
27356 case, after calling
27357 cp_parser_enclosed_template_argument_list we will always
27358 throw away all of the template arguments and the first
27359 closing `>', either because the template argument list
27360 was erroneous or because we are replacing those tokens
27361 with a CPP_TEMPLATE_ID token. The second `>' (which will
27362 not have been thrown away) is needed either to close an
27363 outer template argument list or to complete a new-style
27364 cast. */
27367 }
27369 {
27370 /* If we're in a nested template argument list, the '>>' has
27371 to be a typo for '> >'. We emit the error message, but we
27372 continue parsing and we push a '>' as next token, so that
27373 the argument list will be parsed correctly. Note that the
27374 global source location is still on the token before the
27375 '>>', so we need to say explicitly where we want it. */
27383 }
27384 else
27385 {
27386 /* If this is not a nested template argument list, the '>>'
27387 is a typo for '>'. Emit an error message and continue.
27388 Same deal about the token location, but here we can get it
27389 right by consuming the '>>' before issuing the diagnostic. */
27392 "spurious %<>>%>, use %<>%> to terminate "
27394 }
27395 }
27396 else
27398 /* The `>' token might be a greater-than operator again now. */
27399 parser->greater_than_is_operator_p
27401 /* Restore the SAVED_SCOPE. */
27409 }
27411 /* MEMBER_FUNCTION is a member function, or a friend. If default
27412 arguments, or the body of the function have not yet been parsed,
27413 parse them now. */
27415 static void
27417 {
27419 /* If this member is a template, get the underlying
27420 FUNCTION_DECL. */
27424 /* There should not be any class definitions in progress at this
27425 point; the bodies of members are only parsed outside of all class
27426 definitions. */
27428 /* While we're parsing the member functions we might encounter more
27429 classes. We want to handle them right away, but we don't want
27430 them getting mixed up with functions that are currently in the
27431 queue. */
27434 /* Make sure that any template parameters are in scope. */
27437 /* If the body of the function has not yet been parsed, parse it
27438 now. */
27440 {
27441 tree function_scope;
27444 /* The function is no longer pending; we are processing it. */
27449 /* If this is a local class, enter the scope of the containing
27450 function. */
27455 /* Push the body of the function onto the lexer stack. */
27458 /* Let the front end know that we going to be defining this
27459 function. */
27463 /* Don't do access checking if it is a templated function. */
27467 /* #pragma omp declare reduction needs special parsing. */
27469 {
27474 }
27475 else
27476 /* Now, parse the body of the function. */
27483 /* Leave the scope of the containing function. */
27487 }
27489 /* Remove any template parameters from the symbol table. */
27492 /* Restore the queue. */
27495 }
27497 /* If DECL contains any default args, remember it on the unparsed
27498 functions queue. */
27500 static void
27502 {
27503 tree probe;
27506 probe;
27509 {
27513 }
27514 }
27516 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27517 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27518 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27519 from the parameter-type-list. */
27521 static tree
27524 {
27526 tree parsed_arg;
27532 /* Push the saved tokens for the default argument onto the parser's
27533 lexer stack. */
27539 /* Parse the default argument. */
27550 {
27551 /* In a non-template class, check conversions now. In a template,
27552 we'll wait and instantiate these as needed. */
27555 tf_warning_or_error);
27558 else
27560 }
27562 /* If the token stream has not been completely used up, then
27563 there was extra junk after the end of the default
27564 argument. */
27566 {
27569 else
27571 }
27573 /* Revert to the main lexer. */
27577 }
27579 /* FIELD is a non-static data member with an initializer which we saved for
27580 later; parse it now. */
27582 static void
27584 {
27585 tree def;
27592 NULL_TREE);
27598 }
27600 /* FN is a FUNCTION_DECL which may contains a parameter with an
27601 unparsed DEFAULT_ARG. Parse the default args now. This function
27602 assumes that the current scope is the scope in which the default
27603 argument should be processed. */
27605 static void
27607 {
27611 /* While we're parsing the default args, we might (due to the
27612 statement expression extension) encounter more classes. We want
27613 to handle them right away, but we don't want them getting mixed
27614 up with default args that are currently in the queue. */
27617 /* Local variable names (and the `this' keyword) may not appear
27618 in a default argument. */
27629 {
27631 tree parsed_arg;
27633 tree copy;
27640 /* This can happen for a friend declaration for a function
27641 already declared with default arguments. */
27644 parsed_arg
27646 default_arg,
27649 {
27651 }
27655 /* Update any instantiations we've already created. */
27659 }
27663 /* Make sure no default arg is missing. */
27666 /* Restore the state of local_variables_forbidden_p. */
27669 /* Restore the queue. */
27671 }
27673 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27675 sizeof ... ( identifier )
27677 where the 'sizeof' token has already been consumed. */
27679 static tree
27681 {
27682 /* Consume the `...'. */
27686 matching_parens parens;
27690 else
27698 /* The name is not qualified. */
27717 }
27719 /* Parse the operand of `sizeof' (or a similar operator). Returns
27720 either a TYPE or an expression, depending on the form of the
27721 input. The KEYWORD indicates which kind of expression we have
27722 encountered. */
27724 static tree
27726 {
27733 /* If it's a `...', then we are computing the length of a parameter
27734 pack. */
27739 /* Types cannot be defined in a `sizeof' expression. Save away the
27740 old message. */
27742 /* And create the new one. */
27748 /* The restrictions on constant-expressions do not apply inside
27749 sizeof expressions. */
27750 saved_integral_constant_expression_p
27752 saved_non_integral_constant_expression_p
27756 /* Do not actually evaluate the expression. */
27759 /* If it's a `(', then we might be looking at the type-id
27760 construction. */
27762 {
27765 /* We can't be sure yet whether we're looking at a type-id or an
27766 expression. */
27769 matching_parens parens;
27772 /* Note: as a GNU Extension, compound literals are considered
27773 postfix-expressions as they are in C99, so they are valid
27774 arguments to sizeof. See comment in cp_parser_cast_expression
27775 for details. */
27778 else
27779 {
27782 /* Look for the type-id. */
27784 /* Look for the closing `)'. */
27787 }
27789 /* If all went well, then we're done. */
27791 {
27792 cp_decl_specifier_seq decl_specs;
27794 /* Build a trivial decl-specifier-seq. */
27798 /* Call grokdeclarator to figure out what type this is. */
27801 TYPENAME,
27804 }
27805 }
27807 /* If the type-id production did not work out, then we must be
27808 looking at the unary-expression production. */
27812 /* Go back to evaluating expressions. */
27816 /* Free the message we created. */
27818 /* And restore the old one. */
27820 parser->integral_constant_expression_p
27822 parser->non_integral_constant_expression_p
27826 }
27828 /* If the current declaration has no declarator, return true. */
27830 static bool
27832 {
27833 /* If the next token is a `;' or a `,' then there is no
27834 declarator. */
27837 }
27839 /* Update the DECL_SPECS to reflect the storage class indicated by
27840 KEYWORD. */
27842 static void
27847 {
27848 cp_storage_class storage_class;
27851 {
27855 }
27857 {
27860 }
27865 {
27868 }
27871 {
27889 }
27893 /* A storage class specifier cannot be applied alongside a typedef
27894 specifier. If there is a typedef specifier present then set
27895 conflicting_specifiers_p which will trigger an error later
27896 on in grokdeclarator. */
27899 }
27901 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27902 is true, the type is a class or enum definition. */
27904 static void
27906 tree type_spec,
27909 {
27912 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27913 (with, for example, in "typedef int wchar_t;") we remember that
27914 this is what happened. In system headers, we ignore these
27915 declarations so that G++ can work with system headers that are not
27916 C++-safe. */
27918 && !type_definition_p
27928 {
27931 ds_redefined_builtin_type_spec,
27932 token);
27934 {
27938 }
27939 }
27942 else
27943 {
27948 }
27949 }
27951 /* True iff TOKEN is the GNU keyword __thread. */
27953 static bool
27955 {
27958 }
27960 /* Set the location for a declarator specifier and check if it is
27961 duplicated.
27963 DECL_SPECS is the sequence of declarator specifiers onto which to
27964 set the location.
27966 DS is the single declarator specifier to set which location is to
27967 be set onto the existing sequence of declarators.
27969 LOCATION is the location for the declarator specifier to
27970 consider. */
27972 static void
27975 {
27984 {
27988 }
27989 else
27990 {
27992 {
27996 else
27997 {
28000 OPT_Wlong_long,
28002 }
28003 }
28005 {
28010 else
28011 {
28015 }
28016 }
28017 else
28018 {
28034 "__complex"
28035 };
28039 }
28040 }
28041 }
28043 /* Return true iff the declarator specifier DS is present in the
28044 sequence of declarator specifiers DECL_SPECS. */
28046 bool
28048 cp_decl_spec ds)
28049 {
28056 }
28058 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28059 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28061 static bool
28063 {
28065 }
28067 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
28068 RT_CLOSE_PAREN. */
28072 {
28074 {
28082 }
28083 }
28085 /* Issue an error message indicating that TOKEN_DESC was expected.
28086 If KEYWORD is true, it indicated this function is called by
28087 cp_parser_require_keword and the required token can only be
28088 a indicated keyword.
28090 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28091 within any error as the location of an "opening" token matching
28092 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28093 RT_CLOSE_PAREN). */
28095 static void
28097 required_token token_desc,
28099 location_t matching_location)
28100 {
28106 {
28175 }
28178 {
28180 {
28258 }
28259 }
28262 {
28263 /* Emulate rest of cp_parser_error. */
28269 /* If matching_location != UNKNOWN_LOCATION, highlight it.
28270 Attempt to consolidate diagnostics by printing it as a
28271 secondary range within the main diagnostic. */
28274 added_matching_location
28281 /* If we weren't able to consolidate matching_location, then
28282 print it as a secondary diagnostic. */
28286 }
28287 }
28290 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28291 issue an error message indicating that TOKEN_DESC was expected.
28293 Returns the token consumed, if the token had the appropriate type.
28294 Otherwise, returns NULL.
28296 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28297 within any error as the location of an "opening" token matching
28298 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28299 RT_CLOSE_PAREN). */
28304 required_token token_desc,
28305 location_t matching_location)
28306 {
28309 else
28310 {
28311 /* Output the MESSAGE -- unless we're parsing tentatively. */
28314 matching_location);
28316 }
28317 }
28319 /* An error message is produced if the next token is not '>'.
28320 All further tokens are skipped until the desired token is
28321 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28323 static void
28325 {
28326 /* Current level of '< ... >'. */
28328 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28331 /* Are we ready, yet? If not, issue error message. */
28335 /* Skip tokens until the desired token is found. */
28337 {
28338 /* Peek at the next token. */
28340 {
28348 /* C++0x views the `>>' operator as two `>' tokens, but
28349 C++98 does not. */
28352 {
28353 /* We've hit a `>>' where the first `>' closes the
28354 template argument list, and the second `>' is
28355 spurious. Just consume the `>>' and stop; we've
28356 already produced at least one error. */
28359 }
28360 /* Fall through for C++0x, so we handle the second `>' in
28361 the `>>'. */
28366 {
28367 /* We've reached the token we want, consume it and stop. */
28370 }
28389 /* The '>' was probably forgotten, don't look further. */
28394 }
28396 /* Consume this token. */
28398 }
28399 }
28401 /* If the next token is the indicated keyword, consume it. Otherwise,
28402 issue an error message indicating that TOKEN_DESC was expected.
28404 Returns the token consumed, if the token had the appropriate type.
28405 Otherwise, returns NULL. */
28410 required_token token_desc)
28411 {
28415 {
28417 UNKNOWN_LOCATION);
28419 }
28422 }
28424 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28425 function-definition. */
28427 static bool
28429 {
28432 /* A ctor-initializer begins with a `:'. */
28434 /* A function-try-block begins with `try'. */
28436 /* A function-transaction-block begins with `__transaction_atomic'
28437 or `__transaction_relaxed'. */
28440 /* The named return value extension begins with `return'. */
28442 }
28444 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28445 definition. */
28447 static bool
28449 {
28456 }
28458 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28459 C++0x) ending a template-argument. */
28461 static bool
28463 {
28471 }
28473 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28474 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28476 static bool
28479 {
28485 /* Check for the sequence `<::' in the original code. It would be lexed as
28486 `[:', where `[' is a digraph, and there is no whitespace before
28487 `:'. */
28489 {
28494 }
28496 }
28498 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28499 or none_type otherwise. */
28501 static enum tag_types
28503 {
28505 {
28515 }
28516 }
28518 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28519 or none_type otherwise or if the token is null. */
28521 static enum tag_types
28523 {
28528 {
28536 }
28537 }
28539 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28541 static void
28543 {
28547 {
28551 type))
28554 }
28555 }
28557 /* Issue an error message if DECL is redeclared with different
28558 access than its original declaration [class.access.spec/3].
28559 This applies to nested classes, nested class templates and
28560 enumerations [class.mem/1]. */
28562 static void
28564 {
28575 }
28577 /* Look for the `template' keyword, as a syntactic disambiguator.
28578 Return TRUE iff it is present, in which case it will be
28579 consumed. */
28581 static bool
28583 {
28585 {
28586 /* In C++98 the `template' keyword can only be used within templates;
28587 outside templates the parser can always figure out what is a
28588 template and what is not. In C++11, per the resolution of DR 468,
28589 `template' is allowed in cases where it is not strictly necessary. */
28592 {
28595 "in C++98 %<template%> (as a disambiguator) is only "
28597 /* If this part of the token stream is rescanned, the same
28598 error message would be generated. So, we purge the token
28599 from the stream. */
28602 }
28603 else
28604 {
28605 /* Consume the `template' keyword. */
28608 }
28609 }
28611 }
28613 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28614 set PARSER->SCOPE, and perform other related actions. */
28616 static void
28618 {
28621 /* Get the stored value. */
28623 /* Set the scope from the stored value. */
28627 }
28629 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28630 encounter the end of a block before what we were looking for. */
28632 static bool
28636 {
28638 {
28641 /* Abort a parenthesized expression if we encounter a semicolon. */
28645 /* If we've reached the end of the file, stop. */
28651 /* We've hit the end of an enclosing block, so there's been some
28652 kind of syntax error. */
28655 /* Consume the token. */
28657 /* See if it starts a new group. */
28659 {
28661 /* In theory this should probably check end == '}', but
28662 cp_parser_save_member_function_body needs it to exit
28663 after either '}' or ')' when called with ')'. */
28666 }
28668 {
28672 }
28677 }
28678 }
28680 /* Like above, for caching a default argument or NSDMI. Both of these are
28681 terminated by a non-nested comma, but it can be unclear whether or not a
28682 comma is nested in a template argument list unless we do more parsing.
28683 In order to handle this ambiguity, when we encounter a ',' after a '<'
28684 we try to parse what follows as a parameter-declaration-list (in the
28685 case of a default argument) or a member-declarator (in the case of an
28686 NSDMI). If that succeeds, then we stop caching. */
28688 static tree
28690 {
28695 tree default_argument;
28697 /* Add tokens until we have processed the entire default
28698 argument. We add the range [first_token, token). */
28701 {
28702 /* For list-initialization, this is straightforward. */
28705 }
28707 {
28710 /* Peek at the next token. */
28712 /* What we do depends on what token we have. */
28714 {
28715 /* In valid code, a default argument must be
28716 immediately followed by a `,' `)', or `...'. */
28719 {
28720 /* If we've seen a '<', we might be in a
28721 template-argument-list. Until Core issue 325 is
28722 resolved, we don't know how this situation ought
28723 to be handled, so try to DTRT. We check whether
28724 what comes after the comma is a valid parameter
28725 declaration list. If it is, then the comma ends
28726 the default argument; otherwise the default
28727 argument continues. */
28731 /* Set ITALP so cp_parser_parameter_declaration_list
28732 doesn't decide to commit to this parse. */
28739 {
28740 /* Parse declarators until we reach a non-comma or
28741 somthing that cannot be an initializer.
28742 Just checking whether we're looking at a single
28743 declarator is insufficient. Consider:
28744 int var = tuple<T,U>::x;
28745 The template parameter 'U' looks exactly like a
28746 declarator. */
28747 do
28748 {
28759 }
28761 /* If we met an '=' or ';' then the original comma
28762 was the end of the NSDMI. Otherwise assume
28763 we're still in the NSDMI. */
28766 }
28767 else
28768 {
28773 }
28780 }
28781 /* FALLTHRU */
28784 /* If we run into a non-nested `;', `}', or `]',
28785 then the code is invalid -- but the default
28786 argument is certainly over. */
28791 /* Handle correctly int n = sizeof ... ( p ); */
28794 /* Update DEPTH, if necessary. */
28809 /* This might be the comparison operator, or it might
28810 start a template argument list. */
28817 /* Fall through for C++0x, which treats the `>>'
28818 operator like two `>' tokens in certain
28819 cases. */
28824 {
28825 /* This might be an operator, or it might close a
28826 template argument list. But if a previous '<'
28827 started a template argument list, this will have
28828 closed it, so we can't be in one anymore. */
28832 }
28835 /* If we run out of tokens, issue an error message. */
28843 /* In these cases, we should look for template-ids.
28844 For example, if the default argument is
28845 `X<int, double>()', we need to do name lookup to
28846 figure out whether or not `X' is a template; if
28847 so, the `,' does not end the default argument.
28849 That is not yet done. */
28854 }
28856 /* If we've reached the end, stop. */
28860 /* Add the token to the token block. */
28862 }
28864 /* Create a DEFAULT_ARG to represent the unparsed default
28865 argument. */
28872 }
28874 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
28876 location_t
28878 {
28883 }
28885 /* Begin parsing tentatively. We always save tokens while parsing
28886 tentatively so that if the tentative parsing fails we can restore the
28887 tokens. */
28889 static void
28891 {
28892 /* Enter a new parsing context. */
28894 /* Begin saving tokens. */
28896 /* In order to avoid repetitive access control error messages,
28897 access checks are queued up until we are no longer parsing
28898 tentatively. */
28900 }
28902 /* Commit to the currently active tentative parse. */
28904 static void
28906 {
28910 /* Mark all of the levels as committed. */
28913 {
28920 }
28921 }
28923 /* Commit to the topmost currently active tentative parse.
28925 Note that this function shouldn't be called when there are
28926 irreversible side-effects while in a tentative state. For
28927 example, we shouldn't create a permanent entry in the symbol
28928 table, or issue an error message that might not apply if the
28929 tentative parse is aborted. */
28931 static void
28933 {
28938 {
28946 }
28947 }
28949 /* Abort the currently active tentative parse. All consumed tokens
28950 will be rolled back, and no diagnostics will be issued. */
28952 static void
28954 {
28958 /* Now, pretend that we want to see if the construct was
28959 successfully parsed. */
28961 }
28963 /* Stop parsing tentatively. If a parse error has occurred, restore the
28964 token stream. Otherwise, commit to the tokens we have consumed.
28965 Returns true if no error occurred; false otherwise. */
28967 static bool
28969 {
28973 /* Remember whether or not an error occurred, since we are about to
28974 destroy that information. */
28976 /* Remove the topmost context from the stack. */
28979 /* If no parse errors occurred, commit to the tentative parse. */
28981 {
28982 /* Commit to the tokens read tentatively, unless that was
28983 already done. */
28988 }
28989 /* Otherwise, if errors occurred, roll back our state so that things
28990 are just as they were before we began the tentative parse. */
28991 else
28992 {
28995 }
28996 /* Add the context to the front of the free list. */
29001 }
29003 /* Returns true if we are parsing tentatively and are not committed to
29004 this tentative parse. */
29006 static bool
29008 {
29011 }
29013 /* Returns nonzero iff an error has occurred during the most recent
29014 tentative parse. */
29016 static bool
29018 {
29021 }
29023 /* Returns nonzero if GNU extensions are allowed. */
29025 static bool
29027 {
29029 }
29030 \f
29031 /* Objective-C++ Productions */
29034 /* Parse an Objective-C expression, which feeds into a primary-expression
29035 above.
29037 objc-expression:
29038 objc-message-expression
29039 objc-string-literal
29040 objc-encode-expression
29041 objc-protocol-expression
29042 objc-selector-expression
29044 Returns a tree representation of the expression. */
29046 static cp_expr
29048 {
29049 /* Try to figure out what kind of declaration is present. */
29053 {
29063 {
29075 }
29081 }
29084 }
29086 /* Parse an Objective-C message expression.
29088 objc-message-expression:
29089 [ objc-message-receiver objc-message-args ]
29091 Returns a representation of an Objective-C message. */
29093 static tree
29095 {
29107 /* Construct a location e.g.
29108 [self func1:5]
29109 ^~~~~~~~~~~~~~
29110 ranging from the '[' to the ']', with the caret at the start. */
29115 }
29117 /* Parse an objc-message-receiver.
29119 objc-message-receiver:
29120 expression
29121 simple-type-specifier
29123 Returns a representation of the type or expression. */
29125 static tree
29127 {
29128 tree rcv;
29130 /* An Objective-C message receiver may be either (1) a type
29131 or (2) an expression. */
29135 /* If that worked out, fine. */
29142 CP_PARSER_FLAGS_NONE);
29149 }
29151 /* Parse the arguments and selectors comprising an Objective-C message.
29153 objc-message-args:
29154 objc-selector
29155 objc-selector-args
29156 objc-selector-args , objc-comma-args
29158 objc-selector-args:
29159 objc-selector [opt] : assignment-expression
29160 objc-selector-args objc-selector [opt] : assignment-expression
29162 objc-comma-args:
29163 assignment-expression
29164 objc-comma-args , assignment-expression
29166 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29167 selector arguments and TREE_VALUE containing a list of comma
29168 arguments. */
29170 static tree
29172 {
29178 {
29184 /* Detect if we have a unary selector. */
29193 sel_args
29198 }
29200 /* Handle non-selector arguments, if any. */
29202 {
29203 tree arg;
29208 addl_args
29213 }
29216 {
29219 }
29222 }
29224 /* Parse an Objective-C encode expression.
29226 objc-encode-expression:
29227 @encode objc-typename
29229 Returns an encoded representation of the type argument. */
29231 static cp_expr
29233 {
29234 tree type;
29239 matching_parens parens;
29246 {
29250 }
29252 /* This happens if we find @encode(T) (where T is a template
29253 typename or something dependent on a template typename) when
29254 parsing a template. In that case, we can't compile it
29255 immediately, but we rather create an AT_ENCODE_EXPR which will
29256 need to be instantiated when the template is used.
29257 */
29259 {
29263 }
29266 /* Build a location of the form:
29267 @encode(int)
29268 ^~~~~~~~~~~~
29269 with caret==start at the @ token, finishing at the close paren. */
29270 location_t combined_loc
29275 }
29277 /* Parse an Objective-C @defs expression. */
29279 static tree
29281 {
29282 tree name;
29285 matching_parens parens;
29291 }
29293 /* Parse an Objective-C protocol expression.
29295 objc-protocol-expression:
29296 @protocol ( identifier )
29298 Returns a representation of the protocol expression. */
29300 static tree
29302 {
29303 tree proto;
29307 matching_parens parens;
29312 /* Build a location of the form:
29313 @protocol(prot)
29314 ^~~~~~~~~~~~~~~
29315 with caret==start at the @ token, finishing at the close paren. */
29316 location_t combined_loc
29322 }
29324 /* Parse an Objective-C selector expression.
29326 objc-selector-expression:
29327 @selector ( objc-method-signature )
29329 objc-method-signature:
29330 objc-selector
29331 objc-selector-seq
29333 objc-selector-seq:
29334 objc-selector :
29335 objc-selector-seq objc-selector :
29337 Returns a representation of the method selector. */
29339 static tree
29341 {
29348 matching_parens parens;
29354 {
29363 {
29364 /* Detect if we have a unary selector. */
29366 {
29369 }
29370 else
29371 {
29373 }
29374 }
29379 {
29380 sel_seq
29383 sel_seq
29386 }
29387 else
29388 sel_seq
29393 }
29395 finish_selector:
29399 /* Build a location of the form:
29400 @selector(func)
29401 ^~~~~~~~~~~~~~~
29402 with caret==start at the @ token, finishing at the close paren. */
29403 location_t combined_loc
29407 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29410 }
29412 /* Parse a list of identifiers.
29414 objc-identifier-list:
29415 identifier
29416 objc-identifier-list , identifier
29418 Returns a TREE_LIST of identifier nodes. */
29420 static tree
29422 {
29423 tree identifier;
29424 tree list;
29435 {
29442 identifier));
29444 }
29447 }
29449 /* Parse an Objective-C alias declaration.
29451 objc-alias-declaration:
29452 @compatibility_alias identifier identifier ;
29454 This function registers the alias mapping with the Objective-C front end.
29455 It returns nothing. */
29457 static void
29459 {
29467 }
29469 /* Parse an Objective-C class forward-declaration.
29471 objc-class-declaration:
29472 @class objc-identifier-list ;
29474 The function registers the forward declarations with the Objective-C
29475 front end. It returns nothing. */
29477 static void
29479 {
29482 {
29483 tree id;
29493 else
29495 }
29497 }
29499 /* Parse a list of Objective-C protocol references.
29501 objc-protocol-refs-opt:
29502 objc-protocol-refs [opt]
29504 objc-protocol-refs:
29505 < objc-identifier-list >
29507 Returns a TREE_LIST of identifiers, if any. */
29509 static tree
29511 {
29515 {
29519 }
29522 }
29524 /* Parse a Objective-C visibility specification. */
29526 static void
29528 {
29532 {
29547 }
29549 /* Eat '@private'/'@protected'/'@public'. */
29551 }
29553 /* Parse an Objective-C method type. Return 'true' if it is a class
29554 (+) method, and 'false' if it is an instance (-) method. */
29558 {
29561 else
29563 }
29565 /* Parse an Objective-C protocol qualifier. */
29567 static tree
29569 {
29582 {
29587 }
29590 }
29592 /* Parse an Objective-C typename. */
29594 static tree
29596 {
29600 {
29603 matching_parens parens;
29607 /* An ObjC type name may consist of just protocol qualifiers, in which
29608 case the type shall default to 'id'. */
29610 {
29613 /* If the type could not be parsed, an error has already
29614 been produced. For error recovery, behave as if it had
29615 not been specified, which will use the default type
29616 'id'. */
29618 {
29620 /* We need to skip to the closing parenthesis as
29621 cp_parser_type_id() does not seem to do it for
29622 us. */
29627 }
29628 }
29632 }
29635 }
29637 /* Check to see if TYPE refers to an Objective-C selector name. */
29639 static bool
29641 {
29647 }
29649 /* Parse an Objective-C selector. */
29651 static tree
29653 {
29657 {
29660 }
29662 /* C++ operator names are allowed to appear in ObjC selectors. */
29664 {
29677 }
29678 }
29680 /* Parse an Objective-C params list. */
29682 static tree
29684 {
29690 {
29700 /* Detect if we have a unary selector. */
29703 {
29706 }
29710 {
29711 /* Something went quite wrong. There should be a colon
29712 here, but there is not. Stop parsing parameters. */
29714 }
29716 /* New ObjC allows attributes on parameters too. */
29721 params
29724 type_name,
29725 identifier,
29726 parm_attr));
29729 }
29732 {
29735 }
29737 /* We allow tail attributes for the method. */
29739 {
29747 }
29750 {
29753 }
29755 }
29757 /* Parse the non-keyword Objective-C params. */
29759 static tree
29762 {
29768 {
29770 tree parm;
29776 {
29781 }
29783 /* TODO: parse attributes for tail parameters. */
29792 }
29794 /* We allow tail attributes for the method. */
29796 {
29798 {
29803 }
29804 else
29805 /* We have an error, but parse the attributes, so that we can
29806 carry on. */
29812 }
29815 }
29817 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29819 static void
29821 {
29824 /* If the next token is `extern' and the following token is a string
29825 literal, then we have a linkage specification. */
29827 && cp_parser_is_pure_string_literal
29830 /* Handle #pragma, if any. */
29833 /* Allow stray semicolons. */
29836 /* Mark methods as optional or required, when building protocols. */
29838 {
29841 }
29843 {
29846 }
29849 /* Other stray characters must generate errors. */
29851 {
29855 }
29856 /* Finally, try to parse a block-declaration, or a function-definition. */
29857 else
29859 }
29861 /* Parse a method signature. */
29863 static tree
29865 {
29881 }
29883 static bool
29885 {
29886 tree tattr;
29891 /* If the attributes are followed by a method introducer, this is not allowed.
29892 Dump the attributes and flag the situation. */
29897 /* Otherwise, the attributes introduce some interstitial code, possibly so
29898 rewind to allow that check. */
29901 }
29903 /* Parse an Objective-C method prototype list. */
29905 static void
29907 {
29911 {
29913 {
29918 else
29922 {
29926 }
29929 }
29935 OPT_Wattributes,
29937 else
29938 /* Allow for interspersed non-ObjC++ code. */
29942 }
29946 else
29950 }
29952 /* Parse an Objective-C method definition list. */
29954 static void
29956 {
29960 {
29961 tree meth;
29964 {
29970 else
29975 {
29979 }
29981 NULL_TREE);
29983 /* For historical reasons, we accept an optional semicolon. */
29990 {
29997 }
29998 }
29999 /* The following case will be removed once @synthesize is
30000 completely implemented. */
30011 else
30012 /* Allow for interspersed non-ObjC++ code. */
30016 }
30020 else
30024 }
30026 /* Parse Objective-C ivars. */
30028 static void
30030 {
30041 {
30042 cp_decl_specifier_seq declspecs;
30044 tree prefix_attributes;
30052 CP_PARSER_FLAGS_OPTIONAL,
30056 /* auto, register, static, extern, mutable. */
30058 {
30061 }
30063 /* thread_local. */
30065 {
30068 }
30070 /* typedef. */
30072 {
30075 }
30080 /* Keep going until we hit the `;' at the end of the
30081 declaration. */
30083 {
30088 /* Check for a (possibly unnamed) bitfield declaration. */
30096 {
30097 /* Get the name of the bitfield. */
30100 sfk_none);
30102 eat_colon:
30104 /* Get the width of the bitfield. */
30105 width
30107 }
30108 else
30109 {
30110 /* Parse the declarator. */
30111 declarator
30117 }
30119 /* Look for attributes that apply to the ivar. */
30121 /* Remember which attributes are prefix attributes and
30122 which are not. */
30124 /* Combine the attributes. */
30128 /* Create the bitfield declaration. */
30130 width,
30131 attributes);
30132 else
30137 /* Add the instance variable. */
30141 /* Reset PREFIX_ATTRIBUTES. */
30150 {
30153 }
30155 }
30159 }
30164 /* Do not consume the RID_AT_END, so it will be read again as terminating
30165 the @interface of @implementation. */
30169 /* For historical reasons, we accept an optional semicolon. */
30172 }
30174 /* Parse an Objective-C protocol declaration. */
30176 static void
30178 {
30184 {
30189 }
30191 /* See if we have a forward declaration or a definition. */
30194 /* Try a forward declaration first. */
30196 {
30198 {
30199 tree id;
30209 else
30211 }
30213 }
30215 /* Ok, we got a full-fledged definition (or at least should). */
30216 else
30217 {
30222 }
30223 }
30225 /* Parse an Objective-C superclass or category. */
30227 static void
30232 {
30238 {
30241 }
30243 {
30244 matching_parens parens;
30247 /* If there is no category name, and this is an @interface, we
30248 have a class extension. */
30250 {
30253 }
30254 else
30258 }
30259 }
30261 /* Parse an Objective-C class interface. */
30263 static void
30265 {
30272 {
30273 /* It's hard to recover because even if valid @interface stuff
30274 is to follow, we can't compile it (or validate it) if we
30275 don't even know which class it refers to. Let's assume this
30276 was a stray '@interface' token in the stream and skip it.
30277 */
30279 }
30284 /* We have either a class or a category on our hands. */
30287 else
30288 {
30290 /* Handle instance variable declarations, if any. */
30293 }
30296 }
30298 /* Parse an Objective-C class implementation. */
30300 static void
30302 {
30309 {
30310 /* It's hard to recover because even if valid @implementation
30311 stuff is to follow, we can't compile it (or validate it) if
30312 we don't even know which class it refers to. Let's assume
30313 this was a stray '@implementation' token in the stream and
30314 skip it.
30315 */
30317 }
30321 /* We have either a class or a category on our hands. */
30324 else
30325 {
30327 /* Handle instance variable declarations, if any. */
30330 }
30333 }
30335 /* Consume the @end token and finish off the implementation. */
30337 static void
30339 {
30342 }
30344 /* Parse an Objective-C declaration. */
30346 static void
30348 {
30349 /* Try to figure out what kind of declaration is present. */
30354 {
30370 }
30373 {
30396 }
30397 }
30399 /* Parse an Objective-C try-catch-finally statement.
30401 objc-try-catch-finally-stmt:
30402 @try compound-statement objc-catch-clause-seq [opt]
30403 objc-finally-clause [opt]
30405 objc-catch-clause-seq:
30406 objc-catch-clause objc-catch-clause-seq [opt]
30408 objc-catch-clause:
30409 @catch ( objc-exception-declaration ) compound-statement
30411 objc-finally-clause:
30412 @finally compound-statement
30414 objc-exception-declaration:
30415 parameter-declaration
30416 '...'
30418 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30420 Returns NULL_TREE.
30422 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30423 for C. Keep them in sync. */
30425 static tree
30427 {
30428 location_t location;
30429 tree stmt;
30434 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30435 node, lest it get absorbed into the surrounding block. */
30441 {
30445 matching_parens parens;
30451 {
30452 /* We have "@catch (...)" (where the '...' are literally
30453 what is in the code). Skip the '...'.
30454 parameter_declaration is set to NULL_TREE, and
30455 objc_being_catch_clauses() knows that that means
30456 '...'. */
30459 }
30460 else
30461 {
30462 /* We have "@catch (NSException *exception)" or something
30463 like that. Parse the parameter declaration. */
30467 else
30472 }
30475 else
30476 {
30477 /* If there was no open parenthesis, we are recovering from
30478 an error, and we are trying to figure out what mistake
30479 the user has made. */
30481 /* If there is an immediate closing parenthesis, the user
30482 probably forgot the opening one (ie, they typed "@catch
30483 NSException *e)". Parse the closing parenthesis and keep
30484 going. */
30488 /* If these is no immediate closing parenthesis, the user
30489 probably doesn't know that parenthesis are required at
30490 all (ie, they typed "@catch NSException *e"). So, just
30491 forget about the closing parenthesis and keep going. */
30492 }
30496 }
30498 {
30501 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30502 node, lest it get absorbed into the surrounding block. */
30506 }
30509 }
30511 /* Parse an Objective-C synchronized statement.
30513 objc-synchronized-stmt:
30514 @synchronized ( expression ) compound-statement
30516 Returns NULL_TREE. */
30518 static tree
30520 {
30521 location_t location;
30528 matching_parens parens;
30533 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30534 node, lest it get absorbed into the surrounding block. */
30539 }
30541 /* Parse an Objective-C throw statement.
30543 objc-throw-stmt:
30544 @throw assignment-expression [opt] ;
30546 Returns a constructed '@throw' statement. */
30548 static tree
30550 {
30562 }
30564 /* Parse an Objective-C statement. */
30566 static tree
30568 {
30569 /* Try to figure out what kind of declaration is present. */
30573 {
30584 }
30587 }
30589 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30590 look ahead to see if an objc keyword follows the attributes. This
30591 is to detect the use of prefix attributes on ObjC @interface and
30592 @protocol. */
30594 static bool
30596 {
30601 {
30604 }
30607 }
30609 /* This routine is a minimal replacement for
30610 c_parser_struct_declaration () used when parsing the list of
30611 types/names or ObjC++ properties. For example, when parsing the
30612 code
30614 @property (readonly) int a, b, c;
30616 this function is responsible for parsing "int a, int b, int c" and
30617 returning the declarations as CHAIN of DECLs.
30619 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30620 similar parsing. */
30621 static tree
30623 {
30625 cp_decl_specifier_seq declspecs;
30627 tree prefix_attributes;
30630 CP_PARSER_FLAGS_NONE,
30637 /* auto, register, static, extern, mutable. */
30639 {
30642 }
30644 /* thread_local. */
30646 {
30649 }
30651 /* typedef. */
30653 {
30656 }
30661 /* Keep going until we hit the `;' at the end of the declaration. */
30663 {
30668 /* Parse the declarator. */
30672 /* Look for attributes that apply to the ivar. */
30674 /* Remember which attributes are prefix attributes and
30675 which are not. */
30677 /* Combine the attributes. */
30687 /* Reset PREFIX_ATTRIBUTES. */
30698 {
30701 }
30702 else
30704 }
30706 }
30708 /* Parse an Objective-C @property declaration. The syntax is:
30710 objc-property-declaration:
30711 '@property' objc-property-attributes[opt] struct-declaration ;
30713 objc-property-attributes:
30714 '(' objc-property-attribute-list ')'
30716 objc-property-attribute-list:
30717 objc-property-attribute
30718 objc-property-attribute-list, objc-property-attribute
30720 objc-property-attribute
30721 'getter' = identifier
30722 'setter' = identifier
30723 'readonly'
30724 'readwrite'
30725 'assign'
30726 'retain'
30727 'copy'
30728 'nonatomic'
30730 For example:
30731 @property NSString *name;
30732 @property (readonly) id object;
30733 @property (retain, nonatomic, getter=getTheName) id name;
30734 @property int a, b, c;
30736 PS: This function is identical to
30737 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30738 static void
30740 {
30741 /* The following variables hold the attributes of the properties as
30742 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30743 seen. When we see an attribute, we set them to 'true' (if they
30744 are boolean properties) or to the identifier (if they have an
30745 argument, ie, for getter and setter). Note that here we only
30746 parse the list of attributes, check the syntax and accumulate the
30747 attributes that we find. objc_add_property_declaration() will
30748 then process the information. */
30758 /* 'properties' is the list of properties that we read. Usually a
30759 single one, but maybe more (eg, in "@property int a, b, c;" there
30760 are three). */
30761 tree properties;
30762 location_t loc;
30768 /* Parse the optional attribute list... */
30770 {
30771 /* Eat the '('. */
30772 matching_parens parens;
30776 {
30782 {
30785 }
30789 {
30800 {
30804 else
30809 }
30812 {
30816 }
30818 {
30820 {
30823 }
30824 else
30828 else
30830 }
30831 else
30832 {
30834 {
30837 }
30838 else
30840 }
30846 }
30853 else
30855 }
30857 /* FIXME: "@property (setter, assign);" will generate a spurious
30858 "error: expected ‘)’ before ‘,’ token". This is because
30859 cp_parser_require, unlike the C counterpart, will produce an
30860 error even if we are in error recovery. */
30862 {
30867 }
30868 }
30870 /* ... and the property declaration(s). */
30874 {
30876 /* If the next token is now a `;', consume it. */
30880 }
30884 else
30885 {
30886 /* Comma-separated properties are chained together in
30887 reverse order; add them one by one. */
30896 }
30899 }
30901 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30903 objc-synthesize-declaration:
30904 @synthesize objc-synthesize-identifier-list ;
30906 objc-synthesize-identifier-list:
30907 objc-synthesize-identifier
30908 objc-synthesize-identifier-list, objc-synthesize-identifier
30910 objc-synthesize-identifier
30911 identifier
30912 identifier = identifier
30914 For example:
30915 @synthesize MyProperty;
30916 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30918 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30919 for C. Keep them in sync.
30920 */
30921 static void
30923 {
30925 location_t loc;
30930 {
30934 {
30937 }
30939 {
30943 {
30946 }
30947 }
30948 else
30953 else
30955 }
30958 }
30960 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30962 objc-dynamic-declaration:
30963 @dynamic identifier-list ;
30965 For example:
30966 @dynamic MyProperty;
30967 @dynamic MyProperty, AnotherProperty;
30969 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30970 for C. Keep them in sync.
30971 */
30972 static void
30974 {
30976 location_t loc;
30981 {
30982 tree property;
30985 {
30988 }
30992 else
30994 }
30997 }
30999 \f
31000 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31002 /* Returns name of the next clause.
31003 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31004 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31005 returned and the token is consumed. */
31007 static pragma_omp_clause
31009 {
31025 {
31030 {
31213 }
31214 }
31220 }
31222 /* Validate that a clause of the given type does not already exist. */
31224 static void
31227 {
31228 tree c;
31232 {
31235 }
31236 }
31238 /* OpenMP 2.5:
31239 variable-list:
31240 identifier
31241 variable-list , identifier
31243 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31244 colon). An opening parenthesis will have been consumed by the caller.
31246 If KIND is nonzero, create the appropriate node and install the decl
31247 in OMP_CLAUSE_DECL and add the node to the head of the list.
31249 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31250 return the list created.
31252 COLON can be NULL if only closing parenthesis should end the list,
31253 or pointer to bool which will receive false if the list is terminated
31254 by closing parenthesis or true if the list is terminated by colon. */
31256 static tree
31259 {
31263 {
31266 }
31268 {
31273 && current_class_ptr
31275 {
31281 }
31282 else
31283 {
31296 }
31298 ;
31300 {
31302 {
31304 /* The OpenACC cache directive explicitly only allows "array
31305 elements or subarrays". */
31307 {
31311 }
31312 /* FALLTHROUGH. */
31317 {
31318 location_t loc
31323 decl
31327 }
31328 /* FALLTHROUGH. */
31332 {
31340 parser->colon_corrects_to_scope_p
31344 else
31345 {
31346 /* Look for `:'. */
31350 CPP_CLOSE_SQUARE))
31352 }
31353 /* Look for the closing `]'. */
31355 RT_CLOSE_SQUARE))
31359 }
31363 }
31369 }
31370 else
31373 get_comma:
31377 }
31383 {
31387 }
31390 {
31393 /* Try to resync to an unnested comma. Copied from
31394 cp_parser_parenthesized_expression_list. */
31395 skip_comma:
31404 }
31407 }
31409 /* Similarly, but expect leading and trailing parenthesis. This is a very
31410 common case for omp clauses. */
31412 static tree
31414 {
31418 }
31420 /* OpenACC 2.0:
31421 copy ( variable-list )
31422 copyin ( variable-list )
31423 copyout ( variable-list )
31424 create ( variable-list )
31425 delete ( variable-list )
31426 present ( variable-list )
31427 present_or_copy ( variable-list )
31428 pcopy ( variable-list )
31429 present_or_copyin ( variable-list )
31430 pcopyin ( variable-list )
31431 present_or_copyout ( variable-list )
31432 pcopyout ( variable-list )
31433 present_or_create ( variable-list )
31434 pcreate ( variable-list ) */
31436 static tree
31438 tree list)
31439 {
31442 {
31488 }
31496 }
31498 /* OpenACC 2.0:
31499 deviceptr ( variable-list ) */
31501 static tree
31503 {
31507 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31508 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31509 variable-list must only allow for pointer variables. */
31512 {
31519 }
31522 }
31524 /* OpenACC 2.0:
31525 auto
31526 independent
31527 nohost
31528 seq */
31530 static tree
31534 {
31539 }
31541 /* OpenACC:
31542 num_gangs ( expression )
31543 num_workers ( expression )
31544 vector_length ( expression ) */
31546 static tree
31549 {
31552 matching_parens parens;
31560 {
31565 }
31573 }
31575 /* OpenACC:
31577 gang [( gang-arg-list )]
31578 worker [( [num:] int-expr )]
31579 vector [( [length:] int-expr )]
31581 where gang-arg is one of:
31583 [num:] int-expr
31584 static: size-expr
31586 and size-expr may be:
31588 *
31589 int-expr
31590 */
31592 static tree
31595 {
31605 {
31606 matching_parens parens;
31609 do
31610 {
31614 /* Gang static argument. */
31617 {
31625 {
31628 }
31630 /* Check for the '*' argument. */
31634 CPP_CLOSE_PAREN)))
31635 {
31640 {
31643 }
31645 }
31646 }
31647 /* Worker num: argument and vector length: arguments. */
31651 {
31654 }
31656 /* Now collect the actual argument. */
31658 {
31661 }
31673 {
31676 }
31678 }
31683 }
31697 cleanup_error:
31700 }
31702 /* OpenACC 2.0:
31703 tile ( size-expr-list ) */
31705 static tree
31707 {
31711 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31712 so, but the spec authors never considered such a case and have
31713 differing opinions on what it might mean, including 'not
31714 allowed'.) */
31717 clause_loc);
31722 do
31723 {
31730 {
31733 }
31734 else
31738 }
31741 /* Consume the trailing ')'. */
31749 }
31751 /* OpenACC 2.0
31752 Parse wait clause or directive parameters. */
31754 static tree
31756 {
31766 {
31771 }
31778 {
31782 {
31785 else
31786 {
31793 }
31794 }
31795 }
31798 }
31800 /* OpenACC:
31801 wait ( int-expr-list ) */
31803 static tree
31805 {
31814 }
31816 /* OpenMP 3.0:
31817 collapse ( constant-expression ) */
31819 static tree
31821 {
31823 location_t loc;
31824 HOST_WIDE_INT n;
31827 matching_parens parens;
31845 {
31848 }
31857 }
31859 /* OpenMP 2.5:
31860 default ( none | shared )
31862 OpenACC:
31863 default ( none | present ) */
31865 static tree
31868 {
31870 tree c;
31872 matching_parens parens;
31876 {
31881 {
31902 }
31905 }
31906 else
31907 {
31908 invalid_kind:
31911 else
31913 }
31930 }
31932 /* OpenMP 3.1:
31933 final ( expression ) */
31935 static tree
31937 {
31940 matching_parens parens;
31959 }
31961 /* OpenMP 2.5:
31962 if ( expression )
31964 OpenMP 4.5:
31965 if ( directive-name-modifier : expression )
31967 directive-name-modifier:
31968 parallel | task | taskloop | target data | target | target update
31969 | target enter data | target exit data */
31971 static tree
31974 {
31978 matching_parens parens;
31983 {
31995 {
31998 {
32011 else
32012 {
32013 location_t loc
32018 }
32021 {
32023 {
32028 }
32030 {
32031 location_t loc
32035 }
32036 }
32037 }
32038 }
32040 {
32042 {
32045 }
32046 else
32047 {
32049 {
32050 location_t loc
32053 }
32055 }
32056 }
32057 }
32069 {
32072 {
32075 {
32085 }
32087 p);
32089 }
32091 {
32094 else
32097 }
32100 {
32104 }
32105 }
32113 }
32115 /* OpenMP 3.1:
32116 mergeable */
32118 static tree
32121 {
32122 tree c;
32125 location);
32130 }
32132 /* OpenMP 2.5:
32133 nowait */
32135 static tree
32138 {
32139 tree c;
32146 }
32148 /* OpenMP 2.5:
32149 num_threads ( expression ) */
32151 static tree
32153 location_t location)
32154 {
32157 matching_parens parens;
32177 }
32179 /* OpenMP 4.5:
32180 num_tasks ( expression ) */
32182 static tree
32184 location_t location)
32185 {
32188 matching_parens parens;
32208 }
32210 /* OpenMP 4.5:
32211 grainsize ( expression ) */
32213 static tree
32215 location_t location)
32216 {
32219 matching_parens parens;
32239 }
32241 /* OpenMP 4.5:
32242 priority ( expression ) */
32244 static tree
32246 location_t location)
32247 {
32250 matching_parens parens;
32270 }
32272 /* OpenMP 4.5:
32273 hint ( expression ) */
32275 static tree
32277 location_t location)
32278 {
32281 matching_parens parens;
32300 }
32302 /* OpenMP 4.5:
32303 defaultmap ( tofrom : scalar ) */
32305 static tree
32307 location_t location)
32308 {
32312 matching_parens parens;
32317 {
32320 }
32324 {
32327 }
32333 {
32336 }
32340 {
32343 }
32349 location);
32355 out_err:
32360 }
32362 /* OpenMP 2.5:
32363 ordered
32365 OpenMP 4.5:
32366 ordered ( constant-expression ) */
32368 static tree
32371 {
32373 HOST_WIDE_INT n;
32379 {
32380 matching_parens parens;
32397 {
32399 "ordered argument needs positive constant integer "
32402 }
32403 }
32409 }
32411 /* OpenMP 2.5:
32412 reduction ( reduction-operator : variable-list )
32414 reduction-operator:
32415 One of: + * - & ^ | && ||
32417 OpenMP 3.1:
32419 reduction-operator:
32420 One of: + * - & ^ | && || min max
32422 OpenMP 4.0:
32424 reduction-operator:
32425 One of: + * - & ^ | && ||
32426 id-expression */
32428 static tree
32430 {
32438 {
32448 }
32452 else
32453 {
32464 {
32494 }
32495 else
32496 {
32498 resync_fail:
32503 }
32504 }
32510 NULL);
32512 {
32515 }
32518 }
32520 /* OpenMP 2.5:
32521 schedule ( schedule-kind )
32522 schedule ( schedule-kind , expression )
32524 schedule-kind:
32525 static | dynamic | guided | runtime | auto
32527 OpenMP 4.5:
32528 schedule ( schedule-modifier : schedule-kind )
32529 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32531 schedule-modifier:
32532 simd
32533 monotonic
32534 nonmonotonic */
32536 static tree
32538 {
32542 matching_parens parens;
32549 {
32558 else
32564 else
32565 {
32568 }
32569 }
32572 {
32577 {
32598 }
32599 }
32604 else
32610 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32612 {
32616 }
32619 {
32634 else
32639 }
32651 invalid_kind:
32653 resync_fail:
32658 }
32660 /* OpenMP 3.0:
32661 untied */
32663 static tree
32666 {
32667 tree c;
32674 }
32676 /* OpenMP 4.0:
32677 inbranch
32678 notinbranch */
32680 static tree
32683 {
32688 }
32690 /* OpenMP 4.0:
32691 parallel
32692 for
32693 sections
32694 taskgroup */
32696 static tree
32700 {
32704 }
32706 /* OpenMP 4.5:
32707 nogroup */
32709 static tree
32712 {
32717 }
32719 /* OpenMP 4.5:
32720 simd
32721 threads */
32723 static tree
32727 {
32732 }
32734 /* OpenMP 4.0:
32735 num_teams ( expression ) */
32737 static tree
32739 location_t location)
32740 {
32743 matching_parens parens;
32763 }
32765 /* OpenMP 4.0:
32766 thread_limit ( expression ) */
32768 static tree
32770 location_t location)
32771 {
32774 matching_parens parens;
32794 }
32796 /* OpenMP 4.0:
32797 aligned ( variable-list )
32798 aligned ( variable-list : constant-expression ) */
32800 static tree
32802 {
32806 matching_parens parens;
32814 {
32824 }
32830 }
32832 /* OpenMP 4.0:
32833 linear ( variable-list )
32834 linear ( variable-list : expression )
32836 OpenMP 4.5:
32837 linear ( modifier ( variable-list ) )
32838 linear ( modifier ( variable-list ) : expression ) */
32840 static tree
32843 {
32848 matching_parens parens;
32854 {
32866 else
32868 }
32873 else
32874 {
32883 }
32886 {
32891 {
32902 {
32905 }
32908 }
32913 {
32916 }
32924 }
32927 {
32930 }
32933 }
32935 /* OpenMP 4.0:
32936 safelen ( constant-expression ) */
32938 static tree
32940 location_t location)
32941 {
32944 matching_parens parens;
32963 }
32965 /* OpenMP 4.0:
32966 simdlen ( constant-expression ) */
32968 static tree
32970 location_t location)
32971 {
32974 matching_parens parens;
32993 }
32995 /* OpenMP 4.5:
32996 vec:
32997 identifier [+/- integer]
32998 vec , identifier [+/- integer]
32999 */
33001 static tree
33003 tree list)
33004 {
33008 {
33011 }
33014 {
33021 else
33022 {
33023 t = cp_parser_lookup_name_simple
33028 id_loc);
33029 }
33035 {
33038 }
33042 {
33045 }
33049 {
33052 }
33055 add_to_vector:
33057 {
33061 }
33067 }
33070 {
33076 }
33078 }
33080 /* OpenMP 4.0:
33081 depend ( depend-kind : variable-list )
33083 depend-kind:
33084 in | out | inout
33086 OpenMP 4.5:
33087 depend ( source )
33089 depend ( sink : vec ) */
33091 static tree
33093 {
33097 matching_parens parens;
33102 {
33116 else
33118 }
33119 else
33125 {
33135 }
33142 else
33143 {
33149 }
33152 invalid_kind:
33154 resync_fail:
33159 }
33161 /* OpenMP 4.0:
33162 map ( map-kind : variable-list )
33163 map ( variable-list )
33165 map-kind:
33166 alloc | to | from | tofrom
33168 OpenMP 4.5:
33169 map-kind:
33170 alloc | to | from | tofrom | release | delete
33172 map ( always [,] map-kind: variable-list ) */
33174 static tree
33176 {
33185 {
33190 {
33193 nth++;
33199 {
33204 }
33205 }
33206 }
33210 {
33224 else
33225 {
33231 }
33234 }
33237 {
33241 }
33244 NULL);
33250 }
33252 /* OpenMP 4.0:
33253 device ( expression ) */
33255 static tree
33257 location_t location)
33258 {
33261 matching_parens parens;
33281 }
33283 /* OpenMP 4.0:
33284 dist_schedule ( static )
33285 dist_schedule ( static , expression ) */
33287 static tree
33289 location_t location)
33290 {
33293 matching_parens parens;
33304 {
33315 }
33320 location);
33324 invalid_kind:
33326 resync_fail:
33331 }
33333 /* OpenMP 4.0:
33334 proc_bind ( proc-bind-kind )
33336 proc-bind-kind:
33337 master | close | spread */
33339 static tree
33341 location_t location)
33342 {
33343 tree c;
33350 {
33360 else
33362 }
33363 else
33372 location);
33377 invalid_kind:
33379 resync_fail:
33384 }
33386 /* OpenACC:
33387 async [( int-expr )] */
33389 static tree
33391 {
33398 {
33399 matching_parens parens;
33408 }
33418 }
33420 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33421 is a bitmask in MASK. Return the list of clauses found. */
33423 static tree
33427 {
33432 {
33433 location_t here;
33434 pragma_omp_clause c_kind;
33435 omp_clause_code code;
33446 {
33498 clauses);
33516 OMP_CLAUSE_INDEPENDENT,
33528 clauses);
33534 clauses);
33558 clauses);
33580 clauses);
33592 clauses);
33606 }
33611 {
33612 /* Remove the invalid clause(s) from the list to avoid
33613 confusing the rest of the compiler. */
33616 }
33617 }
33619 saw_error:
33626 }
33628 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33629 is a bitmask in MASK. Return the list of clauses found; the result
33630 of clause default goes in *pdefault. */
33632 static tree
33636 {
33642 {
33643 pragma_omp_clause c_kind;
33654 {
33666 clauses);
33680 clauses);
33700 clauses);
33705 clauses);
33715 clauses);
33749 clauses);
33763 clauses);
33780 OMP_CLAUSE_NOTINBRANCH,
33789 {
33790 clause_not_first:
33794 }
33824 clauses);
33825 else
33835 clauses);
33853 {
33861 }
33904 clauses
33910 clauses
33922 }
33927 {
33928 /* Remove the invalid clause(s) from the list to avoid
33929 confusing the rest of the compiler. */
33932 }
33933 }
33934 saw_error:
33935 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33936 no reason to skip to the end. */
33940 {
33943 else
33945 }
33947 }
33949 /* OpenMP 2.5:
33950 structured-block:
33951 statement
33953 In practice, we're also interested in adding the statement to an
33954 outer node. So it is convenient if we work around the fact that
33955 cp_parser_statement calls add_stmt. */
33957 static unsigned
33959 {
33962 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33963 This preserves the "not within loop or switch" style error messages
33964 for nonsense cases like
33965 void foo() {
33966 #pragma omp single
33967 break;
33968 }
33969 */
33974 }
33976 static void
33978 {
33980 }
33982 static tree
33984 {
33992 }
33994 /* OpenMP 2.5:
33995 # pragma omp atomic new-line
33996 expression-stmt
33998 expression-stmt:
33999 x binop= expr | x++ | ++x | x-- | --x
34000 binop:
34001 +, *, -, /, &, ^, |, <<, >>
34003 where x is an lvalue expression with scalar type.
34005 OpenMP 3.1:
34006 # pragma omp atomic new-line
34007 update-stmt
34009 # pragma omp atomic read new-line
34010 read-stmt
34012 # pragma omp atomic write new-line
34013 write-stmt
34015 # pragma omp atomic update new-line
34016 update-stmt
34018 # pragma omp atomic capture new-line
34019 capture-stmt
34021 # pragma omp atomic capture new-line
34022 capture-block
34024 read-stmt:
34025 v = x
34026 write-stmt:
34027 x = expr
34028 update-stmt:
34029 expression-stmt | x = x binop expr
34030 capture-stmt:
34031 v = expression-stmt
34032 capture-block:
34033 { v = x; update-stmt; } | { update-stmt; v = x; }
34035 OpenMP 4.0:
34036 update-stmt:
34037 expression-stmt | x = x binop expr | x = expr binop x
34038 capture-stmt:
34039 v = update-stmt
34040 capture-block:
34041 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34043 where x and v are lvalue expressions with scalar type. */
34045 static void
34047 {
34055 {
34060 {
34066 }
34067 }
34069 {
34081 else
34085 }
34087 {
34093 {
34098 {
34101 }
34102 }
34103 }
34107 {
34117 else
34122 {
34123 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34124 opcode. */
34129 }
34133 {
34136 }
34137 else
34138 {
34144 }
34147 }
34149 restart:
34153 {
34160 /* FALLTHROUGH */
34170 /* FALLTHROUGH */
34185 /* Undo effects of boolean_increment for post {in,de}crement. */
34187 /* FALLTHRU */
34191 {
34192 /* Undo effects of boolean_increment. */
34194 {
34195 /* This is pre or post increment. */
34200 && !structured_block
34204 }
34205 }
34206 /* FALLTHRU */
34209 {
34244 {
34248 }
34251 {
34257 {
34262 }
34264 {
34276 {
34278 {
34283 }
34284 else
34286 }
34290 }
34293 {
34300 }
34304 }
34308 {
34311 {
34319 }
34321 {
34326 }
34361 }
34372 /* FALLTHROUGH */
34377 }
34384 }
34385 stmt_done:
34387 {
34398 }
34400 {
34403 }
34404 done:
34410 saw_error:
34413 {
34417 {
34421 }
34422 }
34423 }
34426 /* OpenMP 2.5:
34427 # pragma omp barrier new-line */
34429 static void
34431 {
34434 }
34436 /* OpenMP 2.5:
34437 # pragma omp critical [(name)] new-line
34438 structured-block
34440 OpenMP 4.5:
34441 # pragma omp critical [(name) [hint(expression)]] new-line
34442 structured-block */
34444 #define OMP_CRITICAL_CLAUSE_MASK \
34445 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34447 static tree
34449 {
34453 {
34454 matching_parens parens;
34468 OMP_CRITICAL_CLAUSE_MASK,
34470 }
34471 else
34476 }
34478 /* OpenMP 2.5:
34479 # pragma omp flush flush-vars[opt] new-line
34481 flush-vars:
34482 ( variable-list ) */
34484 static void
34486 {
34492 }
34494 /* Helper function, to parse omp for increment expression. */
34496 static tree
34498 {
34503 {
34506 }
34509 {
34518 /* Fall through: OpenMP disallows NE_EXPR. */
34522 }
34524 /* If decl is an iterator, preserve LHS and RHS of the relational
34525 expr until finish_omp_for. */
34536 }
34538 /* Helper function, to parse omp for increment expression. */
34540 static tree
34542 {
34546 cp_id_kind idk;
34550 {
34559 }
34568 {
34573 }
34580 {
34584 }
34597 do
34598 {
34605 {
34607 {
34610 else
34612 tf_warning_or_error);
34613 }
34614 else
34617 }
34618 }
34622 {
34628 }
34629 else
34633 }
34635 /* Parse the initialization statement of either an OpenMP for loop or
34636 a Cilk Plus for loop.
34638 Return true if the resulting construct should have an
34639 OMP_CLAUSE_PRIVATE added to it. */
34641 static tree
34650 {
34656 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34658 init-expr:
34659 var = lb
34660 integer-type var = lb
34661 random-access-iterator-type var = lb
34662 pointer-type var = lb
34663 */
34664 cp_decl_specifier_seq type_specifiers;
34666 /* First, try to parse as an initialized declaration. See
34667 cp_parser_condition, from whence the bulk of this is copied. */
34674 {
34675 /* If parsing a type specifier seq succeeded, then this
34676 MUST be a initialized declaration. */
34681 CP_PARSER_DECLARATOR_NAMED,
34692 else
34693 {
34703 {
34705 CPP_OPEN_PAREN))
34706 {
34710 else
34713 }
34714 else
34715 /* Trigger an error. */
34720 }
34724 {
34732 {
34735 auto_node);
34740 }
34743 asm_specification,
34744 LOOKUP_ONLYCONVERTING);
34747 {
34750 }
34751 else
34752 {
34755 {
34757 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34759 {
34763 {
34767 }
34769 }
34771 {
34776 }
34777 }
34778 }
34780 }
34781 else
34782 {
34783 /* Consume '='. */
34787 non_class:
34790 else
34793 asm_specification,
34794 LOOKUP_ONLYCONVERTING);
34795 }
34799 }
34800 }
34801 else
34802 {
34803 cp_id_kind idk;
34804 /* If parsing a type specifier sequence failed, then
34805 this MUST be a simple expression. */
34814 && decl
34817 {
34828 {
34833 }
34838 }
34840 && decl
34843 {
34844 tree rhs;
34852 rhs,
34853 tf_warning_or_error));
34856 }
34857 else
34858 {
34863 {
34867 }
34868 }
34869 }
34871 }
34873 /* Parse the restricted form of the for statement allowed by OpenMP. */
34875 static tree
34878 {
34882 location_t loc_first;
34893 {
34896 }
34899 {
34902 }
34905 {
34911 }
34913 {
34916 {
34918 "%<linear%> clause may not be specified together "
34921 }
34922 else
34924 }
34937 {
34940 location_t loc;
34944 {
34948 }
34951 {
34955 }
34958 matching_parens parens;
34965 add_private_clause
34972 {
34975 {
34981 }
34982 else
34984 }
34991 {
34996 {
35000 }
35003 {
35004 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35008 {
35011 }
35012 else
35013 {
35016 }
35018 }
35019 else
35020 {
35025 }
35026 }
35029 {
35030 tree c;
35032 {
35041 decl);
35045 decl);
35046 }
35048 {
35053 else
35058 {
35061 /* For linear, signal that we need to fill up
35062 the so far unknown linear step. */
35065 }
35066 }
35067 }
35076 {
35077 /* If decl is an iterator, preserve the operator on decl
35078 until finish_omp_for. */
35080 && ((processing_template_decl
35085 else
35089 }
35101 {
35104 }
35109 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35110 in between the collapsed for loops to be still considered perfectly
35111 nested. Hopefully the final version clarifies this.
35112 For now handle (multiple) {'s and empty statements. */
35115 {
35119 {
35121 bracecount++;
35122 }
35126 else
35127 {
35134 }
35135 }
35138 {
35141 }
35142 }
35147 /* Note that we saved the original contents of this flag when we entered
35148 the structured block, and so we don't need to re-save it here. */
35151 else
35154 /* Note that the grammar doesn't call for a structured block here,
35155 though the loop as a whole is a structured block. */
35162 else
35167 {
35169 {
35171 nbraces--;
35172 }
35175 else
35176 {
35178 {
35181 }
35186 }
35187 }
35190 {
35194 else
35196 }
35200 }
35202 /* Helper function for OpenMP parsing, split clauses and call
35203 finish_omp_clauses on each of the set of clauses afterwards. */
35205 static void
35208 {
35214 }
35216 /* OpenMP 4.0:
35217 #pragma omp simd simd-clause[optseq] new-line
35218 for-loop */
35220 #define OMP_SIMD_CLAUSE_MASK \
35221 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35226 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35230 static tree
35234 {
35245 {
35249 OMP_CLAUSE_ORDERED);
35251 {
35253 "%<ordered%> clause with parameter may not be specified "
35256 }
35257 }
35268 }
35270 /* OpenMP 2.5:
35271 #pragma omp for for-clause[optseq] new-line
35272 for-loop
35274 OpenMP 4.0:
35275 #pragma omp for simd for-simd-clause[optseq] new-line
35276 for-loop */
35278 #define OMP_FOR_CLAUSE_MASK \
35279 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35289 static tree
35293 {
35300 /* parallel for{, simd} disallows nowait clause, but for
35301 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35304 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35309 {
35314 {
35338 }
35339 }
35341 {
35344 }
35346 /* Composite distribute parallel for disallows linear clause. */
35353 {
35356 }
35367 }
35369 /* OpenMP 2.5:
35370 # pragma omp master new-line
35371 structured-block */
35373 static tree
35375 {
35379 }
35381 /* OpenMP 2.5:
35382 # pragma omp ordered new-line
35383 structured-block
35385 OpenMP 4.5:
35386 # pragma omp ordered ordered-clauses new-line
35387 structured-block */
35389 #define OMP_ORDERED_CLAUSE_MASK \
35390 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35393 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35394 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35396 static bool
35399 {
35403 {
35408 {
35410 {
35412 "%<depend%> clause may only be used in compound "
35416 }
35417 tree clauses
35419 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35423 }
35424 }
35426 tree clauses
35432 }
35434 /* OpenMP 2.5:
35436 section-scope:
35437 { section-sequence }
35439 section-sequence:
35440 section-directive[opt] structured-block
35441 section-sequence section-directive structured-block */
35443 static tree
35445 {
35450 matching_braces braces;
35458 {
35462 }
35465 {
35473 {
35477 }
35479 {
35482 }
35487 }
35498 }
35500 /* OpenMP 2.5:
35501 # pragma omp sections sections-clause[optseq] newline
35502 sections-scope */
35504 #define OMP_SECTIONS_CLAUSE_MASK \
35505 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35507 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35508 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35511 static tree
35514 {
35526 {
35529 }
35536 }
35538 /* OpenMP 2.5:
35539 # pragma omp parallel parallel-clause[optseq] new-line
35540 structured-block
35541 # pragma omp parallel for parallel-for-clause[optseq] new-line
35542 structured-block
35543 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35544 structured-block
35546 OpenMP 4.0:
35547 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35548 structured-block */
35550 #define OMP_PARALLEL_CLAUSE_MASK \
35551 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35557 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35561 static tree
35565 {
35572 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35578 {
35586 if_p);
35590 if_p);
35593 block);
35598 }
35599 /* When combined with distribute, parallel has to be followed by for.
35600 #pragma omp target parallel is allowed though. */
35604 {
35608 }
35610 {
35613 }
35615 {
35619 {
35629 block);
35632 }
35633 }
35638 {
35641 }
35649 }
35651 /* OpenMP 2.5:
35652 # pragma omp single single-clause[optseq] new-line
35653 structured-block */
35655 #define OMP_SINGLE_CLAUSE_MASK \
35656 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35661 static tree
35663 {
35673 }
35675 /* OpenMP 3.0:
35676 # pragma omp task task-clause[optseq] new-line
35677 structured-block */
35679 #define OMP_TASK_CLAUSE_MASK \
35680 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35681 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35691 static tree
35693 {
35704 }
35706 /* OpenMP 3.0:
35707 # pragma omp taskwait new-line */
35709 static void
35711 {
35714 }
35716 /* OpenMP 3.1:
35717 # pragma omp taskyield new-line */
35719 static void
35721 {
35724 }
35726 /* OpenMP 4.0:
35727 # pragma omp taskgroup new-line
35728 structured-block */
35730 static tree
35732 {
35736 if_p));
35737 }
35740 /* OpenMP 2.5:
35741 # pragma omp threadprivate (variable-list) */
35743 static void
35745 {
35746 tree vars;
35752 }
35754 /* OpenMP 4.0:
35755 # pragma omp cancel cancel-clause[optseq] new-line */
35757 #define OMP_CANCEL_CLAUSE_MASK \
35758 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35764 static void
35766 {
35770 }
35772 /* OpenMP 4.0:
35773 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35775 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35776 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35781 static void
35784 {
35785 tree clauses;
35789 {
35794 {
35797 }
35798 }
35800 {
35804 }
35807 {
35812 else
35816 }
35819 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35821 pragma_tok);
35823 }
35825 /* OpenMP 4.0:
35826 #pragma omp distribute distribute-clause[optseq] new-line
35827 for-loop */
35829 #define OMP_DISTRIBUTE_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_LASTPRIVATE) \
35833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35836 static tree
35840 {
35849 {
35857 else
35860 {
35866 {
35870 else
35873 }
35879 else
35893 }
35894 }
35896 {
35899 }
35904 {
35907 }
35918 }
35920 /* OpenMP 4.0:
35921 # pragma omp teams teams-clause[optseq] new-line
35922 structured-block */
35924 #define OMP_TEAMS_CLAUSE_MASK \
35925 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35928 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35929 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35930 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35931 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35933 static tree
35937 {
35946 {
35950 {
35975 }
35976 }
35978 {
35981 }
35986 {
35989 }
35998 }
36000 /* OpenMP 4.0:
36001 # pragma omp target data target-data-clause[optseq] new-line
36002 structured-block */
36004 #define OMP_TARGET_DATA_CLAUSE_MASK \
36005 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36008 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36010 static tree
36012 {
36013 tree clauses
36018 {
36021 {
36038 "%<#pragma omp target data%> with map-type other "
36039 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36043 }
36045 }
36048 {
36051 "%<#pragma omp target data%> must contain at least "
36054 }
36065 }
36067 /* OpenMP 4.5:
36068 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36069 structured-block */
36071 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36072 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36078 static tree
36081 {
36084 {
36089 {
36092 }
36093 }
36095 {
36099 }
36102 {
36108 }
36110 tree clauses
36115 {
36118 {
36131 "%<#pragma omp target enter data%> with map-type other "
36135 }
36137 }
36140 {
36143 "%<#pragma omp target enter data%> must contain at least "
36146 }
36153 }
36155 /* OpenMP 4.5:
36156 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36157 structured-block */
36159 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36160 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36161 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36162 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36166 static tree
36169 {
36172 {
36177 {
36180 }
36181 }
36183 {
36187 }
36190 {
36196 }
36198 tree clauses
36203 {
36206 {
36220 "%<#pragma omp target exit data%> with map-type other "
36221 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36225 }
36227 }
36230 {
36233 "%<#pragma omp target exit data%> must contain at least "
36236 }
36243 }
36245 /* OpenMP 4.0:
36246 # pragma omp target update target-update-clause[optseq] new-line */
36248 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36249 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36250 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36251 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36252 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36253 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36254 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36256 static bool
36259 {
36261 {
36267 }
36269 tree clauses
36274 {
36276 "%<#pragma omp target update%> must contain at least one "
36279 }
36287 }
36289 /* OpenMP 4.0:
36290 # pragma omp target target-clause[optseq] new-line
36291 structured-block */
36293 #define OMP_TARGET_CLAUSE_MASK \
36294 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36304 static bool
36307 {
36311 {
36323 {
36331 {
36332 tree stmt;
36334 {
36337 OMP_TARGET_CLAUSE_MASK,
36342 OMP_TARGET_CLAUSE_MASK,
36347 OMP_TARGET_CLAUSE_MASK,
36352 }
36354 }
36359 {
36363 if_p);
36368 if_p);
36373 if_p);
36377 }
36383 {
36384 /* For combined target teams, ensure the num_teams and
36385 thread_limit clause expressions are evaluated on the host,
36386 before entering the target construct. */
36387 tree c;
36393 {
36402 OMP_CLAUSE_FIRSTPRIVATE);
36407 }
36408 }
36418 }
36420 {
36423 }
36425 {
36429 }
36431 {
36435 }
36437 {
36441 }
36443 {
36446 }
36447 }
36449 {
36452 }
36467 check_clauses:
36469 {
36472 {
36486 "%<#pragma omp target%> with map-type other "
36487 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36491 }
36493 }
36495 }
36497 /* OpenACC 2.0:
36498 # pragma acc cache (variable-list) new-line
36499 */
36501 static tree
36503 {
36518 }
36520 /* OpenACC 2.0:
36521 # pragma acc data oacc-data-clause[optseq] new-line
36522 structured-block */
36524 #define OACC_DATA_CLAUSE_MASK \
36525 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36537 static tree
36539 {
36552 }
36554 /* OpenACC 2.0:
36555 # pragma acc host_data <clauses> new-line
36556 structured-block */
36558 #define OACC_HOST_DATA_CLAUSE_MASK \
36559 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36561 static tree
36563 {
36576 }
36578 /* OpenACC 2.0:
36579 # pragma acc declare oacc-data-clause[optseq] new-line
36580 */
36582 #define OACC_DECLARE_CLAUSE_MASK \
36583 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36596 static tree
36598 {
36607 {
36611 }
36614 {
36618 {
36622 }
36625 {
36637 {
36639 "%qD must be a global variable in "
36641 decl);
36644 }
36649 {
36653 }
36655 {
36657 "invalid use of %<extern%> variable %qD "
36661 }
36663 {
36665 "invalid use of %<global%> variable %qD "
36669 }
36671 }
36676 {
36681 }
36684 {
36685 tree id;
36689 else
36695 {
36698 {
36701 {
36705 }
36706 }
36707 }
36708 }
36709 }
36722 }
36724 /* OpenACC 2.0:
36725 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36727 or
36729 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36731 LOC is the location of the #pragma token.
36732 */
36734 #define OACC_ENTER_DATA_CLAUSE_MASK \
36735 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36738 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36740 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36741 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36743 #define OACC_EXIT_DATA_CLAUSE_MASK \
36744 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36750 static tree
36753 {
36762 {
36767 }
36774 else
36779 {
36783 }
36791 }
36793 /* OpenACC 2.0:
36794 # pragma acc loop oacc-loop-clause[optseq] new-line
36795 structured-block */
36797 #define OACC_LOOP_CLAUSE_MASK \
36798 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36809 static tree
36812 {
36821 {
36827 }
36836 }
36838 /* OpenACC 2.0:
36839 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36840 structured-block
36842 or
36844 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36845 structured-block
36846 */
36848 #define OACC_KERNELS_CLAUSE_MASK \
36849 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36867 #define OACC_PARALLEL_CLAUSE_MASK \
36868 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36875 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36887 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36889 static tree
36892 {
36893 omp_clause_mask mask;
36896 {
36909 }
36912 {
36916 {
36919 tree clauses;
36921 if_p);
36923 }
36924 }
36933 }
36935 /* OpenACC 2.0:
36936 # pragma acc update oacc-update-clause[optseq] new-line
36937 */
36939 #define OACC_UPDATE_CLAUSE_MASK \
36940 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36942 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36947 static tree
36949 {
36956 {
36958 "%<#pragma acc update%> must contain at least one "
36961 }
36969 }
36971 /* OpenACC 2.0:
36972 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36974 LOC is the location of the #pragma token.
36975 */
36977 #define OACC_WAIT_CLAUSE_MASK \
36978 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36980 static tree
36982 {
36996 }
36998 /* OpenMP 4.0:
36999 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37001 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37002 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37003 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37004 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37009 static void
37012 {
37014 cp_omp_declare_simd_data data;
37016 {
37021 /* It is safe to take the address of a local variable; it will only be
37022 used while this scope is live. */
37024 }
37026 /* Store away all pragma tokens. */
37038 {
37042 {
37055 }
37060 "%<#pragma omp declare simd%> not immediately followed by "
37064 }
37065 }
37067 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
37068 This function is modelled similar to the late parsing of omp declare
37069 simd. */
37071 static tree
37073 {
37080 {
37082 "used in the same function marked as a Cilk Plus SIMD-enabled "
37088 }
37090 {
37094 }
37099 {
37106 NULL);
37120 }
37126 }
37128 /* Finalize #pragma omp declare simd clauses after direct declarator has
37129 been parsed, and put that into "omp declare simd" attribute. */
37131 static tree
37133 {
37139 {
37143 }
37148 {
37166 }
37170 }
37173 /* OpenMP 4.0:
37174 # pragma omp declare target new-line
37175 declarations and definitions
37176 # pragma omp end declare target new-line
37178 OpenMP 4.5:
37179 # pragma omp declare target ( extended-list ) new-line
37181 # pragma omp declare target declare-target-clauses[seq] new-line */
37183 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37184 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37185 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37187 static void
37189 {
37192 clauses
37196 {
37198 clauses);
37201 }
37202 else
37203 {
37207 }
37210 "%<#pragma omp declare target%> with clauses in between "
37211 "%<#pragma omp declare target%> without clauses and "
37214 {
37220 {
37223 }
37224 else
37227 {
37229 "%qD specified both in declare target %<link%> and %<to%>"
37232 }
37234 {
37241 {
37244 {
37248 }
37249 }
37250 }
37251 }
37252 }
37254 static void
37256 {
37259 {
37262 }
37264 {
37268 {
37271 }
37274 else
37275 {
37279 }
37280 }
37281 else
37282 {
37286 }
37290 "%<#pragma omp end declare target%> without corresponding "
37292 else
37294 }
37296 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37297 expression and optional initializer clause of
37298 #pragma omp declare reduction. We store the expression(s) as
37299 either 3, 6 or 7 special statements inside of the artificial function's
37300 body. The first two statements are DECL_EXPRs for the artificial
37301 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37302 expression that uses those variables.
37303 If there was any INITIALIZER clause, this is followed by further statements,
37304 the fourth and fifth statements are DECL_EXPRs for the artificial
37305 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37306 constructor variant (first token after open paren is not omp_priv),
37307 then the sixth statement is a statement with the function call expression
37308 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37309 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37310 to initialize the OMP_PRIV artificial variable and there is seventh
37311 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37313 static bool
37315 {
37327 tree combiner;
37342 {
37345 }
37348 {
37350 matching_parens parens;
37356 {
37359 }
37375 {
37379 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37383 == CPP_CLOSE_PAREN
37386 {
37390 }
37395 }
37396 else
37397 {
37413 {
37418 }
37420 tree arg;
37433 }
37444 }
37448 UNKNOWN_LOCATION);
37451 }
37453 /* OpenMP 4.0
37454 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37455 initializer-clause[opt] new-line
37457 initializer-clause:
37458 initializer (omp_priv initializer)
37459 initializer (function-name (argument-list)) */
37461 static void
37464 {
37474 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37481 {
37513 }
37525 /* Types may not be defined in declare reduction type list. */
37528 parser->type_definition_forbidden_message
37534 saved_colon_doesnt_start_class_def_p
37539 {
37543 ;
37562 else
37567 else
37569 }
37571 /* Restore the saved message. */
37574 parser->colon_doesnt_start_class_def_p
37579 {
37580 fail:
37583 }
37589 {
37590 tree fntype
37593 NULL_TREE);
37613 {
37618 }
37620 {
37622 {
37631 }
37638 }
37639 else
37640 {
37643 }
37646 else
37649 {
37652 }
37654 {
37657 else
37662 }
37667 else
37668 {
37677 }
37684 }
37688 done:
37689 /* Free any declarators allocated. */
37691 }
37693 /* OpenMP 4.0
37694 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37695 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37696 initializer-clause[opt] new-line
37697 #pragma omp declare target new-line */
37699 static void
37702 {
37704 {
37709 {
37712 context);
37714 }
37717 {
37720 context);
37722 }
37724 {
37727 }
37729 {
37733 }
37734 }
37738 }
37740 /* OpenMP 4.5:
37741 #pragma omp taskloop taskloop-clause[optseq] new-line
37742 for-loop
37744 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37745 for-loop */
37747 #define OMP_TASKLOOP_CLAUSE_MASK \
37748 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37763 static tree
37767 {
37776 {
37781 {
37805 }
37806 }
37808 {
37811 }
37816 {
37819 }
37825 if_p);
37831 }
37834 /* OpenACC 2.0:
37835 # pragma acc routine oacc-routine-clause[optseq] new-line
37836 function-definition
37838 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37839 */
37841 #define OACC_ROUTINE_CLAUSE_MASK \
37842 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37848 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37849 component, which must resolve to a declared namespace-scope
37850 function. The clauses are either processed directly (for a named
37851 function), or defered until the immediatley following declaration
37852 is parsed. */
37854 static void
37857 {
37859 /* The checking for "another pragma following this one" in the "no optional
37860 '( name )'" case makes sure that we dont re-enter. */
37863 cp_oacc_routine_data data;
37869 /* It is safe to take the address of a local variable; it will only be
37870 used while this scope is live. */
37873 /* Look for optional '( name )'. */
37875 {
37876 matching_parens parens;
37879 /* We parse the name as an id-expression. If it resolves to
37880 anything other than a non-overloaded function at namespace
37881 scope, it's an error. */
37895 {
37899 }
37901 data.clauses
37909 {
37914 }
37916 /* Perhaps we should use the same rule as declarations in different
37917 namespaces? */
37919 {
37924 }
37927 {
37931 }
37935 }
37937 {
37938 /* Store away all pragma tokens. */
37949 /* Emit a helpful diagnostic if there's another pragma following this
37950 one. */
37952 {
37955 /* ..., and then just keep going. */
37957 }
37959 /* We only have to consider the pragma_external case here. */
37964 else
37967 }
37968 }
37970 /* Finalize #pragma acc routine clauses after direct declarator has
37971 been parsed. */
37973 static tree
37975 {
37980 {
37982 "%<#pragma acc routine%> not immediately followed by "
37985 }
38002 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38003 fndecl_seen. */
38006 }
38008 /* Apply any saved OpenACC routine clauses to a just-parsed
38009 declaration. */
38011 static void
38013 {
38015 {
38016 /* Keep going if we're in error reporting mode. */
38022 {
38024 "%<#pragma acc routine%> not immediately followed by"
38028 }
38030 {
38033 }
38036 {
38041 }
38044 {
38052 }
38054 /* Process the routine's dimension clauses. */
38058 /* Add an "omp declare target" attribute. */
38063 /* Don't unset parser->oacc_routine here: we may still need it to
38064 diagnose wrong usage. But, remember that we've used this "#pragma acc
38065 routine". */
38067 }
38068 }
38070 /* Main entry point to OpenMP statement pragmas. */
38072 static void
38074 {
38075 tree stmt;
38080 {
38103 if_p);
38108 if_p);
38125 if_p);
38130 if_p);
38138 if_p);
38147 if_p);
38161 if_p);
38166 if_p);
38170 }
38173 }
38174 \f
38175 /* Transactional Memory parsing routines. */
38177 /* Parse a transaction attribute.
38179 txn-attribute:
38180 attribute
38181 [ [ identifier ] ]
38183 We use this instead of cp_parser_attributes_opt for transactions to avoid
38184 the pedwarn in C++98 mode. */
38186 static tree
38188 {
38203 {
38207 /* For keywords, use the canonical spelling,
38208 not the parsed identifier. */
38212 }
38213 else
38217 error1:
38220 }
38222 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38224 transaction-statement:
38225 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38226 compound-statement
38227 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38228 */
38230 static tree
38232 {
38243 else
38244 {
38248 }
38250 /* Parse a noexcept specification. */
38254 {
38255 /* cancel-and-throw is unimplemented. */
38258 }
38259 else
38262 /* Keep track if we're in the lexical scope of an outer transaction. */
38274 }
38276 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38278 transaction-expression:
38279 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38280 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38281 */
38283 static tree
38285 {
38298 keyword == RID_TRANSACTION_RELAXED
38312 /* Set this early. This might mean that we allow transaction_cancel in
38313 an expression that we find out later actually has to be a constexpr.
38314 However, we expect that cxx_constant_value will be able to deal with
38315 this; also, if the noexcept has no constexpr, then what we parse next
38316 really is a transaction's body. */
38319 /* Parse a noexcept specification. */
38325 {
38326 matching_parens parens;
38333 }
38334 else
38335 {
38336 /* The only expression that is available got parsed for the noexcept
38337 already. noexcept is true then. */
38340 }
38349 }
38351 /* Parse a function-transaction-block.
38353 function-transaction-block:
38354 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38355 function-body
38356 __transaction_atomic txn-attribute[opt] function-try-block
38357 __transaction_relaxed ctor-initializer[opt] function-body
38358 __transaction_relaxed function-try-block
38359 */
38361 static bool
38363 {
38379 else
38380 {
38384 }
38392 else
38393 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
38401 }
38403 /* Parse a __transaction_cancel statement.
38405 cancel-statement:
38406 __transaction_cancel txn-attribute[opt] ;
38407 __transaction_cancel txn-attribute[opt] throw-expression ;
38409 ??? Cancel and throw is not yet implemented. */
38411 static tree
38413 {
38419 RT_TRANSACTION_CANCEL);
38426 /* ??? Parse cancel-and-throw here. */
38431 {
38435 }
38437 {
38441 }
38443 {
38446 {
38452 }
38453 }
38455 {
38459 }
38465 }
38466 \f
38467 /* The parser. */
38471 \f
38472 /* Special handling for the first token or line in the file. The first
38473 thing in the file might be #pragma GCC pch_preprocess, which loads a
38474 PCH file, which is a GC collection point. So we need to handle this
38475 first pragma without benefit of an existing lexer structure.
38477 Always returns one token to the caller in *FIRST_TOKEN. This is
38478 either the true first token of the file, or the first token after
38479 the initial pragma. */
38481 static void
38483 {
38492 {
38499 }
38500 else
38503 /* Skip to the end of the pragma. */
38507 /* Now actually load the PCH file. */
38511 /* Read one more token to return to our caller. We have to do this
38512 after reading the PCH file in, since its pointers have to be
38513 live. */
38515 }
38517 /* Parses the grainsize pragma for the _Cilk_for statement.
38518 Syntax:
38519 #pragma cilk grainsize = <VALUE>. */
38521 static void
38523 {
38525 {
38530 {
38533 }
38535 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38538 else
38540 "%<#pragma cilk grainsize%> is not followed by "
38543 }
38545 }
38547 /* Normal parsing of a pragma token. Here we can (and must) use the
38548 regular lexer. */
38550 static bool
38552 {
38555 tree stmt;
38566 {
38574 {
38584 }
38589 {
38599 }
38604 {
38615 }
38620 {
38631 }
38636 {
38647 }
38668 {
38673 }
38681 {
38686 }
38694 {
38698 }
38704 {
38709 }
38717 {
38722 }
38777 "%<#pragma omp section%> may only be used in "
38782 {
38784 {
38788 }
38795 {
38798 }
38801 }
38805 {
38809 }
38817 {
38821 }
38823 /* Ignore the pragma if Cilk Plus is not enabled. */
38825 {
38828 }
38829 else
38830 {
38834 }
38841 bad_stmt:
38844 }
38848 }
38850 /* The interface the pragma parsers have to the lexer. */
38852 enum cpp_ttype
38854 {
38866 else
38867 {
38871 }
38874 }
38876 \f
38877 /* External interface. */
38879 /* Parse one entire translation unit. */
38881 void
38883 {
38896 }
38898 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38899 vectorlength clause:
38900 Syntax:
38901 vectorlength ( constant-expression ) */
38903 static tree
38906 {
38908 tree expr;
38909 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38910 safelen clause. Thus, vectorlength is represented as OMP 4.0
38911 safelen. For SIMD-enabled function it is represented by OMP 4.0
38912 simdlen. */
38915 loc);
38916 else
38918 loc);
38920 matching_parens parens;
38927 /* If expr == error_mark_node, then don't emit any errors nor
38928 create a clause. if any of the above functions returns
38929 error mark node then they would have emitted an error message. */
38931 ;
38939 else
38940 {
38941 tree c;
38943 {
38948 }
38949 else
38950 {
38955 }
38956 }
38961 }
38963 /* Handles the Cilk Plus #pragma simd linear clause.
38964 Syntax:
38965 linear ( simd-linear-variable-list )
38967 simd-linear-variable-list:
38968 simd-linear-variable
38969 simd-linear-variable-list , simd-linear-variable
38971 simd-linear-variable:
38972 id-expression
38973 id-expression : simd-linear-step
38975 simd-linear-step:
38976 conditional-expression */
38978 static tree
38980 {
38986 {
38990 }
38995 {
38998 {
39002 }
39009 {
39013 }
39014 else
39015 {
39019 /* If present, parse the linear step. Otherwise, assume the default
39020 value of 1. */
39022 {
39029 {
39030 /* If an error has occurred, then the whole pragma is
39031 considered ill-formed. Thus, no reason to keep
39032 parsing. */
39035 }
39043 else
39045 "step size must be an integer constant "
39047 }
39049 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
39055 }
39060 else
39061 {
39066 }
39067 }
39071 }
39073 /* Returns the name of the next clause. If the clause is not
39074 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
39075 token is not consumed. Otherwise, the appropriate enum from the
39076 pragma_simd_clause is returned and the token is consumed. */
39078 static pragma_omp_clause
39080 {
39081 pragma_omp_clause clause_type;
39098 else
39103 }
39105 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
39107 static tree
39109 {
39114 {
39115 pragma_omp_clause c_kind;
39122 /* Use the OpenMP 4.0 equivalent function. */
39125 /* Use the OpenMP 4.0 equivalent function. */
39127 clauses);
39129 /* Use the OMP 4.0 equivalent function. */
39131 clauses);
39133 /* Use the OMP 4.0 equivalent function. */
39135 else
39136 {
39140 }
39141 }
39147 else
39149 }
39151 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
39153 static void
39155 {
39162 {
39166 }
39175 }
39177 /* Main entry-point for parsing Cilk Plus _Cilk_for
39178 loops. The return value is error_mark_node
39179 when errors happen and CILK_FOR tree on success. */
39181 static tree
39183 {
39198 else
39204 }
39206 /* Create an identifier for a generic parameter type (a synthesized
39207 template parameter implied by `auto' or a concept identifier). */
39210 static tree
39212 {
39216 }
39218 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39219 (creating a new template parameter list if necessary). Returns the newly
39220 created template type parm. */
39222 static tree
39224 {
39227 /* Before committing to modifying any scope, if we're in an
39228 implicit template scope, and we're trying to synthesize a
39229 constrained parameter, try to find a previous parameter with
39230 the same name. This is the same-type rule for abbreviated
39231 function templates.
39233 NOTE: We can generate implicit parameters when tentatively
39234 parsing a nested name specifier, only to reject that parse
39235 later. However, matching the same template-id as part of a
39236 direct-declarator should generate an identical template
39237 parameter, so this rule will merge them. */
39239 {
39242 {
39244 {
39247 /* Return the TEMPLATE_PARM_INDEX. */
39250 }
39252 }
39253 }
39255 /* We are either continuing a function template that already contains implicit
39256 template parameters, creating a new fully-implicit function template, or
39257 extending an existing explicit function template with implicit template
39258 parameters. */
39266 {
39270 }
39271 else
39272 {
39273 /* Roll back to the existing template parameter scope (in the case of
39274 extending an explicit function template) or introduce a new template
39275 parameter scope ahead of the function parameter scope (or class scope
39276 in the case of out-of-line member definitions). The function scope is
39277 added back after template parameter synthesis below. */
39282 {
39285 }
39287 {
39288 /* If not defining a class, then any class scope is a scope level in
39289 an out-of-line member definition. In this case simply wind back
39290 beyond the first such scope to inject the template parameter list.
39291 Otherwise wind back to the class being defined. The latter can
39292 occur in class member friend declarations such as:
39294 class A {
39295 void foo (auto);
39296 };
39297 class B {
39298 friend void A::foo (auto);
39299 };
39301 The template parameter list synthesized for the friend declaration
39302 must be injected in the scope of 'B'. This can also occur in
39303 erroneous cases such as:
39305 struct A {
39306 struct B {
39307 void foo (auto);
39308 };
39309 void B::foo (auto) {}
39310 };
39312 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39313 but, nevertheless, the template parameter list synthesized for the
39314 declarator should be injected into the scope of 'A' as if the
39315 ill-formed template was specified explicitly. */
39318 {
39321 }
39322 }
39328 {
39329 /* Introduce a new template parameter list for implicit template
39330 parameters. */
39334 parser->implicit_template_scope
39341 }
39342 else
39343 {
39344 /* Synthesize implicit template parameters at the end of the explicit
39345 template parameter list. */
39352 parser->implicit_template_parms
39354 }
39355 }
39357 /* Synthesize a new template parameter and track the current template
39358 parameter chain with implicit_template_parms. */
39362 tree synth_tmpl_parm;
39366 synth_tmpl_parm
39369 synth_tmpl_parm
39371 else
39372 {
39376 }
39378 // Attach the constraint to the parm before processing.
39381 tree new_parm
39383 input_location,
39384 node,
39388 // Chain the new parameter to the list of implicit parameters.
39390 parser->implicit_template_parms
39392 else
39397 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39400 /* If creating a fully implicit function template, start the new implicit
39401 template parameter list with this synthesized type, otherwise grow the
39402 current template parameter list. */
39405 {
39412 }
39413 else
39414 {
39419 }
39421 // If the new parameter was constrained, we need to add that to the
39422 // constraints in the template parameter list.
39424 {
39428 }
39433 }
39435 /* Finish the declaration of a fully implicit function template. Such a
39436 template has no explicit template parameter list so has not been through the
39437 normal template head and tail processing. synthesize_implicit_template_parm
39438 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39439 provided if the declaration is a class member such that its template
39440 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39441 form is returned. Otherwise NULL_TREE is returned. */
39443 static tree
39445 {
39450 {
39454 }
39464 }