| blob | dbe0052792454c2e32edddb10d1b8b5d96409388 |
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 }
2808 /* Because c_parser_error does not understand
2809 CPP_KEYWORD, keywords are treated like
2810 identifiers. */
2813 }
2814 }
2816 /* Issue an error about name-lookup failing. NAME is the
2817 IDENTIFIER_NODE DECL is the result of
2818 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2819 the thing that we hoped to find. */
2821 static void
2823 tree name,
2824 tree decl,
2825 name_lookup_error desired,
2826 location_t location)
2827 {
2828 /* If name lookup completely failed, tell the user that NAME was not
2829 declared. */
2831 {
2844 else
2846 }
2848 {
2850 {
2867 }
2868 }
2870 {
2872 {
2882 name);
2886 }
2887 }
2888 else
2889 {
2891 {
2904 }
2905 }
2906 }
2908 /* If we are parsing tentatively, remember that an error has occurred
2909 during this tentative parse. Returns true if the error was
2910 simulated; false if a message should be issued by the caller. */
2912 static bool
2914 {
2916 {
2919 }
2921 }
2923 /* This function is called when a type is defined. If type
2924 definitions are forbidden at this point, an error message is
2925 issued. */
2927 static bool
2929 {
2930 /* If types are forbidden here, issue a message. */
2932 {
2933 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2934 in the message need to be interpreted. */
2937 }
2939 }
2941 /* This function is called when the DECLARATOR is processed. The TYPE
2942 was a type defined in the decl-specifiers. If it is invalid to
2943 define a type in the decl-specifiers for DECLARATOR, an error is
2944 issued. TYPE_LOCATION is the location of TYPE and is used
2945 for error reporting. */
2947 static void
2950 {
2951 /* [dcl.fct] forbids type definitions in return types.
2952 Unfortunately, it's not easy to know whether or not we are
2953 processing a return type until after the fact. */
2961 {
2966 type);
2967 }
2968 }
2970 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2971 "<" in any valid C++ program. If the next token is indeed "<",
2972 issue a message warning the user about what appears to be an
2973 invalid attempt to form a template-id. LOCATION is the location
2974 of the type-specifier (TYPE) */
2976 static void
2978 tree type,
2980 location_t location)
2981 {
2985 {
2991 {
2994 else
2996 }
2997 else
2999 /* Remember the location of the invalid "<". */
3002 /* Consume the "<". */
3004 /* Parse the template arguments. */
3006 /* Permanently remove the invalid template arguments so that
3007 this error message is not issued again. */
3010 }
3011 }
3013 /* If parsing an integral constant-expression, issue an error message
3014 about the fact that THING appeared and return true. Otherwise,
3015 return false. In either case, set
3016 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3018 static bool
3020 non_integral_constant thing)
3021 {
3024 {
3026 {
3029 {
3032 "ISO C++ forbids using a floating-point literal "
3037 "enumeration type cannot appear in a "
3128 }
3132 }
3133 }
3135 }
3137 /* Emit a diagnostic for an invalid type name. This function commits
3138 to the current active tentative parse, if any. (Otherwise, the
3139 problematic construct might be encountered again later, resulting
3140 in duplicate error messages.) LOCATION is the location of ID. */
3142 static void
3144 location_t location)
3145 {
3148 /* Try to lookup the identifier. */
3155 /* If the lookup was ambiguous, an error will already have
3156 been issued. */
3158 /* If the lookup found a template-name, it means that the user forgot
3159 to specify an argument list. Emit a useful error message. */
3161 {
3164 decl);
3169 }
3173 /* Something like 'unsigned A a;' */
3176 {
3177 /* Issue an error message. */
3182 {
3188 }
3189 else
3191 /* If we're in a template class, it's possible that the user was
3192 referring to a type from a base class. For example:
3194 template <typename T> struct A { typedef T X; };
3195 template <typename T> struct B : public A<T> { X x; };
3197 The user should have said "typename A<T>::X". */
3213 {
3214 tree b;
3217 b;
3219 {
3223 {
3224 tree field;
3225 /* Go from a particular instantiation of the
3226 template (which will have an empty TYPE_FIELDs),
3227 to the main version. */
3230 field;
3234 {
3239 }
3242 }
3243 }
3244 }
3245 }
3246 /* Here we diagnose qualified-ids where the scope is actually correct,
3247 but the identifier does not resolve to a valid type name. */
3249 {
3251 {
3260 else
3266 }
3269 {
3270 /* A<T>::A<T>() */
3276 }
3279 {
3282 "need %<typename%> before %<%T::%D::%E%> because "
3286 id,
3289 else
3293 }
3295 {
3307 else
3313 }
3314 else
3316 }
3317 }
3319 /* Check for a common situation where a type-name should be present,
3320 but is not, and issue a sensible error message. Returns true if an
3321 invalid type-name was detected.
3323 The situation handled by this function are variable declarations of the
3324 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3325 Usually, `ID' should name a type, but if we got here it means that it
3326 does not. We try to emit the best possible error message depending on
3327 how exactly the id-expression looks like. */
3329 static bool
3331 {
3332 tree id;
3335 /* Avoid duplicate error about ambiguous lookup. */
3337 {
3341 }
3350 /* If the next token is a (, this is a function with no explicit return
3351 type, i.e. constructor, destructor or conversion op. */
3354 {
3357 }
3361 /* Emit a diagnostic for the invalid type. */
3363 out:
3364 /* If we aren't in the middle of a declarator (i.e. in a
3365 parameter-declaration-clause), skip to the end of the declaration;
3366 there's no point in trying to process it. */
3370 }
3372 /* Consume tokens up to, and including, the next non-nested closing `)'.
3373 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3374 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3375 found an unnested token of that type. */
3377 static int
3380 cpp_ttype or_ttype,
3382 {
3392 {
3395 /* Have we found what we're looking for before the closing paren? */
3401 {
3404 /* If we've run out of tokens, then there is no closing `)'. */
3407 /* This is good for lambda expression capture-lists. */
3417 /* This matches the processing in skip_to_end_of_statement. */
3437 {
3441 }
3446 }
3448 /* Consume the token. */
3450 }
3451 }
3453 /* Consume tokens up to, and including, the next non-nested closing `)'.
3454 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3455 are doing error recovery. Returns -1 if OR_COMMA is true and we
3456 found an unnested token of that type. */
3458 static int
3463 {
3467 }
3469 /* Consume tokens until we reach the end of the current statement.
3470 Normally, that will be just before consuming a `;'. However, if a
3471 non-nested `}' comes first, then we stop before consuming that. */
3473 static void
3475 {
3478 /* Unwind generic function template scope if necessary. */
3483 {
3487 {
3490 /* If we've run out of tokens, stop. */
3494 /* If the next token is a `;', we have reached the end of the
3495 statement. */
3501 /* If this is a non-nested '}', stop before consuming it.
3502 That way, when confronted with something like:
3504 { 3 + }
3506 we stop before consuming the closing '}', even though we
3507 have not yet reached a `;'. */
3511 /* If it is the closing '}' for a block that we have
3512 scanned, stop -- but only after consuming the token.
3513 That way given:
3515 void f g () { ... }
3516 typedef int I;
3518 we will stop after the body of the erroneously declared
3519 function, but before consuming the following `typedef'
3520 declaration. */
3522 {
3525 }
3534 }
3536 /* Consume the token. */
3538 }
3539 }
3541 /* This function is called at the end of a statement or declaration.
3542 If the next token is a semicolon, it is consumed; otherwise, error
3543 recovery is attempted. */
3545 static void
3547 {
3548 /* Look for the trailing `;'. */
3550 {
3551 /* If there is additional (erroneous) input, skip to the end of
3552 the statement. */
3554 /* If the next token is now a `;', consume it. */
3557 }
3558 }
3560 /* Skip tokens until we have consumed an entire block, or until we
3561 have consumed a non-nested `;'. */
3563 static void
3565 {
3568 /* Unwind generic function template scope if necessary. */
3573 {
3577 {
3580 /* If we've run out of tokens, stop. */
3584 /* Stop if this is an unnested ';'. */
3590 /* Stop if this is an unnested '}', or closes the outermost
3591 nesting level. */
3592 nesting_depth--;
3600 /* Nest. */
3601 nesting_depth++;
3606 }
3608 /* Consume the token. */
3610 }
3611 }
3613 /* Skip tokens until a non-nested closing curly brace is the next
3614 token, or there are no more tokens. Return true in the first case,
3615 false otherwise. */
3617 static bool
3619 {
3623 {
3627 {
3630 /* If we've run out of tokens, stop. */
3634 /* If the next token is a non-nested `}', then we have reached
3635 the end of the current block. */
3641 /* If it the next token is a `{', then we are entering a new
3642 block. Consume the entire block. */
3648 }
3650 /* Consume the token. */
3652 }
3653 }
3655 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3656 parameter is the PRAGMA token, allowing us to purge the entire pragma
3657 sequence. */
3659 static void
3661 {
3666 do
3670 /* Ensure that the pragma is not parsed again. */
3672 }
3674 /* Require pragma end of line, resyncing with it as necessary. The
3675 arguments are as for cp_parser_skip_to_pragma_eol. */
3677 static void
3679 {
3683 }
3685 /* This is a simple wrapper around make_typename_type. When the id is
3686 an unresolved identifier node, we can provide a superior diagnostic
3687 using cp_parser_diagnose_invalid_type_name. */
3689 static tree
3691 location_t id_location)
3692 {
3693 tree result;
3695 {
3701 }
3703 }
3705 /* This is a wrapper around the
3706 make_{pointer,ptrmem,reference}_declarator functions that decides
3707 which one to call based on the CODE and CLASS_TYPE arguments. The
3708 CODE argument should be one of the values returned by
3709 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3710 appertain to the pointer or reference. */
3714 cp_cv_quals cv_qualifiers,
3716 tree attributes)
3717 {
3724 else
3734 }
3736 /* Create a new C++ parser. */
3740 {
3745 /* cp_lexer_new_main is called before doing GC allocation because
3746 cp_lexer_new_main might load a PCH file. */
3749 /* Initialize the binops_by_token so that we can get the tree
3750 directly from the token. */
3758 /* For now, we always accept GNU extensions. */
3761 /* The `>' token is a greater-than operator, not the end of a
3762 template-id. */
3767 /* We are not parsing a constant-expression. */
3772 /* Local variable names are not forbidden. */
3775 /* We are not processing an `extern "C"' declaration. */
3778 /* We are not processing a declarator. */
3781 /* We are not processing a template-argument-list. */
3784 /* We are not in an iteration statement. */
3787 /* We are not in a switch statement. */
3790 /* We are not parsing a type-id inside an expression. */
3793 /* Declarations aren't implicitly extern "C". */
3796 /* String literals should be translated to the execution character set. */
3799 /* We are not parsing a function body. */
3802 /* We can correct until told otherwise. */
3805 /* The unparsed function queue is empty. */
3808 /* There are no classes being defined. */
3811 /* No template parameters apply. */
3814 /* Special parsing data structures. */
3819 /* Not declaring an implicit function template. */
3825 /* Allow constrained-type-specifiers. */
3829 }
3831 /* Create a cp_lexer structure which will emit the tokens in CACHE
3832 and push it onto the parser's lexer stack. This is used for delayed
3833 parsing of in-class method bodies and default arguments, and should
3834 not be confused with tentative parsing. */
3835 static void
3837 {
3842 /* Move the current source position to that of the first token in the
3843 new lexer. */
3845 }
3847 /* Pop the top lexer off the parser stack. This is never used for the
3848 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3849 static void
3851 {
3856 /* Put the current source position back where it was before this
3857 lexer was pushed. */
3859 }
3861 /* Lexical conventions [gram.lex] */
3863 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3864 identifier. */
3866 static cp_expr
3868 {
3871 /* Look for the identifier. */
3873 /* Return the value. */
3876 else
3878 }
3880 /* Parse a sequence of adjacent string constants. Returns a
3881 TREE_STRING representing the combined, nul-terminated string
3882 constant. If TRANSLATE is true, translate the string to the
3883 execution character set. If WIDE_OK is true, a wide string is
3884 invalid here.
3886 C++98 [lex.string] says that if a narrow string literal token is
3887 adjacent to a wide string literal token, the behavior is undefined.
3888 However, C99 6.4.5p4 says that this results in a wide string literal.
3889 We follow C99 here, for consistency with the C front end.
3891 This code is largely lifted from lex_string() in c-lex.c.
3893 FUTURE: ObjC++ will need to handle @-strings here. */
3894 static cp_expr
3897 {
3898 tree value;
3905 tree string_tree;
3911 {
3914 }
3919 {
3923 }
3924 else
3925 {
3928 }
3931 /* Try to avoid the overhead of creating and destroying an obstack
3932 for the common case of just one string. */
3935 {
3943 {
3947 }
3948 else
3952 }
3953 else
3954 {
3959 do
3960 {
3962 count++;
3967 {
3970 {
3973 }
3976 {
3981 }
3983 }
3984 else
3988 {
3992 {
3996 "unsupported non-standard concatenation "
3998 }
3999 }
4007 {
4011 }
4012 else
4013 {
4017 }
4018 }
4021 /* A string literal built by concatenation has its caret=start at
4022 the start of the initial string, and its finish at the finish of
4023 the final string literal. */
4027 }
4030 {
4033 }
4037 {
4042 {
4057 }
4062 {
4067 else
4069 }
4070 }
4071 else
4072 /* cpp_interpret_string has issued an error. */
4079 }
4081 /* Look up a literal operator with the name and the exact arguments. */
4083 static tree
4085 {
4086 tree decl;
4092 {
4098 {
4101 {
4111 }
4114 /* May be this should be sufficient_parms_p instead,
4115 depending on how exactly should user-defined literals
4116 work in presence of default arguments on the literal
4117 operator parameters. */
4120 }
4121 }
4124 }
4126 /* Parse a user-defined char constant. Returns a call to a user-defined
4127 literal operator taking the character as an argument. */
4129 static cp_expr
4131 {
4139 /* Build up a call to the user-defined operator */
4140 /* Lookup the name we got back from the id-expression. */
4145 {
4150 }
4154 }
4156 /* A subroutine of cp_parser_userdef_numeric_literal to
4157 create a char... template parameter pack from a string node. */
4159 static tree
4161 {
4162 tree charvec;
4168 /* Fill in CHARVEC with all of the parameters. */
4173 /* Build the argument packs. */
4179 }
4181 /* A subroutine of cp_parser_userdef_numeric_literal to
4182 create a char... template parameter pack from a string node. */
4184 static tree
4186 {
4187 tree charvec;
4198 /* First template parm is character type. */
4201 /* Fill in CHARVEC with all of the parameters. */
4208 /* Build the argument packs. */
4214 }
4216 /* Parse a user-defined numeric constant. returns a call to a user-defined
4217 literal operator. */
4219 static cp_expr
4221 {
4232 /* Look for a literal operator taking the exact type of numeric argument
4233 as the literal value. */
4238 {
4240 tf_warning_or_error);
4243 {
4246 long_long_unsigned_type_node);
4247 }
4248 else
4249 {
4253 long_double_type_node);
4257 }
4261 }
4264 /* If the numeric argument didn't work, look for a raw literal
4265 operator taking a const char* argument consisting of the number
4266 in string format. */
4271 {
4273 tf_warning_or_error);
4276 }
4279 /* If the raw literal didn't work, look for a non-type template
4280 function with parameter pack char.... Call the function with
4281 template parameter characters representing the number. */
4285 {
4289 tf_warning_or_error);
4292 }
4301 }
4303 /* Parse a user-defined string constant. Returns a call to a user-defined
4304 literal operator taking a character pointer and the length of the string
4305 as arguments. */
4307 static tree
4309 {
4318 /* Build up a call to the user-defined operator. */
4319 /* Lookup the name we got back from the id-expression. */
4326 {
4328 tf_warning_or_error);
4331 }
4334 /* Look for a template function with typename parameter CharT
4335 and parameter pack CharT... Call the function with
4336 template parameter characters representing the string. */
4340 {
4344 tf_warning_or_error);
4347 }
4353 }
4356 /* Basic concepts [gram.basic] */
4358 /* Parse a translation-unit.
4360 translation-unit:
4361 declaration-seq [opt]
4363 Returns TRUE if all went well. */
4365 static bool
4367 {
4368 /* The address of the first non-permanent object on the declarator
4369 obstack. */
4374 /* Create the declarator obstack, if necessary. */
4376 {
4378 /* Create the error declarator. */
4380 /* Create the empty parameter list. */
4382 /* Remember where the base of the declarator obstack lies. */
4384 }
4388 /* If there are no tokens left then all went well. */
4390 {
4391 /* Get rid of the token array; we don't need it any more. */
4395 /* This file might have been a context that's implicitly extern
4396 "C". If so, pop the lang context. (Only relevant for PCH.) */
4398 {
4401 }
4403 /* Finish up. */
4407 }
4408 else
4409 {
4412 }
4414 /* Make sure the declarator obstack was fully cleaned up. */
4418 /* All went well. */
4420 }
4422 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4423 decltype context. */
4427 {
4432 }
4434 /* We're about to parse a collection of statements. If we're currently
4435 parsing tentatively, set up a firewall so that any nested
4436 cp_parser_commit_to_tentative_parse won't affect the current context. */
4438 static cp_token_position
4440 {
4447 }
4449 /* We've finished parsing the collection of statements. Wrap up the
4450 firewall and replace the relevant tokens with the parsed form. */
4452 static void
4454 tree expr)
4455 {
4459 /* Finish the firewall level. */
4461 /* And remember the result of the parse for when we try again. */
4467 }
4469 /* Like the above functions, but let the user modify the tokens. Used by
4470 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4471 later parses, so it makes sense to localize the effects of
4472 cp_parser_commit_to_tentative_parse. */
4474 struct tentative_firewall
4475 {
4480 {
4481 /* If we're currently parsing tentatively, start a committed level as a
4482 firewall and then an inner tentative parse. */
4484 {
4488 }
4489 }
4492 {
4494 {
4495 /* Finish the inner tentative parse and the firewall, propagating any
4496 uncommitted error state to the outer tentative parse. */
4502 }
4503 }
4504 };
4506 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4507 enclosing parentheses. */
4509 static cp_expr
4511 {
4514 /* Consume the '('. */
4517 /* Start the statement-expression. */
4519 /* Parse the compound-statement. */
4521 /* Finish up. */
4523 /* Consume the ')'. */
4531 }
4533 /* Expressions [gram.expr] */
4535 /* Parse a fold-operator.
4537 fold-operator:
4538 - * / % ^ & | = < > << >>
4539 = -= *= /= %= ^= &= |= <<= >>=
4540 == != <= >= && || , .* ->*
4542 This returns the tree code corresponding to the matched operator
4543 as an int. When the current token matches a compound assignment
4544 opertor, the resulting tree code is the negative value of the
4545 non-assignment operator. */
4547 static int
4549 {
4551 {
4591 }
4592 }
4594 /* Returns true if CODE indicates a binary expression, which is not allowed in
4595 the LHS of a fold-expression. More codes will need to be added to use this
4596 function in other contexts. */
4598 static bool
4600 {
4602 {
4635 }
4636 }
4638 /* If the next token is a suitable fold operator, consume it and return as
4639 the function above. */
4641 static int
4643 {
4649 }
4651 /* Parse a fold-expression.
4653 fold-expression:
4654 ( ... folding-operator cast-expression)
4655 ( cast-expression folding-operator ... )
4656 ( cast-expression folding operator ... folding-operator cast-expression)
4658 Note that the '(' and ')' are matched in primary expression. */
4660 static cp_expr
4662 {
4663 cp_id_kind pidk;
4665 // Left fold.
4667 {
4671 {
4674 }
4681 }
4686 {
4689 }
4692 {
4695 }
4698 /* The operands of a fold-expression are cast-expressions, so binary or
4699 conditional expressions are not allowed. We check this here to avoid
4700 tentative parsing. */
4710 // Right fold.
4715 {
4718 }
4721 // Binary left or right fold.
4726 }
4728 /* Parse a primary-expression.
4730 primary-expression:
4731 literal
4732 this
4733 ( expression )
4734 id-expression
4735 lambda-expression (C++11)
4737 GNU Extensions:
4739 primary-expression:
4740 ( compound-statement )
4741 __builtin_va_arg ( assignment-expression , type-id )
4742 __builtin_offsetof ( type-id , offsetof-expression )
4744 C++ Extensions:
4745 __has_nothrow_assign ( type-id )
4746 __has_nothrow_constructor ( type-id )
4747 __has_nothrow_copy ( type-id )
4748 __has_trivial_assign ( type-id )
4749 __has_trivial_constructor ( type-id )
4750 __has_trivial_copy ( type-id )
4751 __has_trivial_destructor ( type-id )
4752 __has_virtual_destructor ( type-id )
4753 __is_abstract ( type-id )
4754 __is_base_of ( type-id , type-id )
4755 __is_class ( type-id )
4756 __is_empty ( type-id )
4757 __is_enum ( type-id )
4758 __is_final ( type-id )
4759 __is_literal_type ( type-id )
4760 __is_pod ( type-id )
4761 __is_polymorphic ( type-id )
4762 __is_std_layout ( type-id )
4763 __is_trivial ( type-id )
4764 __is_union ( type-id )
4766 Objective-C++ Extension:
4768 primary-expression:
4769 objc-expression
4771 literal:
4772 __null
4774 ADDRESS_P is true iff this expression was immediately preceded by
4775 "&" and therefore might denote a pointer-to-member. CAST_P is true
4776 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4777 true iff this expression is a template argument.
4779 Returns a representation of the expression. Upon return, *IDK
4780 indicates what kind of id-expression (if any) was present. */
4782 static cp_expr
4789 {
4792 /* Assume the primary expression is not an id-expression. */
4795 /* Peek at the next token. */
4798 {
4799 /* literal:
4800 integer-literal
4801 character-literal
4802 floating-literal
4803 string-literal
4804 boolean-literal
4805 pointer-literal
4806 user-defined-literal */
4818 {
4822 }
4823 /* Floating-point literals are only allowed in an integral
4824 constant expression if they are cast to an integral or
4825 enumeration type. */
4829 {
4830 /* CAST_P will be set even in invalid code like "int(2.7 +
4831 ...)". Therefore, we have to check that the next token
4832 is sure to end the cast. */
4834 {
4839 enumerator-definition. */
4841 /* The curly brace at the end of an enum-specifier. */
4843 /* The end of a statement. */
4845 /* The end of the cast-expression. */
4847 /* The end of an array bound. */
4849 /* The closing ">" in a template-argument-list. */
4852 /* C++0x only: A ">>" treated like two ">" tokens,
4853 in a template-argument-list. */
4858 }
4860 /* If we are within a cast, then the constraint that the
4861 cast is to an integral or enumeration type will be
4862 checked at that point. If we are not within a cast, then
4863 this code is invalid. */
4866 }
4886 /* ??? Should wide strings be allowed when parser->translate_strings_p
4887 is false (i.e. in attributes)? If not, we can kill the third
4888 argument to cp_parser_string_literal. */
4894 /* If we see `( { ' then we are looking at the beginning of
4895 a GNU statement-expression. */
4898 {
4899 /* Statement-expressions are not allowed by the standard. */
4903 /* And they're not allowed outside of a function-body; you
4904 cannot, for example, write:
4906 int i = ({ int j = 3; j + 1; });
4908 at class or namespace scope. */
4911 {
4913 "statement-expressions are not allowed outside "
4919 }
4920 else
4922 }
4923 /* Otherwise it's a normal parenthesized expression. */
4924 {
4925 cp_expr expr;
4930 /* Consume the `('. */
4932 /* Within a parenthesized expression, a `>' token is always
4933 the greater-than operator. */
4934 saved_greater_than_is_operator_p
4939 /* Left fold expression. */
4941 else
4942 /* Parse the parenthesized expression. */
4947 {
4954 }
4955 else
4956 /* Let the front end know that this expression was
4957 enclosed in parentheses. This matters in case, for
4958 example, the expression is of the form `A::B', since
4959 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4960 not. */
4963 /* DR 705: Wrapping an unqualified name in parentheses
4964 suppresses arg-dependent lookup. We want to pass back
4965 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4966 (c++/37862), but none of the others. */
4970 /* The `>' token might be the end of a template-id or
4971 template-parameter-list now. */
4972 parser->greater_than_is_operator_p
4975 /* Consume the `)'. */
4984 }
4987 {
4989 {
4990 /* We might have an Objective-C++ message. */
4993 /* If that works out, we're done ... */
4996 /* ... else, fall though to see if it's a lambda. */
4997 }
4999 /* Don't warn about a failed tentative parse. */
5004 }
5008 /* We have an Objective-C++ string literal. */
5015 {
5016 /* These two are the boolean literals. */
5024 /* The `__null' literal. */
5029 /* The `nullptr' literal. */
5034 /* Recognize the `this' keyword. */
5038 {
5042 }
5043 /* Pointers cannot appear in constant-expressions. */
5048 /* The `operator' keyword can be the beginning of an
5049 id-expression. */
5056 {
5057 non_integral_constant name;
5059 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5060 __func__ are the names of variables -- but they are
5061 treated specially. Therefore, they are handled here,
5062 rather than relying on the generic id-expression logic
5063 below. Grammatically, these names are id-expressions.
5065 Consume the token. */
5069 {
5081 }
5086 /* Look up the name. */
5088 }
5091 {
5092 tree expression;
5093 tree type;
5094 source_location type_location;
5095 location_t start_loc
5097 /* The `__builtin_va_arg' construct is used to handle
5098 `va_arg'. Consume the `__builtin_va_arg' token. */
5100 /* Look for the opening `('. */
5102 /* Now, parse the assignment-expression. */
5104 /* Look for the `,'. */
5107 /* Parse the type-id. */
5108 {
5111 }
5112 /* Look for the closing `)'. */
5113 location_t finish_loc
5116 /* Using `va_arg' in a constant-expression is not
5117 allowed. */
5119 NIC_VA_ARG))
5121 /* Construct a location of the form:
5122 __builtin_va_arg (v, int)
5123 ~~~~~~~~~~~~~~~~~~~~~^~~~
5124 with the caret at the type, ranging from the start of the
5125 "__builtin_va_arg" token to the close paren. */
5126 location_t combined_loc
5129 }
5164 // C++ concepts
5168 /* Objective-C++ expressions. */
5178 {
5183 }
5184 /* FALLTHRU */
5188 }
5190 /* An id-expression can start with either an identifier, a
5191 `::' as the beginning of a qualified-id, or the "operator"
5192 keyword. */
5197 {
5198 id_expression:
5199 cp_expr id_expression;
5200 cp_expr decl;
5206 /* Parse the id-expression. */
5207 id_expression
5224 /* If we have a template-id, then no further lookup is
5225 required. If the template-id was for a template-class, we
5226 will sometimes have a TYPE_DECL at this point. */
5230 /* Look up the name. */
5231 else
5232 {
5233 tree ambiguous_decls;
5235 /* If we already know that this lookup is ambiguous, then
5236 we've already issued an error message; there's no reason
5237 to check again. */
5240 {
5243 }
5246 none_type,
5247 template_p,
5252 /* If the lookup was ambiguous, an error will already have
5253 been issued. */
5257 /* In Objective-C++, we may have an Objective-C 2.0
5258 dot-syntax for classes here. */
5263 {
5264 tree component;
5271 component);
5272 /* Build a location of the form:
5273 expr.component
5274 ~~~~~^~~~~~~~~
5275 with caret at the start of the component name (at
5276 input_location), ranging from the start of the id_expression
5277 to the end of the component name. */
5278 location_t combined_loc
5283 }
5285 /* In Objective-C++, an instance variable (ivar) may be preferred
5286 to whatever cp_parser_lookup_name() found.
5287 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5288 rest of c-family, we have to do a little extra work to preserve
5289 any location information in cp_expr "decl". Given that
5290 objc_lookup_ivar is implemented in "c-family" and "objc", we
5291 have a trip through the pure "tree" type, rather than cp_expr.
5292 Naively copying it back to "decl" would implicitly give the
5293 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5294 store an EXPR_LOCATION. Hence we only update "decl" (and
5295 hence its location_t) if we get back a different tree node. */
5297 id_expression);
5301 /* If name lookup gives us a SCOPE_REF, then the
5302 qualifying scope was dependent. */
5304 {
5305 /* At this point, we do not know if DECL is a valid
5306 integral constant expression. We assume that it is
5307 in fact such an expression, so that code like:
5309 template <int N> struct A {
5310 int a[B<N>::i];
5311 };
5313 is accepted. At template-instantiation time, we
5314 will check that B<N>::i is actually a constant. */
5316 }
5317 /* Check to see if DECL is a local variable in a context
5318 where that is forbidden. */
5321 {
5322 /* It might be that we only found DECL because we are
5323 trying to be generous with pre-ISO scoping rules.
5324 For example, consider:
5326 int i;
5327 void g() {
5328 for (int i = 0; i < 10; ++i) {}
5329 extern void f(int j = i);
5330 }
5332 Here, name look up will originally find the out
5333 of scope `i'. We need to issue a warning message,
5334 but then use the global `i'. */
5337 {
5342 }
5343 }
5344 }
5346 decl = (finish_id_expression
5348 idk,
5353 template_arg_p,
5360 }
5362 /* Anything else is an error. */
5366 }
5367 }
5375 {
5378 }
5380 /* Parse an id-expression.
5382 id-expression:
5383 unqualified-id
5384 qualified-id
5386 qualified-id:
5387 :: [opt] nested-name-specifier template [opt] unqualified-id
5388 :: identifier
5389 :: operator-function-id
5390 :: template-id
5392 Return a representation of the unqualified portion of the
5393 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5394 a `::' or nested-name-specifier.
5396 Often, if the id-expression was a qualified-id, the caller will
5397 want to make a SCOPE_REF to represent the qualified-id. This
5398 function does not do this in order to avoid wastefully creating
5399 SCOPE_REFs when they are not required.
5401 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5402 `template' keyword.
5404 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5405 uninstantiated templates.
5407 If *TEMPLATE_P is non-NULL, it is set to true iff the
5408 `template' keyword is used to explicitly indicate that the entity
5409 named is a template.
5411 If DECLARATOR_P is true, the id-expression is appearing as part of
5412 a declarator, rather than as part of an expression. */
5414 static cp_expr
5421 {
5425 /* Assume the `template' keyword was not used. */
5429 /* Look for the optional `::' operator. */
5430 global_scope_p
5431 = (!template_keyword_p
5436 /* Look for the optional nested-name-specifier. */
5437 nested_name_specifier_p
5440 check_dependency_p,
5442 declarator_p,
5443 template_keyword_p)
5446 /* If there is a nested-name-specifier, then we are looking at
5447 the first qualified-id production. */
5449 {
5450 tree saved_scope;
5451 tree saved_object_scope;
5452 tree saved_qualifying_scope;
5453 cp_expr unqualified_id;
5456 /* See if the next token is the `template' keyword. */
5460 /* Name lookup we do during the processing of the
5461 unqualified-id might obliterate SCOPE. */
5465 /* Process the final unqualified-id. */
5467 check_dependency_p,
5468 declarator_p,
5470 /* Restore the SAVED_SCOPE for our caller. */
5476 }
5477 /* Otherwise, if we are in global scope, then we are looking at one
5478 of the other qualified-id productions. */
5480 {
5482 tree id;
5484 /* Peek at the next token. */
5487 /* If it's an identifier, and the next token is not a "<", then
5488 we can avoid the template-id case. This is an optimization
5489 for this common case. */
5491 && !cp_parser_nth_token_starts_template_argument_list_p
5496 /* Try a template-id. */
5500 none_type,
5501 declarator_p);
5502 /* If that worked, we're done. */
5506 /* Peek at the next token. (Changes in the token buffer may
5507 have invalidated the pointer obtained above.) */
5511 {
5518 /* Fall through. */
5523 }
5524 }
5525 else
5528 declarator_p,
5529 optional_p);
5530 }
5532 /* Parse an unqualified-id.
5534 unqualified-id:
5535 identifier
5536 operator-function-id
5537 conversion-function-id
5538 ~ class-name
5539 template-id
5541 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5542 keyword, in a construct like `A::template ...'.
5544 Returns a representation of unqualified-id. For the `identifier'
5545 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5546 production a BIT_NOT_EXPR is returned; the operand of the
5547 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5548 other productions, see the documentation accompanying the
5549 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5550 names are looked up in uninstantiated templates. If DECLARATOR_P
5551 is true, the unqualified-id is appearing as part of a declarator,
5552 rather than as part of an expression. */
5554 static cp_expr
5560 {
5563 /* Peek at the next token. */
5567 {
5569 {
5570 tree id;
5572 /* We don't know yet whether or not this will be a
5573 template-id. */
5575 /* Try a template-id. */
5577 check_dependency_p,
5578 none_type,
5579 declarator_p);
5580 /* If it worked, we're done. */
5583 /* Otherwise, it's an ordinary identifier. */
5585 }
5589 check_dependency_p,
5590 none_type,
5591 declarator_p);
5594 {
5595 tree type_decl;
5596 tree qualifying_scope;
5597 tree object_scope;
5598 tree scope;
5601 /* Consume the `~' token. */
5603 /* Parse the class-name. The standard, as written, seems to
5604 say that:
5606 template <typename T> struct S { ~S (); };
5607 template <typename T> S<T>::~S() {}
5609 is invalid, since `~' must be followed by a class-name, but
5610 `S<T>' is dependent, and so not known to be a class.
5611 That's not right; we need to look in uninstantiated
5612 templates. A further complication arises from:
5614 template <typename T> void f(T t) {
5615 t.T::~T();
5616 }
5618 Here, it is not possible to look up `T' in the scope of `T'
5619 itself. We must look in both the current scope, and the
5620 scope of the containing complete expression.
5622 Yet another issue is:
5624 struct S {
5625 int S;
5626 ~S();
5627 };
5629 S::~S() {}
5631 The standard does not seem to say that the `S' in `~S'
5632 should refer to the type `S' and not the data member
5633 `S::S'. */
5635 /* DR 244 says that we look up the name after the "~" in the
5636 same scope as we looked up the qualifying name. That idea
5637 isn't fully worked out; it's more complicated than that. */
5642 /* Check for invalid scopes. */
5644 {
5648 }
5650 {
5654 scope);
5659 }
5662 /* If the name is of the form "X::~X" it's OK even if X is a
5663 typedef. */
5672 {
5675 }
5677 /* ~auto means the destructor of whatever the object is. */
5679 {
5682 "%<~auto%> only available with "
5686 }
5688 /* If there was an explicit qualification (S::~T), first look
5689 in the scope given by the qualification (i.e., S).
5691 Note: in the calls to cp_parser_class_name below we pass
5692 typename_type so that lookup finds the injected-class-name
5693 rather than the constructor. */
5697 {
5702 typename_type,
5705 declarator_p);
5708 }
5709 /* In "N::S::~S", look in "N" as well. */
5711 {
5716 type_decl
5720 typename_type,
5723 declarator_p);
5726 }
5727 /* In "p->S::~T", look in the scope given by "*p" as well. */
5729 {
5734 type_decl
5738 typename_type,
5741 declarator_p);
5744 }
5745 /* Look in the surrounding context. */
5747 {
5753 type_decl
5757 typename_type,
5760 declarator_p);
5763 {
5764 /* We couldn't find a type with this name. If we're parsing
5765 tentatively, fail and try something else. */
5767 {
5770 }
5771 /* Otherwise, accept it and check for a match at instantiation
5772 time. */
5777 }
5778 }
5779 /* If an error occurred, assume that the name of the
5780 destructor is the same as the name of the qualifying
5781 class. That allows us to keep parsing after running
5782 into ill-formed destructor names. */
5788 /* Check that destructor name and scope match. */
5790 {
5797 }
5799 /* [class.dtor]
5801 A typedef-name that names a class shall not be used as the
5802 identifier in the declarator for a destructor declaration. */
5809 type_decl);
5812 }
5816 {
5817 cp_expr id;
5819 /* This could be a template-id, so we try that first. */
5821 /* Try a template-id. */
5824 none_type,
5825 declarator_p);
5826 /* If that worked, we're done. */
5829 /* We still don't know whether we're looking at an
5830 operator-function-id or a conversion-function-id. */
5832 /* Try an operator-function-id. */
5834 /* If that didn't work, try a conversion-function-id. */
5838 {
5839 /* 17.6.3.3.5 */
5844 "literal operator suffixes not preceded by %<_%>"
5846 }
5849 }
5850 /* Fall through. */
5857 }
5858 }
5860 /* Parse an (optional) nested-name-specifier.
5862 nested-name-specifier: [C++98]
5863 class-or-namespace-name :: nested-name-specifier [opt]
5864 class-or-namespace-name :: template nested-name-specifier [opt]
5866 nested-name-specifier: [C++0x]
5867 type-name ::
5868 namespace-name ::
5869 nested-name-specifier identifier ::
5870 nested-name-specifier template [opt] simple-template-id ::
5872 PARSER->SCOPE should be set appropriately before this function is
5873 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5874 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5875 in name lookups.
5877 Sets PARSER->SCOPE to the class (TYPE) or namespace
5878 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5879 it unchanged if there is no nested-name-specifier. Returns the new
5880 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5882 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5883 part of a declaration and/or decl-specifier. */
5885 static tree
5892 {
5897 /* Remember where the nested-name-specifier starts. */
5899 {
5902 }
5905 {
5906 tree new_scope;
5907 tree old_scope;
5908 tree saved_qualifying_scope;
5910 /* Spot cases that cannot be the beginning of a
5911 nested-name-specifier. */
5914 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5915 the already parsed nested-name-specifier. */
5917 {
5918 /* Grab the nested-name-specifier and continue the loop. */
5920 /* If we originally encountered this nested-name-specifier
5921 with IS_DECLARATION set to false, we will not have
5922 resolved TYPENAME_TYPEs, so we must do so here. */
5925 {
5930 }
5933 }
5935 /* Spot cases that cannot be the beginning of a
5936 nested-name-specifier. On the second and subsequent times
5937 through the loop, we look for the `template' keyword. */
5939 ;
5940 /* A template-id can start a nested-name-specifier. */
5942 ;
5943 /* DR 743: decltype can be used in a nested-name-specifier. */
5945 ;
5946 else
5947 {
5948 /* If the next token is not an identifier, then it is
5949 definitely not a type-name or namespace-name. */
5952 /* If the following token is neither a `<' (to begin a
5953 template-id), nor a `::', then we are not looking at a
5954 nested-name-specifier. */
5960 {
5964 "found %<:%> in nested-name-specifier, "
5967 }
5970 && !cp_parser_nth_token_starts_template_argument_list_p
5973 }
5975 /* The nested-name-specifier is optional, so we parse
5976 tentatively. */
5979 /* Look for the optional `template' keyword, if this isn't the
5980 first time through the loop. */
5984 /* Save the old scope since the name lookup we are about to do
5985 might destroy it. */
5988 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5989 look up names in "X<T>::I" in order to determine that "Y" is
5990 a template. So, if we have a typename at this point, we make
5991 an effort to look through it. */
5993 && !typename_keyword_p
5998 /* Parse the qualifying entity. */
5999 new_scope
6001 typename_keyword_p,
6002 template_keyword_p,
6003 check_dependency_p,
6004 type_p,
6005 is_declaration);
6006 /* Look for the `::' token. */
6009 /* If we found what we wanted, we keep going; otherwise, we're
6010 done. */
6012 {
6015 /* Restore the OLD_SCOPE since it was valid before the
6016 failed attempt at finding the last
6017 class-or-namespace-name. */
6021 /* If the next token is a decltype, and the one after that is a
6022 `::', then the decltype has failed to resolve to a class or
6023 enumeration type. Give this error even when parsing
6024 tentatively since it can't possibly be valid--and we're going
6025 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6026 won't get another chance.*/
6030 {
6037 /* As below. */
6040 }
6044 {
6045 /* If we have a non-type template-id followed by ::, it can't
6046 possibly be valid. */
6051 {
6054 {
6060 }
6061 else
6062 {
6063 /* Variable template. */
6068 }
6075 /* As below. */
6079 }
6080 }
6084 /* If the next token is an identifier, and the one after
6085 that is a `::', then any valid interpretation would have
6086 found a class-or-namespace-name. */
6092 {
6095 {
6097 {
6098 tree decl;
6099 tree ambiguous_decls;
6102 none_type,
6111 decl);
6113 {
6114 // cp_parser_lookup_name has the same diagnostic,
6115 // thus make sure to emit it at most once.
6118 {
6123 }
6125 }
6126 else
6127 {
6129 cp_parser_name_lookup_error
6132 else
6133 cp_parser_name_lookup_error
6136 }
6137 }
6140 /* Treat this as a successful nested-name-specifier
6141 due to:
6143 [basic.lookup.qual]
6145 If the name found is not a class-name (clause
6146 _class_) or namespace-name (_namespace.def_), the
6147 program is ill-formed. */
6149 }
6151 }
6153 }
6154 /* We've found one valid nested-name-specifier. */
6156 /* Name lookup always gives us a DECL. */
6159 /* Uses of "template" must be followed by actual templates. */
6171 new_scope);
6172 /* If it is a class scope, try to complete it; we are about to
6173 be looking up names inside the class. */
6175 /* Since checking types for dependency can be expensive,
6176 avoid doing it if the type is already complete. */
6178 /* Do not try to complete dependent types. */
6180 {
6182 /* If it is a typedef to current class, use the current
6183 class instead, as the typedef won't have any names inside
6184 it yet. */
6188 }
6189 /* Make sure we look in the right scope the next time through
6190 the loop. */
6192 }
6194 /* If parsing tentatively, replace the sequence of tokens that makes
6195 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6196 token. That way, should we re-parse the token stream, we will
6197 not have to repeat the effort required to do the parse, nor will
6198 we issue duplicate error messages. */
6200 {
6204 /* Reset the contents of the START token. */
6206 /* Retrieve any deferred checks. Do not pop this access checks yet
6207 so the memory will not be reclaimed during token replacing below. */
6215 /* Purge all subsequent tokens. */
6217 }
6223 }
6225 /* Parse a nested-name-specifier. See
6226 cp_parser_nested_name_specifier_opt for details. This function
6227 behaves identically, except that it will an issue an error if no
6228 nested-name-specifier is present. */
6230 static tree
6236 {
6237 tree scope;
6239 /* Look for the nested-name-specifier. */
6241 typename_keyword_p,
6242 check_dependency_p,
6243 type_p,
6244 is_declaration);
6245 /* If it was not present, issue an error message. */
6247 {
6250 }
6253 }
6255 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6256 this is either a class-name or a namespace-name (which corresponds
6257 to the class-or-namespace-name production in the grammar). For
6258 C++0x, it can also be a type-name that refers to an enumeration
6259 type or a simple-template-id.
6261 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6262 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6263 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6264 TYPE_P is TRUE iff the next name should be taken as a class-name,
6265 even the same name is declared to be another entity in the same
6266 scope.
6268 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6269 specified by the class-or-namespace-name. If neither is found the
6270 ERROR_MARK_NODE is returned. */
6272 static tree
6279 {
6280 tree saved_scope;
6281 tree saved_qualifying_scope;
6282 tree saved_object_scope;
6283 tree scope;
6287 /* DR 743: decltype can appear in a nested-name-specifier. */
6289 {
6293 {
6296 }
6300 }
6302 /* Before we try to parse the class-name, we must save away the
6303 current PARSER->SCOPE since cp_parser_class_name will destroy
6304 it. */
6308 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6309 there is no need to look for a namespace-name. */
6310 only_class_p = template_keyword_p
6315 typename_keyword_p,
6316 template_keyword_p,
6318 check_dependency_p,
6320 is_declaration,
6323 /* If that didn't work, try for a namespace-name. */
6325 {
6326 /* Restore the saved scope. */
6330 /* If we are not looking at an identifier followed by the scope
6331 resolution operator, then this is not part of a
6332 nested-name-specifier. (Note that this function is only used
6333 to parse the components of a nested-name-specifier.) */
6338 }
6341 }
6343 /* Return true if we are looking at a compound-literal, false otherwise. */
6345 static bool
6347 {
6348 /* Consume the `('. */
6353 /* Skip tokens until the next token is a closing parenthesis.
6354 If we find the closing `)', and the next token is a `{', then
6355 we are looking at a compound-literal. */
6356 bool compound_literal_p
6361 /* Roll back the tokens we skipped. */
6365 }
6367 /* Parse a postfix-expression.
6369 postfix-expression:
6370 primary-expression
6371 postfix-expression [ expression ]
6372 postfix-expression ( expression-list [opt] )
6373 simple-type-specifier ( expression-list [opt] )
6374 typename :: [opt] nested-name-specifier identifier
6375 ( expression-list [opt] )
6376 typename :: [opt] nested-name-specifier template [opt] template-id
6377 ( expression-list [opt] )
6378 postfix-expression . template [opt] id-expression
6379 postfix-expression -> template [opt] id-expression
6380 postfix-expression . pseudo-destructor-name
6381 postfix-expression -> pseudo-destructor-name
6382 postfix-expression ++
6383 postfix-expression --
6384 dynamic_cast < type-id > ( expression )
6385 static_cast < type-id > ( expression )
6386 reinterpret_cast < type-id > ( expression )
6387 const_cast < type-id > ( expression )
6388 typeid ( expression )
6389 typeid ( type-id )
6391 GNU Extension:
6393 postfix-expression:
6394 ( type-id ) { initializer-list , [opt] }
6396 This extension is a GNU version of the C99 compound-literal
6397 construct. (The C99 grammar uses `type-name' instead of `type-id',
6398 but they are essentially the same concept.)
6400 If ADDRESS_P is true, the postfix expression is the operand of the
6401 `&' operator. CAST_P is true if this expression is the target of a
6402 cast.
6404 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6405 class member access expressions [expr.ref].
6407 Returns a representation of the expression. */
6409 static cp_expr
6413 {
6415 location_t loc;
6422 /* Peek at the next token. */
6427 /* Some of the productions are determined by keywords. */
6430 {
6435 {
6436 tree type;
6437 cp_expr expression;
6441 /* All of these can be handled in the same way from the point
6442 of view of parsing. Begin by consuming the token
6443 identifying the cast. */
6446 /* New types cannot be defined in the cast. */
6448 parser->type_definition_forbidden_message
6451 /* Look for the opening `<'. */
6453 /* Parse the type to which we are casting. */
6458 /* Look for the closing `>'. */
6460 /* Restore the old message. */
6463 bool saved_greater_than_is_operator_p
6467 /* And the expression which is being cast. */
6471 RT_CLOSE_PAREN);
6475 parser->greater_than_is_operator_p
6478 /* Only type conversions to integral or enumeration types
6479 can be used in constant-expressions. */
6482 {
6485 }
6488 {
6490 postfix_expression
6494 postfix_expression
6498 postfix_expression
6500 tf_warning_or_error);
6503 postfix_expression
6508 }
6510 /* Construct a location e.g. :
6511 reinterpret_cast <int *> (expr)
6512 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6513 ranging from the start of the "*_cast" token to the final closing
6514 paren, with the caret at the start. */
6517 }
6521 {
6522 tree type;
6526 /* Consume the `typeid' token. */
6528 /* Look for the `(' token. */
6530 /* Types cannot be defined in a `typeid' expression. */
6532 parser->type_definition_forbidden_message
6534 /* We can't be sure yet whether we're looking at a type-id or an
6535 expression. */
6537 /* Try a type-id first. */
6542 /* Look for the `)' token. Otherwise, we can't be sure that
6543 we're not looking at an expression: consider `typeid (int
6544 (3))', for example. */
6546 RT_CLOSE_PAREN);
6547 /* If all went well, simply lookup the type-id. */
6550 /* Otherwise, fall back to the expression variant. */
6551 else
6552 {
6553 tree expression;
6555 /* Look for an expression. */
6557 /* Compute its typeid. */
6559 /* Look for the `)' token. */
6560 close_paren
6562 }
6563 /* Restore the saved message. */
6565 /* `typeid' may not appear in an integral constant expression. */
6569 /* Construct a location e.g. :
6570 typeid (expr)
6571 ^~~~~~~~~~~~~
6572 ranging from the start of the "typeid" token to the final closing
6573 paren, with the caret at the start. */
6575 {
6576 location_t typeid_loc
6579 }
6580 }
6584 {
6585 tree type;
6586 /* The syntax permitted here is the same permitted for an
6587 elaborated-type-specifier. */
6594 }
6598 {
6599 location_t cilk_spawn_loc
6604 {
6609 }
6611 {
6616 }
6617 else
6618 {
6619 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6622 }
6624 postfix_expression =
6628 {
6632 }
6634 {
6639 }
6640 else
6641 {
6644 postfix_expression);
6645 /* Build a location of the form:
6646 _Cilk_spawn expr
6647 ~~~~~~~~~~~~^~~~
6648 with caret at the expr, ranging from the start of the
6649 _Cilk_spawn token to the end of the expression. */
6650 location_t combined_loc =
6656 }
6658 }
6663 {
6666 tree p;
6673 {
6676 }
6682 {
6685 postfix_expression
6687 else
6688 {
6692 }
6698 tf_warning_or_error);
6699 else
6700 {
6704 }
6709 postfix_expression
6713 postfix_expression
6716 else
6717 {
6721 }
6726 }
6728 }
6731 {
6732 tree type;
6734 /* If the next thing is a simple-type-specifier, we may be
6735 looking at a functional cast. We could also be looking at
6736 an id-expression. So, we try the functional cast, and if
6737 that doesn't work we fall back to the primary-expression. */
6739 /* Look for the simple-type-specifier. */
6743 CP_PARSER_FLAGS_NONE);
6745 /* Parse the cast itself. */
6747 postfix_expression
6749 /* If that worked, we're done. */
6753 /* If the functional-cast didn't work out, try a
6754 compound-literal. */
6757 {
6762 /* Avoid calling cp_parser_type_id pointlessly, see comment
6763 in cp_parser_cast_expression about c++/29234. */
6766 else
6767 {
6768 /* Parse the type. */
6773 /* Look for the `)'. */
6775 }
6777 /* If things aren't going well, there's no need to
6778 keep going. */
6780 {
6782 /* Parse the brace-enclosed initializer list. */
6785 }
6786 /* If that worked, we're definitely looking at a
6787 compound-literal expression. */
6789 {
6790 /* Warn the user that a compound literal is not
6791 allowed in standard C++. */
6794 /* For simplicity, we disallow compound literals in
6795 constant-expressions. We could
6796 allow compound literals of integer type, whose
6797 initializer was a constant, in constant
6798 expressions. Permitting that usage, as a further
6799 extension, would not change the meaning of any
6800 currently accepted programs. (Of course, as
6801 compound literals are not part of ISO C++, the
6802 standard has nothing to say.) */
6804 NIC_NCC))
6805 {
6808 }
6809 /* Form the representation of the compound-literal. */
6810 postfix_expression
6815 }
6816 }
6818 /* It must be a primary-expression. */
6819 postfix_expression
6822 decltype_p,
6824 }
6826 }
6828 /* Note that we don't need to worry about calling build_cplus_new on a
6829 class-valued CALL_EXPR in decltype when it isn't the end of the
6830 postfix-expression; unary_complex_lvalue will take care of that for
6831 all these cases. */
6833 /* Keep looping until the postfix-expression is complete. */
6835 {
6839 /* It is not a Koenig lookup function call. */
6840 postfix_expression
6843 /* Peek at the next token. */
6847 {
6850 {
6852 "two consecutive %<[%> shall "
6855 }
6856 postfix_expression
6858 postfix_expression,
6860 decltype_p);
6869 /* postfix-expression ( expression-list [opt] ) */
6870 {
6881 is_builtin_constant_p
6884 {
6885 /* The whole point of __builtin_constant_p is to allow
6886 non-constant expressions to appear as arguments. */
6887 saved_integral_constant_expression_p
6889 saved_non_integral_constant_expression_p
6892 }
6893 args = (cp_parser_parenthesized_expression_list
6899 {
6900 parser->integral_constant_expression_p
6902 parser->non_integral_constant_expression_p
6904 }
6907 {
6910 }
6912 /* Function calls are not permitted in
6913 constant-expressions. */
6916 NIC_FUNC_CALL))
6917 {
6921 }
6926 {
6928 {
6930 {
6933 postfix_expression
6935 complain);
6936 }
6937 else
6938 postfix_expression
6940 }
6941 /* We do not perform argument-dependent lookup if
6942 normal lookup finds a non-function, in accordance
6943 with the expected resolution of DR 218. */
6946 {
6950 /* Do not do argument dependent lookup if regular
6951 lookup finds a member function or a block-scope
6952 function declaration. [basic.lookup.argdep]/3 */
6955 {
6958 postfix_expression
6960 complain);
6961 }
6962 }
6963 }
6969 {
6978 }
6981 {
6991 {
6993 postfix_expression
6997 }
7000 {
7001 postfix_expression
7002 = (build_new_method_call
7008 complain));
7009 }
7010 else
7011 postfix_expression
7015 complain);
7016 }
7020 postfix_expression = (build_offset_ref_call_from_tree
7022 complain));
7024 /* A call to a static class member, or a namespace-scope
7025 function. */
7026 postfix_expression
7029 koenig_p,
7030 complain);
7031 else
7032 /* All other function calls. */
7033 postfix_expression
7036 koenig_p,
7037 complain);
7040 {
7042 start_loc,
7043 close_paren_loc);
7045 }
7047 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7051 }
7056 /* postfix-expression . template [opt] id-expression
7057 postfix-expression . pseudo-destructor-name
7058 postfix-expression -> template [opt] id-expression
7059 postfix-expression -> pseudo-destructor-name */
7061 /* Consume the `.' or `->' operator. */
7064 postfix_expression
7066 postfix_expression,
7073 /* postfix-expression ++ */
7074 /* Consume the `++' token. */
7076 /* Generate a representation for the complete expression. */
7077 postfix_expression
7079 POSTINCREMENT_EXPR);
7080 /* Increments may not appear in constant-expressions. */
7088 /* postfix-expression -- */
7089 /* Consume the `--' token. */
7091 /* Generate a representation for the complete expression. */
7092 postfix_expression
7094 POSTDECREMENT_EXPR);
7095 /* Decrements may not appear in constant-expressions. */
7106 return is_member_access
7107 ? postfix_expression
7109 else
7111 }
7112 }
7114 /* We should never get here. */
7117 }
7119 /* This function parses Cilk Plus array notations. If a normal array expr. is
7120 parsed then the array index is passed back to the caller through *INIT_INDEX
7121 and the function returns a NULL_TREE. If array notation expr. is parsed,
7122 then *INIT_INDEX is ignored by the caller and the function returns
7123 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7124 error_mark_node. */
7126 static tree
7128 tree array_value)
7129 {
7133 {
7136 }
7145 {
7148 }
7150 {
7151 /* Consume the ':'. */
7154 /* If we are here, then we have a case like this A[:]. */
7156 {
7160 }
7164 }
7165 else
7166 {
7167 /* If we are here, then there are three valid possibilities:
7168 1. ARRAY [ EXP ]
7169 2. ARRAY [ EXP : EXP ]
7170 3. ARRAY [ EXP : EXP : EXP ] */
7174 {
7175 /* This indicates that we have a normal array expression. */
7178 }
7180 /* Consume the ':'. */
7184 {
7187 }
7188 }
7193 {
7197 }
7203 }
7205 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7206 by cp_parser_builtin_offsetof. We're looking for
7208 postfix-expression [ expression ]
7209 postfix-expression [ braced-init-list ] (C++11)
7211 FOR_OFFSETOF is set if we're being called in that context, which
7212 changes how we deal with integer constant expressions. */
7214 static tree
7216 tree postfix_expression,
7219 {
7224 /* Consume the `[' token. */
7230 /* Parse the index expression. */
7231 /* ??? For offsetof, there is a question of what to allow here. If
7232 offsetof is not being used in an integral constant expression context,
7233 then we *could* get the right answer by computing the value at runtime.
7234 If we are in an integral constant expression context, then we might
7235 could accept any constant expression; hard to say without analysis.
7236 Rather than open the barn door too wide right away, allow only integer
7237 constant expressions here. */
7240 else
7241 {
7243 {
7250 {
7252 "braced list index is not allowed with array "
7256 }
7257 }
7259 {
7260 /* Here are have these two options:
7261 ARRAY[EXP : EXP] - Array notation expr with default
7262 stride of 1.
7263 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7264 stride. */
7266 postfix_expression);
7269 }
7270 else
7272 }
7276 /* Look for the closing `]'. */
7279 /* Build the ARRAY_REF. */
7283 /* When not doing offsetof, array references are not permitted in
7284 constant-expressions. */
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 . template [opt] id-expression
7296 postfix-expression . pseudo-destructor-name
7297 postfix-expression -> template [opt] id-expression
7298 postfix-expression -> pseudo-destructor-name
7300 FOR_OFFSETOF is set if we're being called in that context. That sorta
7301 limits what of the above we'll actually accept, but nevermind.
7302 TOKEN_TYPE is the "." or "->" token, which will already have been
7303 removed from the stream. */
7305 static tree
7308 cp_expr postfix_expression,
7310 location_t location)
7311 {
7312 tree name;
7318 /* If this is a `->' operator, dereference the pointer. */
7321 tf_warning_or_error);
7322 /* Check to see whether or not the expression is type-dependent and
7323 not the current instantiation. */
7325 /* The identifier following the `->' or `.' is not qualified. */
7331 /* Enter the scope corresponding to the type of the object
7332 given by the POSTFIX_EXPRESSION. */
7334 {
7336 /* According to the standard, no expression should ever have
7337 reference type. Unfortunately, we do not currently match
7338 the standard in this respect in that our internal representation
7339 of an expression may have reference type even when the standard
7340 says it does not. Therefore, we have to manually obtain the
7341 underlying type here. */
7343 /* The type of the POSTFIX_EXPRESSION must be complete. */
7344 /* Unlike the object expression in other contexts, *this is not
7345 required to be of complete type for purposes of class member
7346 access (5.2.5) outside the member function body. */
7349 && !(processing_template_decl
7350 && current_class_type
7351 && (same_type_ignoring_top_level_qualifiers_p
7353 {
7356 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7358 {
7359 /* In a template, be permissive by treating an object expression
7360 of incomplete type as dependent (after a pedwarn). */
7361 diagnostic_t kind = (processing_template_decl
7362 ? DK_PEDWARN
7364 cxx_incomplete_type_diagnostic
7368 {
7371 }
7372 }
7373 }
7376 {
7377 /* Let the name lookup machinery know that we are processing a
7378 class member access expression. */
7380 /* If something went wrong, we want to be able to discern that case,
7381 as opposed to the case where there was no SCOPE due to the type
7382 of expression being dependent. */
7385 /* If the SCOPE was erroneous, make the various semantic analysis
7386 functions exit quickly -- and without issuing additional error
7387 messages. */
7390 }
7391 }
7394 /* Tell cp_parser_lookup_name that there was an object, even though it's
7395 type-dependent. */
7398 /* Assume this expression is not a pseudo-destructor access. */
7401 /* If the SCOPE is a scalar type, then, if this is a valid program,
7402 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7403 is type dependent, it can be pseudo-destructor-name or something else.
7404 Try to parse it as pseudo-destructor-name first. */
7406 {
7407 tree s;
7408 tree type;
7411 /* Parse the pseudo-destructor-name. */
7420 {
7422 postfix_expression
7425 }
7426 }
7429 {
7430 /* If the SCOPE is not a scalar type, we are looking at an
7431 ordinary class member access expression, rather than a
7432 pseudo-destructor-name. */
7435 /* Parse the id-expression. */
7436 name = (cp_parser_id_expression
7443 /* In general, build a SCOPE_REF if the member name is qualified.
7444 However, if the name was not dependent and has already been
7445 resolved; there is no need to build the SCOPE_REF. For example;
7447 struct X { void f(); };
7448 template <typename T> void f(T* t) { t->X::f(); }
7450 Even though "t" is dependent, "X::f" is not and has been resolved
7451 to a BASELINK; there is no need to include scope information. */
7453 /* But we do need to remember that there was an explicit scope for
7454 virtual function calls. */
7458 /* If the name is a template-id that names a type, we will get a
7459 TYPE_DECL here. That is invalid code. */
7461 {
7464 }
7465 else
7466 {
7468 {
7470 {
7474 }
7475 else
7478 name,
7479 template_p);
7483 }
7485 adjust_result_of_qualified_name_lookup
7487 postfix_expression
7489 template_p,
7490 tf_warning_or_error);
7491 /* Build a location e.g.:
7492 ptr->access_expr
7493 ~~~^~~~~~~~~~~~~
7494 where the caret is at the deref token, ranging from
7495 the start of postfix_expression to the end of the access expr. */
7496 location_t end_loc
7498 location_t combined_loc
7501 }
7502 }
7504 /* We no longer need to look up names in the scope of the object on
7505 the left-hand side of the `.' or `->' operator. */
7508 /* Outside of offsetof, these operators may not appear in
7509 constant-expressions. */
7511 && (cp_parser_non_integral_constant_expression
7516 }
7518 /* Parse a parenthesized expression-list.
7520 expression-list:
7521 assignment-expression
7522 expression-list, assignment-expression
7524 attribute-list:
7525 expression-list
7526 identifier
7527 identifier, expression-list
7529 CAST_P is true if this expression is the target of a cast.
7531 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7532 argument pack.
7534 Returns a vector of trees. Each element is a representation of an
7535 assignment-expression. NULL is returned if the ( and or ) are
7536 missing. An empty, but allocated, vector is returned on no
7537 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7538 if we are parsing an attribute list for an attribute that wants a
7539 plain identifier argument, normal_attr for an attribute that wants
7540 an expression, or non_attr if we aren't parsing an attribute list. If
7541 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7542 not all of the expressions in the list were constant.
7543 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7544 will be written to with the location of the closing parenthesis. If
7545 an error occurs, it may or may not be written to. */
7554 {
7560 /* Assume all the expressions will be constant. */
7569 /* Within a parenthesized expression, a `>' token is always
7570 the greater-than operator. */
7571 saved_greater_than_is_operator_p
7575 /* Consume expressions until there are no more. */
7578 {
7579 tree expr;
7581 /* At the beginning of attribute lists, check to see if the
7582 next token is an identifier. */
7585 {
7588 /* Consume the identifier. */
7590 /* Save the identifier. */
7592 }
7593 else
7594 {
7597 /* Parse the next assignment-expression. */
7599 {
7600 /* A braced-init-list. */
7606 }
7608 {
7609 expr = (cp_parser_constant_expression
7614 }
7615 else
7617 cast_p);
7622 /* If we have an ellipsis, then this is an expression
7623 expansion. */
7626 {
7627 /* Consume the `...'. */
7630 /* Build the argument pack. */
7632 }
7634 /* Add it to the list. We add error_mark_node
7635 expressions to the list, so that we can still tell if
7636 the correct form for a parenthesized expression-list
7637 is found. That gives better errors. */
7642 }
7644 /* After the first item, attribute lists look the same as
7645 expression lists. */
7648 get_comma:;
7649 /* If the next token isn't a `,', then we are done. */
7653 /* Otherwise, consume the `,' and keep going. */
7655 }
7661 {
7664 skip_comma:;
7665 /* We try and resync to an unnested comma, as that will give the
7666 user better diagnostics. */
7674 {
7675 parser->greater_than_is_operator_p
7678 }
7679 }
7681 parser->greater_than_is_operator_p
7688 }
7690 /* Parse a pseudo-destructor-name.
7692 pseudo-destructor-name:
7693 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7694 :: [opt] nested-name-specifier template template-id :: ~ type-name
7695 :: [opt] nested-name-specifier [opt] ~ type-name
7697 If either of the first two productions is used, sets *SCOPE to the
7698 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7699 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7700 or ERROR_MARK_NODE if the parse fails. */
7702 static void
7704 tree object,
7707 {
7710 /* Handle ~auto. */
7714 {
7717 "%<~auto%> only available with "
7724 }
7726 /* Assume that things will not work out. */
7729 /* Look for the optional `::' operator. */
7731 /* Look for the optional nested-name-specifier. */
7732 nested_name_specifier_p
7739 /* Now, if we saw a nested-name-specifier, we might be doing the
7740 second production. */
7743 {
7744 /* Consume the `template' keyword. */
7746 /* Parse the template-id. */
7750 class_type,
7752 /* Look for the `::' token. */
7754 }
7755 /* If the next token is not a `~', then there might be some
7756 additional qualification. */
7758 {
7759 /* At this point, we're looking for "type-name :: ~". The type-name
7760 must not be a class-name, since this is a pseudo-destructor. So,
7761 it must be either an enum-name, or a typedef-name -- both of which
7762 are just identifiers. So, we peek ahead to check that the "::"
7763 and "~" tokens are present; if they are not, then we can avoid
7764 calling type_name. */
7768 {
7771 }
7773 /* Look for the type-name. */
7778 /* Look for the `::' token. */
7780 }
7781 else
7784 /* Look for the `~'. */
7787 /* Once we see the ~, this has to be a pseudo-destructor. */
7791 /* Look for the type-name again. We are not responsible for
7792 checking that it matches the first type-name. */
7794 }
7796 /* Parse a unary-expression.
7798 unary-expression:
7799 postfix-expression
7800 ++ cast-expression
7801 -- cast-expression
7802 unary-operator cast-expression
7803 sizeof unary-expression
7804 sizeof ( type-id )
7805 alignof ( type-id ) [C++0x]
7806 new-expression
7807 delete-expression
7809 GNU Extensions:
7811 unary-expression:
7812 __extension__ cast-expression
7813 __alignof__ unary-expression
7814 __alignof__ ( type-id )
7815 alignof unary-expression [C++0x]
7816 __real__ cast-expression
7817 __imag__ cast-expression
7818 && identifier
7819 sizeof ( type-id ) { initializer-list , [opt] }
7820 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7821 __alignof__ ( type-id ) { initializer-list , [opt] }
7823 ADDRESS_P is true iff the unary-expression is appearing as the
7824 operand of the `&' operator. CAST_P is true if this expression is
7825 the target of a cast.
7827 Returns a representation of the expression. */
7829 static cp_expr
7832 {
7836 /* Peek at the next token. */
7838 /* Some keywords give away the kind of expression. */
7840 {
7844 {
7847 {
7853 /* Consume the token. */
7855 /* Parse the operand. */
7860 else
7861 {
7862 /* ISO C++ defines alignof only with types, not with
7863 expressions. So pedwarn if alignof is used with a non-
7864 type expression. However, __alignof__ is ok. */
7867 "ISO C++ does not allow %<alignof%> "
7871 }
7872 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7873 SIZEOF_EXPR with the original operand. */
7875 {
7877 {
7879 {
7882 error_mark_node));
7884 }
7885 else
7889 }
7890 }
7892 /* Construct a location e.g. :
7893 alignof (expr)
7894 ^~~~~~~~~~~~~~
7895 with start == caret at the start of the "alignof"/"sizeof"
7896 token, with the endpoint at the final closing paren. */
7897 location_t finish_loc
7899 location_t compound_loc
7905 }
7914 {
7915 /* The saved value of the PEDANTIC flag. */
7917 tree expr;
7919 /* Save away the PEDANTIC flag. */
7921 /* Parse the cast-expression. */
7923 /* Restore the PEDANTIC flag. */
7927 }
7931 {
7932 tree expression;
7934 /* Consume the `__real__' or `__imag__' token. */
7936 /* Parse the cast-expression. */
7938 /* Create the complete representation. */
7942 expression,
7943 tf_warning_or_error);
7944 }
7952 {
7953 tree expr;
7963 parser->type_definition_forbidden_message
7966 saved_integral_constant_expression_p
7968 saved_non_integral_constant_expression_p
7972 saved_greater_than_is_operator_p
7984 parser->greater_than_is_operator_p
7987 parser->integral_constant_expression_p
7989 parser->non_integral_constant_expression_p
7996 }
8000 }
8001 }
8003 /* Look for the `:: new' and `:: delete', which also signal the
8004 beginning of a new-expression, or delete-expression,
8005 respectively. If the next token is `::', then it might be one of
8006 these. */
8008 {
8011 /* See if the token after the `::' is one of the keywords in
8012 which we're interested. */
8014 /* If it's `new', we have a new-expression. */
8017 /* Similarly, for `delete'. */
8020 }
8022 /* Look for a unary operator. */
8024 /* The `++' and `--' operators can be handled similarly, even though
8025 they are not technically unary-operators in the grammar. */
8027 {
8032 /* Handle the GNU address-of-label extension. */
8035 {
8036 tree identifier;
8037 tree expression;
8040 /* Consume the '&&' token. */
8042 /* Look for the identifier. */
8043 location_t finish_loc
8046 /* Construct a location of the form:
8047 &&label
8048 ^~~~~~~
8049 with caret==start at the "&&", finish at the end of the label. */
8050 location_t combined_loc
8052 /* Create an expression representing the address. */
8055 NIC_ADDR_LABEL))
8058 }
8059 }
8061 {
8062 cp_expr cast_expression;
8068 /* Consume the operator token. */
8072 /* Parse the cast-expression. */
8073 cast_expression
8078 pidk);
8080 /* Make a location:
8081 OP_TOKEN CAST_EXPRESSION
8082 ^~~~~~~~~~~~~~~~~~~~~~~~~
8083 with start==caret at the operator token, and
8084 extending to the end of the cast_expression. */
8087 /* Now, build an appropriate representation. */
8089 {
8093 RO_UNARY_STAR,
8094 complain);
8095 /* TODO: build_x_indirect_ref does not always honor the
8096 location, so ensure it is set. */
8102 /* Fall through. */
8105 cast_expression,
8106 complain);
8107 /* TODO: build_x_unary_op does not always honor the location,
8108 so ensure it is set. */
8116 /* Fall through. */
8118 /* Immediately fold negation of a constant, unless the constant is 0
8119 (since -0 == 0) or it would overflow. */
8124 {
8127 cast_expression);
8129 {
8132 }
8133 }
8134 /* Fall through. */
8143 }
8147 non_constant_p))
8151 }
8155 decltype_p,
8156 pidk);
8157 }
8159 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8160 unary-operator, the corresponding tree code is returned. */
8162 static enum tree_code
8164 {
8166 {
8187 }
8188 }
8190 /* Parse a new-expression.
8192 new-expression:
8193 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8194 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8196 Returns a representation of the expression. */
8198 static tree
8200 {
8203 tree type;
8206 tree ret;
8210 /* Look for the optional `::' operator. */
8211 global_scope_p
8215 /* Look for the `new' operator. */
8217 /* There's no easy way to tell a new-placement from the
8218 `( type-id )' construct. */
8220 /* Look for a new-placement. */
8222 /* If that didn't work out, there's no new-placement. */
8224 {
8228 }
8230 /* If the next token is a `(', then we have a parenthesized
8231 type-id. */
8233 {
8237 /* Consume the `('. */
8240 /* Parse the type-id. */
8241 parser->type_definition_forbidden_message
8243 {
8246 }
8249 /* Look for the closing `)'. */
8252 /* There should not be a direct-new-declarator in this production,
8253 but GCC used to allowed this, so we check and emit a sensible error
8254 message for this case. */
8256 {
8262 }
8263 }
8264 /* Otherwise, there must be a new-type-id. */
8265 else
8268 /* If the next token is a `(' or '{', then we have a new-initializer. */
8273 else
8276 /* A new-expression may not appear in an integral constant
8277 expression. */
8280 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8281 of a new-type-id or type-id of a new-expression, the new-expression shall
8282 contain a new-initializer of the form ( assignment-expression )".
8283 Additionally, consistently with the spirit of DR 1467, we want to accept
8284 'new auto { 2 }' too. */
8290 {
8292 "initialization of new-expression for type %<auto%> "
8295 }
8296 else
8297 {
8298 /* Construct a location e.g.:
8299 ptr = new int[100]
8300 ^~~~~~~~~~~~
8301 with caret == start at the start of the "new" token, and the end
8302 at the end of the final token we consumed. */
8307 /* Create a representation of the new-expression. */
8309 tf_warning_or_error);
8311 }
8319 }
8321 /* Parse a new-placement.
8323 new-placement:
8324 ( expression-list )
8326 Returns the same representation as for an expression-list. */
8330 {
8333 /* Parse the expression-list. */
8334 expression_list = (cp_parser_parenthesized_expression_list
8343 }
8345 /* Parse a new-type-id.
8347 new-type-id:
8348 type-specifier-seq new-declarator [opt]
8350 Returns the TYPE allocated. If the new-type-id indicates an array
8351 type, *NELTS is set to the number of elements in the last array
8352 bound; the TYPE will not include the last array bound. */
8354 static tree
8356 {
8357 cp_decl_specifier_seq type_specifier_seq;
8363 /* The type-specifier sequence must not contain type definitions.
8364 (It cannot contain declarations of new types either, but if they
8365 are not definitions we will catch that because they are not
8366 complete.) */
8368 parser->type_definition_forbidden_message
8370 /* Parse the type-specifier-seq. */
8374 /* Restore the old message. */
8380 /* Parse the new-declarator. */
8383 /* Determine the number of elements in the last array dimension, if
8384 any. */
8386 /* Skip down to the last array dimension. */
8391 {
8394 }
8399 {
8402 }
8405 {
8412 else
8414 }
8417 }
8419 /* Parse an (optional) new-declarator.
8421 new-declarator:
8422 ptr-operator new-declarator [opt]
8423 direct-new-declarator
8425 Returns the declarator. */
8429 {
8432 cp_cv_quals cv_quals;
8434 /* We don't know if there's a ptr-operator next, or not. */
8436 /* Look for a ptr-operator. */
8438 /* If that worked, look for more new-declarators. */
8440 {
8443 /* Parse another optional declarator. */
8446 declarator = cp_parser_make_indirect_declarator
8450 }
8452 /* If the next token is a `[', there is a direct-new-declarator. */
8457 }
8459 /* Parse a direct-new-declarator.
8461 direct-new-declarator:
8462 [ expression ]
8463 direct-new-declarator [constant-expression]
8465 */
8469 {
8473 {
8474 tree expression;
8477 /* Look for the opening `['. */
8482 /* The standard requires that the expression have integral
8483 type. DR 74 adds enumeration types. We believe that the
8484 real intent is that these expressions be handled like the
8485 expression in a `switch' condition, which also allows
8486 classes with a single conversion to integral or
8487 enumeration type. */
8489 {
8490 expression
8492 expression,
8495 {
8497 "expression in new-declarator must have integral "
8500 }
8501 }
8503 /* Look for the closing `]'. */
8506 /* Add this bound to the declarator. */
8509 /* If the next token is not a `[', then there are no more
8510 bounds. */
8513 }
8516 }
8518 /* Parse a new-initializer.
8520 new-initializer:
8521 ( expression-list [opt] )
8522 braced-init-list
8524 Returns a representation of the expression-list. */
8528 {
8532 {
8533 tree t;
8540 }
8541 else
8542 expression_list = (cp_parser_parenthesized_expression_list
8548 }
8550 /* Parse a delete-expression.
8552 delete-expression:
8553 :: [opt] delete cast-expression
8554 :: [opt] delete [ ] cast-expression
8556 Returns a representation of the expression. */
8558 static tree
8560 {
8563 tree expression;
8565 /* Look for the optional `::' operator. */
8566 global_scope_p
8570 /* Look for the `delete' keyword. */
8572 /* See if the array syntax is in use. */
8574 {
8575 /* Consume the `[' token. */
8577 /* Look for the `]' token. */
8579 /* Remember that this is the `[]' construct. */
8581 }
8582 else
8585 /* Parse the cast-expression. */
8588 /* A delete-expression may not appear in an integral constant
8589 expression. */
8594 tf_warning_or_error);
8595 }
8597 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8598 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8599 0 otherwise. */
8601 static int
8603 {
8606 {
8648 /* In ((type ()) () the last () isn't a valid cast-expression,
8649 so the whole must be parsed as postfix-expression. */
8654 /* '[' may start a primary-expression in obj-c++ and in C++11,
8655 as a lambda-expression, eg, '(void)[]{}'. */
8662 /* '++' and '--' may or may not start a cast-expression:
8664 struct T { void operator++(int); };
8665 void f() { (T())++; }
8667 vs
8669 int a;
8670 (int)++a; */
8675 }
8676 }
8678 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8679 in the order: const_cast, static_cast, reinterpret_cast.
8681 Don't suggest dynamic_cast.
8683 Return the first legal cast kind found, or NULL otherwise. */
8687 {
8688 tree trial;
8690 /* Reuse the parser logic by attempting to build the various kinds of
8691 cast, with "complain" disabled.
8692 Identify the first such cast that is valid. */
8694 /* Don't attempt to run such logic within template processing. */
8698 /* First try const_cast. */
8703 /* If that fails, try static_cast. */
8708 /* Finally, try reinterpret_cast. */
8713 /* No such cast possible. */
8715 }
8717 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8718 suggesting how to convert a C-style cast of the form:
8720 (DST_TYPE)ORIG_EXPR
8722 to a C++-style cast.
8724 The primary range of RICHLOC is asssumed to be that of the original
8725 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8726 of the parens in the C-style cast. */
8728 static void
8731 tree dst_type)
8732 {
8733 /* This function is non-trivial, so bail out now if the warning isn't
8734 going to be emitted. */
8738 /* Try to find a legal C++ cast, trying them in order:
8739 const_cast, static_cast, reinterpret_cast. */
8744 /* Replace the open paren with "CAST_SUGGESTION<". */
8745 pretty_printer pp;
8749 /* Replace the close paren with "> (". */
8752 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8754 }
8757 /* Parse a cast-expression.
8759 cast-expression:
8760 unary-expression
8761 ( type-id ) cast-expression
8763 ADDRESS_P is true iff the unary-expression is appearing as the
8764 operand of the `&' operator. CAST_P is true if this expression is
8765 the target of a cast.
8767 Returns a representation of the expression. */
8769 static cp_expr
8772 {
8773 /* If it's a `(', then we might be looking at a cast. */
8775 {
8781 /* There's no way to know yet whether or not this is a cast.
8782 For example, `(int (3))' is a unary-expression, while `(int)
8783 3' is a cast. So, we resort to parsing tentatively. */
8785 /* Types may not be defined in a cast. */
8787 parser->type_definition_forbidden_message
8789 /* Consume the `('. */
8794 /* A very tricky bit is that `(struct S) { 3 }' is a
8795 compound-literal (which we permit in C++ as an extension).
8796 But, that construct is not a cast-expression -- it is a
8797 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8798 is legal; if the compound-literal were a cast-expression,
8799 you'd need an extra set of parentheses.) But, if we parse
8800 the type-id, and it happens to be a class-specifier, then we
8801 will commit to the parse at that point, because we cannot
8802 undo the action that is done when creating a new class. So,
8803 then we cannot back up and do a postfix-expression.
8805 Another tricky case is the following (c++/29234):
8807 struct S { void operator () (); };
8809 void foo ()
8810 {
8811 ( S()() );
8812 }
8814 As a type-id we parse the parenthesized S()() as a function
8815 returning a function, groktypename complains and we cannot
8816 back up in this case either.
8818 Therefore, we scan ahead to the closing `)', and check to see
8819 if the tokens after the `)' can start a cast-expression. Otherwise
8820 we are dealing with an unary-expression, a postfix-expression
8821 or something else.
8823 Yet another tricky case, in C++11, is the following (c++/54891):
8825 (void)[]{};
8827 The issue is that usually, besides the case of lambda-expressions,
8828 the parenthesized type-id cannot be followed by '[', and, eg, we
8829 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8830 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8831 we don't commit, we try a cast-expression, then an unary-expression.
8833 Save tokens so that we can put them back. */
8836 /* We may be looking at a cast-expression. */
8839 cast_expression
8842 /* Roll back the tokens we skipped. */
8844 /* If we aren't looking at a cast-expression, simulate an error so
8845 that the call to cp_parser_error_occurred below returns true. */
8848 else
8849 {
8852 /* Look for the type-id. */
8854 /* Look for the closing `)'. */
8855 cp_token *close_paren
8860 }
8862 /* Restore the saved message. */
8865 /* At this point this can only be either a cast or a
8866 parenthesized ctor such as `(T ())' that looks like a cast to
8867 function returning T. */
8869 {
8870 /* Only commit if the cast-expression doesn't start with
8871 '++', '--', or '[' in C++11. */
8879 pidk);
8882 {
8883 /* Warn about old-style casts, if so requested. */
8888 {
8894 }
8896 /* Only type conversions to integral or enumeration types
8897 can be used in constant-expressions. */
8900 NIC_CAST))
8903 /* Perform the cast. */
8904 /* Make a location:
8905 (TYPE) EXPR
8906 ^~~~~~~~~~~
8907 with start==caret at the open paren, extending to the
8908 end of "expr". */
8910 open_paren_loc,
8914 }
8915 }
8916 else
8918 }
8920 /* If we get here, then it's not a cast, so it must be a
8921 unary-expression. */
8924 }
8926 /* Parse a binary expression of the general form:
8928 pm-expression:
8929 cast-expression
8930 pm-expression .* cast-expression
8931 pm-expression ->* cast-expression
8933 multiplicative-expression:
8934 pm-expression
8935 multiplicative-expression * pm-expression
8936 multiplicative-expression / pm-expression
8937 multiplicative-expression % pm-expression
8939 additive-expression:
8940 multiplicative-expression
8941 additive-expression + multiplicative-expression
8942 additive-expression - multiplicative-expression
8944 shift-expression:
8945 additive-expression
8946 shift-expression << additive-expression
8947 shift-expression >> additive-expression
8949 relational-expression:
8950 shift-expression
8951 relational-expression < shift-expression
8952 relational-expression > shift-expression
8953 relational-expression <= shift-expression
8954 relational-expression >= shift-expression
8956 GNU Extension:
8958 relational-expression:
8959 relational-expression <? shift-expression
8960 relational-expression >? shift-expression
8962 equality-expression:
8963 relational-expression
8964 equality-expression == relational-expression
8965 equality-expression != relational-expression
8967 and-expression:
8968 equality-expression
8969 and-expression & equality-expression
8971 exclusive-or-expression:
8972 and-expression
8973 exclusive-or-expression ^ and-expression
8975 inclusive-or-expression:
8976 exclusive-or-expression
8977 inclusive-or-expression | exclusive-or-expression
8979 logical-and-expression:
8980 inclusive-or-expression
8981 logical-and-expression && inclusive-or-expression
8983 logical-or-expression:
8984 logical-and-expression
8985 logical-or-expression || logical-and-expression
8987 All these are implemented with a single function like:
8989 binary-expression:
8990 simple-cast-expression
8991 binary-expression <token> binary-expression
8993 CAST_P is true if this expression is the target of a cast.
8995 The binops_by_token map is used to get the tree codes for each <token> type.
8996 binary-expressions are associated according to a precedence table. */
8998 #define TOKEN_PRECEDENCE(token) \
8999 (((token->type == CPP_GREATER \
9000 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9001 && !parser->greater_than_is_operator_p) \
9002 ? PREC_NOT_OPERATOR \
9003 : binops_by_token[token->type].prec)
9005 static cp_expr
9011 {
9012 cp_parser_expression_stack stack;
9014 cp_parser_expression_stack_entry current;
9015 cp_expr rhs;
9019 tree overload;
9021 /* Parse the first expression. */
9032 {
9033 /* Get an operator token. */
9039 {
9041 "%<>>%> operator is treated"
9045 }
9050 /* This is a fold-expression; handle it later. */
9053 /* Popping an entry off the stack means we completed a subexpression:
9054 - either we found a token which is not an operator (`>' where it is not
9055 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9056 will happen repeatedly;
9057 - or, we found an operator which has lower priority. This is the case
9058 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9059 parsing `3 * 4'. */
9061 {
9064 else
9066 }
9068 get_rhs:
9072 /* We used the operator token. */
9075 /* For "false && x" or "true || x", x will never be executed;
9076 disable warnings while evaluating it. */
9078 c_inhibit_evaluation_warnings +=
9081 c_inhibit_evaluation_warnings +=
9084 /* Extract another operand. It may be the RHS of this expression
9085 or the LHS of a new, higher priority expression. */
9090 /* Get another operator token. Look up its precedence to avoid
9091 building a useless (immediately popped) stack entry for common
9092 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9099 {
9100 /* ... and prepare to parse the RHS of the new, higher priority
9101 expression. Since precedence levels on the stack are
9102 monotonically increasing, we do not have to care about
9103 stack overflows. */
9112 pop:
9114 /* If the stack is not empty, we have parsed into LHS the right side
9115 (`4' in the example above) of an expression we had suspended.
9116 We can use the information on the stack to recover the LHS (`3')
9117 from the stack together with the tree code (`MULT_EXPR'), and
9118 the precedence of the higher level subexpression
9119 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9120 which will be used to actually build the additive expression. */
9125 }
9127 /* Undo the disabling of warnings done above. */
9129 c_inhibit_evaluation_warnings -=
9132 c_inhibit_evaluation_warnings -=
9138 /* Avoid warning for !!x == y. */
9143 /* Avoid warning for !b == y where b is boolean. */
9147 /* Avoid warning for !!b == y where b is boolean. */
9160 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9161 ERROR_MARK for everything that is not a binary expression.
9162 This makes warn_about_parentheses miss some warnings that
9163 involve unary operators. For unary expressions we should
9164 pass the correct tree_code unless the unary expression was
9165 surrounded by parentheses.
9166 */
9173 == tcc_comparison
9176 else
9177 {
9182 /* TODO: build_x_binary_op doesn't always honor the location. */
9184 }
9187 /* If the binary operator required the use of an overloaded operator,
9188 then this expression cannot be an integral constant-expression.
9189 An overloaded operator can be used even if both operands are
9190 otherwise permissible in an integral constant-expression if at
9191 least one of the operands is of enumeration type. */
9195 NIC_OVERLOADED))
9197 }
9200 }
9202 static cp_expr
9207 {
9210 }
9212 /* Parse the `? expression : assignment-expression' part of a
9213 conditional-expression. The LOGICAL_OR_EXPR is the
9214 logical-or-expression that started the conditional-expression.
9215 Returns a representation of the entire conditional-expression.
9217 This routine is used by cp_parser_assignment_expression.
9219 ? expression : assignment-expression
9221 GNU Extensions:
9223 ? : assignment-expression */
9225 static tree
9227 {
9229 cp_expr assignment_expr;
9233 /* Consume the `?' token. */
9238 {
9241 /* Implicit true clause. */
9243 c_inhibit_evaluation_warnings +=
9246 }
9247 else
9248 {
9251 /* Parse the expression. */
9252 c_inhibit_evaluation_warnings +=
9255 c_inhibit_evaluation_warnings +=
9259 }
9261 /* The next token should be a `:'. */
9263 /* Parse the assignment-expression. */
9265 c_inhibit_evaluation_warnings -=
9268 /* Make a location:
9269 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9270 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9271 with the caret at the "?", ranging from the start of
9272 the logical_or_expr to the end of the assignment_expr. */
9277 /* Build the conditional-expression. */
9279 expr,
9280 assignment_expr,
9281 tf_warning_or_error);
9282 }
9284 /* Parse an assignment-expression.
9286 assignment-expression:
9287 conditional-expression
9288 logical-or-expression assignment-operator assignment_expression
9289 throw-expression
9291 CAST_P is true if this expression is the target of a cast.
9292 DECLTYPE_P is true if this expression is the operand of decltype.
9294 Returns a representation for the expression. */
9296 static cp_expr
9299 {
9300 cp_expr expr;
9302 /* If the next token is the `throw' keyword, then we're looking at
9303 a throw-expression. */
9306 /* Otherwise, it must be that we are looking at a
9307 logical-or-expression. */
9308 else
9309 {
9310 /* Parse the binary expressions (logical-or-expression). */
9312 decltype_p,
9314 /* If the next token is a `?' then we're actually looking at a
9315 conditional-expression. */
9318 else
9319 {
9322 /* If it's an assignment-operator, we're using the second
9323 production. */
9324 enum tree_code assignment_operator
9327 {
9330 /* Parse the right-hand side of the assignment. */
9337 /* An assignment may not appear in a
9338 constant-expression. */
9340 NIC_ASSIGNMENT))
9342 /* Build the assignment expression. Its default
9343 location:
9344 LHS = RHS
9345 ~~~~^~~~~
9346 is the location of the '=' token as the
9347 caret, ranging from the start of the lhs to the
9348 end of the rhs. */
9353 assignment_operator,
9354 rhs,
9356 /* TODO: build_x_modify_expr doesn't honor the location,
9357 so we must set it here. */
9359 }
9360 }
9361 }
9364 }
9366 /* Parse an (optional) assignment-operator.
9368 assignment-operator: one of
9369 = *= /= %= += -= >>= <<= &= ^= |=
9371 GNU Extension:
9373 assignment-operator: one of
9374 <?= >?=
9376 If the next token is an assignment operator, the corresponding tree
9377 code is returned, and the token is consumed. For example, for
9378 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9379 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9380 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9381 operator, ERROR_MARK is returned. */
9383 static enum tree_code
9385 {
9389 /* Peek at the next token. */
9393 {
9439 /* Nothing else is an assignment operator. */
9441 }
9443 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9448 /* If it was an assignment operator, consume it. */
9453 }
9455 /* Parse an expression.
9457 expression:
9458 assignment-expression
9459 expression , assignment-expression
9461 CAST_P is true if this expression is the target of a cast.
9462 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9463 except possibly parenthesized or on the RHS of a comma (N3276).
9465 Returns a representation of the expression. */
9467 static cp_expr
9470 {
9475 {
9476 cp_expr assignment_expression;
9478 /* Parse the next assignment-expression. */
9479 assignment_expression
9482 /* We don't create a temporary for a call that is the immediate operand
9483 of decltype or on the RHS of a comma. But when we see a comma, we
9484 need to create a temporary for a call on the LHS. */
9489 assignment_expression
9493 /* If this is the first assignment-expression, we can just
9494 save it away. */
9497 else
9498 {
9499 /* Create a location with caret at the comma, ranging
9500 from the start of the LHS to the end of the RHS. */
9505 assignment_expression,
9508 }
9509 /* If the next token is not a comma, or we're in a fold-expression, then
9510 we are done with the expression. */
9514 /* Consume the `,'. */
9517 /* A comma operator cannot appear in a constant-expression. */
9520 }
9523 }
9525 /* Parse a constant-expression.
9527 constant-expression:
9528 conditional-expression
9530 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9531 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9532 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9533 is false, NON_CONSTANT_P should be NULL. */
9535 static cp_expr
9539 {
9543 cp_expr expression;
9545 /* It might seem that we could simply parse the
9546 conditional-expression, and then check to see if it were
9547 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9548 one that the compiler can figure out is constant, possibly after
9549 doing some simplifications or optimizations. The standard has a
9550 precise definition of constant-expression, and we must honor
9551 that, even though it is somewhat more restrictive.
9553 For example:
9555 int i[(2, 3)];
9557 is not a legal declaration, because `(2, 3)' is not a
9558 constant-expression. The `,' operator is forbidden in a
9559 constant-expression. However, GCC's constant-folding machinery
9560 will fold this operation to an INTEGER_CST for `3'. */
9562 /* Save the old settings. */
9564 saved_allow_non_integral_constant_expression_p
9567 /* We are now parsing a constant-expression. */
9569 parser->allow_non_integral_constant_expression_p
9572 /* Although the grammar says "conditional-expression", we parse an
9573 "assignment-expression", which also permits "throw-expression"
9574 and the use of assignment operators. In the case that
9575 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9576 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9577 actually essential that we look for an assignment-expression.
9578 For example, cp_parser_initializer_clauses uses this function to
9579 determine whether a particular assignment-expression is in fact
9580 constant. */
9582 /* Restore the old settings. */
9583 parser->integral_constant_expression_p
9585 parser->allow_non_integral_constant_expression_p
9588 {
9589 /* Require an rvalue constant expression here; that's what our
9590 callers expect. Reference constant expressions are handled
9591 separately in e.g. cp_parser_template_argument. */
9600 }
9603 parser->non_integral_constant_expression_p
9607 }
9609 /* Parse __builtin_offsetof.
9611 offsetof-expression:
9612 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9614 offsetof-member-designator:
9615 id-expression
9616 | offsetof-member-designator "." id-expression
9617 | offsetof-member-designator "[" expression "]"
9618 | offsetof-member-designator "->" id-expression */
9620 static cp_expr
9622 {
9624 tree type;
9625 cp_expr expr;
9626 cp_id_kind dummy;
9628 location_t finish_loc;
9630 /* We're about to accept non-integral-constant things, but will
9631 definitely yield an integral constant expression. Save and
9632 restore these values around our local parsing. */
9638 /* Consume the "__builtin_offsetof" token. */
9640 /* Consume the opening `('. */
9642 /* Parse the type-id. */
9645 /* Look for the `,'. */
9649 /* Build the (type *)null that begins the traditional offsetof macro. */
9650 tree object_ptr
9652 tf_warning_or_error);
9654 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9658 {
9661 {
9663 /* offsetof-member-designator "[" expression "]" */
9669 /* offsetof-member-designator "->" identifier */
9672 /* FALLTHRU */
9675 /* offsetof-member-designator "." identifier */
9683 /* Consume the ")" token. */
9689 /* Error. We know the following require will fail, but
9690 that gives the proper error message. */
9695 }
9696 }
9698 success:
9699 /* Make a location of the form:
9700 __builtin_offsetof (struct s, f)
9701 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9702 with caret at the type-id, ranging from the start of the
9703 "_builtin_offsetof" token to the close paren. */
9705 /* The result will be an INTEGER_CST, so we need to explicitly
9706 preserve the location. */
9709 failure:
9714 }
9716 /* Parse a trait expression.
9718 Returns a representation of the expression, the underlying type
9719 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9721 static tree
9723 {
9724 cp_trait_kind kind;
9730 {
9832 }
9834 /* Consume the token. */
9839 {
9842 }
9848 {
9851 {
9854 }
9858 }
9860 {
9862 {
9866 {
9869 }
9873 }
9874 }
9878 /* Complete the trait expression, which may mean either processing
9879 the trait expr now or saving it for template instantiation. */
9881 {
9890 }
9891 }
9893 /* Lambdas that appear in variable initializer or default argument scope
9894 get that in their mangling, so we need to record it. We might as well
9895 use the count for function and namespace scopes as well. */
9899 {
9900 tree t;
9902 };
9905 static void
9907 {
9908 tree_int ti;
9910 /* Once we're inside a function, we ignore other scopes and just push
9911 the function again so that popping works properly. */
9918 {
9919 /* Don't reset the count if we're still in the same function. */
9922 }
9923 }
9925 static void
9927 {
9930 }
9932 static void
9934 {
9937 {
9940 }
9942 }
9944 /* Parse a lambda expression.
9946 lambda-expression:
9947 lambda-introducer lambda-declarator [opt] compound-statement
9949 Returns a representation of the expression. */
9951 static cp_expr
9953 {
9955 tree type;
9963 {
9965 {
9969 }
9971 }
9973 {
9975 {
9978 }
9980 }
9982 /* We may be in the middle of deferred access check. Disable
9983 it now. */
9994 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9997 /* Now that we've started the type, add the capture fields for any
9998 explicit captures. */
10001 {
10002 /* Inside the class, surrounding template-parameter-lists do not apply. */
10003 unsigned int saved_num_template_parameter_lists
10007 bool fully_implicit_function_template_p
10011 bool auto_is_implicit_function_template_parm_p
10022 /* By virtue of defining a local class, a lambda expression has access to
10023 the private variables of enclosing classes. */
10031 {
10036 }
10038 {
10041 }
10043 /* The capture list was built up in reverse order; fix that now. */
10055 parser->fully_implicit_function_template_p
10059 parser->auto_is_implicit_function_template_parm_p
10061 }
10063 /* This field is only used during parsing of the lambda. */
10066 /* This lambda shouldn't have any proxies left at this point. */
10068 /* And now that we're done, push proxies for an enclosing lambda. */
10073 else
10081 }
10083 /* Parse the beginning of a lambda expression.
10085 lambda-introducer:
10086 [ lambda-capture [opt] ]
10088 LAMBDA_EXPR is the current representation of the lambda expression. */
10090 static void
10092 {
10093 /* Need commas after the first capture. */
10096 /* Eat the leading `['. */
10099 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10107 {
10110 }
10113 {
10115 tree capture_id;
10116 tree capture_init_expr;
10120 enum capture_kind_type
10121 {
10122 BY_COPY,
10123 BY_REFERENCE
10124 };
10128 {
10131 }
10135 else
10138 /* Possibly capture `this'. */
10140 {
10150 explicit_init_p);
10152 }
10154 /* Possibly capture `*this'. */
10157 {
10168 explicit_init_p);
10170 }
10172 /* Remember whether we want to capture as a reference or not. */
10174 {
10177 }
10179 /* Get the identifier. */
10184 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10185 delimiters, but I modified this to stop on unnested ']' as well. It
10186 was already changed to stop on unnested '}', so the
10187 "closing_parenthesis" name is no more misleading with my change. */
10188 {
10194 }
10196 /* Find the initializer for this capture. */
10200 {
10202 /* An explicit initializer exists. */
10205 "lambda capture initializers "
10211 {
10214 }
10215 }
10216 else
10217 {
10220 /* Turn the identifier into an id-expression. */
10221 capture_init_expr
10226 {
10229 }
10233 {
10236 capture_init_expr);
10240 }
10243 {
10246 capture_init_expr))
10250 }
10252 capture_init_expr
10253 = finish_id_expression
10255 capture_init_expr,
10269 {
10272 }
10273 else
10275 }
10279 {
10284 capture_id);
10288 "capture of %qD redundant with by-reference capture "
10290 }
10293 capture_id,
10294 capture_init_expr,
10296 explicit_init_p);
10297 }
10300 }
10302 /* Parse the (optional) middle of a lambda expression.
10304 lambda-declarator:
10305 < template-parameter-list [opt] >
10306 ( parameter-declaration-clause [opt] )
10307 attribute-specifier [opt]
10308 decl-specifier-seq [opt]
10309 exception-specification [opt]
10310 lambda-return-type-clause [opt]
10312 LAMBDA_EXPR is the current representation of the lambda expression. */
10314 static bool
10316 {
10317 /* 5.1.1.4 of the standard says:
10318 If a lambda-expression does not include a lambda-declarator, it is as if
10319 the lambda-declarator were ().
10320 This means an empty parameter list, no attributes, and no exception
10321 specification. */
10327 cp_decl_specifier_seq lambda_specs;
10330 /* The template-parameter-list is optional, but must begin with
10331 an opening angle if present. */
10333 {
10336 "lambda templates are only available with "
10338 else
10348 /* We just processed one more parameter list. */
10350 }
10352 /* The parameter-declaration-clause is optional (unless
10353 template-parameter-list was given), but must begin with an
10354 opening parenthesis if present. */
10356 {
10361 /* Parse parameters. */
10364 /* Default arguments shall not be specified in the
10365 parameter-declaration-clause of a lambda-declarator. */
10376 /* In the decl-specifier-seq of the lambda-declarator, each
10377 decl-specifier shall either be mutable or constexpr. */
10381 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10384 {
10389 }
10393 /* Parse optional exception specification. */
10396 /* Parse optional trailing return type. */
10398 {
10402 }
10404 /* The function parameters must be in scope all the way until after the
10405 trailing-return-type in case of decltype. */
10407 }
10411 /* Create the function call operator.
10413 Messing with declarators like this is no uglier than building up the
10414 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10415 other code. */
10416 {
10417 cp_decl_specifier_seq return_type_specs;
10419 tree fco;
10426 else
10427 /* Maybe we will deduce the return type later. */
10431 {
10435 else
10438 }
10443 sfk_none);
10448 VIRT_SPEC_UNSPECIFIED,
10449 REF_QUAL_NONE,
10450 tx_qual,
10451 exception_spec,
10457 declarator,
10458 attributes);
10460 {
10463 /* Give the object parameter a different name. */
10467 }
10469 {
10473 }
10482 }
10483 }
10485 /* Parse the body of a lambda expression, which is simply
10487 compound-statement
10489 but which requires special handling.
10490 LAMBDA_EXPR is the current representation of the lambda expression. */
10492 static void
10494 {
10499 else
10500 /* Still increment function_depth so that we don't GC in the
10501 middle of an expression. */
10505 /* Clear this in case we're in the middle of a default argument. */
10508 /* Finish the function call operator
10509 - class_specifier
10510 + late_parsing_for_member
10511 + function_definition_after_declarator
10512 + ctor_initializer_opt_and_function_body */
10513 {
10515 tree body;
10517 tree compound_stmt;
10518 tree cap;
10520 /* Let the front end know that we are going to be defining this
10521 function. */
10523 NULL_TREE,
10532 /* Push the proxies for any explicit captures. */
10539 /* 5.1.1.4 of the standard says:
10540 If a lambda-expression does not include a trailing-return-type, it
10541 is as if the trailing-return-type denotes the following type:
10542 * if the compound-statement is of the form
10543 { return attribute-specifier [opt] expression ; }
10544 the type of the returned expression after lvalue-to-rvalue
10545 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10546 (_conv.array_ 4.2), and function-to-pointer conversion
10547 (_conv.func_ 4.3);
10548 * otherwise, void. */
10550 /* In a lambda that has neither a lambda-return-type-clause
10551 nor a deducible form, errors should be reported for return statements
10552 in the body. Since we used void as the placeholder return type, parsing
10553 the body as usual will give such desired behavior. */
10557 {
10561 /* Parse tentatively in case there's more after the initial return
10562 statement. */
10573 {
10575 {
10580 }
10582 /* Will get error here if type not deduced yet. */
10586 }
10587 }
10590 {
10595 }
10599 out:
10603 /* Finish the function and generate code for it if necessary. */
10606 /* Only expand if the call op is not a template. */
10609 }
10615 else
10617 }
10619 /* Statements [gram.stmt.stmt] */
10621 /* Parse a statement.
10623 statement:
10624 labeled-statement
10625 expression-statement
10626 compound-statement
10627 selection-statement
10628 iteration-statement
10629 jump-statement
10630 declaration-statement
10631 try-block
10633 C++11:
10635 statement:
10636 labeled-statement
10637 attribute-specifier-seq (opt) expression-statement
10638 attribute-specifier-seq (opt) compound-statement
10639 attribute-specifier-seq (opt) selection-statement
10640 attribute-specifier-seq (opt) iteration-statement
10641 attribute-specifier-seq (opt) jump-statement
10642 declaration-statement
10643 attribute-specifier-seq (opt) try-block
10645 init-statement:
10646 expression-statement
10647 simple-declaration
10649 TM Extension:
10651 statement:
10652 atomic-statement
10654 IN_COMPOUND is true when the statement is nested inside a
10655 cp_parser_compound_statement; this matters for certain pragmas.
10657 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10658 is a (possibly labeled) if statement which is not enclosed in braces
10659 and has an else clause. This is used to implement -Wparentheses.
10661 CHAIN is a vector of if-else-if conditions. */
10663 static void
10667 {
10672 restart:
10675 /* There is no statement yet. */
10681 /* In obj-c++, seeing '[[' might be the either the beginning of
10682 c++11 attributes, or a nested objc-message-expression. So
10683 let's parse the c++11 attributes tentatively. */
10687 {
10690 }
10692 /* Peek at the next token. */
10694 /* Remember the location of the first token in the statement. */
10696 /* If this is a keyword, then that will often determine what kind of
10697 statement we have. */
10699 {
10703 {
10706 /* Looks like a labeled-statement with a case label.
10707 Parse the label, and then use tail recursion to parse
10708 the statement. */
10726 {
10731 }
10732 else
10746 {
10751 }
10752 else
10753 {
10757 }
10761 /* Objective-C++ exception-handling constructs. */
10775 /* This must be a namespace alias definition. */
10791 /* It might be a keyword like `int' that can start a
10792 declaration-statement. */
10794 }
10795 }
10797 {
10798 /* If the next token is a `:', then we are looking at a
10799 labeled-statement. */
10802 {
10803 /* Looks like a labeled-statement with an ordinary label.
10804 Parse the label, and then use tail recursion to parse
10805 the statement. */
10810 }
10811 }
10812 /* Anything that starts with a `{' must be a compound-statement. */
10815 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10816 a statement all its own. */
10818 {
10819 /* Only certain OpenMP pragmas are attached to statements, and thus
10820 are considered statements themselves. All others are not. In
10821 the context of a compound, accept the pragma as a "statement" and
10822 return so that we can check for a close brace. Otherwise we
10823 require a real statement and must go back and read one. */
10829 }
10831 {
10834 }
10836 /* Everything else must be a declaration-statement or an
10837 expression-statement. Try for the declaration-statement
10838 first, unless we are looking at a `;', in which case we know that
10839 we have an expression-statement. */
10841 {
10843 {
10845 {
10846 /* Attributes should be parsed as part of the the
10847 declaration, so let's un-parse them. */
10850 }
10853 /* Try to parse the declaration-statement. */
10855 /* If that worked, we're done. */
10858 }
10859 /* All preceding labels have been parsed at this point. */
10863 /* Look for an expression-statement instead. */
10866 /* Handle [[fallthrough]];. */
10868 {
10869 /* The next token after the fallthrough attribute is ';'. */
10871 {
10872 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10874 IFN_FALLTHROUGH,
10877 }
10878 else
10882 }
10883 }
10885 /* Set the line number for the statement. */
10889 /* Allow "[[fallthrough]];", but warn otherwise. */
10892 OPT_Wattributes,
10894 }
10896 /* Parse the label for a labeled-statement, i.e.
10898 identifier :
10899 case constant-expression :
10900 default :
10902 GNU Extension:
10903 case constant-expression ... constant-expression : statement
10905 When a label is parsed without errors, the label is added to the
10906 parse tree by the finish_* functions, so this function doesn't
10907 have to return the label. */
10909 static void
10911 {
10916 /* The next token should be an identifier. */
10920 {
10923 }
10925 /* Remember whether this case or a user-defined label is allowed to fall
10926 through to. */
10931 {
10933 {
10937 /* Consume the `case' token. */
10939 /* Parse the constant-expression. */
10946 {
10947 /* Consume the `...' token. */
10953 /* We don't need to emit warnings here, as the common code
10954 will do this for us. */
10955 }
10956 else
10960 {
10964 }
10965 else
10968 expr);
10969 }
10973 /* Consume the `default' token. */
10977 {
10981 }
10982 else
10987 /* Anything else must be an ordinary label. */
10992 }
10994 /* Require the `:' token. */
10997 /* An ordinary label may optionally be followed by attributes.
10998 However, this is only permitted if the attributes are then
10999 followed by a semicolon. This is because, for backward
11000 compatibility, when parsing
11001 lab: __attribute__ ((unused)) int i;
11002 we want the attribute to attach to "i", not "lab". */
11005 {
11006 tree attrs;
11013 ;
11014 else
11016 }
11022 }
11024 /* Parse an expression-statement.
11026 expression-statement:
11027 expression [opt] ;
11029 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11030 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11031 indicates whether this expression-statement is part of an
11032 expression statement. */
11034 static tree
11036 {
11041 /* There might be attribute fallthrough. */
11044 /* If the next token is a ';', then there is no expression
11045 statement. */
11047 {
11051 {
11054 }
11055 }
11057 /* Handle [[fallthrough]];. */
11059 {
11060 /* The next token after the fallthrough attribute is ';'. */
11062 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11065 else
11069 }
11071 /* Allow "[[fallthrough]];", but warn otherwise. */
11076 /* Give a helpful message for "A<T>::type t;" and the like. */
11079 {
11086 {
11087 /* A::A a; */
11092 }
11093 }
11095 /* Consume the final `;'. */
11100 /* This is the final expression statement of a statement
11101 expression. */
11107 }
11109 /* Parse a compound-statement.
11111 compound-statement:
11112 { statement-seq [opt] }
11114 GNU extension:
11116 compound-statement:
11117 { label-declaration-seq [opt] statement-seq [opt] }
11119 label-declaration-seq:
11120 label-declaration
11121 label-declaration-seq label-declaration
11123 Returns a tree representing the statement. */
11125 static tree
11128 {
11129 tree compound_stmt;
11131 /* Consume the `{'. */
11138 /* Begin the compound-statement. */
11140 /* If the next keyword is `__label__' we have a label declaration. */
11143 /* Parse an (optional) statement-seq. */
11145 /* Finish the compound-statement. */
11147 /* Consume the `}'. */
11151 }
11153 /* Parse an (optional) statement-seq.
11155 statement-seq:
11156 statement
11157 statement-seq [opt] statement */
11159 static void
11161 {
11162 /* Scan statements until there aren't any more. */
11164 {
11167 /* If we are looking at a `}', then we have run out of
11168 statements; the same is true if we have reached the end
11169 of file, or have stumbled upon a stray '@end'. */
11176 /* If we are in a compound statement and find 'else' then
11177 something went wrong. */
11179 {
11182 else
11183 {
11186 }
11187 }
11189 /* Parse the statement. */
11191 }
11192 }
11194 /* Return true if we're looking at (init; cond), false otherwise. */
11196 static bool
11198 {
11199 /* Save tokens so that we can put them back. */
11202 /* Look for ';' that is not nested in () or {}. */
11205 CPP_SEMICOLON,
11208 /* Roll back the tokens we skipped. */
11212 }
11214 /* Parse a selection-statement.
11216 selection-statement:
11217 if ( init-statement [opt] condition ) statement
11218 if ( init-statement [opt] condition ) statement else statement
11219 switch ( init-statement [opt] condition ) statement
11221 Returns the new IF_STMT or SWITCH_STMT.
11223 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11224 is a (possibly labeled) if statement which is not enclosed in
11225 braces and has an else clause. This is used to implement
11226 -Wparentheses.
11228 CHAIN is a vector of if-else-if conditions. This is used to implement
11229 -Wduplicated-cond. */
11231 static tree
11234 {
11237 token_indent_info guard_tinfo;
11242 /* Peek at the next token. */
11246 /* See what kind of keyword it is. */
11249 {
11252 {
11253 tree statement;
11254 tree condition;
11259 RID_CONSTEXPR))
11260 {
11266 }
11268 /* Look for the `('. */
11270 {
11273 }
11275 /* Begin the selection-statement. */
11277 {
11280 }
11281 else
11284 /* Parse the optional init-statement. */
11286 {
11287 tree decl;
11290 "init-statement in selection statements only available "
11293 }
11295 /* Parse the condition. */
11297 /* Look for the `)'. */
11303 {
11307 /* Add the condition. */
11314 /* Parse the then-clause. */
11318 /* Outside a template, the non-selected branch of a constexpr
11319 if is a 'discarded statement', i.e. unevaluated. */
11324 {
11327 }
11330 guard_tinfo);
11337 {
11341 }
11343 /* If the next token is `else', parse the else-clause. */
11345 RID_ELSE))
11346 {
11350 {
11353 }
11355 guard_tinfo
11357 /* Consume the `else' keyword. */
11360 {
11362 RID_IF)
11364 {
11365 /* We've got "if (COND) else if (COND2)". Start
11366 the condition chain and add COND as the first
11367 element. */
11371 {
11372 /* Wrap it in a NOP_EXPR so that we can set the
11373 location of the condition. */
11375 condition);
11378 }
11379 }
11381 RID_IF))
11382 {
11383 /* This is if-else without subsequent if. Zap the
11384 condition chain; we would have already warned at
11385 this point. */
11388 }
11389 }
11391 /* Parse the else-clause. */
11397 /* If we are currently parsing a then-clause, then
11398 IF_P will not be NULL. We set it to true to
11399 indicate that this if statement has an else clause.
11400 This may trigger the Wparentheses warning below
11401 when we get back up to the parent if statement. */
11406 {
11410 }
11411 }
11412 else
11413 {
11414 /* This if statement does not have an else clause. If
11415 NESTED_IF is true, then the then-clause has an if
11416 statement which does have an else clause. We warn
11417 about the potential ambiguity. */
11420 "suggest explicit braces to avoid ambiguous"
11423 {
11424 /* We don't need the condition chain anymore. */
11427 }
11428 }
11430 /* Now we're all done with the if-statement. */
11432 }
11433 else
11434 {
11438 /* Add the condition. */
11441 /* Parse the body of the switch-statement. */
11447 guard_tinfo);
11451 /* Now we're all done with the switch-statement. */
11453 }
11456 }
11462 }
11463 }
11465 /* Parse a condition.
11467 condition:
11468 expression
11469 type-specifier-seq declarator = initializer-clause
11470 type-specifier-seq declarator braced-init-list
11472 GNU Extension:
11474 condition:
11475 type-specifier-seq declarator asm-specification [opt]
11476 attributes [opt] = assignment-expression
11478 Returns the expression that should be tested. */
11480 static tree
11482 {
11483 cp_decl_specifier_seq type_specifiers;
11487 /* Try the declaration first. */
11489 /* New types are not allowed in the type-specifier-seq for a
11490 condition. */
11492 parser->type_definition_forbidden_message
11494 /* Parse the type-specifier-seq. */
11496 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11499 /* Restore the saved message. */
11501 /* If all is well, we might be looking at a declaration. */
11503 {
11504 tree decl;
11505 tree asm_specification;
11506 tree attributes;
11510 /* Parse the declarator. */
11516 /* Parse the attributes. */
11518 /* Parse the asm-specification. */
11520 /* If the next token is not an `=' or '{', then we might still be
11521 looking at an expression. For example:
11523 if (A(a).x)
11525 looks like a decl-specifier-seq and a declarator -- but then
11526 there is no `=', so this is an expression. */
11531 /* If we did see an `=' or '{', then we are looking at a declaration
11532 for sure. */
11534 {
11535 tree pushed_scope;
11539 /* Create the declaration. */
11545 /* Parse the initializer. */
11547 {
11551 }
11552 else
11553 {
11554 /* Consume the `='. */
11557 }
11561 /* Process the initializer. */
11564 asm_specification,
11565 flags);
11571 }
11572 }
11573 /* If we didn't even get past the declarator successfully, we are
11574 definitely not looking at a declaration. */
11575 else
11578 /* Otherwise, we are looking at an expression. */
11580 }
11582 /* Parses a for-statement or range-for-statement until the closing ')',
11583 not included. */
11585 static tree
11587 {
11591 /* Begin the for-statement. */
11594 /* Parse the initialization. */
11599 else
11601 }
11603 static tree
11605 {
11606 /* Normal for loop */
11609 tree stmt;
11612 /* The init-statement has already been parsed in
11613 cp_parser_init_statement, so no work is needed here. */
11616 /* If there's a condition, process it. */
11620 {
11624 }
11626 /* Look for the `;'. */
11629 /* If there's an expression, process it. */
11635 }
11637 /* Tries to parse a range-based for-statement:
11639 range-based-for:
11640 decl-specifier-seq declarator : expression
11642 The decl-specifier-seq declarator and the `:' are already parsed by
11643 cp_parser_init_statement. If processing_template_decl it returns a
11644 newly created RANGE_FOR_STMT; if not, it is converted to a
11645 regular FOR_STMT. */
11647 static tree
11650 {
11657 /* Get the range declaration momentarily out of the way so that
11658 the range expression doesn't clash with it. */
11660 {
11662 {
11664 /* For decomposition declaration get all of the corresponding
11665 declarations out of the way. */
11669 {
11675 {
11681 }
11682 }
11683 }
11685 {
11690 }
11691 }
11694 {
11697 }
11698 else
11701 /* Put the range declaration(s) back into scope. */
11703 {
11707 }
11709 /* If in template, STMT is converted to a normal for-statement
11710 at instantiation. If not, it is done just ahead. */
11712 {
11720 /* do_auto_deduction doesn't mess with template init-lists. */
11723 }
11724 else
11725 {
11729 }
11731 }
11733 /* Subroutine of cp_convert_range_for: given the initializer expression,
11734 builds up the range temporary. */
11736 static tree
11738 {
11741 /* Find out the type deduced by the declaration
11742 `auto &&__range = range_expr'. */
11747 /* Create the __range variable. */
11754 }
11756 /* Used by cp_parser_range_for in template context: we aren't going to
11757 do a full conversion yet, but we still need to resolve auto in the
11758 type of the for-range-declaration if present. This is basically
11759 a shortcut version of cp_convert_range_for. */
11761 static void
11763 {
11766 {
11769 iter_type = (cp_parser_perform_range_for_lookup
11772 {
11774 iter_type);
11776 tf_warning_or_error);
11779 }
11780 }
11781 }
11783 /* Converts a range-based for-statement into a normal
11784 for-statement, as per the definition.
11786 for (RANGE_DECL : RANGE_EXPR)
11787 BLOCK
11789 should be equivalent to:
11791 {
11792 auto &&__range = RANGE_EXPR;
11793 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11794 __begin != __end;
11795 ++__begin)
11796 {
11797 RANGE_DECL = *__begin;
11798 BLOCK
11799 }
11800 }
11802 If RANGE_EXPR is an array:
11803 BEGIN_EXPR = __range
11804 END_EXPR = __range + ARRAY_SIZE(__range)
11805 Else if RANGE_EXPR has a member 'begin' or 'end':
11806 BEGIN_EXPR = __range.begin()
11807 END_EXPR = __range.end()
11808 Else:
11809 BEGIN_EXPR = begin(__range)
11810 END_EXPR = end(__range);
11812 If __range has a member 'begin' but not 'end', or vice versa, we must
11813 still use the second alternative (it will surely fail, however).
11814 When calling begin()/end() in the third alternative we must use
11815 argument dependent lookup, but always considering 'std' as an associated
11816 namespace. */
11818 tree
11822 {
11828 /* If an error happened previously do nothing or else a lot of
11829 unhelpful errors would be issued. */
11831 else
11832 {
11833 tree range_temp;
11837 /* Can't bind a reference to an array of runtime bound. */
11839 else
11840 {
11845 LOOKUP_ONLYCONVERTING);
11847 }
11850 }
11852 /* The new for initialization statement. */
11860 LOOKUP_ONLYCONVERTING);
11871 LOOKUP_ONLYCONVERTING);
11875 /* The new for condition. */
11882 /* The new increment expression. */
11885 tf_warning_or_error);
11888 /* The declaration is initialized with *__begin inside the loop body. */
11891 tf_warning_or_error),
11893 LOOKUP_ONLYCONVERTING);
11898 }
11900 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11901 We need to solve both at the same time because the method used
11902 depends on the existence of members begin or end.
11903 Returns the type deduced for the iterator expression. */
11905 static tree
11907 {
11909 {
11912 }
11915 {
11920 }
11922 {
11923 /* If RANGE is an array, we will use pointer arithmetic. */
11926 range,
11930 }
11931 else
11932 {
11933 /* If it is not an array, we must do a bit of magic. */
11943 tf_warning_or_error);
11946 tf_warning_or_error);
11949 {
11950 /* Use the member functions. */
11953 else
11959 else
11962 }
11963 else
11964 {
11965 /* Use global functions with ADL. */
11972 tf_warning_or_error);
11974 tf_warning_or_error);
11976 tf_warning_or_error);
11978 tf_warning_or_error);
11981 }
11983 /* Last common checks. */
11985 {
11986 /* If one of the expressions is an error do no more checks. */
11989 }
11992 /* Can happen, when, eg, in a template context, Koenig lookup
11993 can't resolve begin/end (c++/58503). */
11995 else
11996 {
11998 /* The unqualified type of the __begin and __end temporaries should
11999 be the same, as required by the multiple auto declaration. */
12001 {
12008 /* P0184R0 allows __begin and __end to have different types,
12009 but make sure they are comparable so we can give a better
12011 else
12015 }
12017 }
12018 }
12019 }
12021 /* Helper function for cp_parser_perform_range_for_lookup.
12022 Builds a tree for RANGE.IDENTIFIER(). */
12024 static tree
12026 {
12039 tf_warning_or_error);
12042 }
12044 /* Parse an iteration-statement.
12046 iteration-statement:
12047 while ( condition ) statement
12048 do statement while ( expression ) ;
12049 for ( init-statement condition [opt] ; expression [opt] )
12050 statement
12052 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12054 static tree
12056 {
12059 tree statement;
12061 token_indent_info guard_tinfo;
12063 /* Peek at the next token. */
12070 /* Remember whether or not we are already within an iteration
12071 statement. */
12074 /* See what kind of keyword it is. */
12077 {
12079 {
12080 tree condition;
12082 /* Begin the while-statement. */
12084 /* Look for the `('. */
12086 /* Parse the condition. */
12089 /* Look for the `)'. */
12091 /* Parse the dependent statement. */
12095 /* We're done with the while-statement. */
12097 }
12101 {
12102 tree expression;
12104 /* Begin the do-statement. */
12106 /* Parse the body of the do-statement. */
12111 /* Look for the `while' keyword. */
12113 /* Look for the `('. */
12115 /* Parse the expression. */
12117 /* We're done with the do-statement. */
12119 /* Look for the `)'. */
12121 /* Look for the `;'. */
12123 }
12127 {
12128 /* Look for the `('. */
12133 /* Look for the `)'. */
12136 /* Parse the body of the for-statement. */
12141 /* We're done with the for-statement. */
12143 }
12150 }
12153 }
12155 /* Parse a init-statement or the declarator of a range-based-for.
12156 Returns true if a range-based-for declaration is seen.
12158 init-statement:
12159 expression-statement
12160 simple-declaration */
12162 static bool
12164 {
12165 /* If the next token is a `;', then we have an empty
12166 expression-statement. Grammatically, this is also a
12167 simple-declaration, but an invalid one, because it does not
12168 declare anything. Therefore, if we did not handle this case
12169 specially, we would issue an error message about an invalid
12170 declaration. */
12172 {
12176 /* A colon is used in range-based for. */
12179 /* We're going to speculatively look for a declaration, falling back
12180 to an expression, if necessary. */
12182 /* Parse the declaration. */
12185 decl);
12188 {
12189 /* It is a range-for, consume the ':' */
12193 {
12195 "range-based %<for%> loops only available with "
12198 }
12199 }
12200 else
12201 /* The ';' is not consumed yet because we told
12202 cp_parser_simple_declaration not to. */
12207 /* If the tentative parse failed, then we shall need to look for an
12208 expression-statement. */
12209 }
12210 /* If we are here, it is an expression-statement. */
12213 }
12215 /* Parse a jump-statement.
12217 jump-statement:
12218 break ;
12219 continue ;
12220 return expression [opt] ;
12221 return braced-init-list ;
12222 goto identifier ;
12224 GNU extension:
12226 jump-statement:
12227 goto * expression ;
12229 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12231 static tree
12233 {
12239 /* Peek at the next token. */
12244 /* See what kind of keyword it is. */
12247 {
12251 {
12271 }
12277 {
12284 /* Fall through. */
12294 }
12299 {
12300 tree expr;
12304 {
12308 }
12311 else
12312 /* If the next token is a `;', then there is no
12313 expression. */
12315 /* Build the return-statement. */
12318 else
12320 /* Look for the final `;'. */
12322 }
12328 {
12331 }
12333 /* Create the goto-statement. */
12335 {
12336 /* Issue a warning about this use of a GNU extension. */
12338 /* Consume the '*' token. */
12340 /* Parse the dependent expression. */
12342 }
12343 else
12345 /* Look for the final `;'. */
12352 }
12355 }
12357 /* Parse a declaration-statement.
12359 declaration-statement:
12360 block-declaration */
12362 static void
12364 {
12367 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12370 /* Parse the block-declaration. */
12373 /* Free any declarators allocated. */
12375 }
12377 /* Some dependent statements (like `if (cond) statement'), are
12378 implicitly in their own scope. In other words, if the statement is
12379 a single statement (as opposed to a compound-statement), it is
12380 none-the-less treated as if it were enclosed in braces. Any
12381 declarations appearing in the dependent statement are out of scope
12382 after control passes that point. This function parses a statement,
12383 but ensures that is in its own scope, even if it is not a
12384 compound-statement.
12386 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12387 is a (possibly labeled) if statement which is not enclosed in
12388 braces and has an else clause. This is used to implement
12389 -Wparentheses.
12391 CHAIN is a vector of if-else-if conditions. This is used to implement
12392 -Wduplicated-cond.
12394 Returns the new statement. */
12396 static tree
12400 {
12401 tree statement;
12404 token_indent_info body_tinfo
12410 /* Mark if () ; with a special NOP_EXPR. */
12412 {
12423 }
12424 /* if a compound is opened, we simply parse the statement directly. */
12427 /* If the token is not a `{', then we must take special action. */
12428 else
12429 {
12430 /* Create a compound-statement. */
12432 /* Parse the dependent-statement. */
12435 /* Finish the dummy compound-statement. */
12437 }
12439 token_indent_info next_tinfo
12448 /* Return the statement. */
12450 }
12452 /* For some dependent statements (like `while (cond) statement'), we
12453 have already created a scope. Therefore, even if the dependent
12454 statement is a compound-statement, we do not want to create another
12455 scope. */
12457 static void
12460 {
12461 /* If the token is a `{', then we must take special action. */
12463 {
12464 token_indent_info body_tinfo
12470 token_indent_info next_tinfo
12479 }
12480 else
12481 {
12482 /* Avoid calling cp_parser_compound_statement, so that we
12483 don't create a new scope. Do everything else by hand. */
12485 /* If the next keyword is `__label__' we have a label declaration. */
12488 /* Parse an (optional) statement-seq. */
12491 }
12492 }
12494 /* Declarations [gram.dcl.dcl] */
12496 /* Parse an optional declaration-sequence.
12498 declaration-seq:
12499 declaration
12500 declaration-seq declaration */
12502 static void
12504 {
12506 {
12517 {
12518 /* A declaration consisting of a single semicolon is
12519 invalid. Allow it unless we're being pedantic. */
12524 }
12526 /* If we're entering or exiting a region that's implicitly
12527 extern "C", modify the lang context appropriately. */
12529 {
12532 }
12534 {
12537 }
12540 {
12541 /* A top-level declaration can consist solely of a #pragma.
12542 A nested declaration cannot, so this is done here and not
12543 in cp_parser_declaration. (A #pragma at block scope is
12544 handled in cp_parser_statement.) */
12547 }
12549 /* Parse the declaration itself. */
12551 }
12552 }
12554 /* Parse a declaration.
12556 declaration:
12557 block-declaration
12558 function-definition
12559 template-declaration
12560 explicit-instantiation
12561 explicit-specialization
12562 linkage-specification
12563 namespace-definition
12565 C++17:
12566 deduction-guide
12568 GNU extension:
12570 declaration:
12571 __extension__ declaration */
12573 static void
12575 {
12576 cp_token token1;
12577 cp_token token2;
12582 /* Check for the `__extension__' keyword. */
12584 {
12585 /* Parse the qualified declaration. */
12587 /* Restore the PEDANTIC flag. */
12591 }
12593 /* Try to figure out what kind of declaration is present. */
12598 else
12599 {
12602 }
12604 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12607 /* If the next token is `extern' and the following token is a string
12608 literal, then we have a linkage specification. */
12612 /* If the next token is `template', then we have either a template
12613 declaration, an explicit instantiation, or an explicit
12614 specialization. */
12616 {
12617 /* `template <>' indicates a template specialization. */
12621 /* `template <' indicates a template declaration. */
12624 /* Anything else must be an explicit instantiation. */
12625 else
12627 }
12628 /* If the next token is `export', then we have a template
12629 declaration. */
12632 /* If the next token is `extern', 'static' or 'inline' and the one
12633 after that is `template', we have a GNU extended explicit
12634 instantiation directive. */
12641 /* If the next token is `namespace', check for a named or unnamed
12642 namespace definition. */
12651 /* An unnamed namespace definition. */
12655 /* An inline (associated) namespace definition. */
12659 /* Objective-C++ declaration/definition. */
12666 /* At this point we may have a template declared by a concept
12667 introduction. */
12672 else
12673 /* Try to parse a block-declaration, or a function-definition. */
12676 /* Free any declarators allocated. */
12678 }
12680 /* Parse a block-declaration.
12682 block-declaration:
12683 simple-declaration
12684 asm-definition
12685 namespace-alias-definition
12686 using-declaration
12687 using-directive
12689 GNU Extension:
12691 block-declaration:
12692 __extension__ block-declaration
12694 C++0x Extension:
12696 block-declaration:
12697 static_assert-declaration
12699 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12700 part of a declaration-statement. */
12702 static void
12705 {
12709 /* Check for the `__extension__' keyword. */
12711 {
12712 /* Parse the qualified declaration. */
12714 /* Restore the PEDANTIC flag. */
12718 }
12720 /* Peek at the next token to figure out which kind of declaration is
12721 present. */
12724 /* If the next keyword is `asm', we have an asm-definition. */
12726 {
12730 }
12731 /* If the next keyword is `namespace', we have a
12732 namespace-alias-definition. */
12735 /* If the next keyword is `using', we have a
12736 using-declaration, a using-directive, or an alias-declaration. */
12738 {
12743 /* If the token after `using' is `namespace', then we have a
12744 using-directive. */
12748 /* If the second token after 'using' is '=', then we have an
12749 alias-declaration. */
12755 /* Otherwise, it's a using-declaration. */
12756 else
12759 }
12760 /* If the next keyword is `__label__' we have a misplaced label
12761 declaration. */
12763 {
12767 /* If the next token is now a `;', consume it. */
12770 }
12771 /* If the next token is `static_assert' we have a static assertion. */
12774 /* Anything else must be a simple-declaration. */
12775 else
12778 }
12780 /* Parse a simple-declaration.
12782 simple-declaration:
12783 decl-specifier-seq [opt] init-declarator-list [opt] ;
12784 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12785 brace-or-equal-initializer ;
12787 init-declarator-list:
12788 init-declarator
12789 init-declarator-list , init-declarator
12791 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12792 function-definition as a simple-declaration.
12794 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12795 parsed declaration if it is an uninitialized single declarator not followed
12796 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12797 if present, will not be consumed. */
12799 static void
12803 {
12804 cp_decl_specifier_seq decl_specifiers;
12813 /* Defer access checks until we know what is being declared; the
12814 checks for names appearing in the decl-specifier-seq should be
12815 done as if we were in the scope of the thing being declared. */
12818 /* Parse the decl-specifier-seq. We have to keep track of whether
12819 or not the decl-specifier-seq declares a named class or
12820 enumeration type, since that is the only case in which the
12821 init-declarator-list is allowed to be empty.
12823 [dcl.dcl]
12825 In a simple-declaration, the optional init-declarator-list can be
12826 omitted only when declaring a class or enumeration, that is when
12827 the decl-specifier-seq contains either a class-specifier, an
12828 elaborated-type-specifier, or an enum-specifier. */
12830 CP_PARSER_FLAGS_OPTIONAL,
12833 /* We no longer need to defer access checks. */
12836 /* In a block scope, a valid declaration must always have a
12837 decl-specifier-seq. By not trying to parse declarators, we can
12838 resolve the declaration/expression ambiguity more quickly. */
12841 {
12844 }
12846 /* If the next two tokens are both identifiers, the code is
12847 erroneous. The usual cause of this situation is code like:
12849 T t;
12851 where "T" should name a type -- but does not. */
12854 {
12855 /* If parsing tentatively, we should commit; we really are
12856 looking at a declaration. */
12858 /* Give up. */
12860 }
12862 /* If we have seen at least one decl-specifier, and the next token
12863 is not a parenthesis, then we must be looking at a declaration.
12864 (After "int (" we might be looking at a functional cast.) */
12871 /* Look for C++17 decomposition declaration. */
12879 {
12880 tree decl
12882 maybe_range_for_decl,
12885 /* The next token should be either a `,' or a `;'. */
12887 /* If it's a `;', we are done. */
12890 /* Anything else is an error. */
12891 else
12892 {
12893 /* If we have already issued an error message we don't need
12894 to issue another one. */
12899 /* Skip tokens until we reach the end of the statement. */
12901 /* If the next token is now a `;', consume it. */
12905 }
12906 }
12907 else
12910 tree last_type;
12912 /* NULL_TREE if both variable and function declaration are allowed,
12913 error_mark_node if function declaration are not allowed and
12914 a FUNCTION_DECL that should be diagnosed if it is followed by
12915 variable declarations. */
12916 tree auto_function_declaration;
12919 auto_specifier_p
12923 /* Keep going until we hit the `;' at the end of the simple
12924 declaration. */
12927 CPP_SEMICOLON))
12928 {
12931 tree decl;
12935 {
12936 /* If we are processing next declarator, comma is expected */
12941 {
12945 }
12946 }
12947 else
12950 /* Parse the init-declarator. */
12953 function_definition_allowed_p,
12955 declares_class_or_enum,
12957 maybe_range_for_decl,
12960 /* If an error occurred while parsing tentatively, exit quickly.
12961 (That usually happens when in the body of a function; each
12962 statement is treated as a declaration-statement until proven
12963 otherwise.) */
12968 {
12969 /* If the init-declarator-list contains more than one
12970 init-declarator, they shall all form declarations of
12971 variables. */
12973 auto_function_declaration
12977 {
12979 "non-variable %qD in declaration with more than one "
12984 }
12985 }
12989 {
12993 {
12994 /* If the list of declarators contains more than one declarator,
12995 the type of each declared variable is determined as described
12996 above. If the type deduced for the template parameter U is not
12997 the same in each deduction, the program is ill-formed. */
13002 }
13003 else
13005 }
13007 /* Handle function definitions specially. */
13009 {
13010 /* If the next token is a `,', then we are probably
13011 processing something like:
13013 void f() {}, *p;
13015 which is erroneous. */
13017 {
13020 "mixing"
13022 }
13023 /* Otherwise, we're done with the list of declarators. */
13024 else
13025 {
13028 }
13029 }
13032 /* The next token should be either a `,' or a `;'. */
13034 /* If it's a `,', there are more declarators to come. */
13037 /* If it's a `;', we are done. */
13041 {
13046 }
13047 /* Anything else is an error. */
13048 else
13049 {
13050 /* If we have already issued an error message we don't need
13051 to issue another one. */
13056 /* Skip tokens until we reach the end of the statement. */
13058 /* If the next token is now a `;', consume it. */
13062 }
13063 /* After the first time around, a function-definition is not
13064 allowed -- even if it was OK at first. For example:
13066 int i, f() {}
13068 is not valid. */
13070 }
13072 /* Issue an error message if no declarators are present, and the
13073 decl-specifier-seq does not itself declare a class or
13074 enumeration: [dcl.dcl]/3. */
13076 {
13078 {
13082 /* Ensure an error is issued anyway when finish_decltype_type,
13083 called via cp_parser_decl_specifier_seq, returns a class or
13084 an enumeration (c++/51786). */
13087 }
13088 /* Perform any deferred access checks. */
13090 }
13092 /* Consume the `;'. */
13093 finish:
13097 {
13103 }
13105 done:
13107 }
13109 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13110 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13111 initializer ; */
13113 static tree
13118 {
13123 /* Parse the identifier-list. */
13127 {
13135 }
13139 {
13145 else
13146 {
13149 }
13150 }
13156 tree pushed_scope;
13163 NULL_TREE);
13170 cp_expr e;
13171 cp_decl_specifier_seq decl_specs;
13176 {
13179 else
13182 tree elt_pushed_scope;
13188 {
13189 /* Ensure we've diagnosed redeclaration if we aren't creating
13190 a new VAR_DECL. */
13193 }
13194 else
13198 }
13201 {
13204 }
13208 {
13218 {
13222 }
13225 {
13229 }
13230 }
13232 {
13234 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13235 the underlying DECL. */
13237 }
13243 {
13246 }
13249 }
13251 /* Parse a decl-specifier-seq.
13253 decl-specifier-seq:
13254 decl-specifier-seq [opt] decl-specifier
13255 decl-specifier attribute-specifier-seq [opt] (C++11)
13257 decl-specifier:
13258 storage-class-specifier
13259 type-specifier
13260 function-specifier
13261 friend
13262 typedef
13264 GNU Extension:
13266 decl-specifier:
13267 attributes
13269 Concepts Extension:
13271 decl-specifier:
13272 concept
13274 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13276 The parser flags FLAGS is used to control type-specifier parsing.
13278 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13279 flags:
13281 1: one of the decl-specifiers is an elaborated-type-specifier
13282 (i.e., a type declaration)
13283 2: one of the decl-specifiers is an enum-specifier or a
13284 class-specifier (i.e., a type definition)
13286 */
13288 static void
13290 cp_parser_flags flags,
13293 {
13297 cp_decl_spec ds;
13299 /* Clear DECL_SPECS. */
13302 /* Assume no class or enumeration type is declared. */
13305 /* Keep reading specifiers until there are no more to read. */
13307 {
13312 /* Peek at the next token. */
13315 /* Save the first token of the decl spec list for error
13316 reporting. */
13319 /* Handle attributes. */
13321 {
13322 /* Parse the attributes. */
13325 /* In a sequence of declaration specifiers, c++11 attributes
13326 appertain to the type that precede them. In that case
13327 [dcl.spec]/1 says:
13329 The attribute-specifier-seq affects the type only for
13330 the declaration it appears in, not other declarations
13331 involving the same type.
13333 But for now let's force the user to position the
13334 attribute either at the beginning of the declaration or
13335 after the declarator-id, which would clearly mean that it
13336 applies to the declarator. */
13338 {
13340 /* The c++11 attribute is at the beginning of the
13341 declaration. It appertains to the entity being
13343 else
13344 {
13346 {
13347 /* This is an attribute following a
13348 class-specifier. */
13353 }
13354 else
13355 {
13356 decl_specs->std_attributes
13358 attrs);
13361 }
13363 }
13364 }
13366 decl_specs->attributes
13368 attrs);
13372 }
13373 /* Assume we will find a decl-specifier keyword. */
13375 /* If the next token is an appropriate keyword, we can simply
13376 add it to the list. */
13378 {
13379 /* decl-specifier:
13380 friend
13381 constexpr */
13384 {
13387 }
13388 else
13389 {
13391 /* Consume the token. */
13393 }
13406 /* function-specifier:
13407 inline
13408 virtual
13409 explicit */
13416 /* decl-specifier:
13417 typedef */
13420 /* Consume the token. */
13422 /* A constructor declarator cannot appear in a typedef. */
13424 /* The "typedef" keyword can only occur in a declaration; we
13425 may as well commit at this point. */
13432 /* storage-class-specifier:
13433 auto
13434 register
13435 static
13436 extern
13437 mutable
13439 GNU Extension:
13440 thread */
13443 {
13444 /* Consume the token. */
13447 /* Complain about `auto' as a storage specifier, if
13448 we're complaining about C++0x compatibility. */
13452 /* Set the storage class anyway. */
13454 token);
13455 }
13456 else
13457 /* C++0x auto type-specifier. */
13465 /* Consume the token. */
13468 token);
13471 /* Consume the token. */
13477 /* We did not yet find a decl-specifier yet. */
13480 }
13497 /* Constructors are a special case. The `S' in `S()' is not a
13498 decl-specifier; it is the beginning of the declarator. */
13499 constructor_p
13500 = (!found_decl_spec
13501 && constructor_possible_p
13502 && (cp_parser_constructor_declarator_p
13505 /* If we don't have a DECL_SPEC yet, then we must be looking at
13506 a type-specifier. */
13508 {
13511 tree type_spec;
13513 type_spec
13515 decl_specs,
13521 /* If this type-specifier referenced a user-defined type
13522 (a typedef, class-name, etc.), then we can't allow any
13523 more such type-specifiers henceforth.
13525 [dcl.spec]
13527 The longest sequence of decl-specifiers that could
13528 possibly be a type name is taken as the
13529 decl-specifier-seq of a declaration. The sequence shall
13530 be self-consistent as described below.
13532 [dcl.type]
13534 As a general rule, at most one type-specifier is allowed
13535 in the complete decl-specifier-seq of a declaration. The
13536 only exceptions are the following:
13538 -- const or volatile can be combined with any other
13539 type-specifier.
13541 -- signed or unsigned can be combined with char, long,
13542 short, or int.
13544 -- ..
13546 Example:
13548 typedef char* Pc;
13549 void g (const int Pc);
13551 Here, Pc is *not* part of the decl-specifier seq; it's
13552 the declarator. Therefore, once we see a type-specifier
13553 (other than a cv-qualifier), we forbid any additional
13554 user-defined types. We *do* still allow things like `int
13555 int' to be considered a decl-specifier-seq, and issue the
13556 error message later. */
13559 /* A constructor declarator cannot follow a type-specifier. */
13561 {
13566 }
13567 }
13569 /* If we still do not have a DECL_SPEC, then there are no more
13570 decl-specifiers. */
13575 /* After we see one decl-specifier, further decl-specifiers are
13576 always optional. */
13578 }
13580 /* Don't allow a friend specifier with a class definition. */
13585 }
13587 /* Parse an (optional) storage-class-specifier.
13589 storage-class-specifier:
13590 auto
13591 register
13592 static
13593 extern
13594 mutable
13596 GNU Extension:
13598 storage-class-specifier:
13599 thread
13601 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13603 static tree
13605 {
13607 {
13611 /* Fall through for C++98. */
13619 /* Consume the token. */
13624 }
13625 }
13627 /* Parse an (optional) function-specifier.
13629 function-specifier:
13630 inline
13631 virtual
13632 explicit
13634 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13635 Updates DECL_SPECS, if it is non-NULL. */
13637 static tree
13640 {
13643 {
13649 /* 14.5.2.3 [temp.mem]
13651 A member function template shall not be virtual. */
13655 else
13665 }
13667 /* Consume the token. */
13669 }
13671 /* Parse a linkage-specification.
13673 linkage-specification:
13674 extern string-literal { declaration-seq [opt] }
13675 extern string-literal declaration */
13677 static void
13679 {
13680 tree linkage;
13682 /* Look for the `extern' keyword. */
13685 /* Look for the string-literal. */
13688 /* Transform the literal into an identifier. If the literal is a
13689 wide-character string, or contains embedded NULs, then we can't
13690 handle it as the user wants. */
13693 {
13695 /* Assume C++ linkage. */
13697 }
13698 else
13701 /* We're now using the new linkage. */
13704 /* If the next token is a `{', then we're using the first
13705 production. */
13707 {
13711 /* Consume the `{' token. */
13713 /* Parse the declarations. */
13715 /* Look for the closing `}'. */
13717 }
13718 /* Otherwise, there's just one declaration. */
13719 else
13720 {
13723 saved_in_unbraced_linkage_specification_p
13727 parser->in_unbraced_linkage_specification_p
13729 }
13731 /* We're done with the linkage-specification. */
13733 }
13735 /* Parse a static_assert-declaration.
13737 static_assert-declaration:
13738 static_assert ( constant-expression , string-literal ) ;
13739 static_assert ( constant-expression ) ; (C++1Z)
13741 If MEMBER_P, this static_assert is a class member. */
13743 static void
13745 {
13746 tree condition;
13747 tree message;
13749 location_t saved_loc;
13752 /* Peek at the `static_assert' token so we can keep track of exactly
13753 where the static assertion started. */
13757 /* Look for the `static_assert' keyword. */
13759 RT_STATIC_ASSERT))
13762 /* We know we are in a static assertion; commit to any tentative
13763 parse. */
13767 /* Parse the `(' starting the static assertion condition. */
13770 /* Parse the constant-expression. Allow a non-constant expression
13771 here in order to give better diagnostics in finish_static_assert. */
13772 condition =
13778 {
13781 "static_assert without a message "
13783 /* Eat the ')' */
13788 }
13789 else
13790 {
13791 /* Parse the separating `,'. */
13794 /* Parse the string-literal message. */
13799 /* A `)' completes the static assertion. */
13805 }
13807 /* A semicolon terminates the declaration. */
13810 /* Complete the static assertion, which may mean either processing
13811 the static assert now or saving it for template instantiation. */
13813 }
13815 /* Parse the expression in decltype ( expression ). */
13817 static tree
13820 {
13822 tree expr;
13824 /* Since we're going to preserve any side-effects from this parse, set up a
13825 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13826 in the expression. */
13829 /* First, try parsing an id-expression. */
13840 {
13843 cp_id_kind idk;
13847 /* Lookup the name we got back from the id-expression. */
13857 {
13858 /* Complete lookup of the id-expression. */
13859 expr = (finish_id_expression
13872 /* We found an id-expression, but it was something that we
13873 should not have found. This is an error, not something
13874 we can recover from, so note that we found an
13875 id-expression and we'll recover as gracefully as
13876 possible. */
13878 }
13883 /* We have an id-expression. */
13885 }
13888 {
13889 /* Abort the id-expression parse. */
13892 /* Parsing tentatively, again. */
13895 /* Parse a class member access. */
13903 /* We have an id-expression. */
13905 }
13908 /* We have parsed the complete id-expression or member access. */
13910 else
13911 {
13912 /* Abort our attempt to parse an id-expression or member access
13913 expression. */
13916 /* Parse a full expression. */
13919 }
13922 }
13924 /* Parse a `decltype' type. Returns the type.
13926 simple-type-specifier:
13927 decltype ( expression )
13928 C++14 proposal:
13929 decltype ( auto ) */
13931 static tree
13933 {
13934 tree expr;
13943 {
13944 /* Already parsed. */
13947 }
13949 /* Look for the `decltype' token. */
13953 /* Parse the opening `('. */
13957 /* decltype (auto) */
13960 {
13967 }
13969 /* Types cannot be defined in a `decltype' expression. Save away the
13970 old message. */
13973 /* And create the new one. */
13974 parser->type_definition_forbidden_message
13977 /* The restrictions on constant-expressions do not apply inside
13978 decltype expressions. */
13979 saved_integral_constant_expression_p
13981 saved_non_integral_constant_expression_p
13985 /* Within a parenthesized expression, a `>' token is always
13986 the greater-than operator. */
13987 saved_greater_than_is_operator_p
13991 /* Do not actually evaluate the expression. */
13994 /* Do not warn about problems with the expression. */
13999 /* Go back to evaluating expressions. */
14003 /* The `>' token might be the end of a template-id or
14004 template-parameter-list now. */
14005 parser->greater_than_is_operator_p
14008 /* Restore the old message and the integral constant expression
14009 flags. */
14011 parser->integral_constant_expression_p
14013 parser->non_integral_constant_expression_p
14016 /* Parse to the closing `)'. */
14018 {
14022 }
14025 tf_warning_or_error);
14027 rewrite:
14028 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14029 it again. */
14038 }
14040 /* Special member functions [gram.special] */
14042 /* Parse a conversion-function-id.
14044 conversion-function-id:
14045 operator conversion-type-id
14047 Returns an IDENTIFIER_NODE representing the operator. */
14049 static tree
14051 {
14052 tree type;
14053 tree saved_scope;
14054 tree saved_qualifying_scope;
14055 tree saved_object_scope;
14058 /* Look for the `operator' token. */
14061 /* When we parse the conversion-type-id, the current scope will be
14062 reset. However, we need that information in able to look up the
14063 conversion function later, so we save it here. */
14067 /* We must enter the scope of the class so that the names of
14068 entities declared within the class are available in the
14069 conversion-type-id. For example, consider:
14071 struct S {
14072 typedef int I;
14073 operator I();
14074 };
14076 S::operator I() { ... }
14078 In order to see that `I' is a type-name in the definition, we
14079 must be in the scope of `S'. */
14082 /* Parse the conversion-type-id. */
14084 /* Leave the scope of the class, if any. */
14087 /* Restore the saved scope. */
14091 /* If the TYPE is invalid, indicate failure. */
14095 }
14097 /* Parse a conversion-type-id:
14099 conversion-type-id:
14100 type-specifier-seq conversion-declarator [opt]
14102 Returns the TYPE specified. */
14104 static tree
14106 {
14107 tree attributes;
14108 cp_decl_specifier_seq type_specifiers;
14110 tree type_specified;
14113 /* Parse the attributes. */
14117 parser->type_definition_forbidden_message
14120 /* Parse the type-specifiers. */
14127 /* If that didn't work, stop. */
14130 /* Parse the conversion-declarator. */
14138 /* Don't give this error when parsing tentatively. This happens to
14139 work because we always parse this definitively once. */
14142 {
14144 {
14147 }
14151 }
14154 }
14156 /* Parse an (optional) conversion-declarator.
14158 conversion-declarator:
14159 ptr-operator conversion-declarator [opt]
14161 */
14165 {
14168 cp_cv_quals cv_quals;
14170 /* We don't know if there's a ptr-operator next, or not. */
14172 /* Try the ptr-operator. */
14175 /* If it worked, look for more conversion-declarators. */
14177 {
14180 /* Parse another optional declarator. */
14183 declarator = cp_parser_make_indirect_declarator
14187 }
14190 }
14192 /* Parse an (optional) ctor-initializer.
14194 ctor-initializer:
14195 : mem-initializer-list
14197 Returns TRUE iff the ctor-initializer was actually present. */
14199 static bool
14201 {
14202 /* If the next token is not a `:', then there is no
14203 ctor-initializer. */
14205 {
14206 /* Do default initialization of any bases and members. */
14211 }
14213 /* Consume the `:' token. */
14215 /* And the mem-initializer-list. */
14219 }
14221 /* Parse a mem-initializer-list.
14223 mem-initializer-list:
14224 mem-initializer ... [opt]
14225 mem-initializer ... [opt] , mem-initializer-list */
14227 static void
14229 {
14234 /* Let the semantic analysis code know that we are starting the
14235 mem-initializer-list. */
14240 /* Loop through the list. */
14242 {
14243 tree mem_initializer;
14246 /* Parse the mem-initializer. */
14248 /* If the next token is a `...', we're expanding member initializers. */
14250 {
14251 /* Consume the `...'. */
14254 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14255 can be expanded but members cannot. */
14258 {
14263 }
14265 /* Construct the pack expansion type. */
14268 }
14271 {
14275 }
14276 /* Look for a target constructor. */
14280 {
14283 {
14287 }
14289 }
14290 /* Add it to the list, unless it was erroneous. */
14292 {
14295 }
14296 /* If the next token is not a `,', we're done. */
14299 /* Consume the `,' token. */
14301 }
14303 /* Perform semantic analysis. */
14306 }
14308 /* Parse a mem-initializer.
14310 mem-initializer:
14311 mem-initializer-id ( expression-list [opt] )
14312 mem-initializer-id braced-init-list
14314 GNU extension:
14316 mem-initializer:
14317 ( expression-list [opt] )
14319 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14320 class) or FIELD_DECL (for a non-static data member) to initialize;
14321 the TREE_VALUE is the expression-list. An empty initialization
14322 list is represented by void_list_node. */
14324 static tree
14326 {
14327 tree mem_initializer_id;
14328 tree expression_list;
14329 tree member;
14332 /* Find out what is being initialized. */
14334 {
14338 }
14339 else
14340 {
14344 }
14350 {
14357 }
14358 else
14359 {
14369 }
14379 }
14381 /* Parse a mem-initializer-id.
14383 mem-initializer-id:
14384 :: [opt] nested-name-specifier [opt] class-name
14385 decltype-specifier (C++11)
14386 identifier
14388 Returns a TYPE indicating the class to be initialized for the first
14389 production (and the second in C++11). Returns an IDENTIFIER_NODE
14390 indicating the data member to be initialized for the last production. */
14392 static tree
14394 {
14398 tree id;
14402 /* `typename' is not allowed in this context ([temp.res]). */
14404 {
14406 "keyword %<typename%> not allowed in this context (a qualified "
14409 }
14410 /* Look for the optional `::' operator. */
14411 global_scope_p
14415 /* Look for the optional nested-name-specifier. The simplest way to
14416 implement:
14418 [temp.res]
14420 The keyword `typename' is not permitted in a base-specifier or
14421 mem-initializer; in these contexts a qualified name that
14422 depends on a template-parameter is implicitly assumed to be a
14423 type name.
14425 is to assume that we have seen the `typename' keyword at this
14426 point. */
14427 nested_name_specifier_p
14436 /* If there is a `::' operator or a nested-name-specifier, then we
14437 are definitely looking for a class-name. */
14442 typename_type,
14446 /* Otherwise, we could also be looking for an ordinary identifier. */
14449 /* Try a decltype-specifier. */
14451 else
14452 /* Otherwise, try a class-name. */
14456 none_type,
14460 /* If we found one, we're done. */
14463 /* Otherwise, look for an ordinary identifier. */
14465 }
14467 /* Overloading [gram.over] */
14469 /* Parse an operator-function-id.
14471 operator-function-id:
14472 operator operator
14474 Returns an IDENTIFIER_NODE for the operator which is a
14475 human-readable spelling of the identifier, e.g., `operator +'. */
14477 static cp_expr
14479 {
14480 /* Look for the `operator' keyword. */
14483 /* And then the name of the operator itself. */
14485 }
14487 /* Return an identifier node for a user-defined literal operator.
14488 The suffix identifier is chained to the operator name identifier. */
14490 tree
14492 {
14493 tree identifier;
14500 }
14502 /* Parse an operator.
14504 operator:
14505 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14506 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14507 || ++ -- , ->* -> () []
14509 GNU Extensions:
14511 operator:
14512 <? >? <?= >?=
14514 Returns an IDENTIFIER_NODE for the operator which is a
14515 human-readable spelling of the identifier, e.g., `operator +'. */
14517 static cp_expr
14519 {
14524 /* Peek at the next token. */
14529 /* Figure out which operator we have. */
14531 {
14533 {
14536 /* The keyword should be either `new' or `delete'. */
14541 else
14544 /* Consume the `new' or `delete' token. */
14547 /* Peek at the next token. */
14549 /* If it's a `[' token then this is the array variant of the
14550 operator. */
14552 {
14553 /* Consume the `[' token. */
14555 /* Look for the `]' token. */
14561 }
14562 /* Otherwise, we have the non-array variant. */
14563 else
14569 }
14716 /* Consume the `('. */
14718 /* Look for the matching `)'. */
14723 /* Consume the `['. */
14725 /* Look for the matching `]'. */
14732 /* FALLTHRU */
14741 {
14748 /* Consume the string. */
14754 {
14757 }
14758 else
14759 {
14761 /* Look for the suffix identifier. */
14766 {
14770 }
14771 else
14772 {
14775 }
14776 }
14781 {
14784 }
14787 {
14790 }
14792 {
14795 }
14797 }
14800 /* Anything else is an error. */
14802 }
14804 /* If we have selected an identifier, we need to consume the
14805 operator token. */
14808 /* Otherwise, no valid operator name was present. */
14809 else
14810 {
14813 }
14816 }
14818 /* Parse a template-declaration.
14820 template-declaration:
14821 export [opt] template < template-parameter-list > declaration
14823 If MEMBER_P is TRUE, this template-declaration occurs within a
14824 class-specifier.
14826 The grammar rule given by the standard isn't correct. What
14827 is really meant is:
14829 template-declaration:
14830 export [opt] template-parameter-list-seq
14831 decl-specifier-seq [opt] init-declarator [opt] ;
14832 export [opt] template-parameter-list-seq
14833 function-definition
14835 template-parameter-list-seq:
14836 template-parameter-list-seq [opt]
14837 template < template-parameter-list >
14839 Concept Extensions:
14841 template-parameter-list-seq:
14842 template < template-parameter-list > requires-clause [opt]
14844 requires-clause:
14845 requires logical-or-expression */
14847 static void
14849 {
14850 /* Check for `export'. */
14852 {
14853 /* Consume the `export' token. */
14855 /* Warn that we do not support `export'. */
14857 }
14860 }
14862 /* Parse a template-parameter-list.
14864 template-parameter-list:
14865 template-parameter
14866 template-parameter-list , template-parameter
14868 Returns a TREE_LIST. Each node represents a template parameter.
14869 The nodes are connected via their TREE_CHAINs. */
14871 static tree
14873 {
14878 /* The loop below parses the template parms. We first need to know
14879 the total number of template parms to be able to compute proper
14880 canonical types of each dependent type. So after the loop, when
14881 we know the total number of template parms,
14882 end_template_parm_list computes the proper canonical types and
14883 fixes up the dependent types accordingly. */
14885 {
14886 tree parameter;
14889 location_t parm_loc;
14891 /* Parse the template-parameter. */
14896 /* Add it to the list. */
14899 parm_loc,
14900 parameter,
14901 is_non_type,
14902 is_parameter_pack);
14903 else
14904 {
14907 }
14909 /* If the next token is not a `,', we're done. */
14912 /* Otherwise, consume the `,' token. */
14914 }
14917 }
14919 /* Parse a introduction-list.
14921 introduction-list:
14922 introduced-parameter
14923 introduction-list , introduced-parameter
14925 introduced-parameter:
14926 ...[opt] identifier
14928 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14929 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14930 WILDCARD_DECL will also have DECL_NAME set and token location in
14931 DECL_SOURCE_LOCATION. */
14933 static tree
14935 {
14939 {
14944 /* Build placeholder. */
14952 /* If the next token is not a `,', we're done. */
14955 /* Otherwise, consume the `,' token. */
14957 }
14959 /* Convert the vec into a TREE_VEC. */
14962 tree parm;
14968 }
14970 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14971 is an abstract declarator. */
14975 {
14980 }
14982 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14983 is an abstract declarator. */
14987 {
14991 else
14993 }
14995 /* Returns true if DECL represents a constrained-parameter. */
14999 {
15004 }
15006 /* Returns true if PARM declares a constrained-parameter. */
15010 {
15012 }
15014 /* Check that the type parameter is only a declarator-id, and that its
15015 type is not cv-qualified. */
15017 bool
15020 {
15025 {
15028 }
15030 /* Don't allow cv-qualified type parameters. */
15033 {
15036 }
15039 }
15041 /* Finish parsing/processing a template type parameter and checking
15042 various restrictions. */
15046 tree id,
15048 {
15051 else
15053 }
15055 static tree
15057 {
15058 /* FIXME: This should probably be copied, and we may need to adjust
15059 the template parameter depths. */
15069 }
15071 /* Finish parsing/processing a template template parameter by borrowing
15072 the template parameter list from the prototype parameter. */
15074 static tree
15076 tree proto,
15077 tree id,
15079 {
15083 }
15085 /* Create a new non-type template parameter from the given PARM
15086 declarator. */
15088 static tree
15091 {
15097 }
15099 /* Build a constrained template parameter based on the PARMDECL
15100 declarator. The type of PARMDECL is the constrained type, which
15101 refers to the prototype template parameter that ultimately
15102 specifies the type of the declared parameter. */
15104 static tree
15109 {
15115 /* A template parameter constrained by a variadic concept shall also
15116 be declared as a template parameter pack. */
15121 /* Build the parameter. Return an error if the declarator was invalid. */
15122 tree parm;
15127 parmdecl);
15128 else
15133 /* Finish the parameter decl and create a node attaching the
15134 default argument and constraint. */
15139 }
15141 /* Returns true if the parsed type actually represents the declaration
15142 of a type template-parameter. */
15146 {
15149 }
15152 /* Returns true if the parsed type actually represents the declaration of
15153 a template template-parameter. */
15155 static bool
15157 {
15160 }
15162 /* Parse a default argument for a type template-parameter.
15163 Note that diagnostics are handled in cp_parser_template_parameter. */
15165 static tree
15167 {
15170 /* Consume the `=' token. */
15175 /* Parse the default-argument. */
15181 {
15185 }
15188 }
15190 /* Parse a default argument for a template template-parameter. */
15192 static tree
15194 {
15199 /* Consume the `='. */
15201 /* Parse the id-expression. */
15203 /* save token before parsing the id-expression, for error
15204 reporting */
15206 tree default_argument
15214 /* If the id-expression was a template-id that refers to
15215 a template-class, we already have the declaration here,
15216 so no further lookup is needed. */
15217 ;
15218 else
15219 /* Look up the name. */
15220 default_argument
15222 none_type,
15228 /* See if the default argument is valid. */
15232 }
15234 /* Parse a template-parameter.
15236 template-parameter:
15237 type-parameter
15238 parameter-declaration
15240 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15241 the parameter. The TREE_PURPOSE is the default value, if any.
15242 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15243 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15244 set to true iff this parameter is a parameter pack. */
15246 static tree
15249 {
15252 tree parm;
15254 /* Assume it is a type parameter or a template parameter. */
15256 /* Assume it not a parameter pack. */
15258 /* Peek at the next token. */
15260 /* If it is `template', we have a type-parameter. */
15263 /* If it is `class' or `typename' we do not know yet whether it is a
15264 type parameter or a non-type parameter. Consider:
15266 template <typename T, typename T::X X> ...
15268 or:
15270 template <class C, class D*> ...
15272 Here, the first parameter is a type parameter, and the second is
15273 a non-type parameter. We can tell by looking at the token after
15274 the identifier -- if it is a `,', `=', or `>' then we have a type
15275 parameter. */
15277 {
15278 /* Peek at the token after `class' or `typename'. */
15280 /* If it's an ellipsis, we have a template type parameter
15281 pack. */
15284 /* If it's an identifier, skip it. */
15287 /* Now, see if the token looks like the end of a template
15288 parameter. */
15293 }
15295 /* Otherwise, it is a non-type parameter or a constrained parameter.
15297 [temp.param]
15299 When parsing a default template-argument for a non-type
15300 template-parameter, the first non-nested `>' is taken as the end
15301 of the template parameter-list rather than a greater-than
15302 operator. */
15303 parameter_declarator
15310 /* If the parameter declaration is marked as a parameter pack, set
15311 *IS_PARAMETER_PACK to notify the caller. */
15316 {
15317 /* Can happen in some cases of erroneous input (c++/34892). */
15319 /* Consume the `...' for better error recovery. */
15321 }
15323 // The parameter may have been constrained.
15326 parameter_declarator,
15327 is_non_type,
15328 is_parameter_pack);
15330 // Now we're sure that the parameter is a non-type parameter.
15341 }
15343 /* Parse a type-parameter.
15345 type-parameter:
15346 class identifier [opt]
15347 class identifier [opt] = type-id
15348 typename identifier [opt]
15349 typename identifier [opt] = type-id
15350 template < template-parameter-list > class identifier [opt]
15351 template < template-parameter-list > class identifier [opt]
15352 = id-expression
15354 GNU Extension (variadic templates):
15356 type-parameter:
15357 class ... identifier [opt]
15358 typename ... identifier [opt]
15360 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15361 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15362 the declaration of the parameter.
15364 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15366 static tree
15368 {
15370 tree parameter;
15372 /* Look for a keyword to tell us what kind of parameter this is. */
15378 {
15381 {
15382 tree identifier;
15383 tree default_argument;
15385 /* If the next token is an ellipsis, we have a template
15386 argument pack. */
15388 {
15389 /* Consume the `...' token. */
15394 }
15396 /* If the next token is an identifier, then it names the
15397 parameter. */
15400 else
15403 /* Create the parameter. */
15406 /* If the next token is an `=', we have a default argument. */
15408 {
15409 default_argument
15412 /* Template parameter packs cannot have default
15413 arguments. */
15415 {
15418 "template parameter pack %qD cannot have a "
15420 else
15422 "template parameter packs cannot have "
15425 }
15428 }
15429 else
15432 /* Create the combined representation of the parameter and the
15433 default argument. */
15435 }
15439 {
15440 tree identifier;
15441 tree default_argument;
15443 /* Look for the `<'. */
15445 /* Parse the template-parameter-list. */
15447 /* Look for the `>'. */
15450 // If template requirements are present, parse them.
15452 {
15457 }
15459 /* Look for the `class' or 'typename' keywords. */
15461 /* If the next token is an ellipsis, we have a template
15462 argument pack. */
15464 {
15465 /* Consume the `...' token. */
15470 }
15471 /* If the next token is an `=', then there is a
15472 default-argument. If the next token is a `>', we are at
15473 the end of the parameter-list. If the next token is a `,',
15474 then we are at the end of this parameter. */
15478 {
15480 /* Treat invalid names as if the parameter were nameless. */
15483 }
15484 else
15487 /* Create the template parameter. */
15489 identifier);
15491 /* If the next token is an `=', then there is a
15492 default-argument. */
15494 {
15495 default_argument
15498 /* Template parameter packs cannot have default
15499 arguments. */
15501 {
15504 "template parameter pack %qD cannot "
15506 identifier);
15507 else
15511 }
15512 }
15513 else
15516 /* Create the combined representation of the parameter and the
15517 default argument. */
15519 }
15525 }
15528 }
15530 /* Parse a template-id.
15532 template-id:
15533 template-name < template-argument-list [opt] >
15535 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15536 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15537 returned. Otherwise, if the template-name names a function, or set
15538 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15539 names a class, returns a TYPE_DECL for the specialization.
15541 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15542 uninstantiated templates. */
15544 static tree
15550 {
15551 tree templ;
15552 tree arguments;
15553 tree template_id;
15558 /* If the next token corresponds to a template-id, there is no need
15559 to reparse it. */
15562 {
15565 }
15567 /* Avoid performing name lookup if there is no possibility of
15568 finding a template-id. */
15571 && !cp_parser_nth_token_starts_template_argument_list_p
15573 {
15576 }
15578 /* Remember where the template-id starts. */
15584 /* Parse the template-name. */
15587 check_dependency_p,
15588 is_declaration,
15589 tag_type,
15592 {
15595 }
15597 /* Since we're going to preserve any side-effects from this parse, set up a
15598 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15599 in the template arguments. */
15602 /* If we find the sequence `[:' after a template-name, it's probably
15603 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15604 parse correctly the argument list. */
15611 {
15613 /* Change `:' into `::'. */
15615 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15616 CPP_LESS. */
15619 /* Parse the arguments. */
15622 {
15623 /* If we couldn't parse an argument list, then we revert our changes
15624 and return simply an error. Maybe this is not a template-id
15625 after all. */
15630 }
15631 /* Otherwise, emit an error about the invalid digraph, but continue
15632 parsing because we got our argument list. */
15635 {
15638 "%<<:%> is an alternate spelling for %<[%>."
15641 {
15643 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15646 }
15647 }
15648 }
15649 else
15650 {
15651 /* Look for the `<' that starts the template-argument-list. */
15653 {
15656 }
15657 /* Parse the arguments. */
15659 }
15661 /* Set the location to be of the form:
15662 template-name < template-argument-list [opt] >
15663 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15664 with caret == start at the start of the template-name,
15665 ranging until the closing '>'. */
15666 location_t finish_loc
15668 location_t combined_loc
15671 /* Build a representation of the specialization. */
15674 TEMPLATE_ID_EXPR,
15678 {
15680 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15681 template (rather than some instantiation thereof) only if
15682 is not nested within some other construct. For example, in
15683 "template <typename T> void f(T) { A<T>::", A<T> is just an
15684 instantiation of A. */
15687 CPP_SCOPE));
15688 template_id
15690 }
15691 /* A template-like identifier may be a partial concept id. */
15697 {
15701 }
15702 else
15703 {
15704 /* If it's not a class-template or a template-template, it should be
15705 a function-template. */
15713 }
15715 /* If parsing tentatively, replace the sequence of tokens that makes
15716 up the template-id with a CPP_TEMPLATE_ID token. That way,
15717 should we re-parse the token stream, we will not have to repeat
15718 the effort required to do the parse, nor will we issue duplicate
15719 error messages about problems during instantiation of the
15720 template. */
15722 /* Don't do this if we had a parse error in a declarator; re-parsing
15723 might succeed if a name changes meaning (60361). */
15727 {
15728 /* Reset the contents of the START_OF_ID token. */
15732 /* We must mark the lookup as kept, so we don't throw it away on
15733 the first parse. */
15737 /* Retrieve any deferred checks. Do not pop this access checks yet
15738 so the memory will not be reclaimed during token replacing below. */
15744 /* Purge all subsequent tokens. */
15747 /* ??? Can we actually assume that, if template_id ==
15748 error_mark_node, we will have issued a diagnostic to the
15749 user, as opposed to simply marking the tentative parse as
15750 failed? */
15753 }
15757 }
15759 /* Parse a template-name.
15761 template-name:
15762 identifier
15764 The standard should actually say:
15766 template-name:
15767 identifier
15768 operator-function-id
15770 A defect report has been filed about this issue.
15772 A conversion-function-id cannot be a template name because they cannot
15773 be part of a template-id. In fact, looking at this code:
15775 a.operator K<int>()
15777 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15778 It is impossible to call a templated conversion-function-id with an
15779 explicit argument list, since the only allowed template parameter is
15780 the type to which it is converting.
15782 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15783 `template' keyword, in a construction like:
15785 T::template f<3>()
15787 In that case `f' is taken to be a template-name, even though there
15788 is no way of knowing for sure.
15790 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15791 name refers to a set of overloaded functions, at least one of which
15792 is a template, or an IDENTIFIER_NODE with the name of the template,
15793 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15794 names are looked up inside uninstantiated templates. */
15796 static tree
15803 {
15804 tree identifier;
15805 tree decl;
15808 /* If the next token is `operator', then we have either an
15809 operator-function-id or a conversion-function-id. */
15811 {
15812 /* We don't know whether we're looking at an
15813 operator-function-id or a conversion-function-id. */
15815 /* Try an operator-function-id. */
15817 /* If that didn't work, try a conversion-function-id. */
15819 {
15822 }
15823 }
15824 /* Look for the identifier. */
15825 else
15828 /* If we didn't find an identifier, we don't have a template-id. */
15832 /* If the name immediately followed the `template' keyword, then it
15833 is a template-name. However, if the next token is not `<', then
15834 we do not treat it as a template-name, since it is not being used
15835 as part of a template-id. This enables us to handle constructs
15836 like:
15838 template <typename T> struct S { S(); };
15839 template <typename T> S<T>::S();
15841 correctly. We would treat `S' as a template -- if it were `S<T>'
15842 -- but we do not if there is no `<'. */
15846 {
15847 /* In a declaration, in a dependent context, we pretend that the
15848 "template" keyword was present in order to improve error
15849 recovery. For example, given:
15851 template <typename T> void f(T::X<int>);
15853 we want to treat "X<int>" as a template-id. */
15855 && !template_keyword_p
15857 && check_dependency_p
15859 /* Do not do this for dtors (or ctors), since they never
15860 need the template keyword before their name. */
15862 {
15865 /* Explain what went wrong. */
15867 identifier);
15870 /* If parsing tentatively, find the location of the "<" token. */
15873 /* Parse the template arguments so that we can issue error
15874 messages about them. */
15877 /* Skip tokens until we find a good place from which to
15878 continue parsing. */
15883 /* If parsing tentatively, permanently remove the
15884 template argument list. That will prevent duplicate
15885 error messages from being issued about the missing
15886 "template" keyword. */
15893 }
15895 /* If the "template" keyword is present, then there is generally
15896 no point in doing name-lookup, so we just return IDENTIFIER.
15897 But, if the qualifying scope is non-dependent then we can
15898 (and must) do name-lookup normally. */
15900 {
15906 {
15907 /* We're optimizing away the call to cp_parser_lookup_name, but
15908 we still need to do this. */
15911 }
15912 }
15913 }
15915 /* Look up the name. */
15917 tag_type,
15920 check_dependency_p,
15926 /* If DECL is a template, then the name was a template-name. */
15928 {
15932 }
15933 else
15934 {
15935 /* The standard does not explicitly indicate whether a name that
15936 names a set of overloaded declarations, some of which are
15937 templates, is a template-name. However, such a name should
15938 be a template-name; otherwise, there is no way to form a
15939 template-id for the overloaded templates. */
15948 {
15949 /* The name does not name a template. */
15952 }
15953 }
15955 /* If DECL is dependent, and refers to a function, then just return
15956 its name; we will look it up again during template instantiation. */
15958 {
15962 }
15965 }
15967 /* Parse a template-argument-list.
15969 template-argument-list:
15970 template-argument ... [opt]
15971 template-argument-list , template-argument ... [opt]
15973 Returns a TREE_VEC containing the arguments. */
15975 static tree
15977 {
15982 tree vec;
15989 /* Even if the template-id appears in an integral
15990 constant-expression, the contents of the argument list do
15991 not. */
15997 /* Parse the arguments. */
15998 do
15999 {
16000 tree argument;
16003 /* Consume the comma. */
16006 /* Parse the template-argument. */
16009 /* If the next token is an ellipsis, we're expanding a template
16010 argument pack. */
16012 {
16014 {
16018 }
16019 /* Consume the `...' token. */
16022 /* Make the argument into a TYPE_PACK_EXPANSION or
16023 EXPR_PACK_EXPANSION. */
16025 }
16028 {
16032 {
16035 }
16036 else
16038 }
16040 }
16056 }
16058 /* Parse a template-argument.
16060 template-argument:
16061 assignment-expression
16062 type-id
16063 id-expression
16065 The representation is that of an assignment-expression, type-id, or
16066 id-expression -- except that the qualified id-expression is
16067 evaluated, so that the value returned is either a DECL or an
16068 OVERLOAD.
16070 Although the standard says "assignment-expression", it forbids
16071 throw-expressions or assignments in the template argument.
16072 Therefore, we use "conditional-expression" instead. */
16074 static tree
16076 {
16077 tree argument;
16083 cp_id_kind idk;
16085 /* There's really no way to know what we're looking at, so we just
16086 try each alternative in order.
16088 [temp.arg]
16090 In a template-argument, an ambiguity between a type-id and an
16091 expression is resolved to a type-id, regardless of the form of
16092 the corresponding template-parameter.
16094 Therefore, we try a type-id first. */
16097 /* If there was no error parsing the type-id but the next token is a
16098 '>>', our behavior depends on which dialect of C++ we're
16099 parsing. In C++98, we probably found a typo for '> >'. But there
16100 are type-id which are also valid expressions. For instance:
16102 struct X { int operator >> (int); };
16103 template <int V> struct Foo {};
16104 Foo<X () >> 5> r;
16106 Here 'X()' is a valid type-id of a function type, but the user just
16107 wanted to write the expression "X() >> 5". Thus, we remember that we
16108 found a valid type-id, but we still try to parse the argument as an
16109 expression to see what happens.
16111 In C++0x, the '>>' will be considered two separate '>'
16112 tokens. */
16116 {
16119 }
16120 else
16121 {
16122 /* If the next token isn't a `,' or a `>', then this argument wasn't
16123 really finished. This means that the argument is not a valid
16124 type-id. */
16127 /* If that worked, we're done. */
16130 }
16131 /* We're still not sure what the argument will be. */
16133 /* Try a template. */
16141 /* If the next token isn't a `,' or a `>', then this argument wasn't
16142 really finished. */
16146 {
16147 /* Figure out what is being referred to. If the id-expression
16148 was for a class template specialization, then we will have a
16149 TYPE_DECL at this point. There is no need to do name lookup
16150 at this point in that case. */
16153 none_type,
16159 /* Handle a constrained-type-specifier for a non-type template
16160 parameter. */
16166 }
16168 {
16172 }
16173 /* It must be a non-type argument. In C++17 any constant-expression is
16174 allowed. */
16178 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16180 -- an integral constant-expression of integral or enumeration
16181 type; or
16183 -- the name of a non-type template-parameter; or
16185 -- the name of an object or function with external linkage...
16187 -- the address of an object or function with external linkage...
16189 -- a pointer to member... */
16190 /* Look for a non-type template parameter. */
16192 {
16204 }
16206 /* If the next token is "&", the argument must be the address of an
16207 object or function with external linkage. */
16210 {
16213 }
16214 /* See if we might have an id-expression. */
16221 {
16224 address_p,
16231 else
16232 {
16233 tree probe;
16236 {
16237 /* Strip the dereference temporarily. */
16240 }
16242 /* If we're in a template, we represent a qualified-id referring
16243 to a static data member as a SCOPE_REF even if the scope isn't
16244 dependent so that we can check access control later. */
16249 {
16250 /* A variable without external linkage might still be a
16251 valid constant-expression, so no error is issued here
16252 if the external-linkage check fails. */
16255 }
16257 /* All overloaded functions are allowed; if the external
16258 linkage test does not pass, an error will be issued
16259 later. */
16260 ;
16264 /* A pointer-to-member. */
16265 ;
16267 ;
16268 else
16272 {
16275 tf_warning_or_error);
16276 else
16279 }
16280 }
16281 }
16282 /* If the argument started with "&", there are no other valid
16283 alternatives at this point. */
16285 {
16288 }
16290 general_expr:
16291 /* If the argument wasn't successfully parsed as a type-id followed
16292 by '>>', the argument can only be a constant expression now.
16293 Otherwise, we try parsing the constant-expression tentatively,
16294 because the argument could really be a type-id. */
16300 else
16301 {
16302 /* With C++17 generalized non-type template arguments we need to handle
16303 lvalue constant expressions, too. */
16306 }
16314 /* We did our best to parse the argument as a non type-id, but that
16315 was the only alternative that matched (albeit with a '>' after
16316 it). We can assume it's just a typo from the user, and a
16317 diagnostic will then be issued. */
16319 }
16321 /* Parse an explicit-instantiation.
16323 explicit-instantiation:
16324 template declaration
16326 Although the standard says `declaration', what it really means is:
16328 explicit-instantiation:
16329 template decl-specifier-seq [opt] declarator [opt] ;
16331 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16332 supposed to be allowed. A defect report has been filed about this
16333 issue.
16335 GNU Extension:
16337 explicit-instantiation:
16338 storage-class-specifier template
16339 decl-specifier-seq [opt] declarator [opt] ;
16340 function-specifier template
16341 decl-specifier-seq [opt] declarator [opt] ; */
16343 static void
16345 {
16347 cp_decl_specifier_seq decl_specifiers;
16352 /* Look for an (optional) storage-class-specifier or
16353 function-specifier. */
16355 {
16356 extension_specifier
16359 extension_specifier
16362 }
16364 /* Look for the `template' keyword. */
16366 /* Let the front end know that we are processing an explicit
16367 instantiation. */
16369 /* [temp.explicit] says that we are supposed to ignore access
16370 control while processing explicit instantiation directives. */
16372 /* Parse a decl-specifier-seq. */
16374 CP_PARSER_FLAGS_OPTIONAL,
16377 /* If there was exactly one decl-specifier, and it declared a class,
16378 and there's no declarator, then we have an explicit type
16379 instantiation. */
16381 {
16382 tree type;
16386 /* Turn access control back on for names used during
16387 template instantiation. */
16392 }
16393 else
16394 {
16396 tree decl;
16398 /* Parse the declarator. */
16399 declarator
16410 {
16413 "explicit instantiation shall not use"
16417 "explicit instantiation shall not use"
16422 /* Turn access control back on for names used during
16423 template instantiation. */
16425 /* Do the explicit instantiation. */
16427 }
16428 else
16429 {
16431 /* Skip the body of the explicit instantiation. */
16433 }
16434 }
16435 /* We're done with the instantiation. */
16441 }
16443 /* Parse an explicit-specialization.
16445 explicit-specialization:
16446 template < > declaration
16448 Although the standard says `declaration', what it really means is:
16450 explicit-specialization:
16451 template <> decl-specifier [opt] init-declarator [opt] ;
16452 template <> function-definition
16453 template <> explicit-specialization
16454 template <> template-declaration */
16456 static void
16458 {
16462 /* Look for the `template' keyword. */
16464 /* Look for the `<'. */
16466 /* Look for the `>'. */
16468 /* We have processed another parameter list. */
16470 /* [temp]
16472 A template ... explicit specialization ... shall not have C
16473 linkage. */
16475 {
16477 /* Give it C++ linkage to avoid confusing other parts of the
16478 front end. */
16481 }
16482 else
16484 /* Let the front end know that we are beginning a specialization. */
16486 {
16489 }
16491 /* If the next keyword is `template', we need to figure out whether
16492 or not we're looking a template-declaration. */
16494 {
16499 else
16501 }
16502 else
16503 /* Parse the dependent declaration. */
16509 /* We're done with the specialization. */
16511 /* For the erroneous case of a template with C linkage, we pushed an
16512 implicit C++ linkage scope; exit that scope now. */
16515 /* We're done with this parameter list. */
16517 }
16519 /* Parse a type-specifier.
16521 type-specifier:
16522 simple-type-specifier
16523 class-specifier
16524 enum-specifier
16525 elaborated-type-specifier
16526 cv-qualifier
16528 GNU Extension:
16530 type-specifier:
16531 __complex__
16533 Returns a representation of the type-specifier. For a
16534 class-specifier, enum-specifier, or elaborated-type-specifier, a
16535 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16537 The parser flags FLAGS is used to control type-specifier parsing.
16539 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16540 in a decl-specifier-seq.
16542 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16543 class-specifier, enum-specifier, or elaborated-type-specifier, then
16544 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16545 if a type is declared; 2 if it is defined. Otherwise, it is set to
16546 zero.
16548 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16549 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16550 is set to FALSE. */
16552 static tree
16554 cp_parser_flags flags,
16559 {
16565 /* Assume this type-specifier does not declare a new type. */
16568 /* And that it does not specify a cv-qualifier. */
16571 /* Peek at the next token. */
16574 /* If we're looking at a keyword, we can use that to guide the
16575 production we choose. */
16578 {
16583 /* Look for the enum-specifier. */
16585 /* If that worked, we're done. */
16587 {
16592 type_spec,
16593 token,
16596 }
16597 else
16600 /* Any of these indicate either a class-specifier, or an
16601 elaborated-type-specifier. */
16608 /* Parse tentatively so that we can back up if we don't find a
16609 class-specifier. */
16611 /* Look for the class-specifier. */
16614 /* If that worked, we're done. */
16616 {
16621 type_spec,
16622 token,
16625 }
16627 /* Fall through. */
16628 elaborated_type_specifier:
16629 /* We're declaring (not defining) a class or enum. */
16633 /* Fall through. */
16635 /* Look for an elaborated-type-specifier. */
16636 type_spec
16637 = (cp_parser_elaborated_type_specifier
16640 is_declaration));
16643 type_spec,
16644 token,
16667 /* The `__complex__' keyword is a GNU extension. */
16673 }
16675 /* Handle simple keywords. */
16677 {
16679 {
16682 }
16684 }
16686 /* If we do not already have a type-specifier, assume we are looking
16687 at a simple-type-specifier. */
16689 decl_specs,
16690 flags);
16692 /* If we didn't find a type-specifier, and a type-specifier was not
16693 optional in this context, issue an error message. */
16695 {
16698 }
16701 }
16703 /* Parse a simple-type-specifier.
16705 simple-type-specifier:
16706 :: [opt] nested-name-specifier [opt] type-name
16707 :: [opt] nested-name-specifier template template-id
16708 char
16709 wchar_t
16710 bool
16711 short
16712 int
16713 long
16714 signed
16715 unsigned
16716 float
16717 double
16718 void
16720 C++11 Extension:
16722 simple-type-specifier:
16723 auto
16724 decltype ( expression )
16725 char16_t
16726 char32_t
16727 __underlying_type ( type-id )
16729 C++17 extension:
16731 nested-name-specifier(opt) template-name
16733 GNU Extension:
16735 simple-type-specifier:
16736 __int128
16737 __typeof__ unary-expression
16738 __typeof__ ( type-id )
16739 __typeof__ ( type-id ) { initializer-list , [opt] }
16741 Concepts Extension:
16743 simple-type-specifier:
16744 constrained-type-specifier
16746 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16747 appropriately updated. */
16749 static tree
16752 cp_parser_flags flags)
16753 {
16758 /* Peek at the next token. */
16761 /* If we're looking at a keyword, things are easy. */
16763 {
16798 {
16801 }
16830 {
16831 /* The 'auto' might be the placeholder return type for a function decl
16832 with trailing return type. */
16841 {
16843 {
16850 }
16853 {
16856 }
16859 }
16863 {
16866 }
16869 {
16872 }
16873 else
16877 {
16880 "use of %<auto%> in lambda parameter declaration "
16881 "only available with "
16883 }
16886 "use of %<auto%> in parameter declaration "
16887 "only available with "
16891 "ISO C++ forbids use of %<auto%> in parameter "
16893 }
16894 else
16899 /* Since DR 743, decltype can either be a simple-type-specifier by
16900 itself or begin a nested-name-specifier. Parsing it will replace
16901 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16902 handling below decide what to do. */
16908 /* Consume the `typeof' token. */
16910 /* Parse the operand to `typeof'. */
16912 /* If it is not already a TYPE, take its type. */
16918 token,
16927 token,
16937 token,
16942 }
16944 /* If token is an already-parsed decltype not followed by ::,
16945 it's a simple-type-specifier. */
16948 {
16951 {
16953 token,
16955 /* Remember that we are handling a decltype in order to
16956 implement the resolution of DR 1510 when the argument
16957 isn't instantiation dependent. */
16959 }
16962 }
16964 /* If the type-specifier was for a built-in type, we're done. */
16966 {
16967 /* Record the type. */
16974 type,
16975 token,
16980 /* Consume the token. */
16986 /* There is no valid C++ program where a non-template type is
16987 followed by a "<". That usually indicates that the user thought
16988 that the type was a template. */
16993 }
16995 /* The type-specifier must be a user-defined type. */
16997 {
17001 /* Don't gobble tokens or issue error messages if this is an
17002 optional type-specifier. */
17008 /* Look for the optional `::' operator. */
17009 global_p
17013 /* Look for the nested-name specifier. */
17014 qualified_p
17021 /* If we have seen a nested-name-specifier, and the next token
17022 is `template', then we are using the template-id production. */
17025 {
17026 /* Look for the template-id. */
17030 none_type,
17032 /* If the template-id did not name a type, we are out of
17033 luck. */
17035 {
17038 }
17039 }
17040 /* Otherwise, look for a type-name. */
17041 else
17043 /* Keep track of all name-lookups performed in class scopes. */
17045 && !global_p
17046 && !qualified_p
17050 /* If it didn't work out, we don't have a TYPE. */
17055 {
17069 {
17071 none_type,
17081 else
17082 {
17087 }
17088 }
17089 else
17095 }
17098 token,
17100 }
17102 /* If we didn't get a type-name, issue an error message. */
17104 {
17107 }
17110 {
17111 /* See if TYPE is an Objective-C type, and if so, parse and
17112 accept any protocol references following it. Do this before
17113 the cp_parser_check_for_invalid_template_id() call, because
17114 Objective-C types can be followed by '<...>' which would
17115 enclose protocol names rather than template arguments, and so
17116 everything is fine. */
17119 {
17123 /* Clobber the "unqualified" type previously entered into
17124 DECL_SPECS with the new, improved protocol-qualified version. */
17129 }
17131 /* There is no valid C++ program where a non-template type is
17132 followed by a "<". That usually indicates that the user
17133 thought that the type was a template. */
17135 none_type,
17137 }
17140 }
17142 /* Parse a type-name.
17144 type-name:
17145 class-name
17146 enum-name
17147 typedef-name
17148 simple-template-id [in c++0x]
17150 enum-name:
17151 identifier
17153 typedef-name:
17154 identifier
17156 Concepts:
17158 type-name:
17159 concept-name
17160 partial-concept-id
17162 concept-name:
17163 identifier
17165 Returns a TYPE_DECL for the type. */
17167 static tree
17169 {
17171 }
17173 /* See above. */
17174 static tree
17176 {
17177 tree type_decl;
17179 /* We can't know yet whether it is a class-name or not. */
17181 /* Try a class-name. */
17183 typename_keyword_p,
17185 none_type,
17189 /* If it's not a class-name, keep looking. */
17191 {
17193 /* It must be a typedef-name or an enum-name. */
17197 /* It is either a simple-template-id representing an
17198 instantiation of an alias template... */
17202 none_type,
17204 /* Note that this must be an instantiation of an alias template
17205 because [temp.names]/6 says:
17207 A template-id that names an alias template specialization
17208 is a type-name.
17210 Whereas [temp.names]/7 says:
17212 A simple-template-id that names a class template
17213 specialization is a class-name.
17215 With concepts, this could also be a partial-concept-id that
17216 declares a non-type template parameter. */
17223 else
17227 /* ... Or a typedef-name or an enum-name. */
17229 }
17232 }
17234 /* Check if DECL and ARGS can form a constrained-type-specifier.
17235 If ARGS is non-null, we try to form a concept check of the
17236 form DECL<?, ARGS> where ? is a wildcard that matches any
17237 kind of template argument. If ARGS is NULL, then we try to
17238 form a concept check of the form DECL<?>. */
17240 static tree
17243 {
17246 /* If we a constrained-type-specifier cannot be deduced. */
17250 /* A constrained type specifier can only be found in an
17251 overload set or as a reference to a template declaration.
17253 FIXME: This might be masking a bug. It's possible that
17254 that the deduction below is causing template specializations
17255 to be formed with the wildcard as an argument. */
17259 /* Try to build a call expression that evaluates the
17260 concept. This can fail if the overload set refers
17261 only to non-templates. */
17267 /* Deduce the checked constraint and the prototype parameter.
17269 FIXME: In certain cases, failure to deduce should be a
17270 diagnosable error. */
17271 tree conc;
17272 tree proto;
17276 /* In template parameter scope, this results in a constrained
17277 parameter. Return a descriptor of that parm. */
17281 /* In a parameter-declaration-clause, constrained-type
17282 specifiers result in invented template parameters. */
17284 {
17287 }
17288 else
17289 {
17290 /* Otherwise, we're in a context where the constrained
17291 type name is deduced and the constraint applies
17292 after deduction. */
17294 }
17297 }
17299 /* If DECL refers to a concept, return a TYPE_DECL representing
17300 the result of using the constrained type specifier in the
17301 current context. DECL refers to a concept if
17303 - it is an overload set containing a function concept taking a single
17304 type argument, or
17306 - it is a variable concept taking a single type argument. */
17308 static tree
17310 {
17316 else
17318 }
17320 /* Check if DECL and ARGS form a partial-concept-id. If so,
17321 assign ID to the resulting constrained placeholder.
17323 Returns true if the partial-concept-id designates a placeholder
17324 and false otherwise. Note that *id is set to NULL_TREE in
17325 this case. */
17327 static tree
17329 {
17331 }
17333 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17334 or a concept-name.
17336 enum-name:
17337 identifier
17339 typedef-name:
17340 identifier
17342 concept-name:
17343 identifier
17345 Returns a TYPE_DECL for the type. */
17347 static tree
17349 {
17350 tree type_decl;
17351 tree identifier;
17358 /* Look up the type-name. */
17363 /* If we found an overload set, then it may refer to a concept-name. */
17369 {
17370 /* See if this is an Objective-C type. */
17375 }
17377 /* Issue an error if we did not find a type-name. */
17379 /* In Objective-C, we have the complication that class names are
17380 normally type names and start declarations (eg, the
17381 "NSObject" in "NSObject *object;"), but can be used in an
17382 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17383 is an expression. So, a classname followed by a dot is not a
17384 valid type-name. */
17387 {
17392 }
17393 /* Remember that the name was used in the definition of the
17394 current class so that we can check later to see if the
17395 meaning would have been different after the class was
17396 entirely defined. */
17402 }
17404 /* Parse an elaborated-type-specifier. Note that the grammar given
17405 here incorporates the resolution to DR68.
17407 elaborated-type-specifier:
17408 class-key :: [opt] nested-name-specifier [opt] identifier
17409 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17410 enum-key :: [opt] nested-name-specifier [opt] identifier
17411 typename :: [opt] nested-name-specifier identifier
17412 typename :: [opt] nested-name-specifier template [opt]
17413 template-id
17415 GNU extension:
17417 elaborated-type-specifier:
17418 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17419 class-key attributes :: [opt] nested-name-specifier [opt]
17420 template [opt] template-id
17421 enum attributes :: [opt] nested-name-specifier [opt] identifier
17423 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17424 declared `friend'. If IS_DECLARATION is TRUE, then this
17425 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17426 something is being declared.
17428 Returns the TYPE specified. */
17430 static tree
17434 {
17436 tree identifier;
17439 tree globalscope;
17442 /* See if we're looking at the `enum' keyword. */
17444 {
17445 /* Consume the `enum' token. */
17447 /* Remember that it's an enumeration type. */
17449 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17450 enums) is used here. */
17454 {
17461 /* Consume the `struct' or `class' and parse it anyway. */
17463 }
17464 /* Parse the attributes. */
17466 }
17467 /* Or, it might be `typename'. */
17469 RID_TYPENAME))
17470 {
17471 /* Consume the `typename' token. */
17473 /* Remember that it's a `typename' type. */
17475 }
17476 /* Otherwise it must be a class-key. */
17477 else
17478 {
17482 /* Parse the attributes. */
17484 }
17486 /* Look for the `::' operator. */
17489 /* Look for the nested-name-specifier. */
17490 tree nested_name_specifier;
17492 {
17493 nested_name_specifier
17498 is_declaration);
17501 }
17502 else
17503 /* Even though `typename' is not present, the proposed resolution
17504 to Core Issue 180 says that in `class A<T>::B', `B' should be
17505 considered a type-name, even if `A<T>' is dependent. */
17506 nested_name_specifier
17511 is_declaration);
17512 /* For everything but enumeration types, consider a template-id.
17513 For an enumeration type, consider only a plain identifier. */
17515 {
17517 tree decl;
17519 /* Allow the `template' keyword. */
17521 /* If we didn't see `template', we don't know if there's a
17522 template-id or not. */
17525 /* Parse the template-id. */
17529 tag_type,
17530 is_declaration);
17531 /* If we didn't find a template-id, look for an ordinary
17532 identifier. */
17534 ;
17535 /* We can get here when cp_parser_template_id, called by
17536 cp_parser_class_name with tag_type == none_type, succeeds
17537 and caches a BASELINK. Then, when called again here,
17538 instead of failing and returning an error_mark_node
17539 returns it (see template/typename17.C in C++11).
17540 ??? Could we diagnose this earlier? */
17542 {
17545 }
17546 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17547 in effect, then we must assume that, upon instantiation, the
17548 template will correspond to a class. */
17552 typename_type,
17554 /* If the `typename' keyword is in effect and DECL is not a type
17555 decl, then type is non existent. */
17557 ;
17559 {
17563 /* If the next token is a semicolon, this must be a specialization,
17564 instantiation, or friend declaration. Check the scope while we
17565 still know whether or not we had a nested-name-specifier. */
17570 }
17573 }
17576 {
17581 {
17584 }
17586 /* For a `typename', we needn't call xref_tag. */
17592 /* Template parameter lists apply only if we are not within a
17593 function parameter list. */
17594 bool template_parm_lists_apply
17603 /* Look up a qualified name in the usual way. */
17605 {
17606 tree decl;
17607 tree ambiguous_decls;
17610 tag_type,
17617 /* If the lookup was ambiguous, an error will already have been
17618 issued. */
17622 /* If we are parsing friend declaration, DECL may be a
17623 TEMPLATE_DECL tree node here. However, we need to check
17624 whether this TEMPLATE_DECL results in valid code. Consider
17625 the following example:
17627 namespace N {
17628 template <class T> class C {};
17629 }
17630 class X {
17631 template <class T> friend class N::C; // #1, valid code
17632 };
17633 template <class T> class Y {
17634 friend class N::C; // #2, invalid code
17635 };
17637 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17638 name lookup of `N::C'. We see that friend declaration must
17639 be template for the code to be valid. Note that
17640 processing_template_decl does not work here since it is
17641 always 1 for the above two cases. */
17643 decl = (cp_parser_maybe_treat_template_as_class
17648 {
17650 identifier,
17653 }
17656 {
17660 allow_template);
17664 }
17666 /* Forward declarations of nested types, such as
17668 class C1::C2;
17669 class C1::C2::C3;
17671 are invalid unless all components preceding the final '::'
17672 are complete. If all enclosing types are complete, these
17673 declarations become merely pointless.
17675 Invalid forward declarations of nested types are errors
17676 caught elsewhere in parsing. Those that are pointless arrive
17677 here. */
17684 }
17685 else
17686 {
17687 /* An elaborated-type-specifier sometimes introduces a new type and
17688 sometimes names an existing type. Normally, the rule is that it
17689 introduces a new type only if there is not an existing type of
17690 the same name already in scope. For example, given:
17692 struct S {};
17693 void f() { struct S s; }
17695 the `struct S' in the body of `f' is the same `struct S' as in
17696 the global scope; the existing definition is used. However, if
17697 there were no global declaration, this would introduce a new
17698 local class named `S'.
17700 An exception to this rule applies to the following code:
17702 namespace N { struct S; }
17704 Here, the elaborated-type-specifier names a new type
17705 unconditionally; even if there is already an `S' in the
17706 containing scope this declaration names a new type.
17707 This exception only applies if the elaborated-type-specifier
17708 forms the complete declaration:
17710 [class.name]
17712 A declaration consisting solely of `class-key identifier ;' is
17713 either a redeclaration of the name in the current scope or a
17714 forward declaration of the identifier as a class name. It
17715 introduces the name into the current scope.
17717 We are in this situation precisely when the next token is a `;'.
17719 An exception to the exception is that a `friend' declaration does
17720 *not* name a new type; i.e., given:
17722 struct S { friend struct T; };
17724 `T' is not a new type in the scope of `S'.
17726 Also, `new struct S' or `sizeof (struct S)' never results in the
17727 definition of a new type; a new type can only be declared in a
17728 declaration context. */
17730 tag_scope ts;
17734 /* Friends have special name lookup rules. */
17738 CPP_SEMICOLON))
17739 /* This is a `class-key identifier ;' */
17741 else
17744 template_p =
17745 (template_parm_lists_apply
17748 /* An unqualified name was used to reference this type, so
17749 there were no qualifying templates. */
17757 }
17758 }
17763 /* Allow attributes on forward declarations of classes. */
17765 {
17775 else
17778 }
17781 {
17782 /* Indicate whether this class was declared as a `class' or as a
17783 `struct'. */
17787 }
17789 /* A "<" cannot follow an elaborated type specifier. If that
17790 happens, the user was probably trying to form a template-id. */
17795 }
17797 /* Parse an enum-specifier.
17799 enum-specifier:
17800 enum-head { enumerator-list [opt] }
17801 enum-head { enumerator-list , } [C++0x]
17803 enum-head:
17804 enum-key identifier [opt] enum-base [opt]
17805 enum-key nested-name-specifier identifier enum-base [opt]
17807 enum-key:
17808 enum
17809 enum class [C++0x]
17810 enum struct [C++0x]
17812 enum-base: [C++0x]
17813 : type-specifier-seq
17815 opaque-enum-specifier:
17816 enum-key identifier enum-base [opt] ;
17818 GNU Extensions:
17819 enum-key attributes[opt] identifier [opt] enum-base [opt]
17820 { enumerator-list [opt] }attributes[opt]
17821 enum-key attributes[opt] identifier [opt] enum-base [opt]
17822 { enumerator-list, }attributes[opt] [C++0x]
17824 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17825 if the token stream isn't an enum-specifier after all. */
17827 static tree
17829 {
17830 tree identifier;
17832 tree prev_scope;
17834 tree attributes;
17847 /* Parse tentatively so that we can back up if we don't find a
17848 enum-specifier. */
17851 /* Caller guarantees that the current token is 'enum', an identifier
17852 possibly follows, and the token after that is an opening brace.
17853 If we don't have an identifier, fabricate an anonymous name for
17854 the enumeration being defined. */
17857 /* Parse the "class" or "struct", which indicates a scoped
17858 enumeration type in C++0x. */
17861 {
17865 /* Consume the `struct' or `class' token. */
17869 }
17873 /* Clear the qualification. */
17878 /* Figure out in what scope the declaration is being placed. */
17884 nested_name_specifier
17892 {
17893 tree name;
17897 enum_type,
17902 input_location);
17904 {
17907 {
17908 /* Are template enums allowed in ISO? */
17912 /* ignore a typename reference, for it will be solved by name
17913 in start_enum. */
17915 }
17916 }
17919 else
17920 {
17925 }
17926 }
17927 else
17928 {
17931 else
17932 {
17938 }
17939 }
17942 /* Check for the `:' that denotes a specified underlying type in C++0x.
17943 Note that a ':' could also indicate a bitfield width, however. */
17945 {
17946 cp_decl_specifier_seq type_specifiers;
17948 /* Consume the `:'. */
17951 /* Parse the type-specifier-seq. */
17956 /* At this point this is surely not elaborated type specifier. */
17965 /* If that didn't work, stop. */
17967 {
17973 }
17974 }
17976 /* Look for the `{' but don't consume it yet. */
17978 {
17980 {
17983 {
17986 }
17987 }
17988 /* An opaque-enum-specifier must have a ';' here. */
17991 {
17994 {
17997 }
17998 }
17999 }
18005 {
18007 {
18011 }
18013 {
18015 }
18016 }
18018 /* Issue an error message if type-definitions are forbidden here. */
18021 else
18022 /* Create the new type. We do this before consuming the opening
18023 brace so the enum will be recorded as being on the line of its
18024 tag (or the 'enum' keyword, if there is no tag). */
18028 /* If the next token is not '{' it is an opaque-enum-specifier or an
18029 elaborated-type-specifier. */
18031 {
18035 {
18036 /* The following catches invalid code such as:
18037 enum class S<int>::E { A, B, C }; */
18045 {
18049 nested_name_specifier);
18051 }
18054 {
18056 "%qT for enum declaration does not name a class "
18059 }
18060 /* If that scope does not contain the scope in which the
18061 class was originally declared, the program is invalid. */
18063 nested_name_specifier))
18064 {
18067 "declaration of %qD in namespace %qD which does not "
18070 else
18072 "declaration of %qD in %qD which does not "
18076 }
18077 /* If that scope is the scope where the declaration is being placed
18078 the program is invalid. */
18082 {
18086 }
18087 }
18092 /* Consume the opening brace. */
18099 {
18103 }
18104 else
18105 {
18111 }
18115 /* If the next token is not '}', then there are some enumerators. */
18117 {
18121 }
18122 else
18125 /* Consume the final '}'. */
18131 }
18132 else
18133 {
18134 /* If a ';' follows, then it is an opaque-enum-specifier
18135 and additional restrictions apply. */
18137 {
18144 }
18145 }
18147 /* Look for trailing attributes to apply to this enumeration, and
18148 apply them if appropriate. */
18150 {
18153 trailing_attr,
18155 }
18157 /* Finish up the enumeration. */
18159 {
18164 }
18167 {
18169 {
18172 }
18174 {
18176 }
18177 }
18178 out:
18181 }
18183 /* Parse an enumerator-list. The enumerators all have the indicated
18184 TYPE.
18186 enumerator-list:
18187 enumerator-definition
18188 enumerator-list , enumerator-definition */
18190 static void
18192 {
18194 {
18195 /* Parse an enumerator-definition. */
18198 /* If the next token is not a ',', we've reached the end of
18199 the list. */
18202 /* Otherwise, consume the `,' and keep going. */
18204 /* If the next token is a `}', there is a trailing comma. */
18206 {
18211 }
18212 }
18213 }
18215 /* Parse an enumerator-definition. The enumerator has the indicated
18216 TYPE.
18218 enumerator-definition:
18219 enumerator
18220 enumerator = constant-expression
18222 enumerator:
18223 identifier
18225 GNU Extensions:
18227 enumerator-definition:
18228 enumerator attributes [opt]
18229 enumerator attributes [opt] = constant-expression */
18231 static void
18233 {
18234 tree identifier;
18235 tree value;
18236 location_t loc;
18238 /* Save the input location because we are interested in the location
18239 of the identifier and not the location of the explicit value. */
18242 /* Look for the identifier. */
18247 /* Parse any specified attributes. */
18250 /* If the next token is an '=', then there is an explicit value. */
18252 {
18253 /* Consume the `=' token. */
18255 /* Parse the value. */
18257 }
18258 else
18261 /* If we are processing a template, make sure the initializer of the
18262 enumerator doesn't contain any bare template parameter pack. */
18266 /* Create the enumerator. */
18268 }
18270 /* Parse a namespace-name.
18272 namespace-name:
18273 original-namespace-name
18274 namespace-alias
18276 Returns the NAMESPACE_DECL for the namespace. */
18278 static tree
18280 {
18281 tree identifier;
18282 tree namespace_decl;
18286 /* Get the name of the namespace. */
18291 /* Look up the identifier in the currently active scope. Look only
18292 for namespaces, due to:
18294 [basic.lookup.udir]
18296 When looking up a namespace-name in a using-directive or alias
18297 definition, only namespace names are considered.
18299 And:
18301 [basic.lookup.qual]
18303 During the lookup of a name preceding the :: scope resolution
18304 operator, object, function, and enumerator names are ignored.
18306 (Note that cp_parser_qualifying_entity only calls this
18307 function if the token after the name is the scope resolution
18308 operator.) */
18310 none_type,
18316 /* If it's not a namespace, issue an error. */
18319 {
18324 }
18327 }
18329 /* Parse a namespace-definition.
18331 namespace-definition:
18332 named-namespace-definition
18333 unnamed-namespace-definition
18335 named-namespace-definition:
18336 original-namespace-definition
18337 extension-namespace-definition
18339 original-namespace-definition:
18340 namespace identifier { namespace-body }
18342 extension-namespace-definition:
18343 namespace original-namespace-name { namespace-body }
18345 unnamed-namespace-definition:
18346 namespace { namespace-body } */
18348 static void
18350 {
18351 tree identifier;
18360 {
18363 }
18365 /* Look for the `namespace' keyword. */
18366 cp_token* token
18369 /* Parse any specified attributes before the identifier. */
18373 {
18377 {
18380 /* Parse any attributes specified after the identifier. */
18382 }
18389 "nested namespace definitions only available with "
18392 /* Nested namespace names can create new namespaces (unlike
18393 other qualified-ids). */
18396 else
18399 }
18411 /* Start the namespace. */
18418 /* Look for the `{' to validate starting the namespace. */
18420 {
18421 /* Parse the body of the namespace. */
18424 /* Look for the final `}'. */
18426 }
18431 /* Pop the nested namespace definitions. */
18434 }
18436 /* Parse a namespace-body.
18438 namespace-body:
18439 declaration-seq [opt] */
18441 static void
18443 {
18445 }
18447 /* Parse a namespace-alias-definition.
18449 namespace-alias-definition:
18450 namespace identifier = qualified-namespace-specifier ; */
18452 static void
18454 {
18455 tree identifier;
18456 tree namespace_specifier;
18460 /* Look for the `namespace' keyword. */
18462 /* Look for the identifier. */
18466 /* Look for the `=' token. */
18469 {
18471 /* Skip the definition. */
18476 }
18478 /* Look for the qualified-namespace-specifier. */
18479 namespace_specifier
18481 /* Look for the `;' token. */
18484 /* Register the alias in the symbol table. */
18486 }
18488 /* Parse a qualified-namespace-specifier.
18490 qualified-namespace-specifier:
18491 :: [opt] nested-name-specifier [opt] namespace-name
18493 Returns a NAMESPACE_DECL corresponding to the specified
18494 namespace. */
18496 static tree
18498 {
18499 /* Look for the optional `::'. */
18503 /* Look for the optional nested-name-specifier. */
18511 }
18513 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18514 access declaration.
18516 using-declaration:
18517 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18518 using :: unqualified-id ;
18520 access-declaration:
18521 qualified-id ;
18523 */
18525 static bool
18528 {
18532 tree decl;
18533 tree identifier;
18534 tree qscope;
18539 {
18542 }
18543 else
18544 {
18545 /* Look for the `using' keyword. */
18548 again:
18549 /* Peek at the next token. */
18551 /* See if it's `typename'. */
18553 {
18554 /* Remember that we've seen it. */
18556 /* Consume the `typename' token. */
18558 }
18559 }
18561 /* Look for the optional global scope qualification. */
18562 global_scope_p
18567 /* If we saw `typename', or didn't see `::', then there must be a
18568 nested-name-specifier present. */
18570 {
18576 {
18579 }
18580 }
18581 /* Otherwise, we could be in either of the two productions. In that
18582 case, treat the nested-name-specifier as optional. */
18583 else
18595 /* Something has already gone wrong; there's no need to parse
18596 further. Since an error has occurred, the return value of
18597 cp_parser_parse_definitely will be false, as required. */
18601 /* Parse the unqualified-id. */
18609 {
18614 }
18616 {
18621 "pack expansion in using-declaration only available "
18624 }
18626 /* The function we call to handle a using-declaration is different
18627 depending on what scope we are in. */
18629 ;
18632 /* [namespace.udecl]
18634 A using declaration shall not name a template-id. */
18637 else
18638 {
18640 {
18641 /* Create the USING_DECL. */
18648 {
18651 }
18652 else
18653 /* Add it to the list of members in this class. */
18655 }
18656 else
18657 {
18659 identifier,
18666 {
18669 }
18672 else
18674 }
18675 }
18679 {
18683 "comma-separated list in using-declaration only available "
18686 }
18688 /* Look for the final `;'. */
18693 "access declarations are deprecated "
18694 "in favour of using-declarations; "
18698 }
18700 /* Parse an alias-declaration.
18702 alias-declaration:
18703 using identifier attribute-specifier-seq [opt] = type-id */
18705 static tree
18707 {
18709 location_t id_location;
18711 cp_decl_specifier_seq decl_specs;
18715 /* Look for the `using' keyword. */
18716 cp_token *using_token
18738 /* Now we are going to parse the type-id of the declaration. */
18740 /*
18741 [dcl.type]/3 says:
18743 "A type-specifier-seq shall not define a class or enumeration
18744 unless it appears in the type-id of an alias-declaration (7.1.3) that
18745 is not the declaration of a template-declaration."
18747 In other words, if we currently are in an alias template, the
18748 type-id should not define a type.
18750 So let's set parser->type_definition_forbidden_message in that
18751 case; cp_parser_check_type_definition (called by
18752 cp_parser_class_specifier) will then emit an error if a type is
18753 defined in the type-id. */
18755 {
18759 }
18763 /* Restore the error message if need be. */
18769 {
18772 }
18774 /* A typedef-name can also be introduced by an alias-declaration. The
18775 identifier following the using keyword becomes a typedef-name. It has
18776 the same semantics as if it were introduced by the typedef
18777 specifier. In particular, it does not define a new type and it shall
18778 not appear in the type-id. */
18783 {
18786 ds_attribute,
18787 attrs_token);
18788 }
18790 ds_typedef,
18791 using_token);
18793 ds_alias,
18794 using_token);
18803 else
18809 // Attach constraints to the alias declaration.
18811 {
18815 }
18822 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18823 added into the symbol table; otherwise, return the TYPE_DECL. */
18827 {
18831 }
18834 }
18836 /* Parse a using-directive.
18838 using-directive:
18839 using namespace :: [opt] nested-name-specifier [opt]
18840 namespace-name ; */
18842 static void
18844 {
18845 tree namespace_decl;
18846 tree attribs;
18848 /* Look for the `using' keyword. */
18850 /* And the `namespace' keyword. */
18852 /* Look for the optional `::' operator. */
18854 /* And the optional nested-name-specifier. */
18860 /* Get the namespace being used. */
18862 /* And any specified attributes. */
18865 /* Update the symbol table. */
18868 else
18871 /* Look for the final `;'. */
18873 }
18875 /* Parse an asm-definition.
18877 asm-definition:
18878 asm ( string-literal ) ;
18880 GNU Extension:
18882 asm-definition:
18883 asm volatile [opt] ( string-literal ) ;
18884 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18885 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18886 : asm-operand-list [opt] ) ;
18887 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18888 : asm-operand-list [opt]
18889 : asm-clobber-list [opt] ) ;
18890 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18891 : asm-clobber-list [opt]
18892 : asm-goto-list ) ; */
18894 static void
18896 {
18897 tree string;
18902 tree asm_stmt;
18910 /* Look for the `asm' keyword. */
18915 {
18918 }
18920 /* See if the next token is `volatile'. */
18923 {
18924 /* Remember that we saw the `volatile' keyword. */
18926 /* Consume the token. */
18928 }
18932 {
18933 /* Remember that we saw the `goto' keyword. */
18935 /* Consume the token. */
18937 }
18938 /* Look for the opening `('. */
18941 /* Look for the string. */
18944 {
18948 }
18950 /* If we're allowing GNU extensions, check for the extended assembly
18951 syntax. Unfortunately, the `:' tokens need not be separated by
18952 a space in C, and so, for compatibility, we tolerate that here
18953 too. Doing that means that we have to treat the `::' operator as
18954 two `:' tokens. */
18959 {
18964 /* The extended syntax was used. */
18967 /* Look for outputs. */
18969 {
18970 /* Consume the `:'. */
18972 /* Parse the output-operands. */
18974 CPP_COLON)
18976 CPP_SCOPE)
18978 CPP_CLOSE_PAREN)
18980 {
18984 }
18985 }
18986 /* If the next token is `::', there are no outputs, and the
18987 next token is the beginning of the inputs. */
18989 /* The inputs are coming next. */
18992 /* Look for inputs. */
18995 {
18996 /* Consume the `:' or `::'. */
18998 /* Parse the output-operands. */
19000 CPP_COLON)
19002 CPP_SCOPE)
19004 CPP_CLOSE_PAREN))
19005 {
19009 }
19010 }
19012 /* The clobbers are coming next. */
19015 /* Look for clobbers. */
19018 {
19020 /* Consume the `:' or `::'. */
19022 /* Parse the clobbers. */
19024 CPP_COLON)
19026 CPP_CLOSE_PAREN))
19028 }
19031 /* The labels are coming next. */
19034 /* Look for labels. */
19037 {
19039 /* Consume the `:' or `::'. */
19041 /* Parse the labels. */
19043 }
19047 }
19051 /* Look for the closing `)'. */
19059 {
19060 /* Create the ASM_EXPR. */
19062 {
19065 /* If the extended syntax was not used, mark the ASM_EXPR. */
19067 {
19073 }
19074 }
19075 else
19077 }
19078 }
19080 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19081 type that comes from the decl-specifier-seq. */
19083 static tree
19085 {
19088 {
19101 }
19104 }
19106 /* Declarators [gram.dcl.decl] */
19108 /* Parse an init-declarator.
19110 init-declarator:
19111 declarator initializer [opt]
19113 GNU Extension:
19115 init-declarator:
19116 declarator asm-specification [opt] attributes [opt] initializer [opt]
19118 function-definition:
19119 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19120 function-body
19121 decl-specifier-seq [opt] declarator function-try-block
19123 GNU Extension:
19125 function-definition:
19126 __extension__ function-definition
19128 TM Extension:
19130 function-definition:
19131 decl-specifier-seq [opt] declarator function-transaction-block
19133 The DECL_SPECIFIERS apply to this declarator. Returns a
19134 representation of the entity declared. If MEMBER_P is TRUE, then
19135 this declarator appears in a class scope. The new DECL created by
19136 this declarator is returned.
19138 The CHECKS are access checks that should be performed once we know
19139 what entity is being declared (and, therefore, what classes have
19140 befriended it).
19142 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19143 for a function-definition here as well. If the declarator is a
19144 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19145 be TRUE upon return. By that point, the function-definition will
19146 have been completely parsed.
19148 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19149 is FALSE.
19151 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19152 parsed declaration if it is an uninitialized single declarator not followed
19153 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19154 if present, will not be consumed. If returned, this declarator will be
19155 created with SD_INITIALIZED but will not call cp_finish_decl.
19157 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19158 and there is an initializer, the pointed location_t is set to the
19159 location of the '=' or `(', or '{' in C++11 token introducing the
19160 initializer. */
19162 static tree
19173 {
19177 tree prefix_attributes;
19179 tree asm_specification;
19180 tree initializer;
19182 tree scope;
19184 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19185 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19186 "(...)". */
19197 /* Gather the attributes that were provided with the
19198 decl-specifiers. */
19201 /* Assume that this is not the declarator for a function
19202 definition. */
19206 /* Default arguments are only permitted for function parameters. */
19210 /* Defer access checks while parsing the declarator; we cannot know
19211 what names are accessible until we know what is being
19212 declared. */
19217 /* Parse the declarator. */
19218 declarator
19223 /* Gather up the deferred checks. */
19228 /* If the DECLARATOR was erroneous, there's no need to go
19229 further. */
19233 /* Check that the number of template-parameter-lists is OK. */
19243 /* Figure out what scope the entity declared by the DECLARATOR is
19244 located in. `grokdeclarator' sometimes changes the scope, so
19245 we compute it now. */
19248 /* Perform any lookups in the declared type which were thought to be
19249 dependent, but are not in the scope of the declarator. */
19250 decl_specifiers->type
19253 /* If we're allowing GNU extensions, look for an
19254 asm-specification. */
19256 {
19257 /* Look for an asm-specification. */
19260 }
19261 else
19264 /* Look for attributes. */
19268 /* Peek at the next token. */
19274 {
19275 /* Handle C++17 deduction guides. */
19279 {
19287 {
19291 }
19292 }
19294 /* Check to see if the token indicates the start of a
19295 function-definition. */
19297 {
19299 {
19300 /* If a function-definition should not appear here, issue an
19301 error message. */
19305 }
19307 location_t func_brace_location
19310 /* Neither attributes nor an asm-specification are allowed
19311 on a function-definition. */
19314 "an asm-specification is not allowed "
19318 "attributes are not allowed "
19320 /* This is a function-definition. */
19323 /* Parse the function definition. */
19326 decl_specifiers,
19327 declarator,
19328 prefix_attributes);
19329 else
19330 decl =
19331 (cp_parser_function_definition_from_specifiers_and_declarator
19335 {
19336 /* This is where the prologue starts... */
19339 }
19342 }
19343 }
19345 {
19346 /* A non-template declaration involving a function parameter list
19347 containing an implicit template parameter will be made into a
19348 template. If the resulting declaration is not going to be an
19349 actual function then finish the template scope here to prevent it.
19350 An error message will be issued once we have a decl to talk about.
19352 FIXME probably we should do type deduction rather than create an
19353 implicit template, but the standard currently doesn't allow it. */
19356 }
19358 /* [dcl.dcl]
19360 Only in function declarations for constructors, destructors, type
19361 conversions, and deduction guides can the decl-specifier-seq be omitted.
19363 We explicitly postpone this check past the point where we handle
19364 function-definitions because we tolerate function-definitions
19365 that are missing their return types in some modes. */
19367 {
19371 }
19373 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19377 {
19388 {
19394 }
19395 }
19396 else
19397 {
19398 /* If the init-declarator isn't initialized and isn't followed by a
19399 `,' or `;', it's not a valid init-declarator. */
19402 {
19405 else
19406 {
19410 }
19411 }
19414 }
19416 /* Because start_decl has side-effects, we should only call it if we
19417 know we're going ahead. By this point, we know that we cannot
19418 possibly be looking at any other construct. */
19421 /* Enter the newly declared entry in the symbol table. If we're
19422 processing a declaration in a class-specifier, we wait until
19423 after processing the initializer. */
19425 {
19433 /* Adjust location of decl if declarator->id_loc is more appropriate:
19434 set, and decl wasn't merged with another decl, in which case its
19435 location would be different from input_location, and more accurate. */
19440 }
19442 /* Enter the SCOPE. That way unqualified names appearing in the
19443 initializer will be looked up in SCOPE. */
19446 /* Perform deferred access control checks, now that we know in which
19447 SCOPE the declared entity resides. */
19449 {
19452 /* If the entity being declared is a function, pretend that we
19453 are in its scope. If it is a `friend', it may have access to
19454 things that would not otherwise be accessible. */
19456 {
19459 }
19461 /* Perform access checks for template parameters. */
19464 /* Perform the access control checks for the declarator and the
19465 decl-specifiers. */
19468 /* Restore the saved value. */
19471 }
19473 /* Parse the initializer. */
19478 {
19480 {
19483 else
19484 {
19485 /* If the declaration was erroneous, we don't really
19486 know what the user intended, so just silently
19487 consume the initializer. */
19494 }
19495 }
19496 else
19497 {
19498 /* We want to record the extra mangling scope for in-class
19499 initializers of class members and initializers of static data
19500 member templates. The former involves deferring
19501 parsing of the initializer until end of class as with default
19502 arguments. So right here we only handle the latter. */
19512 }
19513 }
19515 /* The old parser allows attributes to appear after a parenthesized
19516 initializer. Mark Mitchell proposed removing this functionality
19517 on the GCC mailing lists on 2002-08-13. This parser accepts the
19518 attributes -- but ignores them. */
19525 /* And now complain about a non-function implicit template. */
19530 /* For an in-class declaration, use `grokfield' to create the
19531 declaration. */
19533 {
19535 {
19538 }
19547 }
19549 /* Finish processing the declaration. But, skip member
19550 declarations. */
19552 {
19555 asm_specification,
19556 /* If the initializer is in parentheses, then this is
19557 a direct-initialization, which means that an
19558 `explicit' constructor is OK. Otherwise, an
19559 `explicit' constructor cannot be used. */
19562 }
19565 /* Core issue #226 (C++0x only): A default template-argument
19566 shall not be specified in a friend class template
19567 declaration. */
19576 {
19579 else
19581 }
19588 }
19590 /* Parse a declarator.
19592 declarator:
19593 direct-declarator
19594 ptr-operator declarator
19596 abstract-declarator:
19597 ptr-operator abstract-declarator [opt]
19598 direct-abstract-declarator
19600 GNU Extensions:
19602 declarator:
19603 attributes [opt] direct-declarator
19604 attributes [opt] ptr-operator declarator
19606 abstract-declarator:
19607 attributes [opt] ptr-operator abstract-declarator [opt]
19608 attributes [opt] direct-abstract-declarator
19610 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19611 detect constructors, destructors, deduction guides, or conversion operators.
19612 It is set to -1 if the declarator is a name, and +1 if it is a
19613 function. Otherwise it is set to zero. Usually you just want to
19614 test for >0, but internally the negative value is used.
19616 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19617 a decl-specifier-seq unless it declares a constructor, destructor,
19618 or conversion. It might seem that we could check this condition in
19619 semantic analysis, rather than parsing, but that makes it difficult
19620 to handle something like `f()'. We want to notice that there are
19621 no decl-specifiers, and therefore realize that this is an
19622 expression, not a declaration.)
19624 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19625 the declarator is a direct-declarator of the form "(...)".
19627 MEMBER_P is true iff this declarator is a member-declarator.
19629 FRIEND_P is true iff this declarator is a friend. */
19633 cp_parser_declarator_kind dcl_kind,
19637 {
19640 cp_cv_quals cv_quals;
19641 tree class_type;
19644 /* Assume this is not a constructor, destructor, or type-conversion
19645 operator. */
19652 /* Check for the ptr-operator production. */
19654 /* Parse the ptr-operator. */
19660 /* If that worked, then we have a ptr-operator. */
19662 {
19663 /* If a ptr-operator was found, then this declarator was not
19664 parenthesized. */
19667 /* The dependent declarator is optional if we are parsing an
19668 abstract-declarator. */
19672 /* Parse the dependent declarator. */
19677 friend_p);
19679 /* If we are parsing an abstract-declarator, we must handle the
19680 case where the dependent declarator is absent. */
19685 declarator = cp_parser_make_indirect_declarator
19687 }
19688 /* Everything else is a direct-declarator. */
19689 else
19690 {
19693 CPP_OPEN_PAREN);
19695 ctor_dtor_or_conv_p,
19697 }
19702 }
19704 /* Parse a direct-declarator or direct-abstract-declarator.
19706 direct-declarator:
19707 declarator-id
19708 direct-declarator ( parameter-declaration-clause )
19709 cv-qualifier-seq [opt]
19710 ref-qualifier [opt]
19711 exception-specification [opt]
19712 direct-declarator [ constant-expression [opt] ]
19713 ( declarator )
19715 direct-abstract-declarator:
19716 direct-abstract-declarator [opt]
19717 ( parameter-declaration-clause )
19718 cv-qualifier-seq [opt]
19719 ref-qualifier [opt]
19720 exception-specification [opt]
19721 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19722 ( abstract-declarator )
19724 Returns a representation of the declarator. DCL_KIND is
19725 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19726 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19727 we are parsing a direct-declarator. It is
19728 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19729 of ambiguity we prefer an abstract declarator, as per
19730 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19731 as for cp_parser_declarator. */
19735 cp_parser_declarator_kind dcl_kind,
19738 {
19748 {
19749 /* Peek at the next token. */
19752 {
19753 /* This is either a parameter-declaration-clause, or a
19754 parenthesized declarator. When we know we are parsing a
19755 named declarator, it must be a parenthesized declarator
19756 if FIRST is true. For instance, `(int)' is a
19757 parameter-declaration-clause, with an omitted
19758 direct-abstract-declarator. But `((*))', is a
19759 parenthesized abstract declarator. Finally, when T is a
19760 template parameter `(T)' is a
19761 parameter-declaration-clause, and not a parenthesized
19762 named declarator.
19764 We first try and parse a parameter-declaration-clause,
19765 and then try a nested declarator (if FIRST is true).
19767 It is not an error for it not to be a
19768 parameter-declaration-clause, even when FIRST is
19769 false. Consider,
19771 int i (int);
19772 int i (3);
19774 The first is the declaration of a function while the
19775 second is the definition of a variable, including its
19776 initializer.
19778 Having seen only the parenthesis, we cannot know which of
19779 these two alternatives should be selected. Even more
19780 complex are examples like:
19782 int i (int (a));
19783 int i (int (3));
19785 The former is a function-declaration; the latter is a
19786 variable initialization.
19788 Thus again, we try a parameter-declaration-clause, and if
19789 that fails, we back out and return. */
19792 {
19793 tree params;
19796 /* In a member-declarator, the only valid interpretation
19797 of a parenthesis is the start of a
19798 parameter-declaration-clause. (It is invalid to
19799 initialize a static data member with a parenthesized
19800 initializer; only the "=" form of initialization is
19801 permitted.) */
19805 /* Consume the `('. */
19808 {
19809 /* If this is going to be an abstract declarator, we're
19810 in a declarator and we can't have default args. */
19813 }
19817 /* Parse the parameter-declaration-clause. */
19820 /* Consume the `)'. */
19823 /* If all went well, parse the cv-qualifier-seq,
19824 ref-qualifier and the exception-specification. */
19826 {
19827 cp_cv_quals cv_quals;
19828 cp_virt_specifiers virt_specifiers;
19829 cp_ref_qualifier ref_qual;
19830 tree exception_specification;
19831 tree late_return;
19832 tree attrs;
19842 /* Parse the cv-qualifier-seq. */
19844 /* Parse the ref-qualifier. */
19846 /* Parse the tx-qualifier. */
19848 /* And the exception-specification. */
19849 exception_specification
19854 /* In here, we handle cases where attribute is used after
19855 the function declaration. For example:
19856 void func (int x) __attribute__((vector(..))); */
19860 {
19864 CPP_SEMICOLON)
19866 CPP_OPEN_BRACE))
19869 ;
19870 else
19872 }
19874 late_return = (cp_parser_late_return_type_opt
19878 /* Parse the virt-specifier-seq. */
19881 /* Create the function-declarator. */
19883 params,
19884 cv_quals,
19885 virt_specifiers,
19886 ref_qual,
19887 tx_qual,
19888 exception_specification,
19889 late_return,
19890 requires_clause);
19893 /* Any subsequent parameter lists are to do with
19894 return type, so are not those of the declared
19895 function. */
19897 }
19899 /* Remove the function parms from scope. */
19903 /* Repeat the main loop. */
19905 }
19907 /* If this is the first, we can try a parenthesized
19908 declarator. */
19910 {
19916 /* Consume the `('. */
19918 /* Parse the nested declarator. */
19921 declarator
19927 /* Expect a `)'. */
19934 }
19935 /* Otherwise, we must be done. */
19936 else
19938 }
19942 {
19943 /* Parse an array-declarator. */
19952 /* Consume the `['. */
19954 /* Peek at the next token. */
19956 /* If the next token is `]', then there is no
19957 constant-expression. */
19959 {
19961 bounds
19971 {
19972 /* Normally, the array bound must be an integral constant
19973 expression. However, as an extension, we allow VLAs
19974 in function scopes as long as they aren't part of a
19975 parameter declaration. */
19979 }
19982 {
19983 /* Remember this wasn't a constant-expression. */
19986 }
19987 }
19988 else
19990 /* Look for the closing `]'. */
19992 {
19995 }
20000 }
20002 {
20003 {
20004 tree qualifying_scope;
20005 tree unqualified_name;
20006 tree attrs;
20007 special_function_kind sfk;
20012 /* Parse a declarator-id */
20015 {
20018 /* If we see an ellipsis, we should be looking at a
20019 parameter pack. */
20021 {
20022 /* Consume the `...' */
20026 }
20027 }
20030 unqualified_name
20034 {
20038 {
20039 /* Check whether an error occurred. */
20042 /* We already consumed the ellipsis to mark a
20043 parameter pack, but we have no way to report it,
20044 so abort the tentative parse. We will be exiting
20045 immediately anyway. */
20047 }
20048 else
20054 && (qualifying_scope
20056 {
20059 }
20060 }
20065 {
20070 }
20076 {
20077 /* In the declaration of a member of a template class
20078 outside of the class itself, the SCOPE will sometimes
20079 be a TYPENAME_TYPE. For example, given:
20081 template <typename T>
20082 int S<T>::R::i = 3;
20084 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20085 this context, we must resolve S<T>::R to an ordinary
20086 type, rather than a typename type.
20088 The reason we normally avoid resolving TYPENAME_TYPEs
20089 is that a specialization of `S' might render
20090 `S<T>::R' not a type. However, if `S' is
20091 specialized, then this `i' will not be used, so there
20092 is no harm in resolving the types here. */
20093 tree type;
20095 /* Resolve the TYPENAME_TYPE. */
20098 /* If that failed, the declarator is invalid. */
20100 {
20103 "cannot define member of dependent typedef "
20105 else
20110 }
20112 }
20117 {
20118 tree class_type;
20123 else
20127 {
20131 {
20132 /* We do not attempt to print the declarator
20133 here because we do not have enough
20134 information about its original syntactic
20135 form. */
20139 }
20142 {
20146 "use %<%T::%D%> instead of %<%T::%D%> to "
20148 class_type,
20153 }
20155 }
20158 {
20165 for an unnamed type, even if the type
20166 got a name for linkage purposes. */
20168 /* Handle correctly (c++/19200):
20170 struct S {
20171 struct T{};
20172 friend void S(T);
20173 };
20175 and also:
20177 namespace N {
20178 void S();
20179 }
20181 struct S {
20182 friend void N::S();
20183 }; */
20186 class_type))
20195 }
20196 }
20198 unqualified_name,
20199 sfk);
20206 }
20208 handle_declarator:;
20211 {
20212 /* Any names that appear after the declarator-id for a
20213 member are looked up in the containing scope. */
20215 {
20216 /* But declarations with qualified-ids can't appear in a
20217 function. */
20221 }
20223 }
20227 /* Default args are only allowed on function
20228 declarations. */
20230 else
20234 }
20235 /* We're done. */
20236 else
20238 }
20240 /* For an abstract declarator, we might wind up with nothing at this
20241 point. That's an error; the declarator is not optional. */
20245 /* If we entered a scope, we must exit it now. */
20253 }
20255 /* Parse a ptr-operator.
20257 ptr-operator:
20258 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20259 * cv-qualifier-seq [opt]
20260 &
20261 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20262 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20264 GNU Extension:
20266 ptr-operator:
20267 & cv-qualifier-seq [opt]
20269 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20270 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20271 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20272 filled in with the TYPE containing the member. *CV_QUALS is
20273 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20274 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20275 Note that the tree codes returned by this function have nothing
20276 to do with the types of trees that will be eventually be created
20277 to represent the pointer or reference type being parsed. They are
20278 just constants with suggestive names. */
20279 static enum tree_code
20284 {
20289 /* Assume that it's not a pointer-to-member. */
20291 /* And that there are no cv-qualifiers. */
20294 /* Peek at the next token. */
20297 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20307 {
20308 /* Consume the `*', `&' or `&&'. */
20311 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20312 `&', if we are allowing GNU extensions. (The only qualifier
20313 that can legally appear after `&' is `restrict', but that is
20314 enforced during semantic analysis. */
20322 }
20323 else
20324 {
20325 /* Try the pointer-to-member case. */
20327 /* Look for the optional `::' operator. */
20330 /* Look for the nested-name specifier. */
20337 /* If we found it, and the next token is a `*', then we are
20338 indeed looking at a pointer-to-member operator. */
20341 {
20342 /* Indicate that the `*' operator was used. */
20350 else
20351 {
20352 /* The type of which the member is a member is given by the
20353 current SCOPE. */
20355 /* The next name will not be qualified. */
20359 /* Look for optional c++11 attributes. */
20363 /* Look for the optional cv-qualifier-seq. */
20365 }
20366 }
20367 /* If that didn't work we don't have a ptr-operator. */
20370 }
20373 }
20375 /* Parse an (optional) cv-qualifier-seq.
20377 cv-qualifier-seq:
20378 cv-qualifier cv-qualifier-seq [opt]
20380 cv-qualifier:
20381 const
20382 volatile
20384 GNU Extension:
20386 cv-qualifier:
20387 __restrict__
20389 Returns a bitmask representing the cv-qualifiers. */
20391 static cp_cv_quals
20393 {
20397 {
20399 cp_cv_quals cv_qualifier;
20401 /* Peek at the next token. */
20403 /* See if it's a cv-qualifier. */
20405 {
20421 }
20427 {
20432 }
20433 else
20434 {
20437 }
20438 }
20441 }
20443 /* Parse an (optional) ref-qualifier
20445 ref-qualifier:
20446 &
20447 &&
20449 Returns cp_ref_qualifier representing ref-qualifier. */
20451 static cp_ref_qualifier
20453 {
20456 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20461 {
20466 {
20478 }
20483 {
20486 }
20487 else
20488 {
20491 }
20492 }
20495 }
20497 /* Parse an optional tx-qualifier.
20499 tx-qualifier:
20500 transaction_safe
20501 transaction_safe_dynamic */
20503 static tree
20505 {
20508 {
20513 {
20517 {
20520 {
20523 }
20524 else
20526 }
20527 }
20528 }
20530 }
20532 /* Parse an (optional) virt-specifier-seq.
20534 virt-specifier-seq:
20535 virt-specifier virt-specifier-seq [opt]
20537 virt-specifier:
20538 override
20539 final
20541 Returns a bitmask representing the virt-specifiers. */
20543 static cp_virt_specifiers
20545 {
20549 {
20551 cp_virt_specifiers virt_specifier;
20553 /* Peek at the next token. */
20555 /* See if it's a virt-specifier-qualifier. */
20559 {
20562 }
20564 {
20567 }
20569 {
20571 }
20572 else
20576 {
20581 }
20582 else
20583 {
20586 }
20587 }
20589 }
20591 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20592 is in scope even though it isn't real. */
20594 void
20596 {
20597 tree this_parm;
20600 {
20601 /* We don't clear this between NSDMIs. Is it already what we want? */
20606 }
20609 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20611 current_class_ref
20614 }
20616 /* Return true iff our current scope is a non-static data member
20617 initializer. */
20619 bool
20621 {
20622 /* We recognize NSDMI context by the context-less 'this' pointer set up
20623 by the function above. */
20629 }
20631 /* Return true iff our current scope is a default capturing generic lambda
20632 defined within a template. FIXME: This is part of a workaround (see
20633 semantics.c) to handle building lambda closure types correctly in templates
20634 which we ultimately want to defer to instantiation time. */
20636 bool
20638 {
20656 }
20658 /* Parse a late-specified return type, if any. This is not a separate
20659 non-terminal, but part of a function declarator, which looks like
20661 -> trailing-type-specifier-seq abstract-declarator(opt)
20663 Returns the type indicated by the type-id.
20665 In addition to this, parse any queued up #pragma omp declare simd
20666 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20667 #pragma acc routine clauses.
20669 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20670 function. */
20672 static tree
20675 {
20679 && declarator
20686 && declarator
20689 /* Peek at the next token. */
20691 /* A late-specified return type is indicated by an initial '->'. */
20702 {
20703 /* DR 1207: 'this' is in scope in the trailing return type. */
20705 }
20708 {
20709 /* Consume the ->. */
20713 }
20715 /* Function declarations may be followed by a trailing
20716 requires-clause. */
20720 declarator->attributes
20724 declarator->attributes
20728 declarator->attributes
20733 {
20736 }
20739 }
20741 /* Parse a declarator-id.
20743 declarator-id:
20744 id-expression
20745 :: [opt] nested-name-specifier [opt] type-name
20747 In the `id-expression' case, the value returned is as for
20748 cp_parser_id_expression if the id-expression was an unqualified-id.
20749 If the id-expression was a qualified-id, then a SCOPE_REF is
20750 returned. The first operand is the scope (either a NAMESPACE_DECL
20751 or TREE_TYPE), but the second is still just a representation of an
20752 unqualified-id. */
20754 static tree
20756 {
20757 tree id;
20758 /* The expression must be an id-expression. Assume that qualified
20759 names are the names of types so that:
20761 template <class T>
20762 int S<T>::R::i = 3;
20764 will work; we must treat `S<T>::R' as the name of a type.
20765 Similarly, assume that qualified names are templates, where
20766 required, so that:
20768 template <class T>
20769 int S<T>::R<T>::i = 3;
20771 will work, too. */
20777 optional_p);
20781 }
20783 /* Parse a type-id.
20785 type-id:
20786 type-specifier-seq abstract-declarator [opt]
20788 Returns the TYPE specified. */
20790 static tree
20793 {
20794 cp_decl_specifier_seq type_specifier_seq;
20797 /* Parse the type-specifier-seq. */
20799 is_trailing_return,
20804 /* A bare template name as a template argument is a template template
20805 argument, not a placeholder, so fail parsing it as a type argument. */
20806 {
20810 }
20814 /* There might or might not be an abstract declarator. */
20816 /* Look for the declarator. */
20817 abstract_declarator
20822 /* Check to see if there really was a declarator. */
20827 /* The concepts TS allows 'auto' as a type-id. */
20829 /* None of the valid uses of 'auto' in C++14 involve the type-id
20830 nonterminal, but it is valid in a trailing-return-type. */
20833 {
20834 /* A type-id with type 'auto' is only ok if the abstract declarator
20835 is a function declarator with a late-specified return type.
20837 A type-id with 'auto' is also valid in a trailing-return-type
20838 in a compound-requirement. */
20845 else
20846 {
20849 {
20851 auto_node);
20853 tmpl);
20854 }
20855 else
20858 }
20859 }
20862 is_template_arg);
20863 }
20865 static tree
20867 {
20869 }
20871 static tree
20873 {
20874 tree r;
20876 parser->type_definition_forbidden_message
20881 {
20884 }
20886 }
20888 static tree
20890 {
20892 }
20894 /* Parse a type-specifier-seq.
20896 type-specifier-seq:
20897 type-specifier type-specifier-seq [opt]
20899 GNU extension:
20901 type-specifier-seq:
20902 attributes type-specifier-seq [opt]
20904 If IS_DECLARATION is true, we are at the start of a "condition" or
20905 exception-declaration, so we might be followed by a declarator-id.
20907 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20908 i.e. we've just seen "->".
20910 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20912 static void
20917 {
20922 /* Clear the TYPE_SPECIFIER_SEQ. */
20925 /* In the context of a trailing return type, enum E { } is an
20926 elaborated-type-specifier followed by a function-body, not an
20927 enum-specifier. */
20931 /* Parse the type-specifiers and attributes. */
20933 {
20934 tree type_specifier;
20937 /* Check for attributes first. */
20939 {
20944 }
20946 /* record the token of the beginning of the type specifier seq,
20947 for error reporting purposes*/
20951 /* Look for the type-specifier. */
20953 flags,
20954 type_specifier_seq,
20956 NULL,
20959 {
20960 /* If the first type-specifier could not be found, this is not a
20961 type-specifier-seq at all. */
20963 {
20964 /* Set in_declarator_p to avoid skipping to the semicolon. */
20976 }
20977 /* If subsequent type-specifiers could not be found, the
20978 type-specifier-seq is complete. */
20980 }
20983 /* The standard says that a condition can be:
20985 type-specifier-seq declarator = assignment-expression
20987 However, given:
20989 struct S {};
20990 if (int S = ...)
20992 we should treat the "S" as a declarator, not as a
20993 type-specifier. The standard doesn't say that explicitly for
20994 type-specifier-seq, but it does say that for
20995 decl-specifier-seq in an ordinary declaration. Perhaps it
20996 would be clearer just to allow a decl-specifier-seq here, and
20997 then add a semantic restriction that if any decl-specifiers
20998 that are not type-specifiers appear, the program is invalid. */
21001 }
21002 }
21004 /* Return whether the function currently being declared has an associated
21005 template parameter list. */
21007 static bool
21009 {
21022 }
21024 /* Parse a parameter-declaration-clause.
21026 parameter-declaration-clause:
21027 parameter-declaration-list [opt] ... [opt]
21028 parameter-declaration-list , ...
21030 Returns a representation for the parameter declarations. A return
21031 value of NULL indicates a parameter-declaration-clause consisting
21032 only of an ellipsis. */
21034 static tree
21036 {
21037 tree parameters;
21046 parser->auto_is_implicit_function_template_parm_p
21048 }
21054 && !processing_template_parmlist
21060 /* Peek at the next token. */
21062 /* Check for trivial parameter-declaration-clauses. */
21064 {
21065 /* Consume the `...' token. */
21068 }
21070 /* There are no parameters. */
21071 {
21072 #ifndef NO_IMPLICIT_EXTERN_C
21077 else
21078 #endif
21080 }
21081 /* Check for `(void)', too, which is a special case. */
21085 {
21086 /* Consume the `void' token. */
21088 /* There are no parameters. */
21090 }
21092 /* Parse the parameter-declaration-list. */
21094 /* If a parse error occurred while parsing the
21095 parameter-declaration-list, then the entire
21096 parameter-declaration-clause is erroneous. */
21100 /* Peek at the next token. */
21102 /* If it's a `,', the clause should terminate with an ellipsis. */
21104 {
21105 /* Consume the `,'. */
21107 /* Expect an ellipsis. */
21108 ellipsis_p
21110 }
21111 /* It might also be `...' if the optional trailing `,' was
21112 omitted. */
21114 {
21115 /* Consume the `...' token. */
21117 /* And remember that we saw it. */
21119 }
21120 else
21123 /* Finish the parameter list. */
21128 }
21130 /* Parse a parameter-declaration-list.
21132 parameter-declaration-list:
21133 parameter-declaration
21134 parameter-declaration-list , parameter-declaration
21136 Returns a representation of the parameter-declaration-list, as for
21137 cp_parser_parameter_declaration_clause. However, the
21138 `void_list_node' is never appended to the list. Upon return,
21139 *IS_ERROR will be true iff an error occurred. */
21141 static tree
21143 {
21149 /* Assume all will go well. */
21151 /* The special considerations that apply to a function within an
21152 unbraced linkage specifications do not apply to the parameters
21153 to the function. */
21154 saved_in_unbraced_linkage_specification_p
21158 /* Look for more parameters. */
21160 {
21168 /* Parse the parameter. */
21169 parameter
21174 /* We don't know yet if the enclosing context is deprecated, so wait
21175 and warn in grokparms if appropriate. */
21179 {
21180 /* If a function parameter pack was specified and an implicit template
21181 parameter was introduced during cp_parser_parameter_declaration,
21182 change any implicit parameters introduced into packs. */
21186 {
21194 }
21198 PARM,
21201 }
21205 /* If a parse error occurred parsing the parameter declaration,
21206 then the entire parameter-declaration-list is erroneous. */
21208 {
21212 }
21222 {
21226 }
21228 /* Add the new parameter to the list. */
21232 /* Peek at the next token. */
21235 /* These are for Objective-C++ */
21238 /* The parameter-declaration-list is complete. */
21241 {
21244 /* Peek at the next token. */
21246 /* If it's an ellipsis, then the list is complete. */
21249 /* Otherwise, there must be more parameters. Consume the
21250 `,'. */
21252 /* When parsing something like:
21254 int i(float f, double d)
21256 we can tell after seeing the declaration for "f" that we
21257 are not looking at an initialization of a variable "i",
21258 but rather at the declaration of a function "i".
21260 Due to the fact that the parsing of template arguments
21261 (as specified to a template-id) requires backtracking we
21262 cannot use this technique when inside a template argument
21263 list. */
21267 /* However, a parameter-declaration of the form
21268 "float(f)" (which is a valid declaration of a
21269 parameter "f") can also be interpreted as an
21270 expression (the conversion of "f" to "float"). */
21273 }
21274 else
21275 {
21283 }
21284 }
21286 parser->in_unbraced_linkage_specification_p
21289 /* Reset implicit_template_scope if we are about to leave the function
21290 parameter list that introduced it. Note that for out-of-line member
21291 definitions, there will be one or more class scopes before we get to
21292 the template parameter scope. */
21296 {
21300 {
21303 }
21304 }
21307 }
21309 /* Parse a parameter declaration.
21311 parameter-declaration:
21312 decl-specifier-seq ... [opt] declarator
21313 decl-specifier-seq declarator = assignment-expression
21314 decl-specifier-seq ... [opt] abstract-declarator [opt]
21315 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21317 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21318 declares a template parameter. (In that case, a non-nested `>'
21319 token encountered during the parsing of the assignment-expression
21320 is not interpreted as a greater-than operator.)
21322 Returns a representation of the parameter, or NULL if an error
21323 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21324 true iff the declarator is of the form "(p)". */
21330 {
21332 cp_decl_specifier_seq decl_specifiers;
21334 tree default_argument;
21339 /* In a template parameter, `>' is not an operator.
21341 [temp.param]
21343 When parsing a default template-argument for a non-type
21344 template-parameter, the first non-nested `>' is taken as the end
21345 of the template parameter-list rather than a greater-than
21346 operator. */
21348 /* Type definitions may not appear in parameter types. */
21350 parser->type_definition_forbidden_message
21353 /* Parse the declaration-specifiers. */
21355 CP_PARSER_FLAGS_NONE,
21359 /* Complain about missing 'typename' or other invalid type names. */
21364 /* If an error occurred, there's no reason to attempt to parse the
21365 rest of the declaration. */
21367 {
21370 }
21372 /* Peek at the next token. */
21375 /* If the next token is a `)', `,', `=', `>', or `...', then there
21376 is no declarator. However, when variadic templates are enabled,
21377 there may be a declarator following `...'. */
21382 {
21386 }
21387 /* Otherwise, there should be a declarator. */
21388 else
21389 {
21393 /* After seeing a decl-specifier-seq, if the next token is not a
21394 "(", there is no possibility that the code is a valid
21395 expression. Therefore, if parsing tentatively, we commit at
21396 this point. */
21398 /* In an expression context, having seen:
21400 (int((char ...
21402 we cannot be sure whether we are looking at a
21403 function-type (taking a "char" as a parameter) or a cast
21404 of some object of type "char" to "int". */
21410 /* Parse the declarator. */
21413 CP_PARSER_DECLARATOR_EITHER,
21415 parenthesized_p,
21419 /* After the declarator, allow more attributes. */
21420 decl_specifiers.attributes
21424 /* If the declarator is a template parameter pack, remember that and
21425 clear the flag in the declarator itself so we don't get errors
21426 from grokdeclarator. */
21428 {
21431 }
21432 }
21434 /* If the next token is an ellipsis, and we have not seen a declarator
21435 name, and if either the type of the declarator contains parameter
21436 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21437 for, eg, abbreviated integral type names), then we actually have a
21438 parameter pack expansion expression. Otherwise, leave the ellipsis
21439 for a C-style variadic function. */
21442 {
21453 {
21454 /* Consume the `...'. */
21458 /* Build a pack expansion type */
21463 else
21465 }
21466 }
21468 /* The restriction on defining new types applies only to the type
21469 of the parameter, not to the default argument. */
21472 /* If the next token is `=', then process a default argument. */
21474 {
21477 /* If we are defining a class, then the tokens that make up the
21478 default argument must be saved and processed later. */
21484 // A constrained-type-specifier may declare a type template-parameter.
21486 default_argument
21489 // A constrained-type-specifier may declare a template-template-parameter.
21491 default_argument
21494 /* Outside of a class definition, we can just parse the
21495 assignment-expression. */
21496 else
21497 default_argument
21501 {
21503 "default arguments are only "
21505 }
21507 || template_parameter_pack_p
21510 {
21511 /* Find the name of the parameter pack. */
21518 template_parm_p
21524 else
21526 template_parm_p
21533 }
21534 }
21535 else
21539 declarator,
21540 default_argument,
21541 template_parameter_pack_p);
21542 }
21544 /* Parse a default argument and return it.
21546 TEMPLATE_PARM_P is true if this is a default argument for a
21547 non-type template parameter. */
21548 static tree
21550 {
21556 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21557 set correctly. */
21560 /* Local variable names (and the `this' keyword) may not
21561 appear in a default argument. */
21564 /* Parse the assignment-expression. */
21569 /* The "this" pointer is not valid in a default argument. */
21571 {
21576 }
21577 default_argument
21579 /* Restore the "this" pointer. */
21581 {
21584 }
21593 }
21595 /* Parse a function-body.
21597 function-body:
21598 compound_statement */
21600 static void
21602 {
21606 }
21608 /* Parse a ctor-initializer-opt followed by a function-body. Return
21609 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21610 is true we are parsing a function-try-block. */
21612 static bool
21615 {
21623 /* Begin the function body. */
21625 /* Parse the optional ctor-initializer. */
21628 /* If we're parsing a constexpr constructor definition, we need
21629 to check that the constructor body is indeed empty. However,
21630 before we get to cp_parser_function_body lot of junk has been
21631 generated, so we can't just check that we have an empty block.
21632 Rather we take a snapshot of the outermost block, and check whether
21633 cp_parser_function_body changed its state. */
21635 {
21639 }
21640 /* Parse the function-body. */
21644 /* Finish the function body. */
21648 }
21650 /* Parse an initializer.
21652 initializer:
21653 = initializer-clause
21654 ( expression-list )
21656 Returns an expression representing the initializer. If no
21657 initializer is present, NULL_TREE is returned.
21659 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21660 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21661 set to TRUE if there is no initializer present. If there is an
21662 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21663 is set to true; otherwise it is set to false. */
21665 static tree
21668 {
21670 tree init;
21672 /* Peek at the next token. */
21675 /* Let our caller know whether or not this initializer was
21676 parenthesized. */
21678 /* Assume that the initializer is constant. */
21682 {
21683 /* Consume the `='. */
21685 /* Parse the initializer-clause. */
21687 }
21689 {
21694 non_constant_p);
21699 }
21701 {
21706 }
21707 else
21708 {
21709 /* Anything else is an error. */
21712 }
21718 }
21720 /* Parse an initializer-clause.
21722 initializer-clause:
21723 assignment-expression
21724 braced-init-list
21726 Returns an expression representing the initializer.
21728 If the `assignment-expression' production is used the value
21729 returned is simply a representation for the expression.
21731 Otherwise, calls cp_parser_braced_list. */
21733 static cp_expr
21735 {
21736 cp_expr initializer;
21738 /* Assume the expression is constant. */
21741 /* If it is not a `{', then we are looking at an
21742 assignment-expression. */
21744 {
21745 initializer
21748 non_constant_p);
21749 }
21750 else
21754 }
21756 /* Parse a brace-enclosed initializer list.
21758 braced-init-list:
21759 { initializer-list , [opt] }
21760 { }
21762 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21763 the elements of the initializer-list (or NULL, if the last
21764 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21765 NULL_TREE. There is no way to detect whether or not the optional
21766 trailing `,' was provided. NON_CONSTANT_P is as for
21767 cp_parser_initializer. */
21769 static cp_expr
21771 {
21772 tree initializer;
21775 /* Consume the `{' token. */
21777 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21779 /* If it's not a `}', then there is a non-trivial initializer. */
21781 {
21782 /* Parse the initializer list. */
21785 /* A trailing `,' token is allowed. */
21788 }
21789 else
21791 /* Now, there should be a trailing `}'. */
21797 /* Build a location of the form:
21798 { ... }
21799 ^~~~~~~
21800 with caret==start at the open brace, finish at the close brace. */
21804 }
21806 /* Consume tokens up to, and including, the next non-nested closing `]'.
21807 Returns true iff we found a closing `]'. */
21809 static bool
21811 {
21815 {
21819 {
21822 /* If we've run out of tokens, then there is no closing `]'. */
21831 {
21834 }
21839 }
21841 /* Consume the token. */
21843 }
21844 }
21846 /* Return true if we are looking at an array-designator, false otherwise. */
21848 static bool
21850 {
21851 /* Consume the `['. */
21856 /* Skip tokens until the next token is a closing square bracket.
21857 If we find the closing `]', and the next token is a `=', then
21858 we are looking at an array designator. */
21859 bool array_designator_p
21863 /* Roll back the tokens we skipped. */
21867 }
21869 /* Parse an initializer-list.
21871 initializer-list:
21872 initializer-clause ... [opt]
21873 initializer-list , initializer-clause ... [opt]
21875 GNU Extension:
21877 initializer-list:
21878 designation initializer-clause ...[opt]
21879 initializer-list , designation initializer-clause ...[opt]
21881 designation:
21882 . identifier =
21883 identifier :
21884 [ constant-expression ] =
21886 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21887 for the initializer. If the INDEX of the elt is non-NULL, it is the
21888 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21889 as for cp_parser_initializer. */
21893 {
21896 /* Assume all of the expressions are constant. */
21899 /* Parse the rest of the list. */
21901 {
21903 tree designator;
21904 tree initializer;
21907 /* If the next token is an identifier and the following one is a
21908 colon, we are looking at the GNU designated-initializer
21909 syntax. */
21913 {
21914 /* Warn the user that they are using an extension. */
21917 /* Consume the identifier. */
21919 /* Consume the `:'. */
21921 }
21922 /* Also handle the C99 syntax, '. id ='. */
21927 {
21928 /* Warn the user that they are using an extension. */
21931 /* Consume the `.'. */
21933 /* Consume the identifier. */
21935 /* Consume the `='. */
21937 }
21938 /* Also handle C99 array designators, '[ const ] ='. */
21942 {
21943 /* In C++11, [ could start a lambda-introducer. */
21949 {
21952 }
21953 else
21954 {
21959 }
21965 }
21966 else
21969 /* Parse the initializer. */
21972 /* If any clause is non-constant, so is the entire initializer. */
21976 /* If we have an ellipsis, this is an initializer pack
21977 expansion. */
21979 {
21980 /* Consume the `...'. */
21983 /* Turn the initializer into an initializer expansion. */
21985 }
21987 /* Add it to the vector. */
21990 /* If the next token is not a comma, we have reached the end of
21991 the list. */
21995 /* Peek at the next token. */
21997 /* If the next token is a `}', then we're still done. An
21998 initializer-clause can have a trailing `,' after the
21999 initializer-list and before the closing `}'. */
22003 /* Consume the `,' token. */
22005 }
22008 }
22010 /* Classes [gram.class] */
22012 /* Parse a class-name.
22014 class-name:
22015 identifier
22016 template-id
22018 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22019 to indicate that names looked up in dependent types should be
22020 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22021 keyword has been used to indicate that the name that appears next
22022 is a template. TAG_TYPE indicates the explicit tag given before
22023 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22024 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22025 is the class being defined in a class-head. If ENUM_OK is TRUE,
22026 enum-names are also accepted.
22028 Returns the TYPE_DECL representing the class. */
22030 static tree
22039 {
22040 tree decl;
22041 tree scope;
22046 /* All class-names start with an identifier. */
22049 {
22052 }
22054 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22055 to a template-id, so we save it here. */
22060 /* Any name names a type if we're following the `typename' keyword
22061 in a qualified name where the enclosing scope is type-dependent. */
22064 /* Handle the common case (an identifier, but not a template-id)
22065 efficiently. */
22068 {
22072 /* Look for the identifier. */
22076 /* If the next token isn't an identifier, we are certainly not
22077 looking at a class-name. */
22080 /* If we know this is a type-name, there's no need to look it
22081 up. */
22084 else
22085 {
22086 tree ambiguous_decls;
22087 /* If we already know that this lookup is ambiguous, then
22088 we've already issued an error message; there's no reason
22089 to check again. */
22091 {
22094 }
22095 /* If the next token is a `::', then the name must be a type
22096 name.
22098 [basic.lookup.qual]
22100 During the lookup for a name preceding the :: scope
22101 resolution operator, object, function, and enumerator
22102 names are ignored. */
22105 /* Look up the name. */
22107 tag_type,
22110 check_dependency_p,
22114 {
22118 }
22119 }
22120 }
22121 else
22122 {
22123 /* Try a template-id. */
22125 check_dependency_p,
22126 tag_type,
22127 is_declaration);
22130 }
22134 /* If this is a typename, create a TYPENAME_TYPE. */
22136 {
22141 }
22145 /* Check to see that it is really the name of a class. */
22149 /* Situations like this:
22151 template <typename T> struct A {
22152 typename T::template X<int>::I i;
22153 };
22155 are problematic. Is `T::template X<int>' a class-name? The
22156 standard does not seem to be definitive, but there is no other
22157 valid interpretation of the following `::'. Therefore, those
22158 names are considered class-names. */
22159 {
22163 }
22168 /* In Objective-C 2.0, a classname followed by '.' starts a
22169 dot-syntax expression, and it's not a type-name. */
22181 }
22183 /* Parse a class-specifier.
22185 class-specifier:
22186 class-head { member-specification [opt] }
22188 Returns the TREE_TYPE representing the class. */
22190 static tree
22192 {
22193 tree type;
22207 /* Parse the class-head. */
22210 /* If the class-head was a semantic disaster, skip the entire body
22211 of the class. */
22213 {
22217 }
22219 /* Look for the `{'. */
22221 {
22224 }
22229 /* Issue an error message if type-definitions are forbidden here. */
22231 /* Remember that we are defining one more class. */
22233 /* Inside the class, surrounding template-parameter-lists do not
22234 apply. */
22235 saved_num_template_parameter_lists
22238 /* We are not in a function body. */
22241 /* Or in a loop. */
22244 /* Or in a switch. */
22247 /* We are not immediately inside an extern "lang" block. */
22248 saved_in_unbraced_linkage_specification_p
22252 // Associate constraints with the type.
22256 /* Start the class. */
22258 {
22261 }
22265 /* If the type is erroneous, skip the entire body of the class. */
22267 else
22268 /* Parse the member-specification. */
22271 /* Look for the trailing `}'. */
22273 /* Look for trailing attributes to apply to this class. */
22281 /* We've finished a type definition. Check for the common syntax
22282 error of forgetting a semicolon after the definition. We need to
22283 be careful, as we can't just check for not-a-semicolon and be done
22284 with it; the user might have typed:
22286 class X { } c = ...;
22287 class X { } *p = ...;
22289 and so forth. Instead, enumerate all the possible tokens that
22290 might follow this production; if we don't see one of them, then
22291 complain and silently insert the semicolon. */
22292 {
22297 /* Don't try to parse c++11 attributes here. As per the
22298 grammar, that should be a task for
22299 cp_parser_decl_specifier_seq. */
22303 {
22314 /* While it's legal for type qualifiers and storage class
22315 specifiers to follow type definitions in the grammar, only
22316 compiler testsuites contain code like that. Assume that if
22317 we see such code, then what we're really seeing is a case
22318 like:
22320 class X { }
22321 const <type> var = ...;
22323 or
22325 class Y { }
22326 static <type> func (...) ...
22328 i.e. the qualifier or specifier applies to the next
22329 declaration. To do so, however, we need to look ahead one
22330 more token to see if *that* token is a type specifier.
22332 This code could be improved to handle:
22334 class Z { }
22335 static const <type> var = ...; */
22338 {
22341 /* Handling user-defined types here would be nice, but very
22342 tricky. */
22343 want_semicolon
22346 }
22350 }
22352 /* If we don't have a type, then something is very wrong and we
22353 shouldn't try to do anything clever. Likewise for not seeing the
22354 closing brace. */
22356 {
22357 /* Locate the closing brace. */
22358 cp_token_position prev
22363 /* We want to suggest insertion of a ';' immediately *after* the
22364 closing brace, so, if we can, offset the location by 1 column. */
22371 /* If we successfully offset the location, suggest the fix-it. */
22384 else
22387 /* Unget one token and smash it to look as though we encountered
22388 a semicolon in the input stream. */
22393 }
22394 }
22396 /* If this class is not itself within the scope of another class,
22397 then we need to parse the bodies of all of the queued function
22398 definitions. Note that the queued functions defined in a class
22399 are not always processed immediately following the
22400 class-specifier for that class. Consider:
22402 struct A {
22403 struct B { void f() { sizeof (A); } };
22404 };
22406 If `f' were processed before the processing of `A' were
22407 completed, there would be no way to compute the size of `A'.
22408 Note that the nesting we are interested in here is lexical --
22409 not the semantic nesting given by TYPE_CONTEXT. In particular,
22410 for:
22412 struct A { struct B; };
22413 struct A::B { void f() { } };
22415 there is no need to delay the parsing of `A::B::f'. */
22417 {
22418 tree decl;
22425 /* In a first pass, parse default arguments to the functions.
22426 Then, in a second pass, parse the bodies of the functions.
22427 This two-phased approach handles cases like:
22429 struct S {
22430 void f() { g(); }
22431 void g(int i = 3);
22432 };
22434 */
22436 {
22438 /* If there are default arguments that have not yet been processed,
22439 take care of them now. */
22441 {
22446 }
22447 /* Make sure that any template parameters are in scope. */
22449 /* Parse the default argument expressions. */
22451 /* Remove any template parameters from the symbol table. */
22453 }
22455 /* Now parse any NSDMIs. */
22459 {
22461 {
22466 }
22469 }
22476 /* Now do some post-NSDMI bookkeeping. */
22482 /* Now parse the body of the functions. */
22484 {
22485 /* OpenMP UDRs need to be parsed before all other functions. */
22492 }
22493 else
22497 }
22498 else
22501 /* Put back any saved access checks. */
22504 /* Restore saved state. */
22508 parser->num_template_parameter_lists
22510 parser->in_unbraced_linkage_specification_p
22514 }
22516 static tree
22518 {
22519 tree ret;
22524 }
22526 /* Parse a class-head.
22528 class-head:
22529 class-key identifier [opt] base-clause [opt]
22530 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22531 class-key nested-name-specifier [opt] template-id
22532 base-clause [opt]
22534 class-virt-specifier:
22535 final
22537 GNU Extensions:
22538 class-key attributes identifier [opt] base-clause [opt]
22539 class-key attributes nested-name-specifier identifier base-clause [opt]
22540 class-key attributes nested-name-specifier [opt] template-id
22541 base-clause [opt]
22543 Upon return BASES is initialized to the list of base classes (or
22544 NULL, if there are none) in the same form returned by
22545 cp_parser_base_clause.
22547 Returns the TYPE of the indicated class. Sets
22548 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22549 involving a nested-name-specifier was used, and FALSE otherwise.
22551 Returns error_mark_node if this is not a class-head.
22553 Returns NULL_TREE if the class-head is syntactically valid, but
22554 semantically invalid in a way that means we should skip the entire
22555 body of the class. */
22557 static tree
22560 {
22561 tree nested_name_specifier;
22565 tree attributes;
22566 tree bases;
22576 /* Assume no nested-name-specifier will be present. */
22578 /* Assume no template parameter lists will be used in defining the
22579 type. */
22583 /* Look for the class-key. */
22590 /* Parse the attributes. */
22593 /* If the next token is `::', that is invalid -- but sometimes
22594 people do try to write:
22596 struct ::S {};
22598 Handle this gracefully by accepting the extra qualifier, and then
22599 issuing an error about it later if this really is a
22600 class-head. If it turns out just to be an elaborated type
22601 specifier, remain silent. */
22607 /* Determine the name of the class. Begin by looking for an
22608 optional nested-name-specifier. */
22610 nested_name_specifier
22616 /* If there was a nested-name-specifier, then there *must* be an
22617 identifier. */
22622 {
22624 /* Although the grammar says `identifier', it really means
22625 `class-name' or `template-name'. You are only allowed to
22626 define a class that has already been declared with this
22627 syntax.
22629 The proposed resolution for Core Issue 180 says that wherever
22630 you see `class T::X' you should treat `X' as a type-name.
22632 It is OK to define an inaccessible class; for example:
22634 class A { class B; };
22635 class A::B {};
22637 We do not know if we will see a class-name, or a
22638 template-name. We look for a class-name first, in case the
22639 class-name is a template-id; if we looked for the
22640 template-name first we would stop after the template-name. */
22647 class_type,
22651 /* If that didn't work, ignore the nested-name-specifier. */
22653 {
22659 }
22660 /* If we could not find a corresponding TYPE, treat this
22661 declaration like an unqualified declaration. */
22664 /* Otherwise, count the number of templates used in TYPE and its
22665 containing scopes. */
22666 else
22667 {
22668 tree scope;
22680 }
22681 }
22682 /* Otherwise, the identifier is optional. */
22683 else
22684 {
22685 /* We don't know whether what comes next is a template-id,
22686 an identifier, or nothing at all. */
22688 /* Check for a template-id. */
22693 class_key,
22695 /* If that didn't work, it could still be an identifier. */
22697 {
22699 {
22702 }
22703 else
22705 }
22706 else
22707 {
22710 }
22711 }
22716 {
22718 class_key,
22720 }
22723 /* If it's not a `:' or a `{' then we can't really be looking at a
22724 class-head, since a class-head only appears as part of a
22725 class-specifier. We have to detect this situation before calling
22726 xref_tag, since that has irreversible side-effects. */
22728 {
22732 }
22734 /* At this point, we're going ahead with the class-specifier, even
22735 if some other problem occurs. */
22738 {
22743 }
22744 /* Issue the error about the overly-qualified name now. */
22746 {
22751 }
22753 {
22758 }
22760 {
22761 tree scope;
22764 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22765 keyword template shall not appear at the top level. */
22769 /* Reject typedef-names in class heads. */
22771 {
22774 type);
22777 }
22779 /* Figure out in what scope the declaration is being placed. */
22781 /* If that scope does not contain the scope in which the
22782 class was originally declared, the program is invalid. */
22784 {
22787 "declaration of %qD in namespace %qD which does not "
22790 else
22796 }
22797 /* [dcl.meaning]
22799 A declarator-id shall not be qualified except for the
22800 definition of a ... nested class outside of its class
22801 ... [or] the definition or explicit instantiation of a
22802 class member of a namespace outside of its namespace. */
22804 {
22809 }
22810 }
22811 /* An explicit-specialization must be preceded by "template <>". If
22812 it is not, try to recover gracefully. */
22815 && !processing_template_parmlist
22817 {
22818 /* Build a location of this form:
22819 struct typename <ARGS>
22820 ^~~~~~~~~~~~~~~~~~~~~~
22821 with caret==start at the start token, and
22822 finishing at the end of the type. */
22823 location_t reported_loc
22825 class_head_start_location,
22830 error_at_rich_loc
22834 /* Take the same action that would have been taken by
22835 cp_parser_explicit_specialization. */
22838 }
22839 /* There must be no "return" statements between this point and the
22840 end of this function; set "type "to the correct return value and
22841 use "goto done;" to return. */
22842 /* Make sure that the right number of template parameters were
22843 present. */
22847 {
22848 /* If something went wrong, there is no point in even trying to
22849 process the class-definition. */
22852 }
22854 /* Look up the type. */
22856 {
22860 {
22864 }
22865 else
22866 {
22870 /* Check the scope while we still know whether or not we had a
22871 nested-name-specifier. */
22874 }
22877 }
22879 {
22880 tree class_type;
22882 /* Given:
22884 template <typename T> struct S { struct T };
22885 template <typename T> struct S<T>::T { };
22887 we will get a TYPENAME_TYPE when processing the definition of
22888 `S::T'. We need to resolve it to the actual type before we
22889 try to define it. */
22891 {
22896 else
22897 {
22900 }
22901 }
22905 {
22908 }
22911 /* Enter the scope indicated by the nested-name-specifier. */
22913 /* Get the canonical version of this type. */
22915 /* Call push_template_decl if it seems like we should be defining a
22916 template either from the template headers or the type we're
22917 defining, so that we diagnose both extra and missing headers. */
22921 {
22924 {
22927 }
22928 }
22932 }
22934 {
22935 /* If the class was unnamed, create a dummy name. */
22939 ? ts_within_enclosing_non_class
22943 }
22945 /* Indicate whether this class was declared as a `class' or as a
22946 `struct'. */
22951 /* If this type was already complete, and we see another definition,
22952 that's an error. */
22954 {
22956 type);
22958 type);
22961 }
22966 {
22967 /* Apply attributes now, before any use of the class as a template
22968 argument in its base list. */
22971 }
22973 /* We will have entered the scope containing the class; the names of
22974 base classes should be looked up in that context. For example:
22976 struct A { struct B {}; struct C; };
22977 struct A::C : B {};
22979 is valid. */
22981 /* Get the list of base-classes, if there is one. */
22983 {
22984 /* PR59482: enter the class scope so that base-specifiers are looked
22985 up correctly. */
22989 /* PR59482: get out of the previously pushed class scope so that the
22990 subsequent pops pop the right thing. */
22993 }
22994 else
22997 /* If we're really defining a class, process the base classes.
22998 If they're invalid, fail. */
23002 done:
23003 /* Leave the scope given by the nested-name-specifier. We will
23004 enter the class scope itself while processing the members. */
23009 {
23012 }
23018 out:
23021 }
23023 /* Parse a class-key.
23025 class-key:
23026 class
23027 struct
23028 union
23030 Returns the kind of class-key specified, or none_type to indicate
23031 error. */
23033 static enum tag_types
23035 {
23039 /* Look for the class-key. */
23044 /* Check to see if the TOKEN is a class-key. */
23049 }
23051 /* Parse a type-parameter-key.
23053 type-parameter-key:
23054 class
23055 typename
23056 */
23058 static void
23060 {
23061 /* Look for the type-parameter-key. */
23065 {
23068 /* typename is not allowed in a template template parameter
23069 by the standard until C++1Z. */
23071 "ISO C++ forbids typename key in template template parameter;"
23073 }
23074 else
23078 }
23080 /* Parse an (optional) member-specification.
23082 member-specification:
23083 member-declaration member-specification [opt]
23084 access-specifier : member-specification [opt] */
23086 static void
23088 {
23090 {
23094 /* Peek at the next token. */
23096 /* If it's a `}', or EOF then we've seen all the members. */
23102 /* See if this token is a keyword. */
23105 {
23109 /* Consume the access-specifier. */
23111 /* Remember which access-specifier is active. */
23113 /* Look for the `:'. */
23118 /* Accept #pragmas at class scope. */
23120 {
23123 }
23125 /* Otherwise, the next construction must be a
23126 member-declaration. */
23128 }
23129 }
23130 }
23132 /* Parse a member-declaration.
23134 member-declaration:
23135 decl-specifier-seq [opt] member-declarator-list [opt] ;
23136 function-definition ; [opt]
23137 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23138 using-declaration
23139 template-declaration
23140 alias-declaration
23142 member-declarator-list:
23143 member-declarator
23144 member-declarator-list , member-declarator
23146 member-declarator:
23147 declarator pure-specifier [opt]
23148 declarator constant-initializer [opt]
23149 identifier [opt] : constant-expression
23151 GNU Extensions:
23153 member-declaration:
23154 __extension__ member-declaration
23156 member-declarator:
23157 declarator attributes [opt] pure-specifier [opt]
23158 declarator attributes [opt] constant-initializer [opt]
23159 identifier [opt] attributes [opt] : constant-expression
23161 C++0x Extensions:
23163 member-declaration:
23164 static_assert-declaration */
23166 static void
23168 {
23169 cp_decl_specifier_seq decl_specifiers;
23170 tree prefix_attributes;
23171 tree decl;
23180 /* Check for the `__extension__' keyword. */
23182 {
23183 /* Recurse. */
23185 /* Restore the old value of the PEDANTIC flag. */
23189 }
23191 /* Check for a template-declaration. */
23193 {
23194 /* An explicit specialization here is an error condition, and we
23195 expect the specialization handler to detect and report this. */
23199 else
23203 }
23204 /* Check for a template introduction. */
23208 /* Check for a using-declaration. */
23210 {
23212 {
23213 /* Parse the using-declaration. */
23217 }
23218 else
23219 {
23220 tree decl;
23224 /* Note that if we actually see the '=' token after the
23225 identifier, cp_parser_alias_declaration commits the
23226 tentative parse. In that case, we really expect an
23227 alias-declaration. Otherwise, we expect a using
23228 declaration. */
23229 alias_decl_expected =
23235 else
23239 }
23240 }
23242 /* Check for @defs. */
23244 {
23249 {
23254 }
23256 }
23258 /* If the next token is `static_assert' we have a static assertion. */
23260 {
23263 }
23270 /* Parse the decl-specifier-seq. */
23273 CP_PARSER_FLAGS_OPTIONAL,
23276 /* Check for an invalid type-name. */
23280 /* If there is no declarator, then the decl-specifier-seq should
23281 specify a type. */
23283 {
23284 /* If there was no decl-specifier-seq, and the next token is a
23285 `;', then we have something like:
23287 struct S { ; };
23289 [class.mem]
23291 Each member-declaration shall declare at least one member
23292 name of the class. */
23294 {
23297 {
23301 }
23302 }
23303 else
23304 {
23305 tree type;
23307 /* See if this declaration is a friend. */
23309 /* If there were decl-specifiers, check to see if there was
23310 a class-declaration. */
23313 /* Nested classes have already been added to the class, but
23314 a `friend' needs to be explicitly registered. */
23316 {
23317 /* If the `friend' keyword was present, the friend must
23318 be introduced with a class-key. */
23321 "in C++03 a class-key must be used "
23323 /* In this case:
23325 template <typename T> struct A {
23326 friend struct A<T>::B;
23327 };
23329 A<T>::B will be represented by a TYPENAME_TYPE, and
23330 therefore not recognized by check_tag_decl. */
23332 {
23336 }
23339 "friend declaration does not name a class or "
23341 else
23344 }
23345 /* If there is no TYPE, an error message will already have
23346 been issued. */
23348 ;
23349 /* An anonymous aggregate has to be handled specially; such
23350 a declaration really declares a data member (with a
23351 particular type), as opposed to a nested class. */
23353 {
23354 /* C++11 9.5/6. */
23357 "a storage class on an anonymous aggregate "
23360 /* Remove constructors and such from TYPE, now that we
23361 know it is an anonymous aggregate. */
23363 /* And make the corresponding data member. */
23366 /* Add it to the class. */
23368 }
23369 else
23370 cp_parser_check_access_in_redeclaration
23373 }
23374 }
23375 else
23376 {
23379 /* Clear attributes from the decl_specifiers but keep them
23380 around as prefix attributes that apply them to the entity
23381 being declared. */
23385 /* See if these declarations will be friends. */
23388 /* Keep going until we hit the `;' at the end of the
23389 declaration. */
23391 {
23393 tree first_attribute;
23395 /* Peek at the next token. */
23398 /* Check for a bitfield declaration. */
23403 {
23404 tree identifier;
23405 tree width;
23407 /* Get the name of the bitfield. Note that we cannot just
23408 check TOKEN here because it may have been invalidated by
23409 the call to cp_lexer_peek_nth_token above. */
23412 else
23415 /* Consume the `:' token. */
23417 /* Get the width of the bitfield. */
23418 width
23421 /* Look for attributes that apply to the bitfield. */
23423 /* Remember which attributes are prefix attributes and
23424 which are not. */
23426 /* Combine the attributes. */
23429 /* Create the bitfield declaration. */
23432 identifier,
23433 sfk_none)
23436 width,
23437 attributes);
23438 }
23439 else
23440 {
23442 tree initializer;
23443 tree asm_specification;
23446 /* Parse the declarator. */
23447 declarator
23452 friend_p);
23454 /* If something went wrong parsing the declarator, make sure
23455 that we at least consume some tokens. */
23457 {
23458 /* Skip to the end of the statement. */
23460 /* If the next token is not a semicolon, that is
23461 probably because we just skipped over the body of
23462 a function. So, we consume a semicolon if
23463 present, but do not issue an error message if it
23464 is not present. */
23466 CPP_SEMICOLON))
23469 }
23472 cp_parser_check_for_definition_in_return_type
23476 /* Look for an asm-specification. */
23478 /* Look for attributes that apply to the declaration. */
23480 /* Remember which attributes are prefix attributes and
23481 which are not. */
23483 /* Combine the attributes. */
23486 /* If it's an `=', then we have a constant-initializer or a
23487 pure-specifier. It is not correct to parse the
23488 initializer before registering the member declaration
23489 since the member declaration should be in scope while
23490 its initializer is processed. However, the rest of the
23491 front end does not yet provide an interface that allows
23492 us to handle this correctly. */
23494 {
23495 /* In [class.mem]:
23497 A pure-specifier shall be used only in the declaration of
23498 a virtual function.
23500 A member-declarator can contain a constant-initializer
23501 only if it declares a static member of integral or
23502 enumeration type.
23504 Therefore, if the DECLARATOR is for a function, we look
23505 for a pure-specifier; otherwise, we look for a
23506 constant-initializer. When we call `grokfield', it will
23507 perform more stringent semantics checks. */
23519 {
23521 /* Don't require a constant rvalue in C++11, since we
23522 might want a reference constant. We'll enforce
23523 constancy later. */
23525 /* Parse the initializer. */
23528 }
23529 else
23530 /* Parse the initializer. */
23532 }
23535 {
23539 else
23541 }
23542 /* Otherwise, there is no initializer. */
23543 else
23546 /* See if we are probably looking at a function
23547 definition. We are certainly not looking at a
23548 member-declarator. Calling `grokfield' has
23549 side-effects, so we must not do it unless we are sure
23550 that we are looking at a member-declarator. */
23553 {
23554 /* The grammar does not allow a pure-specifier to be
23555 used when a member function is defined. (It is
23556 possible that this fact is an oversight in the
23557 standard, since a pure function may be defined
23558 outside of the class-specifier. */
23564 declarator,
23565 attributes);
23568 /* If the member was not a friend, declare it here. */
23571 /* Peek at the next token. */
23573 /* If the next token is a semicolon, consume it. */
23575 {
23576 location_t semicolon_loc
23581 "extra %<;%> after in-class "
23583 }
23585 }
23586 else
23589 /* Create the declaration. */
23594 {
23597 else
23599 }
23600 }
23605 /* Reset PREFIX_ATTRIBUTES. */
23611 /* If there is any qualification still in effect, clear it
23612 now; we will be starting fresh with the next declarator. */
23616 /* If it's a `,', then there are more declarators. */
23618 {
23621 {
23627 }
23628 }
23629 /* If the next token isn't a `;', then we have a parse error. */
23631 CPP_SEMICOLON))
23632 {
23633 /* The next token might be a ways away from where the
23634 actual semicolon is missing. Find the previous token
23635 and use that for our error position. */
23642 /* Assume that the user meant to provide a semicolon. If
23643 we were to cp_parser_skip_to_end_of_statement, we might
23644 skip to a semicolon inside a member function definition
23645 and issue nonsensical error messages. */
23647 }
23650 {
23651 /* Add DECL to the list of members. */
23653 /* Explicitly include, eg, NSDMIs, for better error
23654 recovery (c++/58650). */
23663 /* Add DECL to the queue of NSDMI to be parsed later. */
23665 }
23669 }
23670 }
23673 out:
23675 }
23677 /* Parse a pure-specifier.
23679 pure-specifier:
23680 = 0
23682 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23683 Otherwise, ERROR_MARK_NODE is returned. */
23685 static tree
23687 {
23690 /* Look for the `=' token. */
23693 /* Look for the `0' token. */
23702 /* Accept = default or = delete in c++0x mode. */
23705 {
23708 }
23710 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23712 {
23717 }
23719 {
23722 }
23725 }
23727 /* Parse a constant-initializer.
23729 constant-initializer:
23730 = constant-expression
23732 Returns a representation of the constant-expression. */
23734 static tree
23736 {
23737 /* Look for the `=' token. */
23741 /* It is invalid to write:
23743 struct S { static const int i = { 7 }; };
23745 */
23747 {
23750 /* Consume the opening brace. */
23752 /* Skip the initializer. */
23754 /* Look for the trailing `}'. */
23758 }
23761 }
23763 /* Derived classes [gram.class.derived] */
23765 /* Parse a base-clause.
23767 base-clause:
23768 : base-specifier-list
23770 base-specifier-list:
23771 base-specifier ... [opt]
23772 base-specifier-list , base-specifier ... [opt]
23774 Returns a TREE_LIST representing the base-classes, in the order in
23775 which they were declared. The representation of each node is as
23776 described by cp_parser_base_specifier.
23778 In the case that no bases are specified, this function will return
23779 NULL_TREE, not ERROR_MARK_NODE. */
23781 static tree
23783 {
23786 /* Look for the `:' that begins the list. */
23789 /* Scan the base-specifier-list. */
23791 {
23793 tree base;
23796 /* Look for the base-specifier. */
23798 /* Look for the (optional) ellipsis. */
23800 {
23801 /* Consume the `...'. */
23805 }
23807 /* Add BASE to the front of the list. */
23809 {
23811 /* Make this a pack expansion type. */
23815 {
23818 }
23819 }
23820 /* Peek at the next token. */
23822 /* If it's not a comma, then the list is complete. */
23825 /* Consume the `,'. */
23827 }
23829 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23830 base class had a qualified name. However, the next name that
23831 appears is certainly not qualified. */
23837 }
23839 /* Parse a base-specifier.
23841 base-specifier:
23842 :: [opt] nested-name-specifier [opt] class-name
23843 virtual access-specifier [opt] :: [opt] nested-name-specifier
23844 [opt] class-name
23845 access-specifier virtual [opt] :: [opt] nested-name-specifier
23846 [opt] class-name
23848 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23849 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23850 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23851 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23853 static tree
23855 {
23863 tree type;
23865 /* Process the optional `virtual' and `access-specifier'. */
23867 {
23868 /* Peek at the next token. */
23870 /* Process `virtual'. */
23872 {
23874 /* If `virtual' appears more than once, issue an error. */
23876 {
23880 }
23884 /* Consume the `virtual' token. */
23892 /* If more than one access specifier appears, issue an
23893 error. */
23896 {
23900 }
23904 /* Consume the access-specifier. */
23912 }
23913 }
23914 /* It is not uncommon to see programs mechanically, erroneously, use
23915 the 'typename' keyword to denote (dependent) qualified types
23916 as base classes. */
23918 {
23923 else
23925 "keyword %<typename%> not allowed in this context "
23928 }
23930 /* Look for the optional `::' operator. */
23932 /* Look for the nested-name-specifier. The simplest way to
23933 implement:
23935 [temp.res]
23937 The keyword `typename' is not permitted in a base-specifier or
23938 mem-initializer; in these contexts a qualified name that
23939 depends on a template-parameter is implicitly assumed to be a
23940 type name.
23942 is to pretend that we have seen the `typename' keyword at this
23943 point. */
23949 /* If the base class is given by a qualified name, assume that names
23950 we see are type names or templates, as appropriate. */
23956 /* DR 950 allows decltype as a base-specifier. */
23958 else
23959 {
23960 /* Otherwise, look for the class-name. */
23962 class_scope_p,
23963 template_p,
23964 typename_type,
23969 }
23975 }
23977 /* Exception handling [gram.exception] */
23979 /* Parse an (optional) noexcept-specification.
23981 noexcept-specification:
23982 noexcept ( constant-expression ) [opt]
23984 If no noexcept-specification is present, returns NULL_TREE.
23985 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23986 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23987 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23988 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23989 in which case a boolean condition is returned instead. */
23991 static tree
23996 {
24000 /* Peek at the next token. */
24003 /* Is it a noexcept-specification? */
24005 {
24006 tree expr;
24010 {
24014 {
24015 /* Types may not be defined in an exception-specification. */
24017 parser->type_definition_forbidden_message
24022 /* Restore the saved message. */
24024 }
24025 else
24026 {
24029 }
24032 }
24033 else
24034 {
24038 }
24040 /* We cannot build a noexcept-spec right away because this will check
24041 that expr is a constexpr. */
24044 else
24046 }
24047 else
24049 }
24051 /* Parse an (optional) exception-specification.
24053 exception-specification:
24054 throw ( type-id-list [opt] )
24056 Returns a TREE_LIST representing the exception-specification. The
24057 TREE_VALUE of each node is a type. */
24059 static tree
24061 {
24063 tree type_id_list;
24066 /* Peek at the next token. */
24069 /* Is it a noexcept-specification? */
24075 /* If it's not `throw', then there's no exception-specification. */
24081 /* Consume the `throw'. */
24084 /* Look for the `('. */
24087 /* Peek at the next token. */
24089 /* If it's not a `)', then there is a type-id-list. */
24091 {
24092 /* Types may not be defined in an exception-specification. */
24094 parser->type_definition_forbidden_message
24096 /* Parse the type-id-list. */
24098 /* Restore the saved message. */
24102 {
24106 }
24109 "dynamic exception specifications are deprecated in "
24111 }
24112 /* In C++17, throw() is equivalent to noexcept (true). throw()
24113 is deprecated in C++11 and above as well, but is still widely used,
24114 so don't warn about it yet. */
24117 else
24120 /* Look for the `)'. */
24124 }
24126 /* Parse an (optional) type-id-list.
24128 type-id-list:
24129 type-id ... [opt]
24130 type-id-list , type-id ... [opt]
24132 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24133 in the order that the types were presented. */
24135 static tree
24137 {
24141 {
24143 tree type;
24147 /* Get the next type-id. */
24149 /* Check for invalid 'auto'. */
24151 {
24155 }
24156 /* Parse the optional ellipsis. */
24158 {
24159 /* Consume the `...'. */
24162 /* Turn the type into a pack expansion expression. */
24164 }
24165 /* Add it to the list. */
24167 /* Peek at the next token. */
24169 /* If it is not a `,', we are done. */
24172 /* Consume the `,'. */
24174 }
24177 }
24179 /* Parse a try-block.
24181 try-block:
24182 try compound-statement handler-seq */
24184 static tree
24186 {
24187 tree try_block;
24201 }
24203 /* Parse a function-try-block.
24205 function-try-block:
24206 try ctor-initializer [opt] function-body handler-seq */
24208 static bool
24210 {
24211 tree compound_stmt;
24212 tree try_block;
24215 /* Look for the `try' keyword. */
24218 /* Let the rest of the front end know where we are. */
24220 /* Parse the function-body. */
24221 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24223 /* We're done with the `try' part. */
24225 /* Parse the handlers. */
24227 /* We're done with the handlers. */
24231 }
24233 /* Parse a handler-seq.
24235 handler-seq:
24236 handler handler-seq [opt] */
24238 static void
24240 {
24242 {
24245 /* Parse the handler. */
24247 /* Peek at the next token. */
24249 /* If it's not `catch' then there are no more handlers. */
24252 }
24253 }
24255 /* Parse a handler.
24257 handler:
24258 catch ( exception-declaration ) compound-statement */
24260 static void
24262 {
24263 tree handler;
24264 tree declaration;
24274 }
24276 /* Parse an exception-declaration.
24278 exception-declaration:
24279 type-specifier-seq declarator
24280 type-specifier-seq abstract-declarator
24281 type-specifier-seq
24282 ...
24284 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24285 ellipsis variant is used. */
24287 static tree
24289 {
24290 cp_decl_specifier_seq type_specifiers;
24294 /* If it's an ellipsis, it's easy to handle. */
24296 {
24297 /* Consume the `...' token. */
24300 }
24302 /* Types may not be defined in exception-declarations. */
24304 parser->type_definition_forbidden_message
24307 /* Parse the type-specifier-seq. */
24311 /* If it's a `)', then there is no declarator. */
24314 else
24321 /* Restore the saved message. */
24328 }
24330 /* Parse a throw-expression.
24332 throw-expression:
24333 throw assignment-expression [opt]
24335 Returns a THROW_EXPR representing the throw-expression. */
24337 static tree
24339 {
24340 tree expression;
24345 /* Figure out whether or not there is an assignment-expression
24346 following the "throw" keyword. */
24354 else
24358 }
24360 /* GNU Extensions */
24362 /* Parse an (optional) asm-specification.
24364 asm-specification:
24365 asm ( string-literal )
24367 If the asm-specification is present, returns a STRING_CST
24368 corresponding to the string-literal. Otherwise, returns
24369 NULL_TREE. */
24371 static tree
24373 {
24375 tree asm_specification;
24377 /* Peek at the next token. */
24379 /* If the next token isn't the `asm' keyword, then there's no
24380 asm-specification. */
24384 /* Consume the `asm' token. */
24386 /* Look for the `('. */
24389 /* Look for the string-literal. */
24392 /* Look for the `)'. */
24396 }
24398 /* Parse an asm-operand-list.
24400 asm-operand-list:
24401 asm-operand
24402 asm-operand-list , asm-operand
24404 asm-operand:
24405 string-literal ( expression )
24406 [ string-literal ] string-literal ( expression )
24408 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24409 each node is the expression. The TREE_PURPOSE is itself a
24410 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24411 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24412 is a STRING_CST for the string literal before the parenthesis. Returns
24413 ERROR_MARK_NODE if any of the operands are invalid. */
24415 static tree
24417 {
24422 {
24423 tree string_literal;
24424 tree expression;
24425 tree name;
24428 {
24429 /* Consume the `[' token. */
24431 /* Read the operand name. */
24436 /* Look for the closing `]'. */
24438 }
24439 else
24441 /* Look for the string-literal. */
24444 /* Look for the `('. */
24446 /* Parse the expression. */
24448 /* Look for the `)'. */
24456 /* Add this operand to the list. */
24458 expression,
24459 asm_operands);
24460 /* If the next token is not a `,', there are no more
24461 operands. */
24464 /* Consume the `,'. */
24466 }
24469 }
24471 /* Parse an asm-clobber-list.
24473 asm-clobber-list:
24474 string-literal
24475 asm-clobber-list , string-literal
24477 Returns a TREE_LIST, indicating the clobbers in the order that they
24478 appeared. The TREE_VALUE of each node is a STRING_CST. */
24480 static tree
24482 {
24486 {
24487 tree string_literal;
24489 /* Look for the string literal. */
24491 /* Add it to the list. */
24493 /* If the next token is not a `,', then the list is
24494 complete. */
24497 /* Consume the `,' token. */
24499 }
24502 }
24504 /* Parse an asm-label-list.
24506 asm-label-list:
24507 identifier
24508 asm-label-list , identifier
24510 Returns a TREE_LIST, indicating the labels in the order that they
24511 appeared. The TREE_VALUE of each node is a label. */
24513 static tree
24515 {
24519 {
24522 /* Look for the identifier. */
24525 {
24528 {
24534 }
24535 }
24536 /* If the next token is not a `,', then the list is
24537 complete. */
24540 /* Consume the `,' token. */
24542 }
24545 }
24547 /* Return TRUE iff the next tokens in the stream are possibly the
24548 beginning of a GNU extension attribute. */
24550 static bool
24552 {
24554 }
24556 /* Return TRUE iff the next tokens in the stream are possibly the
24557 beginning of a standard C++-11 attribute specifier. */
24559 static bool
24561 {
24563 }
24565 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24566 beginning of a standard C++-11 attribute specifier. */
24568 static bool
24570 {
24578 }
24580 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24581 beginning of a GNU extension attribute. */
24583 static bool
24585 {
24589 }
24591 /* Return true iff the next tokens can be the beginning of either a
24592 GNU attribute list, or a standard C++11 attribute sequence. */
24594 static bool
24596 {
24599 }
24601 /* Return true iff the next Nth tokens can be the beginning of either
24602 a GNU attribute list, or a standard C++11 attribute sequence. */
24604 static bool
24606 {
24609 }
24611 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24612 of GNU attributes, or return NULL. */
24614 static tree
24616 {
24620 }
24622 #define CILK_SIMD_FN_CLAUSE_MASK \
24623 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24624 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24625 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24626 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24627 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24629 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24630 vector [(<clauses>)] */
24632 static void
24634 {
24638 {
24644 }
24647 {
24650 paren_scope++;
24651 }
24653 {
24656 paren_scope++;
24658 paren_scope--;
24659 /* Do not push the last ')' */
24662 }
24671 }
24673 /* Parse an (optional) series of attributes.
24675 attributes:
24676 attributes attribute
24678 attribute:
24679 __attribute__ (( attribute-list [opt] ))
24681 The return value is as for cp_parser_gnu_attribute_list. */
24683 static tree
24685 {
24689 {
24691 tree attribute_list;
24694 /* Peek at the next token. */
24696 /* If it's not `__attribute__', then we're done. */
24700 /* Consume the `__attribute__' keyword. */
24702 /* Look for the two `(' tokens. */
24706 /* Peek at the next token. */
24709 /* Parse the attribute-list. */
24711 else
24712 /* If the next token is a `)', then there is no attribute
24713 list. */
24716 /* Look for the two `)' tokens. */
24724 /* Add these new attributes to the list. */
24726 }
24729 }
24731 /* Parse a GNU attribute-list.
24733 attribute-list:
24734 attribute
24735 attribute-list , attribute
24737 attribute:
24738 identifier
24739 identifier ( identifier )
24740 identifier ( identifier , expression-list )
24741 identifier ( expression-list )
24743 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24744 to an attribute. The TREE_PURPOSE of each node is the identifier
24745 indicating which attribute is in use. The TREE_VALUE represents
24746 the arguments, if any. */
24748 static tree
24750 {
24756 {
24758 tree identifier;
24759 tree attribute;
24761 /* Look for the identifier. We also allow keywords here; for
24762 example `__attribute__ ((const))' is legal. */
24766 {
24769 /* Consume the token, but save it since we need it for the
24770 SIMD enabled function parsing. */
24773 /* Save away the identifier that indicates which attribute
24774 this is. */
24776 /* For keywords, use the canonical spelling, not the
24777 parsed identifier. */
24783 /* Peek at the next token. */
24785 /* If it's an `(', then parse the attribute arguments. */
24787 {
24792 {
24795 }
24796 else
24797 vec = cp_parser_parenthesized_expression_list
24803 else
24804 {
24807 }
24808 /* Save the arguments away. */
24810 }
24812 {
24815 }
24818 {
24819 /* Add this attribute to the list. */
24822 }
24825 }
24826 /* Now, look for more attributes. If the next token isn't a
24827 `,', we're done. */
24831 /* Consume the comma and keep going. */
24833 }
24836 /* We built up the list in reverse order. */
24838 }
24840 /* Parse a standard C++11 attribute.
24842 The returned representation is a TREE_LIST which TREE_PURPOSE is
24843 the scoped name of the attribute, and the TREE_VALUE is its
24844 arguments list.
24846 Note that the scoped name of the attribute is itself a TREE_LIST
24847 which TREE_PURPOSE is the namespace of the attribute, and
24848 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24849 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24850 and which TREE_PURPOSE is directly the attribute name.
24852 Clients of the attribute code should use get_attribute_namespace
24853 and get_attribute_name to get the actual namespace and name of
24854 attributes, regardless of their being GNU or C++11 attributes.
24856 attribute:
24857 attribute-token attribute-argument-clause [opt]
24859 attribute-token:
24860 identifier
24861 attribute-scoped-token
24863 attribute-scoped-token:
24864 attribute-namespace :: identifier
24866 attribute-namespace:
24867 identifier
24869 attribute-argument-clause:
24870 ( balanced-token-seq )
24872 balanced-token-seq:
24873 balanced-token [opt]
24874 balanced-token-seq balanced-token
24876 balanced-token:
24877 ( balanced-token-seq )
24878 [ balanced-token-seq ]
24879 { balanced-token-seq }. */
24881 static tree
24883 {
24887 /* First, parse name of the attribute, a.k.a attribute-token. */
24904 {
24905 /* We are seeing a scoped attribute token. */
24920 else
24921 {
24925 }
24927 NULL_TREE);
24929 }
24932 NULL_TREE);
24933 else
24934 {
24936 NULL_TREE);
24937 /* C++11 noreturn attribute is equivalent to GNU's. */
24940 /* C++14 deprecated attribute is equivalent to GNU's. */
24943 /* C++17 fallthrough attribute is equivalent to GNU's. */
24946 /* Transactional Memory TS optimize_for_synchronized attribute is
24947 equivalent to GNU transaction_callable. */
24951 /* Transactional Memory attributes are GNU attributes. */
24954 }
24956 /* Now parse the optional argument clause of the attribute. */
24961 {
24967 /* A GNU attribute that takes an identifier in parameter. */
24970 vec = cp_parser_parenthesized_expression_list
24976 else
24977 {
24980 }
24984 else
24986 }
24989 }
24991 /* Check that the attribute ATTRIBUTE appears at most once in the
24992 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24993 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24994 isn't implemented yet in GCC. */
24996 static void
24998 {
25000 {
25010 }
25011 }
25013 /* Parse a list of standard C++-11 attributes.
25015 attribute-list:
25016 attribute [opt]
25017 attribute-list , attribute[opt]
25018 attribute ...
25019 attribute-list , attribute ...
25020 */
25022 static tree
25024 {
25029 {
25034 {
25038 }
25041 {
25046 else
25047 {
25052 }
25054 }
25058 }
25061 }
25063 /* Parse a standard C++-11 attribute specifier.
25065 attribute-specifier:
25066 [ [ attribute-using-prefix [opt] attribute-list ] ]
25067 alignment-specifier
25069 attribute-using-prefix:
25070 using attribute-namespace :
25072 alignment-specifier:
25073 alignas ( type-id ... [opt] )
25074 alignas ( alignment-expression ... [opt] ). */
25076 static tree
25078 {
25084 {
25091 {
25102 {
25106 "attribute using prefix only available "
25112 }
25113 else
25115 }
25122 else
25123 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25124 when we are sure that we have actually parsed them. */
25126 }
25127 else
25128 {
25129 tree alignas_expr;
25131 /* Look for an alignment-specifier. */
25143 {
25146 }
25152 {
25159 }
25164 /* Handle alignas (pack...). */
25166 {
25169 }
25171 /* Something went wrong, so don't build the attribute. */
25176 {
25179 }
25181 /* Build the C++-11 representation of an 'aligned'
25182 attribute. */
25183 attributes =
25186 alignas_expr);
25187 }
25190 }
25192 /* Parse a standard C++-11 attribute-specifier-seq.
25194 attribute-specifier-seq:
25195 attribute-specifier-seq [opt] attribute-specifier
25196 */
25198 static tree
25200 {
25205 {
25214 else
25217 }
25220 }
25222 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25223 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25224 current value of the PEDANTIC flag, regardless of whether or not
25225 the `__extension__' keyword is present. The caller is responsible
25226 for restoring the value of the PEDANTIC flag. */
25228 static bool
25230 {
25231 /* Save the old value of the PEDANTIC flag. */
25235 {
25236 /* Consume the `__extension__' token. */
25238 /* We're not being pedantic while the `__extension__' keyword is
25239 in effect. */
25243 }
25246 }
25248 /* Parse a label declaration.
25250 label-declaration:
25251 __label__ label-declarator-seq ;
25253 label-declarator-seq:
25254 identifier , label-declarator-seq
25255 identifier */
25257 static void
25259 {
25260 /* Look for the `__label__' keyword. */
25264 {
25265 tree identifier;
25267 /* Look for an identifier. */
25269 /* If we failed, stop. */
25272 /* Declare it as a label. */
25274 /* If the next token is a `;', stop. */
25277 /* Look for the `,' separating the label declarations. */
25279 }
25281 /* Look for the final `;'. */
25283 }
25285 // -------------------------------------------------------------------------- //
25286 // Requires Clause
25288 // Parse a requires clause.
25289 //
25290 // requires-clause:
25291 // 'requires' logical-or-expression
25292 //
25293 // The required logical-or-expression must be a constant expression. Note
25294 // that we don't check that the expression is constepxr here. We defer until
25295 // we analyze constraints and then, we only check atomic constraints.
25296 static tree
25298 {
25299 // Parse the requires clause so that it is not automatically folded.
25307 }
25309 // Optionally parse a requires clause:
25310 static tree
25312 {
25315 {
25318 {
25321 /* Parse and discard the requires-clause. */
25324 }
25326 }
25329 }
25332 /*---------------------------------------------------------------------------
25333 Requires expressions
25334 ---------------------------------------------------------------------------*/
25336 /* Parse a requires expression
25338 requirement-expression:
25339 'requires' requirement-parameter-list [opt] requirement-body */
25340 static tree
25342 {
25346 /* A requires-expression shall appear only within a concept
25347 definition or a requires-clause.
25349 TODO: Implement this diagnostic correctly. */
25351 {
25355 }
25358 {
25359 /* Local parameters are delared as variables within the scope
25360 of the expression. They are not visible past the end of
25361 the expression. Expressions within the requires-expression
25362 are unevaluated. */
25363 struct scope_sentinel
25364 {
25366 {
25369 }
25372 {
25375 }
25378 /* Parse the optional parameter list. */
25380 {
25384 }
25385 else
25388 /* Parse the requirement body. */
25392 }
25394 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25395 the parm chain. */
25398 }
25400 /* Parse a parameterized requirement.
25402 requirement-parameter-list:
25403 '(' parameter-declaration-clause ')' */
25404 static tree
25406 {
25416 }
25418 /* Parse the body of a requirement.
25420 requirement-body:
25421 '{' requirement-list '}' */
25422 static tree
25424 {
25434 }
25436 /* Parse a list of requirements.
25438 requirement-list:
25439 requirement
25440 requirement-list ';' requirement[opt] */
25441 static tree
25443 {
25446 {
25453 /* If we see a semi-colon, consume it. */
25457 /* Stop processing at the end of the list. */
25460 }
25462 /* Reverse the order of requirements so they are analyzed in
25463 declaration order. */
25465 }
25467 /* Parse a syntactic requirement or type requirement.
25469 requirement:
25470 simple-requirement
25471 compound-requirement
25472 type-requirement
25473 nested-requirement */
25474 static tree
25476 {
25483 else
25485 }
25487 /* Parse a simple requirement.
25489 simple-requirement:
25490 expression ';' */
25491 static tree
25493 {
25502 }
25504 /* Parse a type requirement
25506 type-requirement
25507 nested-name-specifier [opt] required-type-name ';'
25509 required-type-name:
25510 type-name
25511 'template' [opt] simple-template-id */
25512 static tree
25514 {
25517 // Save the scope before parsing name specifiers.
25528 tree type;
25530 {
25539 }
25540 else
25559 }
25561 /* Parse a compound requirement
25563 compound-requirement:
25564 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25565 static tree
25567 {
25568 /* Parse an expression enclosed in '{ }'s. */
25579 /* Parse the optional noexcept. */
25582 {
25585 }
25587 /* Parse the optional trailing return type. */
25590 {
25598 }
25601 }
25603 /* Parse a nested requirement. This is the same as a requires clause.
25605 nested-requirement:
25606 requires-clause */
25607 static tree
25609 {
25615 }
25617 /* Support Functions */
25619 /* Return the appropriate prefer_type argument for lookup_name_real based on
25620 tag_type and template_mem_access. */
25624 {
25625 /* DR 141: When looking in the current enclosing context for a template-name
25626 after -> or ., only consider class templates. */
25630 {
25634 }
25635 }
25637 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25638 NAME should have one of the representations used for an
25639 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25640 is returned. If PARSER->SCOPE is a dependent type, then a
25641 SCOPE_REF is returned.
25643 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25644 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25645 was formed. Abstractly, such entities should not be passed to this
25646 function, because they do not need to be looked up, but it is
25647 simpler to check for this special case here, rather than at the
25648 call-sites.
25650 In cases not explicitly covered above, this function returns a
25651 DECL, OVERLOAD, or baselink representing the result of the lookup.
25652 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25653 is returned.
25655 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25656 (e.g., "struct") that was used. In that case bindings that do not
25657 refer to types are ignored.
25659 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25660 ignored.
25662 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25663 are ignored.
25665 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25666 types.
25668 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25669 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25670 NULL_TREE otherwise. */
25672 static cp_expr
25679 location_t name_location)
25680 {
25681 tree decl;
25684 /* Assume that the lookup will be unambiguous. */
25688 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25689 no longer valid. Note that if we are parsing tentatively, and
25690 the parse fails, OBJECT_TYPE will be automatically restored. */
25696 /* A template-id has already been resolved; there is no lookup to
25697 do. */
25701 {
25705 }
25707 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25708 it should already have been checked to make sure that the name
25709 used matches the type being destroyed. */
25711 {
25712 tree type;
25714 /* Figure out to which type this destructor applies. */
25719 else
25721 /* If that's not a class type, there is no destructor. */
25732 }
25734 /* By this point, the NAME should be an ordinary identifier. If
25735 the id-expression was a qualified name, the qualifying scope is
25736 stored in PARSER->SCOPE at this point. */
25739 /* Perform the lookup. */
25741 {
25747 /* If the SCOPE is dependent, the lookup must be deferred until
25748 the template is instantiated -- unless we are explicitly
25749 looking up names in uninstantiated templates. Even then, we
25750 cannot look up the name if the scope is not a class type; it
25751 might, for example, be a template type parameter. */
25756 /* Defer lookup. */
25758 else
25759 {
25762 /* If PARSER->SCOPE is a dependent type, then it must be a
25763 class type, and we must not be checking dependencies;
25764 otherwise, we would have processed this lookup above. So
25765 that PARSER->SCOPE is not considered a dependent base by
25766 lookup_member, we must enter the scope here. */
25770 /* If the PARSER->SCOPE is a template specialization, it
25771 may be instantiated during name lookup. In that case,
25772 errors may be issued. Even if we rollback the current
25773 tentative parse, those errors are valid. */
25778 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25779 lookup result and the nested-name-specifier nominates a class C:
25780 * if the name specified after the nested-name-specifier, when
25781 looked up in C, is the injected-class-name of C (Clause 9), or
25782 * if the name specified after the nested-name-specifier is the
25783 same as the identifier or the simple-template-id's template-
25784 name in the last component of the nested-name-specifier,
25785 the name is instead considered to name the constructor of
25786 class C. [ Note: for example, the constructor is not an
25787 acceptable lookup result in an elaborated-type-specifier so
25788 the constructor would not be used in place of the
25789 injected-class-name. --end note ] Such a constructor name
25790 shall be used only in the declarator-id of a declaration that
25791 names a constructor or in a using-declaration. */
25799 /* If we have a single function from a using decl, pull it out. */
25806 }
25808 /* If the scope is a dependent type and either we deferred lookup or
25809 we did lookup but didn't find the name, rememeber the name. */
25812 {
25814 {
25815 tree type;
25817 /* The resolution to Core Issue 180 says that `struct
25818 A::B' should be considered a type-name, even if `A'
25819 is dependent. */
25824 }
25828 CPP_CLOSE_PAREN)))
25832 else
25835 is_template);
25836 }
25839 }
25841 {
25842 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25843 OBJECT_TYPE is not a class. */
25845 /* If the OBJECT_TYPE is a template specialization, it may
25846 be instantiated during name lookup. In that case, errors
25847 may be issued. Even if we rollback the current tentative
25848 parse, those errors are valid. */
25850 name,
25853 tf_warning_or_error);
25854 else
25858 {
25859 /* Look it up in the enclosing context. */
25863 /* DR 141 says when looking for a template-name after -> or ., only
25864 consider class templates. */
25866 {
25872 }
25873 }
25875 /* The object is type-dependent, so we can't look anything up; we used
25876 this to get the DR 141 behavior. */
25880 }
25881 else
25882 {
25888 }
25890 /* If the lookup failed, let our caller know. */
25894 /* Pull out the template from an injected-class-name (or multiple). */
25898 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25900 {
25903 /* The error message we have to print is too complicated for
25904 cp_parser_error, so we incorporate its actions directly. */
25906 {
25908 name);
25910 }
25912 }
25920 /* If we have resolved the name of a member declaration, check to
25921 see if the declaration is accessible. When the name resolves to
25922 set of overloaded functions, accessibility is checked when
25923 overload resolution is done.
25925 During an explicit instantiation, access is not checked at all,
25926 as per [temp.explicit]. */
25933 }
25935 /* Like cp_parser_lookup_name, but for use in the typical case where
25936 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25937 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25939 static tree
25941 {
25943 none_type,
25948 location);
25949 }
25951 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25952 the current context, return the TYPE_DECL. If TAG_NAME_P is
25953 true, the DECL indicates the class being defined in a class-head,
25954 or declared in an elaborated-type-specifier.
25956 Otherwise, return DECL. */
25958 static tree
25960 {
25961 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25962 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25964 struct A {
25965 template <typename T> struct B;
25966 };
25968 template <typename T> struct A::B {};
25970 Similarly, in an elaborated-type-specifier:
25972 namespace N { struct X{}; }
25974 struct A {
25975 template <typename T> friend struct N::X;
25976 };
25978 However, if the DECL refers to a class type, and we are in
25979 the scope of the class, then the name lookup automatically
25980 finds the TYPE_DECL created by build_self_reference rather
25981 than a TEMPLATE_DECL. For example, in:
25983 template <class T> struct S {
25984 S s;
25985 };
25987 there is no need to handle such case. */
25993 }
25995 /* If too many, or too few, template-parameter lists apply to the
25996 declarator, issue an error message. Returns TRUE if all went well,
25997 and FALSE otherwise. */
25999 static bool
26002 location_t declarator_location)
26003 {
26005 {
26007 {
26015 /* If the DECLARATOR has the form `X<y>' then it uses one
26016 additional level of template parameters. */
26019 return cp_parser_check_template_parameters
26021 }
26037 }
26039 }
26041 /* NUM_TEMPLATES were used in the current declaration. If that is
26042 invalid, return FALSE and issue an error messages. Otherwise,
26043 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26044 declarator and we can print more accurate diagnostics. */
26046 static bool
26049 location_t location,
26051 {
26052 /* If there are the same number of template classes and parameter
26053 lists, that's OK. */
26056 /* If there are more, but only one more, then we are referring to a
26057 member template. That's OK too. */
26060 /* If there are more template classes than parameter lists, we have
26061 something like:
26063 template <class T> void S<T>::R<T>::f (); */
26065 {
26075 else
26078 }
26079 /* Otherwise, there are too many template parameter lists. We have
26080 something like:
26082 template <class T> template <class U> void S::f(); */
26085 }
26087 /* Parse an optional `::' token indicating that the following name is
26088 from the global namespace. If so, PARSER->SCOPE is set to the
26089 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26090 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26091 Returns the new value of PARSER->SCOPE, if the `::' token is
26092 present, and NULL_TREE otherwise. */
26094 static tree
26096 {
26099 /* Peek at the next token. */
26101 /* If we're looking at a `::' token then we're starting from the
26102 global namespace, not our current location. */
26104 {
26105 /* Consume the `::' token. */
26107 /* Set the SCOPE so that we know where to start the lookup. */
26113 }
26115 {
26119 }
26122 }
26124 /* Returns TRUE if the upcoming token sequence is the start of a
26125 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26126 declarator is preceded by the `friend' specifier. */
26128 static bool
26130 {
26133 tree nested_name_specifier;
26136 /* The common case is that this is not a constructor declarator, so
26137 try to avoid doing lots of work if at all possible. It's not
26138 valid declare a constructor at function scope. */
26141 /* And only certain tokens can begin a constructor declarator. */
26149 /* Parse tentatively; we are going to roll back all of the tokens
26150 consumed here. */
26152 /* Assume that we are looking at a constructor declarator. */
26155 /* Look for the optional `::' operator. */
26158 /* Look for the nested-name-specifier. */
26159 nested_name_specifier
26170 /* Outside of a class-specifier, there must be a
26171 nested-name-specifier. Except in C++17 mode, where we
26172 might be declaring a guiding declaration. */
26179 /* If we have a class scope, this is easy; DR 147 says that S::S always
26180 names the constructor, and no other qualified name could. */
26183 {
26193 }
26194 /* If we still think that this might be a constructor-declarator,
26195 look for a class-name. */
26197 {
26198 /* If we have:
26200 template <typename T> struct S {
26201 S();
26202 };
26204 we must recognize that the nested `S' names a class. */
26208 tree type_decl;
26212 none_type,
26219 {
26225 none_type,
26230 else
26232 }
26234 /* If there was no class-name, then this is not a constructor.
26235 Otherwise, if we are in a class-specifier and we aren't
26236 handling a friend declaration, check that its type matches
26237 current_class_type (c++/38313). Note: error_mark_node
26238 is left alone for error recovery purposes. */
26240 && (outside_class_specifier_p
26246 /* If we're still considering a constructor, we have to see a `(',
26247 to begin the parameter-declaration-clause, followed by either a
26248 `)', an `...', or a decl-specifier. We need to check for a
26249 type-specifier to avoid being fooled into thinking that:
26251 S (f) (int);
26253 is a constructor. (It is actually a function named `f' that
26254 takes one parameter (of type `int') and returns a value of type
26255 `S'. */
26263 /* A parameter declaration begins with a decl-specifier,
26264 which is either the "attribute" keyword, a storage class
26265 specifier, or (usually) a type-specifier. */
26267 {
26268 tree type;
26272 /* Names appearing in the type-specifier should be looked up
26273 in the scope of the class. */
26277 {
26280 {
26284 {
26287 }
26288 }
26290 }
26292 /* Inside the constructor parameter list, surrounding
26293 template-parameter-lists do not apply. */
26294 saved_num_template_parameter_lists
26298 /* Look for the type-specifier. */
26300 CP_PARSER_FLAGS_NONE,
26306 parser->num_template_parameter_lists
26309 /* Leave the scope of the class. */
26314 }
26315 }
26317 /* We did not really want to consume any tokens. */
26321 }
26323 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26324 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26325 they must be performed once we are in the scope of the function.
26327 Returns the function defined. */
26329 static tree
26330 cp_parser_function_definition_from_specifiers_and_declarator
26333 tree attributes,
26335 {
26336 tree fn;
26339 /* Begin the function-definition. */
26342 /* The things we're about to see are not directly qualified by any
26343 template headers we've seen thus far. */
26346 /* If there were names looked up in the decl-specifier-seq that we
26347 did not check, check them now. We must wait until we are in the
26348 scope of the function to perform the checks, since the function
26349 might be a friend. */
26353 {
26358 }
26361 {
26362 /* Skip the entire function. */
26365 }
26367 {
26368 /* Seen already, skip it. An error message has already been output. */
26372 /* If this is a function from a class, pop the nested class. */
26375 }
26376 else
26377 {
26378 timevar_id_t tv;
26381 else
26387 }
26390 }
26392 /* Parse the part of a function-definition that follows the
26393 declarator. INLINE_P is TRUE iff this function is an inline
26394 function defined within a class-specifier.
26396 Returns the function defined. */
26398 static tree
26401 {
26402 tree fn;
26408 bool fully_implicit_function_template_p
26411 tree implicit_template_parms
26414 cp_binding_level* implicit_template_scope
26420 /* If the next token is `return', then the code may be trying to
26421 make use of the "named return value" extension that G++ used to
26422 support. */
26425 {
26426 /* Consume the `return' keyword. */
26428 /* Look for the identifier that indicates what value is to be
26429 returned. */
26431 /* Issue an error message. */
26434 /* Skip tokens until we reach the start of the function body. */
26436 {
26443 }
26444 }
26445 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26446 anything declared inside `f'. */
26447 saved_in_unbraced_linkage_specification_p
26450 /* Inside the function, surrounding template-parameter-lists do not
26451 apply. */
26452 saved_num_template_parameter_lists
26458 /* If the next token is `try', `__transaction_atomic', or
26459 `__transaction_relaxed`, then we are looking at either function-try-block
26460 or function-transaction-block. Note that all of these include the
26461 function-body. */
26464 RID_TRANSACTION_ATOMIC);
26466 RID_TRANSACTION_RELAXED))
26468 RID_TRANSACTION_RELAXED);
26471 else
26472 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26477 /* Finish the function. */
26480 /* Generate code for it, if necessary. */
26482 /* Restore the saved values. */
26483 parser->in_unbraced_linkage_specification_p
26485 parser->num_template_parameter_lists
26489 parser->fully_implicit_function_template_p
26491 parser->implicit_template_parms
26493 parser->implicit_template_scope
26500 }
26502 /* Parse a template-declaration body (following argument list). */
26504 static void
26506 tree parameter_list,
26508 {
26512 /* We just processed one more parameter list. */
26515 /* Get the deferred access checks from the parameter list. These
26516 will be checked once we know what is being declared, as for a
26517 member template the checks must be performed in the scope of the
26518 class containing the member. */
26521 /* Tentatively parse for a new template parameter list, which can either be
26522 the template keyword or a template introduction. */
26528 else
26529 {
26530 /* There are no access checks when parsing a template, as we do not
26531 know if a specialization will be a friend. */
26535 checks,
26536 member_p,
26541 /* If this is a member template declaration, let the front
26542 end know. */
26544 {
26549 }
26554 }
26555 /* We are done with the current parameter list. */
26560 /* Finish up. */
26563 /* Check the template arguments for a literal operator template. */
26567 {
26571 else
26572 {
26575 {
26581 }
26583 {
26592 }
26593 else
26595 }
26597 {
26600 " Expected non-type template argument pack <char...>"
26602 decl);
26603 else
26606 decl);
26607 }
26608 }
26610 /* Register member declarations. */
26613 /* If DECL is a function template, we must return to parse it later.
26614 (Even though there is no definition, there might be default
26615 arguments that need handling.) */
26619 }
26621 /* Parse a template introduction header for a template-declaration. Returns
26622 false if tentative parse fails. */
26624 static bool
26626 {
26633 /* Look for the optional `::' operator. */
26636 /* Look for the nested-name-specifier. */
26646 /* Look up the concept for which we will be matching
26647 template parameters. */
26657 /* Look for opening brace for introduction. */
26665 /* Build vector of placeholder parameters and grab
26666 matching identifiers. */
26669 /* The introduction-list shall not be empty. */
26672 {
26675 }
26677 /* Look for closing brace for introduction. */
26682 {
26686 }
26688 /* Build and associate the constraint. */
26691 {
26693 member_p);
26695 }
26699 }
26701 /* Parse a normal template-declaration following the template keyword. */
26703 static void
26705 {
26706 tree parameter_list;
26710 /* Look for the `<' token. */
26714 {
26715 /* 14.5.2.2 [temp.mem]
26717 A local class shall not have member templates. */
26722 }
26723 /* [temp]
26725 A template ... shall not have C linkage. */
26727 {
26729 /* Give it C++ linkage to avoid confusing other parts of the
26730 front end. */
26733 }
26734 else
26737 /* We cannot perform access checks on the template parameter
26738 declarations until we know what is being declared, just as we
26739 cannot check the decl-specifier list. */
26742 /* If the next token is `>', then we have an invalid
26743 specialization. Rather than complain about an invalid template
26744 parameter, issue an error message here. */
26746 {
26750 }
26751 else
26752 {
26753 /* Parse the template parameters. */
26755 }
26757 /* Look for the `>'. */
26760 /* Manage template requirements */
26762 {
26767 }
26770 member_p);
26772 /* For the erroneous case of a template with C linkage, we pushed an
26773 implicit C++ linkage scope; exit that scope now. */
26776 }
26778 /* Parse a template-declaration, assuming that the `export' (and
26779 `extern') keywords, if present, has already been scanned. MEMBER_P
26780 is as for cp_parser_template_declaration. */
26782 static bool
26784 {
26786 {
26790 }
26795 }
26797 /* Perform the deferred access checks from a template-parameter-list.
26798 CHECKS is a TREE_LIST of access checks, as returned by
26799 get_deferred_access_checks. */
26801 static void
26802 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26803 {
26807 }
26809 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26810 `function-definition' sequence that follows a template header.
26811 If MEMBER_P is true, this declaration appears in a class scope.
26813 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26814 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26816 static tree
26822 {
26825 cp_decl_specifier_seq decl_specifiers;
26829 /* This function is only used when processing a template
26830 declaration. */
26834 /* Defer access checks until we know what is being declared. */
26837 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26838 alternative. */
26841 CP_PARSER_FLAGS_OPTIONAL,
26847 /* There are no template typedefs. */
26849 {
26853 }
26855 /* Gather up the access checks that occurred the
26856 decl-specifier-seq. */
26859 /* Check for the declaration of a template class. */
26861 {
26864 {
26865 // If this is a declaration, but not a definition, associate
26866 // any constraints with the type declaration. Constraints
26867 // are associated with definitions in cp_parser_class_specifier.
26873 /* In this case:
26875 struct C {
26876 friend template <typename T> struct A<T>::B;
26877 };
26879 A<T>::B will be represented by a TYPENAME_TYPE, and
26880 therefore not recognized by shadow_tag. */
26882 && !decl
26889 else
26892 /* Perform access checks for template parameters. */
26895 /* Give a helpful diagnostic for
26896 template <class T> struct A { } a;
26897 if we aren't already recovering from an error. */
26900 {
26902 "a class template declaration must not declare "
26906 }
26907 }
26908 }
26910 /* Complain about missing 'typename' or other invalid type names. */
26913 {
26914 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26915 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26916 the rest of this declaration. */
26919 }
26921 /* If it's not a template class, try for a template function. If
26922 the next token is a `;', then this declaration does not declare
26923 anything. But, if there were errors in the decl-specifiers, then
26924 the error might well have come from an attempted class-specifier.
26925 In that case, there's no need to warn about a missing declarator. */
26929 {
26932 checks,
26934 member_p,
26935 declares_class_or_enum,
26939 /* 7.1.1-1 [dcl.stc]
26941 A storage-class-specifier shall not be specified in an explicit
26942 specialization... */
26944 && explicit_specialization_p
26946 {
26950 }
26954 }
26956 /* Look for a trailing `;' after the declaration. */
26962 out:
26965 /* Clear any current qualification; whatever comes next is the start
26966 of something new. */
26972 }
26974 /* Parse a cast-expression that is not the operand of a unary "&". */
26976 static cp_expr
26978 {
26981 }
26983 /* Parse a functional cast to TYPE. Returns an expression
26984 representing the cast. */
26986 static cp_expr
26988 {
26990 tree expression_list;
26991 cp_expr cast;
27000 {
27010 /* Create a location of the form:
27011 type_name{i, f}
27012 ^~~~~~~~~~~~~~~
27013 with caret == start at the start of the type name,
27014 finishing at the closing brace. */
27015 location_t finish_loc
27018 finish_loc);
27021 }
27030 else
27031 {
27034 }
27037 tf_warning_or_error);
27038 /* [expr.const]/1: In an integral constant expression "only type
27039 conversions to integral or enumeration type can be used". */
27045 NIC_CONSTRUCTOR))
27048 /* Create a location of the form:
27049 float(i)
27050 ^~~~~~~~
27051 with caret == start at the start of the type name,
27052 finishing at the closing paren. */
27053 location_t finish_loc
27058 }
27060 /* Save the tokens that make up the body of a member function defined
27061 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27062 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27063 specifiers applied to the declaration. Returns the FUNCTION_DECL
27064 for the member function. */
27066 static tree
27070 tree attributes)
27071 {
27074 tree fn;
27077 /* Create the FUNCTION_DECL. */
27081 /* If something went badly wrong, bail out now. */
27083 {
27084 /* If there's a function-body, skip it. */
27089 }
27091 /* Remember it, if there default args to post process. */
27094 /* Save away the tokens that make up the body of the
27095 function. */
27101 RID_TRANSACTION_ATOMIC))
27102 {
27104 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27111 {
27117 }
27118 else
27121 {
27125 }
27126 }
27128 /* Handle function try blocks. */
27130 {
27133 }
27134 /* We can have braced-init-list mem-initializers before the fn body. */
27136 {
27139 {
27140 /* cache_group will stop after an un-nested { } pair, too. */
27144 /* variadic mem-inits have ... after the ')'. */
27147 }
27148 }
27150 /* Handle function try blocks. */
27156 /* Save away the inline definition; we will process it when the
27157 class is complete. */
27161 /* We need to know that this was defined in the class, so that
27162 friend templates are handled correctly. */
27165 /* Add FN to the queue of functions to be parsed later. */
27169 }
27171 /* Save the tokens that make up the in-class initializer for a non-static
27172 data member. Returns a DEFAULT_ARG. */
27174 static tree
27176 {
27178 }
27180 /* Parse a template-argument-list, as well as the trailing ">" (but
27181 not the opening "<"). See cp_parser_template_argument_list for the
27182 return value. */
27184 static tree
27186 {
27187 tree arguments;
27188 tree saved_scope;
27189 tree saved_qualifying_scope;
27190 tree saved_object_scope;
27195 /* [temp.names]
27197 When parsing a template-id, the first non-nested `>' is taken as
27198 the end of the template-argument-list rather than a greater-than
27199 operator. */
27200 saved_greater_than_is_operator_p
27203 /* Parsing the argument list may modify SCOPE, so we save it
27204 here. */
27208 /* We need to evaluate the template arguments, even though this
27209 template-id may be nested within a "sizeof". */
27214 /* Parse the template-argument-list itself. */
27218 else
27220 /* Look for the `>' that ends the template-argument-list. If we find
27221 a '>>' instead, it's probably just a typo. */
27223 {
27225 {
27226 /* In C++0x, a `>>' in a template argument list or cast
27227 expression is considered to be two separate `>'
27228 tokens. So, change the current token to a `>', but don't
27229 consume it: it will be consumed later when the outer
27230 template argument list (or cast expression) is parsed.
27231 Note that this replacement of `>' for `>>' is necessary
27232 even if we are parsing tentatively: in the tentative
27233 case, after calling
27234 cp_parser_enclosed_template_argument_list we will always
27235 throw away all of the template arguments and the first
27236 closing `>', either because the template argument list
27237 was erroneous or because we are replacing those tokens
27238 with a CPP_TEMPLATE_ID token. The second `>' (which will
27239 not have been thrown away) is needed either to close an
27240 outer template argument list or to complete a new-style
27241 cast. */
27244 }
27246 {
27247 /* If we're in a nested template argument list, the '>>' has
27248 to be a typo for '> >'. We emit the error message, but we
27249 continue parsing and we push a '>' as next token, so that
27250 the argument list will be parsed correctly. Note that the
27251 global source location is still on the token before the
27252 '>>', so we need to say explicitly where we want it. */
27260 }
27261 else
27262 {
27263 /* If this is not a nested template argument list, the '>>'
27264 is a typo for '>'. Emit an error message and continue.
27265 Same deal about the token location, but here we can get it
27266 right by consuming the '>>' before issuing the diagnostic. */
27269 "spurious %<>>%>, use %<>%> to terminate "
27271 }
27272 }
27273 else
27275 /* The `>' token might be a greater-than operator again now. */
27276 parser->greater_than_is_operator_p
27278 /* Restore the SAVED_SCOPE. */
27286 }
27288 /* MEMBER_FUNCTION is a member function, or a friend. If default
27289 arguments, or the body of the function have not yet been parsed,
27290 parse them now. */
27292 static void
27294 {
27296 /* If this member is a template, get the underlying
27297 FUNCTION_DECL. */
27301 /* There should not be any class definitions in progress at this
27302 point; the bodies of members are only parsed outside of all class
27303 definitions. */
27305 /* While we're parsing the member functions we might encounter more
27306 classes. We want to handle them right away, but we don't want
27307 them getting mixed up with functions that are currently in the
27308 queue. */
27311 /* Make sure that any template parameters are in scope. */
27314 /* If the body of the function has not yet been parsed, parse it
27315 now. */
27317 {
27318 tree function_scope;
27321 /* The function is no longer pending; we are processing it. */
27326 /* If this is a local class, enter the scope of the containing
27327 function. */
27332 /* Push the body of the function onto the lexer stack. */
27335 /* Let the front end know that we going to be defining this
27336 function. */
27340 /* Don't do access checking if it is a templated function. */
27344 /* #pragma omp declare reduction needs special parsing. */
27346 {
27351 }
27352 else
27353 /* Now, parse the body of the function. */
27360 /* Leave the scope of the containing function. */
27364 }
27366 /* Remove any template parameters from the symbol table. */
27369 /* Restore the queue. */
27372 }
27374 /* If DECL contains any default args, remember it on the unparsed
27375 functions queue. */
27377 static void
27379 {
27380 tree probe;
27383 probe;
27386 {
27390 }
27391 }
27393 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27394 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27395 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27396 from the parameter-type-list. */
27398 static tree
27401 {
27403 tree parsed_arg;
27409 /* Push the saved tokens for the default argument onto the parser's
27410 lexer stack. */
27416 /* Parse the default argument. */
27427 {
27428 /* In a non-template class, check conversions now. In a template,
27429 we'll wait and instantiate these as needed. */
27432 tf_warning_or_error);
27435 else
27437 }
27439 /* If the token stream has not been completely used up, then
27440 there was extra junk after the end of the default
27441 argument. */
27443 {
27446 else
27448 }
27450 /* Revert to the main lexer. */
27454 }
27456 /* FIELD is a non-static data member with an initializer which we saved for
27457 later; parse it now. */
27459 static void
27461 {
27462 tree def;
27469 NULL_TREE);
27475 }
27477 /* FN is a FUNCTION_DECL which may contains a parameter with an
27478 unparsed DEFAULT_ARG. Parse the default args now. This function
27479 assumes that the current scope is the scope in which the default
27480 argument should be processed. */
27482 static void
27484 {
27488 /* While we're parsing the default args, we might (due to the
27489 statement expression extension) encounter more classes. We want
27490 to handle them right away, but we don't want them getting mixed
27491 up with default args that are currently in the queue. */
27494 /* Local variable names (and the `this' keyword) may not appear
27495 in a default argument. */
27506 {
27508 tree parsed_arg;
27510 tree copy;
27517 /* This can happen for a friend declaration for a function
27518 already declared with default arguments. */
27521 parsed_arg
27523 default_arg,
27526 {
27528 }
27532 /* Update any instantiations we've already created. */
27536 }
27540 /* Make sure no default arg is missing. */
27543 /* Restore the state of local_variables_forbidden_p. */
27546 /* Restore the queue. */
27548 }
27550 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27552 sizeof ... ( identifier )
27554 where the 'sizeof' token has already been consumed. */
27556 static tree
27558 {
27559 /* Consume the `...'. */
27566 else
27574 /* The name is not qualified. */
27593 }
27595 /* Parse the operand of `sizeof' (or a similar operator). Returns
27596 either a TYPE or an expression, depending on the form of the
27597 input. The KEYWORD indicates which kind of expression we have
27598 encountered. */
27600 static tree
27602 {
27609 /* If it's a `...', then we are computing the length of a parameter
27610 pack. */
27615 /* Types cannot be defined in a `sizeof' expression. Save away the
27616 old message. */
27618 /* And create the new one. */
27624 /* The restrictions on constant-expressions do not apply inside
27625 sizeof expressions. */
27626 saved_integral_constant_expression_p
27628 saved_non_integral_constant_expression_p
27632 /* Do not actually evaluate the expression. */
27635 /* If it's a `(', then we might be looking at the type-id
27636 construction. */
27638 {
27641 /* We can't be sure yet whether we're looking at a type-id or an
27642 expression. */
27644 /* Note: as a GNU Extension, compound literals are considered
27645 postfix-expressions as they are in C99, so they are valid
27646 arguments to sizeof. See comment in cp_parser_cast_expression
27647 for details. */
27650 else
27651 {
27654 /* Look for the type-id. */
27656 /* Look for the closing `)'. */
27659 }
27661 /* If all went well, then we're done. */
27663 {
27664 cp_decl_specifier_seq decl_specs;
27666 /* Build a trivial decl-specifier-seq. */
27670 /* Call grokdeclarator to figure out what type this is. */
27673 TYPENAME,
27676 }
27677 }
27679 /* If the type-id production did not work out, then we must be
27680 looking at the unary-expression production. */
27684 /* Go back to evaluating expressions. */
27688 /* Free the message we created. */
27690 /* And restore the old one. */
27692 parser->integral_constant_expression_p
27694 parser->non_integral_constant_expression_p
27698 }
27700 /* If the current declaration has no declarator, return true. */
27702 static bool
27704 {
27705 /* If the next token is a `;' or a `,' then there is no
27706 declarator. */
27709 }
27711 /* Update the DECL_SPECS to reflect the storage class indicated by
27712 KEYWORD. */
27714 static void
27719 {
27720 cp_storage_class storage_class;
27723 {
27727 }
27729 {
27732 }
27737 {
27740 }
27743 {
27761 }
27765 /* A storage class specifier cannot be applied alongside a typedef
27766 specifier. If there is a typedef specifier present then set
27767 conflicting_specifiers_p which will trigger an error later
27768 on in grokdeclarator. */
27771 }
27773 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27774 is true, the type is a class or enum definition. */
27776 static void
27778 tree type_spec,
27781 {
27784 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27785 (with, for example, in "typedef int wchar_t;") we remember that
27786 this is what happened. In system headers, we ignore these
27787 declarations so that G++ can work with system headers that are not
27788 C++-safe. */
27790 && !type_definition_p
27800 {
27803 ds_redefined_builtin_type_spec,
27804 token);
27806 {
27810 }
27811 }
27814 else
27815 {
27820 }
27821 }
27823 /* True iff TOKEN is the GNU keyword __thread. */
27825 static bool
27827 {
27830 }
27832 /* Set the location for a declarator specifier and check if it is
27833 duplicated.
27835 DECL_SPECS is the sequence of declarator specifiers onto which to
27836 set the location.
27838 DS is the single declarator specifier to set which location is to
27839 be set onto the existing sequence of declarators.
27841 LOCATION is the location for the declarator specifier to
27842 consider. */
27844 static void
27847 {
27856 {
27860 }
27861 else
27862 {
27864 {
27868 else
27869 {
27872 OPT_Wlong_long,
27874 }
27875 }
27877 {
27882 else
27883 {
27887 }
27888 }
27889 else
27890 {
27906 "__complex"
27907 };
27911 }
27912 }
27913 }
27915 /* Return true iff the declarator specifier DS is present in the
27916 sequence of declarator specifiers DECL_SPECS. */
27918 bool
27920 cp_decl_spec ds)
27921 {
27928 }
27930 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27931 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27933 static bool
27935 {
27937 }
27939 /* Issue an error message indicating that TOKEN_DESC was expected.
27940 If KEYWORD is true, it indicated this function is called by
27941 cp_parser_require_keword and the required token can only be
27942 a indicated keyword. */
27944 static void
27946 required_token token_desc,
27948 {
27950 {
28019 }
28021 {
28023 {
28102 }
28103 }
28104 else
28106 }
28110 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28111 issue an error message indicating that TOKEN_DESC was expected.
28113 Returns the token consumed, if the token had the appropriate type.
28114 Otherwise, returns NULL. */
28119 required_token token_desc)
28120 {
28123 else
28124 {
28125 /* Output the MESSAGE -- unless we're parsing tentatively. */
28129 }
28130 }
28132 /* An error message is produced if the next token is not '>'.
28133 All further tokens are skipped until the desired token is
28134 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28136 static void
28138 {
28139 /* Current level of '< ... >'. */
28141 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28144 /* Are we ready, yet? If not, issue error message. */
28148 /* Skip tokens until the desired token is found. */
28150 {
28151 /* Peek at the next token. */
28153 {
28161 /* C++0x views the `>>' operator as two `>' tokens, but
28162 C++98 does not. */
28165 {
28166 /* We've hit a `>>' where the first `>' closes the
28167 template argument list, and the second `>' is
28168 spurious. Just consume the `>>' and stop; we've
28169 already produced at least one error. */
28172 }
28173 /* Fall through for C++0x, so we handle the second `>' in
28174 the `>>'. */
28179 {
28180 /* We've reached the token we want, consume it and stop. */
28183 }
28202 /* The '>' was probably forgotten, don't look further. */
28207 }
28209 /* Consume this token. */
28211 }
28212 }
28214 /* If the next token is the indicated keyword, consume it. Otherwise,
28215 issue an error message indicating that TOKEN_DESC was expected.
28217 Returns the token consumed, if the token had the appropriate type.
28218 Otherwise, returns NULL. */
28223 required_token token_desc)
28224 {
28228 {
28231 }
28234 }
28236 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28237 function-definition. */
28239 static bool
28241 {
28244 /* A ctor-initializer begins with a `:'. */
28246 /* A function-try-block begins with `try'. */
28248 /* A function-transaction-block begins with `__transaction_atomic'
28249 or `__transaction_relaxed'. */
28252 /* The named return value extension begins with `return'. */
28254 }
28256 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28257 definition. */
28259 static bool
28261 {
28268 }
28270 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28271 C++0x) ending a template-argument. */
28273 static bool
28275 {
28283 }
28285 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28286 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28288 static bool
28291 {
28297 /* Check for the sequence `<::' in the original code. It would be lexed as
28298 `[:', where `[' is a digraph, and there is no whitespace before
28299 `:'. */
28301 {
28306 }
28308 }
28310 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28311 or none_type otherwise. */
28313 static enum tag_types
28315 {
28317 {
28327 }
28328 }
28330 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28331 or none_type otherwise or if the token is null. */
28333 static enum tag_types
28335 {
28340 {
28348 }
28349 }
28351 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28353 static void
28355 {
28359 {
28363 type))
28366 }
28367 }
28369 /* Issue an error message if DECL is redeclared with different
28370 access than its original declaration [class.access.spec/3].
28371 This applies to nested classes, nested class templates and
28372 enumerations [class.mem/1]. */
28374 static void
28376 {
28387 }
28389 /* Look for the `template' keyword, as a syntactic disambiguator.
28390 Return TRUE iff it is present, in which case it will be
28391 consumed. */
28393 static bool
28395 {
28397 {
28398 /* In C++98 the `template' keyword can only be used within templates;
28399 outside templates the parser can always figure out what is a
28400 template and what is not. In C++11, per the resolution of DR 468,
28401 `template' is allowed in cases where it is not strictly necessary. */
28404 {
28407 "in C++98 %<template%> (as a disambiguator) is only "
28409 /* If this part of the token stream is rescanned, the same
28410 error message would be generated. So, we purge the token
28411 from the stream. */
28414 }
28415 else
28416 {
28417 /* Consume the `template' keyword. */
28420 }
28421 }
28423 }
28425 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28426 set PARSER->SCOPE, and perform other related actions. */
28428 static void
28430 {
28433 /* Get the stored value. */
28435 /* Set the scope from the stored value. */
28439 }
28441 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28442 encounter the end of a block before what we were looking for. */
28444 static bool
28448 {
28450 {
28453 /* Abort a parenthesized expression if we encounter a semicolon. */
28457 /* If we've reached the end of the file, stop. */
28463 /* We've hit the end of an enclosing block, so there's been some
28464 kind of syntax error. */
28467 /* Consume the token. */
28469 /* See if it starts a new group. */
28471 {
28473 /* In theory this should probably check end == '}', but
28474 cp_parser_save_member_function_body needs it to exit
28475 after either '}' or ')' when called with ')'. */
28478 }
28480 {
28484 }
28489 }
28490 }
28492 /* Like above, for caching a default argument or NSDMI. Both of these are
28493 terminated by a non-nested comma, but it can be unclear whether or not a
28494 comma is nested in a template argument list unless we do more parsing.
28495 In order to handle this ambiguity, when we encounter a ',' after a '<'
28496 we try to parse what follows as a parameter-declaration-list (in the
28497 case of a default argument) or a member-declarator (in the case of an
28498 NSDMI). If that succeeds, then we stop caching. */
28500 static tree
28502 {
28507 tree default_argument;
28509 /* Add tokens until we have processed the entire default
28510 argument. We add the range [first_token, token). */
28513 {
28514 /* For list-initialization, this is straightforward. */
28517 }
28519 {
28522 /* Peek at the next token. */
28524 /* What we do depends on what token we have. */
28526 {
28527 /* In valid code, a default argument must be
28528 immediately followed by a `,' `)', or `...'. */
28531 {
28532 /* If we've seen a '<', we might be in a
28533 template-argument-list. Until Core issue 325 is
28534 resolved, we don't know how this situation ought
28535 to be handled, so try to DTRT. We check whether
28536 what comes after the comma is a valid parameter
28537 declaration list. If it is, then the comma ends
28538 the default argument; otherwise the default
28539 argument continues. */
28543 /* Set ITALP so cp_parser_parameter_declaration_list
28544 doesn't decide to commit to this parse. */
28551 {
28552 /* Parse declarators until we reach a non-comma or
28553 somthing that cannot be an initializer.
28554 Just checking whether we're looking at a single
28555 declarator is insufficient. Consider:
28556 int var = tuple<T,U>::x;
28557 The template parameter 'U' looks exactly like a
28558 declarator. */
28559 do
28560 {
28571 }
28573 /* If we met an '=' or ';' then the original comma
28574 was the end of the NSDMI. Otherwise assume
28575 we're still in the NSDMI. */
28578 }
28579 else
28580 {
28585 }
28592 }
28593 /* FALLTHRU */
28596 /* If we run into a non-nested `;', `}', or `]',
28597 then the code is invalid -- but the default
28598 argument is certainly over. */
28603 /* Handle correctly int n = sizeof ... ( p ); */
28606 /* Update DEPTH, if necessary. */
28621 /* This might be the comparison operator, or it might
28622 start a template argument list. */
28629 /* Fall through for C++0x, which treats the `>>'
28630 operator like two `>' tokens in certain
28631 cases. */
28636 {
28637 /* This might be an operator, or it might close a
28638 template argument list. But if a previous '<'
28639 started a template argument list, this will have
28640 closed it, so we can't be in one anymore. */
28644 }
28647 /* If we run out of tokens, issue an error message. */
28655 /* In these cases, we should look for template-ids.
28656 For example, if the default argument is
28657 `X<int, double>()', we need to do name lookup to
28658 figure out whether or not `X' is a template; if
28659 so, the `,' does not end the default argument.
28661 That is not yet done. */
28666 }
28668 /* If we've reached the end, stop. */
28672 /* Add the token to the token block. */
28674 }
28676 /* Create a DEFAULT_ARG to represent the unparsed default
28677 argument. */
28684 }
28686 /* Begin parsing tentatively. We always save tokens while parsing
28687 tentatively so that if the tentative parsing fails we can restore the
28688 tokens. */
28690 static void
28692 {
28693 /* Enter a new parsing context. */
28695 /* Begin saving tokens. */
28697 /* In order to avoid repetitive access control error messages,
28698 access checks are queued up until we are no longer parsing
28699 tentatively. */
28701 }
28703 /* Commit to the currently active tentative parse. */
28705 static void
28707 {
28711 /* Mark all of the levels as committed. */
28714 {
28721 }
28722 }
28724 /* Commit to the topmost currently active tentative parse.
28726 Note that this function shouldn't be called when there are
28727 irreversible side-effects while in a tentative state. For
28728 example, we shouldn't create a permanent entry in the symbol
28729 table, or issue an error message that might not apply if the
28730 tentative parse is aborted. */
28732 static void
28734 {
28739 {
28747 }
28748 }
28750 /* Abort the currently active tentative parse. All consumed tokens
28751 will be rolled back, and no diagnostics will be issued. */
28753 static void
28755 {
28759 /* Now, pretend that we want to see if the construct was
28760 successfully parsed. */
28762 }
28764 /* Stop parsing tentatively. If a parse error has occurred, restore the
28765 token stream. Otherwise, commit to the tokens we have consumed.
28766 Returns true if no error occurred; false otherwise. */
28768 static bool
28770 {
28774 /* Remember whether or not an error occurred, since we are about to
28775 destroy that information. */
28777 /* Remove the topmost context from the stack. */
28780 /* If no parse errors occurred, commit to the tentative parse. */
28782 {
28783 /* Commit to the tokens read tentatively, unless that was
28784 already done. */
28789 }
28790 /* Otherwise, if errors occurred, roll back our state so that things
28791 are just as they were before we began the tentative parse. */
28792 else
28793 {
28796 }
28797 /* Add the context to the front of the free list. */
28802 }
28804 /* Returns true if we are parsing tentatively and are not committed to
28805 this tentative parse. */
28807 static bool
28809 {
28812 }
28814 /* Returns nonzero iff an error has occurred during the most recent
28815 tentative parse. */
28817 static bool
28819 {
28822 }
28824 /* Returns nonzero if GNU extensions are allowed. */
28826 static bool
28828 {
28830 }
28831 \f
28832 /* Objective-C++ Productions */
28835 /* Parse an Objective-C expression, which feeds into a primary-expression
28836 above.
28838 objc-expression:
28839 objc-message-expression
28840 objc-string-literal
28841 objc-encode-expression
28842 objc-protocol-expression
28843 objc-selector-expression
28845 Returns a tree representation of the expression. */
28847 static cp_expr
28849 {
28850 /* Try to figure out what kind of declaration is present. */
28854 {
28864 {
28876 }
28882 }
28885 }
28887 /* Parse an Objective-C message expression.
28889 objc-message-expression:
28890 [ objc-message-receiver objc-message-args ]
28892 Returns a representation of an Objective-C message. */
28894 static tree
28896 {
28908 /* Construct a location e.g.
28909 [self func1:5]
28910 ^~~~~~~~~~~~~~
28911 ranging from the '[' to the ']', with the caret at the start. */
28916 }
28918 /* Parse an objc-message-receiver.
28920 objc-message-receiver:
28921 expression
28922 simple-type-specifier
28924 Returns a representation of the type or expression. */
28926 static tree
28928 {
28929 tree rcv;
28931 /* An Objective-C message receiver may be either (1) a type
28932 or (2) an expression. */
28936 /* If that worked out, fine. */
28943 CP_PARSER_FLAGS_NONE);
28950 }
28952 /* Parse the arguments and selectors comprising an Objective-C message.
28954 objc-message-args:
28955 objc-selector
28956 objc-selector-args
28957 objc-selector-args , objc-comma-args
28959 objc-selector-args:
28960 objc-selector [opt] : assignment-expression
28961 objc-selector-args objc-selector [opt] : assignment-expression
28963 objc-comma-args:
28964 assignment-expression
28965 objc-comma-args , assignment-expression
28967 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28968 selector arguments and TREE_VALUE containing a list of comma
28969 arguments. */
28971 static tree
28973 {
28979 {
28985 /* Detect if we have a unary selector. */
28994 sel_args
28999 }
29001 /* Handle non-selector arguments, if any. */
29003 {
29004 tree arg;
29009 addl_args
29014 }
29017 {
29020 }
29023 }
29025 /* Parse an Objective-C encode expression.
29027 objc-encode-expression:
29028 @encode objc-typename
29030 Returns an encoded representation of the type argument. */
29032 static cp_expr
29034 {
29035 tree type;
29046 {
29050 }
29052 /* This happens if we find @encode(T) (where T is a template
29053 typename or something dependent on a template typename) when
29054 parsing a template. In that case, we can't compile it
29055 immediately, but we rather create an AT_ENCODE_EXPR which will
29056 need to be instantiated when the template is used.
29057 */
29059 {
29063 }
29066 /* Build a location of the form:
29067 @encode(int)
29068 ^~~~~~~~~~~~
29069 with caret==start at the @ token, finishing at the close paren. */
29070 location_t combined_loc
29075 }
29077 /* Parse an Objective-C @defs expression. */
29079 static tree
29081 {
29082 tree name;
29090 }
29092 /* Parse an Objective-C protocol expression.
29094 objc-protocol-expression:
29095 @protocol ( identifier )
29097 Returns a representation of the protocol expression. */
29099 static tree
29101 {
29102 tree proto;
29110 /* Build a location of the form:
29111 @protocol(prot)
29112 ^~~~~~~~~~~~~~~
29113 with caret==start at the @ token, finishing at the close paren. */
29114 location_t combined_loc
29120 }
29122 /* Parse an Objective-C selector expression.
29124 objc-selector-expression:
29125 @selector ( objc-method-signature )
29127 objc-method-signature:
29128 objc-selector
29129 objc-selector-seq
29131 objc-selector-seq:
29132 objc-selector :
29133 objc-selector-seq objc-selector :
29135 Returns a representation of the method selector. */
29137 static tree
29139 {
29151 {
29160 {
29161 /* Detect if we have a unary selector. */
29163 {
29166 }
29167 else
29168 {
29170 }
29171 }
29176 {
29177 sel_seq
29180 sel_seq
29183 }
29184 else
29185 sel_seq
29190 }
29192 finish_selector:
29196 /* Build a location of the form:
29197 @selector(func)
29198 ^~~~~~~~~~~~~~~
29199 with caret==start at the @ token, finishing at the close paren. */
29200 location_t combined_loc
29204 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29207 }
29209 /* Parse a list of identifiers.
29211 objc-identifier-list:
29212 identifier
29213 objc-identifier-list , identifier
29215 Returns a TREE_LIST of identifier nodes. */
29217 static tree
29219 {
29220 tree identifier;
29221 tree list;
29232 {
29239 identifier));
29241 }
29244 }
29246 /* Parse an Objective-C alias declaration.
29248 objc-alias-declaration:
29249 @compatibility_alias identifier identifier ;
29251 This function registers the alias mapping with the Objective-C front end.
29252 It returns nothing. */
29254 static void
29256 {
29264 }
29266 /* Parse an Objective-C class forward-declaration.
29268 objc-class-declaration:
29269 @class objc-identifier-list ;
29271 The function registers the forward declarations with the Objective-C
29272 front end. It returns nothing. */
29274 static void
29276 {
29279 {
29280 tree id;
29290 else
29292 }
29294 }
29296 /* Parse a list of Objective-C protocol references.
29298 objc-protocol-refs-opt:
29299 objc-protocol-refs [opt]
29301 objc-protocol-refs:
29302 < objc-identifier-list >
29304 Returns a TREE_LIST of identifiers, if any. */
29306 static tree
29308 {
29312 {
29316 }
29319 }
29321 /* Parse a Objective-C visibility specification. */
29323 static void
29325 {
29329 {
29344 }
29346 /* Eat '@private'/'@protected'/'@public'. */
29348 }
29350 /* Parse an Objective-C method type. Return 'true' if it is a class
29351 (+) method, and 'false' if it is an instance (-) method. */
29355 {
29358 else
29360 }
29362 /* Parse an Objective-C protocol qualifier. */
29364 static tree
29366 {
29379 {
29384 }
29387 }
29389 /* Parse an Objective-C typename. */
29391 static tree
29393 {
29397 {
29403 /* An ObjC type name may consist of just protocol qualifiers, in which
29404 case the type shall default to 'id'. */
29406 {
29409 /* If the type could not be parsed, an error has already
29410 been produced. For error recovery, behave as if it had
29411 not been specified, which will use the default type
29412 'id'. */
29414 {
29416 /* We need to skip to the closing parenthesis as
29417 cp_parser_type_id() does not seem to do it for
29418 us. */
29423 }
29424 }
29428 }
29431 }
29433 /* Check to see if TYPE refers to an Objective-C selector name. */
29435 static bool
29437 {
29443 }
29445 /* Parse an Objective-C selector. */
29447 static tree
29449 {
29453 {
29456 }
29458 /* C++ operator names are allowed to appear in ObjC selectors. */
29460 {
29473 }
29474 }
29476 /* Parse an Objective-C params list. */
29478 static tree
29480 {
29486 {
29496 /* Detect if we have a unary selector. */
29499 {
29502 }
29506 {
29507 /* Something went quite wrong. There should be a colon
29508 here, but there is not. Stop parsing parameters. */
29510 }
29512 /* New ObjC allows attributes on parameters too. */
29517 params
29520 type_name,
29521 identifier,
29522 parm_attr));
29525 }
29528 {
29531 }
29533 /* We allow tail attributes for the method. */
29535 {
29543 }
29546 {
29549 }
29551 }
29553 /* Parse the non-keyword Objective-C params. */
29555 static tree
29558 {
29564 {
29566 tree parm;
29572 {
29577 }
29579 /* TODO: parse attributes for tail parameters. */
29588 }
29590 /* We allow tail attributes for the method. */
29592 {
29594 {
29599 }
29600 else
29601 /* We have an error, but parse the attributes, so that we can
29602 carry on. */
29608 }
29611 }
29613 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29615 static void
29617 {
29620 /* If the next token is `extern' and the following token is a string
29621 literal, then we have a linkage specification. */
29623 && cp_parser_is_pure_string_literal
29626 /* Handle #pragma, if any. */
29629 /* Allow stray semicolons. */
29632 /* Mark methods as optional or required, when building protocols. */
29634 {
29637 }
29639 {
29642 }
29645 /* Other stray characters must generate errors. */
29647 {
29651 }
29652 /* Finally, try to parse a block-declaration, or a function-definition. */
29653 else
29655 }
29657 /* Parse a method signature. */
29659 static tree
29661 {
29677 }
29679 static bool
29681 {
29682 tree tattr;
29687 /* If the attributes are followed by a method introducer, this is not allowed.
29688 Dump the attributes and flag the situation. */
29693 /* Otherwise, the attributes introduce some interstitial code, possibly so
29694 rewind to allow that check. */
29697 }
29699 /* Parse an Objective-C method prototype list. */
29701 static void
29703 {
29707 {
29709 {
29714 else
29718 {
29722 }
29725 }
29731 OPT_Wattributes,
29733 else
29734 /* Allow for interspersed non-ObjC++ code. */
29738 }
29742 else
29746 }
29748 /* Parse an Objective-C method definition list. */
29750 static void
29752 {
29756 {
29757 tree meth;
29760 {
29766 else
29771 {
29775 }
29777 NULL_TREE);
29779 /* For historical reasons, we accept an optional semicolon. */
29786 {
29793 }
29794 }
29795 /* The following case will be removed once @synthesize is
29796 completely implemented. */
29807 else
29808 /* Allow for interspersed non-ObjC++ code. */
29812 }
29816 else
29820 }
29822 /* Parse Objective-C ivars. */
29824 static void
29826 {
29837 {
29838 cp_decl_specifier_seq declspecs;
29840 tree prefix_attributes;
29848 CP_PARSER_FLAGS_OPTIONAL,
29852 /* auto, register, static, extern, mutable. */
29854 {
29857 }
29859 /* thread_local. */
29861 {
29864 }
29866 /* typedef. */
29868 {
29871 }
29876 /* Keep going until we hit the `;' at the end of the
29877 declaration. */
29879 {
29884 /* Check for a (possibly unnamed) bitfield declaration. */
29892 {
29893 /* Get the name of the bitfield. */
29896 sfk_none);
29898 eat_colon:
29900 /* Get the width of the bitfield. */
29901 width
29903 }
29904 else
29905 {
29906 /* Parse the declarator. */
29907 declarator
29913 }
29915 /* Look for attributes that apply to the ivar. */
29917 /* Remember which attributes are prefix attributes and
29918 which are not. */
29920 /* Combine the attributes. */
29924 /* Create the bitfield declaration. */
29926 width,
29927 attributes);
29928 else
29933 /* Add the instance variable. */
29937 /* Reset PREFIX_ATTRIBUTES. */
29946 {
29949 }
29951 }
29955 }
29960 /* Do not consume the RID_AT_END, so it will be read again as terminating
29961 the @interface of @implementation. */
29965 /* For historical reasons, we accept an optional semicolon. */
29968 }
29970 /* Parse an Objective-C protocol declaration. */
29972 static void
29974 {
29980 {
29985 }
29987 /* See if we have a forward declaration or a definition. */
29990 /* Try a forward declaration first. */
29992 {
29994 {
29995 tree id;
30005 else
30007 }
30009 }
30011 /* Ok, we got a full-fledged definition (or at least should). */
30012 else
30013 {
30018 }
30019 }
30021 /* Parse an Objective-C superclass or category. */
30023 static void
30028 {
30034 {
30037 }
30039 {
30042 /* If there is no category name, and this is an @interface, we
30043 have a class extension. */
30045 {
30048 }
30049 else
30053 }
30054 }
30056 /* Parse an Objective-C class interface. */
30058 static void
30060 {
30067 {
30068 /* It's hard to recover because even if valid @interface stuff
30069 is to follow, we can't compile it (or validate it) if we
30070 don't even know which class it refers to. Let's assume this
30071 was a stray '@interface' token in the stream and skip it.
30072 */
30074 }
30079 /* We have either a class or a category on our hands. */
30082 else
30083 {
30085 /* Handle instance variable declarations, if any. */
30088 }
30091 }
30093 /* Parse an Objective-C class implementation. */
30095 static void
30097 {
30104 {
30105 /* It's hard to recover because even if valid @implementation
30106 stuff is to follow, we can't compile it (or validate it) if
30107 we don't even know which class it refers to. Let's assume
30108 this was a stray '@implementation' token in the stream and
30109 skip it.
30110 */
30112 }
30116 /* We have either a class or a category on our hands. */
30119 else
30120 {
30122 /* Handle instance variable declarations, if any. */
30125 }
30128 }
30130 /* Consume the @end token and finish off the implementation. */
30132 static void
30134 {
30137 }
30139 /* Parse an Objective-C declaration. */
30141 static void
30143 {
30144 /* Try to figure out what kind of declaration is present. */
30149 {
30165 }
30168 {
30191 }
30192 }
30194 /* Parse an Objective-C try-catch-finally statement.
30196 objc-try-catch-finally-stmt:
30197 @try compound-statement objc-catch-clause-seq [opt]
30198 objc-finally-clause [opt]
30200 objc-catch-clause-seq:
30201 objc-catch-clause objc-catch-clause-seq [opt]
30203 objc-catch-clause:
30204 @catch ( objc-exception-declaration ) compound-statement
30206 objc-finally-clause:
30207 @finally compound-statement
30209 objc-exception-declaration:
30210 parameter-declaration
30211 '...'
30213 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30215 Returns NULL_TREE.
30217 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30218 for C. Keep them in sync. */
30220 static tree
30222 {
30223 location_t location;
30224 tree stmt;
30229 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30230 node, lest it get absorbed into the surrounding block. */
30236 {
30245 {
30246 /* We have "@catch (...)" (where the '...' are literally
30247 what is in the code). Skip the '...'.
30248 parameter_declaration is set to NULL_TREE, and
30249 objc_being_catch_clauses() knows that that means
30250 '...'. */
30253 }
30254 else
30255 {
30256 /* We have "@catch (NSException *exception)" or something
30257 like that. Parse the parameter declaration. */
30261 else
30266 }
30269 else
30270 {
30271 /* If there was no open parenthesis, we are recovering from
30272 an error, and we are trying to figure out what mistake
30273 the user has made. */
30275 /* If there is an immediate closing parenthesis, the user
30276 probably forgot the opening one (ie, they typed "@catch
30277 NSException *e)". Parse the closing parenthesis and keep
30278 going. */
30282 /* If these is no immediate closing parenthesis, the user
30283 probably doesn't know that parenthesis are required at
30284 all (ie, they typed "@catch NSException *e"). So, just
30285 forget about the closing parenthesis and keep going. */
30286 }
30290 }
30292 {
30295 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30296 node, lest it get absorbed into the surrounding block. */
30300 }
30303 }
30305 /* Parse an Objective-C synchronized statement.
30307 objc-synchronized-stmt:
30308 @synchronized ( expression ) compound-statement
30310 Returns NULL_TREE. */
30312 static tree
30314 {
30315 location_t location;
30326 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30327 node, lest it get absorbed into the surrounding block. */
30332 }
30334 /* Parse an Objective-C throw statement.
30336 objc-throw-stmt:
30337 @throw assignment-expression [opt] ;
30339 Returns a constructed '@throw' statement. */
30341 static tree
30343 {
30355 }
30357 /* Parse an Objective-C statement. */
30359 static tree
30361 {
30362 /* Try to figure out what kind of declaration is present. */
30366 {
30377 }
30380 }
30382 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30383 look ahead to see if an objc keyword follows the attributes. This
30384 is to detect the use of prefix attributes on ObjC @interface and
30385 @protocol. */
30387 static bool
30389 {
30394 {
30397 }
30400 }
30402 /* This routine is a minimal replacement for
30403 c_parser_struct_declaration () used when parsing the list of
30404 types/names or ObjC++ properties. For example, when parsing the
30405 code
30407 @property (readonly) int a, b, c;
30409 this function is responsible for parsing "int a, int b, int c" and
30410 returning the declarations as CHAIN of DECLs.
30412 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30413 similar parsing. */
30414 static tree
30416 {
30418 cp_decl_specifier_seq declspecs;
30420 tree prefix_attributes;
30423 CP_PARSER_FLAGS_NONE,
30430 /* auto, register, static, extern, mutable. */
30432 {
30435 }
30437 /* thread_local. */
30439 {
30442 }
30444 /* typedef. */
30446 {
30449 }
30454 /* Keep going until we hit the `;' at the end of the declaration. */
30456 {
30461 /* Parse the declarator. */
30465 /* Look for attributes that apply to the ivar. */
30467 /* Remember which attributes are prefix attributes and
30468 which are not. */
30470 /* Combine the attributes. */
30480 /* Reset PREFIX_ATTRIBUTES. */
30491 {
30494 }
30495 else
30497 }
30499 }
30501 /* Parse an Objective-C @property declaration. The syntax is:
30503 objc-property-declaration:
30504 '@property' objc-property-attributes[opt] struct-declaration ;
30506 objc-property-attributes:
30507 '(' objc-property-attribute-list ')'
30509 objc-property-attribute-list:
30510 objc-property-attribute
30511 objc-property-attribute-list, objc-property-attribute
30513 objc-property-attribute
30514 'getter' = identifier
30515 'setter' = identifier
30516 'readonly'
30517 'readwrite'
30518 'assign'
30519 'retain'
30520 'copy'
30521 'nonatomic'
30523 For example:
30524 @property NSString *name;
30525 @property (readonly) id object;
30526 @property (retain, nonatomic, getter=getTheName) id name;
30527 @property int a, b, c;
30529 PS: This function is identical to
30530 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30531 static void
30533 {
30534 /* The following variables hold the attributes of the properties as
30535 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30536 seen. When we see an attribute, we set them to 'true' (if they
30537 are boolean properties) or to the identifier (if they have an
30538 argument, ie, for getter and setter). Note that here we only
30539 parse the list of attributes, check the syntax and accumulate the
30540 attributes that we find. objc_add_property_declaration() will
30541 then process the information. */
30551 /* 'properties' is the list of properties that we read. Usually a
30552 single one, but maybe more (eg, in "@property int a, b, c;" there
30553 are three). */
30554 tree properties;
30555 location_t loc;
30561 /* Parse the optional attribute list... */
30563 {
30564 /* Eat the '('. */
30568 {
30574 {
30577 }
30581 {
30592 {
30596 else
30601 }
30604 {
30608 }
30610 {
30612 {
30615 }
30616 else
30620 else
30622 }
30623 else
30624 {
30626 {
30629 }
30630 else
30632 }
30638 }
30645 else
30647 }
30649 /* FIXME: "@property (setter, assign);" will generate a spurious
30650 "error: expected ‘)’ before ‘,’ token". This is because
30651 cp_parser_require, unlike the C counterpart, will produce an
30652 error even if we are in error recovery. */
30654 {
30659 }
30660 }
30662 /* ... and the property declaration(s). */
30666 {
30668 /* If the next token is now a `;', consume it. */
30672 }
30676 else
30677 {
30678 /* Comma-separated properties are chained together in
30679 reverse order; add them one by one. */
30688 }
30691 }
30693 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30695 objc-synthesize-declaration:
30696 @synthesize objc-synthesize-identifier-list ;
30698 objc-synthesize-identifier-list:
30699 objc-synthesize-identifier
30700 objc-synthesize-identifier-list, objc-synthesize-identifier
30702 objc-synthesize-identifier
30703 identifier
30704 identifier = identifier
30706 For example:
30707 @synthesize MyProperty;
30708 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30710 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30711 for C. Keep them in sync.
30712 */
30713 static void
30715 {
30717 location_t loc;
30722 {
30726 {
30729 }
30731 {
30735 {
30738 }
30739 }
30740 else
30745 else
30747 }
30750 }
30752 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30754 objc-dynamic-declaration:
30755 @dynamic identifier-list ;
30757 For example:
30758 @dynamic MyProperty;
30759 @dynamic MyProperty, AnotherProperty;
30761 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30762 for C. Keep them in sync.
30763 */
30764 static void
30766 {
30768 location_t loc;
30773 {
30774 tree property;
30777 {
30780 }
30784 else
30786 }
30789 }
30791 \f
30792 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30794 /* Returns name of the next clause.
30795 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30796 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30797 returned and the token is consumed. */
30799 static pragma_omp_clause
30801 {
30817 {
30822 {
31005 }
31006 }
31012 }
31014 /* Validate that a clause of the given type does not already exist. */
31016 static void
31019 {
31020 tree c;
31024 {
31027 }
31028 }
31030 /* OpenMP 2.5:
31031 variable-list:
31032 identifier
31033 variable-list , identifier
31035 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31036 colon). An opening parenthesis will have been consumed by the caller.
31038 If KIND is nonzero, create the appropriate node and install the decl
31039 in OMP_CLAUSE_DECL and add the node to the head of the list.
31041 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31042 return the list created.
31044 COLON can be NULL if only closing parenthesis should end the list,
31045 or pointer to bool which will receive false if the list is terminated
31046 by closing parenthesis or true if the list is terminated by colon. */
31048 static tree
31051 {
31055 {
31058 }
31060 {
31065 && current_class_ptr
31067 {
31073 }
31074 else
31075 {
31088 }
31090 ;
31092 {
31094 {
31096 /* The OpenACC cache directive explicitly only allows "array
31097 elements or subarrays". */
31099 {
31103 }
31104 /* FALLTHROUGH. */
31109 {
31110 location_t loc
31115 decl
31119 }
31120 /* FALLTHROUGH. */
31124 {
31132 parser->colon_corrects_to_scope_p
31136 else
31137 {
31138 /* Look for `:'. */
31142 CPP_CLOSE_SQUARE))
31144 }
31145 /* Look for the closing `]'. */
31147 RT_CLOSE_SQUARE))
31151 }
31155 }
31161 }
31162 else
31165 get_comma:
31169 }
31175 {
31179 }
31182 {
31185 /* Try to resync to an unnested comma. Copied from
31186 cp_parser_parenthesized_expression_list. */
31187 skip_comma:
31196 }
31199 }
31201 /* Similarly, but expect leading and trailing parenthesis. This is a very
31202 common case for omp clauses. */
31204 static tree
31206 {
31210 }
31212 /* OpenACC 2.0:
31213 copy ( variable-list )
31214 copyin ( variable-list )
31215 copyout ( variable-list )
31216 create ( variable-list )
31217 delete ( variable-list )
31218 present ( variable-list )
31219 present_or_copy ( variable-list )
31220 pcopy ( variable-list )
31221 present_or_copyin ( variable-list )
31222 pcopyin ( variable-list )
31223 present_or_copyout ( variable-list )
31224 pcopyout ( variable-list )
31225 present_or_create ( variable-list )
31226 pcreate ( variable-list ) */
31228 static tree
31230 tree list)
31231 {
31234 {
31280 }
31288 }
31290 /* OpenACC 2.0:
31291 deviceptr ( variable-list ) */
31293 static tree
31295 {
31299 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31300 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31301 variable-list must only allow for pointer variables. */
31304 {
31311 }
31314 }
31316 /* OpenACC 2.0:
31317 auto
31318 independent
31319 nohost
31320 seq */
31322 static tree
31326 {
31331 }
31333 /* OpenACC:
31334 num_gangs ( expression )
31335 num_workers ( expression )
31336 vector_length ( expression ) */
31338 static tree
31341 {
31351 {
31356 }
31364 }
31366 /* OpenACC:
31368 gang [( gang-arg-list )]
31369 worker [( [num:] int-expr )]
31370 vector [( [length:] int-expr )]
31372 where gang-arg is one of:
31374 [num:] int-expr
31375 static: size-expr
31377 and size-expr may be:
31379 *
31380 int-expr
31381 */
31383 static tree
31386 {
31396 {
31399 do
31400 {
31404 /* Gang static argument. */
31407 {
31415 {
31418 }
31420 /* Check for the '*' argument. */
31424 CPP_CLOSE_PAREN)))
31425 {
31430 {
31433 }
31435 }
31436 }
31437 /* Worker num: argument and vector length: arguments. */
31441 {
31444 }
31446 /* Now collect the actual argument. */
31448 {
31451 }
31463 {
31466 }
31468 }
31473 }
31487 cleanup_error:
31490 }
31492 /* OpenACC 2.0:
31493 tile ( size-expr-list ) */
31495 static tree
31497 {
31501 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31502 so, but the spec authors never considered such a case and have
31503 differing opinions on what it might mean, including 'not
31504 allowed'.) */
31507 clause_loc);
31512 do
31513 {
31520 {
31523 }
31524 else
31528 }
31531 /* Consume the trailing ')'. */
31539 }
31541 /* OpenACC 2.0
31542 Parse wait clause or directive parameters. */
31544 static tree
31546 {
31556 {
31561 }
31568 {
31572 {
31575 else
31576 {
31583 }
31584 }
31585 }
31588 }
31590 /* OpenACC:
31591 wait ( int-expr-list ) */
31593 static tree
31595 {
31604 }
31606 /* OpenMP 3.0:
31607 collapse ( constant-expression ) */
31609 static tree
31611 {
31613 location_t loc;
31614 HOST_WIDE_INT n;
31634 {
31637 }
31646 }
31648 /* OpenMP 2.5:
31649 default ( none | shared )
31651 OpenACC:
31652 default ( none | present ) */
31654 static tree
31657 {
31659 tree c;
31664 {
31669 {
31690 }
31693 }
31694 else
31695 {
31696 invalid_kind:
31699 else
31701 }
31718 }
31720 /* OpenMP 3.1:
31721 final ( expression ) */
31723 static tree
31725 {
31746 }
31748 /* OpenMP 2.5:
31749 if ( expression )
31751 OpenMP 4.5:
31752 if ( directive-name-modifier : expression )
31754 directive-name-modifier:
31755 parallel | task | taskloop | target data | target | target update
31756 | target enter data | target exit data */
31758 static tree
31761 {
31769 {
31781 {
31784 {
31797 else
31798 {
31799 location_t loc
31804 }
31807 {
31809 {
31814 }
31816 {
31817 location_t loc
31821 }
31822 }
31823 }
31824 }
31826 {
31828 {
31831 }
31832 else
31833 {
31835 {
31836 location_t loc
31839 }
31841 }
31842 }
31843 }
31855 {
31858 {
31861 {
31871 }
31873 p);
31875 }
31877 {
31880 else
31883 }
31886 {
31890 }
31891 }
31899 }
31901 /* OpenMP 3.1:
31902 mergeable */
31904 static tree
31907 {
31908 tree c;
31911 location);
31916 }
31918 /* OpenMP 2.5:
31919 nowait */
31921 static tree
31924 {
31925 tree c;
31932 }
31934 /* OpenMP 2.5:
31935 num_threads ( expression ) */
31937 static tree
31939 location_t location)
31940 {
31962 }
31964 /* OpenMP 4.5:
31965 num_tasks ( expression ) */
31967 static tree
31969 location_t location)
31970 {
31992 }
31994 /* OpenMP 4.5:
31995 grainsize ( expression ) */
31997 static tree
31999 location_t location)
32000 {
32022 }
32024 /* OpenMP 4.5:
32025 priority ( expression ) */
32027 static tree
32029 location_t location)
32030 {
32052 }
32054 /* OpenMP 4.5:
32055 hint ( expression ) */
32057 static tree
32059 location_t location)
32060 {
32081 }
32083 /* OpenMP 4.5:
32084 defaultmap ( tofrom : scalar ) */
32086 static tree
32088 location_t location)
32089 {
32097 {
32100 }
32104 {
32107 }
32113 {
32116 }
32120 {
32123 }
32129 location);
32135 out_err:
32140 }
32142 /* OpenMP 2.5:
32143 ordered
32145 OpenMP 4.5:
32146 ordered ( constant-expression ) */
32148 static tree
32151 {
32153 HOST_WIDE_INT n;
32159 {
32176 {
32178 "ordered argument needs positive constant integer "
32181 }
32182 }
32188 }
32190 /* OpenMP 2.5:
32191 reduction ( reduction-operator : variable-list )
32193 reduction-operator:
32194 One of: + * - & ^ | && ||
32196 OpenMP 3.1:
32198 reduction-operator:
32199 One of: + * - & ^ | && || min max
32201 OpenMP 4.0:
32203 reduction-operator:
32204 One of: + * - & ^ | && ||
32205 id-expression */
32207 static tree
32209 {
32217 {
32227 }
32231 else
32232 {
32243 {
32273 }
32274 else
32275 {
32277 resync_fail:
32282 }
32283 }
32289 NULL);
32291 {
32294 }
32297 }
32299 /* OpenMP 2.5:
32300 schedule ( schedule-kind )
32301 schedule ( schedule-kind , expression )
32303 schedule-kind:
32304 static | dynamic | guided | runtime | auto
32306 OpenMP 4.5:
32307 schedule ( schedule-modifier : schedule-kind )
32308 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32310 schedule-modifier:
32311 simd
32312 monotonic
32313 nonmonotonic */
32315 static tree
32317 {
32327 {
32336 else
32342 else
32343 {
32346 }
32347 }
32350 {
32355 {
32376 }
32377 }
32382 else
32388 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32390 {
32394 }
32397 {
32412 else
32417 }
32429 invalid_kind:
32431 resync_fail:
32436 }
32438 /* OpenMP 3.0:
32439 untied */
32441 static tree
32444 {
32445 tree c;
32452 }
32454 /* OpenMP 4.0:
32455 inbranch
32456 notinbranch */
32458 static tree
32461 {
32466 }
32468 /* OpenMP 4.0:
32469 parallel
32470 for
32471 sections
32472 taskgroup */
32474 static tree
32478 {
32482 }
32484 /* OpenMP 4.5:
32485 nogroup */
32487 static tree
32490 {
32495 }
32497 /* OpenMP 4.5:
32498 simd
32499 threads */
32501 static tree
32505 {
32510 }
32512 /* OpenMP 4.0:
32513 num_teams ( expression ) */
32515 static tree
32517 location_t location)
32518 {
32540 }
32542 /* OpenMP 4.0:
32543 thread_limit ( expression ) */
32545 static tree
32547 location_t location)
32548 {
32570 }
32572 /* OpenMP 4.0:
32573 aligned ( variable-list )
32574 aligned ( variable-list : constant-expression ) */
32576 static tree
32578 {
32589 {
32599 }
32605 }
32607 /* OpenMP 4.0:
32608 linear ( variable-list )
32609 linear ( variable-list : expression )
32611 OpenMP 4.5:
32612 linear ( modifier ( variable-list ) )
32613 linear ( modifier ( variable-list ) : expression ) */
32615 static tree
32618 {
32628 {
32640 else
32642 }
32647 else
32648 {
32657 }
32660 {
32665 {
32676 {
32679 }
32682 }
32687 {
32690 }
32698 }
32701 {
32704 }
32707 }
32709 /* OpenMP 4.0:
32710 safelen ( constant-expression ) */
32712 static tree
32714 location_t location)
32715 {
32736 }
32738 /* OpenMP 4.0:
32739 simdlen ( constant-expression ) */
32741 static tree
32743 location_t location)
32744 {
32765 }
32767 /* OpenMP 4.5:
32768 vec:
32769 identifier [+/- integer]
32770 vec , identifier [+/- integer]
32771 */
32773 static tree
32775 tree list)
32776 {
32780 {
32783 }
32786 {
32793 else
32794 {
32795 t = cp_parser_lookup_name_simple
32800 id_loc);
32801 }
32807 {
32810 }
32814 {
32817 }
32821 {
32824 }
32827 add_to_vector:
32829 {
32833 }
32839 }
32842 {
32848 }
32850 }
32852 /* OpenMP 4.0:
32853 depend ( depend-kind : variable-list )
32855 depend-kind:
32856 in | out | inout
32858 OpenMP 4.5:
32859 depend ( source )
32861 depend ( sink : vec ) */
32863 static tree
32865 {
32873 {
32887 else
32889 }
32890 else
32896 {
32906 }
32913 else
32914 {
32920 }
32923 invalid_kind:
32925 resync_fail:
32930 }
32932 /* OpenMP 4.0:
32933 map ( map-kind : variable-list )
32934 map ( variable-list )
32936 map-kind:
32937 alloc | to | from | tofrom
32939 OpenMP 4.5:
32940 map-kind:
32941 alloc | to | from | tofrom | release | delete
32943 map ( always [,] map-kind: variable-list ) */
32945 static tree
32947 {
32956 {
32961 {
32964 nth++;
32970 {
32975 }
32976 }
32977 }
32981 {
32995 else
32996 {
33002 }
33005 }
33008 {
33012 }
33015 NULL);
33021 }
33023 /* OpenMP 4.0:
33024 device ( expression ) */
33026 static tree
33028 location_t location)
33029 {
33051 }
33053 /* OpenMP 4.0:
33054 dist_schedule ( static )
33055 dist_schedule ( static , expression ) */
33057 static tree
33059 location_t location)
33060 {
33073 {
33084 }
33089 location);
33093 invalid_kind:
33095 resync_fail:
33100 }
33102 /* OpenMP 4.0:
33103 proc_bind ( proc-bind-kind )
33105 proc-bind-kind:
33106 master | close | spread */
33108 static tree
33110 location_t location)
33111 {
33112 tree c;
33119 {
33129 else
33131 }
33132 else
33141 location);
33146 invalid_kind:
33148 resync_fail:
33153 }
33155 /* OpenACC:
33156 async [( int-expr )] */
33158 static tree
33160 {
33167 {
33176 }
33186 }
33188 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33189 is a bitmask in MASK. Return the list of clauses found. */
33191 static tree
33195 {
33200 {
33201 location_t here;
33202 pragma_omp_clause c_kind;
33203 omp_clause_code code;
33214 {
33266 clauses);
33284 OMP_CLAUSE_INDEPENDENT,
33296 clauses);
33302 clauses);
33326 clauses);
33348 clauses);
33360 clauses);
33374 }
33379 {
33380 /* Remove the invalid clause(s) from the list to avoid
33381 confusing the rest of the compiler. */
33384 }
33385 }
33387 saw_error:
33394 }
33396 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33397 is a bitmask in MASK. Return the list of clauses found; the result
33398 of clause default goes in *pdefault. */
33400 static tree
33404 {
33410 {
33411 pragma_omp_clause c_kind;
33422 {
33434 clauses);
33448 clauses);
33468 clauses);
33473 clauses);
33483 clauses);
33517 clauses);
33531 clauses);
33548 OMP_CLAUSE_NOTINBRANCH,
33557 {
33558 clause_not_first:
33562 }
33592 clauses);
33593 else
33603 clauses);
33621 {
33629 }
33672 clauses
33678 clauses
33690 }
33695 {
33696 /* Remove the invalid clause(s) from the list to avoid
33697 confusing the rest of the compiler. */
33700 }
33701 }
33702 saw_error:
33703 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33704 no reason to skip to the end. */
33708 {
33711 else
33713 }
33715 }
33717 /* OpenMP 2.5:
33718 structured-block:
33719 statement
33721 In practice, we're also interested in adding the statement to an
33722 outer node. So it is convenient if we work around the fact that
33723 cp_parser_statement calls add_stmt. */
33725 static unsigned
33727 {
33730 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33731 This preserves the "not within loop or switch" style error messages
33732 for nonsense cases like
33733 void foo() {
33734 #pragma omp single
33735 break;
33736 }
33737 */
33742 }
33744 static void
33746 {
33748 }
33750 static tree
33752 {
33760 }
33762 /* OpenMP 2.5:
33763 # pragma omp atomic new-line
33764 expression-stmt
33766 expression-stmt:
33767 x binop= expr | x++ | ++x | x-- | --x
33768 binop:
33769 +, *, -, /, &, ^, |, <<, >>
33771 where x is an lvalue expression with scalar type.
33773 OpenMP 3.1:
33774 # pragma omp atomic new-line
33775 update-stmt
33777 # pragma omp atomic read new-line
33778 read-stmt
33780 # pragma omp atomic write new-line
33781 write-stmt
33783 # pragma omp atomic update new-line
33784 update-stmt
33786 # pragma omp atomic capture new-line
33787 capture-stmt
33789 # pragma omp atomic capture new-line
33790 capture-block
33792 read-stmt:
33793 v = x
33794 write-stmt:
33795 x = expr
33796 update-stmt:
33797 expression-stmt | x = x binop expr
33798 capture-stmt:
33799 v = expression-stmt
33800 capture-block:
33801 { v = x; update-stmt; } | { update-stmt; v = x; }
33803 OpenMP 4.0:
33804 update-stmt:
33805 expression-stmt | x = x binop expr | x = expr binop x
33806 capture-stmt:
33807 v = update-stmt
33808 capture-block:
33809 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33811 where x and v are lvalue expressions with scalar type. */
33813 static void
33815 {
33823 {
33828 {
33834 }
33835 }
33837 {
33849 else
33853 }
33855 {
33861 {
33866 {
33869 }
33870 }
33871 }
33875 {
33885 else
33890 {
33891 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33892 opcode. */
33897 }
33901 {
33904 }
33905 else
33906 {
33912 }
33915 }
33917 restart:
33921 {
33928 /* FALLTHROUGH */
33938 /* FALLTHROUGH */
33953 /* Undo effects of boolean_increment for post {in,de}crement. */
33955 /* FALLTHRU */
33959 {
33960 /* Undo effects of boolean_increment. */
33962 {
33963 /* This is pre or post increment. */
33968 && !structured_block
33972 }
33973 }
33974 /* FALLTHRU */
33977 {
34012 {
34016 }
34019 {
34025 {
34030 }
34032 {
34044 {
34046 {
34051 }
34052 else
34054 }
34058 }
34061 {
34068 }
34072 }
34076 {
34079 {
34087 }
34089 {
34094 }
34129 }
34140 /* FALLTHROUGH */
34145 }
34152 }
34153 stmt_done:
34155 {
34166 }
34168 {
34171 }
34172 done:
34178 saw_error:
34181 {
34185 {
34189 }
34190 }
34191 }
34194 /* OpenMP 2.5:
34195 # pragma omp barrier new-line */
34197 static void
34199 {
34202 }
34204 /* OpenMP 2.5:
34205 # pragma omp critical [(name)] new-line
34206 structured-block
34208 OpenMP 4.5:
34209 # pragma omp critical [(name) [hint(expression)]] new-line
34210 structured-block */
34212 #define OMP_CRITICAL_CLAUSE_MASK \
34213 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34215 static tree
34217 {
34221 {
34235 OMP_CRITICAL_CLAUSE_MASK,
34237 }
34238 else
34243 }
34245 /* OpenMP 2.5:
34246 # pragma omp flush flush-vars[opt] new-line
34248 flush-vars:
34249 ( variable-list ) */
34251 static void
34253 {
34259 }
34261 /* Helper function, to parse omp for increment expression. */
34263 static tree
34265 {
34270 {
34273 }
34276 {
34285 /* Fall through: OpenMP disallows NE_EXPR. */
34289 }
34291 /* If decl is an iterator, preserve LHS and RHS of the relational
34292 expr until finish_omp_for. */
34303 }
34305 /* Helper function, to parse omp for increment expression. */
34307 static tree
34309 {
34313 cp_id_kind idk;
34317 {
34326 }
34335 {
34340 }
34347 {
34351 }
34364 do
34365 {
34372 {
34374 {
34377 else
34379 tf_warning_or_error);
34380 }
34381 else
34384 }
34385 }
34389 {
34395 }
34396 else
34400 }
34402 /* Parse the initialization statement of either an OpenMP for loop or
34403 a Cilk Plus for loop.
34405 Return true if the resulting construct should have an
34406 OMP_CLAUSE_PRIVATE added to it. */
34408 static tree
34417 {
34423 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34425 init-expr:
34426 var = lb
34427 integer-type var = lb
34428 random-access-iterator-type var = lb
34429 pointer-type var = lb
34430 */
34431 cp_decl_specifier_seq type_specifiers;
34433 /* First, try to parse as an initialized declaration. See
34434 cp_parser_condition, from whence the bulk of this is copied. */
34441 {
34442 /* If parsing a type specifier seq succeeded, then this
34443 MUST be a initialized declaration. */
34448 CP_PARSER_DECLARATOR_NAMED,
34459 else
34460 {
34470 {
34472 CPP_OPEN_PAREN))
34473 {
34477 else
34480 }
34481 else
34482 /* Trigger an error. */
34487 }
34491 {
34499 {
34502 auto_node);
34507 }
34510 asm_specification,
34511 LOOKUP_ONLYCONVERTING);
34514 {
34517 }
34518 else
34519 {
34522 {
34524 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34526 {
34530 {
34534 }
34536 }
34538 {
34543 }
34544 }
34545 }
34547 }
34548 else
34549 {
34550 /* Consume '='. */
34554 non_class:
34557 else
34560 asm_specification,
34561 LOOKUP_ONLYCONVERTING);
34562 }
34566 }
34567 }
34568 else
34569 {
34570 cp_id_kind idk;
34571 /* If parsing a type specifier sequence failed, then
34572 this MUST be a simple expression. */
34581 && decl
34584 {
34595 {
34600 }
34605 }
34607 && decl
34610 {
34611 tree rhs;
34619 rhs,
34620 tf_warning_or_error));
34623 }
34624 else
34625 {
34630 {
34634 }
34635 }
34636 }
34638 }
34640 /* Parse the restricted form of the for statement allowed by OpenMP. */
34642 static tree
34645 {
34649 location_t loc_first;
34660 {
34663 }
34666 {
34669 }
34672 {
34678 }
34680 {
34683 {
34685 "%<linear%> clause may not be specified together "
34688 }
34689 else
34691 }
34704 {
34707 location_t loc;
34711 {
34715 }
34718 {
34722 }
34731 add_private_clause
34738 {
34741 {
34747 }
34748 else
34750 }
34757 {
34762 {
34766 }
34769 {
34770 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34774 {
34777 }
34778 else
34779 {
34782 }
34784 }
34785 else
34786 {
34791 }
34792 }
34795 {
34796 tree c;
34798 {
34807 decl);
34811 decl);
34812 }
34814 {
34819 else
34824 {
34827 /* For linear, signal that we need to fill up
34828 the so far unknown linear step. */
34831 }
34832 }
34833 }
34842 {
34843 /* If decl is an iterator, preserve the operator on decl
34844 until finish_omp_for. */
34846 && ((processing_template_decl
34851 else
34855 }
34867 {
34870 }
34875 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34876 in between the collapsed for loops to be still considered perfectly
34877 nested. Hopefully the final version clarifies this.
34878 For now handle (multiple) {'s and empty statements. */
34881 {
34885 {
34887 bracecount++;
34888 }
34892 else
34893 {
34900 }
34901 }
34904 {
34907 }
34908 }
34913 /* Note that we saved the original contents of this flag when we entered
34914 the structured block, and so we don't need to re-save it here. */
34917 else
34920 /* Note that the grammar doesn't call for a structured block here,
34921 though the loop as a whole is a structured block. */
34928 else
34933 {
34935 {
34937 nbraces--;
34938 }
34941 else
34942 {
34944 {
34947 }
34952 }
34953 }
34956 {
34960 else
34962 }
34966 }
34968 /* Helper function for OpenMP parsing, split clauses and call
34969 finish_omp_clauses on each of the set of clauses afterwards. */
34971 static void
34974 {
34980 }
34982 /* OpenMP 4.0:
34983 #pragma omp simd simd-clause[optseq] new-line
34984 for-loop */
34986 #define OMP_SIMD_CLAUSE_MASK \
34987 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34988 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34989 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34990 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34991 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34992 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34996 static tree
35000 {
35011 {
35015 OMP_CLAUSE_ORDERED);
35017 {
35019 "%<ordered%> clause with parameter may not be specified "
35022 }
35023 }
35034 }
35036 /* OpenMP 2.5:
35037 #pragma omp for for-clause[optseq] new-line
35038 for-loop
35040 OpenMP 4.0:
35041 #pragma omp for simd for-simd-clause[optseq] new-line
35042 for-loop */
35044 #define OMP_FOR_CLAUSE_MASK \
35045 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35055 static tree
35059 {
35066 /* parallel for{, simd} disallows nowait clause, but for
35067 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35070 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35075 {
35080 {
35104 }
35105 }
35107 {
35110 }
35112 /* Composite distribute parallel for disallows linear clause. */
35119 {
35122 }
35133 }
35135 /* OpenMP 2.5:
35136 # pragma omp master new-line
35137 structured-block */
35139 static tree
35141 {
35145 }
35147 /* OpenMP 2.5:
35148 # pragma omp ordered new-line
35149 structured-block
35151 OpenMP 4.5:
35152 # pragma omp ordered ordered-clauses new-line
35153 structured-block */
35155 #define OMP_ORDERED_CLAUSE_MASK \
35156 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35159 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35160 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35162 static bool
35165 {
35169 {
35174 {
35176 {
35178 "%<depend%> clause may only be used in compound "
35182 }
35183 tree clauses
35185 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35189 }
35190 }
35192 tree clauses
35198 }
35200 /* OpenMP 2.5:
35202 section-scope:
35203 { section-sequence }
35205 section-sequence:
35206 section-directive[opt] structured-block
35207 section-sequence section-directive structured-block */
35209 static tree
35211 {
35223 {
35227 }
35230 {
35238 {
35242 }
35244 {
35247 }
35252 }
35263 }
35265 /* OpenMP 2.5:
35266 # pragma omp sections sections-clause[optseq] newline
35267 sections-scope */
35269 #define OMP_SECTIONS_CLAUSE_MASK \
35270 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35276 static tree
35279 {
35291 {
35294 }
35301 }
35303 /* OpenMP 2.5:
35304 # pragma omp parallel parallel-clause[optseq] new-line
35305 structured-block
35306 # pragma omp parallel for parallel-for-clause[optseq] new-line
35307 structured-block
35308 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35309 structured-block
35311 OpenMP 4.0:
35312 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35313 structured-block */
35315 #define OMP_PARALLEL_CLAUSE_MASK \
35316 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35317 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35319 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35320 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35326 static tree
35330 {
35337 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35343 {
35351 if_p);
35355 if_p);
35358 block);
35363 }
35364 /* When combined with distribute, parallel has to be followed by for.
35365 #pragma omp target parallel is allowed though. */
35369 {
35373 }
35375 {
35378 }
35380 {
35384 {
35394 block);
35397 }
35398 }
35403 {
35406 }
35414 }
35416 /* OpenMP 2.5:
35417 # pragma omp single single-clause[optseq] new-line
35418 structured-block */
35420 #define OMP_SINGLE_CLAUSE_MASK \
35421 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35422 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35426 static tree
35428 {
35438 }
35440 /* OpenMP 3.0:
35441 # pragma omp task task-clause[optseq] new-line
35442 structured-block */
35444 #define OMP_TASK_CLAUSE_MASK \
35445 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35447 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35456 static tree
35458 {
35469 }
35471 /* OpenMP 3.0:
35472 # pragma omp taskwait new-line */
35474 static void
35476 {
35479 }
35481 /* OpenMP 3.1:
35482 # pragma omp taskyield new-line */
35484 static void
35486 {
35489 }
35491 /* OpenMP 4.0:
35492 # pragma omp taskgroup new-line
35493 structured-block */
35495 static tree
35497 {
35501 if_p));
35502 }
35505 /* OpenMP 2.5:
35506 # pragma omp threadprivate (variable-list) */
35508 static void
35510 {
35511 tree vars;
35517 }
35519 /* OpenMP 4.0:
35520 # pragma omp cancel cancel-clause[optseq] new-line */
35522 #define OMP_CANCEL_CLAUSE_MASK \
35523 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35529 static void
35531 {
35535 }
35537 /* OpenMP 4.0:
35538 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35540 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35541 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35546 static void
35549 {
35550 tree clauses;
35554 {
35559 {
35562 }
35563 }
35565 {
35569 }
35572 {
35577 else
35581 }
35584 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35586 pragma_tok);
35588 }
35590 /* OpenMP 4.0:
35591 #pragma omp distribute distribute-clause[optseq] new-line
35592 for-loop */
35594 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35595 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35599 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35601 static tree
35605 {
35614 {
35622 else
35625 {
35631 {
35635 else
35638 }
35644 else
35658 }
35659 }
35661 {
35664 }
35669 {
35672 }
35683 }
35685 /* OpenMP 4.0:
35686 # pragma omp teams teams-clause[optseq] new-line
35687 structured-block */
35689 #define OMP_TEAMS_CLAUSE_MASK \
35690 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35698 static tree
35702 {
35711 {
35715 {
35740 }
35741 }
35743 {
35746 }
35751 {
35754 }
35763 }
35765 /* OpenMP 4.0:
35766 # pragma omp target data target-data-clause[optseq] new-line
35767 structured-block */
35769 #define OMP_TARGET_DATA_CLAUSE_MASK \
35770 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35775 static tree
35777 {
35778 tree clauses
35783 {
35786 {
35803 "%<#pragma omp target data%> with map-type other "
35804 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35808 }
35810 }
35813 {
35816 "%<#pragma omp target data%> must contain at least "
35819 }
35830 }
35832 /* OpenMP 4.5:
35833 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35834 structured-block */
35836 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35837 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35843 static tree
35846 {
35849 {
35854 {
35857 }
35858 }
35860 {
35864 }
35867 {
35873 }
35875 tree clauses
35880 {
35883 {
35896 "%<#pragma omp target enter data%> with map-type other "
35900 }
35902 }
35905 {
35908 "%<#pragma omp target enter data%> must contain at least "
35911 }
35918 }
35920 /* OpenMP 4.5:
35921 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35922 structured-block */
35924 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35925 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35928 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35929 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35931 static tree
35934 {
35937 {
35942 {
35945 }
35946 }
35948 {
35952 }
35955 {
35961 }
35963 tree clauses
35968 {
35971 {
35985 "%<#pragma omp target exit data%> with map-type other "
35986 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35990 }
35992 }
35995 {
35998 "%<#pragma omp target exit data%> must contain at least "
36001 }
36008 }
36010 /* OpenMP 4.0:
36011 # pragma omp target update target-update-clause[optseq] new-line */
36013 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36014 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36021 static bool
36024 {
36026 {
36032 }
36034 tree clauses
36039 {
36041 "%<#pragma omp target update%> must contain at least one "
36044 }
36052 }
36054 /* OpenMP 4.0:
36055 # pragma omp target target-clause[optseq] new-line
36056 structured-block */
36058 #define OMP_TARGET_CLAUSE_MASK \
36059 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36069 static bool
36072 {
36076 {
36088 {
36096 {
36097 tree stmt;
36099 {
36102 OMP_TARGET_CLAUSE_MASK,
36107 OMP_TARGET_CLAUSE_MASK,
36112 OMP_TARGET_CLAUSE_MASK,
36117 }
36119 }
36124 {
36128 if_p);
36133 if_p);
36138 if_p);
36142 }
36148 {
36149 /* For combined target teams, ensure the num_teams and
36150 thread_limit clause expressions are evaluated on the host,
36151 before entering the target construct. */
36152 tree c;
36158 {
36167 OMP_CLAUSE_FIRSTPRIVATE);
36172 }
36173 }
36183 }
36185 {
36188 }
36190 {
36194 }
36196 {
36200 }
36202 {
36206 }
36208 {
36211 }
36212 }
36214 {
36217 }
36232 check_clauses:
36234 {
36237 {
36251 "%<#pragma omp target%> with map-type other "
36252 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36256 }
36258 }
36260 }
36262 /* OpenACC 2.0:
36263 # pragma acc cache (variable-list) new-line
36264 */
36266 static tree
36268 {
36283 }
36285 /* OpenACC 2.0:
36286 # pragma acc data oacc-data-clause[optseq] new-line
36287 structured-block */
36289 #define OACC_DATA_CLAUSE_MASK \
36290 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36302 static tree
36304 {
36317 }
36319 /* OpenACC 2.0:
36320 # pragma acc host_data <clauses> new-line
36321 structured-block */
36323 #define OACC_HOST_DATA_CLAUSE_MASK \
36324 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36326 static tree
36328 {
36341 }
36343 /* OpenACC 2.0:
36344 # pragma acc declare oacc-data-clause[optseq] new-line
36345 */
36347 #define OACC_DECLARE_CLAUSE_MASK \
36348 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36350 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36361 static tree
36363 {
36372 {
36376 }
36379 {
36383 {
36387 }
36390 {
36402 {
36404 "%qD must be a global variable in "
36406 decl);
36409 }
36414 {
36418 }
36420 {
36422 "invalid use of %<extern%> variable %qD "
36426 }
36428 {
36430 "invalid use of %<global%> variable %qD "
36434 }
36436 }
36441 {
36446 }
36449 {
36450 tree id;
36454 else
36460 {
36463 {
36466 {
36470 }
36471 }
36472 }
36473 }
36474 }
36487 }
36489 /* OpenACC 2.0:
36490 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36492 or
36494 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36496 LOC is the location of the #pragma token.
36497 */
36499 #define OACC_ENTER_DATA_CLAUSE_MASK \
36500 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36508 #define OACC_EXIT_DATA_CLAUSE_MASK \
36509 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36512 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36513 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36515 static tree
36518 {
36527 {
36532 }
36539 else
36544 {
36548 }
36556 }
36558 /* OpenACC 2.0:
36559 # pragma acc loop oacc-loop-clause[optseq] new-line
36560 structured-block */
36562 #define OACC_LOOP_CLAUSE_MASK \
36563 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36567 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36568 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36569 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36570 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36574 static tree
36577 {
36586 {
36592 }
36601 }
36603 /* OpenACC 2.0:
36604 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36605 structured-block
36607 or
36609 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36610 structured-block
36611 */
36613 #define OACC_KERNELS_CLAUSE_MASK \
36614 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36615 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36616 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36617 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36618 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36619 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36620 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36621 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36622 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36632 #define OACC_PARALLEL_CLAUSE_MASK \
36633 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36647 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36654 static tree
36657 {
36658 omp_clause_mask mask;
36661 {
36674 }
36677 {
36681 {
36684 tree clauses;
36686 if_p);
36688 }
36689 }
36698 }
36700 /* OpenACC 2.0:
36701 # pragma acc update oacc-update-clause[optseq] new-line
36702 */
36704 #define OACC_UPDATE_CLAUSE_MASK \
36705 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36712 static tree
36714 {
36721 {
36723 "%<#pragma acc update%> must contain at least one "
36726 }
36734 }
36736 /* OpenACC 2.0:
36737 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36739 LOC is the location of the #pragma token.
36740 */
36742 #define OACC_WAIT_CLAUSE_MASK \
36743 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36745 static tree
36747 {
36761 }
36763 /* OpenMP 4.0:
36764 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36766 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36767 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36768 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36774 static void
36777 {
36779 cp_omp_declare_simd_data data;
36781 {
36786 /* It is safe to take the address of a local variable; it will only be
36787 used while this scope is live. */
36789 }
36791 /* Store away all pragma tokens. */
36803 {
36807 {
36820 }
36825 "%<#pragma omp declare simd%> not immediately followed by "
36829 }
36830 }
36832 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36833 This function is modelled similar to the late parsing of omp declare
36834 simd. */
36836 static tree
36838 {
36845 {
36847 "used in the same function marked as a Cilk Plus SIMD-enabled "
36853 }
36855 {
36859 }
36864 {
36871 NULL);
36885 }
36891 }
36893 /* Finalize #pragma omp declare simd clauses after direct declarator has
36894 been parsed, and put that into "omp declare simd" attribute. */
36896 static tree
36898 {
36904 {
36908 }
36913 {
36931 }
36935 }
36938 /* OpenMP 4.0:
36939 # pragma omp declare target new-line
36940 declarations and definitions
36941 # pragma omp end declare target new-line
36943 OpenMP 4.5:
36944 # pragma omp declare target ( extended-list ) new-line
36946 # pragma omp declare target declare-target-clauses[seq] new-line */
36948 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36949 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36950 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36952 static void
36954 {
36957 clauses
36961 {
36963 clauses);
36966 }
36967 else
36968 {
36972 }
36975 "%<#pragma omp declare target%> with clauses in between "
36976 "%<#pragma omp declare target%> without clauses and "
36979 {
36985 {
36988 }
36989 else
36992 {
36994 "%qD specified both in declare target %<link%> and %<to%>"
36997 }
36999 {
37006 {
37009 {
37013 }
37014 }
37015 }
37016 }
37017 }
37019 static void
37021 {
37024 {
37027 }
37029 {
37033 {
37036 }
37039 else
37040 {
37044 }
37045 }
37046 else
37047 {
37051 }
37055 "%<#pragma omp end declare target%> without corresponding "
37057 else
37059 }
37061 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37062 expression and optional initializer clause of
37063 #pragma omp declare reduction. We store the expression(s) as
37064 either 3, 6 or 7 special statements inside of the artificial function's
37065 body. The first two statements are DECL_EXPRs for the artificial
37066 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37067 expression that uses those variables.
37068 If there was any INITIALIZER clause, this is followed by further statements,
37069 the fourth and fifth statements are DECL_EXPRs for the artificial
37070 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37071 constructor variant (first token after open paren is not omp_priv),
37072 then the sixth statement is a statement with the function call expression
37073 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37074 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37075 to initialize the OMP_PRIV artificial variable and there is seventh
37076 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37078 static bool
37080 {
37092 tree combiner;
37107 {
37110 }
37113 {
37120 {
37123 }
37139 {
37143 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37147 == CPP_CLOSE_PAREN
37150 {
37154 }
37159 }
37160 else
37161 {
37177 {
37182 }
37184 tree arg;
37197 }
37208 }
37214 }
37216 /* OpenMP 4.0
37217 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37218 initializer-clause[opt] new-line
37220 initializer-clause:
37221 initializer (omp_priv initializer)
37222 initializer (function-name (argument-list)) */
37224 static void
37227 {
37237 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37244 {
37276 }
37288 /* Types may not be defined in declare reduction type list. */
37291 parser->type_definition_forbidden_message
37297 saved_colon_doesnt_start_class_def_p
37302 {
37306 ;
37325 else
37330 else
37332 }
37334 /* Restore the saved message. */
37337 parser->colon_doesnt_start_class_def_p
37342 {
37343 fail:
37346 }
37352 {
37353 tree fntype
37356 NULL_TREE);
37376 {
37381 }
37383 {
37385 {
37394 }
37401 }
37402 else
37403 {
37406 }
37409 else
37412 {
37415 }
37417 {
37420 else
37425 }
37430 else
37431 {
37440 }
37447 }
37451 done:
37452 /* Free any declarators allocated. */
37454 }
37456 /* OpenMP 4.0
37457 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37458 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37459 initializer-clause[opt] new-line
37460 #pragma omp declare target new-line */
37462 static void
37465 {
37467 {
37472 {
37475 context);
37477 }
37480 {
37483 context);
37485 }
37487 {
37490 }
37492 {
37496 }
37497 }
37501 }
37503 /* OpenMP 4.5:
37504 #pragma omp taskloop taskloop-clause[optseq] new-line
37505 for-loop
37507 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37508 for-loop */
37510 #define OMP_TASKLOOP_CLAUSE_MASK \
37511 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37512 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37513 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37526 static tree
37530 {
37539 {
37544 {
37568 }
37569 }
37571 {
37574 }
37579 {
37582 }
37588 if_p);
37594 }
37597 /* OpenACC 2.0:
37598 # pragma acc routine oacc-routine-clause[optseq] new-line
37599 function-definition
37601 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37602 */
37604 #define OACC_ROUTINE_CLAUSE_MASK \
37605 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37606 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37611 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37612 component, which must resolve to a declared namespace-scope
37613 function. The clauses are either processed directly (for a named
37614 function), or defered until the immediatley following declaration
37615 is parsed. */
37617 static void
37620 {
37622 /* The checking for "another pragma following this one" in the "no optional
37623 '( name )'" case makes sure that we dont re-enter. */
37626 cp_oacc_routine_data data;
37632 /* It is safe to take the address of a local variable; it will only be
37633 used while this scope is live. */
37636 /* Look for optional '( name )'. */
37638 {
37641 /* We parse the name as an id-expression. If it resolves to
37642 anything other than a non-overloaded function at namespace
37643 scope, it's an error. */
37657 {
37661 }
37663 data.clauses
37671 {
37676 }
37678 /* Perhaps we should use the same rule as declarations in different
37679 namespaces? */
37681 {
37686 }
37689 {
37693 }
37697 }
37699 {
37700 /* Store away all pragma tokens. */
37711 /* Emit a helpful diagnostic if there's another pragma following this
37712 one. */
37714 {
37717 /* ..., and then just keep going. */
37719 }
37721 /* We only have to consider the pragma_external case here. */
37726 else
37729 }
37730 }
37732 /* Finalize #pragma acc routine clauses after direct declarator has
37733 been parsed. */
37735 static tree
37737 {
37742 {
37744 "%<#pragma acc routine%> not immediately followed by "
37747 }
37764 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37765 fndecl_seen. */
37768 }
37770 /* Apply any saved OpenACC routine clauses to a just-parsed
37771 declaration. */
37773 static void
37775 {
37777 {
37778 /* Keep going if we're in error reporting mode. */
37784 {
37786 "%<#pragma acc routine%> not immediately followed by"
37790 }
37792 {
37795 }
37798 {
37803 }
37806 {
37814 }
37816 /* Process the routine's dimension clauses. */
37820 /* Add an "omp declare target" attribute. */
37825 /* Don't unset parser->oacc_routine here: we may still need it to
37826 diagnose wrong usage. But, remember that we've used this "#pragma acc
37827 routine". */
37829 }
37830 }
37832 /* Main entry point to OpenMP statement pragmas. */
37834 static void
37836 {
37837 tree stmt;
37842 {
37865 if_p);
37870 if_p);
37887 if_p);
37892 if_p);
37900 if_p);
37909 if_p);
37923 if_p);
37928 if_p);
37932 }
37935 }
37936 \f
37937 /* Transactional Memory parsing routines. */
37939 /* Parse a transaction attribute.
37941 txn-attribute:
37942 attribute
37943 [ [ identifier ] ]
37945 We use this instead of cp_parser_attributes_opt for transactions to avoid
37946 the pedwarn in C++98 mode. */
37948 static tree
37950 {
37965 {
37969 /* For keywords, use the canonical spelling,
37970 not the parsed identifier. */
37974 }
37975 else
37979 error1:
37982 }
37984 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37986 transaction-statement:
37987 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37988 compound-statement
37989 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37990 */
37992 static tree
37994 {
38005 else
38006 {
38010 }
38012 /* Parse a noexcept specification. */
38016 {
38017 /* cancel-and-throw is unimplemented. */
38020 }
38021 else
38024 /* Keep track if we're in the lexical scope of an outer transaction. */
38036 }
38038 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38040 transaction-expression:
38041 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38042 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38043 */
38045 static tree
38047 {
38060 keyword == RID_TRANSACTION_RELAXED
38074 /* Set this early. This might mean that we allow transaction_cancel in
38075 an expression that we find out later actually has to be a constexpr.
38076 However, we expect that cxx_constant_value will be able to deal with
38077 this; also, if the noexcept has no constexpr, then what we parse next
38078 really is a transaction's body. */
38081 /* Parse a noexcept specification. */
38087 {
38094 }
38095 else
38096 {
38097 /* The only expression that is available got parsed for the noexcept
38098 already. noexcept is true then. */
38101 }
38110 }
38112 /* Parse a function-transaction-block.
38114 function-transaction-block:
38115 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38116 function-body
38117 __transaction_atomic txn-attribute[opt] function-try-block
38118 __transaction_relaxed ctor-initializer[opt] function-body
38119 __transaction_relaxed function-try-block
38120 */
38122 static bool
38124 {
38140 else
38141 {
38145 }
38153 else
38154 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
38162 }
38164 /* Parse a __transaction_cancel statement.
38166 cancel-statement:
38167 __transaction_cancel txn-attribute[opt] ;
38168 __transaction_cancel txn-attribute[opt] throw-expression ;
38170 ??? Cancel and throw is not yet implemented. */
38172 static tree
38174 {
38180 RT_TRANSACTION_CANCEL);
38187 /* ??? Parse cancel-and-throw here. */
38192 {
38196 }
38198 {
38202 }
38204 {
38207 {
38213 }
38214 }
38216 {
38220 }
38226 }
38227 \f
38228 /* The parser. */
38232 \f
38233 /* Special handling for the first token or line in the file. The first
38234 thing in the file might be #pragma GCC pch_preprocess, which loads a
38235 PCH file, which is a GC collection point. So we need to handle this
38236 first pragma without benefit of an existing lexer structure.
38238 Always returns one token to the caller in *FIRST_TOKEN. This is
38239 either the true first token of the file, or the first token after
38240 the initial pragma. */
38242 static void
38244 {
38253 {
38260 }
38261 else
38264 /* Skip to the end of the pragma. */
38268 /* Now actually load the PCH file. */
38272 /* Read one more token to return to our caller. We have to do this
38273 after reading the PCH file in, since its pointers have to be
38274 live. */
38276 }
38278 /* Parses the grainsize pragma for the _Cilk_for statement.
38279 Syntax:
38280 #pragma cilk grainsize = <VALUE>. */
38282 static void
38284 {
38286 {
38291 {
38294 }
38296 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38299 else
38301 "%<#pragma cilk grainsize%> is not followed by "
38304 }
38306 }
38308 /* Normal parsing of a pragma token. Here we can (and must) use the
38309 regular lexer. */
38311 static bool
38313 {
38316 tree stmt;
38327 {
38335 {
38345 }
38350 {
38360 }
38365 {
38376 }
38381 {
38392 }
38397 {
38408 }
38429 {
38434 }
38442 {
38447 }
38455 {
38459 }
38465 {
38470 }
38478 {
38483 }
38538 "%<#pragma omp section%> may only be used in "
38543 {
38545 {
38549 }
38556 {
38559 }
38562 }
38566 {
38570 }
38578 {
38582 }
38584 /* Ignore the pragma if Cilk Plus is not enabled. */
38586 {
38589 }
38590 else
38591 {
38595 }
38602 bad_stmt:
38605 }
38609 }
38611 /* The interface the pragma parsers have to the lexer. */
38613 enum cpp_ttype
38615 {
38627 else
38628 {
38632 }
38635 }
38637 \f
38638 /* External interface. */
38640 /* Parse one entire translation unit. */
38642 void
38644 {
38657 }
38659 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38660 vectorlength clause:
38661 Syntax:
38662 vectorlength ( constant-expression ) */
38664 static tree
38667 {
38669 tree expr;
38670 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38671 safelen clause. Thus, vectorlength is represented as OMP 4.0
38672 safelen. For SIMD-enabled function it is represented by OMP 4.0
38673 simdlen. */
38676 loc);
38677 else
38679 loc);
38687 /* If expr == error_mark_node, then don't emit any errors nor
38688 create a clause. if any of the above functions returns
38689 error mark node then they would have emitted an error message. */
38691 ;
38699 else
38700 {
38701 tree c;
38703 {
38708 }
38709 else
38710 {
38715 }
38716 }
38721 }
38723 /* Handles the Cilk Plus #pragma simd linear clause.
38724 Syntax:
38725 linear ( simd-linear-variable-list )
38727 simd-linear-variable-list:
38728 simd-linear-variable
38729 simd-linear-variable-list , simd-linear-variable
38731 simd-linear-variable:
38732 id-expression
38733 id-expression : simd-linear-step
38735 simd-linear-step:
38736 conditional-expression */
38738 static tree
38740 {
38746 {
38750 }
38755 {
38758 {
38762 }
38769 {
38773 }
38774 else
38775 {
38779 /* If present, parse the linear step. Otherwise, assume the default
38780 value of 1. */
38782 {
38789 {
38790 /* If an error has occurred, then the whole pragma is
38791 considered ill-formed. Thus, no reason to keep
38792 parsing. */
38795 }
38803 else
38805 "step size must be an integer constant "
38807 }
38809 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38815 }
38820 else
38821 {
38826 }
38827 }
38831 }
38833 /* Returns the name of the next clause. If the clause is not
38834 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38835 token is not consumed. Otherwise, the appropriate enum from the
38836 pragma_simd_clause is returned and the token is consumed. */
38838 static pragma_omp_clause
38840 {
38841 pragma_omp_clause clause_type;
38858 else
38863 }
38865 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38867 static tree
38869 {
38874 {
38875 pragma_omp_clause c_kind;
38882 /* Use the OpenMP 4.0 equivalent function. */
38885 /* Use the OpenMP 4.0 equivalent function. */
38887 clauses);
38889 /* Use the OMP 4.0 equivalent function. */
38891 clauses);
38893 /* Use the OMP 4.0 equivalent function. */
38895 else
38896 {
38900 }
38901 }
38907 else
38909 }
38911 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38913 static void
38915 {
38922 {
38926 }
38935 }
38937 /* Main entry-point for parsing Cilk Plus _Cilk_for
38938 loops. The return value is error_mark_node
38939 when errors happen and CILK_FOR tree on success. */
38941 static tree
38943 {
38958 else
38964 }
38966 /* Create an identifier for a generic parameter type (a synthesized
38967 template parameter implied by `auto' or a concept identifier). */
38970 static tree
38972 {
38976 }
38978 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38979 (creating a new template parameter list if necessary). Returns the newly
38980 created template type parm. */
38982 static tree
38984 {
38987 /* Before committing to modifying any scope, if we're in an
38988 implicit template scope, and we're trying to synthesize a
38989 constrained parameter, try to find a previous parameter with
38990 the same name. This is the same-type rule for abbreviated
38991 function templates.
38993 NOTE: We can generate implicit parameters when tentatively
38994 parsing a nested name specifier, only to reject that parse
38995 later. However, matching the same template-id as part of a
38996 direct-declarator should generate an identical template
38997 parameter, so this rule will merge them. */
38999 {
39002 {
39004 {
39007 /* Return the TEMPLATE_PARM_INDEX. */
39010 }
39012 }
39013 }
39015 /* We are either continuing a function template that already contains implicit
39016 template parameters, creating a new fully-implicit function template, or
39017 extending an existing explicit function template with implicit template
39018 parameters. */
39026 {
39030 }
39031 else
39032 {
39033 /* Roll back to the existing template parameter scope (in the case of
39034 extending an explicit function template) or introduce a new template
39035 parameter scope ahead of the function parameter scope (or class scope
39036 in the case of out-of-line member definitions). The function scope is
39037 added back after template parameter synthesis below. */
39042 {
39045 }
39047 {
39048 /* If not defining a class, then any class scope is a scope level in
39049 an out-of-line member definition. In this case simply wind back
39050 beyond the first such scope to inject the template parameter list.
39051 Otherwise wind back to the class being defined. The latter can
39052 occur in class member friend declarations such as:
39054 class A {
39055 void foo (auto);
39056 };
39057 class B {
39058 friend void A::foo (auto);
39059 };
39061 The template parameter list synthesized for the friend declaration
39062 must be injected in the scope of 'B'. This can also occur in
39063 erroneous cases such as:
39065 struct A {
39066 struct B {
39067 void foo (auto);
39068 };
39069 void B::foo (auto) {}
39070 };
39072 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39073 but, nevertheless, the template parameter list synthesized for the
39074 declarator should be injected into the scope of 'A' as if the
39075 ill-formed template was specified explicitly. */
39078 {
39081 }
39082 }
39088 {
39089 /* Introduce a new template parameter list for implicit template
39090 parameters. */
39094 parser->implicit_template_scope
39101 }
39102 else
39103 {
39104 /* Synthesize implicit template parameters at the end of the explicit
39105 template parameter list. */
39112 parser->implicit_template_parms
39114 }
39115 }
39117 /* Synthesize a new template parameter and track the current template
39118 parameter chain with implicit_template_parms. */
39122 tree synth_tmpl_parm;
39126 synth_tmpl_parm
39129 synth_tmpl_parm
39131 else
39132 {
39136 }
39138 // Attach the constraint to the parm before processing.
39141 tree new_parm
39143 input_location,
39144 node,
39148 // Chain the new parameter to the list of implicit parameters.
39150 parser->implicit_template_parms
39152 else
39157 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39160 /* If creating a fully implicit function template, start the new implicit
39161 template parameter list with this synthesized type, otherwise grow the
39162 current template parameter list. */
39165 {
39172 }
39173 else
39174 {
39179 }
39181 // If the new parameter was constrained, we need to add that to the
39182 // constraints in the template parameter list.
39184 {
39188 }
39193 }
39195 /* Finish the declaration of a fully implicit function template. Such a
39196 template has no explicit template parameter list so has not been through the
39197 normal template head and tail processing. synthesize_implicit_template_parm
39198 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39199 provided if the declaration is a class member such that its template
39200 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39201 form is returned. Otherwise NULL_TREE is returned. */
39203 static tree
39205 {
39210 {
39214 }
39224 }