| blob | 3a0e0cb050fcf37b1760f8f2c61e7df8aac7cac1 |
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 {
2989 {
2992 else
2994 }
2995 else
2997 /* Remember the location of the invalid "<". */
3000 /* Consume the "<". */
3002 /* Parse the template arguments. */
3004 /* Permanently remove the invalid template arguments so that
3005 this error message is not issued again. */
3008 }
3009 }
3011 /* If parsing an integral constant-expression, issue an error message
3012 about the fact that THING appeared and return true. Otherwise,
3013 return false. In either case, set
3014 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3016 static bool
3018 non_integral_constant thing)
3019 {
3022 {
3024 {
3027 {
3030 "ISO C++ forbids using a floating-point literal "
3035 "enumeration type cannot appear in a "
3126 }
3130 }
3131 }
3133 }
3135 /* Emit a diagnostic for an invalid type name. This function commits
3136 to the current active tentative parse, if any. (Otherwise, the
3137 problematic construct might be encountered again later, resulting
3138 in duplicate error messages.) LOCATION is the location of ID. */
3140 static void
3142 location_t location)
3143 {
3146 /* Try to lookup the identifier. */
3153 /* If the lookup was ambiguous, an error will already have
3154 been issued. */
3156 /* If the lookup found a template-name, it means that the user forgot
3157 to specify an argument list. Emit a useful error message. */
3159 {
3162 decl);
3167 }
3171 /* Something like 'unsigned A a;' */
3174 {
3175 /* Issue an error message. */
3180 {
3186 }
3187 else
3189 /* If we're in a template class, it's possible that the user was
3190 referring to a type from a base class. For example:
3192 template <typename T> struct A { typedef T X; };
3193 template <typename T> struct B : public A<T> { X x; };
3195 The user should have said "typename A<T>::X". */
3211 {
3212 tree b;
3215 b;
3217 {
3221 {
3222 tree field;
3223 /* Go from a particular instantiation of the
3224 template (which will have an empty TYPE_FIELDs),
3225 to the main version. */
3228 field;
3232 {
3237 }
3240 }
3241 }
3242 }
3243 }
3244 /* Here we diagnose qualified-ids where the scope is actually correct,
3245 but the identifier does not resolve to a valid type name. */
3247 {
3249 {
3254 else
3260 }
3263 {
3264 /* A<T>::A<T>() */
3270 }
3277 {
3285 else
3291 }
3292 else
3294 }
3295 }
3297 /* Check for a common situation where a type-name should be present,
3298 but is not, and issue a sensible error message. Returns true if an
3299 invalid type-name was detected.
3301 The situation handled by this function are variable declarations of the
3302 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3303 Usually, `ID' should name a type, but if we got here it means that it
3304 does not. We try to emit the best possible error message depending on
3305 how exactly the id-expression looks like. */
3307 static bool
3309 {
3310 tree id;
3313 /* Avoid duplicate error about ambiguous lookup. */
3315 {
3319 }
3328 /* If the next token is a (, this is a function with no explicit return
3329 type, i.e. constructor, destructor or conversion op. */
3332 {
3335 }
3339 /* Emit a diagnostic for the invalid type. */
3341 out:
3342 /* If we aren't in the middle of a declarator (i.e. in a
3343 parameter-declaration-clause), skip to the end of the declaration;
3344 there's no point in trying to process it. */
3348 }
3350 /* Consume tokens up to, and including, the next non-nested closing `)'.
3351 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3352 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3353 found an unnested token of that type. */
3355 static int
3358 cpp_ttype or_ttype,
3360 {
3370 {
3373 /* Have we found what we're looking for before the closing paren? */
3379 {
3382 /* If we've run out of tokens, then there is no closing `)'. */
3385 /* This is good for lambda expression capture-lists. */
3395 /* This matches the processing in skip_to_end_of_statement. */
3415 {
3419 }
3424 }
3426 /* Consume the token. */
3428 }
3429 }
3431 /* Consume tokens up to, and including, the next non-nested closing `)'.
3432 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3433 are doing error recovery. Returns -1 if OR_COMMA is true and we
3434 found an unnested token of that type. */
3436 static int
3441 {
3445 }
3447 /* Consume tokens until we reach the end of the current statement.
3448 Normally, that will be just before consuming a `;'. However, if a
3449 non-nested `}' comes first, then we stop before consuming that. */
3451 static void
3453 {
3456 /* Unwind generic function template scope if necessary. */
3461 {
3465 {
3468 /* If we've run out of tokens, stop. */
3472 /* If the next token is a `;', we have reached the end of the
3473 statement. */
3479 /* If this is a non-nested '}', stop before consuming it.
3480 That way, when confronted with something like:
3482 { 3 + }
3484 we stop before consuming the closing '}', even though we
3485 have not yet reached a `;'. */
3489 /* If it is the closing '}' for a block that we have
3490 scanned, stop -- but only after consuming the token.
3491 That way given:
3493 void f g () { ... }
3494 typedef int I;
3496 we will stop after the body of the erroneously declared
3497 function, but before consuming the following `typedef'
3498 declaration. */
3500 {
3503 }
3512 }
3514 /* Consume the token. */
3516 }
3517 }
3519 /* This function is called at the end of a statement or declaration.
3520 If the next token is a semicolon, it is consumed; otherwise, error
3521 recovery is attempted. */
3523 static void
3525 {
3526 /* Look for the trailing `;'. */
3528 {
3529 /* If there is additional (erroneous) input, skip to the end of
3530 the statement. */
3532 /* If the next token is now a `;', consume it. */
3535 }
3536 }
3538 /* Skip tokens until we have consumed an entire block, or until we
3539 have consumed a non-nested `;'. */
3541 static void
3543 {
3546 /* Unwind generic function template scope if necessary. */
3551 {
3555 {
3558 /* If we've run out of tokens, stop. */
3562 /* Stop if this is an unnested ';'. */
3568 /* Stop if this is an unnested '}', or closes the outermost
3569 nesting level. */
3570 nesting_depth--;
3578 /* Nest. */
3579 nesting_depth++;
3584 }
3586 /* Consume the token. */
3588 }
3589 }
3591 /* Skip tokens until a non-nested closing curly brace is the next
3592 token, or there are no more tokens. Return true in the first case,
3593 false otherwise. */
3595 static bool
3597 {
3601 {
3605 {
3608 /* If we've run out of tokens, stop. */
3612 /* If the next token is a non-nested `}', then we have reached
3613 the end of the current block. */
3619 /* If it the next token is a `{', then we are entering a new
3620 block. Consume the entire block. */
3626 }
3628 /* Consume the token. */
3630 }
3631 }
3633 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3634 parameter is the PRAGMA token, allowing us to purge the entire pragma
3635 sequence. */
3637 static void
3639 {
3644 do
3648 /* Ensure that the pragma is not parsed again. */
3650 }
3652 /* Require pragma end of line, resyncing with it as necessary. The
3653 arguments are as for cp_parser_skip_to_pragma_eol. */
3655 static void
3657 {
3661 }
3663 /* This is a simple wrapper around make_typename_type. When the id is
3664 an unresolved identifier node, we can provide a superior diagnostic
3665 using cp_parser_diagnose_invalid_type_name. */
3667 static tree
3669 location_t id_location)
3670 {
3671 tree result;
3673 {
3679 }
3681 }
3683 /* This is a wrapper around the
3684 make_{pointer,ptrmem,reference}_declarator functions that decides
3685 which one to call based on the CODE and CLASS_TYPE arguments. The
3686 CODE argument should be one of the values returned by
3687 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3688 appertain to the pointer or reference. */
3692 cp_cv_quals cv_qualifiers,
3694 tree attributes)
3695 {
3702 else
3712 }
3714 /* Create a new C++ parser. */
3718 {
3723 /* cp_lexer_new_main is called before doing GC allocation because
3724 cp_lexer_new_main might load a PCH file. */
3727 /* Initialize the binops_by_token so that we can get the tree
3728 directly from the token. */
3736 /* For now, we always accept GNU extensions. */
3739 /* The `>' token is a greater-than operator, not the end of a
3740 template-id. */
3745 /* We are not parsing a constant-expression. */
3750 /* Local variable names are not forbidden. */
3753 /* We are not processing an `extern "C"' declaration. */
3756 /* We are not processing a declarator. */
3759 /* We are not processing a template-argument-list. */
3762 /* We are not in an iteration statement. */
3765 /* We are not in a switch statement. */
3768 /* We are not parsing a type-id inside an expression. */
3771 /* Declarations aren't implicitly extern "C". */
3774 /* String literals should be translated to the execution character set. */
3777 /* We are not parsing a function body. */
3780 /* We can correct until told otherwise. */
3783 /* The unparsed function queue is empty. */
3786 /* There are no classes being defined. */
3789 /* No template parameters apply. */
3792 /* Special parsing data structures. */
3797 /* Not declaring an implicit function template. */
3803 /* Allow constrained-type-specifiers. */
3807 }
3809 /* Create a cp_lexer structure which will emit the tokens in CACHE
3810 and push it onto the parser's lexer stack. This is used for delayed
3811 parsing of in-class method bodies and default arguments, and should
3812 not be confused with tentative parsing. */
3813 static void
3815 {
3820 /* Move the current source position to that of the first token in the
3821 new lexer. */
3823 }
3825 /* Pop the top lexer off the parser stack. This is never used for the
3826 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3827 static void
3829 {
3834 /* Put the current source position back where it was before this
3835 lexer was pushed. */
3837 }
3839 /* Lexical conventions [gram.lex] */
3841 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3842 identifier. */
3844 static cp_expr
3846 {
3849 /* Look for the identifier. */
3851 /* Return the value. */
3854 else
3856 }
3858 /* Parse a sequence of adjacent string constants. Returns a
3859 TREE_STRING representing the combined, nul-terminated string
3860 constant. If TRANSLATE is true, translate the string to the
3861 execution character set. If WIDE_OK is true, a wide string is
3862 invalid here.
3864 C++98 [lex.string] says that if a narrow string literal token is
3865 adjacent to a wide string literal token, the behavior is undefined.
3866 However, C99 6.4.5p4 says that this results in a wide string literal.
3867 We follow C99 here, for consistency with the C front end.
3869 This code is largely lifted from lex_string() in c-lex.c.
3871 FUTURE: ObjC++ will need to handle @-strings here. */
3872 static cp_expr
3875 {
3876 tree value;
3883 tree string_tree;
3889 {
3892 }
3897 {
3901 }
3902 else
3903 {
3906 }
3909 /* Try to avoid the overhead of creating and destroying an obstack
3910 for the common case of just one string. */
3913 {
3921 {
3925 }
3926 else
3930 }
3931 else
3932 {
3937 do
3938 {
3940 count++;
3945 {
3948 {
3951 }
3954 {
3959 }
3961 }
3962 else
3966 {
3970 {
3974 "unsupported non-standard concatenation "
3976 }
3977 }
3985 {
3989 }
3990 else
3991 {
3995 }
3996 }
3999 /* A string literal built by concatenation has its caret=start at
4000 the start of the initial string, and its finish at the finish of
4001 the final string literal. */
4005 }
4008 {
4011 }
4015 {
4020 {
4035 }
4040 {
4045 else
4047 }
4048 }
4049 else
4050 /* cpp_interpret_string has issued an error. */
4057 }
4059 /* Look up a literal operator with the name and the exact arguments. */
4061 static tree
4063 {
4070 {
4076 {
4079 {
4089 }
4092 /* May be this should be sufficient_parms_p instead,
4093 depending on how exactly should user-defined literals
4094 work in presence of default arguments on the literal
4095 operator parameters. */
4098 }
4099 }
4102 }
4104 /* Parse a user-defined char constant. Returns a call to a user-defined
4105 literal operator taking the character as an argument. */
4107 static cp_expr
4109 {
4117 /* Build up a call to the user-defined operator */
4118 /* Lookup the name we got back from the id-expression. */
4123 {
4128 }
4132 }
4134 /* A subroutine of cp_parser_userdef_numeric_literal to
4135 create a char... template parameter pack from a string node. */
4137 static tree
4139 {
4140 tree charvec;
4146 /* Fill in CHARVEC with all of the parameters. */
4151 /* Build the argument packs. */
4158 }
4160 /* A subroutine of cp_parser_userdef_numeric_literal to
4161 create a char... template parameter pack from a string node. */
4163 static tree
4165 {
4166 tree charvec;
4177 /* First template parm is character type. */
4180 /* Fill in CHARVEC with all of the parameters. */
4187 /* Build the argument packs. */
4194 }
4196 /* Parse a user-defined numeric constant. returns a call to a user-defined
4197 literal operator. */
4199 static cp_expr
4201 {
4212 /* Look for a literal operator taking the exact type of numeric argument
4213 as the literal value. */
4218 {
4220 tf_warning_or_error);
4223 {
4226 long_long_unsigned_type_node);
4227 }
4228 else
4229 {
4233 long_double_type_node);
4237 }
4241 }
4244 /* If the numeric argument didn't work, look for a raw literal
4245 operator taking a const char* argument consisting of the number
4246 in string format. */
4251 {
4253 tf_warning_or_error);
4256 }
4259 /* If the raw literal didn't work, look for a non-type template
4260 function with parameter pack char.... Call the function with
4261 template parameter characters representing the number. */
4265 {
4269 tf_warning_or_error);
4272 }
4281 }
4283 /* Parse a user-defined string constant. Returns a call to a user-defined
4284 literal operator taking a character pointer and the length of the string
4285 as arguments. */
4287 static tree
4289 {
4298 /* Build up a call to the user-defined operator. */
4299 /* Lookup the name we got back from the id-expression. */
4306 {
4308 tf_warning_or_error);
4311 }
4314 /* Look for a template function with typename parameter CharT
4315 and parameter pack CharT... Call the function with
4316 template parameter characters representing the string. */
4320 {
4324 tf_warning_or_error);
4327 }
4333 }
4336 /* Basic concepts [gram.basic] */
4338 /* Parse a translation-unit.
4340 translation-unit:
4341 declaration-seq [opt]
4343 Returns TRUE if all went well. */
4345 static bool
4347 {
4348 /* The address of the first non-permanent object on the declarator
4349 obstack. */
4354 /* Create the declarator obstack, if necessary. */
4356 {
4358 /* Create the error declarator. */
4360 /* Create the empty parameter list. */
4362 /* Remember where the base of the declarator obstack lies. */
4364 }
4368 /* If there are no tokens left then all went well. */
4370 {
4371 /* Get rid of the token array; we don't need it any more. */
4375 /* This file might have been a context that's implicitly extern
4376 "C". If so, pop the lang context. (Only relevant for PCH.) */
4378 {
4381 }
4383 /* Finish up. */
4387 }
4388 else
4389 {
4392 }
4394 /* Make sure the declarator obstack was fully cleaned up. */
4398 /* All went well. */
4400 }
4402 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4403 decltype context. */
4407 {
4412 }
4414 /* We're about to parse a collection of statements. If we're currently
4415 parsing tentatively, set up a firewall so that any nested
4416 cp_parser_commit_to_tentative_parse won't affect the current context. */
4418 static cp_token_position
4420 {
4427 }
4429 /* We've finished parsing the collection of statements. Wrap up the
4430 firewall and replace the relevant tokens with the parsed form. */
4432 static void
4434 tree expr)
4435 {
4439 /* Finish the firewall level. */
4441 /* And remember the result of the parse for when we try again. */
4447 }
4449 /* Like the above functions, but let the user modify the tokens. Used by
4450 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4451 later parses, so it makes sense to localize the effects of
4452 cp_parser_commit_to_tentative_parse. */
4454 struct tentative_firewall
4455 {
4460 {
4461 /* If we're currently parsing tentatively, start a committed level as a
4462 firewall and then an inner tentative parse. */
4464 {
4468 }
4469 }
4472 {
4474 {
4475 /* Finish the inner tentative parse and the firewall, propagating any
4476 uncommitted error state to the outer tentative parse. */
4482 }
4483 }
4484 };
4486 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4487 enclosing parentheses. */
4489 static cp_expr
4491 {
4494 /* Consume the '('. */
4497 /* Start the statement-expression. */
4499 /* Parse the compound-statement. */
4501 /* Finish up. */
4503 /* Consume the ')'. */
4511 }
4513 /* Expressions [gram.expr] */
4515 /* Parse a fold-operator.
4517 fold-operator:
4518 - * / % ^ & | = < > << >>
4519 = -= *= /= %= ^= &= |= <<= >>=
4520 == != <= >= && || , .* ->*
4522 This returns the tree code corresponding to the matched operator
4523 as an int. When the current token matches a compound assignment
4524 opertor, the resulting tree code is the negative value of the
4525 non-assignment operator. */
4527 static int
4529 {
4531 {
4571 }
4572 }
4574 /* Returns true if CODE indicates a binary expression, which is not allowed in
4575 the LHS of a fold-expression. More codes will need to be added to use this
4576 function in other contexts. */
4578 static bool
4580 {
4582 {
4615 }
4616 }
4618 /* If the next token is a suitable fold operator, consume it and return as
4619 the function above. */
4621 static int
4623 {
4629 }
4631 /* Parse a fold-expression.
4633 fold-expression:
4634 ( ... folding-operator cast-expression)
4635 ( cast-expression folding-operator ... )
4636 ( cast-expression folding operator ... folding-operator cast-expression)
4638 Note that the '(' and ')' are matched in primary expression. */
4640 static cp_expr
4642 {
4643 cp_id_kind pidk;
4645 // Left fold.
4647 {
4651 {
4654 }
4661 }
4666 {
4669 }
4672 {
4675 }
4678 /* The operands of a fold-expression are cast-expressions, so binary or
4679 conditional expressions are not allowed. We check this here to avoid
4680 tentative parsing. */
4690 // Right fold.
4695 {
4698 }
4701 // Binary left or right fold.
4706 }
4708 /* Parse a primary-expression.
4710 primary-expression:
4711 literal
4712 this
4713 ( expression )
4714 id-expression
4715 lambda-expression (C++11)
4717 GNU Extensions:
4719 primary-expression:
4720 ( compound-statement )
4721 __builtin_va_arg ( assignment-expression , type-id )
4722 __builtin_offsetof ( type-id , offsetof-expression )
4724 C++ Extensions:
4725 __has_nothrow_assign ( type-id )
4726 __has_nothrow_constructor ( type-id )
4727 __has_nothrow_copy ( type-id )
4728 __has_trivial_assign ( type-id )
4729 __has_trivial_constructor ( type-id )
4730 __has_trivial_copy ( type-id )
4731 __has_trivial_destructor ( type-id )
4732 __has_virtual_destructor ( type-id )
4733 __is_abstract ( type-id )
4734 __is_base_of ( type-id , type-id )
4735 __is_class ( type-id )
4736 __is_empty ( type-id )
4737 __is_enum ( type-id )
4738 __is_final ( type-id )
4739 __is_literal_type ( type-id )
4740 __is_pod ( type-id )
4741 __is_polymorphic ( type-id )
4742 __is_std_layout ( type-id )
4743 __is_trivial ( type-id )
4744 __is_union ( type-id )
4746 Objective-C++ Extension:
4748 primary-expression:
4749 objc-expression
4751 literal:
4752 __null
4754 ADDRESS_P is true iff this expression was immediately preceded by
4755 "&" and therefore might denote a pointer-to-member. CAST_P is true
4756 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4757 true iff this expression is a template argument.
4759 Returns a representation of the expression. Upon return, *IDK
4760 indicates what kind of id-expression (if any) was present. */
4762 static cp_expr
4769 {
4772 /* Assume the primary expression is not an id-expression. */
4775 /* Peek at the next token. */
4778 {
4779 /* literal:
4780 integer-literal
4781 character-literal
4782 floating-literal
4783 string-literal
4784 boolean-literal
4785 pointer-literal
4786 user-defined-literal */
4798 {
4802 }
4803 /* Floating-point literals are only allowed in an integral
4804 constant expression if they are cast to an integral or
4805 enumeration type. */
4809 {
4810 /* CAST_P will be set even in invalid code like "int(2.7 +
4811 ...)". Therefore, we have to check that the next token
4812 is sure to end the cast. */
4814 {
4819 enumerator-definition. */
4821 /* The curly brace at the end of an enum-specifier. */
4823 /* The end of a statement. */
4825 /* The end of the cast-expression. */
4827 /* The end of an array bound. */
4829 /* The closing ">" in a template-argument-list. */
4832 /* C++0x only: A ">>" treated like two ">" tokens,
4833 in a template-argument-list. */
4838 }
4840 /* If we are within a cast, then the constraint that the
4841 cast is to an integral or enumeration type will be
4842 checked at that point. If we are not within a cast, then
4843 this code is invalid. */
4846 }
4866 /* ??? Should wide strings be allowed when parser->translate_strings_p
4867 is false (i.e. in attributes)? If not, we can kill the third
4868 argument to cp_parser_string_literal. */
4874 /* If we see `( { ' then we are looking at the beginning of
4875 a GNU statement-expression. */
4878 {
4879 /* Statement-expressions are not allowed by the standard. */
4883 /* And they're not allowed outside of a function-body; you
4884 cannot, for example, write:
4886 int i = ({ int j = 3; j + 1; });
4888 at class or namespace scope. */
4891 {
4893 "statement-expressions are not allowed outside "
4899 }
4900 else
4902 }
4903 /* Otherwise it's a normal parenthesized expression. */
4904 {
4905 cp_expr expr;
4910 /* Consume the `('. */
4912 /* Within a parenthesized expression, a `>' token is always
4913 the greater-than operator. */
4914 saved_greater_than_is_operator_p
4919 /* Left fold expression. */
4921 else
4922 /* Parse the parenthesized expression. */
4927 {
4934 }
4935 else
4936 /* Let the front end know that this expression was
4937 enclosed in parentheses. This matters in case, for
4938 example, the expression is of the form `A::B', since
4939 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4940 not. */
4943 /* DR 705: Wrapping an unqualified name in parentheses
4944 suppresses arg-dependent lookup. We want to pass back
4945 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4946 (c++/37862), but none of the others. */
4950 /* The `>' token might be the end of a template-id or
4951 template-parameter-list now. */
4952 parser->greater_than_is_operator_p
4955 /* Consume the `)'. */
4964 }
4967 {
4969 {
4970 /* We might have an Objective-C++ message. */
4973 /* If that works out, we're done ... */
4976 /* ... else, fall though to see if it's a lambda. */
4977 }
4979 /* Don't warn about a failed tentative parse. */
4984 }
4988 /* We have an Objective-C++ string literal. */
4995 {
4996 /* These two are the boolean literals. */
5004 /* The `__null' literal. */
5009 /* The `nullptr' literal. */
5014 /* Recognize the `this' keyword. */
5018 {
5022 }
5023 /* Pointers cannot appear in constant-expressions. */
5028 /* The `operator' keyword can be the beginning of an
5029 id-expression. */
5036 {
5037 non_integral_constant name;
5039 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5040 __func__ are the names of variables -- but they are
5041 treated specially. Therefore, they are handled here,
5042 rather than relying on the generic id-expression logic
5043 below. Grammatically, these names are id-expressions.
5045 Consume the token. */
5049 {
5061 }
5066 /* Look up the name. */
5068 }
5071 {
5072 tree expression;
5073 tree type;
5074 source_location type_location;
5075 location_t start_loc
5077 /* The `__builtin_va_arg' construct is used to handle
5078 `va_arg'. Consume the `__builtin_va_arg' token. */
5080 /* Look for the opening `('. */
5082 /* Now, parse the assignment-expression. */
5084 /* Look for the `,'. */
5087 /* Parse the type-id. */
5088 {
5091 }
5092 /* Look for the closing `)'. */
5093 location_t finish_loc
5096 /* Using `va_arg' in a constant-expression is not
5097 allowed. */
5099 NIC_VA_ARG))
5101 /* Construct a location of the form:
5102 __builtin_va_arg (v, int)
5103 ~~~~~~~~~~~~~~~~~~~~~^~~~
5104 with the caret at the type, ranging from the start of the
5105 "__builtin_va_arg" token to the close paren. */
5106 location_t combined_loc
5109 }
5142 // C++ concepts
5146 /* Objective-C++ expressions. */
5156 {
5161 }
5162 /* FALLTHRU */
5166 }
5168 /* An id-expression can start with either an identifier, a
5169 `::' as the beginning of a qualified-id, or the "operator"
5170 keyword. */
5175 {
5176 id_expression:
5177 cp_expr id_expression;
5178 cp_expr decl;
5184 /* Parse the id-expression. */
5185 id_expression
5202 /* If we have a template-id, then no further lookup is
5203 required. If the template-id was for a template-class, we
5204 will sometimes have a TYPE_DECL at this point. */
5208 /* Look up the name. */
5209 else
5210 {
5211 tree ambiguous_decls;
5213 /* If we already know that this lookup is ambiguous, then
5214 we've already issued an error message; there's no reason
5215 to check again. */
5218 {
5221 }
5224 none_type,
5225 template_p,
5230 /* If the lookup was ambiguous, an error will already have
5231 been issued. */
5235 /* In Objective-C++, we may have an Objective-C 2.0
5236 dot-syntax for classes here. */
5241 {
5242 tree component;
5249 component);
5250 /* Build a location of the form:
5251 expr.component
5252 ~~~~~^~~~~~~~~
5253 with caret at the start of the component name (at
5254 input_location), ranging from the start of the id_expression
5255 to the end of the component name. */
5256 location_t combined_loc
5261 }
5263 /* In Objective-C++, an instance variable (ivar) may be preferred
5264 to whatever cp_parser_lookup_name() found.
5265 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5266 rest of c-family, we have to do a little extra work to preserve
5267 any location information in cp_expr "decl". Given that
5268 objc_lookup_ivar is implemented in "c-family" and "objc", we
5269 have a trip through the pure "tree" type, rather than cp_expr.
5270 Naively copying it back to "decl" would implicitly give the
5271 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5272 store an EXPR_LOCATION. Hence we only update "decl" (and
5273 hence its location_t) if we get back a different tree node. */
5275 id_expression);
5279 /* If name lookup gives us a SCOPE_REF, then the
5280 qualifying scope was dependent. */
5282 {
5283 /* At this point, we do not know if DECL is a valid
5284 integral constant expression. We assume that it is
5285 in fact such an expression, so that code like:
5287 template <int N> struct A {
5288 int a[B<N>::i];
5289 };
5291 is accepted. At template-instantiation time, we
5292 will check that B<N>::i is actually a constant. */
5294 }
5295 /* Check to see if DECL is a local variable in a context
5296 where that is forbidden. */
5299 {
5300 /* It might be that we only found DECL because we are
5301 trying to be generous with pre-ISO scoping rules.
5302 For example, consider:
5304 int i;
5305 void g() {
5306 for (int i = 0; i < 10; ++i) {}
5307 extern void f(int j = i);
5308 }
5310 Here, name look up will originally find the out
5311 of scope `i'. We need to issue a warning message,
5312 but then use the global `i'. */
5315 {
5320 }
5321 }
5322 }
5324 decl = (finish_id_expression
5326 idk,
5331 template_arg_p,
5338 }
5340 /* Anything else is an error. */
5344 }
5345 }
5353 {
5356 }
5358 /* Parse an id-expression.
5360 id-expression:
5361 unqualified-id
5362 qualified-id
5364 qualified-id:
5365 :: [opt] nested-name-specifier template [opt] unqualified-id
5366 :: identifier
5367 :: operator-function-id
5368 :: template-id
5370 Return a representation of the unqualified portion of the
5371 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5372 a `::' or nested-name-specifier.
5374 Often, if the id-expression was a qualified-id, the caller will
5375 want to make a SCOPE_REF to represent the qualified-id. This
5376 function does not do this in order to avoid wastefully creating
5377 SCOPE_REFs when they are not required.
5379 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5380 `template' keyword.
5382 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5383 uninstantiated templates.
5385 If *TEMPLATE_P is non-NULL, it is set to true iff the
5386 `template' keyword is used to explicitly indicate that the entity
5387 named is a template.
5389 If DECLARATOR_P is true, the id-expression is appearing as part of
5390 a declarator, rather than as part of an expression. */
5392 static cp_expr
5399 {
5403 /* Assume the `template' keyword was not used. */
5407 /* Look for the optional `::' operator. */
5408 global_scope_p
5411 /* Look for the optional nested-name-specifier. */
5412 nested_name_specifier_p
5415 check_dependency_p,
5417 declarator_p)
5419 /* If there is a nested-name-specifier, then we are looking at
5420 the first qualified-id production. */
5422 {
5423 tree saved_scope;
5424 tree saved_object_scope;
5425 tree saved_qualifying_scope;
5426 cp_expr unqualified_id;
5429 /* See if the next token is the `template' keyword. */
5433 /* Name lookup we do during the processing of the
5434 unqualified-id might obliterate SCOPE. */
5438 /* Process the final unqualified-id. */
5440 check_dependency_p,
5441 declarator_p,
5443 /* Restore the SAVED_SCOPE for our caller. */
5449 }
5450 /* Otherwise, if we are in global scope, then we are looking at one
5451 of the other qualified-id productions. */
5453 {
5455 tree id;
5457 /* Peek at the next token. */
5460 /* If it's an identifier, and the next token is not a "<", then
5461 we can avoid the template-id case. This is an optimization
5462 for this common case. */
5464 && !cp_parser_nth_token_starts_template_argument_list_p
5469 /* Try a template-id. */
5473 none_type,
5474 declarator_p);
5475 /* If that worked, we're done. */
5479 /* Peek at the next token. (Changes in the token buffer may
5480 have invalidated the pointer obtained above.) */
5484 {
5491 /* Fall through. */
5496 }
5497 }
5498 else
5501 declarator_p,
5502 optional_p);
5503 }
5505 /* Parse an unqualified-id.
5507 unqualified-id:
5508 identifier
5509 operator-function-id
5510 conversion-function-id
5511 ~ class-name
5512 template-id
5514 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5515 keyword, in a construct like `A::template ...'.
5517 Returns a representation of unqualified-id. For the `identifier'
5518 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5519 production a BIT_NOT_EXPR is returned; the operand of the
5520 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5521 other productions, see the documentation accompanying the
5522 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5523 names are looked up in uninstantiated templates. If DECLARATOR_P
5524 is true, the unqualified-id is appearing as part of a declarator,
5525 rather than as part of an expression. */
5527 static cp_expr
5533 {
5536 /* Peek at the next token. */
5540 {
5542 {
5543 tree id;
5545 /* We don't know yet whether or not this will be a
5546 template-id. */
5548 /* Try a template-id. */
5550 check_dependency_p,
5551 none_type,
5552 declarator_p);
5553 /* If it worked, we're done. */
5556 /* Otherwise, it's an ordinary identifier. */
5558 }
5562 check_dependency_p,
5563 none_type,
5564 declarator_p);
5567 {
5568 tree type_decl;
5569 tree qualifying_scope;
5570 tree object_scope;
5571 tree scope;
5574 /* Consume the `~' token. */
5576 /* Parse the class-name. The standard, as written, seems to
5577 say that:
5579 template <typename T> struct S { ~S (); };
5580 template <typename T> S<T>::~S() {}
5582 is invalid, since `~' must be followed by a class-name, but
5583 `S<T>' is dependent, and so not known to be a class.
5584 That's not right; we need to look in uninstantiated
5585 templates. A further complication arises from:
5587 template <typename T> void f(T t) {
5588 t.T::~T();
5589 }
5591 Here, it is not possible to look up `T' in the scope of `T'
5592 itself. We must look in both the current scope, and the
5593 scope of the containing complete expression.
5595 Yet another issue is:
5597 struct S {
5598 int S;
5599 ~S();
5600 };
5602 S::~S() {}
5604 The standard does not seem to say that the `S' in `~S'
5605 should refer to the type `S' and not the data member
5606 `S::S'. */
5608 /* DR 244 says that we look up the name after the "~" in the
5609 same scope as we looked up the qualifying name. That idea
5610 isn't fully worked out; it's more complicated than that. */
5615 /* Check for invalid scopes. */
5617 {
5621 }
5623 {
5627 scope);
5632 }
5635 /* If the name is of the form "X::~X" it's OK even if X is a
5636 typedef. */
5645 {
5648 }
5650 /* ~auto means the destructor of whatever the object is. */
5652 {
5655 "%<~auto%> only available with "
5659 }
5661 /* If there was an explicit qualification (S::~T), first look
5662 in the scope given by the qualification (i.e., S).
5664 Note: in the calls to cp_parser_class_name below we pass
5665 typename_type so that lookup finds the injected-class-name
5666 rather than the constructor. */
5670 {
5675 typename_type,
5678 declarator_p);
5681 }
5682 /* In "N::S::~S", look in "N" as well. */
5684 {
5689 type_decl
5693 typename_type,
5696 declarator_p);
5699 }
5700 /* In "p->S::~T", look in the scope given by "*p" as well. */
5702 {
5707 type_decl
5711 typename_type,
5714 declarator_p);
5717 }
5718 /* Look in the surrounding context. */
5720 {
5726 type_decl
5730 typename_type,
5733 declarator_p);
5736 {
5737 /* We couldn't find a type with this name. If we're parsing
5738 tentatively, fail and try something else. */
5740 {
5743 }
5744 /* Otherwise, accept it and check for a match at instantiation
5745 time. */
5750 }
5751 }
5752 /* If an error occurred, assume that the name of the
5753 destructor is the same as the name of the qualifying
5754 class. That allows us to keep parsing after running
5755 into ill-formed destructor names. */
5761 /* Check that destructor name and scope match. */
5763 {
5770 }
5772 /* [class.dtor]
5774 A typedef-name that names a class shall not be used as the
5775 identifier in the declarator for a destructor declaration. */
5782 type_decl);
5785 }
5789 {
5790 cp_expr id;
5792 /* This could be a template-id, so we try that first. */
5794 /* Try a template-id. */
5797 none_type,
5798 declarator_p);
5799 /* If that worked, we're done. */
5802 /* We still don't know whether we're looking at an
5803 operator-function-id or a conversion-function-id. */
5805 /* Try an operator-function-id. */
5807 /* If that didn't work, try a conversion-function-id. */
5811 {
5812 /* 17.6.3.3.5 */
5817 "literal operator suffixes not preceded by %<_%>"
5819 }
5822 }
5823 /* Fall through. */
5830 }
5831 }
5833 /* Parse an (optional) nested-name-specifier.
5835 nested-name-specifier: [C++98]
5836 class-or-namespace-name :: nested-name-specifier [opt]
5837 class-or-namespace-name :: template nested-name-specifier [opt]
5839 nested-name-specifier: [C++0x]
5840 type-name ::
5841 namespace-name ::
5842 nested-name-specifier identifier ::
5843 nested-name-specifier template [opt] simple-template-id ::
5845 PARSER->SCOPE should be set appropriately before this function is
5846 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5847 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5848 in name lookups.
5850 Sets PARSER->SCOPE to the class (TYPE) or namespace
5851 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5852 it unchanged if there is no nested-name-specifier. Returns the new
5853 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5855 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5856 part of a declaration and/or decl-specifier. */
5858 static tree
5864 {
5869 /* Remember where the nested-name-specifier starts. */
5871 {
5874 }
5877 {
5878 tree new_scope;
5879 tree old_scope;
5880 tree saved_qualifying_scope;
5883 /* Spot cases that cannot be the beginning of a
5884 nested-name-specifier. */
5887 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5888 the already parsed nested-name-specifier. */
5890 {
5891 /* Grab the nested-name-specifier and continue the loop. */
5893 /* If we originally encountered this nested-name-specifier
5894 with IS_DECLARATION set to false, we will not have
5895 resolved TYPENAME_TYPEs, so we must do so here. */
5898 {
5903 }
5906 }
5908 /* Spot cases that cannot be the beginning of a
5909 nested-name-specifier. On the second and subsequent times
5910 through the loop, we look for the `template' keyword. */
5912 ;
5913 /* A template-id can start a nested-name-specifier. */
5915 ;
5916 /* DR 743: decltype can be used in a nested-name-specifier. */
5918 ;
5919 else
5920 {
5921 /* If the next token is not an identifier, then it is
5922 definitely not a type-name or namespace-name. */
5925 /* If the following token is neither a `<' (to begin a
5926 template-id), nor a `::', then we are not looking at a
5927 nested-name-specifier. */
5933 {
5937 }
5940 && !cp_parser_nth_token_starts_template_argument_list_p
5943 }
5945 /* The nested-name-specifier is optional, so we parse
5946 tentatively. */
5949 /* Look for the optional `template' keyword, if this isn't the
5950 first time through the loop. */
5953 else
5956 /* Save the old scope since the name lookup we are about to do
5957 might destroy it. */
5960 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5961 look up names in "X<T>::I" in order to determine that "Y" is
5962 a template. So, if we have a typename at this point, we make
5963 an effort to look through it. */
5965 && !typename_keyword_p
5970 /* Parse the qualifying entity. */
5971 new_scope
5973 typename_keyword_p,
5974 template_keyword_p,
5975 check_dependency_p,
5976 type_p,
5977 is_declaration);
5978 /* Look for the `::' token. */
5981 /* If we found what we wanted, we keep going; otherwise, we're
5982 done. */
5984 {
5987 /* Restore the OLD_SCOPE since it was valid before the
5988 failed attempt at finding the last
5989 class-or-namespace-name. */
5993 /* If the next token is a decltype, and the one after that is a
5994 `::', then the decltype has failed to resolve to a class or
5995 enumeration type. Give this error even when parsing
5996 tentatively since it can't possibly be valid--and we're going
5997 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5998 won't get another chance.*/
6002 {
6009 /* As below. */
6012 }
6016 {
6017 /* If we have a non-type template-id followed by ::, it can't
6018 possibly be valid. */
6023 {
6026 {
6032 }
6033 else
6034 {
6035 /* Variable template. */
6040 }
6047 /* As below. */
6051 }
6052 }
6056 /* If the next token is an identifier, and the one after
6057 that is a `::', then any valid interpretation would have
6058 found a class-or-namespace-name. */
6064 {
6067 {
6069 {
6070 tree decl;
6071 tree ambiguous_decls;
6074 none_type,
6083 decl);
6085 {
6086 // cp_parser_lookup_name has the same diagnostic,
6087 // thus make sure to emit it at most once.
6090 {
6095 }
6097 }
6098 else
6099 {
6101 cp_parser_name_lookup_error
6104 else
6105 cp_parser_name_lookup_error
6108 }
6109 }
6112 /* Treat this as a successful nested-name-specifier
6113 due to:
6115 [basic.lookup.qual]
6117 If the name found is not a class-name (clause
6118 _class_) or namespace-name (_namespace.def_), the
6119 program is ill-formed. */
6121 }
6123 }
6125 }
6126 /* We've found one valid nested-name-specifier. */
6128 /* Name lookup always gives us a DECL. */
6131 /* Uses of "template" must be followed by actual templates. */
6143 new_scope);
6144 /* If it is a class scope, try to complete it; we are about to
6145 be looking up names inside the class. */
6147 /* Since checking types for dependency can be expensive,
6148 avoid doing it if the type is already complete. */
6150 /* Do not try to complete dependent types. */
6152 {
6154 /* If it is a typedef to current class, use the current
6155 class instead, as the typedef won't have any names inside
6156 it yet. */
6160 }
6161 /* Make sure we look in the right scope the next time through
6162 the loop. */
6164 }
6166 /* If parsing tentatively, replace the sequence of tokens that makes
6167 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6168 token. That way, should we re-parse the token stream, we will
6169 not have to repeat the effort required to do the parse, nor will
6170 we issue duplicate error messages. */
6172 {
6176 /* Reset the contents of the START token. */
6178 /* Retrieve any deferred checks. Do not pop this access checks yet
6179 so the memory will not be reclaimed during token replacing below. */
6187 /* Purge all subsequent tokens. */
6189 }
6195 }
6197 /* Parse a nested-name-specifier. See
6198 cp_parser_nested_name_specifier_opt for details. This function
6199 behaves identically, except that it will an issue an error if no
6200 nested-name-specifier is present. */
6202 static tree
6208 {
6209 tree scope;
6211 /* Look for the nested-name-specifier. */
6213 typename_keyword_p,
6214 check_dependency_p,
6215 type_p,
6216 is_declaration);
6217 /* If it was not present, issue an error message. */
6219 {
6222 }
6225 }
6227 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6228 this is either a class-name or a namespace-name (which corresponds
6229 to the class-or-namespace-name production in the grammar). For
6230 C++0x, it can also be a type-name that refers to an enumeration
6231 type or a simple-template-id.
6233 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6234 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6235 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6236 TYPE_P is TRUE iff the next name should be taken as a class-name,
6237 even the same name is declared to be another entity in the same
6238 scope.
6240 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6241 specified by the class-or-namespace-name. If neither is found the
6242 ERROR_MARK_NODE is returned. */
6244 static tree
6251 {
6252 tree saved_scope;
6253 tree saved_qualifying_scope;
6254 tree saved_object_scope;
6255 tree scope;
6259 /* DR 743: decltype can appear in a nested-name-specifier. */
6261 {
6265 {
6268 }
6272 }
6274 /* Before we try to parse the class-name, we must save away the
6275 current PARSER->SCOPE since cp_parser_class_name will destroy
6276 it. */
6280 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6281 there is no need to look for a namespace-name. */
6282 only_class_p = template_keyword_p
6287 typename_keyword_p,
6288 template_keyword_p,
6290 check_dependency_p,
6292 is_declaration,
6295 /* If that didn't work, try for a namespace-name. */
6297 {
6298 /* Restore the saved scope. */
6302 /* If we are not looking at an identifier followed by the scope
6303 resolution operator, then this is not part of a
6304 nested-name-specifier. (Note that this function is only used
6305 to parse the components of a nested-name-specifier.) */
6310 }
6313 }
6315 /* Return true if we are looking at a compound-literal, false otherwise. */
6317 static bool
6319 {
6320 /* Consume the `('. */
6325 /* Skip tokens until the next token is a closing parenthesis.
6326 If we find the closing `)', and the next token is a `{', then
6327 we are looking at a compound-literal. */
6328 bool compound_literal_p
6333 /* Roll back the tokens we skipped. */
6337 }
6339 /* Parse a postfix-expression.
6341 postfix-expression:
6342 primary-expression
6343 postfix-expression [ expression ]
6344 postfix-expression ( expression-list [opt] )
6345 simple-type-specifier ( expression-list [opt] )
6346 typename :: [opt] nested-name-specifier identifier
6347 ( expression-list [opt] )
6348 typename :: [opt] nested-name-specifier template [opt] template-id
6349 ( expression-list [opt] )
6350 postfix-expression . template [opt] id-expression
6351 postfix-expression -> template [opt] id-expression
6352 postfix-expression . pseudo-destructor-name
6353 postfix-expression -> pseudo-destructor-name
6354 postfix-expression ++
6355 postfix-expression --
6356 dynamic_cast < type-id > ( expression )
6357 static_cast < type-id > ( expression )
6358 reinterpret_cast < type-id > ( expression )
6359 const_cast < type-id > ( expression )
6360 typeid ( expression )
6361 typeid ( type-id )
6363 GNU Extension:
6365 postfix-expression:
6366 ( type-id ) { initializer-list , [opt] }
6368 This extension is a GNU version of the C99 compound-literal
6369 construct. (The C99 grammar uses `type-name' instead of `type-id',
6370 but they are essentially the same concept.)
6372 If ADDRESS_P is true, the postfix expression is the operand of the
6373 `&' operator. CAST_P is true if this expression is the target of a
6374 cast.
6376 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6377 class member access expressions [expr.ref].
6379 Returns a representation of the expression. */
6381 static cp_expr
6385 {
6387 location_t loc;
6394 /* Peek at the next token. */
6399 /* Some of the productions are determined by keywords. */
6402 {
6407 {
6408 tree type;
6409 cp_expr expression;
6413 /* All of these can be handled in the same way from the point
6414 of view of parsing. Begin by consuming the token
6415 identifying the cast. */
6418 /* New types cannot be defined in the cast. */
6420 parser->type_definition_forbidden_message
6423 /* Look for the opening `<'. */
6425 /* Parse the type to which we are casting. */
6430 /* Look for the closing `>'. */
6432 /* Restore the old message. */
6435 bool saved_greater_than_is_operator_p
6439 /* And the expression which is being cast. */
6443 RT_CLOSE_PAREN);
6447 parser->greater_than_is_operator_p
6450 /* Only type conversions to integral or enumeration types
6451 can be used in constant-expressions. */
6454 {
6457 }
6460 {
6462 postfix_expression
6466 postfix_expression
6470 postfix_expression
6472 tf_warning_or_error);
6475 postfix_expression
6480 }
6482 /* Construct a location e.g. :
6483 reinterpret_cast <int *> (expr)
6484 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6485 ranging from the start of the "*_cast" token to the final closing
6486 paren, with the caret at the start. */
6489 }
6493 {
6494 tree type;
6498 /* Consume the `typeid' token. */
6500 /* Look for the `(' token. */
6502 /* Types cannot be defined in a `typeid' expression. */
6504 parser->type_definition_forbidden_message
6506 /* We can't be sure yet whether we're looking at a type-id or an
6507 expression. */
6509 /* Try a type-id first. */
6514 /* Look for the `)' token. Otherwise, we can't be sure that
6515 we're not looking at an expression: consider `typeid (int
6516 (3))', for example. */
6518 /* If all went well, simply lookup the type-id. */
6521 /* Otherwise, fall back to the expression variant. */
6522 else
6523 {
6524 tree expression;
6526 /* Look for an expression. */
6528 /* Compute its typeid. */
6530 /* Look for the `)' token. */
6532 }
6533 /* Restore the saved message. */
6535 /* `typeid' may not appear in an integral constant expression. */
6538 }
6542 {
6543 tree type;
6544 /* The syntax permitted here is the same permitted for an
6545 elaborated-type-specifier. */
6552 }
6556 {
6557 location_t cilk_spawn_loc
6562 {
6567 }
6569 {
6574 }
6575 else
6576 {
6577 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6580 }
6582 postfix_expression =
6586 {
6590 }
6592 {
6597 }
6598 else
6599 {
6602 postfix_expression);
6603 /* Build a location of the form:
6604 _Cilk_spawn expr
6605 ~~~~~~~~~~~~^~~~
6606 with caret at the expr, ranging from the start of the
6607 _Cilk_spawn token to the end of the expression. */
6608 location_t combined_loc =
6614 }
6616 }
6621 {
6624 tree p;
6631 {
6634 }
6640 {
6643 postfix_expression
6645 else
6646 {
6650 }
6656 tf_warning_or_error);
6657 else
6658 {
6662 }
6667 postfix_expression
6671 postfix_expression
6674 else
6675 {
6679 }
6684 }
6686 }
6689 {
6690 tree type;
6692 /* If the next thing is a simple-type-specifier, we may be
6693 looking at a functional cast. We could also be looking at
6694 an id-expression. So, we try the functional cast, and if
6695 that doesn't work we fall back to the primary-expression. */
6697 /* Look for the simple-type-specifier. */
6701 CP_PARSER_FLAGS_NONE);
6703 /* Parse the cast itself. */
6705 postfix_expression
6707 /* If that worked, we're done. */
6711 /* If the functional-cast didn't work out, try a
6712 compound-literal. */
6715 {
6720 /* Avoid calling cp_parser_type_id pointlessly, see comment
6721 in cp_parser_cast_expression about c++/29234. */
6724 else
6725 {
6726 /* Parse the type. */
6731 /* Look for the `)'. */
6733 }
6735 /* If things aren't going well, there's no need to
6736 keep going. */
6738 {
6740 /* Parse the brace-enclosed initializer list. */
6743 }
6744 /* If that worked, we're definitely looking at a
6745 compound-literal expression. */
6747 {
6748 /* Warn the user that a compound literal is not
6749 allowed in standard C++. */
6752 /* For simplicity, we disallow compound literals in
6753 constant-expressions. We could
6754 allow compound literals of integer type, whose
6755 initializer was a constant, in constant
6756 expressions. Permitting that usage, as a further
6757 extension, would not change the meaning of any
6758 currently accepted programs. (Of course, as
6759 compound literals are not part of ISO C++, the
6760 standard has nothing to say.) */
6762 NIC_NCC))
6763 {
6766 }
6767 /* Form the representation of the compound-literal. */
6768 postfix_expression
6770 tf_warning_or_error);
6773 }
6774 }
6776 /* It must be a primary-expression. */
6777 postfix_expression
6780 decltype_p,
6782 }
6784 }
6786 /* Note that we don't need to worry about calling build_cplus_new on a
6787 class-valued CALL_EXPR in decltype when it isn't the end of the
6788 postfix-expression; unary_complex_lvalue will take care of that for
6789 all these cases. */
6791 /* Keep looping until the postfix-expression is complete. */
6793 {
6797 /* It is not a Koenig lookup function call. */
6798 postfix_expression
6801 /* Peek at the next token. */
6805 {
6808 {
6810 "two consecutive %<[%> shall "
6813 }
6814 postfix_expression
6816 postfix_expression,
6818 decltype_p);
6827 /* postfix-expression ( expression-list [opt] ) */
6828 {
6839 is_builtin_constant_p
6842 {
6843 /* The whole point of __builtin_constant_p is to allow
6844 non-constant expressions to appear as arguments. */
6845 saved_integral_constant_expression_p
6847 saved_non_integral_constant_expression_p
6850 }
6851 args = (cp_parser_parenthesized_expression_list
6857 {
6858 parser->integral_constant_expression_p
6860 parser->non_integral_constant_expression_p
6862 }
6865 {
6868 }
6870 /* Function calls are not permitted in
6871 constant-expressions. */
6874 NIC_FUNC_CALL))
6875 {
6879 }
6884 {
6886 {
6888 {
6891 postfix_expression
6893 complain);
6894 }
6895 else
6896 postfix_expression
6898 }
6899 /* We do not perform argument-dependent lookup if
6900 normal lookup finds a non-function, in accordance
6901 with the expected resolution of DR 218. */
6904 {
6908 /* Do not do argument dependent lookup if regular
6909 lookup finds a member function or a block-scope
6910 function declaration. [basic.lookup.argdep]/3 */
6913 {
6916 postfix_expression
6918 complain);
6919 }
6920 }
6921 }
6927 {
6936 }
6939 {
6949 {
6951 postfix_expression
6955 }
6958 {
6959 postfix_expression
6960 = (build_new_method_call
6966 complain));
6967 }
6968 else
6969 postfix_expression
6973 complain);
6974 }
6978 postfix_expression = (build_offset_ref_call_from_tree
6980 complain));
6982 /* A call to a static class member, or a namespace-scope
6983 function. */
6984 postfix_expression
6987 koenig_p,
6988 complain);
6989 else
6990 /* All other function calls. */
6991 postfix_expression
6994 koenig_p,
6995 complain);
6998 {
7000 start_loc,
7001 close_paren_loc);
7003 }
7005 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7009 }
7014 /* postfix-expression . template [opt] id-expression
7015 postfix-expression . pseudo-destructor-name
7016 postfix-expression -> template [opt] id-expression
7017 postfix-expression -> pseudo-destructor-name */
7019 /* Consume the `.' or `->' operator. */
7022 postfix_expression
7024 postfix_expression,
7031 /* postfix-expression ++ */
7032 /* Consume the `++' token. */
7034 /* Generate a representation for the complete expression. */
7035 postfix_expression
7037 POSTINCREMENT_EXPR);
7038 /* Increments may not appear in constant-expressions. */
7046 /* postfix-expression -- */
7047 /* Consume the `--' token. */
7049 /* Generate a representation for the complete expression. */
7050 postfix_expression
7052 POSTDECREMENT_EXPR);
7053 /* Decrements may not appear in constant-expressions. */
7064 return is_member_access
7065 ? postfix_expression
7067 else
7069 }
7070 }
7072 /* We should never get here. */
7075 }
7077 /* This function parses Cilk Plus array notations. If a normal array expr. is
7078 parsed then the array index is passed back to the caller through *INIT_INDEX
7079 and the function returns a NULL_TREE. If array notation expr. is parsed,
7080 then *INIT_INDEX is ignored by the caller and the function returns
7081 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7082 error_mark_node. */
7084 static tree
7086 tree array_value)
7087 {
7091 {
7094 }
7103 {
7106 }
7108 {
7109 /* Consume the ':'. */
7112 /* If we are here, then we have a case like this A[:]. */
7114 {
7118 }
7122 }
7123 else
7124 {
7125 /* If we are here, then there are three valid possibilities:
7126 1. ARRAY [ EXP ]
7127 2. ARRAY [ EXP : EXP ]
7128 3. ARRAY [ EXP : EXP : EXP ] */
7132 {
7133 /* This indicates that we have a normal array expression. */
7136 }
7138 /* Consume the ':'. */
7142 {
7145 }
7146 }
7151 {
7155 }
7161 }
7163 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7164 by cp_parser_builtin_offsetof. We're looking for
7166 postfix-expression [ expression ]
7167 postfix-expression [ braced-init-list ] (C++11)
7169 FOR_OFFSETOF is set if we're being called in that context, which
7170 changes how we deal with integer constant expressions. */
7172 static tree
7174 tree postfix_expression,
7177 {
7182 /* Consume the `[' token. */
7188 /* Parse the index expression. */
7189 /* ??? For offsetof, there is a question of what to allow here. If
7190 offsetof is not being used in an integral constant expression context,
7191 then we *could* get the right answer by computing the value at runtime.
7192 If we are in an integral constant expression context, then we might
7193 could accept any constant expression; hard to say without analysis.
7194 Rather than open the barn door too wide right away, allow only integer
7195 constant expressions here. */
7198 else
7199 {
7201 {
7208 {
7210 "braced list index is not allowed with array "
7214 }
7215 }
7217 {
7218 /* Here are have these two options:
7219 ARRAY[EXP : EXP] - Array notation expr with default
7220 stride of 1.
7221 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7222 stride. */
7224 postfix_expression);
7227 }
7228 else
7230 }
7234 /* Look for the closing `]'. */
7237 /* Build the ARRAY_REF. */
7241 /* When not doing offsetof, array references are not permitted in
7242 constant-expressions. */
7248 }
7250 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7251 by cp_parser_builtin_offsetof. We're looking for
7253 postfix-expression . template [opt] id-expression
7254 postfix-expression . pseudo-destructor-name
7255 postfix-expression -> template [opt] id-expression
7256 postfix-expression -> pseudo-destructor-name
7258 FOR_OFFSETOF is set if we're being called in that context. That sorta
7259 limits what of the above we'll actually accept, but nevermind.
7260 TOKEN_TYPE is the "." or "->" token, which will already have been
7261 removed from the stream. */
7263 static tree
7266 cp_expr postfix_expression,
7268 location_t location)
7269 {
7270 tree name;
7276 /* If this is a `->' operator, dereference the pointer. */
7279 tf_warning_or_error);
7280 /* Check to see whether or not the expression is type-dependent and
7281 not the current instantiation. */
7283 /* The identifier following the `->' or `.' is not qualified. */
7289 /* Enter the scope corresponding to the type of the object
7290 given by the POSTFIX_EXPRESSION. */
7292 {
7294 /* According to the standard, no expression should ever have
7295 reference type. Unfortunately, we do not currently match
7296 the standard in this respect in that our internal representation
7297 of an expression may have reference type even when the standard
7298 says it does not. Therefore, we have to manually obtain the
7299 underlying type here. */
7301 /* The type of the POSTFIX_EXPRESSION must be complete. */
7302 /* Unlike the object expression in other contexts, *this is not
7303 required to be of complete type for purposes of class member
7304 access (5.2.5) outside the member function body. */
7307 && !(processing_template_decl
7308 && current_class_type
7309 && (same_type_ignoring_top_level_qualifiers_p
7311 {
7314 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7316 {
7317 /* In a template, be permissive by treating an object expression
7318 of incomplete type as dependent (after a pedwarn). */
7319 diagnostic_t kind = (processing_template_decl
7320 ? DK_PEDWARN
7322 cxx_incomplete_type_diagnostic
7326 {
7329 }
7330 }
7331 }
7334 {
7335 /* Let the name lookup machinery know that we are processing a
7336 class member access expression. */
7338 /* If something went wrong, we want to be able to discern that case,
7339 as opposed to the case where there was no SCOPE due to the type
7340 of expression being dependent. */
7343 /* If the SCOPE was erroneous, make the various semantic analysis
7344 functions exit quickly -- and without issuing additional error
7345 messages. */
7348 }
7349 }
7352 /* Tell cp_parser_lookup_name that there was an object, even though it's
7353 type-dependent. */
7356 /* Assume this expression is not a pseudo-destructor access. */
7359 /* If the SCOPE is a scalar type, then, if this is a valid program,
7360 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7361 is type dependent, it can be pseudo-destructor-name or something else.
7362 Try to parse it as pseudo-destructor-name first. */
7364 {
7365 tree s;
7366 tree type;
7369 /* Parse the pseudo-destructor-name. */
7378 {
7380 postfix_expression
7383 }
7384 }
7387 {
7388 /* If the SCOPE is not a scalar type, we are looking at an
7389 ordinary class member access expression, rather than a
7390 pseudo-destructor-name. */
7393 /* Parse the id-expression. */
7394 name = (cp_parser_id_expression
7401 /* In general, build a SCOPE_REF if the member name is qualified.
7402 However, if the name was not dependent and has already been
7403 resolved; there is no need to build the SCOPE_REF. For example;
7405 struct X { void f(); };
7406 template <typename T> void f(T* t) { t->X::f(); }
7408 Even though "t" is dependent, "X::f" is not and has been resolved
7409 to a BASELINK; there is no need to include scope information. */
7411 /* But we do need to remember that there was an explicit scope for
7412 virtual function calls. */
7416 /* If the name is a template-id that names a type, we will get a
7417 TYPE_DECL here. That is invalid code. */
7419 {
7422 }
7423 else
7424 {
7426 {
7428 {
7432 }
7433 else
7436 name,
7437 template_p);
7441 }
7443 adjust_result_of_qualified_name_lookup
7445 postfix_expression
7447 template_p,
7448 tf_warning_or_error);
7449 /* Build a location e.g.:
7450 ptr->access_expr
7451 ~~~^~~~~~~~~~~~~
7452 where the caret is at the deref token, ranging from
7453 the start of postfix_expression to the end of the access expr. */
7454 location_t end_loc
7456 location_t combined_loc
7459 }
7460 }
7462 /* We no longer need to look up names in the scope of the object on
7463 the left-hand side of the `.' or `->' operator. */
7466 /* Outside of offsetof, these operators may not appear in
7467 constant-expressions. */
7469 && (cp_parser_non_integral_constant_expression
7474 }
7476 /* Parse a parenthesized expression-list.
7478 expression-list:
7479 assignment-expression
7480 expression-list, assignment-expression
7482 attribute-list:
7483 expression-list
7484 identifier
7485 identifier, expression-list
7487 CAST_P is true if this expression is the target of a cast.
7489 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7490 argument pack.
7492 Returns a vector of trees. Each element is a representation of an
7493 assignment-expression. NULL is returned if the ( and or ) are
7494 missing. An empty, but allocated, vector is returned on no
7495 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7496 if we are parsing an attribute list for an attribute that wants a
7497 plain identifier argument, normal_attr for an attribute that wants
7498 an expression, or non_attr if we aren't parsing an attribute list. If
7499 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7500 not all of the expressions in the list were constant.
7501 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7502 will be written to with the location of the closing parenthesis. If
7503 an error occurs, it may or may not be written to. */
7512 {
7518 /* Assume all the expressions will be constant. */
7527 /* Within a parenthesized expression, a `>' token is always
7528 the greater-than operator. */
7529 saved_greater_than_is_operator_p
7533 /* Consume expressions until there are no more. */
7536 {
7537 tree expr;
7539 /* At the beginning of attribute lists, check to see if the
7540 next token is an identifier. */
7543 {
7546 /* Consume the identifier. */
7548 /* Save the identifier. */
7550 }
7551 else
7552 {
7555 /* Parse the next assignment-expression. */
7557 {
7558 /* A braced-init-list. */
7564 }
7566 {
7567 expr = (cp_parser_constant_expression
7572 }
7573 else
7575 cast_p);
7580 /* If we have an ellipsis, then this is an expression
7581 expansion. */
7584 {
7585 /* Consume the `...'. */
7588 /* Build the argument pack. */
7590 }
7592 /* Add it to the list. We add error_mark_node
7593 expressions to the list, so that we can still tell if
7594 the correct form for a parenthesized expression-list
7595 is found. That gives better errors. */
7600 }
7602 /* After the first item, attribute lists look the same as
7603 expression lists. */
7606 get_comma:;
7607 /* If the next token isn't a `,', then we are done. */
7611 /* Otherwise, consume the `,' and keep going. */
7613 }
7619 {
7622 skip_comma:;
7623 /* We try and resync to an unnested comma, as that will give the
7624 user better diagnostics. */
7632 {
7633 parser->greater_than_is_operator_p
7636 }
7637 }
7639 parser->greater_than_is_operator_p
7646 }
7648 /* Parse a pseudo-destructor-name.
7650 pseudo-destructor-name:
7651 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7652 :: [opt] nested-name-specifier template template-id :: ~ type-name
7653 :: [opt] nested-name-specifier [opt] ~ type-name
7655 If either of the first two productions is used, sets *SCOPE to the
7656 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7657 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7658 or ERROR_MARK_NODE if the parse fails. */
7660 static void
7662 tree object,
7665 {
7668 /* Handle ~auto. */
7672 {
7675 "%<~auto%> only available with "
7682 }
7684 /* Assume that things will not work out. */
7687 /* Look for the optional `::' operator. */
7689 /* Look for the optional nested-name-specifier. */
7690 nested_name_specifier_p
7697 /* Now, if we saw a nested-name-specifier, we might be doing the
7698 second production. */
7701 {
7702 /* Consume the `template' keyword. */
7704 /* Parse the template-id. */
7708 class_type,
7710 /* Look for the `::' token. */
7712 }
7713 /* If the next token is not a `~', then there might be some
7714 additional qualification. */
7716 {
7717 /* At this point, we're looking for "type-name :: ~". The type-name
7718 must not be a class-name, since this is a pseudo-destructor. So,
7719 it must be either an enum-name, or a typedef-name -- both of which
7720 are just identifiers. So, we peek ahead to check that the "::"
7721 and "~" tokens are present; if they are not, then we can avoid
7722 calling type_name. */
7726 {
7729 }
7731 /* Look for the type-name. */
7736 /* Look for the `::' token. */
7738 }
7739 else
7742 /* Look for the `~'. */
7745 /* Once we see the ~, this has to be a pseudo-destructor. */
7749 /* Look for the type-name again. We are not responsible for
7750 checking that it matches the first type-name. */
7752 }
7754 /* Parse a unary-expression.
7756 unary-expression:
7757 postfix-expression
7758 ++ cast-expression
7759 -- cast-expression
7760 unary-operator cast-expression
7761 sizeof unary-expression
7762 sizeof ( type-id )
7763 alignof ( type-id ) [C++0x]
7764 new-expression
7765 delete-expression
7767 GNU Extensions:
7769 unary-expression:
7770 __extension__ cast-expression
7771 __alignof__ unary-expression
7772 __alignof__ ( type-id )
7773 alignof unary-expression [C++0x]
7774 __real__ cast-expression
7775 __imag__ cast-expression
7776 && identifier
7777 sizeof ( type-id ) { initializer-list , [opt] }
7778 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7779 __alignof__ ( type-id ) { initializer-list , [opt] }
7781 ADDRESS_P is true iff the unary-expression is appearing as the
7782 operand of the `&' operator. CAST_P is true if this expression is
7783 the target of a cast.
7785 Returns a representation of the expression. */
7787 static cp_expr
7790 {
7794 /* Peek at the next token. */
7796 /* Some keywords give away the kind of expression. */
7798 {
7802 {
7805 {
7811 /* Consume the token. */
7813 /* Parse the operand. */
7818 else
7819 {
7820 /* ISO C++ defines alignof only with types, not with
7821 expressions. So pedwarn if alignof is used with a non-
7822 type expression. However, __alignof__ is ok. */
7825 "ISO C++ does not allow %<alignof%> "
7829 }
7830 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7831 SIZEOF_EXPR with the original operand. */
7833 {
7835 {
7837 {
7840 error_mark_node));
7842 }
7843 else
7847 }
7848 }
7850 /* Construct a location e.g. :
7851 alignof (expr)
7852 ^~~~~~~~~~~~~~
7853 with start == caret at the start of the "alignof"/"sizeof"
7854 token, with the endpoint at the final closing paren. */
7855 location_t finish_loc
7857 location_t compound_loc
7863 }
7872 {
7873 /* The saved value of the PEDANTIC flag. */
7875 tree expr;
7877 /* Save away the PEDANTIC flag. */
7879 /* Parse the cast-expression. */
7881 /* Restore the PEDANTIC flag. */
7885 }
7889 {
7890 tree expression;
7892 /* Consume the `__real__' or `__imag__' token. */
7894 /* Parse the cast-expression. */
7896 /* Create the complete representation. */
7900 expression,
7901 tf_warning_or_error);
7902 }
7910 {
7911 tree expr;
7921 parser->type_definition_forbidden_message
7924 saved_integral_constant_expression_p
7926 saved_non_integral_constant_expression_p
7930 saved_greater_than_is_operator_p
7942 parser->greater_than_is_operator_p
7945 parser->integral_constant_expression_p
7947 parser->non_integral_constant_expression_p
7954 }
7958 }
7959 }
7961 /* Look for the `:: new' and `:: delete', which also signal the
7962 beginning of a new-expression, or delete-expression,
7963 respectively. If the next token is `::', then it might be one of
7964 these. */
7966 {
7969 /* See if the token after the `::' is one of the keywords in
7970 which we're interested. */
7972 /* If it's `new', we have a new-expression. */
7975 /* Similarly, for `delete'. */
7978 }
7980 /* Look for a unary operator. */
7982 /* The `++' and `--' operators can be handled similarly, even though
7983 they are not technically unary-operators in the grammar. */
7985 {
7990 /* Handle the GNU address-of-label extension. */
7993 {
7994 tree identifier;
7995 tree expression;
7998 /* Consume the '&&' token. */
8000 /* Look for the identifier. */
8001 location_t finish_loc
8004 /* Construct a location of the form:
8005 &&label
8006 ^~~~~~~
8007 with caret==start at the "&&", finish at the end of the label. */
8008 location_t combined_loc
8010 /* Create an expression representing the address. */
8013 NIC_ADDR_LABEL))
8016 }
8017 }
8019 {
8020 cp_expr cast_expression;
8026 /* Consume the operator token. */
8030 /* Parse the cast-expression. */
8031 cast_expression
8036 pidk);
8038 /* Make a location:
8039 OP_TOKEN CAST_EXPRESSION
8040 ^~~~~~~~~~~~~~~~~~~~~~~~~
8041 with start==caret at the operator token, and
8042 extending to the end of the cast_expression. */
8045 /* Now, build an appropriate representation. */
8047 {
8051 RO_UNARY_STAR,
8052 complain);
8053 /* TODO: build_x_indirect_ref does not always honor the
8054 location, so ensure it is set. */
8060 /* Fall through. */
8063 cast_expression,
8064 complain);
8065 /* TODO: build_x_unary_op does not always honor the location,
8066 so ensure it is set. */
8074 /* Fall through. */
8076 /* Immediately fold negation of a constant, unless the constant is 0
8077 (since -0 == 0) or it would overflow. */
8082 {
8085 cast_expression);
8087 {
8090 }
8091 }
8092 /* Fall through. */
8101 }
8105 non_constant_p))
8109 }
8113 decltype_p,
8114 pidk);
8115 }
8117 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8118 unary-operator, the corresponding tree code is returned. */
8120 static enum tree_code
8122 {
8124 {
8145 }
8146 }
8148 /* Parse a new-expression.
8150 new-expression:
8151 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8152 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8154 Returns a representation of the expression. */
8156 static tree
8158 {
8161 tree type;
8164 tree ret;
8168 /* Look for the optional `::' operator. */
8169 global_scope_p
8173 /* Look for the `new' operator. */
8175 /* There's no easy way to tell a new-placement from the
8176 `( type-id )' construct. */
8178 /* Look for a new-placement. */
8180 /* If that didn't work out, there's no new-placement. */
8182 {
8186 }
8188 /* If the next token is a `(', then we have a parenthesized
8189 type-id. */
8191 {
8195 /* Consume the `('. */
8198 /* Parse the type-id. */
8199 parser->type_definition_forbidden_message
8201 {
8204 }
8207 /* Look for the closing `)'. */
8210 /* There should not be a direct-new-declarator in this production,
8211 but GCC used to allowed this, so we check and emit a sensible error
8212 message for this case. */
8214 {
8220 }
8221 }
8222 /* Otherwise, there must be a new-type-id. */
8223 else
8226 /* If the next token is a `(' or '{', then we have a new-initializer. */
8231 else
8234 /* A new-expression may not appear in an integral constant
8235 expression. */
8238 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8239 of a new-type-id or type-id of a new-expression, the new-expression shall
8240 contain a new-initializer of the form ( assignment-expression )".
8241 Additionally, consistently with the spirit of DR 1467, we want to accept
8242 'new auto { 2 }' too. */
8248 {
8250 "initialization of new-expression for type %<auto%> "
8253 }
8254 else
8255 {
8256 /* Construct a location e.g.:
8257 ptr = new int[100]
8258 ^~~~~~~~~~~~
8259 with caret == start at the start of the "new" token, and the end
8260 at the end of the final token we consumed. */
8265 /* Create a representation of the new-expression. */
8267 tf_warning_or_error);
8269 }
8277 }
8279 /* Parse a new-placement.
8281 new-placement:
8282 ( expression-list )
8284 Returns the same representation as for an expression-list. */
8288 {
8291 /* Parse the expression-list. */
8292 expression_list = (cp_parser_parenthesized_expression_list
8301 }
8303 /* Parse a new-type-id.
8305 new-type-id:
8306 type-specifier-seq new-declarator [opt]
8308 Returns the TYPE allocated. If the new-type-id indicates an array
8309 type, *NELTS is set to the number of elements in the last array
8310 bound; the TYPE will not include the last array bound. */
8312 static tree
8314 {
8315 cp_decl_specifier_seq type_specifier_seq;
8321 /* The type-specifier sequence must not contain type definitions.
8322 (It cannot contain declarations of new types either, but if they
8323 are not definitions we will catch that because they are not
8324 complete.) */
8326 parser->type_definition_forbidden_message
8328 /* Parse the type-specifier-seq. */
8332 /* Restore the old message. */
8338 /* Parse the new-declarator. */
8341 /* Determine the number of elements in the last array dimension, if
8342 any. */
8344 /* Skip down to the last array dimension. */
8349 {
8352 }
8357 {
8360 }
8363 {
8370 else
8372 }
8375 }
8377 /* Parse an (optional) new-declarator.
8379 new-declarator:
8380 ptr-operator new-declarator [opt]
8381 direct-new-declarator
8383 Returns the declarator. */
8387 {
8390 cp_cv_quals cv_quals;
8392 /* We don't know if there's a ptr-operator next, or not. */
8394 /* Look for a ptr-operator. */
8396 /* If that worked, look for more new-declarators. */
8398 {
8401 /* Parse another optional declarator. */
8404 declarator = cp_parser_make_indirect_declarator
8408 }
8410 /* If the next token is a `[', there is a direct-new-declarator. */
8415 }
8417 /* Parse a direct-new-declarator.
8419 direct-new-declarator:
8420 [ expression ]
8421 direct-new-declarator [constant-expression]
8423 */
8427 {
8431 {
8432 tree expression;
8435 /* Look for the opening `['. */
8440 /* The standard requires that the expression have integral
8441 type. DR 74 adds enumeration types. We believe that the
8442 real intent is that these expressions be handled like the
8443 expression in a `switch' condition, which also allows
8444 classes with a single conversion to integral or
8445 enumeration type. */
8447 {
8448 expression
8450 expression,
8453 {
8455 "expression in new-declarator must have integral "
8458 }
8459 }
8461 /* Look for the closing `]'. */
8464 /* Add this bound to the declarator. */
8467 /* If the next token is not a `[', then there are no more
8468 bounds. */
8471 }
8474 }
8476 /* Parse a new-initializer.
8478 new-initializer:
8479 ( expression-list [opt] )
8480 braced-init-list
8482 Returns a representation of the expression-list. */
8486 {
8490 {
8491 tree t;
8498 }
8499 else
8500 expression_list = (cp_parser_parenthesized_expression_list
8506 }
8508 /* Parse a delete-expression.
8510 delete-expression:
8511 :: [opt] delete cast-expression
8512 :: [opt] delete [ ] cast-expression
8514 Returns a representation of the expression. */
8516 static tree
8518 {
8521 tree expression;
8523 /* Look for the optional `::' operator. */
8524 global_scope_p
8528 /* Look for the `delete' keyword. */
8530 /* See if the array syntax is in use. */
8532 {
8533 /* Consume the `[' token. */
8535 /* Look for the `]' token. */
8537 /* Remember that this is the `[]' construct. */
8539 }
8540 else
8543 /* Parse the cast-expression. */
8546 /* A delete-expression may not appear in an integral constant
8547 expression. */
8552 tf_warning_or_error);
8553 }
8555 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8556 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8557 0 otherwise. */
8559 static int
8561 {
8564 {
8606 /* In ((type ()) () the last () isn't a valid cast-expression,
8607 so the whole must be parsed as postfix-expression. */
8612 /* '[' may start a primary-expression in obj-c++ and in C++11,
8613 as a lambda-expression, eg, '(void)[]{}'. */
8620 /* '++' and '--' may or may not start a cast-expression:
8622 struct T { void operator++(int); };
8623 void f() { (T())++; }
8625 vs
8627 int a;
8628 (int)++a; */
8633 }
8634 }
8636 /* Parse a cast-expression.
8638 cast-expression:
8639 unary-expression
8640 ( type-id ) cast-expression
8642 ADDRESS_P is true iff the unary-expression is appearing as the
8643 operand of the `&' operator. CAST_P is true if this expression is
8644 the target of a cast.
8646 Returns a representation of the expression. */
8648 static cp_expr
8651 {
8652 /* If it's a `(', then we might be looking at a cast. */
8654 {
8660 /* There's no way to know yet whether or not this is a cast.
8661 For example, `(int (3))' is a unary-expression, while `(int)
8662 3' is a cast. So, we resort to parsing tentatively. */
8664 /* Types may not be defined in a cast. */
8666 parser->type_definition_forbidden_message
8668 /* Consume the `('. */
8672 /* A very tricky bit is that `(struct S) { 3 }' is a
8673 compound-literal (which we permit in C++ as an extension).
8674 But, that construct is not a cast-expression -- it is a
8675 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8676 is legal; if the compound-literal were a cast-expression,
8677 you'd need an extra set of parentheses.) But, if we parse
8678 the type-id, and it happens to be a class-specifier, then we
8679 will commit to the parse at that point, because we cannot
8680 undo the action that is done when creating a new class. So,
8681 then we cannot back up and do a postfix-expression.
8683 Another tricky case is the following (c++/29234):
8685 struct S { void operator () (); };
8687 void foo ()
8688 {
8689 ( S()() );
8690 }
8692 As a type-id we parse the parenthesized S()() as a function
8693 returning a function, groktypename complains and we cannot
8694 back up in this case either.
8696 Therefore, we scan ahead to the closing `)', and check to see
8697 if the tokens after the `)' can start a cast-expression. Otherwise
8698 we are dealing with an unary-expression, a postfix-expression
8699 or something else.
8701 Yet another tricky case, in C++11, is the following (c++/54891):
8703 (void)[]{};
8705 The issue is that usually, besides the case of lambda-expressions,
8706 the parenthesized type-id cannot be followed by '[', and, eg, we
8707 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8708 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8709 we don't commit, we try a cast-expression, then an unary-expression.
8711 Save tokens so that we can put them back. */
8714 /* We may be looking at a cast-expression. */
8717 cast_expression
8720 /* Roll back the tokens we skipped. */
8722 /* If we aren't looking at a cast-expression, simulate an error so
8723 that the call to cp_parser_error_occurred below returns true. */
8726 else
8727 {
8730 /* Look for the type-id. */
8732 /* Look for the closing `)'. */
8735 }
8737 /* Restore the saved message. */
8740 /* At this point this can only be either a cast or a
8741 parenthesized ctor such as `(T ())' that looks like a cast to
8742 function returning T. */
8744 {
8745 /* Only commit if the cast-expression doesn't start with
8746 '++', '--', or '[' in C++11. */
8754 pidk);
8757 {
8758 /* Warn about old-style casts, if so requested. */
8765 /* Only type conversions to integral or enumeration types
8766 can be used in constant-expressions. */
8769 NIC_CAST))
8772 /* Perform the cast. */
8773 /* Make a location:
8774 (TYPE) EXPR
8775 ^~~~~~~~~~~
8776 with start==caret at the open paren, extending to the
8777 end of "expr". */
8779 open_paren_loc,
8783 }
8784 }
8785 else
8787 }
8789 /* If we get here, then it's not a cast, so it must be a
8790 unary-expression. */
8793 }
8795 /* Parse a binary expression of the general form:
8797 pm-expression:
8798 cast-expression
8799 pm-expression .* cast-expression
8800 pm-expression ->* cast-expression
8802 multiplicative-expression:
8803 pm-expression
8804 multiplicative-expression * pm-expression
8805 multiplicative-expression / pm-expression
8806 multiplicative-expression % pm-expression
8808 additive-expression:
8809 multiplicative-expression
8810 additive-expression + multiplicative-expression
8811 additive-expression - multiplicative-expression
8813 shift-expression:
8814 additive-expression
8815 shift-expression << additive-expression
8816 shift-expression >> additive-expression
8818 relational-expression:
8819 shift-expression
8820 relational-expression < shift-expression
8821 relational-expression > shift-expression
8822 relational-expression <= shift-expression
8823 relational-expression >= shift-expression
8825 GNU Extension:
8827 relational-expression:
8828 relational-expression <? shift-expression
8829 relational-expression >? shift-expression
8831 equality-expression:
8832 relational-expression
8833 equality-expression == relational-expression
8834 equality-expression != relational-expression
8836 and-expression:
8837 equality-expression
8838 and-expression & equality-expression
8840 exclusive-or-expression:
8841 and-expression
8842 exclusive-or-expression ^ and-expression
8844 inclusive-or-expression:
8845 exclusive-or-expression
8846 inclusive-or-expression | exclusive-or-expression
8848 logical-and-expression:
8849 inclusive-or-expression
8850 logical-and-expression && inclusive-or-expression
8852 logical-or-expression:
8853 logical-and-expression
8854 logical-or-expression || logical-and-expression
8856 All these are implemented with a single function like:
8858 binary-expression:
8859 simple-cast-expression
8860 binary-expression <token> binary-expression
8862 CAST_P is true if this expression is the target of a cast.
8864 The binops_by_token map is used to get the tree codes for each <token> type.
8865 binary-expressions are associated according to a precedence table. */
8867 #define TOKEN_PRECEDENCE(token) \
8868 (((token->type == CPP_GREATER \
8869 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8870 && !parser->greater_than_is_operator_p) \
8871 ? PREC_NOT_OPERATOR \
8872 : binops_by_token[token->type].prec)
8874 static cp_expr
8880 {
8881 cp_parser_expression_stack stack;
8883 cp_parser_expression_stack_entry current;
8884 cp_expr rhs;
8888 tree overload;
8890 /* Parse the first expression. */
8901 {
8902 /* Get an operator token. */
8908 {
8910 "%<>>%> operator is treated"
8914 }
8919 /* This is a fold-expression; handle it later. */
8922 /* Popping an entry off the stack means we completed a subexpression:
8923 - either we found a token which is not an operator (`>' where it is not
8924 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8925 will happen repeatedly;
8926 - or, we found an operator which has lower priority. This is the case
8927 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8928 parsing `3 * 4'. */
8930 {
8933 else
8935 }
8937 get_rhs:
8941 /* We used the operator token. */
8944 /* For "false && x" or "true || x", x will never be executed;
8945 disable warnings while evaluating it. */
8947 c_inhibit_evaluation_warnings +=
8950 c_inhibit_evaluation_warnings +=
8953 /* Extract another operand. It may be the RHS of this expression
8954 or the LHS of a new, higher priority expression. */
8959 /* Get another operator token. Look up its precedence to avoid
8960 building a useless (immediately popped) stack entry for common
8961 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8968 {
8969 /* ... and prepare to parse the RHS of the new, higher priority
8970 expression. Since precedence levels on the stack are
8971 monotonically increasing, we do not have to care about
8972 stack overflows. */
8981 pop:
8983 /* If the stack is not empty, we have parsed into LHS the right side
8984 (`4' in the example above) of an expression we had suspended.
8985 We can use the information on the stack to recover the LHS (`3')
8986 from the stack together with the tree code (`MULT_EXPR'), and
8987 the precedence of the higher level subexpression
8988 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8989 which will be used to actually build the additive expression. */
8994 }
8996 /* Undo the disabling of warnings done above. */
8998 c_inhibit_evaluation_warnings -=
9001 c_inhibit_evaluation_warnings -=
9007 /* Avoid warning for !!x == y. */
9012 /* Avoid warning for !b == y where b is boolean. */
9016 /* Avoid warning for !!b == y where b is boolean. */
9029 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9030 ERROR_MARK for everything that is not a binary expression.
9031 This makes warn_about_parentheses miss some warnings that
9032 involve unary operators. For unary expressions we should
9033 pass the correct tree_code unless the unary expression was
9034 surrounded by parentheses.
9035 */
9042 == tcc_comparison
9045 else
9046 {
9051 /* TODO: build_x_binary_op doesn't always honor the location. */
9053 }
9056 /* If the binary operator required the use of an overloaded operator,
9057 then this expression cannot be an integral constant-expression.
9058 An overloaded operator can be used even if both operands are
9059 otherwise permissible in an integral constant-expression if at
9060 least one of the operands is of enumeration type. */
9064 NIC_OVERLOADED))
9066 }
9069 }
9071 static cp_expr
9076 {
9079 }
9081 /* Parse the `? expression : assignment-expression' part of a
9082 conditional-expression. The LOGICAL_OR_EXPR is the
9083 logical-or-expression that started the conditional-expression.
9084 Returns a representation of the entire conditional-expression.
9086 This routine is used by cp_parser_assignment_expression.
9088 ? expression : assignment-expression
9090 GNU Extensions:
9092 ? : assignment-expression */
9094 static tree
9096 {
9098 cp_expr assignment_expr;
9102 /* Consume the `?' token. */
9107 {
9110 /* Implicit true clause. */
9112 c_inhibit_evaluation_warnings +=
9115 }
9116 else
9117 {
9120 /* Parse the expression. */
9121 c_inhibit_evaluation_warnings +=
9124 c_inhibit_evaluation_warnings +=
9128 }
9130 /* The next token should be a `:'. */
9132 /* Parse the assignment-expression. */
9134 c_inhibit_evaluation_warnings -=
9137 /* Make a location:
9138 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9139 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9140 with the caret at the "?", ranging from the start of
9141 the logical_or_expr to the end of the assignment_expr. */
9146 /* Build the conditional-expression. */
9148 expr,
9149 assignment_expr,
9150 tf_warning_or_error);
9151 }
9153 /* Parse an assignment-expression.
9155 assignment-expression:
9156 conditional-expression
9157 logical-or-expression assignment-operator assignment_expression
9158 throw-expression
9160 CAST_P is true if this expression is the target of a cast.
9161 DECLTYPE_P is true if this expression is the operand of decltype.
9163 Returns a representation for the expression. */
9165 static cp_expr
9168 {
9169 cp_expr expr;
9171 /* If the next token is the `throw' keyword, then we're looking at
9172 a throw-expression. */
9175 /* Otherwise, it must be that we are looking at a
9176 logical-or-expression. */
9177 else
9178 {
9179 /* Parse the binary expressions (logical-or-expression). */
9181 decltype_p,
9183 /* If the next token is a `?' then we're actually looking at a
9184 conditional-expression. */
9187 else
9188 {
9191 /* If it's an assignment-operator, we're using the second
9192 production. */
9193 enum tree_code assignment_operator
9196 {
9199 /* Parse the right-hand side of the assignment. */
9206 /* An assignment may not appear in a
9207 constant-expression. */
9209 NIC_ASSIGNMENT))
9211 /* Build the assignment expression. Its default
9212 location:
9213 LHS = RHS
9214 ~~~~^~~~~
9215 is the location of the '=' token as the
9216 caret, ranging from the start of the lhs to the
9217 end of the rhs. */
9222 assignment_operator,
9223 rhs,
9225 /* TODO: build_x_modify_expr doesn't honor the location,
9226 so we must set it here. */
9228 }
9229 }
9230 }
9233 }
9235 /* Parse an (optional) assignment-operator.
9237 assignment-operator: one of
9238 = *= /= %= += -= >>= <<= &= ^= |=
9240 GNU Extension:
9242 assignment-operator: one of
9243 <?= >?=
9245 If the next token is an assignment operator, the corresponding tree
9246 code is returned, and the token is consumed. For example, for
9247 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9248 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9249 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9250 operator, ERROR_MARK is returned. */
9252 static enum tree_code
9254 {
9258 /* Peek at the next token. */
9262 {
9308 /* Nothing else is an assignment operator. */
9310 }
9312 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9317 /* If it was an assignment operator, consume it. */
9322 }
9324 /* Parse an expression.
9326 expression:
9327 assignment-expression
9328 expression , assignment-expression
9330 CAST_P is true if this expression is the target of a cast.
9331 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9332 except possibly parenthesized or on the RHS of a comma (N3276).
9334 Returns a representation of the expression. */
9336 static cp_expr
9339 {
9344 {
9345 cp_expr assignment_expression;
9347 /* Parse the next assignment-expression. */
9348 assignment_expression
9351 /* We don't create a temporary for a call that is the immediate operand
9352 of decltype or on the RHS of a comma. But when we see a comma, we
9353 need to create a temporary for a call on the LHS. */
9358 assignment_expression
9362 /* If this is the first assignment-expression, we can just
9363 save it away. */
9366 else
9367 {
9368 /* Create a location with caret at the comma, ranging
9369 from the start of the LHS to the end of the RHS. */
9374 assignment_expression,
9377 }
9378 /* If the next token is not a comma, or we're in a fold-expression, then
9379 we are done with the expression. */
9383 /* Consume the `,'. */
9386 /* A comma operator cannot appear in a constant-expression. */
9389 }
9392 }
9394 /* Parse a constant-expression.
9396 constant-expression:
9397 conditional-expression
9399 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9400 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9401 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9402 is false, NON_CONSTANT_P should be NULL. */
9404 static cp_expr
9408 {
9412 cp_expr expression;
9414 /* It might seem that we could simply parse the
9415 conditional-expression, and then check to see if it were
9416 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9417 one that the compiler can figure out is constant, possibly after
9418 doing some simplifications or optimizations. The standard has a
9419 precise definition of constant-expression, and we must honor
9420 that, even though it is somewhat more restrictive.
9422 For example:
9424 int i[(2, 3)];
9426 is not a legal declaration, because `(2, 3)' is not a
9427 constant-expression. The `,' operator is forbidden in a
9428 constant-expression. However, GCC's constant-folding machinery
9429 will fold this operation to an INTEGER_CST for `3'. */
9431 /* Save the old settings. */
9433 saved_allow_non_integral_constant_expression_p
9436 /* We are now parsing a constant-expression. */
9438 parser->allow_non_integral_constant_expression_p
9441 /* Although the grammar says "conditional-expression", we parse an
9442 "assignment-expression", which also permits "throw-expression"
9443 and the use of assignment operators. In the case that
9444 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9445 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9446 actually essential that we look for an assignment-expression.
9447 For example, cp_parser_initializer_clauses uses this function to
9448 determine whether a particular assignment-expression is in fact
9449 constant. */
9451 /* Restore the old settings. */
9452 parser->integral_constant_expression_p
9454 parser->allow_non_integral_constant_expression_p
9457 {
9458 /* Require an rvalue constant expression here; that's what our
9459 callers expect. Reference constant expressions are handled
9460 separately in e.g. cp_parser_template_argument. */
9465 }
9468 parser->non_integral_constant_expression_p
9472 }
9474 /* Parse __builtin_offsetof.
9476 offsetof-expression:
9477 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9479 offsetof-member-designator:
9480 id-expression
9481 | offsetof-member-designator "." id-expression
9482 | offsetof-member-designator "[" expression "]"
9483 | offsetof-member-designator "->" id-expression */
9485 static cp_expr
9487 {
9489 tree type;
9490 cp_expr expr;
9491 cp_id_kind dummy;
9493 location_t finish_loc;
9495 /* We're about to accept non-integral-constant things, but will
9496 definitely yield an integral constant expression. Save and
9497 restore these values around our local parsing. */
9503 /* Consume the "__builtin_offsetof" token. */
9505 /* Consume the opening `('. */
9507 /* Parse the type-id. */
9510 /* Look for the `,'. */
9514 /* Build the (type *)null that begins the traditional offsetof macro. */
9515 tree object_ptr
9517 tf_warning_or_error);
9519 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9523 {
9526 {
9528 /* offsetof-member-designator "[" expression "]" */
9534 /* offsetof-member-designator "->" identifier */
9537 /* FALLTHRU */
9540 /* offsetof-member-designator "." identifier */
9548 /* Consume the ")" token. */
9554 /* Error. We know the following require will fail, but
9555 that gives the proper error message. */
9560 }
9561 }
9563 success:
9564 /* Make a location of the form:
9565 __builtin_offsetof (struct s, f)
9566 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9567 with caret at the type-id, ranging from the start of the
9568 "_builtin_offsetof" token to the close paren. */
9570 /* The result will be an INTEGER_CST, so we need to explicitly
9571 preserve the location. */
9574 failure:
9579 }
9581 /* Parse a trait expression.
9583 Returns a representation of the expression, the underlying type
9584 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9586 static tree
9588 {
9589 cp_trait_kind kind;
9595 {
9689 }
9691 /* Consume the token. */
9696 {
9699 }
9705 {
9708 {
9711 }
9715 }
9717 {
9719 {
9723 {
9726 }
9730 }
9731 }
9735 /* Complete the trait expression, which may mean either processing
9736 the trait expr now or saving it for template instantiation. */
9738 {
9747 }
9748 }
9750 /* Lambdas that appear in variable initializer or default argument scope
9751 get that in their mangling, so we need to record it. We might as well
9752 use the count for function and namespace scopes as well. */
9756 {
9757 tree t;
9759 };
9762 static void
9764 {
9765 tree_int ti;
9767 /* Once we're inside a function, we ignore other scopes and just push
9768 the function again so that popping works properly. */
9775 {
9776 /* Don't reset the count if we're still in the same function. */
9779 }
9780 }
9782 static void
9784 {
9787 }
9789 static void
9791 {
9794 {
9797 }
9799 }
9801 /* Parse a lambda expression.
9803 lambda-expression:
9804 lambda-introducer lambda-declarator [opt] compound-statement
9806 Returns a representation of the expression. */
9808 static cp_expr
9810 {
9812 tree type;
9820 {
9822 {
9826 }
9828 }
9830 {
9832 {
9835 }
9837 }
9839 /* We may be in the middle of deferred access check. Disable
9840 it now. */
9851 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9854 /* Now that we've started the type, add the capture fields for any
9855 explicit captures. */
9858 {
9859 /* Inside the class, surrounding template-parameter-lists do not apply. */
9860 unsigned int saved_num_template_parameter_lists
9864 bool fully_implicit_function_template_p
9868 bool auto_is_implicit_function_template_parm_p
9879 /* By virtue of defining a local class, a lambda expression has access to
9880 the private variables of enclosing classes. */
9888 {
9893 }
9895 {
9898 }
9900 /* The capture list was built up in reverse order; fix that now. */
9912 parser->fully_implicit_function_template_p
9916 parser->auto_is_implicit_function_template_parm_p
9918 }
9920 /* This field is only used during parsing of the lambda. */
9923 /* This lambda shouldn't have any proxies left at this point. */
9925 /* And now that we're done, push proxies for an enclosing lambda. */
9930 else
9938 }
9940 /* Parse the beginning of a lambda expression.
9942 lambda-introducer:
9943 [ lambda-capture [opt] ]
9945 LAMBDA_EXPR is the current representation of the lambda expression. */
9947 static void
9949 {
9950 /* Need commas after the first capture. */
9953 /* Eat the leading `['. */
9956 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9964 {
9967 }
9970 {
9972 tree capture_id;
9973 tree capture_init_expr;
9977 enum capture_kind_type
9978 {
9979 BY_COPY,
9980 BY_REFERENCE
9981 };
9985 {
9988 }
9992 else
9995 /* Possibly capture `this'. */
9997 {
10007 explicit_init_p);
10009 }
10011 /* Possibly capture `*this'. */
10014 {
10025 explicit_init_p);
10027 }
10029 /* Remember whether we want to capture as a reference or not. */
10031 {
10034 }
10036 /* Get the identifier. */
10041 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10042 delimiters, but I modified this to stop on unnested ']' as well. It
10043 was already changed to stop on unnested '}', so the
10044 "closing_parenthesis" name is no more misleading with my change. */
10045 {
10051 }
10053 /* Find the initializer for this capture. */
10057 {
10059 /* An explicit initializer exists. */
10062 "lambda capture initializers "
10068 {
10071 }
10072 }
10073 else
10074 {
10077 /* Turn the identifier into an id-expression. */
10078 capture_init_expr
10083 {
10086 }
10090 {
10093 capture_init_expr);
10097 }
10100 {
10103 capture_init_expr))
10107 }
10109 capture_init_expr
10110 = finish_id_expression
10112 capture_init_expr,
10126 {
10129 }
10130 else
10132 }
10136 {
10141 capture_id);
10145 "capture of %qD redundant with by-reference capture "
10147 }
10150 capture_id,
10151 capture_init_expr,
10153 explicit_init_p);
10154 }
10157 }
10159 /* Parse the (optional) middle of a lambda expression.
10161 lambda-declarator:
10162 < template-parameter-list [opt] >
10163 ( parameter-declaration-clause [opt] )
10164 attribute-specifier [opt]
10165 decl-specifier-seq [opt]
10166 exception-specification [opt]
10167 lambda-return-type-clause [opt]
10169 LAMBDA_EXPR is the current representation of the lambda expression. */
10171 static bool
10173 {
10174 /* 5.1.1.4 of the standard says:
10175 If a lambda-expression does not include a lambda-declarator, it is as if
10176 the lambda-declarator were ().
10177 This means an empty parameter list, no attributes, and no exception
10178 specification. */
10184 cp_decl_specifier_seq lambda_specs;
10187 /* The template-parameter-list is optional, but must begin with
10188 an opening angle if present. */
10190 {
10193 "lambda templates are only available with "
10195 else
10205 /* We just processed one more parameter list. */
10207 }
10209 /* The parameter-declaration-clause is optional (unless
10210 template-parameter-list was given), but must begin with an
10211 opening parenthesis if present. */
10213 {
10218 /* Parse parameters. */
10221 /* Default arguments shall not be specified in the
10222 parameter-declaration-clause of a lambda-declarator. */
10233 /* In the decl-specifier-seq of the lambda-declarator, each
10234 decl-specifier shall either be mutable or constexpr. */
10238 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10241 {
10246 }
10250 /* Parse optional exception specification. */
10253 /* Parse optional trailing return type. */
10255 {
10259 }
10261 /* The function parameters must be in scope all the way until after the
10262 trailing-return-type in case of decltype. */
10264 }
10268 /* Create the function call operator.
10270 Messing with declarators like this is no uglier than building up the
10271 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10272 other code. */
10273 {
10274 cp_decl_specifier_seq return_type_specs;
10276 tree fco;
10283 else
10284 /* Maybe we will deduce the return type later. */
10288 {
10292 else
10295 }
10300 sfk_none);
10305 VIRT_SPEC_UNSPECIFIED,
10306 REF_QUAL_NONE,
10307 tx_qual,
10308 exception_spec,
10314 declarator,
10315 attributes);
10317 {
10320 /* Give the object parameter a different name. */
10324 }
10326 {
10330 }
10339 }
10340 }
10342 /* Parse the body of a lambda expression, which is simply
10344 compound-statement
10346 but which requires special handling.
10347 LAMBDA_EXPR is the current representation of the lambda expression. */
10349 static void
10351 {
10356 else
10357 /* Still increment function_depth so that we don't GC in the
10358 middle of an expression. */
10362 /* Clear this in case we're in the middle of a default argument. */
10365 /* Finish the function call operator
10366 - class_specifier
10367 + late_parsing_for_member
10368 + function_definition_after_declarator
10369 + ctor_initializer_opt_and_function_body */
10370 {
10372 tree body;
10374 tree compound_stmt;
10375 tree cap;
10377 /* Let the front end know that we are going to be defining this
10378 function. */
10380 NULL_TREE,
10389 /* Push the proxies for any explicit captures. */
10396 /* 5.1.1.4 of the standard says:
10397 If a lambda-expression does not include a trailing-return-type, it
10398 is as if the trailing-return-type denotes the following type:
10399 * if the compound-statement is of the form
10400 { return attribute-specifier [opt] expression ; }
10401 the type of the returned expression after lvalue-to-rvalue
10402 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10403 (_conv.array_ 4.2), and function-to-pointer conversion
10404 (_conv.func_ 4.3);
10405 * otherwise, void. */
10407 /* In a lambda that has neither a lambda-return-type-clause
10408 nor a deducible form, errors should be reported for return statements
10409 in the body. Since we used void as the placeholder return type, parsing
10410 the body as usual will give such desired behavior. */
10414 {
10418 /* Parse tentatively in case there's more after the initial return
10419 statement. */
10430 {
10432 {
10437 }
10439 /* Will get error here if type not deduced yet. */
10443 }
10444 }
10447 {
10452 }
10456 out:
10460 /* Finish the function and generate code for it if necessary. */
10463 /* Only expand if the call op is not a template. */
10466 }
10472 else
10474 }
10476 /* Statements [gram.stmt.stmt] */
10478 /* Parse a statement.
10480 statement:
10481 labeled-statement
10482 expression-statement
10483 compound-statement
10484 selection-statement
10485 iteration-statement
10486 jump-statement
10487 declaration-statement
10488 try-block
10490 C++11:
10492 statement:
10493 labeled-statement
10494 attribute-specifier-seq (opt) expression-statement
10495 attribute-specifier-seq (opt) compound-statement
10496 attribute-specifier-seq (opt) selection-statement
10497 attribute-specifier-seq (opt) iteration-statement
10498 attribute-specifier-seq (opt) jump-statement
10499 declaration-statement
10500 attribute-specifier-seq (opt) try-block
10502 init-statement:
10503 expression-statement
10504 simple-declaration
10506 TM Extension:
10508 statement:
10509 atomic-statement
10511 IN_COMPOUND is true when the statement is nested inside a
10512 cp_parser_compound_statement; this matters for certain pragmas.
10514 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10515 is a (possibly labeled) if statement which is not enclosed in braces
10516 and has an else clause. This is used to implement -Wparentheses.
10518 CHAIN is a vector of if-else-if conditions. */
10520 static void
10523 {
10528 restart:
10531 /* There is no statement yet. */
10537 /* In obj-c++, seeing '[[' might be the either the beginning of
10538 c++11 attributes, or a nested objc-message-expression. So
10539 let's parse the c++11 attributes tentatively. */
10543 {
10546 }
10548 /* Peek at the next token. */
10550 /* Remember the location of the first token in the statement. */
10552 /* If this is a keyword, then that will often determine what kind of
10553 statement we have. */
10555 {
10559 {
10562 /* Looks like a labeled-statement with a case label.
10563 Parse the label, and then use tail recursion to parse
10564 the statement. */
10582 {
10587 }
10588 else
10602 {
10607 }
10608 else
10609 {
10613 }
10617 /* Objective-C++ exception-handling constructs. */
10631 /* This must be a namespace alias definition. */
10647 /* It might be a keyword like `int' that can start a
10648 declaration-statement. */
10650 }
10651 }
10653 {
10654 /* If the next token is a `:', then we are looking at a
10655 labeled-statement. */
10658 {
10659 /* Looks like a labeled-statement with an ordinary label.
10660 Parse the label, and then use tail recursion to parse
10661 the statement. */
10666 }
10667 }
10668 /* Anything that starts with a `{' must be a compound-statement. */
10671 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10672 a statement all its own. */
10674 {
10675 /* Only certain OpenMP pragmas are attached to statements, and thus
10676 are considered statements themselves. All others are not. In
10677 the context of a compound, accept the pragma as a "statement" and
10678 return so that we can check for a close brace. Otherwise we
10679 require a real statement and must go back and read one. */
10685 }
10687 {
10690 }
10692 /* Everything else must be a declaration-statement or an
10693 expression-statement. Try for the declaration-statement
10694 first, unless we are looking at a `;', in which case we know that
10695 we have an expression-statement. */
10697 {
10699 {
10701 {
10702 /* Attributes should be parsed as part of the the
10703 declaration, so let's un-parse them. */
10706 }
10709 /* Try to parse the declaration-statement. */
10711 /* If that worked, we're done. */
10714 }
10715 /* Look for an expression-statement instead. */
10718 /* Handle [[fallthrough]];. */
10720 {
10721 /* The next token after the fallthrough attribute is ';'. */
10723 {
10724 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10726 IFN_FALLTHROUGH,
10729 }
10730 else
10734 }
10735 }
10737 /* Set the line number for the statement. */
10741 /* Allow "[[fallthrough]];", but warn otherwise. */
10744 OPT_Wattributes,
10746 }
10748 /* Parse the label for a labeled-statement, i.e.
10750 identifier :
10751 case constant-expression :
10752 default :
10754 GNU Extension:
10755 case constant-expression ... constant-expression : statement
10757 When a label is parsed without errors, the label is added to the
10758 parse tree by the finish_* functions, so this function doesn't
10759 have to return the label. */
10761 static void
10763 {
10768 /* The next token should be an identifier. */
10772 {
10775 }
10777 /* Remember whether this case or a user-defined label is allowed to fall
10778 through to. */
10783 {
10785 {
10789 /* Consume the `case' token. */
10791 /* Parse the constant-expression. */
10798 {
10799 /* Consume the `...' token. */
10805 /* We don't need to emit warnings here, as the common code
10806 will do this for us. */
10807 }
10808 else
10812 {
10816 }
10817 else
10820 expr);
10821 }
10825 /* Consume the `default' token. */
10829 {
10833 }
10834 else
10839 /* Anything else must be an ordinary label. */
10844 }
10846 /* Require the `:' token. */
10849 /* An ordinary label may optionally be followed by attributes.
10850 However, this is only permitted if the attributes are then
10851 followed by a semicolon. This is because, for backward
10852 compatibility, when parsing
10853 lab: __attribute__ ((unused)) int i;
10854 we want the attribute to attach to "i", not "lab". */
10857 {
10858 tree attrs;
10865 ;
10866 else
10868 }
10874 }
10876 /* Parse an expression-statement.
10878 expression-statement:
10879 expression [opt] ;
10881 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10882 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10883 indicates whether this expression-statement is part of an
10884 expression statement. */
10886 static tree
10888 {
10893 /* There might be attribute fallthrough. */
10896 /* If the next token is a ';', then there is no expression
10897 statement. */
10899 {
10903 {
10906 }
10907 }
10909 /* Handle [[fallthrough]];. */
10911 {
10912 /* The next token after the fallthrough attribute is ';'. */
10914 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10917 else
10921 }
10923 /* Allow "[[fallthrough]];", but warn otherwise. */
10928 /* Give a helpful message for "A<T>::type t;" and the like. */
10931 {
10938 {
10939 /* A::A a; */
10944 }
10945 }
10947 /* Consume the final `;'. */
10952 /* This is the final expression statement of a statement
10953 expression. */
10959 }
10961 /* Parse a compound-statement.
10963 compound-statement:
10964 { statement-seq [opt] }
10966 GNU extension:
10968 compound-statement:
10969 { label-declaration-seq [opt] statement-seq [opt] }
10971 label-declaration-seq:
10972 label-declaration
10973 label-declaration-seq label-declaration
10975 Returns a tree representing the statement. */
10977 static tree
10980 {
10981 tree compound_stmt;
10983 /* Consume the `{'. */
10990 /* Begin the compound-statement. */
10992 /* If the next keyword is `__label__' we have a label declaration. */
10995 /* Parse an (optional) statement-seq. */
10997 /* Finish the compound-statement. */
10999 /* Consume the `}'. */
11003 }
11005 /* Parse an (optional) statement-seq.
11007 statement-seq:
11008 statement
11009 statement-seq [opt] statement */
11011 static void
11013 {
11014 /* Scan statements until there aren't any more. */
11016 {
11019 /* If we are looking at a `}', then we have run out of
11020 statements; the same is true if we have reached the end
11021 of file, or have stumbled upon a stray '@end'. */
11028 /* If we are in a compound statement and find 'else' then
11029 something went wrong. */
11031 {
11034 else
11035 {
11038 }
11039 }
11041 /* Parse the statement. */
11043 }
11044 }
11046 /* Return true if we're looking at (init; cond), false otherwise. */
11048 static bool
11050 {
11051 /* Save tokens so that we can put them back. */
11054 /* Look for ';' that is not nested in () or {}. */
11057 CPP_SEMICOLON,
11060 /* Roll back the tokens we skipped. */
11064 }
11066 /* Parse a selection-statement.
11068 selection-statement:
11069 if ( init-statement [opt] condition ) statement
11070 if ( init-statement [opt] condition ) statement else statement
11071 switch ( init-statement [opt] condition ) statement
11073 Returns the new IF_STMT or SWITCH_STMT.
11075 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11076 is a (possibly labeled) if statement which is not enclosed in
11077 braces and has an else clause. This is used to implement
11078 -Wparentheses.
11080 CHAIN is a vector of if-else-if conditions. This is used to implement
11081 -Wduplicated-cond. */
11083 static tree
11086 {
11089 token_indent_info guard_tinfo;
11094 /* Peek at the next token. */
11098 /* See what kind of keyword it is. */
11101 {
11104 {
11105 tree statement;
11106 tree condition;
11111 RID_CONSTEXPR))
11112 {
11118 }
11120 /* Look for the `('. */
11122 {
11125 }
11127 /* Begin the selection-statement. */
11129 {
11132 }
11133 else
11136 /* Parse the optional init-statement. */
11138 {
11139 tree decl;
11142 "init-statement in selection statements only available "
11145 }
11147 /* Parse the condition. */
11149 /* Look for the `)'. */
11155 {
11159 /* Add the condition. */
11166 /* Parse the then-clause. */
11170 /* Outside a template, the non-selected branch of a constexpr
11171 if is a 'discarded statement', i.e. unevaluated. */
11176 {
11179 }
11182 guard_tinfo);
11189 {
11193 }
11195 /* If the next token is `else', parse the else-clause. */
11197 RID_ELSE))
11198 {
11202 {
11205 }
11207 guard_tinfo
11209 /* Consume the `else' keyword. */
11212 {
11214 RID_IF)
11216 {
11217 /* We've got "if (COND) else if (COND2)". Start
11218 the condition chain and add COND as the first
11219 element. */
11223 {
11224 /* Wrap it in a NOP_EXPR so that we can set the
11225 location of the condition. */
11227 condition);
11230 }
11231 }
11233 RID_IF))
11234 {
11235 /* This is if-else without subsequent if. Zap the
11236 condition chain; we would have already warned at
11237 this point. */
11240 }
11241 }
11243 /* Parse the else-clause. */
11249 /* If we are currently parsing a then-clause, then
11250 IF_P will not be NULL. We set it to true to
11251 indicate that this if statement has an else clause.
11252 This may trigger the Wparentheses warning below
11253 when we get back up to the parent if statement. */
11258 {
11262 }
11263 }
11264 else
11265 {
11266 /* This if statement does not have an else clause. If
11267 NESTED_IF is true, then the then-clause has an if
11268 statement which does have an else clause. We warn
11269 about the potential ambiguity. */
11272 "suggest explicit braces to avoid ambiguous"
11275 {
11276 /* We don't need the condition chain anymore. */
11279 }
11280 }
11282 /* Now we're all done with the if-statement. */
11284 }
11285 else
11286 {
11290 /* Add the condition. */
11293 /* Parse the body of the switch-statement. */
11299 guard_tinfo);
11303 /* Now we're all done with the switch-statement. */
11305 }
11308 }
11314 }
11315 }
11317 /* Parse a condition.
11319 condition:
11320 expression
11321 type-specifier-seq declarator = initializer-clause
11322 type-specifier-seq declarator braced-init-list
11324 GNU Extension:
11326 condition:
11327 type-specifier-seq declarator asm-specification [opt]
11328 attributes [opt] = assignment-expression
11330 Returns the expression that should be tested. */
11332 static tree
11334 {
11335 cp_decl_specifier_seq type_specifiers;
11339 /* Try the declaration first. */
11341 /* New types are not allowed in the type-specifier-seq for a
11342 condition. */
11344 parser->type_definition_forbidden_message
11346 /* Parse the type-specifier-seq. */
11348 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11351 /* Restore the saved message. */
11353 /* If all is well, we might be looking at a declaration. */
11355 {
11356 tree decl;
11357 tree asm_specification;
11358 tree attributes;
11362 /* Parse the declarator. */
11368 /* Parse the attributes. */
11370 /* Parse the asm-specification. */
11372 /* If the next token is not an `=' or '{', then we might still be
11373 looking at an expression. For example:
11375 if (A(a).x)
11377 looks like a decl-specifier-seq and a declarator -- but then
11378 there is no `=', so this is an expression. */
11383 /* If we did see an `=' or '{', then we are looking at a declaration
11384 for sure. */
11386 {
11387 tree pushed_scope;
11391 /* Create the declaration. */
11397 /* Parse the initializer. */
11399 {
11403 }
11404 else
11405 {
11406 /* Consume the `='. */
11409 }
11413 /* Process the initializer. */
11416 asm_specification,
11417 flags);
11423 }
11424 }
11425 /* If we didn't even get past the declarator successfully, we are
11426 definitely not looking at a declaration. */
11427 else
11430 /* Otherwise, we are looking at an expression. */
11432 }
11434 /* Parses a for-statement or range-for-statement until the closing ')',
11435 not included. */
11437 static tree
11439 {
11443 /* Begin the for-statement. */
11446 /* Parse the initialization. */
11451 else
11453 }
11455 static tree
11457 {
11458 /* Normal for loop */
11461 tree stmt;
11464 /* The init-statement has already been parsed in
11465 cp_parser_init_statement, so no work is needed here. */
11468 /* If there's a condition, process it. */
11472 {
11476 }
11478 /* Look for the `;'. */
11481 /* If there's an expression, process it. */
11487 }
11489 /* Tries to parse a range-based for-statement:
11491 range-based-for:
11492 decl-specifier-seq declarator : expression
11494 The decl-specifier-seq declarator and the `:' are already parsed by
11495 cp_parser_init_statement. If processing_template_decl it returns a
11496 newly created RANGE_FOR_STMT; if not, it is converted to a
11497 regular FOR_STMT. */
11499 static tree
11502 {
11509 /* Get the range declaration momentarily out of the way so that
11510 the range expression doesn't clash with it. */
11512 {
11514 {
11516 /* For decomposition declaration get all of the corresponding
11517 declarations out of the way. */
11521 {
11527 {
11533 }
11534 }
11535 }
11537 {
11542 }
11543 }
11546 {
11549 }
11550 else
11553 /* Put the range declaration(s) back into scope. */
11555 {
11559 }
11561 /* If in template, STMT is converted to a normal for-statement
11562 at instantiation. If not, it is done just ahead. */
11564 {
11572 /* do_auto_deduction doesn't mess with template init-lists. */
11575 }
11576 else
11577 {
11581 }
11583 }
11585 /* Subroutine of cp_convert_range_for: given the initializer expression,
11586 builds up the range temporary. */
11588 static tree
11590 {
11593 /* Find out the type deduced by the declaration
11594 `auto &&__range = range_expr'. */
11599 /* Create the __range variable. */
11606 }
11608 /* Used by cp_parser_range_for in template context: we aren't going to
11609 do a full conversion yet, but we still need to resolve auto in the
11610 type of the for-range-declaration if present. This is basically
11611 a shortcut version of cp_convert_range_for. */
11613 static void
11615 {
11618 {
11621 iter_type = (cp_parser_perform_range_for_lookup
11624 {
11626 iter_type);
11628 tf_warning_or_error);
11631 }
11632 }
11633 }
11635 /* Converts a range-based for-statement into a normal
11636 for-statement, as per the definition.
11638 for (RANGE_DECL : RANGE_EXPR)
11639 BLOCK
11641 should be equivalent to:
11643 {
11644 auto &&__range = RANGE_EXPR;
11645 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11646 __begin != __end;
11647 ++__begin)
11648 {
11649 RANGE_DECL = *__begin;
11650 BLOCK
11651 }
11652 }
11654 If RANGE_EXPR is an array:
11655 BEGIN_EXPR = __range
11656 END_EXPR = __range + ARRAY_SIZE(__range)
11657 Else if RANGE_EXPR has a member 'begin' or 'end':
11658 BEGIN_EXPR = __range.begin()
11659 END_EXPR = __range.end()
11660 Else:
11661 BEGIN_EXPR = begin(__range)
11662 END_EXPR = end(__range);
11664 If __range has a member 'begin' but not 'end', or vice versa, we must
11665 still use the second alternative (it will surely fail, however).
11666 When calling begin()/end() in the third alternative we must use
11667 argument dependent lookup, but always considering 'std' as an associated
11668 namespace. */
11670 tree
11674 {
11680 /* If an error happened previously do nothing or else a lot of
11681 unhelpful errors would be issued. */
11683 else
11684 {
11685 tree range_temp;
11689 /* Can't bind a reference to an array of runtime bound. */
11691 else
11692 {
11697 LOOKUP_ONLYCONVERTING);
11699 }
11702 }
11704 /* The new for initialization statement. */
11712 LOOKUP_ONLYCONVERTING);
11723 LOOKUP_ONLYCONVERTING);
11727 /* The new for condition. */
11734 /* The new increment expression. */
11737 tf_warning_or_error);
11740 /* The declaration is initialized with *__begin inside the loop body. */
11743 tf_warning_or_error),
11745 LOOKUP_ONLYCONVERTING);
11750 }
11752 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11753 We need to solve both at the same time because the method used
11754 depends on the existence of members begin or end.
11755 Returns the type deduced for the iterator expression. */
11757 static tree
11759 {
11761 {
11764 }
11767 {
11772 }
11774 {
11775 /* If RANGE is an array, we will use pointer arithmetic. */
11778 range,
11782 }
11783 else
11784 {
11785 /* If it is not an array, we must do a bit of magic. */
11795 tf_warning_or_error);
11798 tf_warning_or_error);
11801 {
11802 /* Use the member functions. */
11805 else
11811 else
11814 }
11815 else
11816 {
11817 /* Use global functions with ADL. */
11824 tf_warning_or_error);
11826 tf_warning_or_error);
11828 tf_warning_or_error);
11830 tf_warning_or_error);
11833 }
11835 /* Last common checks. */
11837 {
11838 /* If one of the expressions is an error do no more checks. */
11841 }
11844 /* Can happen, when, eg, in a template context, Koenig lookup
11845 can't resolve begin/end (c++/58503). */
11847 else
11848 {
11850 /* The unqualified type of the __begin and __end temporaries should
11851 be the same, as required by the multiple auto declaration. */
11853 {
11860 /* P0184R0 allows __begin and __end to have different types,
11861 but make sure they are comparable so we can give a better
11863 else
11867 }
11869 }
11870 }
11871 }
11873 /* Helper function for cp_parser_perform_range_for_lookup.
11874 Builds a tree for RANGE.IDENTIFIER(). */
11876 static tree
11878 {
11891 tf_warning_or_error);
11894 }
11896 /* Parse an iteration-statement.
11898 iteration-statement:
11899 while ( condition ) statement
11900 do statement while ( expression ) ;
11901 for ( init-statement condition [opt] ; expression [opt] )
11902 statement
11904 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11906 static tree
11908 {
11911 tree statement;
11913 token_indent_info guard_tinfo;
11915 /* Peek at the next token. */
11922 /* Remember whether or not we are already within an iteration
11923 statement. */
11926 /* See what kind of keyword it is. */
11929 {
11931 {
11932 tree condition;
11934 /* Begin the while-statement. */
11936 /* Look for the `('. */
11938 /* Parse the condition. */
11941 /* Look for the `)'. */
11943 /* Parse the dependent statement. */
11947 /* We're done with the while-statement. */
11949 }
11953 {
11954 tree expression;
11956 /* Begin the do-statement. */
11958 /* Parse the body of the do-statement. */
11963 /* Look for the `while' keyword. */
11965 /* Look for the `('. */
11967 /* Parse the expression. */
11969 /* We're done with the do-statement. */
11971 /* Look for the `)'. */
11973 /* Look for the `;'. */
11975 }
11979 {
11980 /* Look for the `('. */
11985 /* Look for the `)'. */
11988 /* Parse the body of the for-statement. */
11993 /* We're done with the for-statement. */
11995 }
12002 }
12005 }
12007 /* Parse a init-statement or the declarator of a range-based-for.
12008 Returns true if a range-based-for declaration is seen.
12010 init-statement:
12011 expression-statement
12012 simple-declaration */
12014 static bool
12016 {
12017 /* If the next token is a `;', then we have an empty
12018 expression-statement. Grammatically, this is also a
12019 simple-declaration, but an invalid one, because it does not
12020 declare anything. Therefore, if we did not handle this case
12021 specially, we would issue an error message about an invalid
12022 declaration. */
12024 {
12028 /* A colon is used in range-based for. */
12031 /* We're going to speculatively look for a declaration, falling back
12032 to an expression, if necessary. */
12034 /* Parse the declaration. */
12037 decl);
12040 {
12041 /* It is a range-for, consume the ':' */
12045 {
12047 "range-based %<for%> loops only available with "
12050 }
12051 }
12052 else
12053 /* The ';' is not consumed yet because we told
12054 cp_parser_simple_declaration not to. */
12059 /* If the tentative parse failed, then we shall need to look for an
12060 expression-statement. */
12061 }
12062 /* If we are here, it is an expression-statement. */
12065 }
12067 /* Parse a jump-statement.
12069 jump-statement:
12070 break ;
12071 continue ;
12072 return expression [opt] ;
12073 return braced-init-list ;
12074 goto identifier ;
12076 GNU extension:
12078 jump-statement:
12079 goto * expression ;
12081 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12083 static tree
12085 {
12091 /* Peek at the next token. */
12096 /* See what kind of keyword it is. */
12099 {
12103 {
12123 }
12129 {
12136 /* Fall through. */
12146 }
12151 {
12152 tree expr;
12156 {
12160 }
12163 else
12164 /* If the next token is a `;', then there is no
12165 expression. */
12167 /* Build the return-statement. */
12170 else
12172 /* Look for the final `;'. */
12174 }
12180 {
12183 }
12185 /* Create the goto-statement. */
12187 {
12188 /* Issue a warning about this use of a GNU extension. */
12190 /* Consume the '*' token. */
12192 /* Parse the dependent expression. */
12194 }
12195 else
12197 /* Look for the final `;'. */
12204 }
12207 }
12209 /* Parse a declaration-statement.
12211 declaration-statement:
12212 block-declaration */
12214 static void
12216 {
12219 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12222 /* Parse the block-declaration. */
12225 /* Free any declarators allocated. */
12227 }
12229 /* Some dependent statements (like `if (cond) statement'), are
12230 implicitly in their own scope. In other words, if the statement is
12231 a single statement (as opposed to a compound-statement), it is
12232 none-the-less treated as if it were enclosed in braces. Any
12233 declarations appearing in the dependent statement are out of scope
12234 after control passes that point. This function parses a statement,
12235 but ensures that is in its own scope, even if it is not a
12236 compound-statement.
12238 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12239 is a (possibly labeled) if statement which is not enclosed in
12240 braces and has an else clause. This is used to implement
12241 -Wparentheses.
12243 CHAIN is a vector of if-else-if conditions. This is used to implement
12244 -Wduplicated-cond.
12246 Returns the new statement. */
12248 static tree
12252 {
12253 tree statement;
12255 token_indent_info body_tinfo
12261 /* Mark if () ; with a special NOP_EXPR. */
12263 {
12274 }
12275 /* if a compound is opened, we simply parse the statement directly. */
12278 /* If the token is not a `{', then we must take special action. */
12279 else
12280 {
12281 /* Create a compound-statement. */
12283 /* Parse the dependent-statement. */
12285 /* Finish the dummy compound-statement. */
12287 }
12289 token_indent_info next_tinfo
12293 /* Return the statement. */
12295 }
12297 /* For some dependent statements (like `while (cond) statement'), we
12298 have already created a scope. Therefore, even if the dependent
12299 statement is a compound-statement, we do not want to create another
12300 scope. */
12302 static void
12305 {
12306 /* If the token is a `{', then we must take special action. */
12308 {
12309 token_indent_info body_tinfo
12313 token_indent_info next_tinfo
12316 }
12317 else
12318 {
12319 /* Avoid calling cp_parser_compound_statement, so that we
12320 don't create a new scope. Do everything else by hand. */
12322 /* If the next keyword is `__label__' we have a label declaration. */
12325 /* Parse an (optional) statement-seq. */
12328 }
12329 }
12331 /* Declarations [gram.dcl.dcl] */
12333 /* Parse an optional declaration-sequence.
12335 declaration-seq:
12336 declaration
12337 declaration-seq declaration */
12339 static void
12341 {
12343 {
12354 {
12355 /* A declaration consisting of a single semicolon is
12356 invalid. Allow it unless we're being pedantic. */
12361 }
12363 /* If we're entering or exiting a region that's implicitly
12364 extern "C", modify the lang context appropriately. */
12366 {
12369 }
12371 {
12374 }
12377 {
12378 /* A top-level declaration can consist solely of a #pragma.
12379 A nested declaration cannot, so this is done here and not
12380 in cp_parser_declaration. (A #pragma at block scope is
12381 handled in cp_parser_statement.) */
12384 }
12386 /* Parse the declaration itself. */
12388 }
12389 }
12391 /* Parse a declaration.
12393 declaration:
12394 block-declaration
12395 function-definition
12396 template-declaration
12397 explicit-instantiation
12398 explicit-specialization
12399 linkage-specification
12400 namespace-definition
12402 C++17:
12403 deduction-guide
12405 GNU extension:
12407 declaration:
12408 __extension__ declaration */
12410 static void
12412 {
12413 cp_token token1;
12414 cp_token token2;
12419 /* Check for the `__extension__' keyword. */
12421 {
12422 /* Parse the qualified declaration. */
12424 /* Restore the PEDANTIC flag. */
12428 }
12430 /* Try to figure out what kind of declaration is present. */
12435 else
12436 {
12439 }
12441 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12444 /* If the next token is `extern' and the following token is a string
12445 literal, then we have a linkage specification. */
12449 /* If the next token is `template', then we have either a template
12450 declaration, an explicit instantiation, or an explicit
12451 specialization. */
12453 {
12454 /* `template <>' indicates a template specialization. */
12458 /* `template <' indicates a template declaration. */
12461 /* Anything else must be an explicit instantiation. */
12462 else
12464 }
12465 /* If the next token is `export', then we have a template
12466 declaration. */
12469 /* If the next token is `extern', 'static' or 'inline' and the one
12470 after that is `template', we have a GNU extended explicit
12471 instantiation directive. */
12478 /* If the next token is `namespace', check for a named or unnamed
12479 namespace definition. */
12488 /* An unnamed namespace definition. */
12492 /* An inline (associated) namespace definition. */
12496 /* Objective-C++ declaration/definition. */
12503 /* At this point we may have a template declared by a concept
12504 introduction. */
12509 else
12510 /* Try to parse a block-declaration, or a function-definition. */
12513 /* Free any declarators allocated. */
12515 }
12517 /* Parse a block-declaration.
12519 block-declaration:
12520 simple-declaration
12521 asm-definition
12522 namespace-alias-definition
12523 using-declaration
12524 using-directive
12526 GNU Extension:
12528 block-declaration:
12529 __extension__ block-declaration
12531 C++0x Extension:
12533 block-declaration:
12534 static_assert-declaration
12536 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12537 part of a declaration-statement. */
12539 static void
12542 {
12546 /* Check for the `__extension__' keyword. */
12548 {
12549 /* Parse the qualified declaration. */
12551 /* Restore the PEDANTIC flag. */
12555 }
12557 /* Peek at the next token to figure out which kind of declaration is
12558 present. */
12561 /* If the next keyword is `asm', we have an asm-definition. */
12563 {
12567 }
12568 /* If the next keyword is `namespace', we have a
12569 namespace-alias-definition. */
12572 /* If the next keyword is `using', we have a
12573 using-declaration, a using-directive, or an alias-declaration. */
12575 {
12580 /* If the token after `using' is `namespace', then we have a
12581 using-directive. */
12585 /* If the second token after 'using' is '=', then we have an
12586 alias-declaration. */
12592 /* Otherwise, it's a using-declaration. */
12593 else
12596 }
12597 /* If the next keyword is `__label__' we have a misplaced label
12598 declaration. */
12600 {
12604 /* If the next token is now a `;', consume it. */
12607 }
12608 /* If the next token is `static_assert' we have a static assertion. */
12611 /* Anything else must be a simple-declaration. */
12612 else
12615 }
12617 /* Parse a simple-declaration.
12619 simple-declaration:
12620 decl-specifier-seq [opt] init-declarator-list [opt] ;
12621 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12622 brace-or-equal-initializer ;
12624 init-declarator-list:
12625 init-declarator
12626 init-declarator-list , init-declarator
12628 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12629 function-definition as a simple-declaration.
12631 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12632 parsed declaration if it is an uninitialized single declarator not followed
12633 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12634 if present, will not be consumed. */
12636 static void
12640 {
12641 cp_decl_specifier_seq decl_specifiers;
12650 /* Defer access checks until we know what is being declared; the
12651 checks for names appearing in the decl-specifier-seq should be
12652 done as if we were in the scope of the thing being declared. */
12655 /* Parse the decl-specifier-seq. We have to keep track of whether
12656 or not the decl-specifier-seq declares a named class or
12657 enumeration type, since that is the only case in which the
12658 init-declarator-list is allowed to be empty.
12660 [dcl.dcl]
12662 In a simple-declaration, the optional init-declarator-list can be
12663 omitted only when declaring a class or enumeration, that is when
12664 the decl-specifier-seq contains either a class-specifier, an
12665 elaborated-type-specifier, or an enum-specifier. */
12667 CP_PARSER_FLAGS_OPTIONAL,
12670 /* We no longer need to defer access checks. */
12673 /* In a block scope, a valid declaration must always have a
12674 decl-specifier-seq. By not trying to parse declarators, we can
12675 resolve the declaration/expression ambiguity more quickly. */
12678 {
12681 }
12683 /* If the next two tokens are both identifiers, the code is
12684 erroneous. The usual cause of this situation is code like:
12686 T t;
12688 where "T" should name a type -- but does not. */
12691 {
12692 /* If parsing tentatively, we should commit; we really are
12693 looking at a declaration. */
12695 /* Give up. */
12697 }
12699 /* If we have seen at least one decl-specifier, and the next token
12700 is not a parenthesis, then we must be looking at a declaration.
12701 (After "int (" we might be looking at a functional cast.) */
12708 /* Look for C++17 decomposition declaration. */
12716 {
12717 tree decl
12719 maybe_range_for_decl,
12722 /* The next token should be either a `,' or a `;'. */
12724 /* If it's a `;', we are done. */
12727 /* Anything else is an error. */
12728 else
12729 {
12730 /* If we have already issued an error message we don't need
12731 to issue another one. */
12736 /* Skip tokens until we reach the end of the statement. */
12738 /* If the next token is now a `;', consume it. */
12742 }
12743 }
12744 else
12747 tree last_type;
12749 /* NULL_TREE if both variable and function declaration are allowed,
12750 error_mark_node if function declaration are not allowed and
12751 a FUNCTION_DECL that should be diagnosed if it is followed by
12752 variable declarations. */
12753 tree auto_function_declaration;
12756 auto_specifier_p
12760 /* Keep going until we hit the `;' at the end of the simple
12761 declaration. */
12764 CPP_SEMICOLON))
12765 {
12768 tree decl;
12772 {
12773 /* If we are processing next declarator, comma is expected */
12778 {
12782 }
12783 }
12784 else
12787 /* Parse the init-declarator. */
12790 function_definition_allowed_p,
12792 declares_class_or_enum,
12794 maybe_range_for_decl,
12797 /* If an error occurred while parsing tentatively, exit quickly.
12798 (That usually happens when in the body of a function; each
12799 statement is treated as a declaration-statement until proven
12800 otherwise.) */
12805 {
12806 /* If the init-declarator-list contains more than one
12807 init-declarator, they shall all form declarations of
12808 variables. */
12810 auto_function_declaration
12814 {
12816 "non-variable %qD in declaration with more than one "
12821 }
12822 }
12826 {
12830 {
12831 /* If the list of declarators contains more than one declarator,
12832 the type of each declared variable is determined as described
12833 above. If the type deduced for the template parameter U is not
12834 the same in each deduction, the program is ill-formed. */
12839 }
12840 else
12842 }
12844 /* Handle function definitions specially. */
12846 {
12847 /* If the next token is a `,', then we are probably
12848 processing something like:
12850 void f() {}, *p;
12852 which is erroneous. */
12854 {
12857 "mixing"
12859 }
12860 /* Otherwise, we're done with the list of declarators. */
12861 else
12862 {
12865 }
12866 }
12869 /* The next token should be either a `,' or a `;'. */
12871 /* If it's a `,', there are more declarators to come. */
12874 /* If it's a `;', we are done. */
12878 {
12883 }
12884 /* Anything else is an error. */
12885 else
12886 {
12887 /* If we have already issued an error message we don't need
12888 to issue another one. */
12893 /* Skip tokens until we reach the end of the statement. */
12895 /* If the next token is now a `;', consume it. */
12899 }
12900 /* After the first time around, a function-definition is not
12901 allowed -- even if it was OK at first. For example:
12903 int i, f() {}
12905 is not valid. */
12907 }
12909 /* Issue an error message if no declarators are present, and the
12910 decl-specifier-seq does not itself declare a class or
12911 enumeration: [dcl.dcl]/3. */
12913 {
12915 {
12919 /* Ensure an error is issued anyway when finish_decltype_type,
12920 called via cp_parser_decl_specifier_seq, returns a class or
12921 an enumeration (c++/51786). */
12924 }
12925 /* Perform any deferred access checks. */
12927 }
12929 /* Consume the `;'. */
12930 finish:
12934 {
12940 }
12942 done:
12944 }
12946 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
12947 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12948 initializer ; */
12950 static tree
12955 {
12960 /* Parse the identifier-list. */
12964 {
12972 }
12976 {
12982 else
12983 {
12986 }
12987 }
12993 tree pushed_scope;
13000 NULL_TREE);
13007 cp_expr e;
13008 cp_decl_specifier_seq decl_specs;
13013 {
13016 else
13019 tree elt_pushed_scope;
13025 {
13026 /* Ensure we've diagnosed redeclaration if we aren't creating
13027 a new VAR_DECL. */
13030 }
13031 else
13035 }
13038 {
13041 }
13045 {
13052 {
13056 }
13057 }
13059 {
13061 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13062 the underlying DECL. */
13064 }
13070 {
13073 }
13076 }
13078 /* Parse a decl-specifier-seq.
13080 decl-specifier-seq:
13081 decl-specifier-seq [opt] decl-specifier
13082 decl-specifier attribute-specifier-seq [opt] (C++11)
13084 decl-specifier:
13085 storage-class-specifier
13086 type-specifier
13087 function-specifier
13088 friend
13089 typedef
13091 GNU Extension:
13093 decl-specifier:
13094 attributes
13096 Concepts Extension:
13098 decl-specifier:
13099 concept
13101 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13103 The parser flags FLAGS is used to control type-specifier parsing.
13105 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13106 flags:
13108 1: one of the decl-specifiers is an elaborated-type-specifier
13109 (i.e., a type declaration)
13110 2: one of the decl-specifiers is an enum-specifier or a
13111 class-specifier (i.e., a type definition)
13113 */
13115 static void
13117 cp_parser_flags flags,
13120 {
13124 cp_decl_spec ds;
13126 /* Clear DECL_SPECS. */
13129 /* Assume no class or enumeration type is declared. */
13132 /* Keep reading specifiers until there are no more to read. */
13134 {
13139 /* Peek at the next token. */
13142 /* Save the first token of the decl spec list for error
13143 reporting. */
13146 /* Handle attributes. */
13148 {
13149 /* Parse the attributes. */
13152 /* In a sequence of declaration specifiers, c++11 attributes
13153 appertain to the type that precede them. In that case
13154 [dcl.spec]/1 says:
13156 The attribute-specifier-seq affects the type only for
13157 the declaration it appears in, not other declarations
13158 involving the same type.
13160 But for now let's force the user to position the
13161 attribute either at the beginning of the declaration or
13162 after the declarator-id, which would clearly mean that it
13163 applies to the declarator. */
13165 {
13167 /* The c++11 attribute is at the beginning of the
13168 declaration. It appertains to the entity being
13170 else
13171 {
13173 {
13174 /* This is an attribute following a
13175 class-specifier. */
13180 }
13181 else
13182 {
13183 decl_specs->std_attributes
13185 attrs);
13188 }
13190 }
13191 }
13193 decl_specs->attributes
13195 attrs);
13199 }
13200 /* Assume we will find a decl-specifier keyword. */
13202 /* If the next token is an appropriate keyword, we can simply
13203 add it to the list. */
13205 {
13206 /* decl-specifier:
13207 friend
13208 constexpr */
13211 {
13214 }
13215 else
13216 {
13218 /* Consume the token. */
13220 }
13233 /* function-specifier:
13234 inline
13235 virtual
13236 explicit */
13243 /* decl-specifier:
13244 typedef */
13247 /* Consume the token. */
13249 /* A constructor declarator cannot appear in a typedef. */
13251 /* The "typedef" keyword can only occur in a declaration; we
13252 may as well commit at this point. */
13259 /* storage-class-specifier:
13260 auto
13261 register
13262 static
13263 extern
13264 mutable
13266 GNU Extension:
13267 thread */
13270 {
13271 /* Consume the token. */
13274 /* Complain about `auto' as a storage specifier, if
13275 we're complaining about C++0x compatibility. */
13279 /* Set the storage class anyway. */
13281 token);
13282 }
13283 else
13284 /* C++0x auto type-specifier. */
13292 /* Consume the token. */
13295 token);
13298 /* Consume the token. */
13304 /* We did not yet find a decl-specifier yet. */
13307 }
13324 /* Constructors are a special case. The `S' in `S()' is not a
13325 decl-specifier; it is the beginning of the declarator. */
13326 constructor_p
13327 = (!found_decl_spec
13328 && constructor_possible_p
13329 && (cp_parser_constructor_declarator_p
13332 /* If we don't have a DECL_SPEC yet, then we must be looking at
13333 a type-specifier. */
13335 {
13338 tree type_spec;
13340 type_spec
13342 decl_specs,
13348 /* If this type-specifier referenced a user-defined type
13349 (a typedef, class-name, etc.), then we can't allow any
13350 more such type-specifiers henceforth.
13352 [dcl.spec]
13354 The longest sequence of decl-specifiers that could
13355 possibly be a type name is taken as the
13356 decl-specifier-seq of a declaration. The sequence shall
13357 be self-consistent as described below.
13359 [dcl.type]
13361 As a general rule, at most one type-specifier is allowed
13362 in the complete decl-specifier-seq of a declaration. The
13363 only exceptions are the following:
13365 -- const or volatile can be combined with any other
13366 type-specifier.
13368 -- signed or unsigned can be combined with char, long,
13369 short, or int.
13371 -- ..
13373 Example:
13375 typedef char* Pc;
13376 void g (const int Pc);
13378 Here, Pc is *not* part of the decl-specifier seq; it's
13379 the declarator. Therefore, once we see a type-specifier
13380 (other than a cv-qualifier), we forbid any additional
13381 user-defined types. We *do* still allow things like `int
13382 int' to be considered a decl-specifier-seq, and issue the
13383 error message later. */
13386 /* A constructor declarator cannot follow a type-specifier. */
13388 {
13393 }
13394 }
13396 /* If we still do not have a DECL_SPEC, then there are no more
13397 decl-specifiers. */
13402 /* After we see one decl-specifier, further decl-specifiers are
13403 always optional. */
13405 }
13407 /* Don't allow a friend specifier with a class definition. */
13412 }
13414 /* Parse an (optional) storage-class-specifier.
13416 storage-class-specifier:
13417 auto
13418 register
13419 static
13420 extern
13421 mutable
13423 GNU Extension:
13425 storage-class-specifier:
13426 thread
13428 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13430 static tree
13432 {
13434 {
13438 /* Fall through for C++98. */
13446 /* Consume the token. */
13451 }
13452 }
13454 /* Parse an (optional) function-specifier.
13456 function-specifier:
13457 inline
13458 virtual
13459 explicit
13461 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13462 Updates DECL_SPECS, if it is non-NULL. */
13464 static tree
13467 {
13470 {
13476 /* 14.5.2.3 [temp.mem]
13478 A member function template shall not be virtual. */
13482 else
13492 }
13494 /* Consume the token. */
13496 }
13498 /* Parse a linkage-specification.
13500 linkage-specification:
13501 extern string-literal { declaration-seq [opt] }
13502 extern string-literal declaration */
13504 static void
13506 {
13507 tree linkage;
13509 /* Look for the `extern' keyword. */
13512 /* Look for the string-literal. */
13515 /* Transform the literal into an identifier. If the literal is a
13516 wide-character string, or contains embedded NULs, then we can't
13517 handle it as the user wants. */
13520 {
13522 /* Assume C++ linkage. */
13524 }
13525 else
13528 /* We're now using the new linkage. */
13531 /* If the next token is a `{', then we're using the first
13532 production. */
13534 {
13538 /* Consume the `{' token. */
13540 /* Parse the declarations. */
13542 /* Look for the closing `}'. */
13544 }
13545 /* Otherwise, there's just one declaration. */
13546 else
13547 {
13550 saved_in_unbraced_linkage_specification_p
13554 parser->in_unbraced_linkage_specification_p
13556 }
13558 /* We're done with the linkage-specification. */
13560 }
13562 /* Parse a static_assert-declaration.
13564 static_assert-declaration:
13565 static_assert ( constant-expression , string-literal ) ;
13566 static_assert ( constant-expression ) ; (C++1Z)
13568 If MEMBER_P, this static_assert is a class member. */
13570 static void
13572 {
13573 tree condition;
13574 tree message;
13576 location_t saved_loc;
13579 /* Peek at the `static_assert' token so we can keep track of exactly
13580 where the static assertion started. */
13584 /* Look for the `static_assert' keyword. */
13586 RT_STATIC_ASSERT))
13589 /* We know we are in a static assertion; commit to any tentative
13590 parse. */
13594 /* Parse the `(' starting the static assertion condition. */
13597 /* Parse the constant-expression. Allow a non-constant expression
13598 here in order to give better diagnostics in finish_static_assert. */
13599 condition =
13605 {
13608 "static_assert without a message "
13610 /* Eat the ')' */
13615 }
13616 else
13617 {
13618 /* Parse the separating `,'. */
13621 /* Parse the string-literal message. */
13626 /* A `)' completes the static assertion. */
13632 }
13634 /* A semicolon terminates the declaration. */
13637 /* Complete the static assertion, which may mean either processing
13638 the static assert now or saving it for template instantiation. */
13640 }
13642 /* Parse the expression in decltype ( expression ). */
13644 static tree
13647 {
13649 tree expr;
13651 /* Since we're going to preserve any side-effects from this parse, set up a
13652 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13653 in the expression. */
13656 /* First, try parsing an id-expression. */
13667 {
13670 cp_id_kind idk;
13674 /* Lookup the name we got back from the id-expression. */
13684 {
13685 /* Complete lookup of the id-expression. */
13686 expr = (finish_id_expression
13699 /* We found an id-expression, but it was something that we
13700 should not have found. This is an error, not something
13701 we can recover from, so note that we found an
13702 id-expression and we'll recover as gracefully as
13703 possible. */
13705 }
13710 /* We have an id-expression. */
13712 }
13715 {
13716 /* Abort the id-expression parse. */
13719 /* Parsing tentatively, again. */
13722 /* Parse a class member access. */
13730 /* We have an id-expression. */
13732 }
13735 /* We have parsed the complete id-expression or member access. */
13737 else
13738 {
13739 /* Abort our attempt to parse an id-expression or member access
13740 expression. */
13743 /* Parse a full expression. */
13746 }
13749 }
13751 /* Parse a `decltype' type. Returns the type.
13753 simple-type-specifier:
13754 decltype ( expression )
13755 C++14 proposal:
13756 decltype ( auto ) */
13758 static tree
13760 {
13761 tree expr;
13770 {
13771 /* Already parsed. */
13774 }
13776 /* Look for the `decltype' token. */
13780 /* Parse the opening `('. */
13784 /* decltype (auto) */
13787 {
13794 }
13796 /* Types cannot be defined in a `decltype' expression. Save away the
13797 old message. */
13800 /* And create the new one. */
13801 parser->type_definition_forbidden_message
13804 /* The restrictions on constant-expressions do not apply inside
13805 decltype expressions. */
13806 saved_integral_constant_expression_p
13808 saved_non_integral_constant_expression_p
13812 /* Within a parenthesized expression, a `>' token is always
13813 the greater-than operator. */
13814 saved_greater_than_is_operator_p
13818 /* Do not actually evaluate the expression. */
13821 /* Do not warn about problems with the expression. */
13826 /* Go back to evaluating expressions. */
13830 /* The `>' token might be the end of a template-id or
13831 template-parameter-list now. */
13832 parser->greater_than_is_operator_p
13835 /* Restore the old message and the integral constant expression
13836 flags. */
13838 parser->integral_constant_expression_p
13840 parser->non_integral_constant_expression_p
13843 /* Parse to the closing `)'. */
13845 {
13849 }
13852 tf_warning_or_error);
13854 rewrite:
13855 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13856 it again. */
13865 }
13867 /* Special member functions [gram.special] */
13869 /* Parse a conversion-function-id.
13871 conversion-function-id:
13872 operator conversion-type-id
13874 Returns an IDENTIFIER_NODE representing the operator. */
13876 static tree
13878 {
13879 tree type;
13880 tree saved_scope;
13881 tree saved_qualifying_scope;
13882 tree saved_object_scope;
13885 /* Look for the `operator' token. */
13888 /* When we parse the conversion-type-id, the current scope will be
13889 reset. However, we need that information in able to look up the
13890 conversion function later, so we save it here. */
13894 /* We must enter the scope of the class so that the names of
13895 entities declared within the class are available in the
13896 conversion-type-id. For example, consider:
13898 struct S {
13899 typedef int I;
13900 operator I();
13901 };
13903 S::operator I() { ... }
13905 In order to see that `I' is a type-name in the definition, we
13906 must be in the scope of `S'. */
13909 /* Parse the conversion-type-id. */
13911 /* Leave the scope of the class, if any. */
13914 /* Restore the saved scope. */
13918 /* If the TYPE is invalid, indicate failure. */
13922 }
13924 /* Parse a conversion-type-id:
13926 conversion-type-id:
13927 type-specifier-seq conversion-declarator [opt]
13929 Returns the TYPE specified. */
13931 static tree
13933 {
13934 tree attributes;
13935 cp_decl_specifier_seq type_specifiers;
13937 tree type_specified;
13940 /* Parse the attributes. */
13944 parser->type_definition_forbidden_message
13947 /* Parse the type-specifiers. */
13954 /* If that didn't work, stop. */
13957 /* Parse the conversion-declarator. */
13965 /* Don't give this error when parsing tentatively. This happens to
13966 work because we always parse this definitively once. */
13969 {
13971 {
13974 }
13978 }
13981 }
13983 /* Parse an (optional) conversion-declarator.
13985 conversion-declarator:
13986 ptr-operator conversion-declarator [opt]
13988 */
13992 {
13995 cp_cv_quals cv_quals;
13997 /* We don't know if there's a ptr-operator next, or not. */
13999 /* Try the ptr-operator. */
14002 /* If it worked, look for more conversion-declarators. */
14004 {
14007 /* Parse another optional declarator. */
14010 declarator = cp_parser_make_indirect_declarator
14014 }
14017 }
14019 /* Parse an (optional) ctor-initializer.
14021 ctor-initializer:
14022 : mem-initializer-list
14024 Returns TRUE iff the ctor-initializer was actually present. */
14026 static bool
14028 {
14029 /* If the next token is not a `:', then there is no
14030 ctor-initializer. */
14032 {
14033 /* Do default initialization of any bases and members. */
14038 }
14040 /* Consume the `:' token. */
14042 /* And the mem-initializer-list. */
14046 }
14048 /* Parse a mem-initializer-list.
14050 mem-initializer-list:
14051 mem-initializer ... [opt]
14052 mem-initializer ... [opt] , mem-initializer-list */
14054 static void
14056 {
14061 /* Let the semantic analysis code know that we are starting the
14062 mem-initializer-list. */
14067 /* Loop through the list. */
14069 {
14070 tree mem_initializer;
14073 /* Parse the mem-initializer. */
14075 /* If the next token is a `...', we're expanding member initializers. */
14077 {
14078 /* Consume the `...'. */
14081 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14082 can be expanded but members cannot. */
14085 {
14090 }
14092 /* Construct the pack expansion type. */
14095 }
14098 {
14102 }
14103 /* Look for a target constructor. */
14107 {
14110 {
14114 }
14116 }
14117 /* Add it to the list, unless it was erroneous. */
14119 {
14122 }
14123 /* If the next token is not a `,', we're done. */
14126 /* Consume the `,' token. */
14128 }
14130 /* Perform semantic analysis. */
14133 }
14135 /* Parse a mem-initializer.
14137 mem-initializer:
14138 mem-initializer-id ( expression-list [opt] )
14139 mem-initializer-id braced-init-list
14141 GNU extension:
14143 mem-initializer:
14144 ( expression-list [opt] )
14146 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14147 class) or FIELD_DECL (for a non-static data member) to initialize;
14148 the TREE_VALUE is the expression-list. An empty initialization
14149 list is represented by void_list_node. */
14151 static tree
14153 {
14154 tree mem_initializer_id;
14155 tree expression_list;
14156 tree member;
14159 /* Find out what is being initialized. */
14161 {
14165 }
14166 else
14167 {
14171 }
14177 {
14184 }
14185 else
14186 {
14196 }
14206 }
14208 /* Parse a mem-initializer-id.
14210 mem-initializer-id:
14211 :: [opt] nested-name-specifier [opt] class-name
14212 decltype-specifier (C++11)
14213 identifier
14215 Returns a TYPE indicating the class to be initialized for the first
14216 production (and the second in C++11). Returns an IDENTIFIER_NODE
14217 indicating the data member to be initialized for the last production. */
14219 static tree
14221 {
14225 tree id;
14229 /* `typename' is not allowed in this context ([temp.res]). */
14231 {
14233 "keyword %<typename%> not allowed in this context (a qualified "
14236 }
14237 /* Look for the optional `::' operator. */
14238 global_scope_p
14242 /* Look for the optional nested-name-specifier. The simplest way to
14243 implement:
14245 [temp.res]
14247 The keyword `typename' is not permitted in a base-specifier or
14248 mem-initializer; in these contexts a qualified name that
14249 depends on a template-parameter is implicitly assumed to be a
14250 type name.
14252 is to assume that we have seen the `typename' keyword at this
14253 point. */
14254 nested_name_specifier_p
14263 /* If there is a `::' operator or a nested-name-specifier, then we
14264 are definitely looking for a class-name. */
14269 typename_type,
14273 /* Otherwise, we could also be looking for an ordinary identifier. */
14276 /* Try a decltype-specifier. */
14278 else
14279 /* Otherwise, try a class-name. */
14283 none_type,
14287 /* If we found one, we're done. */
14290 /* Otherwise, look for an ordinary identifier. */
14292 }
14294 /* Overloading [gram.over] */
14296 /* Parse an operator-function-id.
14298 operator-function-id:
14299 operator operator
14301 Returns an IDENTIFIER_NODE for the operator which is a
14302 human-readable spelling of the identifier, e.g., `operator +'. */
14304 static cp_expr
14306 {
14307 /* Look for the `operator' keyword. */
14310 /* And then the name of the operator itself. */
14312 }
14314 /* Return an identifier node for a user-defined literal operator.
14315 The suffix identifier is chained to the operator name identifier. */
14317 tree
14319 {
14320 tree identifier;
14327 }
14329 /* Parse an operator.
14331 operator:
14332 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14333 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14334 || ++ -- , ->* -> () []
14336 GNU Extensions:
14338 operator:
14339 <? >? <?= >?=
14341 Returns an IDENTIFIER_NODE for the operator which is a
14342 human-readable spelling of the identifier, e.g., `operator +'. */
14344 static cp_expr
14346 {
14351 /* Peek at the next token. */
14356 /* Figure out which operator we have. */
14358 {
14360 {
14363 /* The keyword should be either `new' or `delete'. */
14368 else
14371 /* Consume the `new' or `delete' token. */
14374 /* Peek at the next token. */
14376 /* If it's a `[' token then this is the array variant of the
14377 operator. */
14379 {
14380 /* Consume the `[' token. */
14382 /* Look for the `]' token. */
14388 }
14389 /* Otherwise, we have the non-array variant. */
14390 else
14396 }
14543 /* Consume the `('. */
14545 /* Look for the matching `)'. */
14550 /* Consume the `['. */
14552 /* Look for the matching `]'. */
14559 /* FALLTHRU */
14568 {
14575 /* Consume the string. */
14581 {
14584 }
14585 else
14586 {
14588 /* Look for the suffix identifier. */
14593 {
14597 }
14598 else
14599 {
14602 }
14603 }
14608 {
14611 }
14614 {
14617 }
14619 {
14622 }
14624 }
14627 /* Anything else is an error. */
14629 }
14631 /* If we have selected an identifier, we need to consume the
14632 operator token. */
14635 /* Otherwise, no valid operator name was present. */
14636 else
14637 {
14640 }
14643 }
14645 /* Parse a template-declaration.
14647 template-declaration:
14648 export [opt] template < template-parameter-list > declaration
14650 If MEMBER_P is TRUE, this template-declaration occurs within a
14651 class-specifier.
14653 The grammar rule given by the standard isn't correct. What
14654 is really meant is:
14656 template-declaration:
14657 export [opt] template-parameter-list-seq
14658 decl-specifier-seq [opt] init-declarator [opt] ;
14659 export [opt] template-parameter-list-seq
14660 function-definition
14662 template-parameter-list-seq:
14663 template-parameter-list-seq [opt]
14664 template < template-parameter-list >
14666 Concept Extensions:
14668 template-parameter-list-seq:
14669 template < template-parameter-list > requires-clause [opt]
14671 requires-clause:
14672 requires logical-or-expression */
14674 static void
14676 {
14677 /* Check for `export'. */
14679 {
14680 /* Consume the `export' token. */
14682 /* Warn that we do not support `export'. */
14684 }
14687 }
14689 /* Parse a template-parameter-list.
14691 template-parameter-list:
14692 template-parameter
14693 template-parameter-list , template-parameter
14695 Returns a TREE_LIST. Each node represents a template parameter.
14696 The nodes are connected via their TREE_CHAINs. */
14698 static tree
14700 {
14705 /* The loop below parses the template parms. We first need to know
14706 the total number of template parms to be able to compute proper
14707 canonical types of each dependent type. So after the loop, when
14708 we know the total number of template parms,
14709 end_template_parm_list computes the proper canonical types and
14710 fixes up the dependent types accordingly. */
14712 {
14713 tree parameter;
14716 location_t parm_loc;
14718 /* Parse the template-parameter. */
14723 /* Add it to the list. */
14726 parm_loc,
14727 parameter,
14728 is_non_type,
14729 is_parameter_pack);
14730 else
14731 {
14734 }
14736 /* If the next token is not a `,', we're done. */
14739 /* Otherwise, consume the `,' token. */
14741 }
14744 }
14746 /* Parse a introduction-list.
14748 introduction-list:
14749 introduced-parameter
14750 introduction-list , introduced-parameter
14752 introduced-parameter:
14753 ...[opt] identifier
14755 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14756 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14757 WILDCARD_DECL will also have DECL_NAME set and token location in
14758 DECL_SOURCE_LOCATION. */
14760 static tree
14762 {
14766 {
14771 /* Build placeholder. */
14779 /* If the next token is not a `,', we're done. */
14782 /* Otherwise, consume the `,' token. */
14784 }
14786 /* Convert the vec into a TREE_VEC. */
14789 tree parm;
14795 }
14797 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14798 is an abstract declarator. */
14802 {
14807 }
14809 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14810 is an abstract declarator. */
14814 {
14818 else
14820 }
14822 /* Returns true if DECL represents a constrained-parameter. */
14826 {
14831 }
14833 /* Returns true if PARM declares a constrained-parameter. */
14837 {
14839 }
14841 /* Check that the type parameter is only a declarator-id, and that its
14842 type is not cv-qualified. */
14844 bool
14847 {
14852 {
14855 }
14857 /* Don't allow cv-qualified type parameters. */
14860 {
14863 }
14866 }
14868 /* Finish parsing/processing a template type parameter and checking
14869 various restrictions. */
14873 tree id,
14875 {
14878 else
14880 }
14882 static tree
14884 {
14885 /* FIXME: This should probably be copied, and we may need to adjust
14886 the template parameter depths. */
14896 }
14898 /* Finish parsing/processing a template template parameter by borrowing
14899 the template parameter list from the prototype parameter. */
14901 static tree
14903 tree proto,
14904 tree id,
14906 {
14910 }
14912 /* Create a new non-type template parameter from the given PARM
14913 declarator. */
14915 static tree
14918 {
14924 }
14926 /* Build a constrained template parameter based on the PARMDECL
14927 declarator. The type of PARMDECL is the constrained type, which
14928 refers to the prototype template parameter that ultimately
14929 specifies the type of the declared parameter. */
14931 static tree
14936 {
14942 /* A template parameter constrained by a variadic concept shall also
14943 be declared as a template parameter pack. */
14948 /* Build the parameter. Return an error if the declarator was invalid. */
14949 tree parm;
14954 parmdecl);
14955 else
14960 /* Finish the parameter decl and create a node attaching the
14961 default argument and constraint. */
14966 }
14968 /* Returns true if the parsed type actually represents the declaration
14969 of a type template-parameter. */
14973 {
14976 }
14979 /* Returns true if the parsed type actually represents the declaration of
14980 a template template-parameter. */
14982 static bool
14984 {
14987 }
14989 /* Parse a default argument for a type template-parameter.
14990 Note that diagnostics are handled in cp_parser_template_parameter. */
14992 static tree
14994 {
14997 /* Consume the `=' token. */
15002 /* Parse the default-argument. */
15008 {
15012 }
15015 }
15017 /* Parse a default argument for a template template-parameter. */
15019 static tree
15021 {
15026 /* Consume the `='. */
15028 /* Parse the id-expression. */
15030 /* save token before parsing the id-expression, for error
15031 reporting */
15033 tree default_argument
15041 /* If the id-expression was a template-id that refers to
15042 a template-class, we already have the declaration here,
15043 so no further lookup is needed. */
15044 ;
15045 else
15046 /* Look up the name. */
15047 default_argument
15049 none_type,
15055 /* See if the default argument is valid. */
15059 }
15061 /* Parse a template-parameter.
15063 template-parameter:
15064 type-parameter
15065 parameter-declaration
15067 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15068 the parameter. The TREE_PURPOSE is the default value, if any.
15069 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15070 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15071 set to true iff this parameter is a parameter pack. */
15073 static tree
15076 {
15079 tree parm;
15081 /* Assume it is a type parameter or a template parameter. */
15083 /* Assume it not a parameter pack. */
15085 /* Peek at the next token. */
15087 /* If it is `class' or `template', we have a type-parameter. */
15090 /* If it is `class' or `typename' we do not know yet whether it is a
15091 type parameter or a non-type parameter. Consider:
15093 template <typename T, typename T::X X> ...
15095 or:
15097 template <class C, class D*> ...
15099 Here, the first parameter is a type parameter, and the second is
15100 a non-type parameter. We can tell by looking at the token after
15101 the identifier -- if it is a `,', `=', or `>' then we have a type
15102 parameter. */
15104 {
15105 /* Peek at the token after `class' or `typename'. */
15107 /* If it's an ellipsis, we have a template type parameter
15108 pack. */
15111 /* If it's an identifier, skip it. */
15114 /* Now, see if the token looks like the end of a template
15115 parameter. */
15120 }
15122 /* Otherwise, it is a non-type parameter or a constrained parameter.
15124 [temp.param]
15126 When parsing a default template-argument for a non-type
15127 template-parameter, the first non-nested `>' is taken as the end
15128 of the template parameter-list rather than a greater-than
15129 operator. */
15130 parameter_declarator
15137 /* If the parameter declaration is marked as a parameter pack, set
15138 *IS_PARAMETER_PACK to notify the caller. */
15143 {
15144 /* Can happen in some cases of erroneous input (c++/34892). */
15146 /* Consume the `...' for better error recovery. */
15148 }
15150 // The parameter may have been constrained.
15153 parameter_declarator,
15154 is_non_type,
15155 is_parameter_pack);
15157 // Now we're sure that the parameter is a non-type parameter.
15168 }
15170 /* Parse a type-parameter.
15172 type-parameter:
15173 class identifier [opt]
15174 class identifier [opt] = type-id
15175 typename identifier [opt]
15176 typename identifier [opt] = type-id
15177 template < template-parameter-list > class identifier [opt]
15178 template < template-parameter-list > class identifier [opt]
15179 = id-expression
15181 GNU Extension (variadic templates):
15183 type-parameter:
15184 class ... identifier [opt]
15185 typename ... identifier [opt]
15187 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15188 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15189 the declaration of the parameter.
15191 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15193 static tree
15195 {
15197 tree parameter;
15199 /* Look for a keyword to tell us what kind of parameter this is. */
15205 {
15208 {
15209 tree identifier;
15210 tree default_argument;
15212 /* If the next token is an ellipsis, we have a template
15213 argument pack. */
15215 {
15216 /* Consume the `...' token. */
15221 }
15223 /* If the next token is an identifier, then it names the
15224 parameter. */
15227 else
15230 /* Create the parameter. */
15233 /* If the next token is an `=', we have a default argument. */
15235 {
15236 default_argument
15239 /* Template parameter packs cannot have default
15240 arguments. */
15242 {
15245 "template parameter pack %qD cannot have a "
15247 else
15249 "template parameter packs cannot have "
15252 }
15255 }
15256 else
15259 /* Create the combined representation of the parameter and the
15260 default argument. */
15262 }
15266 {
15267 tree identifier;
15268 tree default_argument;
15270 /* Look for the `<'. */
15272 /* Parse the template-parameter-list. */
15274 /* Look for the `>'. */
15277 // If template requirements are present, parse them.
15279 {
15284 }
15286 /* Look for the `class' or 'typename' keywords. */
15288 /* If the next token is an ellipsis, we have a template
15289 argument pack. */
15291 {
15292 /* Consume the `...' token. */
15297 }
15298 /* If the next token is an `=', then there is a
15299 default-argument. If the next token is a `>', we are at
15300 the end of the parameter-list. If the next token is a `,',
15301 then we are at the end of this parameter. */
15305 {
15307 /* Treat invalid names as if the parameter were nameless. */
15310 }
15311 else
15314 /* Create the template parameter. */
15316 identifier);
15318 /* If the next token is an `=', then there is a
15319 default-argument. */
15321 {
15322 default_argument
15325 /* Template parameter packs cannot have default
15326 arguments. */
15328 {
15331 "template parameter pack %qD cannot "
15333 identifier);
15334 else
15338 }
15339 }
15340 else
15343 /* Create the combined representation of the parameter and the
15344 default argument. */
15346 }
15352 }
15355 }
15357 /* Parse a template-id.
15359 template-id:
15360 template-name < template-argument-list [opt] >
15362 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15363 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15364 returned. Otherwise, if the template-name names a function, or set
15365 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15366 names a class, returns a TYPE_DECL for the specialization.
15368 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15369 uninstantiated templates. */
15371 static tree
15377 {
15378 tree templ;
15379 tree arguments;
15380 tree template_id;
15385 /* If the next token corresponds to a template-id, there is no need
15386 to reparse it. */
15389 {
15392 }
15394 /* Avoid performing name lookup if there is no possibility of
15395 finding a template-id. */
15398 && !cp_parser_nth_token_starts_template_argument_list_p
15400 {
15403 }
15405 /* Remember where the template-id starts. */
15411 /* Parse the template-name. */
15414 check_dependency_p,
15415 is_declaration,
15416 tag_type,
15419 {
15422 }
15424 /* Since we're going to preserve any side-effects from this parse, set up a
15425 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15426 in the template arguments. */
15429 /* If we find the sequence `[:' after a template-name, it's probably
15430 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15431 parse correctly the argument list. */
15438 {
15440 /* Change `:' into `::'. */
15442 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15443 CPP_LESS. */
15446 /* Parse the arguments. */
15449 {
15450 /* If we couldn't parse an argument list, then we revert our changes
15451 and return simply an error. Maybe this is not a template-id
15452 after all. */
15457 }
15458 /* Otherwise, emit an error about the invalid digraph, but continue
15459 parsing because we got our argument list. */
15462 {
15465 "%<<:%> is an alternate spelling for %<[%>."
15468 {
15470 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15473 }
15474 }
15475 }
15476 else
15477 {
15478 /* Look for the `<' that starts the template-argument-list. */
15480 {
15483 }
15484 /* Parse the arguments. */
15486 }
15488 /* Build a representation of the specialization. */
15491 TEMPLATE_ID_EXPR,
15495 {
15497 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15498 template (rather than some instantiation thereof) only if
15499 is not nested within some other construct. For example, in
15500 "template <typename T> void f(T) { A<T>::", A<T> is just an
15501 instantiation of A. */
15504 CPP_SCOPE));
15505 template_id
15507 }
15508 /* A template-like identifier may be a partial concept id. */
15514 {
15518 }
15519 else
15520 {
15521 /* If it's not a class-template or a template-template, it should be
15522 a function-template. */
15530 }
15532 /* If parsing tentatively, replace the sequence of tokens that makes
15533 up the template-id with a CPP_TEMPLATE_ID token. That way,
15534 should we re-parse the token stream, we will not have to repeat
15535 the effort required to do the parse, nor will we issue duplicate
15536 error messages about problems during instantiation of the
15537 template. */
15539 /* Don't do this if we had a parse error in a declarator; re-parsing
15540 might succeed if a name changes meaning (60361). */
15544 {
15547 /* Reset the contents of the START_OF_ID token. */
15550 /* Update the location to be of the form:
15551 template-name < template-argument-list [opt] >
15552 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15553 with caret == start at the start of the template-name,
15554 ranging until the closing '>'. */
15555 location_t finish_loc
15557 location_t combined_loc
15561 /* Retrieve any deferred checks. Do not pop this access checks yet
15562 so the memory will not be reclaimed during token replacing below. */
15568 /* Purge all subsequent tokens. */
15571 /* ??? Can we actually assume that, if template_id ==
15572 error_mark_node, we will have issued a diagnostic to the
15573 user, as opposed to simply marking the tentative parse as
15574 failed? */
15577 }
15581 }
15583 /* Parse a template-name.
15585 template-name:
15586 identifier
15588 The standard should actually say:
15590 template-name:
15591 identifier
15592 operator-function-id
15594 A defect report has been filed about this issue.
15596 A conversion-function-id cannot be a template name because they cannot
15597 be part of a template-id. In fact, looking at this code:
15599 a.operator K<int>()
15601 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15602 It is impossible to call a templated conversion-function-id with an
15603 explicit argument list, since the only allowed template parameter is
15604 the type to which it is converting.
15606 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15607 `template' keyword, in a construction like:
15609 T::template f<3>()
15611 In that case `f' is taken to be a template-name, even though there
15612 is no way of knowing for sure.
15614 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15615 name refers to a set of overloaded functions, at least one of which
15616 is a template, or an IDENTIFIER_NODE with the name of the template,
15617 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15618 names are looked up inside uninstantiated templates. */
15620 static tree
15627 {
15628 tree identifier;
15629 tree decl;
15630 tree fns;
15633 /* If the next token is `operator', then we have either an
15634 operator-function-id or a conversion-function-id. */
15636 {
15637 /* We don't know whether we're looking at an
15638 operator-function-id or a conversion-function-id. */
15640 /* Try an operator-function-id. */
15642 /* If that didn't work, try a conversion-function-id. */
15644 {
15647 }
15648 }
15649 /* Look for the identifier. */
15650 else
15653 /* If we didn't find an identifier, we don't have a template-id. */
15657 /* If the name immediately followed the `template' keyword, then it
15658 is a template-name. However, if the next token is not `<', then
15659 we do not treat it as a template-name, since it is not being used
15660 as part of a template-id. This enables us to handle constructs
15661 like:
15663 template <typename T> struct S { S(); };
15664 template <typename T> S<T>::S();
15666 correctly. We would treat `S' as a template -- if it were `S<T>'
15667 -- but we do not if there is no `<'. */
15671 {
15672 /* In a declaration, in a dependent context, we pretend that the
15673 "template" keyword was present in order to improve error
15674 recovery. For example, given:
15676 template <typename T> void f(T::X<int>);
15678 we want to treat "X<int>" as a template-id. */
15680 && !template_keyword_p
15682 && check_dependency_p
15684 /* Do not do this for dtors (or ctors), since they never
15685 need the template keyword before their name. */
15687 {
15690 /* Explain what went wrong. */
15692 identifier);
15695 /* If parsing tentatively, find the location of the "<" token. */
15698 /* Parse the template arguments so that we can issue error
15699 messages about them. */
15702 /* Skip tokens until we find a good place from which to
15703 continue parsing. */
15708 /* If parsing tentatively, permanently remove the
15709 template argument list. That will prevent duplicate
15710 error messages from being issued about the missing
15711 "template" keyword. */
15718 }
15720 /* If the "template" keyword is present, then there is generally
15721 no point in doing name-lookup, so we just return IDENTIFIER.
15722 But, if the qualifying scope is non-dependent then we can
15723 (and must) do name-lookup normally. */
15728 {
15729 /* We're optimizing away the call to cp_parser_lookup_name, but we
15730 still need to do this. */
15733 }
15734 }
15736 /* Look up the name. */
15738 tag_type,
15741 check_dependency_p,
15747 /* If DECL is a template, then the name was a template-name. */
15749 {
15753 }
15754 else
15755 {
15758 /* The standard does not explicitly indicate whether a name that
15759 names a set of overloaded declarations, some of which are
15760 templates, is a template-name. However, such a name should
15761 be a template-name; otherwise, there is no way to form a
15762 template-id for the overloaded templates. */
15770 {
15771 /* The name does not name a template. */
15774 }
15775 }
15777 /* If DECL is dependent, and refers to a function, then just return
15778 its name; we will look it up again during template instantiation. */
15780 {
15784 }
15787 }
15789 /* Parse a template-argument-list.
15791 template-argument-list:
15792 template-argument ... [opt]
15793 template-argument-list , template-argument ... [opt]
15795 Returns a TREE_VEC containing the arguments. */
15797 static tree
15799 {
15804 tree vec;
15811 /* Even if the template-id appears in an integral
15812 constant-expression, the contents of the argument list do
15813 not. */
15819 /* Parse the arguments. */
15820 do
15821 {
15822 tree argument;
15825 /* Consume the comma. */
15828 /* Parse the template-argument. */
15831 /* If the next token is an ellipsis, we're expanding a template
15832 argument pack. */
15834 {
15836 {
15840 }
15841 /* Consume the `...' token. */
15844 /* Make the argument into a TYPE_PACK_EXPANSION or
15845 EXPR_PACK_EXPANSION. */
15847 }
15850 {
15854 {
15857 }
15858 else
15860 }
15862 }
15878 }
15880 /* Parse a template-argument.
15882 template-argument:
15883 assignment-expression
15884 type-id
15885 id-expression
15887 The representation is that of an assignment-expression, type-id, or
15888 id-expression -- except that the qualified id-expression is
15889 evaluated, so that the value returned is either a DECL or an
15890 OVERLOAD.
15892 Although the standard says "assignment-expression", it forbids
15893 throw-expressions or assignments in the template argument.
15894 Therefore, we use "conditional-expression" instead. */
15896 static tree
15898 {
15899 tree argument;
15905 cp_id_kind idk;
15907 /* There's really no way to know what we're looking at, so we just
15908 try each alternative in order.
15910 [temp.arg]
15912 In a template-argument, an ambiguity between a type-id and an
15913 expression is resolved to a type-id, regardless of the form of
15914 the corresponding template-parameter.
15916 Therefore, we try a type-id first. */
15919 /* If there was no error parsing the type-id but the next token is a
15920 '>>', our behavior depends on which dialect of C++ we're
15921 parsing. In C++98, we probably found a typo for '> >'. But there
15922 are type-id which are also valid expressions. For instance:
15924 struct X { int operator >> (int); };
15925 template <int V> struct Foo {};
15926 Foo<X () >> 5> r;
15928 Here 'X()' is a valid type-id of a function type, but the user just
15929 wanted to write the expression "X() >> 5". Thus, we remember that we
15930 found a valid type-id, but we still try to parse the argument as an
15931 expression to see what happens.
15933 In C++0x, the '>>' will be considered two separate '>'
15934 tokens. */
15938 {
15941 }
15942 else
15943 {
15944 /* If the next token isn't a `,' or a `>', then this argument wasn't
15945 really finished. This means that the argument is not a valid
15946 type-id. */
15949 /* If that worked, we're done. */
15952 }
15953 /* We're still not sure what the argument will be. */
15955 /* Try a template. */
15963 /* If the next token isn't a `,' or a `>', then this argument wasn't
15964 really finished. */
15968 {
15969 /* Figure out what is being referred to. If the id-expression
15970 was for a class template specialization, then we will have a
15971 TYPE_DECL at this point. There is no need to do name lookup
15972 at this point in that case. */
15975 none_type,
15981 /* Handle a constrained-type-specifier for a non-type template
15982 parameter. */
15988 }
15990 {
15994 }
15995 /* It must be a non-type argument. In C++17 any constant-expression is
15996 allowed. */
16000 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16002 -- an integral constant-expression of integral or enumeration
16003 type; or
16005 -- the name of a non-type template-parameter; or
16007 -- the name of an object or function with external linkage...
16009 -- the address of an object or function with external linkage...
16011 -- a pointer to member... */
16012 /* Look for a non-type template parameter. */
16014 {
16026 }
16028 /* If the next token is "&", the argument must be the address of an
16029 object or function with external linkage. */
16032 {
16035 }
16036 /* See if we might have an id-expression. */
16043 {
16046 address_p,
16053 else
16054 {
16055 tree probe;
16058 {
16059 /* Strip the dereference temporarily. */
16062 }
16064 /* If we're in a template, we represent a qualified-id referring
16065 to a static data member as a SCOPE_REF even if the scope isn't
16066 dependent so that we can check access control later. */
16071 {
16072 /* A variable without external linkage might still be a
16073 valid constant-expression, so no error is issued here
16074 if the external-linkage check fails. */
16077 }
16079 /* All overloaded functions are allowed; if the external
16080 linkage test does not pass, an error will be issued
16081 later. */
16082 ;
16086 /* A pointer-to-member. */
16087 ;
16089 ;
16090 else
16094 {
16097 tf_warning_or_error);
16098 else
16101 }
16102 }
16103 }
16104 /* If the argument started with "&", there are no other valid
16105 alternatives at this point. */
16107 {
16110 }
16112 general_expr:
16113 /* If the argument wasn't successfully parsed as a type-id followed
16114 by '>>', the argument can only be a constant expression now.
16115 Otherwise, we try parsing the constant-expression tentatively,
16116 because the argument could really be a type-id. */
16122 else
16123 {
16124 /* With C++17 generalized non-type template arguments we need to handle
16125 lvalue constant expressions, too. */
16128 }
16136 /* We did our best to parse the argument as a non type-id, but that
16137 was the only alternative that matched (albeit with a '>' after
16138 it). We can assume it's just a typo from the user, and a
16139 diagnostic will then be issued. */
16141 }
16143 /* Parse an explicit-instantiation.
16145 explicit-instantiation:
16146 template declaration
16148 Although the standard says `declaration', what it really means is:
16150 explicit-instantiation:
16151 template decl-specifier-seq [opt] declarator [opt] ;
16153 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16154 supposed to be allowed. A defect report has been filed about this
16155 issue.
16157 GNU Extension:
16159 explicit-instantiation:
16160 storage-class-specifier template
16161 decl-specifier-seq [opt] declarator [opt] ;
16162 function-specifier template
16163 decl-specifier-seq [opt] declarator [opt] ; */
16165 static void
16167 {
16169 cp_decl_specifier_seq decl_specifiers;
16174 /* Look for an (optional) storage-class-specifier or
16175 function-specifier. */
16177 {
16178 extension_specifier
16181 extension_specifier
16184 }
16186 /* Look for the `template' keyword. */
16188 /* Let the front end know that we are processing an explicit
16189 instantiation. */
16191 /* [temp.explicit] says that we are supposed to ignore access
16192 control while processing explicit instantiation directives. */
16194 /* Parse a decl-specifier-seq. */
16196 CP_PARSER_FLAGS_OPTIONAL,
16199 /* If there was exactly one decl-specifier, and it declared a class,
16200 and there's no declarator, then we have an explicit type
16201 instantiation. */
16203 {
16204 tree type;
16208 /* Turn access control back on for names used during
16209 template instantiation. */
16214 }
16215 else
16216 {
16218 tree decl;
16220 /* Parse the declarator. */
16221 declarator
16232 {
16235 "explicit instantiation shall not use"
16239 "explicit instantiation shall not use"
16244 /* Turn access control back on for names used during
16245 template instantiation. */
16247 /* Do the explicit instantiation. */
16249 }
16250 else
16251 {
16253 /* Skip the body of the explicit instantiation. */
16255 }
16256 }
16257 /* We're done with the instantiation. */
16263 }
16265 /* Parse an explicit-specialization.
16267 explicit-specialization:
16268 template < > declaration
16270 Although the standard says `declaration', what it really means is:
16272 explicit-specialization:
16273 template <> decl-specifier [opt] init-declarator [opt] ;
16274 template <> function-definition
16275 template <> explicit-specialization
16276 template <> template-declaration */
16278 static void
16280 {
16284 /* Look for the `template' keyword. */
16286 /* Look for the `<'. */
16288 /* Look for the `>'. */
16290 /* We have processed another parameter list. */
16292 /* [temp]
16294 A template ... explicit specialization ... shall not have C
16295 linkage. */
16297 {
16299 /* Give it C++ linkage to avoid confusing other parts of the
16300 front end. */
16303 }
16304 else
16306 /* Let the front end know that we are beginning a specialization. */
16308 {
16311 }
16313 /* If the next keyword is `template', we need to figure out whether
16314 or not we're looking a template-declaration. */
16316 {
16321 else
16323 }
16324 else
16325 /* Parse the dependent declaration. */
16331 /* We're done with the specialization. */
16333 /* For the erroneous case of a template with C linkage, we pushed an
16334 implicit C++ linkage scope; exit that scope now. */
16337 /* We're done with this parameter list. */
16339 }
16341 /* Parse a type-specifier.
16343 type-specifier:
16344 simple-type-specifier
16345 class-specifier
16346 enum-specifier
16347 elaborated-type-specifier
16348 cv-qualifier
16350 GNU Extension:
16352 type-specifier:
16353 __complex__
16355 Returns a representation of the type-specifier. For a
16356 class-specifier, enum-specifier, or elaborated-type-specifier, a
16357 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16359 The parser flags FLAGS is used to control type-specifier parsing.
16361 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16362 in a decl-specifier-seq.
16364 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16365 class-specifier, enum-specifier, or elaborated-type-specifier, then
16366 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16367 if a type is declared; 2 if it is defined. Otherwise, it is set to
16368 zero.
16370 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16371 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16372 is set to FALSE. */
16374 static tree
16376 cp_parser_flags flags,
16381 {
16387 /* Assume this type-specifier does not declare a new type. */
16390 /* And that it does not specify a cv-qualifier. */
16393 /* Peek at the next token. */
16396 /* If we're looking at a keyword, we can use that to guide the
16397 production we choose. */
16400 {
16405 /* Look for the enum-specifier. */
16407 /* If that worked, we're done. */
16409 {
16414 type_spec,
16415 token,
16418 }
16419 else
16422 /* Any of these indicate either a class-specifier, or an
16423 elaborated-type-specifier. */
16430 /* Parse tentatively so that we can back up if we don't find a
16431 class-specifier. */
16433 /* Look for the class-specifier. */
16436 /* If that worked, we're done. */
16438 {
16443 type_spec,
16444 token,
16447 }
16449 /* Fall through. */
16450 elaborated_type_specifier:
16451 /* We're declaring (not defining) a class or enum. */
16455 /* Fall through. */
16457 /* Look for an elaborated-type-specifier. */
16458 type_spec
16459 = (cp_parser_elaborated_type_specifier
16462 is_declaration));
16465 type_spec,
16466 token,
16489 /* The `__complex__' keyword is a GNU extension. */
16495 }
16497 /* Handle simple keywords. */
16499 {
16501 {
16504 }
16506 }
16508 /* If we do not already have a type-specifier, assume we are looking
16509 at a simple-type-specifier. */
16511 decl_specs,
16512 flags);
16514 /* If we didn't find a type-specifier, and a type-specifier was not
16515 optional in this context, issue an error message. */
16517 {
16520 }
16523 }
16525 /* Parse a simple-type-specifier.
16527 simple-type-specifier:
16528 :: [opt] nested-name-specifier [opt] type-name
16529 :: [opt] nested-name-specifier template template-id
16530 char
16531 wchar_t
16532 bool
16533 short
16534 int
16535 long
16536 signed
16537 unsigned
16538 float
16539 double
16540 void
16542 C++11 Extension:
16544 simple-type-specifier:
16545 auto
16546 decltype ( expression )
16547 char16_t
16548 char32_t
16549 __underlying_type ( type-id )
16551 C++17 extension:
16553 nested-name-specifier(opt) template-name
16555 GNU Extension:
16557 simple-type-specifier:
16558 __int128
16559 __typeof__ unary-expression
16560 __typeof__ ( type-id )
16561 __typeof__ ( type-id ) { initializer-list , [opt] }
16563 Concepts Extension:
16565 simple-type-specifier:
16566 constrained-type-specifier
16568 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16569 appropriately updated. */
16571 static tree
16574 cp_parser_flags flags)
16575 {
16580 /* Peek at the next token. */
16583 /* If we're looking at a keyword, things are easy. */
16585 {
16620 {
16623 }
16652 {
16653 /* The 'auto' might be the placeholder return type for a function decl
16654 with trailing return type. */
16663 {
16665 {
16672 }
16675 {
16678 }
16681 }
16685 {
16688 }
16691 {
16694 }
16695 else
16699 {
16702 "use of %<auto%> in lambda parameter declaration "
16703 "only available with "
16705 }
16708 "use of %<auto%> in parameter declaration "
16709 "only available with "
16713 "ISO C++ forbids use of %<auto%> in parameter "
16715 }
16716 else
16721 /* Since DR 743, decltype can either be a simple-type-specifier by
16722 itself or begin a nested-name-specifier. Parsing it will replace
16723 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16724 handling below decide what to do. */
16730 /* Consume the `typeof' token. */
16732 /* Parse the operand to `typeof'. */
16734 /* If it is not already a TYPE, take its type. */
16740 token,
16749 token,
16759 token,
16764 }
16766 /* If token is an already-parsed decltype not followed by ::,
16767 it's a simple-type-specifier. */
16770 {
16773 {
16775 token,
16777 /* Remember that we are handling a decltype in order to
16778 implement the resolution of DR 1510 when the argument
16779 isn't instantiation dependent. */
16781 }
16784 }
16786 /* If the type-specifier was for a built-in type, we're done. */
16788 {
16789 /* Record the type. */
16796 type,
16797 token,
16802 /* Consume the token. */
16808 /* There is no valid C++ program where a non-template type is
16809 followed by a "<". That usually indicates that the user thought
16810 that the type was a template. */
16815 }
16817 /* The type-specifier must be a user-defined type. */
16819 {
16823 /* Don't gobble tokens or issue error messages if this is an
16824 optional type-specifier. */
16830 /* Look for the optional `::' operator. */
16831 global_p
16835 /* Look for the nested-name specifier. */
16836 qualified_p
16843 /* If we have seen a nested-name-specifier, and the next token
16844 is `template', then we are using the template-id production. */
16847 {
16848 /* Look for the template-id. */
16852 none_type,
16854 /* If the template-id did not name a type, we are out of
16855 luck. */
16857 {
16860 }
16861 }
16862 /* Otherwise, look for a type-name. */
16863 else
16865 /* Keep track of all name-lookups performed in class scopes. */
16867 && !global_p
16868 && !qualified_p
16872 /* If it didn't work out, we don't have a TYPE. */
16877 {
16891 {
16893 none_type,
16903 else
16904 {
16909 }
16910 }
16911 else
16917 }
16920 token,
16922 }
16924 /* If we didn't get a type-name, issue an error message. */
16926 {
16929 }
16932 {
16933 /* See if TYPE is an Objective-C type, and if so, parse and
16934 accept any protocol references following it. Do this before
16935 the cp_parser_check_for_invalid_template_id() call, because
16936 Objective-C types can be followed by '<...>' which would
16937 enclose protocol names rather than template arguments, and so
16938 everything is fine. */
16941 {
16945 /* Clobber the "unqualified" type previously entered into
16946 DECL_SPECS with the new, improved protocol-qualified version. */
16951 }
16953 /* There is no valid C++ program where a non-template type is
16954 followed by a "<". That usually indicates that the user
16955 thought that the type was a template. */
16957 none_type,
16959 }
16962 }
16964 /* Parse a type-name.
16966 type-name:
16967 class-name
16968 enum-name
16969 typedef-name
16970 simple-template-id [in c++0x]
16972 enum-name:
16973 identifier
16975 typedef-name:
16976 identifier
16978 Concepts:
16980 type-name:
16981 concept-name
16982 partial-concept-id
16984 concept-name:
16985 identifier
16987 Returns a TYPE_DECL for the type. */
16989 static tree
16991 {
16993 }
16995 /* See above. */
16996 static tree
16998 {
16999 tree type_decl;
17001 /* We can't know yet whether it is a class-name or not. */
17003 /* Try a class-name. */
17005 typename_keyword_p,
17007 none_type,
17011 /* If it's not a class-name, keep looking. */
17013 {
17015 /* It must be a typedef-name or an enum-name. */
17019 /* It is either a simple-template-id representing an
17020 instantiation of an alias template... */
17024 none_type,
17026 /* Note that this must be an instantiation of an alias template
17027 because [temp.names]/6 says:
17029 A template-id that names an alias template specialization
17030 is a type-name.
17032 Whereas [temp.names]/7 says:
17034 A simple-template-id that names a class template
17035 specialization is a class-name.
17037 With concepts, this could also be a partial-concept-id that
17038 declares a non-type template parameter. */
17045 else
17049 /* ... Or a typedef-name or an enum-name. */
17051 }
17054 }
17056 /* Check if DECL and ARGS can form a constrained-type-specifier.
17057 If ARGS is non-null, we try to form a concept check of the
17058 form DECL<?, ARGS> where ? is a wildcard that matches any
17059 kind of template argument. If ARGS is NULL, then we try to
17060 form a concept check of the form DECL<?>. */
17062 static tree
17065 {
17068 /* If we a constrained-type-specifier cannot be deduced. */
17072 /* A constrained type specifier can only be found in an
17073 overload set or as a reference to a template declaration.
17075 FIXME: This might be masking a bug. It's possible that
17076 that the deduction below is causing template specializations
17077 to be formed with the wildcard as an argument. */
17081 /* Try to build a call expression that evaluates the
17082 concept. This can fail if the overload set refers
17083 only to non-templates. */
17089 /* Deduce the checked constraint and the prototype parameter.
17091 FIXME: In certain cases, failure to deduce should be a
17092 diagnosable error. */
17093 tree conc;
17094 tree proto;
17098 /* In template parameter scope, this results in a constrained
17099 parameter. Return a descriptor of that parm. */
17103 /* In a parameter-declaration-clause, constrained-type
17104 specifiers result in invented template parameters. */
17106 {
17109 }
17110 else
17111 {
17112 /* Otherwise, we're in a context where the constrained
17113 type name is deduced and the constraint applies
17114 after deduction. */
17116 }
17119 }
17121 /* If DECL refers to a concept, return a TYPE_DECL representing
17122 the result of using the constrained type specifier in the
17123 current context. DECL refers to a concept if
17125 - it is an overload set containing a function concept taking a single
17126 type argument, or
17128 - it is a variable concept taking a single type argument. */
17130 static tree
17132 {
17138 else
17140 }
17142 /* Check if DECL and ARGS form a partial-concept-id. If so,
17143 assign ID to the resulting constrained placeholder.
17145 Returns true if the partial-concept-id designates a placeholder
17146 and false otherwise. Note that *id is set to NULL_TREE in
17147 this case. */
17149 static tree
17151 {
17153 }
17155 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17156 or a concept-name.
17158 enum-name:
17159 identifier
17161 typedef-name:
17162 identifier
17164 concept-name:
17165 identifier
17167 Returns a TYPE_DECL for the type. */
17169 static tree
17171 {
17172 tree type_decl;
17173 tree identifier;
17180 /* Look up the type-name. */
17185 /* If we found an overload set, then it may refer to a concept-name. */
17191 {
17192 /* See if this is an Objective-C type. */
17197 }
17199 /* Issue an error if we did not find a type-name. */
17201 /* In Objective-C, we have the complication that class names are
17202 normally type names and start declarations (eg, the
17203 "NSObject" in "NSObject *object;"), but can be used in an
17204 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17205 is an expression. So, a classname followed by a dot is not a
17206 valid type-name. */
17209 {
17214 }
17215 /* Remember that the name was used in the definition of the
17216 current class so that we can check later to see if the
17217 meaning would have been different after the class was
17218 entirely defined. */
17224 }
17226 /* Parse an elaborated-type-specifier. Note that the grammar given
17227 here incorporates the resolution to DR68.
17229 elaborated-type-specifier:
17230 class-key :: [opt] nested-name-specifier [opt] identifier
17231 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17232 enum-key :: [opt] nested-name-specifier [opt] identifier
17233 typename :: [opt] nested-name-specifier identifier
17234 typename :: [opt] nested-name-specifier template [opt]
17235 template-id
17237 GNU extension:
17239 elaborated-type-specifier:
17240 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17241 class-key attributes :: [opt] nested-name-specifier [opt]
17242 template [opt] template-id
17243 enum attributes :: [opt] nested-name-specifier [opt] identifier
17245 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17246 declared `friend'. If IS_DECLARATION is TRUE, then this
17247 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17248 something is being declared.
17250 Returns the TYPE specified. */
17252 static tree
17256 {
17258 tree identifier;
17261 tree globalscope;
17264 /* See if we're looking at the `enum' keyword. */
17266 {
17267 /* Consume the `enum' token. */
17269 /* Remember that it's an enumeration type. */
17271 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17272 enums) is used here. */
17275 {
17279 /* Consume the `struct' or `class' and parse it anyway. */
17281 }
17282 /* Parse the attributes. */
17284 }
17285 /* Or, it might be `typename'. */
17287 RID_TYPENAME))
17288 {
17289 /* Consume the `typename' token. */
17291 /* Remember that it's a `typename' type. */
17293 }
17294 /* Otherwise it must be a class-key. */
17295 else
17296 {
17300 /* Parse the attributes. */
17302 }
17304 /* Look for the `::' operator. */
17307 /* Look for the nested-name-specifier. */
17308 tree nested_name_specifier;
17310 {
17311 nested_name_specifier
17316 is_declaration);
17319 }
17320 else
17321 /* Even though `typename' is not present, the proposed resolution
17322 to Core Issue 180 says that in `class A<T>::B', `B' should be
17323 considered a type-name, even if `A<T>' is dependent. */
17324 nested_name_specifier
17329 is_declaration);
17330 /* For everything but enumeration types, consider a template-id.
17331 For an enumeration type, consider only a plain identifier. */
17333 {
17335 tree decl;
17337 /* Allow the `template' keyword. */
17339 /* If we didn't see `template', we don't know if there's a
17340 template-id or not. */
17343 /* Parse the template-id. */
17347 tag_type,
17348 is_declaration);
17349 /* If we didn't find a template-id, look for an ordinary
17350 identifier. */
17352 ;
17353 /* We can get here when cp_parser_template_id, called by
17354 cp_parser_class_name with tag_type == none_type, succeeds
17355 and caches a BASELINK. Then, when called again here,
17356 instead of failing and returning an error_mark_node
17357 returns it (see template/typename17.C in C++11).
17358 ??? Could we diagnose this earlier? */
17360 {
17363 }
17364 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17365 in effect, then we must assume that, upon instantiation, the
17366 template will correspond to a class. */
17370 typename_type,
17372 /* If the `typename' keyword is in effect and DECL is not a type
17373 decl, then type is non existent. */
17375 ;
17377 {
17381 /* If the next token is a semicolon, this must be a specialization,
17382 instantiation, or friend declaration. Check the scope while we
17383 still know whether or not we had a nested-name-specifier. */
17388 }
17391 }
17394 {
17399 {
17402 }
17404 /* For a `typename', we needn't call xref_tag. */
17410 /* Template parameter lists apply only if we are not within a
17411 function parameter list. */
17412 bool template_parm_lists_apply
17421 /* Look up a qualified name in the usual way. */
17423 {
17424 tree decl;
17425 tree ambiguous_decls;
17428 tag_type,
17435 /* If the lookup was ambiguous, an error will already have been
17436 issued. */
17440 /* If we are parsing friend declaration, DECL may be a
17441 TEMPLATE_DECL tree node here. However, we need to check
17442 whether this TEMPLATE_DECL results in valid code. Consider
17443 the following example:
17445 namespace N {
17446 template <class T> class C {};
17447 }
17448 class X {
17449 template <class T> friend class N::C; // #1, valid code
17450 };
17451 template <class T> class Y {
17452 friend class N::C; // #2, invalid code
17453 };
17455 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17456 name lookup of `N::C'. We see that friend declaration must
17457 be template for the code to be valid. Note that
17458 processing_template_decl does not work here since it is
17459 always 1 for the above two cases. */
17461 decl = (cp_parser_maybe_treat_template_as_class
17466 {
17468 identifier,
17471 }
17474 {
17478 allow_template);
17482 }
17484 /* Forward declarations of nested types, such as
17486 class C1::C2;
17487 class C1::C2::C3;
17489 are invalid unless all components preceding the final '::'
17490 are complete. If all enclosing types are complete, these
17491 declarations become merely pointless.
17493 Invalid forward declarations of nested types are errors
17494 caught elsewhere in parsing. Those that are pointless arrive
17495 here. */
17502 }
17503 else
17504 {
17505 /* An elaborated-type-specifier sometimes introduces a new type and
17506 sometimes names an existing type. Normally, the rule is that it
17507 introduces a new type only if there is not an existing type of
17508 the same name already in scope. For example, given:
17510 struct S {};
17511 void f() { struct S s; }
17513 the `struct S' in the body of `f' is the same `struct S' as in
17514 the global scope; the existing definition is used. However, if
17515 there were no global declaration, this would introduce a new
17516 local class named `S'.
17518 An exception to this rule applies to the following code:
17520 namespace N { struct S; }
17522 Here, the elaborated-type-specifier names a new type
17523 unconditionally; even if there is already an `S' in the
17524 containing scope this declaration names a new type.
17525 This exception only applies if the elaborated-type-specifier
17526 forms the complete declaration:
17528 [class.name]
17530 A declaration consisting solely of `class-key identifier ;' is
17531 either a redeclaration of the name in the current scope or a
17532 forward declaration of the identifier as a class name. It
17533 introduces the name into the current scope.
17535 We are in this situation precisely when the next token is a `;'.
17537 An exception to the exception is that a `friend' declaration does
17538 *not* name a new type; i.e., given:
17540 struct S { friend struct T; };
17542 `T' is not a new type in the scope of `S'.
17544 Also, `new struct S' or `sizeof (struct S)' never results in the
17545 definition of a new type; a new type can only be declared in a
17546 declaration context. */
17548 tag_scope ts;
17552 /* Friends have special name lookup rules. */
17556 CPP_SEMICOLON))
17557 /* This is a `class-key identifier ;' */
17559 else
17562 template_p =
17563 (template_parm_lists_apply
17566 /* An unqualified name was used to reference this type, so
17567 there were no qualifying templates. */
17575 }
17576 }
17581 /* Allow attributes on forward declarations of classes. */
17583 {
17593 else
17596 }
17599 {
17600 /* Indicate whether this class was declared as a `class' or as a
17601 `struct'. */
17605 }
17607 /* A "<" cannot follow an elaborated type specifier. If that
17608 happens, the user was probably trying to form a template-id. */
17613 }
17615 /* Parse an enum-specifier.
17617 enum-specifier:
17618 enum-head { enumerator-list [opt] }
17619 enum-head { enumerator-list , } [C++0x]
17621 enum-head:
17622 enum-key identifier [opt] enum-base [opt]
17623 enum-key nested-name-specifier identifier enum-base [opt]
17625 enum-key:
17626 enum
17627 enum class [C++0x]
17628 enum struct [C++0x]
17630 enum-base: [C++0x]
17631 : type-specifier-seq
17633 opaque-enum-specifier:
17634 enum-key identifier enum-base [opt] ;
17636 GNU Extensions:
17637 enum-key attributes[opt] identifier [opt] enum-base [opt]
17638 { enumerator-list [opt] }attributes[opt]
17639 enum-key attributes[opt] identifier [opt] enum-base [opt]
17640 { enumerator-list, }attributes[opt] [C++0x]
17642 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17643 if the token stream isn't an enum-specifier after all. */
17645 static tree
17647 {
17648 tree identifier;
17650 tree prev_scope;
17652 tree attributes;
17665 /* Parse tentatively so that we can back up if we don't find a
17666 enum-specifier. */
17669 /* Caller guarantees that the current token is 'enum', an identifier
17670 possibly follows, and the token after that is an opening brace.
17671 If we don't have an identifier, fabricate an anonymous name for
17672 the enumeration being defined. */
17675 /* Parse the "class" or "struct", which indicates a scoped
17676 enumeration type in C++0x. */
17679 {
17683 /* Consume the `struct' or `class' token. */
17687 }
17691 /* Clear the qualification. */
17696 /* Figure out in what scope the declaration is being placed. */
17702 nested_name_specifier
17710 {
17711 tree name;
17715 enum_type,
17720 input_location);
17722 {
17725 {
17726 /* Are template enums allowed in ISO? */
17730 /* ignore a typename reference, for it will be solved by name
17731 in start_enum. */
17733 }
17734 }
17737 else
17738 {
17743 }
17744 }
17745 else
17746 {
17749 else
17750 {
17756 }
17757 }
17760 /* Check for the `:' that denotes a specified underlying type in C++0x.
17761 Note that a ':' could also indicate a bitfield width, however. */
17763 {
17764 cp_decl_specifier_seq type_specifiers;
17766 /* Consume the `:'. */
17769 /* Parse the type-specifier-seq. */
17774 /* At this point this is surely not elaborated type specifier. */
17783 /* If that didn't work, stop. */
17785 {
17791 }
17792 }
17794 /* Look for the `{' but don't consume it yet. */
17796 {
17798 {
17801 {
17804 }
17805 }
17806 /* An opaque-enum-specifier must have a ';' here. */
17809 {
17812 {
17815 }
17816 }
17817 }
17823 {
17825 {
17829 }
17831 {
17833 }
17834 }
17836 /* Issue an error message if type-definitions are forbidden here. */
17839 else
17840 /* Create the new type. We do this before consuming the opening
17841 brace so the enum will be recorded as being on the line of its
17842 tag (or the 'enum' keyword, if there is no tag). */
17846 /* If the next token is not '{' it is an opaque-enum-specifier or an
17847 elaborated-type-specifier. */
17849 {
17853 {
17854 /* The following catches invalid code such as:
17855 enum class S<int>::E { A, B, C }; */
17863 {
17867 nested_name_specifier);
17869 }
17872 {
17874 "%qT for enum declaration does not name a class "
17877 }
17878 /* If that scope does not contain the scope in which the
17879 class was originally declared, the program is invalid. */
17881 nested_name_specifier))
17882 {
17885 "declaration of %qD in namespace %qD which does not "
17888 else
17890 "declaration of %qD in %qD which does not "
17894 }
17895 /* If that scope is the scope where the declaration is being placed
17896 the program is invalid. */
17900 {
17904 }
17905 }
17910 /* Consume the opening brace. */
17917 {
17921 }
17922 else
17923 {
17929 }
17933 /* If the next token is not '}', then there are some enumerators. */
17935 {
17939 }
17940 else
17943 /* Consume the final '}'. */
17949 }
17950 else
17951 {
17952 /* If a ';' follows, then it is an opaque-enum-specifier
17953 and additional restrictions apply. */
17955 {
17962 }
17963 }
17965 /* Look for trailing attributes to apply to this enumeration, and
17966 apply them if appropriate. */
17968 {
17971 trailing_attr,
17973 }
17975 /* Finish up the enumeration. */
17977 {
17982 }
17985 {
17987 {
17990 }
17992 {
17994 }
17995 }
17996 out:
17999 }
18001 /* Parse an enumerator-list. The enumerators all have the indicated
18002 TYPE.
18004 enumerator-list:
18005 enumerator-definition
18006 enumerator-list , enumerator-definition */
18008 static void
18010 {
18012 {
18013 /* Parse an enumerator-definition. */
18016 /* If the next token is not a ',', we've reached the end of
18017 the list. */
18020 /* Otherwise, consume the `,' and keep going. */
18022 /* If the next token is a `}', there is a trailing comma. */
18024 {
18029 }
18030 }
18031 }
18033 /* Parse an enumerator-definition. The enumerator has the indicated
18034 TYPE.
18036 enumerator-definition:
18037 enumerator
18038 enumerator = constant-expression
18040 enumerator:
18041 identifier
18043 GNU Extensions:
18045 enumerator-definition:
18046 enumerator attributes [opt]
18047 enumerator attributes [opt] = constant-expression */
18049 static void
18051 {
18052 tree identifier;
18053 tree value;
18054 location_t loc;
18056 /* Save the input location because we are interested in the location
18057 of the identifier and not the location of the explicit value. */
18060 /* Look for the identifier. */
18065 /* Parse any specified attributes. */
18068 /* If the next token is an '=', then there is an explicit value. */
18070 {
18071 /* Consume the `=' token. */
18073 /* Parse the value. */
18075 }
18076 else
18079 /* If we are processing a template, make sure the initializer of the
18080 enumerator doesn't contain any bare template parameter pack. */
18084 /* Create the enumerator. */
18086 }
18088 /* Parse a namespace-name.
18090 namespace-name:
18091 original-namespace-name
18092 namespace-alias
18094 Returns the NAMESPACE_DECL for the namespace. */
18096 static tree
18098 {
18099 tree identifier;
18100 tree namespace_decl;
18104 /* Get the name of the namespace. */
18109 /* Look up the identifier in the currently active scope. Look only
18110 for namespaces, due to:
18112 [basic.lookup.udir]
18114 When looking up a namespace-name in a using-directive or alias
18115 definition, only namespace names are considered.
18117 And:
18119 [basic.lookup.qual]
18121 During the lookup of a name preceding the :: scope resolution
18122 operator, object, function, and enumerator names are ignored.
18124 (Note that cp_parser_qualifying_entity only calls this
18125 function if the token after the name is the scope resolution
18126 operator.) */
18128 none_type,
18134 /* If it's not a namespace, issue an error. */
18137 {
18142 }
18145 }
18147 /* Parse a namespace-definition.
18149 namespace-definition:
18150 named-namespace-definition
18151 unnamed-namespace-definition
18153 named-namespace-definition:
18154 original-namespace-definition
18155 extension-namespace-definition
18157 original-namespace-definition:
18158 namespace identifier { namespace-body }
18160 extension-namespace-definition:
18161 namespace original-namespace-name { namespace-body }
18163 unnamed-namespace-definition:
18164 namespace { namespace-body } */
18166 static void
18168 {
18178 {
18182 }
18183 else
18186 /* Look for the `namespace' keyword. */
18189 /* Parse any specified attributes before the identifier. */
18192 /* Get the name of the namespace. We do not attempt to distinguish
18193 between an original-namespace-definition and an
18194 extension-namespace-definition at this point. The semantic
18195 analysis routines are responsible for that. */
18198 else
18201 /* Parse any specified attributes after the identifier. */
18204 {
18207 else
18209 }
18211 /* Start the namespace. */
18214 /* Parse any nested namespace definition. */
18216 {
18221 "nested namespace definitions only available with "
18226 {
18230 else
18231 {
18234 }
18237 }
18238 }
18240 /* Look for the `{' to validate starting the namespace. */
18243 /* "inline namespace" is equivalent to a stub namespace definition
18244 followed by a strong using directive. */
18246 {
18248 /* Set up namespace association. */
18252 /* Import the contents of the inline namespace. */
18256 }
18262 /* Parse the body of the namespace. */
18268 /* Finish the nested namespace definitions. */
18272 /* Finish the namespace. */
18275 /* Look for the final `}'. */
18277 }
18279 /* Parse a namespace-body.
18281 namespace-body:
18282 declaration-seq [opt] */
18284 static void
18286 {
18288 }
18290 /* Parse a namespace-alias-definition.
18292 namespace-alias-definition:
18293 namespace identifier = qualified-namespace-specifier ; */
18295 static void
18297 {
18298 tree identifier;
18299 tree namespace_specifier;
18303 /* Look for the `namespace' keyword. */
18305 /* Look for the identifier. */
18309 /* Look for the `=' token. */
18312 {
18314 /* Skip the definition. */
18319 }
18321 /* Look for the qualified-namespace-specifier. */
18322 namespace_specifier
18324 /* Look for the `;' token. */
18327 /* Register the alias in the symbol table. */
18329 }
18331 /* Parse a qualified-namespace-specifier.
18333 qualified-namespace-specifier:
18334 :: [opt] nested-name-specifier [opt] namespace-name
18336 Returns a NAMESPACE_DECL corresponding to the specified
18337 namespace. */
18339 static tree
18341 {
18342 /* Look for the optional `::'. */
18346 /* Look for the optional nested-name-specifier. */
18354 }
18356 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18357 access declaration.
18359 using-declaration:
18360 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18361 using :: unqualified-id ;
18363 access-declaration:
18364 qualified-id ;
18366 */
18368 static bool
18371 {
18375 tree decl;
18376 tree identifier;
18377 tree qscope;
18382 {
18385 }
18386 else
18387 {
18388 /* Look for the `using' keyword. */
18391 again:
18392 /* Peek at the next token. */
18394 /* See if it's `typename'. */
18396 {
18397 /* Remember that we've seen it. */
18399 /* Consume the `typename' token. */
18401 }
18402 }
18404 /* Look for the optional global scope qualification. */
18405 global_scope_p
18410 /* If we saw `typename', or didn't see `::', then there must be a
18411 nested-name-specifier present. */
18413 {
18419 {
18422 }
18423 }
18424 /* Otherwise, we could be in either of the two productions. In that
18425 case, treat the nested-name-specifier as optional. */
18426 else
18438 /* Something has already gone wrong; there's no need to parse
18439 further. Since an error has occurred, the return value of
18440 cp_parser_parse_definitely will be false, as required. */
18444 /* Parse the unqualified-id. */
18452 {
18457 }
18459 {
18464 "pack expansion in using-declaration only available "
18467 }
18469 /* The function we call to handle a using-declaration is different
18470 depending on what scope we are in. */
18472 ;
18475 /* [namespace.udecl]
18477 A using declaration shall not name a template-id. */
18480 else
18481 {
18483 {
18484 /* Create the USING_DECL. */
18491 {
18494 }
18495 else
18496 /* Add it to the list of members in this class. */
18498 }
18499 else
18500 {
18502 identifier,
18509 {
18512 }
18515 else
18517 }
18518 }
18522 {
18526 "comma-separated list in using-declaration only available "
18529 }
18531 /* Look for the final `;'. */
18536 "access declarations are deprecated "
18537 "in favour of using-declarations; "
18541 }
18543 /* Parse an alias-declaration.
18545 alias-declaration:
18546 using identifier attribute-specifier-seq [opt] = type-id */
18548 static tree
18550 {
18552 location_t id_location;
18554 cp_decl_specifier_seq decl_specs;
18558 /* Look for the `using' keyword. */
18559 cp_token *using_token
18581 /* Now we are going to parse the type-id of the declaration. */
18583 /*
18584 [dcl.type]/3 says:
18586 "A type-specifier-seq shall not define a class or enumeration
18587 unless it appears in the type-id of an alias-declaration (7.1.3) that
18588 is not the declaration of a template-declaration."
18590 In other words, if we currently are in an alias template, the
18591 type-id should not define a type.
18593 So let's set parser->type_definition_forbidden_message in that
18594 case; cp_parser_check_type_definition (called by
18595 cp_parser_class_specifier) will then emit an error if a type is
18596 defined in the type-id. */
18598 {
18602 }
18606 /* Restore the error message if need be. */
18612 {
18615 }
18617 /* A typedef-name can also be introduced by an alias-declaration. The
18618 identifier following the using keyword becomes a typedef-name. It has
18619 the same semantics as if it were introduced by the typedef
18620 specifier. In particular, it does not define a new type and it shall
18621 not appear in the type-id. */
18626 {
18629 ds_attribute,
18630 attrs_token);
18631 }
18633 ds_typedef,
18634 using_token);
18636 ds_alias,
18637 using_token);
18646 else
18652 // Attach constraints to the alias declaration.
18654 {
18658 }
18665 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18666 added into the symbol table; otherwise, return the TYPE_DECL. */
18670 {
18674 }
18677 }
18679 /* Parse a using-directive.
18681 using-directive:
18682 using namespace :: [opt] nested-name-specifier [opt]
18683 namespace-name ; */
18685 static void
18687 {
18688 tree namespace_decl;
18689 tree attribs;
18691 /* Look for the `using' keyword. */
18693 /* And the `namespace' keyword. */
18695 /* Look for the optional `::' operator. */
18697 /* And the optional nested-name-specifier. */
18703 /* Get the namespace being used. */
18705 /* And any specified attributes. */
18707 /* Update the symbol table. */
18709 /* Look for the final `;'. */
18711 }
18713 /* Parse an asm-definition.
18715 asm-definition:
18716 asm ( string-literal ) ;
18718 GNU Extension:
18720 asm-definition:
18721 asm volatile [opt] ( string-literal ) ;
18722 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18723 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18724 : asm-operand-list [opt] ) ;
18725 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18726 : asm-operand-list [opt]
18727 : asm-clobber-list [opt] ) ;
18728 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18729 : asm-clobber-list [opt]
18730 : asm-goto-list ) ; */
18732 static void
18734 {
18735 tree string;
18740 tree asm_stmt;
18748 /* Look for the `asm' keyword. */
18753 {
18756 }
18758 /* See if the next token is `volatile'. */
18761 {
18762 /* Remember that we saw the `volatile' keyword. */
18764 /* Consume the token. */
18766 }
18770 {
18771 /* Remember that we saw the `goto' keyword. */
18773 /* Consume the token. */
18775 }
18776 /* Look for the opening `('. */
18779 /* Look for the string. */
18782 {
18786 }
18788 /* If we're allowing GNU extensions, check for the extended assembly
18789 syntax. Unfortunately, the `:' tokens need not be separated by
18790 a space in C, and so, for compatibility, we tolerate that here
18791 too. Doing that means that we have to treat the `::' operator as
18792 two `:' tokens. */
18797 {
18802 /* The extended syntax was used. */
18805 /* Look for outputs. */
18807 {
18808 /* Consume the `:'. */
18810 /* Parse the output-operands. */
18812 CPP_COLON)
18814 CPP_SCOPE)
18816 CPP_CLOSE_PAREN)
18818 {
18822 }
18823 }
18824 /* If the next token is `::', there are no outputs, and the
18825 next token is the beginning of the inputs. */
18827 /* The inputs are coming next. */
18830 /* Look for inputs. */
18833 {
18834 /* Consume the `:' or `::'. */
18836 /* Parse the output-operands. */
18838 CPP_COLON)
18840 CPP_SCOPE)
18842 CPP_CLOSE_PAREN))
18843 {
18847 }
18848 }
18850 /* The clobbers are coming next. */
18853 /* Look for clobbers. */
18856 {
18858 /* Consume the `:' or `::'. */
18860 /* Parse the clobbers. */
18862 CPP_COLON)
18864 CPP_CLOSE_PAREN))
18866 }
18869 /* The labels are coming next. */
18872 /* Look for labels. */
18875 {
18877 /* Consume the `:' or `::'. */
18879 /* Parse the labels. */
18881 }
18885 }
18889 /* Look for the closing `)'. */
18897 {
18898 /* Create the ASM_EXPR. */
18900 {
18903 /* If the extended syntax was not used, mark the ASM_EXPR. */
18905 {
18911 }
18912 }
18913 else
18915 }
18916 }
18918 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18919 type that comes from the decl-specifier-seq. */
18921 static tree
18923 {
18926 {
18939 }
18942 }
18944 /* Declarators [gram.dcl.decl] */
18946 /* Parse an init-declarator.
18948 init-declarator:
18949 declarator initializer [opt]
18951 GNU Extension:
18953 init-declarator:
18954 declarator asm-specification [opt] attributes [opt] initializer [opt]
18956 function-definition:
18957 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18958 function-body
18959 decl-specifier-seq [opt] declarator function-try-block
18961 GNU Extension:
18963 function-definition:
18964 __extension__ function-definition
18966 TM Extension:
18968 function-definition:
18969 decl-specifier-seq [opt] declarator function-transaction-block
18971 The DECL_SPECIFIERS apply to this declarator. Returns a
18972 representation of the entity declared. If MEMBER_P is TRUE, then
18973 this declarator appears in a class scope. The new DECL created by
18974 this declarator is returned.
18976 The CHECKS are access checks that should be performed once we know
18977 what entity is being declared (and, therefore, what classes have
18978 befriended it).
18980 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18981 for a function-definition here as well. If the declarator is a
18982 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18983 be TRUE upon return. By that point, the function-definition will
18984 have been completely parsed.
18986 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18987 is FALSE.
18989 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18990 parsed declaration if it is an uninitialized single declarator not followed
18991 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18992 if present, will not be consumed. If returned, this declarator will be
18993 created with SD_INITIALIZED but will not call cp_finish_decl.
18995 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18996 and there is an initializer, the pointed location_t is set to the
18997 location of the '=' or `(', or '{' in C++11 token introducing the
18998 initializer. */
19000 static tree
19011 {
19015 tree prefix_attributes;
19017 tree asm_specification;
19018 tree initializer;
19020 tree scope;
19022 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19023 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19024 "(...)". */
19035 /* Gather the attributes that were provided with the
19036 decl-specifiers. */
19039 /* Assume that this is not the declarator for a function
19040 definition. */
19044 /* Default arguments are only permitted for function parameters. */
19048 /* Defer access checks while parsing the declarator; we cannot know
19049 what names are accessible until we know what is being
19050 declared. */
19055 /* Parse the declarator. */
19056 declarator
19061 /* Gather up the deferred checks. */
19066 /* If the DECLARATOR was erroneous, there's no need to go
19067 further. */
19071 /* Check that the number of template-parameter-lists is OK. */
19081 /* Figure out what scope the entity declared by the DECLARATOR is
19082 located in. `grokdeclarator' sometimes changes the scope, so
19083 we compute it now. */
19086 /* Perform any lookups in the declared type which were thought to be
19087 dependent, but are not in the scope of the declarator. */
19088 decl_specifiers->type
19091 /* If we're allowing GNU extensions, look for an
19092 asm-specification. */
19094 {
19095 /* Look for an asm-specification. */
19098 }
19099 else
19102 /* Look for attributes. */
19106 /* Peek at the next token. */
19112 {
19113 /* Handle C++17 deduction guides. */
19117 {
19125 {
19129 }
19130 }
19132 /* Check to see if the token indicates the start of a
19133 function-definition. */
19135 {
19137 {
19138 /* If a function-definition should not appear here, issue an
19139 error message. */
19143 }
19145 location_t func_brace_location
19148 /* Neither attributes nor an asm-specification are allowed
19149 on a function-definition. */
19152 "an asm-specification is not allowed "
19156 "attributes are not allowed "
19158 /* This is a function-definition. */
19161 /* Parse the function definition. */
19164 decl_specifiers,
19165 declarator,
19166 prefix_attributes);
19167 else
19168 decl =
19169 (cp_parser_function_definition_from_specifiers_and_declarator
19173 {
19174 /* This is where the prologue starts... */
19177 }
19180 }
19181 }
19183 {
19184 /* A non-template declaration involving a function parameter list
19185 containing an implicit template parameter will be made into a
19186 template. If the resulting declaration is not going to be an
19187 actual function then finish the template scope here to prevent it.
19188 An error message will be issued once we have a decl to talk about.
19190 FIXME probably we should do type deduction rather than create an
19191 implicit template, but the standard currently doesn't allow it. */
19194 }
19196 /* [dcl.dcl]
19198 Only in function declarations for constructors, destructors, type
19199 conversions, and deduction guides can the decl-specifier-seq be omitted.
19201 We explicitly postpone this check past the point where we handle
19202 function-definitions because we tolerate function-definitions
19203 that are missing their return types in some modes. */
19205 {
19209 }
19211 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19215 {
19226 {
19232 }
19233 }
19234 else
19235 {
19236 /* If the init-declarator isn't initialized and isn't followed by a
19237 `,' or `;', it's not a valid init-declarator. */
19240 {
19243 else
19244 {
19248 }
19249 }
19252 }
19254 /* Because start_decl has side-effects, we should only call it if we
19255 know we're going ahead. By this point, we know that we cannot
19256 possibly be looking at any other construct. */
19259 /* Enter the newly declared entry in the symbol table. If we're
19260 processing a declaration in a class-specifier, we wait until
19261 after processing the initializer. */
19263 {
19271 /* Adjust location of decl if declarator->id_loc is more appropriate:
19272 set, and decl wasn't merged with another decl, in which case its
19273 location would be different from input_location, and more accurate. */
19278 }
19280 /* Enter the SCOPE. That way unqualified names appearing in the
19281 initializer will be looked up in SCOPE. */
19284 /* Perform deferred access control checks, now that we know in which
19285 SCOPE the declared entity resides. */
19287 {
19290 /* If the entity being declared is a function, pretend that we
19291 are in its scope. If it is a `friend', it may have access to
19292 things that would not otherwise be accessible. */
19294 {
19297 }
19299 /* Perform access checks for template parameters. */
19302 /* Perform the access control checks for the declarator and the
19303 decl-specifiers. */
19306 /* Restore the saved value. */
19309 }
19311 /* Parse the initializer. */
19316 {
19318 {
19321 else
19322 {
19323 /* If the declaration was erroneous, we don't really
19324 know what the user intended, so just silently
19325 consume the initializer. */
19332 }
19333 }
19334 else
19335 {
19336 /* We want to record the extra mangling scope for in-class
19337 initializers of class members and initializers of static data
19338 member templates. The former involves deferring
19339 parsing of the initializer until end of class as with default
19340 arguments. So right here we only handle the latter. */
19350 }
19351 }
19353 /* The old parser allows attributes to appear after a parenthesized
19354 initializer. Mark Mitchell proposed removing this functionality
19355 on the GCC mailing lists on 2002-08-13. This parser accepts the
19356 attributes -- but ignores them. */
19363 /* And now complain about a non-function implicit template. */
19368 /* For an in-class declaration, use `grokfield' to create the
19369 declaration. */
19371 {
19373 {
19376 }
19385 }
19387 /* Finish processing the declaration. But, skip member
19388 declarations. */
19390 {
19393 asm_specification,
19394 /* If the initializer is in parentheses, then this is
19395 a direct-initialization, which means that an
19396 `explicit' constructor is OK. Otherwise, an
19397 `explicit' constructor cannot be used. */
19400 }
19403 /* Core issue #226 (C++0x only): A default template-argument
19404 shall not be specified in a friend class template
19405 declaration. */
19414 {
19417 else
19419 }
19426 }
19428 /* Parse a declarator.
19430 declarator:
19431 direct-declarator
19432 ptr-operator declarator
19434 abstract-declarator:
19435 ptr-operator abstract-declarator [opt]
19436 direct-abstract-declarator
19438 GNU Extensions:
19440 declarator:
19441 attributes [opt] direct-declarator
19442 attributes [opt] ptr-operator declarator
19444 abstract-declarator:
19445 attributes [opt] ptr-operator abstract-declarator [opt]
19446 attributes [opt] direct-abstract-declarator
19448 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19449 detect constructors, destructors, deduction guides, or conversion operators.
19450 It is set to -1 if the declarator is a name, and +1 if it is a
19451 function. Otherwise it is set to zero. Usually you just want to
19452 test for >0, but internally the negative value is used.
19454 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19455 a decl-specifier-seq unless it declares a constructor, destructor,
19456 or conversion. It might seem that we could check this condition in
19457 semantic analysis, rather than parsing, but that makes it difficult
19458 to handle something like `f()'. We want to notice that there are
19459 no decl-specifiers, and therefore realize that this is an
19460 expression, not a declaration.)
19462 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19463 the declarator is a direct-declarator of the form "(...)".
19465 MEMBER_P is true iff this declarator is a member-declarator.
19467 FRIEND_P is true iff this declarator is a friend. */
19471 cp_parser_declarator_kind dcl_kind,
19475 {
19478 cp_cv_quals cv_quals;
19479 tree class_type;
19482 /* Assume this is not a constructor, destructor, or type-conversion
19483 operator. */
19490 /* Check for the ptr-operator production. */
19492 /* Parse the ptr-operator. */
19498 /* If that worked, then we have a ptr-operator. */
19500 {
19501 /* If a ptr-operator was found, then this declarator was not
19502 parenthesized. */
19505 /* The dependent declarator is optional if we are parsing an
19506 abstract-declarator. */
19510 /* Parse the dependent declarator. */
19515 friend_p);
19517 /* If we are parsing an abstract-declarator, we must handle the
19518 case where the dependent declarator is absent. */
19523 declarator = cp_parser_make_indirect_declarator
19525 }
19526 /* Everything else is a direct-declarator. */
19527 else
19528 {
19531 CPP_OPEN_PAREN);
19533 ctor_dtor_or_conv_p,
19535 }
19540 }
19542 /* Parse a direct-declarator or direct-abstract-declarator.
19544 direct-declarator:
19545 declarator-id
19546 direct-declarator ( parameter-declaration-clause )
19547 cv-qualifier-seq [opt]
19548 ref-qualifier [opt]
19549 exception-specification [opt]
19550 direct-declarator [ constant-expression [opt] ]
19551 ( declarator )
19553 direct-abstract-declarator:
19554 direct-abstract-declarator [opt]
19555 ( parameter-declaration-clause )
19556 cv-qualifier-seq [opt]
19557 ref-qualifier [opt]
19558 exception-specification [opt]
19559 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19560 ( abstract-declarator )
19562 Returns a representation of the declarator. DCL_KIND is
19563 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19564 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19565 we are parsing a direct-declarator. It is
19566 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19567 of ambiguity we prefer an abstract declarator, as per
19568 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19569 as for cp_parser_declarator. */
19573 cp_parser_declarator_kind dcl_kind,
19576 {
19586 {
19587 /* Peek at the next token. */
19590 {
19591 /* This is either a parameter-declaration-clause, or a
19592 parenthesized declarator. When we know we are parsing a
19593 named declarator, it must be a parenthesized declarator
19594 if FIRST is true. For instance, `(int)' is a
19595 parameter-declaration-clause, with an omitted
19596 direct-abstract-declarator. But `((*))', is a
19597 parenthesized abstract declarator. Finally, when T is a
19598 template parameter `(T)' is a
19599 parameter-declaration-clause, and not a parenthesized
19600 named declarator.
19602 We first try and parse a parameter-declaration-clause,
19603 and then try a nested declarator (if FIRST is true).
19605 It is not an error for it not to be a
19606 parameter-declaration-clause, even when FIRST is
19607 false. Consider,
19609 int i (int);
19610 int i (3);
19612 The first is the declaration of a function while the
19613 second is the definition of a variable, including its
19614 initializer.
19616 Having seen only the parenthesis, we cannot know which of
19617 these two alternatives should be selected. Even more
19618 complex are examples like:
19620 int i (int (a));
19621 int i (int (3));
19623 The former is a function-declaration; the latter is a
19624 variable initialization.
19626 Thus again, we try a parameter-declaration-clause, and if
19627 that fails, we back out and return. */
19630 {
19631 tree params;
19634 /* In a member-declarator, the only valid interpretation
19635 of a parenthesis is the start of a
19636 parameter-declaration-clause. (It is invalid to
19637 initialize a static data member with a parenthesized
19638 initializer; only the "=" form of initialization is
19639 permitted.) */
19643 /* Consume the `('. */
19646 {
19647 /* If this is going to be an abstract declarator, we're
19648 in a declarator and we can't have default args. */
19651 }
19655 /* Parse the parameter-declaration-clause. */
19658 /* Consume the `)'. */
19661 /* If all went well, parse the cv-qualifier-seq,
19662 ref-qualifier and the exception-specification. */
19664 {
19665 cp_cv_quals cv_quals;
19666 cp_virt_specifiers virt_specifiers;
19667 cp_ref_qualifier ref_qual;
19668 tree exception_specification;
19669 tree late_return;
19670 tree attrs;
19680 /* Parse the cv-qualifier-seq. */
19682 /* Parse the ref-qualifier. */
19684 /* Parse the tx-qualifier. */
19686 /* And the exception-specification. */
19687 exception_specification
19692 /* In here, we handle cases where attribute is used after
19693 the function declaration. For example:
19694 void func (int x) __attribute__((vector(..))); */
19698 {
19702 CPP_SEMICOLON)
19704 CPP_OPEN_BRACE))
19707 ;
19708 else
19710 }
19712 late_return = (cp_parser_late_return_type_opt
19716 /* Parse the virt-specifier-seq. */
19719 /* Create the function-declarator. */
19721 params,
19722 cv_quals,
19723 virt_specifiers,
19724 ref_qual,
19725 tx_qual,
19726 exception_specification,
19727 late_return,
19728 requires_clause);
19731 /* Any subsequent parameter lists are to do with
19732 return type, so are not those of the declared
19733 function. */
19735 }
19737 /* Remove the function parms from scope. */
19741 /* Repeat the main loop. */
19743 }
19745 /* If this is the first, we can try a parenthesized
19746 declarator. */
19748 {
19754 /* Consume the `('. */
19756 /* Parse the nested declarator. */
19759 declarator
19765 /* Expect a `)'. */
19772 }
19773 /* Otherwise, we must be done. */
19774 else
19776 }
19780 {
19781 /* Parse an array-declarator. */
19790 /* Consume the `['. */
19792 /* Peek at the next token. */
19794 /* If the next token is `]', then there is no
19795 constant-expression. */
19797 {
19799 bounds
19809 {
19810 /* Normally, the array bound must be an integral constant
19811 expression. However, as an extension, we allow VLAs
19812 in function scopes as long as they aren't part of a
19813 parameter declaration. */
19817 }
19820 {
19821 /* Remember this wasn't a constant-expression. */
19824 }
19825 }
19826 else
19828 /* Look for the closing `]'. */
19830 {
19833 }
19838 }
19840 {
19841 {
19842 tree qualifying_scope;
19843 tree unqualified_name;
19844 tree attrs;
19845 special_function_kind sfk;
19850 /* Parse a declarator-id */
19853 {
19856 /* If we see an ellipsis, we should be looking at a
19857 parameter pack. */
19859 {
19860 /* Consume the `...' */
19864 }
19865 }
19868 unqualified_name
19872 {
19876 {
19877 /* Check whether an error occurred. */
19880 /* We already consumed the ellipsis to mark a
19881 parameter pack, but we have no way to report it,
19882 so abort the tentative parse. We will be exiting
19883 immediately anyway. */
19885 }
19886 else
19892 && (qualifying_scope
19894 {
19897 }
19898 }
19903 {
19908 }
19914 {
19915 /* In the declaration of a member of a template class
19916 outside of the class itself, the SCOPE will sometimes
19917 be a TYPENAME_TYPE. For example, given:
19919 template <typename T>
19920 int S<T>::R::i = 3;
19922 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19923 this context, we must resolve S<T>::R to an ordinary
19924 type, rather than a typename type.
19926 The reason we normally avoid resolving TYPENAME_TYPEs
19927 is that a specialization of `S' might render
19928 `S<T>::R' not a type. However, if `S' is
19929 specialized, then this `i' will not be used, so there
19930 is no harm in resolving the types here. */
19931 tree type;
19933 /* Resolve the TYPENAME_TYPE. */
19936 /* If that failed, the declarator is invalid. */
19938 {
19941 "cannot define member of dependent typedef "
19943 else
19948 }
19950 }
19955 {
19956 tree class_type;
19961 else
19965 {
19968 {
19971 {
19975 "use %<%T::%D%> instead of %<%T::%D%> to "
19977 class_type,
19982 }
19983 else
19985 }
19986 else
19987 {
19988 /* We do not attempt to print the declarator
19989 here because we do not have enough
19990 information about its original syntactic
19991 form. */
19995 }
19996 }
19999 {
20005 for an unnamed type, even if the type
20006 got a name for linkage purposes. */
20008 /* Handle correctly (c++/19200):
20010 struct S {
20011 struct T{};
20012 friend void S(T);
20013 };
20015 and also:
20017 namespace N {
20018 void S();
20019 }
20021 struct S {
20022 friend void N::S();
20023 }; */
20024 && !(friend_p
20027 class_type))
20028 {
20031 }
20039 }
20040 }
20042 unqualified_name,
20043 sfk);
20050 }
20052 handle_declarator:;
20055 {
20056 /* Any names that appear after the declarator-id for a
20057 member are looked up in the containing scope. */
20059 {
20060 /* But declarations with qualified-ids can't appear in a
20061 function. */
20065 }
20067 }
20071 /* Default args are only allowed on function
20072 declarations. */
20074 else
20078 }
20079 /* We're done. */
20080 else
20082 }
20084 /* For an abstract declarator, we might wind up with nothing at this
20085 point. That's an error; the declarator is not optional. */
20089 /* If we entered a scope, we must exit it now. */
20097 }
20099 /* Parse a ptr-operator.
20101 ptr-operator:
20102 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20103 * cv-qualifier-seq [opt]
20104 &
20105 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20106 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20108 GNU Extension:
20110 ptr-operator:
20111 & cv-qualifier-seq [opt]
20113 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20114 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20115 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20116 filled in with the TYPE containing the member. *CV_QUALS is
20117 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20118 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20119 Note that the tree codes returned by this function have nothing
20120 to do with the types of trees that will be eventually be created
20121 to represent the pointer or reference type being parsed. They are
20122 just constants with suggestive names. */
20123 static enum tree_code
20128 {
20133 /* Assume that it's not a pointer-to-member. */
20135 /* And that there are no cv-qualifiers. */
20138 /* Peek at the next token. */
20141 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20151 {
20152 /* Consume the `*', `&' or `&&'. */
20155 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20156 `&', if we are allowing GNU extensions. (The only qualifier
20157 that can legally appear after `&' is `restrict', but that is
20158 enforced during semantic analysis. */
20166 }
20167 else
20168 {
20169 /* Try the pointer-to-member case. */
20171 /* Look for the optional `::' operator. */
20174 /* Look for the nested-name specifier. */
20181 /* If we found it, and the next token is a `*', then we are
20182 indeed looking at a pointer-to-member operator. */
20185 {
20186 /* Indicate that the `*' operator was used. */
20194 else
20195 {
20196 /* The type of which the member is a member is given by the
20197 current SCOPE. */
20199 /* The next name will not be qualified. */
20203 /* Look for optional c++11 attributes. */
20207 /* Look for the optional cv-qualifier-seq. */
20209 }
20210 }
20211 /* If that didn't work we don't have a ptr-operator. */
20214 }
20217 }
20219 /* Parse an (optional) cv-qualifier-seq.
20221 cv-qualifier-seq:
20222 cv-qualifier cv-qualifier-seq [opt]
20224 cv-qualifier:
20225 const
20226 volatile
20228 GNU Extension:
20230 cv-qualifier:
20231 __restrict__
20233 Returns a bitmask representing the cv-qualifiers. */
20235 static cp_cv_quals
20237 {
20241 {
20243 cp_cv_quals cv_qualifier;
20245 /* Peek at the next token. */
20247 /* See if it's a cv-qualifier. */
20249 {
20265 }
20271 {
20276 }
20277 else
20278 {
20281 }
20282 }
20285 }
20287 /* Parse an (optional) ref-qualifier
20289 ref-qualifier:
20290 &
20291 &&
20293 Returns cp_ref_qualifier representing ref-qualifier. */
20295 static cp_ref_qualifier
20297 {
20300 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20305 {
20310 {
20322 }
20327 {
20330 }
20331 else
20332 {
20335 }
20336 }
20339 }
20341 /* Parse an optional tx-qualifier.
20343 tx-qualifier:
20344 transaction_safe
20345 transaction_safe_dynamic */
20347 static tree
20349 {
20352 {
20357 {
20361 {
20364 {
20367 }
20368 else
20370 }
20371 }
20372 }
20374 }
20376 /* Parse an (optional) virt-specifier-seq.
20378 virt-specifier-seq:
20379 virt-specifier virt-specifier-seq [opt]
20381 virt-specifier:
20382 override
20383 final
20385 Returns a bitmask representing the virt-specifiers. */
20387 static cp_virt_specifiers
20389 {
20393 {
20395 cp_virt_specifiers virt_specifier;
20397 /* Peek at the next token. */
20399 /* See if it's a virt-specifier-qualifier. */
20403 {
20406 }
20408 {
20411 }
20413 {
20415 }
20416 else
20420 {
20425 }
20426 else
20427 {
20430 }
20431 }
20433 }
20435 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20436 is in scope even though it isn't real. */
20438 void
20440 {
20441 tree this_parm;
20444 {
20445 /* We don't clear this between NSDMIs. Is it already what we want? */
20450 }
20453 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20455 current_class_ref
20458 }
20460 /* Return true iff our current scope is a non-static data member
20461 initializer. */
20463 bool
20465 {
20466 /* We recognize NSDMI context by the context-less 'this' pointer set up
20467 by the function above. */
20473 }
20475 /* Return true iff our current scope is a default capturing generic lambda
20476 defined within a template. FIXME: This is part of a workaround (see
20477 semantics.c) to handle building lambda closure types correctly in templates
20478 which we ultimately want to defer to instantiation time. */
20480 bool
20482 {
20500 }
20502 /* Parse a late-specified return type, if any. This is not a separate
20503 non-terminal, but part of a function declarator, which looks like
20505 -> trailing-type-specifier-seq abstract-declarator(opt)
20507 Returns the type indicated by the type-id.
20509 In addition to this, parse any queued up #pragma omp declare simd
20510 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20511 #pragma acc routine clauses.
20513 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20514 function. */
20516 static tree
20519 {
20523 && declarator
20530 && declarator
20533 /* Peek at the next token. */
20535 /* A late-specified return type is indicated by an initial '->'. */
20546 {
20547 /* DR 1207: 'this' is in scope in the trailing return type. */
20549 }
20552 {
20553 /* Consume the ->. */
20557 }
20559 /* Function declarations may be followed by a trailing
20560 requires-clause. */
20564 declarator->attributes
20568 declarator->attributes
20572 declarator->attributes
20577 {
20580 }
20583 }
20585 /* Parse a declarator-id.
20587 declarator-id:
20588 id-expression
20589 :: [opt] nested-name-specifier [opt] type-name
20591 In the `id-expression' case, the value returned is as for
20592 cp_parser_id_expression if the id-expression was an unqualified-id.
20593 If the id-expression was a qualified-id, then a SCOPE_REF is
20594 returned. The first operand is the scope (either a NAMESPACE_DECL
20595 or TREE_TYPE), but the second is still just a representation of an
20596 unqualified-id. */
20598 static tree
20600 {
20601 tree id;
20602 /* The expression must be an id-expression. Assume that qualified
20603 names are the names of types so that:
20605 template <class T>
20606 int S<T>::R::i = 3;
20608 will work; we must treat `S<T>::R' as the name of a type.
20609 Similarly, assume that qualified names are templates, where
20610 required, so that:
20612 template <class T>
20613 int S<T>::R<T>::i = 3;
20615 will work, too. */
20621 optional_p);
20625 }
20627 /* Parse a type-id.
20629 type-id:
20630 type-specifier-seq abstract-declarator [opt]
20632 Returns the TYPE specified. */
20634 static tree
20637 {
20638 cp_decl_specifier_seq type_specifier_seq;
20641 /* Parse the type-specifier-seq. */
20643 is_trailing_return,
20648 /* A bare template name as a template argument is a template template
20649 argument, not a placeholder, so fail parsing it as a type argument. */
20650 {
20654 }
20658 /* There might or might not be an abstract declarator. */
20660 /* Look for the declarator. */
20661 abstract_declarator
20666 /* Check to see if there really was a declarator. */
20671 /* The concepts TS allows 'auto' as a type-id. */
20673 /* None of the valid uses of 'auto' in C++14 involve the type-id
20674 nonterminal, but it is valid in a trailing-return-type. */
20677 {
20678 /* A type-id with type 'auto' is only ok if the abstract declarator
20679 is a function declarator with a late-specified return type.
20681 A type-id with 'auto' is also valid in a trailing-return-type
20682 in a compound-requirement. */
20689 else
20690 {
20693 {
20695 auto_node);
20697 tmpl);
20698 }
20699 else
20702 }
20703 }
20706 is_template_arg);
20707 }
20709 static tree
20711 {
20713 }
20715 static tree
20717 {
20718 tree r;
20720 parser->type_definition_forbidden_message
20725 {
20728 }
20730 }
20732 static tree
20734 {
20736 }
20738 /* Parse a type-specifier-seq.
20740 type-specifier-seq:
20741 type-specifier type-specifier-seq [opt]
20743 GNU extension:
20745 type-specifier-seq:
20746 attributes type-specifier-seq [opt]
20748 If IS_DECLARATION is true, we are at the start of a "condition" or
20749 exception-declaration, so we might be followed by a declarator-id.
20751 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20752 i.e. we've just seen "->".
20754 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20756 static void
20761 {
20766 /* Clear the TYPE_SPECIFIER_SEQ. */
20769 /* In the context of a trailing return type, enum E { } is an
20770 elaborated-type-specifier followed by a function-body, not an
20771 enum-specifier. */
20775 /* Parse the type-specifiers and attributes. */
20777 {
20778 tree type_specifier;
20781 /* Check for attributes first. */
20783 {
20788 }
20790 /* record the token of the beginning of the type specifier seq,
20791 for error reporting purposes*/
20795 /* Look for the type-specifier. */
20797 flags,
20798 type_specifier_seq,
20800 NULL,
20803 {
20804 /* If the first type-specifier could not be found, this is not a
20805 type-specifier-seq at all. */
20807 {
20808 /* Set in_declarator_p to avoid skipping to the semicolon. */
20820 }
20821 /* If subsequent type-specifiers could not be found, the
20822 type-specifier-seq is complete. */
20824 }
20827 /* The standard says that a condition can be:
20829 type-specifier-seq declarator = assignment-expression
20831 However, given:
20833 struct S {};
20834 if (int S = ...)
20836 we should treat the "S" as a declarator, not as a
20837 type-specifier. The standard doesn't say that explicitly for
20838 type-specifier-seq, but it does say that for
20839 decl-specifier-seq in an ordinary declaration. Perhaps it
20840 would be clearer just to allow a decl-specifier-seq here, and
20841 then add a semantic restriction that if any decl-specifiers
20842 that are not type-specifiers appear, the program is invalid. */
20845 }
20846 }
20848 /* Return whether the function currently being declared has an associated
20849 template parameter list. */
20851 static bool
20853 {
20866 }
20868 /* Parse a parameter-declaration-clause.
20870 parameter-declaration-clause:
20871 parameter-declaration-list [opt] ... [opt]
20872 parameter-declaration-list , ...
20874 Returns a representation for the parameter declarations. A return
20875 value of NULL indicates a parameter-declaration-clause consisting
20876 only of an ellipsis. */
20878 static tree
20880 {
20881 tree parameters;
20890 parser->auto_is_implicit_function_template_parm_p
20892 }
20898 && !processing_template_parmlist
20904 /* Peek at the next token. */
20906 /* Check for trivial parameter-declaration-clauses. */
20908 {
20909 /* Consume the `...' token. */
20912 }
20914 /* There are no parameters. */
20915 {
20916 #ifndef NO_IMPLICIT_EXTERN_C
20921 else
20922 #endif
20924 }
20925 /* Check for `(void)', too, which is a special case. */
20929 {
20930 /* Consume the `void' token. */
20932 /* There are no parameters. */
20934 }
20936 /* Parse the parameter-declaration-list. */
20938 /* If a parse error occurred while parsing the
20939 parameter-declaration-list, then the entire
20940 parameter-declaration-clause is erroneous. */
20944 /* Peek at the next token. */
20946 /* If it's a `,', the clause should terminate with an ellipsis. */
20948 {
20949 /* Consume the `,'. */
20951 /* Expect an ellipsis. */
20952 ellipsis_p
20954 }
20955 /* It might also be `...' if the optional trailing `,' was
20956 omitted. */
20958 {
20959 /* Consume the `...' token. */
20961 /* And remember that we saw it. */
20963 }
20964 else
20967 /* Finish the parameter list. */
20972 }
20974 /* Parse a parameter-declaration-list.
20976 parameter-declaration-list:
20977 parameter-declaration
20978 parameter-declaration-list , parameter-declaration
20980 Returns a representation of the parameter-declaration-list, as for
20981 cp_parser_parameter_declaration_clause. However, the
20982 `void_list_node' is never appended to the list. Upon return,
20983 *IS_ERROR will be true iff an error occurred. */
20985 static tree
20987 {
20993 /* Assume all will go well. */
20995 /* The special considerations that apply to a function within an
20996 unbraced linkage specifications do not apply to the parameters
20997 to the function. */
20998 saved_in_unbraced_linkage_specification_p
21002 /* Look for more parameters. */
21004 {
21012 /* Parse the parameter. */
21013 parameter
21018 /* We don't know yet if the enclosing context is deprecated, so wait
21019 and warn in grokparms if appropriate. */
21023 {
21024 /* If a function parameter pack was specified and an implicit template
21025 parameter was introduced during cp_parser_parameter_declaration,
21026 change any implicit parameters introduced into packs. */
21030 {
21038 }
21042 PARM,
21045 }
21049 /* If a parse error occurred parsing the parameter declaration,
21050 then the entire parameter-declaration-list is erroneous. */
21052 {
21056 }
21066 {
21070 }
21072 /* Add the new parameter to the list. */
21076 /* Peek at the next token. */
21079 /* These are for Objective-C++ */
21082 /* The parameter-declaration-list is complete. */
21085 {
21088 /* Peek at the next token. */
21090 /* If it's an ellipsis, then the list is complete. */
21093 /* Otherwise, there must be more parameters. Consume the
21094 `,'. */
21096 /* When parsing something like:
21098 int i(float f, double d)
21100 we can tell after seeing the declaration for "f" that we
21101 are not looking at an initialization of a variable "i",
21102 but rather at the declaration of a function "i".
21104 Due to the fact that the parsing of template arguments
21105 (as specified to a template-id) requires backtracking we
21106 cannot use this technique when inside a template argument
21107 list. */
21111 /* However, a parameter-declaration of the form
21112 "float(f)" (which is a valid declaration of a
21113 parameter "f") can also be interpreted as an
21114 expression (the conversion of "f" to "float"). */
21117 }
21118 else
21119 {
21127 }
21128 }
21130 parser->in_unbraced_linkage_specification_p
21133 /* Reset implicit_template_scope if we are about to leave the function
21134 parameter list that introduced it. Note that for out-of-line member
21135 definitions, there will be one or more class scopes before we get to
21136 the template parameter scope. */
21140 {
21144 {
21147 }
21148 }
21151 }
21153 /* Parse a parameter declaration.
21155 parameter-declaration:
21156 decl-specifier-seq ... [opt] declarator
21157 decl-specifier-seq declarator = assignment-expression
21158 decl-specifier-seq ... [opt] abstract-declarator [opt]
21159 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21161 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21162 declares a template parameter. (In that case, a non-nested `>'
21163 token encountered during the parsing of the assignment-expression
21164 is not interpreted as a greater-than operator.)
21166 Returns a representation of the parameter, or NULL if an error
21167 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21168 true iff the declarator is of the form "(p)". */
21174 {
21176 cp_decl_specifier_seq decl_specifiers;
21178 tree default_argument;
21183 /* In a template parameter, `>' is not an operator.
21185 [temp.param]
21187 When parsing a default template-argument for a non-type
21188 template-parameter, the first non-nested `>' is taken as the end
21189 of the template parameter-list rather than a greater-than
21190 operator. */
21192 /* Type definitions may not appear in parameter types. */
21194 parser->type_definition_forbidden_message
21197 /* Parse the declaration-specifiers. */
21199 CP_PARSER_FLAGS_NONE,
21203 /* Complain about missing 'typename' or other invalid type names. */
21208 /* If an error occurred, there's no reason to attempt to parse the
21209 rest of the declaration. */
21211 {
21214 }
21216 /* Peek at the next token. */
21219 /* If the next token is a `)', `,', `=', `>', or `...', then there
21220 is no declarator. However, when variadic templates are enabled,
21221 there may be a declarator following `...'. */
21226 {
21230 }
21231 /* Otherwise, there should be a declarator. */
21232 else
21233 {
21237 /* After seeing a decl-specifier-seq, if the next token is not a
21238 "(", there is no possibility that the code is a valid
21239 expression. Therefore, if parsing tentatively, we commit at
21240 this point. */
21242 /* In an expression context, having seen:
21244 (int((char ...
21246 we cannot be sure whether we are looking at a
21247 function-type (taking a "char" as a parameter) or a cast
21248 of some object of type "char" to "int". */
21254 /* Parse the declarator. */
21257 CP_PARSER_DECLARATOR_EITHER,
21259 parenthesized_p,
21263 /* After the declarator, allow more attributes. */
21264 decl_specifiers.attributes
21268 /* If the declarator is a template parameter pack, remember that and
21269 clear the flag in the declarator itself so we don't get errors
21270 from grokdeclarator. */
21272 {
21275 }
21276 }
21278 /* If the next token is an ellipsis, and we have not seen a declarator
21279 name, and if either the type of the declarator contains parameter
21280 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21281 for, eg, abbreviated integral type names), then we actually have a
21282 parameter pack expansion expression. Otherwise, leave the ellipsis
21283 for a C-style variadic function. */
21286 {
21297 {
21298 /* Consume the `...'. */
21302 /* Build a pack expansion type */
21307 else
21309 }
21310 }
21312 /* The restriction on defining new types applies only to the type
21313 of the parameter, not to the default argument. */
21316 /* If the next token is `=', then process a default argument. */
21318 {
21321 /* If we are defining a class, then the tokens that make up the
21322 default argument must be saved and processed later. */
21328 // A constrained-type-specifier may declare a type template-parameter.
21330 default_argument
21333 // A constrained-type-specifier may declare a template-template-parameter.
21335 default_argument
21338 /* Outside of a class definition, we can just parse the
21339 assignment-expression. */
21340 else
21341 default_argument
21345 {
21347 "default arguments are only "
21349 }
21351 || template_parameter_pack_p
21354 {
21355 /* Find the name of the parameter pack. */
21362 template_parm_p
21368 else
21370 template_parm_p
21377 }
21378 }
21379 else
21383 declarator,
21384 default_argument,
21385 template_parameter_pack_p);
21386 }
21388 /* Parse a default argument and return it.
21390 TEMPLATE_PARM_P is true if this is a default argument for a
21391 non-type template parameter. */
21392 static tree
21394 {
21400 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21401 set correctly. */
21404 /* Local variable names (and the `this' keyword) may not
21405 appear in a default argument. */
21408 /* Parse the assignment-expression. */
21413 /* The "this" pointer is not valid in a default argument. */
21415 {
21420 }
21421 default_argument
21423 /* Restore the "this" pointer. */
21425 {
21428 }
21437 }
21439 /* Parse a function-body.
21441 function-body:
21442 compound_statement */
21444 static void
21446 {
21450 }
21452 /* Parse a ctor-initializer-opt followed by a function-body. Return
21453 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21454 is true we are parsing a function-try-block. */
21456 static bool
21459 {
21467 /* Begin the function body. */
21469 /* Parse the optional ctor-initializer. */
21472 /* If we're parsing a constexpr constructor definition, we need
21473 to check that the constructor body is indeed empty. However,
21474 before we get to cp_parser_function_body lot of junk has been
21475 generated, so we can't just check that we have an empty block.
21476 Rather we take a snapshot of the outermost block, and check whether
21477 cp_parser_function_body changed its state. */
21479 {
21483 }
21484 /* Parse the function-body. */
21488 /* Finish the function body. */
21492 }
21494 /* Parse an initializer.
21496 initializer:
21497 = initializer-clause
21498 ( expression-list )
21500 Returns an expression representing the initializer. If no
21501 initializer is present, NULL_TREE is returned.
21503 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21504 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21505 set to TRUE if there is no initializer present. If there is an
21506 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21507 is set to true; otherwise it is set to false. */
21509 static tree
21512 {
21514 tree init;
21516 /* Peek at the next token. */
21519 /* Let our caller know whether or not this initializer was
21520 parenthesized. */
21522 /* Assume that the initializer is constant. */
21526 {
21527 /* Consume the `='. */
21529 /* Parse the initializer-clause. */
21531 }
21533 {
21538 non_constant_p);
21543 }
21545 {
21550 }
21551 else
21552 {
21553 /* Anything else is an error. */
21556 }
21562 }
21564 /* Parse an initializer-clause.
21566 initializer-clause:
21567 assignment-expression
21568 braced-init-list
21570 Returns an expression representing the initializer.
21572 If the `assignment-expression' production is used the value
21573 returned is simply a representation for the expression.
21575 Otherwise, calls cp_parser_braced_list. */
21577 static cp_expr
21579 {
21580 cp_expr initializer;
21582 /* Assume the expression is constant. */
21585 /* If it is not a `{', then we are looking at an
21586 assignment-expression. */
21588 {
21589 initializer
21592 non_constant_p);
21593 }
21594 else
21598 }
21600 /* Parse a brace-enclosed initializer list.
21602 braced-init-list:
21603 { initializer-list , [opt] }
21604 { }
21606 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21607 the elements of the initializer-list (or NULL, if the last
21608 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21609 NULL_TREE. There is no way to detect whether or not the optional
21610 trailing `,' was provided. NON_CONSTANT_P is as for
21611 cp_parser_initializer. */
21613 static cp_expr
21615 {
21616 tree initializer;
21619 /* Consume the `{' token. */
21621 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21623 /* If it's not a `}', then there is a non-trivial initializer. */
21625 {
21626 /* Parse the initializer list. */
21629 /* A trailing `,' token is allowed. */
21632 }
21633 else
21635 /* Now, there should be a trailing `}'. */
21641 /* Build a location of the form:
21642 { ... }
21643 ^~~~~~~
21644 with caret==start at the open brace, finish at the close brace. */
21648 }
21650 /* Consume tokens up to, and including, the next non-nested closing `]'.
21651 Returns true iff we found a closing `]'. */
21653 static bool
21655 {
21659 {
21663 {
21666 /* If we've run out of tokens, then there is no closing `]'. */
21675 {
21678 }
21683 }
21685 /* Consume the token. */
21687 }
21688 }
21690 /* Return true if we are looking at an array-designator, false otherwise. */
21692 static bool
21694 {
21695 /* Consume the `['. */
21700 /* Skip tokens until the next token is a closing square bracket.
21701 If we find the closing `]', and the next token is a `=', then
21702 we are looking at an array designator. */
21703 bool array_designator_p
21707 /* Roll back the tokens we skipped. */
21711 }
21713 /* Parse an initializer-list.
21715 initializer-list:
21716 initializer-clause ... [opt]
21717 initializer-list , initializer-clause ... [opt]
21719 GNU Extension:
21721 initializer-list:
21722 designation initializer-clause ...[opt]
21723 initializer-list , designation initializer-clause ...[opt]
21725 designation:
21726 . identifier =
21727 identifier :
21728 [ constant-expression ] =
21730 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21731 for the initializer. If the INDEX of the elt is non-NULL, it is the
21732 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21733 as for cp_parser_initializer. */
21737 {
21740 /* Assume all of the expressions are constant. */
21743 /* Parse the rest of the list. */
21745 {
21747 tree designator;
21748 tree initializer;
21751 /* If the next token is an identifier and the following one is a
21752 colon, we are looking at the GNU designated-initializer
21753 syntax. */
21757 {
21758 /* Warn the user that they are using an extension. */
21761 /* Consume the identifier. */
21763 /* Consume the `:'. */
21765 }
21766 /* Also handle the C99 syntax, '. id ='. */
21771 {
21772 /* Warn the user that they are using an extension. */
21775 /* Consume the `.'. */
21777 /* Consume the identifier. */
21779 /* Consume the `='. */
21781 }
21782 /* Also handle C99 array designators, '[ const ] ='. */
21786 {
21787 /* In C++11, [ could start a lambda-introducer. */
21793 {
21796 }
21797 else
21798 {
21803 }
21809 }
21810 else
21813 /* Parse the initializer. */
21816 /* If any clause is non-constant, so is the entire initializer. */
21820 /* If we have an ellipsis, this is an initializer pack
21821 expansion. */
21823 {
21824 /* Consume the `...'. */
21827 /* Turn the initializer into an initializer expansion. */
21829 }
21831 /* Add it to the vector. */
21834 /* If the next token is not a comma, we have reached the end of
21835 the list. */
21839 /* Peek at the next token. */
21841 /* If the next token is a `}', then we're still done. An
21842 initializer-clause can have a trailing `,' after the
21843 initializer-list and before the closing `}'. */
21847 /* Consume the `,' token. */
21849 }
21852 }
21854 /* Classes [gram.class] */
21856 /* Parse a class-name.
21858 class-name:
21859 identifier
21860 template-id
21862 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21863 to indicate that names looked up in dependent types should be
21864 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21865 keyword has been used to indicate that the name that appears next
21866 is a template. TAG_TYPE indicates the explicit tag given before
21867 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21868 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21869 is the class being defined in a class-head. If ENUM_OK is TRUE,
21870 enum-names are also accepted.
21872 Returns the TYPE_DECL representing the class. */
21874 static tree
21883 {
21884 tree decl;
21885 tree scope;
21890 /* All class-names start with an identifier. */
21893 {
21896 }
21898 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21899 to a template-id, so we save it here. */
21904 /* Any name names a type if we're following the `typename' keyword
21905 in a qualified name where the enclosing scope is type-dependent. */
21908 /* Handle the common case (an identifier, but not a template-id)
21909 efficiently. */
21912 {
21916 /* Look for the identifier. */
21920 /* If the next token isn't an identifier, we are certainly not
21921 looking at a class-name. */
21924 /* If we know this is a type-name, there's no need to look it
21925 up. */
21928 else
21929 {
21930 tree ambiguous_decls;
21931 /* If we already know that this lookup is ambiguous, then
21932 we've already issued an error message; there's no reason
21933 to check again. */
21935 {
21938 }
21939 /* If the next token is a `::', then the name must be a type
21940 name.
21942 [basic.lookup.qual]
21944 During the lookup for a name preceding the :: scope
21945 resolution operator, object, function, and enumerator
21946 names are ignored. */
21949 /* Look up the name. */
21951 tag_type,
21954 check_dependency_p,
21958 {
21962 }
21963 }
21964 }
21965 else
21966 {
21967 /* Try a template-id. */
21969 check_dependency_p,
21970 tag_type,
21971 is_declaration);
21974 }
21978 /* If this is a typename, create a TYPENAME_TYPE. */
21980 {
21985 }
21989 /* Check to see that it is really the name of a class. */
21993 /* Situations like this:
21995 template <typename T> struct A {
21996 typename T::template X<int>::I i;
21997 };
21999 are problematic. Is `T::template X<int>' a class-name? The
22000 standard does not seem to be definitive, but there is no other
22001 valid interpretation of the following `::'. Therefore, those
22002 names are considered class-names. */
22003 {
22007 }
22012 /* In Objective-C 2.0, a classname followed by '.' starts a
22013 dot-syntax expression, and it's not a type-name. */
22025 }
22027 /* Parse a class-specifier.
22029 class-specifier:
22030 class-head { member-specification [opt] }
22032 Returns the TREE_TYPE representing the class. */
22034 static tree
22036 {
22037 tree type;
22051 /* Parse the class-head. */
22054 /* If the class-head was a semantic disaster, skip the entire body
22055 of the class. */
22057 {
22061 }
22063 /* Look for the `{'. */
22065 {
22068 }
22073 /* Issue an error message if type-definitions are forbidden here. */
22075 /* Remember that we are defining one more class. */
22077 /* Inside the class, surrounding template-parameter-lists do not
22078 apply. */
22079 saved_num_template_parameter_lists
22082 /* We are not in a function body. */
22085 /* Or in a loop. */
22088 /* Or in a switch. */
22091 /* We are not immediately inside an extern "lang" block. */
22092 saved_in_unbraced_linkage_specification_p
22096 // Associate constraints with the type.
22100 /* Start the class. */
22102 {
22105 }
22109 /* If the type is erroneous, skip the entire body of the class. */
22111 else
22112 /* Parse the member-specification. */
22115 /* Look for the trailing `}'. */
22117 /* Look for trailing attributes to apply to this class. */
22125 /* We've finished a type definition. Check for the common syntax
22126 error of forgetting a semicolon after the definition. We need to
22127 be careful, as we can't just check for not-a-semicolon and be done
22128 with it; the user might have typed:
22130 class X { } c = ...;
22131 class X { } *p = ...;
22133 and so forth. Instead, enumerate all the possible tokens that
22134 might follow this production; if we don't see one of them, then
22135 complain and silently insert the semicolon. */
22136 {
22141 /* Don't try to parse c++11 attributes here. As per the
22142 grammar, that should be a task for
22143 cp_parser_decl_specifier_seq. */
22147 {
22158 /* While it's legal for type qualifiers and storage class
22159 specifiers to follow type definitions in the grammar, only
22160 compiler testsuites contain code like that. Assume that if
22161 we see such code, then what we're really seeing is a case
22162 like:
22164 class X { }
22165 const <type> var = ...;
22167 or
22169 class Y { }
22170 static <type> func (...) ...
22172 i.e. the qualifier or specifier applies to the next
22173 declaration. To do so, however, we need to look ahead one
22174 more token to see if *that* token is a type specifier.
22176 This code could be improved to handle:
22178 class Z { }
22179 static const <type> var = ...; */
22182 {
22185 /* Handling user-defined types here would be nice, but very
22186 tricky. */
22187 want_semicolon
22190 }
22194 }
22196 /* If we don't have a type, then something is very wrong and we
22197 shouldn't try to do anything clever. Likewise for not seeing the
22198 closing brace. */
22200 {
22201 /* Locate the closing brace. */
22202 cp_token_position prev
22207 /* We want to suggest insertion of a ';' immediately *after* the
22208 closing brace, so, if we can, offset the location by 1 column. */
22215 /* If we successfully offset the location, suggest the fix-it. */
22228 else
22231 /* Unget one token and smash it to look as though we encountered
22232 a semicolon in the input stream. */
22237 }
22238 }
22240 /* If this class is not itself within the scope of another class,
22241 then we need to parse the bodies of all of the queued function
22242 definitions. Note that the queued functions defined in a class
22243 are not always processed immediately following the
22244 class-specifier for that class. Consider:
22246 struct A {
22247 struct B { void f() { sizeof (A); } };
22248 };
22250 If `f' were processed before the processing of `A' were
22251 completed, there would be no way to compute the size of `A'.
22252 Note that the nesting we are interested in here is lexical --
22253 not the semantic nesting given by TYPE_CONTEXT. In particular,
22254 for:
22256 struct A { struct B; };
22257 struct A::B { void f() { } };
22259 there is no need to delay the parsing of `A::B::f'. */
22261 {
22262 tree decl;
22269 /* In a first pass, parse default arguments to the functions.
22270 Then, in a second pass, parse the bodies of the functions.
22271 This two-phased approach handles cases like:
22273 struct S {
22274 void f() { g(); }
22275 void g(int i = 3);
22276 };
22278 */
22280 {
22282 /* If there are default arguments that have not yet been processed,
22283 take care of them now. */
22285 {
22290 }
22291 /* Make sure that any template parameters are in scope. */
22293 /* Parse the default argument expressions. */
22295 /* Remove any template parameters from the symbol table. */
22297 }
22299 /* Now parse any NSDMIs. */
22303 {
22305 {
22310 }
22313 }
22320 /* Now do some post-NSDMI bookkeeping. */
22326 /* Now parse the body of the functions. */
22328 {
22329 /* OpenMP UDRs need to be parsed before all other functions. */
22336 }
22337 else
22341 }
22342 else
22345 /* Put back any saved access checks. */
22348 /* Restore saved state. */
22352 parser->num_template_parameter_lists
22354 parser->in_unbraced_linkage_specification_p
22358 }
22360 static tree
22362 {
22363 tree ret;
22368 }
22370 /* Parse a class-head.
22372 class-head:
22373 class-key identifier [opt] base-clause [opt]
22374 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22375 class-key nested-name-specifier [opt] template-id
22376 base-clause [opt]
22378 class-virt-specifier:
22379 final
22381 GNU Extensions:
22382 class-key attributes identifier [opt] base-clause [opt]
22383 class-key attributes nested-name-specifier identifier base-clause [opt]
22384 class-key attributes nested-name-specifier [opt] template-id
22385 base-clause [opt]
22387 Upon return BASES is initialized to the list of base classes (or
22388 NULL, if there are none) in the same form returned by
22389 cp_parser_base_clause.
22391 Returns the TYPE of the indicated class. Sets
22392 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22393 involving a nested-name-specifier was used, and FALSE otherwise.
22395 Returns error_mark_node if this is not a class-head.
22397 Returns NULL_TREE if the class-head is syntactically valid, but
22398 semantically invalid in a way that means we should skip the entire
22399 body of the class. */
22401 static tree
22404 {
22405 tree nested_name_specifier;
22409 tree attributes;
22410 tree bases;
22420 /* Assume no nested-name-specifier will be present. */
22422 /* Assume no template parameter lists will be used in defining the
22423 type. */
22427 /* Look for the class-key. */
22434 /* Parse the attributes. */
22437 /* If the next token is `::', that is invalid -- but sometimes
22438 people do try to write:
22440 struct ::S {};
22442 Handle this gracefully by accepting the extra qualifier, and then
22443 issuing an error about it later if this really is a
22444 class-head. If it turns out just to be an elaborated type
22445 specifier, remain silent. */
22451 /* Determine the name of the class. Begin by looking for an
22452 optional nested-name-specifier. */
22454 nested_name_specifier
22460 /* If there was a nested-name-specifier, then there *must* be an
22461 identifier. */
22463 {
22465 /* Although the grammar says `identifier', it really means
22466 `class-name' or `template-name'. You are only allowed to
22467 define a class that has already been declared with this
22468 syntax.
22470 The proposed resolution for Core Issue 180 says that wherever
22471 you see `class T::X' you should treat `X' as a type-name.
22473 It is OK to define an inaccessible class; for example:
22475 class A { class B; };
22476 class A::B {};
22478 We do not know if we will see a class-name, or a
22479 template-name. We look for a class-name first, in case the
22480 class-name is a template-id; if we looked for the
22481 template-name first we would stop after the template-name. */
22486 class_type,
22490 /* If that didn't work, ignore the nested-name-specifier. */
22492 {
22498 }
22499 /* If we could not find a corresponding TYPE, treat this
22500 declaration like an unqualified declaration. */
22503 /* Otherwise, count the number of templates used in TYPE and its
22504 containing scopes. */
22505 else
22506 {
22507 tree scope;
22519 }
22520 }
22521 /* Otherwise, the identifier is optional. */
22522 else
22523 {
22524 /* We don't know whether what comes next is a template-id,
22525 an identifier, or nothing at all. */
22527 /* Check for a template-id. */
22532 class_key,
22534 /* If that didn't work, it could still be an identifier. */
22536 {
22538 {
22541 }
22542 else
22544 }
22545 else
22546 {
22549 }
22550 }
22555 {
22557 class_key,
22559 }
22562 /* If it's not a `:' or a `{' then we can't really be looking at a
22563 class-head, since a class-head only appears as part of a
22564 class-specifier. We have to detect this situation before calling
22565 xref_tag, since that has irreversible side-effects. */
22567 {
22571 }
22573 /* At this point, we're going ahead with the class-specifier, even
22574 if some other problem occurs. */
22577 {
22582 }
22583 /* Issue the error about the overly-qualified name now. */
22585 {
22590 }
22592 {
22597 }
22599 {
22600 tree scope;
22602 /* Reject typedef-names in class heads. */
22604 {
22607 type);
22610 }
22612 /* Figure out in what scope the declaration is being placed. */
22614 /* If that scope does not contain the scope in which the
22615 class was originally declared, the program is invalid. */
22617 {
22620 "declaration of %qD in namespace %qD which does not "
22623 else
22629 }
22630 /* [dcl.meaning]
22632 A declarator-id shall not be qualified except for the
22633 definition of a ... nested class outside of its class
22634 ... [or] the definition or explicit instantiation of a
22635 class member of a namespace outside of its namespace. */
22637 {
22642 }
22643 }
22644 /* An explicit-specialization must be preceded by "template <>". If
22645 it is not, try to recover gracefully. */
22648 && !processing_template_parmlist
22650 {
22651 /* Build a location of this form:
22652 struct typename <ARGS>
22653 ^~~~~~~~~~~~~~~~~~~~~~
22654 with caret==start at the start token, and
22655 finishing at the end of the type. */
22656 location_t reported_loc
22658 class_head_start_location,
22663 error_at_rich_loc
22667 /* Take the same action that would have been taken by
22668 cp_parser_explicit_specialization. */
22671 }
22672 /* There must be no "return" statements between this point and the
22673 end of this function; set "type "to the correct return value and
22674 use "goto done;" to return. */
22675 /* Make sure that the right number of template parameters were
22676 present. */
22680 {
22681 /* If something went wrong, there is no point in even trying to
22682 process the class-definition. */
22685 }
22687 /* Look up the type. */
22689 {
22693 {
22697 }
22698 else
22699 {
22703 /* Check the scope while we still know whether or not we had a
22704 nested-name-specifier. */
22707 }
22710 }
22712 {
22713 tree class_type;
22715 /* Given:
22717 template <typename T> struct S { struct T };
22718 template <typename T> struct S<T>::T { };
22720 we will get a TYPENAME_TYPE when processing the definition of
22721 `S::T'. We need to resolve it to the actual type before we
22722 try to define it. */
22724 {
22729 else
22730 {
22733 }
22734 }
22738 {
22741 }
22744 /* Enter the scope indicated by the nested-name-specifier. */
22746 /* Get the canonical version of this type. */
22748 /* Call push_template_decl if it seems like we should be defining a
22749 template either from the template headers or the type we're
22750 defining, so that we diagnose both extra and missing headers. */
22754 {
22757 {
22760 }
22761 }
22765 }
22767 {
22768 /* If the class was unnamed, create a dummy name. */
22772 ? ts_within_enclosing_non_class
22776 }
22778 /* Indicate whether this class was declared as a `class' or as a
22779 `struct'. */
22784 /* If this type was already complete, and we see another definition,
22785 that's an error. */
22787 {
22789 type);
22791 type);
22794 }
22799 {
22800 /* Apply attributes now, before any use of the class as a template
22801 argument in its base list. */
22804 }
22806 /* We will have entered the scope containing the class; the names of
22807 base classes should be looked up in that context. For example:
22809 struct A { struct B {}; struct C; };
22810 struct A::C : B {};
22812 is valid. */
22814 /* Get the list of base-classes, if there is one. */
22816 {
22817 /* PR59482: enter the class scope so that base-specifiers are looked
22818 up correctly. */
22822 /* PR59482: get out of the previously pushed class scope so that the
22823 subsequent pops pop the right thing. */
22826 }
22827 else
22830 /* If we're really defining a class, process the base classes.
22831 If they're invalid, fail. */
22835 done:
22836 /* Leave the scope given by the nested-name-specifier. We will
22837 enter the class scope itself while processing the members. */
22842 {
22845 }
22851 out:
22854 }
22856 /* Parse a class-key.
22858 class-key:
22859 class
22860 struct
22861 union
22863 Returns the kind of class-key specified, or none_type to indicate
22864 error. */
22866 static enum tag_types
22868 {
22872 /* Look for the class-key. */
22877 /* Check to see if the TOKEN is a class-key. */
22882 }
22884 /* Parse a type-parameter-key.
22886 type-parameter-key:
22887 class
22888 typename
22889 */
22891 static void
22893 {
22894 /* Look for the type-parameter-key. */
22898 {
22901 /* typename is not allowed in a template template parameter
22902 by the standard until C++1Z. */
22904 "ISO C++ forbids typename key in template template parameter;"
22906 }
22907 else
22911 }
22913 /* Parse an (optional) member-specification.
22915 member-specification:
22916 member-declaration member-specification [opt]
22917 access-specifier : member-specification [opt] */
22919 static void
22921 {
22923 {
22927 /* Peek at the next token. */
22929 /* If it's a `}', or EOF then we've seen all the members. */
22935 /* See if this token is a keyword. */
22938 {
22942 /* Consume the access-specifier. */
22944 /* Remember which access-specifier is active. */
22946 /* Look for the `:'. */
22951 /* Accept #pragmas at class scope. */
22953 {
22956 }
22958 /* Otherwise, the next construction must be a
22959 member-declaration. */
22961 }
22962 }
22963 }
22965 /* Parse a member-declaration.
22967 member-declaration:
22968 decl-specifier-seq [opt] member-declarator-list [opt] ;
22969 function-definition ; [opt]
22970 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22971 using-declaration
22972 template-declaration
22973 alias-declaration
22975 member-declarator-list:
22976 member-declarator
22977 member-declarator-list , member-declarator
22979 member-declarator:
22980 declarator pure-specifier [opt]
22981 declarator constant-initializer [opt]
22982 identifier [opt] : constant-expression
22984 GNU Extensions:
22986 member-declaration:
22987 __extension__ member-declaration
22989 member-declarator:
22990 declarator attributes [opt] pure-specifier [opt]
22991 declarator attributes [opt] constant-initializer [opt]
22992 identifier [opt] attributes [opt] : constant-expression
22994 C++0x Extensions:
22996 member-declaration:
22997 static_assert-declaration */
22999 static void
23001 {
23002 cp_decl_specifier_seq decl_specifiers;
23003 tree prefix_attributes;
23004 tree decl;
23013 /* Check for the `__extension__' keyword. */
23015 {
23016 /* Recurse. */
23018 /* Restore the old value of the PEDANTIC flag. */
23022 }
23024 /* Check for a template-declaration. */
23026 {
23027 /* An explicit specialization here is an error condition, and we
23028 expect the specialization handler to detect and report this. */
23032 else
23036 }
23037 /* Check for a template introduction. */
23041 /* Check for a using-declaration. */
23043 {
23045 {
23046 /* Parse the using-declaration. */
23050 }
23051 else
23052 {
23053 tree decl;
23057 /* Note that if we actually see the '=' token after the
23058 identifier, cp_parser_alias_declaration commits the
23059 tentative parse. In that case, we really expect an
23060 alias-declaration. Otherwise, we expect a using
23061 declaration. */
23062 alias_decl_expected =
23068 else
23072 }
23073 }
23075 /* Check for @defs. */
23077 {
23082 {
23087 }
23089 }
23091 /* If the next token is `static_assert' we have a static assertion. */
23093 {
23096 }
23103 /* Parse the decl-specifier-seq. */
23106 CP_PARSER_FLAGS_OPTIONAL,
23109 /* Check for an invalid type-name. */
23113 /* If there is no declarator, then the decl-specifier-seq should
23114 specify a type. */
23116 {
23117 /* If there was no decl-specifier-seq, and the next token is a
23118 `;', then we have something like:
23120 struct S { ; };
23122 [class.mem]
23124 Each member-declaration shall declare at least one member
23125 name of the class. */
23127 {
23131 }
23132 else
23133 {
23134 tree type;
23136 /* See if this declaration is a friend. */
23138 /* If there were decl-specifiers, check to see if there was
23139 a class-declaration. */
23142 /* Nested classes have already been added to the class, but
23143 a `friend' needs to be explicitly registered. */
23145 {
23146 /* If the `friend' keyword was present, the friend must
23147 be introduced with a class-key. */
23150 "in C++03 a class-key must be used "
23152 /* In this case:
23154 template <typename T> struct A {
23155 friend struct A<T>::B;
23156 };
23158 A<T>::B will be represented by a TYPENAME_TYPE, and
23159 therefore not recognized by check_tag_decl. */
23161 {
23165 }
23168 "friend declaration does not name a class or "
23170 else
23173 }
23174 /* If there is no TYPE, an error message will already have
23175 been issued. */
23177 ;
23178 /* An anonymous aggregate has to be handled specially; such
23179 a declaration really declares a data member (with a
23180 particular type), as opposed to a nested class. */
23182 {
23183 /* C++11 9.5/6. */
23186 "a storage class on an anonymous aggregate "
23189 /* Remove constructors and such from TYPE, now that we
23190 know it is an anonymous aggregate. */
23192 /* And make the corresponding data member. */
23195 /* Add it to the class. */
23197 }
23198 else
23199 cp_parser_check_access_in_redeclaration
23202 }
23203 }
23204 else
23205 {
23208 /* Clear attributes from the decl_specifiers but keep them
23209 around as prefix attributes that apply them to the entity
23210 being declared. */
23214 /* See if these declarations will be friends. */
23217 /* Keep going until we hit the `;' at the end of the
23218 declaration. */
23220 {
23222 tree first_attribute;
23224 /* Peek at the next token. */
23227 /* Check for a bitfield declaration. */
23232 {
23233 tree identifier;
23234 tree width;
23236 /* Get the name of the bitfield. Note that we cannot just
23237 check TOKEN here because it may have been invalidated by
23238 the call to cp_lexer_peek_nth_token above. */
23241 else
23244 /* Consume the `:' token. */
23246 /* Get the width of the bitfield. */
23247 width
23250 /* Look for attributes that apply to the bitfield. */
23252 /* Remember which attributes are prefix attributes and
23253 which are not. */
23255 /* Combine the attributes. */
23258 /* Create the bitfield declaration. */
23261 identifier,
23262 sfk_none)
23265 width,
23266 attributes);
23267 }
23268 else
23269 {
23271 tree initializer;
23272 tree asm_specification;
23275 /* Parse the declarator. */
23276 declarator
23281 friend_p);
23283 /* If something went wrong parsing the declarator, make sure
23284 that we at least consume some tokens. */
23286 {
23287 /* Skip to the end of the statement. */
23289 /* If the next token is not a semicolon, that is
23290 probably because we just skipped over the body of
23291 a function. So, we consume a semicolon if
23292 present, but do not issue an error message if it
23293 is not present. */
23295 CPP_SEMICOLON))
23298 }
23301 cp_parser_check_for_definition_in_return_type
23305 /* Look for an asm-specification. */
23307 /* Look for attributes that apply to the declaration. */
23309 /* Remember which attributes are prefix attributes and
23310 which are not. */
23312 /* Combine the attributes. */
23315 /* If it's an `=', then we have a constant-initializer or a
23316 pure-specifier. It is not correct to parse the
23317 initializer before registering the member declaration
23318 since the member declaration should be in scope while
23319 its initializer is processed. However, the rest of the
23320 front end does not yet provide an interface that allows
23321 us to handle this correctly. */
23323 {
23324 /* In [class.mem]:
23326 A pure-specifier shall be used only in the declaration of
23327 a virtual function.
23329 A member-declarator can contain a constant-initializer
23330 only if it declares a static member of integral or
23331 enumeration type.
23333 Therefore, if the DECLARATOR is for a function, we look
23334 for a pure-specifier; otherwise, we look for a
23335 constant-initializer. When we call `grokfield', it will
23336 perform more stringent semantics checks. */
23348 {
23350 /* Don't require a constant rvalue in C++11, since we
23351 might want a reference constant. We'll enforce
23352 constancy later. */
23354 /* Parse the initializer. */
23357 }
23358 else
23359 /* Parse the initializer. */
23361 }
23364 {
23368 else
23370 }
23371 /* Otherwise, there is no initializer. */
23372 else
23375 /* See if we are probably looking at a function
23376 definition. We are certainly not looking at a
23377 member-declarator. Calling `grokfield' has
23378 side-effects, so we must not do it unless we are sure
23379 that we are looking at a member-declarator. */
23382 {
23383 /* The grammar does not allow a pure-specifier to be
23384 used when a member function is defined. (It is
23385 possible that this fact is an oversight in the
23386 standard, since a pure function may be defined
23387 outside of the class-specifier. */
23393 declarator,
23394 attributes);
23397 /* If the member was not a friend, declare it here. */
23400 /* Peek at the next token. */
23402 /* If the next token is a semicolon, consume it. */
23404 {
23405 location_t semicolon_loc
23410 "extra %<;%> after in-class "
23412 }
23414 }
23415 else
23418 /* Create the declaration. */
23423 {
23426 else
23428 }
23429 }
23434 /* Reset PREFIX_ATTRIBUTES. */
23440 /* If there is any qualification still in effect, clear it
23441 now; we will be starting fresh with the next declarator. */
23445 /* If it's a `,', then there are more declarators. */
23447 {
23450 {
23454 }
23455 }
23456 /* If the next token isn't a `;', then we have a parse error. */
23458 CPP_SEMICOLON))
23459 {
23460 /* The next token might be a ways away from where the
23461 actual semicolon is missing. Find the previous token
23462 and use that for our error position. */
23467 /* Assume that the user meant to provide a semicolon. If
23468 we were to cp_parser_skip_to_end_of_statement, we might
23469 skip to a semicolon inside a member function definition
23470 and issue nonsensical error messages. */
23472 }
23475 {
23476 /* Add DECL to the list of members. */
23478 /* Explicitly include, eg, NSDMIs, for better error
23479 recovery (c++/58650). */
23488 /* Add DECL to the queue of NSDMI to be parsed later. */
23490 }
23494 }
23495 }
23498 out:
23500 }
23502 /* Parse a pure-specifier.
23504 pure-specifier:
23505 = 0
23507 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23508 Otherwise, ERROR_MARK_NODE is returned. */
23510 static tree
23512 {
23515 /* Look for the `=' token. */
23518 /* Look for the `0' token. */
23527 /* Accept = default or = delete in c++0x mode. */
23530 {
23533 }
23535 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23537 {
23542 }
23544 {
23547 }
23550 }
23552 /* Parse a constant-initializer.
23554 constant-initializer:
23555 = constant-expression
23557 Returns a representation of the constant-expression. */
23559 static tree
23561 {
23562 /* Look for the `=' token. */
23566 /* It is invalid to write:
23568 struct S { static const int i = { 7 }; };
23570 */
23572 {
23575 /* Consume the opening brace. */
23577 /* Skip the initializer. */
23579 /* Look for the trailing `}'. */
23583 }
23586 }
23588 /* Derived classes [gram.class.derived] */
23590 /* Parse a base-clause.
23592 base-clause:
23593 : base-specifier-list
23595 base-specifier-list:
23596 base-specifier ... [opt]
23597 base-specifier-list , base-specifier ... [opt]
23599 Returns a TREE_LIST representing the base-classes, in the order in
23600 which they were declared. The representation of each node is as
23601 described by cp_parser_base_specifier.
23603 In the case that no bases are specified, this function will return
23604 NULL_TREE, not ERROR_MARK_NODE. */
23606 static tree
23608 {
23611 /* Look for the `:' that begins the list. */
23614 /* Scan the base-specifier-list. */
23616 {
23618 tree base;
23621 /* Look for the base-specifier. */
23623 /* Look for the (optional) ellipsis. */
23625 {
23626 /* Consume the `...'. */
23630 }
23632 /* Add BASE to the front of the list. */
23634 {
23636 /* Make this a pack expansion type. */
23640 {
23643 }
23644 }
23645 /* Peek at the next token. */
23647 /* If it's not a comma, then the list is complete. */
23650 /* Consume the `,'. */
23652 }
23654 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23655 base class had a qualified name. However, the next name that
23656 appears is certainly not qualified. */
23662 }
23664 /* Parse a base-specifier.
23666 base-specifier:
23667 :: [opt] nested-name-specifier [opt] class-name
23668 virtual access-specifier [opt] :: [opt] nested-name-specifier
23669 [opt] class-name
23670 access-specifier virtual [opt] :: [opt] nested-name-specifier
23671 [opt] class-name
23673 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23674 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23675 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23676 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23678 static tree
23680 {
23688 tree type;
23690 /* Process the optional `virtual' and `access-specifier'. */
23692 {
23693 /* Peek at the next token. */
23695 /* Process `virtual'. */
23697 {
23699 /* If `virtual' appears more than once, issue an error. */
23701 {
23705 }
23709 /* Consume the `virtual' token. */
23717 /* If more than one access specifier appears, issue an
23718 error. */
23721 {
23725 }
23729 /* Consume the access-specifier. */
23737 }
23738 }
23739 /* It is not uncommon to see programs mechanically, erroneously, use
23740 the 'typename' keyword to denote (dependent) qualified types
23741 as base classes. */
23743 {
23748 else
23750 "keyword %<typename%> not allowed in this context "
23753 }
23755 /* Look for the optional `::' operator. */
23757 /* Look for the nested-name-specifier. The simplest way to
23758 implement:
23760 [temp.res]
23762 The keyword `typename' is not permitted in a base-specifier or
23763 mem-initializer; in these contexts a qualified name that
23764 depends on a template-parameter is implicitly assumed to be a
23765 type name.
23767 is to pretend that we have seen the `typename' keyword at this
23768 point. */
23774 /* If the base class is given by a qualified name, assume that names
23775 we see are type names or templates, as appropriate. */
23781 /* DR 950 allows decltype as a base-specifier. */
23783 else
23784 {
23785 /* Otherwise, look for the class-name. */
23787 class_scope_p,
23788 template_p,
23789 typename_type,
23794 }
23800 }
23802 /* Exception handling [gram.exception] */
23804 /* Parse an (optional) noexcept-specification.
23806 noexcept-specification:
23807 noexcept ( constant-expression ) [opt]
23809 If no noexcept-specification is present, returns NULL_TREE.
23810 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23811 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23812 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23813 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23814 in which case a boolean condition is returned instead. */
23816 static tree
23821 {
23825 /* Peek at the next token. */
23828 /* Is it a noexcept-specification? */
23830 {
23831 tree expr;
23835 {
23839 {
23840 /* Types may not be defined in an exception-specification. */
23842 parser->type_definition_forbidden_message
23847 /* Restore the saved message. */
23849 }
23850 else
23851 {
23854 }
23857 }
23858 else
23859 {
23863 }
23865 /* We cannot build a noexcept-spec right away because this will check
23866 that expr is a constexpr. */
23869 else
23871 }
23872 else
23874 }
23876 /* Parse an (optional) exception-specification.
23878 exception-specification:
23879 throw ( type-id-list [opt] )
23881 Returns a TREE_LIST representing the exception-specification. The
23882 TREE_VALUE of each node is a type. */
23884 static tree
23886 {
23888 tree type_id_list;
23891 /* Peek at the next token. */
23894 /* Is it a noexcept-specification? */
23900 /* If it's not `throw', then there's no exception-specification. */
23906 /* Consume the `throw'. */
23909 /* Look for the `('. */
23912 /* Peek at the next token. */
23914 /* If it's not a `)', then there is a type-id-list. */
23916 {
23917 /* Types may not be defined in an exception-specification. */
23919 parser->type_definition_forbidden_message
23921 /* Parse the type-id-list. */
23923 /* Restore the saved message. */
23927 {
23931 }
23934 "dynamic exception specifications are deprecated in "
23936 }
23937 /* In C++17, throw() is equivalent to noexcept (true). throw()
23938 is deprecated in C++11 and above as well, but is still widely used,
23939 so don't warn about it yet. */
23942 else
23945 /* Look for the `)'. */
23949 }
23951 /* Parse an (optional) type-id-list.
23953 type-id-list:
23954 type-id ... [opt]
23955 type-id-list , type-id ... [opt]
23957 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23958 in the order that the types were presented. */
23960 static tree
23962 {
23966 {
23968 tree type;
23972 /* Get the next type-id. */
23974 /* Check for invalid 'auto'. */
23976 {
23980 }
23981 /* Parse the optional ellipsis. */
23983 {
23984 /* Consume the `...'. */
23987 /* Turn the type into a pack expansion expression. */
23989 }
23990 /* Add it to the list. */
23992 /* Peek at the next token. */
23994 /* If it is not a `,', we are done. */
23997 /* Consume the `,'. */
23999 }
24002 }
24004 /* Parse a try-block.
24006 try-block:
24007 try compound-statement handler-seq */
24009 static tree
24011 {
24012 tree try_block;
24026 }
24028 /* Parse a function-try-block.
24030 function-try-block:
24031 try ctor-initializer [opt] function-body handler-seq */
24033 static bool
24035 {
24036 tree compound_stmt;
24037 tree try_block;
24040 /* Look for the `try' keyword. */
24043 /* Let the rest of the front end know where we are. */
24045 /* Parse the function-body. */
24046 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24048 /* We're done with the `try' part. */
24050 /* Parse the handlers. */
24052 /* We're done with the handlers. */
24056 }
24058 /* Parse a handler-seq.
24060 handler-seq:
24061 handler handler-seq [opt] */
24063 static void
24065 {
24067 {
24070 /* Parse the handler. */
24072 /* Peek at the next token. */
24074 /* If it's not `catch' then there are no more handlers. */
24077 }
24078 }
24080 /* Parse a handler.
24082 handler:
24083 catch ( exception-declaration ) compound-statement */
24085 static void
24087 {
24088 tree handler;
24089 tree declaration;
24099 }
24101 /* Parse an exception-declaration.
24103 exception-declaration:
24104 type-specifier-seq declarator
24105 type-specifier-seq abstract-declarator
24106 type-specifier-seq
24107 ...
24109 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24110 ellipsis variant is used. */
24112 static tree
24114 {
24115 cp_decl_specifier_seq type_specifiers;
24119 /* If it's an ellipsis, it's easy to handle. */
24121 {
24122 /* Consume the `...' token. */
24125 }
24127 /* Types may not be defined in exception-declarations. */
24129 parser->type_definition_forbidden_message
24132 /* Parse the type-specifier-seq. */
24136 /* If it's a `)', then there is no declarator. */
24139 else
24146 /* Restore the saved message. */
24153 }
24155 /* Parse a throw-expression.
24157 throw-expression:
24158 throw assignment-expression [opt]
24160 Returns a THROW_EXPR representing the throw-expression. */
24162 static tree
24164 {
24165 tree expression;
24170 /* Figure out whether or not there is an assignment-expression
24171 following the "throw" keyword. */
24179 else
24183 }
24185 /* GNU Extensions */
24187 /* Parse an (optional) asm-specification.
24189 asm-specification:
24190 asm ( string-literal )
24192 If the asm-specification is present, returns a STRING_CST
24193 corresponding to the string-literal. Otherwise, returns
24194 NULL_TREE. */
24196 static tree
24198 {
24200 tree asm_specification;
24202 /* Peek at the next token. */
24204 /* If the next token isn't the `asm' keyword, then there's no
24205 asm-specification. */
24209 /* Consume the `asm' token. */
24211 /* Look for the `('. */
24214 /* Look for the string-literal. */
24217 /* Look for the `)'. */
24221 }
24223 /* Parse an asm-operand-list.
24225 asm-operand-list:
24226 asm-operand
24227 asm-operand-list , asm-operand
24229 asm-operand:
24230 string-literal ( expression )
24231 [ string-literal ] string-literal ( expression )
24233 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24234 each node is the expression. The TREE_PURPOSE is itself a
24235 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24236 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24237 is a STRING_CST for the string literal before the parenthesis. Returns
24238 ERROR_MARK_NODE if any of the operands are invalid. */
24240 static tree
24242 {
24247 {
24248 tree string_literal;
24249 tree expression;
24250 tree name;
24253 {
24254 /* Consume the `[' token. */
24256 /* Read the operand name. */
24261 /* Look for the closing `]'. */
24263 }
24264 else
24266 /* Look for the string-literal. */
24269 /* Look for the `('. */
24271 /* Parse the expression. */
24273 /* Look for the `)'. */
24281 /* Add this operand to the list. */
24283 expression,
24284 asm_operands);
24285 /* If the next token is not a `,', there are no more
24286 operands. */
24289 /* Consume the `,'. */
24291 }
24294 }
24296 /* Parse an asm-clobber-list.
24298 asm-clobber-list:
24299 string-literal
24300 asm-clobber-list , string-literal
24302 Returns a TREE_LIST, indicating the clobbers in the order that they
24303 appeared. The TREE_VALUE of each node is a STRING_CST. */
24305 static tree
24307 {
24311 {
24312 tree string_literal;
24314 /* Look for the string literal. */
24316 /* Add it to the list. */
24318 /* If the next token is not a `,', then the list is
24319 complete. */
24322 /* Consume the `,' token. */
24324 }
24327 }
24329 /* Parse an asm-label-list.
24331 asm-label-list:
24332 identifier
24333 asm-label-list , identifier
24335 Returns a TREE_LIST, indicating the labels in the order that they
24336 appeared. The TREE_VALUE of each node is a label. */
24338 static tree
24340 {
24344 {
24347 /* Look for the identifier. */
24350 {
24353 {
24359 }
24360 }
24361 /* If the next token is not a `,', then the list is
24362 complete. */
24365 /* Consume the `,' token. */
24367 }
24370 }
24372 /* Return TRUE iff the next tokens in the stream are possibly the
24373 beginning of a GNU extension attribute. */
24375 static bool
24377 {
24379 }
24381 /* Return TRUE iff the next tokens in the stream are possibly the
24382 beginning of a standard C++-11 attribute specifier. */
24384 static bool
24386 {
24388 }
24390 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24391 beginning of a standard C++-11 attribute specifier. */
24393 static bool
24395 {
24403 }
24405 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24406 beginning of a GNU extension attribute. */
24408 static bool
24410 {
24414 }
24416 /* Return true iff the next tokens can be the beginning of either a
24417 GNU attribute list, or a standard C++11 attribute sequence. */
24419 static bool
24421 {
24424 }
24426 /* Return true iff the next Nth tokens can be the beginning of either
24427 a GNU attribute list, or a standard C++11 attribute sequence. */
24429 static bool
24431 {
24434 }
24436 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24437 of GNU attributes, or return NULL. */
24439 static tree
24441 {
24445 }
24447 #define CILK_SIMD_FN_CLAUSE_MASK \
24448 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24449 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24450 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24451 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24452 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24454 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24455 vector [(<clauses>)] */
24457 static void
24459 {
24463 {
24469 }
24472 {
24475 paren_scope++;
24476 }
24478 {
24481 paren_scope++;
24483 paren_scope--;
24484 /* Do not push the last ')' */
24487 }
24496 }
24498 /* Parse an (optional) series of attributes.
24500 attributes:
24501 attributes attribute
24503 attribute:
24504 __attribute__ (( attribute-list [opt] ))
24506 The return value is as for cp_parser_gnu_attribute_list. */
24508 static tree
24510 {
24514 {
24516 tree attribute_list;
24519 /* Peek at the next token. */
24521 /* If it's not `__attribute__', then we're done. */
24525 /* Consume the `__attribute__' keyword. */
24527 /* Look for the two `(' tokens. */
24531 /* Peek at the next token. */
24534 /* Parse the attribute-list. */
24536 else
24537 /* If the next token is a `)', then there is no attribute
24538 list. */
24541 /* Look for the two `)' tokens. */
24549 /* Add these new attributes to the list. */
24551 }
24554 }
24556 /* Parse a GNU attribute-list.
24558 attribute-list:
24559 attribute
24560 attribute-list , attribute
24562 attribute:
24563 identifier
24564 identifier ( identifier )
24565 identifier ( identifier , expression-list )
24566 identifier ( expression-list )
24568 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24569 to an attribute. The TREE_PURPOSE of each node is the identifier
24570 indicating which attribute is in use. The TREE_VALUE represents
24571 the arguments, if any. */
24573 static tree
24575 {
24581 {
24583 tree identifier;
24584 tree attribute;
24586 /* Look for the identifier. We also allow keywords here; for
24587 example `__attribute__ ((const))' is legal. */
24591 {
24594 /* Consume the token, but save it since we need it for the
24595 SIMD enabled function parsing. */
24598 /* Save away the identifier that indicates which attribute
24599 this is. */
24601 /* For keywords, use the canonical spelling, not the
24602 parsed identifier. */
24608 /* Peek at the next token. */
24610 /* If it's an `(', then parse the attribute arguments. */
24612 {
24617 {
24620 }
24621 else
24622 vec = cp_parser_parenthesized_expression_list
24628 else
24629 {
24632 }
24633 /* Save the arguments away. */
24635 }
24637 {
24640 }
24643 {
24644 /* Add this attribute to the list. */
24647 }
24650 }
24651 /* Now, look for more attributes. If the next token isn't a
24652 `,', we're done. */
24656 /* Consume the comma and keep going. */
24658 }
24661 /* We built up the list in reverse order. */
24663 }
24665 /* Parse a standard C++11 attribute.
24667 The returned representation is a TREE_LIST which TREE_PURPOSE is
24668 the scoped name of the attribute, and the TREE_VALUE is its
24669 arguments list.
24671 Note that the scoped name of the attribute is itself a TREE_LIST
24672 which TREE_PURPOSE is the namespace of the attribute, and
24673 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24674 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24675 and which TREE_PURPOSE is directly the attribute name.
24677 Clients of the attribute code should use get_attribute_namespace
24678 and get_attribute_name to get the actual namespace and name of
24679 attributes, regardless of their being GNU or C++11 attributes.
24681 attribute:
24682 attribute-token attribute-argument-clause [opt]
24684 attribute-token:
24685 identifier
24686 attribute-scoped-token
24688 attribute-scoped-token:
24689 attribute-namespace :: identifier
24691 attribute-namespace:
24692 identifier
24694 attribute-argument-clause:
24695 ( balanced-token-seq )
24697 balanced-token-seq:
24698 balanced-token [opt]
24699 balanced-token-seq balanced-token
24701 balanced-token:
24702 ( balanced-token-seq )
24703 [ balanced-token-seq ]
24704 { balanced-token-seq }. */
24706 static tree
24708 {
24712 /* First, parse name of the attribute, a.k.a attribute-token. */
24729 {
24730 /* We are seeing a scoped attribute token. */
24745 else
24746 {
24750 }
24752 NULL_TREE);
24754 }
24757 NULL_TREE);
24758 else
24759 {
24761 NULL_TREE);
24762 /* C++11 noreturn attribute is equivalent to GNU's. */
24765 /* C++14 deprecated attribute is equivalent to GNU's. */
24768 /* C++17 fallthrough attribute is equivalent to GNU's. */
24771 /* Transactional Memory TS optimize_for_synchronized attribute is
24772 equivalent to GNU transaction_callable. */
24776 /* Transactional Memory attributes are GNU attributes. */
24779 }
24781 /* Now parse the optional argument clause of the attribute. */
24786 {
24792 /* A GNU attribute that takes an identifier in parameter. */
24795 vec = cp_parser_parenthesized_expression_list
24801 else
24802 {
24805 }
24809 else
24811 }
24814 }
24816 /* Check that the attribute ATTRIBUTE appears at most once in the
24817 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24818 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24819 isn't implemented yet in GCC. */
24821 static void
24823 {
24825 {
24835 }
24836 }
24838 /* Parse a list of standard C++-11 attributes.
24840 attribute-list:
24841 attribute [opt]
24842 attribute-list , attribute[opt]
24843 attribute ...
24844 attribute-list , attribute ...
24845 */
24847 static tree
24849 {
24854 {
24859 {
24863 }
24866 {
24871 else
24872 {
24877 }
24879 }
24883 }
24886 }
24888 /* Parse a standard C++-11 attribute specifier.
24890 attribute-specifier:
24891 [ [ attribute-using-prefix [opt] attribute-list ] ]
24892 alignment-specifier
24894 attribute-using-prefix:
24895 using attribute-namespace :
24897 alignment-specifier:
24898 alignas ( type-id ... [opt] )
24899 alignas ( alignment-expression ... [opt] ). */
24901 static tree
24903 {
24909 {
24916 {
24927 {
24931 "attribute using prefix only available "
24937 }
24938 else
24940 }
24947 else
24948 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24949 when we are sure that we have actually parsed them. */
24951 }
24952 else
24953 {
24954 tree alignas_expr;
24956 /* Look for an alignment-specifier. */
24968 {
24971 }
24977 {
24984 }
24989 /* Handle alignas (pack...). */
24991 {
24994 }
24996 /* Something went wrong, so don't build the attribute. */
25001 {
25004 }
25006 /* Build the C++-11 representation of an 'aligned'
25007 attribute. */
25008 attributes =
25011 alignas_expr);
25012 }
25015 }
25017 /* Parse a standard C++-11 attribute-specifier-seq.
25019 attribute-specifier-seq:
25020 attribute-specifier-seq [opt] attribute-specifier
25021 */
25023 static tree
25025 {
25030 {
25039 else
25042 }
25045 }
25047 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25048 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25049 current value of the PEDANTIC flag, regardless of whether or not
25050 the `__extension__' keyword is present. The caller is responsible
25051 for restoring the value of the PEDANTIC flag. */
25053 static bool
25055 {
25056 /* Save the old value of the PEDANTIC flag. */
25060 {
25061 /* Consume the `__extension__' token. */
25063 /* We're not being pedantic while the `__extension__' keyword is
25064 in effect. */
25068 }
25071 }
25073 /* Parse a label declaration.
25075 label-declaration:
25076 __label__ label-declarator-seq ;
25078 label-declarator-seq:
25079 identifier , label-declarator-seq
25080 identifier */
25082 static void
25084 {
25085 /* Look for the `__label__' keyword. */
25089 {
25090 tree identifier;
25092 /* Look for an identifier. */
25094 /* If we failed, stop. */
25097 /* Declare it as a label. */
25099 /* If the next token is a `;', stop. */
25102 /* Look for the `,' separating the label declarations. */
25104 }
25106 /* Look for the final `;'. */
25108 }
25110 // -------------------------------------------------------------------------- //
25111 // Requires Clause
25113 // Parse a requires clause.
25114 //
25115 // requires-clause:
25116 // 'requires' logical-or-expression
25117 //
25118 // The required logical-or-expression must be a constant expression. Note
25119 // that we don't check that the expression is constepxr here. We defer until
25120 // we analyze constraints and then, we only check atomic constraints.
25121 static tree
25123 {
25124 // Parse the requires clause so that it is not automatically folded.
25132 }
25134 // Optionally parse a requires clause:
25135 static tree
25137 {
25140 {
25143 {
25146 /* Parse and discard the requires-clause. */
25149 }
25151 }
25154 }
25157 /*---------------------------------------------------------------------------
25158 Requires expressions
25159 ---------------------------------------------------------------------------*/
25161 /* Parse a requires expression
25163 requirement-expression:
25164 'requires' requirement-parameter-list [opt] requirement-body */
25165 static tree
25167 {
25171 /* A requires-expression shall appear only within a concept
25172 definition or a requires-clause.
25174 TODO: Implement this diagnostic correctly. */
25176 {
25180 }
25183 {
25184 /* Local parameters are delared as variables within the scope
25185 of the expression. They are not visible past the end of
25186 the expression. Expressions within the requires-expression
25187 are unevaluated. */
25188 struct scope_sentinel
25189 {
25191 {
25194 }
25197 {
25200 }
25203 /* Parse the optional parameter list. */
25205 {
25209 }
25210 else
25213 /* Parse the requirement body. */
25217 }
25219 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25220 the parm chain. */
25223 }
25225 /* Parse a parameterized requirement.
25227 requirement-parameter-list:
25228 '(' parameter-declaration-clause ')' */
25229 static tree
25231 {
25241 }
25243 /* Parse the body of a requirement.
25245 requirement-body:
25246 '{' requirement-list '}' */
25247 static tree
25249 {
25259 }
25261 /* Parse a list of requirements.
25263 requirement-list:
25264 requirement
25265 requirement-list ';' requirement[opt] */
25266 static tree
25268 {
25271 {
25278 /* If we see a semi-colon, consume it. */
25282 /* Stop processing at the end of the list. */
25285 }
25287 /* Reverse the order of requirements so they are analyzed in
25288 declaration order. */
25290 }
25292 /* Parse a syntactic requirement or type requirement.
25294 requirement:
25295 simple-requirement
25296 compound-requirement
25297 type-requirement
25298 nested-requirement */
25299 static tree
25301 {
25308 else
25310 }
25312 /* Parse a simple requirement.
25314 simple-requirement:
25315 expression ';' */
25316 static tree
25318 {
25327 }
25329 /* Parse a type requirement
25331 type-requirement
25332 nested-name-specifier [opt] required-type-name ';'
25334 required-type-name:
25335 type-name
25336 'template' [opt] simple-template-id */
25337 static tree
25339 {
25342 // Save the scope before parsing name specifiers.
25353 tree type;
25355 {
25364 }
25365 else
25384 }
25386 /* Parse a compound requirement
25388 compound-requirement:
25389 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25390 static tree
25392 {
25393 /* Parse an expression enclosed in '{ }'s. */
25404 /* Parse the optional noexcept. */
25407 {
25410 }
25412 /* Parse the optional trailing return type. */
25415 {
25423 }
25426 }
25428 /* Parse a nested requirement. This is the same as a requires clause.
25430 nested-requirement:
25431 requires-clause */
25432 static tree
25434 {
25440 }
25442 /* Support Functions */
25444 /* Return the appropriate prefer_type argument for lookup_name_real based on
25445 tag_type and template_mem_access. */
25449 {
25450 /* DR 141: When looking in the current enclosing context for a template-name
25451 after -> or ., only consider class templates. */
25455 {
25459 }
25460 }
25462 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25463 NAME should have one of the representations used for an
25464 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25465 is returned. If PARSER->SCOPE is a dependent type, then a
25466 SCOPE_REF is returned.
25468 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25469 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25470 was formed. Abstractly, such entities should not be passed to this
25471 function, because they do not need to be looked up, but it is
25472 simpler to check for this special case here, rather than at the
25473 call-sites.
25475 In cases not explicitly covered above, this function returns a
25476 DECL, OVERLOAD, or baselink representing the result of the lookup.
25477 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25478 is returned.
25480 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25481 (e.g., "struct") that was used. In that case bindings that do not
25482 refer to types are ignored.
25484 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25485 ignored.
25487 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25488 are ignored.
25490 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25491 types.
25493 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25494 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25495 NULL_TREE otherwise. */
25497 static cp_expr
25504 location_t name_location)
25505 {
25506 tree decl;
25509 /* Assume that the lookup will be unambiguous. */
25513 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25514 no longer valid. Note that if we are parsing tentatively, and
25515 the parse fails, OBJECT_TYPE will be automatically restored. */
25521 /* A template-id has already been resolved; there is no lookup to
25522 do. */
25526 {
25530 }
25532 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25533 it should already have been checked to make sure that the name
25534 used matches the type being destroyed. */
25536 {
25537 tree type;
25539 /* Figure out to which type this destructor applies. */
25544 else
25546 /* If that's not a class type, there is no destructor. */
25553 /* If it was a class type, return the destructor. */
25555 }
25557 /* By this point, the NAME should be an ordinary identifier. If
25558 the id-expression was a qualified name, the qualifying scope is
25559 stored in PARSER->SCOPE at this point. */
25562 /* Perform the lookup. */
25564 {
25570 /* If the SCOPE is dependent, the lookup must be deferred until
25571 the template is instantiated -- unless we are explicitly
25572 looking up names in uninstantiated templates. Even then, we
25573 cannot look up the name if the scope is not a class type; it
25574 might, for example, be a template type parameter. */
25579 /* Defer lookup. */
25581 else
25582 {
25585 /* If PARSER->SCOPE is a dependent type, then it must be a
25586 class type, and we must not be checking dependencies;
25587 otherwise, we would have processed this lookup above. So
25588 that PARSER->SCOPE is not considered a dependent base by
25589 lookup_member, we must enter the scope here. */
25593 /* If the PARSER->SCOPE is a template specialization, it
25594 may be instantiated during name lookup. In that case,
25595 errors may be issued. Even if we rollback the current
25596 tentative parse, those errors are valid. */
25601 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25602 lookup result and the nested-name-specifier nominates a class C:
25603 * if the name specified after the nested-name-specifier, when
25604 looked up in C, is the injected-class-name of C (Clause 9), or
25605 * if the name specified after the nested-name-specifier is the
25606 same as the identifier or the simple-template-id's template-
25607 name in the last component of the nested-name-specifier,
25608 the name is instead considered to name the constructor of
25609 class C. [ Note: for example, the constructor is not an
25610 acceptable lookup result in an elaborated-type-specifier so
25611 the constructor would not be used in place of the
25612 injected-class-name. --end note ] Such a constructor name
25613 shall be used only in the declarator-id of a declaration that
25614 names a constructor or in a using-declaration. */
25622 /* If we have a single function from a using decl, pull it out. */
25629 }
25631 /* If the scope is a dependent type and either we deferred lookup or
25632 we did lookup but didn't find the name, rememeber the name. */
25635 {
25637 {
25638 tree type;
25640 /* The resolution to Core Issue 180 says that `struct
25641 A::B' should be considered a type-name, even if `A'
25642 is dependent. */
25647 }
25651 CPP_CLOSE_PAREN)))
25655 else
25658 is_template);
25659 }
25662 }
25664 {
25665 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25666 OBJECT_TYPE is not a class. */
25668 /* If the OBJECT_TYPE is a template specialization, it may
25669 be instantiated during name lookup. In that case, errors
25670 may be issued. Even if we rollback the current tentative
25671 parse, those errors are valid. */
25673 name,
25676 tf_warning_or_error);
25677 else
25681 /* Look it up in the enclosing context. DR 141: When looking for a
25682 template-name after -> or ., only consider class templates. */
25687 /* The object is type-dependent, so we can't look anything up; we used
25688 this to get the DR 141 behavior. */
25692 }
25693 else
25694 {
25700 }
25702 /* If the lookup failed, let our caller know. */
25706 /* Pull out the template from an injected-class-name (or multiple). */
25710 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25712 {
25715 /* The error message we have to print is too complicated for
25716 cp_parser_error, so we incorporate its actions directly. */
25718 {
25720 name);
25722 }
25724 }
25732 /* If we have resolved the name of a member declaration, check to
25733 see if the declaration is accessible. When the name resolves to
25734 set of overloaded functions, accessibility is checked when
25735 overload resolution is done.
25737 During an explicit instantiation, access is not checked at all,
25738 as per [temp.explicit]. */
25745 }
25747 /* Like cp_parser_lookup_name, but for use in the typical case where
25748 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25749 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25751 static tree
25753 {
25755 none_type,
25760 location);
25761 }
25763 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25764 the current context, return the TYPE_DECL. If TAG_NAME_P is
25765 true, the DECL indicates the class being defined in a class-head,
25766 or declared in an elaborated-type-specifier.
25768 Otherwise, return DECL. */
25770 static tree
25772 {
25773 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25774 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25776 struct A {
25777 template <typename T> struct B;
25778 };
25780 template <typename T> struct A::B {};
25782 Similarly, in an elaborated-type-specifier:
25784 namespace N { struct X{}; }
25786 struct A {
25787 template <typename T> friend struct N::X;
25788 };
25790 However, if the DECL refers to a class type, and we are in
25791 the scope of the class, then the name lookup automatically
25792 finds the TYPE_DECL created by build_self_reference rather
25793 than a TEMPLATE_DECL. For example, in:
25795 template <class T> struct S {
25796 S s;
25797 };
25799 there is no need to handle such case. */
25805 }
25807 /* If too many, or too few, template-parameter lists apply to the
25808 declarator, issue an error message. Returns TRUE if all went well,
25809 and FALSE otherwise. */
25811 static bool
25814 location_t declarator_location)
25815 {
25817 {
25819 {
25827 /* If the DECLARATOR has the form `X<y>' then it uses one
25828 additional level of template parameters. */
25831 return cp_parser_check_template_parameters
25833 }
25849 }
25851 }
25853 /* NUM_TEMPLATES were used in the current declaration. If that is
25854 invalid, return FALSE and issue an error messages. Otherwise,
25855 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25856 declarator and we can print more accurate diagnostics. */
25858 static bool
25861 location_t location,
25863 {
25864 /* If there are the same number of template classes and parameter
25865 lists, that's OK. */
25868 /* If there are more, but only one more, then we are referring to a
25869 member template. That's OK too. */
25872 /* If there are more template classes than parameter lists, we have
25873 something like:
25875 template <class T> void S<T>::R<T>::f (); */
25877 {
25887 else
25890 }
25891 /* Otherwise, there are too many template parameter lists. We have
25892 something like:
25894 template <class T> template <class U> void S::f(); */
25897 }
25899 /* Parse an optional `::' token indicating that the following name is
25900 from the global namespace. If so, PARSER->SCOPE is set to the
25901 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25902 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25903 Returns the new value of PARSER->SCOPE, if the `::' token is
25904 present, and NULL_TREE otherwise. */
25906 static tree
25908 {
25911 /* Peek at the next token. */
25913 /* If we're looking at a `::' token then we're starting from the
25914 global namespace, not our current location. */
25916 {
25917 /* Consume the `::' token. */
25919 /* Set the SCOPE so that we know where to start the lookup. */
25925 }
25927 {
25931 }
25934 }
25936 /* Returns TRUE if the upcoming token sequence is the start of a
25937 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
25938 declarator is preceded by the `friend' specifier. */
25940 static bool
25942 {
25945 tree nested_name_specifier;
25948 /* The common case is that this is not a constructor declarator, so
25949 try to avoid doing lots of work if at all possible. It's not
25950 valid declare a constructor at function scope. */
25953 /* And only certain tokens can begin a constructor declarator. */
25961 /* Parse tentatively; we are going to roll back all of the tokens
25962 consumed here. */
25964 /* Assume that we are looking at a constructor declarator. */
25967 /* Look for the optional `::' operator. */
25970 /* Look for the nested-name-specifier. */
25971 nested_name_specifier
25982 /* Outside of a class-specifier, there must be a
25983 nested-name-specifier. Except in C++17 mode, where we
25984 might be declaring a guiding declaration. */
25991 /* If we have a class scope, this is easy; DR 147 says that S::S always
25992 names the constructor, and no other qualified name could. */
25995 {
26005 }
26006 /* If we still think that this might be a constructor-declarator,
26007 look for a class-name. */
26009 {
26010 /* If we have:
26012 template <typename T> struct S {
26013 S();
26014 };
26016 we must recognize that the nested `S' names a class. */
26020 tree type_decl;
26024 none_type,
26031 {
26037 none_type,
26042 else
26044 }
26046 /* If there was no class-name, then this is not a constructor.
26047 Otherwise, if we are in a class-specifier and we aren't
26048 handling a friend declaration, check that its type matches
26049 current_class_type (c++/38313). Note: error_mark_node
26050 is left alone for error recovery purposes. */
26052 && (outside_class_specifier_p
26058 /* If we're still considering a constructor, we have to see a `(',
26059 to begin the parameter-declaration-clause, followed by either a
26060 `)', an `...', or a decl-specifier. We need to check for a
26061 type-specifier to avoid being fooled into thinking that:
26063 S (f) (int);
26065 is a constructor. (It is actually a function named `f' that
26066 takes one parameter (of type `int') and returns a value of type
26067 `S'. */
26075 /* A parameter declaration begins with a decl-specifier,
26076 which is either the "attribute" keyword, a storage class
26077 specifier, or (usually) a type-specifier. */
26079 {
26080 tree type;
26084 /* Names appearing in the type-specifier should be looked up
26085 in the scope of the class. */
26089 {
26092 {
26096 {
26099 }
26100 }
26102 }
26104 /* Inside the constructor parameter list, surrounding
26105 template-parameter-lists do not apply. */
26106 saved_num_template_parameter_lists
26110 /* Look for the type-specifier. */
26112 CP_PARSER_FLAGS_NONE,
26118 parser->num_template_parameter_lists
26121 /* Leave the scope of the class. */
26126 }
26127 }
26129 /* We did not really want to consume any tokens. */
26133 }
26135 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26136 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26137 they must be performed once we are in the scope of the function.
26139 Returns the function defined. */
26141 static tree
26142 cp_parser_function_definition_from_specifiers_and_declarator
26145 tree attributes,
26147 {
26148 tree fn;
26151 /* Begin the function-definition. */
26154 /* The things we're about to see are not directly qualified by any
26155 template headers we've seen thus far. */
26158 /* If there were names looked up in the decl-specifier-seq that we
26159 did not check, check them now. We must wait until we are in the
26160 scope of the function to perform the checks, since the function
26161 might be a friend. */
26165 {
26170 }
26173 {
26174 /* Skip the entire function. */
26177 }
26179 {
26180 /* Seen already, skip it. An error message has already been output. */
26184 /* If this is a function from a class, pop the nested class. */
26187 }
26188 else
26189 {
26190 timevar_id_t tv;
26193 else
26199 }
26202 }
26204 /* Parse the part of a function-definition that follows the
26205 declarator. INLINE_P is TRUE iff this function is an inline
26206 function defined within a class-specifier.
26208 Returns the function defined. */
26210 static tree
26213 {
26214 tree fn;
26220 bool fully_implicit_function_template_p
26223 tree implicit_template_parms
26226 cp_binding_level* implicit_template_scope
26232 /* If the next token is `return', then the code may be trying to
26233 make use of the "named return value" extension that G++ used to
26234 support. */
26237 {
26238 /* Consume the `return' keyword. */
26240 /* Look for the identifier that indicates what value is to be
26241 returned. */
26243 /* Issue an error message. */
26246 /* Skip tokens until we reach the start of the function body. */
26248 {
26255 }
26256 }
26257 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26258 anything declared inside `f'. */
26259 saved_in_unbraced_linkage_specification_p
26262 /* Inside the function, surrounding template-parameter-lists do not
26263 apply. */
26264 saved_num_template_parameter_lists
26270 /* If the next token is `try', `__transaction_atomic', or
26271 `__transaction_relaxed`, then we are looking at either function-try-block
26272 or function-transaction-block. Note that all of these include the
26273 function-body. */
26276 RID_TRANSACTION_ATOMIC);
26278 RID_TRANSACTION_RELAXED))
26280 RID_TRANSACTION_RELAXED);
26283 else
26284 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26289 /* Finish the function. */
26292 /* Generate code for it, if necessary. */
26294 /* Restore the saved values. */
26295 parser->in_unbraced_linkage_specification_p
26297 parser->num_template_parameter_lists
26301 parser->fully_implicit_function_template_p
26303 parser->implicit_template_parms
26305 parser->implicit_template_scope
26312 }
26314 /* Parse a template-declaration body (following argument list). */
26316 static void
26318 tree parameter_list,
26320 {
26324 /* We just processed one more parameter list. */
26327 /* Get the deferred access checks from the parameter list. These
26328 will be checked once we know what is being declared, as for a
26329 member template the checks must be performed in the scope of the
26330 class containing the member. */
26333 /* Tentatively parse for a new template parameter list, which can either be
26334 the template keyword or a template introduction. */
26340 else
26341 {
26342 /* There are no access checks when parsing a template, as we do not
26343 know if a specialization will be a friend. */
26347 checks,
26348 member_p,
26353 /* If this is a member template declaration, let the front
26354 end know. */
26356 {
26361 }
26366 }
26367 /* We are done with the current parameter list. */
26372 /* Finish up. */
26375 /* Check the template arguments for a literal operator template. */
26379 {
26383 else
26384 {
26387 {
26393 }
26395 {
26404 }
26405 else
26407 }
26409 {
26412 " Expected non-type template argument pack <char...>"
26414 decl);
26415 else
26418 decl);
26419 }
26420 }
26422 /* Register member declarations. */
26425 /* If DECL is a function template, we must return to parse it later.
26426 (Even though there is no definition, there might be default
26427 arguments that need handling.) */
26431 }
26433 /* Parse a template introduction header for a template-declaration. Returns
26434 false if tentative parse fails. */
26436 static bool
26438 {
26445 /* Look for the optional `::' operator. */
26448 /* Look for the nested-name-specifier. */
26458 /* Look up the concept for which we will be matching
26459 template parameters. */
26469 /* Look for opening brace for introduction. */
26477 /* Build vector of placeholder parameters and grab
26478 matching identifiers. */
26481 /* The introduction-list shall not be empty. */
26484 {
26487 }
26489 /* Look for closing brace for introduction. */
26494 {
26498 }
26500 /* Build and associate the constraint. */
26503 {
26505 member_p);
26507 }
26511 }
26513 /* Parse a normal template-declaration following the template keyword. */
26515 static void
26517 {
26518 tree parameter_list;
26522 /* Look for the `<' token. */
26526 {
26527 /* 14.5.2.2 [temp.mem]
26529 A local class shall not have member templates. */
26534 }
26535 /* [temp]
26537 A template ... shall not have C linkage. */
26539 {
26541 /* Give it C++ linkage to avoid confusing other parts of the
26542 front end. */
26545 }
26546 else
26549 /* We cannot perform access checks on the template parameter
26550 declarations until we know what is being declared, just as we
26551 cannot check the decl-specifier list. */
26554 /* If the next token is `>', then we have an invalid
26555 specialization. Rather than complain about an invalid template
26556 parameter, issue an error message here. */
26558 {
26562 }
26563 else
26564 {
26565 /* Parse the template parameters. */
26567 }
26569 /* Look for the `>'. */
26572 /* Manage template requirements */
26574 {
26579 }
26582 member_p);
26584 /* For the erroneous case of a template with C linkage, we pushed an
26585 implicit C++ linkage scope; exit that scope now. */
26588 }
26590 /* Parse a template-declaration, assuming that the `export' (and
26591 `extern') keywords, if present, has already been scanned. MEMBER_P
26592 is as for cp_parser_template_declaration. */
26594 static bool
26596 {
26598 {
26602 }
26607 }
26609 /* Perform the deferred access checks from a template-parameter-list.
26610 CHECKS is a TREE_LIST of access checks, as returned by
26611 get_deferred_access_checks. */
26613 static void
26614 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26615 {
26619 }
26621 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26622 `function-definition' sequence that follows a template header.
26623 If MEMBER_P is true, this declaration appears in a class scope.
26625 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26626 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26628 static tree
26634 {
26637 cp_decl_specifier_seq decl_specifiers;
26641 /* This function is only used when processing a template
26642 declaration. */
26646 /* Defer access checks until we know what is being declared. */
26649 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26650 alternative. */
26653 CP_PARSER_FLAGS_OPTIONAL,
26659 /* There are no template typedefs. */
26661 {
26665 }
26667 /* Gather up the access checks that occurred the
26668 decl-specifier-seq. */
26671 /* Check for the declaration of a template class. */
26673 {
26676 {
26677 // If this is a declaration, but not a definition, associate
26678 // any constraints with the type declaration. Constraints
26679 // are associated with definitions in cp_parser_class_specifier.
26685 /* In this case:
26687 struct C {
26688 friend template <typename T> struct A<T>::B;
26689 };
26691 A<T>::B will be represented by a TYPENAME_TYPE, and
26692 therefore not recognized by shadow_tag. */
26694 && !decl
26701 else
26704 /* Perform access checks for template parameters. */
26707 /* Give a helpful diagnostic for
26708 template <class T> struct A { } a;
26709 if we aren't already recovering from an error. */
26712 {
26714 "a class template declaration must not declare "
26718 }
26719 }
26720 }
26722 /* Complain about missing 'typename' or other invalid type names. */
26725 {
26726 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26727 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26728 the rest of this declaration. */
26731 }
26733 /* If it's not a template class, try for a template function. If
26734 the next token is a `;', then this declaration does not declare
26735 anything. But, if there were errors in the decl-specifiers, then
26736 the error might well have come from an attempted class-specifier.
26737 In that case, there's no need to warn about a missing declarator. */
26741 {
26744 checks,
26746 member_p,
26747 declares_class_or_enum,
26751 /* 7.1.1-1 [dcl.stc]
26753 A storage-class-specifier shall not be specified in an explicit
26754 specialization... */
26756 && explicit_specialization_p
26758 {
26762 }
26766 }
26768 /* Look for a trailing `;' after the declaration. */
26774 out:
26777 /* Clear any current qualification; whatever comes next is the start
26778 of something new. */
26784 }
26786 /* Parse a cast-expression that is not the operand of a unary "&". */
26788 static cp_expr
26790 {
26793 }
26795 /* Parse a functional cast to TYPE. Returns an expression
26796 representing the cast. */
26798 static cp_expr
26800 {
26802 tree expression_list;
26803 cp_expr cast;
26812 {
26821 tf_warning_or_error);
26822 /* Create a location of the form:
26823 type_name{i, f}
26824 ^~~~~~~~~~~~~~~
26825 with caret == start at the start of the type name,
26826 finishing at the closing brace. */
26827 location_t finish_loc
26830 finish_loc);
26833 }
26842 else
26843 {
26846 }
26849 tf_warning_or_error);
26850 /* [expr.const]/1: In an integral constant expression "only type
26851 conversions to integral or enumeration type can be used". */
26857 NIC_CONSTRUCTOR))
26860 /* Create a location of the form:
26861 float(i)
26862 ^~~~~~~~
26863 with caret == start at the start of the type name,
26864 finishing at the closing paren. */
26865 location_t finish_loc
26870 }
26872 /* Save the tokens that make up the body of a member function defined
26873 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26874 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26875 specifiers applied to the declaration. Returns the FUNCTION_DECL
26876 for the member function. */
26878 static tree
26882 tree attributes)
26883 {
26886 tree fn;
26889 /* Create the FUNCTION_DECL. */
26893 /* If something went badly wrong, bail out now. */
26895 {
26896 /* If there's a function-body, skip it. */
26901 }
26903 /* Remember it, if there default args to post process. */
26906 /* Save away the tokens that make up the body of the
26907 function. */
26913 RID_TRANSACTION_ATOMIC))
26914 {
26916 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
26923 {
26929 }
26930 else
26933 {
26937 }
26938 }
26940 /* Handle function try blocks. */
26942 {
26945 }
26946 /* We can have braced-init-list mem-initializers before the fn body. */
26948 {
26951 {
26952 /* cache_group will stop after an un-nested { } pair, too. */
26956 /* variadic mem-inits have ... after the ')'. */
26959 }
26960 }
26962 /* Handle function try blocks. */
26968 /* Save away the inline definition; we will process it when the
26969 class is complete. */
26973 /* We need to know that this was defined in the class, so that
26974 friend templates are handled correctly. */
26977 /* Add FN to the queue of functions to be parsed later. */
26981 }
26983 /* Save the tokens that make up the in-class initializer for a non-static
26984 data member. Returns a DEFAULT_ARG. */
26986 static tree
26988 {
26990 }
26992 /* Parse a template-argument-list, as well as the trailing ">" (but
26993 not the opening "<"). See cp_parser_template_argument_list for the
26994 return value. */
26996 static tree
26998 {
26999 tree arguments;
27000 tree saved_scope;
27001 tree saved_qualifying_scope;
27002 tree saved_object_scope;
27007 /* [temp.names]
27009 When parsing a template-id, the first non-nested `>' is taken as
27010 the end of the template-argument-list rather than a greater-than
27011 operator. */
27012 saved_greater_than_is_operator_p
27015 /* Parsing the argument list may modify SCOPE, so we save it
27016 here. */
27020 /* We need to evaluate the template arguments, even though this
27021 template-id may be nested within a "sizeof". */
27026 /* Parse the template-argument-list itself. */
27030 else
27032 /* Look for the `>' that ends the template-argument-list. If we find
27033 a '>>' instead, it's probably just a typo. */
27035 {
27037 {
27038 /* In C++0x, a `>>' in a template argument list or cast
27039 expression is considered to be two separate `>'
27040 tokens. So, change the current token to a `>', but don't
27041 consume it: it will be consumed later when the outer
27042 template argument list (or cast expression) is parsed.
27043 Note that this replacement of `>' for `>>' is necessary
27044 even if we are parsing tentatively: in the tentative
27045 case, after calling
27046 cp_parser_enclosed_template_argument_list we will always
27047 throw away all of the template arguments and the first
27048 closing `>', either because the template argument list
27049 was erroneous or because we are replacing those tokens
27050 with a CPP_TEMPLATE_ID token. The second `>' (which will
27051 not have been thrown away) is needed either to close an
27052 outer template argument list or to complete a new-style
27053 cast. */
27056 }
27058 {
27059 /* If we're in a nested template argument list, the '>>' has
27060 to be a typo for '> >'. We emit the error message, but we
27061 continue parsing and we push a '>' as next token, so that
27062 the argument list will be parsed correctly. Note that the
27063 global source location is still on the token before the
27064 '>>', so we need to say explicitly where we want it. */
27072 }
27073 else
27074 {
27075 /* If this is not a nested template argument list, the '>>'
27076 is a typo for '>'. Emit an error message and continue.
27077 Same deal about the token location, but here we can get it
27078 right by consuming the '>>' before issuing the diagnostic. */
27081 "spurious %<>>%>, use %<>%> to terminate "
27083 }
27084 }
27085 else
27087 /* The `>' token might be a greater-than operator again now. */
27088 parser->greater_than_is_operator_p
27090 /* Restore the SAVED_SCOPE. */
27098 }
27100 /* MEMBER_FUNCTION is a member function, or a friend. If default
27101 arguments, or the body of the function have not yet been parsed,
27102 parse them now. */
27104 static void
27106 {
27108 /* If this member is a template, get the underlying
27109 FUNCTION_DECL. */
27113 /* There should not be any class definitions in progress at this
27114 point; the bodies of members are only parsed outside of all class
27115 definitions. */
27117 /* While we're parsing the member functions we might encounter more
27118 classes. We want to handle them right away, but we don't want
27119 them getting mixed up with functions that are currently in the
27120 queue. */
27123 /* Make sure that any template parameters are in scope. */
27126 /* If the body of the function has not yet been parsed, parse it
27127 now. */
27129 {
27130 tree function_scope;
27133 /* The function is no longer pending; we are processing it. */
27138 /* If this is a local class, enter the scope of the containing
27139 function. */
27144 /* Push the body of the function onto the lexer stack. */
27147 /* Let the front end know that we going to be defining this
27148 function. */
27152 /* Don't do access checking if it is a templated function. */
27156 /* #pragma omp declare reduction needs special parsing. */
27158 {
27163 }
27164 else
27165 /* Now, parse the body of the function. */
27172 /* Leave the scope of the containing function. */
27176 }
27178 /* Remove any template parameters from the symbol table. */
27181 /* Restore the queue. */
27184 }
27186 /* If DECL contains any default args, remember it on the unparsed
27187 functions queue. */
27189 static void
27191 {
27192 tree probe;
27195 probe;
27198 {
27202 }
27203 }
27205 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27206 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27207 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27208 from the parameter-type-list. */
27210 static tree
27213 {
27215 tree parsed_arg;
27221 /* Push the saved tokens for the default argument onto the parser's
27222 lexer stack. */
27228 /* Parse the default argument. */
27239 {
27240 /* In a non-template class, check conversions now. In a template,
27241 we'll wait and instantiate these as needed. */
27244 tf_warning_or_error);
27247 else
27249 }
27251 /* If the token stream has not been completely used up, then
27252 there was extra junk after the end of the default
27253 argument. */
27255 {
27258 else
27260 }
27262 /* Revert to the main lexer. */
27266 }
27268 /* FIELD is a non-static data member with an initializer which we saved for
27269 later; parse it now. */
27271 static void
27273 {
27274 tree def;
27281 NULL_TREE);
27287 }
27289 /* FN is a FUNCTION_DECL which may contains a parameter with an
27290 unparsed DEFAULT_ARG. Parse the default args now. This function
27291 assumes that the current scope is the scope in which the default
27292 argument should be processed. */
27294 static void
27296 {
27300 /* While we're parsing the default args, we might (due to the
27301 statement expression extension) encounter more classes. We want
27302 to handle them right away, but we don't want them getting mixed
27303 up with default args that are currently in the queue. */
27306 /* Local variable names (and the `this' keyword) may not appear
27307 in a default argument. */
27318 {
27320 tree parsed_arg;
27322 tree copy;
27329 /* This can happen for a friend declaration for a function
27330 already declared with default arguments. */
27333 parsed_arg
27335 default_arg,
27338 {
27340 }
27344 /* Update any instantiations we've already created. */
27348 }
27352 /* Make sure no default arg is missing. */
27355 /* Restore the state of local_variables_forbidden_p. */
27358 /* Restore the queue. */
27360 }
27362 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27364 sizeof ... ( identifier )
27366 where the 'sizeof' token has already been consumed. */
27368 static tree
27370 {
27371 /* Consume the `...'. */
27378 else
27386 /* The name is not qualified. */
27405 }
27407 /* Parse the operand of `sizeof' (or a similar operator). Returns
27408 either a TYPE or an expression, depending on the form of the
27409 input. The KEYWORD indicates which kind of expression we have
27410 encountered. */
27412 static tree
27414 {
27421 /* If it's a `...', then we are computing the length of a parameter
27422 pack. */
27427 /* Types cannot be defined in a `sizeof' expression. Save away the
27428 old message. */
27430 /* And create the new one. */
27436 /* The restrictions on constant-expressions do not apply inside
27437 sizeof expressions. */
27438 saved_integral_constant_expression_p
27440 saved_non_integral_constant_expression_p
27444 /* Do not actually evaluate the expression. */
27447 /* If it's a `(', then we might be looking at the type-id
27448 construction. */
27450 {
27453 /* We can't be sure yet whether we're looking at a type-id or an
27454 expression. */
27456 /* Note: as a GNU Extension, compound literals are considered
27457 postfix-expressions as they are in C99, so they are valid
27458 arguments to sizeof. See comment in cp_parser_cast_expression
27459 for details. */
27462 else
27463 {
27466 /* Look for the type-id. */
27468 /* Look for the closing `)'. */
27471 }
27473 /* If all went well, then we're done. */
27475 {
27476 cp_decl_specifier_seq decl_specs;
27478 /* Build a trivial decl-specifier-seq. */
27482 /* Call grokdeclarator to figure out what type this is. */
27485 TYPENAME,
27488 }
27489 }
27491 /* If the type-id production did not work out, then we must be
27492 looking at the unary-expression production. */
27496 /* Go back to evaluating expressions. */
27500 /* Free the message we created. */
27502 /* And restore the old one. */
27504 parser->integral_constant_expression_p
27506 parser->non_integral_constant_expression_p
27510 }
27512 /* If the current declaration has no declarator, return true. */
27514 static bool
27516 {
27517 /* If the next token is a `;' or a `,' then there is no
27518 declarator. */
27521 }
27523 /* Update the DECL_SPECS to reflect the storage class indicated by
27524 KEYWORD. */
27526 static void
27531 {
27532 cp_storage_class storage_class;
27535 {
27539 }
27541 {
27544 }
27549 {
27552 }
27555 {
27573 }
27577 /* A storage class specifier cannot be applied alongside a typedef
27578 specifier. If there is a typedef specifier present then set
27579 conflicting_specifiers_p which will trigger an error later
27580 on in grokdeclarator. */
27583 }
27585 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27586 is true, the type is a class or enum definition. */
27588 static void
27590 tree type_spec,
27593 {
27596 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27597 (with, for example, in "typedef int wchar_t;") we remember that
27598 this is what happened. In system headers, we ignore these
27599 declarations so that G++ can work with system headers that are not
27600 C++-safe. */
27602 && !type_definition_p
27612 {
27615 ds_redefined_builtin_type_spec,
27616 token);
27618 {
27622 }
27623 }
27626 else
27627 {
27632 }
27633 }
27635 /* True iff TOKEN is the GNU keyword __thread. */
27637 static bool
27639 {
27642 }
27644 /* Set the location for a declarator specifier and check if it is
27645 duplicated.
27647 DECL_SPECS is the sequence of declarator specifiers onto which to
27648 set the location.
27650 DS is the single declarator specifier to set which location is to
27651 be set onto the existing sequence of declarators.
27653 LOCATION is the location for the declarator specifier to
27654 consider. */
27656 static void
27659 {
27668 {
27672 }
27673 else
27674 {
27676 {
27680 else
27681 {
27684 OPT_Wlong_long,
27686 }
27687 }
27689 {
27694 else
27695 {
27699 }
27700 }
27701 else
27702 {
27718 "__complex"
27719 };
27723 }
27724 }
27725 }
27727 /* Return true iff the declarator specifier DS is present in the
27728 sequence of declarator specifiers DECL_SPECS. */
27730 bool
27732 cp_decl_spec ds)
27733 {
27740 }
27742 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27743 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27745 static bool
27747 {
27749 }
27751 /* Issue an error message indicating that TOKEN_DESC was expected.
27752 If KEYWORD is true, it indicated this function is called by
27753 cp_parser_require_keword and the required token can only be
27754 a indicated keyword. */
27756 static void
27758 required_token token_desc,
27760 {
27762 {
27831 }
27833 {
27835 {
27914 }
27915 }
27916 else
27918 }
27922 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27923 issue an error message indicating that TOKEN_DESC was expected.
27925 Returns the token consumed, if the token had the appropriate type.
27926 Otherwise, returns NULL. */
27931 required_token token_desc)
27932 {
27935 else
27936 {
27937 /* Output the MESSAGE -- unless we're parsing tentatively. */
27941 }
27942 }
27944 /* An error message is produced if the next token is not '>'.
27945 All further tokens are skipped until the desired token is
27946 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27948 static void
27950 {
27951 /* Current level of '< ... >'. */
27953 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27956 /* Are we ready, yet? If not, issue error message. */
27960 /* Skip tokens until the desired token is found. */
27962 {
27963 /* Peek at the next token. */
27965 {
27973 /* C++0x views the `>>' operator as two `>' tokens, but
27974 C++98 does not. */
27977 {
27978 /* We've hit a `>>' where the first `>' closes the
27979 template argument list, and the second `>' is
27980 spurious. Just consume the `>>' and stop; we've
27981 already produced at least one error. */
27984 }
27985 /* Fall through for C++0x, so we handle the second `>' in
27986 the `>>'. */
27991 {
27992 /* We've reached the token we want, consume it and stop. */
27995 }
28014 /* The '>' was probably forgotten, don't look further. */
28019 }
28021 /* Consume this token. */
28023 }
28024 }
28026 /* If the next token is the indicated keyword, consume it. Otherwise,
28027 issue an error message indicating that TOKEN_DESC was expected.
28029 Returns the token consumed, if the token had the appropriate type.
28030 Otherwise, returns NULL. */
28035 required_token token_desc)
28036 {
28040 {
28043 }
28046 }
28048 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28049 function-definition. */
28051 static bool
28053 {
28056 /* A ctor-initializer begins with a `:'. */
28058 /* A function-try-block begins with `try'. */
28060 /* A function-transaction-block begins with `__transaction_atomic'
28061 or `__transaction_relaxed'. */
28064 /* The named return value extension begins with `return'. */
28066 }
28068 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28069 definition. */
28071 static bool
28073 {
28080 }
28082 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28083 C++0x) ending a template-argument. */
28085 static bool
28087 {
28095 }
28097 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28098 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28100 static bool
28103 {
28109 /* Check for the sequence `<::' in the original code. It would be lexed as
28110 `[:', where `[' is a digraph, and there is no whitespace before
28111 `:'. */
28113 {
28118 }
28120 }
28122 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28123 or none_type otherwise. */
28125 static enum tag_types
28127 {
28129 {
28139 }
28140 }
28142 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28143 or none_type otherwise or if the token is null. */
28145 static enum tag_types
28147 {
28152 {
28160 }
28161 }
28163 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28165 static void
28167 {
28171 {
28175 type))
28178 }
28179 }
28181 /* Issue an error message if DECL is redeclared with different
28182 access than its original declaration [class.access.spec/3].
28183 This applies to nested classes, nested class templates and
28184 enumerations [class.mem/1]. */
28186 static void
28188 {
28199 }
28201 /* Look for the `template' keyword, as a syntactic disambiguator.
28202 Return TRUE iff it is present, in which case it will be
28203 consumed. */
28205 static bool
28207 {
28209 {
28210 /* In C++98 the `template' keyword can only be used within templates;
28211 outside templates the parser can always figure out what is a
28212 template and what is not. In C++11, per the resolution of DR 468,
28213 `template' is allowed in cases where it is not strictly necessary. */
28216 {
28219 "in C++98 %<template%> (as a disambiguator) is only "
28221 /* If this part of the token stream is rescanned, the same
28222 error message would be generated. So, we purge the token
28223 from the stream. */
28226 }
28227 else
28228 {
28229 /* Consume the `template' keyword. */
28232 }
28233 }
28235 }
28237 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28238 set PARSER->SCOPE, and perform other related actions. */
28240 static void
28242 {
28245 /* Get the stored value. */
28247 /* Set the scope from the stored value. */
28251 }
28253 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28254 encounter the end of a block before what we were looking for. */
28256 static bool
28260 {
28262 {
28265 /* Abort a parenthesized expression if we encounter a semicolon. */
28269 /* If we've reached the end of the file, stop. */
28275 /* We've hit the end of an enclosing block, so there's been some
28276 kind of syntax error. */
28279 /* Consume the token. */
28281 /* See if it starts a new group. */
28283 {
28285 /* In theory this should probably check end == '}', but
28286 cp_parser_save_member_function_body needs it to exit
28287 after either '}' or ')' when called with ')'. */
28290 }
28292 {
28296 }
28301 }
28302 }
28304 /* Like above, for caching a default argument or NSDMI. Both of these are
28305 terminated by a non-nested comma, but it can be unclear whether or not a
28306 comma is nested in a template argument list unless we do more parsing.
28307 In order to handle this ambiguity, when we encounter a ',' after a '<'
28308 we try to parse what follows as a parameter-declaration-list (in the
28309 case of a default argument) or a member-declarator (in the case of an
28310 NSDMI). If that succeeds, then we stop caching. */
28312 static tree
28314 {
28319 tree default_argument;
28321 /* Add tokens until we have processed the entire default
28322 argument. We add the range [first_token, token). */
28325 {
28326 /* For list-initialization, this is straightforward. */
28329 }
28331 {
28334 /* Peek at the next token. */
28336 /* What we do depends on what token we have. */
28338 {
28339 /* In valid code, a default argument must be
28340 immediately followed by a `,' `)', or `...'. */
28343 {
28344 /* If we've seen a '<', we might be in a
28345 template-argument-list. Until Core issue 325 is
28346 resolved, we don't know how this situation ought
28347 to be handled, so try to DTRT. We check whether
28348 what comes after the comma is a valid parameter
28349 declaration list. If it is, then the comma ends
28350 the default argument; otherwise the default
28351 argument continues. */
28355 /* Set ITALP so cp_parser_parameter_declaration_list
28356 doesn't decide to commit to this parse. */
28363 {
28364 /* Parse declarators until we reach a non-comma or
28365 somthing that cannot be an initializer.
28366 Just checking whether we're looking at a single
28367 declarator is insufficient. Consider:
28368 int var = tuple<T,U>::x;
28369 The template parameter 'U' looks exactly like a
28370 declarator. */
28371 do
28372 {
28383 }
28385 /* If we met an '=' or ';' then the original comma
28386 was the end of the NSDMI. Otherwise assume
28387 we're still in the NSDMI. */
28390 }
28391 else
28392 {
28397 }
28404 }
28405 /* FALLTHRU */
28408 /* If we run into a non-nested `;', `}', or `]',
28409 then the code is invalid -- but the default
28410 argument is certainly over. */
28415 /* Handle correctly int n = sizeof ... ( p ); */
28418 /* Update DEPTH, if necessary. */
28433 /* This might be the comparison operator, or it might
28434 start a template argument list. */
28441 /* Fall through for C++0x, which treats the `>>'
28442 operator like two `>' tokens in certain
28443 cases. */
28448 {
28449 /* This might be an operator, or it might close a
28450 template argument list. But if a previous '<'
28451 started a template argument list, this will have
28452 closed it, so we can't be in one anymore. */
28456 }
28459 /* If we run out of tokens, issue an error message. */
28467 /* In these cases, we should look for template-ids.
28468 For example, if the default argument is
28469 `X<int, double>()', we need to do name lookup to
28470 figure out whether or not `X' is a template; if
28471 so, the `,' does not end the default argument.
28473 That is not yet done. */
28478 }
28480 /* If we've reached the end, stop. */
28484 /* Add the token to the token block. */
28486 }
28488 /* Create a DEFAULT_ARG to represent the unparsed default
28489 argument. */
28496 }
28498 /* Begin parsing tentatively. We always save tokens while parsing
28499 tentatively so that if the tentative parsing fails we can restore the
28500 tokens. */
28502 static void
28504 {
28505 /* Enter a new parsing context. */
28507 /* Begin saving tokens. */
28509 /* In order to avoid repetitive access control error messages,
28510 access checks are queued up until we are no longer parsing
28511 tentatively. */
28513 }
28515 /* Commit to the currently active tentative parse. */
28517 static void
28519 {
28523 /* Mark all of the levels as committed. */
28526 {
28533 }
28534 }
28536 /* Commit to the topmost currently active tentative parse.
28538 Note that this function shouldn't be called when there are
28539 irreversible side-effects while in a tentative state. For
28540 example, we shouldn't create a permanent entry in the symbol
28541 table, or issue an error message that might not apply if the
28542 tentative parse is aborted. */
28544 static void
28546 {
28551 {
28559 }
28560 }
28562 /* Abort the currently active tentative parse. All consumed tokens
28563 will be rolled back, and no diagnostics will be issued. */
28565 static void
28567 {
28571 /* Now, pretend that we want to see if the construct was
28572 successfully parsed. */
28574 }
28576 /* Stop parsing tentatively. If a parse error has occurred, restore the
28577 token stream. Otherwise, commit to the tokens we have consumed.
28578 Returns true if no error occurred; false otherwise. */
28580 static bool
28582 {
28586 /* Remember whether or not an error occurred, since we are about to
28587 destroy that information. */
28589 /* Remove the topmost context from the stack. */
28592 /* If no parse errors occurred, commit to the tentative parse. */
28594 {
28595 /* Commit to the tokens read tentatively, unless that was
28596 already done. */
28601 }
28602 /* Otherwise, if errors occurred, roll back our state so that things
28603 are just as they were before we began the tentative parse. */
28604 else
28605 {
28608 }
28609 /* Add the context to the front of the free list. */
28614 }
28616 /* Returns true if we are parsing tentatively and are not committed to
28617 this tentative parse. */
28619 static bool
28621 {
28624 }
28626 /* Returns nonzero iff an error has occurred during the most recent
28627 tentative parse. */
28629 static bool
28631 {
28634 }
28636 /* Returns nonzero if GNU extensions are allowed. */
28638 static bool
28640 {
28642 }
28643 \f
28644 /* Objective-C++ Productions */
28647 /* Parse an Objective-C expression, which feeds into a primary-expression
28648 above.
28650 objc-expression:
28651 objc-message-expression
28652 objc-string-literal
28653 objc-encode-expression
28654 objc-protocol-expression
28655 objc-selector-expression
28657 Returns a tree representation of the expression. */
28659 static cp_expr
28661 {
28662 /* Try to figure out what kind of declaration is present. */
28666 {
28676 {
28688 }
28694 }
28697 }
28699 /* Parse an Objective-C message expression.
28701 objc-message-expression:
28702 [ objc-message-receiver objc-message-args ]
28704 Returns a representation of an Objective-C message. */
28706 static tree
28708 {
28720 /* Construct a location e.g.
28721 [self func1:5]
28722 ^~~~~~~~~~~~~~
28723 ranging from the '[' to the ']', with the caret at the start. */
28728 }
28730 /* Parse an objc-message-receiver.
28732 objc-message-receiver:
28733 expression
28734 simple-type-specifier
28736 Returns a representation of the type or expression. */
28738 static tree
28740 {
28741 tree rcv;
28743 /* An Objective-C message receiver may be either (1) a type
28744 or (2) an expression. */
28748 /* If that worked out, fine. */
28755 CP_PARSER_FLAGS_NONE);
28762 }
28764 /* Parse the arguments and selectors comprising an Objective-C message.
28766 objc-message-args:
28767 objc-selector
28768 objc-selector-args
28769 objc-selector-args , objc-comma-args
28771 objc-selector-args:
28772 objc-selector [opt] : assignment-expression
28773 objc-selector-args objc-selector [opt] : assignment-expression
28775 objc-comma-args:
28776 assignment-expression
28777 objc-comma-args , assignment-expression
28779 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28780 selector arguments and TREE_VALUE containing a list of comma
28781 arguments. */
28783 static tree
28785 {
28791 {
28797 /* Detect if we have a unary selector. */
28806 sel_args
28811 }
28813 /* Handle non-selector arguments, if any. */
28815 {
28816 tree arg;
28821 addl_args
28826 }
28829 {
28832 }
28835 }
28837 /* Parse an Objective-C encode expression.
28839 objc-encode-expression:
28840 @encode objc-typename
28842 Returns an encoded representation of the type argument. */
28844 static cp_expr
28846 {
28847 tree type;
28858 {
28862 }
28864 /* This happens if we find @encode(T) (where T is a template
28865 typename or something dependent on a template typename) when
28866 parsing a template. In that case, we can't compile it
28867 immediately, but we rather create an AT_ENCODE_EXPR which will
28868 need to be instantiated when the template is used.
28869 */
28871 {
28875 }
28878 /* Build a location of the form:
28879 @encode(int)
28880 ^~~~~~~~~~~~
28881 with caret==start at the @ token, finishing at the close paren. */
28882 location_t combined_loc
28887 }
28889 /* Parse an Objective-C @defs expression. */
28891 static tree
28893 {
28894 tree name;
28902 }
28904 /* Parse an Objective-C protocol expression.
28906 objc-protocol-expression:
28907 @protocol ( identifier )
28909 Returns a representation of the protocol expression. */
28911 static tree
28913 {
28914 tree proto;
28922 /* Build a location of the form:
28923 @protocol(prot)
28924 ^~~~~~~~~~~~~~~
28925 with caret==start at the @ token, finishing at the close paren. */
28926 location_t combined_loc
28932 }
28934 /* Parse an Objective-C selector expression.
28936 objc-selector-expression:
28937 @selector ( objc-method-signature )
28939 objc-method-signature:
28940 objc-selector
28941 objc-selector-seq
28943 objc-selector-seq:
28944 objc-selector :
28945 objc-selector-seq objc-selector :
28947 Returns a representation of the method selector. */
28949 static tree
28951 {
28963 {
28972 {
28973 /* Detect if we have a unary selector. */
28975 {
28978 }
28979 else
28980 {
28982 }
28983 }
28988 {
28989 sel_seq
28992 sel_seq
28995 }
28996 else
28997 sel_seq
29002 }
29004 finish_selector:
29008 /* Build a location of the form:
29009 @selector(func)
29010 ^~~~~~~~~~~~~~~
29011 with caret==start at the @ token, finishing at the close paren. */
29012 location_t combined_loc
29016 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29019 }
29021 /* Parse a list of identifiers.
29023 objc-identifier-list:
29024 identifier
29025 objc-identifier-list , identifier
29027 Returns a TREE_LIST of identifier nodes. */
29029 static tree
29031 {
29032 tree identifier;
29033 tree list;
29044 {
29051 identifier));
29053 }
29056 }
29058 /* Parse an Objective-C alias declaration.
29060 objc-alias-declaration:
29061 @compatibility_alias identifier identifier ;
29063 This function registers the alias mapping with the Objective-C front end.
29064 It returns nothing. */
29066 static void
29068 {
29076 }
29078 /* Parse an Objective-C class forward-declaration.
29080 objc-class-declaration:
29081 @class objc-identifier-list ;
29083 The function registers the forward declarations with the Objective-C
29084 front end. It returns nothing. */
29086 static void
29088 {
29091 {
29092 tree id;
29102 else
29104 }
29106 }
29108 /* Parse a list of Objective-C protocol references.
29110 objc-protocol-refs-opt:
29111 objc-protocol-refs [opt]
29113 objc-protocol-refs:
29114 < objc-identifier-list >
29116 Returns a TREE_LIST of identifiers, if any. */
29118 static tree
29120 {
29124 {
29128 }
29131 }
29133 /* Parse a Objective-C visibility specification. */
29135 static void
29137 {
29141 {
29156 }
29158 /* Eat '@private'/'@protected'/'@public'. */
29160 }
29162 /* Parse an Objective-C method type. Return 'true' if it is a class
29163 (+) method, and 'false' if it is an instance (-) method. */
29167 {
29170 else
29172 }
29174 /* Parse an Objective-C protocol qualifier. */
29176 static tree
29178 {
29191 {
29196 }
29199 }
29201 /* Parse an Objective-C typename. */
29203 static tree
29205 {
29209 {
29215 /* An ObjC type name may consist of just protocol qualifiers, in which
29216 case the type shall default to 'id'. */
29218 {
29221 /* If the type could not be parsed, an error has already
29222 been produced. For error recovery, behave as if it had
29223 not been specified, which will use the default type
29224 'id'. */
29226 {
29228 /* We need to skip to the closing parenthesis as
29229 cp_parser_type_id() does not seem to do it for
29230 us. */
29235 }
29236 }
29240 }
29243 }
29245 /* Check to see if TYPE refers to an Objective-C selector name. */
29247 static bool
29249 {
29255 }
29257 /* Parse an Objective-C selector. */
29259 static tree
29261 {
29265 {
29268 }
29270 /* C++ operator names are allowed to appear in ObjC selectors. */
29272 {
29285 }
29286 }
29288 /* Parse an Objective-C params list. */
29290 static tree
29292 {
29298 {
29308 /* Detect if we have a unary selector. */
29311 {
29314 }
29318 {
29319 /* Something went quite wrong. There should be a colon
29320 here, but there is not. Stop parsing parameters. */
29322 }
29324 /* New ObjC allows attributes on parameters too. */
29329 params
29332 type_name,
29333 identifier,
29334 parm_attr));
29337 }
29340 {
29343 }
29345 /* We allow tail attributes for the method. */
29347 {
29355 }
29358 {
29361 }
29363 }
29365 /* Parse the non-keyword Objective-C params. */
29367 static tree
29370 {
29376 {
29378 tree parm;
29384 {
29389 }
29391 /* TODO: parse attributes for tail parameters. */
29400 }
29402 /* We allow tail attributes for the method. */
29404 {
29406 {
29411 }
29412 else
29413 /* We have an error, but parse the attributes, so that we can
29414 carry on. */
29420 }
29423 }
29425 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29427 static void
29429 {
29432 /* If the next token is `extern' and the following token is a string
29433 literal, then we have a linkage specification. */
29435 && cp_parser_is_pure_string_literal
29438 /* Handle #pragma, if any. */
29441 /* Allow stray semicolons. */
29444 /* Mark methods as optional or required, when building protocols. */
29446 {
29449 }
29451 {
29454 }
29457 /* Other stray characters must generate errors. */
29459 {
29463 }
29464 /* Finally, try to parse a block-declaration, or a function-definition. */
29465 else
29467 }
29469 /* Parse a method signature. */
29471 static tree
29473 {
29489 }
29491 static bool
29493 {
29494 tree tattr;
29499 /* If the attributes are followed by a method introducer, this is not allowed.
29500 Dump the attributes and flag the situation. */
29505 /* Otherwise, the attributes introduce some interstitial code, possibly so
29506 rewind to allow that check. */
29509 }
29511 /* Parse an Objective-C method prototype list. */
29513 static void
29515 {
29519 {
29521 {
29526 else
29530 {
29534 }
29537 }
29543 OPT_Wattributes,
29545 else
29546 /* Allow for interspersed non-ObjC++ code. */
29550 }
29554 else
29558 }
29560 /* Parse an Objective-C method definition list. */
29562 static void
29564 {
29568 {
29569 tree meth;
29572 {
29578 else
29583 {
29587 }
29589 NULL_TREE);
29591 /* For historical reasons, we accept an optional semicolon. */
29598 {
29605 }
29606 }
29607 /* The following case will be removed once @synthesize is
29608 completely implemented. */
29619 else
29620 /* Allow for interspersed non-ObjC++ code. */
29624 }
29628 else
29632 }
29634 /* Parse Objective-C ivars. */
29636 static void
29638 {
29649 {
29650 cp_decl_specifier_seq declspecs;
29652 tree prefix_attributes;
29660 CP_PARSER_FLAGS_OPTIONAL,
29664 /* auto, register, static, extern, mutable. */
29666 {
29669 }
29671 /* thread_local. */
29673 {
29676 }
29678 /* typedef. */
29680 {
29683 }
29688 /* Keep going until we hit the `;' at the end of the
29689 declaration. */
29691 {
29696 /* Check for a (possibly unnamed) bitfield declaration. */
29704 {
29705 /* Get the name of the bitfield. */
29708 sfk_none);
29710 eat_colon:
29712 /* Get the width of the bitfield. */
29713 width
29715 }
29716 else
29717 {
29718 /* Parse the declarator. */
29719 declarator
29725 }
29727 /* Look for attributes that apply to the ivar. */
29729 /* Remember which attributes are prefix attributes and
29730 which are not. */
29732 /* Combine the attributes. */
29736 /* Create the bitfield declaration. */
29738 width,
29739 attributes);
29740 else
29745 /* Add the instance variable. */
29749 /* Reset PREFIX_ATTRIBUTES. */
29758 {
29761 }
29763 }
29767 }
29772 /* Do not consume the RID_AT_END, so it will be read again as terminating
29773 the @interface of @implementation. */
29777 /* For historical reasons, we accept an optional semicolon. */
29780 }
29782 /* Parse an Objective-C protocol declaration. */
29784 static void
29786 {
29792 {
29797 }
29799 /* See if we have a forward declaration or a definition. */
29802 /* Try a forward declaration first. */
29804 {
29806 {
29807 tree id;
29817 else
29819 }
29821 }
29823 /* Ok, we got a full-fledged definition (or at least should). */
29824 else
29825 {
29830 }
29831 }
29833 /* Parse an Objective-C superclass or category. */
29835 static void
29840 {
29846 {
29849 }
29851 {
29854 /* If there is no category name, and this is an @interface, we
29855 have a class extension. */
29857 {
29860 }
29861 else
29865 }
29866 }
29868 /* Parse an Objective-C class interface. */
29870 static void
29872 {
29879 {
29880 /* It's hard to recover because even if valid @interface stuff
29881 is to follow, we can't compile it (or validate it) if we
29882 don't even know which class it refers to. Let's assume this
29883 was a stray '@interface' token in the stream and skip it.
29884 */
29886 }
29891 /* We have either a class or a category on our hands. */
29894 else
29895 {
29897 /* Handle instance variable declarations, if any. */
29900 }
29903 }
29905 /* Parse an Objective-C class implementation. */
29907 static void
29909 {
29916 {
29917 /* It's hard to recover because even if valid @implementation
29918 stuff is to follow, we can't compile it (or validate it) if
29919 we don't even know which class it refers to. Let's assume
29920 this was a stray '@implementation' token in the stream and
29921 skip it.
29922 */
29924 }
29928 /* We have either a class or a category on our hands. */
29931 else
29932 {
29934 /* Handle instance variable declarations, if any. */
29937 }
29940 }
29942 /* Consume the @end token and finish off the implementation. */
29944 static void
29946 {
29949 }
29951 /* Parse an Objective-C declaration. */
29953 static void
29955 {
29956 /* Try to figure out what kind of declaration is present. */
29961 {
29977 }
29980 {
30003 }
30004 }
30006 /* Parse an Objective-C try-catch-finally statement.
30008 objc-try-catch-finally-stmt:
30009 @try compound-statement objc-catch-clause-seq [opt]
30010 objc-finally-clause [opt]
30012 objc-catch-clause-seq:
30013 objc-catch-clause objc-catch-clause-seq [opt]
30015 objc-catch-clause:
30016 @catch ( objc-exception-declaration ) compound-statement
30018 objc-finally-clause:
30019 @finally compound-statement
30021 objc-exception-declaration:
30022 parameter-declaration
30023 '...'
30025 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30027 Returns NULL_TREE.
30029 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30030 for C. Keep them in sync. */
30032 static tree
30034 {
30035 location_t location;
30036 tree stmt;
30041 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30042 node, lest it get absorbed into the surrounding block. */
30048 {
30057 {
30058 /* We have "@catch (...)" (where the '...' are literally
30059 what is in the code). Skip the '...'.
30060 parameter_declaration is set to NULL_TREE, and
30061 objc_being_catch_clauses() knows that that means
30062 '...'. */
30065 }
30066 else
30067 {
30068 /* We have "@catch (NSException *exception)" or something
30069 like that. Parse the parameter declaration. */
30073 else
30078 }
30081 else
30082 {
30083 /* If there was no open parenthesis, we are recovering from
30084 an error, and we are trying to figure out what mistake
30085 the user has made. */
30087 /* If there is an immediate closing parenthesis, the user
30088 probably forgot the opening one (ie, they typed "@catch
30089 NSException *e)". Parse the closing parenthesis and keep
30090 going. */
30094 /* If these is no immediate closing parenthesis, the user
30095 probably doesn't know that parenthesis are required at
30096 all (ie, they typed "@catch NSException *e"). So, just
30097 forget about the closing parenthesis and keep going. */
30098 }
30102 }
30104 {
30107 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30108 node, lest it get absorbed into the surrounding block. */
30112 }
30115 }
30117 /* Parse an Objective-C synchronized statement.
30119 objc-synchronized-stmt:
30120 @synchronized ( expression ) compound-statement
30122 Returns NULL_TREE. */
30124 static tree
30126 {
30127 location_t location;
30138 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30139 node, lest it get absorbed into the surrounding block. */
30144 }
30146 /* Parse an Objective-C throw statement.
30148 objc-throw-stmt:
30149 @throw assignment-expression [opt] ;
30151 Returns a constructed '@throw' statement. */
30153 static tree
30155 {
30167 }
30169 /* Parse an Objective-C statement. */
30171 static tree
30173 {
30174 /* Try to figure out what kind of declaration is present. */
30178 {
30189 }
30192 }
30194 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30195 look ahead to see if an objc keyword follows the attributes. This
30196 is to detect the use of prefix attributes on ObjC @interface and
30197 @protocol. */
30199 static bool
30201 {
30206 {
30209 }
30212 }
30214 /* This routine is a minimal replacement for
30215 c_parser_struct_declaration () used when parsing the list of
30216 types/names or ObjC++ properties. For example, when parsing the
30217 code
30219 @property (readonly) int a, b, c;
30221 this function is responsible for parsing "int a, int b, int c" and
30222 returning the declarations as CHAIN of DECLs.
30224 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30225 similar parsing. */
30226 static tree
30228 {
30230 cp_decl_specifier_seq declspecs;
30232 tree prefix_attributes;
30235 CP_PARSER_FLAGS_NONE,
30242 /* auto, register, static, extern, mutable. */
30244 {
30247 }
30249 /* thread_local. */
30251 {
30254 }
30256 /* typedef. */
30258 {
30261 }
30266 /* Keep going until we hit the `;' at the end of the declaration. */
30268 {
30273 /* Parse the declarator. */
30277 /* Look for attributes that apply to the ivar. */
30279 /* Remember which attributes are prefix attributes and
30280 which are not. */
30282 /* Combine the attributes. */
30292 /* Reset PREFIX_ATTRIBUTES. */
30303 {
30306 }
30307 else
30309 }
30311 }
30313 /* Parse an Objective-C @property declaration. The syntax is:
30315 objc-property-declaration:
30316 '@property' objc-property-attributes[opt] struct-declaration ;
30318 objc-property-attributes:
30319 '(' objc-property-attribute-list ')'
30321 objc-property-attribute-list:
30322 objc-property-attribute
30323 objc-property-attribute-list, objc-property-attribute
30325 objc-property-attribute
30326 'getter' = identifier
30327 'setter' = identifier
30328 'readonly'
30329 'readwrite'
30330 'assign'
30331 'retain'
30332 'copy'
30333 'nonatomic'
30335 For example:
30336 @property NSString *name;
30337 @property (readonly) id object;
30338 @property (retain, nonatomic, getter=getTheName) id name;
30339 @property int a, b, c;
30341 PS: This function is identical to
30342 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30343 static void
30345 {
30346 /* The following variables hold the attributes of the properties as
30347 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30348 seen. When we see an attribute, we set them to 'true' (if they
30349 are boolean properties) or to the identifier (if they have an
30350 argument, ie, for getter and setter). Note that here we only
30351 parse the list of attributes, check the syntax and accumulate the
30352 attributes that we find. objc_add_property_declaration() will
30353 then process the information. */
30363 /* 'properties' is the list of properties that we read. Usually a
30364 single one, but maybe more (eg, in "@property int a, b, c;" there
30365 are three). */
30366 tree properties;
30367 location_t loc;
30373 /* Parse the optional attribute list... */
30375 {
30376 /* Eat the '('. */
30380 {
30386 {
30389 }
30393 {
30404 {
30408 else
30413 }
30416 {
30420 }
30422 {
30424 {
30427 }
30428 else
30432 else
30434 }
30435 else
30436 {
30438 {
30441 }
30442 else
30444 }
30450 }
30457 else
30459 }
30461 /* FIXME: "@property (setter, assign);" will generate a spurious
30462 "error: expected ‘)’ before ‘,’ token". This is because
30463 cp_parser_require, unlike the C counterpart, will produce an
30464 error even if we are in error recovery. */
30466 {
30471 }
30472 }
30474 /* ... and the property declaration(s). */
30478 {
30480 /* If the next token is now a `;', consume it. */
30484 }
30488 else
30489 {
30490 /* Comma-separated properties are chained together in
30491 reverse order; add them one by one. */
30500 }
30503 }
30505 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30507 objc-synthesize-declaration:
30508 @synthesize objc-synthesize-identifier-list ;
30510 objc-synthesize-identifier-list:
30511 objc-synthesize-identifier
30512 objc-synthesize-identifier-list, objc-synthesize-identifier
30514 objc-synthesize-identifier
30515 identifier
30516 identifier = identifier
30518 For example:
30519 @synthesize MyProperty;
30520 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30522 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30523 for C. Keep them in sync.
30524 */
30525 static void
30527 {
30529 location_t loc;
30534 {
30538 {
30541 }
30543 {
30547 {
30550 }
30551 }
30552 else
30557 else
30559 }
30562 }
30564 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30566 objc-dynamic-declaration:
30567 @dynamic identifier-list ;
30569 For example:
30570 @dynamic MyProperty;
30571 @dynamic MyProperty, AnotherProperty;
30573 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30574 for C. Keep them in sync.
30575 */
30576 static void
30578 {
30580 location_t loc;
30585 {
30586 tree property;
30589 {
30592 }
30596 else
30598 }
30601 }
30603 \f
30604 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30606 /* Returns name of the next clause.
30607 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30608 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30609 returned and the token is consumed. */
30611 static pragma_omp_clause
30613 {
30629 {
30634 {
30817 }
30818 }
30824 }
30826 /* Validate that a clause of the given type does not already exist. */
30828 static void
30831 {
30832 tree c;
30836 {
30839 }
30840 }
30842 /* OpenMP 2.5:
30843 variable-list:
30844 identifier
30845 variable-list , identifier
30847 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30848 colon). An opening parenthesis will have been consumed by the caller.
30850 If KIND is nonzero, create the appropriate node and install the decl
30851 in OMP_CLAUSE_DECL and add the node to the head of the list.
30853 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30854 return the list created.
30856 COLON can be NULL if only closing parenthesis should end the list,
30857 or pointer to bool which will receive false if the list is terminated
30858 by closing parenthesis or true if the list is terminated by colon. */
30860 static tree
30863 {
30867 {
30870 }
30872 {
30877 && current_class_ptr
30879 {
30885 }
30886 else
30887 {
30900 }
30902 ;
30904 {
30906 {
30908 /* The OpenACC cache directive explicitly only allows "array
30909 elements or subarrays". */
30911 {
30915 }
30916 /* FALLTHROUGH. */
30921 {
30922 location_t loc
30927 decl
30931 }
30932 /* FALLTHROUGH. */
30936 {
30944 parser->colon_corrects_to_scope_p
30948 else
30949 {
30950 /* Look for `:'. */
30954 CPP_CLOSE_SQUARE))
30956 }
30957 /* Look for the closing `]'. */
30959 RT_CLOSE_SQUARE))
30963 }
30967 }
30973 }
30974 else
30977 get_comma:
30981 }
30987 {
30991 }
30994 {
30997 /* Try to resync to an unnested comma. Copied from
30998 cp_parser_parenthesized_expression_list. */
30999 skip_comma:
31008 }
31011 }
31013 /* Similarly, but expect leading and trailing parenthesis. This is a very
31014 common case for omp clauses. */
31016 static tree
31018 {
31022 }
31024 /* OpenACC 2.0:
31025 copy ( variable-list )
31026 copyin ( variable-list )
31027 copyout ( variable-list )
31028 create ( variable-list )
31029 delete ( variable-list )
31030 present ( variable-list )
31031 present_or_copy ( variable-list )
31032 pcopy ( variable-list )
31033 present_or_copyin ( variable-list )
31034 pcopyin ( variable-list )
31035 present_or_copyout ( variable-list )
31036 pcopyout ( variable-list )
31037 present_or_create ( variable-list )
31038 pcreate ( variable-list ) */
31040 static tree
31042 tree list)
31043 {
31046 {
31092 }
31100 }
31102 /* OpenACC 2.0:
31103 deviceptr ( variable-list ) */
31105 static tree
31107 {
31111 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31112 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31113 variable-list must only allow for pointer variables. */
31116 {
31123 }
31126 }
31128 /* OpenACC 2.0:
31129 auto
31130 independent
31131 nohost
31132 seq */
31134 static tree
31138 {
31143 }
31145 /* OpenACC:
31146 num_gangs ( expression )
31147 num_workers ( expression )
31148 vector_length ( expression ) */
31150 static tree
31153 {
31163 {
31168 }
31176 }
31178 /* OpenACC:
31180 gang [( gang-arg-list )]
31181 worker [( [num:] int-expr )]
31182 vector [( [length:] int-expr )]
31184 where gang-arg is one of:
31186 [num:] int-expr
31187 static: size-expr
31189 and size-expr may be:
31191 *
31192 int-expr
31193 */
31195 static tree
31198 {
31208 {
31211 do
31212 {
31216 /* Gang static argument. */
31219 {
31227 {
31230 }
31232 /* Check for the '*' argument. */
31236 CPP_CLOSE_PAREN)))
31237 {
31242 {
31245 }
31247 }
31248 }
31249 /* Worker num: argument and vector length: arguments. */
31253 {
31256 }
31258 /* Now collect the actual argument. */
31260 {
31263 }
31275 {
31278 }
31280 }
31285 }
31299 cleanup_error:
31302 }
31304 /* OpenACC 2.0:
31305 tile ( size-expr-list ) */
31307 static tree
31309 {
31313 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31314 so, but the spec authors never considered such a case and have
31315 differing opinions on what it might mean, including 'not
31316 allowed'.) */
31319 clause_loc);
31324 do
31325 {
31332 {
31335 }
31336 else
31340 }
31343 /* Consume the trailing ')'. */
31351 }
31353 /* OpenACC 2.0
31354 Parse wait clause or directive parameters. */
31356 static tree
31358 {
31368 {
31373 }
31380 {
31384 {
31387 else
31388 {
31395 }
31396 }
31397 }
31400 }
31402 /* OpenACC:
31403 wait ( int-expr-list ) */
31405 static tree
31407 {
31416 }
31418 /* OpenMP 3.0:
31419 collapse ( constant-expression ) */
31421 static tree
31423 {
31425 location_t loc;
31426 HOST_WIDE_INT n;
31446 {
31449 }
31458 }
31460 /* OpenMP 2.5:
31461 default ( shared | none )
31463 OpenACC 2.0
31464 default (none) */
31466 static tree
31469 {
31471 tree c;
31476 {
31481 {
31496 }
31499 }
31500 else
31501 {
31502 invalid_kind:
31505 else
31507 }
31523 }
31525 /* OpenMP 3.1:
31526 final ( expression ) */
31528 static tree
31530 {
31551 }
31553 /* OpenMP 2.5:
31554 if ( expression )
31556 OpenMP 4.5:
31557 if ( directive-name-modifier : expression )
31559 directive-name-modifier:
31560 parallel | task | taskloop | target data | target | target update
31561 | target enter data | target exit data */
31563 static tree
31566 {
31574 {
31586 {
31589 {
31602 else
31603 {
31604 location_t loc
31609 }
31612 {
31614 {
31619 }
31621 {
31622 location_t loc
31626 }
31627 }
31628 }
31629 }
31631 {
31633 {
31636 }
31637 else
31638 {
31640 {
31641 location_t loc
31644 }
31646 }
31647 }
31648 }
31660 {
31663 {
31666 {
31676 }
31678 p);
31680 }
31682 {
31685 else
31688 }
31691 {
31695 }
31696 }
31704 }
31706 /* OpenMP 3.1:
31707 mergeable */
31709 static tree
31712 {
31713 tree c;
31716 location);
31721 }
31723 /* OpenMP 2.5:
31724 nowait */
31726 static tree
31729 {
31730 tree c;
31737 }
31739 /* OpenMP 2.5:
31740 num_threads ( expression ) */
31742 static tree
31744 location_t location)
31745 {
31767 }
31769 /* OpenMP 4.5:
31770 num_tasks ( expression ) */
31772 static tree
31774 location_t location)
31775 {
31797 }
31799 /* OpenMP 4.5:
31800 grainsize ( expression ) */
31802 static tree
31804 location_t location)
31805 {
31827 }
31829 /* OpenMP 4.5:
31830 priority ( expression ) */
31832 static tree
31834 location_t location)
31835 {
31857 }
31859 /* OpenMP 4.5:
31860 hint ( expression ) */
31862 static tree
31864 location_t location)
31865 {
31886 }
31888 /* OpenMP 4.5:
31889 defaultmap ( tofrom : scalar ) */
31891 static tree
31893 location_t location)
31894 {
31902 {
31905 }
31909 {
31912 }
31918 {
31921 }
31925 {
31928 }
31934 location);
31940 out_err:
31945 }
31947 /* OpenMP 2.5:
31948 ordered
31950 OpenMP 4.5:
31951 ordered ( constant-expression ) */
31953 static tree
31956 {
31958 HOST_WIDE_INT n;
31964 {
31981 {
31983 "ordered argument needs positive constant integer "
31986 }
31987 }
31993 }
31995 /* OpenMP 2.5:
31996 reduction ( reduction-operator : variable-list )
31998 reduction-operator:
31999 One of: + * - & ^ | && ||
32001 OpenMP 3.1:
32003 reduction-operator:
32004 One of: + * - & ^ | && || min max
32006 OpenMP 4.0:
32008 reduction-operator:
32009 One of: + * - & ^ | && ||
32010 id-expression */
32012 static tree
32014 {
32022 {
32032 }
32036 else
32037 {
32048 {
32078 }
32079 else
32080 {
32082 resync_fail:
32087 }
32088 }
32094 NULL);
32096 {
32099 }
32102 }
32104 /* OpenMP 2.5:
32105 schedule ( schedule-kind )
32106 schedule ( schedule-kind , expression )
32108 schedule-kind:
32109 static | dynamic | guided | runtime | auto
32111 OpenMP 4.5:
32112 schedule ( schedule-modifier : schedule-kind )
32113 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32115 schedule-modifier:
32116 simd
32117 monotonic
32118 nonmonotonic */
32120 static tree
32122 {
32132 {
32141 else
32147 else
32148 {
32151 }
32152 }
32155 {
32160 {
32181 }
32182 }
32187 else
32193 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32195 {
32199 }
32202 {
32217 else
32222 }
32234 invalid_kind:
32236 resync_fail:
32241 }
32243 /* OpenMP 3.0:
32244 untied */
32246 static tree
32249 {
32250 tree c;
32257 }
32259 /* OpenMP 4.0:
32260 inbranch
32261 notinbranch */
32263 static tree
32266 {
32271 }
32273 /* OpenMP 4.0:
32274 parallel
32275 for
32276 sections
32277 taskgroup */
32279 static tree
32283 {
32287 }
32289 /* OpenMP 4.5:
32290 nogroup */
32292 static tree
32295 {
32300 }
32302 /* OpenMP 4.5:
32303 simd
32304 threads */
32306 static tree
32310 {
32315 }
32317 /* OpenMP 4.0:
32318 num_teams ( expression ) */
32320 static tree
32322 location_t location)
32323 {
32345 }
32347 /* OpenMP 4.0:
32348 thread_limit ( expression ) */
32350 static tree
32352 location_t location)
32353 {
32375 }
32377 /* OpenMP 4.0:
32378 aligned ( variable-list )
32379 aligned ( variable-list : constant-expression ) */
32381 static tree
32383 {
32394 {
32404 }
32410 }
32412 /* OpenMP 4.0:
32413 linear ( variable-list )
32414 linear ( variable-list : expression )
32416 OpenMP 4.5:
32417 linear ( modifier ( variable-list ) )
32418 linear ( modifier ( variable-list ) : expression ) */
32420 static tree
32423 {
32433 {
32445 else
32447 }
32452 else
32453 {
32462 }
32465 {
32470 {
32481 {
32484 }
32487 }
32492 {
32495 }
32503 }
32506 {
32509 }
32512 }
32514 /* OpenMP 4.0:
32515 safelen ( constant-expression ) */
32517 static tree
32519 location_t location)
32520 {
32541 }
32543 /* OpenMP 4.0:
32544 simdlen ( constant-expression ) */
32546 static tree
32548 location_t location)
32549 {
32570 }
32572 /* OpenMP 4.5:
32573 vec:
32574 identifier [+/- integer]
32575 vec , identifier [+/- integer]
32576 */
32578 static tree
32580 tree list)
32581 {
32585 {
32588 }
32591 {
32598 else
32599 {
32600 t = cp_parser_lookup_name_simple
32605 id_loc);
32606 }
32612 {
32615 }
32619 {
32622 }
32626 {
32629 }
32632 add_to_vector:
32634 {
32638 }
32644 }
32647 {
32653 }
32655 }
32657 /* OpenMP 4.0:
32658 depend ( depend-kind : variable-list )
32660 depend-kind:
32661 in | out | inout
32663 OpenMP 4.5:
32664 depend ( source )
32666 depend ( sink : vec ) */
32668 static tree
32670 {
32678 {
32692 else
32694 }
32695 else
32701 {
32711 }
32718 else
32719 {
32725 }
32728 invalid_kind:
32730 resync_fail:
32735 }
32737 /* OpenMP 4.0:
32738 map ( map-kind : variable-list )
32739 map ( variable-list )
32741 map-kind:
32742 alloc | to | from | tofrom
32744 OpenMP 4.5:
32745 map-kind:
32746 alloc | to | from | tofrom | release | delete
32748 map ( always [,] map-kind: variable-list ) */
32750 static tree
32752 {
32761 {
32766 {
32769 nth++;
32775 {
32780 }
32781 }
32782 }
32786 {
32800 else
32801 {
32807 }
32810 }
32813 {
32817 }
32820 NULL);
32826 }
32828 /* OpenMP 4.0:
32829 device ( expression ) */
32831 static tree
32833 location_t location)
32834 {
32856 }
32858 /* OpenMP 4.0:
32859 dist_schedule ( static )
32860 dist_schedule ( static , expression ) */
32862 static tree
32864 location_t location)
32865 {
32878 {
32889 }
32894 location);
32898 invalid_kind:
32900 resync_fail:
32905 }
32907 /* OpenMP 4.0:
32908 proc_bind ( proc-bind-kind )
32910 proc-bind-kind:
32911 master | close | spread */
32913 static tree
32915 location_t location)
32916 {
32917 tree c;
32924 {
32934 else
32936 }
32937 else
32946 location);
32951 invalid_kind:
32953 resync_fail:
32958 }
32960 /* OpenACC:
32961 async [( int-expr )] */
32963 static tree
32965 {
32972 {
32981 }
32991 }
32993 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32994 is a bitmask in MASK. Return the list of clauses found. */
32996 static tree
33000 {
33005 {
33006 location_t here;
33007 pragma_omp_clause c_kind;
33008 omp_clause_code code;
33019 {
33071 clauses);
33089 OMP_CLAUSE_INDEPENDENT,
33101 clauses);
33107 clauses);
33131 clauses);
33153 clauses);
33165 clauses);
33179 }
33184 {
33185 /* Remove the invalid clause(s) from the list to avoid
33186 confusing the rest of the compiler. */
33189 }
33190 }
33192 saw_error:
33199 }
33201 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33202 is a bitmask in MASK. Return the list of clauses found; the result
33203 of clause default goes in *pdefault. */
33205 static tree
33209 {
33215 {
33216 pragma_omp_clause c_kind;
33227 {
33239 clauses);
33253 clauses);
33273 clauses);
33278 clauses);
33288 clauses);
33322 clauses);
33336 clauses);
33353 OMP_CLAUSE_NOTINBRANCH,
33362 {
33363 clause_not_first:
33367 }
33397 clauses);
33398 else
33408 clauses);
33426 {
33434 }
33477 clauses
33483 clauses
33495 }
33500 {
33501 /* Remove the invalid clause(s) from the list to avoid
33502 confusing the rest of the compiler. */
33505 }
33506 }
33507 saw_error:
33508 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33509 no reason to skip to the end. */
33513 {
33516 else
33518 }
33520 }
33522 /* OpenMP 2.5:
33523 structured-block:
33524 statement
33526 In practice, we're also interested in adding the statement to an
33527 outer node. So it is convenient if we work around the fact that
33528 cp_parser_statement calls add_stmt. */
33530 static unsigned
33532 {
33535 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33536 This preserves the "not within loop or switch" style error messages
33537 for nonsense cases like
33538 void foo() {
33539 #pragma omp single
33540 break;
33541 }
33542 */
33547 }
33549 static void
33551 {
33553 }
33555 static tree
33557 {
33565 }
33567 /* OpenMP 2.5:
33568 # pragma omp atomic new-line
33569 expression-stmt
33571 expression-stmt:
33572 x binop= expr | x++ | ++x | x-- | --x
33573 binop:
33574 +, *, -, /, &, ^, |, <<, >>
33576 where x is an lvalue expression with scalar type.
33578 OpenMP 3.1:
33579 # pragma omp atomic new-line
33580 update-stmt
33582 # pragma omp atomic read new-line
33583 read-stmt
33585 # pragma omp atomic write new-line
33586 write-stmt
33588 # pragma omp atomic update new-line
33589 update-stmt
33591 # pragma omp atomic capture new-line
33592 capture-stmt
33594 # pragma omp atomic capture new-line
33595 capture-block
33597 read-stmt:
33598 v = x
33599 write-stmt:
33600 x = expr
33601 update-stmt:
33602 expression-stmt | x = x binop expr
33603 capture-stmt:
33604 v = expression-stmt
33605 capture-block:
33606 { v = x; update-stmt; } | { update-stmt; v = x; }
33608 OpenMP 4.0:
33609 update-stmt:
33610 expression-stmt | x = x binop expr | x = expr binop x
33611 capture-stmt:
33612 v = update-stmt
33613 capture-block:
33614 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33616 where x and v are lvalue expressions with scalar type. */
33618 static void
33620 {
33628 {
33633 {
33639 }
33640 }
33642 {
33654 else
33658 }
33660 {
33666 {
33671 {
33674 }
33675 }
33676 }
33680 {
33690 else
33695 {
33696 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33697 opcode. */
33702 }
33706 {
33709 }
33710 else
33711 {
33717 }
33720 }
33722 restart:
33726 {
33733 /* FALLTHROUGH */
33743 /* FALLTHROUGH */
33758 /* Undo effects of boolean_increment for post {in,de}crement. */
33760 /* FALLTHRU */
33764 {
33765 /* Undo effects of boolean_increment. */
33767 {
33768 /* This is pre or post increment. */
33773 && !structured_block
33777 }
33778 }
33779 /* FALLTHRU */
33782 {
33817 {
33821 }
33824 {
33830 {
33835 }
33837 {
33849 {
33851 {
33856 }
33857 else
33859 }
33863 }
33866 {
33873 }
33877 }
33881 {
33884 {
33892 }
33894 {
33899 }
33934 }
33945 /* FALLTHROUGH */
33950 }
33957 }
33958 stmt_done:
33960 {
33971 }
33973 {
33976 }
33977 done:
33983 saw_error:
33986 {
33990 {
33994 }
33995 }
33996 }
33999 /* OpenMP 2.5:
34000 # pragma omp barrier new-line */
34002 static void
34004 {
34007 }
34009 /* OpenMP 2.5:
34010 # pragma omp critical [(name)] new-line
34011 structured-block
34013 OpenMP 4.5:
34014 # pragma omp critical [(name) [hint(expression)]] new-line
34015 structured-block */
34017 #define OMP_CRITICAL_CLAUSE_MASK \
34018 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34020 static tree
34022 {
34026 {
34040 OMP_CRITICAL_CLAUSE_MASK,
34042 }
34043 else
34048 }
34050 /* OpenMP 2.5:
34051 # pragma omp flush flush-vars[opt] new-line
34053 flush-vars:
34054 ( variable-list ) */
34056 static void
34058 {
34064 }
34066 /* Helper function, to parse omp for increment expression. */
34068 static tree
34070 {
34075 {
34078 }
34081 {
34090 /* Fall through: OpenMP disallows NE_EXPR. */
34094 }
34096 /* If decl is an iterator, preserve LHS and RHS of the relational
34097 expr until finish_omp_for. */
34108 }
34110 /* Helper function, to parse omp for increment expression. */
34112 static tree
34114 {
34118 cp_id_kind idk;
34122 {
34131 }
34140 {
34145 }
34152 {
34156 }
34169 do
34170 {
34177 {
34179 {
34182 else
34184 tf_warning_or_error);
34185 }
34186 else
34189 }
34190 }
34194 {
34200 }
34201 else
34205 }
34207 /* Parse the initialization statement of either an OpenMP for loop or
34208 a Cilk Plus for loop.
34210 Return true if the resulting construct should have an
34211 OMP_CLAUSE_PRIVATE added to it. */
34213 static tree
34222 {
34228 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34230 init-expr:
34231 var = lb
34232 integer-type var = lb
34233 random-access-iterator-type var = lb
34234 pointer-type var = lb
34235 */
34236 cp_decl_specifier_seq type_specifiers;
34238 /* First, try to parse as an initialized declaration. See
34239 cp_parser_condition, from whence the bulk of this is copied. */
34246 {
34247 /* If parsing a type specifier seq succeeded, then this
34248 MUST be a initialized declaration. */
34253 CP_PARSER_DECLARATOR_NAMED,
34264 else
34265 {
34275 {
34277 CPP_OPEN_PAREN))
34278 {
34282 else
34285 }
34286 else
34287 /* Trigger an error. */
34292 }
34296 {
34304 {
34307 auto_node);
34312 }
34315 asm_specification,
34316 LOOKUP_ONLYCONVERTING);
34319 {
34322 }
34323 else
34324 {
34327 {
34329 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34331 {
34335 {
34339 }
34341 }
34343 {
34348 }
34349 }
34350 }
34352 }
34353 else
34354 {
34355 /* Consume '='. */
34359 non_class:
34362 else
34365 asm_specification,
34366 LOOKUP_ONLYCONVERTING);
34367 }
34371 }
34372 }
34373 else
34374 {
34375 cp_id_kind idk;
34376 /* If parsing a type specifier sequence failed, then
34377 this MUST be a simple expression. */
34386 && decl
34389 {
34400 {
34405 }
34410 }
34412 && decl
34415 {
34416 tree rhs;
34424 rhs,
34425 tf_warning_or_error));
34428 }
34429 else
34430 {
34435 {
34439 }
34440 }
34441 }
34443 }
34445 /* Parse the restricted form of the for statement allowed by OpenMP. */
34447 static tree
34450 {
34454 location_t loc_first;
34465 {
34468 }
34471 {
34474 }
34477 {
34483 }
34485 {
34488 {
34490 "%<linear%> clause may not be specified together "
34493 }
34494 else
34496 }
34509 {
34512 location_t loc;
34516 {
34520 }
34523 {
34527 }
34536 add_private_clause
34543 {
34546 {
34552 }
34553 else
34555 }
34562 {
34567 {
34571 }
34574 {
34575 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34579 {
34582 }
34583 else
34584 {
34587 }
34589 }
34590 else
34591 {
34596 }
34597 }
34600 {
34601 tree c;
34603 {
34612 decl);
34616 decl);
34617 }
34619 {
34624 else
34629 {
34632 /* For linear, signal that we need to fill up
34633 the so far unknown linear step. */
34636 }
34637 }
34638 }
34647 {
34648 /* If decl is an iterator, preserve the operator on decl
34649 until finish_omp_for. */
34651 && ((processing_template_decl
34656 else
34660 }
34672 {
34675 }
34680 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34681 in between the collapsed for loops to be still considered perfectly
34682 nested. Hopefully the final version clarifies this.
34683 For now handle (multiple) {'s and empty statements. */
34686 {
34690 {
34692 bracecount++;
34693 }
34697 else
34698 {
34705 }
34706 }
34709 {
34712 }
34713 }
34718 /* Note that we saved the original contents of this flag when we entered
34719 the structured block, and so we don't need to re-save it here. */
34722 else
34725 /* Note that the grammar doesn't call for a structured block here,
34726 though the loop as a whole is a structured block. */
34733 else
34738 {
34740 {
34742 nbraces--;
34743 }
34746 else
34747 {
34749 {
34752 }
34757 }
34758 }
34761 {
34765 else
34767 }
34771 }
34773 /* Helper function for OpenMP parsing, split clauses and call
34774 finish_omp_clauses on each of the set of clauses afterwards. */
34776 static void
34779 {
34785 }
34787 /* OpenMP 4.0:
34788 #pragma omp simd simd-clause[optseq] new-line
34789 for-loop */
34791 #define OMP_SIMD_CLAUSE_MASK \
34792 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34801 static tree
34805 {
34816 {
34820 OMP_CLAUSE_ORDERED);
34822 {
34824 "%<ordered%> clause with parameter may not be specified "
34827 }
34828 }
34839 }
34841 /* OpenMP 2.5:
34842 #pragma omp for for-clause[optseq] new-line
34843 for-loop
34845 OpenMP 4.0:
34846 #pragma omp for simd for-simd-clause[optseq] new-line
34847 for-loop */
34849 #define OMP_FOR_CLAUSE_MASK \
34850 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34860 static tree
34864 {
34871 /* parallel for{, simd} disallows nowait clause, but for
34872 target {teams distribute ,}parallel for{, simd} it should be accepted. */
34875 /* Composite distribute parallel for{, simd} disallows ordered clause. */
34880 {
34885 {
34909 }
34910 }
34912 {
34915 }
34917 /* Composite distribute parallel for disallows linear clause. */
34924 {
34927 }
34938 }
34940 /* OpenMP 2.5:
34941 # pragma omp master new-line
34942 structured-block */
34944 static tree
34946 {
34950 }
34952 /* OpenMP 2.5:
34953 # pragma omp ordered new-line
34954 structured-block
34956 OpenMP 4.5:
34957 # pragma omp ordered ordered-clauses new-line
34958 structured-block */
34960 #define OMP_ORDERED_CLAUSE_MASK \
34961 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34964 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34965 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34967 static bool
34970 {
34974 {
34979 {
34981 {
34983 "%<depend%> clause may only be used in compound "
34987 }
34988 tree clauses
34990 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34994 }
34995 }
34997 tree clauses
35003 }
35005 /* OpenMP 2.5:
35007 section-scope:
35008 { section-sequence }
35010 section-sequence:
35011 section-directive[opt] structured-block
35012 section-sequence section-directive structured-block */
35014 static tree
35016 {
35028 {
35032 }
35035 {
35043 {
35047 }
35049 {
35052 }
35057 }
35068 }
35070 /* OpenMP 2.5:
35071 # pragma omp sections sections-clause[optseq] newline
35072 sections-scope */
35074 #define OMP_SECTIONS_CLAUSE_MASK \
35075 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35081 static tree
35084 {
35096 {
35099 }
35106 }
35108 /* OpenMP 2.5:
35109 # pragma omp parallel parallel-clause[optseq] new-line
35110 structured-block
35111 # pragma omp parallel for parallel-for-clause[optseq] new-line
35112 structured-block
35113 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35114 structured-block
35116 OpenMP 4.0:
35117 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35118 structured-block */
35120 #define OMP_PARALLEL_CLAUSE_MASK \
35121 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35131 static tree
35135 {
35142 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35148 {
35156 if_p);
35160 if_p);
35163 block);
35168 }
35169 /* When combined with distribute, parallel has to be followed by for.
35170 #pragma omp target parallel is allowed though. */
35174 {
35178 }
35180 {
35183 }
35185 {
35189 {
35199 block);
35202 }
35203 }
35208 {
35211 }
35219 }
35221 /* OpenMP 2.5:
35222 # pragma omp single single-clause[optseq] new-line
35223 structured-block */
35225 #define OMP_SINGLE_CLAUSE_MASK \
35226 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35231 static tree
35233 {
35243 }
35245 /* OpenMP 3.0:
35246 # pragma omp task task-clause[optseq] new-line
35247 structured-block */
35249 #define OMP_TASK_CLAUSE_MASK \
35250 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35251 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35252 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35253 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35254 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35261 static tree
35263 {
35274 }
35276 /* OpenMP 3.0:
35277 # pragma omp taskwait new-line */
35279 static void
35281 {
35284 }
35286 /* OpenMP 3.1:
35287 # pragma omp taskyield new-line */
35289 static void
35291 {
35294 }
35296 /* OpenMP 4.0:
35297 # pragma omp taskgroup new-line
35298 structured-block */
35300 static tree
35302 {
35306 if_p));
35307 }
35310 /* OpenMP 2.5:
35311 # pragma omp threadprivate (variable-list) */
35313 static void
35315 {
35316 tree vars;
35322 }
35324 /* OpenMP 4.0:
35325 # pragma omp cancel cancel-clause[optseq] new-line */
35327 #define OMP_CANCEL_CLAUSE_MASK \
35328 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35329 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35334 static void
35336 {
35340 }
35342 /* OpenMP 4.0:
35343 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35345 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35346 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35351 static void
35354 {
35355 tree clauses;
35359 {
35364 {
35367 }
35368 }
35370 {
35374 }
35377 {
35382 else
35386 }
35389 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35391 pragma_tok);
35393 }
35395 /* OpenMP 4.0:
35396 #pragma omp distribute distribute-clause[optseq] new-line
35397 for-loop */
35399 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35400 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35406 static tree
35410 {
35419 {
35427 else
35430 {
35436 {
35440 else
35443 }
35449 else
35463 }
35464 }
35466 {
35469 }
35474 {
35477 }
35488 }
35490 /* OpenMP 4.0:
35491 # pragma omp teams teams-clause[optseq] new-line
35492 structured-block */
35494 #define OMP_TEAMS_CLAUSE_MASK \
35495 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35498 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35499 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35503 static tree
35507 {
35516 {
35520 {
35545 }
35546 }
35548 {
35551 }
35556 {
35559 }
35568 }
35570 /* OpenMP 4.0:
35571 # pragma omp target data target-data-clause[optseq] new-line
35572 structured-block */
35574 #define OMP_TARGET_DATA_CLAUSE_MASK \
35575 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35576 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35577 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35580 static tree
35582 {
35583 tree clauses
35588 {
35591 {
35608 "%<#pragma omp target data%> with map-type other "
35609 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35613 }
35615 }
35618 {
35621 "%<#pragma omp target data%> must contain at least "
35624 }
35635 }
35637 /* OpenMP 4.5:
35638 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35639 structured-block */
35641 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35642 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35648 static tree
35651 {
35654 {
35659 {
35662 }
35663 }
35665 {
35669 }
35672 {
35678 }
35680 tree clauses
35685 {
35688 {
35701 "%<#pragma omp target enter data%> with map-type other "
35705 }
35707 }
35710 {
35713 "%<#pragma omp target enter data%> must contain at least "
35716 }
35723 }
35725 /* OpenMP 4.5:
35726 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35727 structured-block */
35729 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35730 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35731 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35732 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35733 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35734 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35736 static tree
35739 {
35742 {
35747 {
35750 }
35751 }
35753 {
35757 }
35760 {
35766 }
35768 tree clauses
35773 {
35776 {
35790 "%<#pragma omp target exit data%> with map-type other "
35791 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35795 }
35797 }
35800 {
35803 "%<#pragma omp target exit data%> must contain at least "
35806 }
35813 }
35815 /* OpenMP 4.0:
35816 # pragma omp target update target-update-clause[optseq] new-line */
35818 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35819 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35826 static bool
35829 {
35831 {
35837 }
35839 tree clauses
35844 {
35846 "%<#pragma omp target update%> must contain at least one "
35849 }
35857 }
35859 /* OpenMP 4.0:
35860 # pragma omp target target-clause[optseq] new-line
35861 structured-block */
35863 #define OMP_TARGET_CLAUSE_MASK \
35864 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
35872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
35874 static bool
35877 {
35881 {
35893 {
35901 {
35902 tree stmt;
35904 {
35907 OMP_TARGET_CLAUSE_MASK,
35912 OMP_TARGET_CLAUSE_MASK,
35917 OMP_TARGET_CLAUSE_MASK,
35922 }
35924 }
35929 {
35933 if_p);
35938 if_p);
35943 if_p);
35947 }
35953 {
35954 /* For combined target teams, ensure the num_teams and
35955 thread_limit clause expressions are evaluated on the host,
35956 before entering the target construct. */
35957 tree c;
35963 {
35972 OMP_CLAUSE_FIRSTPRIVATE);
35977 }
35978 }
35988 }
35990 {
35993 }
35995 {
35999 }
36001 {
36005 }
36007 {
36011 }
36013 {
36016 }
36017 }
36019 {
36022 }
36037 check_clauses:
36039 {
36042 {
36056 "%<#pragma omp target%> with map-type other "
36057 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36061 }
36063 }
36065 }
36067 /* OpenACC 2.0:
36068 # pragma acc cache (variable-list) new-line
36069 */
36071 static tree
36073 {
36088 }
36090 /* OpenACC 2.0:
36091 # pragma acc data oacc-data-clause[optseq] new-line
36092 structured-block */
36094 #define OACC_DATA_CLAUSE_MASK \
36095 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36099 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36100 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36103 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36104 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36105 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36107 static tree
36109 {
36122 }
36124 /* OpenACC 2.0:
36125 # pragma acc host_data <clauses> new-line
36126 structured-block */
36128 #define OACC_HOST_DATA_CLAUSE_MASK \
36129 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36131 static tree
36133 {
36146 }
36148 /* OpenACC 2.0:
36149 # pragma acc declare oacc-data-clause[optseq] new-line
36150 */
36152 #define OACC_DECLARE_CLAUSE_MASK \
36153 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36156 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36157 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36158 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36159 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36160 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36161 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36162 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36166 static tree
36168 {
36177 {
36181 }
36184 {
36188 {
36192 }
36195 {
36207 {
36209 "%qD must be a global variable in "
36211 decl);
36214 }
36219 {
36223 }
36225 {
36227 "invalid use of %<extern%> variable %qD "
36231 }
36233 {
36235 "invalid use of %<global%> variable %qD "
36239 }
36241 }
36246 {
36251 }
36254 {
36255 tree id;
36259 else
36265 {
36268 {
36271 {
36275 }
36276 }
36277 }
36278 }
36279 }
36292 }
36294 /* OpenACC 2.0:
36295 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36297 or
36299 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36301 LOC is the location of the #pragma token.
36302 */
36304 #define OACC_ENTER_DATA_CLAUSE_MASK \
36305 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36306 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36307 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36313 #define OACC_EXIT_DATA_CLAUSE_MASK \
36314 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36315 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36316 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36317 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36320 static tree
36323 {
36332 {
36337 }
36344 else
36349 {
36353 }
36361 }
36363 /* OpenACC 2.0:
36364 # pragma acc loop oacc-loop-clause[optseq] new-line
36365 structured-block */
36367 #define OACC_LOOP_CLAUSE_MASK \
36368 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36372 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36373 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36374 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36379 static tree
36382 {
36391 {
36397 }
36406 }
36408 /* OpenACC 2.0:
36409 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36410 structured-block
36412 or
36414 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36415 structured-block
36416 */
36418 #define OACC_KERNELS_CLAUSE_MASK \
36419 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36422 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36431 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36432 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36434 #define OACC_PARALLEL_CLAUSE_MASK \
36435 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36447 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36456 static tree
36459 {
36460 omp_clause_mask mask;
36463 {
36476 }
36479 {
36483 {
36486 tree clauses;
36488 if_p);
36490 }
36491 }
36500 }
36502 /* OpenACC 2.0:
36503 # pragma acc update oacc-update-clause[optseq] new-line
36504 */
36506 #define OACC_UPDATE_CLAUSE_MASK \
36507 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36508 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36512 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36514 static tree
36516 {
36523 {
36525 "%<#pragma acc update%> must contain at least one "
36528 }
36536 }
36538 /* OpenACC 2.0:
36539 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36541 LOC is the location of the #pragma token.
36542 */
36544 #define OACC_WAIT_CLAUSE_MASK \
36545 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36547 static tree
36549 {
36563 }
36565 /* OpenMP 4.0:
36566 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36568 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36569 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36570 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36576 static void
36579 {
36581 cp_omp_declare_simd_data data;
36583 {
36588 /* It is safe to take the address of a local variable; it will only be
36589 used while this scope is live. */
36591 }
36593 /* Store away all pragma tokens. */
36605 {
36609 {
36622 }
36627 "%<#pragma omp declare simd%> not immediately followed by "
36631 }
36632 }
36634 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36635 This function is modelled similar to the late parsing of omp declare
36636 simd. */
36638 static tree
36640 {
36647 {
36649 "used in the same function marked as a Cilk Plus SIMD-enabled "
36655 }
36657 {
36661 }
36666 {
36673 NULL);
36687 }
36693 }
36695 /* Finalize #pragma omp declare simd clauses after direct declarator has
36696 been parsed, and put that into "omp declare simd" attribute. */
36698 static tree
36700 {
36706 {
36710 }
36715 {
36733 }
36737 }
36740 /* OpenMP 4.0:
36741 # pragma omp declare target new-line
36742 declarations and definitions
36743 # pragma omp end declare target new-line
36745 OpenMP 4.5:
36746 # pragma omp declare target ( extended-list ) new-line
36748 # pragma omp declare target declare-target-clauses[seq] new-line */
36750 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36751 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36754 static void
36756 {
36759 clauses
36763 {
36765 clauses);
36768 }
36769 else
36770 {
36774 }
36777 "%<#pragma omp declare target%> with clauses in between "
36778 "%<#pragma omp declare target%> without clauses and "
36781 {
36787 {
36790 }
36791 else
36794 {
36796 "%qD specified both in declare target %<link%> and %<to%>"
36799 }
36801 {
36808 {
36811 {
36815 }
36816 }
36817 }
36818 }
36819 }
36821 static void
36823 {
36826 {
36829 }
36831 {
36835 {
36838 }
36841 else
36842 {
36846 }
36847 }
36848 else
36849 {
36853 }
36857 "%<#pragma omp end declare target%> without corresponding "
36859 else
36861 }
36863 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
36864 expression and optional initializer clause of
36865 #pragma omp declare reduction. We store the expression(s) as
36866 either 3, 6 or 7 special statements inside of the artificial function's
36867 body. The first two statements are DECL_EXPRs for the artificial
36868 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
36869 expression that uses those variables.
36870 If there was any INITIALIZER clause, this is followed by further statements,
36871 the fourth and fifth statements are DECL_EXPRs for the artificial
36872 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
36873 constructor variant (first token after open paren is not omp_priv),
36874 then the sixth statement is a statement with the function call expression
36875 that uses the OMP_PRIV and optionally OMP_ORIG variable.
36876 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
36877 to initialize the OMP_PRIV artificial variable and there is seventh
36878 statement, a DECL_EXPR of the OMP_PRIV statement again. */
36880 static bool
36882 {
36894 tree combiner;
36909 {
36912 }
36915 {
36922 {
36925 }
36941 {
36945 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
36949 == CPP_CLOSE_PAREN
36952 {
36956 }
36961 }
36962 else
36963 {
36979 {
36984 }
36986 tree arg;
36999 }
37010 }
37016 }
37018 /* OpenMP 4.0
37019 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37020 initializer-clause[opt] new-line
37022 initializer-clause:
37023 initializer (omp_priv initializer)
37024 initializer (function-name (argument-list)) */
37026 static void
37029 {
37039 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37046 {
37078 }
37090 /* Types may not be defined in declare reduction type list. */
37093 parser->type_definition_forbidden_message
37099 saved_colon_doesnt_start_class_def_p
37104 {
37108 ;
37129 else
37134 else
37136 }
37138 /* Restore the saved message. */
37141 parser->colon_doesnt_start_class_def_p
37146 {
37147 fail:
37150 }
37156 {
37157 tree fntype
37160 NULL_TREE);
37180 {
37185 }
37187 {
37189 {
37198 }
37205 }
37206 else
37207 {
37210 }
37213 else
37216 {
37219 }
37221 {
37224 else
37229 }
37234 else
37235 {
37244 }
37251 }
37255 done:
37256 /* Free any declarators allocated. */
37258 }
37260 /* OpenMP 4.0
37261 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37262 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37263 initializer-clause[opt] new-line
37264 #pragma omp declare target new-line */
37266 static void
37269 {
37271 {
37276 {
37279 context);
37281 }
37284 {
37287 context);
37289 }
37291 {
37294 }
37296 {
37300 }
37301 }
37305 }
37307 /* OpenMP 4.5:
37308 #pragma omp taskloop taskloop-clause[optseq] new-line
37309 for-loop
37311 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37312 for-loop */
37314 #define OMP_TASKLOOP_CLAUSE_MASK \
37315 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37316 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37317 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37319 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37320 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37327 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37328 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37330 static tree
37334 {
37343 {
37348 {
37372 }
37373 }
37375 {
37378 }
37383 {
37386 }
37392 if_p);
37398 }
37401 /* OpenACC 2.0:
37402 # pragma acc routine oacc-routine-clause[optseq] new-line
37403 function-definition
37405 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37406 */
37408 #define OACC_ROUTINE_CLAUSE_MASK \
37409 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37415 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37416 component, which must resolve to a declared namespace-scope
37417 function. The clauses are either processed directly (for a named
37418 function), or defered until the immediatley following declaration
37419 is parsed. */
37421 static void
37424 {
37426 /* The checking for "another pragma following this one" in the "no optional
37427 '( name )'" case makes sure that we dont re-enter. */
37430 cp_oacc_routine_data data;
37436 /* It is safe to take the address of a local variable; it will only be
37437 used while this scope is live. */
37440 /* Look for optional '( name )'. */
37442 {
37445 /* We parse the name as an id-expression. If it resolves to
37446 anything other than a non-overloaded function at namespace
37447 scope, it's an error. */
37461 {
37465 }
37467 data.clauses
37475 {
37480 }
37482 /* Perhaps we should use the same rule as declarations in different
37483 namespaces? */
37485 {
37490 }
37493 {
37497 }
37501 }
37503 {
37504 /* Store away all pragma tokens. */
37515 /* Emit a helpful diagnostic if there's another pragma following this
37516 one. */
37518 {
37521 /* ..., and then just keep going. */
37523 }
37525 /* We only have to consider the pragma_external case here. */
37530 else
37533 }
37534 }
37536 /* Finalize #pragma acc routine clauses after direct declarator has
37537 been parsed. */
37539 static tree
37541 {
37546 {
37548 "%<#pragma acc routine%> not immediately followed by "
37551 }
37568 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37569 fndecl_seen. */
37572 }
37574 /* Apply any saved OpenACC routine clauses to a just-parsed
37575 declaration. */
37577 static void
37579 {
37581 {
37582 /* Keep going if we're in error reporting mode. */
37588 {
37590 "%<#pragma acc routine%> not immediately followed by"
37594 }
37596 {
37599 }
37602 {
37607 }
37610 {
37618 }
37620 /* Process the routine's dimension clauses. */
37624 /* Add an "omp declare target" attribute. */
37629 /* Don't unset parser->oacc_routine here: we may still need it to
37630 diagnose wrong usage. But, remember that we've used this "#pragma acc
37631 routine". */
37633 }
37634 }
37636 /* Main entry point to OpenMP statement pragmas. */
37638 static void
37640 {
37641 tree stmt;
37646 {
37669 if_p);
37674 if_p);
37691 if_p);
37696 if_p);
37704 if_p);
37713 if_p);
37727 if_p);
37732 if_p);
37736 }
37739 }
37740 \f
37741 /* Transactional Memory parsing routines. */
37743 /* Parse a transaction attribute.
37745 txn-attribute:
37746 attribute
37747 [ [ identifier ] ]
37749 We use this instead of cp_parser_attributes_opt for transactions to avoid
37750 the pedwarn in C++98 mode. */
37752 static tree
37754 {
37769 {
37773 /* For keywords, use the canonical spelling,
37774 not the parsed identifier. */
37778 }
37779 else
37783 error1:
37786 }
37788 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37790 transaction-statement:
37791 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37792 compound-statement
37793 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37794 */
37796 static tree
37798 {
37809 else
37810 {
37814 }
37816 /* Parse a noexcept specification. */
37820 {
37821 /* cancel-and-throw is unimplemented. */
37824 }
37825 else
37828 /* Keep track if we're in the lexical scope of an outer transaction. */
37840 }
37842 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37844 transaction-expression:
37845 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37846 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37847 */
37849 static tree
37851 {
37864 keyword == RID_TRANSACTION_RELAXED
37878 /* Set this early. This might mean that we allow transaction_cancel in
37879 an expression that we find out later actually has to be a constexpr.
37880 However, we expect that cxx_constant_value will be able to deal with
37881 this; also, if the noexcept has no constexpr, then what we parse next
37882 really is a transaction's body. */
37885 /* Parse a noexcept specification. */
37891 {
37898 }
37899 else
37900 {
37901 /* The only expression that is available got parsed for the noexcept
37902 already. noexcept is true then. */
37905 }
37914 }
37916 /* Parse a function-transaction-block.
37918 function-transaction-block:
37919 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37920 function-body
37921 __transaction_atomic txn-attribute[opt] function-try-block
37922 __transaction_relaxed ctor-initializer[opt] function-body
37923 __transaction_relaxed function-try-block
37924 */
37926 static bool
37928 {
37944 else
37945 {
37949 }
37957 else
37958 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37966 }
37968 /* Parse a __transaction_cancel statement.
37970 cancel-statement:
37971 __transaction_cancel txn-attribute[opt] ;
37972 __transaction_cancel txn-attribute[opt] throw-expression ;
37974 ??? Cancel and throw is not yet implemented. */
37976 static tree
37978 {
37984 RT_TRANSACTION_CANCEL);
37991 /* ??? Parse cancel-and-throw here. */
37996 {
38000 }
38002 {
38006 }
38008 {
38011 {
38017 }
38018 }
38020 {
38024 }
38030 }
38031 \f
38032 /* The parser. */
38036 \f
38037 /* Special handling for the first token or line in the file. The first
38038 thing in the file might be #pragma GCC pch_preprocess, which loads a
38039 PCH file, which is a GC collection point. So we need to handle this
38040 first pragma without benefit of an existing lexer structure.
38042 Always returns one token to the caller in *FIRST_TOKEN. This is
38043 either the true first token of the file, or the first token after
38044 the initial pragma. */
38046 static void
38048 {
38057 {
38064 }
38065 else
38068 /* Skip to the end of the pragma. */
38072 /* Now actually load the PCH file. */
38076 /* Read one more token to return to our caller. We have to do this
38077 after reading the PCH file in, since its pointers have to be
38078 live. */
38080 }
38082 /* Parses the grainsize pragma for the _Cilk_for statement.
38083 Syntax:
38084 #pragma cilk grainsize = <VALUE>. */
38086 static void
38088 {
38090 {
38095 {
38098 }
38100 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38103 else
38105 "%<#pragma cilk grainsize%> is not followed by "
38108 }
38110 }
38112 /* Normal parsing of a pragma token. Here we can (and must) use the
38113 regular lexer. */
38115 static bool
38117 {
38120 tree stmt;
38131 {
38139 {
38149 }
38154 {
38164 }
38169 {
38180 }
38185 {
38196 }
38201 {
38212 }
38233 {
38238 }
38246 {
38251 }
38259 {
38263 }
38269 {
38274 }
38282 {
38287 }
38342 "%<#pragma omp section%> may only be used in "
38347 {
38349 {
38353 }
38360 {
38363 }
38366 }
38370 {
38374 }
38382 {
38386 }
38388 /* Ignore the pragma if Cilk Plus is not enabled. */
38390 {
38393 }
38394 else
38395 {
38399 }
38406 bad_stmt:
38409 }
38413 }
38415 /* The interface the pragma parsers have to the lexer. */
38417 enum cpp_ttype
38419 {
38431 else
38432 {
38436 }
38439 }
38441 \f
38442 /* External interface. */
38444 /* Parse one entire translation unit. */
38446 void
38448 {
38461 }
38463 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38464 vectorlength clause:
38465 Syntax:
38466 vectorlength ( constant-expression ) */
38468 static tree
38471 {
38473 tree expr;
38474 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38475 safelen clause. Thus, vectorlength is represented as OMP 4.0
38476 safelen. For SIMD-enabled function it is represented by OMP 4.0
38477 simdlen. */
38480 loc);
38481 else
38483 loc);
38491 /* If expr == error_mark_node, then don't emit any errors nor
38492 create a clause. if any of the above functions returns
38493 error mark node then they would have emitted an error message. */
38495 ;
38503 else
38504 {
38505 tree c;
38507 {
38512 }
38513 else
38514 {
38519 }
38520 }
38525 }
38527 /* Handles the Cilk Plus #pragma simd linear clause.
38528 Syntax:
38529 linear ( simd-linear-variable-list )
38531 simd-linear-variable-list:
38532 simd-linear-variable
38533 simd-linear-variable-list , simd-linear-variable
38535 simd-linear-variable:
38536 id-expression
38537 id-expression : simd-linear-step
38539 simd-linear-step:
38540 conditional-expression */
38542 static tree
38544 {
38550 {
38554 }
38559 {
38562 {
38566 }
38573 {
38577 }
38578 else
38579 {
38583 /* If present, parse the linear step. Otherwise, assume the default
38584 value of 1. */
38586 {
38593 {
38594 /* If an error has occurred, then the whole pragma is
38595 considered ill-formed. Thus, no reason to keep
38596 parsing. */
38599 }
38607 else
38609 "step size must be an integer constant "
38611 }
38613 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38619 }
38624 else
38625 {
38630 }
38631 }
38635 }
38637 /* Returns the name of the next clause. If the clause is not
38638 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38639 token is not consumed. Otherwise, the appropriate enum from the
38640 pragma_simd_clause is returned and the token is consumed. */
38642 static pragma_omp_clause
38644 {
38645 pragma_omp_clause clause_type;
38662 else
38667 }
38669 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38671 static tree
38673 {
38678 {
38679 pragma_omp_clause c_kind;
38686 /* Use the OpenMP 4.0 equivalent function. */
38689 /* Use the OpenMP 4.0 equivalent function. */
38691 clauses);
38693 /* Use the OMP 4.0 equivalent function. */
38695 clauses);
38697 /* Use the OMP 4.0 equivalent function. */
38699 else
38700 {
38704 }
38705 }
38711 else
38713 }
38715 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38717 static void
38719 {
38726 {
38730 }
38739 }
38741 /* Main entry-point for parsing Cilk Plus _Cilk_for
38742 loops. The return value is error_mark_node
38743 when errors happen and CILK_FOR tree on success. */
38745 static tree
38747 {
38762 else
38768 }
38770 /* Create an identifier for a generic parameter type (a synthesized
38771 template parameter implied by `auto' or a concept identifier). */
38774 static tree
38776 {
38780 }
38782 /* Predicate that behaves as is_auto_or_concept but matches the parent
38783 node of the generic type rather than the generic type itself. This
38784 allows for type transformation in add_implicit_template_parms. */
38788 {
38790 }
38792 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38793 (creating a new template parameter list if necessary). Returns the newly
38794 created template type parm. */
38796 static tree
38798 {
38801 /* Before committing to modifying any scope, if we're in an
38802 implicit template scope, and we're trying to synthesize a
38803 constrained parameter, try to find a previous parameter with
38804 the same name. This is the same-type rule for abbreviated
38805 function templates.
38807 NOTE: We can generate implicit parameters when tentatively
38808 parsing a nested name specifier, only to reject that parse
38809 later. However, matching the same template-id as part of a
38810 direct-declarator should generate an identical template
38811 parameter, so this rule will merge them. */
38813 {
38816 {
38818 {
38821 /* Return the TEMPLATE_PARM_INDEX. */
38824 }
38826 }
38827 }
38829 /* We are either continuing a function template that already contains implicit
38830 template parameters, creating a new fully-implicit function template, or
38831 extending an existing explicit function template with implicit template
38832 parameters. */
38840 {
38844 }
38845 else
38846 {
38847 /* Roll back to the existing template parameter scope (in the case of
38848 extending an explicit function template) or introduce a new template
38849 parameter scope ahead of the function parameter scope (or class scope
38850 in the case of out-of-line member definitions). The function scope is
38851 added back after template parameter synthesis below. */
38856 {
38859 }
38861 {
38862 /* If not defining a class, then any class scope is a scope level in
38863 an out-of-line member definition. In this case simply wind back
38864 beyond the first such scope to inject the template parameter list.
38865 Otherwise wind back to the class being defined. The latter can
38866 occur in class member friend declarations such as:
38868 class A {
38869 void foo (auto);
38870 };
38871 class B {
38872 friend void A::foo (auto);
38873 };
38875 The template parameter list synthesized for the friend declaration
38876 must be injected in the scope of 'B'. This can also occur in
38877 erroneous cases such as:
38879 struct A {
38880 struct B {
38881 void foo (auto);
38882 };
38883 void B::foo (auto) {}
38884 };
38886 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38887 but, nevertheless, the template parameter list synthesized for the
38888 declarator should be injected into the scope of 'A' as if the
38889 ill-formed template was specified explicitly. */
38892 {
38895 }
38896 }
38902 {
38903 /* Introduce a new template parameter list for implicit template
38904 parameters. */
38908 parser->implicit_template_scope
38915 }
38916 else
38917 {
38918 /* Synthesize implicit template parameters at the end of the explicit
38919 template parameter list. */
38926 parser->implicit_template_parms
38928 }
38929 }
38931 /* Synthesize a new template parameter and track the current template
38932 parameter chain with implicit_template_parms. */
38936 tree synth_tmpl_parm;
38940 synth_tmpl_parm
38943 synth_tmpl_parm
38945 else
38946 {
38950 }
38952 // Attach the constraint to the parm before processing.
38955 tree new_parm
38957 input_location,
38958 node,
38962 // Chain the new parameter to the list of implicit parameters.
38964 parser->implicit_template_parms
38966 else
38971 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38974 /* If creating a fully implicit function template, start the new implicit
38975 template parameter list with this synthesized type, otherwise grow the
38976 current template parameter list. */
38979 {
38986 }
38987 else
38988 {
38993 }
38995 // If the new parameter was constrained, we need to add that to the
38996 // constraints in the template parameter list.
38998 {
39002 }
39007 }
39009 /* Finish the declaration of a fully implicit function template. Such a
39010 template has no explicit template parameter list so has not been through the
39011 normal template head and tail processing. synthesize_implicit_template_parm
39012 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39013 provided if the declaration is a class member such that its template
39014 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39015 form is returned. Otherwise NULL_TREE is returned. */
39017 static tree
39019 {
39024 {
39028 }
39038 }