| blob | feeafcec6ad21c37b4e86db5b3b4fb07d14792d0 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2017 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
47 \f
48 /* The lexer. */
50 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
51 and c-lex.c) and the C++ parser. */
54 {
56 };
58 /* The various kinds of non integral constant we encounter. */
60 NIC_NONE,
61 /* floating-point literal */
62 NIC_FLOAT,
63 /* %<this%> */
64 NIC_THIS,
65 /* %<__FUNCTION__%> */
66 NIC_FUNC_NAME,
67 /* %<__PRETTY_FUNCTION__%> */
68 NIC_PRETTY_FUNC,
69 /* %<__func__%> */
70 NIC_C99_FUNC,
71 /* "%<va_arg%> */
72 NIC_VA_ARG,
73 /* a cast */
74 NIC_CAST,
75 /* %<typeid%> operator */
76 NIC_TYPEID,
77 /* non-constant compound literals */
78 NIC_NCC,
79 /* a function call */
80 NIC_FUNC_CALL,
81 /* an increment */
82 NIC_INC,
83 /* an decrement */
84 NIC_DEC,
85 /* an array reference */
86 NIC_ARRAY_REF,
87 /* %<->%> */
88 NIC_ARROW,
89 /* %<.%> */
90 NIC_POINT,
91 /* the address of a label */
92 NIC_ADDR_LABEL,
93 /* %<*%> */
94 NIC_STAR,
95 /* %<&%> */
96 NIC_ADDR,
97 /* %<++%> */
98 NIC_PREINCREMENT,
99 /* %<--%> */
100 NIC_PREDECREMENT,
101 /* %<new%> */
102 NIC_NEW,
103 /* %<delete%> */
104 NIC_DEL,
105 /* calls to overloaded operators */
106 NIC_OVERLOADED,
107 /* an assignment */
108 NIC_ASSIGNMENT,
109 /* a comma operator */
110 NIC_COMMA,
111 /* a call to a constructor */
112 NIC_CONSTRUCTOR,
113 /* a transaction expression */
114 NIC_TRANSACTION
115 };
117 /* The various kinds of errors about name-lookup failing. */
119 /* NULL */
120 NLE_NULL,
121 /* is not a type */
122 NLE_TYPE,
123 /* is not a class or namespace */
124 NLE_CXX98,
125 /* is not a class, namespace, or enumeration */
126 NLE_NOT_CXX98
127 };
129 /* The various kinds of required token */
131 RT_NONE,
153 /* The type is CPP_KEYWORD */
182 RT_TRANSACTION_CANCEL /* __transaction_cancel */
183 };
185 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
186 reverting it on destruction. */
188 class type_id_in_expr_sentinel
189 {
199 };
201 /* Prototypes. */
207 static void cp_lexer_destroy
209 static int cp_lexer_saving_tokens
213 static void cp_lexer_get_preprocessor_token
221 static bool cp_lexer_next_token_is_not
223 static bool cp_lexer_next_token_is_keyword
227 static void cp_lexer_purge_token
229 static void cp_lexer_purge_tokens_after
231 static void cp_lexer_save_tokens
233 static void cp_lexer_commit_tokens
235 static void cp_lexer_rollback_tokens
237 static void cp_lexer_print_token
241 static void cp_lexer_start_debugging
243 static void cp_lexer_stop_debugging
249 static void cp_parser_initial_pragma
252 static void cp_parser_cilk_simd
254 static tree cp_parser_cilk_for
256 static bool cp_parser_omp_declare_reduction_exprs
258 static tree cp_parser_cilk_simd_vectorlength
260 static void cp_finalize_oacc_routine
263 /* Manifest constants. */
264 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
265 #define CP_SAVED_TOKEN_STACK 5
267 /* Variables. */
269 /* The stream to which debugging output should be written. */
272 /* Nonzero if we are parsing an unevaluated operand: an operand to
273 sizeof, typeof, or alignof. */
276 /* Dump up to NUM tokens in BUFFER to FILE starting with token
277 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
278 first token in BUFFER. If NUM is 0, dump all the tokens. If
279 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
280 highlighted by surrounding it in [[ ]]. */
282 static void
286 {
303 {
306 }
311 {
318 nprinted++;
328 {
338 }
339 }
342 {
345 }
348 }
351 /* Dump all tokens in BUFFER to stderr. */
353 void
355 {
357 }
359 DEBUG_FUNCTION void
361 {
363 }
365 DEBUG_FUNCTION void
367 {
370 else
372 }
375 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
376 description for T. */
378 static void
380 {
382 {
385 }
386 }
389 /* Dump parser context C to FILE. */
391 static void
393 {
398 }
401 /* Print the stack of parsing contexts to FILE starting with FIRST. */
403 static void
405 {
411 {
414 }
415 }
418 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
420 static void
422 {
425 }
428 /* Print an unparsed function entry UF to FILE. */
430 static void
432 {
435 tree fn;
440 i++)
441 {
447 }
452 {
455 }
461 {
464 }
466 }
469 /* Print the stack of unparsed member functions S to FILE. */
471 static void
474 {
480 {
483 }
484 }
487 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
488 the given PARSER. If FILE is NULL, the output is printed on stderr. */
490 static void
492 {
504 next_token);
505 }
508 /* Dump debugging information for the given PARSER. If FILE is NULL,
509 the output is printed on stderr. */
511 void
513 {
516 expanded_location eloc;
594 }
596 DEBUG_FUNCTION void
598 {
600 }
602 DEBUG_FUNCTION void
604 {
607 else
609 }
611 /* Allocate memory for a new lexer object and return it. */
615 {
620 /* Allocate the memory. */
623 /* Initially we are not debugging. */
628 /* Create the buffer. */
632 }
635 /* Create a new main C++ lexer, the lexer that gets tokens from the
636 preprocessor. */
640 {
642 cp_token token;
644 /* It's possible that parsing the first pragma will load a PCH file,
645 which is a GC collection point. So we have to do that before
646 allocating any memory. */
651 /* Put the first token in the buffer. */
654 /* Get the remaining tokens from the preprocessor. */
656 {
659 }
668 /* Subsequent preprocessor diagnostics should use compiler
669 diagnostic functions to get the compiler source location. */
674 }
676 /* Create a new lexer whose token stream is primed with the tokens in
677 CACHE. When these tokens are exhausted, no new tokens will be read. */
681 {
686 /* We do not own the buffer. */
693 /* Initially we are not debugging. */
698 }
700 /* Frees all resources associated with LEXER. */
702 static void
704 {
708 }
710 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
711 be used. The point of this flag is to help the compiler to fold away calls
712 to cp_lexer_debugging_p within this source file at compile time, when the
713 lexer is not being debugged. */
715 #define LEXER_DEBUGGING_ENABLED_P false
717 /* Returns nonzero if debugging information should be output. */
721 {
726 }
731 {
735 }
739 {
741 }
745 {
747 }
751 {
754 else
756 }
760 {
763 /* Skip past purged tokens. */
765 {
767 tp--;
768 }
771 }
773 /* nonzero if we are presently saving tokens. */
777 {
779 }
781 /* Store the next token from the preprocessor in *TOKEN. Return true
782 if we reach EOF. If LEXER is NULL, assume we are handling an
783 initial #pragma pch_preprocess, and thus want the lexer to return
784 processed strings. */
786 static void
788 {
791 /* Get a new token from the preprocessor. */
792 token->type
799 /* On some systems, some header files are surrounded by an
800 implicit extern "C" block. Set a flag in the token if it
801 comes from such a header. */
806 /* Check to see if this token is a keyword. */
808 {
810 {
811 /* Mark this token as a keyword. */
813 /* Record which keyword. */
815 }
816 else
817 {
821 {
822 /* Warn about the C++0x keyword (but still treat it as
823 an identifier). */
828 /* Clear out the C_RID_CODE so we don't warn about this
829 particular identifier-turned-keyword again. */
831 }
834 }
835 }
837 {
838 /* This only happens in Objective-C++; it must be a keyword. */
841 {
842 /* Replace 'class' with '@class', 'private' with '@private',
843 etc. This prevents confusion with the C++ keyword
844 'class', and makes the tokens consistent with other
845 Objective-C 'AT' keywords. For example '@class' is
846 reported as RID_AT_CLASS which is consistent with
847 '@synchronized', which is reported as
848 RID_AT_SYNCHRONIZED.
849 */
859 }
860 }
861 }
863 /* Update the globals input_location and the input file stack from TOKEN. */
866 {
868 {
870 }
871 }
873 /* Update the globals input_location and the input file stack from LEXER. */
876 {
879 }
881 /* Return a pointer to the next token in the token stream, but do not
882 consume it. */
886 {
888 {
892 }
894 }
896 /* Return true if the next token has the indicated TYPE. */
900 {
902 }
904 /* Return true if the next token does not have the indicated TYPE. */
908 {
910 }
912 /* Return true if the next token is the indicated KEYWORD. */
916 {
918 }
922 {
924 }
928 {
930 }
932 /* Return true if the next token is not the indicated KEYWORD. */
936 {
938 }
940 /* Return true if KEYWORD can start a decl-specifier. */
942 bool
944 {
946 {
947 /* auto specifier: storage-class-specifier in C++,
948 simple-type-specifier in C++0x. */
950 /* Storage classes. */
956 /* Elaborated type specifiers. */
962 /* Simple type specifiers. */
976 /* GNU extensions. */
979 /* C++0x extensions. */
991 }
992 }
994 /* Return true if the next token is a keyword for a decl-specifier. */
996 static bool
998 {
1003 }
1005 /* Returns TRUE iff the token T begins a decltype type. */
1007 static bool
1009 {
1012 }
1014 /* Returns TRUE iff the next token begins a decltype type. */
1016 static bool
1018 {
1021 }
1023 /* Called when processing a token with tree_check_value; perform or defer the
1024 associated checks and return the value. */
1026 static tree
1028 {
1029 /* Perform any access checks that were deferred. */
1034 {
1040 }
1041 /* Return the stored value. */
1043 }
1045 /* Return a pointer to the Nth token in the token stream. If N is 1,
1046 then this is precisely equivalent to cp_lexer_peek_token (except
1047 that it is not inline). One would like to disallow that case, but
1048 there is one case (cp_parser_nth_token_starts_template_id) where
1049 the caller passes a variable for N and it might be 1. */
1053 {
1056 /* N is 1-based, not zero-based. */
1067 {
1070 {
1073 }
1077 }
1080 {
1083 }
1086 }
1088 /* Return the next token, and advance the lexer's next_token pointer
1089 to point to the next non-purged token. */
1093 {
1099 do
1100 {
1103 {
1106 }
1108 }
1113 /* Provide debugging output. */
1115 {
1119 }
1122 }
1124 /* Permanently remove the next token from the token stream, and
1125 advance the next_token pointer to refer to the next non-purged
1126 token. */
1128 static void
1130 {
1139 do
1140 {
1141 tok++;
1143 {
1146 }
1147 }
1150 }
1152 /* Permanently remove all tokens after TOK, up to, but not
1153 including, the token that will be returned next by
1154 cp_lexer_peek_token. */
1156 static void
1158 {
1167 {
1172 }
1173 }
1175 /* Begin saving tokens. All tokens consumed after this point will be
1176 preserved. */
1178 static void
1180 {
1181 /* Provide debugging output. */
1186 }
1188 /* Commit to the portion of the token stream most recently saved. */
1190 static void
1192 {
1193 /* Provide debugging output. */
1198 }
1200 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1201 to the token stream. Stop saving tokens. */
1203 static void
1205 {
1206 /* Provide debugging output. */
1211 }
1213 /* RAII wrapper around the above functions, with sanity checking. Creating
1214 a variable saves tokens, which are committed when the variable is
1215 destroyed unless they are explicitly rolled back by calling the rollback
1216 member function. */
1218 struct saved_token_sentinel
1219 {
1224 {
1227 }
1229 {
1232 }
1234 {
1238 }
1239 };
1241 /* Print a representation of the TOKEN on the STREAM. */
1243 static void
1245 {
1246 /* We don't use cpp_type2name here because the parser defines
1247 a few tokens of its own. */
1249 /* cpplib-defined token types */
1250 #define OP(e, s) #e,
1251 #define TK(e, s) #e,
1252 TTYPE_TABLE
1253 #undef OP
1254 #undef TK
1255 /* C++ parser token types - see "Manifest constants", above. */
1259 };
1261 /* For some tokens, print the associated data. */
1263 {
1265 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1266 For example, `struct' is mapped to an INTEGER_CST. */
1269 /* fall through */
1287 /* If we have a name for the token, print it out. Otherwise, we
1288 simply give the numeric code. */
1291 else
1294 }
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 }
1304 DEBUG_FUNCTION void
1306 {
1309 else
1311 }
1314 /* Start emitting debugging information. */
1316 static void
1318 {
1325 }
1327 /* Stop emitting debugging information. */
1329 static void
1331 {
1338 }
1340 /* Create a new cp_token_cache, representing a range of tokens. */
1344 {
1349 }
1351 /* Diagnose if #pragma omp declare simd isn't followed immediately
1352 by function declaration or definition. */
1356 {
1358 {
1362 }
1363 }
1365 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1366 and put that into "omp declare simd" attribute. */
1370 {
1372 {
1374 {
1377 }
1379 {
1382 }
1383 }
1384 }
1386 /* Diagnose if #pragma acc routine isn't followed immediately by function
1387 declaration or definition. */
1391 {
1393 {
1395 "%<#pragma acc routine%> not immediately followed by "
1398 }
1399 }
1400 \f
1401 /* Decl-specifiers. */
1403 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1405 static void
1407 {
1409 }
1411 /* Declarators. */
1413 /* Nothing other than the parser should be creating declarators;
1414 declarators are a semi-syntactic representation of C++ entities.
1415 Other parts of the front end that need to create entities (like
1416 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1419 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1429 /* An erroneous declarator. */
1432 /* The obstack on which declarators and related data structures are
1433 allocated. */
1436 /* Alloc BYTES from the declarator memory pool. */
1440 {
1442 }
1444 /* Allocate a declarator of the indicated KIND. Clear fields that are
1445 common to all declarators. */
1449 {
1461 }
1463 /* Make a declarator for a generalized identifier. If
1464 QUALIFYING_SCOPE is non-NULL, the identifier is
1465 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1466 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1467 is, if any. */
1471 special_function_kind sfk)
1472 {
1475 /* It is valid to write:
1477 class C { void f(); };
1478 typedef C D;
1479 void D::f();
1481 The standard is not clear about whether `typedef const C D' is
1482 legal; as of 2002-09-15 the committee is considering that
1483 question. EDG 3.0 allows that syntax. Therefore, we do as
1484 well. */
1498 }
1500 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1501 of modifiers such as const or volatile to apply to the pointer
1502 type, represented as identifiers. ATTRIBUTES represent the attributes that
1503 appertain to the pointer or reference. */
1505 cp_declarator *
1507 tree attributes)
1508 {
1516 {
1520 }
1521 else
1527 }
1529 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1530 represent the attributes that appertain to the pointer or
1531 reference. */
1533 cp_declarator *
1536 {
1544 {
1548 }
1549 else
1555 }
1557 /* Like make_pointer_declarator -- but for a pointer to a non-static
1558 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1559 appertain to the pointer or reference. */
1561 cp_declarator *
1564 tree attributes)
1565 {
1574 {
1577 }
1578 else
1584 }
1586 /* Make a declarator for the function given by TARGET, with the
1587 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1588 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1589 indicates what exceptions can be thrown. */
1591 cp_declarator *
1593 tree parms,
1594 cp_cv_quals cv_qualifiers,
1595 cp_virt_specifiers virt_specifiers,
1596 cp_ref_qualifier ref_qualifier,
1597 tree tx_qualifier,
1598 tree exception_specification,
1599 tree late_return_type,
1600 tree requires_clause)
1601 {
1615 {
1619 }
1620 else
1624 }
1626 /* Make a declarator for an array of BOUNDS elements, each of which is
1627 defined by ELEMENT. */
1629 cp_declarator *
1631 {
1638 {
1642 }
1643 else
1647 }
1649 /* Determine whether the declarator we've seen so far can be a
1650 parameter pack, when followed by an ellipsis. */
1651 static bool
1653 {
1655 /* We already saw an ellipsis. */
1658 /* Search for a declarator name, or any other declarator that goes
1659 after the point where the ellipsis could appear in a parameter
1660 pack. If we find any of these, then this declarator can not be
1661 made into a parameter pack. */
1664 {
1666 {
1679 }
1680 }
1683 }
1687 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1688 DECLARATOR and DEFAULT_ARGUMENT. */
1690 cp_parameter_declarator *
1693 tree default_argument,
1695 {
1703 else
1710 }
1712 /* Returns true iff DECLARATOR is a declaration for a function. */
1714 static bool
1716 {
1718 {
1727 }
1729 }
1731 /* The parser. */
1733 /* Overview
1734 --------
1736 A cp_parser parses the token stream as specified by the C++
1737 grammar. Its job is purely parsing, not semantic analysis. For
1738 example, the parser breaks the token stream into declarators,
1739 expressions, statements, and other similar syntactic constructs.
1740 It does not check that the types of the expressions on either side
1741 of an assignment-statement are compatible, or that a function is
1742 not declared with a parameter of type `void'.
1744 The parser invokes routines elsewhere in the compiler to perform
1745 semantic analysis and to build up the abstract syntax tree for the
1746 code processed.
1748 The parser (and the template instantiation code, which is, in a
1749 way, a close relative of parsing) are the only parts of the
1750 compiler that should be calling push_scope and pop_scope, or
1751 related functions. The parser (and template instantiation code)
1752 keeps track of what scope is presently active; everything else
1753 should simply honor that. (The code that generates static
1754 initializers may also need to set the scope, in order to check
1755 access control correctly when emitting the initializers.)
1757 Methodology
1758 -----------
1760 The parser is of the standard recursive-descent variety. Upcoming
1761 tokens in the token stream are examined in order to determine which
1762 production to use when parsing a non-terminal. Some C++ constructs
1763 require arbitrary look ahead to disambiguate. For example, it is
1764 impossible, in the general case, to tell whether a statement is an
1765 expression or declaration without scanning the entire statement.
1766 Therefore, the parser is capable of "parsing tentatively." When the
1767 parser is not sure what construct comes next, it enters this mode.
1768 Then, while we attempt to parse the construct, the parser queues up
1769 error messages, rather than issuing them immediately, and saves the
1770 tokens it consumes. If the construct is parsed successfully, the
1771 parser "commits", i.e., it issues any queued error messages and
1772 the tokens that were being preserved are permanently discarded.
1773 If, however, the construct is not parsed successfully, the parser
1774 rolls back its state completely so that it can resume parsing using
1775 a different alternative.
1777 Future Improvements
1778 -------------------
1780 The performance of the parser could probably be improved substantially.
1781 We could often eliminate the need to parse tentatively by looking ahead
1782 a little bit. In some places, this approach might not entirely eliminate
1783 the need to parse tentatively, but it might still speed up the average
1784 case. */
1786 /* Flags that are passed to some parsing functions. These values can
1787 be bitwise-ored together. */
1789 enum
1790 {
1791 /* No flags. */
1793 /* The construct is optional. If it is not present, then no error
1794 should be issued. */
1796 /* When parsing a type-specifier, treat user-defined type-names
1797 as non-type identifiers. */
1799 /* When parsing a type-specifier, do not try to parse a class-specifier
1800 or enum-specifier. */
1802 /* When parsing a decl-specifier-seq, only allow type-specifier or
1803 constexpr. */
1805 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1807 };
1809 /* This type is used for parameters and variables which hold
1810 combinations of the above flags. */
1813 /* The different kinds of declarators we want to parse. */
1815 enum cp_parser_declarator_kind
1816 {
1817 /* We want an abstract declarator. */
1818 CP_PARSER_DECLARATOR_ABSTRACT,
1819 /* We want a named declarator. */
1820 CP_PARSER_DECLARATOR_NAMED,
1821 /* We don't mind, but the name must be an unqualified-id. */
1822 CP_PARSER_DECLARATOR_EITHER
1823 };
1825 /* The precedence values used to parse binary expressions. The minimum value
1826 of PREC must be 1, because zero is reserved to quickly discriminate
1827 binary operators from other tokens. */
1829 enum cp_parser_prec
1830 {
1831 PREC_NOT_OPERATOR,
1832 PREC_LOGICAL_OR_EXPRESSION,
1833 PREC_LOGICAL_AND_EXPRESSION,
1834 PREC_INCLUSIVE_OR_EXPRESSION,
1835 PREC_EXCLUSIVE_OR_EXPRESSION,
1836 PREC_AND_EXPRESSION,
1837 PREC_EQUALITY_EXPRESSION,
1838 PREC_RELATIONAL_EXPRESSION,
1839 PREC_SHIFT_EXPRESSION,
1840 PREC_ADDITIVE_EXPRESSION,
1841 PREC_MULTIPLICATIVE_EXPRESSION,
1842 PREC_PM_EXPRESSION,
1843 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1844 };
1846 /* A mapping from a token type to a corresponding tree node type, with a
1847 precedence value. */
1849 struct cp_parser_binary_operations_map_node
1850 {
1851 /* The token type. */
1853 /* The corresponding tree code. */
1855 /* The precedence of this operator. */
1857 };
1859 struct cp_parser_expression_stack_entry
1860 {
1861 /* Left hand side of the binary operation we are currently
1862 parsing. */
1863 cp_expr lhs;
1864 /* Original tree code for left hand side, if it was a binary
1865 expression itself (used for -Wparentheses). */
1867 /* Tree code for the binary operation we are parsing. */
1869 /* Precedence of the binary operation we are parsing. */
1871 /* Location of the binary operation we are parsing. */
1872 location_t loc;
1873 };
1875 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1876 entries because precedence levels on the stack are monotonically
1877 increasing. */
1881 /* Prototypes. */
1883 /* Constructors and destructors. */
1888 /* Class variables. */
1892 /* The operator-precedence table used by cp_parser_binary_expression.
1893 Transformed into an associative array (binops_by_token) by
1894 cp_parser_new. */
1927 };
1929 /* The same as binops, but initialized by cp_parser_new so that
1930 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1931 for speed. */
1934 /* Constructors and destructors. */
1936 /* Construct a new context. The context below this one on the stack
1937 is given by NEXT. */
1941 {
1944 /* Allocate the storage. */
1946 {
1947 /* Pull the first entry from the free list. */
1951 }
1952 else
1955 /* No errors have occurred yet in this context. */
1957 /* If this is not the bottommost context, copy information that we
1958 need from the previous context. */
1960 {
1961 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1962 expression, then we are parsing one in this context, too. */
1964 /* Thread the stack. */
1966 }
1969 }
1971 /* Managing the unparsed function queues. */
1973 #define unparsed_funs_with_default_args \
1974 parser->unparsed_queues->last ().funs_with_default_args
1975 #define unparsed_funs_with_definitions \
1976 parser->unparsed_queues->last ().funs_with_definitions
1977 #define unparsed_nsdmis \
1978 parser->unparsed_queues->last ().nsdmis
1979 #define unparsed_classes \
1980 parser->unparsed_queues->last ().classes
1982 static void
1984 {
1987 }
1989 static void
1991 {
1994 }
1996 /* Prototypes. */
1998 /* Constructors and destructors. */
2003 /* Routines to parse various constructs.
2005 Those that return `tree' will return the error_mark_node (rather
2006 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2007 Sometimes, they will return an ordinary node if error-recovery was
2008 attempted, even though a parse error occurred. So, to check
2009 whether or not a parse error occurred, you should always use
2010 cp_parser_error_occurred. If the construct is optional (indicated
2011 either by an `_opt' in the name of the function that does the
2012 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2013 the construct is not present. */
2015 /* Lexical conventions [gram.lex] */
2017 static cp_expr cp_parser_identifier
2019 static cp_expr cp_parser_string_literal
2021 static cp_expr cp_parser_userdef_char_literal
2023 static tree cp_parser_userdef_string_literal
2025 static cp_expr cp_parser_userdef_numeric_literal
2028 /* Basic concepts [gram.basic] */
2030 static bool cp_parser_translation_unit
2033 /* Expressions [gram.expr] */
2035 static cp_expr cp_parser_primary_expression
2037 static cp_expr cp_parser_id_expression
2039 static cp_expr cp_parser_unqualified_id
2041 static tree cp_parser_nested_name_specifier_opt
2043 static tree cp_parser_nested_name_specifier
2045 static tree cp_parser_qualifying_entity
2047 static cp_expr cp_parser_postfix_expression
2049 static tree cp_parser_postfix_open_square_expression
2051 static tree cp_parser_postfix_dot_deref_expression
2055 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2057 static void cp_parser_pseudo_destructor_name
2059 static cp_expr cp_parser_unary_expression
2061 static enum tree_code cp_parser_unary_operator
2063 static tree cp_parser_new_expression
2067 static tree cp_parser_new_type_id
2075 static tree cp_parser_delete_expression
2077 static cp_expr cp_parser_cast_expression
2079 static cp_expr cp_parser_binary_expression
2081 static tree cp_parser_question_colon_clause
2083 static cp_expr cp_parser_assignment_expression
2085 static enum tree_code cp_parser_assignment_operator_opt
2087 static cp_expr cp_parser_expression
2089 static cp_expr cp_parser_constant_expression
2091 static cp_expr cp_parser_builtin_offsetof
2093 static cp_expr cp_parser_lambda_expression
2095 static void cp_parser_lambda_introducer
2097 static bool cp_parser_lambda_declarator_opt
2099 static void cp_parser_lambda_body
2102 /* Statements [gram.stmt.stmt] */
2104 static void cp_parser_statement
2106 static void cp_parser_label_for_labeled_statement
2108 static tree cp_parser_expression_statement
2110 static tree cp_parser_compound_statement
2112 static void cp_parser_statement_seq_opt
2114 static tree cp_parser_selection_statement
2116 static tree cp_parser_condition
2118 static tree cp_parser_iteration_statement
2120 static bool cp_parser_init_statement
2122 static tree cp_parser_for
2124 static tree cp_parser_c_for
2126 static tree cp_parser_range_for
2128 static void do_range_for_auto_deduction
2130 static tree cp_parser_perform_range_for_lookup
2132 static tree cp_parser_range_for_member_function
2134 static tree cp_parser_jump_statement
2136 static void cp_parser_declaration_statement
2139 static tree cp_parser_implicitly_scoped_statement
2141 static void cp_parser_already_scoped_statement
2144 /* Declarations [gram.dcl.dcl] */
2146 static void cp_parser_declaration_seq_opt
2148 static void cp_parser_declaration
2150 static void cp_parser_block_declaration
2152 static void cp_parser_simple_declaration
2154 static void cp_parser_decl_specifier_seq
2156 static tree cp_parser_storage_class_specifier_opt
2158 static tree cp_parser_function_specifier_opt
2160 static tree cp_parser_type_specifier
2163 static tree cp_parser_simple_type_specifier
2165 static tree cp_parser_type_name
2167 static tree cp_parser_type_name
2169 static tree cp_parser_nonclass_name
2171 static tree cp_parser_elaborated_type_specifier
2173 static tree cp_parser_enum_specifier
2175 static void cp_parser_enumerator_list
2177 static void cp_parser_enumerator_definition
2179 static tree cp_parser_namespace_name
2181 static void cp_parser_namespace_definition
2183 static void cp_parser_namespace_body
2185 static tree cp_parser_qualified_namespace_specifier
2187 static void cp_parser_namespace_alias_definition
2189 static bool cp_parser_using_declaration
2191 static void cp_parser_using_directive
2193 static tree cp_parser_alias_declaration
2195 static void cp_parser_asm_definition
2197 static void cp_parser_linkage_specification
2199 static void cp_parser_static_assert
2201 static tree cp_parser_decltype
2203 static tree cp_parser_decomposition_declaration
2206 /* Declarators [gram.dcl.decl] */
2208 static tree cp_parser_init_declarator
2215 static enum tree_code cp_parser_ptr_operator
2217 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2219 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2221 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2223 static tree cp_parser_tx_qualifier_opt
2225 static tree cp_parser_late_return_type_opt
2227 static tree cp_parser_declarator_id
2229 static tree cp_parser_type_id
2231 static tree cp_parser_template_type_arg
2234 static tree cp_parser_type_id_1
2236 static void cp_parser_type_specifier_seq
2238 static tree cp_parser_parameter_declaration_clause
2240 static tree cp_parser_parameter_declaration_list
2244 static tree cp_parser_default_argument
2246 static void cp_parser_function_body
2248 static tree cp_parser_initializer
2250 static cp_expr cp_parser_initializer_clause
2252 static cp_expr cp_parser_braced_list
2257 static bool cp_parser_ctor_initializer_opt_and_function_body
2260 static tree cp_parser_late_parsing_omp_declare_simd
2263 static tree cp_parser_late_parsing_cilk_simd_fn_info
2266 static tree cp_parser_late_parsing_oacc_routine
2269 static tree synthesize_implicit_template_parm
2271 static tree finish_fully_implicit_template
2274 /* Classes [gram.class] */
2276 static tree cp_parser_class_name
2278 static tree cp_parser_class_specifier
2280 static tree cp_parser_class_head
2282 static enum tag_types cp_parser_class_key
2284 static void cp_parser_type_parameter_key
2286 static void cp_parser_member_specification_opt
2288 static void cp_parser_member_declaration
2290 static tree cp_parser_pure_specifier
2292 static tree cp_parser_constant_initializer
2295 /* Derived classes [gram.class.derived] */
2297 static tree cp_parser_base_clause
2299 static tree cp_parser_base_specifier
2302 /* Special member functions [gram.special] */
2304 static tree cp_parser_conversion_function_id
2306 static tree cp_parser_conversion_type_id
2310 static bool cp_parser_ctor_initializer_opt
2312 static void cp_parser_mem_initializer_list
2314 static tree cp_parser_mem_initializer
2316 static tree cp_parser_mem_initializer_id
2319 /* Overloading [gram.over] */
2321 static cp_expr cp_parser_operator_function_id
2323 static cp_expr cp_parser_operator
2326 /* Templates [gram.temp] */
2328 static void cp_parser_template_declaration
2330 static tree cp_parser_template_parameter_list
2332 static tree cp_parser_template_parameter
2334 static tree cp_parser_type_parameter
2336 static tree cp_parser_template_id
2338 static tree cp_parser_template_name
2340 static tree cp_parser_template_argument_list
2342 static tree cp_parser_template_argument
2344 static void cp_parser_explicit_instantiation
2346 static void cp_parser_explicit_specialization
2349 /* Exception handling [gram.exception] */
2351 static tree cp_parser_try_block
2353 static bool cp_parser_function_try_block
2355 static void cp_parser_handler_seq
2357 static void cp_parser_handler
2359 static tree cp_parser_exception_declaration
2361 static tree cp_parser_throw_expression
2363 static tree cp_parser_exception_specification_opt
2365 static tree cp_parser_type_id_list
2368 /* GNU Extensions */
2370 static tree cp_parser_asm_specification_opt
2372 static tree cp_parser_asm_operand_list
2374 static tree cp_parser_asm_clobber_list
2376 static tree cp_parser_asm_label_list
2378 static bool cp_next_tokens_can_be_attribute_p
2380 static bool cp_next_tokens_can_be_gnu_attribute_p
2382 static bool cp_next_tokens_can_be_std_attribute_p
2384 static bool cp_nth_tokens_can_be_std_attribute_p
2386 static bool cp_nth_tokens_can_be_gnu_attribute_p
2388 static bool cp_nth_tokens_can_be_attribute_p
2390 static tree cp_parser_attributes_opt
2392 static tree cp_parser_gnu_attributes_opt
2394 static tree cp_parser_gnu_attribute_list
2396 static tree cp_parser_std_attribute
2398 static tree cp_parser_std_attribute_spec
2400 static tree cp_parser_std_attribute_spec_seq
2402 static bool cp_parser_extension_opt
2404 static void cp_parser_label_declaration
2407 /* Concept Extensions */
2409 static tree cp_parser_requires_clause
2411 static tree cp_parser_requires_clause_opt
2413 static tree cp_parser_requires_expression
2415 static tree cp_parser_requirement_parameter_list
2417 static tree cp_parser_requirement_body
2419 static tree cp_parser_requirement_list
2421 static tree cp_parser_requirement
2423 static tree cp_parser_simple_requirement
2425 static tree cp_parser_compound_requirement
2427 static tree cp_parser_type_requirement
2429 static tree cp_parser_nested_requirement
2432 /* Transactional Memory Extensions */
2434 static tree cp_parser_transaction
2436 static tree cp_parser_transaction_expression
2438 static bool cp_parser_function_transaction
2440 static tree cp_parser_transaction_cancel
2444 pragma_external,
2445 pragma_member,
2446 pragma_objc_icode,
2447 pragma_stmt,
2448 pragma_compound
2449 };
2450 static bool cp_parser_pragma
2453 /* Objective-C++ Productions */
2455 static tree cp_parser_objc_message_receiver
2457 static tree cp_parser_objc_message_args
2459 static tree cp_parser_objc_message_expression
2461 static cp_expr cp_parser_objc_encode_expression
2463 static tree cp_parser_objc_defs_expression
2465 static tree cp_parser_objc_protocol_expression
2467 static tree cp_parser_objc_selector_expression
2469 static cp_expr cp_parser_objc_expression
2471 static bool cp_parser_objc_selector_p
2473 static tree cp_parser_objc_selector
2475 static tree cp_parser_objc_protocol_refs_opt
2477 static void cp_parser_objc_declaration
2479 static tree cp_parser_objc_statement
2481 static bool cp_parser_objc_valid_prefix_attributes
2483 static void cp_parser_objc_at_property_declaration
2485 static void cp_parser_objc_at_synthesize_declaration
2487 static void cp_parser_objc_at_dynamic_declaration
2489 static tree cp_parser_objc_struct_declaration
2492 /* Utility Routines */
2494 static cp_expr cp_parser_lookup_name
2496 static tree cp_parser_lookup_name_simple
2498 static tree cp_parser_maybe_treat_template_as_class
2500 static bool cp_parser_check_declarator_template_parameters
2502 static bool cp_parser_check_template_parameters
2504 static cp_expr cp_parser_simple_cast_expression
2506 static tree cp_parser_global_scope_opt
2508 static bool cp_parser_constructor_declarator_p
2510 static tree cp_parser_function_definition_from_specifiers_and_declarator
2512 static tree cp_parser_function_definition_after_declarator
2514 static bool cp_parser_template_declaration_after_export
2516 static void cp_parser_perform_template_parameter_access_checks
2518 static tree cp_parser_single_declaration
2520 static cp_expr cp_parser_functional_cast
2522 static tree cp_parser_save_member_function_body
2524 static tree cp_parser_save_nsdmi
2526 static tree cp_parser_enclosed_template_argument_list
2528 static void cp_parser_save_default_args
2530 static void cp_parser_late_parsing_for_member
2532 static tree cp_parser_late_parse_one_default_arg
2534 static void cp_parser_late_parsing_nsdmi
2536 static void cp_parser_late_parsing_default_args
2538 static tree cp_parser_sizeof_operand
2540 static tree cp_parser_trait_expr
2542 static bool cp_parser_declares_only_class_p
2544 static void cp_parser_set_storage_class
2546 static void cp_parser_set_decl_spec_type
2548 static void set_and_check_decl_spec_loc
2551 static bool cp_parser_friend_p
2553 static void cp_parser_required_error
2559 static bool cp_parser_token_starts_function_definition_p
2561 static bool cp_parser_next_token_starts_class_definition_p
2563 static bool cp_parser_next_token_ends_template_argument_p
2565 static bool cp_parser_nth_token_starts_template_argument_list_p
2567 static enum tag_types cp_parser_token_is_class_key
2569 static enum tag_types cp_parser_token_is_type_parameter_key
2571 static void cp_parser_check_class_key
2573 static void cp_parser_check_access_in_redeclaration
2575 static bool cp_parser_optional_template_keyword
2577 static void cp_parser_pre_parsed_nested_name_specifier
2579 static bool cp_parser_cache_group
2581 static tree cp_parser_cache_defarg
2583 static void cp_parser_parse_tentatively
2585 static void cp_parser_commit_to_tentative_parse
2587 static void cp_parser_commit_to_topmost_tentative_parse
2589 static void cp_parser_abort_tentative_parse
2591 static bool cp_parser_parse_definitely
2595 static bool cp_parser_uncommitted_to_tentative_parse_p
2597 static void cp_parser_error
2599 static void cp_parser_name_lookup_error
2601 static bool cp_parser_simulate_error
2603 static bool cp_parser_check_type_definition
2605 static void cp_parser_check_for_definition_in_return_type
2607 static void cp_parser_check_for_invalid_template_id
2609 static bool cp_parser_non_integral_constant_expression
2611 static void cp_parser_diagnose_invalid_type_name
2613 static bool cp_parser_parse_and_diagnose_invalid_type_name
2615 static int cp_parser_skip_to_closing_parenthesis
2617 static void cp_parser_skip_to_end_of_statement
2619 static void cp_parser_consume_semicolon_at_end_of_statement
2621 static void cp_parser_skip_to_end_of_block_or_statement
2623 static bool cp_parser_skip_to_closing_brace
2625 static void cp_parser_skip_to_end_of_template_parameter_list
2627 static void cp_parser_skip_to_pragma_eol
2629 static bool cp_parser_error_occurred
2631 static bool cp_parser_allow_gnu_extensions_p
2633 static bool cp_parser_is_pure_string_literal
2635 static bool cp_parser_is_string_literal
2637 static bool cp_parser_is_keyword
2639 static tree cp_parser_make_typename_type
2643 static bool cp_parser_compound_literal_p
2645 static bool cp_parser_array_designator_p
2647 static bool cp_parser_init_statement_p
2649 static bool cp_parser_skip_to_closing_square_bracket
2652 /* Concept-related syntactic transformations */
2657 // -------------------------------------------------------------------------- //
2658 // Unevaluated Operand Guard
2659 //
2660 // Implementation of an RAII helper for unevaluated operand parsing.
2662 {
2665 }
2668 {
2671 }
2673 // -------------------------------------------------------------------------- //
2674 // Tentative Parsing
2676 /* Returns nonzero if we are parsing tentatively. */
2680 {
2682 }
2684 /* Returns nonzero if TOKEN is a string literal. */
2686 static bool
2688 {
2694 }
2696 /* Returns nonzero if TOKEN is a string literal
2697 of a user-defined string literal. */
2699 static bool
2701 {
2708 }
2710 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2712 static bool
2714 {
2716 }
2718 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2719 PRAGMA_NONE. */
2721 static enum pragma_kind
2723 {
2726 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2728 }
2730 /* Helper function for cp_parser_error.
2731 Having peeked a token of kind TOK1_KIND that might signify
2732 a conflict marker, peek successor tokens to determine
2733 if we actually do have a conflict marker.
2734 Specifically, we consider a run of 7 '<', '=' or '>' characters
2735 at the start of a line as a conflict marker.
2736 These come through the lexer as three pairs and a single,
2737 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2738 If it returns true, *OUT_LOC is written to with the location/range
2739 of the marker. */
2741 static bool
2744 {
2755 /* It must be at the start of the line. */
2760 /* We have a conflict marker. Construct a location of the form:
2761 <<<<<<<
2762 ^~~~~~~
2763 with start == caret, finishing at the end of the marker. */
2768 }
2770 /* If not parsing tentatively, issue a diagnostic of the form
2771 FILE:LINE: MESSAGE before TOKEN
2772 where TOKEN is the next token in the input stream. MESSAGE
2773 (specified by the caller) is usually of the form "expected
2774 OTHER-TOKEN". */
2776 static void
2778 {
2780 {
2782 /* This diagnostic makes more sense if it is tagged to the line
2783 of the token we just peeked at. */
2787 {
2792 }
2794 /* If this is actually a conflict marker, report it as such. */
2798 {
2799 location_t loc;
2801 {
2804 }
2805 }
2808 /* Because c_parser_error does not understand
2809 CPP_KEYWORD, keywords are treated like
2810 identifiers. */
2813 }
2814 }
2816 /* Issue an error about name-lookup failing. NAME is the
2817 IDENTIFIER_NODE DECL is the result of
2818 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2819 the thing that we hoped to find. */
2821 static void
2823 tree name,
2824 tree decl,
2825 name_lookup_error desired,
2826 location_t location)
2827 {
2828 /* If name lookup completely failed, tell the user that NAME was not
2829 declared. */
2831 {
2844 else
2846 }
2848 {
2850 {
2867 }
2868 }
2870 {
2872 {
2882 name);
2886 }
2887 }
2888 else
2889 {
2891 {
2904 }
2905 }
2906 }
2908 /* If we are parsing tentatively, remember that an error has occurred
2909 during this tentative parse. Returns true if the error was
2910 simulated; false if a message should be issued by the caller. */
2912 static bool
2914 {
2916 {
2919 }
2921 }
2923 /* This function is called when a type is defined. If type
2924 definitions are forbidden at this point, an error message is
2925 issued. */
2927 static bool
2929 {
2930 /* If types are forbidden here, issue a message. */
2932 {
2933 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2934 in the message need to be interpreted. */
2937 }
2939 }
2941 /* This function is called when the DECLARATOR is processed. The TYPE
2942 was a type defined in the decl-specifiers. If it is invalid to
2943 define a type in the decl-specifiers for DECLARATOR, an error is
2944 issued. TYPE_LOCATION is the location of TYPE and is used
2945 for error reporting. */
2947 static void
2950 {
2951 /* [dcl.fct] forbids type definitions in return types.
2952 Unfortunately, it's not easy to know whether or not we are
2953 processing a return type until after the fact. */
2961 {
2966 type);
2967 }
2968 }
2970 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2971 "<" in any valid C++ program. If the next token is indeed "<",
2972 issue a message warning the user about what appears to be an
2973 invalid attempt to form a template-id. LOCATION is the location
2974 of the type-specifier (TYPE) */
2976 static void
2978 tree type,
2980 location_t location)
2981 {
2985 {
2989 {
2992 else
2994 }
2995 else
2997 /* Remember the location of the invalid "<". */
3000 /* Consume the "<". */
3002 /* Parse the template arguments. */
3004 /* Permanently remove the invalid template arguments so that
3005 this error message is not issued again. */
3008 }
3009 }
3011 /* If parsing an integral constant-expression, issue an error message
3012 about the fact that THING appeared and return true. Otherwise,
3013 return false. In either case, set
3014 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3016 static bool
3018 non_integral_constant thing)
3019 {
3022 {
3024 {
3027 {
3030 "ISO C++ forbids using a floating-point literal "
3035 "enumeration type cannot appear in a "
3126 }
3130 }
3131 }
3133 }
3135 /* Emit a diagnostic for an invalid type name. This function commits
3136 to the current active tentative parse, if any. (Otherwise, the
3137 problematic construct might be encountered again later, resulting
3138 in duplicate error messages.) LOCATION is the location of ID. */
3140 static void
3142 location_t location)
3143 {
3146 /* Try to lookup the identifier. */
3153 /* If the lookup was ambiguous, an error will already have
3154 been issued. */
3156 /* If the lookup found a template-name, it means that the user forgot
3157 to specify an argument list. Emit a useful error message. */
3159 {
3162 decl);
3167 }
3171 /* Something like 'unsigned A a;' */
3174 {
3175 /* Issue an error message. */
3180 {
3186 }
3187 else
3189 /* If we're in a template class, it's possible that the user was
3190 referring to a type from a base class. For example:
3192 template <typename T> struct A { typedef T X; };
3193 template <typename T> struct B : public A<T> { X x; };
3195 The user should have said "typename A<T>::X". */
3211 {
3212 tree b;
3215 b;
3217 {
3221 {
3222 tree field;
3223 /* Go from a particular instantiation of the
3224 template (which will have an empty TYPE_FIELDs),
3225 to the main version. */
3228 field;
3232 {
3237 }
3240 }
3241 }
3242 }
3243 }
3244 /* Here we diagnose qualified-ids where the scope is actually correct,
3245 but the identifier does not resolve to a valid type name. */
3247 {
3249 {
3254 else
3260 }
3263 {
3264 /* A<T>::A<T>() */
3270 }
3277 {
3285 else
3291 }
3292 else
3294 }
3295 }
3297 /* Check for a common situation where a type-name should be present,
3298 but is not, and issue a sensible error message. Returns true if an
3299 invalid type-name was detected.
3301 The situation handled by this function are variable declarations of the
3302 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3303 Usually, `ID' should name a type, but if we got here it means that it
3304 does not. We try to emit the best possible error message depending on
3305 how exactly the id-expression looks like. */
3307 static bool
3309 {
3310 tree id;
3313 /* Avoid duplicate error about ambiguous lookup. */
3315 {
3319 }
3328 /* If the next token is a (, this is a function with no explicit return
3329 type, i.e. constructor, destructor or conversion op. */
3332 {
3335 }
3339 /* Emit a diagnostic for the invalid type. */
3341 out:
3342 /* If we aren't in the middle of a declarator (i.e. in a
3343 parameter-declaration-clause), skip to the end of the declaration;
3344 there's no point in trying to process it. */
3348 }
3350 /* Consume tokens up to, and including, the next non-nested closing `)'.
3351 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3352 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3353 found an unnested token of that type. */
3355 static int
3358 cpp_ttype or_ttype,
3360 {
3370 {
3373 /* Have we found what we're looking for before the closing paren? */
3379 {
3382 /* If we've run out of tokens, then there is no closing `)'. */
3385 /* This is good for lambda expression capture-lists. */
3395 /* This matches the processing in skip_to_end_of_statement. */
3415 {
3419 }
3424 }
3426 /* Consume the token. */
3428 }
3429 }
3431 /* Consume tokens up to, and including, the next non-nested closing `)'.
3432 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3433 are doing error recovery. Returns -1 if OR_COMMA is true and we
3434 found an unnested token of that type. */
3436 static int
3441 {
3445 }
3447 /* Consume tokens until we reach the end of the current statement.
3448 Normally, that will be just before consuming a `;'. However, if a
3449 non-nested `}' comes first, then we stop before consuming that. */
3451 static void
3453 {
3456 /* Unwind generic function template scope if necessary. */
3461 {
3465 {
3468 /* If we've run out of tokens, stop. */
3472 /* If the next token is a `;', we have reached the end of the
3473 statement. */
3479 /* If this is a non-nested '}', stop before consuming it.
3480 That way, when confronted with something like:
3482 { 3 + }
3484 we stop before consuming the closing '}', even though we
3485 have not yet reached a `;'. */
3489 /* If it is the closing '}' for a block that we have
3490 scanned, stop -- but only after consuming the token.
3491 That way given:
3493 void f g () { ... }
3494 typedef int I;
3496 we will stop after the body of the erroneously declared
3497 function, but before consuming the following `typedef'
3498 declaration. */
3500 {
3503 }
3512 }
3514 /* Consume the token. */
3516 }
3517 }
3519 /* This function is called at the end of a statement or declaration.
3520 If the next token is a semicolon, it is consumed; otherwise, error
3521 recovery is attempted. */
3523 static void
3525 {
3526 /* Look for the trailing `;'. */
3528 {
3529 /* If there is additional (erroneous) input, skip to the end of
3530 the statement. */
3532 /* If the next token is now a `;', consume it. */
3535 }
3536 }
3538 /* Skip tokens until we have consumed an entire block, or until we
3539 have consumed a non-nested `;'. */
3541 static void
3543 {
3546 /* Unwind generic function template scope if necessary. */
3551 {
3555 {
3558 /* If we've run out of tokens, stop. */
3562 /* Stop if this is an unnested ';'. */
3568 /* Stop if this is an unnested '}', or closes the outermost
3569 nesting level. */
3570 nesting_depth--;
3578 /* Nest. */
3579 nesting_depth++;
3584 }
3586 /* Consume the token. */
3588 }
3589 }
3591 /* Skip tokens until a non-nested closing curly brace is the next
3592 token, or there are no more tokens. Return true in the first case,
3593 false otherwise. */
3595 static bool
3597 {
3601 {
3605 {
3608 /* If we've run out of tokens, stop. */
3612 /* If the next token is a non-nested `}', then we have reached
3613 the end of the current block. */
3619 /* If it the next token is a `{', then we are entering a new
3620 block. Consume the entire block. */
3626 }
3628 /* Consume the token. */
3630 }
3631 }
3633 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3634 parameter is the PRAGMA token, allowing us to purge the entire pragma
3635 sequence. */
3637 static void
3639 {
3644 do
3648 /* Ensure that the pragma is not parsed again. */
3650 }
3652 /* Require pragma end of line, resyncing with it as necessary. The
3653 arguments are as for cp_parser_skip_to_pragma_eol. */
3655 static void
3657 {
3661 }
3663 /* This is a simple wrapper around make_typename_type. When the id is
3664 an unresolved identifier node, we can provide a superior diagnostic
3665 using cp_parser_diagnose_invalid_type_name. */
3667 static tree
3669 location_t id_location)
3670 {
3671 tree result;
3673 {
3679 }
3681 }
3683 /* This is a wrapper around the
3684 make_{pointer,ptrmem,reference}_declarator functions that decides
3685 which one to call based on the CODE and CLASS_TYPE arguments. The
3686 CODE argument should be one of the values returned by
3687 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3688 appertain to the pointer or reference. */
3692 cp_cv_quals cv_qualifiers,
3694 tree attributes)
3695 {
3702 else
3712 }
3714 /* Create a new C++ parser. */
3718 {
3723 /* cp_lexer_new_main is called before doing GC allocation because
3724 cp_lexer_new_main might load a PCH file. */
3727 /* Initialize the binops_by_token so that we can get the tree
3728 directly from the token. */
3736 /* For now, we always accept GNU extensions. */
3739 /* The `>' token is a greater-than operator, not the end of a
3740 template-id. */
3745 /* We are not parsing a constant-expression. */
3750 /* Local variable names are not forbidden. */
3753 /* We are not processing an `extern "C"' declaration. */
3756 /* We are not processing a declarator. */
3759 /* We are not processing a template-argument-list. */
3762 /* We are not in an iteration statement. */
3765 /* We are not in a switch statement. */
3768 /* We are not parsing a type-id inside an expression. */
3771 /* Declarations aren't implicitly extern "C". */
3774 /* String literals should be translated to the execution character set. */
3777 /* We are not parsing a function body. */
3780 /* We can correct until told otherwise. */
3783 /* The unparsed function queue is empty. */
3786 /* There are no classes being defined. */
3789 /* No template parameters apply. */
3792 /* Special parsing data structures. */
3797 /* Not declaring an implicit function template. */
3803 /* Allow constrained-type-specifiers. */
3807 }
3809 /* Create a cp_lexer structure which will emit the tokens in CACHE
3810 and push it onto the parser's lexer stack. This is used for delayed
3811 parsing of in-class method bodies and default arguments, and should
3812 not be confused with tentative parsing. */
3813 static void
3815 {
3820 /* Move the current source position to that of the first token in the
3821 new lexer. */
3823 }
3825 /* Pop the top lexer off the parser stack. This is never used for the
3826 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3827 static void
3829 {
3834 /* Put the current source position back where it was before this
3835 lexer was pushed. */
3837 }
3839 /* Lexical conventions [gram.lex] */
3841 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3842 identifier. */
3844 static cp_expr
3846 {
3849 /* Look for the identifier. */
3851 /* Return the value. */
3854 else
3856 }
3858 /* Parse a sequence of adjacent string constants. Returns a
3859 TREE_STRING representing the combined, nul-terminated string
3860 constant. If TRANSLATE is true, translate the string to the
3861 execution character set. If WIDE_OK is true, a wide string is
3862 invalid here.
3864 C++98 [lex.string] says that if a narrow string literal token is
3865 adjacent to a wide string literal token, the behavior is undefined.
3866 However, C99 6.4.5p4 says that this results in a wide string literal.
3867 We follow C99 here, for consistency with the C front end.
3869 This code is largely lifted from lex_string() in c-lex.c.
3871 FUTURE: ObjC++ will need to handle @-strings here. */
3872 static cp_expr
3875 {
3876 tree value;
3883 tree string_tree;
3889 {
3892 }
3897 {
3901 }
3902 else
3903 {
3906 }
3909 /* Try to avoid the overhead of creating and destroying an obstack
3910 for the common case of just one string. */
3913 {
3921 {
3925 }
3926 else
3930 }
3931 else
3932 {
3937 do
3938 {
3940 count++;
3945 {
3948 {
3951 }
3954 {
3959 }
3961 }
3962 else
3966 {
3970 {
3974 "unsupported non-standard concatenation "
3976 }
3977 }
3985 {
3989 }
3990 else
3991 {
3995 }
3996 }
3999 /* A string literal built by concatenation has its caret=start at
4000 the start of the initial string, and its finish at the finish of
4001 the final string literal. */
4005 }
4008 {
4011 }
4015 {
4020 {
4035 }
4040 {
4045 else
4047 }
4048 }
4049 else
4050 /* cpp_interpret_string has issued an error. */
4057 }
4059 /* Look up a literal operator with the name and the exact arguments. */
4061 static tree
4063 {
4070 {
4076 {
4079 {
4089 }
4092 /* May be this should be sufficient_parms_p instead,
4093 depending on how exactly should user-defined literals
4094 work in presence of default arguments on the literal
4095 operator parameters. */
4098 }
4099 }
4102 }
4104 /* Parse a user-defined char constant. Returns a call to a user-defined
4105 literal operator taking the character as an argument. */
4107 static cp_expr
4109 {
4117 /* Build up a call to the user-defined operator */
4118 /* Lookup the name we got back from the id-expression. */
4123 {
4128 }
4132 }
4134 /* A subroutine of cp_parser_userdef_numeric_literal to
4135 create a char... template parameter pack from a string node. */
4137 static tree
4139 {
4140 tree charvec;
4146 /* Fill in CHARVEC with all of the parameters. */
4151 /* Build the argument packs. */
4158 }
4160 /* A subroutine of cp_parser_userdef_numeric_literal to
4161 create a char... template parameter pack from a string node. */
4163 static tree
4165 {
4166 tree charvec;
4177 /* First template parm is character type. */
4180 /* Fill in CHARVEC with all of the parameters. */
4187 /* Build the argument packs. */
4194 }
4196 /* Parse a user-defined numeric constant. returns a call to a user-defined
4197 literal operator. */
4199 static cp_expr
4201 {
4212 /* Look for a literal operator taking the exact type of numeric argument
4213 as the literal value. */
4218 {
4220 tf_warning_or_error);
4223 {
4226 long_long_unsigned_type_node);
4227 }
4228 else
4229 {
4233 long_double_type_node);
4237 }
4241 }
4244 /* If the numeric argument didn't work, look for a raw literal
4245 operator taking a const char* argument consisting of the number
4246 in string format. */
4251 {
4253 tf_warning_or_error);
4256 }
4259 /* If the raw literal didn't work, look for a non-type template
4260 function with parameter pack char.... Call the function with
4261 template parameter characters representing the number. */
4265 {
4269 tf_warning_or_error);
4272 }
4281 }
4283 /* Parse a user-defined string constant. Returns a call to a user-defined
4284 literal operator taking a character pointer and the length of the string
4285 as arguments. */
4287 static tree
4289 {
4298 /* Build up a call to the user-defined operator. */
4299 /* Lookup the name we got back from the id-expression. */
4306 {
4308 tf_warning_or_error);
4311 }
4314 /* Look for a template function with typename parameter CharT
4315 and parameter pack CharT... Call the function with
4316 template parameter characters representing the string. */
4320 {
4324 tf_warning_or_error);
4327 }
4333 }
4336 /* Basic concepts [gram.basic] */
4338 /* Parse a translation-unit.
4340 translation-unit:
4341 declaration-seq [opt]
4343 Returns TRUE if all went well. */
4345 static bool
4347 {
4348 /* The address of the first non-permanent object on the declarator
4349 obstack. */
4354 /* Create the declarator obstack, if necessary. */
4356 {
4358 /* Create the error declarator. */
4360 /* Create the empty parameter list. */
4362 /* Remember where the base of the declarator obstack lies. */
4364 }
4368 /* If there are no tokens left then all went well. */
4370 {
4371 /* Get rid of the token array; we don't need it any more. */
4375 /* This file might have been a context that's implicitly extern
4376 "C". If so, pop the lang context. (Only relevant for PCH.) */
4378 {
4381 }
4383 /* Finish up. */
4387 }
4388 else
4389 {
4392 }
4394 /* Make sure the declarator obstack was fully cleaned up. */
4398 /* All went well. */
4400 }
4402 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4403 decltype context. */
4407 {
4412 }
4414 /* We're about to parse a collection of statements. If we're currently
4415 parsing tentatively, set up a firewall so that any nested
4416 cp_parser_commit_to_tentative_parse won't affect the current context. */
4418 static cp_token_position
4420 {
4427 }
4429 /* We've finished parsing the collection of statements. Wrap up the
4430 firewall and replace the relevant tokens with the parsed form. */
4432 static void
4434 tree expr)
4435 {
4439 /* Finish the firewall level. */
4441 /* And remember the result of the parse for when we try again. */
4447 }
4449 /* Like the above functions, but let the user modify the tokens. Used by
4450 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4451 later parses, so it makes sense to localize the effects of
4452 cp_parser_commit_to_tentative_parse. */
4454 struct tentative_firewall
4455 {
4460 {
4461 /* If we're currently parsing tentatively, start a committed level as a
4462 firewall and then an inner tentative parse. */
4464 {
4468 }
4469 }
4472 {
4474 {
4475 /* Finish the inner tentative parse and the firewall, propagating any
4476 uncommitted error state to the outer tentative parse. */
4482 }
4483 }
4484 };
4486 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4487 enclosing parentheses. */
4489 static cp_expr
4491 {
4494 /* Consume the '('. */
4497 /* Start the statement-expression. */
4499 /* Parse the compound-statement. */
4501 /* Finish up. */
4503 /* Consume the ')'. */
4511 }
4513 /* Expressions [gram.expr] */
4515 /* Parse a fold-operator.
4517 fold-operator:
4518 - * / % ^ & | = < > << >>
4519 = -= *= /= %= ^= &= |= <<= >>=
4520 == != <= >= && || , .* ->*
4522 This returns the tree code corresponding to the matched operator
4523 as an int. When the current token matches a compound assignment
4524 opertor, the resulting tree code is the negative value of the
4525 non-assignment operator. */
4527 static int
4529 {
4531 {
4571 }
4572 }
4574 /* Returns true if CODE indicates a binary expression, which is not allowed in
4575 the LHS of a fold-expression. More codes will need to be added to use this
4576 function in other contexts. */
4578 static bool
4580 {
4582 {
4615 }
4616 }
4618 /* If the next token is a suitable fold operator, consume it and return as
4619 the function above. */
4621 static int
4623 {
4629 }
4631 /* Parse a fold-expression.
4633 fold-expression:
4634 ( ... folding-operator cast-expression)
4635 ( cast-expression folding-operator ... )
4636 ( cast-expression folding operator ... folding-operator cast-expression)
4638 Note that the '(' and ')' are matched in primary expression. */
4640 static cp_expr
4642 {
4643 cp_id_kind pidk;
4645 // Left fold.
4647 {
4651 {
4654 }
4661 }
4666 {
4669 }
4672 {
4675 }
4678 /* The operands of a fold-expression are cast-expressions, so binary or
4679 conditional expressions are not allowed. We check this here to avoid
4680 tentative parsing. */
4690 // Right fold.
4695 {
4698 }
4701 // Binary left or right fold.
4706 }
4708 /* Parse a primary-expression.
4710 primary-expression:
4711 literal
4712 this
4713 ( expression )
4714 id-expression
4715 lambda-expression (C++11)
4717 GNU Extensions:
4719 primary-expression:
4720 ( compound-statement )
4721 __builtin_va_arg ( assignment-expression , type-id )
4722 __builtin_offsetof ( type-id , offsetof-expression )
4724 C++ Extensions:
4725 __has_nothrow_assign ( type-id )
4726 __has_nothrow_constructor ( type-id )
4727 __has_nothrow_copy ( type-id )
4728 __has_trivial_assign ( type-id )
4729 __has_trivial_constructor ( type-id )
4730 __has_trivial_copy ( type-id )
4731 __has_trivial_destructor ( type-id )
4732 __has_virtual_destructor ( type-id )
4733 __is_abstract ( type-id )
4734 __is_base_of ( type-id , type-id )
4735 __is_class ( type-id )
4736 __is_empty ( type-id )
4737 __is_enum ( type-id )
4738 __is_final ( type-id )
4739 __is_literal_type ( type-id )
4740 __is_pod ( type-id )
4741 __is_polymorphic ( type-id )
4742 __is_std_layout ( type-id )
4743 __is_trivial ( type-id )
4744 __is_union ( type-id )
4746 Objective-C++ Extension:
4748 primary-expression:
4749 objc-expression
4751 literal:
4752 __null
4754 ADDRESS_P is true iff this expression was immediately preceded by
4755 "&" and therefore might denote a pointer-to-member. CAST_P is true
4756 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4757 true iff this expression is a template argument.
4759 Returns a representation of the expression. Upon return, *IDK
4760 indicates what kind of id-expression (if any) was present. */
4762 static cp_expr
4769 {
4772 /* Assume the primary expression is not an id-expression. */
4775 /* Peek at the next token. */
4778 {
4779 /* literal:
4780 integer-literal
4781 character-literal
4782 floating-literal
4783 string-literal
4784 boolean-literal
4785 pointer-literal
4786 user-defined-literal */
4798 {
4802 }
4803 /* Floating-point literals are only allowed in an integral
4804 constant expression if they are cast to an integral or
4805 enumeration type. */
4809 {
4810 /* CAST_P will be set even in invalid code like "int(2.7 +
4811 ...)". Therefore, we have to check that the next token
4812 is sure to end the cast. */
4814 {
4819 enumerator-definition. */
4821 /* The curly brace at the end of an enum-specifier. */
4823 /* The end of a statement. */
4825 /* The end of the cast-expression. */
4827 /* The end of an array bound. */
4829 /* The closing ">" in a template-argument-list. */
4832 /* C++0x only: A ">>" treated like two ">" tokens,
4833 in a template-argument-list. */
4838 }
4840 /* If we are within a cast, then the constraint that the
4841 cast is to an integral or enumeration type will be
4842 checked at that point. If we are not within a cast, then
4843 this code is invalid. */
4846 }
4866 /* ??? Should wide strings be allowed when parser->translate_strings_p
4867 is false (i.e. in attributes)? If not, we can kill the third
4868 argument to cp_parser_string_literal. */
4874 /* If we see `( { ' then we are looking at the beginning of
4875 a GNU statement-expression. */
4878 {
4879 /* Statement-expressions are not allowed by the standard. */
4883 /* And they're not allowed outside of a function-body; you
4884 cannot, for example, write:
4886 int i = ({ int j = 3; j + 1; });
4888 at class or namespace scope. */
4891 {
4893 "statement-expressions are not allowed outside "
4899 }
4900 else
4902 }
4903 /* Otherwise it's a normal parenthesized expression. */
4904 {
4905 cp_expr expr;
4910 /* Consume the `('. */
4912 /* Within a parenthesized expression, a `>' token is always
4913 the greater-than operator. */
4914 saved_greater_than_is_operator_p
4919 /* Left fold expression. */
4921 else
4922 /* Parse the parenthesized expression. */
4927 {
4934 }
4935 else
4936 /* Let the front end know that this expression was
4937 enclosed in parentheses. This matters in case, for
4938 example, the expression is of the form `A::B', since
4939 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4940 not. */
4943 /* DR 705: Wrapping an unqualified name in parentheses
4944 suppresses arg-dependent lookup. We want to pass back
4945 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4946 (c++/37862), but none of the others. */
4950 /* The `>' token might be the end of a template-id or
4951 template-parameter-list now. */
4952 parser->greater_than_is_operator_p
4955 /* Consume the `)'. */
4964 }
4967 {
4969 {
4970 /* We might have an Objective-C++ message. */
4973 /* If that works out, we're done ... */
4976 /* ... else, fall though to see if it's a lambda. */
4977 }
4979 /* Don't warn about a failed tentative parse. */
4984 }
4988 /* We have an Objective-C++ string literal. */
4995 {
4996 /* These two are the boolean literals. */
5004 /* The `__null' literal. */
5009 /* The `nullptr' literal. */
5014 /* Recognize the `this' keyword. */
5018 {
5022 }
5023 /* Pointers cannot appear in constant-expressions. */
5028 /* The `operator' keyword can be the beginning of an
5029 id-expression. */
5036 {
5037 non_integral_constant name;
5039 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5040 __func__ are the names of variables -- but they are
5041 treated specially. Therefore, they are handled here,
5042 rather than relying on the generic id-expression logic
5043 below. Grammatically, these names are id-expressions.
5045 Consume the token. */
5049 {
5061 }
5066 /* Look up the name. */
5068 }
5071 {
5072 tree expression;
5073 tree type;
5074 source_location type_location;
5075 location_t start_loc
5077 /* The `__builtin_va_arg' construct is used to handle
5078 `va_arg'. Consume the `__builtin_va_arg' token. */
5080 /* Look for the opening `('. */
5082 /* Now, parse the assignment-expression. */
5084 /* Look for the `,'. */
5087 /* Parse the type-id. */
5088 {
5091 }
5092 /* Look for the closing `)'. */
5093 location_t finish_loc
5096 /* Using `va_arg' in a constant-expression is not
5097 allowed. */
5099 NIC_VA_ARG))
5101 /* Construct a location of the form:
5102 __builtin_va_arg (v, int)
5103 ~~~~~~~~~~~~~~~~~~~~~^~~~
5104 with the caret at the type, ranging from the start of the
5105 "__builtin_va_arg" token to the close paren. */
5106 location_t combined_loc
5109 }
5141 // C++ concepts
5145 /* Objective-C++ expressions. */
5155 {
5160 }
5161 /* FALLTHRU */
5165 }
5167 /* An id-expression can start with either an identifier, a
5168 `::' as the beginning of a qualified-id, or the "operator"
5169 keyword. */
5174 {
5175 id_expression:
5176 cp_expr id_expression;
5177 cp_expr decl;
5183 /* Parse the id-expression. */
5184 id_expression
5201 /* If we have a template-id, then no further lookup is
5202 required. If the template-id was for a template-class, we
5203 will sometimes have a TYPE_DECL at this point. */
5207 /* Look up the name. */
5208 else
5209 {
5210 tree ambiguous_decls;
5212 /* If we already know that this lookup is ambiguous, then
5213 we've already issued an error message; there's no reason
5214 to check again. */
5217 {
5220 }
5223 none_type,
5224 template_p,
5229 /* If the lookup was ambiguous, an error will already have
5230 been issued. */
5234 /* In Objective-C++, we may have an Objective-C 2.0
5235 dot-syntax for classes here. */
5240 {
5241 tree component;
5248 component);
5249 /* Build a location of the form:
5250 expr.component
5251 ~~~~~^~~~~~~~~
5252 with caret at the start of the component name (at
5253 input_location), ranging from the start of the id_expression
5254 to the end of the component name. */
5255 location_t combined_loc
5260 }
5262 /* In Objective-C++, an instance variable (ivar) may be preferred
5263 to whatever cp_parser_lookup_name() found.
5264 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5265 rest of c-family, we have to do a little extra work to preserve
5266 any location information in cp_expr "decl". Given that
5267 objc_lookup_ivar is implemented in "c-family" and "objc", we
5268 have a trip through the pure "tree" type, rather than cp_expr.
5269 Naively copying it back to "decl" would implicitly give the
5270 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5271 store an EXPR_LOCATION. Hence we only update "decl" (and
5272 hence its location_t) if we get back a different tree node. */
5274 id_expression);
5278 /* If name lookup gives us a SCOPE_REF, then the
5279 qualifying scope was dependent. */
5281 {
5282 /* At this point, we do not know if DECL is a valid
5283 integral constant expression. We assume that it is
5284 in fact such an expression, so that code like:
5286 template <int N> struct A {
5287 int a[B<N>::i];
5288 };
5290 is accepted. At template-instantiation time, we
5291 will check that B<N>::i is actually a constant. */
5293 }
5294 /* Check to see if DECL is a local variable in a context
5295 where that is forbidden. */
5298 {
5299 /* It might be that we only found DECL because we are
5300 trying to be generous with pre-ISO scoping rules.
5301 For example, consider:
5303 int i;
5304 void g() {
5305 for (int i = 0; i < 10; ++i) {}
5306 extern void f(int j = i);
5307 }
5309 Here, name look up will originally find the out
5310 of scope `i'. We need to issue a warning message,
5311 but then use the global `i'. */
5314 {
5319 }
5320 }
5321 }
5323 decl = (finish_id_expression
5325 idk,
5330 template_arg_p,
5337 }
5339 /* Anything else is an error. */
5343 }
5344 }
5352 {
5355 }
5357 /* Parse an id-expression.
5359 id-expression:
5360 unqualified-id
5361 qualified-id
5363 qualified-id:
5364 :: [opt] nested-name-specifier template [opt] unqualified-id
5365 :: identifier
5366 :: operator-function-id
5367 :: template-id
5369 Return a representation of the unqualified portion of the
5370 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5371 a `::' or nested-name-specifier.
5373 Often, if the id-expression was a qualified-id, the caller will
5374 want to make a SCOPE_REF to represent the qualified-id. This
5375 function does not do this in order to avoid wastefully creating
5376 SCOPE_REFs when they are not required.
5378 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5379 `template' keyword.
5381 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5382 uninstantiated templates.
5384 If *TEMPLATE_P is non-NULL, it is set to true iff the
5385 `template' keyword is used to explicitly indicate that the entity
5386 named is a template.
5388 If DECLARATOR_P is true, the id-expression is appearing as part of
5389 a declarator, rather than as part of an expression. */
5391 static cp_expr
5398 {
5402 /* Assume the `template' keyword was not used. */
5406 /* Look for the optional `::' operator. */
5407 global_scope_p
5410 /* Look for the optional nested-name-specifier. */
5411 nested_name_specifier_p
5414 check_dependency_p,
5416 declarator_p)
5418 /* If there is a nested-name-specifier, then we are looking at
5419 the first qualified-id production. */
5421 {
5422 tree saved_scope;
5423 tree saved_object_scope;
5424 tree saved_qualifying_scope;
5425 cp_expr unqualified_id;
5428 /* See if the next token is the `template' keyword. */
5432 /* Name lookup we do during the processing of the
5433 unqualified-id might obliterate SCOPE. */
5437 /* Process the final unqualified-id. */
5439 check_dependency_p,
5440 declarator_p,
5442 /* Restore the SAVED_SCOPE for our caller. */
5448 }
5449 /* Otherwise, if we are in global scope, then we are looking at one
5450 of the other qualified-id productions. */
5452 {
5454 tree id;
5456 /* Peek at the next token. */
5459 /* If it's an identifier, and the next token is not a "<", then
5460 we can avoid the template-id case. This is an optimization
5461 for this common case. */
5463 && !cp_parser_nth_token_starts_template_argument_list_p
5468 /* Try a template-id. */
5472 none_type,
5473 declarator_p);
5474 /* If that worked, we're done. */
5478 /* Peek at the next token. (Changes in the token buffer may
5479 have invalidated the pointer obtained above.) */
5483 {
5490 /* Fall through. */
5495 }
5496 }
5497 else
5500 declarator_p,
5501 optional_p);
5502 }
5504 /* Parse an unqualified-id.
5506 unqualified-id:
5507 identifier
5508 operator-function-id
5509 conversion-function-id
5510 ~ class-name
5511 template-id
5513 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5514 keyword, in a construct like `A::template ...'.
5516 Returns a representation of unqualified-id. For the `identifier'
5517 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5518 production a BIT_NOT_EXPR is returned; the operand of the
5519 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5520 other productions, see the documentation accompanying the
5521 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5522 names are looked up in uninstantiated templates. If DECLARATOR_P
5523 is true, the unqualified-id is appearing as part of a declarator,
5524 rather than as part of an expression. */
5526 static cp_expr
5532 {
5535 /* Peek at the next token. */
5539 {
5541 {
5542 tree id;
5544 /* We don't know yet whether or not this will be a
5545 template-id. */
5547 /* Try a template-id. */
5549 check_dependency_p,
5550 none_type,
5551 declarator_p);
5552 /* If it worked, we're done. */
5555 /* Otherwise, it's an ordinary identifier. */
5557 }
5561 check_dependency_p,
5562 none_type,
5563 declarator_p);
5566 {
5567 tree type_decl;
5568 tree qualifying_scope;
5569 tree object_scope;
5570 tree scope;
5573 /* Consume the `~' token. */
5575 /* Parse the class-name. The standard, as written, seems to
5576 say that:
5578 template <typename T> struct S { ~S (); };
5579 template <typename T> S<T>::~S() {}
5581 is invalid, since `~' must be followed by a class-name, but
5582 `S<T>' is dependent, and so not known to be a class.
5583 That's not right; we need to look in uninstantiated
5584 templates. A further complication arises from:
5586 template <typename T> void f(T t) {
5587 t.T::~T();
5588 }
5590 Here, it is not possible to look up `T' in the scope of `T'
5591 itself. We must look in both the current scope, and the
5592 scope of the containing complete expression.
5594 Yet another issue is:
5596 struct S {
5597 int S;
5598 ~S();
5599 };
5601 S::~S() {}
5603 The standard does not seem to say that the `S' in `~S'
5604 should refer to the type `S' and not the data member
5605 `S::S'. */
5607 /* DR 244 says that we look up the name after the "~" in the
5608 same scope as we looked up the qualifying name. That idea
5609 isn't fully worked out; it's more complicated than that. */
5614 /* Check for invalid scopes. */
5616 {
5620 }
5622 {
5626 scope);
5631 }
5634 /* If the name is of the form "X::~X" it's OK even if X is a
5635 typedef. */
5644 {
5647 }
5649 /* ~auto means the destructor of whatever the object is. */
5651 {
5654 "%<~auto%> only available with "
5658 }
5660 /* If there was an explicit qualification (S::~T), first look
5661 in the scope given by the qualification (i.e., S).
5663 Note: in the calls to cp_parser_class_name below we pass
5664 typename_type so that lookup finds the injected-class-name
5665 rather than the constructor. */
5669 {
5674 typename_type,
5677 declarator_p);
5680 }
5681 /* In "N::S::~S", look in "N" as well. */
5683 {
5688 type_decl
5692 typename_type,
5695 declarator_p);
5698 }
5699 /* In "p->S::~T", look in the scope given by "*p" as well. */
5701 {
5706 type_decl
5710 typename_type,
5713 declarator_p);
5716 }
5717 /* Look in the surrounding context. */
5719 {
5725 type_decl
5729 typename_type,
5732 declarator_p);
5735 {
5736 /* We couldn't find a type with this name. If we're parsing
5737 tentatively, fail and try something else. */
5739 {
5742 }
5743 /* Otherwise, accept it and check for a match at instantiation
5744 time. */
5749 }
5750 }
5751 /* If an error occurred, assume that the name of the
5752 destructor is the same as the name of the qualifying
5753 class. That allows us to keep parsing after running
5754 into ill-formed destructor names. */
5760 /* Check that destructor name and scope match. */
5762 {
5769 }
5771 /* [class.dtor]
5773 A typedef-name that names a class shall not be used as the
5774 identifier in the declarator for a destructor declaration. */
5781 type_decl);
5784 }
5788 {
5789 cp_expr id;
5791 /* This could be a template-id, so we try that first. */
5793 /* Try a template-id. */
5796 none_type,
5797 declarator_p);
5798 /* If that worked, we're done. */
5801 /* We still don't know whether we're looking at an
5802 operator-function-id or a conversion-function-id. */
5804 /* Try an operator-function-id. */
5806 /* If that didn't work, try a conversion-function-id. */
5810 {
5811 /* 17.6.3.3.5 */
5816 "literal operator suffixes not preceded by %<_%>"
5818 }
5821 }
5822 /* Fall through. */
5829 }
5830 }
5832 /* Parse an (optional) nested-name-specifier.
5834 nested-name-specifier: [C++98]
5835 class-or-namespace-name :: nested-name-specifier [opt]
5836 class-or-namespace-name :: template nested-name-specifier [opt]
5838 nested-name-specifier: [C++0x]
5839 type-name ::
5840 namespace-name ::
5841 nested-name-specifier identifier ::
5842 nested-name-specifier template [opt] simple-template-id ::
5844 PARSER->SCOPE should be set appropriately before this function is
5845 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5846 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5847 in name lookups.
5849 Sets PARSER->SCOPE to the class (TYPE) or namespace
5850 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5851 it unchanged if there is no nested-name-specifier. Returns the new
5852 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5854 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5855 part of a declaration and/or decl-specifier. */
5857 static tree
5863 {
5868 /* Remember where the nested-name-specifier starts. */
5870 {
5873 }
5876 {
5877 tree new_scope;
5878 tree old_scope;
5879 tree saved_qualifying_scope;
5882 /* Spot cases that cannot be the beginning of a
5883 nested-name-specifier. */
5886 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5887 the already parsed nested-name-specifier. */
5889 {
5890 /* Grab the nested-name-specifier and continue the loop. */
5892 /* If we originally encountered this nested-name-specifier
5893 with IS_DECLARATION set to false, we will not have
5894 resolved TYPENAME_TYPEs, so we must do so here. */
5897 {
5902 }
5905 }
5907 /* Spot cases that cannot be the beginning of a
5908 nested-name-specifier. On the second and subsequent times
5909 through the loop, we look for the `template' keyword. */
5911 ;
5912 /* A template-id can start a nested-name-specifier. */
5914 ;
5915 /* DR 743: decltype can be used in a nested-name-specifier. */
5917 ;
5918 else
5919 {
5920 /* If the next token is not an identifier, then it is
5921 definitely not a type-name or namespace-name. */
5924 /* If the following token is neither a `<' (to begin a
5925 template-id), nor a `::', then we are not looking at a
5926 nested-name-specifier. */
5932 {
5936 }
5939 && !cp_parser_nth_token_starts_template_argument_list_p
5942 }
5944 /* The nested-name-specifier is optional, so we parse
5945 tentatively. */
5948 /* Look for the optional `template' keyword, if this isn't the
5949 first time through the loop. */
5952 else
5955 /* Save the old scope since the name lookup we are about to do
5956 might destroy it. */
5959 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5960 look up names in "X<T>::I" in order to determine that "Y" is
5961 a template. So, if we have a typename at this point, we make
5962 an effort to look through it. */
5964 && !typename_keyword_p
5969 /* Parse the qualifying entity. */
5970 new_scope
5972 typename_keyword_p,
5973 template_keyword_p,
5974 check_dependency_p,
5975 type_p,
5976 is_declaration);
5977 /* Look for the `::' token. */
5980 /* If we found what we wanted, we keep going; otherwise, we're
5981 done. */
5983 {
5986 /* Restore the OLD_SCOPE since it was valid before the
5987 failed attempt at finding the last
5988 class-or-namespace-name. */
5992 /* If the next token is a decltype, and the one after that is a
5993 `::', then the decltype has failed to resolve to a class or
5994 enumeration type. Give this error even when parsing
5995 tentatively since it can't possibly be valid--and we're going
5996 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5997 won't get another chance.*/
6001 {
6008 /* As below. */
6011 }
6015 {
6016 /* If we have a non-type template-id followed by ::, it can't
6017 possibly be valid. */
6022 {
6025 {
6031 }
6032 else
6033 {
6034 /* Variable template. */
6039 }
6046 /* As below. */
6050 }
6051 }
6055 /* If the next token is an identifier, and the one after
6056 that is a `::', then any valid interpretation would have
6057 found a class-or-namespace-name. */
6063 {
6066 {
6068 {
6069 tree decl;
6070 tree ambiguous_decls;
6073 none_type,
6082 decl);
6084 {
6085 // cp_parser_lookup_name has the same diagnostic,
6086 // thus make sure to emit it at most once.
6089 {
6094 }
6096 }
6097 else
6098 {
6100 cp_parser_name_lookup_error
6103 else
6104 cp_parser_name_lookup_error
6107 }
6108 }
6111 /* Treat this as a successful nested-name-specifier
6112 due to:
6114 [basic.lookup.qual]
6116 If the name found is not a class-name (clause
6117 _class_) or namespace-name (_namespace.def_), the
6118 program is ill-formed. */
6120 }
6122 }
6124 }
6125 /* We've found one valid nested-name-specifier. */
6127 /* Name lookup always gives us a DECL. */
6130 /* Uses of "template" must be followed by actual templates. */
6142 new_scope);
6143 /* If it is a class scope, try to complete it; we are about to
6144 be looking up names inside the class. */
6146 /* Since checking types for dependency can be expensive,
6147 avoid doing it if the type is already complete. */
6149 /* Do not try to complete dependent types. */
6151 {
6153 /* If it is a typedef to current class, use the current
6154 class instead, as the typedef won't have any names inside
6155 it yet. */
6159 }
6160 /* Make sure we look in the right scope the next time through
6161 the loop. */
6163 }
6165 /* If parsing tentatively, replace the sequence of tokens that makes
6166 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6167 token. That way, should we re-parse the token stream, we will
6168 not have to repeat the effort required to do the parse, nor will
6169 we issue duplicate error messages. */
6171 {
6175 /* Reset the contents of the START token. */
6177 /* Retrieve any deferred checks. Do not pop this access checks yet
6178 so the memory will not be reclaimed during token replacing below. */
6186 /* Purge all subsequent tokens. */
6188 }
6194 }
6196 /* Parse a nested-name-specifier. See
6197 cp_parser_nested_name_specifier_opt for details. This function
6198 behaves identically, except that it will an issue an error if no
6199 nested-name-specifier is present. */
6201 static tree
6207 {
6208 tree scope;
6210 /* Look for the nested-name-specifier. */
6212 typename_keyword_p,
6213 check_dependency_p,
6214 type_p,
6215 is_declaration);
6216 /* If it was not present, issue an error message. */
6218 {
6221 }
6224 }
6226 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6227 this is either a class-name or a namespace-name (which corresponds
6228 to the class-or-namespace-name production in the grammar). For
6229 C++0x, it can also be a type-name that refers to an enumeration
6230 type or a simple-template-id.
6232 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6233 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6234 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6235 TYPE_P is TRUE iff the next name should be taken as a class-name,
6236 even the same name is declared to be another entity in the same
6237 scope.
6239 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6240 specified by the class-or-namespace-name. If neither is found the
6241 ERROR_MARK_NODE is returned. */
6243 static tree
6250 {
6251 tree saved_scope;
6252 tree saved_qualifying_scope;
6253 tree saved_object_scope;
6254 tree scope;
6258 /* DR 743: decltype can appear in a nested-name-specifier. */
6260 {
6264 {
6267 }
6271 }
6273 /* Before we try to parse the class-name, we must save away the
6274 current PARSER->SCOPE since cp_parser_class_name will destroy
6275 it. */
6279 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6280 there is no need to look for a namespace-name. */
6281 only_class_p = template_keyword_p
6286 typename_keyword_p,
6287 template_keyword_p,
6289 check_dependency_p,
6291 is_declaration,
6294 /* If that didn't work, try for a namespace-name. */
6296 {
6297 /* Restore the saved scope. */
6301 /* If we are not looking at an identifier followed by the scope
6302 resolution operator, then this is not part of a
6303 nested-name-specifier. (Note that this function is only used
6304 to parse the components of a nested-name-specifier.) */
6309 }
6312 }
6314 /* Return true if we are looking at a compound-literal, false otherwise. */
6316 static bool
6318 {
6319 /* Consume the `('. */
6324 /* Skip tokens until the next token is a closing parenthesis.
6325 If we find the closing `)', and the next token is a `{', then
6326 we are looking at a compound-literal. */
6327 bool compound_literal_p
6332 /* Roll back the tokens we skipped. */
6336 }
6338 /* Parse a postfix-expression.
6340 postfix-expression:
6341 primary-expression
6342 postfix-expression [ expression ]
6343 postfix-expression ( expression-list [opt] )
6344 simple-type-specifier ( expression-list [opt] )
6345 typename :: [opt] nested-name-specifier identifier
6346 ( expression-list [opt] )
6347 typename :: [opt] nested-name-specifier template [opt] template-id
6348 ( expression-list [opt] )
6349 postfix-expression . template [opt] id-expression
6350 postfix-expression -> template [opt] id-expression
6351 postfix-expression . pseudo-destructor-name
6352 postfix-expression -> pseudo-destructor-name
6353 postfix-expression ++
6354 postfix-expression --
6355 dynamic_cast < type-id > ( expression )
6356 static_cast < type-id > ( expression )
6357 reinterpret_cast < type-id > ( expression )
6358 const_cast < type-id > ( expression )
6359 typeid ( expression )
6360 typeid ( type-id )
6362 GNU Extension:
6364 postfix-expression:
6365 ( type-id ) { initializer-list , [opt] }
6367 This extension is a GNU version of the C99 compound-literal
6368 construct. (The C99 grammar uses `type-name' instead of `type-id',
6369 but they are essentially the same concept.)
6371 If ADDRESS_P is true, the postfix expression is the operand of the
6372 `&' operator. CAST_P is true if this expression is the target of a
6373 cast.
6375 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6376 class member access expressions [expr.ref].
6378 Returns a representation of the expression. */
6380 static cp_expr
6384 {
6386 location_t loc;
6393 /* Peek at the next token. */
6398 /* Some of the productions are determined by keywords. */
6401 {
6406 {
6407 tree type;
6408 cp_expr expression;
6412 /* All of these can be handled in the same way from the point
6413 of view of parsing. Begin by consuming the token
6414 identifying the cast. */
6417 /* New types cannot be defined in the cast. */
6419 parser->type_definition_forbidden_message
6422 /* Look for the opening `<'. */
6424 /* Parse the type to which we are casting. */
6429 /* Look for the closing `>'. */
6431 /* Restore the old message. */
6434 bool saved_greater_than_is_operator_p
6438 /* And the expression which is being cast. */
6442 RT_CLOSE_PAREN);
6446 parser->greater_than_is_operator_p
6449 /* Only type conversions to integral or enumeration types
6450 can be used in constant-expressions. */
6453 {
6456 }
6459 {
6461 postfix_expression
6465 postfix_expression
6469 postfix_expression
6471 tf_warning_or_error);
6474 postfix_expression
6479 }
6481 /* Construct a location e.g. :
6482 reinterpret_cast <int *> (expr)
6483 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6484 ranging from the start of the "*_cast" token to the final closing
6485 paren, with the caret at the start. */
6488 }
6492 {
6493 tree type;
6497 /* Consume the `typeid' token. */
6499 /* Look for the `(' token. */
6501 /* Types cannot be defined in a `typeid' expression. */
6503 parser->type_definition_forbidden_message
6505 /* We can't be sure yet whether we're looking at a type-id or an
6506 expression. */
6508 /* Try a type-id first. */
6513 /* Look for the `)' token. Otherwise, we can't be sure that
6514 we're not looking at an expression: consider `typeid (int
6515 (3))', for example. */
6517 /* If all went well, simply lookup the type-id. */
6520 /* Otherwise, fall back to the expression variant. */
6521 else
6522 {
6523 tree expression;
6525 /* Look for an expression. */
6527 /* Compute its typeid. */
6529 /* Look for the `)' token. */
6531 }
6532 /* Restore the saved message. */
6534 /* `typeid' may not appear in an integral constant expression. */
6537 }
6541 {
6542 tree type;
6543 /* The syntax permitted here is the same permitted for an
6544 elaborated-type-specifier. */
6551 }
6555 {
6556 location_t cilk_spawn_loc
6561 {
6566 }
6568 {
6573 }
6574 else
6575 {
6576 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6579 }
6581 postfix_expression =
6585 {
6589 }
6591 {
6596 }
6597 else
6598 {
6601 postfix_expression);
6602 /* Build a location of the form:
6603 _Cilk_spawn expr
6604 ~~~~~~~~~~~~^~~~
6605 with caret at the expr, ranging from the start of the
6606 _Cilk_spawn token to the end of the expression. */
6607 location_t combined_loc =
6613 }
6615 }
6620 {
6623 tree p;
6630 {
6633 }
6639 {
6642 postfix_expression
6644 else
6645 {
6649 }
6655 tf_warning_or_error);
6656 else
6657 {
6661 }
6666 postfix_expression
6670 postfix_expression
6673 else
6674 {
6678 }
6683 }
6685 }
6688 {
6689 tree type;
6691 /* If the next thing is a simple-type-specifier, we may be
6692 looking at a functional cast. We could also be looking at
6693 an id-expression. So, we try the functional cast, and if
6694 that doesn't work we fall back to the primary-expression. */
6696 /* Look for the simple-type-specifier. */
6700 CP_PARSER_FLAGS_NONE);
6702 /* Parse the cast itself. */
6704 postfix_expression
6706 /* If that worked, we're done. */
6710 /* If the functional-cast didn't work out, try a
6711 compound-literal. */
6714 {
6719 /* Avoid calling cp_parser_type_id pointlessly, see comment
6720 in cp_parser_cast_expression about c++/29234. */
6723 else
6724 {
6725 /* Parse the type. */
6730 /* Look for the `)'. */
6732 }
6734 /* If things aren't going well, there's no need to
6735 keep going. */
6737 {
6739 /* Parse the brace-enclosed initializer list. */
6742 }
6743 /* If that worked, we're definitely looking at a
6744 compound-literal expression. */
6746 {
6747 /* Warn the user that a compound literal is not
6748 allowed in standard C++. */
6751 /* For simplicity, we disallow compound literals in
6752 constant-expressions. We could
6753 allow compound literals of integer type, whose
6754 initializer was a constant, in constant
6755 expressions. Permitting that usage, as a further
6756 extension, would not change the meaning of any
6757 currently accepted programs. (Of course, as
6758 compound literals are not part of ISO C++, the
6759 standard has nothing to say.) */
6761 NIC_NCC))
6762 {
6765 }
6766 /* Form the representation of the compound-literal. */
6767 postfix_expression
6769 tf_warning_or_error);
6772 }
6773 }
6775 /* It must be a primary-expression. */
6776 postfix_expression
6779 decltype_p,
6781 }
6783 }
6785 /* Note that we don't need to worry about calling build_cplus_new on a
6786 class-valued CALL_EXPR in decltype when it isn't the end of the
6787 postfix-expression; unary_complex_lvalue will take care of that for
6788 all these cases. */
6790 /* Keep looping until the postfix-expression is complete. */
6792 {
6796 /* It is not a Koenig lookup function call. */
6797 postfix_expression
6800 /* Peek at the next token. */
6804 {
6807 {
6809 "two consecutive %<[%> shall "
6812 }
6813 postfix_expression
6815 postfix_expression,
6817 decltype_p);
6826 /* postfix-expression ( expression-list [opt] ) */
6827 {
6838 is_builtin_constant_p
6841 {
6842 /* The whole point of __builtin_constant_p is to allow
6843 non-constant expressions to appear as arguments. */
6844 saved_integral_constant_expression_p
6846 saved_non_integral_constant_expression_p
6849 }
6850 args = (cp_parser_parenthesized_expression_list
6856 {
6857 parser->integral_constant_expression_p
6859 parser->non_integral_constant_expression_p
6861 }
6864 {
6867 }
6869 /* Function calls are not permitted in
6870 constant-expressions. */
6873 NIC_FUNC_CALL))
6874 {
6878 }
6883 {
6885 {
6887 {
6890 postfix_expression
6892 complain);
6893 }
6894 else
6895 postfix_expression
6897 }
6898 /* We do not perform argument-dependent lookup if
6899 normal lookup finds a non-function, in accordance
6900 with the expected resolution of DR 218. */
6903 {
6907 /* Do not do argument dependent lookup if regular
6908 lookup finds a member function or a block-scope
6909 function declaration. [basic.lookup.argdep]/3 */
6912 {
6915 postfix_expression
6917 complain);
6918 }
6919 }
6920 }
6926 {
6935 }
6939 {
6941 tree arg;
6949 {
6954 }
6958 }
6961 {
6971 {
6973 postfix_expression
6977 }
6980 {
6981 postfix_expression
6982 = (build_new_method_call
6988 complain));
6989 }
6990 else
6991 postfix_expression
6995 complain);
6996 }
7000 postfix_expression = (build_offset_ref_call_from_tree
7002 complain));
7004 /* A call to a static class member, or a namespace-scope
7005 function. */
7006 postfix_expression
7009 koenig_p,
7010 complain);
7011 else
7012 /* All other function calls. */
7013 postfix_expression
7016 koenig_p,
7017 complain);
7020 {
7022 start_loc,
7023 close_paren_loc);
7025 }
7027 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7031 }
7036 /* postfix-expression . template [opt] id-expression
7037 postfix-expression . pseudo-destructor-name
7038 postfix-expression -> template [opt] id-expression
7039 postfix-expression -> pseudo-destructor-name */
7041 /* Consume the `.' or `->' operator. */
7044 postfix_expression
7046 postfix_expression,
7053 /* postfix-expression ++ */
7054 /* Consume the `++' token. */
7056 /* Generate a representation for the complete expression. */
7057 postfix_expression
7059 POSTINCREMENT_EXPR);
7060 /* Increments may not appear in constant-expressions. */
7068 /* postfix-expression -- */
7069 /* Consume the `--' token. */
7071 /* Generate a representation for the complete expression. */
7072 postfix_expression
7074 POSTDECREMENT_EXPR);
7075 /* Decrements may not appear in constant-expressions. */
7086 return is_member_access
7087 ? postfix_expression
7089 else
7091 }
7092 }
7094 /* We should never get here. */
7097 }
7099 /* This function parses Cilk Plus array notations. If a normal array expr. is
7100 parsed then the array index is passed back to the caller through *INIT_INDEX
7101 and the function returns a NULL_TREE. If array notation expr. is parsed,
7102 then *INIT_INDEX is ignored by the caller and the function returns
7103 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7104 error_mark_node. */
7106 static tree
7108 tree array_value)
7109 {
7113 {
7116 }
7125 {
7128 }
7130 {
7131 /* Consume the ':'. */
7134 /* If we are here, then we have a case like this A[:]. */
7136 {
7140 }
7144 }
7145 else
7146 {
7147 /* If we are here, then there are three valid possibilities:
7148 1. ARRAY [ EXP ]
7149 2. ARRAY [ EXP : EXP ]
7150 3. ARRAY [ EXP : EXP : EXP ] */
7154 {
7155 /* This indicates that we have a normal array expression. */
7158 }
7160 /* Consume the ':'. */
7164 {
7167 }
7168 }
7173 {
7177 }
7183 }
7185 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7186 by cp_parser_builtin_offsetof. We're looking for
7188 postfix-expression [ expression ]
7189 postfix-expression [ braced-init-list ] (C++11)
7191 FOR_OFFSETOF is set if we're being called in that context, which
7192 changes how we deal with integer constant expressions. */
7194 static tree
7196 tree postfix_expression,
7199 {
7204 /* Consume the `[' token. */
7210 /* Parse the index expression. */
7211 /* ??? For offsetof, there is a question of what to allow here. If
7212 offsetof is not being used in an integral constant expression context,
7213 then we *could* get the right answer by computing the value at runtime.
7214 If we are in an integral constant expression context, then we might
7215 could accept any constant expression; hard to say without analysis.
7216 Rather than open the barn door too wide right away, allow only integer
7217 constant expressions here. */
7220 else
7221 {
7223 {
7230 {
7232 "braced list index is not allowed with array "
7236 }
7237 }
7239 {
7240 /* Here are have these two options:
7241 ARRAY[EXP : EXP] - Array notation expr with default
7242 stride of 1.
7243 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7244 stride. */
7246 postfix_expression);
7249 }
7250 else
7252 }
7256 /* Look for the closing `]'. */
7259 /* Build the ARRAY_REF. */
7263 /* When not doing offsetof, array references are not permitted in
7264 constant-expressions. */
7270 }
7272 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7273 by cp_parser_builtin_offsetof. We're looking for
7275 postfix-expression . template [opt] id-expression
7276 postfix-expression . pseudo-destructor-name
7277 postfix-expression -> template [opt] id-expression
7278 postfix-expression -> pseudo-destructor-name
7280 FOR_OFFSETOF is set if we're being called in that context. That sorta
7281 limits what of the above we'll actually accept, but nevermind.
7282 TOKEN_TYPE is the "." or "->" token, which will already have been
7283 removed from the stream. */
7285 static tree
7288 cp_expr postfix_expression,
7290 location_t location)
7291 {
7292 tree name;
7298 /* If this is a `->' operator, dereference the pointer. */
7301 tf_warning_or_error);
7302 /* Check to see whether or not the expression is type-dependent and
7303 not the current instantiation. */
7305 /* The identifier following the `->' or `.' is not qualified. */
7311 /* Enter the scope corresponding to the type of the object
7312 given by the POSTFIX_EXPRESSION. */
7314 {
7316 /* According to the standard, no expression should ever have
7317 reference type. Unfortunately, we do not currently match
7318 the standard in this respect in that our internal representation
7319 of an expression may have reference type even when the standard
7320 says it does not. Therefore, we have to manually obtain the
7321 underlying type here. */
7323 /* The type of the POSTFIX_EXPRESSION must be complete. */
7324 /* Unlike the object expression in other contexts, *this is not
7325 required to be of complete type for purposes of class member
7326 access (5.2.5) outside the member function body. */
7329 && !(processing_template_decl
7330 && current_class_type
7331 && (same_type_ignoring_top_level_qualifiers_p
7333 {
7336 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7338 {
7339 /* In a template, be permissive by treating an object expression
7340 of incomplete type as dependent (after a pedwarn). */
7341 diagnostic_t kind = (processing_template_decl
7342 ? DK_PEDWARN
7344 cxx_incomplete_type_diagnostic
7348 {
7351 }
7352 }
7353 }
7356 {
7357 /* Let the name lookup machinery know that we are processing a
7358 class member access expression. */
7360 /* If something went wrong, we want to be able to discern that case,
7361 as opposed to the case where there was no SCOPE due to the type
7362 of expression being dependent. */
7365 /* If the SCOPE was erroneous, make the various semantic analysis
7366 functions exit quickly -- and without issuing additional error
7367 messages. */
7370 }
7371 }
7374 /* Tell cp_parser_lookup_name that there was an object, even though it's
7375 type-dependent. */
7378 /* Assume this expression is not a pseudo-destructor access. */
7381 /* If the SCOPE is a scalar type, then, if this is a valid program,
7382 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7383 is type dependent, it can be pseudo-destructor-name or something else.
7384 Try to parse it as pseudo-destructor-name first. */
7386 {
7387 tree s;
7388 tree type;
7391 /* Parse the pseudo-destructor-name. */
7400 {
7402 postfix_expression
7405 }
7406 }
7409 {
7410 /* If the SCOPE is not a scalar type, we are looking at an
7411 ordinary class member access expression, rather than a
7412 pseudo-destructor-name. */
7415 /* Parse the id-expression. */
7416 name = (cp_parser_id_expression
7423 /* In general, build a SCOPE_REF if the member name is qualified.
7424 However, if the name was not dependent and has already been
7425 resolved; there is no need to build the SCOPE_REF. For example;
7427 struct X { void f(); };
7428 template <typename T> void f(T* t) { t->X::f(); }
7430 Even though "t" is dependent, "X::f" is not and has been resolved
7431 to a BASELINK; there is no need to include scope information. */
7433 /* But we do need to remember that there was an explicit scope for
7434 virtual function calls. */
7438 /* If the name is a template-id that names a type, we will get a
7439 TYPE_DECL here. That is invalid code. */
7441 {
7444 }
7445 else
7446 {
7448 {
7450 {
7454 }
7455 else
7458 name,
7459 template_p);
7463 }
7465 adjust_result_of_qualified_name_lookup
7467 postfix_expression
7469 template_p,
7470 tf_warning_or_error);
7471 /* Build a location e.g.:
7472 ptr->access_expr
7473 ~~~^~~~~~~~~~~~~
7474 where the caret is at the deref token, ranging from
7475 the start of postfix_expression to the end of the access expr. */
7476 location_t end_loc
7478 location_t combined_loc
7481 }
7482 }
7484 /* We no longer need to look up names in the scope of the object on
7485 the left-hand side of the `.' or `->' operator. */
7488 /* Outside of offsetof, these operators may not appear in
7489 constant-expressions. */
7491 && (cp_parser_non_integral_constant_expression
7496 }
7498 /* Parse a parenthesized expression-list.
7500 expression-list:
7501 assignment-expression
7502 expression-list, assignment-expression
7504 attribute-list:
7505 expression-list
7506 identifier
7507 identifier, expression-list
7509 CAST_P is true if this expression is the target of a cast.
7511 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7512 argument pack.
7514 Returns a vector of trees. Each element is a representation of an
7515 assignment-expression. NULL is returned if the ( and or ) are
7516 missing. An empty, but allocated, vector is returned on no
7517 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7518 if we are parsing an attribute list for an attribute that wants a
7519 plain identifier argument, normal_attr for an attribute that wants
7520 an expression, or non_attr if we aren't parsing an attribute list. If
7521 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7522 not all of the expressions in the list were constant.
7523 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7524 will be written to with the location of the closing parenthesis. If
7525 an error occurs, it may or may not be written to. */
7534 {
7540 /* Assume all the expressions will be constant. */
7549 /* Within a parenthesized expression, a `>' token is always
7550 the greater-than operator. */
7551 saved_greater_than_is_operator_p
7555 /* Consume expressions until there are no more. */
7558 {
7559 tree expr;
7561 /* At the beginning of attribute lists, check to see if the
7562 next token is an identifier. */
7565 {
7568 /* Consume the identifier. */
7570 /* Save the identifier. */
7572 }
7573 else
7574 {
7577 /* Parse the next assignment-expression. */
7579 {
7580 /* A braced-init-list. */
7586 }
7588 {
7589 expr = (cp_parser_constant_expression
7594 }
7595 else
7597 cast_p);
7602 /* If we have an ellipsis, then this is an expression
7603 expansion. */
7606 {
7607 /* Consume the `...'. */
7610 /* Build the argument pack. */
7612 }
7614 /* Add it to the list. We add error_mark_node
7615 expressions to the list, so that we can still tell if
7616 the correct form for a parenthesized expression-list
7617 is found. That gives better errors. */
7622 }
7624 /* After the first item, attribute lists look the same as
7625 expression lists. */
7628 get_comma:;
7629 /* If the next token isn't a `,', then we are done. */
7633 /* Otherwise, consume the `,' and keep going. */
7635 }
7641 {
7644 skip_comma:;
7645 /* We try and resync to an unnested comma, as that will give the
7646 user better diagnostics. */
7654 {
7655 parser->greater_than_is_operator_p
7658 }
7659 }
7661 parser->greater_than_is_operator_p
7668 }
7670 /* Parse a pseudo-destructor-name.
7672 pseudo-destructor-name:
7673 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7674 :: [opt] nested-name-specifier template template-id :: ~ type-name
7675 :: [opt] nested-name-specifier [opt] ~ type-name
7677 If either of the first two productions is used, sets *SCOPE to the
7678 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7679 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7680 or ERROR_MARK_NODE if the parse fails. */
7682 static void
7684 tree object,
7687 {
7690 /* Handle ~auto. */
7694 {
7697 "%<~auto%> only available with "
7704 }
7706 /* Assume that things will not work out. */
7709 /* Look for the optional `::' operator. */
7711 /* Look for the optional nested-name-specifier. */
7712 nested_name_specifier_p
7719 /* Now, if we saw a nested-name-specifier, we might be doing the
7720 second production. */
7723 {
7724 /* Consume the `template' keyword. */
7726 /* Parse the template-id. */
7730 class_type,
7732 /* Look for the `::' token. */
7734 }
7735 /* If the next token is not a `~', then there might be some
7736 additional qualification. */
7738 {
7739 /* At this point, we're looking for "type-name :: ~". The type-name
7740 must not be a class-name, since this is a pseudo-destructor. So,
7741 it must be either an enum-name, or a typedef-name -- both of which
7742 are just identifiers. So, we peek ahead to check that the "::"
7743 and "~" tokens are present; if they are not, then we can avoid
7744 calling type_name. */
7748 {
7751 }
7753 /* Look for the type-name. */
7758 /* Look for the `::' token. */
7760 }
7761 else
7764 /* Look for the `~'. */
7767 /* Once we see the ~, this has to be a pseudo-destructor. */
7771 /* Look for the type-name again. We are not responsible for
7772 checking that it matches the first type-name. */
7774 }
7776 /* Parse a unary-expression.
7778 unary-expression:
7779 postfix-expression
7780 ++ cast-expression
7781 -- cast-expression
7782 unary-operator cast-expression
7783 sizeof unary-expression
7784 sizeof ( type-id )
7785 alignof ( type-id ) [C++0x]
7786 new-expression
7787 delete-expression
7789 GNU Extensions:
7791 unary-expression:
7792 __extension__ cast-expression
7793 __alignof__ unary-expression
7794 __alignof__ ( type-id )
7795 alignof unary-expression [C++0x]
7796 __real__ cast-expression
7797 __imag__ cast-expression
7798 && identifier
7799 sizeof ( type-id ) { initializer-list , [opt] }
7800 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7801 __alignof__ ( type-id ) { initializer-list , [opt] }
7803 ADDRESS_P is true iff the unary-expression is appearing as the
7804 operand of the `&' operator. CAST_P is true if this expression is
7805 the target of a cast.
7807 Returns a representation of the expression. */
7809 static cp_expr
7812 {
7816 /* Peek at the next token. */
7818 /* Some keywords give away the kind of expression. */
7820 {
7824 {
7827 {
7830 location_t first_loc;
7833 /* Consume the token. */
7836 /* Parse the operand. */
7841 else
7842 {
7843 /* ISO C++ defines alignof only with types, not with
7844 expressions. So pedwarn if alignof is used with a non-
7845 type expression. However, __alignof__ is ok. */
7848 "ISO C++ does not allow %<alignof%> "
7852 }
7853 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7854 SIZEOF_EXPR with the original operand. */
7856 {
7858 {
7860 {
7863 error_mark_node));
7865 }
7866 else
7870 }
7872 }
7874 }
7883 {
7884 /* The saved value of the PEDANTIC flag. */
7886 tree expr;
7888 /* Save away the PEDANTIC flag. */
7890 /* Parse the cast-expression. */
7892 /* Restore the PEDANTIC flag. */
7896 }
7900 {
7901 tree expression;
7903 /* Consume the `__real__' or `__imag__' token. */
7905 /* Parse the cast-expression. */
7907 /* Create the complete representation. */
7911 expression,
7912 tf_warning_or_error);
7913 }
7921 {
7922 tree expr;
7932 parser->type_definition_forbidden_message
7935 saved_integral_constant_expression_p
7937 saved_non_integral_constant_expression_p
7941 saved_greater_than_is_operator_p
7953 parser->greater_than_is_operator_p
7956 parser->integral_constant_expression_p
7958 parser->non_integral_constant_expression_p
7965 }
7969 }
7970 }
7972 /* Look for the `:: new' and `:: delete', which also signal the
7973 beginning of a new-expression, or delete-expression,
7974 respectively. If the next token is `::', then it might be one of
7975 these. */
7977 {
7980 /* See if the token after the `::' is one of the keywords in
7981 which we're interested. */
7983 /* If it's `new', we have a new-expression. */
7986 /* Similarly, for `delete'. */
7989 }
7991 /* Look for a unary operator. */
7993 /* The `++' and `--' operators can be handled similarly, even though
7994 they are not technically unary-operators in the grammar. */
7996 {
8001 /* Handle the GNU address-of-label extension. */
8004 {
8005 tree identifier;
8006 tree expression;
8009 /* Consume the '&&' token. */
8011 /* Look for the identifier. */
8012 location_t finish_loc
8015 /* Construct a location of the form:
8016 &&label
8017 ^~~~~~~
8018 with caret==start at the "&&", finish at the end of the label. */
8019 location_t combined_loc
8021 /* Create an expression representing the address. */
8024 NIC_ADDR_LABEL))
8027 }
8028 }
8030 {
8031 cp_expr cast_expression;
8037 /* Consume the operator token. */
8041 /* Parse the cast-expression. */
8042 cast_expression
8047 pidk);
8049 /* Make a location:
8050 OP_TOKEN CAST_EXPRESSION
8051 ^~~~~~~~~~~~~~~~~~~~~~~~~
8052 with start==caret at the operator token, and
8053 extending to the end of the cast_expression. */
8056 /* Now, build an appropriate representation. */
8058 {
8062 RO_UNARY_STAR,
8063 complain);
8064 /* TODO: build_x_indirect_ref does not always honor the
8065 location, so ensure it is set. */
8071 /* Fall through. */
8074 cast_expression,
8075 complain);
8076 /* TODO: build_x_unary_op does not always honor the location,
8077 so ensure it is set. */
8085 /* Fall through. */
8087 /* Immediately fold negation of a constant, unless the constant is 0
8088 (since -0 == 0) or it would overflow. */
8093 {
8096 cast_expression);
8098 {
8101 }
8102 }
8103 /* Fall through. */
8112 }
8116 non_constant_p))
8120 }
8124 decltype_p,
8125 pidk);
8126 }
8128 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8129 unary-operator, the corresponding tree code is returned. */
8131 static enum tree_code
8133 {
8135 {
8156 }
8157 }
8159 /* Parse a new-expression.
8161 new-expression:
8162 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8163 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8165 Returns a representation of the expression. */
8167 static tree
8169 {
8172 tree type;
8175 tree ret;
8179 /* Look for the optional `::' operator. */
8180 global_scope_p
8184 /* Look for the `new' operator. */
8186 /* There's no easy way to tell a new-placement from the
8187 `( type-id )' construct. */
8189 /* Look for a new-placement. */
8191 /* If that didn't work out, there's no new-placement. */
8193 {
8197 }
8199 /* If the next token is a `(', then we have a parenthesized
8200 type-id. */
8202 {
8206 /* Consume the `('. */
8209 /* Parse the type-id. */
8210 parser->type_definition_forbidden_message
8212 {
8215 }
8218 /* Look for the closing `)'. */
8221 /* There should not be a direct-new-declarator in this production,
8222 but GCC used to allowed this, so we check and emit a sensible error
8223 message for this case. */
8225 {
8231 }
8232 }
8233 /* Otherwise, there must be a new-type-id. */
8234 else
8237 /* If the next token is a `(' or '{', then we have a new-initializer. */
8242 else
8245 /* A new-expression may not appear in an integral constant
8246 expression. */
8249 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8250 of a new-type-id or type-id of a new-expression, the new-expression shall
8251 contain a new-initializer of the form ( assignment-expression )".
8252 Additionally, consistently with the spirit of DR 1467, we want to accept
8253 'new auto { 2 }' too. */
8258 {
8260 "initialization of new-expression for type %<auto%> "
8263 }
8264 else
8265 {
8266 /* Construct a location e.g.:
8267 ptr = new int[100]
8268 ^~~~~~~~~~~~
8269 with caret == start at the start of the "new" token, and the end
8270 at the end of the final token we consumed. */
8275 /* Create a representation of the new-expression. */
8277 tf_warning_or_error);
8279 }
8287 }
8289 /* Parse a new-placement.
8291 new-placement:
8292 ( expression-list )
8294 Returns the same representation as for an expression-list. */
8298 {
8301 /* Parse the expression-list. */
8302 expression_list = (cp_parser_parenthesized_expression_list
8311 }
8313 /* Parse a new-type-id.
8315 new-type-id:
8316 type-specifier-seq new-declarator [opt]
8318 Returns the TYPE allocated. If the new-type-id indicates an array
8319 type, *NELTS is set to the number of elements in the last array
8320 bound; the TYPE will not include the last array bound. */
8322 static tree
8324 {
8325 cp_decl_specifier_seq type_specifier_seq;
8331 /* The type-specifier sequence must not contain type definitions.
8332 (It cannot contain declarations of new types either, but if they
8333 are not definitions we will catch that because they are not
8334 complete.) */
8336 parser->type_definition_forbidden_message
8338 /* Parse the type-specifier-seq. */
8342 /* Restore the old message. */
8348 /* Parse the new-declarator. */
8351 /* Determine the number of elements in the last array dimension, if
8352 any. */
8354 /* Skip down to the last array dimension. */
8359 {
8362 }
8367 {
8370 }
8373 {
8380 else
8382 }
8385 }
8387 /* Parse an (optional) new-declarator.
8389 new-declarator:
8390 ptr-operator new-declarator [opt]
8391 direct-new-declarator
8393 Returns the declarator. */
8397 {
8400 cp_cv_quals cv_quals;
8402 /* We don't know if there's a ptr-operator next, or not. */
8404 /* Look for a ptr-operator. */
8406 /* If that worked, look for more new-declarators. */
8408 {
8411 /* Parse another optional declarator. */
8414 declarator = cp_parser_make_indirect_declarator
8418 }
8420 /* If the next token is a `[', there is a direct-new-declarator. */
8425 }
8427 /* Parse a direct-new-declarator.
8429 direct-new-declarator:
8430 [ expression ]
8431 direct-new-declarator [constant-expression]
8433 */
8437 {
8441 {
8442 tree expression;
8445 /* Look for the opening `['. */
8450 /* The standard requires that the expression have integral
8451 type. DR 74 adds enumeration types. We believe that the
8452 real intent is that these expressions be handled like the
8453 expression in a `switch' condition, which also allows
8454 classes with a single conversion to integral or
8455 enumeration type. */
8457 {
8458 expression
8460 expression,
8463 {
8465 "expression in new-declarator must have integral "
8468 }
8469 }
8471 /* Look for the closing `]'. */
8474 /* Add this bound to the declarator. */
8477 /* If the next token is not a `[', then there are no more
8478 bounds. */
8481 }
8484 }
8486 /* Parse a new-initializer.
8488 new-initializer:
8489 ( expression-list [opt] )
8490 braced-init-list
8492 Returns a representation of the expression-list. */
8496 {
8500 {
8501 tree t;
8508 }
8509 else
8510 expression_list = (cp_parser_parenthesized_expression_list
8516 }
8518 /* Parse a delete-expression.
8520 delete-expression:
8521 :: [opt] delete cast-expression
8522 :: [opt] delete [ ] cast-expression
8524 Returns a representation of the expression. */
8526 static tree
8528 {
8531 tree expression;
8533 /* Look for the optional `::' operator. */
8534 global_scope_p
8538 /* Look for the `delete' keyword. */
8540 /* See if the array syntax is in use. */
8542 {
8543 /* Consume the `[' token. */
8545 /* Look for the `]' token. */
8547 /* Remember that this is the `[]' construct. */
8549 }
8550 else
8553 /* Parse the cast-expression. */
8556 /* A delete-expression may not appear in an integral constant
8557 expression. */
8562 tf_warning_or_error);
8563 }
8565 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8566 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8567 0 otherwise. */
8569 static int
8571 {
8574 {
8616 /* In ((type ()) () the last () isn't a valid cast-expression,
8617 so the whole must be parsed as postfix-expression. */
8622 /* '[' may start a primary-expression in obj-c++ and in C++11,
8623 as a lambda-expression, eg, '(void)[]{}'. */
8630 /* '++' and '--' may or may not start a cast-expression:
8632 struct T { void operator++(int); };
8633 void f() { (T())++; }
8635 vs
8637 int a;
8638 (int)++a; */
8643 }
8644 }
8646 /* Parse a cast-expression.
8648 cast-expression:
8649 unary-expression
8650 ( type-id ) cast-expression
8652 ADDRESS_P is true iff the unary-expression is appearing as the
8653 operand of the `&' operator. CAST_P is true if this expression is
8654 the target of a cast.
8656 Returns a representation of the expression. */
8658 static cp_expr
8661 {
8662 /* If it's a `(', then we might be looking at a cast. */
8664 {
8670 /* There's no way to know yet whether or not this is a cast.
8671 For example, `(int (3))' is a unary-expression, while `(int)
8672 3' is a cast. So, we resort to parsing tentatively. */
8674 /* Types may not be defined in a cast. */
8676 parser->type_definition_forbidden_message
8678 /* Consume the `('. */
8682 /* A very tricky bit is that `(struct S) { 3 }' is a
8683 compound-literal (which we permit in C++ as an extension).
8684 But, that construct is not a cast-expression -- it is a
8685 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8686 is legal; if the compound-literal were a cast-expression,
8687 you'd need an extra set of parentheses.) But, if we parse
8688 the type-id, and it happens to be a class-specifier, then we
8689 will commit to the parse at that point, because we cannot
8690 undo the action that is done when creating a new class. So,
8691 then we cannot back up and do a postfix-expression.
8693 Another tricky case is the following (c++/29234):
8695 struct S { void operator () (); };
8697 void foo ()
8698 {
8699 ( S()() );
8700 }
8702 As a type-id we parse the parenthesized S()() as a function
8703 returning a function, groktypename complains and we cannot
8704 back up in this case either.
8706 Therefore, we scan ahead to the closing `)', and check to see
8707 if the tokens after the `)' can start a cast-expression. Otherwise
8708 we are dealing with an unary-expression, a postfix-expression
8709 or something else.
8711 Yet another tricky case, in C++11, is the following (c++/54891):
8713 (void)[]{};
8715 The issue is that usually, besides the case of lambda-expressions,
8716 the parenthesized type-id cannot be followed by '[', and, eg, we
8717 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8718 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8719 we don't commit, we try a cast-expression, then an unary-expression.
8721 Save tokens so that we can put them back. */
8724 /* We may be looking at a cast-expression. */
8727 cast_expression
8730 /* Roll back the tokens we skipped. */
8732 /* If we aren't looking at a cast-expression, simulate an error so
8733 that the call to cp_parser_error_occurred below returns true. */
8736 else
8737 {
8740 /* Look for the type-id. */
8742 /* Look for the closing `)'. */
8745 }
8747 /* Restore the saved message. */
8750 /* At this point this can only be either a cast or a
8751 parenthesized ctor such as `(T ())' that looks like a cast to
8752 function returning T. */
8754 {
8755 /* Only commit if the cast-expression doesn't start with
8756 '++', '--', or '[' in C++11. */
8764 pidk);
8767 {
8768 /* Warn about old-style casts, if so requested. */
8775 /* Only type conversions to integral or enumeration types
8776 can be used in constant-expressions. */
8779 NIC_CAST))
8782 /* Perform the cast. */
8783 /* Make a location:
8784 (TYPE) EXPR
8785 ^~~~~~~~~~~
8786 with start==caret at the open paren, extending to the
8787 end of "expr". */
8789 open_paren_loc,
8793 }
8794 }
8795 else
8797 }
8799 /* If we get here, then it's not a cast, so it must be a
8800 unary-expression. */
8803 }
8805 /* Parse a binary expression of the general form:
8807 pm-expression:
8808 cast-expression
8809 pm-expression .* cast-expression
8810 pm-expression ->* cast-expression
8812 multiplicative-expression:
8813 pm-expression
8814 multiplicative-expression * pm-expression
8815 multiplicative-expression / pm-expression
8816 multiplicative-expression % pm-expression
8818 additive-expression:
8819 multiplicative-expression
8820 additive-expression + multiplicative-expression
8821 additive-expression - multiplicative-expression
8823 shift-expression:
8824 additive-expression
8825 shift-expression << additive-expression
8826 shift-expression >> additive-expression
8828 relational-expression:
8829 shift-expression
8830 relational-expression < shift-expression
8831 relational-expression > shift-expression
8832 relational-expression <= shift-expression
8833 relational-expression >= shift-expression
8835 GNU Extension:
8837 relational-expression:
8838 relational-expression <? shift-expression
8839 relational-expression >? shift-expression
8841 equality-expression:
8842 relational-expression
8843 equality-expression == relational-expression
8844 equality-expression != relational-expression
8846 and-expression:
8847 equality-expression
8848 and-expression & equality-expression
8850 exclusive-or-expression:
8851 and-expression
8852 exclusive-or-expression ^ and-expression
8854 inclusive-or-expression:
8855 exclusive-or-expression
8856 inclusive-or-expression | exclusive-or-expression
8858 logical-and-expression:
8859 inclusive-or-expression
8860 logical-and-expression && inclusive-or-expression
8862 logical-or-expression:
8863 logical-and-expression
8864 logical-or-expression || logical-and-expression
8866 All these are implemented with a single function like:
8868 binary-expression:
8869 simple-cast-expression
8870 binary-expression <token> binary-expression
8872 CAST_P is true if this expression is the target of a cast.
8874 The binops_by_token map is used to get the tree codes for each <token> type.
8875 binary-expressions are associated according to a precedence table. */
8877 #define TOKEN_PRECEDENCE(token) \
8878 (((token->type == CPP_GREATER \
8879 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8880 && !parser->greater_than_is_operator_p) \
8881 ? PREC_NOT_OPERATOR \
8882 : binops_by_token[token->type].prec)
8884 static cp_expr
8890 {
8891 cp_parser_expression_stack stack;
8893 cp_parser_expression_stack_entry current;
8894 cp_expr rhs;
8898 tree overload;
8900 /* Parse the first expression. */
8911 {
8912 /* Get an operator token. */
8918 {
8920 "%<>>%> operator is treated"
8924 }
8929 /* This is a fold-expression; handle it later. */
8932 /* Popping an entry off the stack means we completed a subexpression:
8933 - either we found a token which is not an operator (`>' where it is not
8934 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8935 will happen repeatedly;
8936 - or, we found an operator which has lower priority. This is the case
8937 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8938 parsing `3 * 4'. */
8940 {
8943 else
8945 }
8947 get_rhs:
8951 /* We used the operator token. */
8954 /* For "false && x" or "true || x", x will never be executed;
8955 disable warnings while evaluating it. */
8957 c_inhibit_evaluation_warnings +=
8960 c_inhibit_evaluation_warnings +=
8963 /* Extract another operand. It may be the RHS of this expression
8964 or the LHS of a new, higher priority expression. */
8969 /* Get another operator token. Look up its precedence to avoid
8970 building a useless (immediately popped) stack entry for common
8971 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8978 {
8979 /* ... and prepare to parse the RHS of the new, higher priority
8980 expression. Since precedence levels on the stack are
8981 monotonically increasing, we do not have to care about
8982 stack overflows. */
8991 pop:
8993 /* If the stack is not empty, we have parsed into LHS the right side
8994 (`4' in the example above) of an expression we had suspended.
8995 We can use the information on the stack to recover the LHS (`3')
8996 from the stack together with the tree code (`MULT_EXPR'), and
8997 the precedence of the higher level subexpression
8998 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8999 which will be used to actually build the additive expression. */
9004 }
9006 /* Undo the disabling of warnings done above. */
9008 c_inhibit_evaluation_warnings -=
9011 c_inhibit_evaluation_warnings -=
9017 /* Avoid warning for !!x == y. */
9022 /* Avoid warning for !b == y where b is boolean. */
9026 /* Avoid warning for !!b == y where b is boolean. */
9039 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9040 ERROR_MARK for everything that is not a binary expression.
9041 This makes warn_about_parentheses miss some warnings that
9042 involve unary operators. For unary expressions we should
9043 pass the correct tree_code unless the unary expression was
9044 surrounded by parentheses.
9045 */
9052 == tcc_comparison
9055 else
9056 {
9061 /* TODO: build_x_binary_op doesn't always honor the location. */
9063 }
9066 /* If the binary operator required the use of an overloaded operator,
9067 then this expression cannot be an integral constant-expression.
9068 An overloaded operator can be used even if both operands are
9069 otherwise permissible in an integral constant-expression if at
9070 least one of the operands is of enumeration type. */
9074 NIC_OVERLOADED))
9076 }
9079 }
9081 static cp_expr
9086 {
9089 }
9091 /* Parse the `? expression : assignment-expression' part of a
9092 conditional-expression. The LOGICAL_OR_EXPR is the
9093 logical-or-expression that started the conditional-expression.
9094 Returns a representation of the entire conditional-expression.
9096 This routine is used by cp_parser_assignment_expression.
9098 ? expression : assignment-expression
9100 GNU Extensions:
9102 ? : assignment-expression */
9104 static tree
9106 {
9108 cp_expr assignment_expr;
9112 /* Consume the `?' token. */
9117 {
9120 /* Implicit true clause. */
9122 c_inhibit_evaluation_warnings +=
9125 }
9126 else
9127 {
9130 /* Parse the expression. */
9131 c_inhibit_evaluation_warnings +=
9134 c_inhibit_evaluation_warnings +=
9138 }
9140 /* The next token should be a `:'. */
9142 /* Parse the assignment-expression. */
9144 c_inhibit_evaluation_warnings -=
9147 /* Make a location:
9148 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9149 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9150 with the caret at the "?", ranging from the start of
9151 the logical_or_expr to the end of the assignment_expr. */
9156 /* Build the conditional-expression. */
9158 expr,
9159 assignment_expr,
9160 tf_warning_or_error);
9161 }
9163 /* Parse an assignment-expression.
9165 assignment-expression:
9166 conditional-expression
9167 logical-or-expression assignment-operator assignment_expression
9168 throw-expression
9170 CAST_P is true if this expression is the target of a cast.
9171 DECLTYPE_P is true if this expression is the operand of decltype.
9173 Returns a representation for the expression. */
9175 static cp_expr
9178 {
9179 cp_expr expr;
9181 /* If the next token is the `throw' keyword, then we're looking at
9182 a throw-expression. */
9185 /* Otherwise, it must be that we are looking at a
9186 logical-or-expression. */
9187 else
9188 {
9189 /* Parse the binary expressions (logical-or-expression). */
9191 decltype_p,
9193 /* If the next token is a `?' then we're actually looking at a
9194 conditional-expression. */
9197 else
9198 {
9201 /* If it's an assignment-operator, we're using the second
9202 production. */
9203 enum tree_code assignment_operator
9206 {
9209 /* Parse the right-hand side of the assignment. */
9216 /* An assignment may not appear in a
9217 constant-expression. */
9219 NIC_ASSIGNMENT))
9221 /* Build the assignment expression. Its default
9222 location:
9223 LHS = RHS
9224 ~~~~^~~~~
9225 is the location of the '=' token as the
9226 caret, ranging from the start of the lhs to the
9227 end of the rhs. */
9232 assignment_operator,
9233 rhs,
9235 /* TODO: build_x_modify_expr doesn't honor the location,
9236 so we must set it here. */
9238 }
9239 }
9240 }
9243 }
9245 /* Parse an (optional) assignment-operator.
9247 assignment-operator: one of
9248 = *= /= %= += -= >>= <<= &= ^= |=
9250 GNU Extension:
9252 assignment-operator: one of
9253 <?= >?=
9255 If the next token is an assignment operator, the corresponding tree
9256 code is returned, and the token is consumed. For example, for
9257 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9258 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9259 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9260 operator, ERROR_MARK is returned. */
9262 static enum tree_code
9264 {
9268 /* Peek at the next token. */
9272 {
9318 /* Nothing else is an assignment operator. */
9320 }
9322 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9327 /* If it was an assignment operator, consume it. */
9332 }
9334 /* Parse an expression.
9336 expression:
9337 assignment-expression
9338 expression , assignment-expression
9340 CAST_P is true if this expression is the target of a cast.
9341 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9342 except possibly parenthesized or on the RHS of a comma (N3276).
9344 Returns a representation of the expression. */
9346 static cp_expr
9349 {
9354 {
9355 cp_expr assignment_expression;
9357 /* Parse the next assignment-expression. */
9358 assignment_expression
9361 /* We don't create a temporary for a call that is the immediate operand
9362 of decltype or on the RHS of a comma. But when we see a comma, we
9363 need to create a temporary for a call on the LHS. */
9368 assignment_expression
9372 /* If this is the first assignment-expression, we can just
9373 save it away. */
9376 else
9377 {
9378 /* Create a location with caret at the comma, ranging
9379 from the start of the LHS to the end of the RHS. */
9384 assignment_expression,
9387 }
9388 /* If the next token is not a comma, or we're in a fold-expression, then
9389 we are done with the expression. */
9393 /* Consume the `,'. */
9396 /* A comma operator cannot appear in a constant-expression. */
9399 }
9402 }
9404 /* Parse a constant-expression.
9406 constant-expression:
9407 conditional-expression
9409 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9410 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9411 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9412 is false, NON_CONSTANT_P should be NULL. */
9414 static cp_expr
9418 {
9422 cp_expr expression;
9424 /* It might seem that we could simply parse the
9425 conditional-expression, and then check to see if it were
9426 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9427 one that the compiler can figure out is constant, possibly after
9428 doing some simplifications or optimizations. The standard has a
9429 precise definition of constant-expression, and we must honor
9430 that, even though it is somewhat more restrictive.
9432 For example:
9434 int i[(2, 3)];
9436 is not a legal declaration, because `(2, 3)' is not a
9437 constant-expression. The `,' operator is forbidden in a
9438 constant-expression. However, GCC's constant-folding machinery
9439 will fold this operation to an INTEGER_CST for `3'. */
9441 /* Save the old settings. */
9443 saved_allow_non_integral_constant_expression_p
9446 /* We are now parsing a constant-expression. */
9448 parser->allow_non_integral_constant_expression_p
9451 /* Although the grammar says "conditional-expression", we parse an
9452 "assignment-expression", which also permits "throw-expression"
9453 and the use of assignment operators. In the case that
9454 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9455 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9456 actually essential that we look for an assignment-expression.
9457 For example, cp_parser_initializer_clauses uses this function to
9458 determine whether a particular assignment-expression is in fact
9459 constant. */
9461 /* Restore the old settings. */
9462 parser->integral_constant_expression_p
9464 parser->allow_non_integral_constant_expression_p
9467 {
9468 /* Require an rvalue constant expression here; that's what our
9469 callers expect. Reference constant expressions are handled
9470 separately in e.g. cp_parser_template_argument. */
9475 }
9478 parser->non_integral_constant_expression_p
9482 }
9484 /* Parse __builtin_offsetof.
9486 offsetof-expression:
9487 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9489 offsetof-member-designator:
9490 id-expression
9491 | offsetof-member-designator "." id-expression
9492 | offsetof-member-designator "[" expression "]"
9493 | offsetof-member-designator "->" id-expression */
9495 static cp_expr
9497 {
9499 tree type;
9500 cp_expr expr;
9501 cp_id_kind dummy;
9503 location_t finish_loc;
9505 /* We're about to accept non-integral-constant things, but will
9506 definitely yield an integral constant expression. Save and
9507 restore these values around our local parsing. */
9513 /* Consume the "__builtin_offsetof" token. */
9515 /* Consume the opening `('. */
9517 /* Parse the type-id. */
9520 /* Look for the `,'. */
9524 /* Build the (type *)null that begins the traditional offsetof macro. */
9525 tree object_ptr
9527 tf_warning_or_error);
9529 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9533 {
9536 {
9538 /* offsetof-member-designator "[" expression "]" */
9544 /* offsetof-member-designator "->" identifier */
9547 /* FALLTHRU */
9550 /* offsetof-member-designator "." identifier */
9558 /* Consume the ")" token. */
9564 /* Error. We know the following require will fail, but
9565 that gives the proper error message. */
9570 }
9571 }
9573 success:
9574 /* Make a location of the form:
9575 __builtin_offsetof (struct s, f)
9576 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9577 with caret at the type-id, ranging from the start of the
9578 "_builtin_offsetof" token to the close paren. */
9580 /* The result will be an INTEGER_CST, so we need to explicitly
9581 preserve the location. */
9584 failure:
9589 }
9591 /* Parse a trait expression.
9593 Returns a representation of the expression, the underlying type
9594 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9596 static tree
9598 {
9599 cp_trait_kind kind;
9605 {
9696 }
9698 /* Consume the token. */
9703 {
9706 }
9712 {
9715 {
9718 }
9722 }
9724 {
9726 {
9730 {
9733 }
9737 }
9738 }
9742 /* Complete the trait expression, which may mean either processing
9743 the trait expr now or saving it for template instantiation. */
9745 {
9754 }
9755 }
9757 /* Lambdas that appear in variable initializer or default argument scope
9758 get that in their mangling, so we need to record it. We might as well
9759 use the count for function and namespace scopes as well. */
9763 {
9764 tree t;
9766 };
9769 static void
9771 {
9772 tree_int ti;
9774 /* Once we're inside a function, we ignore other scopes and just push
9775 the function again so that popping works properly. */
9782 {
9783 /* Don't reset the count if we're still in the same function. */
9786 }
9787 }
9789 static void
9791 {
9794 }
9796 static void
9798 {
9801 {
9804 }
9806 }
9808 /* Parse a lambda expression.
9810 lambda-expression:
9811 lambda-introducer lambda-declarator [opt] compound-statement
9813 Returns a representation of the expression. */
9815 static cp_expr
9817 {
9819 tree type;
9827 {
9829 {
9833 }
9835 }
9837 {
9839 {
9842 }
9844 }
9846 /* We may be in the middle of deferred access check. Disable
9847 it now. */
9858 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9861 /* Now that we've started the type, add the capture fields for any
9862 explicit captures. */
9865 {
9866 /* Inside the class, surrounding template-parameter-lists do not apply. */
9867 unsigned int saved_num_template_parameter_lists
9871 bool fully_implicit_function_template_p
9875 bool auto_is_implicit_function_template_parm_p
9886 /* By virtue of defining a local class, a lambda expression has access to
9887 the private variables of enclosing classes. */
9895 {
9900 }
9902 {
9905 }
9907 /* The capture list was built up in reverse order; fix that now. */
9919 parser->fully_implicit_function_template_p
9923 parser->auto_is_implicit_function_template_parm_p
9925 }
9927 /* This field is only used during parsing of the lambda. */
9930 /* This lambda shouldn't have any proxies left at this point. */
9932 /* And now that we're done, push proxies for an enclosing lambda. */
9937 else
9945 }
9947 /* Parse the beginning of a lambda expression.
9949 lambda-introducer:
9950 [ lambda-capture [opt] ]
9952 LAMBDA_EXPR is the current representation of the lambda expression. */
9954 static void
9956 {
9957 /* Need commas after the first capture. */
9960 /* Eat the leading `['. */
9963 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9971 {
9974 }
9977 {
9979 tree capture_id;
9980 tree capture_init_expr;
9984 enum capture_kind_type
9985 {
9986 BY_COPY,
9987 BY_REFERENCE
9988 };
9992 {
9995 }
9999 else
10002 /* Possibly capture `this'. */
10004 {
10014 explicit_init_p);
10016 }
10018 /* Possibly capture `*this'. */
10021 {
10032 explicit_init_p);
10034 }
10036 /* Remember whether we want to capture as a reference or not. */
10038 {
10041 }
10043 /* Get the identifier. */
10048 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10049 delimiters, but I modified this to stop on unnested ']' as well. It
10050 was already changed to stop on unnested '}', so the
10051 "closing_parenthesis" name is no more misleading with my change. */
10052 {
10058 }
10060 /* Find the initializer for this capture. */
10064 {
10066 /* An explicit initializer exists. */
10069 "lambda capture initializers "
10075 {
10078 }
10079 }
10080 else
10081 {
10084 /* Turn the identifier into an id-expression. */
10085 capture_init_expr
10090 {
10093 }
10097 {
10100 capture_init_expr);
10104 }
10107 {
10110 capture_init_expr))
10114 }
10116 capture_init_expr
10117 = finish_id_expression
10119 capture_init_expr,
10133 {
10136 }
10137 else
10139 }
10143 {
10148 capture_id);
10152 "capture of %qD redundant with by-reference capture "
10154 }
10157 capture_id,
10158 capture_init_expr,
10160 explicit_init_p);
10161 }
10164 }
10166 /* Parse the (optional) middle of a lambda expression.
10168 lambda-declarator:
10169 < template-parameter-list [opt] >
10170 ( parameter-declaration-clause [opt] )
10171 attribute-specifier [opt]
10172 decl-specifier-seq [opt]
10173 exception-specification [opt]
10174 lambda-return-type-clause [opt]
10176 LAMBDA_EXPR is the current representation of the lambda expression. */
10178 static bool
10180 {
10181 /* 5.1.1.4 of the standard says:
10182 If a lambda-expression does not include a lambda-declarator, it is as if
10183 the lambda-declarator were ().
10184 This means an empty parameter list, no attributes, and no exception
10185 specification. */
10191 cp_decl_specifier_seq lambda_specs;
10194 /* The template-parameter-list is optional, but must begin with
10195 an opening angle if present. */
10197 {
10200 "lambda templates are only available with "
10202 else
10212 /* We just processed one more parameter list. */
10214 }
10216 /* The parameter-declaration-clause is optional (unless
10217 template-parameter-list was given), but must begin with an
10218 opening parenthesis if present. */
10220 {
10225 /* Parse parameters. */
10228 /* Default arguments shall not be specified in the
10229 parameter-declaration-clause of a lambda-declarator. */
10240 /* In the decl-specifier-seq of the lambda-declarator, each
10241 decl-specifier shall either be mutable or constexpr. */
10245 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10248 {
10253 }
10257 /* Parse optional exception specification. */
10260 /* Parse optional trailing return type. */
10262 {
10266 }
10268 /* The function parameters must be in scope all the way until after the
10269 trailing-return-type in case of decltype. */
10271 }
10275 /* Create the function call operator.
10277 Messing with declarators like this is no uglier than building up the
10278 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10279 other code. */
10280 {
10281 cp_decl_specifier_seq return_type_specs;
10283 tree fco;
10290 else
10291 /* Maybe we will deduce the return type later. */
10295 {
10299 else
10302 }
10307 sfk_none);
10312 VIRT_SPEC_UNSPECIFIED,
10313 REF_QUAL_NONE,
10314 tx_qual,
10315 exception_spec,
10321 declarator,
10322 attributes);
10324 {
10327 /* Give the object parameter a different name. */
10331 }
10333 {
10337 }
10346 }
10347 }
10349 /* Parse the body of a lambda expression, which is simply
10351 compound-statement
10353 but which requires special handling.
10354 LAMBDA_EXPR is the current representation of the lambda expression. */
10356 static void
10358 {
10363 else
10364 /* Still increment function_depth so that we don't GC in the
10365 middle of an expression. */
10369 /* Clear this in case we're in the middle of a default argument. */
10372 /* Finish the function call operator
10373 - class_specifier
10374 + late_parsing_for_member
10375 + function_definition_after_declarator
10376 + ctor_initializer_opt_and_function_body */
10377 {
10379 tree body;
10381 tree compound_stmt;
10382 tree cap;
10384 /* Let the front end know that we are going to be defining this
10385 function. */
10387 NULL_TREE,
10396 /* Push the proxies for any explicit captures. */
10403 /* 5.1.1.4 of the standard says:
10404 If a lambda-expression does not include a trailing-return-type, it
10405 is as if the trailing-return-type denotes the following type:
10406 * if the compound-statement is of the form
10407 { return attribute-specifier [opt] expression ; }
10408 the type of the returned expression after lvalue-to-rvalue
10409 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10410 (_conv.array_ 4.2), and function-to-pointer conversion
10411 (_conv.func_ 4.3);
10412 * otherwise, void. */
10414 /* In a lambda that has neither a lambda-return-type-clause
10415 nor a deducible form, errors should be reported for return statements
10416 in the body. Since we used void as the placeholder return type, parsing
10417 the body as usual will give such desired behavior. */
10421 {
10425 /* Parse tentatively in case there's more after the initial return
10426 statement. */
10437 {
10439 {
10444 }
10446 /* Will get error here if type not deduced yet. */
10450 }
10451 }
10454 {
10459 }
10463 out:
10467 /* Finish the function and generate code for it if necessary. */
10470 /* Only expand if the call op is not a template. */
10473 }
10479 else
10481 }
10483 /* Statements [gram.stmt.stmt] */
10485 /* Parse a statement.
10487 statement:
10488 labeled-statement
10489 expression-statement
10490 compound-statement
10491 selection-statement
10492 iteration-statement
10493 jump-statement
10494 declaration-statement
10495 try-block
10497 C++11:
10499 statement:
10500 labeled-statement
10501 attribute-specifier-seq (opt) expression-statement
10502 attribute-specifier-seq (opt) compound-statement
10503 attribute-specifier-seq (opt) selection-statement
10504 attribute-specifier-seq (opt) iteration-statement
10505 attribute-specifier-seq (opt) jump-statement
10506 declaration-statement
10507 attribute-specifier-seq (opt) try-block
10509 init-statement:
10510 expression-statement
10511 simple-declaration
10513 TM Extension:
10515 statement:
10516 atomic-statement
10518 IN_COMPOUND is true when the statement is nested inside a
10519 cp_parser_compound_statement; this matters for certain pragmas.
10521 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10522 is a (possibly labeled) if statement which is not enclosed in braces
10523 and has an else clause. This is used to implement -Wparentheses.
10525 CHAIN is a vector of if-else-if conditions. */
10527 static void
10530 {
10535 restart:
10538 /* There is no statement yet. */
10544 /* In obj-c++, seeing '[[' might be the either the beginning of
10545 c++11 attributes, or a nested objc-message-expression. So
10546 let's parse the c++11 attributes tentatively. */
10550 {
10553 }
10555 /* Peek at the next token. */
10557 /* Remember the location of the first token in the statement. */
10559 /* If this is a keyword, then that will often determine what kind of
10560 statement we have. */
10562 {
10566 {
10569 /* Looks like a labeled-statement with a case label.
10570 Parse the label, and then use tail recursion to parse
10571 the statement. */
10589 {
10594 }
10595 else
10609 {
10614 }
10615 else
10616 {
10620 }
10624 /* Objective-C++ exception-handling constructs. */
10638 /* This must be a namespace alias definition. */
10654 /* It might be a keyword like `int' that can start a
10655 declaration-statement. */
10657 }
10658 }
10660 {
10661 /* If the next token is a `:', then we are looking at a
10662 labeled-statement. */
10665 {
10666 /* Looks like a labeled-statement with an ordinary label.
10667 Parse the label, and then use tail recursion to parse
10668 the statement. */
10673 }
10674 }
10675 /* Anything that starts with a `{' must be a compound-statement. */
10678 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10679 a statement all its own. */
10681 {
10682 /* Only certain OpenMP pragmas are attached to statements, and thus
10683 are considered statements themselves. All others are not. In
10684 the context of a compound, accept the pragma as a "statement" and
10685 return so that we can check for a close brace. Otherwise we
10686 require a real statement and must go back and read one. */
10692 }
10694 {
10697 }
10699 /* Everything else must be a declaration-statement or an
10700 expression-statement. Try for the declaration-statement
10701 first, unless we are looking at a `;', in which case we know that
10702 we have an expression-statement. */
10704 {
10706 {
10708 {
10709 /* Attributes should be parsed as part of the the
10710 declaration, so let's un-parse them. */
10713 }
10716 /* Try to parse the declaration-statement. */
10718 /* If that worked, we're done. */
10721 }
10722 /* Look for an expression-statement instead. */
10725 /* Handle [[fallthrough]];. */
10727 {
10728 /* The next token after the fallthrough attribute is ';'. */
10730 {
10731 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10733 IFN_FALLTHROUGH,
10736 }
10737 else
10741 }
10742 }
10744 /* Set the line number for the statement. */
10748 /* Allow "[[fallthrough]];", but warn otherwise. */
10751 OPT_Wattributes,
10753 }
10755 /* Parse the label for a labeled-statement, i.e.
10757 identifier :
10758 case constant-expression :
10759 default :
10761 GNU Extension:
10762 case constant-expression ... constant-expression : statement
10764 When a label is parsed without errors, the label is added to the
10765 parse tree by the finish_* functions, so this function doesn't
10766 have to return the label. */
10768 static void
10770 {
10775 /* The next token should be an identifier. */
10779 {
10782 }
10784 /* Remember whether this case or a user-defined label is allowed to fall
10785 through to. */
10790 {
10792 {
10796 /* Consume the `case' token. */
10798 /* Parse the constant-expression. */
10805 {
10806 /* Consume the `...' token. */
10812 /* We don't need to emit warnings here, as the common code
10813 will do this for us. */
10814 }
10815 else
10819 {
10823 }
10824 else
10827 expr);
10828 }
10832 /* Consume the `default' token. */
10836 {
10840 }
10841 else
10846 /* Anything else must be an ordinary label. */
10851 }
10853 /* Require the `:' token. */
10856 /* An ordinary label may optionally be followed by attributes.
10857 However, this is only permitted if the attributes are then
10858 followed by a semicolon. This is because, for backward
10859 compatibility, when parsing
10860 lab: __attribute__ ((unused)) int i;
10861 we want the attribute to attach to "i", not "lab". */
10864 {
10865 tree attrs;
10872 ;
10873 else
10875 }
10881 }
10883 /* Parse an expression-statement.
10885 expression-statement:
10886 expression [opt] ;
10888 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10889 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10890 indicates whether this expression-statement is part of an
10891 expression statement. */
10893 static tree
10895 {
10900 /* There might be attribute fallthrough. */
10903 /* If the next token is a ';', then there is no expression
10904 statement. */
10906 {
10910 {
10913 }
10914 }
10916 /* Handle [[fallthrough]];. */
10918 {
10919 /* The next token after the fallthrough attribute is ';'. */
10921 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10924 else
10928 }
10930 /* Allow "[[fallthrough]];", but warn otherwise. */
10935 /* Give a helpful message for "A<T>::type t;" and the like. */
10938 {
10945 {
10946 /* A::A a; */
10951 }
10952 }
10954 /* Consume the final `;'. */
10959 /* This is the final expression statement of a statement
10960 expression. */
10966 }
10968 /* Parse a compound-statement.
10970 compound-statement:
10971 { statement-seq [opt] }
10973 GNU extension:
10975 compound-statement:
10976 { label-declaration-seq [opt] statement-seq [opt] }
10978 label-declaration-seq:
10979 label-declaration
10980 label-declaration-seq label-declaration
10982 Returns a tree representing the statement. */
10984 static tree
10987 {
10988 tree compound_stmt;
10990 /* Consume the `{'. */
10997 /* Begin the compound-statement. */
10999 /* If the next keyword is `__label__' we have a label declaration. */
11002 /* Parse an (optional) statement-seq. */
11004 /* Finish the compound-statement. */
11006 /* Consume the `}'. */
11010 }
11012 /* Parse an (optional) statement-seq.
11014 statement-seq:
11015 statement
11016 statement-seq [opt] statement */
11018 static void
11020 {
11021 /* Scan statements until there aren't any more. */
11023 {
11026 /* If we are looking at a `}', then we have run out of
11027 statements; the same is true if we have reached the end
11028 of file, or have stumbled upon a stray '@end'. */
11035 /* If we are in a compound statement and find 'else' then
11036 something went wrong. */
11038 {
11041 else
11042 {
11045 }
11046 }
11048 /* Parse the statement. */
11050 }
11051 }
11053 /* Return true if we're looking at (init; cond), false otherwise. */
11055 static bool
11057 {
11058 /* Save tokens so that we can put them back. */
11061 /* Look for ';' that is not nested in () or {}. */
11064 CPP_SEMICOLON,
11067 /* Roll back the tokens we skipped. */
11071 }
11073 /* Parse a selection-statement.
11075 selection-statement:
11076 if ( init-statement [opt] condition ) statement
11077 if ( init-statement [opt] condition ) statement else statement
11078 switch ( init-statement [opt] condition ) statement
11080 Returns the new IF_STMT or SWITCH_STMT.
11082 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11083 is a (possibly labeled) if statement which is not enclosed in
11084 braces and has an else clause. This is used to implement
11085 -Wparentheses.
11087 CHAIN is a vector of if-else-if conditions. This is used to implement
11088 -Wduplicated-cond. */
11090 static tree
11093 {
11096 token_indent_info guard_tinfo;
11101 /* Peek at the next token. */
11105 /* See what kind of keyword it is. */
11108 {
11111 {
11112 tree statement;
11113 tree condition;
11118 RID_CONSTEXPR))
11119 {
11125 }
11127 /* Look for the `('. */
11129 {
11132 }
11134 /* Begin the selection-statement. */
11136 {
11139 }
11140 else
11143 /* Parse the optional init-statement. */
11145 {
11146 tree decl;
11149 "init-statement in selection statements only available "
11152 }
11154 /* Parse the condition. */
11156 /* Look for the `)'. */
11162 {
11166 /* Add the condition. */
11173 /* Parse the then-clause. */
11177 /* Outside a template, the non-selected branch of a constexpr
11178 if is a 'discarded statement', i.e. unevaluated. */
11183 {
11186 }
11189 guard_tinfo);
11196 {
11200 }
11202 /* If the next token is `else', parse the else-clause. */
11204 RID_ELSE))
11205 {
11209 {
11212 }
11214 guard_tinfo
11216 /* Consume the `else' keyword. */
11219 {
11221 RID_IF)
11223 {
11224 /* We've got "if (COND) else if (COND2)". Start
11225 the condition chain and add COND as the first
11226 element. */
11230 {
11231 /* Wrap it in a NOP_EXPR so that we can set the
11232 location of the condition. */
11234 condition);
11237 }
11238 }
11240 RID_IF))
11241 {
11242 /* This is if-else without subsequent if. Zap the
11243 condition chain; we would have already warned at
11244 this point. */
11247 }
11248 }
11250 /* Parse the else-clause. */
11256 /* If we are currently parsing a then-clause, then
11257 IF_P will not be NULL. We set it to true to
11258 indicate that this if statement has an else clause.
11259 This may trigger the Wparentheses warning below
11260 when we get back up to the parent if statement. */
11265 {
11269 }
11270 }
11271 else
11272 {
11273 /* This if statement does not have an else clause. If
11274 NESTED_IF is true, then the then-clause has an if
11275 statement which does have an else clause. We warn
11276 about the potential ambiguity. */
11279 "suggest explicit braces to avoid ambiguous"
11282 {
11283 /* We don't need the condition chain anymore. */
11286 }
11287 }
11289 /* Now we're all done with the if-statement. */
11291 }
11292 else
11293 {
11297 /* Add the condition. */
11300 /* Parse the body of the switch-statement. */
11306 guard_tinfo);
11310 /* Now we're all done with the switch-statement. */
11312 }
11315 }
11321 }
11322 }
11324 /* Parse a condition.
11326 condition:
11327 expression
11328 type-specifier-seq declarator = initializer-clause
11329 type-specifier-seq declarator braced-init-list
11331 GNU Extension:
11333 condition:
11334 type-specifier-seq declarator asm-specification [opt]
11335 attributes [opt] = assignment-expression
11337 Returns the expression that should be tested. */
11339 static tree
11341 {
11342 cp_decl_specifier_seq type_specifiers;
11346 /* Try the declaration first. */
11348 /* New types are not allowed in the type-specifier-seq for a
11349 condition. */
11351 parser->type_definition_forbidden_message
11353 /* Parse the type-specifier-seq. */
11355 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11358 /* Restore the saved message. */
11360 /* If all is well, we might be looking at a declaration. */
11362 {
11363 tree decl;
11364 tree asm_specification;
11365 tree attributes;
11369 /* Parse the declarator. */
11375 /* Parse the attributes. */
11377 /* Parse the asm-specification. */
11379 /* If the next token is not an `=' or '{', then we might still be
11380 looking at an expression. For example:
11382 if (A(a).x)
11384 looks like a decl-specifier-seq and a declarator -- but then
11385 there is no `=', so this is an expression. */
11390 /* If we did see an `=' or '{', then we are looking at a declaration
11391 for sure. */
11393 {
11394 tree pushed_scope;
11398 /* Create the declaration. */
11404 /* Parse the initializer. */
11406 {
11410 }
11411 else
11412 {
11413 /* Consume the `='. */
11416 }
11420 /* Process the initializer. */
11423 asm_specification,
11424 flags);
11430 }
11431 }
11432 /* If we didn't even get past the declarator successfully, we are
11433 definitely not looking at a declaration. */
11434 else
11437 /* Otherwise, we are looking at an expression. */
11439 }
11441 /* Parses a for-statement or range-for-statement until the closing ')',
11442 not included. */
11444 static tree
11446 {
11450 /* Begin the for-statement. */
11453 /* Parse the initialization. */
11458 else
11460 }
11462 static tree
11464 {
11465 /* Normal for loop */
11468 tree stmt;
11471 /* The init-statement has already been parsed in
11472 cp_parser_init_statement, so no work is needed here. */
11475 /* If there's a condition, process it. */
11479 {
11483 }
11485 /* Look for the `;'. */
11488 /* If there's an expression, process it. */
11494 }
11496 /* Tries to parse a range-based for-statement:
11498 range-based-for:
11499 decl-specifier-seq declarator : expression
11501 The decl-specifier-seq declarator and the `:' are already parsed by
11502 cp_parser_init_statement. If processing_template_decl it returns a
11503 newly created RANGE_FOR_STMT; if not, it is converted to a
11504 regular FOR_STMT. */
11506 static tree
11509 {
11516 /* Get the range declaration momentarily out of the way so that
11517 the range expression doesn't clash with it. */
11519 {
11521 {
11523 /* For decomposition declaration get all of the corresponding
11524 declarations out of the way. */
11528 {
11534 {
11540 }
11541 }
11542 }
11544 {
11549 }
11550 }
11553 {
11556 }
11557 else
11560 /* Put the range declaration(s) back into scope. */
11562 {
11566 }
11568 /* If in template, STMT is converted to a normal for-statement
11569 at instantiation. If not, it is done just ahead. */
11571 {
11579 /* do_auto_deduction doesn't mess with template init-lists. */
11582 }
11583 else
11584 {
11588 }
11590 }
11592 /* Subroutine of cp_convert_range_for: given the initializer expression,
11593 builds up the range temporary. */
11595 static tree
11597 {
11600 /* Find out the type deduced by the declaration
11601 `auto &&__range = range_expr'. */
11606 /* Create the __range variable. */
11613 }
11615 /* Used by cp_parser_range_for in template context: we aren't going to
11616 do a full conversion yet, but we still need to resolve auto in the
11617 type of the for-range-declaration if present. This is basically
11618 a shortcut version of cp_convert_range_for. */
11620 static void
11622 {
11625 {
11628 iter_type = (cp_parser_perform_range_for_lookup
11631 {
11633 iter_type);
11635 tf_warning_or_error);
11638 }
11639 }
11640 }
11642 /* Converts a range-based for-statement into a normal
11643 for-statement, as per the definition.
11645 for (RANGE_DECL : RANGE_EXPR)
11646 BLOCK
11648 should be equivalent to:
11650 {
11651 auto &&__range = RANGE_EXPR;
11652 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11653 __begin != __end;
11654 ++__begin)
11655 {
11656 RANGE_DECL = *__begin;
11657 BLOCK
11658 }
11659 }
11661 If RANGE_EXPR is an array:
11662 BEGIN_EXPR = __range
11663 END_EXPR = __range + ARRAY_SIZE(__range)
11664 Else if RANGE_EXPR has a member 'begin' or 'end':
11665 BEGIN_EXPR = __range.begin()
11666 END_EXPR = __range.end()
11667 Else:
11668 BEGIN_EXPR = begin(__range)
11669 END_EXPR = end(__range);
11671 If __range has a member 'begin' but not 'end', or vice versa, we must
11672 still use the second alternative (it will surely fail, however).
11673 When calling begin()/end() in the third alternative we must use
11674 argument dependent lookup, but always considering 'std' as an associated
11675 namespace. */
11677 tree
11681 {
11687 /* If an error happened previously do nothing or else a lot of
11688 unhelpful errors would be issued. */
11690 else
11691 {
11692 tree range_temp;
11696 /* Can't bind a reference to an array of runtime bound. */
11698 else
11699 {
11704 LOOKUP_ONLYCONVERTING);
11706 }
11709 }
11711 /* The new for initialization statement. */
11719 LOOKUP_ONLYCONVERTING);
11730 LOOKUP_ONLYCONVERTING);
11734 /* The new for condition. */
11741 /* The new increment expression. */
11744 tf_warning_or_error);
11747 /* The declaration is initialized with *__begin inside the loop body. */
11750 tf_warning_or_error),
11752 LOOKUP_ONLYCONVERTING);
11757 }
11759 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11760 We need to solve both at the same time because the method used
11761 depends on the existence of members begin or end.
11762 Returns the type deduced for the iterator expression. */
11764 static tree
11766 {
11768 {
11771 }
11774 {
11779 }
11781 {
11782 /* If RANGE is an array, we will use pointer arithmetic. */
11785 range,
11789 }
11790 else
11791 {
11792 /* If it is not an array, we must do a bit of magic. */
11802 tf_warning_or_error);
11805 tf_warning_or_error);
11808 {
11809 /* Use the member functions. */
11812 else
11818 else
11821 }
11822 else
11823 {
11824 /* Use global functions with ADL. */
11831 tf_warning_or_error);
11833 tf_warning_or_error);
11835 tf_warning_or_error);
11837 tf_warning_or_error);
11840 }
11842 /* Last common checks. */
11844 {
11845 /* If one of the expressions is an error do no more checks. */
11848 }
11851 /* Can happen, when, eg, in a template context, Koenig lookup
11852 can't resolve begin/end (c++/58503). */
11854 else
11855 {
11857 /* The unqualified type of the __begin and __end temporaries should
11858 be the same, as required by the multiple auto declaration. */
11860 {
11867 /* P0184R0 allows __begin and __end to have different types,
11868 but make sure they are comparable so we can give a better
11870 else
11874 }
11876 }
11877 }
11878 }
11880 /* Helper function for cp_parser_perform_range_for_lookup.
11881 Builds a tree for RANGE.IDENTIFIER(). */
11883 static tree
11885 {
11898 tf_warning_or_error);
11901 }
11903 /* Parse an iteration-statement.
11905 iteration-statement:
11906 while ( condition ) statement
11907 do statement while ( expression ) ;
11908 for ( init-statement condition [opt] ; expression [opt] )
11909 statement
11911 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11913 static tree
11915 {
11918 tree statement;
11920 token_indent_info guard_tinfo;
11922 /* Peek at the next token. */
11929 /* Remember whether or not we are already within an iteration
11930 statement. */
11933 /* See what kind of keyword it is. */
11936 {
11938 {
11939 tree condition;
11941 /* Begin the while-statement. */
11943 /* Look for the `('. */
11945 /* Parse the condition. */
11948 /* Look for the `)'. */
11950 /* Parse the dependent statement. */
11954 /* We're done with the while-statement. */
11956 }
11960 {
11961 tree expression;
11963 /* Begin the do-statement. */
11965 /* Parse the body of the do-statement. */
11970 /* Look for the `while' keyword. */
11972 /* Look for the `('. */
11974 /* Parse the expression. */
11976 /* We're done with the do-statement. */
11978 /* Look for the `)'. */
11980 /* Look for the `;'. */
11982 }
11986 {
11987 /* Look for the `('. */
11992 /* Look for the `)'. */
11995 /* Parse the body of the for-statement. */
12000 /* We're done with the for-statement. */
12002 }
12009 }
12012 }
12014 /* Parse a init-statement or the declarator of a range-based-for.
12015 Returns true if a range-based-for declaration is seen.
12017 init-statement:
12018 expression-statement
12019 simple-declaration */
12021 static bool
12023 {
12024 /* If the next token is a `;', then we have an empty
12025 expression-statement. Grammatically, this is also a
12026 simple-declaration, but an invalid one, because it does not
12027 declare anything. Therefore, if we did not handle this case
12028 specially, we would issue an error message about an invalid
12029 declaration. */
12031 {
12035 /* A colon is used in range-based for. */
12038 /* We're going to speculatively look for a declaration, falling back
12039 to an expression, if necessary. */
12041 /* Parse the declaration. */
12044 decl);
12047 {
12048 /* It is a range-for, consume the ':' */
12052 {
12054 "range-based %<for%> loops only available with "
12057 }
12058 }
12059 else
12060 /* The ';' is not consumed yet because we told
12061 cp_parser_simple_declaration not to. */
12066 /* If the tentative parse failed, then we shall need to look for an
12067 expression-statement. */
12068 }
12069 /* If we are here, it is an expression-statement. */
12072 }
12074 /* Parse a jump-statement.
12076 jump-statement:
12077 break ;
12078 continue ;
12079 return expression [opt] ;
12080 return braced-init-list ;
12081 goto identifier ;
12083 GNU extension:
12085 jump-statement:
12086 goto * expression ;
12088 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12090 static tree
12092 {
12098 /* Peek at the next token. */
12103 /* See what kind of keyword it is. */
12106 {
12110 {
12130 }
12136 {
12143 /* Fall through. */
12153 }
12158 {
12159 tree expr;
12163 {
12167 }
12170 else
12171 /* If the next token is a `;', then there is no
12172 expression. */
12174 /* Build the return-statement. */
12177 else
12179 /* Look for the final `;'. */
12181 }
12187 {
12190 }
12192 /* Create the goto-statement. */
12194 {
12195 /* Issue a warning about this use of a GNU extension. */
12197 /* Consume the '*' token. */
12199 /* Parse the dependent expression. */
12201 }
12202 else
12204 /* Look for the final `;'. */
12211 }
12214 }
12216 /* Parse a declaration-statement.
12218 declaration-statement:
12219 block-declaration */
12221 static void
12223 {
12226 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12229 /* Parse the block-declaration. */
12232 /* Free any declarators allocated. */
12234 }
12236 /* Some dependent statements (like `if (cond) statement'), are
12237 implicitly in their own scope. In other words, if the statement is
12238 a single statement (as opposed to a compound-statement), it is
12239 none-the-less treated as if it were enclosed in braces. Any
12240 declarations appearing in the dependent statement are out of scope
12241 after control passes that point. This function parses a statement,
12242 but ensures that is in its own scope, even if it is not a
12243 compound-statement.
12245 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12246 is a (possibly labeled) if statement which is not enclosed in
12247 braces and has an else clause. This is used to implement
12248 -Wparentheses.
12250 CHAIN is a vector of if-else-if conditions. This is used to implement
12251 -Wduplicated-cond.
12253 Returns the new statement. */
12255 static tree
12259 {
12260 tree statement;
12262 token_indent_info body_tinfo
12268 /* Mark if () ; with a special NOP_EXPR. */
12270 {
12281 }
12282 /* if a compound is opened, we simply parse the statement directly. */
12285 /* If the token is not a `{', then we must take special action. */
12286 else
12287 {
12288 /* Create a compound-statement. */
12290 /* Parse the dependent-statement. */
12292 /* Finish the dummy compound-statement. */
12294 }
12296 token_indent_info next_tinfo
12300 /* Return the statement. */
12302 }
12304 /* For some dependent statements (like `while (cond) statement'), we
12305 have already created a scope. Therefore, even if the dependent
12306 statement is a compound-statement, we do not want to create another
12307 scope. */
12309 static void
12312 {
12313 /* If the token is a `{', then we must take special action. */
12315 {
12316 token_indent_info body_tinfo
12320 token_indent_info next_tinfo
12323 }
12324 else
12325 {
12326 /* Avoid calling cp_parser_compound_statement, so that we
12327 don't create a new scope. Do everything else by hand. */
12329 /* If the next keyword is `__label__' we have a label declaration. */
12332 /* Parse an (optional) statement-seq. */
12335 }
12336 }
12338 /* Declarations [gram.dcl.dcl] */
12340 /* Parse an optional declaration-sequence.
12342 declaration-seq:
12343 declaration
12344 declaration-seq declaration */
12346 static void
12348 {
12350 {
12361 {
12362 /* A declaration consisting of a single semicolon is
12363 invalid. Allow it unless we're being pedantic. */
12368 }
12370 /* If we're entering or exiting a region that's implicitly
12371 extern "C", modify the lang context appropriately. */
12373 {
12376 }
12378 {
12381 }
12384 {
12385 /* A top-level declaration can consist solely of a #pragma.
12386 A nested declaration cannot, so this is done here and not
12387 in cp_parser_declaration. (A #pragma at block scope is
12388 handled in cp_parser_statement.) */
12391 }
12393 /* Parse the declaration itself. */
12395 }
12396 }
12398 /* Parse a declaration.
12400 declaration:
12401 block-declaration
12402 function-definition
12403 template-declaration
12404 explicit-instantiation
12405 explicit-specialization
12406 linkage-specification
12407 namespace-definition
12409 C++17:
12410 deduction-guide
12412 GNU extension:
12414 declaration:
12415 __extension__ declaration */
12417 static void
12419 {
12420 cp_token token1;
12421 cp_token token2;
12426 /* Check for the `__extension__' keyword. */
12428 {
12429 /* Parse the qualified declaration. */
12431 /* Restore the PEDANTIC flag. */
12435 }
12437 /* Try to figure out what kind of declaration is present. */
12442 else
12443 {
12446 }
12448 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12451 /* If the next token is `extern' and the following token is a string
12452 literal, then we have a linkage specification. */
12456 /* If the next token is `template', then we have either a template
12457 declaration, an explicit instantiation, or an explicit
12458 specialization. */
12460 {
12461 /* `template <>' indicates a template specialization. */
12465 /* `template <' indicates a template declaration. */
12468 /* Anything else must be an explicit instantiation. */
12469 else
12471 }
12472 /* If the next token is `export', then we have a template
12473 declaration. */
12476 /* If the next token is `extern', 'static' or 'inline' and the one
12477 after that is `template', we have a GNU extended explicit
12478 instantiation directive. */
12485 /* If the next token is `namespace', check for a named or unnamed
12486 namespace definition. */
12495 /* An unnamed namespace definition. */
12499 /* An inline (associated) namespace definition. */
12503 /* Objective-C++ declaration/definition. */
12510 /* At this point we may have a template declared by a concept
12511 introduction. */
12516 else
12517 /* Try to parse a block-declaration, or a function-definition. */
12520 /* Free any declarators allocated. */
12522 }
12524 /* Parse a block-declaration.
12526 block-declaration:
12527 simple-declaration
12528 asm-definition
12529 namespace-alias-definition
12530 using-declaration
12531 using-directive
12533 GNU Extension:
12535 block-declaration:
12536 __extension__ block-declaration
12538 C++0x Extension:
12540 block-declaration:
12541 static_assert-declaration
12543 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12544 part of a declaration-statement. */
12546 static void
12549 {
12553 /* Check for the `__extension__' keyword. */
12555 {
12556 /* Parse the qualified declaration. */
12558 /* Restore the PEDANTIC flag. */
12562 }
12564 /* Peek at the next token to figure out which kind of declaration is
12565 present. */
12568 /* If the next keyword is `asm', we have an asm-definition. */
12570 {
12574 }
12575 /* If the next keyword is `namespace', we have a
12576 namespace-alias-definition. */
12579 /* If the next keyword is `using', we have a
12580 using-declaration, a using-directive, or an alias-declaration. */
12582 {
12587 /* If the token after `using' is `namespace', then we have a
12588 using-directive. */
12592 /* If the second token after 'using' is '=', then we have an
12593 alias-declaration. */
12599 /* Otherwise, it's a using-declaration. */
12600 else
12603 }
12604 /* If the next keyword is `__label__' we have a misplaced label
12605 declaration. */
12607 {
12611 /* If the next token is now a `;', consume it. */
12614 }
12615 /* If the next token is `static_assert' we have a static assertion. */
12618 /* Anything else must be a simple-declaration. */
12619 else
12622 }
12624 /* Parse a simple-declaration.
12626 simple-declaration:
12627 decl-specifier-seq [opt] init-declarator-list [opt] ;
12628 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12629 brace-or-equal-initializer ;
12631 init-declarator-list:
12632 init-declarator
12633 init-declarator-list , init-declarator
12635 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12636 function-definition as a simple-declaration.
12638 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12639 parsed declaration if it is an uninitialized single declarator not followed
12640 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12641 if present, will not be consumed. */
12643 static void
12647 {
12648 cp_decl_specifier_seq decl_specifiers;
12657 /* Defer access checks until we know what is being declared; the
12658 checks for names appearing in the decl-specifier-seq should be
12659 done as if we were in the scope of the thing being declared. */
12662 /* Parse the decl-specifier-seq. We have to keep track of whether
12663 or not the decl-specifier-seq declares a named class or
12664 enumeration type, since that is the only case in which the
12665 init-declarator-list is allowed to be empty.
12667 [dcl.dcl]
12669 In a simple-declaration, the optional init-declarator-list can be
12670 omitted only when declaring a class or enumeration, that is when
12671 the decl-specifier-seq contains either a class-specifier, an
12672 elaborated-type-specifier, or an enum-specifier. */
12674 CP_PARSER_FLAGS_OPTIONAL,
12677 /* We no longer need to defer access checks. */
12680 /* In a block scope, a valid declaration must always have a
12681 decl-specifier-seq. By not trying to parse declarators, we can
12682 resolve the declaration/expression ambiguity more quickly. */
12685 {
12688 }
12690 /* If the next two tokens are both identifiers, the code is
12691 erroneous. The usual cause of this situation is code like:
12693 T t;
12695 where "T" should name a type -- but does not. */
12698 {
12699 /* If parsing tentatively, we should commit; we really are
12700 looking at a declaration. */
12702 /* Give up. */
12704 }
12706 /* If we have seen at least one decl-specifier, and the next token
12707 is not a parenthesis, then we must be looking at a declaration.
12708 (After "int (" we might be looking at a functional cast.) */
12715 /* Look for C++17 decomposition declaration. */
12723 {
12724 tree decl
12726 maybe_range_for_decl,
12729 /* The next token should be either a `,' or a `;'. */
12731 /* If it's a `;', we are done. */
12734 /* Anything else is an error. */
12735 else
12736 {
12737 /* If we have already issued an error message we don't need
12738 to issue another one. */
12743 /* Skip tokens until we reach the end of the statement. */
12745 /* If the next token is now a `;', consume it. */
12749 }
12750 }
12751 else
12754 tree last_type;
12756 /* NULL_TREE if both variable and function declaration are allowed,
12757 error_mark_node if function declaration are not allowed and
12758 a FUNCTION_DECL that should be diagnosed if it is followed by
12759 variable declarations. */
12760 tree auto_function_declaration;
12763 auto_specifier_p
12767 /* Keep going until we hit the `;' at the end of the simple
12768 declaration. */
12771 CPP_SEMICOLON))
12772 {
12775 tree decl;
12779 {
12780 /* If we are processing next declarator, comma is expected */
12785 {
12789 }
12790 }
12791 else
12794 /* Parse the init-declarator. */
12797 function_definition_allowed_p,
12799 declares_class_or_enum,
12801 maybe_range_for_decl,
12804 /* If an error occurred while parsing tentatively, exit quickly.
12805 (That usually happens when in the body of a function; each
12806 statement is treated as a declaration-statement until proven
12807 otherwise.) */
12812 {
12813 /* If the init-declarator-list contains more than one
12814 init-declarator, they shall all form declarations of
12815 variables. */
12817 auto_function_declaration
12821 {
12823 "non-variable %qD in declaration with more than one "
12828 }
12829 }
12833 {
12837 {
12838 /* If the list of declarators contains more than one declarator,
12839 the type of each declared variable is determined as described
12840 above. If the type deduced for the template parameter U is not
12841 the same in each deduction, the program is ill-formed. */
12846 }
12847 else
12849 }
12851 /* Handle function definitions specially. */
12853 {
12854 /* If the next token is a `,', then we are probably
12855 processing something like:
12857 void f() {}, *p;
12859 which is erroneous. */
12861 {
12864 "mixing"
12866 }
12867 /* Otherwise, we're done with the list of declarators. */
12868 else
12869 {
12872 }
12873 }
12876 /* The next token should be either a `,' or a `;'. */
12878 /* If it's a `,', there are more declarators to come. */
12881 /* If it's a `;', we are done. */
12885 {
12890 }
12891 /* Anything else is an error. */
12892 else
12893 {
12894 /* If we have already issued an error message we don't need
12895 to issue another one. */
12900 /* Skip tokens until we reach the end of the statement. */
12902 /* If the next token is now a `;', consume it. */
12906 }
12907 /* After the first time around, a function-definition is not
12908 allowed -- even if it was OK at first. For example:
12910 int i, f() {}
12912 is not valid. */
12914 }
12916 /* Issue an error message if no declarators are present, and the
12917 decl-specifier-seq does not itself declare a class or
12918 enumeration: [dcl.dcl]/3. */
12920 {
12922 {
12926 /* Ensure an error is issued anyway when finish_decltype_type,
12927 called via cp_parser_decl_specifier_seq, returns a class or
12928 an enumeration (c++/51786). */
12931 }
12932 /* Perform any deferred access checks. */
12934 }
12936 /* Consume the `;'. */
12937 finish:
12941 {
12947 }
12949 done:
12951 }
12953 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
12954 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12955 initializer ; */
12957 static tree
12962 {
12967 /* Parse the identifier-list. */
12971 {
12979 }
12983 {
12989 else
12990 {
12993 }
12994 }
13000 tree pushed_scope;
13007 NULL_TREE);
13014 cp_expr e;
13015 cp_decl_specifier_seq decl_specs;
13020 {
13023 else
13026 tree elt_pushed_scope;
13032 {
13033 /* Ensure we've diagnosed redeclaration if we aren't creating
13034 a new VAR_DECL. */
13037 }
13038 else
13042 }
13045 {
13048 }
13052 {
13059 {
13063 }
13064 }
13066 {
13068 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13069 the underlying DECL. */
13071 }
13077 {
13080 }
13083 }
13085 /* Parse a decl-specifier-seq.
13087 decl-specifier-seq:
13088 decl-specifier-seq [opt] decl-specifier
13089 decl-specifier attribute-specifier-seq [opt] (C++11)
13091 decl-specifier:
13092 storage-class-specifier
13093 type-specifier
13094 function-specifier
13095 friend
13096 typedef
13098 GNU Extension:
13100 decl-specifier:
13101 attributes
13103 Concepts Extension:
13105 decl-specifier:
13106 concept
13108 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13110 The parser flags FLAGS is used to control type-specifier parsing.
13112 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13113 flags:
13115 1: one of the decl-specifiers is an elaborated-type-specifier
13116 (i.e., a type declaration)
13117 2: one of the decl-specifiers is an enum-specifier or a
13118 class-specifier (i.e., a type definition)
13120 */
13122 static void
13124 cp_parser_flags flags,
13127 {
13131 cp_decl_spec ds;
13133 /* Clear DECL_SPECS. */
13136 /* Assume no class or enumeration type is declared. */
13139 /* Keep reading specifiers until there are no more to read. */
13141 {
13146 /* Peek at the next token. */
13149 /* Save the first token of the decl spec list for error
13150 reporting. */
13153 /* Handle attributes. */
13155 {
13156 /* Parse the attributes. */
13159 /* In a sequence of declaration specifiers, c++11 attributes
13160 appertain to the type that precede them. In that case
13161 [dcl.spec]/1 says:
13163 The attribute-specifier-seq affects the type only for
13164 the declaration it appears in, not other declarations
13165 involving the same type.
13167 But for now let's force the user to position the
13168 attribute either at the beginning of the declaration or
13169 after the declarator-id, which would clearly mean that it
13170 applies to the declarator. */
13172 {
13174 /* The c++11 attribute is at the beginning of the
13175 declaration. It appertains to the entity being
13177 else
13178 {
13180 {
13181 /* This is an attribute following a
13182 class-specifier. */
13187 }
13188 else
13189 {
13190 decl_specs->std_attributes
13192 attrs);
13195 }
13197 }
13198 }
13200 decl_specs->attributes
13202 attrs);
13206 }
13207 /* Assume we will find a decl-specifier keyword. */
13209 /* If the next token is an appropriate keyword, we can simply
13210 add it to the list. */
13212 {
13213 /* decl-specifier:
13214 friend
13215 constexpr */
13218 {
13221 }
13222 else
13223 {
13225 /* Consume the token. */
13227 }
13240 /* function-specifier:
13241 inline
13242 virtual
13243 explicit */
13250 /* decl-specifier:
13251 typedef */
13254 /* Consume the token. */
13256 /* A constructor declarator cannot appear in a typedef. */
13258 /* The "typedef" keyword can only occur in a declaration; we
13259 may as well commit at this point. */
13266 /* storage-class-specifier:
13267 auto
13268 register
13269 static
13270 extern
13271 mutable
13273 GNU Extension:
13274 thread */
13277 {
13278 /* Consume the token. */
13281 /* Complain about `auto' as a storage specifier, if
13282 we're complaining about C++0x compatibility. */
13286 /* Set the storage class anyway. */
13288 token);
13289 }
13290 else
13291 /* C++0x auto type-specifier. */
13299 /* Consume the token. */
13302 token);
13305 /* Consume the token. */
13311 /* We did not yet find a decl-specifier yet. */
13314 }
13331 /* Constructors are a special case. The `S' in `S()' is not a
13332 decl-specifier; it is the beginning of the declarator. */
13333 constructor_p
13334 = (!found_decl_spec
13335 && constructor_possible_p
13336 && (cp_parser_constructor_declarator_p
13339 /* If we don't have a DECL_SPEC yet, then we must be looking at
13340 a type-specifier. */
13342 {
13345 tree type_spec;
13347 type_spec
13349 decl_specs,
13355 /* If this type-specifier referenced a user-defined type
13356 (a typedef, class-name, etc.), then we can't allow any
13357 more such type-specifiers henceforth.
13359 [dcl.spec]
13361 The longest sequence of decl-specifiers that could
13362 possibly be a type name is taken as the
13363 decl-specifier-seq of a declaration. The sequence shall
13364 be self-consistent as described below.
13366 [dcl.type]
13368 As a general rule, at most one type-specifier is allowed
13369 in the complete decl-specifier-seq of a declaration. The
13370 only exceptions are the following:
13372 -- const or volatile can be combined with any other
13373 type-specifier.
13375 -- signed or unsigned can be combined with char, long,
13376 short, or int.
13378 -- ..
13380 Example:
13382 typedef char* Pc;
13383 void g (const int Pc);
13385 Here, Pc is *not* part of the decl-specifier seq; it's
13386 the declarator. Therefore, once we see a type-specifier
13387 (other than a cv-qualifier), we forbid any additional
13388 user-defined types. We *do* still allow things like `int
13389 int' to be considered a decl-specifier-seq, and issue the
13390 error message later. */
13393 /* A constructor declarator cannot follow a type-specifier. */
13395 {
13400 }
13401 }
13403 /* If we still do not have a DECL_SPEC, then there are no more
13404 decl-specifiers. */
13409 /* After we see one decl-specifier, further decl-specifiers are
13410 always optional. */
13412 }
13414 /* Don't allow a friend specifier with a class definition. */
13419 }
13421 /* Parse an (optional) storage-class-specifier.
13423 storage-class-specifier:
13424 auto
13425 register
13426 static
13427 extern
13428 mutable
13430 GNU Extension:
13432 storage-class-specifier:
13433 thread
13435 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13437 static tree
13439 {
13441 {
13445 /* Fall through for C++98. */
13453 /* Consume the token. */
13458 }
13459 }
13461 /* Parse an (optional) function-specifier.
13463 function-specifier:
13464 inline
13465 virtual
13466 explicit
13468 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13469 Updates DECL_SPECS, if it is non-NULL. */
13471 static tree
13474 {
13477 {
13483 /* 14.5.2.3 [temp.mem]
13485 A member function template shall not be virtual. */
13489 else
13499 }
13501 /* Consume the token. */
13503 }
13505 /* Parse a linkage-specification.
13507 linkage-specification:
13508 extern string-literal { declaration-seq [opt] }
13509 extern string-literal declaration */
13511 static void
13513 {
13514 tree linkage;
13516 /* Look for the `extern' keyword. */
13519 /* Look for the string-literal. */
13522 /* Transform the literal into an identifier. If the literal is a
13523 wide-character string, or contains embedded NULs, then we can't
13524 handle it as the user wants. */
13527 {
13529 /* Assume C++ linkage. */
13531 }
13532 else
13535 /* We're now using the new linkage. */
13538 /* If the next token is a `{', then we're using the first
13539 production. */
13541 {
13545 /* Consume the `{' token. */
13547 /* Parse the declarations. */
13549 /* Look for the closing `}'. */
13551 }
13552 /* Otherwise, there's just one declaration. */
13553 else
13554 {
13557 saved_in_unbraced_linkage_specification_p
13561 parser->in_unbraced_linkage_specification_p
13563 }
13565 /* We're done with the linkage-specification. */
13567 }
13569 /* Parse a static_assert-declaration.
13571 static_assert-declaration:
13572 static_assert ( constant-expression , string-literal ) ;
13573 static_assert ( constant-expression ) ; (C++1Z)
13575 If MEMBER_P, this static_assert is a class member. */
13577 static void
13579 {
13580 tree condition;
13581 tree message;
13583 location_t saved_loc;
13586 /* Peek at the `static_assert' token so we can keep track of exactly
13587 where the static assertion started. */
13591 /* Look for the `static_assert' keyword. */
13593 RT_STATIC_ASSERT))
13596 /* We know we are in a static assertion; commit to any tentative
13597 parse. */
13601 /* Parse the `(' starting the static assertion condition. */
13604 /* Parse the constant-expression. Allow a non-constant expression
13605 here in order to give better diagnostics in finish_static_assert. */
13606 condition =
13612 {
13615 "static_assert without a message "
13617 /* Eat the ')' */
13622 }
13623 else
13624 {
13625 /* Parse the separating `,'. */
13628 /* Parse the string-literal message. */
13633 /* A `)' completes the static assertion. */
13639 }
13641 /* A semicolon terminates the declaration. */
13644 /* Complete the static assertion, which may mean either processing
13645 the static assert now or saving it for template instantiation. */
13647 }
13649 /* Parse the expression in decltype ( expression ). */
13651 static tree
13654 {
13656 tree expr;
13658 /* Since we're going to preserve any side-effects from this parse, set up a
13659 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13660 in the expression. */
13663 /* First, try parsing an id-expression. */
13674 {
13677 cp_id_kind idk;
13681 /* Lookup the name we got back from the id-expression. */
13691 {
13692 /* Complete lookup of the id-expression. */
13693 expr = (finish_id_expression
13706 /* We found an id-expression, but it was something that we
13707 should not have found. This is an error, not something
13708 we can recover from, so note that we found an
13709 id-expression and we'll recover as gracefully as
13710 possible. */
13712 }
13717 /* We have an id-expression. */
13719 }
13722 {
13723 /* Abort the id-expression parse. */
13726 /* Parsing tentatively, again. */
13729 /* Parse a class member access. */
13737 /* We have an id-expression. */
13739 }
13742 /* We have parsed the complete id-expression or member access. */
13744 else
13745 {
13746 /* Abort our attempt to parse an id-expression or member access
13747 expression. */
13750 /* Parse a full expression. */
13753 }
13756 }
13758 /* Parse a `decltype' type. Returns the type.
13760 simple-type-specifier:
13761 decltype ( expression )
13762 C++14 proposal:
13763 decltype ( auto ) */
13765 static tree
13767 {
13768 tree expr;
13777 {
13778 /* Already parsed. */
13781 }
13783 /* Look for the `decltype' token. */
13787 /* Parse the opening `('. */
13791 /* decltype (auto) */
13794 {
13801 }
13803 /* Types cannot be defined in a `decltype' expression. Save away the
13804 old message. */
13807 /* And create the new one. */
13808 parser->type_definition_forbidden_message
13811 /* The restrictions on constant-expressions do not apply inside
13812 decltype expressions. */
13813 saved_integral_constant_expression_p
13815 saved_non_integral_constant_expression_p
13819 /* Within a parenthesized expression, a `>' token is always
13820 the greater-than operator. */
13821 saved_greater_than_is_operator_p
13825 /* Do not actually evaluate the expression. */
13828 /* Do not warn about problems with the expression. */
13833 /* Go back to evaluating expressions. */
13837 /* The `>' token might be the end of a template-id or
13838 template-parameter-list now. */
13839 parser->greater_than_is_operator_p
13842 /* Restore the old message and the integral constant expression
13843 flags. */
13845 parser->integral_constant_expression_p
13847 parser->non_integral_constant_expression_p
13850 /* Parse to the closing `)'. */
13852 {
13856 }
13859 tf_warning_or_error);
13861 rewrite:
13862 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13863 it again. */
13872 }
13874 /* Special member functions [gram.special] */
13876 /* Parse a conversion-function-id.
13878 conversion-function-id:
13879 operator conversion-type-id
13881 Returns an IDENTIFIER_NODE representing the operator. */
13883 static tree
13885 {
13886 tree type;
13887 tree saved_scope;
13888 tree saved_qualifying_scope;
13889 tree saved_object_scope;
13892 /* Look for the `operator' token. */
13895 /* When we parse the conversion-type-id, the current scope will be
13896 reset. However, we need that information in able to look up the
13897 conversion function later, so we save it here. */
13901 /* We must enter the scope of the class so that the names of
13902 entities declared within the class are available in the
13903 conversion-type-id. For example, consider:
13905 struct S {
13906 typedef int I;
13907 operator I();
13908 };
13910 S::operator I() { ... }
13912 In order to see that `I' is a type-name in the definition, we
13913 must be in the scope of `S'. */
13916 /* Parse the conversion-type-id. */
13918 /* Leave the scope of the class, if any. */
13921 /* Restore the saved scope. */
13925 /* If the TYPE is invalid, indicate failure. */
13929 }
13931 /* Parse a conversion-type-id:
13933 conversion-type-id:
13934 type-specifier-seq conversion-declarator [opt]
13936 Returns the TYPE specified. */
13938 static tree
13940 {
13941 tree attributes;
13942 cp_decl_specifier_seq type_specifiers;
13944 tree type_specified;
13947 /* Parse the attributes. */
13951 parser->type_definition_forbidden_message
13954 /* Parse the type-specifiers. */
13961 /* If that didn't work, stop. */
13964 /* Parse the conversion-declarator. */
13972 /* Don't give this error when parsing tentatively. This happens to
13973 work because we always parse this definitively once. */
13976 {
13978 {
13981 }
13985 }
13988 }
13990 /* Parse an (optional) conversion-declarator.
13992 conversion-declarator:
13993 ptr-operator conversion-declarator [opt]
13995 */
13999 {
14002 cp_cv_quals cv_quals;
14004 /* We don't know if there's a ptr-operator next, or not. */
14006 /* Try the ptr-operator. */
14009 /* If it worked, look for more conversion-declarators. */
14011 {
14014 /* Parse another optional declarator. */
14017 declarator = cp_parser_make_indirect_declarator
14021 }
14024 }
14026 /* Parse an (optional) ctor-initializer.
14028 ctor-initializer:
14029 : mem-initializer-list
14031 Returns TRUE iff the ctor-initializer was actually present. */
14033 static bool
14035 {
14036 /* If the next token is not a `:', then there is no
14037 ctor-initializer. */
14039 {
14040 /* Do default initialization of any bases and members. */
14045 }
14047 /* Consume the `:' token. */
14049 /* And the mem-initializer-list. */
14053 }
14055 /* Parse a mem-initializer-list.
14057 mem-initializer-list:
14058 mem-initializer ... [opt]
14059 mem-initializer ... [opt] , mem-initializer-list */
14061 static void
14063 {
14068 /* Let the semantic analysis code know that we are starting the
14069 mem-initializer-list. */
14074 /* Loop through the list. */
14076 {
14077 tree mem_initializer;
14080 /* Parse the mem-initializer. */
14082 /* If the next token is a `...', we're expanding member initializers. */
14084 {
14085 /* Consume the `...'. */
14088 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14089 can be expanded but members cannot. */
14092 {
14097 }
14099 /* Construct the pack expansion type. */
14102 }
14105 {
14109 }
14110 /* Look for a target constructor. */
14114 {
14117 {
14121 }
14123 }
14124 /* Add it to the list, unless it was erroneous. */
14126 {
14129 }
14130 /* If the next token is not a `,', we're done. */
14133 /* Consume the `,' token. */
14135 }
14137 /* Perform semantic analysis. */
14140 }
14142 /* Parse a mem-initializer.
14144 mem-initializer:
14145 mem-initializer-id ( expression-list [opt] )
14146 mem-initializer-id braced-init-list
14148 GNU extension:
14150 mem-initializer:
14151 ( expression-list [opt] )
14153 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14154 class) or FIELD_DECL (for a non-static data member) to initialize;
14155 the TREE_VALUE is the expression-list. An empty initialization
14156 list is represented by void_list_node. */
14158 static tree
14160 {
14161 tree mem_initializer_id;
14162 tree expression_list;
14163 tree member;
14166 /* Find out what is being initialized. */
14168 {
14172 }
14173 else
14174 {
14178 }
14184 {
14191 }
14192 else
14193 {
14203 }
14213 }
14215 /* Parse a mem-initializer-id.
14217 mem-initializer-id:
14218 :: [opt] nested-name-specifier [opt] class-name
14219 decltype-specifier (C++11)
14220 identifier
14222 Returns a TYPE indicating the class to be initialized for the first
14223 production (and the second in C++11). Returns an IDENTIFIER_NODE
14224 indicating the data member to be initialized for the last production. */
14226 static tree
14228 {
14232 tree id;
14236 /* `typename' is not allowed in this context ([temp.res]). */
14238 {
14240 "keyword %<typename%> not allowed in this context (a qualified "
14243 }
14244 /* Look for the optional `::' operator. */
14245 global_scope_p
14249 /* Look for the optional nested-name-specifier. The simplest way to
14250 implement:
14252 [temp.res]
14254 The keyword `typename' is not permitted in a base-specifier or
14255 mem-initializer; in these contexts a qualified name that
14256 depends on a template-parameter is implicitly assumed to be a
14257 type name.
14259 is to assume that we have seen the `typename' keyword at this
14260 point. */
14261 nested_name_specifier_p
14270 /* If there is a `::' operator or a nested-name-specifier, then we
14271 are definitely looking for a class-name. */
14276 typename_type,
14280 /* Otherwise, we could also be looking for an ordinary identifier. */
14283 /* Try a decltype-specifier. */
14285 else
14286 /* Otherwise, try a class-name. */
14290 none_type,
14294 /* If we found one, we're done. */
14297 /* Otherwise, look for an ordinary identifier. */
14299 }
14301 /* Overloading [gram.over] */
14303 /* Parse an operator-function-id.
14305 operator-function-id:
14306 operator operator
14308 Returns an IDENTIFIER_NODE for the operator which is a
14309 human-readable spelling of the identifier, e.g., `operator +'. */
14311 static cp_expr
14313 {
14314 /* Look for the `operator' keyword. */
14317 /* And then the name of the operator itself. */
14319 }
14321 /* Return an identifier node for a user-defined literal operator.
14322 The suffix identifier is chained to the operator name identifier. */
14324 tree
14326 {
14327 tree identifier;
14334 }
14336 /* Parse an operator.
14338 operator:
14339 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14340 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14341 || ++ -- , ->* -> () []
14343 GNU Extensions:
14345 operator:
14346 <? >? <?= >?=
14348 Returns an IDENTIFIER_NODE for the operator which is a
14349 human-readable spelling of the identifier, e.g., `operator +'. */
14351 static cp_expr
14353 {
14358 /* Peek at the next token. */
14363 /* Figure out which operator we have. */
14365 {
14367 {
14370 /* The keyword should be either `new' or `delete'. */
14375 else
14378 /* Consume the `new' or `delete' token. */
14381 /* Peek at the next token. */
14383 /* If it's a `[' token then this is the array variant of the
14384 operator. */
14386 {
14387 /* Consume the `[' token. */
14389 /* Look for the `]' token. */
14395 }
14396 /* Otherwise, we have the non-array variant. */
14397 else
14403 }
14550 /* Consume the `('. */
14552 /* Look for the matching `)'. */
14557 /* Consume the `['. */
14559 /* Look for the matching `]'. */
14566 /* FALLTHRU */
14575 {
14582 /* Consume the string. */
14588 {
14591 }
14592 else
14593 {
14595 /* Look for the suffix identifier. */
14600 {
14604 }
14605 else
14606 {
14609 }
14610 }
14615 {
14618 }
14621 {
14624 }
14626 {
14629 }
14631 }
14634 /* Anything else is an error. */
14636 }
14638 /* If we have selected an identifier, we need to consume the
14639 operator token. */
14642 /* Otherwise, no valid operator name was present. */
14643 else
14644 {
14647 }
14650 }
14652 /* Parse a template-declaration.
14654 template-declaration:
14655 export [opt] template < template-parameter-list > declaration
14657 If MEMBER_P is TRUE, this template-declaration occurs within a
14658 class-specifier.
14660 The grammar rule given by the standard isn't correct. What
14661 is really meant is:
14663 template-declaration:
14664 export [opt] template-parameter-list-seq
14665 decl-specifier-seq [opt] init-declarator [opt] ;
14666 export [opt] template-parameter-list-seq
14667 function-definition
14669 template-parameter-list-seq:
14670 template-parameter-list-seq [opt]
14671 template < template-parameter-list >
14673 Concept Extensions:
14675 template-parameter-list-seq:
14676 template < template-parameter-list > requires-clause [opt]
14678 requires-clause:
14679 requires logical-or-expression */
14681 static void
14683 {
14684 /* Check for `export'. */
14686 {
14687 /* Consume the `export' token. */
14689 /* Warn that we do not support `export'. */
14691 }
14694 }
14696 /* Parse a template-parameter-list.
14698 template-parameter-list:
14699 template-parameter
14700 template-parameter-list , template-parameter
14702 Returns a TREE_LIST. Each node represents a template parameter.
14703 The nodes are connected via their TREE_CHAINs. */
14705 static tree
14707 {
14712 /* The loop below parses the template parms. We first need to know
14713 the total number of template parms to be able to compute proper
14714 canonical types of each dependent type. So after the loop, when
14715 we know the total number of template parms,
14716 end_template_parm_list computes the proper canonical types and
14717 fixes up the dependent types accordingly. */
14719 {
14720 tree parameter;
14723 location_t parm_loc;
14725 /* Parse the template-parameter. */
14730 /* Add it to the list. */
14733 parm_loc,
14734 parameter,
14735 is_non_type,
14736 is_parameter_pack);
14737 else
14738 {
14741 }
14743 /* If the next token is not a `,', we're done. */
14746 /* Otherwise, consume the `,' token. */
14748 }
14751 }
14753 /* Parse a introduction-list.
14755 introduction-list:
14756 introduced-parameter
14757 introduction-list , introduced-parameter
14759 introduced-parameter:
14760 ...[opt] identifier
14762 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14763 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14764 WILDCARD_DECL will also have DECL_NAME set and token location in
14765 DECL_SOURCE_LOCATION. */
14767 static tree
14769 {
14773 {
14778 /* Build placeholder. */
14786 /* If the next token is not a `,', we're done. */
14789 /* Otherwise, consume the `,' token. */
14791 }
14793 /* Convert the vec into a TREE_VEC. */
14796 tree parm;
14802 }
14804 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14805 is an abstract declarator. */
14809 {
14814 }
14816 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14817 is an abstract declarator. */
14821 {
14825 else
14827 }
14829 /* Returns true if DECL represents a constrained-parameter. */
14833 {
14838 }
14840 /* Returns true if PARM declares a constrained-parameter. */
14844 {
14846 }
14848 /* Check that the type parameter is only a declarator-id, and that its
14849 type is not cv-qualified. */
14851 bool
14854 {
14859 {
14862 }
14864 /* Don't allow cv-qualified type parameters. */
14867 {
14870 }
14873 }
14875 /* Finish parsing/processing a template type parameter and checking
14876 various restrictions. */
14880 tree id,
14882 {
14885 else
14887 }
14889 static tree
14891 {
14892 /* FIXME: This should probably be copied, and we may need to adjust
14893 the template parameter depths. */
14903 }
14905 /* Finish parsing/processing a template template parameter by borrowing
14906 the template parameter list from the prototype parameter. */
14908 static tree
14910 tree proto,
14911 tree id,
14913 {
14917 }
14919 /* Create a new non-type template parameter from the given PARM
14920 declarator. */
14922 static tree
14925 {
14931 }
14933 /* Build a constrained template parameter based on the PARMDECL
14934 declarator. The type of PARMDECL is the constrained type, which
14935 refers to the prototype template parameter that ultimately
14936 specifies the type of the declared parameter. */
14938 static tree
14943 {
14949 /* A template parameter constrained by a variadic concept shall also
14950 be declared as a template parameter pack. */
14955 /* Build the parameter. Return an error if the declarator was invalid. */
14956 tree parm;
14961 parmdecl);
14962 else
14967 /* Finish the parameter decl and create a node attaching the
14968 default argument and constraint. */
14973 }
14975 /* Returns true if the parsed type actually represents the declaration
14976 of a type template-parameter. */
14980 {
14983 }
14986 /* Returns true if the parsed type actually represents the declaration of
14987 a template template-parameter. */
14989 static bool
14991 {
14994 }
14996 /* Parse a default argument for a type template-parameter.
14997 Note that diagnostics are handled in cp_parser_template_parameter. */
14999 static tree
15001 {
15004 /* Consume the `=' token. */
15009 /* Parse the default-argument. */
15015 {
15019 }
15022 }
15024 /* Parse a default argument for a template template-parameter. */
15026 static tree
15028 {
15033 /* Consume the `='. */
15035 /* Parse the id-expression. */
15037 /* save token before parsing the id-expression, for error
15038 reporting */
15040 tree default_argument
15048 /* If the id-expression was a template-id that refers to
15049 a template-class, we already have the declaration here,
15050 so no further lookup is needed. */
15051 ;
15052 else
15053 /* Look up the name. */
15054 default_argument
15056 none_type,
15062 /* See if the default argument is valid. */
15066 }
15068 /* Parse a template-parameter.
15070 template-parameter:
15071 type-parameter
15072 parameter-declaration
15074 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15075 the parameter. The TREE_PURPOSE is the default value, if any.
15076 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15077 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15078 set to true iff this parameter is a parameter pack. */
15080 static tree
15083 {
15086 tree parm;
15088 /* Assume it is a type parameter or a template parameter. */
15090 /* Assume it not a parameter pack. */
15092 /* Peek at the next token. */
15094 /* If it is `class' or `template', we have a type-parameter. */
15097 /* If it is `class' or `typename' we do not know yet whether it is a
15098 type parameter or a non-type parameter. Consider:
15100 template <typename T, typename T::X X> ...
15102 or:
15104 template <class C, class D*> ...
15106 Here, the first parameter is a type parameter, and the second is
15107 a non-type parameter. We can tell by looking at the token after
15108 the identifier -- if it is a `,', `=', or `>' then we have a type
15109 parameter. */
15111 {
15112 /* Peek at the token after `class' or `typename'. */
15114 /* If it's an ellipsis, we have a template type parameter
15115 pack. */
15118 /* If it's an identifier, skip it. */
15121 /* Now, see if the token looks like the end of a template
15122 parameter. */
15127 }
15129 /* Otherwise, it is a non-type parameter or a constrained parameter.
15131 [temp.param]
15133 When parsing a default template-argument for a non-type
15134 template-parameter, the first non-nested `>' is taken as the end
15135 of the template parameter-list rather than a greater-than
15136 operator. */
15137 parameter_declarator
15144 /* If the parameter declaration is marked as a parameter pack, set
15145 *IS_PARAMETER_PACK to notify the caller. */
15150 {
15151 /* Can happen in some cases of erroneous input (c++/34892). */
15153 /* Consume the `...' for better error recovery. */
15155 }
15157 // The parameter may have been constrained.
15160 parameter_declarator,
15161 is_non_type,
15162 is_parameter_pack);
15164 // Now we're sure that the parameter is a non-type parameter.
15175 }
15177 /* Parse a type-parameter.
15179 type-parameter:
15180 class identifier [opt]
15181 class identifier [opt] = type-id
15182 typename identifier [opt]
15183 typename identifier [opt] = type-id
15184 template < template-parameter-list > class identifier [opt]
15185 template < template-parameter-list > class identifier [opt]
15186 = id-expression
15188 GNU Extension (variadic templates):
15190 type-parameter:
15191 class ... identifier [opt]
15192 typename ... identifier [opt]
15194 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15195 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15196 the declaration of the parameter.
15198 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15200 static tree
15202 {
15204 tree parameter;
15206 /* Look for a keyword to tell us what kind of parameter this is. */
15212 {
15215 {
15216 tree identifier;
15217 tree default_argument;
15219 /* If the next token is an ellipsis, we have a template
15220 argument pack. */
15222 {
15223 /* Consume the `...' token. */
15228 }
15230 /* If the next token is an identifier, then it names the
15231 parameter. */
15234 else
15237 /* Create the parameter. */
15240 /* If the next token is an `=', we have a default argument. */
15242 {
15243 default_argument
15246 /* Template parameter packs cannot have default
15247 arguments. */
15249 {
15252 "template parameter pack %qD cannot have a "
15254 else
15256 "template parameter packs cannot have "
15259 }
15262 }
15263 else
15266 /* Create the combined representation of the parameter and the
15267 default argument. */
15269 }
15273 {
15274 tree identifier;
15275 tree default_argument;
15277 /* Look for the `<'. */
15279 /* Parse the template-parameter-list. */
15281 /* Look for the `>'. */
15284 // If template requirements are present, parse them.
15286 {
15291 }
15293 /* Look for the `class' or 'typename' keywords. */
15295 /* If the next token is an ellipsis, we have a template
15296 argument pack. */
15298 {
15299 /* Consume the `...' token. */
15304 }
15305 /* If the next token is an `=', then there is a
15306 default-argument. If the next token is a `>', we are at
15307 the end of the parameter-list. If the next token is a `,',
15308 then we are at the end of this parameter. */
15312 {
15314 /* Treat invalid names as if the parameter were nameless. */
15317 }
15318 else
15321 /* Create the template parameter. */
15323 identifier);
15325 /* If the next token is an `=', then there is a
15326 default-argument. */
15328 {
15329 default_argument
15332 /* Template parameter packs cannot have default
15333 arguments. */
15335 {
15338 "template parameter pack %qD cannot "
15340 identifier);
15341 else
15345 }
15346 }
15347 else
15350 /* Create the combined representation of the parameter and the
15351 default argument. */
15353 }
15359 }
15362 }
15364 /* Parse a template-id.
15366 template-id:
15367 template-name < template-argument-list [opt] >
15369 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15370 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15371 returned. Otherwise, if the template-name names a function, or set
15372 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15373 names a class, returns a TYPE_DECL for the specialization.
15375 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15376 uninstantiated templates. */
15378 static tree
15384 {
15385 tree templ;
15386 tree arguments;
15387 tree template_id;
15392 /* If the next token corresponds to a template-id, there is no need
15393 to reparse it. */
15396 {
15399 }
15401 /* Avoid performing name lookup if there is no possibility of
15402 finding a template-id. */
15405 && !cp_parser_nth_token_starts_template_argument_list_p
15407 {
15410 }
15412 /* Remember where the template-id starts. */
15418 /* Parse the template-name. */
15421 check_dependency_p,
15422 is_declaration,
15423 tag_type,
15426 {
15429 }
15431 /* Since we're going to preserve any side-effects from this parse, set up a
15432 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15433 in the template arguments. */
15436 /* If we find the sequence `[:' after a template-name, it's probably
15437 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15438 parse correctly the argument list. */
15445 {
15447 /* Change `:' into `::'. */
15449 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15450 CPP_LESS. */
15453 /* Parse the arguments. */
15456 {
15457 /* If we couldn't parse an argument list, then we revert our changes
15458 and return simply an error. Maybe this is not a template-id
15459 after all. */
15464 }
15465 /* Otherwise, emit an error about the invalid digraph, but continue
15466 parsing because we got our argument list. */
15469 {
15472 "%<<:%> is an alternate spelling for %<[%>."
15475 {
15477 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15480 }
15481 }
15482 }
15483 else
15484 {
15485 /* Look for the `<' that starts the template-argument-list. */
15487 {
15490 }
15491 /* Parse the arguments. */
15493 }
15495 /* Build a representation of the specialization. */
15498 TEMPLATE_ID_EXPR,
15502 {
15504 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15505 template (rather than some instantiation thereof) only if
15506 is not nested within some other construct. For example, in
15507 "template <typename T> void f(T) { A<T>::", A<T> is just an
15508 instantiation of A. */
15511 CPP_SCOPE));
15512 template_id
15514 }
15515 /* A template-like identifier may be a partial concept id. */
15521 {
15525 }
15526 else
15527 {
15528 /* If it's not a class-template or a template-template, it should be
15529 a function-template. */
15537 }
15539 /* If parsing tentatively, replace the sequence of tokens that makes
15540 up the template-id with a CPP_TEMPLATE_ID token. That way,
15541 should we re-parse the token stream, we will not have to repeat
15542 the effort required to do the parse, nor will we issue duplicate
15543 error messages about problems during instantiation of the
15544 template. */
15546 /* Don't do this if we had a parse error in a declarator; re-parsing
15547 might succeed if a name changes meaning (60361). */
15551 {
15554 /* Reset the contents of the START_OF_ID token. */
15557 /* Update the location to be of the form:
15558 template-name < template-argument-list [opt] >
15559 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15560 with caret == start at the start of the template-name,
15561 ranging until the closing '>'. */
15562 location_t finish_loc
15564 location_t combined_loc
15568 /* Retrieve any deferred checks. Do not pop this access checks yet
15569 so the memory will not be reclaimed during token replacing below. */
15575 /* Purge all subsequent tokens. */
15578 /* ??? Can we actually assume that, if template_id ==
15579 error_mark_node, we will have issued a diagnostic to the
15580 user, as opposed to simply marking the tentative parse as
15581 failed? */
15584 }
15588 }
15590 /* Parse a template-name.
15592 template-name:
15593 identifier
15595 The standard should actually say:
15597 template-name:
15598 identifier
15599 operator-function-id
15601 A defect report has been filed about this issue.
15603 A conversion-function-id cannot be a template name because they cannot
15604 be part of a template-id. In fact, looking at this code:
15606 a.operator K<int>()
15608 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15609 It is impossible to call a templated conversion-function-id with an
15610 explicit argument list, since the only allowed template parameter is
15611 the type to which it is converting.
15613 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15614 `template' keyword, in a construction like:
15616 T::template f<3>()
15618 In that case `f' is taken to be a template-name, even though there
15619 is no way of knowing for sure.
15621 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15622 name refers to a set of overloaded functions, at least one of which
15623 is a template, or an IDENTIFIER_NODE with the name of the template,
15624 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15625 names are looked up inside uninstantiated templates. */
15627 static tree
15634 {
15635 tree identifier;
15636 tree decl;
15637 tree fns;
15640 /* If the next token is `operator', then we have either an
15641 operator-function-id or a conversion-function-id. */
15643 {
15644 /* We don't know whether we're looking at an
15645 operator-function-id or a conversion-function-id. */
15647 /* Try an operator-function-id. */
15649 /* If that didn't work, try a conversion-function-id. */
15651 {
15654 }
15655 }
15656 /* Look for the identifier. */
15657 else
15660 /* If we didn't find an identifier, we don't have a template-id. */
15664 /* If the name immediately followed the `template' keyword, then it
15665 is a template-name. However, if the next token is not `<', then
15666 we do not treat it as a template-name, since it is not being used
15667 as part of a template-id. This enables us to handle constructs
15668 like:
15670 template <typename T> struct S { S(); };
15671 template <typename T> S<T>::S();
15673 correctly. We would treat `S' as a template -- if it were `S<T>'
15674 -- but we do not if there is no `<'. */
15678 {
15679 /* In a declaration, in a dependent context, we pretend that the
15680 "template" keyword was present in order to improve error
15681 recovery. For example, given:
15683 template <typename T> void f(T::X<int>);
15685 we want to treat "X<int>" as a template-id. */
15687 && !template_keyword_p
15689 && check_dependency_p
15691 /* Do not do this for dtors (or ctors), since they never
15692 need the template keyword before their name. */
15694 {
15697 /* Explain what went wrong. */
15699 identifier);
15702 /* If parsing tentatively, find the location of the "<" token. */
15705 /* Parse the template arguments so that we can issue error
15706 messages about them. */
15709 /* Skip tokens until we find a good place from which to
15710 continue parsing. */
15715 /* If parsing tentatively, permanently remove the
15716 template argument list. That will prevent duplicate
15717 error messages from being issued about the missing
15718 "template" keyword. */
15725 }
15727 /* If the "template" keyword is present, then there is generally
15728 no point in doing name-lookup, so we just return IDENTIFIER.
15729 But, if the qualifying scope is non-dependent then we can
15730 (and must) do name-lookup normally. */
15735 {
15736 /* We're optimizing away the call to cp_parser_lookup_name, but we
15737 still need to do this. */
15740 }
15741 }
15743 /* Look up the name. */
15745 tag_type,
15748 check_dependency_p,
15754 /* If DECL is a template, then the name was a template-name. */
15756 {
15760 }
15761 else
15762 {
15765 /* The standard does not explicitly indicate whether a name that
15766 names a set of overloaded declarations, some of which are
15767 templates, is a template-name. However, such a name should
15768 be a template-name; otherwise, there is no way to form a
15769 template-id for the overloaded templates. */
15777 {
15778 /* The name does not name a template. */
15781 }
15782 }
15784 /* If DECL is dependent, and refers to a function, then just return
15785 its name; we will look it up again during template instantiation. */
15787 {
15791 }
15794 }
15796 /* Parse a template-argument-list.
15798 template-argument-list:
15799 template-argument ... [opt]
15800 template-argument-list , template-argument ... [opt]
15802 Returns a TREE_VEC containing the arguments. */
15804 static tree
15806 {
15811 tree vec;
15818 /* Even if the template-id appears in an integral
15819 constant-expression, the contents of the argument list do
15820 not. */
15826 /* Parse the arguments. */
15827 do
15828 {
15829 tree argument;
15832 /* Consume the comma. */
15835 /* Parse the template-argument. */
15838 /* If the next token is an ellipsis, we're expanding a template
15839 argument pack. */
15841 {
15843 {
15847 }
15848 /* Consume the `...' token. */
15851 /* Make the argument into a TYPE_PACK_EXPANSION or
15852 EXPR_PACK_EXPANSION. */
15854 }
15857 {
15861 {
15864 }
15865 else
15867 }
15869 }
15885 }
15887 /* Parse a template-argument.
15889 template-argument:
15890 assignment-expression
15891 type-id
15892 id-expression
15894 The representation is that of an assignment-expression, type-id, or
15895 id-expression -- except that the qualified id-expression is
15896 evaluated, so that the value returned is either a DECL or an
15897 OVERLOAD.
15899 Although the standard says "assignment-expression", it forbids
15900 throw-expressions or assignments in the template argument.
15901 Therefore, we use "conditional-expression" instead. */
15903 static tree
15905 {
15906 tree argument;
15912 cp_id_kind idk;
15914 /* There's really no way to know what we're looking at, so we just
15915 try each alternative in order.
15917 [temp.arg]
15919 In a template-argument, an ambiguity between a type-id and an
15920 expression is resolved to a type-id, regardless of the form of
15921 the corresponding template-parameter.
15923 Therefore, we try a type-id first. */
15926 /* If there was no error parsing the type-id but the next token is a
15927 '>>', our behavior depends on which dialect of C++ we're
15928 parsing. In C++98, we probably found a typo for '> >'. But there
15929 are type-id which are also valid expressions. For instance:
15931 struct X { int operator >> (int); };
15932 template <int V> struct Foo {};
15933 Foo<X () >> 5> r;
15935 Here 'X()' is a valid type-id of a function type, but the user just
15936 wanted to write the expression "X() >> 5". Thus, we remember that we
15937 found a valid type-id, but we still try to parse the argument as an
15938 expression to see what happens.
15940 In C++0x, the '>>' will be considered two separate '>'
15941 tokens. */
15945 {
15948 }
15949 else
15950 {
15951 /* If the next token isn't a `,' or a `>', then this argument wasn't
15952 really finished. This means that the argument is not a valid
15953 type-id. */
15956 /* If that worked, we're done. */
15959 }
15960 /* We're still not sure what the argument will be. */
15962 /* Try a template. */
15970 /* If the next token isn't a `,' or a `>', then this argument wasn't
15971 really finished. */
15975 {
15976 /* Figure out what is being referred to. If the id-expression
15977 was for a class template specialization, then we will have a
15978 TYPE_DECL at this point. There is no need to do name lookup
15979 at this point in that case. */
15982 none_type,
15988 /* Handle a constrained-type-specifier for a non-type template
15989 parameter. */
15995 }
15997 {
16001 }
16002 /* It must be a non-type argument. In C++17 any constant-expression is
16003 allowed. */
16007 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16009 -- an integral constant-expression of integral or enumeration
16010 type; or
16012 -- the name of a non-type template-parameter; or
16014 -- the name of an object or function with external linkage...
16016 -- the address of an object or function with external linkage...
16018 -- a pointer to member... */
16019 /* Look for a non-type template parameter. */
16021 {
16033 }
16035 /* If the next token is "&", the argument must be the address of an
16036 object or function with external linkage. */
16039 {
16042 }
16043 /* See if we might have an id-expression. */
16050 {
16053 address_p,
16060 else
16061 {
16062 tree probe;
16065 {
16066 /* Strip the dereference temporarily. */
16069 }
16071 /* If we're in a template, we represent a qualified-id referring
16072 to a static data member as a SCOPE_REF even if the scope isn't
16073 dependent so that we can check access control later. */
16078 {
16079 /* A variable without external linkage might still be a
16080 valid constant-expression, so no error is issued here
16081 if the external-linkage check fails. */
16084 }
16086 /* All overloaded functions are allowed; if the external
16087 linkage test does not pass, an error will be issued
16088 later. */
16089 ;
16093 /* A pointer-to-member. */
16094 ;
16096 ;
16097 else
16101 {
16104 tf_warning_or_error);
16105 else
16108 }
16109 }
16110 }
16111 /* If the argument started with "&", there are no other valid
16112 alternatives at this point. */
16114 {
16117 }
16119 general_expr:
16120 /* If the argument wasn't successfully parsed as a type-id followed
16121 by '>>', the argument can only be a constant expression now.
16122 Otherwise, we try parsing the constant-expression tentatively,
16123 because the argument could really be a type-id. */
16129 else
16130 {
16131 /* With C++17 generalized non-type template arguments we need to handle
16132 lvalue constant expressions, too. */
16135 }
16143 /* We did our best to parse the argument as a non type-id, but that
16144 was the only alternative that matched (albeit with a '>' after
16145 it). We can assume it's just a typo from the user, and a
16146 diagnostic will then be issued. */
16148 }
16150 /* Parse an explicit-instantiation.
16152 explicit-instantiation:
16153 template declaration
16155 Although the standard says `declaration', what it really means is:
16157 explicit-instantiation:
16158 template decl-specifier-seq [opt] declarator [opt] ;
16160 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16161 supposed to be allowed. A defect report has been filed about this
16162 issue.
16164 GNU Extension:
16166 explicit-instantiation:
16167 storage-class-specifier template
16168 decl-specifier-seq [opt] declarator [opt] ;
16169 function-specifier template
16170 decl-specifier-seq [opt] declarator [opt] ; */
16172 static void
16174 {
16176 cp_decl_specifier_seq decl_specifiers;
16181 /* Look for an (optional) storage-class-specifier or
16182 function-specifier. */
16184 {
16185 extension_specifier
16188 extension_specifier
16191 }
16193 /* Look for the `template' keyword. */
16195 /* Let the front end know that we are processing an explicit
16196 instantiation. */
16198 /* [temp.explicit] says that we are supposed to ignore access
16199 control while processing explicit instantiation directives. */
16201 /* Parse a decl-specifier-seq. */
16203 CP_PARSER_FLAGS_OPTIONAL,
16206 /* If there was exactly one decl-specifier, and it declared a class,
16207 and there's no declarator, then we have an explicit type
16208 instantiation. */
16210 {
16211 tree type;
16215 /* Turn access control back on for names used during
16216 template instantiation. */
16221 }
16222 else
16223 {
16225 tree decl;
16227 /* Parse the declarator. */
16228 declarator
16239 {
16242 "explicit instantiation shall not use"
16246 "explicit instantiation shall not use"
16251 /* Turn access control back on for names used during
16252 template instantiation. */
16254 /* Do the explicit instantiation. */
16256 }
16257 else
16258 {
16260 /* Skip the body of the explicit instantiation. */
16262 }
16263 }
16264 /* We're done with the instantiation. */
16270 }
16272 /* Parse an explicit-specialization.
16274 explicit-specialization:
16275 template < > declaration
16277 Although the standard says `declaration', what it really means is:
16279 explicit-specialization:
16280 template <> decl-specifier [opt] init-declarator [opt] ;
16281 template <> function-definition
16282 template <> explicit-specialization
16283 template <> template-declaration */
16285 static void
16287 {
16291 /* Look for the `template' keyword. */
16293 /* Look for the `<'. */
16295 /* Look for the `>'. */
16297 /* We have processed another parameter list. */
16299 /* [temp]
16301 A template ... explicit specialization ... shall not have C
16302 linkage. */
16304 {
16306 /* Give it C++ linkage to avoid confusing other parts of the
16307 front end. */
16310 }
16311 else
16313 /* Let the front end know that we are beginning a specialization. */
16315 {
16318 }
16320 /* If the next keyword is `template', we need to figure out whether
16321 or not we're looking a template-declaration. */
16323 {
16328 else
16330 }
16331 else
16332 /* Parse the dependent declaration. */
16338 /* We're done with the specialization. */
16340 /* For the erroneous case of a template with C linkage, we pushed an
16341 implicit C++ linkage scope; exit that scope now. */
16344 /* We're done with this parameter list. */
16346 }
16348 /* Parse a type-specifier.
16350 type-specifier:
16351 simple-type-specifier
16352 class-specifier
16353 enum-specifier
16354 elaborated-type-specifier
16355 cv-qualifier
16357 GNU Extension:
16359 type-specifier:
16360 __complex__
16362 Returns a representation of the type-specifier. For a
16363 class-specifier, enum-specifier, or elaborated-type-specifier, a
16364 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16366 The parser flags FLAGS is used to control type-specifier parsing.
16368 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16369 in a decl-specifier-seq.
16371 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16372 class-specifier, enum-specifier, or elaborated-type-specifier, then
16373 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16374 if a type is declared; 2 if it is defined. Otherwise, it is set to
16375 zero.
16377 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16378 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16379 is set to FALSE. */
16381 static tree
16383 cp_parser_flags flags,
16388 {
16394 /* Assume this type-specifier does not declare a new type. */
16397 /* And that it does not specify a cv-qualifier. */
16400 /* Peek at the next token. */
16403 /* If we're looking at a keyword, we can use that to guide the
16404 production we choose. */
16407 {
16412 /* Look for the enum-specifier. */
16414 /* If that worked, we're done. */
16416 {
16421 type_spec,
16422 token,
16425 }
16426 else
16429 /* Any of these indicate either a class-specifier, or an
16430 elaborated-type-specifier. */
16437 /* Parse tentatively so that we can back up if we don't find a
16438 class-specifier. */
16440 /* Look for the class-specifier. */
16443 /* If that worked, we're done. */
16445 {
16450 type_spec,
16451 token,
16454 }
16456 /* Fall through. */
16457 elaborated_type_specifier:
16458 /* We're declaring (not defining) a class or enum. */
16462 /* Fall through. */
16464 /* Look for an elaborated-type-specifier. */
16465 type_spec
16466 = (cp_parser_elaborated_type_specifier
16469 is_declaration));
16472 type_spec,
16473 token,
16496 /* The `__complex__' keyword is a GNU extension. */
16502 }
16504 /* Handle simple keywords. */
16506 {
16508 {
16511 }
16513 }
16515 /* If we do not already have a type-specifier, assume we are looking
16516 at a simple-type-specifier. */
16518 decl_specs,
16519 flags);
16521 /* If we didn't find a type-specifier, and a type-specifier was not
16522 optional in this context, issue an error message. */
16524 {
16527 }
16530 }
16532 /* Parse a simple-type-specifier.
16534 simple-type-specifier:
16535 :: [opt] nested-name-specifier [opt] type-name
16536 :: [opt] nested-name-specifier template template-id
16537 char
16538 wchar_t
16539 bool
16540 short
16541 int
16542 long
16543 signed
16544 unsigned
16545 float
16546 double
16547 void
16549 C++11 Extension:
16551 simple-type-specifier:
16552 auto
16553 decltype ( expression )
16554 char16_t
16555 char32_t
16556 __underlying_type ( type-id )
16558 C++17 extension:
16560 nested-name-specifier(opt) template-name
16562 GNU Extension:
16564 simple-type-specifier:
16565 __int128
16566 __typeof__ unary-expression
16567 __typeof__ ( type-id )
16568 __typeof__ ( type-id ) { initializer-list , [opt] }
16570 Concepts Extension:
16572 simple-type-specifier:
16573 constrained-type-specifier
16575 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16576 appropriately updated. */
16578 static tree
16581 cp_parser_flags flags)
16582 {
16587 /* Peek at the next token. */
16590 /* If we're looking at a keyword, things are easy. */
16592 {
16627 {
16630 }
16659 {
16660 /* The 'auto' might be the placeholder return type for a function decl
16661 with trailing return type. */
16670 {
16672 {
16679 }
16682 {
16685 }
16688 }
16692 {
16695 }
16698 {
16701 }
16702 else
16706 {
16709 "use of %<auto%> in lambda parameter declaration "
16710 "only available with "
16712 }
16715 "use of %<auto%> in parameter declaration "
16716 "only available with "
16720 "ISO C++ forbids use of %<auto%> in parameter "
16722 }
16723 else
16728 /* Since DR 743, decltype can either be a simple-type-specifier by
16729 itself or begin a nested-name-specifier. Parsing it will replace
16730 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16731 handling below decide what to do. */
16737 /* Consume the `typeof' token. */
16739 /* Parse the operand to `typeof'. */
16741 /* If it is not already a TYPE, take its type. */
16747 token,
16756 token,
16766 token,
16771 }
16773 /* If token is an already-parsed decltype not followed by ::,
16774 it's a simple-type-specifier. */
16777 {
16780 {
16782 token,
16784 /* Remember that we are handling a decltype in order to
16785 implement the resolution of DR 1510 when the argument
16786 isn't instantiation dependent. */
16788 }
16791 }
16793 /* If the type-specifier was for a built-in type, we're done. */
16795 {
16796 /* Record the type. */
16803 type,
16804 token,
16809 /* Consume the token. */
16815 /* There is no valid C++ program where a non-template type is
16816 followed by a "<". That usually indicates that the user thought
16817 that the type was a template. */
16822 }
16824 /* The type-specifier must be a user-defined type. */
16826 {
16830 /* Don't gobble tokens or issue error messages if this is an
16831 optional type-specifier. */
16837 /* Look for the optional `::' operator. */
16838 global_p
16842 /* Look for the nested-name specifier. */
16843 qualified_p
16850 /* If we have seen a nested-name-specifier, and the next token
16851 is `template', then we are using the template-id production. */
16854 {
16855 /* Look for the template-id. */
16859 none_type,
16861 /* If the template-id did not name a type, we are out of
16862 luck. */
16864 {
16867 }
16868 }
16869 /* Otherwise, look for a type-name. */
16870 else
16872 /* Keep track of all name-lookups performed in class scopes. */
16874 && !global_p
16875 && !qualified_p
16879 /* If it didn't work out, we don't have a TYPE. */
16884 {
16898 {
16900 none_type,
16910 else
16911 {
16916 }
16917 }
16918 else
16924 }
16927 token,
16929 }
16931 /* If we didn't get a type-name, issue an error message. */
16933 {
16936 }
16939 {
16940 /* See if TYPE is an Objective-C type, and if so, parse and
16941 accept any protocol references following it. Do this before
16942 the cp_parser_check_for_invalid_template_id() call, because
16943 Objective-C types can be followed by '<...>' which would
16944 enclose protocol names rather than template arguments, and so
16945 everything is fine. */
16948 {
16952 /* Clobber the "unqualified" type previously entered into
16953 DECL_SPECS with the new, improved protocol-qualified version. */
16958 }
16960 /* There is no valid C++ program where a non-template type is
16961 followed by a "<". That usually indicates that the user
16962 thought that the type was a template. */
16964 none_type,
16966 }
16969 }
16971 /* Parse a type-name.
16973 type-name:
16974 class-name
16975 enum-name
16976 typedef-name
16977 simple-template-id [in c++0x]
16979 enum-name:
16980 identifier
16982 typedef-name:
16983 identifier
16985 Concepts:
16987 type-name:
16988 concept-name
16989 partial-concept-id
16991 concept-name:
16992 identifier
16994 Returns a TYPE_DECL for the type. */
16996 static tree
16998 {
17000 }
17002 /* See above. */
17003 static tree
17005 {
17006 tree type_decl;
17008 /* We can't know yet whether it is a class-name or not. */
17010 /* Try a class-name. */
17012 typename_keyword_p,
17014 none_type,
17018 /* If it's not a class-name, keep looking. */
17020 {
17022 /* It must be a typedef-name or an enum-name. */
17026 /* It is either a simple-template-id representing an
17027 instantiation of an alias template... */
17031 none_type,
17033 /* Note that this must be an instantiation of an alias template
17034 because [temp.names]/6 says:
17036 A template-id that names an alias template specialization
17037 is a type-name.
17039 Whereas [temp.names]/7 says:
17041 A simple-template-id that names a class template
17042 specialization is a class-name.
17044 With concepts, this could also be a partial-concept-id that
17045 declares a non-type template parameter. */
17052 else
17056 /* ... Or a typedef-name or an enum-name. */
17058 }
17061 }
17063 /* Check if DECL and ARGS can form a constrained-type-specifier.
17064 If ARGS is non-null, we try to form a concept check of the
17065 form DECL<?, ARGS> where ? is a wildcard that matches any
17066 kind of template argument. If ARGS is NULL, then we try to
17067 form a concept check of the form DECL<?>. */
17069 static tree
17072 {
17075 /* If we a constrained-type-specifier cannot be deduced. */
17079 /* A constrained type specifier can only be found in an
17080 overload set or as a reference to a template declaration.
17082 FIXME: This might be masking a bug. It's possible that
17083 that the deduction below is causing template specializations
17084 to be formed with the wildcard as an argument. */
17088 /* Try to build a call expression that evaluates the
17089 concept. This can fail if the overload set refers
17090 only to non-templates. */
17096 /* Deduce the checked constraint and the prototype parameter.
17098 FIXME: In certain cases, failure to deduce should be a
17099 diagnosable error. */
17100 tree conc;
17101 tree proto;
17105 /* In template parameter scope, this results in a constrained
17106 parameter. Return a descriptor of that parm. */
17110 /* In a parameter-declaration-clause, constrained-type
17111 specifiers result in invented template parameters. */
17113 {
17116 }
17117 else
17118 {
17119 /* Otherwise, we're in a context where the constrained
17120 type name is deduced and the constraint applies
17121 after deduction. */
17123 }
17126 }
17128 /* If DECL refers to a concept, return a TYPE_DECL representing
17129 the result of using the constrained type specifier in the
17130 current context. DECL refers to a concept if
17132 - it is an overload set containing a function concept taking a single
17133 type argument, or
17135 - it is a variable concept taking a single type argument. */
17137 static tree
17139 {
17145 else
17147 }
17149 /* Check if DECL and ARGS form a partial-concept-id. If so,
17150 assign ID to the resulting constrained placeholder.
17152 Returns true if the partial-concept-id designates a placeholder
17153 and false otherwise. Note that *id is set to NULL_TREE in
17154 this case. */
17156 static tree
17158 {
17160 }
17162 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17163 or a concept-name.
17165 enum-name:
17166 identifier
17168 typedef-name:
17169 identifier
17171 concept-name:
17172 identifier
17174 Returns a TYPE_DECL for the type. */
17176 static tree
17178 {
17179 tree type_decl;
17180 tree identifier;
17187 /* Look up the type-name. */
17192 /* If we found an overload set, then it may refer to a concept-name. */
17198 {
17199 /* See if this is an Objective-C type. */
17204 }
17206 /* Issue an error if we did not find a type-name. */
17208 /* In Objective-C, we have the complication that class names are
17209 normally type names and start declarations (eg, the
17210 "NSObject" in "NSObject *object;"), but can be used in an
17211 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17212 is an expression. So, a classname followed by a dot is not a
17213 valid type-name. */
17216 {
17221 }
17222 /* Remember that the name was used in the definition of the
17223 current class so that we can check later to see if the
17224 meaning would have been different after the class was
17225 entirely defined. */
17231 }
17233 /* Parse an elaborated-type-specifier. Note that the grammar given
17234 here incorporates the resolution to DR68.
17236 elaborated-type-specifier:
17237 class-key :: [opt] nested-name-specifier [opt] identifier
17238 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17239 enum-key :: [opt] nested-name-specifier [opt] identifier
17240 typename :: [opt] nested-name-specifier identifier
17241 typename :: [opt] nested-name-specifier template [opt]
17242 template-id
17244 GNU extension:
17246 elaborated-type-specifier:
17247 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17248 class-key attributes :: [opt] nested-name-specifier [opt]
17249 template [opt] template-id
17250 enum attributes :: [opt] nested-name-specifier [opt] identifier
17252 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17253 declared `friend'. If IS_DECLARATION is TRUE, then this
17254 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17255 something is being declared.
17257 Returns the TYPE specified. */
17259 static tree
17263 {
17265 tree identifier;
17268 tree globalscope;
17271 /* See if we're looking at the `enum' keyword. */
17273 {
17274 /* Consume the `enum' token. */
17276 /* Remember that it's an enumeration type. */
17278 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17279 enums) is used here. */
17282 {
17286 /* Consume the `struct' or `class' and parse it anyway. */
17288 }
17289 /* Parse the attributes. */
17291 }
17292 /* Or, it might be `typename'. */
17294 RID_TYPENAME))
17295 {
17296 /* Consume the `typename' token. */
17298 /* Remember that it's a `typename' type. */
17300 }
17301 /* Otherwise it must be a class-key. */
17302 else
17303 {
17307 /* Parse the attributes. */
17309 }
17311 /* Look for the `::' operator. */
17314 /* Look for the nested-name-specifier. */
17315 tree nested_name_specifier;
17317 {
17318 nested_name_specifier
17323 is_declaration);
17326 }
17327 else
17328 /* Even though `typename' is not present, the proposed resolution
17329 to Core Issue 180 says that in `class A<T>::B', `B' should be
17330 considered a type-name, even if `A<T>' is dependent. */
17331 nested_name_specifier
17336 is_declaration);
17337 /* For everything but enumeration types, consider a template-id.
17338 For an enumeration type, consider only a plain identifier. */
17340 {
17342 tree decl;
17344 /* Allow the `template' keyword. */
17346 /* If we didn't see `template', we don't know if there's a
17347 template-id or not. */
17350 /* Parse the template-id. */
17354 tag_type,
17355 is_declaration);
17356 /* If we didn't find a template-id, look for an ordinary
17357 identifier. */
17359 ;
17360 /* We can get here when cp_parser_template_id, called by
17361 cp_parser_class_name with tag_type == none_type, succeeds
17362 and caches a BASELINK. Then, when called again here,
17363 instead of failing and returning an error_mark_node
17364 returns it (see template/typename17.C in C++11).
17365 ??? Could we diagnose this earlier? */
17367 {
17370 }
17371 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17372 in effect, then we must assume that, upon instantiation, the
17373 template will correspond to a class. */
17377 typename_type,
17379 /* If the `typename' keyword is in effect and DECL is not a type
17380 decl, then type is non existent. */
17382 ;
17384 {
17388 /* If the next token is a semicolon, this must be a specialization,
17389 instantiation, or friend declaration. Check the scope while we
17390 still know whether or not we had a nested-name-specifier. */
17395 }
17398 }
17401 {
17406 {
17409 }
17411 /* For a `typename', we needn't call xref_tag. */
17417 /* Template parameter lists apply only if we are not within a
17418 function parameter list. */
17419 bool template_parm_lists_apply
17428 /* Look up a qualified name in the usual way. */
17430 {
17431 tree decl;
17432 tree ambiguous_decls;
17435 tag_type,
17442 /* If the lookup was ambiguous, an error will already have been
17443 issued. */
17447 /* If we are parsing friend declaration, DECL may be a
17448 TEMPLATE_DECL tree node here. However, we need to check
17449 whether this TEMPLATE_DECL results in valid code. Consider
17450 the following example:
17452 namespace N {
17453 template <class T> class C {};
17454 }
17455 class X {
17456 template <class T> friend class N::C; // #1, valid code
17457 };
17458 template <class T> class Y {
17459 friend class N::C; // #2, invalid code
17460 };
17462 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17463 name lookup of `N::C'. We see that friend declaration must
17464 be template for the code to be valid. Note that
17465 processing_template_decl does not work here since it is
17466 always 1 for the above two cases. */
17468 decl = (cp_parser_maybe_treat_template_as_class
17473 {
17475 identifier,
17478 }
17481 {
17485 allow_template);
17489 }
17491 /* Forward declarations of nested types, such as
17493 class C1::C2;
17494 class C1::C2::C3;
17496 are invalid unless all components preceding the final '::'
17497 are complete. If all enclosing types are complete, these
17498 declarations become merely pointless.
17500 Invalid forward declarations of nested types are errors
17501 caught elsewhere in parsing. Those that are pointless arrive
17502 here. */
17509 }
17510 else
17511 {
17512 /* An elaborated-type-specifier sometimes introduces a new type and
17513 sometimes names an existing type. Normally, the rule is that it
17514 introduces a new type only if there is not an existing type of
17515 the same name already in scope. For example, given:
17517 struct S {};
17518 void f() { struct S s; }
17520 the `struct S' in the body of `f' is the same `struct S' as in
17521 the global scope; the existing definition is used. However, if
17522 there were no global declaration, this would introduce a new
17523 local class named `S'.
17525 An exception to this rule applies to the following code:
17527 namespace N { struct S; }
17529 Here, the elaborated-type-specifier names a new type
17530 unconditionally; even if there is already an `S' in the
17531 containing scope this declaration names a new type.
17532 This exception only applies if the elaborated-type-specifier
17533 forms the complete declaration:
17535 [class.name]
17537 A declaration consisting solely of `class-key identifier ;' is
17538 either a redeclaration of the name in the current scope or a
17539 forward declaration of the identifier as a class name. It
17540 introduces the name into the current scope.
17542 We are in this situation precisely when the next token is a `;'.
17544 An exception to the exception is that a `friend' declaration does
17545 *not* name a new type; i.e., given:
17547 struct S { friend struct T; };
17549 `T' is not a new type in the scope of `S'.
17551 Also, `new struct S' or `sizeof (struct S)' never results in the
17552 definition of a new type; a new type can only be declared in a
17553 declaration context. */
17555 tag_scope ts;
17559 /* Friends have special name lookup rules. */
17563 CPP_SEMICOLON))
17564 /* This is a `class-key identifier ;' */
17566 else
17569 template_p =
17570 (template_parm_lists_apply
17573 /* An unqualified name was used to reference this type, so
17574 there were no qualifying templates. */
17582 }
17583 }
17588 /* Allow attributes on forward declarations of classes. */
17590 {
17600 else
17603 }
17606 {
17607 /* Indicate whether this class was declared as a `class' or as a
17608 `struct'. */
17612 }
17614 /* A "<" cannot follow an elaborated type specifier. If that
17615 happens, the user was probably trying to form a template-id. */
17620 }
17622 /* Parse an enum-specifier.
17624 enum-specifier:
17625 enum-head { enumerator-list [opt] }
17626 enum-head { enumerator-list , } [C++0x]
17628 enum-head:
17629 enum-key identifier [opt] enum-base [opt]
17630 enum-key nested-name-specifier identifier enum-base [opt]
17632 enum-key:
17633 enum
17634 enum class [C++0x]
17635 enum struct [C++0x]
17637 enum-base: [C++0x]
17638 : type-specifier-seq
17640 opaque-enum-specifier:
17641 enum-key identifier enum-base [opt] ;
17643 GNU Extensions:
17644 enum-key attributes[opt] identifier [opt] enum-base [opt]
17645 { enumerator-list [opt] }attributes[opt]
17646 enum-key attributes[opt] identifier [opt] enum-base [opt]
17647 { enumerator-list, }attributes[opt] [C++0x]
17649 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17650 if the token stream isn't an enum-specifier after all. */
17652 static tree
17654 {
17655 tree identifier;
17657 tree prev_scope;
17659 tree attributes;
17672 /* Parse tentatively so that we can back up if we don't find a
17673 enum-specifier. */
17676 /* Caller guarantees that the current token is 'enum', an identifier
17677 possibly follows, and the token after that is an opening brace.
17678 If we don't have an identifier, fabricate an anonymous name for
17679 the enumeration being defined. */
17682 /* Parse the "class" or "struct", which indicates a scoped
17683 enumeration type in C++0x. */
17686 {
17690 /* Consume the `struct' or `class' token. */
17694 }
17698 /* Clear the qualification. */
17703 /* Figure out in what scope the declaration is being placed. */
17709 nested_name_specifier
17717 {
17718 tree name;
17722 enum_type,
17727 input_location);
17729 {
17732 {
17733 /* Are template enums allowed in ISO? */
17737 /* ignore a typename reference, for it will be solved by name
17738 in start_enum. */
17740 }
17741 }
17744 else
17745 {
17750 }
17751 }
17752 else
17753 {
17756 else
17757 {
17763 }
17764 }
17767 /* Check for the `:' that denotes a specified underlying type in C++0x.
17768 Note that a ':' could also indicate a bitfield width, however. */
17770 {
17771 cp_decl_specifier_seq type_specifiers;
17773 /* Consume the `:'. */
17776 /* Parse the type-specifier-seq. */
17781 /* At this point this is surely not elaborated type specifier. */
17790 /* If that didn't work, stop. */
17792 {
17798 }
17799 }
17801 /* Look for the `{' but don't consume it yet. */
17803 {
17805 {
17808 {
17811 }
17812 }
17813 /* An opaque-enum-specifier must have a ';' here. */
17816 {
17819 {
17822 }
17823 }
17824 }
17830 {
17832 {
17836 }
17838 {
17840 }
17841 }
17843 /* Issue an error message if type-definitions are forbidden here. */
17846 else
17847 /* Create the new type. We do this before consuming the opening
17848 brace so the enum will be recorded as being on the line of its
17849 tag (or the 'enum' keyword, if there is no tag). */
17853 /* If the next token is not '{' it is an opaque-enum-specifier or an
17854 elaborated-type-specifier. */
17856 {
17860 {
17861 /* The following catches invalid code such as:
17862 enum class S<int>::E { A, B, C }; */
17870 {
17874 nested_name_specifier);
17876 }
17879 {
17881 "%qT for enum declaration does not name a class "
17884 }
17885 /* If that scope does not contain the scope in which the
17886 class was originally declared, the program is invalid. */
17888 nested_name_specifier))
17889 {
17892 "declaration of %qD in namespace %qD which does not "
17895 else
17897 "declaration of %qD in %qD which does not "
17901 }
17902 /* If that scope is the scope where the declaration is being placed
17903 the program is invalid. */
17907 {
17911 }
17912 }
17917 /* Consume the opening brace. */
17924 {
17928 }
17929 else
17930 {
17936 }
17940 /* If the next token is not '}', then there are some enumerators. */
17942 {
17946 }
17947 else
17950 /* Consume the final '}'. */
17956 }
17957 else
17958 {
17959 /* If a ';' follows, then it is an opaque-enum-specifier
17960 and additional restrictions apply. */
17962 {
17969 }
17970 }
17972 /* Look for trailing attributes to apply to this enumeration, and
17973 apply them if appropriate. */
17975 {
17978 trailing_attr,
17980 }
17982 /* Finish up the enumeration. */
17984 {
17989 }
17992 {
17994 {
17997 }
17999 {
18001 }
18002 }
18003 out:
18006 }
18008 /* Parse an enumerator-list. The enumerators all have the indicated
18009 TYPE.
18011 enumerator-list:
18012 enumerator-definition
18013 enumerator-list , enumerator-definition */
18015 static void
18017 {
18019 {
18020 /* Parse an enumerator-definition. */
18023 /* If the next token is not a ',', we've reached the end of
18024 the list. */
18027 /* Otherwise, consume the `,' and keep going. */
18029 /* If the next token is a `}', there is a trailing comma. */
18031 {
18036 }
18037 }
18038 }
18040 /* Parse an enumerator-definition. The enumerator has the indicated
18041 TYPE.
18043 enumerator-definition:
18044 enumerator
18045 enumerator = constant-expression
18047 enumerator:
18048 identifier
18050 GNU Extensions:
18052 enumerator-definition:
18053 enumerator attributes [opt]
18054 enumerator attributes [opt] = constant-expression */
18056 static void
18058 {
18059 tree identifier;
18060 tree value;
18061 location_t loc;
18063 /* Save the input location because we are interested in the location
18064 of the identifier and not the location of the explicit value. */
18067 /* Look for the identifier. */
18072 /* Parse any specified attributes. */
18075 /* If the next token is an '=', then there is an explicit value. */
18077 {
18078 /* Consume the `=' token. */
18080 /* Parse the value. */
18082 }
18083 else
18086 /* If we are processing a template, make sure the initializer of the
18087 enumerator doesn't contain any bare template parameter pack. */
18091 /* Create the enumerator. */
18093 }
18095 /* Parse a namespace-name.
18097 namespace-name:
18098 original-namespace-name
18099 namespace-alias
18101 Returns the NAMESPACE_DECL for the namespace. */
18103 static tree
18105 {
18106 tree identifier;
18107 tree namespace_decl;
18111 /* Get the name of the namespace. */
18116 /* Look up the identifier in the currently active scope. Look only
18117 for namespaces, due to:
18119 [basic.lookup.udir]
18121 When looking up a namespace-name in a using-directive or alias
18122 definition, only namespace names are considered.
18124 And:
18126 [basic.lookup.qual]
18128 During the lookup of a name preceding the :: scope resolution
18129 operator, object, function, and enumerator names are ignored.
18131 (Note that cp_parser_qualifying_entity only calls this
18132 function if the token after the name is the scope resolution
18133 operator.) */
18135 none_type,
18141 /* If it's not a namespace, issue an error. */
18144 {
18149 }
18152 }
18154 /* Parse a namespace-definition.
18156 namespace-definition:
18157 named-namespace-definition
18158 unnamed-namespace-definition
18160 named-namespace-definition:
18161 original-namespace-definition
18162 extension-namespace-definition
18164 original-namespace-definition:
18165 namespace identifier { namespace-body }
18167 extension-namespace-definition:
18168 namespace original-namespace-name { namespace-body }
18170 unnamed-namespace-definition:
18171 namespace { namespace-body } */
18173 static void
18175 {
18185 {
18189 }
18190 else
18193 /* Look for the `namespace' keyword. */
18196 /* Parse any specified attributes before the identifier. */
18199 /* Get the name of the namespace. We do not attempt to distinguish
18200 between an original-namespace-definition and an
18201 extension-namespace-definition at this point. The semantic
18202 analysis routines are responsible for that. */
18205 else
18208 /* Parse any specified attributes after the identifier. */
18211 {
18214 else
18216 }
18218 /* Start the namespace. */
18221 /* Parse any nested namespace definition. */
18223 {
18228 "nested namespace definitions only available with "
18233 {
18237 else
18238 {
18241 }
18244 }
18245 }
18247 /* Look for the `{' to validate starting the namespace. */
18250 /* "inline namespace" is equivalent to a stub namespace definition
18251 followed by a strong using directive. */
18253 {
18255 /* Set up namespace association. */
18259 /* Import the contents of the inline namespace. */
18263 }
18269 /* Parse the body of the namespace. */
18275 /* Finish the nested namespace definitions. */
18279 /* Finish the namespace. */
18282 /* Look for the final `}'. */
18284 }
18286 /* Parse a namespace-body.
18288 namespace-body:
18289 declaration-seq [opt] */
18291 static void
18293 {
18295 }
18297 /* Parse a namespace-alias-definition.
18299 namespace-alias-definition:
18300 namespace identifier = qualified-namespace-specifier ; */
18302 static void
18304 {
18305 tree identifier;
18306 tree namespace_specifier;
18310 /* Look for the `namespace' keyword. */
18312 /* Look for the identifier. */
18316 /* Look for the `=' token. */
18319 {
18321 /* Skip the definition. */
18326 }
18328 /* Look for the qualified-namespace-specifier. */
18329 namespace_specifier
18331 /* Look for the `;' token. */
18334 /* Register the alias in the symbol table. */
18336 }
18338 /* Parse a qualified-namespace-specifier.
18340 qualified-namespace-specifier:
18341 :: [opt] nested-name-specifier [opt] namespace-name
18343 Returns a NAMESPACE_DECL corresponding to the specified
18344 namespace. */
18346 static tree
18348 {
18349 /* Look for the optional `::'. */
18353 /* Look for the optional nested-name-specifier. */
18361 }
18363 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18364 access declaration.
18366 using-declaration:
18367 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18368 using :: unqualified-id ;
18370 access-declaration:
18371 qualified-id ;
18373 */
18375 static bool
18378 {
18382 tree decl;
18383 tree identifier;
18384 tree qscope;
18389 {
18392 }
18393 else
18394 {
18395 /* Look for the `using' keyword. */
18398 again:
18399 /* Peek at the next token. */
18401 /* See if it's `typename'. */
18403 {
18404 /* Remember that we've seen it. */
18406 /* Consume the `typename' token. */
18408 }
18409 }
18411 /* Look for the optional global scope qualification. */
18412 global_scope_p
18417 /* If we saw `typename', or didn't see `::', then there must be a
18418 nested-name-specifier present. */
18420 {
18426 {
18429 }
18430 }
18431 /* Otherwise, we could be in either of the two productions. In that
18432 case, treat the nested-name-specifier as optional. */
18433 else
18445 /* Something has already gone wrong; there's no need to parse
18446 further. Since an error has occurred, the return value of
18447 cp_parser_parse_definitely will be false, as required. */
18451 /* Parse the unqualified-id. */
18459 {
18464 }
18466 {
18471 "pack expansion in using-declaration only available "
18474 }
18476 /* The function we call to handle a using-declaration is different
18477 depending on what scope we are in. */
18479 ;
18482 /* [namespace.udecl]
18484 A using declaration shall not name a template-id. */
18487 else
18488 {
18490 {
18491 /* Create the USING_DECL. */
18498 {
18501 }
18502 else
18503 /* Add it to the list of members in this class. */
18505 }
18506 else
18507 {
18509 identifier,
18516 {
18519 }
18522 else
18524 }
18525 }
18529 {
18533 "comma-separated list in using-declaration only available "
18536 }
18538 /* Look for the final `;'. */
18543 "access declarations are deprecated "
18544 "in favour of using-declarations; "
18548 }
18550 /* Parse an alias-declaration.
18552 alias-declaration:
18553 using identifier attribute-specifier-seq [opt] = type-id */
18555 static tree
18557 {
18559 location_t id_location;
18561 cp_decl_specifier_seq decl_specs;
18565 /* Look for the `using' keyword. */
18566 cp_token *using_token
18588 /* Now we are going to parse the type-id of the declaration. */
18590 /*
18591 [dcl.type]/3 says:
18593 "A type-specifier-seq shall not define a class or enumeration
18594 unless it appears in the type-id of an alias-declaration (7.1.3) that
18595 is not the declaration of a template-declaration."
18597 In other words, if we currently are in an alias template, the
18598 type-id should not define a type.
18600 So let's set parser->type_definition_forbidden_message in that
18601 case; cp_parser_check_type_definition (called by
18602 cp_parser_class_specifier) will then emit an error if a type is
18603 defined in the type-id. */
18605 {
18609 }
18613 /* Restore the error message if need be. */
18619 {
18622 }
18624 /* A typedef-name can also be introduced by an alias-declaration. The
18625 identifier following the using keyword becomes a typedef-name. It has
18626 the same semantics as if it were introduced by the typedef
18627 specifier. In particular, it does not define a new type and it shall
18628 not appear in the type-id. */
18633 {
18636 ds_attribute,
18637 attrs_token);
18638 }
18640 ds_typedef,
18641 using_token);
18643 ds_alias,
18644 using_token);
18653 else
18659 // Attach constraints to the alias declaration.
18661 {
18665 }
18672 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18673 added into the symbol table; otherwise, return the TYPE_DECL. */
18677 {
18681 }
18684 }
18686 /* Parse a using-directive.
18688 using-directive:
18689 using namespace :: [opt] nested-name-specifier [opt]
18690 namespace-name ; */
18692 static void
18694 {
18695 tree namespace_decl;
18696 tree attribs;
18698 /* Look for the `using' keyword. */
18700 /* And the `namespace' keyword. */
18702 /* Look for the optional `::' operator. */
18704 /* And the optional nested-name-specifier. */
18710 /* Get the namespace being used. */
18712 /* And any specified attributes. */
18714 /* Update the symbol table. */
18716 /* Look for the final `;'. */
18718 }
18720 /* Parse an asm-definition.
18722 asm-definition:
18723 asm ( string-literal ) ;
18725 GNU Extension:
18727 asm-definition:
18728 asm volatile [opt] ( string-literal ) ;
18729 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18730 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18731 : asm-operand-list [opt] ) ;
18732 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18733 : asm-operand-list [opt]
18734 : asm-clobber-list [opt] ) ;
18735 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18736 : asm-clobber-list [opt]
18737 : asm-goto-list ) ; */
18739 static void
18741 {
18742 tree string;
18747 tree asm_stmt;
18755 /* Look for the `asm' keyword. */
18760 {
18763 }
18765 /* See if the next token is `volatile'. */
18768 {
18769 /* Remember that we saw the `volatile' keyword. */
18771 /* Consume the token. */
18773 }
18777 {
18778 /* Remember that we saw the `goto' keyword. */
18780 /* Consume the token. */
18782 }
18783 /* Look for the opening `('. */
18786 /* Look for the string. */
18789 {
18793 }
18795 /* If we're allowing GNU extensions, check for the extended assembly
18796 syntax. Unfortunately, the `:' tokens need not be separated by
18797 a space in C, and so, for compatibility, we tolerate that here
18798 too. Doing that means that we have to treat the `::' operator as
18799 two `:' tokens. */
18804 {
18809 /* The extended syntax was used. */
18812 /* Look for outputs. */
18814 {
18815 /* Consume the `:'. */
18817 /* Parse the output-operands. */
18819 CPP_COLON)
18821 CPP_SCOPE)
18823 CPP_CLOSE_PAREN)
18825 {
18829 }
18830 }
18831 /* If the next token is `::', there are no outputs, and the
18832 next token is the beginning of the inputs. */
18834 /* The inputs are coming next. */
18837 /* Look for inputs. */
18840 {
18841 /* Consume the `:' or `::'. */
18843 /* Parse the output-operands. */
18845 CPP_COLON)
18847 CPP_SCOPE)
18849 CPP_CLOSE_PAREN))
18850 {
18854 }
18855 }
18857 /* The clobbers are coming next. */
18860 /* Look for clobbers. */
18863 {
18865 /* Consume the `:' or `::'. */
18867 /* Parse the clobbers. */
18869 CPP_COLON)
18871 CPP_CLOSE_PAREN))
18873 }
18876 /* The labels are coming next. */
18879 /* Look for labels. */
18882 {
18884 /* Consume the `:' or `::'. */
18886 /* Parse the labels. */
18888 }
18892 }
18896 /* Look for the closing `)'. */
18904 {
18905 /* Create the ASM_EXPR. */
18907 {
18910 /* If the extended syntax was not used, mark the ASM_EXPR. */
18912 {
18918 }
18919 }
18920 else
18922 }
18923 }
18925 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18926 type that comes from the decl-specifier-seq. */
18928 static tree
18930 {
18933 {
18946 }
18949 }
18951 /* Declarators [gram.dcl.decl] */
18953 /* Parse an init-declarator.
18955 init-declarator:
18956 declarator initializer [opt]
18958 GNU Extension:
18960 init-declarator:
18961 declarator asm-specification [opt] attributes [opt] initializer [opt]
18963 function-definition:
18964 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18965 function-body
18966 decl-specifier-seq [opt] declarator function-try-block
18968 GNU Extension:
18970 function-definition:
18971 __extension__ function-definition
18973 TM Extension:
18975 function-definition:
18976 decl-specifier-seq [opt] declarator function-transaction-block
18978 The DECL_SPECIFIERS apply to this declarator. Returns a
18979 representation of the entity declared. If MEMBER_P is TRUE, then
18980 this declarator appears in a class scope. The new DECL created by
18981 this declarator is returned.
18983 The CHECKS are access checks that should be performed once we know
18984 what entity is being declared (and, therefore, what classes have
18985 befriended it).
18987 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18988 for a function-definition here as well. If the declarator is a
18989 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18990 be TRUE upon return. By that point, the function-definition will
18991 have been completely parsed.
18993 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18994 is FALSE.
18996 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18997 parsed declaration if it is an uninitialized single declarator not followed
18998 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18999 if present, will not be consumed. If returned, this declarator will be
19000 created with SD_INITIALIZED but will not call cp_finish_decl.
19002 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19003 and there is an initializer, the pointed location_t is set to the
19004 location of the '=' or `(', or '{' in C++11 token introducing the
19005 initializer. */
19007 static tree
19018 {
19022 tree prefix_attributes;
19024 tree asm_specification;
19025 tree initializer;
19027 tree scope;
19029 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19030 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19031 "(...)". */
19042 /* Gather the attributes that were provided with the
19043 decl-specifiers. */
19046 /* Assume that this is not the declarator for a function
19047 definition. */
19051 /* Default arguments are only permitted for function parameters. */
19055 /* Defer access checks while parsing the declarator; we cannot know
19056 what names are accessible until we know what is being
19057 declared. */
19062 /* Parse the declarator. */
19063 declarator
19068 /* Gather up the deferred checks. */
19073 /* If the DECLARATOR was erroneous, there's no need to go
19074 further. */
19078 /* Check that the number of template-parameter-lists is OK. */
19088 /* Figure out what scope the entity declared by the DECLARATOR is
19089 located in. `grokdeclarator' sometimes changes the scope, so
19090 we compute it now. */
19093 /* Perform any lookups in the declared type which were thought to be
19094 dependent, but are not in the scope of the declarator. */
19095 decl_specifiers->type
19098 /* If we're allowing GNU extensions, look for an
19099 asm-specification. */
19101 {
19102 /* Look for an asm-specification. */
19105 }
19106 else
19109 /* Look for attributes. */
19113 /* Peek at the next token. */
19119 {
19120 /* Handle C++17 deduction guides. */
19124 {
19132 {
19136 }
19137 }
19139 /* Check to see if the token indicates the start of a
19140 function-definition. */
19142 {
19144 {
19145 /* If a function-definition should not appear here, issue an
19146 error message. */
19150 }
19152 location_t func_brace_location
19155 /* Neither attributes nor an asm-specification are allowed
19156 on a function-definition. */
19159 "an asm-specification is not allowed "
19163 "attributes are not allowed "
19165 /* This is a function-definition. */
19168 /* Parse the function definition. */
19171 decl_specifiers,
19172 declarator,
19173 prefix_attributes);
19174 else
19175 decl =
19176 (cp_parser_function_definition_from_specifiers_and_declarator
19180 {
19181 /* This is where the prologue starts... */
19184 }
19187 }
19188 }
19190 {
19191 /* A non-template declaration involving a function parameter list
19192 containing an implicit template parameter will be made into a
19193 template. If the resulting declaration is not going to be an
19194 actual function then finish the template scope here to prevent it.
19195 An error message will be issued once we have a decl to talk about.
19197 FIXME probably we should do type deduction rather than create an
19198 implicit template, but the standard currently doesn't allow it. */
19201 }
19203 /* [dcl.dcl]
19205 Only in function declarations for constructors, destructors, type
19206 conversions, and deduction guides can the decl-specifier-seq be omitted.
19208 We explicitly postpone this check past the point where we handle
19209 function-definitions because we tolerate function-definitions
19210 that are missing their return types in some modes. */
19212 {
19216 }
19218 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19222 {
19233 {
19239 }
19240 }
19241 else
19242 {
19243 /* If the init-declarator isn't initialized and isn't followed by a
19244 `,' or `;', it's not a valid init-declarator. */
19247 {
19250 else
19251 {
19255 }
19256 }
19259 }
19261 /* Because start_decl has side-effects, we should only call it if we
19262 know we're going ahead. By this point, we know that we cannot
19263 possibly be looking at any other construct. */
19266 /* Enter the newly declared entry in the symbol table. If we're
19267 processing a declaration in a class-specifier, we wait until
19268 after processing the initializer. */
19270 {
19278 /* Adjust location of decl if declarator->id_loc is more appropriate:
19279 set, and decl wasn't merged with another decl, in which case its
19280 location would be different from input_location, and more accurate. */
19285 }
19287 /* Enter the SCOPE. That way unqualified names appearing in the
19288 initializer will be looked up in SCOPE. */
19291 /* Perform deferred access control checks, now that we know in which
19292 SCOPE the declared entity resides. */
19294 {
19297 /* If the entity being declared is a function, pretend that we
19298 are in its scope. If it is a `friend', it may have access to
19299 things that would not otherwise be accessible. */
19301 {
19304 }
19306 /* Perform access checks for template parameters. */
19309 /* Perform the access control checks for the declarator and the
19310 decl-specifiers. */
19313 /* Restore the saved value. */
19316 }
19318 /* Parse the initializer. */
19323 {
19325 {
19328 else
19329 {
19330 /* If the declaration was erroneous, we don't really
19331 know what the user intended, so just silently
19332 consume the initializer. */
19339 }
19340 }
19341 else
19342 {
19343 /* We want to record the extra mangling scope for in-class
19344 initializers of class members and initializers of static data
19345 member templates. The former involves deferring
19346 parsing of the initializer until end of class as with default
19347 arguments. So right here we only handle the latter. */
19357 }
19358 }
19360 /* The old parser allows attributes to appear after a parenthesized
19361 initializer. Mark Mitchell proposed removing this functionality
19362 on the GCC mailing lists on 2002-08-13. This parser accepts the
19363 attributes -- but ignores them. */
19370 /* And now complain about a non-function implicit template. */
19375 /* For an in-class declaration, use `grokfield' to create the
19376 declaration. */
19378 {
19380 {
19383 }
19392 }
19394 /* Finish processing the declaration. But, skip member
19395 declarations. */
19397 {
19400 asm_specification,
19401 /* If the initializer is in parentheses, then this is
19402 a direct-initialization, which means that an
19403 `explicit' constructor is OK. Otherwise, an
19404 `explicit' constructor cannot be used. */
19407 }
19410 /* Core issue #226 (C++0x only): A default template-argument
19411 shall not be specified in a friend class template
19412 declaration. */
19421 {
19424 else
19426 }
19433 }
19435 /* Parse a declarator.
19437 declarator:
19438 direct-declarator
19439 ptr-operator declarator
19441 abstract-declarator:
19442 ptr-operator abstract-declarator [opt]
19443 direct-abstract-declarator
19445 GNU Extensions:
19447 declarator:
19448 attributes [opt] direct-declarator
19449 attributes [opt] ptr-operator declarator
19451 abstract-declarator:
19452 attributes [opt] ptr-operator abstract-declarator [opt]
19453 attributes [opt] direct-abstract-declarator
19455 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19456 detect constructors, destructors, deduction guides, or conversion operators.
19457 It is set to -1 if the declarator is a name, and +1 if it is a
19458 function. Otherwise it is set to zero. Usually you just want to
19459 test for >0, but internally the negative value is used.
19461 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19462 a decl-specifier-seq unless it declares a constructor, destructor,
19463 or conversion. It might seem that we could check this condition in
19464 semantic analysis, rather than parsing, but that makes it difficult
19465 to handle something like `f()'. We want to notice that there are
19466 no decl-specifiers, and therefore realize that this is an
19467 expression, not a declaration.)
19469 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19470 the declarator is a direct-declarator of the form "(...)".
19472 MEMBER_P is true iff this declarator is a member-declarator.
19474 FRIEND_P is true iff this declarator is a friend. */
19478 cp_parser_declarator_kind dcl_kind,
19482 {
19485 cp_cv_quals cv_quals;
19486 tree class_type;
19489 /* Assume this is not a constructor, destructor, or type-conversion
19490 operator. */
19497 /* Check for the ptr-operator production. */
19499 /* Parse the ptr-operator. */
19505 /* If that worked, then we have a ptr-operator. */
19507 {
19508 /* If a ptr-operator was found, then this declarator was not
19509 parenthesized. */
19512 /* The dependent declarator is optional if we are parsing an
19513 abstract-declarator. */
19517 /* Parse the dependent declarator. */
19522 friend_p);
19524 /* If we are parsing an abstract-declarator, we must handle the
19525 case where the dependent declarator is absent. */
19530 declarator = cp_parser_make_indirect_declarator
19532 }
19533 /* Everything else is a direct-declarator. */
19534 else
19535 {
19538 CPP_OPEN_PAREN);
19540 ctor_dtor_or_conv_p,
19542 }
19547 }
19549 /* Parse a direct-declarator or direct-abstract-declarator.
19551 direct-declarator:
19552 declarator-id
19553 direct-declarator ( parameter-declaration-clause )
19554 cv-qualifier-seq [opt]
19555 ref-qualifier [opt]
19556 exception-specification [opt]
19557 direct-declarator [ constant-expression [opt] ]
19558 ( declarator )
19560 direct-abstract-declarator:
19561 direct-abstract-declarator [opt]
19562 ( parameter-declaration-clause )
19563 cv-qualifier-seq [opt]
19564 ref-qualifier [opt]
19565 exception-specification [opt]
19566 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19567 ( abstract-declarator )
19569 Returns a representation of the declarator. DCL_KIND is
19570 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19571 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19572 we are parsing a direct-declarator. It is
19573 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19574 of ambiguity we prefer an abstract declarator, as per
19575 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19576 as for cp_parser_declarator. */
19580 cp_parser_declarator_kind dcl_kind,
19583 {
19593 {
19594 /* Peek at the next token. */
19597 {
19598 /* This is either a parameter-declaration-clause, or a
19599 parenthesized declarator. When we know we are parsing a
19600 named declarator, it must be a parenthesized declarator
19601 if FIRST is true. For instance, `(int)' is a
19602 parameter-declaration-clause, with an omitted
19603 direct-abstract-declarator. But `((*))', is a
19604 parenthesized abstract declarator. Finally, when T is a
19605 template parameter `(T)' is a
19606 parameter-declaration-clause, and not a parenthesized
19607 named declarator.
19609 We first try and parse a parameter-declaration-clause,
19610 and then try a nested declarator (if FIRST is true).
19612 It is not an error for it not to be a
19613 parameter-declaration-clause, even when FIRST is
19614 false. Consider,
19616 int i (int);
19617 int i (3);
19619 The first is the declaration of a function while the
19620 second is the definition of a variable, including its
19621 initializer.
19623 Having seen only the parenthesis, we cannot know which of
19624 these two alternatives should be selected. Even more
19625 complex are examples like:
19627 int i (int (a));
19628 int i (int (3));
19630 The former is a function-declaration; the latter is a
19631 variable initialization.
19633 Thus again, we try a parameter-declaration-clause, and if
19634 that fails, we back out and return. */
19637 {
19638 tree params;
19641 /* In a member-declarator, the only valid interpretation
19642 of a parenthesis is the start of a
19643 parameter-declaration-clause. (It is invalid to
19644 initialize a static data member with a parenthesized
19645 initializer; only the "=" form of initialization is
19646 permitted.) */
19650 /* Consume the `('. */
19653 {
19654 /* If this is going to be an abstract declarator, we're
19655 in a declarator and we can't have default args. */
19658 }
19662 /* Parse the parameter-declaration-clause. */
19665 /* Consume the `)'. */
19668 /* If all went well, parse the cv-qualifier-seq,
19669 ref-qualifier and the exception-specification. */
19671 {
19672 cp_cv_quals cv_quals;
19673 cp_virt_specifiers virt_specifiers;
19674 cp_ref_qualifier ref_qual;
19675 tree exception_specification;
19676 tree late_return;
19677 tree attrs;
19687 /* Parse the cv-qualifier-seq. */
19689 /* Parse the ref-qualifier. */
19691 /* Parse the tx-qualifier. */
19693 /* And the exception-specification. */
19694 exception_specification
19699 /* In here, we handle cases where attribute is used after
19700 the function declaration. For example:
19701 void func (int x) __attribute__((vector(..))); */
19705 {
19709 CPP_SEMICOLON)
19711 CPP_OPEN_BRACE))
19714 ;
19715 else
19717 }
19719 late_return = (cp_parser_late_return_type_opt
19723 /* Parse the virt-specifier-seq. */
19726 /* Create the function-declarator. */
19728 params,
19729 cv_quals,
19730 virt_specifiers,
19731 ref_qual,
19732 tx_qual,
19733 exception_specification,
19734 late_return,
19735 requires_clause);
19738 /* Any subsequent parameter lists are to do with
19739 return type, so are not those of the declared
19740 function. */
19742 }
19744 /* Remove the function parms from scope. */
19748 /* Repeat the main loop. */
19750 }
19752 /* If this is the first, we can try a parenthesized
19753 declarator. */
19755 {
19761 /* Consume the `('. */
19763 /* Parse the nested declarator. */
19766 declarator
19772 /* Expect a `)'. */
19779 }
19780 /* Otherwise, we must be done. */
19781 else
19783 }
19787 {
19788 /* Parse an array-declarator. */
19797 /* Consume the `['. */
19799 /* Peek at the next token. */
19801 /* If the next token is `]', then there is no
19802 constant-expression. */
19804 {
19806 bounds
19816 {
19817 /* Normally, the array bound must be an integral constant
19818 expression. However, as an extension, we allow VLAs
19819 in function scopes as long as they aren't part of a
19820 parameter declaration. */
19824 }
19827 {
19828 /* Remember this wasn't a constant-expression. */
19831 }
19832 }
19833 else
19835 /* Look for the closing `]'. */
19837 {
19840 }
19845 }
19847 {
19848 {
19849 tree qualifying_scope;
19850 tree unqualified_name;
19851 tree attrs;
19852 special_function_kind sfk;
19857 /* Parse a declarator-id */
19860 {
19863 /* If we see an ellipsis, we should be looking at a
19864 parameter pack. */
19866 {
19867 /* Consume the `...' */
19871 }
19872 }
19875 unqualified_name
19879 {
19883 {
19884 /* Check whether an error occurred. */
19887 /* We already consumed the ellipsis to mark a
19888 parameter pack, but we have no way to report it,
19889 so abort the tentative parse. We will be exiting
19890 immediately anyway. */
19892 }
19893 else
19899 && (qualifying_scope
19901 {
19904 }
19905 }
19910 {
19915 }
19921 {
19922 /* In the declaration of a member of a template class
19923 outside of the class itself, the SCOPE will sometimes
19924 be a TYPENAME_TYPE. For example, given:
19926 template <typename T>
19927 int S<T>::R::i = 3;
19929 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19930 this context, we must resolve S<T>::R to an ordinary
19931 type, rather than a typename type.
19933 The reason we normally avoid resolving TYPENAME_TYPEs
19934 is that a specialization of `S' might render
19935 `S<T>::R' not a type. However, if `S' is
19936 specialized, then this `i' will not be used, so there
19937 is no harm in resolving the types here. */
19938 tree type;
19940 /* Resolve the TYPENAME_TYPE. */
19943 /* If that failed, the declarator is invalid. */
19945 {
19948 "cannot define member of dependent typedef "
19950 else
19955 }
19957 }
19962 {
19963 tree class_type;
19968 else
19972 {
19975 {
19978 {
19982 "use %<%T::%D%> instead of %<%T::%D%> to "
19984 class_type,
19989 }
19990 else
19992 }
19993 else
19994 {
19995 /* We do not attempt to print the declarator
19996 here because we do not have enough
19997 information about its original syntactic
19998 form. */
20002 }
20003 }
20006 {
20012 for an unnamed type, even if the type
20013 got a name for linkage purposes. */
20015 /* Handle correctly (c++/19200):
20017 struct S {
20018 struct T{};
20019 friend void S(T);
20020 };
20022 and also:
20024 namespace N {
20025 void S();
20026 }
20028 struct S {
20029 friend void N::S();
20030 }; */
20031 && !(friend_p
20034 class_type))
20035 {
20038 }
20046 }
20047 }
20049 unqualified_name,
20050 sfk);
20057 }
20059 handle_declarator:;
20062 {
20063 /* Any names that appear after the declarator-id for a
20064 member are looked up in the containing scope. */
20066 {
20067 /* But declarations with qualified-ids can't appear in a
20068 function. */
20072 }
20074 }
20078 /* Default args are only allowed on function
20079 declarations. */
20081 else
20085 }
20086 /* We're done. */
20087 else
20089 }
20091 /* For an abstract declarator, we might wind up with nothing at this
20092 point. That's an error; the declarator is not optional. */
20096 /* If we entered a scope, we must exit it now. */
20104 }
20106 /* Parse a ptr-operator.
20108 ptr-operator:
20109 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20110 * cv-qualifier-seq [opt]
20111 &
20112 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20113 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20115 GNU Extension:
20117 ptr-operator:
20118 & cv-qualifier-seq [opt]
20120 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20121 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20122 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20123 filled in with the TYPE containing the member. *CV_QUALS is
20124 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20125 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20126 Note that the tree codes returned by this function have nothing
20127 to do with the types of trees that will be eventually be created
20128 to represent the pointer or reference type being parsed. They are
20129 just constants with suggestive names. */
20130 static enum tree_code
20135 {
20140 /* Assume that it's not a pointer-to-member. */
20142 /* And that there are no cv-qualifiers. */
20145 /* Peek at the next token. */
20148 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20158 {
20159 /* Consume the `*', `&' or `&&'. */
20162 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20163 `&', if we are allowing GNU extensions. (The only qualifier
20164 that can legally appear after `&' is `restrict', but that is
20165 enforced during semantic analysis. */
20173 }
20174 else
20175 {
20176 /* Try the pointer-to-member case. */
20178 /* Look for the optional `::' operator. */
20181 /* Look for the nested-name specifier. */
20188 /* If we found it, and the next token is a `*', then we are
20189 indeed looking at a pointer-to-member operator. */
20192 {
20193 /* Indicate that the `*' operator was used. */
20201 else
20202 {
20203 /* The type of which the member is a member is given by the
20204 current SCOPE. */
20206 /* The next name will not be qualified. */
20210 /* Look for optional c++11 attributes. */
20214 /* Look for the optional cv-qualifier-seq. */
20216 }
20217 }
20218 /* If that didn't work we don't have a ptr-operator. */
20221 }
20224 }
20226 /* Parse an (optional) cv-qualifier-seq.
20228 cv-qualifier-seq:
20229 cv-qualifier cv-qualifier-seq [opt]
20231 cv-qualifier:
20232 const
20233 volatile
20235 GNU Extension:
20237 cv-qualifier:
20238 __restrict__
20240 Returns a bitmask representing the cv-qualifiers. */
20242 static cp_cv_quals
20244 {
20248 {
20250 cp_cv_quals cv_qualifier;
20252 /* Peek at the next token. */
20254 /* See if it's a cv-qualifier. */
20256 {
20272 }
20278 {
20281 }
20282 else
20283 {
20286 }
20287 }
20290 }
20292 /* Parse an (optional) ref-qualifier
20294 ref-qualifier:
20295 &
20296 &&
20298 Returns cp_ref_qualifier representing ref-qualifier. */
20300 static cp_ref_qualifier
20302 {
20305 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20310 {
20315 {
20327 }
20332 {
20335 }
20336 else
20337 {
20340 }
20341 }
20344 }
20346 /* Parse an optional tx-qualifier.
20348 tx-qualifier:
20349 transaction_safe
20350 transaction_safe_dynamic */
20352 static tree
20354 {
20357 {
20362 {
20366 {
20369 {
20372 }
20373 else
20375 }
20376 }
20377 }
20379 }
20381 /* Parse an (optional) virt-specifier-seq.
20383 virt-specifier-seq:
20384 virt-specifier virt-specifier-seq [opt]
20386 virt-specifier:
20387 override
20388 final
20390 Returns a bitmask representing the virt-specifiers. */
20392 static cp_virt_specifiers
20394 {
20398 {
20400 cp_virt_specifiers virt_specifier;
20402 /* Peek at the next token. */
20404 /* See if it's a virt-specifier-qualifier. */
20408 {
20411 }
20413 {
20416 }
20418 {
20420 }
20421 else
20425 {
20428 }
20429 else
20430 {
20433 }
20434 }
20436 }
20438 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20439 is in scope even though it isn't real. */
20441 void
20443 {
20444 tree this_parm;
20447 {
20448 /* We don't clear this between NSDMIs. Is it already what we want? */
20453 }
20456 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20458 current_class_ref
20461 }
20463 /* Return true iff our current scope is a non-static data member
20464 initializer. */
20466 bool
20468 {
20469 /* We recognize NSDMI context by the context-less 'this' pointer set up
20470 by the function above. */
20476 }
20478 /* Return true iff our current scope is a default capturing generic lambda
20479 defined within a template. FIXME: This is part of a workaround (see
20480 semantics.c) to handle building lambda closure types correctly in templates
20481 which we ultimately want to defer to instantiation time. */
20483 bool
20485 {
20503 }
20505 /* Parse a late-specified return type, if any. This is not a separate
20506 non-terminal, but part of a function declarator, which looks like
20508 -> trailing-type-specifier-seq abstract-declarator(opt)
20510 Returns the type indicated by the type-id.
20512 In addition to this, parse any queued up #pragma omp declare simd
20513 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20514 #pragma acc routine clauses.
20516 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20517 function. */
20519 static tree
20522 {
20526 && declarator
20533 && declarator
20536 /* Peek at the next token. */
20538 /* A late-specified return type is indicated by an initial '->'. */
20549 {
20550 /* DR 1207: 'this' is in scope in the trailing return type. */
20552 }
20555 {
20556 /* Consume the ->. */
20560 }
20562 /* Function declarations may be followed by a trailing
20563 requires-clause. */
20567 declarator->attributes
20571 declarator->attributes
20575 declarator->attributes
20580 {
20583 }
20586 }
20588 /* Parse a declarator-id.
20590 declarator-id:
20591 id-expression
20592 :: [opt] nested-name-specifier [opt] type-name
20594 In the `id-expression' case, the value returned is as for
20595 cp_parser_id_expression if the id-expression was an unqualified-id.
20596 If the id-expression was a qualified-id, then a SCOPE_REF is
20597 returned. The first operand is the scope (either a NAMESPACE_DECL
20598 or TREE_TYPE), but the second is still just a representation of an
20599 unqualified-id. */
20601 static tree
20603 {
20604 tree id;
20605 /* The expression must be an id-expression. Assume that qualified
20606 names are the names of types so that:
20608 template <class T>
20609 int S<T>::R::i = 3;
20611 will work; we must treat `S<T>::R' as the name of a type.
20612 Similarly, assume that qualified names are templates, where
20613 required, so that:
20615 template <class T>
20616 int S<T>::R<T>::i = 3;
20618 will work, too. */
20624 optional_p);
20628 }
20630 /* Parse a type-id.
20632 type-id:
20633 type-specifier-seq abstract-declarator [opt]
20635 Returns the TYPE specified. */
20637 static tree
20640 {
20641 cp_decl_specifier_seq type_specifier_seq;
20644 /* Parse the type-specifier-seq. */
20646 is_trailing_return,
20651 /* A bare template name as a template argument is a template template
20652 argument, not a placeholder, so fail parsing it as a type argument. */
20653 {
20657 }
20661 /* There might or might not be an abstract declarator. */
20663 /* Look for the declarator. */
20664 abstract_declarator
20669 /* Check to see if there really was a declarator. */
20674 /* The concepts TS allows 'auto' as a type-id. */
20676 /* None of the valid uses of 'auto' in C++14 involve the type-id
20677 nonterminal, but it is valid in a trailing-return-type. */
20680 {
20681 /* A type-id with type 'auto' is only ok if the abstract declarator
20682 is a function declarator with a late-specified return type.
20684 A type-id with 'auto' is also valid in a trailing-return-type
20685 in a compound-requirement. */
20692 else
20693 {
20696 {
20698 auto_node);
20700 tmpl);
20701 }
20702 else
20705 }
20706 }
20709 is_template_arg);
20710 }
20712 static tree
20714 {
20716 }
20718 static tree
20720 {
20721 tree r;
20723 parser->type_definition_forbidden_message
20728 {
20731 }
20733 }
20735 static tree
20737 {
20739 }
20741 /* Parse a type-specifier-seq.
20743 type-specifier-seq:
20744 type-specifier type-specifier-seq [opt]
20746 GNU extension:
20748 type-specifier-seq:
20749 attributes type-specifier-seq [opt]
20751 If IS_DECLARATION is true, we are at the start of a "condition" or
20752 exception-declaration, so we might be followed by a declarator-id.
20754 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20755 i.e. we've just seen "->".
20757 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20759 static void
20764 {
20769 /* Clear the TYPE_SPECIFIER_SEQ. */
20772 /* In the context of a trailing return type, enum E { } is an
20773 elaborated-type-specifier followed by a function-body, not an
20774 enum-specifier. */
20778 /* Parse the type-specifiers and attributes. */
20780 {
20781 tree type_specifier;
20784 /* Check for attributes first. */
20786 {
20791 }
20793 /* record the token of the beginning of the type specifier seq,
20794 for error reporting purposes*/
20798 /* Look for the type-specifier. */
20800 flags,
20801 type_specifier_seq,
20803 NULL,
20806 {
20807 /* If the first type-specifier could not be found, this is not a
20808 type-specifier-seq at all. */
20810 {
20811 /* Set in_declarator_p to avoid skipping to the semicolon. */
20823 }
20824 /* If subsequent type-specifiers could not be found, the
20825 type-specifier-seq is complete. */
20827 }
20830 /* The standard says that a condition can be:
20832 type-specifier-seq declarator = assignment-expression
20834 However, given:
20836 struct S {};
20837 if (int S = ...)
20839 we should treat the "S" as a declarator, not as a
20840 type-specifier. The standard doesn't say that explicitly for
20841 type-specifier-seq, but it does say that for
20842 decl-specifier-seq in an ordinary declaration. Perhaps it
20843 would be clearer just to allow a decl-specifier-seq here, and
20844 then add a semantic restriction that if any decl-specifiers
20845 that are not type-specifiers appear, the program is invalid. */
20848 }
20849 }
20851 /* Return whether the function currently being declared has an associated
20852 template parameter list. */
20854 static bool
20856 {
20869 }
20871 /* Parse a parameter-declaration-clause.
20873 parameter-declaration-clause:
20874 parameter-declaration-list [opt] ... [opt]
20875 parameter-declaration-list , ...
20877 Returns a representation for the parameter declarations. A return
20878 value of NULL indicates a parameter-declaration-clause consisting
20879 only of an ellipsis. */
20881 static tree
20883 {
20884 tree parameters;
20893 parser->auto_is_implicit_function_template_parm_p
20895 }
20901 && !processing_template_parmlist
20907 /* Peek at the next token. */
20909 /* Check for trivial parameter-declaration-clauses. */
20911 {
20912 /* Consume the `...' token. */
20915 }
20917 /* There are no parameters. */
20918 {
20919 #ifndef NO_IMPLICIT_EXTERN_C
20924 else
20925 #endif
20927 }
20928 /* Check for `(void)', too, which is a special case. */
20932 {
20933 /* Consume the `void' token. */
20935 /* There are no parameters. */
20937 }
20939 /* Parse the parameter-declaration-list. */
20941 /* If a parse error occurred while parsing the
20942 parameter-declaration-list, then the entire
20943 parameter-declaration-clause is erroneous. */
20947 /* Peek at the next token. */
20949 /* If it's a `,', the clause should terminate with an ellipsis. */
20951 {
20952 /* Consume the `,'. */
20954 /* Expect an ellipsis. */
20955 ellipsis_p
20957 }
20958 /* It might also be `...' if the optional trailing `,' was
20959 omitted. */
20961 {
20962 /* Consume the `...' token. */
20964 /* And remember that we saw it. */
20966 }
20967 else
20970 /* Finish the parameter list. */
20975 }
20977 /* Parse a parameter-declaration-list.
20979 parameter-declaration-list:
20980 parameter-declaration
20981 parameter-declaration-list , parameter-declaration
20983 Returns a representation of the parameter-declaration-list, as for
20984 cp_parser_parameter_declaration_clause. However, the
20985 `void_list_node' is never appended to the list. Upon return,
20986 *IS_ERROR will be true iff an error occurred. */
20988 static tree
20990 {
20996 /* Assume all will go well. */
20998 /* The special considerations that apply to a function within an
20999 unbraced linkage specifications do not apply to the parameters
21000 to the function. */
21001 saved_in_unbraced_linkage_specification_p
21005 /* Look for more parameters. */
21007 {
21015 /* Parse the parameter. */
21016 parameter
21021 /* We don't know yet if the enclosing context is deprecated, so wait
21022 and warn in grokparms if appropriate. */
21026 {
21027 /* If a function parameter pack was specified and an implicit template
21028 parameter was introduced during cp_parser_parameter_declaration,
21029 change any implicit parameters introduced into packs. */
21033 {
21041 }
21045 PARM,
21048 }
21052 /* If a parse error occurred parsing the parameter declaration,
21053 then the entire parameter-declaration-list is erroneous. */
21055 {
21059 }
21069 {
21073 }
21075 /* Add the new parameter to the list. */
21079 /* Peek at the next token. */
21082 /* These are for Objective-C++ */
21085 /* The parameter-declaration-list is complete. */
21088 {
21091 /* Peek at the next token. */
21093 /* If it's an ellipsis, then the list is complete. */
21096 /* Otherwise, there must be more parameters. Consume the
21097 `,'. */
21099 /* When parsing something like:
21101 int i(float f, double d)
21103 we can tell after seeing the declaration for "f" that we
21104 are not looking at an initialization of a variable "i",
21105 but rather at the declaration of a function "i".
21107 Due to the fact that the parsing of template arguments
21108 (as specified to a template-id) requires backtracking we
21109 cannot use this technique when inside a template argument
21110 list. */
21114 /* However, a parameter-declaration of the form
21115 "float(f)" (which is a valid declaration of a
21116 parameter "f") can also be interpreted as an
21117 expression (the conversion of "f" to "float"). */
21120 }
21121 else
21122 {
21130 }
21131 }
21133 parser->in_unbraced_linkage_specification_p
21136 /* Reset implicit_template_scope if we are about to leave the function
21137 parameter list that introduced it. Note that for out-of-line member
21138 definitions, there will be one or more class scopes before we get to
21139 the template parameter scope. */
21143 {
21147 {
21150 }
21151 }
21154 }
21156 /* Parse a parameter declaration.
21158 parameter-declaration:
21159 decl-specifier-seq ... [opt] declarator
21160 decl-specifier-seq declarator = assignment-expression
21161 decl-specifier-seq ... [opt] abstract-declarator [opt]
21162 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21164 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21165 declares a template parameter. (In that case, a non-nested `>'
21166 token encountered during the parsing of the assignment-expression
21167 is not interpreted as a greater-than operator.)
21169 Returns a representation of the parameter, or NULL if an error
21170 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21171 true iff the declarator is of the form "(p)". */
21177 {
21179 cp_decl_specifier_seq decl_specifiers;
21181 tree default_argument;
21186 /* In a template parameter, `>' is not an operator.
21188 [temp.param]
21190 When parsing a default template-argument for a non-type
21191 template-parameter, the first non-nested `>' is taken as the end
21192 of the template parameter-list rather than a greater-than
21193 operator. */
21195 /* Type definitions may not appear in parameter types. */
21197 parser->type_definition_forbidden_message
21200 /* Parse the declaration-specifiers. */
21202 CP_PARSER_FLAGS_NONE,
21206 /* Complain about missing 'typename' or other invalid type names. */
21211 /* If an error occurred, there's no reason to attempt to parse the
21212 rest of the declaration. */
21214 {
21217 }
21219 /* Peek at the next token. */
21222 /* If the next token is a `)', `,', `=', `>', or `...', then there
21223 is no declarator. However, when variadic templates are enabled,
21224 there may be a declarator following `...'. */
21229 {
21233 }
21234 /* Otherwise, there should be a declarator. */
21235 else
21236 {
21240 /* After seeing a decl-specifier-seq, if the next token is not a
21241 "(", there is no possibility that the code is a valid
21242 expression. Therefore, if parsing tentatively, we commit at
21243 this point. */
21245 /* In an expression context, having seen:
21247 (int((char ...
21249 we cannot be sure whether we are looking at a
21250 function-type (taking a "char" as a parameter) or a cast
21251 of some object of type "char" to "int". */
21257 /* Parse the declarator. */
21260 CP_PARSER_DECLARATOR_EITHER,
21262 parenthesized_p,
21266 /* After the declarator, allow more attributes. */
21267 decl_specifiers.attributes
21271 /* If the declarator is a template parameter pack, remember that and
21272 clear the flag in the declarator itself so we don't get errors
21273 from grokdeclarator. */
21275 {
21278 }
21279 }
21281 /* If the next token is an ellipsis, and we have not seen a declarator
21282 name, and if either the type of the declarator contains parameter
21283 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21284 for, eg, abbreviated integral type names), then we actually have a
21285 parameter pack expansion expression. Otherwise, leave the ellipsis
21286 for a C-style variadic function. */
21289 {
21300 {
21301 /* Consume the `...'. */
21305 /* Build a pack expansion type */
21310 else
21312 }
21313 }
21315 /* The restriction on defining new types applies only to the type
21316 of the parameter, not to the default argument. */
21319 /* If the next token is `=', then process a default argument. */
21321 {
21324 /* If we are defining a class, then the tokens that make up the
21325 default argument must be saved and processed later. */
21331 // A constrained-type-specifier may declare a type template-parameter.
21333 default_argument
21336 // A constrained-type-specifier may declare a template-template-parameter.
21338 default_argument
21341 /* Outside of a class definition, we can just parse the
21342 assignment-expression. */
21343 else
21344 default_argument
21348 {
21350 "default arguments are only "
21352 }
21354 || template_parameter_pack_p
21357 {
21358 /* Find the name of the parameter pack. */
21365 template_parm_p
21371 else
21373 template_parm_p
21380 }
21381 }
21382 else
21386 declarator,
21387 default_argument,
21388 template_parameter_pack_p);
21389 }
21391 /* Parse a default argument and return it.
21393 TEMPLATE_PARM_P is true if this is a default argument for a
21394 non-type template parameter. */
21395 static tree
21397 {
21403 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21404 set correctly. */
21407 /* Local variable names (and the `this' keyword) may not
21408 appear in a default argument. */
21411 /* Parse the assignment-expression. */
21416 /* The "this" pointer is not valid in a default argument. */
21418 {
21423 }
21424 default_argument
21426 /* Restore the "this" pointer. */
21428 {
21431 }
21440 }
21442 /* Parse a function-body.
21444 function-body:
21445 compound_statement */
21447 static void
21449 {
21453 }
21455 /* Parse a ctor-initializer-opt followed by a function-body. Return
21456 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21457 is true we are parsing a function-try-block. */
21459 static bool
21462 {
21470 /* Begin the function body. */
21472 /* Parse the optional ctor-initializer. */
21475 /* If we're parsing a constexpr constructor definition, we need
21476 to check that the constructor body is indeed empty. However,
21477 before we get to cp_parser_function_body lot of junk has been
21478 generated, so we can't just check that we have an empty block.
21479 Rather we take a snapshot of the outermost block, and check whether
21480 cp_parser_function_body changed its state. */
21482 {
21486 }
21487 /* Parse the function-body. */
21491 /* Finish the function body. */
21495 }
21497 /* Parse an initializer.
21499 initializer:
21500 = initializer-clause
21501 ( expression-list )
21503 Returns an expression representing the initializer. If no
21504 initializer is present, NULL_TREE is returned.
21506 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21507 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21508 set to TRUE if there is no initializer present. If there is an
21509 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21510 is set to true; otherwise it is set to false. */
21512 static tree
21515 {
21517 tree init;
21519 /* Peek at the next token. */
21522 /* Let our caller know whether or not this initializer was
21523 parenthesized. */
21525 /* Assume that the initializer is constant. */
21529 {
21530 /* Consume the `='. */
21532 /* Parse the initializer-clause. */
21534 }
21536 {
21541 non_constant_p);
21546 }
21548 {
21553 }
21554 else
21555 {
21556 /* Anything else is an error. */
21559 }
21565 }
21567 /* Parse an initializer-clause.
21569 initializer-clause:
21570 assignment-expression
21571 braced-init-list
21573 Returns an expression representing the initializer.
21575 If the `assignment-expression' production is used the value
21576 returned is simply a representation for the expression.
21578 Otherwise, calls cp_parser_braced_list. */
21580 static cp_expr
21582 {
21583 cp_expr initializer;
21585 /* Assume the expression is constant. */
21588 /* If it is not a `{', then we are looking at an
21589 assignment-expression. */
21591 {
21592 initializer
21595 non_constant_p);
21596 }
21597 else
21601 }
21603 /* Parse a brace-enclosed initializer list.
21605 braced-init-list:
21606 { initializer-list , [opt] }
21607 { }
21609 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21610 the elements of the initializer-list (or NULL, if the last
21611 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21612 NULL_TREE. There is no way to detect whether or not the optional
21613 trailing `,' was provided. NON_CONSTANT_P is as for
21614 cp_parser_initializer. */
21616 static cp_expr
21618 {
21619 tree initializer;
21622 /* Consume the `{' token. */
21624 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21626 /* If it's not a `}', then there is a non-trivial initializer. */
21628 {
21629 /* Parse the initializer list. */
21632 /* A trailing `,' token is allowed. */
21635 }
21636 else
21638 /* Now, there should be a trailing `}'. */
21644 /* Build a location of the form:
21645 { ... }
21646 ^~~~~~~
21647 with caret==start at the open brace, finish at the close brace. */
21651 }
21653 /* Consume tokens up to, and including, the next non-nested closing `]'.
21654 Returns true iff we found a closing `]'. */
21656 static bool
21658 {
21662 {
21666 {
21669 /* If we've run out of tokens, then there is no closing `]'. */
21678 {
21681 }
21686 }
21688 /* Consume the token. */
21690 }
21691 }
21693 /* Return true if we are looking at an array-designator, false otherwise. */
21695 static bool
21697 {
21698 /* Consume the `['. */
21703 /* Skip tokens until the next token is a closing square bracket.
21704 If we find the closing `]', and the next token is a `=', then
21705 we are looking at an array designator. */
21706 bool array_designator_p
21710 /* Roll back the tokens we skipped. */
21714 }
21716 /* Parse an initializer-list.
21718 initializer-list:
21719 initializer-clause ... [opt]
21720 initializer-list , initializer-clause ... [opt]
21722 GNU Extension:
21724 initializer-list:
21725 designation initializer-clause ...[opt]
21726 initializer-list , designation initializer-clause ...[opt]
21728 designation:
21729 . identifier =
21730 identifier :
21731 [ constant-expression ] =
21733 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21734 for the initializer. If the INDEX of the elt is non-NULL, it is the
21735 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21736 as for cp_parser_initializer. */
21740 {
21743 /* Assume all of the expressions are constant. */
21746 /* Parse the rest of the list. */
21748 {
21750 tree designator;
21751 tree initializer;
21754 /* If the next token is an identifier and the following one is a
21755 colon, we are looking at the GNU designated-initializer
21756 syntax. */
21760 {
21761 /* Warn the user that they are using an extension. */
21764 /* Consume the identifier. */
21766 /* Consume the `:'. */
21768 }
21769 /* Also handle the C99 syntax, '. id ='. */
21774 {
21775 /* Warn the user that they are using an extension. */
21778 /* Consume the `.'. */
21780 /* Consume the identifier. */
21782 /* Consume the `='. */
21784 }
21785 /* Also handle C99 array designators, '[ const ] ='. */
21789 {
21790 /* In C++11, [ could start a lambda-introducer. */
21796 {
21799 }
21800 else
21801 {
21806 }
21812 }
21813 else
21816 /* Parse the initializer. */
21819 /* If any clause is non-constant, so is the entire initializer. */
21823 /* If we have an ellipsis, this is an initializer pack
21824 expansion. */
21826 {
21827 /* Consume the `...'. */
21830 /* Turn the initializer into an initializer expansion. */
21832 }
21834 /* Add it to the vector. */
21837 /* If the next token is not a comma, we have reached the end of
21838 the list. */
21842 /* Peek at the next token. */
21844 /* If the next token is a `}', then we're still done. An
21845 initializer-clause can have a trailing `,' after the
21846 initializer-list and before the closing `}'. */
21850 /* Consume the `,' token. */
21852 }
21855 }
21857 /* Classes [gram.class] */
21859 /* Parse a class-name.
21861 class-name:
21862 identifier
21863 template-id
21865 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21866 to indicate that names looked up in dependent types should be
21867 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21868 keyword has been used to indicate that the name that appears next
21869 is a template. TAG_TYPE indicates the explicit tag given before
21870 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21871 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21872 is the class being defined in a class-head. If ENUM_OK is TRUE,
21873 enum-names are also accepted.
21875 Returns the TYPE_DECL representing the class. */
21877 static tree
21886 {
21887 tree decl;
21888 tree scope;
21893 /* All class-names start with an identifier. */
21896 {
21899 }
21901 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21902 to a template-id, so we save it here. */
21907 /* Any name names a type if we're following the `typename' keyword
21908 in a qualified name where the enclosing scope is type-dependent. */
21911 /* Handle the common case (an identifier, but not a template-id)
21912 efficiently. */
21915 {
21919 /* Look for the identifier. */
21923 /* If the next token isn't an identifier, we are certainly not
21924 looking at a class-name. */
21927 /* If we know this is a type-name, there's no need to look it
21928 up. */
21931 else
21932 {
21933 tree ambiguous_decls;
21934 /* If we already know that this lookup is ambiguous, then
21935 we've already issued an error message; there's no reason
21936 to check again. */
21938 {
21941 }
21942 /* If the next token is a `::', then the name must be a type
21943 name.
21945 [basic.lookup.qual]
21947 During the lookup for a name preceding the :: scope
21948 resolution operator, object, function, and enumerator
21949 names are ignored. */
21952 /* Look up the name. */
21954 tag_type,
21957 check_dependency_p,
21961 {
21965 }
21966 }
21967 }
21968 else
21969 {
21970 /* Try a template-id. */
21972 check_dependency_p,
21973 tag_type,
21974 is_declaration);
21977 }
21981 /* If this is a typename, create a TYPENAME_TYPE. */
21983 {
21988 }
21992 /* Check to see that it is really the name of a class. */
21996 /* Situations like this:
21998 template <typename T> struct A {
21999 typename T::template X<int>::I i;
22000 };
22002 are problematic. Is `T::template X<int>' a class-name? The
22003 standard does not seem to be definitive, but there is no other
22004 valid interpretation of the following `::'. Therefore, those
22005 names are considered class-names. */
22006 {
22010 }
22015 /* In Objective-C 2.0, a classname followed by '.' starts a
22016 dot-syntax expression, and it's not a type-name. */
22028 }
22030 /* Parse a class-specifier.
22032 class-specifier:
22033 class-head { member-specification [opt] }
22035 Returns the TREE_TYPE representing the class. */
22037 static tree
22039 {
22040 tree type;
22054 /* Parse the class-head. */
22057 /* If the class-head was a semantic disaster, skip the entire body
22058 of the class. */
22060 {
22064 }
22066 /* Look for the `{'. */
22068 {
22071 }
22076 /* Issue an error message if type-definitions are forbidden here. */
22078 /* Remember that we are defining one more class. */
22080 /* Inside the class, surrounding template-parameter-lists do not
22081 apply. */
22082 saved_num_template_parameter_lists
22085 /* We are not in a function body. */
22088 /* Or in a loop. */
22091 /* Or in a switch. */
22094 /* We are not immediately inside an extern "lang" block. */
22095 saved_in_unbraced_linkage_specification_p
22099 // Associate constraints with the type.
22103 /* Start the class. */
22105 {
22108 }
22112 /* If the type is erroneous, skip the entire body of the class. */
22114 else
22115 /* Parse the member-specification. */
22118 /* Look for the trailing `}'. */
22120 /* Look for trailing attributes to apply to this class. */
22128 /* We've finished a type definition. Check for the common syntax
22129 error of forgetting a semicolon after the definition. We need to
22130 be careful, as we can't just check for not-a-semicolon and be done
22131 with it; the user might have typed:
22133 class X { } c = ...;
22134 class X { } *p = ...;
22136 and so forth. Instead, enumerate all the possible tokens that
22137 might follow this production; if we don't see one of them, then
22138 complain and silently insert the semicolon. */
22139 {
22144 /* Don't try to parse c++11 attributes here. As per the
22145 grammar, that should be a task for
22146 cp_parser_decl_specifier_seq. */
22150 {
22161 /* While it's legal for type qualifiers and storage class
22162 specifiers to follow type definitions in the grammar, only
22163 compiler testsuites contain code like that. Assume that if
22164 we see such code, then what we're really seeing is a case
22165 like:
22167 class X { }
22168 const <type> var = ...;
22170 or
22172 class Y { }
22173 static <type> func (...) ...
22175 i.e. the qualifier or specifier applies to the next
22176 declaration. To do so, however, we need to look ahead one
22177 more token to see if *that* token is a type specifier.
22179 This code could be improved to handle:
22181 class Z { }
22182 static const <type> var = ...; */
22185 {
22188 /* Handling user-defined types here would be nice, but very
22189 tricky. */
22190 want_semicolon
22193 }
22197 }
22199 /* If we don't have a type, then something is very wrong and we
22200 shouldn't try to do anything clever. Likewise for not seeing the
22201 closing brace. */
22203 {
22204 /* Locate the closing brace. */
22205 cp_token_position prev
22210 /* We want to suggest insertion of a ';' immediately *after* the
22211 closing brace, so, if we can, offset the location by 1 column. */
22218 /* If we successfully offset the location, suggest the fix-it. */
22231 else
22234 /* Unget one token and smash it to look as though we encountered
22235 a semicolon in the input stream. */
22240 }
22241 }
22243 /* If this class is not itself within the scope of another class,
22244 then we need to parse the bodies of all of the queued function
22245 definitions. Note that the queued functions defined in a class
22246 are not always processed immediately following the
22247 class-specifier for that class. Consider:
22249 struct A {
22250 struct B { void f() { sizeof (A); } };
22251 };
22253 If `f' were processed before the processing of `A' were
22254 completed, there would be no way to compute the size of `A'.
22255 Note that the nesting we are interested in here is lexical --
22256 not the semantic nesting given by TYPE_CONTEXT. In particular,
22257 for:
22259 struct A { struct B; };
22260 struct A::B { void f() { } };
22262 there is no need to delay the parsing of `A::B::f'. */
22264 {
22265 tree decl;
22272 /* In a first pass, parse default arguments to the functions.
22273 Then, in a second pass, parse the bodies of the functions.
22274 This two-phased approach handles cases like:
22276 struct S {
22277 void f() { g(); }
22278 void g(int i = 3);
22279 };
22281 */
22283 {
22285 /* If there are default arguments that have not yet been processed,
22286 take care of them now. */
22288 {
22293 }
22294 /* Make sure that any template parameters are in scope. */
22296 /* Parse the default argument expressions. */
22298 /* Remove any template parameters from the symbol table. */
22300 }
22302 /* Now parse any NSDMIs. */
22306 {
22308 {
22313 }
22316 }
22323 /* Now do some post-NSDMI bookkeeping. */
22329 /* Now parse the body of the functions. */
22331 {
22332 /* OpenMP UDRs need to be parsed before all other functions. */
22339 }
22340 else
22344 }
22345 else
22348 /* Put back any saved access checks. */
22351 /* Restore saved state. */
22355 parser->num_template_parameter_lists
22357 parser->in_unbraced_linkage_specification_p
22361 }
22363 static tree
22365 {
22366 tree ret;
22371 }
22373 /* Parse a class-head.
22375 class-head:
22376 class-key identifier [opt] base-clause [opt]
22377 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22378 class-key nested-name-specifier [opt] template-id
22379 base-clause [opt]
22381 class-virt-specifier:
22382 final
22384 GNU Extensions:
22385 class-key attributes identifier [opt] base-clause [opt]
22386 class-key attributes nested-name-specifier identifier base-clause [opt]
22387 class-key attributes nested-name-specifier [opt] template-id
22388 base-clause [opt]
22390 Upon return BASES is initialized to the list of base classes (or
22391 NULL, if there are none) in the same form returned by
22392 cp_parser_base_clause.
22394 Returns the TYPE of the indicated class. Sets
22395 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22396 involving a nested-name-specifier was used, and FALSE otherwise.
22398 Returns error_mark_node if this is not a class-head.
22400 Returns NULL_TREE if the class-head is syntactically valid, but
22401 semantically invalid in a way that means we should skip the entire
22402 body of the class. */
22404 static tree
22407 {
22408 tree nested_name_specifier;
22412 tree attributes;
22413 tree bases;
22423 /* Assume no nested-name-specifier will be present. */
22425 /* Assume no template parameter lists will be used in defining the
22426 type. */
22430 /* Look for the class-key. */
22437 /* Parse the attributes. */
22440 /* If the next token is `::', that is invalid -- but sometimes
22441 people do try to write:
22443 struct ::S {};
22445 Handle this gracefully by accepting the extra qualifier, and then
22446 issuing an error about it later if this really is a
22447 class-head. If it turns out just to be an elaborated type
22448 specifier, remain silent. */
22454 /* Determine the name of the class. Begin by looking for an
22455 optional nested-name-specifier. */
22457 nested_name_specifier
22463 /* If there was a nested-name-specifier, then there *must* be an
22464 identifier. */
22466 {
22468 /* Although the grammar says `identifier', it really means
22469 `class-name' or `template-name'. You are only allowed to
22470 define a class that has already been declared with this
22471 syntax.
22473 The proposed resolution for Core Issue 180 says that wherever
22474 you see `class T::X' you should treat `X' as a type-name.
22476 It is OK to define an inaccessible class; for example:
22478 class A { class B; };
22479 class A::B {};
22481 We do not know if we will see a class-name, or a
22482 template-name. We look for a class-name first, in case the
22483 class-name is a template-id; if we looked for the
22484 template-name first we would stop after the template-name. */
22489 class_type,
22493 /* If that didn't work, ignore the nested-name-specifier. */
22495 {
22501 }
22502 /* If we could not find a corresponding TYPE, treat this
22503 declaration like an unqualified declaration. */
22506 /* Otherwise, count the number of templates used in TYPE and its
22507 containing scopes. */
22508 else
22509 {
22510 tree scope;
22522 }
22523 }
22524 /* Otherwise, the identifier is optional. */
22525 else
22526 {
22527 /* We don't know whether what comes next is a template-id,
22528 an identifier, or nothing at all. */
22530 /* Check for a template-id. */
22535 class_key,
22537 /* If that didn't work, it could still be an identifier. */
22539 {
22541 {
22544 }
22545 else
22547 }
22548 else
22549 {
22552 }
22553 }
22558 {
22560 class_key,
22562 }
22565 /* If it's not a `:' or a `{' then we can't really be looking at a
22566 class-head, since a class-head only appears as part of a
22567 class-specifier. We have to detect this situation before calling
22568 xref_tag, since that has irreversible side-effects. */
22570 {
22574 }
22576 /* At this point, we're going ahead with the class-specifier, even
22577 if some other problem occurs. */
22580 {
22585 }
22586 /* Issue the error about the overly-qualified name now. */
22588 {
22593 }
22595 {
22600 }
22602 {
22603 tree scope;
22605 /* Reject typedef-names in class heads. */
22607 {
22610 type);
22613 }
22615 /* Figure out in what scope the declaration is being placed. */
22617 /* If that scope does not contain the scope in which the
22618 class was originally declared, the program is invalid. */
22620 {
22623 "declaration of %qD in namespace %qD which does not "
22626 else
22632 }
22633 /* [dcl.meaning]
22635 A declarator-id shall not be qualified except for the
22636 definition of a ... nested class outside of its class
22637 ... [or] the definition or explicit instantiation of a
22638 class member of a namespace outside of its namespace. */
22640 {
22645 }
22646 }
22647 /* An explicit-specialization must be preceded by "template <>". If
22648 it is not, try to recover gracefully. */
22651 && !processing_template_parmlist
22653 {
22654 /* Build a location of this form:
22655 struct typename <ARGS>
22656 ^~~~~~~~~~~~~~~~~~~~~~
22657 with caret==start at the start token, and
22658 finishing at the end of the type. */
22659 location_t reported_loc
22661 class_head_start_location,
22666 error_at_rich_loc
22670 /* Take the same action that would have been taken by
22671 cp_parser_explicit_specialization. */
22674 }
22675 /* There must be no "return" statements between this point and the
22676 end of this function; set "type "to the correct return value and
22677 use "goto done;" to return. */
22678 /* Make sure that the right number of template parameters were
22679 present. */
22683 {
22684 /* If something went wrong, there is no point in even trying to
22685 process the class-definition. */
22688 }
22690 /* Look up the type. */
22692 {
22696 {
22700 }
22701 else
22702 {
22706 /* Check the scope while we still know whether or not we had a
22707 nested-name-specifier. */
22710 }
22713 }
22715 {
22716 tree class_type;
22718 /* Given:
22720 template <typename T> struct S { struct T };
22721 template <typename T> struct S<T>::T { };
22723 we will get a TYPENAME_TYPE when processing the definition of
22724 `S::T'. We need to resolve it to the actual type before we
22725 try to define it. */
22727 {
22732 else
22733 {
22736 }
22737 }
22741 {
22744 }
22747 /* Enter the scope indicated by the nested-name-specifier. */
22749 /* Get the canonical version of this type. */
22751 /* Call push_template_decl if it seems like we should be defining a
22752 template either from the template headers or the type we're
22753 defining, so that we diagnose both extra and missing headers. */
22757 {
22760 {
22763 }
22764 }
22768 }
22770 {
22771 /* If the class was unnamed, create a dummy name. */
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. */
23406 }
23407 else
23410 /* Create the declaration. */
23415 {
23418 else
23420 }
23421 }
23426 /* Reset PREFIX_ATTRIBUTES. */
23432 /* If there is any qualification still in effect, clear it
23433 now; we will be starting fresh with the next declarator. */
23437 /* If it's a `,', then there are more declarators. */
23439 {
23442 {
23446 }
23447 }
23448 /* If the next token isn't a `;', then we have a parse error. */
23450 CPP_SEMICOLON))
23451 {
23452 /* The next token might be a ways away from where the
23453 actual semicolon is missing. Find the previous token
23454 and use that for our error position. */
23459 /* Assume that the user meant to provide a semicolon. If
23460 we were to cp_parser_skip_to_end_of_statement, we might
23461 skip to a semicolon inside a member function definition
23462 and issue nonsensical error messages. */
23464 }
23467 {
23468 /* Add DECL to the list of members. */
23470 /* Explicitly include, eg, NSDMIs, for better error
23471 recovery (c++/58650). */
23480 /* Add DECL to the queue of NSDMI to be parsed later. */
23482 }
23486 }
23487 }
23490 out:
23492 }
23494 /* Parse a pure-specifier.
23496 pure-specifier:
23497 = 0
23499 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23500 Otherwise, ERROR_MARK_NODE is returned. */
23502 static tree
23504 {
23507 /* Look for the `=' token. */
23510 /* Look for the `0' token. */
23519 /* Accept = default or = delete in c++0x mode. */
23522 {
23525 }
23527 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23529 {
23534 }
23536 {
23539 }
23542 }
23544 /* Parse a constant-initializer.
23546 constant-initializer:
23547 = constant-expression
23549 Returns a representation of the constant-expression. */
23551 static tree
23553 {
23554 /* Look for the `=' token. */
23558 /* It is invalid to write:
23560 struct S { static const int i = { 7 }; };
23562 */
23564 {
23567 /* Consume the opening brace. */
23569 /* Skip the initializer. */
23571 /* Look for the trailing `}'. */
23575 }
23578 }
23580 /* Derived classes [gram.class.derived] */
23582 /* Parse a base-clause.
23584 base-clause:
23585 : base-specifier-list
23587 base-specifier-list:
23588 base-specifier ... [opt]
23589 base-specifier-list , base-specifier ... [opt]
23591 Returns a TREE_LIST representing the base-classes, in the order in
23592 which they were declared. The representation of each node is as
23593 described by cp_parser_base_specifier.
23595 In the case that no bases are specified, this function will return
23596 NULL_TREE, not ERROR_MARK_NODE. */
23598 static tree
23600 {
23603 /* Look for the `:' that begins the list. */
23606 /* Scan the base-specifier-list. */
23608 {
23610 tree base;
23613 /* Look for the base-specifier. */
23615 /* Look for the (optional) ellipsis. */
23617 {
23618 /* Consume the `...'. */
23622 }
23624 /* Add BASE to the front of the list. */
23626 {
23628 /* Make this a pack expansion type. */
23632 {
23635 }
23636 }
23637 /* Peek at the next token. */
23639 /* If it's not a comma, then the list is complete. */
23642 /* Consume the `,'. */
23644 }
23646 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23647 base class had a qualified name. However, the next name that
23648 appears is certainly not qualified. */
23654 }
23656 /* Parse a base-specifier.
23658 base-specifier:
23659 :: [opt] nested-name-specifier [opt] class-name
23660 virtual access-specifier [opt] :: [opt] nested-name-specifier
23661 [opt] class-name
23662 access-specifier virtual [opt] :: [opt] nested-name-specifier
23663 [opt] class-name
23665 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23666 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23667 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23668 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23670 static tree
23672 {
23680 tree type;
23682 /* Process the optional `virtual' and `access-specifier'. */
23684 {
23685 /* Peek at the next token. */
23687 /* Process `virtual'. */
23689 {
23691 /* If `virtual' appears more than once, issue an error. */
23693 {
23697 }
23701 /* Consume the `virtual' token. */
23709 /* If more than one access specifier appears, issue an
23710 error. */
23713 {
23717 }
23721 /* Consume the access-specifier. */
23729 }
23730 }
23731 /* It is not uncommon to see programs mechanically, erroneously, use
23732 the 'typename' keyword to denote (dependent) qualified types
23733 as base classes. */
23735 {
23740 else
23742 "keyword %<typename%> not allowed in this context "
23745 }
23747 /* Look for the optional `::' operator. */
23749 /* Look for the nested-name-specifier. The simplest way to
23750 implement:
23752 [temp.res]
23754 The keyword `typename' is not permitted in a base-specifier or
23755 mem-initializer; in these contexts a qualified name that
23756 depends on a template-parameter is implicitly assumed to be a
23757 type name.
23759 is to pretend that we have seen the `typename' keyword at this
23760 point. */
23766 /* If the base class is given by a qualified name, assume that names
23767 we see are type names or templates, as appropriate. */
23773 /* DR 950 allows decltype as a base-specifier. */
23775 else
23776 {
23777 /* Otherwise, look for the class-name. */
23779 class_scope_p,
23780 template_p,
23781 typename_type,
23786 }
23792 }
23794 /* Exception handling [gram.exception] */
23796 /* Parse an (optional) noexcept-specification.
23798 noexcept-specification:
23799 noexcept ( constant-expression ) [opt]
23801 If no noexcept-specification is present, returns NULL_TREE.
23802 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23803 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23804 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23805 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23806 in which case a boolean condition is returned instead. */
23808 static tree
23813 {
23817 /* Peek at the next token. */
23820 /* Is it a noexcept-specification? */
23822 {
23823 tree expr;
23827 {
23831 {
23832 /* Types may not be defined in an exception-specification. */
23834 parser->type_definition_forbidden_message
23839 /* Restore the saved message. */
23841 }
23842 else
23843 {
23846 }
23849 }
23850 else
23851 {
23855 }
23857 /* We cannot build a noexcept-spec right away because this will check
23858 that expr is a constexpr. */
23861 else
23863 }
23864 else
23866 }
23868 /* Parse an (optional) exception-specification.
23870 exception-specification:
23871 throw ( type-id-list [opt] )
23873 Returns a TREE_LIST representing the exception-specification. The
23874 TREE_VALUE of each node is a type. */
23876 static tree
23878 {
23880 tree type_id_list;
23883 /* Peek at the next token. */
23886 /* Is it a noexcept-specification? */
23892 /* If it's not `throw', then there's no exception-specification. */
23898 /* Consume the `throw'. */
23901 /* Look for the `('. */
23904 /* Peek at the next token. */
23906 /* If it's not a `)', then there is a type-id-list. */
23908 {
23909 /* Types may not be defined in an exception-specification. */
23911 parser->type_definition_forbidden_message
23913 /* Parse the type-id-list. */
23915 /* Restore the saved message. */
23919 {
23923 }
23926 "dynamic exception specifications are deprecated in C++11;"
23928 }
23929 /* In C++17, throw() is equivalent to noexcept (true). throw()
23930 is deprecated in C++11 and above as well, but is still widely used,
23931 so don't warn about it yet. */
23934 else
23937 /* Look for the `)'. */
23941 }
23943 /* Parse an (optional) type-id-list.
23945 type-id-list:
23946 type-id ... [opt]
23947 type-id-list , type-id ... [opt]
23949 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23950 in the order that the types were presented. */
23952 static tree
23954 {
23958 {
23960 tree type;
23964 /* Get the next type-id. */
23966 /* Check for invalid 'auto'. */
23968 {
23972 }
23973 /* Parse the optional ellipsis. */
23975 {
23976 /* Consume the `...'. */
23979 /* Turn the type into a pack expansion expression. */
23981 }
23982 /* Add it to the list. */
23984 /* Peek at the next token. */
23986 /* If it is not a `,', we are done. */
23989 /* Consume the `,'. */
23991 }
23994 }
23996 /* Parse a try-block.
23998 try-block:
23999 try compound-statement handler-seq */
24001 static tree
24003 {
24004 tree try_block;
24018 }
24020 /* Parse a function-try-block.
24022 function-try-block:
24023 try ctor-initializer [opt] function-body handler-seq */
24025 static bool
24027 {
24028 tree compound_stmt;
24029 tree try_block;
24032 /* Look for the `try' keyword. */
24035 /* Let the rest of the front end know where we are. */
24037 /* Parse the function-body. */
24038 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24040 /* We're done with the `try' part. */
24042 /* Parse the handlers. */
24044 /* We're done with the handlers. */
24048 }
24050 /* Parse a handler-seq.
24052 handler-seq:
24053 handler handler-seq [opt] */
24055 static void
24057 {
24059 {
24062 /* Parse the handler. */
24064 /* Peek at the next token. */
24066 /* If it's not `catch' then there are no more handlers. */
24069 }
24070 }
24072 /* Parse a handler.
24074 handler:
24075 catch ( exception-declaration ) compound-statement */
24077 static void
24079 {
24080 tree handler;
24081 tree declaration;
24091 }
24093 /* Parse an exception-declaration.
24095 exception-declaration:
24096 type-specifier-seq declarator
24097 type-specifier-seq abstract-declarator
24098 type-specifier-seq
24099 ...
24101 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24102 ellipsis variant is used. */
24104 static tree
24106 {
24107 cp_decl_specifier_seq type_specifiers;
24111 /* If it's an ellipsis, it's easy to handle. */
24113 {
24114 /* Consume the `...' token. */
24117 }
24119 /* Types may not be defined in exception-declarations. */
24121 parser->type_definition_forbidden_message
24124 /* Parse the type-specifier-seq. */
24128 /* If it's a `)', then there is no declarator. */
24131 else
24138 /* Restore the saved message. */
24145 }
24147 /* Parse a throw-expression.
24149 throw-expression:
24150 throw assignment-expression [opt]
24152 Returns a THROW_EXPR representing the throw-expression. */
24154 static tree
24156 {
24157 tree expression;
24162 /* Figure out whether or not there is an assignment-expression
24163 following the "throw" keyword. */
24171 else
24175 }
24177 /* GNU Extensions */
24179 /* Parse an (optional) asm-specification.
24181 asm-specification:
24182 asm ( string-literal )
24184 If the asm-specification is present, returns a STRING_CST
24185 corresponding to the string-literal. Otherwise, returns
24186 NULL_TREE. */
24188 static tree
24190 {
24192 tree asm_specification;
24194 /* Peek at the next token. */
24196 /* If the next token isn't the `asm' keyword, then there's no
24197 asm-specification. */
24201 /* Consume the `asm' token. */
24203 /* Look for the `('. */
24206 /* Look for the string-literal. */
24209 /* Look for the `)'. */
24213 }
24215 /* Parse an asm-operand-list.
24217 asm-operand-list:
24218 asm-operand
24219 asm-operand-list , asm-operand
24221 asm-operand:
24222 string-literal ( expression )
24223 [ string-literal ] string-literal ( expression )
24225 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24226 each node is the expression. The TREE_PURPOSE is itself a
24227 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24228 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24229 is a STRING_CST for the string literal before the parenthesis. Returns
24230 ERROR_MARK_NODE if any of the operands are invalid. */
24232 static tree
24234 {
24239 {
24240 tree string_literal;
24241 tree expression;
24242 tree name;
24245 {
24246 /* Consume the `[' token. */
24248 /* Read the operand name. */
24253 /* Look for the closing `]'. */
24255 }
24256 else
24258 /* Look for the string-literal. */
24261 /* Look for the `('. */
24263 /* Parse the expression. */
24265 /* Look for the `)'. */
24273 /* Add this operand to the list. */
24275 expression,
24276 asm_operands);
24277 /* If the next token is not a `,', there are no more
24278 operands. */
24281 /* Consume the `,'. */
24283 }
24286 }
24288 /* Parse an asm-clobber-list.
24290 asm-clobber-list:
24291 string-literal
24292 asm-clobber-list , string-literal
24294 Returns a TREE_LIST, indicating the clobbers in the order that they
24295 appeared. The TREE_VALUE of each node is a STRING_CST. */
24297 static tree
24299 {
24303 {
24304 tree string_literal;
24306 /* Look for the string literal. */
24308 /* Add it to the list. */
24310 /* If the next token is not a `,', then the list is
24311 complete. */
24314 /* Consume the `,' token. */
24316 }
24319 }
24321 /* Parse an asm-label-list.
24323 asm-label-list:
24324 identifier
24325 asm-label-list , identifier
24327 Returns a TREE_LIST, indicating the labels in the order that they
24328 appeared. The TREE_VALUE of each node is a label. */
24330 static tree
24332 {
24336 {
24339 /* Look for the identifier. */
24342 {
24345 {
24351 }
24352 }
24353 /* If the next token is not a `,', then the list is
24354 complete. */
24357 /* Consume the `,' token. */
24359 }
24362 }
24364 /* Return TRUE iff the next tokens in the stream are possibly the
24365 beginning of a GNU extension attribute. */
24367 static bool
24369 {
24371 }
24373 /* Return TRUE iff the next tokens in the stream are possibly the
24374 beginning of a standard C++-11 attribute specifier. */
24376 static bool
24378 {
24380 }
24382 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24383 beginning of a standard C++-11 attribute specifier. */
24385 static bool
24387 {
24395 }
24397 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24398 beginning of a GNU extension attribute. */
24400 static bool
24402 {
24406 }
24408 /* Return true iff the next tokens can be the beginning of either a
24409 GNU attribute list, or a standard C++11 attribute sequence. */
24411 static bool
24413 {
24416 }
24418 /* Return true iff the next Nth tokens can be the beginning of either
24419 a GNU attribute list, or a standard C++11 attribute sequence. */
24421 static bool
24423 {
24426 }
24428 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24429 of GNU attributes, or return NULL. */
24431 static tree
24433 {
24437 }
24439 #define CILK_SIMD_FN_CLAUSE_MASK \
24440 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24441 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24442 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24443 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24444 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24446 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24447 vector [(<clauses>)] */
24449 static void
24451 {
24455 {
24461 }
24464 {
24467 paren_scope++;
24468 }
24470 {
24473 paren_scope++;
24475 paren_scope--;
24476 /* Do not push the last ')' */
24479 }
24488 }
24490 /* Parse an (optional) series of attributes.
24492 attributes:
24493 attributes attribute
24495 attribute:
24496 __attribute__ (( attribute-list [opt] ))
24498 The return value is as for cp_parser_gnu_attribute_list. */
24500 static tree
24502 {
24506 {
24508 tree attribute_list;
24511 /* Peek at the next token. */
24513 /* If it's not `__attribute__', then we're done. */
24517 /* Consume the `__attribute__' keyword. */
24519 /* Look for the two `(' tokens. */
24523 /* Peek at the next token. */
24526 /* Parse the attribute-list. */
24528 else
24529 /* If the next token is a `)', then there is no attribute
24530 list. */
24533 /* Look for the two `)' tokens. */
24541 /* Add these new attributes to the list. */
24543 }
24546 }
24548 /* Parse a GNU attribute-list.
24550 attribute-list:
24551 attribute
24552 attribute-list , attribute
24554 attribute:
24555 identifier
24556 identifier ( identifier )
24557 identifier ( identifier , expression-list )
24558 identifier ( expression-list )
24560 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24561 to an attribute. The TREE_PURPOSE of each node is the identifier
24562 indicating which attribute is in use. The TREE_VALUE represents
24563 the arguments, if any. */
24565 static tree
24567 {
24573 {
24575 tree identifier;
24576 tree attribute;
24578 /* Look for the identifier. We also allow keywords here; for
24579 example `__attribute__ ((const))' is legal. */
24583 {
24586 /* Consume the token, but save it since we need it for the
24587 SIMD enabled function parsing. */
24590 /* Save away the identifier that indicates which attribute
24591 this is. */
24593 /* For keywords, use the canonical spelling, not the
24594 parsed identifier. */
24600 /* Peek at the next token. */
24602 /* If it's an `(', then parse the attribute arguments. */
24604 {
24609 {
24612 }
24613 else
24614 vec = cp_parser_parenthesized_expression_list
24620 else
24621 {
24624 }
24625 /* Save the arguments away. */
24627 }
24629 {
24632 }
24635 {
24636 /* Add this attribute to the list. */
24639 }
24642 }
24643 /* Now, look for more attributes. If the next token isn't a
24644 `,', we're done. */
24648 /* Consume the comma and keep going. */
24650 }
24653 /* We built up the list in reverse order. */
24655 }
24657 /* Parse a standard C++11 attribute.
24659 The returned representation is a TREE_LIST which TREE_PURPOSE is
24660 the scoped name of the attribute, and the TREE_VALUE is its
24661 arguments list.
24663 Note that the scoped name of the attribute is itself a TREE_LIST
24664 which TREE_PURPOSE is the namespace of the attribute, and
24665 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24666 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24667 and which TREE_PURPOSE is directly the attribute name.
24669 Clients of the attribute code should use get_attribute_namespace
24670 and get_attribute_name to get the actual namespace and name of
24671 attributes, regardless of their being GNU or C++11 attributes.
24673 attribute:
24674 attribute-token attribute-argument-clause [opt]
24676 attribute-token:
24677 identifier
24678 attribute-scoped-token
24680 attribute-scoped-token:
24681 attribute-namespace :: identifier
24683 attribute-namespace:
24684 identifier
24686 attribute-argument-clause:
24687 ( balanced-token-seq )
24689 balanced-token-seq:
24690 balanced-token [opt]
24691 balanced-token-seq balanced-token
24693 balanced-token:
24694 ( balanced-token-seq )
24695 [ balanced-token-seq ]
24696 { balanced-token-seq }. */
24698 static tree
24700 {
24704 /* First, parse name of the attribute, a.k.a attribute-token. */
24721 {
24722 /* We are seeing a scoped attribute token. */
24737 else
24738 {
24742 }
24744 NULL_TREE);
24746 }
24749 NULL_TREE);
24750 else
24751 {
24753 NULL_TREE);
24754 /* C++11 noreturn attribute is equivalent to GNU's. */
24757 /* C++14 deprecated attribute is equivalent to GNU's. */
24760 /* C++17 fallthrough attribute is equivalent to GNU's. */
24763 /* Transactional Memory TS optimize_for_synchronized attribute is
24764 equivalent to GNU transaction_callable. */
24768 /* Transactional Memory attributes are GNU attributes. */
24771 }
24773 /* Now parse the optional argument clause of the attribute. */
24778 {
24784 /* A GNU attribute that takes an identifier in parameter. */
24787 vec = cp_parser_parenthesized_expression_list
24793 else
24794 {
24797 }
24801 else
24803 }
24806 }
24808 /* Check that the attribute ATTRIBUTE appears at most once in the
24809 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24810 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24811 isn't implemented yet in GCC. */
24813 static void
24815 {
24817 {
24827 }
24828 }
24830 /* Parse a list of standard C++-11 attributes.
24832 attribute-list:
24833 attribute [opt]
24834 attribute-list , attribute[opt]
24835 attribute ...
24836 attribute-list , attribute ...
24837 */
24839 static tree
24841 {
24846 {
24851 {
24855 }
24858 {
24863 else
24867 }
24871 }
24874 }
24876 /* Parse a standard C++-11 attribute specifier.
24878 attribute-specifier:
24879 [ [ attribute-using-prefix [opt] attribute-list ] ]
24880 alignment-specifier
24882 attribute-using-prefix:
24883 using attribute-namespace :
24885 alignment-specifier:
24886 alignas ( type-id ... [opt] )
24887 alignas ( alignment-expression ... [opt] ). */
24889 static tree
24891 {
24897 {
24904 {
24915 {
24919 "attribute using prefix only available "
24925 }
24926 else
24928 }
24935 else
24936 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24937 when we are sure that we have actually parsed them. */
24939 }
24940 else
24941 {
24942 tree alignas_expr;
24944 /* Look for an alignment-specifier. */
24956 {
24959 }
24965 {
24972 }
24978 {
24981 }
24984 {
24987 }
24989 /* Build the C++-11 representation of an 'aligned'
24990 attribute. */
24991 attributes =
24994 alignas_expr);
24995 }
24998 }
25000 /* Parse a standard C++-11 attribute-specifier-seq.
25002 attribute-specifier-seq:
25003 attribute-specifier-seq [opt] attribute-specifier
25004 */
25006 static tree
25008 {
25013 {
25022 else
25025 }
25028 }
25030 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25031 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25032 current value of the PEDANTIC flag, regardless of whether or not
25033 the `__extension__' keyword is present. The caller is responsible
25034 for restoring the value of the PEDANTIC flag. */
25036 static bool
25038 {
25039 /* Save the old value of the PEDANTIC flag. */
25043 {
25044 /* Consume the `__extension__' token. */
25046 /* We're not being pedantic while the `__extension__' keyword is
25047 in effect. */
25051 }
25054 }
25056 /* Parse a label declaration.
25058 label-declaration:
25059 __label__ label-declarator-seq ;
25061 label-declarator-seq:
25062 identifier , label-declarator-seq
25063 identifier */
25065 static void
25067 {
25068 /* Look for the `__label__' keyword. */
25072 {
25073 tree identifier;
25075 /* Look for an identifier. */
25077 /* If we failed, stop. */
25080 /* Declare it as a label. */
25082 /* If the next token is a `;', stop. */
25085 /* Look for the `,' separating the label declarations. */
25087 }
25089 /* Look for the final `;'. */
25091 }
25093 // -------------------------------------------------------------------------- //
25094 // Requires Clause
25096 // Parse a requires clause.
25097 //
25098 // requires-clause:
25099 // 'requires' logical-or-expression
25100 //
25101 // The required logical-or-expression must be a constant expression. Note
25102 // that we don't check that the expression is constepxr here. We defer until
25103 // we analyze constraints and then, we only check atomic constraints.
25104 static tree
25106 {
25107 // Parse the requires clause so that it is not automatically folded.
25115 }
25117 // Optionally parse a requires clause:
25118 static tree
25120 {
25123 {
25126 {
25129 /* Parse and discard the requires-clause. */
25132 }
25134 }
25137 }
25140 /*---------------------------------------------------------------------------
25141 Requires expressions
25142 ---------------------------------------------------------------------------*/
25144 /* Parse a requires expression
25146 requirement-expression:
25147 'requires' requirement-parameter-list [opt] requirement-body */
25148 static tree
25150 {
25154 /* A requires-expression shall appear only within a concept
25155 definition or a requires-clause.
25157 TODO: Implement this diagnostic correctly. */
25159 {
25163 }
25166 {
25167 /* Local parameters are delared as variables within the scope
25168 of the expression. They are not visible past the end of
25169 the expression. Expressions within the requires-expression
25170 are unevaluated. */
25171 struct scope_sentinel
25172 {
25174 {
25177 }
25180 {
25183 }
25186 /* Parse the optional parameter list. */
25188 {
25192 }
25193 else
25196 /* Parse the requirement body. */
25200 }
25202 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25203 the parm chain. */
25206 }
25208 /* Parse a parameterized requirement.
25210 requirement-parameter-list:
25211 '(' parameter-declaration-clause ')' */
25212 static tree
25214 {
25224 }
25226 /* Parse the body of a requirement.
25228 requirement-body:
25229 '{' requirement-list '}' */
25230 static tree
25232 {
25242 }
25244 /* Parse a list of requirements.
25246 requirement-list:
25247 requirement
25248 requirement-list ';' requirement[opt] */
25249 static tree
25251 {
25254 {
25261 /* If we see a semi-colon, consume it. */
25265 /* Stop processing at the end of the list. */
25268 }
25270 /* Reverse the order of requirements so they are analyzed in
25271 declaration order. */
25273 }
25275 /* Parse a syntactic requirement or type requirement.
25277 requirement:
25278 simple-requirement
25279 compound-requirement
25280 type-requirement
25281 nested-requirement */
25282 static tree
25284 {
25291 else
25293 }
25295 /* Parse a simple requirement.
25297 simple-requirement:
25298 expression ';' */
25299 static tree
25301 {
25310 }
25312 /* Parse a type requirement
25314 type-requirement
25315 nested-name-specifier [opt] required-type-name ';'
25317 required-type-name:
25318 type-name
25319 'template' [opt] simple-template-id */
25320 static tree
25322 {
25325 // Save the scope before parsing name specifiers.
25336 tree type;
25338 {
25347 }
25348 else
25367 }
25369 /* Parse a compound requirement
25371 compound-requirement:
25372 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25373 static tree
25375 {
25376 /* Parse an expression enclosed in '{ }'s. */
25387 /* Parse the optional noexcept. */
25390 {
25393 }
25395 /* Parse the optional trailing return type. */
25398 {
25406 }
25409 }
25411 /* Parse a nested requirement. This is the same as a requires clause.
25413 nested-requirement:
25414 requires-clause */
25415 static tree
25417 {
25423 }
25425 /* Support Functions */
25427 /* Return the appropriate prefer_type argument for lookup_name_real based on
25428 tag_type and template_mem_access. */
25432 {
25433 /* DR 141: When looking in the current enclosing context for a template-name
25434 after -> or ., only consider class templates. */
25438 {
25442 }
25443 }
25445 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25446 NAME should have one of the representations used for an
25447 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25448 is returned. If PARSER->SCOPE is a dependent type, then a
25449 SCOPE_REF is returned.
25451 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25452 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25453 was formed. Abstractly, such entities should not be passed to this
25454 function, because they do not need to be looked up, but it is
25455 simpler to check for this special case here, rather than at the
25456 call-sites.
25458 In cases not explicitly covered above, this function returns a
25459 DECL, OVERLOAD, or baselink representing the result of the lookup.
25460 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25461 is returned.
25463 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25464 (e.g., "struct") that was used. In that case bindings that do not
25465 refer to types are ignored.
25467 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25468 ignored.
25470 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25471 are ignored.
25473 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25474 types.
25476 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25477 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25478 NULL_TREE otherwise. */
25480 static cp_expr
25487 location_t name_location)
25488 {
25489 tree decl;
25492 /* Assume that the lookup will be unambiguous. */
25496 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25497 no longer valid. Note that if we are parsing tentatively, and
25498 the parse fails, OBJECT_TYPE will be automatically restored. */
25504 /* A template-id has already been resolved; there is no lookup to
25505 do. */
25509 {
25513 }
25515 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25516 it should already have been checked to make sure that the name
25517 used matches the type being destroyed. */
25519 {
25520 tree type;
25522 /* Figure out to which type this destructor applies. */
25527 else
25529 /* If that's not a class type, there is no destructor. */
25536 /* If it was a class type, return the destructor. */
25538 }
25540 /* By this point, the NAME should be an ordinary identifier. If
25541 the id-expression was a qualified name, the qualifying scope is
25542 stored in PARSER->SCOPE at this point. */
25545 /* Perform the lookup. */
25547 {
25553 /* If the SCOPE is dependent, the lookup must be deferred until
25554 the template is instantiated -- unless we are explicitly
25555 looking up names in uninstantiated templates. Even then, we
25556 cannot look up the name if the scope is not a class type; it
25557 might, for example, be a template type parameter. */
25562 /* Defer lookup. */
25564 else
25565 {
25568 /* If PARSER->SCOPE is a dependent type, then it must be a
25569 class type, and we must not be checking dependencies;
25570 otherwise, we would have processed this lookup above. So
25571 that PARSER->SCOPE is not considered a dependent base by
25572 lookup_member, we must enter the scope here. */
25576 /* If the PARSER->SCOPE is a template specialization, it
25577 may be instantiated during name lookup. In that case,
25578 errors may be issued. Even if we rollback the current
25579 tentative parse, those errors are valid. */
25584 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25585 lookup result and the nested-name-specifier nominates a class C:
25586 * if the name specified after the nested-name-specifier, when
25587 looked up in C, is the injected-class-name of C (Clause 9), or
25588 * if the name specified after the nested-name-specifier is the
25589 same as the identifier or the simple-template-id's template-
25590 name in the last component of the nested-name-specifier,
25591 the name is instead considered to name the constructor of
25592 class C. [ Note: for example, the constructor is not an
25593 acceptable lookup result in an elaborated-type-specifier so
25594 the constructor would not be used in place of the
25595 injected-class-name. --end note ] Such a constructor name
25596 shall be used only in the declarator-id of a declaration that
25597 names a constructor or in a using-declaration. */
25605 /* If we have a single function from a using decl, pull it out. */
25612 }
25614 /* If the scope is a dependent type and either we deferred lookup or
25615 we did lookup but didn't find the name, rememeber the name. */
25618 {
25620 {
25621 tree type;
25623 /* The resolution to Core Issue 180 says that `struct
25624 A::B' should be considered a type-name, even if `A'
25625 is dependent. */
25630 }
25634 CPP_CLOSE_PAREN)))
25638 else
25641 is_template);
25642 }
25645 }
25647 {
25648 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25649 OBJECT_TYPE is not a class. */
25651 /* If the OBJECT_TYPE is a template specialization, it may
25652 be instantiated during name lookup. In that case, errors
25653 may be issued. Even if we rollback the current tentative
25654 parse, those errors are valid. */
25656 name,
25659 tf_warning_or_error);
25660 else
25664 /* Look it up in the enclosing context. DR 141: When looking for a
25665 template-name after -> or ., only consider class templates. */
25670 /* The object is type-dependent, so we can't look anything up; we used
25671 this to get the DR 141 behavior. */
25675 }
25676 else
25677 {
25683 }
25685 /* If the lookup failed, let our caller know. */
25689 /* Pull out the template from an injected-class-name (or multiple). */
25693 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25695 {
25698 /* The error message we have to print is too complicated for
25699 cp_parser_error, so we incorporate its actions directly. */
25701 {
25703 name);
25705 }
25707 }
25715 /* If we have resolved the name of a member declaration, check to
25716 see if the declaration is accessible. When the name resolves to
25717 set of overloaded functions, accessibility is checked when
25718 overload resolution is done.
25720 During an explicit instantiation, access is not checked at all,
25721 as per [temp.explicit]. */
25728 }
25730 /* Like cp_parser_lookup_name, but for use in the typical case where
25731 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25732 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25734 static tree
25736 {
25738 none_type,
25743 location);
25744 }
25746 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25747 the current context, return the TYPE_DECL. If TAG_NAME_P is
25748 true, the DECL indicates the class being defined in a class-head,
25749 or declared in an elaborated-type-specifier.
25751 Otherwise, return DECL. */
25753 static tree
25755 {
25756 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25757 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25759 struct A {
25760 template <typename T> struct B;
25761 };
25763 template <typename T> struct A::B {};
25765 Similarly, in an elaborated-type-specifier:
25767 namespace N { struct X{}; }
25769 struct A {
25770 template <typename T> friend struct N::X;
25771 };
25773 However, if the DECL refers to a class type, and we are in
25774 the scope of the class, then the name lookup automatically
25775 finds the TYPE_DECL created by build_self_reference rather
25776 than a TEMPLATE_DECL. For example, in:
25778 template <class T> struct S {
25779 S s;
25780 };
25782 there is no need to handle such case. */
25788 }
25790 /* If too many, or too few, template-parameter lists apply to the
25791 declarator, issue an error message. Returns TRUE if all went well,
25792 and FALSE otherwise. */
25794 static bool
25797 location_t declarator_location)
25798 {
25800 {
25802 {
25810 /* If the DECLARATOR has the form `X<y>' then it uses one
25811 additional level of template parameters. */
25814 return cp_parser_check_template_parameters
25816 }
25832 }
25834 }
25836 /* NUM_TEMPLATES were used in the current declaration. If that is
25837 invalid, return FALSE and issue an error messages. Otherwise,
25838 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25839 declarator and we can print more accurate diagnostics. */
25841 static bool
25844 location_t location,
25846 {
25847 /* If there are the same number of template classes and parameter
25848 lists, that's OK. */
25851 /* If there are more, but only one more, then we are referring to a
25852 member template. That's OK too. */
25855 /* If there are more template classes than parameter lists, we have
25856 something like:
25858 template <class T> void S<T>::R<T>::f (); */
25860 {
25870 else
25873 }
25874 /* Otherwise, there are too many template parameter lists. We have
25875 something like:
25877 template <class T> template <class U> void S::f(); */
25880 }
25882 /* Parse an optional `::' token indicating that the following name is
25883 from the global namespace. If so, PARSER->SCOPE is set to the
25884 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25885 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25886 Returns the new value of PARSER->SCOPE, if the `::' token is
25887 present, and NULL_TREE otherwise. */
25889 static tree
25891 {
25894 /* Peek at the next token. */
25896 /* If we're looking at a `::' token then we're starting from the
25897 global namespace, not our current location. */
25899 {
25900 /* Consume the `::' token. */
25902 /* Set the SCOPE so that we know where to start the lookup. */
25908 }
25910 {
25914 }
25917 }
25919 /* Returns TRUE if the upcoming token sequence is the start of a
25920 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
25921 declarator is preceded by the `friend' specifier. */
25923 static bool
25925 {
25928 tree nested_name_specifier;
25931 /* The common case is that this is not a constructor declarator, so
25932 try to avoid doing lots of work if at all possible. It's not
25933 valid declare a constructor at function scope. */
25936 /* And only certain tokens can begin a constructor declarator. */
25944 /* Parse tentatively; we are going to roll back all of the tokens
25945 consumed here. */
25947 /* Assume that we are looking at a constructor declarator. */
25950 /* Look for the optional `::' operator. */
25953 /* Look for the nested-name-specifier. */
25954 nested_name_specifier
25965 /* Outside of a class-specifier, there must be a
25966 nested-name-specifier. Except in C++17 mode, where we
25967 might be declaring a guiding declaration. */
25974 /* If we have a class scope, this is easy; DR 147 says that S::S always
25975 names the constructor, and no other qualified name could. */
25978 {
25988 }
25989 /* If we still think that this might be a constructor-declarator,
25990 look for a class-name. */
25992 {
25993 /* If we have:
25995 template <typename T> struct S {
25996 S();
25997 };
25999 we must recognize that the nested `S' names a class. */
26003 tree type_decl;
26007 none_type,
26014 {
26020 none_type,
26025 else
26027 }
26029 /* If there was no class-name, then this is not a constructor.
26030 Otherwise, if we are in a class-specifier and we aren't
26031 handling a friend declaration, check that its type matches
26032 current_class_type (c++/38313). Note: error_mark_node
26033 is left alone for error recovery purposes. */
26035 && (outside_class_specifier_p
26041 /* If we're still considering a constructor, we have to see a `(',
26042 to begin the parameter-declaration-clause, followed by either a
26043 `)', an `...', or a decl-specifier. We need to check for a
26044 type-specifier to avoid being fooled into thinking that:
26046 S (f) (int);
26048 is a constructor. (It is actually a function named `f' that
26049 takes one parameter (of type `int') and returns a value of type
26050 `S'. */
26058 /* A parameter declaration begins with a decl-specifier,
26059 which is either the "attribute" keyword, a storage class
26060 specifier, or (usually) a type-specifier. */
26062 {
26063 tree type;
26067 /* Names appearing in the type-specifier should be looked up
26068 in the scope of the class. */
26072 {
26075 {
26079 {
26082 }
26083 }
26085 }
26087 /* Inside the constructor parameter list, surrounding
26088 template-parameter-lists do not apply. */
26089 saved_num_template_parameter_lists
26093 /* Look for the type-specifier. */
26095 CP_PARSER_FLAGS_NONE,
26101 parser->num_template_parameter_lists
26104 /* Leave the scope of the class. */
26109 }
26110 }
26112 /* We did not really want to consume any tokens. */
26116 }
26118 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26119 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26120 they must be performed once we are in the scope of the function.
26122 Returns the function defined. */
26124 static tree
26125 cp_parser_function_definition_from_specifiers_and_declarator
26128 tree attributes,
26130 {
26131 tree fn;
26134 /* Begin the function-definition. */
26137 /* The things we're about to see are not directly qualified by any
26138 template headers we've seen thus far. */
26141 /* If there were names looked up in the decl-specifier-seq that we
26142 did not check, check them now. We must wait until we are in the
26143 scope of the function to perform the checks, since the function
26144 might be a friend. */
26148 {
26153 }
26156 {
26157 /* Skip the entire function. */
26160 }
26162 {
26163 /* Seen already, skip it. An error message has already been output. */
26167 /* If this is a function from a class, pop the nested class. */
26170 }
26171 else
26172 {
26173 timevar_id_t tv;
26176 else
26182 }
26185 }
26187 /* Parse the part of a function-definition that follows the
26188 declarator. INLINE_P is TRUE iff this function is an inline
26189 function defined within a class-specifier.
26191 Returns the function defined. */
26193 static tree
26196 {
26197 tree fn;
26203 bool fully_implicit_function_template_p
26206 tree implicit_template_parms
26209 cp_binding_level* implicit_template_scope
26215 /* If the next token is `return', then the code may be trying to
26216 make use of the "named return value" extension that G++ used to
26217 support. */
26220 {
26221 /* Consume the `return' keyword. */
26223 /* Look for the identifier that indicates what value is to be
26224 returned. */
26226 /* Issue an error message. */
26229 /* Skip tokens until we reach the start of the function body. */
26231 {
26238 }
26239 }
26240 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26241 anything declared inside `f'. */
26242 saved_in_unbraced_linkage_specification_p
26245 /* Inside the function, surrounding template-parameter-lists do not
26246 apply. */
26247 saved_num_template_parameter_lists
26253 /* If the next token is `try', `__transaction_atomic', or
26254 `__transaction_relaxed`, then we are looking at either function-try-block
26255 or function-transaction-block. Note that all of these include the
26256 function-body. */
26259 RID_TRANSACTION_ATOMIC);
26261 RID_TRANSACTION_RELAXED))
26263 RID_TRANSACTION_RELAXED);
26266 else
26267 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26272 /* Finish the function. */
26275 /* Generate code for it, if necessary. */
26277 /* Restore the saved values. */
26278 parser->in_unbraced_linkage_specification_p
26280 parser->num_template_parameter_lists
26284 parser->fully_implicit_function_template_p
26286 parser->implicit_template_parms
26288 parser->implicit_template_scope
26295 }
26297 /* Parse a template-declaration body (following argument list). */
26299 static void
26301 tree parameter_list,
26303 {
26307 /* We just processed one more parameter list. */
26310 /* Get the deferred access checks from the parameter list. These
26311 will be checked once we know what is being declared, as for a
26312 member template the checks must be performed in the scope of the
26313 class containing the member. */
26316 /* Tentatively parse for a new template parameter list, which can either be
26317 the template keyword or a template introduction. */
26323 else
26324 {
26325 /* There are no access checks when parsing a template, as we do not
26326 know if a specialization will be a friend. */
26330 checks,
26331 member_p,
26336 /* If this is a member template declaration, let the front
26337 end know. */
26339 {
26344 }
26349 }
26350 /* We are done with the current parameter list. */
26355 /* Finish up. */
26358 /* Check the template arguments for a literal operator template. */
26362 {
26366 else
26367 {
26370 {
26376 }
26378 {
26387 }
26388 else
26390 }
26392 {
26395 " Expected non-type template argument pack <char...>"
26397 decl);
26398 else
26401 decl);
26402 }
26403 }
26405 /* Register member declarations. */
26408 /* If DECL is a function template, we must return to parse it later.
26409 (Even though there is no definition, there might be default
26410 arguments that need handling.) */
26414 }
26416 /* Parse a template introduction header for a template-declaration. Returns
26417 false if tentative parse fails. */
26419 static bool
26421 {
26428 /* Look for the optional `::' operator. */
26431 /* Look for the nested-name-specifier. */
26441 /* Look up the concept for which we will be matching
26442 template parameters. */
26452 /* Look for opening brace for introduction. */
26460 /* Build vector of placeholder parameters and grab
26461 matching identifiers. */
26464 /* The introduction-list shall not be empty. */
26467 {
26470 }
26472 /* Look for closing brace for introduction. */
26477 {
26481 }
26483 /* Build and associate the constraint. */
26486 {
26488 member_p);
26490 }
26494 }
26496 /* Parse a normal template-declaration following the template keyword. */
26498 static void
26500 {
26501 tree parameter_list;
26505 /* Look for the `<' token. */
26509 {
26510 /* 14.5.2.2 [temp.mem]
26512 A local class shall not have member templates. */
26517 }
26518 /* [temp]
26520 A template ... shall not have C linkage. */
26522 {
26524 /* Give it C++ linkage to avoid confusing other parts of the
26525 front end. */
26528 }
26529 else
26532 /* We cannot perform access checks on the template parameter
26533 declarations until we know what is being declared, just as we
26534 cannot check the decl-specifier list. */
26537 /* If the next token is `>', then we have an invalid
26538 specialization. Rather than complain about an invalid template
26539 parameter, issue an error message here. */
26541 {
26545 }
26546 else
26547 {
26548 /* Parse the template parameters. */
26550 }
26552 /* Look for the `>'. */
26555 /* Manage template requirements */
26557 {
26562 }
26565 member_p);
26567 /* For the erroneous case of a template with C linkage, we pushed an
26568 implicit C++ linkage scope; exit that scope now. */
26571 }
26573 /* Parse a template-declaration, assuming that the `export' (and
26574 `extern') keywords, if present, has already been scanned. MEMBER_P
26575 is as for cp_parser_template_declaration. */
26577 static bool
26579 {
26581 {
26585 }
26590 }
26592 /* Perform the deferred access checks from a template-parameter-list.
26593 CHECKS is a TREE_LIST of access checks, as returned by
26594 get_deferred_access_checks. */
26596 static void
26597 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26598 {
26602 }
26604 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26605 `function-definition' sequence that follows a template header.
26606 If MEMBER_P is true, this declaration appears in a class scope.
26608 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26609 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26611 static tree
26617 {
26620 cp_decl_specifier_seq decl_specifiers;
26624 /* This function is only used when processing a template
26625 declaration. */
26629 /* Defer access checks until we know what is being declared. */
26632 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26633 alternative. */
26636 CP_PARSER_FLAGS_OPTIONAL,
26642 /* There are no template typedefs. */
26644 {
26648 }
26650 /* Gather up the access checks that occurred the
26651 decl-specifier-seq. */
26654 /* Check for the declaration of a template class. */
26656 {
26659 {
26660 // If this is a declaration, but not a definition, associate
26661 // any constraints with the type declaration. Constraints
26662 // are associated with definitions in cp_parser_class_specifier.
26668 /* In this case:
26670 struct C {
26671 friend template <typename T> struct A<T>::B;
26672 };
26674 A<T>::B will be represented by a TYPENAME_TYPE, and
26675 therefore not recognized by shadow_tag. */
26677 && !decl
26684 else
26687 /* Perform access checks for template parameters. */
26690 /* Give a helpful diagnostic for
26691 template <class T> struct A { } a;
26692 if we aren't already recovering from an error. */
26695 {
26697 "a class template declaration must not declare "
26701 }
26702 }
26703 }
26705 /* Complain about missing 'typename' or other invalid type names. */
26708 {
26709 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26710 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26711 the rest of this declaration. */
26714 }
26716 /* If it's not a template class, try for a template function. If
26717 the next token is a `;', then this declaration does not declare
26718 anything. But, if there were errors in the decl-specifiers, then
26719 the error might well have come from an attempted class-specifier.
26720 In that case, there's no need to warn about a missing declarator. */
26724 {
26727 checks,
26729 member_p,
26730 declares_class_or_enum,
26734 /* 7.1.1-1 [dcl.stc]
26736 A storage-class-specifier shall not be specified in an explicit
26737 specialization... */
26739 && explicit_specialization_p
26741 {
26745 }
26749 }
26751 /* Look for a trailing `;' after the declaration. */
26757 out:
26760 /* Clear any current qualification; whatever comes next is the start
26761 of something new. */
26767 }
26769 /* Parse a cast-expression that is not the operand of a unary "&". */
26771 static cp_expr
26773 {
26776 }
26778 /* Parse a functional cast to TYPE. Returns an expression
26779 representing the cast. */
26781 static cp_expr
26783 {
26785 tree expression_list;
26786 cp_expr cast;
26795 {
26804 tf_warning_or_error);
26805 /* Create a location of the form:
26806 type_name{i, f}
26807 ^~~~~~~~~~~~~~~
26808 with caret == start at the start of the type name,
26809 finishing at the closing brace. */
26810 location_t finish_loc
26813 finish_loc);
26816 }
26825 else
26826 {
26829 }
26832 tf_warning_or_error);
26833 /* [expr.const]/1: In an integral constant expression "only type
26834 conversions to integral or enumeration type can be used". */
26840 NIC_CONSTRUCTOR))
26843 /* Create a location of the form:
26844 float(i)
26845 ^~~~~~~~
26846 with caret == start at the start of the type name,
26847 finishing at the closing paren. */
26848 location_t finish_loc
26853 }
26855 /* Save the tokens that make up the body of a member function defined
26856 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26857 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26858 specifiers applied to the declaration. Returns the FUNCTION_DECL
26859 for the member function. */
26861 static tree
26865 tree attributes)
26866 {
26869 tree fn;
26872 /* Create the FUNCTION_DECL. */
26876 /* If something went badly wrong, bail out now. */
26878 {
26879 /* If there's a function-body, skip it. */
26884 }
26886 /* Remember it, if there default args to post process. */
26889 /* Save away the tokens that make up the body of the
26890 function. */
26896 RID_TRANSACTION_ATOMIC))
26897 {
26899 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
26906 {
26912 }
26913 else
26916 {
26920 }
26921 }
26923 /* Handle function try blocks. */
26925 {
26928 }
26929 /* We can have braced-init-list mem-initializers before the fn body. */
26931 {
26934 {
26935 /* cache_group will stop after an un-nested { } pair, too. */
26939 /* variadic mem-inits have ... after the ')'. */
26942 }
26943 }
26945 /* Handle function try blocks. */
26951 /* Save away the inline definition; we will process it when the
26952 class is complete. */
26956 /* We need to know that this was defined in the class, so that
26957 friend templates are handled correctly. */
26960 /* Add FN to the queue of functions to be parsed later. */
26964 }
26966 /* Save the tokens that make up the in-class initializer for a non-static
26967 data member. Returns a DEFAULT_ARG. */
26969 static tree
26971 {
26973 }
26975 /* Parse a template-argument-list, as well as the trailing ">" (but
26976 not the opening "<"). See cp_parser_template_argument_list for the
26977 return value. */
26979 static tree
26981 {
26982 tree arguments;
26983 tree saved_scope;
26984 tree saved_qualifying_scope;
26985 tree saved_object_scope;
26990 /* [temp.names]
26992 When parsing a template-id, the first non-nested `>' is taken as
26993 the end of the template-argument-list rather than a greater-than
26994 operator. */
26995 saved_greater_than_is_operator_p
26998 /* Parsing the argument list may modify SCOPE, so we save it
26999 here. */
27003 /* We need to evaluate the template arguments, even though this
27004 template-id may be nested within a "sizeof". */
27009 /* Parse the template-argument-list itself. */
27013 else
27015 /* Look for the `>' that ends the template-argument-list. If we find
27016 a '>>' instead, it's probably just a typo. */
27018 {
27020 {
27021 /* In C++0x, a `>>' in a template argument list or cast
27022 expression is considered to be two separate `>'
27023 tokens. So, change the current token to a `>', but don't
27024 consume it: it will be consumed later when the outer
27025 template argument list (or cast expression) is parsed.
27026 Note that this replacement of `>' for `>>' is necessary
27027 even if we are parsing tentatively: in the tentative
27028 case, after calling
27029 cp_parser_enclosed_template_argument_list we will always
27030 throw away all of the template arguments and the first
27031 closing `>', either because the template argument list
27032 was erroneous or because we are replacing those tokens
27033 with a CPP_TEMPLATE_ID token. The second `>' (which will
27034 not have been thrown away) is needed either to close an
27035 outer template argument list or to complete a new-style
27036 cast. */
27039 }
27041 {
27042 /* If we're in a nested template argument list, the '>>' has
27043 to be a typo for '> >'. We emit the error message, but we
27044 continue parsing and we push a '>' as next token, so that
27045 the argument list will be parsed correctly. Note that the
27046 global source location is still on the token before the
27047 '>>', so we need to say explicitly where we want it. */
27055 }
27056 else
27057 {
27058 /* If this is not a nested template argument list, the '>>'
27059 is a typo for '>'. Emit an error message and continue.
27060 Same deal about the token location, but here we can get it
27061 right by consuming the '>>' before issuing the diagnostic. */
27064 "spurious %<>>%>, use %<>%> to terminate "
27066 }
27067 }
27068 else
27070 /* The `>' token might be a greater-than operator again now. */
27071 parser->greater_than_is_operator_p
27073 /* Restore the SAVED_SCOPE. */
27081 }
27083 /* MEMBER_FUNCTION is a member function, or a friend. If default
27084 arguments, or the body of the function have not yet been parsed,
27085 parse them now. */
27087 static void
27089 {
27091 /* If this member is a template, get the underlying
27092 FUNCTION_DECL. */
27096 /* There should not be any class definitions in progress at this
27097 point; the bodies of members are only parsed outside of all class
27098 definitions. */
27100 /* While we're parsing the member functions we might encounter more
27101 classes. We want to handle them right away, but we don't want
27102 them getting mixed up with functions that are currently in the
27103 queue. */
27106 /* Make sure that any template parameters are in scope. */
27109 /* If the body of the function has not yet been parsed, parse it
27110 now. */
27112 {
27113 tree function_scope;
27116 /* The function is no longer pending; we are processing it. */
27121 /* If this is a local class, enter the scope of the containing
27122 function. */
27127 /* Push the body of the function onto the lexer stack. */
27130 /* Let the front end know that we going to be defining this
27131 function. */
27135 /* Don't do access checking if it is a templated function. */
27139 /* #pragma omp declare reduction needs special parsing. */
27141 {
27146 }
27147 else
27148 /* Now, parse the body of the function. */
27155 /* Leave the scope of the containing function. */
27159 }
27161 /* Remove any template parameters from the symbol table. */
27164 /* Restore the queue. */
27167 }
27169 /* If DECL contains any default args, remember it on the unparsed
27170 functions queue. */
27172 static void
27174 {
27175 tree probe;
27178 probe;
27181 {
27185 }
27186 }
27188 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27189 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27190 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27191 from the parameter-type-list. */
27193 static tree
27196 {
27198 tree parsed_arg;
27204 /* Push the saved tokens for the default argument onto the parser's
27205 lexer stack. */
27211 /* Parse the default argument. */
27222 {
27223 /* In a non-template class, check conversions now. In a template,
27224 we'll wait and instantiate these as needed. */
27227 tf_warning_or_error);
27228 else
27230 }
27232 /* If the token stream has not been completely used up, then
27233 there was extra junk after the end of the default
27234 argument. */
27236 {
27239 else
27241 }
27243 /* Revert to the main lexer. */
27247 }
27249 /* FIELD is a non-static data member with an initializer which we saved for
27250 later; parse it now. */
27252 static void
27254 {
27255 tree def;
27262 NULL_TREE);
27268 }
27270 /* FN is a FUNCTION_DECL which may contains a parameter with an
27271 unparsed DEFAULT_ARG. Parse the default args now. This function
27272 assumes that the current scope is the scope in which the default
27273 argument should be processed. */
27275 static void
27277 {
27281 /* While we're parsing the default args, we might (due to the
27282 statement expression extension) encounter more classes. We want
27283 to handle them right away, but we don't want them getting mixed
27284 up with default args that are currently in the queue. */
27287 /* Local variable names (and the `this' keyword) may not appear
27288 in a default argument. */
27299 {
27301 tree parsed_arg;
27303 tree copy;
27310 /* This can happen for a friend declaration for a function
27311 already declared with default arguments. */
27314 parsed_arg
27316 default_arg,
27319 {
27321 }
27325 /* Update any instantiations we've already created. */
27329 }
27333 /* Make sure no default arg is missing. */
27336 /* Restore the state of local_variables_forbidden_p. */
27339 /* Restore the queue. */
27341 }
27343 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27345 sizeof ... ( identifier )
27347 where the 'sizeof' token has already been consumed. */
27349 static tree
27351 {
27352 /* Consume the `...'. */
27359 else
27367 /* The name is not qualified. */
27386 }
27388 /* Parse the operand of `sizeof' (or a similar operator). Returns
27389 either a TYPE or an expression, depending on the form of the
27390 input. The KEYWORD indicates which kind of expression we have
27391 encountered. */
27393 static tree
27395 {
27402 /* If it's a `...', then we are computing the length of a parameter
27403 pack. */
27408 /* Types cannot be defined in a `sizeof' expression. Save away the
27409 old message. */
27411 /* And create the new one. */
27417 /* The restrictions on constant-expressions do not apply inside
27418 sizeof expressions. */
27419 saved_integral_constant_expression_p
27421 saved_non_integral_constant_expression_p
27425 /* Do not actually evaluate the expression. */
27428 /* If it's a `(', then we might be looking at the type-id
27429 construction. */
27431 {
27434 /* We can't be sure yet whether we're looking at a type-id or an
27435 expression. */
27437 /* Note: as a GNU Extension, compound literals are considered
27438 postfix-expressions as they are in C99, so they are valid
27439 arguments to sizeof. See comment in cp_parser_cast_expression
27440 for details. */
27443 else
27444 {
27447 /* Look for the type-id. */
27449 /* Look for the closing `)'. */
27452 }
27454 /* If all went well, then we're done. */
27456 {
27457 cp_decl_specifier_seq decl_specs;
27459 /* Build a trivial decl-specifier-seq. */
27463 /* Call grokdeclarator to figure out what type this is. */
27466 TYPENAME,
27469 }
27470 }
27472 /* If the type-id production did not work out, then we must be
27473 looking at the unary-expression production. */
27477 /* Go back to evaluating expressions. */
27481 /* Free the message we created. */
27483 /* And restore the old one. */
27485 parser->integral_constant_expression_p
27487 parser->non_integral_constant_expression_p
27491 }
27493 /* If the current declaration has no declarator, return true. */
27495 static bool
27497 {
27498 /* If the next token is a `;' or a `,' then there is no
27499 declarator. */
27502 }
27504 /* Update the DECL_SPECS to reflect the storage class indicated by
27505 KEYWORD. */
27507 static void
27512 {
27513 cp_storage_class storage_class;
27516 {
27520 }
27522 {
27525 }
27530 {
27533 }
27536 {
27554 }
27558 /* A storage class specifier cannot be applied alongside a typedef
27559 specifier. If there is a typedef specifier present then set
27560 conflicting_specifiers_p which will trigger an error later
27561 on in grokdeclarator. */
27564 }
27566 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27567 is true, the type is a class or enum definition. */
27569 static void
27571 tree type_spec,
27574 {
27577 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27578 (with, for example, in "typedef int wchar_t;") we remember that
27579 this is what happened. In system headers, we ignore these
27580 declarations so that G++ can work with system headers that are not
27581 C++-safe. */
27583 && !type_definition_p
27593 {
27596 ds_redefined_builtin_type_spec,
27597 token);
27599 {
27603 }
27604 }
27607 else
27608 {
27613 }
27614 }
27616 /* True iff TOKEN is the GNU keyword __thread. */
27618 static bool
27620 {
27623 }
27625 /* Set the location for a declarator specifier and check if it is
27626 duplicated.
27628 DECL_SPECS is the sequence of declarator specifiers onto which to
27629 set the location.
27631 DS is the single declarator specifier to set which location is to
27632 be set onto the existing sequence of declarators.
27634 LOCATION is the location for the declarator specifier to
27635 consider. */
27637 static void
27640 {
27649 {
27653 }
27654 else
27655 {
27657 {
27661 else
27662 {
27665 OPT_Wlong_long,
27667 }
27668 }
27670 {
27675 else
27677 }
27678 else
27679 {
27695 "__complex"
27696 };
27699 }
27700 }
27701 }
27703 /* Return true iff the declarator specifier DS is present in the
27704 sequence of declarator specifiers DECL_SPECS. */
27706 bool
27708 cp_decl_spec ds)
27709 {
27716 }
27718 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27719 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27721 static bool
27723 {
27725 }
27727 /* Issue an error message indicating that TOKEN_DESC was expected.
27728 If KEYWORD is true, it indicated this function is called by
27729 cp_parser_require_keword and the required token can only be
27730 a indicated keyword. */
27732 static void
27734 required_token token_desc,
27736 {
27738 {
27807 }
27809 {
27811 {
27890 }
27891 }
27892 else
27894 }
27898 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27899 issue an error message indicating that TOKEN_DESC was expected.
27901 Returns the token consumed, if the token had the appropriate type.
27902 Otherwise, returns NULL. */
27907 required_token token_desc)
27908 {
27911 else
27912 {
27913 /* Output the MESSAGE -- unless we're parsing tentatively. */
27917 }
27918 }
27920 /* An error message is produced if the next token is not '>'.
27921 All further tokens are skipped until the desired token is
27922 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27924 static void
27926 {
27927 /* Current level of '< ... >'. */
27929 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27932 /* Are we ready, yet? If not, issue error message. */
27936 /* Skip tokens until the desired token is found. */
27938 {
27939 /* Peek at the next token. */
27941 {
27949 /* C++0x views the `>>' operator as two `>' tokens, but
27950 C++98 does not. */
27953 {
27954 /* We've hit a `>>' where the first `>' closes the
27955 template argument list, and the second `>' is
27956 spurious. Just consume the `>>' and stop; we've
27957 already produced at least one error. */
27960 }
27961 /* Fall through for C++0x, so we handle the second `>' in
27962 the `>>'. */
27967 {
27968 /* We've reached the token we want, consume it and stop. */
27971 }
27990 /* The '>' was probably forgotten, don't look further. */
27995 }
27997 /* Consume this token. */
27999 }
28000 }
28002 /* If the next token is the indicated keyword, consume it. Otherwise,
28003 issue an error message indicating that TOKEN_DESC was expected.
28005 Returns the token consumed, if the token had the appropriate type.
28006 Otherwise, returns NULL. */
28011 required_token token_desc)
28012 {
28016 {
28019 }
28022 }
28024 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28025 function-definition. */
28027 static bool
28029 {
28032 /* A ctor-initializer begins with a `:'. */
28034 /* A function-try-block begins with `try'. */
28036 /* A function-transaction-block begins with `__transaction_atomic'
28037 or `__transaction_relaxed'. */
28040 /* The named return value extension begins with `return'. */
28042 }
28044 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28045 definition. */
28047 static bool
28049 {
28056 }
28058 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28059 C++0x) ending a template-argument. */
28061 static bool
28063 {
28071 }
28073 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28074 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28076 static bool
28079 {
28085 /* Check for the sequence `<::' in the original code. It would be lexed as
28086 `[:', where `[' is a digraph, and there is no whitespace before
28087 `:'. */
28089 {
28094 }
28096 }
28098 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28099 or none_type otherwise. */
28101 static enum tag_types
28103 {
28105 {
28115 }
28116 }
28118 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28119 or none_type otherwise or if the token is null. */
28121 static enum tag_types
28123 {
28128 {
28136 }
28137 }
28139 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28141 static void
28143 {
28147 {
28151 type))
28154 }
28155 }
28157 /* Issue an error message if DECL is redeclared with different
28158 access than its original declaration [class.access.spec/3].
28159 This applies to nested classes, nested class templates and
28160 enumerations [class.mem/1]. */
28162 static void
28164 {
28175 }
28177 /* Look for the `template' keyword, as a syntactic disambiguator.
28178 Return TRUE iff it is present, in which case it will be
28179 consumed. */
28181 static bool
28183 {
28185 {
28186 /* In C++98 the `template' keyword can only be used within templates;
28187 outside templates the parser can always figure out what is a
28188 template and what is not. In C++11, per the resolution of DR 468,
28189 `template' is allowed in cases where it is not strictly necessary. */
28192 {
28195 "in C++98 %<template%> (as a disambiguator) is only "
28197 /* If this part of the token stream is rescanned, the same
28198 error message would be generated. So, we purge the token
28199 from the stream. */
28202 }
28203 else
28204 {
28205 /* Consume the `template' keyword. */
28208 }
28209 }
28211 }
28213 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28214 set PARSER->SCOPE, and perform other related actions. */
28216 static void
28218 {
28221 /* Get the stored value. */
28223 /* Set the scope from the stored value. */
28227 }
28229 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28230 encounter the end of a block before what we were looking for. */
28232 static bool
28236 {
28238 {
28241 /* Abort a parenthesized expression if we encounter a semicolon. */
28245 /* If we've reached the end of the file, stop. */
28251 /* We've hit the end of an enclosing block, so there's been some
28252 kind of syntax error. */
28255 /* Consume the token. */
28257 /* See if it starts a new group. */
28259 {
28261 /* In theory this should probably check end == '}', but
28262 cp_parser_save_member_function_body needs it to exit
28263 after either '}' or ')' when called with ')'. */
28266 }
28268 {
28272 }
28277 }
28278 }
28280 /* Like above, for caching a default argument or NSDMI. Both of these are
28281 terminated by a non-nested comma, but it can be unclear whether or not a
28282 comma is nested in a template argument list unless we do more parsing.
28283 In order to handle this ambiguity, when we encounter a ',' after a '<'
28284 we try to parse what follows as a parameter-declaration-list (in the
28285 case of a default argument) or a member-declarator (in the case of an
28286 NSDMI). If that succeeds, then we stop caching. */
28288 static tree
28290 {
28295 tree default_argument;
28297 /* Add tokens until we have processed the entire default
28298 argument. We add the range [first_token, token). */
28301 {
28302 /* For list-initialization, this is straightforward. */
28305 }
28307 {
28310 /* Peek at the next token. */
28312 /* What we do depends on what token we have. */
28314 {
28315 /* In valid code, a default argument must be
28316 immediately followed by a `,' `)', or `...'. */
28319 {
28320 /* If we've seen a '<', we might be in a
28321 template-argument-list. Until Core issue 325 is
28322 resolved, we don't know how this situation ought
28323 to be handled, so try to DTRT. We check whether
28324 what comes after the comma is a valid parameter
28325 declaration list. If it is, then the comma ends
28326 the default argument; otherwise the default
28327 argument continues. */
28331 /* Set ITALP so cp_parser_parameter_declaration_list
28332 doesn't decide to commit to this parse. */
28339 {
28340 /* Parse declarators until we reach a non-comma or
28341 somthing that cannot be an initializer.
28342 Just checking whether we're looking at a single
28343 declarator is insufficient. Consider:
28344 int var = tuple<T,U>::x;
28345 The template parameter 'U' looks exactly like a
28346 declarator. */
28347 do
28348 {
28359 }
28361 /* If we met an '=' or ';' then the original comma
28362 was the end of the NSDMI. Otherwise assume
28363 we're still in the NSDMI. */
28366 }
28367 else
28368 {
28373 }
28380 }
28381 /* FALLTHRU */
28384 /* If we run into a non-nested `;', `}', or `]',
28385 then the code is invalid -- but the default
28386 argument is certainly over. */
28391 /* Handle correctly int n = sizeof ... ( p ); */
28394 /* Update DEPTH, if necessary. */
28409 /* This might be the comparison operator, or it might
28410 start a template argument list. */
28417 /* Fall through for C++0x, which treats the `>>'
28418 operator like two `>' tokens in certain
28419 cases. */
28424 {
28425 /* This might be an operator, or it might close a
28426 template argument list. But if a previous '<'
28427 started a template argument list, this will have
28428 closed it, so we can't be in one anymore. */
28432 }
28435 /* If we run out of tokens, issue an error message. */
28443 /* In these cases, we should look for template-ids.
28444 For example, if the default argument is
28445 `X<int, double>()', we need to do name lookup to
28446 figure out whether or not `X' is a template; if
28447 so, the `,' does not end the default argument.
28449 That is not yet done. */
28454 }
28456 /* If we've reached the end, stop. */
28460 /* Add the token to the token block. */
28462 }
28464 /* Create a DEFAULT_ARG to represent the unparsed default
28465 argument. */
28472 }
28474 /* Begin parsing tentatively. We always save tokens while parsing
28475 tentatively so that if the tentative parsing fails we can restore the
28476 tokens. */
28478 static void
28480 {
28481 /* Enter a new parsing context. */
28483 /* Begin saving tokens. */
28485 /* In order to avoid repetitive access control error messages,
28486 access checks are queued up until we are no longer parsing
28487 tentatively. */
28489 }
28491 /* Commit to the currently active tentative parse. */
28493 static void
28495 {
28499 /* Mark all of the levels as committed. */
28502 {
28509 }
28510 }
28512 /* Commit to the topmost currently active tentative parse.
28514 Note that this function shouldn't be called when there are
28515 irreversible side-effects while in a tentative state. For
28516 example, we shouldn't create a permanent entry in the symbol
28517 table, or issue an error message that might not apply if the
28518 tentative parse is aborted. */
28520 static void
28522 {
28527 {
28535 }
28536 }
28538 /* Abort the currently active tentative parse. All consumed tokens
28539 will be rolled back, and no diagnostics will be issued. */
28541 static void
28543 {
28547 /* Now, pretend that we want to see if the construct was
28548 successfully parsed. */
28550 }
28552 /* Stop parsing tentatively. If a parse error has occurred, restore the
28553 token stream. Otherwise, commit to the tokens we have consumed.
28554 Returns true if no error occurred; false otherwise. */
28556 static bool
28558 {
28562 /* Remember whether or not an error occurred, since we are about to
28563 destroy that information. */
28565 /* Remove the topmost context from the stack. */
28568 /* If no parse errors occurred, commit to the tentative parse. */
28570 {
28571 /* Commit to the tokens read tentatively, unless that was
28572 already done. */
28577 }
28578 /* Otherwise, if errors occurred, roll back our state so that things
28579 are just as they were before we began the tentative parse. */
28580 else
28581 {
28584 }
28585 /* Add the context to the front of the free list. */
28590 }
28592 /* Returns true if we are parsing tentatively and are not committed to
28593 this tentative parse. */
28595 static bool
28597 {
28600 }
28602 /* Returns nonzero iff an error has occurred during the most recent
28603 tentative parse. */
28605 static bool
28607 {
28610 }
28612 /* Returns nonzero if GNU extensions are allowed. */
28614 static bool
28616 {
28618 }
28619 \f
28620 /* Objective-C++ Productions */
28623 /* Parse an Objective-C expression, which feeds into a primary-expression
28624 above.
28626 objc-expression:
28627 objc-message-expression
28628 objc-string-literal
28629 objc-encode-expression
28630 objc-protocol-expression
28631 objc-selector-expression
28633 Returns a tree representation of the expression. */
28635 static cp_expr
28637 {
28638 /* Try to figure out what kind of declaration is present. */
28642 {
28652 {
28664 }
28670 }
28673 }
28675 /* Parse an Objective-C message expression.
28677 objc-message-expression:
28678 [ objc-message-receiver objc-message-args ]
28680 Returns a representation of an Objective-C message. */
28682 static tree
28684 {
28696 /* Construct a location e.g.
28697 [self func1:5]
28698 ^~~~~~~~~~~~~~
28699 ranging from the '[' to the ']', with the caret at the start. */
28704 }
28706 /* Parse an objc-message-receiver.
28708 objc-message-receiver:
28709 expression
28710 simple-type-specifier
28712 Returns a representation of the type or expression. */
28714 static tree
28716 {
28717 tree rcv;
28719 /* An Objective-C message receiver may be either (1) a type
28720 or (2) an expression. */
28724 /* If that worked out, fine. */
28731 CP_PARSER_FLAGS_NONE);
28738 }
28740 /* Parse the arguments and selectors comprising an Objective-C message.
28742 objc-message-args:
28743 objc-selector
28744 objc-selector-args
28745 objc-selector-args , objc-comma-args
28747 objc-selector-args:
28748 objc-selector [opt] : assignment-expression
28749 objc-selector-args objc-selector [opt] : assignment-expression
28751 objc-comma-args:
28752 assignment-expression
28753 objc-comma-args , assignment-expression
28755 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28756 selector arguments and TREE_VALUE containing a list of comma
28757 arguments. */
28759 static tree
28761 {
28767 {
28773 /* Detect if we have a unary selector. */
28782 sel_args
28787 }
28789 /* Handle non-selector arguments, if any. */
28791 {
28792 tree arg;
28797 addl_args
28802 }
28805 {
28808 }
28811 }
28813 /* Parse an Objective-C encode expression.
28815 objc-encode-expression:
28816 @encode objc-typename
28818 Returns an encoded representation of the type argument. */
28820 static cp_expr
28822 {
28823 tree type;
28834 {
28838 }
28840 /* This happens if we find @encode(T) (where T is a template
28841 typename or something dependent on a template typename) when
28842 parsing a template. In that case, we can't compile it
28843 immediately, but we rather create an AT_ENCODE_EXPR which will
28844 need to be instantiated when the template is used.
28845 */
28847 {
28851 }
28854 /* Build a location of the form:
28855 @encode(int)
28856 ^~~~~~~~~~~~
28857 with caret==start at the @ token, finishing at the close paren. */
28858 location_t combined_loc
28863 }
28865 /* Parse an Objective-C @defs expression. */
28867 static tree
28869 {
28870 tree name;
28878 }
28880 /* Parse an Objective-C protocol expression.
28882 objc-protocol-expression:
28883 @protocol ( identifier )
28885 Returns a representation of the protocol expression. */
28887 static tree
28889 {
28890 tree proto;
28898 /* Build a location of the form:
28899 @protocol(prot)
28900 ^~~~~~~~~~~~~~~
28901 with caret==start at the @ token, finishing at the close paren. */
28902 location_t combined_loc
28908 }
28910 /* Parse an Objective-C selector expression.
28912 objc-selector-expression:
28913 @selector ( objc-method-signature )
28915 objc-method-signature:
28916 objc-selector
28917 objc-selector-seq
28919 objc-selector-seq:
28920 objc-selector :
28921 objc-selector-seq objc-selector :
28923 Returns a representation of the method selector. */
28925 static tree
28927 {
28939 {
28948 {
28949 /* Detect if we have a unary selector. */
28951 {
28954 }
28955 else
28956 {
28958 }
28959 }
28964 {
28965 sel_seq
28968 sel_seq
28971 }
28972 else
28973 sel_seq
28978 }
28980 finish_selector:
28984 /* Build a location of the form:
28985 @selector(func)
28986 ^~~~~~~~~~~~~~~
28987 with caret==start at the @ token, finishing at the close paren. */
28988 location_t combined_loc
28992 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28995 }
28997 /* Parse a list of identifiers.
28999 objc-identifier-list:
29000 identifier
29001 objc-identifier-list , identifier
29003 Returns a TREE_LIST of identifier nodes. */
29005 static tree
29007 {
29008 tree identifier;
29009 tree list;
29020 {
29027 identifier));
29029 }
29032 }
29034 /* Parse an Objective-C alias declaration.
29036 objc-alias-declaration:
29037 @compatibility_alias identifier identifier ;
29039 This function registers the alias mapping with the Objective-C front end.
29040 It returns nothing. */
29042 static void
29044 {
29052 }
29054 /* Parse an Objective-C class forward-declaration.
29056 objc-class-declaration:
29057 @class objc-identifier-list ;
29059 The function registers the forward declarations with the Objective-C
29060 front end. It returns nothing. */
29062 static void
29064 {
29067 {
29068 tree id;
29078 else
29080 }
29082 }
29084 /* Parse a list of Objective-C protocol references.
29086 objc-protocol-refs-opt:
29087 objc-protocol-refs [opt]
29089 objc-protocol-refs:
29090 < objc-identifier-list >
29092 Returns a TREE_LIST of identifiers, if any. */
29094 static tree
29096 {
29100 {
29104 }
29107 }
29109 /* Parse a Objective-C visibility specification. */
29111 static void
29113 {
29117 {
29132 }
29134 /* Eat '@private'/'@protected'/'@public'. */
29136 }
29138 /* Parse an Objective-C method type. Return 'true' if it is a class
29139 (+) method, and 'false' if it is an instance (-) method. */
29143 {
29146 else
29148 }
29150 /* Parse an Objective-C protocol qualifier. */
29152 static tree
29154 {
29167 {
29172 }
29175 }
29177 /* Parse an Objective-C typename. */
29179 static tree
29181 {
29185 {
29191 /* An ObjC type name may consist of just protocol qualifiers, in which
29192 case the type shall default to 'id'. */
29194 {
29197 /* If the type could not be parsed, an error has already
29198 been produced. For error recovery, behave as if it had
29199 not been specified, which will use the default type
29200 'id'. */
29202 {
29204 /* We need to skip to the closing parenthesis as
29205 cp_parser_type_id() does not seem to do it for
29206 us. */
29211 }
29212 }
29216 }
29219 }
29221 /* Check to see if TYPE refers to an Objective-C selector name. */
29223 static bool
29225 {
29231 }
29233 /* Parse an Objective-C selector. */
29235 static tree
29237 {
29241 {
29244 }
29246 /* C++ operator names are allowed to appear in ObjC selectors. */
29248 {
29261 }
29262 }
29264 /* Parse an Objective-C params list. */
29266 static tree
29268 {
29274 {
29284 /* Detect if we have a unary selector. */
29287 {
29290 }
29294 {
29295 /* Something went quite wrong. There should be a colon
29296 here, but there is not. Stop parsing parameters. */
29298 }
29300 /* New ObjC allows attributes on parameters too. */
29305 params
29308 type_name,
29309 identifier,
29310 parm_attr));
29313 }
29316 {
29319 }
29321 /* We allow tail attributes for the method. */
29323 {
29331 }
29334 {
29337 }
29339 }
29341 /* Parse the non-keyword Objective-C params. */
29343 static tree
29346 {
29352 {
29354 tree parm;
29360 {
29365 }
29367 /* TODO: parse attributes for tail parameters. */
29376 }
29378 /* We allow tail attributes for the method. */
29380 {
29382 {
29387 }
29388 else
29389 /* We have an error, but parse the attributes, so that we can
29390 carry on. */
29396 }
29399 }
29401 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29403 static void
29405 {
29408 /* If the next token is `extern' and the following token is a string
29409 literal, then we have a linkage specification. */
29411 && cp_parser_is_pure_string_literal
29414 /* Handle #pragma, if any. */
29417 /* Allow stray semicolons. */
29420 /* Mark methods as optional or required, when building protocols. */
29422 {
29425 }
29427 {
29430 }
29433 /* Other stray characters must generate errors. */
29435 {
29439 }
29440 /* Finally, try to parse a block-declaration, or a function-definition. */
29441 else
29443 }
29445 /* Parse a method signature. */
29447 static tree
29449 {
29465 }
29467 static bool
29469 {
29470 tree tattr;
29475 /* If the attributes are followed by a method introducer, this is not allowed.
29476 Dump the attributes and flag the situation. */
29481 /* Otherwise, the attributes introduce some interstitial code, possibly so
29482 rewind to allow that check. */
29485 }
29487 /* Parse an Objective-C method prototype list. */
29489 static void
29491 {
29495 {
29497 {
29502 else
29506 {
29510 }
29513 }
29519 OPT_Wattributes,
29521 else
29522 /* Allow for interspersed non-ObjC++ code. */
29526 }
29530 else
29534 }
29536 /* Parse an Objective-C method definition list. */
29538 static void
29540 {
29544 {
29545 tree meth;
29548 {
29554 else
29559 {
29563 }
29565 NULL_TREE);
29567 /* For historical reasons, we accept an optional semicolon. */
29574 {
29581 }
29582 }
29583 /* The following case will be removed once @synthesize is
29584 completely implemented. */
29595 else
29596 /* Allow for interspersed non-ObjC++ code. */
29600 }
29604 else
29608 }
29610 /* Parse Objective-C ivars. */
29612 static void
29614 {
29625 {
29626 cp_decl_specifier_seq declspecs;
29628 tree prefix_attributes;
29636 CP_PARSER_FLAGS_OPTIONAL,
29640 /* auto, register, static, extern, mutable. */
29642 {
29645 }
29647 /* thread_local. */
29649 {
29652 }
29654 /* typedef. */
29656 {
29659 }
29664 /* Keep going until we hit the `;' at the end of the
29665 declaration. */
29667 {
29672 /* Check for a (possibly unnamed) bitfield declaration. */
29680 {
29681 /* Get the name of the bitfield. */
29684 sfk_none);
29686 eat_colon:
29688 /* Get the width of the bitfield. */
29689 width
29691 }
29692 else
29693 {
29694 /* Parse the declarator. */
29695 declarator
29701 }
29703 /* Look for attributes that apply to the ivar. */
29705 /* Remember which attributes are prefix attributes and
29706 which are not. */
29708 /* Combine the attributes. */
29712 /* Create the bitfield declaration. */
29714 width,
29715 attributes);
29716 else
29721 /* Add the instance variable. */
29725 /* Reset PREFIX_ATTRIBUTES. */
29734 {
29737 }
29739 }
29743 }
29748 /* Do not consume the RID_AT_END, so it will be read again as terminating
29749 the @interface of @implementation. */
29753 /* For historical reasons, we accept an optional semicolon. */
29756 }
29758 /* Parse an Objective-C protocol declaration. */
29760 static void
29762 {
29768 {
29773 }
29775 /* See if we have a forward declaration or a definition. */
29778 /* Try a forward declaration first. */
29780 {
29782 {
29783 tree id;
29793 else
29795 }
29797 }
29799 /* Ok, we got a full-fledged definition (or at least should). */
29800 else
29801 {
29806 }
29807 }
29809 /* Parse an Objective-C superclass or category. */
29811 static void
29816 {
29822 {
29825 }
29827 {
29830 /* If there is no category name, and this is an @interface, we
29831 have a class extension. */
29833 {
29836 }
29837 else
29841 }
29842 }
29844 /* Parse an Objective-C class interface. */
29846 static void
29848 {
29855 {
29856 /* It's hard to recover because even if valid @interface stuff
29857 is to follow, we can't compile it (or validate it) if we
29858 don't even know which class it refers to. Let's assume this
29859 was a stray '@interface' token in the stream and skip it.
29860 */
29862 }
29867 /* We have either a class or a category on our hands. */
29870 else
29871 {
29873 /* Handle instance variable declarations, if any. */
29876 }
29879 }
29881 /* Parse an Objective-C class implementation. */
29883 static void
29885 {
29892 {
29893 /* It's hard to recover because even if valid @implementation
29894 stuff is to follow, we can't compile it (or validate it) if
29895 we don't even know which class it refers to. Let's assume
29896 this was a stray '@implementation' token in the stream and
29897 skip it.
29898 */
29900 }
29904 /* We have either a class or a category on our hands. */
29907 else
29908 {
29910 /* Handle instance variable declarations, if any. */
29913 }
29916 }
29918 /* Consume the @end token and finish off the implementation. */
29920 static void
29922 {
29925 }
29927 /* Parse an Objective-C declaration. */
29929 static void
29931 {
29932 /* Try to figure out what kind of declaration is present. */
29937 {
29953 }
29956 {
29979 }
29980 }
29982 /* Parse an Objective-C try-catch-finally statement.
29984 objc-try-catch-finally-stmt:
29985 @try compound-statement objc-catch-clause-seq [opt]
29986 objc-finally-clause [opt]
29988 objc-catch-clause-seq:
29989 objc-catch-clause objc-catch-clause-seq [opt]
29991 objc-catch-clause:
29992 @catch ( objc-exception-declaration ) compound-statement
29994 objc-finally-clause:
29995 @finally compound-statement
29997 objc-exception-declaration:
29998 parameter-declaration
29999 '...'
30001 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30003 Returns NULL_TREE.
30005 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30006 for C. Keep them in sync. */
30008 static tree
30010 {
30011 location_t location;
30012 tree stmt;
30017 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30018 node, lest it get absorbed into the surrounding block. */
30024 {
30033 {
30034 /* We have "@catch (...)" (where the '...' are literally
30035 what is in the code). Skip the '...'.
30036 parameter_declaration is set to NULL_TREE, and
30037 objc_being_catch_clauses() knows that that means
30038 '...'. */
30041 }
30042 else
30043 {
30044 /* We have "@catch (NSException *exception)" or something
30045 like that. Parse the parameter declaration. */
30049 else
30054 }
30057 else
30058 {
30059 /* If there was no open parenthesis, we are recovering from
30060 an error, and we are trying to figure out what mistake
30061 the user has made. */
30063 /* If there is an immediate closing parenthesis, the user
30064 probably forgot the opening one (ie, they typed "@catch
30065 NSException *e)". Parse the closing parenthesis and keep
30066 going. */
30070 /* If these is no immediate closing parenthesis, the user
30071 probably doesn't know that parenthesis are required at
30072 all (ie, they typed "@catch NSException *e"). So, just
30073 forget about the closing parenthesis and keep going. */
30074 }
30078 }
30080 {
30083 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30084 node, lest it get absorbed into the surrounding block. */
30088 }
30091 }
30093 /* Parse an Objective-C synchronized statement.
30095 objc-synchronized-stmt:
30096 @synchronized ( expression ) compound-statement
30098 Returns NULL_TREE. */
30100 static tree
30102 {
30103 location_t location;
30114 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30115 node, lest it get absorbed into the surrounding block. */
30120 }
30122 /* Parse an Objective-C throw statement.
30124 objc-throw-stmt:
30125 @throw assignment-expression [opt] ;
30127 Returns a constructed '@throw' statement. */
30129 static tree
30131 {
30143 }
30145 /* Parse an Objective-C statement. */
30147 static tree
30149 {
30150 /* Try to figure out what kind of declaration is present. */
30154 {
30165 }
30168 }
30170 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30171 look ahead to see if an objc keyword follows the attributes. This
30172 is to detect the use of prefix attributes on ObjC @interface and
30173 @protocol. */
30175 static bool
30177 {
30182 {
30185 }
30188 }
30190 /* This routine is a minimal replacement for
30191 c_parser_struct_declaration () used when parsing the list of
30192 types/names or ObjC++ properties. For example, when parsing the
30193 code
30195 @property (readonly) int a, b, c;
30197 this function is responsible for parsing "int a, int b, int c" and
30198 returning the declarations as CHAIN of DECLs.
30200 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30201 similar parsing. */
30202 static tree
30204 {
30206 cp_decl_specifier_seq declspecs;
30208 tree prefix_attributes;
30211 CP_PARSER_FLAGS_NONE,
30218 /* auto, register, static, extern, mutable. */
30220 {
30223 }
30225 /* thread_local. */
30227 {
30230 }
30232 /* typedef. */
30234 {
30237 }
30242 /* Keep going until we hit the `;' at the end of the declaration. */
30244 {
30249 /* Parse the declarator. */
30253 /* Look for attributes that apply to the ivar. */
30255 /* Remember which attributes are prefix attributes and
30256 which are not. */
30258 /* Combine the attributes. */
30268 /* Reset PREFIX_ATTRIBUTES. */
30279 {
30282 }
30283 else
30285 }
30287 }
30289 /* Parse an Objective-C @property declaration. The syntax is:
30291 objc-property-declaration:
30292 '@property' objc-property-attributes[opt] struct-declaration ;
30294 objc-property-attributes:
30295 '(' objc-property-attribute-list ')'
30297 objc-property-attribute-list:
30298 objc-property-attribute
30299 objc-property-attribute-list, objc-property-attribute
30301 objc-property-attribute
30302 'getter' = identifier
30303 'setter' = identifier
30304 'readonly'
30305 'readwrite'
30306 'assign'
30307 'retain'
30308 'copy'
30309 'nonatomic'
30311 For example:
30312 @property NSString *name;
30313 @property (readonly) id object;
30314 @property (retain, nonatomic, getter=getTheName) id name;
30315 @property int a, b, c;
30317 PS: This function is identical to
30318 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30319 static void
30321 {
30322 /* The following variables hold the attributes of the properties as
30323 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30324 seen. When we see an attribute, we set them to 'true' (if they
30325 are boolean properties) or to the identifier (if they have an
30326 argument, ie, for getter and setter). Note that here we only
30327 parse the list of attributes, check the syntax and accumulate the
30328 attributes that we find. objc_add_property_declaration() will
30329 then process the information. */
30339 /* 'properties' is the list of properties that we read. Usually a
30340 single one, but maybe more (eg, in "@property int a, b, c;" there
30341 are three). */
30342 tree properties;
30343 location_t loc;
30349 /* Parse the optional attribute list... */
30351 {
30352 /* Eat the '('. */
30356 {
30362 {
30365 }
30369 {
30380 {
30384 else
30389 }
30392 {
30396 }
30398 {
30400 {
30403 }
30404 else
30408 else
30410 }
30411 else
30412 {
30414 {
30417 }
30418 else
30420 }
30426 }
30433 else
30435 }
30437 /* FIXME: "@property (setter, assign);" will generate a spurious
30438 "error: expected ‘)’ before ‘,’ token". This is because
30439 cp_parser_require, unlike the C counterpart, will produce an
30440 error even if we are in error recovery. */
30442 {
30447 }
30448 }
30450 /* ... and the property declaration(s). */
30454 {
30456 /* If the next token is now a `;', consume it. */
30460 }
30464 else
30465 {
30466 /* Comma-separated properties are chained together in
30467 reverse order; add them one by one. */
30476 }
30479 }
30481 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30483 objc-synthesize-declaration:
30484 @synthesize objc-synthesize-identifier-list ;
30486 objc-synthesize-identifier-list:
30487 objc-synthesize-identifier
30488 objc-synthesize-identifier-list, objc-synthesize-identifier
30490 objc-synthesize-identifier
30491 identifier
30492 identifier = identifier
30494 For example:
30495 @synthesize MyProperty;
30496 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30498 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30499 for C. Keep them in sync.
30500 */
30501 static void
30503 {
30505 location_t loc;
30510 {
30514 {
30517 }
30519 {
30523 {
30526 }
30527 }
30528 else
30533 else
30535 }
30538 }
30540 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30542 objc-dynamic-declaration:
30543 @dynamic identifier-list ;
30545 For example:
30546 @dynamic MyProperty;
30547 @dynamic MyProperty, AnotherProperty;
30549 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30550 for C. Keep them in sync.
30551 */
30552 static void
30554 {
30556 location_t loc;
30561 {
30562 tree property;
30565 {
30568 }
30572 else
30574 }
30577 }
30579 \f
30580 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30582 /* Returns name of the next clause.
30583 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30584 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30585 returned and the token is consumed. */
30587 static pragma_omp_clause
30589 {
30605 {
30610 {
30793 }
30794 }
30800 }
30802 /* Validate that a clause of the given type does not already exist. */
30804 static void
30807 {
30808 tree c;
30812 {
30815 }
30816 }
30818 /* OpenMP 2.5:
30819 variable-list:
30820 identifier
30821 variable-list , identifier
30823 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30824 colon). An opening parenthesis will have been consumed by the caller.
30826 If KIND is nonzero, create the appropriate node and install the decl
30827 in OMP_CLAUSE_DECL and add the node to the head of the list.
30829 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30830 return the list created.
30832 COLON can be NULL if only closing parenthesis should end the list,
30833 or pointer to bool which will receive false if the list is terminated
30834 by closing parenthesis or true if the list is terminated by colon. */
30836 static tree
30839 {
30843 {
30846 }
30848 {
30853 && current_class_ptr
30855 {
30861 }
30862 else
30863 {
30876 }
30878 ;
30880 {
30882 {
30884 /* The OpenACC cache directive explicitly only allows "array
30885 elements or subarrays". */
30887 {
30891 }
30892 /* FALLTHROUGH. */
30897 {
30898 location_t loc
30903 decl
30907 }
30908 /* FALLTHROUGH. */
30912 {
30920 parser->colon_corrects_to_scope_p
30924 else
30925 {
30926 /* Look for `:'. */
30930 CPP_CLOSE_SQUARE))
30932 }
30933 /* Look for the closing `]'. */
30935 RT_CLOSE_SQUARE))
30939 }
30943 }
30949 }
30950 else
30953 get_comma:
30957 }
30963 {
30967 }
30970 {
30973 /* Try to resync to an unnested comma. Copied from
30974 cp_parser_parenthesized_expression_list. */
30975 skip_comma:
30984 }
30987 }
30989 /* Similarly, but expect leading and trailing parenthesis. This is a very
30990 common case for omp clauses. */
30992 static tree
30994 {
30998 }
31000 /* OpenACC 2.0:
31001 copy ( variable-list )
31002 copyin ( variable-list )
31003 copyout ( variable-list )
31004 create ( variable-list )
31005 delete ( variable-list )
31006 present ( variable-list )
31007 present_or_copy ( variable-list )
31008 pcopy ( variable-list )
31009 present_or_copyin ( variable-list )
31010 pcopyin ( variable-list )
31011 present_or_copyout ( variable-list )
31012 pcopyout ( variable-list )
31013 present_or_create ( variable-list )
31014 pcreate ( variable-list ) */
31016 static tree
31018 tree list)
31019 {
31022 {
31068 }
31076 }
31078 /* OpenACC 2.0:
31079 deviceptr ( variable-list ) */
31081 static tree
31083 {
31087 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31088 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31089 variable-list must only allow for pointer variables. */
31092 {
31099 }
31102 }
31104 /* OpenACC 2.0:
31105 auto
31106 independent
31107 nohost
31108 seq */
31110 static tree
31114 {
31119 }
31121 /* OpenACC:
31122 num_gangs ( expression )
31123 num_workers ( expression )
31124 vector_length ( expression ) */
31126 static tree
31129 {
31139 {
31144 }
31152 }
31154 /* OpenACC:
31156 gang [( gang-arg-list )]
31157 worker [( [num:] int-expr )]
31158 vector [( [length:] int-expr )]
31160 where gang-arg is one of:
31162 [num:] int-expr
31163 static: size-expr
31165 and size-expr may be:
31167 *
31168 int-expr
31169 */
31171 static tree
31174 {
31184 {
31187 do
31188 {
31192 /* Gang static argument. */
31195 {
31203 {
31206 }
31208 /* Check for the '*' argument. */
31212 CPP_CLOSE_PAREN)))
31213 {
31218 {
31221 }
31223 }
31224 }
31225 /* Worker num: argument and vector length: arguments. */
31229 {
31232 }
31234 /* Now collect the actual argument. */
31236 {
31239 }
31251 {
31254 }
31256 }
31261 }
31275 cleanup_error:
31278 }
31280 /* OpenACC 2.0:
31281 tile ( size-expr-list ) */
31283 static tree
31285 {
31289 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31290 so, but the spec authors never considered such a case and have
31291 differing opinions on what it might mean, including 'not
31292 allowed'.) */
31295 clause_loc);
31300 do
31301 {
31308 {
31311 }
31312 else
31316 }
31319 /* Consume the trailing ')'. */
31327 }
31329 /* OpenACC 2.0
31330 Parse wait clause or directive parameters. */
31332 static tree
31334 {
31344 {
31349 }
31356 {
31360 {
31363 else
31364 {
31371 }
31372 }
31373 }
31376 }
31378 /* OpenACC:
31379 wait ( int-expr-list ) */
31381 static tree
31383 {
31392 }
31394 /* OpenMP 3.0:
31395 collapse ( constant-expression ) */
31397 static tree
31399 {
31401 location_t loc;
31402 HOST_WIDE_INT n;
31422 {
31425 }
31434 }
31436 /* OpenMP 2.5:
31437 default ( shared | none )
31439 OpenACC 2.0
31440 default (none) */
31442 static tree
31445 {
31447 tree c;
31452 {
31457 {
31472 }
31475 }
31476 else
31477 {
31478 invalid_kind:
31481 else
31483 }
31499 }
31501 /* OpenMP 3.1:
31502 final ( expression ) */
31504 static tree
31506 {
31527 }
31529 /* OpenMP 2.5:
31530 if ( expression )
31532 OpenMP 4.5:
31533 if ( directive-name-modifier : expression )
31535 directive-name-modifier:
31536 parallel | task | taskloop | target data | target | target update
31537 | target enter data | target exit data */
31539 static tree
31542 {
31550 {
31562 {
31565 {
31578 else
31579 {
31580 location_t loc
31585 }
31588 {
31590 {
31595 }
31597 {
31598 location_t loc
31602 }
31603 }
31604 }
31605 }
31607 {
31609 {
31612 }
31613 else
31614 {
31616 {
31617 location_t loc
31620 }
31622 }
31623 }
31624 }
31636 {
31639 {
31642 {
31652 }
31654 p);
31656 }
31658 {
31661 else
31664 }
31667 {
31671 }
31672 }
31680 }
31682 /* OpenMP 3.1:
31683 mergeable */
31685 static tree
31688 {
31689 tree c;
31692 location);
31697 }
31699 /* OpenMP 2.5:
31700 nowait */
31702 static tree
31705 {
31706 tree c;
31713 }
31715 /* OpenMP 2.5:
31716 num_threads ( expression ) */
31718 static tree
31720 location_t location)
31721 {
31743 }
31745 /* OpenMP 4.5:
31746 num_tasks ( expression ) */
31748 static tree
31750 location_t location)
31751 {
31773 }
31775 /* OpenMP 4.5:
31776 grainsize ( expression ) */
31778 static tree
31780 location_t location)
31781 {
31803 }
31805 /* OpenMP 4.5:
31806 priority ( expression ) */
31808 static tree
31810 location_t location)
31811 {
31833 }
31835 /* OpenMP 4.5:
31836 hint ( expression ) */
31838 static tree
31840 location_t location)
31841 {
31862 }
31864 /* OpenMP 4.5:
31865 defaultmap ( tofrom : scalar ) */
31867 static tree
31869 location_t location)
31870 {
31878 {
31881 }
31885 {
31888 }
31894 {
31897 }
31901 {
31904 }
31910 location);
31916 out_err:
31921 }
31923 /* OpenMP 2.5:
31924 ordered
31926 OpenMP 4.5:
31927 ordered ( constant-expression ) */
31929 static tree
31932 {
31934 HOST_WIDE_INT n;
31940 {
31957 {
31959 "ordered argument needs positive constant integer "
31962 }
31963 }
31969 }
31971 /* OpenMP 2.5:
31972 reduction ( reduction-operator : variable-list )
31974 reduction-operator:
31975 One of: + * - & ^ | && ||
31977 OpenMP 3.1:
31979 reduction-operator:
31980 One of: + * - & ^ | && || min max
31982 OpenMP 4.0:
31984 reduction-operator:
31985 One of: + * - & ^ | && ||
31986 id-expression */
31988 static tree
31990 {
31998 {
32008 }
32012 else
32013 {
32024 {
32054 }
32055 else
32056 {
32058 resync_fail:
32063 }
32064 }
32070 NULL);
32072 {
32075 }
32078 }
32080 /* OpenMP 2.5:
32081 schedule ( schedule-kind )
32082 schedule ( schedule-kind , expression )
32084 schedule-kind:
32085 static | dynamic | guided | runtime | auto
32087 OpenMP 4.5:
32088 schedule ( schedule-modifier : schedule-kind )
32089 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32091 schedule-modifier:
32092 simd
32093 monotonic
32094 nonmonotonic */
32096 static tree
32098 {
32108 {
32117 else
32123 else
32124 {
32127 }
32128 }
32131 {
32136 {
32157 }
32158 }
32163 else
32169 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32171 {
32175 }
32178 {
32193 else
32198 }
32210 invalid_kind:
32212 resync_fail:
32217 }
32219 /* OpenMP 3.0:
32220 untied */
32222 static tree
32225 {
32226 tree c;
32233 }
32235 /* OpenMP 4.0:
32236 inbranch
32237 notinbranch */
32239 static tree
32242 {
32247 }
32249 /* OpenMP 4.0:
32250 parallel
32251 for
32252 sections
32253 taskgroup */
32255 static tree
32259 {
32263 }
32265 /* OpenMP 4.5:
32266 nogroup */
32268 static tree
32271 {
32276 }
32278 /* OpenMP 4.5:
32279 simd
32280 threads */
32282 static tree
32286 {
32291 }
32293 /* OpenMP 4.0:
32294 num_teams ( expression ) */
32296 static tree
32298 location_t location)
32299 {
32321 }
32323 /* OpenMP 4.0:
32324 thread_limit ( expression ) */
32326 static tree
32328 location_t location)
32329 {
32351 }
32353 /* OpenMP 4.0:
32354 aligned ( variable-list )
32355 aligned ( variable-list : constant-expression ) */
32357 static tree
32359 {
32370 {
32380 }
32386 }
32388 /* OpenMP 4.0:
32389 linear ( variable-list )
32390 linear ( variable-list : expression )
32392 OpenMP 4.5:
32393 linear ( modifier ( variable-list ) )
32394 linear ( modifier ( variable-list ) : expression ) */
32396 static tree
32399 {
32409 {
32421 else
32423 }
32428 else
32429 {
32438 }
32441 {
32446 {
32457 {
32460 }
32463 }
32468 {
32471 }
32479 }
32482 {
32485 }
32488 }
32490 /* OpenMP 4.0:
32491 safelen ( constant-expression ) */
32493 static tree
32495 location_t location)
32496 {
32517 }
32519 /* OpenMP 4.0:
32520 simdlen ( constant-expression ) */
32522 static tree
32524 location_t location)
32525 {
32546 }
32548 /* OpenMP 4.5:
32549 vec:
32550 identifier [+/- integer]
32551 vec , identifier [+/- integer]
32552 */
32554 static tree
32556 tree list)
32557 {
32561 {
32564 }
32567 {
32574 else
32575 {
32576 t = cp_parser_lookup_name_simple
32581 id_loc);
32582 }
32588 {
32591 }
32595 {
32598 }
32602 {
32605 }
32608 add_to_vector:
32610 {
32614 }
32620 }
32623 {
32629 }
32631 }
32633 /* OpenMP 4.0:
32634 depend ( depend-kind : variable-list )
32636 depend-kind:
32637 in | out | inout
32639 OpenMP 4.5:
32640 depend ( source )
32642 depend ( sink : vec ) */
32644 static tree
32646 {
32654 {
32668 else
32670 }
32671 else
32677 {
32687 }
32694 else
32695 {
32701 }
32704 invalid_kind:
32706 resync_fail:
32711 }
32713 /* OpenMP 4.0:
32714 map ( map-kind : variable-list )
32715 map ( variable-list )
32717 map-kind:
32718 alloc | to | from | tofrom
32720 OpenMP 4.5:
32721 map-kind:
32722 alloc | to | from | tofrom | release | delete
32724 map ( always [,] map-kind: variable-list ) */
32726 static tree
32728 {
32737 {
32742 {
32745 nth++;
32751 {
32756 }
32757 }
32758 }
32762 {
32776 else
32777 {
32783 }
32786 }
32789 {
32793 }
32796 NULL);
32802 }
32804 /* OpenMP 4.0:
32805 device ( expression ) */
32807 static tree
32809 location_t location)
32810 {
32832 }
32834 /* OpenMP 4.0:
32835 dist_schedule ( static )
32836 dist_schedule ( static , expression ) */
32838 static tree
32840 location_t location)
32841 {
32854 {
32865 }
32870 location);
32874 invalid_kind:
32876 resync_fail:
32881 }
32883 /* OpenMP 4.0:
32884 proc_bind ( proc-bind-kind )
32886 proc-bind-kind:
32887 master | close | spread */
32889 static tree
32891 location_t location)
32892 {
32893 tree c;
32900 {
32910 else
32912 }
32913 else
32922 location);
32927 invalid_kind:
32929 resync_fail:
32934 }
32936 /* OpenACC:
32937 async [( int-expr )] */
32939 static tree
32941 {
32948 {
32957 }
32967 }
32969 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32970 is a bitmask in MASK. Return the list of clauses found. */
32972 static tree
32976 {
32981 {
32982 location_t here;
32983 pragma_omp_clause c_kind;
32984 omp_clause_code code;
32995 {
33047 clauses);
33065 OMP_CLAUSE_INDEPENDENT,
33077 clauses);
33083 clauses);
33107 clauses);
33129 clauses);
33141 clauses);
33155 }
33160 {
33161 /* Remove the invalid clause(s) from the list to avoid
33162 confusing the rest of the compiler. */
33165 }
33166 }
33168 saw_error:
33175 }
33177 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33178 is a bitmask in MASK. Return the list of clauses found; the result
33179 of clause default goes in *pdefault. */
33181 static tree
33185 {
33191 {
33192 pragma_omp_clause c_kind;
33203 {
33215 clauses);
33229 clauses);
33249 clauses);
33254 clauses);
33264 clauses);
33298 clauses);
33312 clauses);
33329 OMP_CLAUSE_NOTINBRANCH,
33338 {
33339 clause_not_first:
33343 }
33373 clauses);
33374 else
33384 clauses);
33402 {
33410 }
33453 clauses
33459 clauses
33471 }
33476 {
33477 /* Remove the invalid clause(s) from the list to avoid
33478 confusing the rest of the compiler. */
33481 }
33482 }
33483 saw_error:
33484 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33485 no reason to skip to the end. */
33489 {
33492 else
33494 }
33496 }
33498 /* OpenMP 2.5:
33499 structured-block:
33500 statement
33502 In practice, we're also interested in adding the statement to an
33503 outer node. So it is convenient if we work around the fact that
33504 cp_parser_statement calls add_stmt. */
33506 static unsigned
33508 {
33511 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33512 This preserves the "not within loop or switch" style error messages
33513 for nonsense cases like
33514 void foo() {
33515 #pragma omp single
33516 break;
33517 }
33518 */
33523 }
33525 static void
33527 {
33529 }
33531 static tree
33533 {
33541 }
33543 /* OpenMP 2.5:
33544 # pragma omp atomic new-line
33545 expression-stmt
33547 expression-stmt:
33548 x binop= expr | x++ | ++x | x-- | --x
33549 binop:
33550 +, *, -, /, &, ^, |, <<, >>
33552 where x is an lvalue expression with scalar type.
33554 OpenMP 3.1:
33555 # pragma omp atomic new-line
33556 update-stmt
33558 # pragma omp atomic read new-line
33559 read-stmt
33561 # pragma omp atomic write new-line
33562 write-stmt
33564 # pragma omp atomic update new-line
33565 update-stmt
33567 # pragma omp atomic capture new-line
33568 capture-stmt
33570 # pragma omp atomic capture new-line
33571 capture-block
33573 read-stmt:
33574 v = x
33575 write-stmt:
33576 x = expr
33577 update-stmt:
33578 expression-stmt | x = x binop expr
33579 capture-stmt:
33580 v = expression-stmt
33581 capture-block:
33582 { v = x; update-stmt; } | { update-stmt; v = x; }
33584 OpenMP 4.0:
33585 update-stmt:
33586 expression-stmt | x = x binop expr | x = expr binop x
33587 capture-stmt:
33588 v = update-stmt
33589 capture-block:
33590 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33592 where x and v are lvalue expressions with scalar type. */
33594 static void
33596 {
33604 {
33609 {
33615 }
33616 }
33618 {
33630 else
33634 }
33636 {
33642 {
33647 {
33650 }
33651 }
33652 }
33656 {
33666 else
33671 {
33672 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33673 opcode. */
33678 }
33682 {
33685 }
33686 else
33687 {
33693 }
33696 }
33698 restart:
33702 {
33709 /* FALLTHROUGH */
33719 /* FALLTHROUGH */
33734 /* Undo effects of boolean_increment for post {in,de}crement. */
33736 /* FALLTHRU */
33740 {
33741 /* Undo effects of boolean_increment. */
33743 {
33744 /* This is pre or post increment. */
33749 && !structured_block
33753 }
33754 }
33755 /* FALLTHRU */
33758 {
33793 {
33797 }
33800 {
33806 {
33811 }
33813 {
33825 {
33827 {
33832 }
33833 else
33835 }
33839 }
33842 {
33849 }
33853 }
33857 {
33860 {
33868 }
33870 {
33875 }
33910 }
33921 /* FALLTHROUGH */
33926 }
33933 }
33934 stmt_done:
33936 {
33947 }
33949 {
33952 }
33953 done:
33959 saw_error:
33962 {
33966 {
33970 }
33971 }
33972 }
33975 /* OpenMP 2.5:
33976 # pragma omp barrier new-line */
33978 static void
33980 {
33983 }
33985 /* OpenMP 2.5:
33986 # pragma omp critical [(name)] new-line
33987 structured-block
33989 OpenMP 4.5:
33990 # pragma omp critical [(name) [hint(expression)]] new-line
33991 structured-block */
33993 #define OMP_CRITICAL_CLAUSE_MASK \
33994 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33996 static tree
33998 {
34002 {
34016 OMP_CRITICAL_CLAUSE_MASK,
34018 }
34019 else
34024 }
34026 /* OpenMP 2.5:
34027 # pragma omp flush flush-vars[opt] new-line
34029 flush-vars:
34030 ( variable-list ) */
34032 static void
34034 {
34040 }
34042 /* Helper function, to parse omp for increment expression. */
34044 static tree
34046 {
34051 {
34054 }
34057 {
34066 /* Fall through: OpenMP disallows NE_EXPR. */
34070 }
34072 /* If decl is an iterator, preserve LHS and RHS of the relational
34073 expr until finish_omp_for. */
34084 }
34086 /* Helper function, to parse omp for increment expression. */
34088 static tree
34090 {
34094 cp_id_kind idk;
34098 {
34107 }
34116 {
34121 }
34128 {
34132 }
34145 do
34146 {
34153 {
34155 {
34158 else
34160 tf_warning_or_error);
34161 }
34162 else
34165 }
34166 }
34170 {
34176 }
34177 else
34181 }
34183 /* Parse the initialization statement of either an OpenMP for loop or
34184 a Cilk Plus for loop.
34186 Return true if the resulting construct should have an
34187 OMP_CLAUSE_PRIVATE added to it. */
34189 static tree
34198 {
34204 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34206 init-expr:
34207 var = lb
34208 integer-type var = lb
34209 random-access-iterator-type var = lb
34210 pointer-type var = lb
34211 */
34212 cp_decl_specifier_seq type_specifiers;
34214 /* First, try to parse as an initialized declaration. See
34215 cp_parser_condition, from whence the bulk of this is copied. */
34222 {
34223 /* If parsing a type specifier seq succeeded, then this
34224 MUST be a initialized declaration. */
34229 CP_PARSER_DECLARATOR_NAMED,
34240 else
34241 {
34251 {
34253 CPP_OPEN_PAREN))
34254 {
34258 else
34261 }
34262 else
34263 /* Trigger an error. */
34268 }
34272 {
34280 {
34283 auto_node);
34288 }
34291 asm_specification,
34292 LOOKUP_ONLYCONVERTING);
34295 {
34298 }
34299 else
34300 {
34303 {
34305 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34307 {
34311 {
34315 }
34317 }
34319 {
34324 }
34325 }
34326 }
34328 }
34329 else
34330 {
34331 /* Consume '='. */
34335 non_class:
34338 else
34341 asm_specification,
34342 LOOKUP_ONLYCONVERTING);
34343 }
34347 }
34348 }
34349 else
34350 {
34351 cp_id_kind idk;
34352 /* If parsing a type specifier sequence failed, then
34353 this MUST be a simple expression. */
34362 && decl
34365 {
34376 {
34381 }
34386 }
34388 && decl
34391 {
34392 tree rhs;
34400 rhs,
34401 tf_warning_or_error));
34404 }
34405 else
34406 {
34411 {
34415 }
34416 }
34417 }
34419 }
34421 /* Parse the restricted form of the for statement allowed by OpenMP. */
34423 static tree
34426 {
34430 location_t loc_first;
34441 {
34444 }
34447 {
34450 }
34453 {
34459 }
34461 {
34464 {
34466 "%<linear%> clause may not be specified together "
34469 }
34470 else
34472 }
34485 {
34488 location_t loc;
34492 {
34496 }
34499 {
34503 }
34512 add_private_clause
34519 {
34522 {
34528 }
34529 else
34531 }
34538 {
34543 {
34547 }
34550 {
34551 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34555 {
34558 }
34559 else
34560 {
34563 }
34565 }
34566 else
34567 {
34572 }
34573 }
34576 {
34577 tree c;
34579 {
34588 decl);
34592 decl);
34593 }
34595 {
34600 else
34605 {
34608 /* For linear, signal that we need to fill up
34609 the so far unknown linear step. */
34612 }
34613 }
34614 }
34623 {
34624 /* If decl is an iterator, preserve the operator on decl
34625 until finish_omp_for. */
34627 && ((processing_template_decl
34632 else
34636 }
34648 {
34651 }
34656 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34657 in between the collapsed for loops to be still considered perfectly
34658 nested. Hopefully the final version clarifies this.
34659 For now handle (multiple) {'s and empty statements. */
34662 {
34666 {
34668 bracecount++;
34669 }
34673 else
34674 {
34681 }
34682 }
34685 {
34688 }
34689 }
34694 /* Note that we saved the original contents of this flag when we entered
34695 the structured block, and so we don't need to re-save it here. */
34698 else
34701 /* Note that the grammar doesn't call for a structured block here,
34702 though the loop as a whole is a structured block. */
34709 else
34714 {
34716 {
34718 nbraces--;
34719 }
34722 else
34723 {
34725 {
34728 }
34733 }
34734 }
34737 {
34741 else
34743 }
34747 }
34749 /* Helper function for OpenMP parsing, split clauses and call
34750 finish_omp_clauses on each of the set of clauses afterwards. */
34752 static void
34755 {
34761 }
34763 /* OpenMP 4.0:
34764 #pragma omp simd simd-clause[optseq] new-line
34765 for-loop */
34767 #define OMP_SIMD_CLAUSE_MASK \
34768 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34777 static tree
34781 {
34792 {
34796 OMP_CLAUSE_ORDERED);
34798 {
34800 "%<ordered%> clause with parameter may not be specified "
34803 }
34804 }
34815 }
34817 /* OpenMP 2.5:
34818 #pragma omp for for-clause[optseq] new-line
34819 for-loop
34821 OpenMP 4.0:
34822 #pragma omp for simd for-simd-clause[optseq] new-line
34823 for-loop */
34825 #define OMP_FOR_CLAUSE_MASK \
34826 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34836 static tree
34840 {
34847 /* parallel for{, simd} disallows nowait clause, but for
34848 target {teams distribute ,}parallel for{, simd} it should be accepted. */
34851 /* Composite distribute parallel for{, simd} disallows ordered clause. */
34856 {
34861 {
34885 }
34886 }
34888 {
34891 }
34893 /* Composite distribute parallel for disallows linear clause. */
34900 {
34903 }
34914 }
34916 /* OpenMP 2.5:
34917 # pragma omp master new-line
34918 structured-block */
34920 static tree
34922 {
34926 }
34928 /* OpenMP 2.5:
34929 # pragma omp ordered new-line
34930 structured-block
34932 OpenMP 4.5:
34933 # pragma omp ordered ordered-clauses new-line
34934 structured-block */
34936 #define OMP_ORDERED_CLAUSE_MASK \
34937 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34938 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34940 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34941 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34943 static bool
34946 {
34950 {
34955 {
34957 {
34959 "%<depend%> clause may only be used in compound "
34963 }
34964 tree clauses
34966 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34970 }
34971 }
34973 tree clauses
34979 }
34981 /* OpenMP 2.5:
34983 section-scope:
34984 { section-sequence }
34986 section-sequence:
34987 section-directive[opt] structured-block
34988 section-sequence section-directive structured-block */
34990 static tree
34992 {
35004 {
35008 }
35011 {
35019 {
35023 }
35025 {
35028 }
35033 }
35044 }
35046 /* OpenMP 2.5:
35047 # pragma omp sections sections-clause[optseq] newline
35048 sections-scope */
35050 #define OMP_SECTIONS_CLAUSE_MASK \
35051 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35057 static tree
35060 {
35072 {
35075 }
35082 }
35084 /* OpenMP 2.5:
35085 # pragma omp parallel parallel-clause[optseq] new-line
35086 structured-block
35087 # pragma omp parallel for parallel-for-clause[optseq] new-line
35088 structured-block
35089 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35090 structured-block
35092 OpenMP 4.0:
35093 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35094 structured-block */
35096 #define OMP_PARALLEL_CLAUSE_MASK \
35097 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35099 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35100 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35103 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35104 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35105 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35107 static tree
35111 {
35118 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35124 {
35132 if_p);
35136 if_p);
35139 block);
35144 }
35145 /* When combined with distribute, parallel has to be followed by for.
35146 #pragma omp target parallel is allowed though. */
35150 {
35154 }
35156 {
35159 }
35161 {
35165 {
35175 block);
35178 }
35179 }
35184 {
35187 }
35195 }
35197 /* OpenMP 2.5:
35198 # pragma omp single single-clause[optseq] new-line
35199 structured-block */
35201 #define OMP_SINGLE_CLAUSE_MASK \
35202 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35203 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35204 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35205 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35207 static tree
35209 {
35219 }
35221 /* OpenMP 3.0:
35222 # pragma omp task task-clause[optseq] new-line
35223 structured-block */
35225 #define OMP_TASK_CLAUSE_MASK \
35226 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35233 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35234 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35235 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35237 static tree
35239 {
35250 }
35252 /* OpenMP 3.0:
35253 # pragma omp taskwait new-line */
35255 static void
35257 {
35260 }
35262 /* OpenMP 3.1:
35263 # pragma omp taskyield new-line */
35265 static void
35267 {
35270 }
35272 /* OpenMP 4.0:
35273 # pragma omp taskgroup new-line
35274 structured-block */
35276 static tree
35278 {
35282 if_p));
35283 }
35286 /* OpenMP 2.5:
35287 # pragma omp threadprivate (variable-list) */
35289 static void
35291 {
35292 tree vars;
35298 }
35300 /* OpenMP 4.0:
35301 # pragma omp cancel cancel-clause[optseq] new-line */
35303 #define OMP_CANCEL_CLAUSE_MASK \
35304 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35306 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35307 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35310 static void
35312 {
35316 }
35318 /* OpenMP 4.0:
35319 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35321 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35322 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35327 static void
35330 {
35331 tree clauses;
35335 {
35340 {
35343 }
35344 }
35346 {
35350 }
35353 {
35356 "%<#pragma omp cancellation point%> may only be used in"
35358 else
35362 }
35365 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35367 pragma_tok);
35369 }
35371 /* OpenMP 4.0:
35372 #pragma omp distribute distribute-clause[optseq] new-line
35373 for-loop */
35375 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35376 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35379 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35380 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35382 static tree
35386 {
35395 {
35403 else
35406 {
35412 {
35416 else
35419 }
35425 else
35439 }
35440 }
35442 {
35445 }
35450 {
35453 }
35464 }
35466 /* OpenMP 4.0:
35467 # pragma omp teams teams-clause[optseq] new-line
35468 structured-block */
35470 #define OMP_TEAMS_CLAUSE_MASK \
35471 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35479 static tree
35483 {
35492 {
35496 {
35520 }
35521 }
35523 {
35526 }
35531 {
35534 }
35542 }
35544 /* OpenMP 4.0:
35545 # pragma omp target data target-data-clause[optseq] new-line
35546 structured-block */
35548 #define OMP_TARGET_DATA_CLAUSE_MASK \
35549 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35554 static tree
35556 {
35557 tree clauses
35562 {
35565 {
35582 "%<#pragma omp target data%> with map-type other "
35583 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35587 }
35589 }
35592 {
35595 "%<#pragma omp target data%> must contain at least "
35598 }
35609 }
35611 /* OpenMP 4.5:
35612 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35613 structured-block */
35615 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35616 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35617 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35618 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35619 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35620 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35622 static tree
35625 {
35628 {
35633 {
35636 }
35637 }
35639 {
35643 }
35646 {
35648 "%<#pragma omp target enter data%> may only be "
35652 }
35654 tree clauses
35659 {
35662 {
35675 "%<#pragma omp target enter data%> with map-type other "
35679 }
35681 }
35684 {
35687 "%<#pragma omp target enter data%> must contain at least "
35690 }
35697 }
35699 /* OpenMP 4.5:
35700 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35701 structured-block */
35703 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35704 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35705 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35710 static tree
35713 {
35716 {
35721 {
35724 }
35725 }
35727 {
35731 }
35734 {
35736 "%<#pragma omp target exit data%> may only be "
35740 }
35742 tree clauses
35747 {
35750 {
35764 "%<#pragma omp target exit data%> with map-type other "
35765 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35769 }
35771 }
35774 {
35777 "%<#pragma omp target exit data%> must contain at least "
35780 }
35787 }
35789 /* OpenMP 4.0:
35790 # pragma omp target update target-update-clause[optseq] new-line */
35792 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35793 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35800 static bool
35803 {
35805 {
35807 "%<#pragma omp target update%> may only be "
35811 }
35813 tree clauses
35818 {
35820 "%<#pragma omp target update%> must contain at least one "
35823 }
35831 }
35833 /* OpenMP 4.0:
35834 # pragma omp target target-clause[optseq] new-line
35835 structured-block */
35837 #define OMP_TARGET_CLAUSE_MASK \
35838 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
35846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
35848 static bool
35851 {
35855 {
35867 {
35875 {
35876 tree stmt;
35878 {
35881 OMP_TARGET_CLAUSE_MASK,
35886 OMP_TARGET_CLAUSE_MASK,
35891 OMP_TARGET_CLAUSE_MASK,
35896 }
35898 }
35903 {
35907 if_p);
35912 if_p);
35917 if_p);
35921 }
35927 {
35928 /* For combined target teams, ensure the num_teams and
35929 thread_limit clause expressions are evaluated on the host,
35930 before entering the target construct. */
35931 tree c;
35937 {
35946 OMP_CLAUSE_FIRSTPRIVATE);
35951 }
35952 }
35961 }
35963 {
35966 }
35968 {
35972 }
35974 {
35978 }
35980 {
35984 }
35986 {
35989 }
35990 }
35992 {
35995 }
36010 check_clauses:
36012 {
36015 {
36029 "%<#pragma omp target%> with map-type other "
36030 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36034 }
36036 }
36038 }
36040 /* OpenACC 2.0:
36041 # pragma acc cache (variable-list) new-line
36042 */
36044 static tree
36046 {
36061 }
36063 /* OpenACC 2.0:
36064 # pragma acc data oacc-data-clause[optseq] new-line
36065 structured-block */
36067 #define OACC_DATA_CLAUSE_MASK \
36068 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36080 static tree
36082 {
36095 }
36097 /* OpenACC 2.0:
36098 # pragma acc host_data <clauses> new-line
36099 structured-block */
36101 #define OACC_HOST_DATA_CLAUSE_MASK \
36102 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36104 static tree
36106 {
36119 }
36121 /* OpenACC 2.0:
36122 # pragma acc declare oacc-data-clause[optseq] new-line
36123 */
36125 #define OACC_DECLARE_CLAUSE_MASK \
36126 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36139 static tree
36141 {
36150 {
36154 }
36157 {
36161 {
36165 }
36168 {
36180 {
36182 "%qD must be a global variable in "
36184 decl);
36187 }
36192 {
36196 }
36198 {
36200 "invalid use of %<extern%> variable %qD "
36204 }
36206 {
36208 "invalid use of %<global%> variable %qD "
36212 }
36214 }
36219 {
36224 }
36227 {
36228 tree id;
36232 else
36238 {
36241 {
36244 {
36248 }
36249 }
36250 }
36251 }
36252 }
36265 }
36267 /* OpenACC 2.0:
36268 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36270 or
36272 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36274 LOC is the location of the #pragma token.
36275 */
36277 #define OACC_ENTER_DATA_CLAUSE_MASK \
36278 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36286 #define OACC_EXIT_DATA_CLAUSE_MASK \
36287 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36293 static tree
36296 {
36305 {
36311 }
36318 else
36323 {
36327 }
36335 }
36337 /* OpenACC 2.0:
36338 # pragma acc loop oacc-loop-clause[optseq] new-line
36339 structured-block */
36341 #define OACC_LOOP_CLAUSE_MASK \
36342 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36350 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36353 static tree
36356 {
36365 {
36371 }
36380 }
36382 /* OpenACC 2.0:
36383 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36384 structured-block
36386 or
36388 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36389 structured-block
36390 */
36392 #define OACC_KERNELS_CLAUSE_MASK \
36393 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36400 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36408 #define OACC_PARALLEL_CLAUSE_MASK \
36409 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36422 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36423 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36430 static tree
36433 {
36434 omp_clause_mask mask;
36437 {
36450 }
36453 {
36457 {
36460 tree clauses;
36462 if_p);
36464 }
36465 }
36474 }
36476 /* OpenACC 2.0:
36477 # pragma acc update oacc-update-clause[optseq] new-line
36478 */
36480 #define OACC_UPDATE_CLAUSE_MASK \
36481 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36485 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36488 static tree
36490 {
36497 {
36499 "%<#pragma acc update%> must contain at least one "
36502 }
36510 }
36512 /* OpenACC 2.0:
36513 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36515 LOC is the location of the #pragma token.
36516 */
36518 #define OACC_WAIT_CLAUSE_MASK \
36519 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36521 static tree
36523 {
36537 }
36539 /* OpenMP 4.0:
36540 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36542 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36543 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36546 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36547 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36548 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36550 static void
36553 {
36555 cp_omp_declare_simd_data data;
36557 {
36562 /* It is safe to take the address of a local variable; it will only be
36563 used while this scope is live. */
36565 }
36567 /* Store away all pragma tokens. */
36579 {
36583 {
36596 }
36601 "%<#pragma omp declare simd%> not immediately followed by "
36605 }
36606 }
36608 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36609 This function is modelled similar to the late parsing of omp declare
36610 simd. */
36612 static tree
36614 {
36621 {
36623 "used in the same function marked as a Cilk Plus SIMD-enabled "
36629 }
36631 {
36635 }
36640 {
36647 NULL);
36661 }
36667 }
36669 /* Finalize #pragma omp declare simd clauses after direct declarator has
36670 been parsed, and put that into "omp declare simd" attribute. */
36672 static tree
36674 {
36680 {
36684 }
36689 {
36707 }
36711 }
36714 /* OpenMP 4.0:
36715 # pragma omp declare target new-line
36716 declarations and definitions
36717 # pragma omp end declare target new-line
36719 OpenMP 4.5:
36720 # pragma omp declare target ( extended-list ) new-line
36722 # pragma omp declare target declare-target-clauses[seq] new-line */
36724 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36725 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36728 static void
36730 {
36733 clauses
36737 {
36739 clauses);
36742 }
36743 else
36744 {
36748 }
36751 "%<#pragma omp declare target%> with clauses in between "
36752 "%<#pragma omp declare target%> without clauses and "
36755 {
36761 {
36764 }
36765 else
36768 {
36770 "%qD specified both in declare target %<link%> and %<to%>"
36773 }
36775 {
36782 {
36785 {
36789 }
36790 }
36791 }
36792 }
36793 }
36795 static void
36797 {
36800 {
36803 }
36805 {
36809 {
36812 }
36815 else
36816 {
36820 }
36821 }
36822 else
36823 {
36827 }
36831 "%<#pragma omp end declare target%> without corresponding "
36833 else
36835 }
36837 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
36838 expression and optional initializer clause of
36839 #pragma omp declare reduction. We store the expression(s) as
36840 either 3, 6 or 7 special statements inside of the artificial function's
36841 body. The first two statements are DECL_EXPRs for the artificial
36842 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
36843 expression that uses those variables.
36844 If there was any INITIALIZER clause, this is followed by further statements,
36845 the fourth and fifth statements are DECL_EXPRs for the artificial
36846 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
36847 constructor variant (first token after open paren is not omp_priv),
36848 then the sixth statement is a statement with the function call expression
36849 that uses the OMP_PRIV and optionally OMP_ORIG variable.
36850 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
36851 to initialize the OMP_PRIV artificial variable and there is seventh
36852 statement, a DECL_EXPR of the OMP_PRIV statement again. */
36854 static bool
36856 {
36868 tree combiner;
36883 {
36886 }
36889 {
36896 {
36899 }
36915 {
36919 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
36923 == CPP_CLOSE_PAREN
36926 {
36930 }
36935 }
36936 else
36937 {
36953 {
36958 }
36960 tree arg;
36973 }
36984 }
36990 }
36992 /* OpenMP 4.0
36993 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36994 initializer-clause[opt] new-line
36996 initializer-clause:
36997 initializer (omp_priv initializer)
36998 initializer (function-name (argument-list)) */
37000 static void
37003 {
37013 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37020 {
37052 }
37064 /* Types may not be defined in declare reduction type list. */
37067 parser->type_definition_forbidden_message
37073 saved_colon_doesnt_start_class_def_p
37078 {
37082 ;
37103 else
37108 else
37110 }
37112 /* Restore the saved message. */
37115 parser->colon_doesnt_start_class_def_p
37120 {
37121 fail:
37124 }
37130 {
37131 tree fntype
37134 NULL_TREE);
37154 {
37159 }
37161 {
37163 {
37172 }
37179 }
37180 else
37181 {
37184 }
37187 else
37190 {
37193 }
37195 {
37198 else
37203 }
37208 else
37209 {
37218 }
37225 }
37229 done:
37230 /* Free any declarators allocated. */
37232 }
37234 /* OpenMP 4.0
37235 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37236 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37237 initializer-clause[opt] new-line
37238 #pragma omp declare target new-line */
37240 static void
37243 {
37245 {
37250 {
37253 context);
37255 }
37258 {
37261 context);
37263 }
37265 {
37268 }
37270 {
37274 }
37275 }
37279 }
37281 /* OpenMP 4.5:
37282 #pragma omp taskloop taskloop-clause[optseq] new-line
37283 for-loop
37285 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37286 for-loop */
37288 #define OMP_TASKLOOP_CLAUSE_MASK \
37289 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37304 static tree
37308 {
37317 {
37322 {
37346 }
37347 }
37349 {
37352 }
37357 {
37360 }
37366 if_p);
37372 }
37375 /* OpenACC 2.0:
37376 # pragma acc routine oacc-routine-clause[optseq] new-line
37377 function-definition
37379 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37380 */
37382 #define OACC_ROUTINE_CLAUSE_MASK \
37383 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37389 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37390 component, which must resolve to a declared namespace-scope
37391 function. The clauses are either processed directly (for a named
37392 function), or defered until the immediatley following declaration
37393 is parsed. */
37395 static void
37398 {
37400 /* The checking for "another pragma following this one" in the "no optional
37401 '( name )'" case makes sure that we dont re-enter. */
37404 cp_oacc_routine_data data;
37410 /* It is safe to take the address of a local variable; it will only be
37411 used while this scope is live. */
37414 /* Look for optional '( name )'. */
37416 {
37419 /* We parse the name as an id-expression. If it resolves to
37420 anything other than a non-overloaded function at namespace
37421 scope, it's an error. */
37435 {
37439 }
37441 data.clauses
37449 {
37454 }
37456 /* Perhaps we should use the same rule as declarations in different
37457 namespaces? */
37459 {
37464 }
37467 {
37471 }
37475 }
37477 {
37478 /* Store away all pragma tokens. */
37489 /* Emit a helpful diagnostic if there's another pragma following this
37490 one. */
37492 {
37495 /* ..., and then just keep going. */
37497 }
37499 /* We only have to consider the pragma_external case here. */
37504 else
37507 }
37508 }
37510 /* Finalize #pragma acc routine clauses after direct declarator has
37511 been parsed. */
37513 static tree
37515 {
37520 {
37522 "%<#pragma acc routine%> not immediately followed by "
37525 }
37542 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37543 fndecl_seen. */
37546 }
37548 /* Apply any saved OpenACC routine clauses to a just-parsed
37549 declaration. */
37551 static void
37553 {
37555 {
37556 /* Keep going if we're in error reporting mode. */
37562 {
37564 "%<#pragma acc routine%> not immediately followed by"
37568 }
37570 {
37573 }
37576 {
37581 }
37584 {
37590 }
37592 /* Process the routine's dimension clauses. */
37596 /* Add an "omp declare target" attribute. */
37601 /* Don't unset parser->oacc_routine here: we may still need it to
37602 diagnose wrong usage. But, remember that we've used this "#pragma acc
37603 routine". */
37605 }
37606 }
37608 /* Main entry point to OpenMP statement pragmas. */
37610 static void
37612 {
37613 tree stmt;
37618 {
37641 if_p);
37646 if_p);
37663 if_p);
37668 if_p);
37676 if_p);
37685 if_p);
37699 if_p);
37704 if_p);
37708 }
37711 }
37712 \f
37713 /* Transactional Memory parsing routines. */
37715 /* Parse a transaction attribute.
37717 txn-attribute:
37718 attribute
37719 [ [ identifier ] ]
37721 We use this instead of cp_parser_attributes_opt for transactions to avoid
37722 the pedwarn in C++98 mode. */
37724 static tree
37726 {
37741 {
37745 /* For keywords, use the canonical spelling,
37746 not the parsed identifier. */
37750 }
37751 else
37755 error1:
37758 }
37760 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37762 transaction-statement:
37763 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37764 compound-statement
37765 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37766 */
37768 static tree
37770 {
37781 else
37782 {
37786 }
37788 /* Parse a noexcept specification. */
37792 {
37793 /* cancel-and-throw is unimplemented. */
37796 }
37797 else
37800 /* Keep track if we're in the lexical scope of an outer transaction. */
37812 }
37814 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37816 transaction-expression:
37817 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37818 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37819 */
37821 static tree
37823 {
37836 keyword == RID_TRANSACTION_RELAXED
37850 /* Set this early. This might mean that we allow transaction_cancel in
37851 an expression that we find out later actually has to be a constexpr.
37852 However, we expect that cxx_constant_value will be able to deal with
37853 this; also, if the noexcept has no constexpr, then what we parse next
37854 really is a transaction's body. */
37857 /* Parse a noexcept specification. */
37863 {
37870 }
37871 else
37872 {
37873 /* The only expression that is available got parsed for the noexcept
37874 already. noexcept is true then. */
37877 }
37886 }
37888 /* Parse a function-transaction-block.
37890 function-transaction-block:
37891 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37892 function-body
37893 __transaction_atomic txn-attribute[opt] function-try-block
37894 __transaction_relaxed ctor-initializer[opt] function-body
37895 __transaction_relaxed function-try-block
37896 */
37898 static bool
37900 {
37916 else
37917 {
37921 }
37929 else
37930 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37938 }
37940 /* Parse a __transaction_cancel statement.
37942 cancel-statement:
37943 __transaction_cancel txn-attribute[opt] ;
37944 __transaction_cancel txn-attribute[opt] throw-expression ;
37946 ??? Cancel and throw is not yet implemented. */
37948 static tree
37950 {
37956 RT_TRANSACTION_CANCEL);
37963 /* ??? Parse cancel-and-throw here. */
37968 {
37972 }
37974 {
37978 }
37980 {
37983 {
37989 }
37990 }
37992 {
37996 }
38002 }
38003 \f
38004 /* The parser. */
38008 \f
38009 /* Special handling for the first token or line in the file. The first
38010 thing in the file might be #pragma GCC pch_preprocess, which loads a
38011 PCH file, which is a GC collection point. So we need to handle this
38012 first pragma without benefit of an existing lexer structure.
38014 Always returns one token to the caller in *FIRST_TOKEN. This is
38015 either the true first token of the file, or the first token after
38016 the initial pragma. */
38018 static void
38020 {
38029 {
38036 }
38037 else
38040 /* Skip to the end of the pragma. */
38044 /* Now actually load the PCH file. */
38048 /* Read one more token to return to our caller. We have to do this
38049 after reading the PCH file in, since its pointers have to be
38050 live. */
38052 }
38054 /* Parses the grainsize pragma for the _Cilk_for statement.
38055 Syntax:
38056 #pragma cilk grainsize = <VALUE>. */
38058 static void
38060 {
38062 {
38067 {
38070 }
38072 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38075 else
38077 "%<#pragma cilk grainsize%> is not followed by "
38080 }
38082 }
38084 /* Normal parsing of a pragma token. Here we can (and must) use the
38085 regular lexer. */
38087 static bool
38089 {
38092 tree stmt;
38103 {
38111 {
38121 }
38126 {
38136 }
38141 {
38147 "%<#pragma omp taskwait%> may only be "
38152 }
38157 {
38163 "%<#pragma omp taskyield%> may only be "
38168 }
38173 {
38179 "%<#pragma omp cancel%> may only be "
38184 }
38205 {
38209 }
38217 {
38221 }
38229 {
38233 }
38239 {
38243 }
38251 {
38255 }
38310 "%<#pragma omp section%> may only be used in "
38315 {
38317 {
38321 }
38328 {
38331 }
38334 }
38338 {
38342 }
38350 {
38354 }
38356 /* Ignore the pragma if Cilk Plus is not enabled. */
38358 {
38361 }
38362 else
38363 {
38367 }
38374 bad_stmt:
38377 }
38381 }
38383 /* The interface the pragma parsers have to the lexer. */
38385 enum cpp_ttype
38387 {
38399 else
38400 {
38404 }
38407 }
38409 \f
38410 /* External interface. */
38412 /* Parse one entire translation unit. */
38414 void
38416 {
38429 }
38431 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38432 vectorlength clause:
38433 Syntax:
38434 vectorlength ( constant-expression ) */
38436 static tree
38439 {
38441 tree expr;
38442 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38443 safelen clause. Thus, vectorlength is represented as OMP 4.0
38444 safelen. For SIMD-enabled function it is represented by OMP 4.0
38445 simdlen. */
38448 loc);
38449 else
38451 loc);
38459 /* If expr == error_mark_node, then don't emit any errors nor
38460 create a clause. if any of the above functions returns
38461 error mark node then they would have emitted an error message. */
38463 ;
38471 else
38472 {
38473 tree c;
38475 {
38480 }
38481 else
38482 {
38487 }
38488 }
38493 }
38495 /* Handles the Cilk Plus #pragma simd linear clause.
38496 Syntax:
38497 linear ( simd-linear-variable-list )
38499 simd-linear-variable-list:
38500 simd-linear-variable
38501 simd-linear-variable-list , simd-linear-variable
38503 simd-linear-variable:
38504 id-expression
38505 id-expression : simd-linear-step
38507 simd-linear-step:
38508 conditional-expression */
38510 static tree
38512 {
38518 {
38522 }
38527 {
38530 {
38534 }
38541 {
38545 }
38546 else
38547 {
38551 /* If present, parse the linear step. Otherwise, assume the default
38552 value of 1. */
38554 {
38561 {
38562 /* If an error has occurred, then the whole pragma is
38563 considered ill-formed. Thus, no reason to keep
38564 parsing. */
38567 }
38575 else
38577 "step size must be an integer constant "
38579 }
38581 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38587 }
38592 else
38593 {
38598 }
38599 }
38603 }
38605 /* Returns the name of the next clause. If the clause is not
38606 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38607 token is not consumed. Otherwise, the appropriate enum from the
38608 pragma_simd_clause is returned and the token is consumed. */
38610 static pragma_omp_clause
38612 {
38613 pragma_omp_clause clause_type;
38630 else
38635 }
38637 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38639 static tree
38641 {
38646 {
38647 pragma_omp_clause c_kind;
38654 /* Use the OpenMP 4.0 equivalent function. */
38657 /* Use the OpenMP 4.0 equivalent function. */
38659 clauses);
38661 /* Use the OMP 4.0 equivalent function. */
38663 clauses);
38665 /* Use the OMP 4.0 equivalent function. */
38667 else
38668 {
38672 }
38673 }
38679 else
38681 }
38683 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38685 static void
38687 {
38694 {
38698 }
38707 }
38709 /* Main entry-point for parsing Cilk Plus _Cilk_for
38710 loops. The return value is error_mark_node
38711 when errors happen and CILK_FOR tree on success. */
38713 static tree
38715 {
38730 else
38736 }
38738 /* Create an identifier for a generic parameter type (a synthesized
38739 template parameter implied by `auto' or a concept identifier). */
38742 static tree
38744 {
38748 }
38750 /* Predicate that behaves as is_auto_or_concept but matches the parent
38751 node of the generic type rather than the generic type itself. This
38752 allows for type transformation in add_implicit_template_parms. */
38756 {
38758 }
38760 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38761 (creating a new template parameter list if necessary). Returns the newly
38762 created template type parm. */
38764 static tree
38766 {
38769 /* Before committing to modifying any scope, if we're in an
38770 implicit template scope, and we're trying to synthesize a
38771 constrained parameter, try to find a previous parameter with
38772 the same name. This is the same-type rule for abbreviated
38773 function templates.
38775 NOTE: We can generate implicit parameters when tentatively
38776 parsing a nested name specifier, only to reject that parse
38777 later. However, matching the same template-id as part of a
38778 direct-declarator should generate an identical template
38779 parameter, so this rule will merge them. */
38781 {
38784 {
38786 {
38789 /* Return the TEMPLATE_PARM_INDEX. */
38792 }
38794 }
38795 }
38797 /* We are either continuing a function template that already contains implicit
38798 template parameters, creating a new fully-implicit function template, or
38799 extending an existing explicit function template with implicit template
38800 parameters. */
38808 {
38812 }
38813 else
38814 {
38815 /* Roll back to the existing template parameter scope (in the case of
38816 extending an explicit function template) or introduce a new template
38817 parameter scope ahead of the function parameter scope (or class scope
38818 in the case of out-of-line member definitions). The function scope is
38819 added back after template parameter synthesis below. */
38824 {
38827 }
38829 {
38830 /* If not defining a class, then any class scope is a scope level in
38831 an out-of-line member definition. In this case simply wind back
38832 beyond the first such scope to inject the template parameter list.
38833 Otherwise wind back to the class being defined. The latter can
38834 occur in class member friend declarations such as:
38836 class A {
38837 void foo (auto);
38838 };
38839 class B {
38840 friend void A::foo (auto);
38841 };
38843 The template parameter list synthesized for the friend declaration
38844 must be injected in the scope of 'B'. This can also occur in
38845 erroneous cases such as:
38847 struct A {
38848 struct B {
38849 void foo (auto);
38850 };
38851 void B::foo (auto) {}
38852 };
38854 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38855 but, nevertheless, the template parameter list synthesized for the
38856 declarator should be injected into the scope of 'A' as if the
38857 ill-formed template was specified explicitly. */
38860 {
38863 }
38864 }
38870 {
38871 /* Introduce a new template parameter list for implicit template
38872 parameters. */
38876 parser->implicit_template_scope
38883 }
38884 else
38885 {
38886 /* Synthesize implicit template parameters at the end of the explicit
38887 template parameter list. */
38894 parser->implicit_template_parms
38896 }
38897 }
38899 /* Synthesize a new template parameter and track the current template
38900 parameter chain with implicit_template_parms. */
38904 tree synth_tmpl_parm;
38908 synth_tmpl_parm
38911 synth_tmpl_parm
38913 else
38914 {
38918 }
38920 // Attach the constraint to the parm before processing.
38923 tree new_parm
38925 input_location,
38926 node,
38930 // Chain the new parameter to the list of implicit parameters.
38932 parser->implicit_template_parms
38934 else
38939 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38942 /* If creating a fully implicit function template, start the new implicit
38943 template parameter list with this synthesized type, otherwise grow the
38944 current template parameter list. */
38947 {
38954 }
38955 else
38956 {
38961 }
38963 // If the new parameter was constrained, we need to add that to the
38964 // constraints in the template parameter list.
38966 {
38970 }
38975 }
38977 /* Finish the declaration of a fully implicit function template. Such a
38978 template has no explicit template parameter list so has not been through the
38979 normal template head and tail processing. synthesize_implicit_template_parm
38980 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38981 provided if the declaration is a class member such that its template
38982 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38983 form is returned. Otherwise NULL_TREE is returned. */
38985 static tree
38987 {
38992 {
38996 }
39006 }