| blob | 060962db625328e4d068eb83a232768f39afd3b4 |
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 */
5817 }
5820 }
5821 /* Fall through. */
5828 }
5829 }
5831 /* Parse an (optional) nested-name-specifier.
5833 nested-name-specifier: [C++98]
5834 class-or-namespace-name :: nested-name-specifier [opt]
5835 class-or-namespace-name :: template nested-name-specifier [opt]
5837 nested-name-specifier: [C++0x]
5838 type-name ::
5839 namespace-name ::
5840 nested-name-specifier identifier ::
5841 nested-name-specifier template [opt] simple-template-id ::
5843 PARSER->SCOPE should be set appropriately before this function is
5844 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5845 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5846 in name lookups.
5848 Sets PARSER->SCOPE to the class (TYPE) or namespace
5849 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5850 it unchanged if there is no nested-name-specifier. Returns the new
5851 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5853 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5854 part of a declaration and/or decl-specifier. */
5856 static tree
5862 {
5867 /* Remember where the nested-name-specifier starts. */
5869 {
5872 }
5875 {
5876 tree new_scope;
5877 tree old_scope;
5878 tree saved_qualifying_scope;
5881 /* Spot cases that cannot be the beginning of a
5882 nested-name-specifier. */
5885 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5886 the already parsed nested-name-specifier. */
5888 {
5889 /* Grab the nested-name-specifier and continue the loop. */
5891 /* If we originally encountered this nested-name-specifier
5892 with IS_DECLARATION set to false, we will not have
5893 resolved TYPENAME_TYPEs, so we must do so here. */
5896 {
5901 }
5904 }
5906 /* Spot cases that cannot be the beginning of a
5907 nested-name-specifier. On the second and subsequent times
5908 through the loop, we look for the `template' keyword. */
5910 ;
5911 /* A template-id can start a nested-name-specifier. */
5913 ;
5914 /* DR 743: decltype can be used in a nested-name-specifier. */
5916 ;
5917 else
5918 {
5919 /* If the next token is not an identifier, then it is
5920 definitely not a type-name or namespace-name. */
5923 /* If the following token is neither a `<' (to begin a
5924 template-id), nor a `::', then we are not looking at a
5925 nested-name-specifier. */
5931 {
5935 }
5938 && !cp_parser_nth_token_starts_template_argument_list_p
5941 }
5943 /* The nested-name-specifier is optional, so we parse
5944 tentatively. */
5947 /* Look for the optional `template' keyword, if this isn't the
5948 first time through the loop. */
5951 else
5954 /* Save the old scope since the name lookup we are about to do
5955 might destroy it. */
5958 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5959 look up names in "X<T>::I" in order to determine that "Y" is
5960 a template. So, if we have a typename at this point, we make
5961 an effort to look through it. */
5963 && !typename_keyword_p
5968 /* Parse the qualifying entity. */
5969 new_scope
5971 typename_keyword_p,
5972 template_keyword_p,
5973 check_dependency_p,
5974 type_p,
5975 is_declaration);
5976 /* Look for the `::' token. */
5979 /* If we found what we wanted, we keep going; otherwise, we're
5980 done. */
5982 {
5985 /* Restore the OLD_SCOPE since it was valid before the
5986 failed attempt at finding the last
5987 class-or-namespace-name. */
5991 /* If the next token is a decltype, and the one after that is a
5992 `::', then the decltype has failed to resolve to a class or
5993 enumeration type. Give this error even when parsing
5994 tentatively since it can't possibly be valid--and we're going
5995 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5996 won't get another chance.*/
6000 {
6007 /* As below. */
6010 }
6014 {
6015 /* If we have a non-type template-id followed by ::, it can't
6016 possibly be valid. */
6021 {
6024 {
6030 }
6031 else
6032 {
6033 /* Variable template. */
6038 }
6045 /* As below. */
6049 }
6050 }
6054 /* If the next token is an identifier, and the one after
6055 that is a `::', then any valid interpretation would have
6056 found a class-or-namespace-name. */
6062 {
6065 {
6067 {
6068 tree decl;
6069 tree ambiguous_decls;
6072 none_type,
6081 decl);
6083 {
6084 // cp_parser_lookup_name has the same diagnostic,
6085 // thus make sure to emit it at most once.
6088 {
6093 }
6095 }
6096 else
6097 {
6099 cp_parser_name_lookup_error
6102 else
6103 cp_parser_name_lookup_error
6106 }
6107 }
6110 /* Treat this as a successful nested-name-specifier
6111 due to:
6113 [basic.lookup.qual]
6115 If the name found is not a class-name (clause
6116 _class_) or namespace-name (_namespace.def_), the
6117 program is ill-formed. */
6119 }
6121 }
6123 }
6124 /* We've found one valid nested-name-specifier. */
6126 /* Name lookup always gives us a DECL. */
6129 /* Uses of "template" must be followed by actual templates. */
6141 new_scope);
6142 /* If it is a class scope, try to complete it; we are about to
6143 be looking up names inside the class. */
6145 /* Since checking types for dependency can be expensive,
6146 avoid doing it if the type is already complete. */
6148 /* Do not try to complete dependent types. */
6150 {
6152 /* If it is a typedef to current class, use the current
6153 class instead, as the typedef won't have any names inside
6154 it yet. */
6158 }
6159 /* Make sure we look in the right scope the next time through
6160 the loop. */
6162 }
6164 /* If parsing tentatively, replace the sequence of tokens that makes
6165 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6166 token. That way, should we re-parse the token stream, we will
6167 not have to repeat the effort required to do the parse, nor will
6168 we issue duplicate error messages. */
6170 {
6174 /* Reset the contents of the START token. */
6176 /* Retrieve any deferred checks. Do not pop this access checks yet
6177 so the memory will not be reclaimed during token replacing below. */
6185 /* Purge all subsequent tokens. */
6187 }
6193 }
6195 /* Parse a nested-name-specifier. See
6196 cp_parser_nested_name_specifier_opt for details. This function
6197 behaves identically, except that it will an issue an error if no
6198 nested-name-specifier is present. */
6200 static tree
6206 {
6207 tree scope;
6209 /* Look for the nested-name-specifier. */
6211 typename_keyword_p,
6212 check_dependency_p,
6213 type_p,
6214 is_declaration);
6215 /* If it was not present, issue an error message. */
6217 {
6220 }
6223 }
6225 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6226 this is either a class-name or a namespace-name (which corresponds
6227 to the class-or-namespace-name production in the grammar). For
6228 C++0x, it can also be a type-name that refers to an enumeration
6229 type or a simple-template-id.
6231 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6232 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6233 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6234 TYPE_P is TRUE iff the next name should be taken as a class-name,
6235 even the same name is declared to be another entity in the same
6236 scope.
6238 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6239 specified by the class-or-namespace-name. If neither is found the
6240 ERROR_MARK_NODE is returned. */
6242 static tree
6249 {
6250 tree saved_scope;
6251 tree saved_qualifying_scope;
6252 tree saved_object_scope;
6253 tree scope;
6257 /* DR 743: decltype can appear in a nested-name-specifier. */
6259 {
6263 {
6266 }
6270 }
6272 /* Before we try to parse the class-name, we must save away the
6273 current PARSER->SCOPE since cp_parser_class_name will destroy
6274 it. */
6278 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6279 there is no need to look for a namespace-name. */
6280 only_class_p = template_keyword_p
6285 typename_keyword_p,
6286 template_keyword_p,
6288 check_dependency_p,
6290 is_declaration,
6293 /* If that didn't work, try for a namespace-name. */
6295 {
6296 /* Restore the saved scope. */
6300 /* If we are not looking at an identifier followed by the scope
6301 resolution operator, then this is not part of a
6302 nested-name-specifier. (Note that this function is only used
6303 to parse the components of a nested-name-specifier.) */
6308 }
6311 }
6313 /* Return true if we are looking at a compound-literal, false otherwise. */
6315 static bool
6317 {
6318 /* Consume the `('. */
6323 /* Skip tokens until the next token is a closing parenthesis.
6324 If we find the closing `)', and the next token is a `{', then
6325 we are looking at a compound-literal. */
6326 bool compound_literal_p
6331 /* Roll back the tokens we skipped. */
6335 }
6337 /* Parse a postfix-expression.
6339 postfix-expression:
6340 primary-expression
6341 postfix-expression [ expression ]
6342 postfix-expression ( expression-list [opt] )
6343 simple-type-specifier ( expression-list [opt] )
6344 typename :: [opt] nested-name-specifier identifier
6345 ( expression-list [opt] )
6346 typename :: [opt] nested-name-specifier template [opt] template-id
6347 ( expression-list [opt] )
6348 postfix-expression . template [opt] id-expression
6349 postfix-expression -> template [opt] id-expression
6350 postfix-expression . pseudo-destructor-name
6351 postfix-expression -> pseudo-destructor-name
6352 postfix-expression ++
6353 postfix-expression --
6354 dynamic_cast < type-id > ( expression )
6355 static_cast < type-id > ( expression )
6356 reinterpret_cast < type-id > ( expression )
6357 const_cast < type-id > ( expression )
6358 typeid ( expression )
6359 typeid ( type-id )
6361 GNU Extension:
6363 postfix-expression:
6364 ( type-id ) { initializer-list , [opt] }
6366 This extension is a GNU version of the C99 compound-literal
6367 construct. (The C99 grammar uses `type-name' instead of `type-id',
6368 but they are essentially the same concept.)
6370 If ADDRESS_P is true, the postfix expression is the operand of the
6371 `&' operator. CAST_P is true if this expression is the target of a
6372 cast.
6374 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6375 class member access expressions [expr.ref].
6377 Returns a representation of the expression. */
6379 static cp_expr
6383 {
6385 location_t loc;
6392 /* Peek at the next token. */
6397 /* Some of the productions are determined by keywords. */
6400 {
6405 {
6406 tree type;
6407 cp_expr expression;
6411 /* All of these can be handled in the same way from the point
6412 of view of parsing. Begin by consuming the token
6413 identifying the cast. */
6416 /* New types cannot be defined in the cast. */
6418 parser->type_definition_forbidden_message
6421 /* Look for the opening `<'. */
6423 /* Parse the type to which we are casting. */
6428 /* Look for the closing `>'. */
6430 /* Restore the old message. */
6433 bool saved_greater_than_is_operator_p
6437 /* And the expression which is being cast. */
6441 RT_CLOSE_PAREN);
6445 parser->greater_than_is_operator_p
6448 /* Only type conversions to integral or enumeration types
6449 can be used in constant-expressions. */
6452 {
6455 }
6458 {
6460 postfix_expression
6464 postfix_expression
6468 postfix_expression
6470 tf_warning_or_error);
6473 postfix_expression
6478 }
6480 /* Construct a location e.g. :
6481 reinterpret_cast <int *> (expr)
6482 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6483 ranging from the start of the "*_cast" token to the final closing
6484 paren, with the caret at the start. */
6487 }
6491 {
6492 tree type;
6496 /* Consume the `typeid' token. */
6498 /* Look for the `(' token. */
6500 /* Types cannot be defined in a `typeid' expression. */
6502 parser->type_definition_forbidden_message
6504 /* We can't be sure yet whether we're looking at a type-id or an
6505 expression. */
6507 /* Try a type-id first. */
6512 /* Look for the `)' token. Otherwise, we can't be sure that
6513 we're not looking at an expression: consider `typeid (int
6514 (3))', for example. */
6516 /* If all went well, simply lookup the type-id. */
6519 /* Otherwise, fall back to the expression variant. */
6520 else
6521 {
6522 tree expression;
6524 /* Look for an expression. */
6526 /* Compute its typeid. */
6528 /* Look for the `)' token. */
6530 }
6531 /* Restore the saved message. */
6533 /* `typeid' may not appear in an integral constant expression. */
6536 }
6540 {
6541 tree type;
6542 /* The syntax permitted here is the same permitted for an
6543 elaborated-type-specifier. */
6550 }
6554 {
6555 location_t cilk_spawn_loc
6560 {
6565 }
6567 {
6572 }
6573 else
6574 {
6575 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6578 }
6580 postfix_expression =
6584 {
6588 }
6590 {
6595 }
6596 else
6597 {
6600 postfix_expression);
6601 /* Build a location of the form:
6602 _Cilk_spawn expr
6603 ~~~~~~~~~~~~^~~~
6604 with caret at the expr, ranging from the start of the
6605 _Cilk_spawn token to the end of the expression. */
6606 location_t combined_loc =
6612 }
6614 }
6619 {
6622 tree p;
6629 {
6632 }
6638 {
6641 postfix_expression
6643 else
6644 {
6648 }
6654 tf_warning_or_error);
6655 else
6656 {
6660 }
6665 postfix_expression
6669 postfix_expression
6672 else
6673 {
6677 }
6682 }
6684 }
6687 {
6688 tree type;
6690 /* If the next thing is a simple-type-specifier, we may be
6691 looking at a functional cast. We could also be looking at
6692 an id-expression. So, we try the functional cast, and if
6693 that doesn't work we fall back to the primary-expression. */
6695 /* Look for the simple-type-specifier. */
6699 CP_PARSER_FLAGS_NONE);
6701 /* Parse the cast itself. */
6703 postfix_expression
6705 /* If that worked, we're done. */
6709 /* If the functional-cast didn't work out, try a
6710 compound-literal. */
6713 {
6718 /* Avoid calling cp_parser_type_id pointlessly, see comment
6719 in cp_parser_cast_expression about c++/29234. */
6722 else
6723 {
6724 /* Parse the type. */
6729 /* Look for the `)'. */
6731 }
6733 /* If things aren't going well, there's no need to
6734 keep going. */
6736 {
6738 /* Parse the brace-enclosed initializer list. */
6741 }
6742 /* If that worked, we're definitely looking at a
6743 compound-literal expression. */
6745 {
6746 /* Warn the user that a compound literal is not
6747 allowed in standard C++. */
6750 /* For simplicity, we disallow compound literals in
6751 constant-expressions. We could
6752 allow compound literals of integer type, whose
6753 initializer was a constant, in constant
6754 expressions. Permitting that usage, as a further
6755 extension, would not change the meaning of any
6756 currently accepted programs. (Of course, as
6757 compound literals are not part of ISO C++, the
6758 standard has nothing to say.) */
6760 NIC_NCC))
6761 {
6764 }
6765 /* Form the representation of the compound-literal. */
6766 postfix_expression
6768 tf_warning_or_error);
6771 }
6772 }
6774 /* It must be a primary-expression. */
6775 postfix_expression
6778 decltype_p,
6780 }
6782 }
6784 /* Note that we don't need to worry about calling build_cplus_new on a
6785 class-valued CALL_EXPR in decltype when it isn't the end of the
6786 postfix-expression; unary_complex_lvalue will take care of that for
6787 all these cases. */
6789 /* Keep looping until the postfix-expression is complete. */
6791 {
6795 /* It is not a Koenig lookup function call. */
6796 postfix_expression
6799 /* Peek at the next token. */
6803 {
6806 {
6808 "two consecutive %<[%> shall "
6811 }
6812 postfix_expression
6814 postfix_expression,
6816 decltype_p);
6825 /* postfix-expression ( expression-list [opt] ) */
6826 {
6837 is_builtin_constant_p
6840 {
6841 /* The whole point of __builtin_constant_p is to allow
6842 non-constant expressions to appear as arguments. */
6843 saved_integral_constant_expression_p
6845 saved_non_integral_constant_expression_p
6848 }
6849 args = (cp_parser_parenthesized_expression_list
6855 {
6856 parser->integral_constant_expression_p
6858 parser->non_integral_constant_expression_p
6860 }
6863 {
6866 }
6868 /* Function calls are not permitted in
6869 constant-expressions. */
6872 NIC_FUNC_CALL))
6873 {
6877 }
6882 {
6884 {
6886 {
6889 postfix_expression
6891 complain);
6892 }
6893 else
6894 postfix_expression
6896 }
6897 /* We do not perform argument-dependent lookup if
6898 normal lookup finds a non-function, in accordance
6899 with the expected resolution of DR 218. */
6902 {
6906 /* Do not do argument dependent lookup if regular
6907 lookup finds a member function or a block-scope
6908 function declaration. [basic.lookup.argdep]/3 */
6911 {
6914 postfix_expression
6916 complain);
6917 }
6918 }
6919 }
6925 {
6934 }
6938 {
6940 tree arg;
6948 {
6953 }
6957 }
6960 {
6970 {
6972 postfix_expression
6976 }
6979 {
6980 postfix_expression
6981 = (build_new_method_call
6987 complain));
6988 }
6989 else
6990 postfix_expression
6994 complain);
6995 }
6999 postfix_expression = (build_offset_ref_call_from_tree
7001 complain));
7003 /* A call to a static class member, or a namespace-scope
7004 function. */
7005 postfix_expression
7008 koenig_p,
7009 complain);
7010 else
7011 /* All other function calls. */
7012 postfix_expression
7015 koenig_p,
7016 complain);
7019 {
7021 start_loc,
7022 close_paren_loc);
7024 }
7026 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7030 }
7035 /* postfix-expression . template [opt] id-expression
7036 postfix-expression . pseudo-destructor-name
7037 postfix-expression -> template [opt] id-expression
7038 postfix-expression -> pseudo-destructor-name */
7040 /* Consume the `.' or `->' operator. */
7043 postfix_expression
7045 postfix_expression,
7052 /* postfix-expression ++ */
7053 /* Consume the `++' token. */
7055 /* Generate a representation for the complete expression. */
7056 postfix_expression
7058 POSTINCREMENT_EXPR);
7059 /* Increments may not appear in constant-expressions. */
7067 /* postfix-expression -- */
7068 /* Consume the `--' token. */
7070 /* Generate a representation for the complete expression. */
7071 postfix_expression
7073 POSTDECREMENT_EXPR);
7074 /* Decrements may not appear in constant-expressions. */
7085 return is_member_access
7086 ? postfix_expression
7088 else
7090 }
7091 }
7093 /* We should never get here. */
7096 }
7098 /* This function parses Cilk Plus array notations. If a normal array expr. is
7099 parsed then the array index is passed back to the caller through *INIT_INDEX
7100 and the function returns a NULL_TREE. If array notation expr. is parsed,
7101 then *INIT_INDEX is ignored by the caller and the function returns
7102 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7103 error_mark_node. */
7105 static tree
7107 tree array_value)
7108 {
7112 {
7115 }
7124 {
7127 }
7129 {
7130 /* Consume the ':'. */
7133 /* If we are here, then we have a case like this A[:]. */
7135 {
7139 }
7143 }
7144 else
7145 {
7146 /* If we are here, then there are three valid possibilities:
7147 1. ARRAY [ EXP ]
7148 2. ARRAY [ EXP : EXP ]
7149 3. ARRAY [ EXP : EXP : EXP ] */
7153 {
7154 /* This indicates that we have a normal array expression. */
7157 }
7159 /* Consume the ':'. */
7163 {
7166 }
7167 }
7172 {
7176 }
7182 }
7184 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7185 by cp_parser_builtin_offsetof. We're looking for
7187 postfix-expression [ expression ]
7188 postfix-expression [ braced-init-list ] (C++11)
7190 FOR_OFFSETOF is set if we're being called in that context, which
7191 changes how we deal with integer constant expressions. */
7193 static tree
7195 tree postfix_expression,
7198 {
7203 /* Consume the `[' token. */
7209 /* Parse the index expression. */
7210 /* ??? For offsetof, there is a question of what to allow here. If
7211 offsetof is not being used in an integral constant expression context,
7212 then we *could* get the right answer by computing the value at runtime.
7213 If we are in an integral constant expression context, then we might
7214 could accept any constant expression; hard to say without analysis.
7215 Rather than open the barn door too wide right away, allow only integer
7216 constant expressions here. */
7219 else
7220 {
7222 {
7229 {
7231 "braced list index is not allowed with array "
7235 }
7236 }
7238 {
7239 /* Here are have these two options:
7240 ARRAY[EXP : EXP] - Array notation expr with default
7241 stride of 1.
7242 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7243 stride. */
7245 postfix_expression);
7248 }
7249 else
7251 }
7255 /* Look for the closing `]'. */
7258 /* Build the ARRAY_REF. */
7262 /* When not doing offsetof, array references are not permitted in
7263 constant-expressions. */
7269 }
7271 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7272 by cp_parser_builtin_offsetof. We're looking for
7274 postfix-expression . template [opt] id-expression
7275 postfix-expression . pseudo-destructor-name
7276 postfix-expression -> template [opt] id-expression
7277 postfix-expression -> pseudo-destructor-name
7279 FOR_OFFSETOF is set if we're being called in that context. That sorta
7280 limits what of the above we'll actually accept, but nevermind.
7281 TOKEN_TYPE is the "." or "->" token, which will already have been
7282 removed from the stream. */
7284 static tree
7287 cp_expr postfix_expression,
7289 location_t location)
7290 {
7291 tree name;
7297 /* If this is a `->' operator, dereference the pointer. */
7300 tf_warning_or_error);
7301 /* Check to see whether or not the expression is type-dependent and
7302 not the current instantiation. */
7304 /* The identifier following the `->' or `.' is not qualified. */
7310 /* Enter the scope corresponding to the type of the object
7311 given by the POSTFIX_EXPRESSION. */
7313 {
7315 /* According to the standard, no expression should ever have
7316 reference type. Unfortunately, we do not currently match
7317 the standard in this respect in that our internal representation
7318 of an expression may have reference type even when the standard
7319 says it does not. Therefore, we have to manually obtain the
7320 underlying type here. */
7322 /* The type of the POSTFIX_EXPRESSION must be complete. */
7323 /* Unlike the object expression in other contexts, *this is not
7324 required to be of complete type for purposes of class member
7325 access (5.2.5) outside the member function body. */
7328 && !(processing_template_decl
7329 && current_class_type
7330 && (same_type_ignoring_top_level_qualifiers_p
7332 {
7335 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7337 {
7338 /* In a template, be permissive by treating an object expression
7339 of incomplete type as dependent (after a pedwarn). */
7340 diagnostic_t kind = (processing_template_decl
7341 ? DK_PEDWARN
7343 cxx_incomplete_type_diagnostic
7347 {
7350 }
7351 }
7352 }
7355 {
7356 /* Let the name lookup machinery know that we are processing a
7357 class member access expression. */
7359 /* If something went wrong, we want to be able to discern that case,
7360 as opposed to the case where there was no SCOPE due to the type
7361 of expression being dependent. */
7364 /* If the SCOPE was erroneous, make the various semantic analysis
7365 functions exit quickly -- and without issuing additional error
7366 messages. */
7369 }
7370 }
7373 /* Tell cp_parser_lookup_name that there was an object, even though it's
7374 type-dependent. */
7377 /* Assume this expression is not a pseudo-destructor access. */
7380 /* If the SCOPE is a scalar type, then, if this is a valid program,
7381 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7382 is type dependent, it can be pseudo-destructor-name or something else.
7383 Try to parse it as pseudo-destructor-name first. */
7385 {
7386 tree s;
7387 tree type;
7390 /* Parse the pseudo-destructor-name. */
7399 {
7401 postfix_expression
7404 }
7405 }
7408 {
7409 /* If the SCOPE is not a scalar type, we are looking at an
7410 ordinary class member access expression, rather than a
7411 pseudo-destructor-name. */
7414 /* Parse the id-expression. */
7415 name = (cp_parser_id_expression
7422 /* In general, build a SCOPE_REF if the member name is qualified.
7423 However, if the name was not dependent and has already been
7424 resolved; there is no need to build the SCOPE_REF. For example;
7426 struct X { void f(); };
7427 template <typename T> void f(T* t) { t->X::f(); }
7429 Even though "t" is dependent, "X::f" is not and has been resolved
7430 to a BASELINK; there is no need to include scope information. */
7432 /* But we do need to remember that there was an explicit scope for
7433 virtual function calls. */
7437 /* If the name is a template-id that names a type, we will get a
7438 TYPE_DECL here. That is invalid code. */
7440 {
7443 }
7444 else
7445 {
7447 {
7449 {
7453 }
7454 else
7457 name,
7458 template_p);
7462 }
7464 adjust_result_of_qualified_name_lookup
7466 postfix_expression
7468 template_p,
7469 tf_warning_or_error);
7470 /* Build a location e.g.:
7471 ptr->access_expr
7472 ~~~^~~~~~~~~~~~~
7473 where the caret is at the deref token, ranging from
7474 the start of postfix_expression to the end of the access expr. */
7475 location_t end_loc
7477 location_t combined_loc
7480 }
7481 }
7483 /* We no longer need to look up names in the scope of the object on
7484 the left-hand side of the `.' or `->' operator. */
7487 /* Outside of offsetof, these operators may not appear in
7488 constant-expressions. */
7490 && (cp_parser_non_integral_constant_expression
7495 }
7497 /* Parse a parenthesized expression-list.
7499 expression-list:
7500 assignment-expression
7501 expression-list, assignment-expression
7503 attribute-list:
7504 expression-list
7505 identifier
7506 identifier, expression-list
7508 CAST_P is true if this expression is the target of a cast.
7510 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7511 argument pack.
7513 Returns a vector of trees. Each element is a representation of an
7514 assignment-expression. NULL is returned if the ( and or ) are
7515 missing. An empty, but allocated, vector is returned on no
7516 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7517 if we are parsing an attribute list for an attribute that wants a
7518 plain identifier argument, normal_attr for an attribute that wants
7519 an expression, or non_attr if we aren't parsing an attribute list. If
7520 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7521 not all of the expressions in the list were constant.
7522 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7523 will be written to with the location of the closing parenthesis. If
7524 an error occurs, it may or may not be written to. */
7533 {
7539 /* Assume all the expressions will be constant. */
7548 /* Within a parenthesized expression, a `>' token is always
7549 the greater-than operator. */
7550 saved_greater_than_is_operator_p
7554 /* Consume expressions until there are no more. */
7557 {
7558 tree expr;
7560 /* At the beginning of attribute lists, check to see if the
7561 next token is an identifier. */
7564 {
7567 /* Consume the identifier. */
7569 /* Save the identifier. */
7571 }
7572 else
7573 {
7576 /* Parse the next assignment-expression. */
7578 {
7579 /* A braced-init-list. */
7585 }
7587 {
7588 expr = (cp_parser_constant_expression
7593 }
7594 else
7596 cast_p);
7601 /* If we have an ellipsis, then this is an expression
7602 expansion. */
7605 {
7606 /* Consume the `...'. */
7609 /* Build the argument pack. */
7611 }
7613 /* Add it to the list. We add error_mark_node
7614 expressions to the list, so that we can still tell if
7615 the correct form for a parenthesized expression-list
7616 is found. That gives better errors. */
7621 }
7623 /* After the first item, attribute lists look the same as
7624 expression lists. */
7627 get_comma:;
7628 /* If the next token isn't a `,', then we are done. */
7632 /* Otherwise, consume the `,' and keep going. */
7634 }
7640 {
7643 skip_comma:;
7644 /* We try and resync to an unnested comma, as that will give the
7645 user better diagnostics. */
7653 {
7654 parser->greater_than_is_operator_p
7657 }
7658 }
7660 parser->greater_than_is_operator_p
7667 }
7669 /* Parse a pseudo-destructor-name.
7671 pseudo-destructor-name:
7672 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7673 :: [opt] nested-name-specifier template template-id :: ~ type-name
7674 :: [opt] nested-name-specifier [opt] ~ type-name
7676 If either of the first two productions is used, sets *SCOPE to the
7677 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7678 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7679 or ERROR_MARK_NODE if the parse fails. */
7681 static void
7683 tree object,
7686 {
7689 /* Handle ~auto. */
7693 {
7696 "%<~auto%> only available with "
7703 }
7705 /* Assume that things will not work out. */
7708 /* Look for the optional `::' operator. */
7710 /* Look for the optional nested-name-specifier. */
7711 nested_name_specifier_p
7718 /* Now, if we saw a nested-name-specifier, we might be doing the
7719 second production. */
7722 {
7723 /* Consume the `template' keyword. */
7725 /* Parse the template-id. */
7729 class_type,
7731 /* Look for the `::' token. */
7733 }
7734 /* If the next token is not a `~', then there might be some
7735 additional qualification. */
7737 {
7738 /* At this point, we're looking for "type-name :: ~". The type-name
7739 must not be a class-name, since this is a pseudo-destructor. So,
7740 it must be either an enum-name, or a typedef-name -- both of which
7741 are just identifiers. So, we peek ahead to check that the "::"
7742 and "~" tokens are present; if they are not, then we can avoid
7743 calling type_name. */
7747 {
7750 }
7752 /* Look for the type-name. */
7757 /* Look for the `::' token. */
7759 }
7760 else
7763 /* Look for the `~'. */
7766 /* Once we see the ~, this has to be a pseudo-destructor. */
7770 /* Look for the type-name again. We are not responsible for
7771 checking that it matches the first type-name. */
7773 }
7775 /* Parse a unary-expression.
7777 unary-expression:
7778 postfix-expression
7779 ++ cast-expression
7780 -- cast-expression
7781 unary-operator cast-expression
7782 sizeof unary-expression
7783 sizeof ( type-id )
7784 alignof ( type-id ) [C++0x]
7785 new-expression
7786 delete-expression
7788 GNU Extensions:
7790 unary-expression:
7791 __extension__ cast-expression
7792 __alignof__ unary-expression
7793 __alignof__ ( type-id )
7794 alignof unary-expression [C++0x]
7795 __real__ cast-expression
7796 __imag__ cast-expression
7797 && identifier
7798 sizeof ( type-id ) { initializer-list , [opt] }
7799 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7800 __alignof__ ( type-id ) { initializer-list , [opt] }
7802 ADDRESS_P is true iff the unary-expression is appearing as the
7803 operand of the `&' operator. CAST_P is true if this expression is
7804 the target of a cast.
7806 Returns a representation of the expression. */
7808 static cp_expr
7811 {
7815 /* Peek at the next token. */
7817 /* Some keywords give away the kind of expression. */
7819 {
7823 {
7826 {
7829 location_t first_loc;
7832 /* Consume the token. */
7835 /* Parse the operand. */
7840 else
7841 {
7842 /* ISO C++ defines alignof only with types, not with
7843 expressions. So pedwarn if alignof is used with a non-
7844 type expression. However, __alignof__ is ok. */
7847 "ISO C++ does not allow %<alignof%> "
7851 }
7852 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7853 SIZEOF_EXPR with the original operand. */
7855 {
7857 {
7859 {
7862 error_mark_node));
7864 }
7865 else
7869 }
7871 }
7873 }
7882 {
7883 /* The saved value of the PEDANTIC flag. */
7885 tree expr;
7887 /* Save away the PEDANTIC flag. */
7889 /* Parse the cast-expression. */
7891 /* Restore the PEDANTIC flag. */
7895 }
7899 {
7900 tree expression;
7902 /* Consume the `__real__' or `__imag__' token. */
7904 /* Parse the cast-expression. */
7906 /* Create the complete representation. */
7910 expression,
7911 tf_warning_or_error);
7912 }
7920 {
7921 tree expr;
7931 parser->type_definition_forbidden_message
7934 saved_integral_constant_expression_p
7936 saved_non_integral_constant_expression_p
7940 saved_greater_than_is_operator_p
7952 parser->greater_than_is_operator_p
7955 parser->integral_constant_expression_p
7957 parser->non_integral_constant_expression_p
7964 }
7968 }
7969 }
7971 /* Look for the `:: new' and `:: delete', which also signal the
7972 beginning of a new-expression, or delete-expression,
7973 respectively. If the next token is `::', then it might be one of
7974 these. */
7976 {
7979 /* See if the token after the `::' is one of the keywords in
7980 which we're interested. */
7982 /* If it's `new', we have a new-expression. */
7985 /* Similarly, for `delete'. */
7988 }
7990 /* Look for a unary operator. */
7992 /* The `++' and `--' operators can be handled similarly, even though
7993 they are not technically unary-operators in the grammar. */
7995 {
8000 /* Handle the GNU address-of-label extension. */
8003 {
8004 tree identifier;
8005 tree expression;
8008 /* Consume the '&&' token. */
8010 /* Look for the identifier. */
8011 location_t finish_loc
8014 /* Construct a location of the form:
8015 &&label
8016 ^~~~~~~
8017 with caret==start at the "&&", finish at the end of the label. */
8018 location_t combined_loc
8020 /* Create an expression representing the address. */
8023 NIC_ADDR_LABEL))
8026 }
8027 }
8029 {
8030 cp_expr cast_expression;
8036 /* Consume the operator token. */
8040 /* Parse the cast-expression. */
8041 cast_expression
8046 pidk);
8048 /* Make a location:
8049 OP_TOKEN CAST_EXPRESSION
8050 ^~~~~~~~~~~~~~~~~~~~~~~~~
8051 with start==caret at the operator token, and
8052 extending to the end of the cast_expression. */
8055 /* Now, build an appropriate representation. */
8057 {
8061 RO_UNARY_STAR,
8062 complain);
8063 /* TODO: build_x_indirect_ref does not always honor the
8064 location, so ensure it is set. */
8070 /* Fall through. */
8073 cast_expression,
8074 complain);
8075 /* TODO: build_x_unary_op does not always honor the location,
8076 so ensure it is set. */
8084 /* Fall through. */
8086 /* Immediately fold negation of a constant, unless the constant is 0
8087 (since -0 == 0) or it would overflow. */
8092 {
8095 cast_expression);
8097 {
8100 }
8101 }
8102 /* Fall through. */
8111 }
8115 non_constant_p))
8119 }
8123 decltype_p,
8124 pidk);
8125 }
8127 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8128 unary-operator, the corresponding tree code is returned. */
8130 static enum tree_code
8132 {
8134 {
8155 }
8156 }
8158 /* Parse a new-expression.
8160 new-expression:
8161 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8162 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8164 Returns a representation of the expression. */
8166 static tree
8168 {
8171 tree type;
8174 tree ret;
8178 /* Look for the optional `::' operator. */
8179 global_scope_p
8183 /* Look for the `new' operator. */
8185 /* There's no easy way to tell a new-placement from the
8186 `( type-id )' construct. */
8188 /* Look for a new-placement. */
8190 /* If that didn't work out, there's no new-placement. */
8192 {
8196 }
8198 /* If the next token is a `(', then we have a parenthesized
8199 type-id. */
8201 {
8205 /* Consume the `('. */
8208 /* Parse the type-id. */
8209 parser->type_definition_forbidden_message
8211 {
8214 }
8217 /* Look for the closing `)'. */
8220 /* There should not be a direct-new-declarator in this production,
8221 but GCC used to allowed this, so we check and emit a sensible error
8222 message for this case. */
8224 {
8230 }
8231 }
8232 /* Otherwise, there must be a new-type-id. */
8233 else
8236 /* If the next token is a `(' or '{', then we have a new-initializer. */
8241 else
8244 /* A new-expression may not appear in an integral constant
8245 expression. */
8248 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8249 of a new-type-id or type-id of a new-expression, the new-expression shall
8250 contain a new-initializer of the form ( assignment-expression )".
8251 Additionally, consistently with the spirit of DR 1467, we want to accept
8252 'new auto { 2 }' too. */
8257 {
8259 "initialization of new-expression for type %<auto%> "
8262 }
8263 else
8264 {
8265 /* Construct a location e.g.:
8266 ptr = new int[100]
8267 ^~~~~~~~~~~~
8268 with caret == start at the start of the "new" token, and the end
8269 at the end of the final token we consumed. */
8274 /* Create a representation of the new-expression. */
8276 tf_warning_or_error);
8278 }
8286 }
8288 /* Parse a new-placement.
8290 new-placement:
8291 ( expression-list )
8293 Returns the same representation as for an expression-list. */
8297 {
8300 /* Parse the expression-list. */
8301 expression_list = (cp_parser_parenthesized_expression_list
8310 }
8312 /* Parse a new-type-id.
8314 new-type-id:
8315 type-specifier-seq new-declarator [opt]
8317 Returns the TYPE allocated. If the new-type-id indicates an array
8318 type, *NELTS is set to the number of elements in the last array
8319 bound; the TYPE will not include the last array bound. */
8321 static tree
8323 {
8324 cp_decl_specifier_seq type_specifier_seq;
8330 /* The type-specifier sequence must not contain type definitions.
8331 (It cannot contain declarations of new types either, but if they
8332 are not definitions we will catch that because they are not
8333 complete.) */
8335 parser->type_definition_forbidden_message
8337 /* Parse the type-specifier-seq. */
8341 /* Restore the old message. */
8347 /* Parse the new-declarator. */
8350 /* Determine the number of elements in the last array dimension, if
8351 any. */
8353 /* Skip down to the last array dimension. */
8358 {
8361 }
8366 {
8369 }
8372 {
8379 else
8381 }
8384 }
8386 /* Parse an (optional) new-declarator.
8388 new-declarator:
8389 ptr-operator new-declarator [opt]
8390 direct-new-declarator
8392 Returns the declarator. */
8396 {
8399 cp_cv_quals cv_quals;
8401 /* We don't know if there's a ptr-operator next, or not. */
8403 /* Look for a ptr-operator. */
8405 /* If that worked, look for more new-declarators. */
8407 {
8410 /* Parse another optional declarator. */
8413 declarator = cp_parser_make_indirect_declarator
8417 }
8419 /* If the next token is a `[', there is a direct-new-declarator. */
8424 }
8426 /* Parse a direct-new-declarator.
8428 direct-new-declarator:
8429 [ expression ]
8430 direct-new-declarator [constant-expression]
8432 */
8436 {
8440 {
8441 tree expression;
8444 /* Look for the opening `['. */
8449 /* The standard requires that the expression have integral
8450 type. DR 74 adds enumeration types. We believe that the
8451 real intent is that these expressions be handled like the
8452 expression in a `switch' condition, which also allows
8453 classes with a single conversion to integral or
8454 enumeration type. */
8456 {
8457 expression
8459 expression,
8462 {
8464 "expression in new-declarator must have integral "
8467 }
8468 }
8470 /* Look for the closing `]'. */
8473 /* Add this bound to the declarator. */
8476 /* If the next token is not a `[', then there are no more
8477 bounds. */
8480 }
8483 }
8485 /* Parse a new-initializer.
8487 new-initializer:
8488 ( expression-list [opt] )
8489 braced-init-list
8491 Returns a representation of the expression-list. */
8495 {
8499 {
8500 tree t;
8507 }
8508 else
8509 expression_list = (cp_parser_parenthesized_expression_list
8515 }
8517 /* Parse a delete-expression.
8519 delete-expression:
8520 :: [opt] delete cast-expression
8521 :: [opt] delete [ ] cast-expression
8523 Returns a representation of the expression. */
8525 static tree
8527 {
8530 tree expression;
8532 /* Look for the optional `::' operator. */
8533 global_scope_p
8537 /* Look for the `delete' keyword. */
8539 /* See if the array syntax is in use. */
8541 {
8542 /* Consume the `[' token. */
8544 /* Look for the `]' token. */
8546 /* Remember that this is the `[]' construct. */
8548 }
8549 else
8552 /* Parse the cast-expression. */
8555 /* A delete-expression may not appear in an integral constant
8556 expression. */
8561 tf_warning_or_error);
8562 }
8564 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8565 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8566 0 otherwise. */
8568 static int
8570 {
8573 {
8615 /* In ((type ()) () the last () isn't a valid cast-expression,
8616 so the whole must be parsed as postfix-expression. */
8621 /* '[' may start a primary-expression in obj-c++ and in C++11,
8622 as a lambda-expression, eg, '(void)[]{}'. */
8629 /* '++' and '--' may or may not start a cast-expression:
8631 struct T { void operator++(int); };
8632 void f() { (T())++; }
8634 vs
8636 int a;
8637 (int)++a; */
8642 }
8643 }
8645 /* Parse a cast-expression.
8647 cast-expression:
8648 unary-expression
8649 ( type-id ) cast-expression
8651 ADDRESS_P is true iff the unary-expression is appearing as the
8652 operand of the `&' operator. CAST_P is true if this expression is
8653 the target of a cast.
8655 Returns a representation of the expression. */
8657 static cp_expr
8660 {
8661 /* If it's a `(', then we might be looking at a cast. */
8663 {
8669 /* There's no way to know yet whether or not this is a cast.
8670 For example, `(int (3))' is a unary-expression, while `(int)
8671 3' is a cast. So, we resort to parsing tentatively. */
8673 /* Types may not be defined in a cast. */
8675 parser->type_definition_forbidden_message
8677 /* Consume the `('. */
8681 /* A very tricky bit is that `(struct S) { 3 }' is a
8682 compound-literal (which we permit in C++ as an extension).
8683 But, that construct is not a cast-expression -- it is a
8684 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8685 is legal; if the compound-literal were a cast-expression,
8686 you'd need an extra set of parentheses.) But, if we parse
8687 the type-id, and it happens to be a class-specifier, then we
8688 will commit to the parse at that point, because we cannot
8689 undo the action that is done when creating a new class. So,
8690 then we cannot back up and do a postfix-expression.
8692 Another tricky case is the following (c++/29234):
8694 struct S { void operator () (); };
8696 void foo ()
8697 {
8698 ( S()() );
8699 }
8701 As a type-id we parse the parenthesized S()() as a function
8702 returning a function, groktypename complains and we cannot
8703 back up in this case either.
8705 Therefore, we scan ahead to the closing `)', and check to see
8706 if the tokens after the `)' can start a cast-expression. Otherwise
8707 we are dealing with an unary-expression, a postfix-expression
8708 or something else.
8710 Yet another tricky case, in C++11, is the following (c++/54891):
8712 (void)[]{};
8714 The issue is that usually, besides the case of lambda-expressions,
8715 the parenthesized type-id cannot be followed by '[', and, eg, we
8716 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8717 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8718 we don't commit, we try a cast-expression, then an unary-expression.
8720 Save tokens so that we can put them back. */
8723 /* We may be looking at a cast-expression. */
8726 cast_expression
8729 /* Roll back the tokens we skipped. */
8731 /* If we aren't looking at a cast-expression, simulate an error so
8732 that the call to cp_parser_error_occurred below returns true. */
8735 else
8736 {
8739 /* Look for the type-id. */
8741 /* Look for the closing `)'. */
8744 }
8746 /* Restore the saved message. */
8749 /* At this point this can only be either a cast or a
8750 parenthesized ctor such as `(T ())' that looks like a cast to
8751 function returning T. */
8753 {
8754 /* Only commit if the cast-expression doesn't start with
8755 '++', '--', or '[' in C++11. */
8763 pidk);
8766 {
8767 /* Warn about old-style casts, if so requested. */
8774 /* Only type conversions to integral or enumeration types
8775 can be used in constant-expressions. */
8778 NIC_CAST))
8781 /* Perform the cast. */
8782 /* Make a location:
8783 (TYPE) EXPR
8784 ^~~~~~~~~~~
8785 with start==caret at the open paren, extending to the
8786 end of "expr". */
8788 open_paren_loc,
8792 }
8793 }
8794 else
8796 }
8798 /* If we get here, then it's not a cast, so it must be a
8799 unary-expression. */
8802 }
8804 /* Parse a binary expression of the general form:
8806 pm-expression:
8807 cast-expression
8808 pm-expression .* cast-expression
8809 pm-expression ->* cast-expression
8811 multiplicative-expression:
8812 pm-expression
8813 multiplicative-expression * pm-expression
8814 multiplicative-expression / pm-expression
8815 multiplicative-expression % pm-expression
8817 additive-expression:
8818 multiplicative-expression
8819 additive-expression + multiplicative-expression
8820 additive-expression - multiplicative-expression
8822 shift-expression:
8823 additive-expression
8824 shift-expression << additive-expression
8825 shift-expression >> additive-expression
8827 relational-expression:
8828 shift-expression
8829 relational-expression < shift-expression
8830 relational-expression > shift-expression
8831 relational-expression <= shift-expression
8832 relational-expression >= shift-expression
8834 GNU Extension:
8836 relational-expression:
8837 relational-expression <? shift-expression
8838 relational-expression >? shift-expression
8840 equality-expression:
8841 relational-expression
8842 equality-expression == relational-expression
8843 equality-expression != relational-expression
8845 and-expression:
8846 equality-expression
8847 and-expression & equality-expression
8849 exclusive-or-expression:
8850 and-expression
8851 exclusive-or-expression ^ and-expression
8853 inclusive-or-expression:
8854 exclusive-or-expression
8855 inclusive-or-expression | exclusive-or-expression
8857 logical-and-expression:
8858 inclusive-or-expression
8859 logical-and-expression && inclusive-or-expression
8861 logical-or-expression:
8862 logical-and-expression
8863 logical-or-expression || logical-and-expression
8865 All these are implemented with a single function like:
8867 binary-expression:
8868 simple-cast-expression
8869 binary-expression <token> binary-expression
8871 CAST_P is true if this expression is the target of a cast.
8873 The binops_by_token map is used to get the tree codes for each <token> type.
8874 binary-expressions are associated according to a precedence table. */
8876 #define TOKEN_PRECEDENCE(token) \
8877 (((token->type == CPP_GREATER \
8878 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8879 && !parser->greater_than_is_operator_p) \
8880 ? PREC_NOT_OPERATOR \
8881 : binops_by_token[token->type].prec)
8883 static cp_expr
8889 {
8890 cp_parser_expression_stack stack;
8892 cp_parser_expression_stack_entry current;
8893 cp_expr rhs;
8897 tree overload;
8899 /* Parse the first expression. */
8910 {
8911 /* Get an operator token. */
8917 {
8919 "%<>>%> operator is treated"
8923 }
8928 /* This is a fold-expression; handle it later. */
8931 /* Popping an entry off the stack means we completed a subexpression:
8932 - either we found a token which is not an operator (`>' where it is not
8933 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8934 will happen repeatedly;
8935 - or, we found an operator which has lower priority. This is the case
8936 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8937 parsing `3 * 4'. */
8939 {
8942 else
8944 }
8946 get_rhs:
8950 /* We used the operator token. */
8953 /* For "false && x" or "true || x", x will never be executed;
8954 disable warnings while evaluating it. */
8956 c_inhibit_evaluation_warnings +=
8959 c_inhibit_evaluation_warnings +=
8962 /* Extract another operand. It may be the RHS of this expression
8963 or the LHS of a new, higher priority expression. */
8968 /* Get another operator token. Look up its precedence to avoid
8969 building a useless (immediately popped) stack entry for common
8970 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8977 {
8978 /* ... and prepare to parse the RHS of the new, higher priority
8979 expression. Since precedence levels on the stack are
8980 monotonically increasing, we do not have to care about
8981 stack overflows. */
8990 pop:
8992 /* If the stack is not empty, we have parsed into LHS the right side
8993 (`4' in the example above) of an expression we had suspended.
8994 We can use the information on the stack to recover the LHS (`3')
8995 from the stack together with the tree code (`MULT_EXPR'), and
8996 the precedence of the higher level subexpression
8997 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8998 which will be used to actually build the additive expression. */
9003 }
9005 /* Undo the disabling of warnings done above. */
9007 c_inhibit_evaluation_warnings -=
9010 c_inhibit_evaluation_warnings -=
9016 /* Avoid warning for !!x == y. */
9021 /* Avoid warning for !b == y where b is boolean. */
9025 /* Avoid warning for !!b == y where b is boolean. */
9038 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9039 ERROR_MARK for everything that is not a binary expression.
9040 This makes warn_about_parentheses miss some warnings that
9041 involve unary operators. For unary expressions we should
9042 pass the correct tree_code unless the unary expression was
9043 surrounded by parentheses.
9044 */
9051 == tcc_comparison
9054 else
9055 {
9060 /* TODO: build_x_binary_op doesn't always honor the location. */
9062 }
9065 /* If the binary operator required the use of an overloaded operator,
9066 then this expression cannot be an integral constant-expression.
9067 An overloaded operator can be used even if both operands are
9068 otherwise permissible in an integral constant-expression if at
9069 least one of the operands is of enumeration type. */
9073 NIC_OVERLOADED))
9075 }
9078 }
9080 static cp_expr
9085 {
9088 }
9090 /* Parse the `? expression : assignment-expression' part of a
9091 conditional-expression. The LOGICAL_OR_EXPR is the
9092 logical-or-expression that started the conditional-expression.
9093 Returns a representation of the entire conditional-expression.
9095 This routine is used by cp_parser_assignment_expression.
9097 ? expression : assignment-expression
9099 GNU Extensions:
9101 ? : assignment-expression */
9103 static tree
9105 {
9107 cp_expr assignment_expr;
9111 /* Consume the `?' token. */
9116 {
9119 /* Implicit true clause. */
9121 c_inhibit_evaluation_warnings +=
9124 }
9125 else
9126 {
9129 /* Parse the expression. */
9130 c_inhibit_evaluation_warnings +=
9133 c_inhibit_evaluation_warnings +=
9137 }
9139 /* The next token should be a `:'. */
9141 /* Parse the assignment-expression. */
9143 c_inhibit_evaluation_warnings -=
9146 /* Make a location:
9147 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9148 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9149 with the caret at the "?", ranging from the start of
9150 the logical_or_expr to the end of the assignment_expr. */
9155 /* Build the conditional-expression. */
9157 expr,
9158 assignment_expr,
9159 tf_warning_or_error);
9160 }
9162 /* Parse an assignment-expression.
9164 assignment-expression:
9165 conditional-expression
9166 logical-or-expression assignment-operator assignment_expression
9167 throw-expression
9169 CAST_P is true if this expression is the target of a cast.
9170 DECLTYPE_P is true if this expression is the operand of decltype.
9172 Returns a representation for the expression. */
9174 static cp_expr
9177 {
9178 cp_expr expr;
9180 /* If the next token is the `throw' keyword, then we're looking at
9181 a throw-expression. */
9184 /* Otherwise, it must be that we are looking at a
9185 logical-or-expression. */
9186 else
9187 {
9188 /* Parse the binary expressions (logical-or-expression). */
9190 decltype_p,
9192 /* If the next token is a `?' then we're actually looking at a
9193 conditional-expression. */
9196 else
9197 {
9200 /* If it's an assignment-operator, we're using the second
9201 production. */
9202 enum tree_code assignment_operator
9205 {
9208 /* Parse the right-hand side of the assignment. */
9215 /* An assignment may not appear in a
9216 constant-expression. */
9218 NIC_ASSIGNMENT))
9220 /* Build the assignment expression. Its default
9221 location:
9222 LHS = RHS
9223 ~~~~^~~~~
9224 is the location of the '=' token as the
9225 caret, ranging from the start of the lhs to the
9226 end of the rhs. */
9231 assignment_operator,
9232 rhs,
9234 /* TODO: build_x_modify_expr doesn't honor the location,
9235 so we must set it here. */
9237 }
9238 }
9239 }
9242 }
9244 /* Parse an (optional) assignment-operator.
9246 assignment-operator: one of
9247 = *= /= %= += -= >>= <<= &= ^= |=
9249 GNU Extension:
9251 assignment-operator: one of
9252 <?= >?=
9254 If the next token is an assignment operator, the corresponding tree
9255 code is returned, and the token is consumed. For example, for
9256 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9257 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9258 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9259 operator, ERROR_MARK is returned. */
9261 static enum tree_code
9263 {
9267 /* Peek at the next token. */
9271 {
9317 /* Nothing else is an assignment operator. */
9319 }
9321 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9326 /* If it was an assignment operator, consume it. */
9331 }
9333 /* Parse an expression.
9335 expression:
9336 assignment-expression
9337 expression , assignment-expression
9339 CAST_P is true if this expression is the target of a cast.
9340 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9341 except possibly parenthesized or on the RHS of a comma (N3276).
9343 Returns a representation of the expression. */
9345 static cp_expr
9348 {
9353 {
9354 cp_expr assignment_expression;
9356 /* Parse the next assignment-expression. */
9357 assignment_expression
9360 /* We don't create a temporary for a call that is the immediate operand
9361 of decltype or on the RHS of a comma. But when we see a comma, we
9362 need to create a temporary for a call on the LHS. */
9367 assignment_expression
9371 /* If this is the first assignment-expression, we can just
9372 save it away. */
9375 else
9376 {
9377 /* Create a location with caret at the comma, ranging
9378 from the start of the LHS to the end of the RHS. */
9383 assignment_expression,
9386 }
9387 /* If the next token is not a comma, or we're in a fold-expression, then
9388 we are done with the expression. */
9392 /* Consume the `,'. */
9395 /* A comma operator cannot appear in a constant-expression. */
9398 }
9401 }
9403 /* Parse a constant-expression.
9405 constant-expression:
9406 conditional-expression
9408 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9409 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9410 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9411 is false, NON_CONSTANT_P should be NULL. */
9413 static cp_expr
9417 {
9421 cp_expr expression;
9423 /* It might seem that we could simply parse the
9424 conditional-expression, and then check to see if it were
9425 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9426 one that the compiler can figure out is constant, possibly after
9427 doing some simplifications or optimizations. The standard has a
9428 precise definition of constant-expression, and we must honor
9429 that, even though it is somewhat more restrictive.
9431 For example:
9433 int i[(2, 3)];
9435 is not a legal declaration, because `(2, 3)' is not a
9436 constant-expression. The `,' operator is forbidden in a
9437 constant-expression. However, GCC's constant-folding machinery
9438 will fold this operation to an INTEGER_CST for `3'. */
9440 /* Save the old settings. */
9442 saved_allow_non_integral_constant_expression_p
9445 /* We are now parsing a constant-expression. */
9447 parser->allow_non_integral_constant_expression_p
9450 /* Although the grammar says "conditional-expression", we parse an
9451 "assignment-expression", which also permits "throw-expression"
9452 and the use of assignment operators. In the case that
9453 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9454 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9455 actually essential that we look for an assignment-expression.
9456 For example, cp_parser_initializer_clauses uses this function to
9457 determine whether a particular assignment-expression is in fact
9458 constant. */
9460 /* Restore the old settings. */
9461 parser->integral_constant_expression_p
9463 parser->allow_non_integral_constant_expression_p
9466 {
9467 /* Require an rvalue constant expression here; that's what our
9468 callers expect. Reference constant expressions are handled
9469 separately in e.g. cp_parser_template_argument. */
9474 }
9477 parser->non_integral_constant_expression_p
9481 }
9483 /* Parse __builtin_offsetof.
9485 offsetof-expression:
9486 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9488 offsetof-member-designator:
9489 id-expression
9490 | offsetof-member-designator "." id-expression
9491 | offsetof-member-designator "[" expression "]"
9492 | offsetof-member-designator "->" id-expression */
9494 static cp_expr
9496 {
9498 tree type;
9499 cp_expr expr;
9500 cp_id_kind dummy;
9502 location_t finish_loc;
9504 /* We're about to accept non-integral-constant things, but will
9505 definitely yield an integral constant expression. Save and
9506 restore these values around our local parsing. */
9512 /* Consume the "__builtin_offsetof" token. */
9514 /* Consume the opening `('. */
9516 /* Parse the type-id. */
9519 /* Look for the `,'. */
9523 /* Build the (type *)null that begins the traditional offsetof macro. */
9524 tree object_ptr
9526 tf_warning_or_error);
9528 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9532 {
9535 {
9537 /* offsetof-member-designator "[" expression "]" */
9543 /* offsetof-member-designator "->" identifier */
9546 /* FALLTHRU */
9549 /* offsetof-member-designator "." identifier */
9557 /* Consume the ")" token. */
9563 /* Error. We know the following require will fail, but
9564 that gives the proper error message. */
9569 }
9570 }
9572 success:
9573 /* Make a location of the form:
9574 __builtin_offsetof (struct s, f)
9575 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9576 with caret at the type-id, ranging from the start of the
9577 "_builtin_offsetof" token to the close paren. */
9579 /* The result will be an INTEGER_CST, so we need to explicitly
9580 preserve the location. */
9583 failure:
9588 }
9590 /* Parse a trait expression.
9592 Returns a representation of the expression, the underlying type
9593 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9595 static tree
9597 {
9598 cp_trait_kind kind;
9604 {
9695 }
9697 /* Consume the token. */
9702 {
9705 }
9711 {
9714 {
9717 }
9721 }
9723 {
9725 {
9729 {
9732 }
9736 }
9737 }
9741 /* Complete the trait expression, which may mean either processing
9742 the trait expr now or saving it for template instantiation. */
9744 {
9753 }
9754 }
9756 /* Lambdas that appear in variable initializer or default argument scope
9757 get that in their mangling, so we need to record it. We might as well
9758 use the count for function and namespace scopes as well. */
9762 {
9763 tree t;
9765 };
9768 static void
9770 {
9771 tree_int ti;
9773 /* Once we're inside a function, we ignore other scopes and just push
9774 the function again so that popping works properly. */
9781 {
9782 /* Don't reset the count if we're still in the same function. */
9785 }
9786 }
9788 static void
9790 {
9793 }
9795 static void
9797 {
9800 {
9803 }
9805 }
9807 /* Parse a lambda expression.
9809 lambda-expression:
9810 lambda-introducer lambda-declarator [opt] compound-statement
9812 Returns a representation of the expression. */
9814 static cp_expr
9816 {
9818 tree type;
9826 {
9828 {
9832 }
9834 }
9836 {
9838 {
9841 }
9843 }
9845 /* We may be in the middle of deferred access check. Disable
9846 it now. */
9857 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9860 /* Now that we've started the type, add the capture fields for any
9861 explicit captures. */
9864 {
9865 /* Inside the class, surrounding template-parameter-lists do not apply. */
9866 unsigned int saved_num_template_parameter_lists
9870 bool fully_implicit_function_template_p
9874 bool auto_is_implicit_function_template_parm_p
9885 /* By virtue of defining a local class, a lambda expression has access to
9886 the private variables of enclosing classes. */
9894 {
9899 }
9901 {
9904 }
9906 /* The capture list was built up in reverse order; fix that now. */
9918 parser->fully_implicit_function_template_p
9922 parser->auto_is_implicit_function_template_parm_p
9924 }
9926 /* This field is only used during parsing of the lambda. */
9929 /* This lambda shouldn't have any proxies left at this point. */
9931 /* And now that we're done, push proxies for an enclosing lambda. */
9936 else
9944 }
9946 /* Parse the beginning of a lambda expression.
9948 lambda-introducer:
9949 [ lambda-capture [opt] ]
9951 LAMBDA_EXPR is the current representation of the lambda expression. */
9953 static void
9955 {
9956 /* Need commas after the first capture. */
9959 /* Eat the leading `['. */
9962 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9970 {
9973 }
9976 {
9978 tree capture_id;
9979 tree capture_init_expr;
9983 enum capture_kind_type
9984 {
9985 BY_COPY,
9986 BY_REFERENCE
9987 };
9991 {
9994 }
9998 else
10001 /* Possibly capture `this'. */
10003 {
10013 explicit_init_p);
10015 }
10017 /* Possibly capture `*this'. */
10020 {
10031 explicit_init_p);
10033 }
10035 /* Remember whether we want to capture as a reference or not. */
10037 {
10040 }
10042 /* Get the identifier. */
10047 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10048 delimiters, but I modified this to stop on unnested ']' as well. It
10049 was already changed to stop on unnested '}', so the
10050 "closing_parenthesis" name is no more misleading with my change. */
10051 {
10057 }
10059 /* Find the initializer for this capture. */
10063 {
10065 /* An explicit initializer exists. */
10068 "lambda capture initializers "
10074 {
10077 }
10078 }
10079 else
10080 {
10083 /* Turn the identifier into an id-expression. */
10084 capture_init_expr
10089 {
10092 }
10096 {
10099 capture_init_expr);
10103 }
10106 {
10109 capture_init_expr))
10113 }
10115 capture_init_expr
10116 = finish_id_expression
10118 capture_init_expr,
10132 {
10135 }
10136 else
10138 }
10142 {
10147 capture_id);
10151 "capture of %qD redundant with by-reference capture "
10153 }
10156 capture_id,
10157 capture_init_expr,
10159 explicit_init_p);
10160 }
10163 }
10165 /* Parse the (optional) middle of a lambda expression.
10167 lambda-declarator:
10168 < template-parameter-list [opt] >
10169 ( parameter-declaration-clause [opt] )
10170 attribute-specifier [opt]
10171 decl-specifier-seq [opt]
10172 exception-specification [opt]
10173 lambda-return-type-clause [opt]
10175 LAMBDA_EXPR is the current representation of the lambda expression. */
10177 static bool
10179 {
10180 /* 5.1.1.4 of the standard says:
10181 If a lambda-expression does not include a lambda-declarator, it is as if
10182 the lambda-declarator were ().
10183 This means an empty parameter list, no attributes, and no exception
10184 specification. */
10190 cp_decl_specifier_seq lambda_specs;
10193 /* The template-parameter-list is optional, but must begin with
10194 an opening angle if present. */
10196 {
10199 "lambda templates are only available with "
10201 else
10211 /* We just processed one more parameter list. */
10213 }
10215 /* The parameter-declaration-clause is optional (unless
10216 template-parameter-list was given), but must begin with an
10217 opening parenthesis if present. */
10219 {
10224 /* Parse parameters. */
10227 /* Default arguments shall not be specified in the
10228 parameter-declaration-clause of a lambda-declarator. */
10239 /* In the decl-specifier-seq of the lambda-declarator, each
10240 decl-specifier shall either be mutable or constexpr. */
10244 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10247 {
10252 }
10256 /* Parse optional exception specification. */
10259 /* Parse optional trailing return type. */
10261 {
10265 }
10267 /* The function parameters must be in scope all the way until after the
10268 trailing-return-type in case of decltype. */
10270 }
10274 /* Create the function call operator.
10276 Messing with declarators like this is no uglier than building up the
10277 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10278 other code. */
10279 {
10280 cp_decl_specifier_seq return_type_specs;
10282 tree fco;
10289 else
10290 /* Maybe we will deduce the return type later. */
10294 {
10298 else
10301 }
10306 sfk_none);
10311 VIRT_SPEC_UNSPECIFIED,
10312 REF_QUAL_NONE,
10313 tx_qual,
10314 exception_spec,
10320 declarator,
10321 attributes);
10323 {
10326 /* Give the object parameter a different name. */
10330 }
10332 {
10336 }
10345 }
10346 }
10348 /* Parse the body of a lambda expression, which is simply
10350 compound-statement
10352 but which requires special handling.
10353 LAMBDA_EXPR is the current representation of the lambda expression. */
10355 static void
10357 {
10362 else
10363 /* Still increment function_depth so that we don't GC in the
10364 middle of an expression. */
10368 /* Clear this in case we're in the middle of a default argument. */
10371 /* Finish the function call operator
10372 - class_specifier
10373 + late_parsing_for_member
10374 + function_definition_after_declarator
10375 + ctor_initializer_opt_and_function_body */
10376 {
10378 tree body;
10380 tree compound_stmt;
10381 tree cap;
10383 /* Let the front end know that we are going to be defining this
10384 function. */
10386 NULL_TREE,
10395 /* Push the proxies for any explicit captures. */
10402 /* 5.1.1.4 of the standard says:
10403 If a lambda-expression does not include a trailing-return-type, it
10404 is as if the trailing-return-type denotes the following type:
10405 * if the compound-statement is of the form
10406 { return attribute-specifier [opt] expression ; }
10407 the type of the returned expression after lvalue-to-rvalue
10408 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10409 (_conv.array_ 4.2), and function-to-pointer conversion
10410 (_conv.func_ 4.3);
10411 * otherwise, void. */
10413 /* In a lambda that has neither a lambda-return-type-clause
10414 nor a deducible form, errors should be reported for return statements
10415 in the body. Since we used void as the placeholder return type, parsing
10416 the body as usual will give such desired behavior. */
10420 {
10424 /* Parse tentatively in case there's more after the initial return
10425 statement. */
10436 {
10438 {
10443 }
10445 /* Will get error here if type not deduced yet. */
10449 }
10450 }
10453 {
10458 }
10462 out:
10466 /* Finish the function and generate code for it if necessary. */
10469 /* Only expand if the call op is not a template. */
10472 }
10478 else
10480 }
10482 /* Statements [gram.stmt.stmt] */
10484 /* Parse a statement.
10486 statement:
10487 labeled-statement
10488 expression-statement
10489 compound-statement
10490 selection-statement
10491 iteration-statement
10492 jump-statement
10493 declaration-statement
10494 try-block
10496 C++11:
10498 statement:
10499 labeled-statement
10500 attribute-specifier-seq (opt) expression-statement
10501 attribute-specifier-seq (opt) compound-statement
10502 attribute-specifier-seq (opt) selection-statement
10503 attribute-specifier-seq (opt) iteration-statement
10504 attribute-specifier-seq (opt) jump-statement
10505 declaration-statement
10506 attribute-specifier-seq (opt) try-block
10508 init-statement:
10509 expression-statement
10510 simple-declaration
10512 TM Extension:
10514 statement:
10515 atomic-statement
10517 IN_COMPOUND is true when the statement is nested inside a
10518 cp_parser_compound_statement; this matters for certain pragmas.
10520 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10521 is a (possibly labeled) if statement which is not enclosed in braces
10522 and has an else clause. This is used to implement -Wparentheses.
10524 CHAIN is a vector of if-else-if conditions. */
10526 static void
10529 {
10534 restart:
10537 /* There is no statement yet. */
10543 /* In obj-c++, seeing '[[' might be the either the beginning of
10544 c++11 attributes, or a nested objc-message-expression. So
10545 let's parse the c++11 attributes tentatively. */
10549 {
10552 }
10554 /* Peek at the next token. */
10556 /* Remember the location of the first token in the statement. */
10558 /* If this is a keyword, then that will often determine what kind of
10559 statement we have. */
10561 {
10565 {
10568 /* Looks like a labeled-statement with a case label.
10569 Parse the label, and then use tail recursion to parse
10570 the statement. */
10588 {
10593 }
10594 else
10608 {
10613 }
10614 else
10615 {
10619 }
10623 /* Objective-C++ exception-handling constructs. */
10637 /* This must be a namespace alias definition. */
10653 /* It might be a keyword like `int' that can start a
10654 declaration-statement. */
10656 }
10657 }
10659 {
10660 /* If the next token is a `:', then we are looking at a
10661 labeled-statement. */
10664 {
10665 /* Looks like a labeled-statement with an ordinary label.
10666 Parse the label, and then use tail recursion to parse
10667 the statement. */
10672 }
10673 }
10674 /* Anything that starts with a `{' must be a compound-statement. */
10677 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10678 a statement all its own. */
10680 {
10681 /* Only certain OpenMP pragmas are attached to statements, and thus
10682 are considered statements themselves. All others are not. In
10683 the context of a compound, accept the pragma as a "statement" and
10684 return so that we can check for a close brace. Otherwise we
10685 require a real statement and must go back and read one. */
10691 }
10693 {
10696 }
10698 /* Everything else must be a declaration-statement or an
10699 expression-statement. Try for the declaration-statement
10700 first, unless we are looking at a `;', in which case we know that
10701 we have an expression-statement. */
10703 {
10705 {
10707 {
10708 /* Attributes should be parsed as part of the the
10709 declaration, so let's un-parse them. */
10712 }
10715 /* Try to parse the declaration-statement. */
10717 /* If that worked, we're done. */
10720 }
10721 /* Look for an expression-statement instead. */
10724 /* Handle [[fallthrough]];. */
10726 {
10727 /* The next token after the fallthrough attribute is ';'. */
10729 {
10730 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10732 IFN_FALLTHROUGH,
10735 }
10736 else
10740 }
10741 }
10743 /* Set the line number for the statement. */
10747 /* Allow "[[fallthrough]];", but warn otherwise. */
10750 OPT_Wattributes,
10752 }
10754 /* Parse the label for a labeled-statement, i.e.
10756 identifier :
10757 case constant-expression :
10758 default :
10760 GNU Extension:
10761 case constant-expression ... constant-expression : statement
10763 When a label is parsed without errors, the label is added to the
10764 parse tree by the finish_* functions, so this function doesn't
10765 have to return the label. */
10767 static void
10769 {
10774 /* The next token should be an identifier. */
10778 {
10781 }
10783 /* Remember whether this case or a user-defined label is allowed to fall
10784 through to. */
10789 {
10791 {
10795 /* Consume the `case' token. */
10797 /* Parse the constant-expression. */
10804 {
10805 /* Consume the `...' token. */
10811 /* We don't need to emit warnings here, as the common code
10812 will do this for us. */
10813 }
10814 else
10818 {
10822 }
10823 else
10826 expr);
10827 }
10831 /* Consume the `default' token. */
10835 {
10839 }
10840 else
10845 /* Anything else must be an ordinary label. */
10850 }
10852 /* Require the `:' token. */
10855 /* An ordinary label may optionally be followed by attributes.
10856 However, this is only permitted if the attributes are then
10857 followed by a semicolon. This is because, for backward
10858 compatibility, when parsing
10859 lab: __attribute__ ((unused)) int i;
10860 we want the attribute to attach to "i", not "lab". */
10863 {
10864 tree attrs;
10871 ;
10872 else
10874 }
10880 }
10882 /* Parse an expression-statement.
10884 expression-statement:
10885 expression [opt] ;
10887 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10888 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10889 indicates whether this expression-statement is part of an
10890 expression statement. */
10892 static tree
10894 {
10899 /* There might be attribute fallthrough. */
10902 /* If the next token is a ';', then there is no expression
10903 statement. */
10905 {
10909 {
10912 }
10913 }
10915 /* Handle [[fallthrough]];. */
10917 {
10918 /* The next token after the fallthrough attribute is ';'. */
10920 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10923 else
10927 }
10929 /* Allow "[[fallthrough]];", but warn otherwise. */
10934 /* Give a helpful message for "A<T>::type t;" and the like. */
10937 {
10944 {
10945 /* A::A a; */
10950 }
10951 }
10953 /* Consume the final `;'. */
10958 /* This is the final expression statement of a statement
10959 expression. */
10965 }
10967 /* Parse a compound-statement.
10969 compound-statement:
10970 { statement-seq [opt] }
10972 GNU extension:
10974 compound-statement:
10975 { label-declaration-seq [opt] statement-seq [opt] }
10977 label-declaration-seq:
10978 label-declaration
10979 label-declaration-seq label-declaration
10981 Returns a tree representing the statement. */
10983 static tree
10986 {
10987 tree compound_stmt;
10989 /* Consume the `{'. */
10996 /* Begin the compound-statement. */
10998 /* If the next keyword is `__label__' we have a label declaration. */
11001 /* Parse an (optional) statement-seq. */
11003 /* Finish the compound-statement. */
11005 /* Consume the `}'. */
11009 }
11011 /* Parse an (optional) statement-seq.
11013 statement-seq:
11014 statement
11015 statement-seq [opt] statement */
11017 static void
11019 {
11020 /* Scan statements until there aren't any more. */
11022 {
11025 /* If we are looking at a `}', then we have run out of
11026 statements; the same is true if we have reached the end
11027 of file, or have stumbled upon a stray '@end'. */
11034 /* If we are in a compound statement and find 'else' then
11035 something went wrong. */
11037 {
11040 else
11041 {
11044 }
11045 }
11047 /* Parse the statement. */
11049 }
11050 }
11052 /* Return true if we're looking at (init; cond), false otherwise. */
11054 static bool
11056 {
11057 /* Save tokens so that we can put them back. */
11060 /* Look for ';' that is not nested in () or {}. */
11063 CPP_SEMICOLON,
11066 /* Roll back the tokens we skipped. */
11070 }
11072 /* Parse a selection-statement.
11074 selection-statement:
11075 if ( init-statement [opt] condition ) statement
11076 if ( init-statement [opt] condition ) statement else statement
11077 switch ( init-statement [opt] condition ) statement
11079 Returns the new IF_STMT or SWITCH_STMT.
11081 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11082 is a (possibly labeled) if statement which is not enclosed in
11083 braces and has an else clause. This is used to implement
11084 -Wparentheses.
11086 CHAIN is a vector of if-else-if conditions. This is used to implement
11087 -Wduplicated-cond. */
11089 static tree
11092 {
11095 token_indent_info guard_tinfo;
11100 /* Peek at the next token. */
11104 /* See what kind of keyword it is. */
11107 {
11110 {
11111 tree statement;
11112 tree condition;
11117 RID_CONSTEXPR))
11118 {
11124 }
11126 /* Look for the `('. */
11128 {
11131 }
11133 /* Begin the selection-statement. */
11135 {
11138 }
11139 else
11142 /* Parse the optional init-statement. */
11144 {
11145 tree decl;
11148 "init-statement in selection statements only available "
11151 }
11153 /* Parse the condition. */
11155 /* Look for the `)'. */
11161 {
11165 /* Add the condition. */
11172 /* Parse the then-clause. */
11176 /* Outside a template, the non-selected branch of a constexpr
11177 if is a 'discarded statement', i.e. unevaluated. */
11182 {
11185 }
11188 guard_tinfo);
11195 {
11199 }
11201 /* If the next token is `else', parse the else-clause. */
11203 RID_ELSE))
11204 {
11208 {
11211 }
11213 guard_tinfo
11215 /* Consume the `else' keyword. */
11218 {
11220 RID_IF)
11222 {
11223 /* We've got "if (COND) else if (COND2)". Start
11224 the condition chain and add COND as the first
11225 element. */
11229 {
11230 /* Wrap it in a NOP_EXPR so that we can set the
11231 location of the condition. */
11233 condition);
11236 }
11237 }
11239 RID_IF))
11240 {
11241 /* This is if-else without subsequent if. Zap the
11242 condition chain; we would have already warned at
11243 this point. */
11246 }
11247 }
11249 /* Parse the else-clause. */
11255 /* If we are currently parsing a then-clause, then
11256 IF_P will not be NULL. We set it to true to
11257 indicate that this if statement has an else clause.
11258 This may trigger the Wparentheses warning below
11259 when we get back up to the parent if statement. */
11264 {
11268 }
11269 }
11270 else
11271 {
11272 /* This if statement does not have an else clause. If
11273 NESTED_IF is true, then the then-clause has an if
11274 statement which does have an else clause. We warn
11275 about the potential ambiguity. */
11278 "suggest explicit braces to avoid ambiguous"
11281 {
11282 /* We don't need the condition chain anymore. */
11285 }
11286 }
11288 /* Now we're all done with the if-statement. */
11290 }
11291 else
11292 {
11296 /* Add the condition. */
11299 /* Parse the body of the switch-statement. */
11305 guard_tinfo);
11309 /* Now we're all done with the switch-statement. */
11311 }
11314 }
11320 }
11321 }
11323 /* Parse a condition.
11325 condition:
11326 expression
11327 type-specifier-seq declarator = initializer-clause
11328 type-specifier-seq declarator braced-init-list
11330 GNU Extension:
11332 condition:
11333 type-specifier-seq declarator asm-specification [opt]
11334 attributes [opt] = assignment-expression
11336 Returns the expression that should be tested. */
11338 static tree
11340 {
11341 cp_decl_specifier_seq type_specifiers;
11345 /* Try the declaration first. */
11347 /* New types are not allowed in the type-specifier-seq for a
11348 condition. */
11350 parser->type_definition_forbidden_message
11352 /* Parse the type-specifier-seq. */
11354 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11357 /* Restore the saved message. */
11359 /* If all is well, we might be looking at a declaration. */
11361 {
11362 tree decl;
11363 tree asm_specification;
11364 tree attributes;
11368 /* Parse the declarator. */
11374 /* Parse the attributes. */
11376 /* Parse the asm-specification. */
11378 /* If the next token is not an `=' or '{', then we might still be
11379 looking at an expression. For example:
11381 if (A(a).x)
11383 looks like a decl-specifier-seq and a declarator -- but then
11384 there is no `=', so this is an expression. */
11389 /* If we did see an `=' or '{', then we are looking at a declaration
11390 for sure. */
11392 {
11393 tree pushed_scope;
11397 /* Create the declaration. */
11403 /* Parse the initializer. */
11405 {
11409 }
11410 else
11411 {
11412 /* Consume the `='. */
11415 }
11419 /* Process the initializer. */
11422 asm_specification,
11423 flags);
11429 }
11430 }
11431 /* If we didn't even get past the declarator successfully, we are
11432 definitely not looking at a declaration. */
11433 else
11436 /* Otherwise, we are looking at an expression. */
11438 }
11440 /* Parses a for-statement or range-for-statement until the closing ')',
11441 not included. */
11443 static tree
11445 {
11449 /* Begin the for-statement. */
11452 /* Parse the initialization. */
11457 else
11459 }
11461 static tree
11463 {
11464 /* Normal for loop */
11467 tree stmt;
11470 /* The init-statement has already been parsed in
11471 cp_parser_init_statement, so no work is needed here. */
11474 /* If there's a condition, process it. */
11478 {
11482 }
11484 /* Look for the `;'. */
11487 /* If there's an expression, process it. */
11493 }
11495 /* Tries to parse a range-based for-statement:
11497 range-based-for:
11498 decl-specifier-seq declarator : expression
11500 The decl-specifier-seq declarator and the `:' are already parsed by
11501 cp_parser_init_statement. If processing_template_decl it returns a
11502 newly created RANGE_FOR_STMT; if not, it is converted to a
11503 regular FOR_STMT. */
11505 static tree
11508 {
11515 /* Get the range declaration momentarily out of the way so that
11516 the range expression doesn't clash with it. */
11518 {
11520 {
11522 /* For decomposition declaration get all of the corresponding
11523 declarations out of the way. */
11527 {
11533 {
11539 }
11540 }
11541 }
11543 {
11548 }
11549 }
11552 {
11555 }
11556 else
11559 /* Put the range declaration(s) back into scope. */
11561 {
11565 }
11567 /* If in template, STMT is converted to a normal for-statement
11568 at instantiation. If not, it is done just ahead. */
11570 {
11578 /* do_auto_deduction doesn't mess with template init-lists. */
11581 }
11582 else
11583 {
11587 }
11589 }
11591 /* Subroutine of cp_convert_range_for: given the initializer expression,
11592 builds up the range temporary. */
11594 static tree
11596 {
11599 /* Find out the type deduced by the declaration
11600 `auto &&__range = range_expr'. */
11605 /* Create the __range variable. */
11612 }
11614 /* Used by cp_parser_range_for in template context: we aren't going to
11615 do a full conversion yet, but we still need to resolve auto in the
11616 type of the for-range-declaration if present. This is basically
11617 a shortcut version of cp_convert_range_for. */
11619 static void
11621 {
11624 {
11627 iter_type = (cp_parser_perform_range_for_lookup
11630 {
11632 iter_type);
11634 tf_warning_or_error);
11637 }
11638 }
11639 }
11641 /* Converts a range-based for-statement into a normal
11642 for-statement, as per the definition.
11644 for (RANGE_DECL : RANGE_EXPR)
11645 BLOCK
11647 should be equivalent to:
11649 {
11650 auto &&__range = RANGE_EXPR;
11651 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11652 __begin != __end;
11653 ++__begin)
11654 {
11655 RANGE_DECL = *__begin;
11656 BLOCK
11657 }
11658 }
11660 If RANGE_EXPR is an array:
11661 BEGIN_EXPR = __range
11662 END_EXPR = __range + ARRAY_SIZE(__range)
11663 Else if RANGE_EXPR has a member 'begin' or 'end':
11664 BEGIN_EXPR = __range.begin()
11665 END_EXPR = __range.end()
11666 Else:
11667 BEGIN_EXPR = begin(__range)
11668 END_EXPR = end(__range);
11670 If __range has a member 'begin' but not 'end', or vice versa, we must
11671 still use the second alternative (it will surely fail, however).
11672 When calling begin()/end() in the third alternative we must use
11673 argument dependent lookup, but always considering 'std' as an associated
11674 namespace. */
11676 tree
11680 {
11686 /* If an error happened previously do nothing or else a lot of
11687 unhelpful errors would be issued. */
11689 else
11690 {
11691 tree range_temp;
11695 /* Can't bind a reference to an array of runtime bound. */
11697 else
11698 {
11703 LOOKUP_ONLYCONVERTING);
11705 }
11708 }
11710 /* The new for initialization statement. */
11718 LOOKUP_ONLYCONVERTING);
11729 LOOKUP_ONLYCONVERTING);
11733 /* The new for condition. */
11740 /* The new increment expression. */
11743 tf_warning_or_error);
11746 /* The declaration is initialized with *__begin inside the loop body. */
11749 tf_warning_or_error),
11751 LOOKUP_ONLYCONVERTING);
11756 }
11758 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11759 We need to solve both at the same time because the method used
11760 depends on the existence of members begin or end.
11761 Returns the type deduced for the iterator expression. */
11763 static tree
11765 {
11767 {
11770 }
11773 {
11778 }
11780 {
11781 /* If RANGE is an array, we will use pointer arithmetic. */
11784 range,
11788 }
11789 else
11790 {
11791 /* If it is not an array, we must do a bit of magic. */
11801 tf_warning_or_error);
11804 tf_warning_or_error);
11807 {
11808 /* Use the member functions. */
11811 else
11817 else
11820 }
11821 else
11822 {
11823 /* Use global functions with ADL. */
11830 tf_warning_or_error);
11832 tf_warning_or_error);
11834 tf_warning_or_error);
11836 tf_warning_or_error);
11839 }
11841 /* Last common checks. */
11843 {
11844 /* If one of the expressions is an error do no more checks. */
11847 }
11850 /* Can happen, when, eg, in a template context, Koenig lookup
11851 can't resolve begin/end (c++/58503). */
11853 else
11854 {
11856 /* The unqualified type of the __begin and __end temporaries should
11857 be the same, as required by the multiple auto declaration. */
11859 {
11866 /* P0184R0 allows __begin and __end to have different types,
11867 but make sure they are comparable so we can give a better
11869 else
11873 }
11875 }
11876 }
11877 }
11879 /* Helper function for cp_parser_perform_range_for_lookup.
11880 Builds a tree for RANGE.IDENTIFIER(). */
11882 static tree
11884 {
11897 tf_warning_or_error);
11900 }
11902 /* Parse an iteration-statement.
11904 iteration-statement:
11905 while ( condition ) statement
11906 do statement while ( expression ) ;
11907 for ( init-statement condition [opt] ; expression [opt] )
11908 statement
11910 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11912 static tree
11914 {
11917 tree statement;
11919 token_indent_info guard_tinfo;
11921 /* Peek at the next token. */
11928 /* Remember whether or not we are already within an iteration
11929 statement. */
11932 /* See what kind of keyword it is. */
11935 {
11937 {
11938 tree condition;
11940 /* Begin the while-statement. */
11942 /* Look for the `('. */
11944 /* Parse the condition. */
11947 /* Look for the `)'. */
11949 /* Parse the dependent statement. */
11953 /* We're done with the while-statement. */
11955 }
11959 {
11960 tree expression;
11962 /* Begin the do-statement. */
11964 /* Parse the body of the do-statement. */
11969 /* Look for the `while' keyword. */
11971 /* Look for the `('. */
11973 /* Parse the expression. */
11975 /* We're done with the do-statement. */
11977 /* Look for the `)'. */
11979 /* Look for the `;'. */
11981 }
11985 {
11986 /* Look for the `('. */
11991 /* Look for the `)'. */
11994 /* Parse the body of the for-statement. */
11999 /* We're done with the for-statement. */
12001 }
12008 }
12011 }
12013 /* Parse a init-statement or the declarator of a range-based-for.
12014 Returns true if a range-based-for declaration is seen.
12016 init-statement:
12017 expression-statement
12018 simple-declaration */
12020 static bool
12022 {
12023 /* If the next token is a `;', then we have an empty
12024 expression-statement. Grammatically, this is also a
12025 simple-declaration, but an invalid one, because it does not
12026 declare anything. Therefore, if we did not handle this case
12027 specially, we would issue an error message about an invalid
12028 declaration. */
12030 {
12034 /* A colon is used in range-based for. */
12037 /* We're going to speculatively look for a declaration, falling back
12038 to an expression, if necessary. */
12040 /* Parse the declaration. */
12043 decl);
12046 {
12047 /* It is a range-for, consume the ':' */
12051 {
12053 "range-based %<for%> loops only available with "
12056 }
12057 }
12058 else
12059 /* The ';' is not consumed yet because we told
12060 cp_parser_simple_declaration not to. */
12065 /* If the tentative parse failed, then we shall need to look for an
12066 expression-statement. */
12067 }
12068 /* If we are here, it is an expression-statement. */
12071 }
12073 /* Parse a jump-statement.
12075 jump-statement:
12076 break ;
12077 continue ;
12078 return expression [opt] ;
12079 return braced-init-list ;
12080 goto identifier ;
12082 GNU extension:
12084 jump-statement:
12085 goto * expression ;
12087 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12089 static tree
12091 {
12097 /* Peek at the next token. */
12102 /* See what kind of keyword it is. */
12105 {
12109 {
12129 }
12135 {
12142 /* Fall through. */
12152 }
12157 {
12158 tree expr;
12162 {
12166 }
12169 else
12170 /* If the next token is a `;', then there is no
12171 expression. */
12173 /* Build the return-statement. */
12176 else
12178 /* Look for the final `;'. */
12180 }
12186 {
12189 }
12191 /* Create the goto-statement. */
12193 {
12194 /* Issue a warning about this use of a GNU extension. */
12196 /* Consume the '*' token. */
12198 /* Parse the dependent expression. */
12200 }
12201 else
12203 /* Look for the final `;'. */
12210 }
12213 }
12215 /* Parse a declaration-statement.
12217 declaration-statement:
12218 block-declaration */
12220 static void
12222 {
12225 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12228 /* Parse the block-declaration. */
12231 /* Free any declarators allocated. */
12233 }
12235 /* Some dependent statements (like `if (cond) statement'), are
12236 implicitly in their own scope. In other words, if the statement is
12237 a single statement (as opposed to a compound-statement), it is
12238 none-the-less treated as if it were enclosed in braces. Any
12239 declarations appearing in the dependent statement are out of scope
12240 after control passes that point. This function parses a statement,
12241 but ensures that is in its own scope, even if it is not a
12242 compound-statement.
12244 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12245 is a (possibly labeled) if statement which is not enclosed in
12246 braces and has an else clause. This is used to implement
12247 -Wparentheses.
12249 CHAIN is a vector of if-else-if conditions. This is used to implement
12250 -Wduplicated-cond.
12252 Returns the new statement. */
12254 static tree
12258 {
12259 tree statement;
12261 token_indent_info body_tinfo
12267 /* Mark if () ; with a special NOP_EXPR. */
12269 {
12280 }
12281 /* if a compound is opened, we simply parse the statement directly. */
12284 /* If the token is not a `{', then we must take special action. */
12285 else
12286 {
12287 /* Create a compound-statement. */
12289 /* Parse the dependent-statement. */
12291 /* Finish the dummy compound-statement. */
12293 }
12295 token_indent_info next_tinfo
12299 /* Return the statement. */
12301 }
12303 /* For some dependent statements (like `while (cond) statement'), we
12304 have already created a scope. Therefore, even if the dependent
12305 statement is a compound-statement, we do not want to create another
12306 scope. */
12308 static void
12311 {
12312 /* If the token is a `{', then we must take special action. */
12314 {
12315 token_indent_info body_tinfo
12319 token_indent_info next_tinfo
12322 }
12323 else
12324 {
12325 /* Avoid calling cp_parser_compound_statement, so that we
12326 don't create a new scope. Do everything else by hand. */
12328 /* If the next keyword is `__label__' we have a label declaration. */
12331 /* Parse an (optional) statement-seq. */
12334 }
12335 }
12337 /* Declarations [gram.dcl.dcl] */
12339 /* Parse an optional declaration-sequence.
12341 declaration-seq:
12342 declaration
12343 declaration-seq declaration */
12345 static void
12347 {
12349 {
12360 {
12361 /* A declaration consisting of a single semicolon is
12362 invalid. Allow it unless we're being pedantic. */
12367 }
12369 /* If we're entering or exiting a region that's implicitly
12370 extern "C", modify the lang context appropriately. */
12372 {
12375 }
12377 {
12380 }
12383 {
12384 /* A top-level declaration can consist solely of a #pragma.
12385 A nested declaration cannot, so this is done here and not
12386 in cp_parser_declaration. (A #pragma at block scope is
12387 handled in cp_parser_statement.) */
12390 }
12392 /* Parse the declaration itself. */
12394 }
12395 }
12397 /* Parse a declaration.
12399 declaration:
12400 block-declaration
12401 function-definition
12402 template-declaration
12403 explicit-instantiation
12404 explicit-specialization
12405 linkage-specification
12406 namespace-definition
12408 C++17:
12409 deduction-guide
12411 GNU extension:
12413 declaration:
12414 __extension__ declaration */
12416 static void
12418 {
12419 cp_token token1;
12420 cp_token token2;
12425 /* Check for the `__extension__' keyword. */
12427 {
12428 /* Parse the qualified declaration. */
12430 /* Restore the PEDANTIC flag. */
12434 }
12436 /* Try to figure out what kind of declaration is present. */
12441 else
12442 {
12445 }
12447 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12450 /* If the next token is `extern' and the following token is a string
12451 literal, then we have a linkage specification. */
12455 /* If the next token is `template', then we have either a template
12456 declaration, an explicit instantiation, or an explicit
12457 specialization. */
12459 {
12460 /* `template <>' indicates a template specialization. */
12464 /* `template <' indicates a template declaration. */
12467 /* Anything else must be an explicit instantiation. */
12468 else
12470 }
12471 /* If the next token is `export', then we have a template
12472 declaration. */
12475 /* If the next token is `extern', 'static' or 'inline' and the one
12476 after that is `template', we have a GNU extended explicit
12477 instantiation directive. */
12484 /* If the next token is `namespace', check for a named or unnamed
12485 namespace definition. */
12494 /* An unnamed namespace definition. */
12498 /* An inline (associated) namespace definition. */
12502 /* Objective-C++ declaration/definition. */
12509 /* At this point we may have a template declared by a concept
12510 introduction. */
12515 else
12516 /* Try to parse a block-declaration, or a function-definition. */
12519 /* Free any declarators allocated. */
12521 }
12523 /* Parse a block-declaration.
12525 block-declaration:
12526 simple-declaration
12527 asm-definition
12528 namespace-alias-definition
12529 using-declaration
12530 using-directive
12532 GNU Extension:
12534 block-declaration:
12535 __extension__ block-declaration
12537 C++0x Extension:
12539 block-declaration:
12540 static_assert-declaration
12542 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12543 part of a declaration-statement. */
12545 static void
12548 {
12552 /* Check for the `__extension__' keyword. */
12554 {
12555 /* Parse the qualified declaration. */
12557 /* Restore the PEDANTIC flag. */
12561 }
12563 /* Peek at the next token to figure out which kind of declaration is
12564 present. */
12567 /* If the next keyword is `asm', we have an asm-definition. */
12569 {
12573 }
12574 /* If the next keyword is `namespace', we have a
12575 namespace-alias-definition. */
12578 /* If the next keyword is `using', we have a
12579 using-declaration, a using-directive, or an alias-declaration. */
12581 {
12586 /* If the token after `using' is `namespace', then we have a
12587 using-directive. */
12591 /* If the second token after 'using' is '=', then we have an
12592 alias-declaration. */
12598 /* Otherwise, it's a using-declaration. */
12599 else
12602 }
12603 /* If the next keyword is `__label__' we have a misplaced label
12604 declaration. */
12606 {
12610 /* If the next token is now a `;', consume it. */
12613 }
12614 /* If the next token is `static_assert' we have a static assertion. */
12617 /* Anything else must be a simple-declaration. */
12618 else
12621 }
12623 /* Parse a simple-declaration.
12625 simple-declaration:
12626 decl-specifier-seq [opt] init-declarator-list [opt] ;
12627 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12628 brace-or-equal-initializer ;
12630 init-declarator-list:
12631 init-declarator
12632 init-declarator-list , init-declarator
12634 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12635 function-definition as a simple-declaration.
12637 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12638 parsed declaration if it is an uninitialized single declarator not followed
12639 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12640 if present, will not be consumed. */
12642 static void
12646 {
12647 cp_decl_specifier_seq decl_specifiers;
12656 /* Defer access checks until we know what is being declared; the
12657 checks for names appearing in the decl-specifier-seq should be
12658 done as if we were in the scope of the thing being declared. */
12661 /* Parse the decl-specifier-seq. We have to keep track of whether
12662 or not the decl-specifier-seq declares a named class or
12663 enumeration type, since that is the only case in which the
12664 init-declarator-list is allowed to be empty.
12666 [dcl.dcl]
12668 In a simple-declaration, the optional init-declarator-list can be
12669 omitted only when declaring a class or enumeration, that is when
12670 the decl-specifier-seq contains either a class-specifier, an
12671 elaborated-type-specifier, or an enum-specifier. */
12673 CP_PARSER_FLAGS_OPTIONAL,
12676 /* We no longer need to defer access checks. */
12679 /* In a block scope, a valid declaration must always have a
12680 decl-specifier-seq. By not trying to parse declarators, we can
12681 resolve the declaration/expression ambiguity more quickly. */
12684 {
12687 }
12689 /* If the next two tokens are both identifiers, the code is
12690 erroneous. The usual cause of this situation is code like:
12692 T t;
12694 where "T" should name a type -- but does not. */
12697 {
12698 /* If parsing tentatively, we should commit; we really are
12699 looking at a declaration. */
12701 /* Give up. */
12703 }
12705 /* If we have seen at least one decl-specifier, and the next token
12706 is not a parenthesis, then we must be looking at a declaration.
12707 (After "int (" we might be looking at a functional cast.) */
12714 /* Look for C++17 decomposition declaration. */
12722 {
12723 tree decl
12725 maybe_range_for_decl,
12728 /* The next token should be either a `,' or a `;'. */
12730 /* If it's a `;', we are done. */
12733 /* Anything else is an error. */
12734 else
12735 {
12736 /* If we have already issued an error message we don't need
12737 to issue another one. */
12742 /* Skip tokens until we reach the end of the statement. */
12744 /* If the next token is now a `;', consume it. */
12748 }
12749 }
12750 else
12753 tree last_type;
12755 /* NULL_TREE if both variable and function declaration are allowed,
12756 error_mark_node if function declaration are not allowed and
12757 a FUNCTION_DECL that should be diagnosed if it is followed by
12758 variable declarations. */
12759 tree auto_function_declaration;
12762 auto_specifier_p
12766 /* Keep going until we hit the `;' at the end of the simple
12767 declaration. */
12770 CPP_SEMICOLON))
12771 {
12774 tree decl;
12778 {
12779 /* If we are processing next declarator, comma is expected */
12784 {
12788 }
12789 }
12790 else
12793 /* Parse the init-declarator. */
12796 function_definition_allowed_p,
12798 declares_class_or_enum,
12800 maybe_range_for_decl,
12803 /* If an error occurred while parsing tentatively, exit quickly.
12804 (That usually happens when in the body of a function; each
12805 statement is treated as a declaration-statement until proven
12806 otherwise.) */
12811 {
12812 /* If the init-declarator-list contains more than one
12813 init-declarator, they shall all form declarations of
12814 variables. */
12816 auto_function_declaration
12820 {
12822 "non-variable %qD in declaration with more than one "
12827 }
12828 }
12832 {
12836 {
12837 /* If the list of declarators contains more than one declarator,
12838 the type of each declared variable is determined as described
12839 above. If the type deduced for the template parameter U is not
12840 the same in each deduction, the program is ill-formed. */
12845 }
12846 else
12848 }
12850 /* Handle function definitions specially. */
12852 {
12853 /* If the next token is a `,', then we are probably
12854 processing something like:
12856 void f() {}, *p;
12858 which is erroneous. */
12860 {
12863 "mixing"
12865 }
12866 /* Otherwise, we're done with the list of declarators. */
12867 else
12868 {
12871 }
12872 }
12875 /* The next token should be either a `,' or a `;'. */
12877 /* If it's a `,', there are more declarators to come. */
12880 /* If it's a `;', we are done. */
12884 {
12889 }
12890 /* Anything else is an error. */
12891 else
12892 {
12893 /* If we have already issued an error message we don't need
12894 to issue another one. */
12899 /* Skip tokens until we reach the end of the statement. */
12901 /* If the next token is now a `;', consume it. */
12905 }
12906 /* After the first time around, a function-definition is not
12907 allowed -- even if it was OK at first. For example:
12909 int i, f() {}
12911 is not valid. */
12913 }
12915 /* Issue an error message if no declarators are present, and the
12916 decl-specifier-seq does not itself declare a class or
12917 enumeration: [dcl.dcl]/3. */
12919 {
12921 {
12925 /* Ensure an error is issued anyway when finish_decltype_type,
12926 called via cp_parser_decl_specifier_seq, returns a class or
12927 an enumeration (c++/51786). */
12930 }
12931 /* Perform any deferred access checks. */
12933 }
12935 /* Consume the `;'. */
12936 finish:
12940 {
12946 }
12948 done:
12950 }
12952 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
12953 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12954 initializer ; */
12956 static tree
12961 {
12966 /* Parse the identifier-list. */
12970 {
12978 }
12982 {
12988 else
12989 {
12992 }
12993 }
12999 tree pushed_scope;
13006 NULL_TREE);
13013 cp_expr e;
13014 cp_decl_specifier_seq decl_specs;
13019 {
13022 else
13025 tree elt_pushed_scope;
13031 {
13032 /* Ensure we've diagnosed redeclaration if we aren't creating
13033 a new VAR_DECL. */
13036 }
13037 else
13041 }
13044 {
13047 }
13051 {
13058 {
13062 }
13063 }
13065 {
13067 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13068 the underlying DECL. */
13070 }
13076 {
13079 }
13082 }
13084 /* Parse a decl-specifier-seq.
13086 decl-specifier-seq:
13087 decl-specifier-seq [opt] decl-specifier
13088 decl-specifier attribute-specifier-seq [opt] (C++11)
13090 decl-specifier:
13091 storage-class-specifier
13092 type-specifier
13093 function-specifier
13094 friend
13095 typedef
13097 GNU Extension:
13099 decl-specifier:
13100 attributes
13102 Concepts Extension:
13104 decl-specifier:
13105 concept
13107 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13109 The parser flags FLAGS is used to control type-specifier parsing.
13111 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13112 flags:
13114 1: one of the decl-specifiers is an elaborated-type-specifier
13115 (i.e., a type declaration)
13116 2: one of the decl-specifiers is an enum-specifier or a
13117 class-specifier (i.e., a type definition)
13119 */
13121 static void
13123 cp_parser_flags flags,
13126 {
13130 cp_decl_spec ds;
13132 /* Clear DECL_SPECS. */
13135 /* Assume no class or enumeration type is declared. */
13138 /* Keep reading specifiers until there are no more to read. */
13140 {
13145 /* Peek at the next token. */
13148 /* Save the first token of the decl spec list for error
13149 reporting. */
13152 /* Handle attributes. */
13154 {
13155 /* Parse the attributes. */
13158 /* In a sequence of declaration specifiers, c++11 attributes
13159 appertain to the type that precede them. In that case
13160 [dcl.spec]/1 says:
13162 The attribute-specifier-seq affects the type only for
13163 the declaration it appears in, not other declarations
13164 involving the same type.
13166 But for now let's force the user to position the
13167 attribute either at the beginning of the declaration or
13168 after the declarator-id, which would clearly mean that it
13169 applies to the declarator. */
13171 {
13173 /* The c++11 attribute is at the beginning of the
13174 declaration. It appertains to the entity being
13176 else
13177 {
13179 {
13180 /* This is an attribute following a
13181 class-specifier. */
13186 }
13187 else
13188 {
13189 decl_specs->std_attributes
13191 attrs);
13194 }
13196 }
13197 }
13199 decl_specs->attributes
13201 attrs);
13205 }
13206 /* Assume we will find a decl-specifier keyword. */
13208 /* If the next token is an appropriate keyword, we can simply
13209 add it to the list. */
13211 {
13212 /* decl-specifier:
13213 friend
13214 constexpr */
13217 {
13220 }
13221 else
13222 {
13224 /* Consume the token. */
13226 }
13239 /* function-specifier:
13240 inline
13241 virtual
13242 explicit */
13249 /* decl-specifier:
13250 typedef */
13253 /* Consume the token. */
13255 /* A constructor declarator cannot appear in a typedef. */
13257 /* The "typedef" keyword can only occur in a declaration; we
13258 may as well commit at this point. */
13265 /* storage-class-specifier:
13266 auto
13267 register
13268 static
13269 extern
13270 mutable
13272 GNU Extension:
13273 thread */
13276 {
13277 /* Consume the token. */
13280 /* Complain about `auto' as a storage specifier, if
13281 we're complaining about C++0x compatibility. */
13285 /* Set the storage class anyway. */
13287 token);
13288 }
13289 else
13290 /* C++0x auto type-specifier. */
13298 /* Consume the token. */
13301 token);
13304 /* Consume the token. */
13310 /* We did not yet find a decl-specifier yet. */
13313 }
13330 /* Constructors are a special case. The `S' in `S()' is not a
13331 decl-specifier; it is the beginning of the declarator. */
13332 constructor_p
13333 = (!found_decl_spec
13334 && constructor_possible_p
13335 && (cp_parser_constructor_declarator_p
13338 /* If we don't have a DECL_SPEC yet, then we must be looking at
13339 a type-specifier. */
13341 {
13344 tree type_spec;
13346 type_spec
13348 decl_specs,
13354 /* If this type-specifier referenced a user-defined type
13355 (a typedef, class-name, etc.), then we can't allow any
13356 more such type-specifiers henceforth.
13358 [dcl.spec]
13360 The longest sequence of decl-specifiers that could
13361 possibly be a type name is taken as the
13362 decl-specifier-seq of a declaration. The sequence shall
13363 be self-consistent as described below.
13365 [dcl.type]
13367 As a general rule, at most one type-specifier is allowed
13368 in the complete decl-specifier-seq of a declaration. The
13369 only exceptions are the following:
13371 -- const or volatile can be combined with any other
13372 type-specifier.
13374 -- signed or unsigned can be combined with char, long,
13375 short, or int.
13377 -- ..
13379 Example:
13381 typedef char* Pc;
13382 void g (const int Pc);
13384 Here, Pc is *not* part of the decl-specifier seq; it's
13385 the declarator. Therefore, once we see a type-specifier
13386 (other than a cv-qualifier), we forbid any additional
13387 user-defined types. We *do* still allow things like `int
13388 int' to be considered a decl-specifier-seq, and issue the
13389 error message later. */
13392 /* A constructor declarator cannot follow a type-specifier. */
13394 {
13399 }
13400 }
13402 /* If we still do not have a DECL_SPEC, then there are no more
13403 decl-specifiers. */
13408 /* After we see one decl-specifier, further decl-specifiers are
13409 always optional. */
13411 }
13413 /* Don't allow a friend specifier with a class definition. */
13418 }
13420 /* Parse an (optional) storage-class-specifier.
13422 storage-class-specifier:
13423 auto
13424 register
13425 static
13426 extern
13427 mutable
13429 GNU Extension:
13431 storage-class-specifier:
13432 thread
13434 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13436 static tree
13438 {
13440 {
13444 /* Fall through for C++98. */
13452 /* Consume the token. */
13457 }
13458 }
13460 /* Parse an (optional) function-specifier.
13462 function-specifier:
13463 inline
13464 virtual
13465 explicit
13467 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13468 Updates DECL_SPECS, if it is non-NULL. */
13470 static tree
13473 {
13476 {
13482 /* 14.5.2.3 [temp.mem]
13484 A member function template shall not be virtual. */
13488 else
13498 }
13500 /* Consume the token. */
13502 }
13504 /* Parse a linkage-specification.
13506 linkage-specification:
13507 extern string-literal { declaration-seq [opt] }
13508 extern string-literal declaration */
13510 static void
13512 {
13513 tree linkage;
13515 /* Look for the `extern' keyword. */
13518 /* Look for the string-literal. */
13521 /* Transform the literal into an identifier. If the literal is a
13522 wide-character string, or contains embedded NULs, then we can't
13523 handle it as the user wants. */
13526 {
13528 /* Assume C++ linkage. */
13530 }
13531 else
13534 /* We're now using the new linkage. */
13537 /* If the next token is a `{', then we're using the first
13538 production. */
13540 {
13544 /* Consume the `{' token. */
13546 /* Parse the declarations. */
13548 /* Look for the closing `}'. */
13550 }
13551 /* Otherwise, there's just one declaration. */
13552 else
13553 {
13556 saved_in_unbraced_linkage_specification_p
13560 parser->in_unbraced_linkage_specification_p
13562 }
13564 /* We're done with the linkage-specification. */
13566 }
13568 /* Parse a static_assert-declaration.
13570 static_assert-declaration:
13571 static_assert ( constant-expression , string-literal ) ;
13572 static_assert ( constant-expression ) ; (C++1Z)
13574 If MEMBER_P, this static_assert is a class member. */
13576 static void
13578 {
13579 tree condition;
13580 tree message;
13582 location_t saved_loc;
13585 /* Peek at the `static_assert' token so we can keep track of exactly
13586 where the static assertion started. */
13590 /* Look for the `static_assert' keyword. */
13592 RT_STATIC_ASSERT))
13595 /* We know we are in a static assertion; commit to any tentative
13596 parse. */
13600 /* Parse the `(' starting the static assertion condition. */
13603 /* Parse the constant-expression. Allow a non-constant expression
13604 here in order to give better diagnostics in finish_static_assert. */
13605 condition =
13611 {
13614 "static_assert without a message "
13616 /* Eat the ')' */
13621 }
13622 else
13623 {
13624 /* Parse the separating `,'. */
13627 /* Parse the string-literal message. */
13632 /* A `)' completes the static assertion. */
13638 }
13640 /* A semicolon terminates the declaration. */
13643 /* Complete the static assertion, which may mean either processing
13644 the static assert now or saving it for template instantiation. */
13646 }
13648 /* Parse the expression in decltype ( expression ). */
13650 static tree
13653 {
13655 tree expr;
13657 /* Since we're going to preserve any side-effects from this parse, set up a
13658 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13659 in the expression. */
13662 /* First, try parsing an id-expression. */
13673 {
13676 cp_id_kind idk;
13680 /* Lookup the name we got back from the id-expression. */
13690 {
13691 /* Complete lookup of the id-expression. */
13692 expr = (finish_id_expression
13705 /* We found an id-expression, but it was something that we
13706 should not have found. This is an error, not something
13707 we can recover from, so note that we found an
13708 id-expression and we'll recover as gracefully as
13709 possible. */
13711 }
13716 /* We have an id-expression. */
13718 }
13721 {
13722 /* Abort the id-expression parse. */
13725 /* Parsing tentatively, again. */
13728 /* Parse a class member access. */
13736 /* We have an id-expression. */
13738 }
13741 /* We have parsed the complete id-expression or member access. */
13743 else
13744 {
13745 /* Abort our attempt to parse an id-expression or member access
13746 expression. */
13749 /* Parse a full expression. */
13752 }
13755 }
13757 /* Parse a `decltype' type. Returns the type.
13759 simple-type-specifier:
13760 decltype ( expression )
13761 C++14 proposal:
13762 decltype ( auto ) */
13764 static tree
13766 {
13767 tree expr;
13776 {
13777 /* Already parsed. */
13780 }
13782 /* Look for the `decltype' token. */
13786 /* Parse the opening `('. */
13790 /* decltype (auto) */
13793 {
13800 }
13802 /* Types cannot be defined in a `decltype' expression. Save away the
13803 old message. */
13806 /* And create the new one. */
13807 parser->type_definition_forbidden_message
13810 /* The restrictions on constant-expressions do not apply inside
13811 decltype expressions. */
13812 saved_integral_constant_expression_p
13814 saved_non_integral_constant_expression_p
13818 /* Within a parenthesized expression, a `>' token is always
13819 the greater-than operator. */
13820 saved_greater_than_is_operator_p
13824 /* Do not actually evaluate the expression. */
13827 /* Do not warn about problems with the expression. */
13832 /* Go back to evaluating expressions. */
13836 /* The `>' token might be the end of a template-id or
13837 template-parameter-list now. */
13838 parser->greater_than_is_operator_p
13841 /* Restore the old message and the integral constant expression
13842 flags. */
13844 parser->integral_constant_expression_p
13846 parser->non_integral_constant_expression_p
13849 /* Parse to the closing `)'. */
13851 {
13855 }
13858 tf_warning_or_error);
13860 rewrite:
13861 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13862 it again. */
13871 }
13873 /* Special member functions [gram.special] */
13875 /* Parse a conversion-function-id.
13877 conversion-function-id:
13878 operator conversion-type-id
13880 Returns an IDENTIFIER_NODE representing the operator. */
13882 static tree
13884 {
13885 tree type;
13886 tree saved_scope;
13887 tree saved_qualifying_scope;
13888 tree saved_object_scope;
13891 /* Look for the `operator' token. */
13894 /* When we parse the conversion-type-id, the current scope will be
13895 reset. However, we need that information in able to look up the
13896 conversion function later, so we save it here. */
13900 /* We must enter the scope of the class so that the names of
13901 entities declared within the class are available in the
13902 conversion-type-id. For example, consider:
13904 struct S {
13905 typedef int I;
13906 operator I();
13907 };
13909 S::operator I() { ... }
13911 In order to see that `I' is a type-name in the definition, we
13912 must be in the scope of `S'. */
13915 /* Parse the conversion-type-id. */
13917 /* Leave the scope of the class, if any. */
13920 /* Restore the saved scope. */
13924 /* If the TYPE is invalid, indicate failure. */
13928 }
13930 /* Parse a conversion-type-id:
13932 conversion-type-id:
13933 type-specifier-seq conversion-declarator [opt]
13935 Returns the TYPE specified. */
13937 static tree
13939 {
13940 tree attributes;
13941 cp_decl_specifier_seq type_specifiers;
13943 tree type_specified;
13946 /* Parse the attributes. */
13950 parser->type_definition_forbidden_message
13953 /* Parse the type-specifiers. */
13960 /* If that didn't work, stop. */
13963 /* Parse the conversion-declarator. */
13971 /* Don't give this error when parsing tentatively. This happens to
13972 work because we always parse this definitively once. */
13975 {
13977 {
13980 }
13984 }
13987 }
13989 /* Parse an (optional) conversion-declarator.
13991 conversion-declarator:
13992 ptr-operator conversion-declarator [opt]
13994 */
13998 {
14001 cp_cv_quals cv_quals;
14003 /* We don't know if there's a ptr-operator next, or not. */
14005 /* Try the ptr-operator. */
14008 /* If it worked, look for more conversion-declarators. */
14010 {
14013 /* Parse another optional declarator. */
14016 declarator = cp_parser_make_indirect_declarator
14020 }
14023 }
14025 /* Parse an (optional) ctor-initializer.
14027 ctor-initializer:
14028 : mem-initializer-list
14030 Returns TRUE iff the ctor-initializer was actually present. */
14032 static bool
14034 {
14035 /* If the next token is not a `:', then there is no
14036 ctor-initializer. */
14038 {
14039 /* Do default initialization of any bases and members. */
14044 }
14046 /* Consume the `:' token. */
14048 /* And the mem-initializer-list. */
14052 }
14054 /* Parse a mem-initializer-list.
14056 mem-initializer-list:
14057 mem-initializer ... [opt]
14058 mem-initializer ... [opt] , mem-initializer-list */
14060 static void
14062 {
14067 /* Let the semantic analysis code know that we are starting the
14068 mem-initializer-list. */
14073 /* Loop through the list. */
14075 {
14076 tree mem_initializer;
14079 /* Parse the mem-initializer. */
14081 /* If the next token is a `...', we're expanding member initializers. */
14083 {
14084 /* Consume the `...'. */
14087 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14088 can be expanded but members cannot. */
14091 {
14096 }
14098 /* Construct the pack expansion type. */
14101 }
14104 {
14108 }
14109 /* Look for a target constructor. */
14113 {
14116 {
14120 }
14122 }
14123 /* Add it to the list, unless it was erroneous. */
14125 {
14128 }
14129 /* If the next token is not a `,', we're done. */
14132 /* Consume the `,' token. */
14134 }
14136 /* Perform semantic analysis. */
14139 }
14141 /* Parse a mem-initializer.
14143 mem-initializer:
14144 mem-initializer-id ( expression-list [opt] )
14145 mem-initializer-id braced-init-list
14147 GNU extension:
14149 mem-initializer:
14150 ( expression-list [opt] )
14152 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14153 class) or FIELD_DECL (for a non-static data member) to initialize;
14154 the TREE_VALUE is the expression-list. An empty initialization
14155 list is represented by void_list_node. */
14157 static tree
14159 {
14160 tree mem_initializer_id;
14161 tree expression_list;
14162 tree member;
14165 /* Find out what is being initialized. */
14167 {
14171 }
14172 else
14173 {
14177 }
14183 {
14190 }
14191 else
14192 {
14202 }
14212 }
14214 /* Parse a mem-initializer-id.
14216 mem-initializer-id:
14217 :: [opt] nested-name-specifier [opt] class-name
14218 decltype-specifier (C++11)
14219 identifier
14221 Returns a TYPE indicating the class to be initialized for the first
14222 production (and the second in C++11). Returns an IDENTIFIER_NODE
14223 indicating the data member to be initialized for the last production. */
14225 static tree
14227 {
14231 tree id;
14235 /* `typename' is not allowed in this context ([temp.res]). */
14237 {
14239 "keyword %<typename%> not allowed in this context (a qualified "
14242 }
14243 /* Look for the optional `::' operator. */
14244 global_scope_p
14248 /* Look for the optional nested-name-specifier. The simplest way to
14249 implement:
14251 [temp.res]
14253 The keyword `typename' is not permitted in a base-specifier or
14254 mem-initializer; in these contexts a qualified name that
14255 depends on a template-parameter is implicitly assumed to be a
14256 type name.
14258 is to assume that we have seen the `typename' keyword at this
14259 point. */
14260 nested_name_specifier_p
14269 /* If there is a `::' operator or a nested-name-specifier, then we
14270 are definitely looking for a class-name. */
14275 typename_type,
14279 /* Otherwise, we could also be looking for an ordinary identifier. */
14282 /* Try a decltype-specifier. */
14284 else
14285 /* Otherwise, try a class-name. */
14289 none_type,
14293 /* If we found one, we're done. */
14296 /* Otherwise, look for an ordinary identifier. */
14298 }
14300 /* Overloading [gram.over] */
14302 /* Parse an operator-function-id.
14304 operator-function-id:
14305 operator operator
14307 Returns an IDENTIFIER_NODE for the operator which is a
14308 human-readable spelling of the identifier, e.g., `operator +'. */
14310 static cp_expr
14312 {
14313 /* Look for the `operator' keyword. */
14316 /* And then the name of the operator itself. */
14318 }
14320 /* Return an identifier node for a user-defined literal operator.
14321 The suffix identifier is chained to the operator name identifier. */
14323 tree
14325 {
14326 tree identifier;
14333 }
14335 /* Parse an operator.
14337 operator:
14338 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14339 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14340 || ++ -- , ->* -> () []
14342 GNU Extensions:
14344 operator:
14345 <? >? <?= >?=
14347 Returns an IDENTIFIER_NODE for the operator which is a
14348 human-readable spelling of the identifier, e.g., `operator +'. */
14350 static cp_expr
14352 {
14357 /* Peek at the next token. */
14362 /* Figure out which operator we have. */
14364 {
14366 {
14369 /* The keyword should be either `new' or `delete'. */
14374 else
14377 /* Consume the `new' or `delete' token. */
14380 /* Peek at the next token. */
14382 /* If it's a `[' token then this is the array variant of the
14383 operator. */
14385 {
14386 /* Consume the `[' token. */
14388 /* Look for the `]' token. */
14394 }
14395 /* Otherwise, we have the non-array variant. */
14396 else
14402 }
14549 /* Consume the `('. */
14551 /* Look for the matching `)'. */
14556 /* Consume the `['. */
14558 /* Look for the matching `]'. */
14565 /* FALLTHRU */
14574 {
14581 /* Consume the string. */
14587 {
14590 }
14591 else
14592 {
14594 /* Look for the suffix identifier. */
14599 {
14603 }
14604 else
14605 {
14608 }
14609 }
14614 {
14617 }
14620 {
14623 }
14625 {
14628 }
14630 }
14633 /* Anything else is an error. */
14635 }
14637 /* If we have selected an identifier, we need to consume the
14638 operator token. */
14641 /* Otherwise, no valid operator name was present. */
14642 else
14643 {
14646 }
14649 }
14651 /* Parse a template-declaration.
14653 template-declaration:
14654 export [opt] template < template-parameter-list > declaration
14656 If MEMBER_P is TRUE, this template-declaration occurs within a
14657 class-specifier.
14659 The grammar rule given by the standard isn't correct. What
14660 is really meant is:
14662 template-declaration:
14663 export [opt] template-parameter-list-seq
14664 decl-specifier-seq [opt] init-declarator [opt] ;
14665 export [opt] template-parameter-list-seq
14666 function-definition
14668 template-parameter-list-seq:
14669 template-parameter-list-seq [opt]
14670 template < template-parameter-list >
14672 Concept Extensions:
14674 template-parameter-list-seq:
14675 template < template-parameter-list > requires-clause [opt]
14677 requires-clause:
14678 requires logical-or-expression */
14680 static void
14682 {
14683 /* Check for `export'. */
14685 {
14686 /* Consume the `export' token. */
14688 /* Warn that we do not support `export'. */
14690 }
14693 }
14695 /* Parse a template-parameter-list.
14697 template-parameter-list:
14698 template-parameter
14699 template-parameter-list , template-parameter
14701 Returns a TREE_LIST. Each node represents a template parameter.
14702 The nodes are connected via their TREE_CHAINs. */
14704 static tree
14706 {
14711 /* The loop below parses the template parms. We first need to know
14712 the total number of template parms to be able to compute proper
14713 canonical types of each dependent type. So after the loop, when
14714 we know the total number of template parms,
14715 end_template_parm_list computes the proper canonical types and
14716 fixes up the dependent types accordingly. */
14718 {
14719 tree parameter;
14722 location_t parm_loc;
14724 /* Parse the template-parameter. */
14729 /* Add it to the list. */
14732 parm_loc,
14733 parameter,
14734 is_non_type,
14735 is_parameter_pack);
14736 else
14737 {
14740 }
14742 /* If the next token is not a `,', we're done. */
14745 /* Otherwise, consume the `,' token. */
14747 }
14750 }
14752 /* Parse a introduction-list.
14754 introduction-list:
14755 introduced-parameter
14756 introduction-list , introduced-parameter
14758 introduced-parameter:
14759 ...[opt] identifier
14761 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14762 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14763 WILDCARD_DECL will also have DECL_NAME set and token location in
14764 DECL_SOURCE_LOCATION. */
14766 static tree
14768 {
14772 {
14777 /* Build placeholder. */
14785 /* If the next token is not a `,', we're done. */
14788 /* Otherwise, consume the `,' token. */
14790 }
14792 /* Convert the vec into a TREE_VEC. */
14795 tree parm;
14801 }
14803 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14804 is an abstract declarator. */
14808 {
14813 }
14815 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14816 is an abstract declarator. */
14820 {
14824 else
14826 }
14828 /* Returns true if DECL represents a constrained-parameter. */
14832 {
14837 }
14839 /* Returns true if PARM declares a constrained-parameter. */
14843 {
14845 }
14847 /* Check that the type parameter is only a declarator-id, and that its
14848 type is not cv-qualified. */
14850 bool
14853 {
14858 {
14861 }
14863 /* Don't allow cv-qualified type parameters. */
14866 {
14869 }
14872 }
14874 /* Finish parsing/processing a template type parameter and checking
14875 various restrictions. */
14879 tree id,
14881 {
14884 else
14886 }
14888 static tree
14890 {
14891 /* FIXME: This should probably be copied, and we may need to adjust
14892 the template parameter depths. */
14902 }
14904 /* Finish parsing/processing a template template parameter by borrowing
14905 the template parameter list from the prototype parameter. */
14907 static tree
14909 tree proto,
14910 tree id,
14912 {
14916 }
14918 /* Create a new non-type template parameter from the given PARM
14919 declarator. */
14921 static tree
14924 {
14930 }
14932 /* Build a constrained template parameter based on the PARMDECL
14933 declarator. The type of PARMDECL is the constrained type, which
14934 refers to the prototype template parameter that ultimately
14935 specifies the type of the declared parameter. */
14937 static tree
14942 {
14948 /* A template parameter constrained by a variadic concept shall also
14949 be declared as a template parameter pack. */
14954 /* Build the parameter. Return an error if the declarator was invalid. */
14955 tree parm;
14960 parmdecl);
14961 else
14966 /* Finish the parameter decl and create a node attaching the
14967 default argument and constraint. */
14972 }
14974 /* Returns true if the parsed type actually represents the declaration
14975 of a type template-parameter. */
14979 {
14982 }
14985 /* Returns true if the parsed type actually represents the declaration of
14986 a template template-parameter. */
14988 static bool
14990 {
14993 }
14995 /* Parse a default argument for a type template-parameter.
14996 Note that diagnostics are handled in cp_parser_template_parameter. */
14998 static tree
15000 {
15003 /* Consume the `=' token. */
15008 /* Parse the default-argument. */
15014 {
15018 }
15021 }
15023 /* Parse a default argument for a template template-parameter. */
15025 static tree
15027 {
15032 /* Consume the `='. */
15034 /* Parse the id-expression. */
15036 /* save token before parsing the id-expression, for error
15037 reporting */
15039 tree default_argument
15047 /* If the id-expression was a template-id that refers to
15048 a template-class, we already have the declaration here,
15049 so no further lookup is needed. */
15050 ;
15051 else
15052 /* Look up the name. */
15053 default_argument
15055 none_type,
15061 /* See if the default argument is valid. */
15065 }
15067 /* Parse a template-parameter.
15069 template-parameter:
15070 type-parameter
15071 parameter-declaration
15073 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15074 the parameter. The TREE_PURPOSE is the default value, if any.
15075 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15076 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15077 set to true iff this parameter is a parameter pack. */
15079 static tree
15082 {
15085 tree parm;
15087 /* Assume it is a type parameter or a template parameter. */
15089 /* Assume it not a parameter pack. */
15091 /* Peek at the next token. */
15093 /* If it is `class' or `template', we have a type-parameter. */
15096 /* If it is `class' or `typename' we do not know yet whether it is a
15097 type parameter or a non-type parameter. Consider:
15099 template <typename T, typename T::X X> ...
15101 or:
15103 template <class C, class D*> ...
15105 Here, the first parameter is a type parameter, and the second is
15106 a non-type parameter. We can tell by looking at the token after
15107 the identifier -- if it is a `,', `=', or `>' then we have a type
15108 parameter. */
15110 {
15111 /* Peek at the token after `class' or `typename'. */
15113 /* If it's an ellipsis, we have a template type parameter
15114 pack. */
15117 /* If it's an identifier, skip it. */
15120 /* Now, see if the token looks like the end of a template
15121 parameter. */
15126 }
15128 /* Otherwise, it is a non-type parameter or a constrained parameter.
15130 [temp.param]
15132 When parsing a default template-argument for a non-type
15133 template-parameter, the first non-nested `>' is taken as the end
15134 of the template parameter-list rather than a greater-than
15135 operator. */
15136 parameter_declarator
15143 /* If the parameter declaration is marked as a parameter pack, set
15144 *IS_PARAMETER_PACK to notify the caller. */
15149 {
15150 /* Can happen in some cases of erroneous input (c++/34892). */
15152 /* Consume the `...' for better error recovery. */
15154 }
15156 // The parameter may have been constrained.
15159 parameter_declarator,
15160 is_non_type,
15161 is_parameter_pack);
15163 // Now we're sure that the parameter is a non-type parameter.
15174 }
15176 /* Parse a type-parameter.
15178 type-parameter:
15179 class identifier [opt]
15180 class identifier [opt] = type-id
15181 typename identifier [opt]
15182 typename identifier [opt] = type-id
15183 template < template-parameter-list > class identifier [opt]
15184 template < template-parameter-list > class identifier [opt]
15185 = id-expression
15187 GNU Extension (variadic templates):
15189 type-parameter:
15190 class ... identifier [opt]
15191 typename ... identifier [opt]
15193 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15194 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15195 the declaration of the parameter.
15197 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15199 static tree
15201 {
15203 tree parameter;
15205 /* Look for a keyword to tell us what kind of parameter this is. */
15211 {
15214 {
15215 tree identifier;
15216 tree default_argument;
15218 /* If the next token is an ellipsis, we have a template
15219 argument pack. */
15221 {
15222 /* Consume the `...' token. */
15227 }
15229 /* If the next token is an identifier, then it names the
15230 parameter. */
15233 else
15236 /* Create the parameter. */
15239 /* If the next token is an `=', we have a default argument. */
15241 {
15242 default_argument
15245 /* Template parameter packs cannot have default
15246 arguments. */
15248 {
15251 "template parameter pack %qD cannot have a "
15253 else
15255 "template parameter packs cannot have "
15258 }
15261 }
15262 else
15265 /* Create the combined representation of the parameter and the
15266 default argument. */
15268 }
15272 {
15273 tree identifier;
15274 tree default_argument;
15276 /* Look for the `<'. */
15278 /* Parse the template-parameter-list. */
15280 /* Look for the `>'. */
15283 // If template requirements are present, parse them.
15285 {
15290 }
15292 /* Look for the `class' or 'typename' keywords. */
15294 /* If the next token is an ellipsis, we have a template
15295 argument pack. */
15297 {
15298 /* Consume the `...' token. */
15303 }
15304 /* If the next token is an `=', then there is a
15305 default-argument. If the next token is a `>', we are at
15306 the end of the parameter-list. If the next token is a `,',
15307 then we are at the end of this parameter. */
15311 {
15313 /* Treat invalid names as if the parameter were nameless. */
15316 }
15317 else
15320 /* Create the template parameter. */
15322 identifier);
15324 /* If the next token is an `=', then there is a
15325 default-argument. */
15327 {
15328 default_argument
15331 /* Template parameter packs cannot have default
15332 arguments. */
15334 {
15337 "template parameter pack %qD cannot "
15339 identifier);
15340 else
15344 }
15345 }
15346 else
15349 /* Create the combined representation of the parameter and the
15350 default argument. */
15352 }
15358 }
15361 }
15363 /* Parse a template-id.
15365 template-id:
15366 template-name < template-argument-list [opt] >
15368 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15369 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15370 returned. Otherwise, if the template-name names a function, or set
15371 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15372 names a class, returns a TYPE_DECL for the specialization.
15374 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15375 uninstantiated templates. */
15377 static tree
15383 {
15384 tree templ;
15385 tree arguments;
15386 tree template_id;
15391 /* If the next token corresponds to a template-id, there is no need
15392 to reparse it. */
15395 {
15398 }
15400 /* Avoid performing name lookup if there is no possibility of
15401 finding a template-id. */
15404 && !cp_parser_nth_token_starts_template_argument_list_p
15406 {
15409 }
15411 /* Remember where the template-id starts. */
15417 /* Parse the template-name. */
15420 check_dependency_p,
15421 is_declaration,
15422 tag_type,
15425 {
15428 }
15430 /* Since we're going to preserve any side-effects from this parse, set up a
15431 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15432 in the template arguments. */
15435 /* If we find the sequence `[:' after a template-name, it's probably
15436 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15437 parse correctly the argument list. */
15444 {
15446 /* Change `:' into `::'. */
15448 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15449 CPP_LESS. */
15452 /* Parse the arguments. */
15455 {
15456 /* If we couldn't parse an argument list, then we revert our changes
15457 and return simply an error. Maybe this is not a template-id
15458 after all. */
15463 }
15464 /* Otherwise, emit an error about the invalid digraph, but continue
15465 parsing because we got our argument list. */
15468 {
15471 "%<<:%> is an alternate spelling for %<[%>."
15474 {
15476 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15479 }
15480 }
15481 }
15482 else
15483 {
15484 /* Look for the `<' that starts the template-argument-list. */
15486 {
15489 }
15490 /* Parse the arguments. */
15492 }
15494 /* Build a representation of the specialization. */
15497 TEMPLATE_ID_EXPR,
15501 {
15503 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15504 template (rather than some instantiation thereof) only if
15505 is not nested within some other construct. For example, in
15506 "template <typename T> void f(T) { A<T>::", A<T> is just an
15507 instantiation of A. */
15510 CPP_SCOPE));
15511 template_id
15513 }
15514 /* A template-like identifier may be a partial concept id. */
15520 {
15524 }
15525 else
15526 {
15527 /* If it's not a class-template or a template-template, it should be
15528 a function-template. */
15536 }
15538 /* If parsing tentatively, replace the sequence of tokens that makes
15539 up the template-id with a CPP_TEMPLATE_ID token. That way,
15540 should we re-parse the token stream, we will not have to repeat
15541 the effort required to do the parse, nor will we issue duplicate
15542 error messages about problems during instantiation of the
15543 template. */
15545 /* Don't do this if we had a parse error in a declarator; re-parsing
15546 might succeed if a name changes meaning (60361). */
15550 {
15553 /* Reset the contents of the START_OF_ID token. */
15556 /* Update the location to be of the form:
15557 template-name < template-argument-list [opt] >
15558 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15559 with caret == start at the start of the template-name,
15560 ranging until the closing '>'. */
15561 location_t finish_loc
15563 location_t combined_loc
15567 /* Retrieve any deferred checks. Do not pop this access checks yet
15568 so the memory will not be reclaimed during token replacing below. */
15574 /* Purge all subsequent tokens. */
15577 /* ??? Can we actually assume that, if template_id ==
15578 error_mark_node, we will have issued a diagnostic to the
15579 user, as opposed to simply marking the tentative parse as
15580 failed? */
15583 }
15587 }
15589 /* Parse a template-name.
15591 template-name:
15592 identifier
15594 The standard should actually say:
15596 template-name:
15597 identifier
15598 operator-function-id
15600 A defect report has been filed about this issue.
15602 A conversion-function-id cannot be a template name because they cannot
15603 be part of a template-id. In fact, looking at this code:
15605 a.operator K<int>()
15607 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15608 It is impossible to call a templated conversion-function-id with an
15609 explicit argument list, since the only allowed template parameter is
15610 the type to which it is converting.
15612 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15613 `template' keyword, in a construction like:
15615 T::template f<3>()
15617 In that case `f' is taken to be a template-name, even though there
15618 is no way of knowing for sure.
15620 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15621 name refers to a set of overloaded functions, at least one of which
15622 is a template, or an IDENTIFIER_NODE with the name of the template,
15623 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15624 names are looked up inside uninstantiated templates. */
15626 static tree
15633 {
15634 tree identifier;
15635 tree decl;
15636 tree fns;
15639 /* If the next token is `operator', then we have either an
15640 operator-function-id or a conversion-function-id. */
15642 {
15643 /* We don't know whether we're looking at an
15644 operator-function-id or a conversion-function-id. */
15646 /* Try an operator-function-id. */
15648 /* If that didn't work, try a conversion-function-id. */
15650 {
15653 }
15654 }
15655 /* Look for the identifier. */
15656 else
15659 /* If we didn't find an identifier, we don't have a template-id. */
15663 /* If the name immediately followed the `template' keyword, then it
15664 is a template-name. However, if the next token is not `<', then
15665 we do not treat it as a template-name, since it is not being used
15666 as part of a template-id. This enables us to handle constructs
15667 like:
15669 template <typename T> struct S { S(); };
15670 template <typename T> S<T>::S();
15672 correctly. We would treat `S' as a template -- if it were `S<T>'
15673 -- but we do not if there is no `<'. */
15677 {
15678 /* In a declaration, in a dependent context, we pretend that the
15679 "template" keyword was present in order to improve error
15680 recovery. For example, given:
15682 template <typename T> void f(T::X<int>);
15684 we want to treat "X<int>" as a template-id. */
15686 && !template_keyword_p
15688 && check_dependency_p
15690 /* Do not do this for dtors (or ctors), since they never
15691 need the template keyword before their name. */
15693 {
15696 /* Explain what went wrong. */
15698 identifier);
15701 /* If parsing tentatively, find the location of the "<" token. */
15704 /* Parse the template arguments so that we can issue error
15705 messages about them. */
15708 /* Skip tokens until we find a good place from which to
15709 continue parsing. */
15714 /* If parsing tentatively, permanently remove the
15715 template argument list. That will prevent duplicate
15716 error messages from being issued about the missing
15717 "template" keyword. */
15723 }
15725 /* If the "template" keyword is present, then there is generally
15726 no point in doing name-lookup, so we just return IDENTIFIER.
15727 But, if the qualifying scope is non-dependent then we can
15728 (and must) do name-lookup normally. */
15734 }
15736 /* Look up the name. */
15738 tag_type,
15741 check_dependency_p,
15747 /* If DECL is a template, then the name was a template-name. */
15749 {
15753 }
15754 else
15755 {
15758 /* The standard does not explicitly indicate whether a name that
15759 names a set of overloaded declarations, some of which are
15760 templates, is a template-name. However, such a name should
15761 be a template-name; otherwise, there is no way to form a
15762 template-id for the overloaded templates. */
15770 {
15771 /* The name does not name a template. */
15774 }
15775 }
15777 /* If DECL is dependent, and refers to a function, then just return
15778 its name; we will look it up again during template instantiation. */
15780 {
15784 }
15787 }
15789 /* Parse a template-argument-list.
15791 template-argument-list:
15792 template-argument ... [opt]
15793 template-argument-list , template-argument ... [opt]
15795 Returns a TREE_VEC containing the arguments. */
15797 static tree
15799 {
15804 tree vec;
15811 /* Even if the template-id appears in an integral
15812 constant-expression, the contents of the argument list do
15813 not. */
15819 /* Parse the arguments. */
15820 do
15821 {
15822 tree argument;
15825 /* Consume the comma. */
15828 /* Parse the template-argument. */
15831 /* If the next token is an ellipsis, we're expanding a template
15832 argument pack. */
15834 {
15836 {
15840 }
15841 /* Consume the `...' token. */
15844 /* Make the argument into a TYPE_PACK_EXPANSION or
15845 EXPR_PACK_EXPANSION. */
15847 }
15850 {
15854 {
15857 }
15858 else
15860 }
15862 }
15878 }
15880 /* Parse a template-argument.
15882 template-argument:
15883 assignment-expression
15884 type-id
15885 id-expression
15887 The representation is that of an assignment-expression, type-id, or
15888 id-expression -- except that the qualified id-expression is
15889 evaluated, so that the value returned is either a DECL or an
15890 OVERLOAD.
15892 Although the standard says "assignment-expression", it forbids
15893 throw-expressions or assignments in the template argument.
15894 Therefore, we use "conditional-expression" instead. */
15896 static tree
15898 {
15899 tree argument;
15905 cp_id_kind idk;
15907 /* There's really no way to know what we're looking at, so we just
15908 try each alternative in order.
15910 [temp.arg]
15912 In a template-argument, an ambiguity between a type-id and an
15913 expression is resolved to a type-id, regardless of the form of
15914 the corresponding template-parameter.
15916 Therefore, we try a type-id first. */
15919 /* If there was no error parsing the type-id but the next token is a
15920 '>>', our behavior depends on which dialect of C++ we're
15921 parsing. In C++98, we probably found a typo for '> >'. But there
15922 are type-id which are also valid expressions. For instance:
15924 struct X { int operator >> (int); };
15925 template <int V> struct Foo {};
15926 Foo<X () >> 5> r;
15928 Here 'X()' is a valid type-id of a function type, but the user just
15929 wanted to write the expression "X() >> 5". Thus, we remember that we
15930 found a valid type-id, but we still try to parse the argument as an
15931 expression to see what happens.
15933 In C++0x, the '>>' will be considered two separate '>'
15934 tokens. */
15938 {
15941 }
15942 else
15943 {
15944 /* If the next token isn't a `,' or a `>', then this argument wasn't
15945 really finished. This means that the argument is not a valid
15946 type-id. */
15949 /* If that worked, we're done. */
15952 }
15953 /* We're still not sure what the argument will be. */
15955 /* Try a template. */
15963 /* If the next token isn't a `,' or a `>', then this argument wasn't
15964 really finished. */
15968 {
15969 /* Figure out what is being referred to. If the id-expression
15970 was for a class template specialization, then we will have a
15971 TYPE_DECL at this point. There is no need to do name lookup
15972 at this point in that case. */
15975 none_type,
15981 /* Handle a constrained-type-specifier for a non-type template
15982 parameter. */
15988 }
15990 {
15994 }
15995 /* It must be a non-type argument. In C++17 any constant-expression is
15996 allowed. */
16000 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16002 -- an integral constant-expression of integral or enumeration
16003 type; or
16005 -- the name of a non-type template-parameter; or
16007 -- the name of an object or function with external linkage...
16009 -- the address of an object or function with external linkage...
16011 -- a pointer to member... */
16012 /* Look for a non-type template parameter. */
16014 {
16026 }
16028 /* If the next token is "&", the argument must be the address of an
16029 object or function with external linkage. */
16032 {
16035 }
16036 /* See if we might have an id-expression. */
16043 {
16046 address_p,
16053 else
16054 {
16055 tree probe;
16058 {
16059 /* Strip the dereference temporarily. */
16062 }
16064 /* If we're in a template, we represent a qualified-id referring
16065 to a static data member as a SCOPE_REF even if the scope isn't
16066 dependent so that we can check access control later. */
16071 {
16072 /* A variable without external linkage might still be a
16073 valid constant-expression, so no error is issued here
16074 if the external-linkage check fails. */
16077 }
16079 /* All overloaded functions are allowed; if the external
16080 linkage test does not pass, an error will be issued
16081 later. */
16082 ;
16086 /* A pointer-to-member. */
16087 ;
16089 ;
16090 else
16094 {
16097 tf_warning_or_error);
16098 else
16101 }
16102 }
16103 }
16104 /* If the argument started with "&", there are no other valid
16105 alternatives at this point. */
16107 {
16110 }
16112 general_expr:
16113 /* If the argument wasn't successfully parsed as a type-id followed
16114 by '>>', the argument can only be a constant expression now.
16115 Otherwise, we try parsing the constant-expression tentatively,
16116 because the argument could really be a type-id. */
16122 else
16123 {
16124 /* With C++17 generalized non-type template arguments we need to handle
16125 lvalue constant expressions, too. */
16128 }
16136 /* We did our best to parse the argument as a non type-id, but that
16137 was the only alternative that matched (albeit with a '>' after
16138 it). We can assume it's just a typo from the user, and a
16139 diagnostic will then be issued. */
16141 }
16143 /* Parse an explicit-instantiation.
16145 explicit-instantiation:
16146 template declaration
16148 Although the standard says `declaration', what it really means is:
16150 explicit-instantiation:
16151 template decl-specifier-seq [opt] declarator [opt] ;
16153 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16154 supposed to be allowed. A defect report has been filed about this
16155 issue.
16157 GNU Extension:
16159 explicit-instantiation:
16160 storage-class-specifier template
16161 decl-specifier-seq [opt] declarator [opt] ;
16162 function-specifier template
16163 decl-specifier-seq [opt] declarator [opt] ; */
16165 static void
16167 {
16169 cp_decl_specifier_seq decl_specifiers;
16174 /* Look for an (optional) storage-class-specifier or
16175 function-specifier. */
16177 {
16178 extension_specifier
16181 extension_specifier
16184 }
16186 /* Look for the `template' keyword. */
16188 /* Let the front end know that we are processing an explicit
16189 instantiation. */
16191 /* [temp.explicit] says that we are supposed to ignore access
16192 control while processing explicit instantiation directives. */
16194 /* Parse a decl-specifier-seq. */
16196 CP_PARSER_FLAGS_OPTIONAL,
16199 /* If there was exactly one decl-specifier, and it declared a class,
16200 and there's no declarator, then we have an explicit type
16201 instantiation. */
16203 {
16204 tree type;
16208 /* Turn access control back on for names used during
16209 template instantiation. */
16214 }
16215 else
16216 {
16218 tree decl;
16220 /* Parse the declarator. */
16221 declarator
16232 {
16235 "explicit instantiation shall not use"
16239 "explicit instantiation shall not use"
16244 /* Turn access control back on for names used during
16245 template instantiation. */
16247 /* Do the explicit instantiation. */
16249 }
16250 else
16251 {
16253 /* Skip the body of the explicit instantiation. */
16255 }
16256 }
16257 /* We're done with the instantiation. */
16263 }
16265 /* Parse an explicit-specialization.
16267 explicit-specialization:
16268 template < > declaration
16270 Although the standard says `declaration', what it really means is:
16272 explicit-specialization:
16273 template <> decl-specifier [opt] init-declarator [opt] ;
16274 template <> function-definition
16275 template <> explicit-specialization
16276 template <> template-declaration */
16278 static void
16280 {
16284 /* Look for the `template' keyword. */
16286 /* Look for the `<'. */
16288 /* Look for the `>'. */
16290 /* We have processed another parameter list. */
16292 /* [temp]
16294 A template ... explicit specialization ... shall not have C
16295 linkage. */
16297 {
16299 /* Give it C++ linkage to avoid confusing other parts of the
16300 front end. */
16303 }
16304 else
16306 /* Let the front end know that we are beginning a specialization. */
16308 {
16311 }
16313 /* If the next keyword is `template', we need to figure out whether
16314 or not we're looking a template-declaration. */
16316 {
16321 else
16323 }
16324 else
16325 /* Parse the dependent declaration. */
16331 /* We're done with the specialization. */
16333 /* For the erroneous case of a template with C linkage, we pushed an
16334 implicit C++ linkage scope; exit that scope now. */
16337 /* We're done with this parameter list. */
16339 }
16341 /* Parse a type-specifier.
16343 type-specifier:
16344 simple-type-specifier
16345 class-specifier
16346 enum-specifier
16347 elaborated-type-specifier
16348 cv-qualifier
16350 GNU Extension:
16352 type-specifier:
16353 __complex__
16355 Returns a representation of the type-specifier. For a
16356 class-specifier, enum-specifier, or elaborated-type-specifier, a
16357 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16359 The parser flags FLAGS is used to control type-specifier parsing.
16361 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16362 in a decl-specifier-seq.
16364 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16365 class-specifier, enum-specifier, or elaborated-type-specifier, then
16366 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16367 if a type is declared; 2 if it is defined. Otherwise, it is set to
16368 zero.
16370 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16371 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16372 is set to FALSE. */
16374 static tree
16376 cp_parser_flags flags,
16381 {
16387 /* Assume this type-specifier does not declare a new type. */
16390 /* And that it does not specify a cv-qualifier. */
16393 /* Peek at the next token. */
16396 /* If we're looking at a keyword, we can use that to guide the
16397 production we choose. */
16400 {
16405 /* Look for the enum-specifier. */
16407 /* If that worked, we're done. */
16409 {
16414 type_spec,
16415 token,
16418 }
16419 else
16422 /* Any of these indicate either a class-specifier, or an
16423 elaborated-type-specifier. */
16430 /* Parse tentatively so that we can back up if we don't find a
16431 class-specifier. */
16433 /* Look for the class-specifier. */
16436 /* If that worked, we're done. */
16438 {
16443 type_spec,
16444 token,
16447 }
16449 /* Fall through. */
16450 elaborated_type_specifier:
16451 /* We're declaring (not defining) a class or enum. */
16455 /* Fall through. */
16457 /* Look for an elaborated-type-specifier. */
16458 type_spec
16459 = (cp_parser_elaborated_type_specifier
16462 is_declaration));
16465 type_spec,
16466 token,
16489 /* The `__complex__' keyword is a GNU extension. */
16495 }
16497 /* Handle simple keywords. */
16499 {
16501 {
16504 }
16506 }
16508 /* If we do not already have a type-specifier, assume we are looking
16509 at a simple-type-specifier. */
16511 decl_specs,
16512 flags);
16514 /* If we didn't find a type-specifier, and a type-specifier was not
16515 optional in this context, issue an error message. */
16517 {
16520 }
16523 }
16525 /* Parse a simple-type-specifier.
16527 simple-type-specifier:
16528 :: [opt] nested-name-specifier [opt] type-name
16529 :: [opt] nested-name-specifier template template-id
16530 char
16531 wchar_t
16532 bool
16533 short
16534 int
16535 long
16536 signed
16537 unsigned
16538 float
16539 double
16540 void
16542 C++11 Extension:
16544 simple-type-specifier:
16545 auto
16546 decltype ( expression )
16547 char16_t
16548 char32_t
16549 __underlying_type ( type-id )
16551 C++17 extension:
16553 nested-name-specifier(opt) template-name
16555 GNU Extension:
16557 simple-type-specifier:
16558 __int128
16559 __typeof__ unary-expression
16560 __typeof__ ( type-id )
16561 __typeof__ ( type-id ) { initializer-list , [opt] }
16563 Concepts Extension:
16565 simple-type-specifier:
16566 constrained-type-specifier
16568 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16569 appropriately updated. */
16571 static tree
16574 cp_parser_flags flags)
16575 {
16580 /* Peek at the next token. */
16583 /* If we're looking at a keyword, things are easy. */
16585 {
16620 {
16623 }
16652 {
16653 /* The 'auto' might be the placeholder return type for a function decl
16654 with trailing return type. */
16663 {
16665 {
16672 }
16675 {
16678 }
16681 }
16685 {
16688 }
16691 {
16694 }
16695 else
16699 {
16702 "use of %<auto%> in lambda parameter declaration "
16703 "only available with "
16705 }
16708 "use of %<auto%> in parameter declaration "
16709 "only available with "
16713 "ISO C++ forbids use of %<auto%> in parameter "
16715 }
16716 else
16721 /* Since DR 743, decltype can either be a simple-type-specifier by
16722 itself or begin a nested-name-specifier. Parsing it will replace
16723 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16724 handling below decide what to do. */
16730 /* Consume the `typeof' token. */
16732 /* Parse the operand to `typeof'. */
16734 /* If it is not already a TYPE, take its type. */
16740 token,
16749 token,
16759 token,
16764 }
16766 /* If token is an already-parsed decltype not followed by ::,
16767 it's a simple-type-specifier. */
16770 {
16773 {
16775 token,
16777 /* Remember that we are handling a decltype in order to
16778 implement the resolution of DR 1510 when the argument
16779 isn't instantiation dependent. */
16781 }
16784 }
16786 /* If the type-specifier was for a built-in type, we're done. */
16788 {
16789 /* Record the type. */
16796 type,
16797 token,
16802 /* Consume the token. */
16808 /* There is no valid C++ program where a non-template type is
16809 followed by a "<". That usually indicates that the user thought
16810 that the type was a template. */
16815 }
16817 /* The type-specifier must be a user-defined type. */
16819 {
16823 /* Don't gobble tokens or issue error messages if this is an
16824 optional type-specifier. */
16830 /* Look for the optional `::' operator. */
16831 global_p
16835 /* Look for the nested-name specifier. */
16836 qualified_p
16843 /* If we have seen a nested-name-specifier, and the next token
16844 is `template', then we are using the template-id production. */
16847 {
16848 /* Look for the template-id. */
16852 none_type,
16854 /* If the template-id did not name a type, we are out of
16855 luck. */
16857 {
16860 }
16861 }
16862 /* Otherwise, look for a type-name. */
16863 else
16865 /* Keep track of all name-lookups performed in class scopes. */
16867 && !global_p
16868 && !qualified_p
16872 /* If it didn't work out, we don't have a TYPE. */
16877 {
16891 {
16893 none_type,
16903 else
16904 {
16909 }
16910 }
16911 else
16917 }
16920 token,
16922 }
16924 /* If we didn't get a type-name, issue an error message. */
16926 {
16929 }
16932 {
16933 /* See if TYPE is an Objective-C type, and if so, parse and
16934 accept any protocol references following it. Do this before
16935 the cp_parser_check_for_invalid_template_id() call, because
16936 Objective-C types can be followed by '<...>' which would
16937 enclose protocol names rather than template arguments, and so
16938 everything is fine. */
16941 {
16945 /* Clobber the "unqualified" type previously entered into
16946 DECL_SPECS with the new, improved protocol-qualified version. */
16951 }
16953 /* There is no valid C++ program where a non-template type is
16954 followed by a "<". That usually indicates that the user
16955 thought that the type was a template. */
16957 none_type,
16959 }
16962 }
16964 /* Parse a type-name.
16966 type-name:
16967 class-name
16968 enum-name
16969 typedef-name
16970 simple-template-id [in c++0x]
16972 enum-name:
16973 identifier
16975 typedef-name:
16976 identifier
16978 Concepts:
16980 type-name:
16981 concept-name
16982 partial-concept-id
16984 concept-name:
16985 identifier
16987 Returns a TYPE_DECL for the type. */
16989 static tree
16991 {
16993 }
16995 /* See above. */
16996 static tree
16998 {
16999 tree type_decl;
17001 /* We can't know yet whether it is a class-name or not. */
17003 /* Try a class-name. */
17005 typename_keyword_p,
17007 none_type,
17011 /* If it's not a class-name, keep looking. */
17013 {
17015 /* It must be a typedef-name or an enum-name. */
17019 /* It is either a simple-template-id representing an
17020 instantiation of an alias template... */
17024 none_type,
17026 /* Note that this must be an instantiation of an alias template
17027 because [temp.names]/6 says:
17029 A template-id that names an alias template specialization
17030 is a type-name.
17032 Whereas [temp.names]/7 says:
17034 A simple-template-id that names a class template
17035 specialization is a class-name.
17037 With concepts, this could also be a partial-concept-id that
17038 declares a non-type template parameter. */
17045 else
17049 /* ... Or a typedef-name or an enum-name. */
17051 }
17054 }
17056 /* Check if DECL and ARGS can form a constrained-type-specifier.
17057 If ARGS is non-null, we try to form a concept check of the
17058 form DECL<?, ARGS> where ? is a wildcard that matches any
17059 kind of template argument. If ARGS is NULL, then we try to
17060 form a concept check of the form DECL<?>. */
17062 static tree
17065 {
17068 /* If we a constrained-type-specifier cannot be deduced. */
17072 /* A constrained type specifier can only be found in an
17073 overload set or as a reference to a template declaration.
17075 FIXME: This might be masking a bug. It's possible that
17076 that the deduction below is causing template specializations
17077 to be formed with the wildcard as an argument. */
17081 /* Try to build a call expression that evaluates the
17082 concept. This can fail if the overload set refers
17083 only to non-templates. */
17089 /* Deduce the checked constraint and the prototype parameter.
17091 FIXME: In certain cases, failure to deduce should be a
17092 diagnosable error. */
17093 tree conc;
17094 tree proto;
17098 /* In template parameter scope, this results in a constrained
17099 parameter. Return a descriptor of that parm. */
17103 /* In a parameter-declaration-clause, constrained-type
17104 specifiers result in invented template parameters. */
17106 {
17109 }
17110 else
17111 {
17112 /* Otherwise, we're in a context where the constrained
17113 type name is deduced and the constraint applies
17114 after deduction. */
17116 }
17119 }
17121 /* If DECL refers to a concept, return a TYPE_DECL representing
17122 the result of using the constrained type specifier in the
17123 current context. DECL refers to a concept if
17125 - it is an overload set containing a function concept taking a single
17126 type argument, or
17128 - it is a variable concept taking a single type argument. */
17130 static tree
17132 {
17138 else
17140 }
17142 /* Check if DECL and ARGS form a partial-concept-id. If so,
17143 assign ID to the resulting constrained placeholder.
17145 Returns true if the partial-concept-id designates a placeholder
17146 and false otherwise. Note that *id is set to NULL_TREE in
17147 this case. */
17149 static tree
17151 {
17153 }
17155 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17156 or a concept-name.
17158 enum-name:
17159 identifier
17161 typedef-name:
17162 identifier
17164 concept-name:
17165 identifier
17167 Returns a TYPE_DECL for the type. */
17169 static tree
17171 {
17172 tree type_decl;
17173 tree identifier;
17180 /* Look up the type-name. */
17185 /* If we found an overload set, then it may refer to a concept-name. */
17191 {
17192 /* See if this is an Objective-C type. */
17197 }
17199 /* Issue an error if we did not find a type-name. */
17201 /* In Objective-C, we have the complication that class names are
17202 normally type names and start declarations (eg, the
17203 "NSObject" in "NSObject *object;"), but can be used in an
17204 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17205 is an expression. So, a classname followed by a dot is not a
17206 valid type-name. */
17209 {
17214 }
17215 /* Remember that the name was used in the definition of the
17216 current class so that we can check later to see if the
17217 meaning would have been different after the class was
17218 entirely defined. */
17224 }
17226 /* Parse an elaborated-type-specifier. Note that the grammar given
17227 here incorporates the resolution to DR68.
17229 elaborated-type-specifier:
17230 class-key :: [opt] nested-name-specifier [opt] identifier
17231 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17232 enum-key :: [opt] nested-name-specifier [opt] identifier
17233 typename :: [opt] nested-name-specifier identifier
17234 typename :: [opt] nested-name-specifier template [opt]
17235 template-id
17237 GNU extension:
17239 elaborated-type-specifier:
17240 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17241 class-key attributes :: [opt] nested-name-specifier [opt]
17242 template [opt] template-id
17243 enum attributes :: [opt] nested-name-specifier [opt] identifier
17245 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17246 declared `friend'. If IS_DECLARATION is TRUE, then this
17247 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17248 something is being declared.
17250 Returns the TYPE specified. */
17252 static tree
17256 {
17258 tree identifier;
17261 tree globalscope;
17264 /* See if we're looking at the `enum' keyword. */
17266 {
17267 /* Consume the `enum' token. */
17269 /* Remember that it's an enumeration type. */
17271 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17272 enums) is used here. */
17275 {
17279 /* Consume the `struct' or `class' and parse it anyway. */
17281 }
17282 /* Parse the attributes. */
17284 }
17285 /* Or, it might be `typename'. */
17287 RID_TYPENAME))
17288 {
17289 /* Consume the `typename' token. */
17291 /* Remember that it's a `typename' type. */
17293 }
17294 /* Otherwise it must be a class-key. */
17295 else
17296 {
17300 /* Parse the attributes. */
17302 }
17304 /* Look for the `::' operator. */
17307 /* Look for the nested-name-specifier. */
17308 tree nested_name_specifier;
17310 {
17311 nested_name_specifier
17316 is_declaration);
17319 }
17320 else
17321 /* Even though `typename' is not present, the proposed resolution
17322 to Core Issue 180 says that in `class A<T>::B', `B' should be
17323 considered a type-name, even if `A<T>' is dependent. */
17324 nested_name_specifier
17329 is_declaration);
17330 /* For everything but enumeration types, consider a template-id.
17331 For an enumeration type, consider only a plain identifier. */
17333 {
17335 tree decl;
17337 /* Allow the `template' keyword. */
17339 /* If we didn't see `template', we don't know if there's a
17340 template-id or not. */
17343 /* Parse the template-id. */
17347 tag_type,
17348 is_declaration);
17349 /* If we didn't find a template-id, look for an ordinary
17350 identifier. */
17352 ;
17353 /* We can get here when cp_parser_template_id, called by
17354 cp_parser_class_name with tag_type == none_type, succeeds
17355 and caches a BASELINK. Then, when called again here,
17356 instead of failing and returning an error_mark_node
17357 returns it (see template/typename17.C in C++11).
17358 ??? Could we diagnose this earlier? */
17360 {
17363 }
17364 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17365 in effect, then we must assume that, upon instantiation, the
17366 template will correspond to a class. */
17370 typename_type,
17372 /* If the `typename' keyword is in effect and DECL is not a type
17373 decl, then type is non existent. */
17375 ;
17377 {
17381 /* If the next token is a semicolon, this must be a specialization,
17382 instantiation, or friend declaration. Check the scope while we
17383 still know whether or not we had a nested-name-specifier. */
17388 }
17391 }
17394 {
17399 {
17402 }
17404 /* For a `typename', we needn't call xref_tag. */
17410 /* Template parameter lists apply only if we are not within a
17411 function parameter list. */
17412 bool template_parm_lists_apply
17421 /* Look up a qualified name in the usual way. */
17423 {
17424 tree decl;
17425 tree ambiguous_decls;
17428 tag_type,
17435 /* If the lookup was ambiguous, an error will already have been
17436 issued. */
17440 /* If we are parsing friend declaration, DECL may be a
17441 TEMPLATE_DECL tree node here. However, we need to check
17442 whether this TEMPLATE_DECL results in valid code. Consider
17443 the following example:
17445 namespace N {
17446 template <class T> class C {};
17447 }
17448 class X {
17449 template <class T> friend class N::C; // #1, valid code
17450 };
17451 template <class T> class Y {
17452 friend class N::C; // #2, invalid code
17453 };
17455 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17456 name lookup of `N::C'. We see that friend declaration must
17457 be template for the code to be valid. Note that
17458 processing_template_decl does not work here since it is
17459 always 1 for the above two cases. */
17461 decl = (cp_parser_maybe_treat_template_as_class
17466 {
17468 identifier,
17471 }
17474 {
17478 allow_template);
17482 }
17484 /* Forward declarations of nested types, such as
17486 class C1::C2;
17487 class C1::C2::C3;
17489 are invalid unless all components preceding the final '::'
17490 are complete. If all enclosing types are complete, these
17491 declarations become merely pointless.
17493 Invalid forward declarations of nested types are errors
17494 caught elsewhere in parsing. Those that are pointless arrive
17495 here. */
17502 }
17503 else
17504 {
17505 /* An elaborated-type-specifier sometimes introduces a new type and
17506 sometimes names an existing type. Normally, the rule is that it
17507 introduces a new type only if there is not an existing type of
17508 the same name already in scope. For example, given:
17510 struct S {};
17511 void f() { struct S s; }
17513 the `struct S' in the body of `f' is the same `struct S' as in
17514 the global scope; the existing definition is used. However, if
17515 there were no global declaration, this would introduce a new
17516 local class named `S'.
17518 An exception to this rule applies to the following code:
17520 namespace N { struct S; }
17522 Here, the elaborated-type-specifier names a new type
17523 unconditionally; even if there is already an `S' in the
17524 containing scope this declaration names a new type.
17525 This exception only applies if the elaborated-type-specifier
17526 forms the complete declaration:
17528 [class.name]
17530 A declaration consisting solely of `class-key identifier ;' is
17531 either a redeclaration of the name in the current scope or a
17532 forward declaration of the identifier as a class name. It
17533 introduces the name into the current scope.
17535 We are in this situation precisely when the next token is a `;'.
17537 An exception to the exception is that a `friend' declaration does
17538 *not* name a new type; i.e., given:
17540 struct S { friend struct T; };
17542 `T' is not a new type in the scope of `S'.
17544 Also, `new struct S' or `sizeof (struct S)' never results in the
17545 definition of a new type; a new type can only be declared in a
17546 declaration context. */
17548 tag_scope ts;
17552 /* Friends have special name lookup rules. */
17556 CPP_SEMICOLON))
17557 /* This is a `class-key identifier ;' */
17559 else
17562 template_p =
17563 (template_parm_lists_apply
17566 /* An unqualified name was used to reference this type, so
17567 there were no qualifying templates. */
17575 }
17576 }
17581 /* Allow attributes on forward declarations of classes. */
17583 {
17593 else
17596 }
17599 {
17600 /* Indicate whether this class was declared as a `class' or as a
17601 `struct'. */
17605 }
17607 /* A "<" cannot follow an elaborated type specifier. If that
17608 happens, the user was probably trying to form a template-id. */
17613 }
17615 /* Parse an enum-specifier.
17617 enum-specifier:
17618 enum-head { enumerator-list [opt] }
17619 enum-head { enumerator-list , } [C++0x]
17621 enum-head:
17622 enum-key identifier [opt] enum-base [opt]
17623 enum-key nested-name-specifier identifier enum-base [opt]
17625 enum-key:
17626 enum
17627 enum class [C++0x]
17628 enum struct [C++0x]
17630 enum-base: [C++0x]
17631 : type-specifier-seq
17633 opaque-enum-specifier:
17634 enum-key identifier enum-base [opt] ;
17636 GNU Extensions:
17637 enum-key attributes[opt] identifier [opt] enum-base [opt]
17638 { enumerator-list [opt] }attributes[opt]
17639 enum-key attributes[opt] identifier [opt] enum-base [opt]
17640 { enumerator-list, }attributes[opt] [C++0x]
17642 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17643 if the token stream isn't an enum-specifier after all. */
17645 static tree
17647 {
17648 tree identifier;
17650 tree prev_scope;
17652 tree attributes;
17665 /* Parse tentatively so that we can back up if we don't find a
17666 enum-specifier. */
17669 /* Caller guarantees that the current token is 'enum', an identifier
17670 possibly follows, and the token after that is an opening brace.
17671 If we don't have an identifier, fabricate an anonymous name for
17672 the enumeration being defined. */
17675 /* Parse the "class" or "struct", which indicates a scoped
17676 enumeration type in C++0x. */
17679 {
17683 /* Consume the `struct' or `class' token. */
17687 }
17691 /* Clear the qualification. */
17696 /* Figure out in what scope the declaration is being placed. */
17702 nested_name_specifier
17710 {
17711 tree name;
17715 enum_type,
17720 input_location);
17722 {
17725 {
17726 /* Are template enums allowed in ISO? */
17730 /* ignore a typename reference, for it will be solved by name
17731 in start_enum. */
17733 }
17734 }
17737 else
17738 {
17743 }
17744 }
17745 else
17746 {
17749 else
17750 {
17756 }
17757 }
17760 /* Check for the `:' that denotes a specified underlying type in C++0x.
17761 Note that a ':' could also indicate a bitfield width, however. */
17763 {
17764 cp_decl_specifier_seq type_specifiers;
17766 /* Consume the `:'. */
17769 /* Parse the type-specifier-seq. */
17774 /* At this point this is surely not elaborated type specifier. */
17783 /* If that didn't work, stop. */
17785 {
17791 }
17792 }
17794 /* Look for the `{' but don't consume it yet. */
17796 {
17798 {
17801 {
17804 }
17805 }
17806 /* An opaque-enum-specifier must have a ';' here. */
17809 {
17812 {
17815 }
17816 }
17817 }
17823 {
17825 {
17829 }
17831 {
17833 }
17834 }
17836 /* Issue an error message if type-definitions are forbidden here. */
17839 else
17840 /* Create the new type. We do this before consuming the opening
17841 brace so the enum will be recorded as being on the line of its
17842 tag (or the 'enum' keyword, if there is no tag). */
17846 /* If the next token is not '{' it is an opaque-enum-specifier or an
17847 elaborated-type-specifier. */
17849 {
17853 {
17854 /* The following catches invalid code such as:
17855 enum class S<int>::E { A, B, C }; */
17863 {
17867 nested_name_specifier);
17869 }
17872 {
17874 "%qT for enum declaration does not name a class "
17877 }
17878 /* If that scope does not contain the scope in which the
17879 class was originally declared, the program is invalid. */
17881 nested_name_specifier))
17882 {
17885 "declaration of %qD in namespace %qD which does not "
17888 else
17890 "declaration of %qD in %qD which does not "
17894 }
17895 /* If that scope is the scope where the declaration is being placed
17896 the program is invalid. */
17900 {
17904 }
17905 }
17910 /* Consume the opening brace. */
17917 {
17921 }
17922 else
17923 {
17929 }
17933 /* If the next token is not '}', then there are some enumerators. */
17935 {
17939 }
17940 else
17943 /* Consume the final '}'. */
17949 }
17950 else
17951 {
17952 /* If a ';' follows, then it is an opaque-enum-specifier
17953 and additional restrictions apply. */
17955 {
17962 }
17963 }
17965 /* Look for trailing attributes to apply to this enumeration, and
17966 apply them if appropriate. */
17968 {
17971 trailing_attr,
17973 }
17975 /* Finish up the enumeration. */
17977 {
17982 }
17985 {
17987 {
17990 }
17992 {
17994 }
17995 }
17996 out:
17999 }
18001 /* Parse an enumerator-list. The enumerators all have the indicated
18002 TYPE.
18004 enumerator-list:
18005 enumerator-definition
18006 enumerator-list , enumerator-definition */
18008 static void
18010 {
18012 {
18013 /* Parse an enumerator-definition. */
18016 /* If the next token is not a ',', we've reached the end of
18017 the list. */
18020 /* Otherwise, consume the `,' and keep going. */
18022 /* If the next token is a `}', there is a trailing comma. */
18024 {
18029 }
18030 }
18031 }
18033 /* Parse an enumerator-definition. The enumerator has the indicated
18034 TYPE.
18036 enumerator-definition:
18037 enumerator
18038 enumerator = constant-expression
18040 enumerator:
18041 identifier
18043 GNU Extensions:
18045 enumerator-definition:
18046 enumerator attributes [opt]
18047 enumerator attributes [opt] = constant-expression */
18049 static void
18051 {
18052 tree identifier;
18053 tree value;
18054 location_t loc;
18056 /* Save the input location because we are interested in the location
18057 of the identifier and not the location of the explicit value. */
18060 /* Look for the identifier. */
18065 /* Parse any specified attributes. */
18068 /* If the next token is an '=', then there is an explicit value. */
18070 {
18071 /* Consume the `=' token. */
18073 /* Parse the value. */
18075 }
18076 else
18079 /* If we are processing a template, make sure the initializer of the
18080 enumerator doesn't contain any bare template parameter pack. */
18084 /* Create the enumerator. */
18086 }
18088 /* Parse a namespace-name.
18090 namespace-name:
18091 original-namespace-name
18092 namespace-alias
18094 Returns the NAMESPACE_DECL for the namespace. */
18096 static tree
18098 {
18099 tree identifier;
18100 tree namespace_decl;
18104 /* Get the name of the namespace. */
18109 /* Look up the identifier in the currently active scope. Look only
18110 for namespaces, due to:
18112 [basic.lookup.udir]
18114 When looking up a namespace-name in a using-directive or alias
18115 definition, only namespace names are considered.
18117 And:
18119 [basic.lookup.qual]
18121 During the lookup of a name preceding the :: scope resolution
18122 operator, object, function, and enumerator names are ignored.
18124 (Note that cp_parser_qualifying_entity only calls this
18125 function if the token after the name is the scope resolution
18126 operator.) */
18128 none_type,
18134 /* If it's not a namespace, issue an error. */
18137 {
18142 }
18145 }
18147 /* Parse a namespace-definition.
18149 namespace-definition:
18150 named-namespace-definition
18151 unnamed-namespace-definition
18153 named-namespace-definition:
18154 original-namespace-definition
18155 extension-namespace-definition
18157 original-namespace-definition:
18158 namespace identifier { namespace-body }
18160 extension-namespace-definition:
18161 namespace original-namespace-name { namespace-body }
18163 unnamed-namespace-definition:
18164 namespace { namespace-body } */
18166 static void
18168 {
18178 {
18182 }
18183 else
18186 /* Look for the `namespace' keyword. */
18189 /* Parse any specified attributes before the identifier. */
18192 /* Get the name of the namespace. We do not attempt to distinguish
18193 between an original-namespace-definition and an
18194 extension-namespace-definition at this point. The semantic
18195 analysis routines are responsible for that. */
18198 else
18201 /* Parse any specified attributes after the identifier. */
18204 {
18207 else
18209 }
18211 /* Start the namespace. */
18214 /* Parse any nested namespace definition. */
18216 {
18221 "nested namespace definitions only available with "
18226 {
18230 else
18231 {
18234 }
18237 }
18238 }
18240 /* Look for the `{' to validate starting the namespace. */
18243 /* "inline namespace" is equivalent to a stub namespace definition
18244 followed by a strong using directive. */
18246 {
18248 /* Set up namespace association. */
18252 /* Import the contents of the inline namespace. */
18256 }
18262 /* Parse the body of the namespace. */
18268 /* Finish the nested namespace definitions. */
18272 /* Finish the namespace. */
18275 /* Look for the final `}'. */
18277 }
18279 /* Parse a namespace-body.
18281 namespace-body:
18282 declaration-seq [opt] */
18284 static void
18286 {
18288 }
18290 /* Parse a namespace-alias-definition.
18292 namespace-alias-definition:
18293 namespace identifier = qualified-namespace-specifier ; */
18295 static void
18297 {
18298 tree identifier;
18299 tree namespace_specifier;
18303 /* Look for the `namespace' keyword. */
18305 /* Look for the identifier. */
18309 /* Look for the `=' token. */
18312 {
18314 /* Skip the definition. */
18319 }
18321 /* Look for the qualified-namespace-specifier. */
18322 namespace_specifier
18324 /* Look for the `;' token. */
18327 /* Register the alias in the symbol table. */
18329 }
18331 /* Parse a qualified-namespace-specifier.
18333 qualified-namespace-specifier:
18334 :: [opt] nested-name-specifier [opt] namespace-name
18336 Returns a NAMESPACE_DECL corresponding to the specified
18337 namespace. */
18339 static tree
18341 {
18342 /* Look for the optional `::'. */
18346 /* Look for the optional nested-name-specifier. */
18354 }
18356 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18357 access declaration.
18359 using-declaration:
18360 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18361 using :: unqualified-id ;
18363 access-declaration:
18364 qualified-id ;
18366 */
18368 static bool
18371 {
18375 tree decl;
18376 tree identifier;
18377 tree qscope;
18382 {
18385 }
18386 else
18387 {
18388 /* Look for the `using' keyword. */
18391 again:
18392 /* Peek at the next token. */
18394 /* See if it's `typename'. */
18396 {
18397 /* Remember that we've seen it. */
18399 /* Consume the `typename' token. */
18401 }
18402 }
18404 /* Look for the optional global scope qualification. */
18405 global_scope_p
18410 /* If we saw `typename', or didn't see `::', then there must be a
18411 nested-name-specifier present. */
18413 {
18419 {
18422 }
18423 }
18424 /* Otherwise, we could be in either of the two productions. In that
18425 case, treat the nested-name-specifier as optional. */
18426 else
18438 /* Something has already gone wrong; there's no need to parse
18439 further. Since an error has occurred, the return value of
18440 cp_parser_parse_definitely will be false, as required. */
18444 /* Parse the unqualified-id. */
18452 {
18457 }
18459 {
18464 "pack expansion in using-declaration only available "
18467 }
18469 /* The function we call to handle a using-declaration is different
18470 depending on what scope we are in. */
18472 ;
18475 /* [namespace.udecl]
18477 A using declaration shall not name a template-id. */
18480 else
18481 {
18483 {
18484 /* Create the USING_DECL. */
18491 {
18494 }
18495 else
18496 /* Add it to the list of members in this class. */
18498 }
18499 else
18500 {
18502 identifier,
18509 {
18512 }
18515 else
18517 }
18518 }
18522 {
18526 "comma-separated list in using-declaration only available "
18529 }
18531 /* Look for the final `;'. */
18536 "access declarations are deprecated "
18537 "in favour of using-declarations; "
18541 }
18543 /* Parse an alias-declaration.
18545 alias-declaration:
18546 using identifier attribute-specifier-seq [opt] = type-id */
18548 static tree
18550 {
18552 location_t id_location;
18554 cp_decl_specifier_seq decl_specs;
18558 /* Look for the `using' keyword. */
18559 cp_token *using_token
18581 /* Now we are going to parse the type-id of the declaration. */
18583 /*
18584 [dcl.type]/3 says:
18586 "A type-specifier-seq shall not define a class or enumeration
18587 unless it appears in the type-id of an alias-declaration (7.1.3) that
18588 is not the declaration of a template-declaration."
18590 In other words, if we currently are in an alias template, the
18591 type-id should not define a type.
18593 So let's set parser->type_definition_forbidden_message in that
18594 case; cp_parser_check_type_definition (called by
18595 cp_parser_class_specifier) will then emit an error if a type is
18596 defined in the type-id. */
18598 {
18602 }
18606 /* Restore the error message if need be. */
18612 {
18615 }
18617 /* A typedef-name can also be introduced by an alias-declaration. The
18618 identifier following the using keyword becomes a typedef-name. It has
18619 the same semantics as if it were introduced by the typedef
18620 specifier. In particular, it does not define a new type and it shall
18621 not appear in the type-id. */
18626 {
18629 ds_attribute,
18630 attrs_token);
18631 }
18633 ds_typedef,
18634 using_token);
18636 ds_alias,
18637 using_token);
18646 else
18652 // Attach constraints to the alias declaration.
18654 {
18658 }
18665 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18666 added into the symbol table; otherwise, return the TYPE_DECL. */
18670 {
18674 }
18677 }
18679 /* Parse a using-directive.
18681 using-directive:
18682 using namespace :: [opt] nested-name-specifier [opt]
18683 namespace-name ; */
18685 static void
18687 {
18688 tree namespace_decl;
18689 tree attribs;
18691 /* Look for the `using' keyword. */
18693 /* And the `namespace' keyword. */
18695 /* Look for the optional `::' operator. */
18697 /* And the optional nested-name-specifier. */
18703 /* Get the namespace being used. */
18705 /* And any specified attributes. */
18707 /* Update the symbol table. */
18709 /* Look for the final `;'. */
18711 }
18713 /* Parse an asm-definition.
18715 asm-definition:
18716 asm ( string-literal ) ;
18718 GNU Extension:
18720 asm-definition:
18721 asm volatile [opt] ( string-literal ) ;
18722 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18723 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18724 : asm-operand-list [opt] ) ;
18725 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18726 : asm-operand-list [opt]
18727 : asm-clobber-list [opt] ) ;
18728 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18729 : asm-clobber-list [opt]
18730 : asm-goto-list ) ; */
18732 static void
18734 {
18735 tree string;
18740 tree asm_stmt;
18748 /* Look for the `asm' keyword. */
18753 {
18756 }
18758 /* See if the next token is `volatile'. */
18761 {
18762 /* Remember that we saw the `volatile' keyword. */
18764 /* Consume the token. */
18766 }
18770 {
18771 /* Remember that we saw the `goto' keyword. */
18773 /* Consume the token. */
18775 }
18776 /* Look for the opening `('. */
18779 /* Look for the string. */
18782 {
18786 }
18788 /* If we're allowing GNU extensions, check for the extended assembly
18789 syntax. Unfortunately, the `:' tokens need not be separated by
18790 a space in C, and so, for compatibility, we tolerate that here
18791 too. Doing that means that we have to treat the `::' operator as
18792 two `:' tokens. */
18797 {
18802 /* The extended syntax was used. */
18805 /* Look for outputs. */
18807 {
18808 /* Consume the `:'. */
18810 /* Parse the output-operands. */
18812 CPP_COLON)
18814 CPP_SCOPE)
18816 CPP_CLOSE_PAREN)
18818 {
18822 }
18823 }
18824 /* If the next token is `::', there are no outputs, and the
18825 next token is the beginning of the inputs. */
18827 /* The inputs are coming next. */
18830 /* Look for inputs. */
18833 {
18834 /* Consume the `:' or `::'. */
18836 /* Parse the output-operands. */
18838 CPP_COLON)
18840 CPP_SCOPE)
18842 CPP_CLOSE_PAREN))
18843 {
18847 }
18848 }
18850 /* The clobbers are coming next. */
18853 /* Look for clobbers. */
18856 {
18858 /* Consume the `:' or `::'. */
18860 /* Parse the clobbers. */
18862 CPP_COLON)
18864 CPP_CLOSE_PAREN))
18866 }
18869 /* The labels are coming next. */
18872 /* Look for labels. */
18875 {
18877 /* Consume the `:' or `::'. */
18879 /* Parse the labels. */
18881 }
18885 }
18889 /* Look for the closing `)'. */
18897 {
18898 /* Create the ASM_EXPR. */
18900 {
18903 /* If the extended syntax was not used, mark the ASM_EXPR. */
18905 {
18911 }
18912 }
18913 else
18915 }
18916 }
18918 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18919 type that comes from the decl-specifier-seq. */
18921 static tree
18923 {
18926 {
18939 }
18942 }
18944 /* Declarators [gram.dcl.decl] */
18946 /* Parse an init-declarator.
18948 init-declarator:
18949 declarator initializer [opt]
18951 GNU Extension:
18953 init-declarator:
18954 declarator asm-specification [opt] attributes [opt] initializer [opt]
18956 function-definition:
18957 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18958 function-body
18959 decl-specifier-seq [opt] declarator function-try-block
18961 GNU Extension:
18963 function-definition:
18964 __extension__ function-definition
18966 TM Extension:
18968 function-definition:
18969 decl-specifier-seq [opt] declarator function-transaction-block
18971 The DECL_SPECIFIERS apply to this declarator. Returns a
18972 representation of the entity declared. If MEMBER_P is TRUE, then
18973 this declarator appears in a class scope. The new DECL created by
18974 this declarator is returned.
18976 The CHECKS are access checks that should be performed once we know
18977 what entity is being declared (and, therefore, what classes have
18978 befriended it).
18980 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18981 for a function-definition here as well. If the declarator is a
18982 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18983 be TRUE upon return. By that point, the function-definition will
18984 have been completely parsed.
18986 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18987 is FALSE.
18989 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18990 parsed declaration if it is an uninitialized single declarator not followed
18991 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18992 if present, will not be consumed. If returned, this declarator will be
18993 created with SD_INITIALIZED but will not call cp_finish_decl.
18995 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18996 and there is an initializer, the pointed location_t is set to the
18997 location of the '=' or `(', or '{' in C++11 token introducing the
18998 initializer. */
19000 static tree
19011 {
19015 tree prefix_attributes;
19017 tree asm_specification;
19018 tree initializer;
19020 tree scope;
19022 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19023 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19024 "(...)". */
19035 /* Gather the attributes that were provided with the
19036 decl-specifiers. */
19039 /* Assume that this is not the declarator for a function
19040 definition. */
19044 /* Default arguments are only permitted for function parameters. */
19048 /* Defer access checks while parsing the declarator; we cannot know
19049 what names are accessible until we know what is being
19050 declared. */
19055 /* Parse the declarator. */
19056 declarator
19061 /* Gather up the deferred checks. */
19066 /* If the DECLARATOR was erroneous, there's no need to go
19067 further. */
19071 /* Check that the number of template-parameter-lists is OK. */
19081 /* Figure out what scope the entity declared by the DECLARATOR is
19082 located in. `grokdeclarator' sometimes changes the scope, so
19083 we compute it now. */
19086 /* Perform any lookups in the declared type which were thought to be
19087 dependent, but are not in the scope of the declarator. */
19088 decl_specifiers->type
19091 /* If we're allowing GNU extensions, look for an
19092 asm-specification. */
19094 {
19095 /* Look for an asm-specification. */
19098 }
19099 else
19102 /* Look for attributes. */
19106 /* Peek at the next token. */
19112 {
19113 /* Handle C++17 deduction guides. */
19117 {
19125 {
19129 }
19130 }
19132 /* Check to see if the token indicates the start of a
19133 function-definition. */
19135 {
19137 {
19138 /* If a function-definition should not appear here, issue an
19139 error message. */
19143 }
19145 location_t func_brace_location
19148 /* Neither attributes nor an asm-specification are allowed
19149 on a function-definition. */
19152 "an asm-specification is not allowed "
19156 "attributes are not allowed "
19158 /* This is a function-definition. */
19161 /* Parse the function definition. */
19164 decl_specifiers,
19165 declarator,
19166 prefix_attributes);
19167 else
19168 decl =
19169 (cp_parser_function_definition_from_specifiers_and_declarator
19173 {
19174 /* This is where the prologue starts... */
19177 }
19180 }
19181 }
19183 {
19184 /* A non-template declaration involving a function parameter list
19185 containing an implicit template parameter will be made into a
19186 template. If the resulting declaration is not going to be an
19187 actual function then finish the template scope here to prevent it.
19188 An error message will be issued once we have a decl to talk about.
19190 FIXME probably we should do type deduction rather than create an
19191 implicit template, but the standard currently doesn't allow it. */
19194 }
19196 /* [dcl.dcl]
19198 Only in function declarations for constructors, destructors, type
19199 conversions, and deduction guides can the decl-specifier-seq be omitted.
19201 We explicitly postpone this check past the point where we handle
19202 function-definitions because we tolerate function-definitions
19203 that are missing their return types in some modes. */
19205 {
19209 }
19211 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19215 {
19226 {
19232 }
19233 }
19234 else
19235 {
19236 /* If the init-declarator isn't initialized and isn't followed by a
19237 `,' or `;', it's not a valid init-declarator. */
19240 {
19243 else
19244 {
19248 }
19249 }
19252 }
19254 /* Because start_decl has side-effects, we should only call it if we
19255 know we're going ahead. By this point, we know that we cannot
19256 possibly be looking at any other construct. */
19259 /* Enter the newly declared entry in the symbol table. If we're
19260 processing a declaration in a class-specifier, we wait until
19261 after processing the initializer. */
19263 {
19271 /* Adjust location of decl if declarator->id_loc is more appropriate:
19272 set, and decl wasn't merged with another decl, in which case its
19273 location would be different from input_location, and more accurate. */
19278 }
19280 /* Enter the SCOPE. That way unqualified names appearing in the
19281 initializer will be looked up in SCOPE. */
19284 /* Perform deferred access control checks, now that we know in which
19285 SCOPE the declared entity resides. */
19287 {
19290 /* If the entity being declared is a function, pretend that we
19291 are in its scope. If it is a `friend', it may have access to
19292 things that would not otherwise be accessible. */
19294 {
19297 }
19299 /* Perform access checks for template parameters. */
19302 /* Perform the access control checks for the declarator and the
19303 decl-specifiers. */
19306 /* Restore the saved value. */
19309 }
19311 /* Parse the initializer. */
19316 {
19318 {
19321 else
19322 {
19323 /* If the declaration was erroneous, we don't really
19324 know what the user intended, so just silently
19325 consume the initializer. */
19332 }
19333 }
19334 else
19335 {
19336 /* We want to record the extra mangling scope for in-class
19337 initializers of class members and initializers of static data
19338 member templates. The former involves deferring
19339 parsing of the initializer until end of class as with default
19340 arguments. So right here we only handle the latter. */
19350 }
19351 }
19353 /* The old parser allows attributes to appear after a parenthesized
19354 initializer. Mark Mitchell proposed removing this functionality
19355 on the GCC mailing lists on 2002-08-13. This parser accepts the
19356 attributes -- but ignores them. */
19363 /* And now complain about a non-function implicit template. */
19368 /* For an in-class declaration, use `grokfield' to create the
19369 declaration. */
19371 {
19373 {
19376 }
19385 }
19387 /* Finish processing the declaration. But, skip member
19388 declarations. */
19390 {
19393 asm_specification,
19394 /* If the initializer is in parentheses, then this is
19395 a direct-initialization, which means that an
19396 `explicit' constructor is OK. Otherwise, an
19397 `explicit' constructor cannot be used. */
19400 }
19403 /* Core issue #226 (C++0x only): A default template-argument
19404 shall not be specified in a friend class template
19405 declaration. */
19414 {
19417 else
19419 }
19426 }
19428 /* Parse a declarator.
19430 declarator:
19431 direct-declarator
19432 ptr-operator declarator
19434 abstract-declarator:
19435 ptr-operator abstract-declarator [opt]
19436 direct-abstract-declarator
19438 GNU Extensions:
19440 declarator:
19441 attributes [opt] direct-declarator
19442 attributes [opt] ptr-operator declarator
19444 abstract-declarator:
19445 attributes [opt] ptr-operator abstract-declarator [opt]
19446 attributes [opt] direct-abstract-declarator
19448 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19449 detect constructors, destructors, deduction guides, or conversion operators.
19450 It is set to -1 if the declarator is a name, and +1 if it is a
19451 function. Otherwise it is set to zero. Usually you just want to
19452 test for >0, but internally the negative value is used.
19454 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19455 a decl-specifier-seq unless it declares a constructor, destructor,
19456 or conversion. It might seem that we could check this condition in
19457 semantic analysis, rather than parsing, but that makes it difficult
19458 to handle something like `f()'. We want to notice that there are
19459 no decl-specifiers, and therefore realize that this is an
19460 expression, not a declaration.)
19462 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19463 the declarator is a direct-declarator of the form "(...)".
19465 MEMBER_P is true iff this declarator is a member-declarator.
19467 FRIEND_P is true iff this declarator is a friend. */
19471 cp_parser_declarator_kind dcl_kind,
19475 {
19478 cp_cv_quals cv_quals;
19479 tree class_type;
19482 /* Assume this is not a constructor, destructor, or type-conversion
19483 operator. */
19490 /* Check for the ptr-operator production. */
19492 /* Parse the ptr-operator. */
19498 /* If that worked, then we have a ptr-operator. */
19500 {
19501 /* If a ptr-operator was found, then this declarator was not
19502 parenthesized. */
19505 /* The dependent declarator is optional if we are parsing an
19506 abstract-declarator. */
19510 /* Parse the dependent declarator. */
19515 friend_p);
19517 /* If we are parsing an abstract-declarator, we must handle the
19518 case where the dependent declarator is absent. */
19523 declarator = cp_parser_make_indirect_declarator
19525 }
19526 /* Everything else is a direct-declarator. */
19527 else
19528 {
19531 CPP_OPEN_PAREN);
19533 ctor_dtor_or_conv_p,
19535 }
19540 }
19542 /* Parse a direct-declarator or direct-abstract-declarator.
19544 direct-declarator:
19545 declarator-id
19546 direct-declarator ( parameter-declaration-clause )
19547 cv-qualifier-seq [opt]
19548 ref-qualifier [opt]
19549 exception-specification [opt]
19550 direct-declarator [ constant-expression [opt] ]
19551 ( declarator )
19553 direct-abstract-declarator:
19554 direct-abstract-declarator [opt]
19555 ( parameter-declaration-clause )
19556 cv-qualifier-seq [opt]
19557 ref-qualifier [opt]
19558 exception-specification [opt]
19559 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19560 ( abstract-declarator )
19562 Returns a representation of the declarator. DCL_KIND is
19563 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19564 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19565 we are parsing a direct-declarator. It is
19566 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19567 of ambiguity we prefer an abstract declarator, as per
19568 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19569 as for cp_parser_declarator. */
19573 cp_parser_declarator_kind dcl_kind,
19576 {
19586 {
19587 /* Peek at the next token. */
19590 {
19591 /* This is either a parameter-declaration-clause, or a
19592 parenthesized declarator. When we know we are parsing a
19593 named declarator, it must be a parenthesized declarator
19594 if FIRST is true. For instance, `(int)' is a
19595 parameter-declaration-clause, with an omitted
19596 direct-abstract-declarator. But `((*))', is a
19597 parenthesized abstract declarator. Finally, when T is a
19598 template parameter `(T)' is a
19599 parameter-declaration-clause, and not a parenthesized
19600 named declarator.
19602 We first try and parse a parameter-declaration-clause,
19603 and then try a nested declarator (if FIRST is true).
19605 It is not an error for it not to be a
19606 parameter-declaration-clause, even when FIRST is
19607 false. Consider,
19609 int i (int);
19610 int i (3);
19612 The first is the declaration of a function while the
19613 second is the definition of a variable, including its
19614 initializer.
19616 Having seen only the parenthesis, we cannot know which of
19617 these two alternatives should be selected. Even more
19618 complex are examples like:
19620 int i (int (a));
19621 int i (int (3));
19623 The former is a function-declaration; the latter is a
19624 variable initialization.
19626 Thus again, we try a parameter-declaration-clause, and if
19627 that fails, we back out and return. */
19630 {
19631 tree params;
19634 /* In a member-declarator, the only valid interpretation
19635 of a parenthesis is the start of a
19636 parameter-declaration-clause. (It is invalid to
19637 initialize a static data member with a parenthesized
19638 initializer; only the "=" form of initialization is
19639 permitted.) */
19643 /* Consume the `('. */
19646 {
19647 /* If this is going to be an abstract declarator, we're
19648 in a declarator and we can't have default args. */
19651 }
19655 /* Parse the parameter-declaration-clause. */
19658 /* Consume the `)'. */
19661 /* If all went well, parse the cv-qualifier-seq,
19662 ref-qualifier and the exception-specification. */
19664 {
19665 cp_cv_quals cv_quals;
19666 cp_virt_specifiers virt_specifiers;
19667 cp_ref_qualifier ref_qual;
19668 tree exception_specification;
19669 tree late_return;
19670 tree attrs;
19680 /* Parse the cv-qualifier-seq. */
19682 /* Parse the ref-qualifier. */
19684 /* Parse the tx-qualifier. */
19686 /* And the exception-specification. */
19687 exception_specification
19692 /* In here, we handle cases where attribute is used after
19693 the function declaration. For example:
19694 void func (int x) __attribute__((vector(..))); */
19698 {
19702 CPP_SEMICOLON)
19704 CPP_OPEN_BRACE))
19707 ;
19708 else
19710 }
19712 late_return = (cp_parser_late_return_type_opt
19716 /* Parse the virt-specifier-seq. */
19719 /* Create the function-declarator. */
19721 params,
19722 cv_quals,
19723 virt_specifiers,
19724 ref_qual,
19725 tx_qual,
19726 exception_specification,
19727 late_return,
19728 requires_clause);
19731 /* Any subsequent parameter lists are to do with
19732 return type, so are not those of the declared
19733 function. */
19735 }
19737 /* Remove the function parms from scope. */
19741 /* Repeat the main loop. */
19743 }
19745 /* If this is the first, we can try a parenthesized
19746 declarator. */
19748 {
19754 /* Consume the `('. */
19756 /* Parse the nested declarator. */
19759 declarator
19765 /* Expect a `)'. */
19772 }
19773 /* Otherwise, we must be done. */
19774 else
19776 }
19780 {
19781 /* Parse an array-declarator. */
19790 /* Consume the `['. */
19792 /* Peek at the next token. */
19794 /* If the next token is `]', then there is no
19795 constant-expression. */
19797 {
19799 bounds
19809 {
19810 /* Normally, the array bound must be an integral constant
19811 expression. However, as an extension, we allow VLAs
19812 in function scopes as long as they aren't part of a
19813 parameter declaration. */
19817 }
19820 {
19821 /* Remember this wasn't a constant-expression. */
19824 }
19825 }
19826 else
19828 /* Look for the closing `]'. */
19830 {
19833 }
19838 }
19840 {
19841 {
19842 tree qualifying_scope;
19843 tree unqualified_name;
19844 tree attrs;
19845 special_function_kind sfk;
19850 /* Parse a declarator-id */
19853 {
19856 /* If we see an ellipsis, we should be looking at a
19857 parameter pack. */
19859 {
19860 /* Consume the `...' */
19864 }
19865 }
19868 unqualified_name
19872 {
19876 {
19877 /* Check whether an error occurred. */
19880 /* We already consumed the ellipsis to mark a
19881 parameter pack, but we have no way to report it,
19882 so abort the tentative parse. We will be exiting
19883 immediately anyway. */
19885 }
19886 else
19892 && (qualifying_scope
19894 {
19897 }
19898 }
19903 {
19908 }
19914 {
19915 /* In the declaration of a member of a template class
19916 outside of the class itself, the SCOPE will sometimes
19917 be a TYPENAME_TYPE. For example, given:
19919 template <typename T>
19920 int S<T>::R::i = 3;
19922 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19923 this context, we must resolve S<T>::R to an ordinary
19924 type, rather than a typename type.
19926 The reason we normally avoid resolving TYPENAME_TYPEs
19927 is that a specialization of `S' might render
19928 `S<T>::R' not a type. However, if `S' is
19929 specialized, then this `i' will not be used, so there
19930 is no harm in resolving the types here. */
19931 tree type;
19933 /* Resolve the TYPENAME_TYPE. */
19936 /* If that failed, the declarator is invalid. */
19938 {
19941 "cannot define member of dependent typedef "
19943 else
19948 }
19950 }
19955 {
19956 tree class_type;
19961 else
19965 {
19968 {
19971 {
19975 "use %<%T::%D%> instead of %<%T::%D%> to "
19977 class_type,
19982 }
19983 else
19985 }
19986 else
19987 {
19988 /* We do not attempt to print the declarator
19989 here because we do not have enough
19990 information about its original syntactic
19991 form. */
19995 }
19996 }
19999 {
20005 for an unnamed type, even if the type
20006 got a name for linkage purposes. */
20008 /* Handle correctly (c++/19200):
20010 struct S {
20011 struct T{};
20012 friend void S(T);
20013 };
20015 and also:
20017 namespace N {
20018 void S();
20019 }
20021 struct S {
20022 friend void N::S();
20023 }; */
20024 && !(friend_p
20027 class_type))
20028 {
20031 }
20039 }
20040 }
20042 unqualified_name,
20043 sfk);
20050 }
20052 handle_declarator:;
20055 {
20056 /* Any names that appear after the declarator-id for a
20057 member are looked up in the containing scope. */
20059 {
20060 /* But declarations with qualified-ids can't appear in a
20061 function. */
20065 }
20067 }
20071 /* Default args are only allowed on function
20072 declarations. */
20074 else
20078 }
20079 /* We're done. */
20080 else
20082 }
20084 /* For an abstract declarator, we might wind up with nothing at this
20085 point. That's an error; the declarator is not optional. */
20089 /* If we entered a scope, we must exit it now. */
20097 }
20099 /* Parse a ptr-operator.
20101 ptr-operator:
20102 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20103 * cv-qualifier-seq [opt]
20104 &
20105 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20106 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20108 GNU Extension:
20110 ptr-operator:
20111 & cv-qualifier-seq [opt]
20113 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20114 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20115 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20116 filled in with the TYPE containing the member. *CV_QUALS is
20117 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20118 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20119 Note that the tree codes returned by this function have nothing
20120 to do with the types of trees that will be eventually be created
20121 to represent the pointer or reference type being parsed. They are
20122 just constants with suggestive names. */
20123 static enum tree_code
20128 {
20133 /* Assume that it's not a pointer-to-member. */
20135 /* And that there are no cv-qualifiers. */
20138 /* Peek at the next token. */
20141 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20151 {
20152 /* Consume the `*', `&' or `&&'. */
20155 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20156 `&', if we are allowing GNU extensions. (The only qualifier
20157 that can legally appear after `&' is `restrict', but that is
20158 enforced during semantic analysis. */
20166 }
20167 else
20168 {
20169 /* Try the pointer-to-member case. */
20171 /* Look for the optional `::' operator. */
20174 /* Look for the nested-name specifier. */
20181 /* If we found it, and the next token is a `*', then we are
20182 indeed looking at a pointer-to-member operator. */
20185 {
20186 /* Indicate that the `*' operator was used. */
20194 else
20195 {
20196 /* The type of which the member is a member is given by the
20197 current SCOPE. */
20199 /* The next name will not be qualified. */
20203 /* Look for optional c++11 attributes. */
20207 /* Look for the optional cv-qualifier-seq. */
20209 }
20210 }
20211 /* If that didn't work we don't have a ptr-operator. */
20214 }
20217 }
20219 /* Parse an (optional) cv-qualifier-seq.
20221 cv-qualifier-seq:
20222 cv-qualifier cv-qualifier-seq [opt]
20224 cv-qualifier:
20225 const
20226 volatile
20228 GNU Extension:
20230 cv-qualifier:
20231 __restrict__
20233 Returns a bitmask representing the cv-qualifiers. */
20235 static cp_cv_quals
20237 {
20241 {
20243 cp_cv_quals cv_qualifier;
20245 /* Peek at the next token. */
20247 /* See if it's a cv-qualifier. */
20249 {
20265 }
20271 {
20274 }
20275 else
20276 {
20279 }
20280 }
20283 }
20285 /* Parse an (optional) ref-qualifier
20287 ref-qualifier:
20288 &
20289 &&
20291 Returns cp_ref_qualifier representing ref-qualifier. */
20293 static cp_ref_qualifier
20295 {
20298 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20303 {
20308 {
20320 }
20325 {
20328 }
20329 else
20330 {
20333 }
20334 }
20337 }
20339 /* Parse an optional tx-qualifier.
20341 tx-qualifier:
20342 transaction_safe
20343 transaction_safe_dynamic */
20345 static tree
20347 {
20350 {
20355 {
20359 {
20362 {
20365 }
20366 else
20368 }
20369 }
20370 }
20372 }
20374 /* Parse an (optional) virt-specifier-seq.
20376 virt-specifier-seq:
20377 virt-specifier virt-specifier-seq [opt]
20379 virt-specifier:
20380 override
20381 final
20383 Returns a bitmask representing the virt-specifiers. */
20385 static cp_virt_specifiers
20387 {
20391 {
20393 cp_virt_specifiers virt_specifier;
20395 /* Peek at the next token. */
20397 /* See if it's a virt-specifier-qualifier. */
20401 {
20404 }
20406 {
20409 }
20411 {
20413 }
20414 else
20418 {
20421 }
20422 else
20423 {
20426 }
20427 }
20429 }
20431 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20432 is in scope even though it isn't real. */
20434 void
20436 {
20437 tree this_parm;
20440 {
20441 /* We don't clear this between NSDMIs. Is it already what we want? */
20446 }
20449 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20451 current_class_ref
20454 }
20456 /* Return true iff our current scope is a non-static data member
20457 initializer. */
20459 bool
20461 {
20462 /* We recognize NSDMI context by the context-less 'this' pointer set up
20463 by the function above. */
20469 }
20471 /* Return true iff our current scope is a default capturing generic lambda
20472 defined within a template. FIXME: This is part of a workaround (see
20473 semantics.c) to handle building lambda closure types correctly in templates
20474 which we ultimately want to defer to instantiation time. */
20476 bool
20478 {
20496 }
20498 /* Parse a late-specified return type, if any. This is not a separate
20499 non-terminal, but part of a function declarator, which looks like
20501 -> trailing-type-specifier-seq abstract-declarator(opt)
20503 Returns the type indicated by the type-id.
20505 In addition to this, parse any queued up #pragma omp declare simd
20506 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20507 #pragma acc routine clauses.
20509 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20510 function. */
20512 static tree
20515 {
20519 && declarator
20526 && declarator
20529 /* Peek at the next token. */
20531 /* A late-specified return type is indicated by an initial '->'. */
20542 {
20543 /* DR 1207: 'this' is in scope in the trailing return type. */
20545 }
20548 {
20549 /* Consume the ->. */
20553 }
20555 /* Function declarations may be followed by a trailing
20556 requires-clause. */
20560 declarator->attributes
20564 declarator->attributes
20568 declarator->attributes
20573 {
20576 }
20579 }
20581 /* Parse a declarator-id.
20583 declarator-id:
20584 id-expression
20585 :: [opt] nested-name-specifier [opt] type-name
20587 In the `id-expression' case, the value returned is as for
20588 cp_parser_id_expression if the id-expression was an unqualified-id.
20589 If the id-expression was a qualified-id, then a SCOPE_REF is
20590 returned. The first operand is the scope (either a NAMESPACE_DECL
20591 or TREE_TYPE), but the second is still just a representation of an
20592 unqualified-id. */
20594 static tree
20596 {
20597 tree id;
20598 /* The expression must be an id-expression. Assume that qualified
20599 names are the names of types so that:
20601 template <class T>
20602 int S<T>::R::i = 3;
20604 will work; we must treat `S<T>::R' as the name of a type.
20605 Similarly, assume that qualified names are templates, where
20606 required, so that:
20608 template <class T>
20609 int S<T>::R<T>::i = 3;
20611 will work, too. */
20617 optional_p);
20621 }
20623 /* Parse a type-id.
20625 type-id:
20626 type-specifier-seq abstract-declarator [opt]
20628 Returns the TYPE specified. */
20630 static tree
20633 {
20634 cp_decl_specifier_seq type_specifier_seq;
20637 /* Parse the type-specifier-seq. */
20639 is_trailing_return,
20644 /* A bare template name as a template argument is a template template
20645 argument, not a placeholder, so fail parsing it as a type argument. */
20646 {
20650 }
20654 /* There might or might not be an abstract declarator. */
20656 /* Look for the declarator. */
20657 abstract_declarator
20662 /* Check to see if there really was a declarator. */
20667 /* The concepts TS allows 'auto' as a type-id. */
20669 /* None of the valid uses of 'auto' in C++14 involve the type-id
20670 nonterminal, but it is valid in a trailing-return-type. */
20673 {
20674 /* A type-id with type 'auto' is only ok if the abstract declarator
20675 is a function declarator with a late-specified return type.
20677 A type-id with 'auto' is also valid in a trailing-return-type
20678 in a compound-requirement. */
20685 else
20686 {
20689 {
20691 auto_node);
20693 tmpl);
20694 }
20695 else
20698 }
20699 }
20702 is_template_arg);
20703 }
20705 static tree
20707 {
20709 }
20711 static tree
20713 {
20714 tree r;
20716 parser->type_definition_forbidden_message
20721 {
20724 }
20726 }
20728 static tree
20730 {
20732 }
20734 /* Parse a type-specifier-seq.
20736 type-specifier-seq:
20737 type-specifier type-specifier-seq [opt]
20739 GNU extension:
20741 type-specifier-seq:
20742 attributes type-specifier-seq [opt]
20744 If IS_DECLARATION is true, we are at the start of a "condition" or
20745 exception-declaration, so we might be followed by a declarator-id.
20747 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20748 i.e. we've just seen "->".
20750 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20752 static void
20757 {
20762 /* Clear the TYPE_SPECIFIER_SEQ. */
20765 /* In the context of a trailing return type, enum E { } is an
20766 elaborated-type-specifier followed by a function-body, not an
20767 enum-specifier. */
20771 /* Parse the type-specifiers and attributes. */
20773 {
20774 tree type_specifier;
20777 /* Check for attributes first. */
20779 {
20784 }
20786 /* record the token of the beginning of the type specifier seq,
20787 for error reporting purposes*/
20791 /* Look for the type-specifier. */
20793 flags,
20794 type_specifier_seq,
20796 NULL,
20799 {
20800 /* If the first type-specifier could not be found, this is not a
20801 type-specifier-seq at all. */
20803 {
20804 /* Set in_declarator_p to avoid skipping to the semicolon. */
20816 }
20817 /* If subsequent type-specifiers could not be found, the
20818 type-specifier-seq is complete. */
20820 }
20823 /* The standard says that a condition can be:
20825 type-specifier-seq declarator = assignment-expression
20827 However, given:
20829 struct S {};
20830 if (int S = ...)
20832 we should treat the "S" as a declarator, not as a
20833 type-specifier. The standard doesn't say that explicitly for
20834 type-specifier-seq, but it does say that for
20835 decl-specifier-seq in an ordinary declaration. Perhaps it
20836 would be clearer just to allow a decl-specifier-seq here, and
20837 then add a semantic restriction that if any decl-specifiers
20838 that are not type-specifiers appear, the program is invalid. */
20841 }
20842 }
20844 /* Return whether the function currently being declared has an associated
20845 template parameter list. */
20847 static bool
20849 {
20862 }
20864 /* Parse a parameter-declaration-clause.
20866 parameter-declaration-clause:
20867 parameter-declaration-list [opt] ... [opt]
20868 parameter-declaration-list , ...
20870 Returns a representation for the parameter declarations. A return
20871 value of NULL indicates a parameter-declaration-clause consisting
20872 only of an ellipsis. */
20874 static tree
20876 {
20877 tree parameters;
20886 parser->auto_is_implicit_function_template_parm_p
20888 }
20894 && !processing_template_parmlist
20900 /* Peek at the next token. */
20902 /* Check for trivial parameter-declaration-clauses. */
20904 {
20905 /* Consume the `...' token. */
20908 }
20910 /* There are no parameters. */
20911 {
20912 #ifndef NO_IMPLICIT_EXTERN_C
20917 else
20918 #endif
20920 }
20921 /* Check for `(void)', too, which is a special case. */
20925 {
20926 /* Consume the `void' token. */
20928 /* There are no parameters. */
20930 }
20932 /* Parse the parameter-declaration-list. */
20934 /* If a parse error occurred while parsing the
20935 parameter-declaration-list, then the entire
20936 parameter-declaration-clause is erroneous. */
20940 /* Peek at the next token. */
20942 /* If it's a `,', the clause should terminate with an ellipsis. */
20944 {
20945 /* Consume the `,'. */
20947 /* Expect an ellipsis. */
20948 ellipsis_p
20950 }
20951 /* It might also be `...' if the optional trailing `,' was
20952 omitted. */
20954 {
20955 /* Consume the `...' token. */
20957 /* And remember that we saw it. */
20959 }
20960 else
20963 /* Finish the parameter list. */
20968 }
20970 /* Parse a parameter-declaration-list.
20972 parameter-declaration-list:
20973 parameter-declaration
20974 parameter-declaration-list , parameter-declaration
20976 Returns a representation of the parameter-declaration-list, as for
20977 cp_parser_parameter_declaration_clause. However, the
20978 `void_list_node' is never appended to the list. Upon return,
20979 *IS_ERROR will be true iff an error occurred. */
20981 static tree
20983 {
20989 /* Assume all will go well. */
20991 /* The special considerations that apply to a function within an
20992 unbraced linkage specifications do not apply to the parameters
20993 to the function. */
20994 saved_in_unbraced_linkage_specification_p
20998 /* Look for more parameters. */
21000 {
21008 /* Parse the parameter. */
21009 parameter
21014 /* We don't know yet if the enclosing context is deprecated, so wait
21015 and warn in grokparms if appropriate. */
21019 {
21020 /* If a function parameter pack was specified and an implicit template
21021 parameter was introduced during cp_parser_parameter_declaration,
21022 change any implicit parameters introduced into packs. */
21026 {
21034 }
21038 PARM,
21041 }
21045 /* If a parse error occurred parsing the parameter declaration,
21046 then the entire parameter-declaration-list is erroneous. */
21048 {
21052 }
21062 {
21066 }
21068 /* Add the new parameter to the list. */
21072 /* Peek at the next token. */
21075 /* These are for Objective-C++ */
21078 /* The parameter-declaration-list is complete. */
21081 {
21084 /* Peek at the next token. */
21086 /* If it's an ellipsis, then the list is complete. */
21089 /* Otherwise, there must be more parameters. Consume the
21090 `,'. */
21092 /* When parsing something like:
21094 int i(float f, double d)
21096 we can tell after seeing the declaration for "f" that we
21097 are not looking at an initialization of a variable "i",
21098 but rather at the declaration of a function "i".
21100 Due to the fact that the parsing of template arguments
21101 (as specified to a template-id) requires backtracking we
21102 cannot use this technique when inside a template argument
21103 list. */
21107 /* However, a parameter-declaration of the form
21108 "float(f)" (which is a valid declaration of a
21109 parameter "f") can also be interpreted as an
21110 expression (the conversion of "f" to "float"). */
21113 }
21114 else
21115 {
21123 }
21124 }
21126 parser->in_unbraced_linkage_specification_p
21129 /* Reset implicit_template_scope if we are about to leave the function
21130 parameter list that introduced it. Note that for out-of-line member
21131 definitions, there will be one or more class scopes before we get to
21132 the template parameter scope. */
21136 {
21140 {
21143 }
21144 }
21147 }
21149 /* Parse a parameter declaration.
21151 parameter-declaration:
21152 decl-specifier-seq ... [opt] declarator
21153 decl-specifier-seq declarator = assignment-expression
21154 decl-specifier-seq ... [opt] abstract-declarator [opt]
21155 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21157 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21158 declares a template parameter. (In that case, a non-nested `>'
21159 token encountered during the parsing of the assignment-expression
21160 is not interpreted as a greater-than operator.)
21162 Returns a representation of the parameter, or NULL if an error
21163 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21164 true iff the declarator is of the form "(p)". */
21170 {
21172 cp_decl_specifier_seq decl_specifiers;
21174 tree default_argument;
21179 /* In a template parameter, `>' is not an operator.
21181 [temp.param]
21183 When parsing a default template-argument for a non-type
21184 template-parameter, the first non-nested `>' is taken as the end
21185 of the template parameter-list rather than a greater-than
21186 operator. */
21188 /* Type definitions may not appear in parameter types. */
21190 parser->type_definition_forbidden_message
21193 /* Parse the declaration-specifiers. */
21195 CP_PARSER_FLAGS_NONE,
21199 /* Complain about missing 'typename' or other invalid type names. */
21204 /* If an error occurred, there's no reason to attempt to parse the
21205 rest of the declaration. */
21207 {
21210 }
21212 /* Peek at the next token. */
21215 /* If the next token is a `)', `,', `=', `>', or `...', then there
21216 is no declarator. However, when variadic templates are enabled,
21217 there may be a declarator following `...'. */
21222 {
21226 }
21227 /* Otherwise, there should be a declarator. */
21228 else
21229 {
21233 /* After seeing a decl-specifier-seq, if the next token is not a
21234 "(", there is no possibility that the code is a valid
21235 expression. Therefore, if parsing tentatively, we commit at
21236 this point. */
21238 /* In an expression context, having seen:
21240 (int((char ...
21242 we cannot be sure whether we are looking at a
21243 function-type (taking a "char" as a parameter) or a cast
21244 of some object of type "char" to "int". */
21250 /* Parse the declarator. */
21253 CP_PARSER_DECLARATOR_EITHER,
21255 parenthesized_p,
21259 /* After the declarator, allow more attributes. */
21260 decl_specifiers.attributes
21264 /* If the declarator is a template parameter pack, remember that and
21265 clear the flag in the declarator itself so we don't get errors
21266 from grokdeclarator. */
21268 {
21271 }
21272 }
21274 /* If the next token is an ellipsis, and we have not seen a declarator
21275 name, and if either the type of the declarator contains parameter
21276 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21277 for, eg, abbreviated integral type names), then we actually have a
21278 parameter pack expansion expression. Otherwise, leave the ellipsis
21279 for a C-style variadic function. */
21282 {
21293 {
21294 /* Consume the `...'. */
21298 /* Build a pack expansion type */
21303 else
21305 }
21306 }
21308 /* The restriction on defining new types applies only to the type
21309 of the parameter, not to the default argument. */
21312 /* If the next token is `=', then process a default argument. */
21314 {
21317 /* If we are defining a class, then the tokens that make up the
21318 default argument must be saved and processed later. */
21324 // A constrained-type-specifier may declare a type template-parameter.
21326 default_argument
21329 // A constrained-type-specifier may declare a template-template-parameter.
21331 default_argument
21334 /* Outside of a class definition, we can just parse the
21335 assignment-expression. */
21336 else
21337 default_argument
21341 {
21343 "default arguments are only "
21345 }
21347 || template_parameter_pack_p
21350 {
21351 /* Find the name of the parameter pack. */
21358 template_parm_p
21364 else
21366 template_parm_p
21373 }
21374 }
21375 else
21379 declarator,
21380 default_argument,
21381 template_parameter_pack_p);
21382 }
21384 /* Parse a default argument and return it.
21386 TEMPLATE_PARM_P is true if this is a default argument for a
21387 non-type template parameter. */
21388 static tree
21390 {
21396 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21397 set correctly. */
21400 /* Local variable names (and the `this' keyword) may not
21401 appear in a default argument. */
21404 /* Parse the assignment-expression. */
21409 /* The "this" pointer is not valid in a default argument. */
21411 {
21416 }
21417 default_argument
21419 /* Restore the "this" pointer. */
21421 {
21424 }
21433 }
21435 /* Parse a function-body.
21437 function-body:
21438 compound_statement */
21440 static void
21442 {
21446 }
21448 /* Parse a ctor-initializer-opt followed by a function-body. Return
21449 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21450 is true we are parsing a function-try-block. */
21452 static bool
21455 {
21463 /* Begin the function body. */
21465 /* Parse the optional ctor-initializer. */
21468 /* If we're parsing a constexpr constructor definition, we need
21469 to check that the constructor body is indeed empty. However,
21470 before we get to cp_parser_function_body lot of junk has been
21471 generated, so we can't just check that we have an empty block.
21472 Rather we take a snapshot of the outermost block, and check whether
21473 cp_parser_function_body changed its state. */
21475 {
21479 }
21480 /* Parse the function-body. */
21484 /* Finish the function body. */
21488 }
21490 /* Parse an initializer.
21492 initializer:
21493 = initializer-clause
21494 ( expression-list )
21496 Returns an expression representing the initializer. If no
21497 initializer is present, NULL_TREE is returned.
21499 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21500 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21501 set to TRUE if there is no initializer present. If there is an
21502 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21503 is set to true; otherwise it is set to false. */
21505 static tree
21508 {
21510 tree init;
21512 /* Peek at the next token. */
21515 /* Let our caller know whether or not this initializer was
21516 parenthesized. */
21518 /* Assume that the initializer is constant. */
21522 {
21523 /* Consume the `='. */
21525 /* Parse the initializer-clause. */
21527 }
21529 {
21534 non_constant_p);
21539 }
21541 {
21546 }
21547 else
21548 {
21549 /* Anything else is an error. */
21552 }
21558 }
21560 /* Parse an initializer-clause.
21562 initializer-clause:
21563 assignment-expression
21564 braced-init-list
21566 Returns an expression representing the initializer.
21568 If the `assignment-expression' production is used the value
21569 returned is simply a representation for the expression.
21571 Otherwise, calls cp_parser_braced_list. */
21573 static cp_expr
21575 {
21576 cp_expr initializer;
21578 /* Assume the expression is constant. */
21581 /* If it is not a `{', then we are looking at an
21582 assignment-expression. */
21584 {
21585 initializer
21588 non_constant_p);
21589 }
21590 else
21594 }
21596 /* Parse a brace-enclosed initializer list.
21598 braced-init-list:
21599 { initializer-list , [opt] }
21600 { }
21602 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21603 the elements of the initializer-list (or NULL, if the last
21604 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21605 NULL_TREE. There is no way to detect whether or not the optional
21606 trailing `,' was provided. NON_CONSTANT_P is as for
21607 cp_parser_initializer. */
21609 static cp_expr
21611 {
21612 tree initializer;
21615 /* Consume the `{' token. */
21617 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21619 /* If it's not a `}', then there is a non-trivial initializer. */
21621 {
21622 /* Parse the initializer list. */
21625 /* A trailing `,' token is allowed. */
21628 }
21629 else
21631 /* Now, there should be a trailing `}'. */
21637 /* Build a location of the form:
21638 { ... }
21639 ^~~~~~~
21640 with caret==start at the open brace, finish at the close brace. */
21644 }
21646 /* Consume tokens up to, and including, the next non-nested closing `]'.
21647 Returns true iff we found a closing `]'. */
21649 static bool
21651 {
21655 {
21659 {
21662 /* If we've run out of tokens, then there is no closing `]'. */
21671 {
21674 }
21679 }
21681 /* Consume the token. */
21683 }
21684 }
21686 /* Return true if we are looking at an array-designator, false otherwise. */
21688 static bool
21690 {
21691 /* Consume the `['. */
21696 /* Skip tokens until the next token is a closing square bracket.
21697 If we find the closing `]', and the next token is a `=', then
21698 we are looking at an array designator. */
21699 bool array_designator_p
21703 /* Roll back the tokens we skipped. */
21707 }
21709 /* Parse an initializer-list.
21711 initializer-list:
21712 initializer-clause ... [opt]
21713 initializer-list , initializer-clause ... [opt]
21715 GNU Extension:
21717 initializer-list:
21718 designation initializer-clause ...[opt]
21719 initializer-list , designation initializer-clause ...[opt]
21721 designation:
21722 . identifier =
21723 identifier :
21724 [ constant-expression ] =
21726 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21727 for the initializer. If the INDEX of the elt is non-NULL, it is the
21728 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21729 as for cp_parser_initializer. */
21733 {
21736 /* Assume all of the expressions are constant. */
21739 /* Parse the rest of the list. */
21741 {
21743 tree designator;
21744 tree initializer;
21747 /* If the next token is an identifier and the following one is a
21748 colon, we are looking at the GNU designated-initializer
21749 syntax. */
21753 {
21754 /* Warn the user that they are using an extension. */
21757 /* Consume the identifier. */
21759 /* Consume the `:'. */
21761 }
21762 /* Also handle the C99 syntax, '. id ='. */
21767 {
21768 /* Warn the user that they are using an extension. */
21771 /* Consume the `.'. */
21773 /* Consume the identifier. */
21775 /* Consume the `='. */
21777 }
21778 /* Also handle C99 array designators, '[ const ] ='. */
21782 {
21783 /* In C++11, [ could start a lambda-introducer. */
21789 {
21792 }
21793 else
21794 {
21799 }
21805 }
21806 else
21809 /* Parse the initializer. */
21812 /* If any clause is non-constant, so is the entire initializer. */
21816 /* If we have an ellipsis, this is an initializer pack
21817 expansion. */
21819 {
21820 /* Consume the `...'. */
21823 /* Turn the initializer into an initializer expansion. */
21825 }
21827 /* Add it to the vector. */
21830 /* If the next token is not a comma, we have reached the end of
21831 the list. */
21835 /* Peek at the next token. */
21837 /* If the next token is a `}', then we're still done. An
21838 initializer-clause can have a trailing `,' after the
21839 initializer-list and before the closing `}'. */
21843 /* Consume the `,' token. */
21845 }
21848 }
21850 /* Classes [gram.class] */
21852 /* Parse a class-name.
21854 class-name:
21855 identifier
21856 template-id
21858 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21859 to indicate that names looked up in dependent types should be
21860 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21861 keyword has been used to indicate that the name that appears next
21862 is a template. TAG_TYPE indicates the explicit tag given before
21863 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21864 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21865 is the class being defined in a class-head. If ENUM_OK is TRUE,
21866 enum-names are also accepted.
21868 Returns the TYPE_DECL representing the class. */
21870 static tree
21879 {
21880 tree decl;
21881 tree scope;
21886 /* All class-names start with an identifier. */
21889 {
21892 }
21894 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21895 to a template-id, so we save it here. */
21900 /* Any name names a type if we're following the `typename' keyword
21901 in a qualified name where the enclosing scope is type-dependent. */
21904 /* Handle the common case (an identifier, but not a template-id)
21905 efficiently. */
21908 {
21912 /* Look for the identifier. */
21916 /* If the next token isn't an identifier, we are certainly not
21917 looking at a class-name. */
21920 /* If we know this is a type-name, there's no need to look it
21921 up. */
21924 else
21925 {
21926 tree ambiguous_decls;
21927 /* If we already know that this lookup is ambiguous, then
21928 we've already issued an error message; there's no reason
21929 to check again. */
21931 {
21934 }
21935 /* If the next token is a `::', then the name must be a type
21936 name.
21938 [basic.lookup.qual]
21940 During the lookup for a name preceding the :: scope
21941 resolution operator, object, function, and enumerator
21942 names are ignored. */
21945 /* Look up the name. */
21947 tag_type,
21950 check_dependency_p,
21954 {
21958 }
21959 }
21960 }
21961 else
21962 {
21963 /* Try a template-id. */
21965 check_dependency_p,
21966 tag_type,
21967 is_declaration);
21970 }
21974 /* If this is a typename, create a TYPENAME_TYPE. */
21976 {
21981 }
21985 /* Check to see that it is really the name of a class. */
21989 /* Situations like this:
21991 template <typename T> struct A {
21992 typename T::template X<int>::I i;
21993 };
21995 are problematic. Is `T::template X<int>' a class-name? The
21996 standard does not seem to be definitive, but there is no other
21997 valid interpretation of the following `::'. Therefore, those
21998 names are considered class-names. */
21999 {
22003 }
22008 /* In Objective-C 2.0, a classname followed by '.' starts a
22009 dot-syntax expression, and it's not a type-name. */
22021 }
22023 /* Parse a class-specifier.
22025 class-specifier:
22026 class-head { member-specification [opt] }
22028 Returns the TREE_TYPE representing the class. */
22030 static tree
22032 {
22033 tree type;
22047 /* Parse the class-head. */
22050 /* If the class-head was a semantic disaster, skip the entire body
22051 of the class. */
22053 {
22057 }
22059 /* Look for the `{'. */
22061 {
22064 }
22069 /* Issue an error message if type-definitions are forbidden here. */
22071 /* Remember that we are defining one more class. */
22073 /* Inside the class, surrounding template-parameter-lists do not
22074 apply. */
22075 saved_num_template_parameter_lists
22078 /* We are not in a function body. */
22081 /* Or in a loop. */
22084 /* Or in a switch. */
22087 /* We are not immediately inside an extern "lang" block. */
22088 saved_in_unbraced_linkage_specification_p
22092 // Associate constraints with the type.
22096 /* Start the class. */
22098 {
22101 }
22105 /* If the type is erroneous, skip the entire body of the class. */
22107 else
22108 /* Parse the member-specification. */
22111 /* Look for the trailing `}'. */
22113 /* Look for trailing attributes to apply to this class. */
22121 /* We've finished a type definition. Check for the common syntax
22122 error of forgetting a semicolon after the definition. We need to
22123 be careful, as we can't just check for not-a-semicolon and be done
22124 with it; the user might have typed:
22126 class X { } c = ...;
22127 class X { } *p = ...;
22129 and so forth. Instead, enumerate all the possible tokens that
22130 might follow this production; if we don't see one of them, then
22131 complain and silently insert the semicolon. */
22132 {
22137 /* Don't try to parse c++11 attributes here. As per the
22138 grammar, that should be a task for
22139 cp_parser_decl_specifier_seq. */
22143 {
22154 /* While it's legal for type qualifiers and storage class
22155 specifiers to follow type definitions in the grammar, only
22156 compiler testsuites contain code like that. Assume that if
22157 we see such code, then what we're really seeing is a case
22158 like:
22160 class X { }
22161 const <type> var = ...;
22163 or
22165 class Y { }
22166 static <type> func (...) ...
22168 i.e. the qualifier or specifier applies to the next
22169 declaration. To do so, however, we need to look ahead one
22170 more token to see if *that* token is a type specifier.
22172 This code could be improved to handle:
22174 class Z { }
22175 static const <type> var = ...; */
22178 {
22181 /* Handling user-defined types here would be nice, but very
22182 tricky. */
22183 want_semicolon
22186 }
22190 }
22192 /* If we don't have a type, then something is very wrong and we
22193 shouldn't try to do anything clever. Likewise for not seeing the
22194 closing brace. */
22196 {
22197 /* Locate the closing brace. */
22198 cp_token_position prev
22203 /* We want to suggest insertion of a ';' immediately *after* the
22204 closing brace, so, if we can, offset the location by 1 column. */
22211 /* If we successfully offset the location, suggest the fix-it. */
22224 else
22227 /* Unget one token and smash it to look as though we encountered
22228 a semicolon in the input stream. */
22233 }
22234 }
22236 /* If this class is not itself within the scope of another class,
22237 then we need to parse the bodies of all of the queued function
22238 definitions. Note that the queued functions defined in a class
22239 are not always processed immediately following the
22240 class-specifier for that class. Consider:
22242 struct A {
22243 struct B { void f() { sizeof (A); } };
22244 };
22246 If `f' were processed before the processing of `A' were
22247 completed, there would be no way to compute the size of `A'.
22248 Note that the nesting we are interested in here is lexical --
22249 not the semantic nesting given by TYPE_CONTEXT. In particular,
22250 for:
22252 struct A { struct B; };
22253 struct A::B { void f() { } };
22255 there is no need to delay the parsing of `A::B::f'. */
22257 {
22258 tree decl;
22265 /* In a first pass, parse default arguments to the functions.
22266 Then, in a second pass, parse the bodies of the functions.
22267 This two-phased approach handles cases like:
22269 struct S {
22270 void f() { g(); }
22271 void g(int i = 3);
22272 };
22274 */
22276 {
22278 /* If there are default arguments that have not yet been processed,
22279 take care of them now. */
22281 {
22286 }
22287 /* Make sure that any template parameters are in scope. */
22289 /* Parse the default argument expressions. */
22291 /* Remove any template parameters from the symbol table. */
22293 }
22295 /* Now parse any NSDMIs. */
22299 {
22301 {
22306 }
22309 }
22316 /* Now do some post-NSDMI bookkeeping. */
22322 /* Now parse the body of the functions. */
22324 {
22325 /* OpenMP UDRs need to be parsed before all other functions. */
22332 }
22333 else
22337 }
22338 else
22341 /* Put back any saved access checks. */
22344 /* Restore saved state. */
22348 parser->num_template_parameter_lists
22350 parser->in_unbraced_linkage_specification_p
22354 }
22356 static tree
22358 {
22359 tree ret;
22364 }
22366 /* Parse a class-head.
22368 class-head:
22369 class-key identifier [opt] base-clause [opt]
22370 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22371 class-key nested-name-specifier [opt] template-id
22372 base-clause [opt]
22374 class-virt-specifier:
22375 final
22377 GNU Extensions:
22378 class-key attributes identifier [opt] base-clause [opt]
22379 class-key attributes nested-name-specifier identifier base-clause [opt]
22380 class-key attributes nested-name-specifier [opt] template-id
22381 base-clause [opt]
22383 Upon return BASES is initialized to the list of base classes (or
22384 NULL, if there are none) in the same form returned by
22385 cp_parser_base_clause.
22387 Returns the TYPE of the indicated class. Sets
22388 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22389 involving a nested-name-specifier was used, and FALSE otherwise.
22391 Returns error_mark_node if this is not a class-head.
22393 Returns NULL_TREE if the class-head is syntactically valid, but
22394 semantically invalid in a way that means we should skip the entire
22395 body of the class. */
22397 static tree
22400 {
22401 tree nested_name_specifier;
22405 tree attributes;
22406 tree bases;
22416 /* Assume no nested-name-specifier will be present. */
22418 /* Assume no template parameter lists will be used in defining the
22419 type. */
22423 /* Look for the class-key. */
22430 /* Parse the attributes. */
22433 /* If the next token is `::', that is invalid -- but sometimes
22434 people do try to write:
22436 struct ::S {};
22438 Handle this gracefully by accepting the extra qualifier, and then
22439 issuing an error about it later if this really is a
22440 class-head. If it turns out just to be an elaborated type
22441 specifier, remain silent. */
22447 /* Determine the name of the class. Begin by looking for an
22448 optional nested-name-specifier. */
22450 nested_name_specifier
22456 /* If there was a nested-name-specifier, then there *must* be an
22457 identifier. */
22459 {
22461 /* Although the grammar says `identifier', it really means
22462 `class-name' or `template-name'. You are only allowed to
22463 define a class that has already been declared with this
22464 syntax.
22466 The proposed resolution for Core Issue 180 says that wherever
22467 you see `class T::X' you should treat `X' as a type-name.
22469 It is OK to define an inaccessible class; for example:
22471 class A { class B; };
22472 class A::B {};
22474 We do not know if we will see a class-name, or a
22475 template-name. We look for a class-name first, in case the
22476 class-name is a template-id; if we looked for the
22477 template-name first we would stop after the template-name. */
22482 class_type,
22486 /* If that didn't work, ignore the nested-name-specifier. */
22488 {
22494 }
22495 /* If we could not find a corresponding TYPE, treat this
22496 declaration like an unqualified declaration. */
22499 /* Otherwise, count the number of templates used in TYPE and its
22500 containing scopes. */
22501 else
22502 {
22503 tree scope;
22515 }
22516 }
22517 /* Otherwise, the identifier is optional. */
22518 else
22519 {
22520 /* We don't know whether what comes next is a template-id,
22521 an identifier, or nothing at all. */
22523 /* Check for a template-id. */
22528 class_key,
22530 /* If that didn't work, it could still be an identifier. */
22532 {
22534 {
22537 }
22538 else
22540 }
22541 else
22542 {
22545 }
22546 }
22551 {
22553 class_key,
22555 }
22558 /* If it's not a `:' or a `{' then we can't really be looking at a
22559 class-head, since a class-head only appears as part of a
22560 class-specifier. We have to detect this situation before calling
22561 xref_tag, since that has irreversible side-effects. */
22563 {
22567 }
22569 /* At this point, we're going ahead with the class-specifier, even
22570 if some other problem occurs. */
22573 {
22578 }
22579 /* Issue the error about the overly-qualified name now. */
22581 {
22586 }
22588 {
22593 }
22595 {
22596 tree scope;
22598 /* Reject typedef-names in class heads. */
22600 {
22603 type);
22606 }
22608 /* Figure out in what scope the declaration is being placed. */
22610 /* If that scope does not contain the scope in which the
22611 class was originally declared, the program is invalid. */
22613 {
22616 "declaration of %qD in namespace %qD which does not "
22619 else
22625 }
22626 /* [dcl.meaning]
22628 A declarator-id shall not be qualified except for the
22629 definition of a ... nested class outside of its class
22630 ... [or] the definition or explicit instantiation of a
22631 class member of a namespace outside of its namespace. */
22633 {
22638 }
22639 }
22640 /* An explicit-specialization must be preceded by "template <>". If
22641 it is not, try to recover gracefully. */
22644 && !processing_template_parmlist
22646 {
22647 /* Build a location of this form:
22648 struct typename <ARGS>
22649 ^~~~~~~~~~~~~~~~~~~~~~
22650 with caret==start at the start token, and
22651 finishing at the end of the type. */
22652 location_t reported_loc
22654 class_head_start_location,
22659 error_at_rich_loc
22663 /* Take the same action that would have been taken by
22664 cp_parser_explicit_specialization. */
22667 }
22668 /* There must be no "return" statements between this point and the
22669 end of this function; set "type "to the correct return value and
22670 use "goto done;" to return. */
22671 /* Make sure that the right number of template parameters were
22672 present. */
22676 {
22677 /* If something went wrong, there is no point in even trying to
22678 process the class-definition. */
22681 }
22683 /* Look up the type. */
22685 {
22689 {
22693 }
22694 else
22695 {
22699 /* Check the scope while we still know whether or not we had a
22700 nested-name-specifier. */
22703 }
22706 }
22708 {
22709 tree class_type;
22711 /* Given:
22713 template <typename T> struct S { struct T };
22714 template <typename T> struct S<T>::T { };
22716 we will get a TYPENAME_TYPE when processing the definition of
22717 `S::T'. We need to resolve it to the actual type before we
22718 try to define it. */
22720 {
22725 else
22726 {
22729 }
22730 }
22734 {
22737 }
22740 /* Enter the scope indicated by the nested-name-specifier. */
22742 /* Get the canonical version of this type. */
22744 /* Call push_template_decl if it seems like we should be defining a
22745 template either from the template headers or the type we're
22746 defining, so that we diagnose both extra and missing headers. */
22750 {
22753 {
22756 }
22757 }
22761 }
22763 {
22764 /* If the class was unnamed, create a dummy name. */
22769 }
22771 /* Indicate whether this class was declared as a `class' or as a
22772 `struct'. */
22777 /* If this type was already complete, and we see another definition,
22778 that's an error. */
22780 {
22782 type);
22784 type);
22787 }
22792 {
22793 /* Apply attributes now, before any use of the class as a template
22794 argument in its base list. */
22797 }
22799 /* We will have entered the scope containing the class; the names of
22800 base classes should be looked up in that context. For example:
22802 struct A { struct B {}; struct C; };
22803 struct A::C : B {};
22805 is valid. */
22807 /* Get the list of base-classes, if there is one. */
22809 {
22810 /* PR59482: enter the class scope so that base-specifiers are looked
22811 up correctly. */
22815 /* PR59482: get out of the previously pushed class scope so that the
22816 subsequent pops pop the right thing. */
22819 }
22820 else
22823 /* If we're really defining a class, process the base classes.
22824 If they're invalid, fail. */
22828 done:
22829 /* Leave the scope given by the nested-name-specifier. We will
22830 enter the class scope itself while processing the members. */
22835 {
22838 }
22844 out:
22847 }
22849 /* Parse a class-key.
22851 class-key:
22852 class
22853 struct
22854 union
22856 Returns the kind of class-key specified, or none_type to indicate
22857 error. */
22859 static enum tag_types
22861 {
22865 /* Look for the class-key. */
22870 /* Check to see if the TOKEN is a class-key. */
22875 }
22877 /* Parse a type-parameter-key.
22879 type-parameter-key:
22880 class
22881 typename
22882 */
22884 static void
22886 {
22887 /* Look for the type-parameter-key. */
22891 {
22894 /* typename is not allowed in a template template parameter
22895 by the standard until C++1Z. */
22897 "ISO C++ forbids typename key in template template parameter;"
22899 }
22900 else
22904 }
22906 /* Parse an (optional) member-specification.
22908 member-specification:
22909 member-declaration member-specification [opt]
22910 access-specifier : member-specification [opt] */
22912 static void
22914 {
22916 {
22920 /* Peek at the next token. */
22922 /* If it's a `}', or EOF then we've seen all the members. */
22928 /* See if this token is a keyword. */
22931 {
22935 /* Consume the access-specifier. */
22937 /* Remember which access-specifier is active. */
22939 /* Look for the `:'. */
22944 /* Accept #pragmas at class scope. */
22946 {
22949 }
22951 /* Otherwise, the next construction must be a
22952 member-declaration. */
22954 }
22955 }
22956 }
22958 /* Parse a member-declaration.
22960 member-declaration:
22961 decl-specifier-seq [opt] member-declarator-list [opt] ;
22962 function-definition ; [opt]
22963 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22964 using-declaration
22965 template-declaration
22966 alias-declaration
22968 member-declarator-list:
22969 member-declarator
22970 member-declarator-list , member-declarator
22972 member-declarator:
22973 declarator pure-specifier [opt]
22974 declarator constant-initializer [opt]
22975 identifier [opt] : constant-expression
22977 GNU Extensions:
22979 member-declaration:
22980 __extension__ member-declaration
22982 member-declarator:
22983 declarator attributes [opt] pure-specifier [opt]
22984 declarator attributes [opt] constant-initializer [opt]
22985 identifier [opt] attributes [opt] : constant-expression
22987 C++0x Extensions:
22989 member-declaration:
22990 static_assert-declaration */
22992 static void
22994 {
22995 cp_decl_specifier_seq decl_specifiers;
22996 tree prefix_attributes;
22997 tree decl;
23006 /* Check for the `__extension__' keyword. */
23008 {
23009 /* Recurse. */
23011 /* Restore the old value of the PEDANTIC flag. */
23015 }
23017 /* Check for a template-declaration. */
23019 {
23020 /* An explicit specialization here is an error condition, and we
23021 expect the specialization handler to detect and report this. */
23025 else
23029 }
23030 /* Check for a template introduction. */
23034 /* Check for a using-declaration. */
23036 {
23038 {
23039 /* Parse the using-declaration. */
23043 }
23044 else
23045 {
23046 tree decl;
23050 /* Note that if we actually see the '=' token after the
23051 identifier, cp_parser_alias_declaration commits the
23052 tentative parse. In that case, we really expect an
23053 alias-declaration. Otherwise, we expect a using
23054 declaration. */
23055 alias_decl_expected =
23061 else
23065 }
23066 }
23068 /* Check for @defs. */
23070 {
23075 {
23080 }
23082 }
23084 /* If the next token is `static_assert' we have a static assertion. */
23086 {
23089 }
23096 /* Parse the decl-specifier-seq. */
23099 CP_PARSER_FLAGS_OPTIONAL,
23102 /* Check for an invalid type-name. */
23106 /* If there is no declarator, then the decl-specifier-seq should
23107 specify a type. */
23109 {
23110 /* If there was no decl-specifier-seq, and the next token is a
23111 `;', then we have something like:
23113 struct S { ; };
23115 [class.mem]
23117 Each member-declaration shall declare at least one member
23118 name of the class. */
23120 {
23124 }
23125 else
23126 {
23127 tree type;
23129 /* See if this declaration is a friend. */
23131 /* If there were decl-specifiers, check to see if there was
23132 a class-declaration. */
23135 /* Nested classes have already been added to the class, but
23136 a `friend' needs to be explicitly registered. */
23138 {
23139 /* If the `friend' keyword was present, the friend must
23140 be introduced with a class-key. */
23143 "in C++03 a class-key must be used "
23145 /* In this case:
23147 template <typename T> struct A {
23148 friend struct A<T>::B;
23149 };
23151 A<T>::B will be represented by a TYPENAME_TYPE, and
23152 therefore not recognized by check_tag_decl. */
23154 {
23158 }
23161 "friend declaration does not name a class or "
23163 else
23166 }
23167 /* If there is no TYPE, an error message will already have
23168 been issued. */
23170 ;
23171 /* An anonymous aggregate has to be handled specially; such
23172 a declaration really declares a data member (with a
23173 particular type), as opposed to a nested class. */
23175 {
23176 /* C++11 9.5/6. */
23179 "a storage class on an anonymous aggregate "
23182 /* Remove constructors and such from TYPE, now that we
23183 know it is an anonymous aggregate. */
23185 /* And make the corresponding data member. */
23188 /* Add it to the class. */
23190 }
23191 else
23192 cp_parser_check_access_in_redeclaration
23195 }
23196 }
23197 else
23198 {
23201 /* Clear attributes from the decl_specifiers but keep them
23202 around as prefix attributes that apply them to the entity
23203 being declared. */
23207 /* See if these declarations will be friends. */
23210 /* Keep going until we hit the `;' at the end of the
23211 declaration. */
23213 {
23215 tree first_attribute;
23217 /* Peek at the next token. */
23220 /* Check for a bitfield declaration. */
23225 {
23226 tree identifier;
23227 tree width;
23229 /* Get the name of the bitfield. Note that we cannot just
23230 check TOKEN here because it may have been invalidated by
23231 the call to cp_lexer_peek_nth_token above. */
23234 else
23237 /* Consume the `:' token. */
23239 /* Get the width of the bitfield. */
23240 width
23243 /* Look for attributes that apply to the bitfield. */
23245 /* Remember which attributes are prefix attributes and
23246 which are not. */
23248 /* Combine the attributes. */
23251 /* Create the bitfield declaration. */
23254 identifier,
23255 sfk_none)
23258 width,
23259 attributes);
23260 }
23261 else
23262 {
23264 tree initializer;
23265 tree asm_specification;
23268 /* Parse the declarator. */
23269 declarator
23274 friend_p);
23276 /* If something went wrong parsing the declarator, make sure
23277 that we at least consume some tokens. */
23279 {
23280 /* Skip to the end of the statement. */
23282 /* If the next token is not a semicolon, that is
23283 probably because we just skipped over the body of
23284 a function. So, we consume a semicolon if
23285 present, but do not issue an error message if it
23286 is not present. */
23288 CPP_SEMICOLON))
23291 }
23294 cp_parser_check_for_definition_in_return_type
23298 /* Look for an asm-specification. */
23300 /* Look for attributes that apply to the declaration. */
23302 /* Remember which attributes are prefix attributes and
23303 which are not. */
23305 /* Combine the attributes. */
23308 /* If it's an `=', then we have a constant-initializer or a
23309 pure-specifier. It is not correct to parse the
23310 initializer before registering the member declaration
23311 since the member declaration should be in scope while
23312 its initializer is processed. However, the rest of the
23313 front end does not yet provide an interface that allows
23314 us to handle this correctly. */
23316 {
23317 /* In [class.mem]:
23319 A pure-specifier shall be used only in the declaration of
23320 a virtual function.
23322 A member-declarator can contain a constant-initializer
23323 only if it declares a static member of integral or
23324 enumeration type.
23326 Therefore, if the DECLARATOR is for a function, we look
23327 for a pure-specifier; otherwise, we look for a
23328 constant-initializer. When we call `grokfield', it will
23329 perform more stringent semantics checks. */
23341 {
23343 /* Don't require a constant rvalue in C++11, since we
23344 might want a reference constant. We'll enforce
23345 constancy later. */
23347 /* Parse the initializer. */
23350 }
23351 else
23352 /* Parse the initializer. */
23354 }
23357 {
23361 else
23363 }
23364 /* Otherwise, there is no initializer. */
23365 else
23368 /* See if we are probably looking at a function
23369 definition. We are certainly not looking at a
23370 member-declarator. Calling `grokfield' has
23371 side-effects, so we must not do it unless we are sure
23372 that we are looking at a member-declarator. */
23375 {
23376 /* The grammar does not allow a pure-specifier to be
23377 used when a member function is defined. (It is
23378 possible that this fact is an oversight in the
23379 standard, since a pure function may be defined
23380 outside of the class-specifier. */
23386 declarator,
23387 attributes);
23390 /* If the member was not a friend, declare it here. */
23393 /* Peek at the next token. */
23395 /* If the next token is a semicolon, consume it. */
23399 }
23400 else
23403 /* Create the declaration. */
23408 {
23411 else
23413 }
23414 }
23419 /* Reset PREFIX_ATTRIBUTES. */
23425 /* If there is any qualification still in effect, clear it
23426 now; we will be starting fresh with the next declarator. */
23430 /* If it's a `,', then there are more declarators. */
23432 {
23435 {
23439 }
23440 }
23441 /* If the next token isn't a `;', then we have a parse error. */
23443 CPP_SEMICOLON))
23444 {
23445 /* The next token might be a ways away from where the
23446 actual semicolon is missing. Find the previous token
23447 and use that for our error position. */
23452 /* Assume that the user meant to provide a semicolon. If
23453 we were to cp_parser_skip_to_end_of_statement, we might
23454 skip to a semicolon inside a member function definition
23455 and issue nonsensical error messages. */
23457 }
23460 {
23461 /* Add DECL to the list of members. */
23463 /* Explicitly include, eg, NSDMIs, for better error
23464 recovery (c++/58650). */
23473 /* Add DECL to the queue of NSDMI to be parsed later. */
23475 }
23479 }
23480 }
23483 out:
23485 }
23487 /* Parse a pure-specifier.
23489 pure-specifier:
23490 = 0
23492 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23493 Otherwise, ERROR_MARK_NODE is returned. */
23495 static tree
23497 {
23500 /* Look for the `=' token. */
23503 /* Look for the `0' token. */
23512 /* Accept = default or = delete in c++0x mode. */
23515 {
23518 }
23520 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23522 {
23527 }
23529 {
23532 }
23535 }
23537 /* Parse a constant-initializer.
23539 constant-initializer:
23540 = constant-expression
23542 Returns a representation of the constant-expression. */
23544 static tree
23546 {
23547 /* Look for the `=' token. */
23551 /* It is invalid to write:
23553 struct S { static const int i = { 7 }; };
23555 */
23557 {
23560 /* Consume the opening brace. */
23562 /* Skip the initializer. */
23564 /* Look for the trailing `}'. */
23568 }
23571 }
23573 /* Derived classes [gram.class.derived] */
23575 /* Parse a base-clause.
23577 base-clause:
23578 : base-specifier-list
23580 base-specifier-list:
23581 base-specifier ... [opt]
23582 base-specifier-list , base-specifier ... [opt]
23584 Returns a TREE_LIST representing the base-classes, in the order in
23585 which they were declared. The representation of each node is as
23586 described by cp_parser_base_specifier.
23588 In the case that no bases are specified, this function will return
23589 NULL_TREE, not ERROR_MARK_NODE. */
23591 static tree
23593 {
23596 /* Look for the `:' that begins the list. */
23599 /* Scan the base-specifier-list. */
23601 {
23603 tree base;
23606 /* Look for the base-specifier. */
23608 /* Look for the (optional) ellipsis. */
23610 {
23611 /* Consume the `...'. */
23615 }
23617 /* Add BASE to the front of the list. */
23619 {
23621 /* Make this a pack expansion type. */
23625 {
23628 }
23629 }
23630 /* Peek at the next token. */
23632 /* If it's not a comma, then the list is complete. */
23635 /* Consume the `,'. */
23637 }
23639 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23640 base class had a qualified name. However, the next name that
23641 appears is certainly not qualified. */
23647 }
23649 /* Parse a base-specifier.
23651 base-specifier:
23652 :: [opt] nested-name-specifier [opt] class-name
23653 virtual access-specifier [opt] :: [opt] nested-name-specifier
23654 [opt] class-name
23655 access-specifier virtual [opt] :: [opt] nested-name-specifier
23656 [opt] class-name
23658 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23659 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23660 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23661 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23663 static tree
23665 {
23673 tree type;
23675 /* Process the optional `virtual' and `access-specifier'. */
23677 {
23678 /* Peek at the next token. */
23680 /* Process `virtual'. */
23682 {
23684 /* If `virtual' appears more than once, issue an error. */
23686 {
23690 }
23694 /* Consume the `virtual' token. */
23702 /* If more than one access specifier appears, issue an
23703 error. */
23706 {
23710 }
23714 /* Consume the access-specifier. */
23722 }
23723 }
23724 /* It is not uncommon to see programs mechanically, erroneously, use
23725 the 'typename' keyword to denote (dependent) qualified types
23726 as base classes. */
23728 {
23733 else
23735 "keyword %<typename%> not allowed in this context "
23738 }
23740 /* Look for the optional `::' operator. */
23742 /* Look for the nested-name-specifier. The simplest way to
23743 implement:
23745 [temp.res]
23747 The keyword `typename' is not permitted in a base-specifier or
23748 mem-initializer; in these contexts a qualified name that
23749 depends on a template-parameter is implicitly assumed to be a
23750 type name.
23752 is to pretend that we have seen the `typename' keyword at this
23753 point. */
23759 /* If the base class is given by a qualified name, assume that names
23760 we see are type names or templates, as appropriate. */
23766 /* DR 950 allows decltype as a base-specifier. */
23768 else
23769 {
23770 /* Otherwise, look for the class-name. */
23772 class_scope_p,
23773 template_p,
23774 typename_type,
23779 }
23785 }
23787 /* Exception handling [gram.exception] */
23789 /* Parse an (optional) noexcept-specification.
23791 noexcept-specification:
23792 noexcept ( constant-expression ) [opt]
23794 If no noexcept-specification is present, returns NULL_TREE.
23795 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23796 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23797 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23798 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23799 in which case a boolean condition is returned instead. */
23801 static tree
23806 {
23810 /* Peek at the next token. */
23813 /* Is it a noexcept-specification? */
23815 {
23816 tree expr;
23820 {
23824 {
23825 /* Types may not be defined in an exception-specification. */
23827 parser->type_definition_forbidden_message
23832 /* Restore the saved message. */
23834 }
23835 else
23836 {
23839 }
23842 }
23843 else
23844 {
23848 }
23850 /* We cannot build a noexcept-spec right away because this will check
23851 that expr is a constexpr. */
23854 else
23856 }
23857 else
23859 }
23861 /* Parse an (optional) exception-specification.
23863 exception-specification:
23864 throw ( type-id-list [opt] )
23866 Returns a TREE_LIST representing the exception-specification. The
23867 TREE_VALUE of each node is a type. */
23869 static tree
23871 {
23873 tree type_id_list;
23876 /* Peek at the next token. */
23879 /* Is it a noexcept-specification? */
23885 /* If it's not `throw', then there's no exception-specification. */
23891 /* Consume the `throw'. */
23894 /* Look for the `('. */
23897 /* Peek at the next token. */
23899 /* If it's not a `)', then there is a type-id-list. */
23901 {
23902 /* Types may not be defined in an exception-specification. */
23904 parser->type_definition_forbidden_message
23906 /* Parse the type-id-list. */
23908 /* Restore the saved message. */
23912 {
23916 }
23919 "dynamic exception specifications are deprecated in C++11;"
23921 }
23922 /* In C++17, throw() is equivalent to noexcept (true). throw()
23923 is deprecated in C++11 and above as well, but is still widely used,
23924 so don't warn about it yet. */
23927 else
23930 /* Look for the `)'. */
23934 }
23936 /* Parse an (optional) type-id-list.
23938 type-id-list:
23939 type-id ... [opt]
23940 type-id-list , type-id ... [opt]
23942 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23943 in the order that the types were presented. */
23945 static tree
23947 {
23951 {
23953 tree type;
23957 /* Get the next type-id. */
23959 /* Check for invalid 'auto'. */
23961 {
23965 }
23966 /* Parse the optional ellipsis. */
23968 {
23969 /* Consume the `...'. */
23972 /* Turn the type into a pack expansion expression. */
23974 }
23975 /* Add it to the list. */
23977 /* Peek at the next token. */
23979 /* If it is not a `,', we are done. */
23982 /* Consume the `,'. */
23984 }
23987 }
23989 /* Parse a try-block.
23991 try-block:
23992 try compound-statement handler-seq */
23994 static tree
23996 {
23997 tree try_block;
24011 }
24013 /* Parse a function-try-block.
24015 function-try-block:
24016 try ctor-initializer [opt] function-body handler-seq */
24018 static bool
24020 {
24021 tree compound_stmt;
24022 tree try_block;
24025 /* Look for the `try' keyword. */
24028 /* Let the rest of the front end know where we are. */
24030 /* Parse the function-body. */
24031 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24033 /* We're done with the `try' part. */
24035 /* Parse the handlers. */
24037 /* We're done with the handlers. */
24041 }
24043 /* Parse a handler-seq.
24045 handler-seq:
24046 handler handler-seq [opt] */
24048 static void
24050 {
24052 {
24055 /* Parse the handler. */
24057 /* Peek at the next token. */
24059 /* If it's not `catch' then there are no more handlers. */
24062 }
24063 }
24065 /* Parse a handler.
24067 handler:
24068 catch ( exception-declaration ) compound-statement */
24070 static void
24072 {
24073 tree handler;
24074 tree declaration;
24084 }
24086 /* Parse an exception-declaration.
24088 exception-declaration:
24089 type-specifier-seq declarator
24090 type-specifier-seq abstract-declarator
24091 type-specifier-seq
24092 ...
24094 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24095 ellipsis variant is used. */
24097 static tree
24099 {
24100 cp_decl_specifier_seq type_specifiers;
24104 /* If it's an ellipsis, it's easy to handle. */
24106 {
24107 /* Consume the `...' token. */
24110 }
24112 /* Types may not be defined in exception-declarations. */
24114 parser->type_definition_forbidden_message
24117 /* Parse the type-specifier-seq. */
24121 /* If it's a `)', then there is no declarator. */
24124 else
24131 /* Restore the saved message. */
24138 }
24140 /* Parse a throw-expression.
24142 throw-expression:
24143 throw assignment-expression [opt]
24145 Returns a THROW_EXPR representing the throw-expression. */
24147 static tree
24149 {
24150 tree expression;
24155 /* Figure out whether or not there is an assignment-expression
24156 following the "throw" keyword. */
24164 else
24168 }
24170 /* GNU Extensions */
24172 /* Parse an (optional) asm-specification.
24174 asm-specification:
24175 asm ( string-literal )
24177 If the asm-specification is present, returns a STRING_CST
24178 corresponding to the string-literal. Otherwise, returns
24179 NULL_TREE. */
24181 static tree
24183 {
24185 tree asm_specification;
24187 /* Peek at the next token. */
24189 /* If the next token isn't the `asm' keyword, then there's no
24190 asm-specification. */
24194 /* Consume the `asm' token. */
24196 /* Look for the `('. */
24199 /* Look for the string-literal. */
24202 /* Look for the `)'. */
24206 }
24208 /* Parse an asm-operand-list.
24210 asm-operand-list:
24211 asm-operand
24212 asm-operand-list , asm-operand
24214 asm-operand:
24215 string-literal ( expression )
24216 [ string-literal ] string-literal ( expression )
24218 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24219 each node is the expression. The TREE_PURPOSE is itself a
24220 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24221 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24222 is a STRING_CST for the string literal before the parenthesis. Returns
24223 ERROR_MARK_NODE if any of the operands are invalid. */
24225 static tree
24227 {
24232 {
24233 tree string_literal;
24234 tree expression;
24235 tree name;
24238 {
24239 /* Consume the `[' token. */
24241 /* Read the operand name. */
24246 /* Look for the closing `]'. */
24248 }
24249 else
24251 /* Look for the string-literal. */
24254 /* Look for the `('. */
24256 /* Parse the expression. */
24258 /* Look for the `)'. */
24266 /* Add this operand to the list. */
24268 expression,
24269 asm_operands);
24270 /* If the next token is not a `,', there are no more
24271 operands. */
24274 /* Consume the `,'. */
24276 }
24279 }
24281 /* Parse an asm-clobber-list.
24283 asm-clobber-list:
24284 string-literal
24285 asm-clobber-list , string-literal
24287 Returns a TREE_LIST, indicating the clobbers in the order that they
24288 appeared. The TREE_VALUE of each node is a STRING_CST. */
24290 static tree
24292 {
24296 {
24297 tree string_literal;
24299 /* Look for the string literal. */
24301 /* Add it to the list. */
24303 /* If the next token is not a `,', then the list is
24304 complete. */
24307 /* Consume the `,' token. */
24309 }
24312 }
24314 /* Parse an asm-label-list.
24316 asm-label-list:
24317 identifier
24318 asm-label-list , identifier
24320 Returns a TREE_LIST, indicating the labels in the order that they
24321 appeared. The TREE_VALUE of each node is a label. */
24323 static tree
24325 {
24329 {
24332 /* Look for the identifier. */
24335 {
24338 {
24344 }
24345 }
24346 /* If the next token is not a `,', then the list is
24347 complete. */
24350 /* Consume the `,' token. */
24352 }
24355 }
24357 /* Return TRUE iff the next tokens in the stream are possibly the
24358 beginning of a GNU extension attribute. */
24360 static bool
24362 {
24364 }
24366 /* Return TRUE iff the next tokens in the stream are possibly the
24367 beginning of a standard C++-11 attribute specifier. */
24369 static bool
24371 {
24373 }
24375 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24376 beginning of a standard C++-11 attribute specifier. */
24378 static bool
24380 {
24388 }
24390 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24391 beginning of a GNU extension attribute. */
24393 static bool
24395 {
24399 }
24401 /* Return true iff the next tokens can be the beginning of either a
24402 GNU attribute list, or a standard C++11 attribute sequence. */
24404 static bool
24406 {
24409 }
24411 /* Return true iff the next Nth tokens can be the beginning of either
24412 a GNU attribute list, or a standard C++11 attribute sequence. */
24414 static bool
24416 {
24419 }
24421 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24422 of GNU attributes, or return NULL. */
24424 static tree
24426 {
24430 }
24432 #define CILK_SIMD_FN_CLAUSE_MASK \
24433 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24434 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24435 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24436 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24437 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24439 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24440 vector [(<clauses>)] */
24442 static void
24444 {
24448 {
24454 }
24457 {
24460 paren_scope++;
24461 }
24463 {
24466 paren_scope++;
24468 paren_scope--;
24469 /* Do not push the last ')' */
24472 }
24481 }
24483 /* Parse an (optional) series of attributes.
24485 attributes:
24486 attributes attribute
24488 attribute:
24489 __attribute__ (( attribute-list [opt] ))
24491 The return value is as for cp_parser_gnu_attribute_list. */
24493 static tree
24495 {
24499 {
24501 tree attribute_list;
24504 /* Peek at the next token. */
24506 /* If it's not `__attribute__', then we're done. */
24510 /* Consume the `__attribute__' keyword. */
24512 /* Look for the two `(' tokens. */
24516 /* Peek at the next token. */
24519 /* Parse the attribute-list. */
24521 else
24522 /* If the next token is a `)', then there is no attribute
24523 list. */
24526 /* Look for the two `)' tokens. */
24534 /* Add these new attributes to the list. */
24536 }
24539 }
24541 /* Parse a GNU attribute-list.
24543 attribute-list:
24544 attribute
24545 attribute-list , attribute
24547 attribute:
24548 identifier
24549 identifier ( identifier )
24550 identifier ( identifier , expression-list )
24551 identifier ( expression-list )
24553 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24554 to an attribute. The TREE_PURPOSE of each node is the identifier
24555 indicating which attribute is in use. The TREE_VALUE represents
24556 the arguments, if any. */
24558 static tree
24560 {
24566 {
24568 tree identifier;
24569 tree attribute;
24571 /* Look for the identifier. We also allow keywords here; for
24572 example `__attribute__ ((const))' is legal. */
24576 {
24579 /* Consume the token, but save it since we need it for the
24580 SIMD enabled function parsing. */
24583 /* Save away the identifier that indicates which attribute
24584 this is. */
24586 /* For keywords, use the canonical spelling, not the
24587 parsed identifier. */
24593 /* Peek at the next token. */
24595 /* If it's an `(', then parse the attribute arguments. */
24597 {
24602 {
24605 }
24606 else
24607 vec = cp_parser_parenthesized_expression_list
24613 else
24614 {
24617 }
24618 /* Save the arguments away. */
24620 }
24622 {
24625 }
24628 {
24629 /* Add this attribute to the list. */
24632 }
24635 }
24636 /* Now, look for more attributes. If the next token isn't a
24637 `,', we're done. */
24641 /* Consume the comma and keep going. */
24643 }
24646 /* We built up the list in reverse order. */
24648 }
24650 /* Parse a standard C++11 attribute.
24652 The returned representation is a TREE_LIST which TREE_PURPOSE is
24653 the scoped name of the attribute, and the TREE_VALUE is its
24654 arguments list.
24656 Note that the scoped name of the attribute is itself a TREE_LIST
24657 which TREE_PURPOSE is the namespace of the attribute, and
24658 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24659 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24660 and which TREE_PURPOSE is directly the attribute name.
24662 Clients of the attribute code should use get_attribute_namespace
24663 and get_attribute_name to get the actual namespace and name of
24664 attributes, regardless of their being GNU or C++11 attributes.
24666 attribute:
24667 attribute-token attribute-argument-clause [opt]
24669 attribute-token:
24670 identifier
24671 attribute-scoped-token
24673 attribute-scoped-token:
24674 attribute-namespace :: identifier
24676 attribute-namespace:
24677 identifier
24679 attribute-argument-clause:
24680 ( balanced-token-seq )
24682 balanced-token-seq:
24683 balanced-token [opt]
24684 balanced-token-seq balanced-token
24686 balanced-token:
24687 ( balanced-token-seq )
24688 [ balanced-token-seq ]
24689 { balanced-token-seq }. */
24691 static tree
24693 {
24697 /* First, parse name of the attribute, a.k.a attribute-token. */
24714 {
24715 /* We are seeing a scoped attribute token. */
24730 else
24731 {
24735 }
24737 NULL_TREE);
24739 }
24742 NULL_TREE);
24743 else
24744 {
24746 NULL_TREE);
24747 /* C++11 noreturn attribute is equivalent to GNU's. */
24750 /* C++14 deprecated attribute is equivalent to GNU's. */
24753 /* C++17 fallthrough attribute is equivalent to GNU's. */
24756 /* Transactional Memory TS optimize_for_synchronized attribute is
24757 equivalent to GNU transaction_callable. */
24761 /* Transactional Memory attributes are GNU attributes. */
24764 }
24766 /* Now parse the optional argument clause of the attribute. */
24771 {
24777 /* A GNU attribute that takes an identifier in parameter. */
24780 vec = cp_parser_parenthesized_expression_list
24786 else
24787 {
24790 }
24794 else
24796 }
24799 }
24801 /* Check that the attribute ATTRIBUTE appears at most once in the
24802 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24803 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24804 isn't implemented yet in GCC. */
24806 static void
24808 {
24810 {
24820 }
24821 }
24823 /* Parse a list of standard C++-11 attributes.
24825 attribute-list:
24826 attribute [opt]
24827 attribute-list , attribute[opt]
24828 attribute ...
24829 attribute-list , attribute ...
24830 */
24832 static tree
24834 {
24839 {
24844 {
24848 }
24851 {
24856 else
24860 }
24864 }
24867 }
24869 /* Parse a standard C++-11 attribute specifier.
24871 attribute-specifier:
24872 [ [ attribute-using-prefix [opt] attribute-list ] ]
24873 alignment-specifier
24875 attribute-using-prefix:
24876 using attribute-namespace :
24878 alignment-specifier:
24879 alignas ( type-id ... [opt] )
24880 alignas ( alignment-expression ... [opt] ). */
24882 static tree
24884 {
24890 {
24897 {
24908 {
24912 "attribute using prefix only available "
24918 }
24919 else
24921 }
24928 else
24929 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24930 when we are sure that we have actually parsed them. */
24932 }
24933 else
24934 {
24935 tree alignas_expr;
24937 /* Look for an alignment-specifier. */
24949 {
24952 }
24958 {
24965 }
24971 {
24974 }
24977 {
24980 }
24982 /* Build the C++-11 representation of an 'aligned'
24983 attribute. */
24984 attributes =
24987 alignas_expr);
24988 }
24991 }
24993 /* Parse a standard C++-11 attribute-specifier-seq.
24995 attribute-specifier-seq:
24996 attribute-specifier-seq [opt] attribute-specifier
24997 */
24999 static tree
25001 {
25006 {
25015 else
25018 }
25021 }
25023 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25024 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25025 current value of the PEDANTIC flag, regardless of whether or not
25026 the `__extension__' keyword is present. The caller is responsible
25027 for restoring the value of the PEDANTIC flag. */
25029 static bool
25031 {
25032 /* Save the old value of the PEDANTIC flag. */
25036 {
25037 /* Consume the `__extension__' token. */
25039 /* We're not being pedantic while the `__extension__' keyword is
25040 in effect. */
25044 }
25047 }
25049 /* Parse a label declaration.
25051 label-declaration:
25052 __label__ label-declarator-seq ;
25054 label-declarator-seq:
25055 identifier , label-declarator-seq
25056 identifier */
25058 static void
25060 {
25061 /* Look for the `__label__' keyword. */
25065 {
25066 tree identifier;
25068 /* Look for an identifier. */
25070 /* If we failed, stop. */
25073 /* Declare it as a label. */
25075 /* If the next token is a `;', stop. */
25078 /* Look for the `,' separating the label declarations. */
25080 }
25082 /* Look for the final `;'. */
25084 }
25086 // -------------------------------------------------------------------------- //
25087 // Requires Clause
25089 // Parse a requires clause.
25090 //
25091 // requires-clause:
25092 // 'requires' logical-or-expression
25093 //
25094 // The required logical-or-expression must be a constant expression. Note
25095 // that we don't check that the expression is constepxr here. We defer until
25096 // we analyze constraints and then, we only check atomic constraints.
25097 static tree
25099 {
25100 // Parse the requires clause so that it is not automatically folded.
25108 }
25110 // Optionally parse a requires clause:
25111 static tree
25113 {
25116 {
25119 {
25122 /* Parse and discard the requires-clause. */
25125 }
25127 }
25130 }
25133 /*---------------------------------------------------------------------------
25134 Requires expressions
25135 ---------------------------------------------------------------------------*/
25137 /* Parse a requires expression
25139 requirement-expression:
25140 'requires' requirement-parameter-list [opt] requirement-body */
25141 static tree
25143 {
25147 /* A requires-expression shall appear only within a concept
25148 definition or a requires-clause.
25150 TODO: Implement this diagnostic correctly. */
25152 {
25156 }
25159 {
25160 /* Local parameters are delared as variables within the scope
25161 of the expression. They are not visible past the end of
25162 the expression. Expressions within the requires-expression
25163 are unevaluated. */
25164 struct scope_sentinel
25165 {
25167 {
25170 }
25173 {
25176 }
25179 /* Parse the optional parameter list. */
25181 {
25185 }
25186 else
25189 /* Parse the requirement body. */
25193 }
25195 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25196 the parm chain. */
25199 }
25201 /* Parse a parameterized requirement.
25203 requirement-parameter-list:
25204 '(' parameter-declaration-clause ')' */
25205 static tree
25207 {
25217 }
25219 /* Parse the body of a requirement.
25221 requirement-body:
25222 '{' requirement-list '}' */
25223 static tree
25225 {
25235 }
25237 /* Parse a list of requirements.
25239 requirement-list:
25240 requirement
25241 requirement-list ';' requirement[opt] */
25242 static tree
25244 {
25247 {
25254 /* If we see a semi-colon, consume it. */
25258 /* Stop processing at the end of the list. */
25261 }
25263 /* Reverse the order of requirements so they are analyzed in
25264 declaration order. */
25266 }
25268 /* Parse a syntactic requirement or type requirement.
25270 requirement:
25271 simple-requirement
25272 compound-requirement
25273 type-requirement
25274 nested-requirement */
25275 static tree
25277 {
25284 else
25286 }
25288 /* Parse a simple requirement.
25290 simple-requirement:
25291 expression ';' */
25292 static tree
25294 {
25303 }
25305 /* Parse a type requirement
25307 type-requirement
25308 nested-name-specifier [opt] required-type-name ';'
25310 required-type-name:
25311 type-name
25312 'template' [opt] simple-template-id */
25313 static tree
25315 {
25318 // Save the scope before parsing name specifiers.
25329 tree type;
25331 {
25340 }
25341 else
25360 }
25362 /* Parse a compound requirement
25364 compound-requirement:
25365 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25366 static tree
25368 {
25369 /* Parse an expression enclosed in '{ }'s. */
25380 /* Parse the optional noexcept. */
25383 {
25386 }
25388 /* Parse the optional trailing return type. */
25391 {
25399 }
25402 }
25404 /* Parse a nested requirement. This is the same as a requires clause.
25406 nested-requirement:
25407 requires-clause */
25408 static tree
25410 {
25416 }
25418 /* Support Functions */
25420 /* Return the appropriate prefer_type argument for lookup_name_real based on
25421 tag_type and template_mem_access. */
25425 {
25426 /* DR 141: When looking in the current enclosing context for a template-name
25427 after -> or ., only consider class templates. */
25431 {
25435 }
25436 }
25438 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25439 NAME should have one of the representations used for an
25440 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25441 is returned. If PARSER->SCOPE is a dependent type, then a
25442 SCOPE_REF is returned.
25444 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25445 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25446 was formed. Abstractly, such entities should not be passed to this
25447 function, because they do not need to be looked up, but it is
25448 simpler to check for this special case here, rather than at the
25449 call-sites.
25451 In cases not explicitly covered above, this function returns a
25452 DECL, OVERLOAD, or baselink representing the result of the lookup.
25453 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25454 is returned.
25456 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25457 (e.g., "struct") that was used. In that case bindings that do not
25458 refer to types are ignored.
25460 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25461 ignored.
25463 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25464 are ignored.
25466 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25467 types.
25469 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25470 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25471 NULL_TREE otherwise. */
25473 static cp_expr
25480 location_t name_location)
25481 {
25482 tree decl;
25485 /* Assume that the lookup will be unambiguous. */
25489 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25490 no longer valid. Note that if we are parsing tentatively, and
25491 the parse fails, OBJECT_TYPE will be automatically restored. */
25497 /* A template-id has already been resolved; there is no lookup to
25498 do. */
25502 {
25506 }
25508 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25509 it should already have been checked to make sure that the name
25510 used matches the type being destroyed. */
25512 {
25513 tree type;
25515 /* Figure out to which type this destructor applies. */
25520 else
25522 /* If that's not a class type, there is no destructor. */
25529 /* If it was a class type, return the destructor. */
25531 }
25533 /* By this point, the NAME should be an ordinary identifier. If
25534 the id-expression was a qualified name, the qualifying scope is
25535 stored in PARSER->SCOPE at this point. */
25538 /* Perform the lookup. */
25540 {
25546 /* If the SCOPE is dependent, the lookup must be deferred until
25547 the template is instantiated -- unless we are explicitly
25548 looking up names in uninstantiated templates. Even then, we
25549 cannot look up the name if the scope is not a class type; it
25550 might, for example, be a template type parameter. */
25555 /* Defer lookup. */
25557 else
25558 {
25561 /* If PARSER->SCOPE is a dependent type, then it must be a
25562 class type, and we must not be checking dependencies;
25563 otherwise, we would have processed this lookup above. So
25564 that PARSER->SCOPE is not considered a dependent base by
25565 lookup_member, we must enter the scope here. */
25569 /* If the PARSER->SCOPE is a template specialization, it
25570 may be instantiated during name lookup. In that case,
25571 errors may be issued. Even if we rollback the current
25572 tentative parse, those errors are valid. */
25577 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25578 lookup result and the nested-name-specifier nominates a class C:
25579 * if the name specified after the nested-name-specifier, when
25580 looked up in C, is the injected-class-name of C (Clause 9), or
25581 * if the name specified after the nested-name-specifier is the
25582 same as the identifier or the simple-template-id's template-
25583 name in the last component of the nested-name-specifier,
25584 the name is instead considered to name the constructor of
25585 class C. [ Note: for example, the constructor is not an
25586 acceptable lookup result in an elaborated-type-specifier so
25587 the constructor would not be used in place of the
25588 injected-class-name. --end note ] Such a constructor name
25589 shall be used only in the declarator-id of a declaration that
25590 names a constructor or in a using-declaration. */
25598 /* If we have a single function from a using decl, pull it out. */
25605 }
25607 /* If the scope is a dependent type and either we deferred lookup or
25608 we did lookup but didn't find the name, rememeber the name. */
25611 {
25613 {
25614 tree type;
25616 /* The resolution to Core Issue 180 says that `struct
25617 A::B' should be considered a type-name, even if `A'
25618 is dependent. */
25623 }
25627 CPP_CLOSE_PAREN)))
25631 else
25634 is_template);
25635 }
25638 }
25640 {
25641 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25642 OBJECT_TYPE is not a class. */
25644 /* If the OBJECT_TYPE is a template specialization, it may
25645 be instantiated during name lookup. In that case, errors
25646 may be issued. Even if we rollback the current tentative
25647 parse, those errors are valid. */
25649 name,
25652 tf_warning_or_error);
25653 else
25657 /* Look it up in the enclosing context. DR 141: When looking for a
25658 template-name after -> or ., only consider class templates. */
25663 /* The object is type-dependent, so we can't look anything up; we used
25664 this to get the DR 141 behavior. */
25668 }
25669 else
25670 {
25676 }
25678 /* If the lookup failed, let our caller know. */
25682 /* Pull out the template from an injected-class-name (or multiple). */
25686 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25688 {
25691 /* The error message we have to print is too complicated for
25692 cp_parser_error, so we incorporate its actions directly. */
25694 {
25696 name);
25698 }
25700 }
25708 /* If we have resolved the name of a member declaration, check to
25709 see if the declaration is accessible. When the name resolves to
25710 set of overloaded functions, accessibility is checked when
25711 overload resolution is done.
25713 During an explicit instantiation, access is not checked at all,
25714 as per [temp.explicit]. */
25721 }
25723 /* Like cp_parser_lookup_name, but for use in the typical case where
25724 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25725 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25727 static tree
25729 {
25731 none_type,
25736 location);
25737 }
25739 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25740 the current context, return the TYPE_DECL. If TAG_NAME_P is
25741 true, the DECL indicates the class being defined in a class-head,
25742 or declared in an elaborated-type-specifier.
25744 Otherwise, return DECL. */
25746 static tree
25748 {
25749 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25750 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25752 struct A {
25753 template <typename T> struct B;
25754 };
25756 template <typename T> struct A::B {};
25758 Similarly, in an elaborated-type-specifier:
25760 namespace N { struct X{}; }
25762 struct A {
25763 template <typename T> friend struct N::X;
25764 };
25766 However, if the DECL refers to a class type, and we are in
25767 the scope of the class, then the name lookup automatically
25768 finds the TYPE_DECL created by build_self_reference rather
25769 than a TEMPLATE_DECL. For example, in:
25771 template <class T> struct S {
25772 S s;
25773 };
25775 there is no need to handle such case. */
25781 }
25783 /* If too many, or too few, template-parameter lists apply to the
25784 declarator, issue an error message. Returns TRUE if all went well,
25785 and FALSE otherwise. */
25787 static bool
25790 location_t declarator_location)
25791 {
25793 {
25795 {
25803 /* If the DECLARATOR has the form `X<y>' then it uses one
25804 additional level of template parameters. */
25807 return cp_parser_check_template_parameters
25809 }
25825 }
25827 }
25829 /* NUM_TEMPLATES were used in the current declaration. If that is
25830 invalid, return FALSE and issue an error messages. Otherwise,
25831 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25832 declarator and we can print more accurate diagnostics. */
25834 static bool
25837 location_t location,
25839 {
25840 /* If there are the same number of template classes and parameter
25841 lists, that's OK. */
25844 /* If there are more, but only one more, then we are referring to a
25845 member template. That's OK too. */
25848 /* If there are more template classes than parameter lists, we have
25849 something like:
25851 template <class T> void S<T>::R<T>::f (); */
25853 {
25863 else
25866 }
25867 /* Otherwise, there are too many template parameter lists. We have
25868 something like:
25870 template <class T> template <class U> void S::f(); */
25873 }
25875 /* Parse an optional `::' token indicating that the following name is
25876 from the global namespace. If so, PARSER->SCOPE is set to the
25877 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25878 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25879 Returns the new value of PARSER->SCOPE, if the `::' token is
25880 present, and NULL_TREE otherwise. */
25882 static tree
25884 {
25887 /* Peek at the next token. */
25889 /* If we're looking at a `::' token then we're starting from the
25890 global namespace, not our current location. */
25892 {
25893 /* Consume the `::' token. */
25895 /* Set the SCOPE so that we know where to start the lookup. */
25901 }
25903 {
25907 }
25910 }
25912 /* Returns TRUE if the upcoming token sequence is the start of a
25913 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
25914 declarator is preceded by the `friend' specifier. */
25916 static bool
25918 {
25921 tree nested_name_specifier;
25924 /* The common case is that this is not a constructor declarator, so
25925 try to avoid doing lots of work if at all possible. It's not
25926 valid declare a constructor at function scope. */
25929 /* And only certain tokens can begin a constructor declarator. */
25937 /* Parse tentatively; we are going to roll back all of the tokens
25938 consumed here. */
25940 /* Assume that we are looking at a constructor declarator. */
25943 /* Look for the optional `::' operator. */
25946 /* Look for the nested-name-specifier. */
25947 nested_name_specifier
25958 /* Outside of a class-specifier, there must be a
25959 nested-name-specifier. Except in C++17 mode, where we
25960 might be declaring a guiding declaration. */
25967 /* If we have a class scope, this is easy; DR 147 says that S::S always
25968 names the constructor, and no other qualified name could. */
25971 {
25981 }
25982 /* If we still think that this might be a constructor-declarator,
25983 look for a class-name. */
25985 {
25986 /* If we have:
25988 template <typename T> struct S {
25989 S();
25990 };
25992 we must recognize that the nested `S' names a class. */
25996 tree type_decl;
26000 none_type,
26007 {
26013 none_type,
26018 else
26020 }
26022 /* If there was no class-name, then this is not a constructor.
26023 Otherwise, if we are in a class-specifier and we aren't
26024 handling a friend declaration, check that its type matches
26025 current_class_type (c++/38313). Note: error_mark_node
26026 is left alone for error recovery purposes. */
26028 && (outside_class_specifier_p
26034 /* If we're still considering a constructor, we have to see a `(',
26035 to begin the parameter-declaration-clause, followed by either a
26036 `)', an `...', or a decl-specifier. We need to check for a
26037 type-specifier to avoid being fooled into thinking that:
26039 S (f) (int);
26041 is a constructor. (It is actually a function named `f' that
26042 takes one parameter (of type `int') and returns a value of type
26043 `S'. */
26051 /* A parameter declaration begins with a decl-specifier,
26052 which is either the "attribute" keyword, a storage class
26053 specifier, or (usually) a type-specifier. */
26055 {
26056 tree type;
26060 /* Names appearing in the type-specifier should be looked up
26061 in the scope of the class. */
26065 {
26068 {
26072 {
26075 }
26076 }
26078 }
26080 /* Inside the constructor parameter list, surrounding
26081 template-parameter-lists do not apply. */
26082 saved_num_template_parameter_lists
26086 /* Look for the type-specifier. */
26088 CP_PARSER_FLAGS_NONE,
26094 parser->num_template_parameter_lists
26097 /* Leave the scope of the class. */
26102 }
26103 }
26105 /* We did not really want to consume any tokens. */
26109 }
26111 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26112 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26113 they must be performed once we are in the scope of the function.
26115 Returns the function defined. */
26117 static tree
26118 cp_parser_function_definition_from_specifiers_and_declarator
26121 tree attributes,
26123 {
26124 tree fn;
26127 /* Begin the function-definition. */
26130 /* The things we're about to see are not directly qualified by any
26131 template headers we've seen thus far. */
26134 /* If there were names looked up in the decl-specifier-seq that we
26135 did not check, check them now. We must wait until we are in the
26136 scope of the function to perform the checks, since the function
26137 might be a friend. */
26141 {
26146 }
26149 {
26150 /* Skip the entire function. */
26153 }
26155 {
26156 /* Seen already, skip it. An error message has already been output. */
26160 /* If this is a function from a class, pop the nested class. */
26163 }
26164 else
26165 {
26166 timevar_id_t tv;
26169 else
26175 }
26178 }
26180 /* Parse the part of a function-definition that follows the
26181 declarator. INLINE_P is TRUE iff this function is an inline
26182 function defined within a class-specifier.
26184 Returns the function defined. */
26186 static tree
26189 {
26190 tree fn;
26196 bool fully_implicit_function_template_p
26199 tree implicit_template_parms
26202 cp_binding_level* implicit_template_scope
26208 /* If the next token is `return', then the code may be trying to
26209 make use of the "named return value" extension that G++ used to
26210 support. */
26213 {
26214 /* Consume the `return' keyword. */
26216 /* Look for the identifier that indicates what value is to be
26217 returned. */
26219 /* Issue an error message. */
26222 /* Skip tokens until we reach the start of the function body. */
26224 {
26231 }
26232 }
26233 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26234 anything declared inside `f'. */
26235 saved_in_unbraced_linkage_specification_p
26238 /* Inside the function, surrounding template-parameter-lists do not
26239 apply. */
26240 saved_num_template_parameter_lists
26246 /* If the next token is `try', `__transaction_atomic', or
26247 `__transaction_relaxed`, then we are looking at either function-try-block
26248 or function-transaction-block. Note that all of these include the
26249 function-body. */
26252 RID_TRANSACTION_ATOMIC);
26254 RID_TRANSACTION_RELAXED))
26256 RID_TRANSACTION_RELAXED);
26259 else
26260 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26265 /* Finish the function. */
26268 /* Generate code for it, if necessary. */
26270 /* Restore the saved values. */
26271 parser->in_unbraced_linkage_specification_p
26273 parser->num_template_parameter_lists
26277 parser->fully_implicit_function_template_p
26279 parser->implicit_template_parms
26281 parser->implicit_template_scope
26288 }
26290 /* Parse a template-declaration body (following argument list). */
26292 static void
26294 tree parameter_list,
26296 {
26300 /* We just processed one more parameter list. */
26303 /* Get the deferred access checks from the parameter list. These
26304 will be checked once we know what is being declared, as for a
26305 member template the checks must be performed in the scope of the
26306 class containing the member. */
26309 /* Tentatively parse for a new template parameter list, which can either be
26310 the template keyword or a template introduction. */
26316 else
26317 {
26318 /* There are no access checks when parsing a template, as we do not
26319 know if a specialization will be a friend. */
26323 checks,
26324 member_p,
26329 /* If this is a member template declaration, let the front
26330 end know. */
26332 {
26337 }
26342 }
26343 /* We are done with the current parameter list. */
26348 /* Finish up. */
26351 /* Check the template arguments for a literal operator template. */
26355 {
26359 else
26360 {
26363 {
26369 }
26371 {
26380 }
26381 else
26383 }
26385 {
26388 " Expected non-type template argument pack <char...>"
26390 decl);
26391 else
26394 decl);
26395 }
26396 }
26398 /* Register member declarations. */
26401 /* If DECL is a function template, we must return to parse it later.
26402 (Even though there is no definition, there might be default
26403 arguments that need handling.) */
26407 }
26409 /* Parse a template introduction header for a template-declaration. Returns
26410 false if tentative parse fails. */
26412 static bool
26414 {
26421 /* Look for the optional `::' operator. */
26424 /* Look for the nested-name-specifier. */
26434 /* Look up the concept for which we will be matching
26435 template parameters. */
26445 /* Look for opening brace for introduction. */
26453 /* Build vector of placeholder parameters and grab
26454 matching identifiers. */
26457 /* The introduction-list shall not be empty. */
26460 {
26463 }
26465 /* Look for closing brace for introduction. */
26470 {
26474 }
26476 /* Build and associate the constraint. */
26479 {
26481 member_p);
26483 }
26487 }
26489 /* Parse a normal template-declaration following the template keyword. */
26491 static void
26493 {
26494 tree parameter_list;
26498 /* Look for the `<' token. */
26502 {
26503 /* 14.5.2.2 [temp.mem]
26505 A local class shall not have member templates. */
26510 }
26511 /* [temp]
26513 A template ... shall not have C linkage. */
26515 {
26517 /* Give it C++ linkage to avoid confusing other parts of the
26518 front end. */
26521 }
26522 else
26525 /* We cannot perform access checks on the template parameter
26526 declarations until we know what is being declared, just as we
26527 cannot check the decl-specifier list. */
26530 /* If the next token is `>', then we have an invalid
26531 specialization. Rather than complain about an invalid template
26532 parameter, issue an error message here. */
26534 {
26538 }
26539 else
26540 {
26541 /* Parse the template parameters. */
26543 }
26545 /* Look for the `>'. */
26548 /* Manage template requirements */
26550 {
26555 }
26558 member_p);
26560 /* For the erroneous case of a template with C linkage, we pushed an
26561 implicit C++ linkage scope; exit that scope now. */
26564 }
26566 /* Parse a template-declaration, assuming that the `export' (and
26567 `extern') keywords, if present, has already been scanned. MEMBER_P
26568 is as for cp_parser_template_declaration. */
26570 static bool
26572 {
26574 {
26578 }
26583 }
26585 /* Perform the deferred access checks from a template-parameter-list.
26586 CHECKS is a TREE_LIST of access checks, as returned by
26587 get_deferred_access_checks. */
26589 static void
26590 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26591 {
26595 }
26597 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26598 `function-definition' sequence that follows a template header.
26599 If MEMBER_P is true, this declaration appears in a class scope.
26601 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26602 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26604 static tree
26610 {
26613 cp_decl_specifier_seq decl_specifiers;
26617 /* This function is only used when processing a template
26618 declaration. */
26622 /* Defer access checks until we know what is being declared. */
26625 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26626 alternative. */
26629 CP_PARSER_FLAGS_OPTIONAL,
26635 /* There are no template typedefs. */
26637 {
26641 }
26643 /* Gather up the access checks that occurred the
26644 decl-specifier-seq. */
26647 /* Check for the declaration of a template class. */
26649 {
26652 {
26653 // If this is a declaration, but not a definition, associate
26654 // any constraints with the type declaration. Constraints
26655 // are associated with definitions in cp_parser_class_specifier.
26661 /* In this case:
26663 struct C {
26664 friend template <typename T> struct A<T>::B;
26665 };
26667 A<T>::B will be represented by a TYPENAME_TYPE, and
26668 therefore not recognized by shadow_tag. */
26670 && !decl
26677 else
26680 /* Perform access checks for template parameters. */
26683 /* Give a helpful diagnostic for
26684 template <class T> struct A { } a;
26685 if we aren't already recovering from an error. */
26688 {
26690 "a class template declaration must not declare "
26694 }
26695 }
26696 }
26698 /* Complain about missing 'typename' or other invalid type names. */
26701 {
26702 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26703 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26704 the rest of this declaration. */
26707 }
26709 /* If it's not a template class, try for a template function. If
26710 the next token is a `;', then this declaration does not declare
26711 anything. But, if there were errors in the decl-specifiers, then
26712 the error might well have come from an attempted class-specifier.
26713 In that case, there's no need to warn about a missing declarator. */
26717 {
26720 checks,
26722 member_p,
26723 declares_class_or_enum,
26727 /* 7.1.1-1 [dcl.stc]
26729 A storage-class-specifier shall not be specified in an explicit
26730 specialization... */
26732 && explicit_specialization_p
26734 {
26738 }
26742 }
26744 /* Look for a trailing `;' after the declaration. */
26750 out:
26753 /* Clear any current qualification; whatever comes next is the start
26754 of something new. */
26760 }
26762 /* Parse a cast-expression that is not the operand of a unary "&". */
26764 static cp_expr
26766 {
26769 }
26771 /* Parse a functional cast to TYPE. Returns an expression
26772 representing the cast. */
26774 static cp_expr
26776 {
26778 tree expression_list;
26779 cp_expr cast;
26788 {
26797 tf_warning_or_error);
26798 /* Create a location of the form:
26799 type_name{i, f}
26800 ^~~~~~~~~~~~~~~
26801 with caret == start at the start of the type name,
26802 finishing at the closing brace. */
26803 location_t finish_loc
26806 finish_loc);
26809 }
26818 else
26819 {
26822 }
26825 tf_warning_or_error);
26826 /* [expr.const]/1: In an integral constant expression "only type
26827 conversions to integral or enumeration type can be used". */
26833 NIC_CONSTRUCTOR))
26836 /* Create a location of the form:
26837 float(i)
26838 ^~~~~~~~
26839 with caret == start at the start of the type name,
26840 finishing at the closing paren. */
26841 location_t finish_loc
26846 }
26848 /* Save the tokens that make up the body of a member function defined
26849 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26850 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26851 specifiers applied to the declaration. Returns the FUNCTION_DECL
26852 for the member function. */
26854 static tree
26858 tree attributes)
26859 {
26862 tree fn;
26865 /* Create the FUNCTION_DECL. */
26869 /* If something went badly wrong, bail out now. */
26871 {
26872 /* If there's a function-body, skip it. */
26877 }
26879 /* Remember it, if there default args to post process. */
26882 /* Save away the tokens that make up the body of the
26883 function. */
26889 RID_TRANSACTION_ATOMIC))
26890 {
26892 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
26899 {
26905 }
26906 else
26909 {
26913 }
26914 }
26916 /* Handle function try blocks. */
26918 {
26921 }
26922 /* We can have braced-init-list mem-initializers before the fn body. */
26924 {
26927 {
26928 /* cache_group will stop after an un-nested { } pair, too. */
26932 /* variadic mem-inits have ... after the ')'. */
26935 }
26936 }
26938 /* Handle function try blocks. */
26944 /* Save away the inline definition; we will process it when the
26945 class is complete. */
26949 /* We need to know that this was defined in the class, so that
26950 friend templates are handled correctly. */
26953 /* Add FN to the queue of functions to be parsed later. */
26957 }
26959 /* Save the tokens that make up the in-class initializer for a non-static
26960 data member. Returns a DEFAULT_ARG. */
26962 static tree
26964 {
26966 }
26968 /* Parse a template-argument-list, as well as the trailing ">" (but
26969 not the opening "<"). See cp_parser_template_argument_list for the
26970 return value. */
26972 static tree
26974 {
26975 tree arguments;
26976 tree saved_scope;
26977 tree saved_qualifying_scope;
26978 tree saved_object_scope;
26983 /* [temp.names]
26985 When parsing a template-id, the first non-nested `>' is taken as
26986 the end of the template-argument-list rather than a greater-than
26987 operator. */
26988 saved_greater_than_is_operator_p
26991 /* Parsing the argument list may modify SCOPE, so we save it
26992 here. */
26996 /* We need to evaluate the template arguments, even though this
26997 template-id may be nested within a "sizeof". */
27002 /* Parse the template-argument-list itself. */
27006 else
27008 /* Look for the `>' that ends the template-argument-list. If we find
27009 a '>>' instead, it's probably just a typo. */
27011 {
27013 {
27014 /* In C++0x, a `>>' in a template argument list or cast
27015 expression is considered to be two separate `>'
27016 tokens. So, change the current token to a `>', but don't
27017 consume it: it will be consumed later when the outer
27018 template argument list (or cast expression) is parsed.
27019 Note that this replacement of `>' for `>>' is necessary
27020 even if we are parsing tentatively: in the tentative
27021 case, after calling
27022 cp_parser_enclosed_template_argument_list we will always
27023 throw away all of the template arguments and the first
27024 closing `>', either because the template argument list
27025 was erroneous or because we are replacing those tokens
27026 with a CPP_TEMPLATE_ID token. The second `>' (which will
27027 not have been thrown away) is needed either to close an
27028 outer template argument list or to complete a new-style
27029 cast. */
27032 }
27034 {
27035 /* If we're in a nested template argument list, the '>>' has
27036 to be a typo for '> >'. We emit the error message, but we
27037 continue parsing and we push a '>' as next token, so that
27038 the argument list will be parsed correctly. Note that the
27039 global source location is still on the token before the
27040 '>>', so we need to say explicitly where we want it. */
27048 }
27049 else
27050 {
27051 /* If this is not a nested template argument list, the '>>'
27052 is a typo for '>'. Emit an error message and continue.
27053 Same deal about the token location, but here we can get it
27054 right by consuming the '>>' before issuing the diagnostic. */
27057 "spurious %<>>%>, use %<>%> to terminate "
27059 }
27060 }
27061 else
27063 /* The `>' token might be a greater-than operator again now. */
27064 parser->greater_than_is_operator_p
27066 /* Restore the SAVED_SCOPE. */
27074 }
27076 /* MEMBER_FUNCTION is a member function, or a friend. If default
27077 arguments, or the body of the function have not yet been parsed,
27078 parse them now. */
27080 static void
27082 {
27084 /* If this member is a template, get the underlying
27085 FUNCTION_DECL. */
27089 /* There should not be any class definitions in progress at this
27090 point; the bodies of members are only parsed outside of all class
27091 definitions. */
27093 /* While we're parsing the member functions we might encounter more
27094 classes. We want to handle them right away, but we don't want
27095 them getting mixed up with functions that are currently in the
27096 queue. */
27099 /* Make sure that any template parameters are in scope. */
27102 /* If the body of the function has not yet been parsed, parse it
27103 now. */
27105 {
27106 tree function_scope;
27109 /* The function is no longer pending; we are processing it. */
27114 /* If this is a local class, enter the scope of the containing
27115 function. */
27120 /* Push the body of the function onto the lexer stack. */
27123 /* Let the front end know that we going to be defining this
27124 function. */
27128 /* Don't do access checking if it is a templated function. */
27132 /* #pragma omp declare reduction needs special parsing. */
27134 {
27139 }
27140 else
27141 /* Now, parse the body of the function. */
27148 /* Leave the scope of the containing function. */
27152 }
27154 /* Remove any template parameters from the symbol table. */
27157 /* Restore the queue. */
27160 }
27162 /* If DECL contains any default args, remember it on the unparsed
27163 functions queue. */
27165 static void
27167 {
27168 tree probe;
27171 probe;
27174 {
27178 }
27179 }
27181 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27182 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27183 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27184 from the parameter-type-list. */
27186 static tree
27189 {
27191 tree parsed_arg;
27197 /* Push the saved tokens for the default argument onto the parser's
27198 lexer stack. */
27204 /* Parse the default argument. */
27215 {
27216 /* In a non-template class, check conversions now. In a template,
27217 we'll wait and instantiate these as needed. */
27220 tf_warning_or_error);
27221 else
27223 }
27225 /* If the token stream has not been completely used up, then
27226 there was extra junk after the end of the default
27227 argument. */
27229 {
27232 else
27234 }
27236 /* Revert to the main lexer. */
27240 }
27242 /* FIELD is a non-static data member with an initializer which we saved for
27243 later; parse it now. */
27245 static void
27247 {
27248 tree def;
27255 NULL_TREE);
27261 }
27263 /* FN is a FUNCTION_DECL which may contains a parameter with an
27264 unparsed DEFAULT_ARG. Parse the default args now. This function
27265 assumes that the current scope is the scope in which the default
27266 argument should be processed. */
27268 static void
27270 {
27274 /* While we're parsing the default args, we might (due to the
27275 statement expression extension) encounter more classes. We want
27276 to handle them right away, but we don't want them getting mixed
27277 up with default args that are currently in the queue. */
27280 /* Local variable names (and the `this' keyword) may not appear
27281 in a default argument. */
27292 {
27294 tree parsed_arg;
27296 tree copy;
27303 /* This can happen for a friend declaration for a function
27304 already declared with default arguments. */
27307 parsed_arg
27309 default_arg,
27312 {
27314 }
27318 /* Update any instantiations we've already created. */
27322 }
27326 /* Make sure no default arg is missing. */
27329 /* Restore the state of local_variables_forbidden_p. */
27332 /* Restore the queue. */
27334 }
27336 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27338 sizeof ... ( identifier )
27340 where the 'sizeof' token has already been consumed. */
27342 static tree
27344 {
27345 /* Consume the `...'. */
27352 else
27360 /* The name is not qualified. */
27379 }
27381 /* Parse the operand of `sizeof' (or a similar operator). Returns
27382 either a TYPE or an expression, depending on the form of the
27383 input. The KEYWORD indicates which kind of expression we have
27384 encountered. */
27386 static tree
27388 {
27395 /* If it's a `...', then we are computing the length of a parameter
27396 pack. */
27401 /* Types cannot be defined in a `sizeof' expression. Save away the
27402 old message. */
27404 /* And create the new one. */
27410 /* The restrictions on constant-expressions do not apply inside
27411 sizeof expressions. */
27412 saved_integral_constant_expression_p
27414 saved_non_integral_constant_expression_p
27418 /* Do not actually evaluate the expression. */
27421 /* If it's a `(', then we might be looking at the type-id
27422 construction. */
27424 {
27427 /* We can't be sure yet whether we're looking at a type-id or an
27428 expression. */
27430 /* Note: as a GNU Extension, compound literals are considered
27431 postfix-expressions as they are in C99, so they are valid
27432 arguments to sizeof. See comment in cp_parser_cast_expression
27433 for details. */
27436 else
27437 {
27440 /* Look for the type-id. */
27442 /* Look for the closing `)'. */
27445 }
27447 /* If all went well, then we're done. */
27449 {
27450 cp_decl_specifier_seq decl_specs;
27452 /* Build a trivial decl-specifier-seq. */
27456 /* Call grokdeclarator to figure out what type this is. */
27459 TYPENAME,
27462 }
27463 }
27465 /* If the type-id production did not work out, then we must be
27466 looking at the unary-expression production. */
27470 /* Go back to evaluating expressions. */
27474 /* Free the message we created. */
27476 /* And restore the old one. */
27478 parser->integral_constant_expression_p
27480 parser->non_integral_constant_expression_p
27484 }
27486 /* If the current declaration has no declarator, return true. */
27488 static bool
27490 {
27491 /* If the next token is a `;' or a `,' then there is no
27492 declarator. */
27495 }
27497 /* Update the DECL_SPECS to reflect the storage class indicated by
27498 KEYWORD. */
27500 static void
27505 {
27506 cp_storage_class storage_class;
27509 {
27513 }
27515 {
27518 }
27523 {
27526 }
27529 {
27547 }
27551 /* A storage class specifier cannot be applied alongside a typedef
27552 specifier. If there is a typedef specifier present then set
27553 conflicting_specifiers_p which will trigger an error later
27554 on in grokdeclarator. */
27557 }
27559 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27560 is true, the type is a class or enum definition. */
27562 static void
27564 tree type_spec,
27567 {
27570 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27571 (with, for example, in "typedef int wchar_t;") we remember that
27572 this is what happened. In system headers, we ignore these
27573 declarations so that G++ can work with system headers that are not
27574 C++-safe. */
27576 && !type_definition_p
27586 {
27589 ds_redefined_builtin_type_spec,
27590 token);
27592 {
27596 }
27597 }
27600 else
27601 {
27606 }
27607 }
27609 /* True iff TOKEN is the GNU keyword __thread. */
27611 static bool
27613 {
27616 }
27618 /* Set the location for a declarator specifier and check if it is
27619 duplicated.
27621 DECL_SPECS is the sequence of declarator specifiers onto which to
27622 set the location.
27624 DS is the single declarator specifier to set which location is to
27625 be set onto the existing sequence of declarators.
27627 LOCATION is the location for the declarator specifier to
27628 consider. */
27630 static void
27633 {
27642 {
27646 }
27647 else
27648 {
27650 {
27654 else
27655 {
27658 OPT_Wlong_long,
27660 }
27661 }
27663 {
27668 else
27670 }
27671 else
27672 {
27688 "__complex"
27689 };
27692 }
27693 }
27694 }
27696 /* Return true iff the declarator specifier DS is present in the
27697 sequence of declarator specifiers DECL_SPECS. */
27699 bool
27701 cp_decl_spec ds)
27702 {
27709 }
27711 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27712 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27714 static bool
27716 {
27718 }
27720 /* Issue an error message indicating that TOKEN_DESC was expected.
27721 If KEYWORD is true, it indicated this function is called by
27722 cp_parser_require_keword and the required token can only be
27723 a indicated keyword. */
27725 static void
27727 required_token token_desc,
27729 {
27731 {
27800 }
27802 {
27804 {
27883 }
27884 }
27885 else
27887 }
27891 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27892 issue an error message indicating that TOKEN_DESC was expected.
27894 Returns the token consumed, if the token had the appropriate type.
27895 Otherwise, returns NULL. */
27900 required_token token_desc)
27901 {
27904 else
27905 {
27906 /* Output the MESSAGE -- unless we're parsing tentatively. */
27910 }
27911 }
27913 /* An error message is produced if the next token is not '>'.
27914 All further tokens are skipped until the desired token is
27915 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27917 static void
27919 {
27920 /* Current level of '< ... >'. */
27922 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27925 /* Are we ready, yet? If not, issue error message. */
27929 /* Skip tokens until the desired token is found. */
27931 {
27932 /* Peek at the next token. */
27934 {
27942 /* C++0x views the `>>' operator as two `>' tokens, but
27943 C++98 does not. */
27946 {
27947 /* We've hit a `>>' where the first `>' closes the
27948 template argument list, and the second `>' is
27949 spurious. Just consume the `>>' and stop; we've
27950 already produced at least one error. */
27953 }
27954 /* Fall through for C++0x, so we handle the second `>' in
27955 the `>>'. */
27960 {
27961 /* We've reached the token we want, consume it and stop. */
27964 }
27983 /* The '>' was probably forgotten, don't look further. */
27988 }
27990 /* Consume this token. */
27992 }
27993 }
27995 /* If the next token is the indicated keyword, consume it. Otherwise,
27996 issue an error message indicating that TOKEN_DESC was expected.
27998 Returns the token consumed, if the token had the appropriate type.
27999 Otherwise, returns NULL. */
28004 required_token token_desc)
28005 {
28009 {
28012 }
28015 }
28017 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28018 function-definition. */
28020 static bool
28022 {
28025 /* A ctor-initializer begins with a `:'. */
28027 /* A function-try-block begins with `try'. */
28029 /* A function-transaction-block begins with `__transaction_atomic'
28030 or `__transaction_relaxed'. */
28033 /* The named return value extension begins with `return'. */
28035 }
28037 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28038 definition. */
28040 static bool
28042 {
28049 }
28051 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28052 C++0x) ending a template-argument. */
28054 static bool
28056 {
28064 }
28066 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28067 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28069 static bool
28072 {
28078 /* Check for the sequence `<::' in the original code. It would be lexed as
28079 `[:', where `[' is a digraph, and there is no whitespace before
28080 `:'. */
28082 {
28087 }
28089 }
28091 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28092 or none_type otherwise. */
28094 static enum tag_types
28096 {
28098 {
28108 }
28109 }
28111 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28112 or none_type otherwise or if the token is null. */
28114 static enum tag_types
28116 {
28121 {
28129 }
28130 }
28132 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28134 static void
28136 {
28140 {
28144 type))
28147 }
28148 }
28150 /* Issue an error message if DECL is redeclared with different
28151 access than its original declaration [class.access.spec/3].
28152 This applies to nested classes, nested class templates and
28153 enumerations [class.mem/1]. */
28155 static void
28157 {
28168 }
28170 /* Look for the `template' keyword, as a syntactic disambiguator.
28171 Return TRUE iff it is present, in which case it will be
28172 consumed. */
28174 static bool
28176 {
28178 {
28179 /* In C++98 the `template' keyword can only be used within templates;
28180 outside templates the parser can always figure out what is a
28181 template and what is not. In C++11, per the resolution of DR 468,
28182 `template' is allowed in cases where it is not strictly necessary. */
28185 {
28188 "in C++98 %<template%> (as a disambiguator) is only "
28190 /* If this part of the token stream is rescanned, the same
28191 error message would be generated. So, we purge the token
28192 from the stream. */
28195 }
28196 else
28197 {
28198 /* Consume the `template' keyword. */
28201 }
28202 }
28204 }
28206 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28207 set PARSER->SCOPE, and perform other related actions. */
28209 static void
28211 {
28214 /* Get the stored value. */
28216 /* Set the scope from the stored value. */
28220 }
28222 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28223 encounter the end of a block before what we were looking for. */
28225 static bool
28229 {
28231 {
28234 /* Abort a parenthesized expression if we encounter a semicolon. */
28238 /* If we've reached the end of the file, stop. */
28244 /* We've hit the end of an enclosing block, so there's been some
28245 kind of syntax error. */
28248 /* Consume the token. */
28250 /* See if it starts a new group. */
28252 {
28254 /* In theory this should probably check end == '}', but
28255 cp_parser_save_member_function_body needs it to exit
28256 after either '}' or ')' when called with ')'. */
28259 }
28261 {
28265 }
28270 }
28271 }
28273 /* Like above, for caching a default argument or NSDMI. Both of these are
28274 terminated by a non-nested comma, but it can be unclear whether or not a
28275 comma is nested in a template argument list unless we do more parsing.
28276 In order to handle this ambiguity, when we encounter a ',' after a '<'
28277 we try to parse what follows as a parameter-declaration-list (in the
28278 case of a default argument) or a member-declarator (in the case of an
28279 NSDMI). If that succeeds, then we stop caching. */
28281 static tree
28283 {
28288 tree default_argument;
28290 /* Add tokens until we have processed the entire default
28291 argument. We add the range [first_token, token). */
28294 {
28295 /* For list-initialization, this is straightforward. */
28298 }
28300 {
28303 /* Peek at the next token. */
28305 /* What we do depends on what token we have. */
28307 {
28308 /* In valid code, a default argument must be
28309 immediately followed by a `,' `)', or `...'. */
28312 {
28313 /* If we've seen a '<', we might be in a
28314 template-argument-list. Until Core issue 325 is
28315 resolved, we don't know how this situation ought
28316 to be handled, so try to DTRT. We check whether
28317 what comes after the comma is a valid parameter
28318 declaration list. If it is, then the comma ends
28319 the default argument; otherwise the default
28320 argument continues. */
28324 /* Set ITALP so cp_parser_parameter_declaration_list
28325 doesn't decide to commit to this parse. */
28332 {
28333 /* Parse declarators until we reach a non-comma or
28334 somthing that cannot be an initializer.
28335 Just checking whether we're looking at a single
28336 declarator is insufficient. Consider:
28337 int var = tuple<T,U>::x;
28338 The template parameter 'U' looks exactly like a
28339 declarator. */
28340 do
28341 {
28352 }
28354 /* If we met an '=' or ';' then the original comma
28355 was the end of the NSDMI. Otherwise assume
28356 we're still in the NSDMI. */
28359 }
28360 else
28361 {
28366 }
28373 }
28374 /* FALLTHRU */
28377 /* If we run into a non-nested `;', `}', or `]',
28378 then the code is invalid -- but the default
28379 argument is certainly over. */
28384 /* Handle correctly int n = sizeof ... ( p ); */
28387 /* Update DEPTH, if necessary. */
28402 /* This might be the comparison operator, or it might
28403 start a template argument list. */
28410 /* Fall through for C++0x, which treats the `>>'
28411 operator like two `>' tokens in certain
28412 cases. */
28417 {
28418 /* This might be an operator, or it might close a
28419 template argument list. But if a previous '<'
28420 started a template argument list, this will have
28421 closed it, so we can't be in one anymore. */
28425 }
28428 /* If we run out of tokens, issue an error message. */
28436 /* In these cases, we should look for template-ids.
28437 For example, if the default argument is
28438 `X<int, double>()', we need to do name lookup to
28439 figure out whether or not `X' is a template; if
28440 so, the `,' does not end the default argument.
28442 That is not yet done. */
28447 }
28449 /* If we've reached the end, stop. */
28453 /* Add the token to the token block. */
28455 }
28457 /* Create a DEFAULT_ARG to represent the unparsed default
28458 argument. */
28465 }
28467 /* Begin parsing tentatively. We always save tokens while parsing
28468 tentatively so that if the tentative parsing fails we can restore the
28469 tokens. */
28471 static void
28473 {
28474 /* Enter a new parsing context. */
28476 /* Begin saving tokens. */
28478 /* In order to avoid repetitive access control error messages,
28479 access checks are queued up until we are no longer parsing
28480 tentatively. */
28482 }
28484 /* Commit to the currently active tentative parse. */
28486 static void
28488 {
28492 /* Mark all of the levels as committed. */
28495 {
28502 }
28503 }
28505 /* Commit to the topmost currently active tentative parse.
28507 Note that this function shouldn't be called when there are
28508 irreversible side-effects while in a tentative state. For
28509 example, we shouldn't create a permanent entry in the symbol
28510 table, or issue an error message that might not apply if the
28511 tentative parse is aborted. */
28513 static void
28515 {
28520 {
28528 }
28529 }
28531 /* Abort the currently active tentative parse. All consumed tokens
28532 will be rolled back, and no diagnostics will be issued. */
28534 static void
28536 {
28540 /* Now, pretend that we want to see if the construct was
28541 successfully parsed. */
28543 }
28545 /* Stop parsing tentatively. If a parse error has occurred, restore the
28546 token stream. Otherwise, commit to the tokens we have consumed.
28547 Returns true if no error occurred; false otherwise. */
28549 static bool
28551 {
28555 /* Remember whether or not an error occurred, since we are about to
28556 destroy that information. */
28558 /* Remove the topmost context from the stack. */
28561 /* If no parse errors occurred, commit to the tentative parse. */
28563 {
28564 /* Commit to the tokens read tentatively, unless that was
28565 already done. */
28570 }
28571 /* Otherwise, if errors occurred, roll back our state so that things
28572 are just as they were before we began the tentative parse. */
28573 else
28574 {
28577 }
28578 /* Add the context to the front of the free list. */
28583 }
28585 /* Returns true if we are parsing tentatively and are not committed to
28586 this tentative parse. */
28588 static bool
28590 {
28593 }
28595 /* Returns nonzero iff an error has occurred during the most recent
28596 tentative parse. */
28598 static bool
28600 {
28603 }
28605 /* Returns nonzero if GNU extensions are allowed. */
28607 static bool
28609 {
28611 }
28612 \f
28613 /* Objective-C++ Productions */
28616 /* Parse an Objective-C expression, which feeds into a primary-expression
28617 above.
28619 objc-expression:
28620 objc-message-expression
28621 objc-string-literal
28622 objc-encode-expression
28623 objc-protocol-expression
28624 objc-selector-expression
28626 Returns a tree representation of the expression. */
28628 static cp_expr
28630 {
28631 /* Try to figure out what kind of declaration is present. */
28635 {
28645 {
28657 }
28663 }
28666 }
28668 /* Parse an Objective-C message expression.
28670 objc-message-expression:
28671 [ objc-message-receiver objc-message-args ]
28673 Returns a representation of an Objective-C message. */
28675 static tree
28677 {
28689 /* Construct a location e.g.
28690 [self func1:5]
28691 ^~~~~~~~~~~~~~
28692 ranging from the '[' to the ']', with the caret at the start. */
28697 }
28699 /* Parse an objc-message-receiver.
28701 objc-message-receiver:
28702 expression
28703 simple-type-specifier
28705 Returns a representation of the type or expression. */
28707 static tree
28709 {
28710 tree rcv;
28712 /* An Objective-C message receiver may be either (1) a type
28713 or (2) an expression. */
28717 /* If that worked out, fine. */
28724 CP_PARSER_FLAGS_NONE);
28731 }
28733 /* Parse the arguments and selectors comprising an Objective-C message.
28735 objc-message-args:
28736 objc-selector
28737 objc-selector-args
28738 objc-selector-args , objc-comma-args
28740 objc-selector-args:
28741 objc-selector [opt] : assignment-expression
28742 objc-selector-args objc-selector [opt] : assignment-expression
28744 objc-comma-args:
28745 assignment-expression
28746 objc-comma-args , assignment-expression
28748 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28749 selector arguments and TREE_VALUE containing a list of comma
28750 arguments. */
28752 static tree
28754 {
28760 {
28766 /* Detect if we have a unary selector. */
28775 sel_args
28780 }
28782 /* Handle non-selector arguments, if any. */
28784 {
28785 tree arg;
28790 addl_args
28795 }
28798 {
28801 }
28804 }
28806 /* Parse an Objective-C encode expression.
28808 objc-encode-expression:
28809 @encode objc-typename
28811 Returns an encoded representation of the type argument. */
28813 static cp_expr
28815 {
28816 tree type;
28827 {
28831 }
28833 /* This happens if we find @encode(T) (where T is a template
28834 typename or something dependent on a template typename) when
28835 parsing a template. In that case, we can't compile it
28836 immediately, but we rather create an AT_ENCODE_EXPR which will
28837 need to be instantiated when the template is used.
28838 */
28840 {
28844 }
28847 /* Build a location of the form:
28848 @encode(int)
28849 ^~~~~~~~~~~~
28850 with caret==start at the @ token, finishing at the close paren. */
28851 location_t combined_loc
28856 }
28858 /* Parse an Objective-C @defs expression. */
28860 static tree
28862 {
28863 tree name;
28871 }
28873 /* Parse an Objective-C protocol expression.
28875 objc-protocol-expression:
28876 @protocol ( identifier )
28878 Returns a representation of the protocol expression. */
28880 static tree
28882 {
28883 tree proto;
28891 /* Build a location of the form:
28892 @protocol(prot)
28893 ^~~~~~~~~~~~~~~
28894 with caret==start at the @ token, finishing at the close paren. */
28895 location_t combined_loc
28901 }
28903 /* Parse an Objective-C selector expression.
28905 objc-selector-expression:
28906 @selector ( objc-method-signature )
28908 objc-method-signature:
28909 objc-selector
28910 objc-selector-seq
28912 objc-selector-seq:
28913 objc-selector :
28914 objc-selector-seq objc-selector :
28916 Returns a representation of the method selector. */
28918 static tree
28920 {
28932 {
28941 {
28942 /* Detect if we have a unary selector. */
28944 {
28947 }
28948 else
28949 {
28951 }
28952 }
28957 {
28958 sel_seq
28961 sel_seq
28964 }
28965 else
28966 sel_seq
28971 }
28973 finish_selector:
28977 /* Build a location of the form:
28978 @selector(func)
28979 ^~~~~~~~~~~~~~~
28980 with caret==start at the @ token, finishing at the close paren. */
28981 location_t combined_loc
28985 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28988 }
28990 /* Parse a list of identifiers.
28992 objc-identifier-list:
28993 identifier
28994 objc-identifier-list , identifier
28996 Returns a TREE_LIST of identifier nodes. */
28998 static tree
29000 {
29001 tree identifier;
29002 tree list;
29013 {
29020 identifier));
29022 }
29025 }
29027 /* Parse an Objective-C alias declaration.
29029 objc-alias-declaration:
29030 @compatibility_alias identifier identifier ;
29032 This function registers the alias mapping with the Objective-C front end.
29033 It returns nothing. */
29035 static void
29037 {
29045 }
29047 /* Parse an Objective-C class forward-declaration.
29049 objc-class-declaration:
29050 @class objc-identifier-list ;
29052 The function registers the forward declarations with the Objective-C
29053 front end. It returns nothing. */
29055 static void
29057 {
29060 {
29061 tree id;
29071 else
29073 }
29075 }
29077 /* Parse a list of Objective-C protocol references.
29079 objc-protocol-refs-opt:
29080 objc-protocol-refs [opt]
29082 objc-protocol-refs:
29083 < objc-identifier-list >
29085 Returns a TREE_LIST of identifiers, if any. */
29087 static tree
29089 {
29093 {
29097 }
29100 }
29102 /* Parse a Objective-C visibility specification. */
29104 static void
29106 {
29110 {
29125 }
29127 /* Eat '@private'/'@protected'/'@public'. */
29129 }
29131 /* Parse an Objective-C method type. Return 'true' if it is a class
29132 (+) method, and 'false' if it is an instance (-) method. */
29136 {
29139 else
29141 }
29143 /* Parse an Objective-C protocol qualifier. */
29145 static tree
29147 {
29160 {
29165 }
29168 }
29170 /* Parse an Objective-C typename. */
29172 static tree
29174 {
29178 {
29184 /* An ObjC type name may consist of just protocol qualifiers, in which
29185 case the type shall default to 'id'. */
29187 {
29190 /* If the type could not be parsed, an error has already
29191 been produced. For error recovery, behave as if it had
29192 not been specified, which will use the default type
29193 'id'. */
29195 {
29197 /* We need to skip to the closing parenthesis as
29198 cp_parser_type_id() does not seem to do it for
29199 us. */
29204 }
29205 }
29209 }
29212 }
29214 /* Check to see if TYPE refers to an Objective-C selector name. */
29216 static bool
29218 {
29224 }
29226 /* Parse an Objective-C selector. */
29228 static tree
29230 {
29234 {
29237 }
29239 /* C++ operator names are allowed to appear in ObjC selectors. */
29241 {
29254 }
29255 }
29257 /* Parse an Objective-C params list. */
29259 static tree
29261 {
29267 {
29277 /* Detect if we have a unary selector. */
29280 {
29283 }
29287 {
29288 /* Something went quite wrong. There should be a colon
29289 here, but there is not. Stop parsing parameters. */
29291 }
29293 /* New ObjC allows attributes on parameters too. */
29298 params
29301 type_name,
29302 identifier,
29303 parm_attr));
29306 }
29309 {
29312 }
29314 /* We allow tail attributes for the method. */
29316 {
29324 }
29327 {
29330 }
29332 }
29334 /* Parse the non-keyword Objective-C params. */
29336 static tree
29339 {
29345 {
29347 tree parm;
29353 {
29358 }
29360 /* TODO: parse attributes for tail parameters. */
29369 }
29371 /* We allow tail attributes for the method. */
29373 {
29375 {
29380 }
29381 else
29382 /* We have an error, but parse the attributes, so that we can
29383 carry on. */
29389 }
29392 }
29394 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29396 static void
29398 {
29401 /* If the next token is `extern' and the following token is a string
29402 literal, then we have a linkage specification. */
29404 && cp_parser_is_pure_string_literal
29407 /* Handle #pragma, if any. */
29410 /* Allow stray semicolons. */
29413 /* Mark methods as optional or required, when building protocols. */
29415 {
29418 }
29420 {
29423 }
29426 /* Other stray characters must generate errors. */
29428 {
29432 }
29433 /* Finally, try to parse a block-declaration, or a function-definition. */
29434 else
29436 }
29438 /* Parse a method signature. */
29440 static tree
29442 {
29458 }
29460 static bool
29462 {
29463 tree tattr;
29468 /* If the attributes are followed by a method introducer, this is not allowed.
29469 Dump the attributes and flag the situation. */
29474 /* Otherwise, the attributes introduce some interstitial code, possibly so
29475 rewind to allow that check. */
29478 }
29480 /* Parse an Objective-C method prototype list. */
29482 static void
29484 {
29488 {
29490 {
29495 else
29499 {
29503 }
29506 }
29512 OPT_Wattributes,
29514 else
29515 /* Allow for interspersed non-ObjC++ code. */
29519 }
29523 else
29527 }
29529 /* Parse an Objective-C method definition list. */
29531 static void
29533 {
29537 {
29538 tree meth;
29541 {
29547 else
29552 {
29556 }
29558 NULL_TREE);
29560 /* For historical reasons, we accept an optional semicolon. */
29567 {
29574 }
29575 }
29576 /* The following case will be removed once @synthesize is
29577 completely implemented. */
29588 else
29589 /* Allow for interspersed non-ObjC++ code. */
29593 }
29597 else
29601 }
29603 /* Parse Objective-C ivars. */
29605 static void
29607 {
29618 {
29619 cp_decl_specifier_seq declspecs;
29621 tree prefix_attributes;
29629 CP_PARSER_FLAGS_OPTIONAL,
29633 /* auto, register, static, extern, mutable. */
29635 {
29638 }
29640 /* thread_local. */
29642 {
29645 }
29647 /* typedef. */
29649 {
29652 }
29657 /* Keep going until we hit the `;' at the end of the
29658 declaration. */
29660 {
29665 /* Check for a (possibly unnamed) bitfield declaration. */
29673 {
29674 /* Get the name of the bitfield. */
29677 sfk_none);
29679 eat_colon:
29681 /* Get the width of the bitfield. */
29682 width
29684 }
29685 else
29686 {
29687 /* Parse the declarator. */
29688 declarator
29694 }
29696 /* Look for attributes that apply to the ivar. */
29698 /* Remember which attributes are prefix attributes and
29699 which are not. */
29701 /* Combine the attributes. */
29705 /* Create the bitfield declaration. */
29707 width,
29708 attributes);
29709 else
29714 /* Add the instance variable. */
29718 /* Reset PREFIX_ATTRIBUTES. */
29727 {
29730 }
29732 }
29736 }
29741 /* Do not consume the RID_AT_END, so it will be read again as terminating
29742 the @interface of @implementation. */
29746 /* For historical reasons, we accept an optional semicolon. */
29749 }
29751 /* Parse an Objective-C protocol declaration. */
29753 static void
29755 {
29761 {
29766 }
29768 /* See if we have a forward declaration or a definition. */
29771 /* Try a forward declaration first. */
29773 {
29775 {
29776 tree id;
29786 else
29788 }
29790 }
29792 /* Ok, we got a full-fledged definition (or at least should). */
29793 else
29794 {
29799 }
29800 }
29802 /* Parse an Objective-C superclass or category. */
29804 static void
29809 {
29815 {
29818 }
29820 {
29823 /* If there is no category name, and this is an @interface, we
29824 have a class extension. */
29826 {
29829 }
29830 else
29834 }
29835 }
29837 /* Parse an Objective-C class interface. */
29839 static void
29841 {
29848 {
29849 /* It's hard to recover because even if valid @interface stuff
29850 is to follow, we can't compile it (or validate it) if we
29851 don't even know which class it refers to. Let's assume this
29852 was a stray '@interface' token in the stream and skip it.
29853 */
29855 }
29860 /* We have either a class or a category on our hands. */
29863 else
29864 {
29866 /* Handle instance variable declarations, if any. */
29869 }
29872 }
29874 /* Parse an Objective-C class implementation. */
29876 static void
29878 {
29885 {
29886 /* It's hard to recover because even if valid @implementation
29887 stuff is to follow, we can't compile it (or validate it) if
29888 we don't even know which class it refers to. Let's assume
29889 this was a stray '@implementation' token in the stream and
29890 skip it.
29891 */
29893 }
29897 /* We have either a class or a category on our hands. */
29900 else
29901 {
29903 /* Handle instance variable declarations, if any. */
29906 }
29909 }
29911 /* Consume the @end token and finish off the implementation. */
29913 static void
29915 {
29918 }
29920 /* Parse an Objective-C declaration. */
29922 static void
29924 {
29925 /* Try to figure out what kind of declaration is present. */
29930 {
29946 }
29949 {
29972 }
29973 }
29975 /* Parse an Objective-C try-catch-finally statement.
29977 objc-try-catch-finally-stmt:
29978 @try compound-statement objc-catch-clause-seq [opt]
29979 objc-finally-clause [opt]
29981 objc-catch-clause-seq:
29982 objc-catch-clause objc-catch-clause-seq [opt]
29984 objc-catch-clause:
29985 @catch ( objc-exception-declaration ) compound-statement
29987 objc-finally-clause:
29988 @finally compound-statement
29990 objc-exception-declaration:
29991 parameter-declaration
29992 '...'
29994 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29996 Returns NULL_TREE.
29998 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29999 for C. Keep them in sync. */
30001 static tree
30003 {
30004 location_t location;
30005 tree stmt;
30010 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30011 node, lest it get absorbed into the surrounding block. */
30017 {
30026 {
30027 /* We have "@catch (...)" (where the '...' are literally
30028 what is in the code). Skip the '...'.
30029 parameter_declaration is set to NULL_TREE, and
30030 objc_being_catch_clauses() knows that that means
30031 '...'. */
30034 }
30035 else
30036 {
30037 /* We have "@catch (NSException *exception)" or something
30038 like that. Parse the parameter declaration. */
30042 else
30047 }
30050 else
30051 {
30052 /* If there was no open parenthesis, we are recovering from
30053 an error, and we are trying to figure out what mistake
30054 the user has made. */
30056 /* If there is an immediate closing parenthesis, the user
30057 probably forgot the opening one (ie, they typed "@catch
30058 NSException *e)". Parse the closing parenthesis and keep
30059 going. */
30063 /* If these is no immediate closing parenthesis, the user
30064 probably doesn't know that parenthesis are required at
30065 all (ie, they typed "@catch NSException *e"). So, just
30066 forget about the closing parenthesis and keep going. */
30067 }
30071 }
30073 {
30076 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30077 node, lest it get absorbed into the surrounding block. */
30081 }
30084 }
30086 /* Parse an Objective-C synchronized statement.
30088 objc-synchronized-stmt:
30089 @synchronized ( expression ) compound-statement
30091 Returns NULL_TREE. */
30093 static tree
30095 {
30096 location_t location;
30107 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30108 node, lest it get absorbed into the surrounding block. */
30113 }
30115 /* Parse an Objective-C throw statement.
30117 objc-throw-stmt:
30118 @throw assignment-expression [opt] ;
30120 Returns a constructed '@throw' statement. */
30122 static tree
30124 {
30136 }
30138 /* Parse an Objective-C statement. */
30140 static tree
30142 {
30143 /* Try to figure out what kind of declaration is present. */
30147 {
30158 }
30161 }
30163 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30164 look ahead to see if an objc keyword follows the attributes. This
30165 is to detect the use of prefix attributes on ObjC @interface and
30166 @protocol. */
30168 static bool
30170 {
30175 {
30178 }
30181 }
30183 /* This routine is a minimal replacement for
30184 c_parser_struct_declaration () used when parsing the list of
30185 types/names or ObjC++ properties. For example, when parsing the
30186 code
30188 @property (readonly) int a, b, c;
30190 this function is responsible for parsing "int a, int b, int c" and
30191 returning the declarations as CHAIN of DECLs.
30193 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30194 similar parsing. */
30195 static tree
30197 {
30199 cp_decl_specifier_seq declspecs;
30201 tree prefix_attributes;
30204 CP_PARSER_FLAGS_NONE,
30211 /* auto, register, static, extern, mutable. */
30213 {
30216 }
30218 /* thread_local. */
30220 {
30223 }
30225 /* typedef. */
30227 {
30230 }
30235 /* Keep going until we hit the `;' at the end of the declaration. */
30237 {
30242 /* Parse the declarator. */
30246 /* Look for attributes that apply to the ivar. */
30248 /* Remember which attributes are prefix attributes and
30249 which are not. */
30251 /* Combine the attributes. */
30261 /* Reset PREFIX_ATTRIBUTES. */
30272 {
30275 }
30276 else
30278 }
30280 }
30282 /* Parse an Objective-C @property declaration. The syntax is:
30284 objc-property-declaration:
30285 '@property' objc-property-attributes[opt] struct-declaration ;
30287 objc-property-attributes:
30288 '(' objc-property-attribute-list ')'
30290 objc-property-attribute-list:
30291 objc-property-attribute
30292 objc-property-attribute-list, objc-property-attribute
30294 objc-property-attribute
30295 'getter' = identifier
30296 'setter' = identifier
30297 'readonly'
30298 'readwrite'
30299 'assign'
30300 'retain'
30301 'copy'
30302 'nonatomic'
30304 For example:
30305 @property NSString *name;
30306 @property (readonly) id object;
30307 @property (retain, nonatomic, getter=getTheName) id name;
30308 @property int a, b, c;
30310 PS: This function is identical to
30311 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30312 static void
30314 {
30315 /* The following variables hold the attributes of the properties as
30316 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30317 seen. When we see an attribute, we set them to 'true' (if they
30318 are boolean properties) or to the identifier (if they have an
30319 argument, ie, for getter and setter). Note that here we only
30320 parse the list of attributes, check the syntax and accumulate the
30321 attributes that we find. objc_add_property_declaration() will
30322 then process the information. */
30332 /* 'properties' is the list of properties that we read. Usually a
30333 single one, but maybe more (eg, in "@property int a, b, c;" there
30334 are three). */
30335 tree properties;
30336 location_t loc;
30342 /* Parse the optional attribute list... */
30344 {
30345 /* Eat the '('. */
30349 {
30355 {
30358 }
30362 {
30373 {
30377 else
30382 }
30385 {
30389 }
30391 {
30393 {
30396 }
30397 else
30401 else
30403 }
30404 else
30405 {
30407 {
30410 }
30411 else
30413 }
30419 }
30426 else
30428 }
30430 /* FIXME: "@property (setter, assign);" will generate a spurious
30431 "error: expected ‘)’ before ‘,’ token". This is because
30432 cp_parser_require, unlike the C counterpart, will produce an
30433 error even if we are in error recovery. */
30435 {
30440 }
30441 }
30443 /* ... and the property declaration(s). */
30447 {
30449 /* If the next token is now a `;', consume it. */
30453 }
30457 else
30458 {
30459 /* Comma-separated properties are chained together in
30460 reverse order; add them one by one. */
30469 }
30472 }
30474 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30476 objc-synthesize-declaration:
30477 @synthesize objc-synthesize-identifier-list ;
30479 objc-synthesize-identifier-list:
30480 objc-synthesize-identifier
30481 objc-synthesize-identifier-list, objc-synthesize-identifier
30483 objc-synthesize-identifier
30484 identifier
30485 identifier = identifier
30487 For example:
30488 @synthesize MyProperty;
30489 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30491 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30492 for C. Keep them in sync.
30493 */
30494 static void
30496 {
30498 location_t loc;
30503 {
30507 {
30510 }
30512 {
30516 {
30519 }
30520 }
30521 else
30526 else
30528 }
30531 }
30533 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30535 objc-dynamic-declaration:
30536 @dynamic identifier-list ;
30538 For example:
30539 @dynamic MyProperty;
30540 @dynamic MyProperty, AnotherProperty;
30542 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30543 for C. Keep them in sync.
30544 */
30545 static void
30547 {
30549 location_t loc;
30554 {
30555 tree property;
30558 {
30561 }
30565 else
30567 }
30570 }
30572 \f
30573 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30575 /* Returns name of the next clause.
30576 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30577 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30578 returned and the token is consumed. */
30580 static pragma_omp_clause
30582 {
30598 {
30603 {
30786 }
30787 }
30793 }
30795 /* Validate that a clause of the given type does not already exist. */
30797 static void
30800 {
30801 tree c;
30805 {
30808 }
30809 }
30811 /* OpenMP 2.5:
30812 variable-list:
30813 identifier
30814 variable-list , identifier
30816 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30817 colon). An opening parenthesis will have been consumed by the caller.
30819 If KIND is nonzero, create the appropriate node and install the decl
30820 in OMP_CLAUSE_DECL and add the node to the head of the list.
30822 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30823 return the list created.
30825 COLON can be NULL if only closing parenthesis should end the list,
30826 or pointer to bool which will receive false if the list is terminated
30827 by closing parenthesis or true if the list is terminated by colon. */
30829 static tree
30832 {
30836 {
30839 }
30841 {
30846 && current_class_ptr
30848 {
30854 }
30855 else
30856 {
30869 }
30871 ;
30873 {
30875 {
30877 /* The OpenACC cache directive explicitly only allows "array
30878 elements or subarrays". */
30880 {
30884 }
30885 /* FALLTHROUGH. */
30890 {
30891 location_t loc
30896 decl
30900 }
30901 /* FALLTHROUGH. */
30905 {
30913 parser->colon_corrects_to_scope_p
30917 else
30918 {
30919 /* Look for `:'. */
30923 CPP_CLOSE_SQUARE))
30925 }
30926 /* Look for the closing `]'. */
30928 RT_CLOSE_SQUARE))
30932 }
30936 }
30942 }
30943 else
30946 get_comma:
30950 }
30956 {
30960 }
30963 {
30966 /* Try to resync to an unnested comma. Copied from
30967 cp_parser_parenthesized_expression_list. */
30968 skip_comma:
30977 }
30980 }
30982 /* Similarly, but expect leading and trailing parenthesis. This is a very
30983 common case for omp clauses. */
30985 static tree
30987 {
30991 }
30993 /* OpenACC 2.0:
30994 copy ( variable-list )
30995 copyin ( variable-list )
30996 copyout ( variable-list )
30997 create ( variable-list )
30998 delete ( variable-list )
30999 present ( variable-list )
31000 present_or_copy ( variable-list )
31001 pcopy ( variable-list )
31002 present_or_copyin ( variable-list )
31003 pcopyin ( variable-list )
31004 present_or_copyout ( variable-list )
31005 pcopyout ( variable-list )
31006 present_or_create ( variable-list )
31007 pcreate ( variable-list ) */
31009 static tree
31011 tree list)
31012 {
31015 {
31061 }
31069 }
31071 /* OpenACC 2.0:
31072 deviceptr ( variable-list ) */
31074 static tree
31076 {
31080 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31081 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31082 variable-list must only allow for pointer variables. */
31085 {
31092 }
31095 }
31097 /* OpenACC 2.0:
31098 auto
31099 independent
31100 nohost
31101 seq */
31103 static tree
31107 {
31112 }
31114 /* OpenACC:
31115 num_gangs ( expression )
31116 num_workers ( expression )
31117 vector_length ( expression ) */
31119 static tree
31122 {
31132 {
31137 }
31145 }
31147 /* OpenACC:
31149 gang [( gang-arg-list )]
31150 worker [( [num:] int-expr )]
31151 vector [( [length:] int-expr )]
31153 where gang-arg is one of:
31155 [num:] int-expr
31156 static: size-expr
31158 and size-expr may be:
31160 *
31161 int-expr
31162 */
31164 static tree
31167 {
31177 {
31180 do
31181 {
31185 /* Gang static argument. */
31188 {
31196 {
31199 }
31201 /* Check for the '*' argument. */
31205 CPP_CLOSE_PAREN)))
31206 {
31211 {
31214 }
31216 }
31217 }
31218 /* Worker num: argument and vector length: arguments. */
31222 {
31225 }
31227 /* Now collect the actual argument. */
31229 {
31232 }
31244 {
31247 }
31249 }
31254 }
31268 cleanup_error:
31271 }
31273 /* OpenACC 2.0:
31274 tile ( size-expr-list ) */
31276 static tree
31278 {
31282 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31283 so, but the spec authors never considered such a case and have
31284 differing opinions on what it might mean, including 'not
31285 allowed'.) */
31288 clause_loc);
31293 do
31294 {
31301 {
31304 }
31305 else
31309 }
31312 /* Consume the trailing ')'. */
31320 }
31322 /* OpenACC 2.0
31323 Parse wait clause or directive parameters. */
31325 static tree
31327 {
31337 {
31342 }
31349 {
31353 {
31356 else
31357 {
31364 }
31365 }
31366 }
31369 }
31371 /* OpenACC:
31372 wait ( int-expr-list ) */
31374 static tree
31376 {
31385 }
31387 /* OpenMP 3.0:
31388 collapse ( constant-expression ) */
31390 static tree
31392 {
31394 location_t loc;
31395 HOST_WIDE_INT n;
31415 {
31418 }
31427 }
31429 /* OpenMP 2.5:
31430 default ( shared | none )
31432 OpenACC 2.0
31433 default (none) */
31435 static tree
31438 {
31440 tree c;
31445 {
31450 {
31465 }
31468 }
31469 else
31470 {
31471 invalid_kind:
31474 else
31476 }
31492 }
31494 /* OpenMP 3.1:
31495 final ( expression ) */
31497 static tree
31499 {
31520 }
31522 /* OpenMP 2.5:
31523 if ( expression )
31525 OpenMP 4.5:
31526 if ( directive-name-modifier : expression )
31528 directive-name-modifier:
31529 parallel | task | taskloop | target data | target | target update
31530 | target enter data | target exit data */
31532 static tree
31535 {
31543 {
31555 {
31558 {
31571 else
31572 {
31573 location_t loc
31578 }
31581 {
31583 {
31588 }
31590 {
31591 location_t loc
31595 }
31596 }
31597 }
31598 }
31600 {
31602 {
31605 }
31606 else
31607 {
31609 {
31610 location_t loc
31613 }
31615 }
31616 }
31617 }
31629 {
31632 {
31635 {
31645 }
31647 p);
31649 }
31651 {
31654 else
31657 }
31660 {
31664 }
31665 }
31673 }
31675 /* OpenMP 3.1:
31676 mergeable */
31678 static tree
31681 {
31682 tree c;
31685 location);
31690 }
31692 /* OpenMP 2.5:
31693 nowait */
31695 static tree
31698 {
31699 tree c;
31706 }
31708 /* OpenMP 2.5:
31709 num_threads ( expression ) */
31711 static tree
31713 location_t location)
31714 {
31736 }
31738 /* OpenMP 4.5:
31739 num_tasks ( expression ) */
31741 static tree
31743 location_t location)
31744 {
31766 }
31768 /* OpenMP 4.5:
31769 grainsize ( expression ) */
31771 static tree
31773 location_t location)
31774 {
31796 }
31798 /* OpenMP 4.5:
31799 priority ( expression ) */
31801 static tree
31803 location_t location)
31804 {
31826 }
31828 /* OpenMP 4.5:
31829 hint ( expression ) */
31831 static tree
31833 location_t location)
31834 {
31855 }
31857 /* OpenMP 4.5:
31858 defaultmap ( tofrom : scalar ) */
31860 static tree
31862 location_t location)
31863 {
31871 {
31874 }
31878 {
31881 }
31887 {
31890 }
31894 {
31897 }
31903 location);
31909 out_err:
31914 }
31916 /* OpenMP 2.5:
31917 ordered
31919 OpenMP 4.5:
31920 ordered ( constant-expression ) */
31922 static tree
31925 {
31927 HOST_WIDE_INT n;
31933 {
31950 {
31952 "ordered argument needs positive constant integer "
31955 }
31956 }
31962 }
31964 /* OpenMP 2.5:
31965 reduction ( reduction-operator : variable-list )
31967 reduction-operator:
31968 One of: + * - & ^ | && ||
31970 OpenMP 3.1:
31972 reduction-operator:
31973 One of: + * - & ^ | && || min max
31975 OpenMP 4.0:
31977 reduction-operator:
31978 One of: + * - & ^ | && ||
31979 id-expression */
31981 static tree
31983 {
31991 {
32001 }
32005 else
32006 {
32017 {
32047 }
32048 else
32049 {
32051 resync_fail:
32056 }
32057 }
32063 NULL);
32065 {
32068 }
32071 }
32073 /* OpenMP 2.5:
32074 schedule ( schedule-kind )
32075 schedule ( schedule-kind , expression )
32077 schedule-kind:
32078 static | dynamic | guided | runtime | auto
32080 OpenMP 4.5:
32081 schedule ( schedule-modifier : schedule-kind )
32082 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32084 schedule-modifier:
32085 simd
32086 monotonic
32087 nonmonotonic */
32089 static tree
32091 {
32101 {
32110 else
32116 else
32117 {
32120 }
32121 }
32124 {
32129 {
32150 }
32151 }
32156 else
32162 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32164 {
32168 }
32171 {
32186 else
32191 }
32203 invalid_kind:
32205 resync_fail:
32210 }
32212 /* OpenMP 3.0:
32213 untied */
32215 static tree
32218 {
32219 tree c;
32226 }
32228 /* OpenMP 4.0:
32229 inbranch
32230 notinbranch */
32232 static tree
32235 {
32240 }
32242 /* OpenMP 4.0:
32243 parallel
32244 for
32245 sections
32246 taskgroup */
32248 static tree
32252 {
32256 }
32258 /* OpenMP 4.5:
32259 nogroup */
32261 static tree
32264 {
32269 }
32271 /* OpenMP 4.5:
32272 simd
32273 threads */
32275 static tree
32279 {
32284 }
32286 /* OpenMP 4.0:
32287 num_teams ( expression ) */
32289 static tree
32291 location_t location)
32292 {
32314 }
32316 /* OpenMP 4.0:
32317 thread_limit ( expression ) */
32319 static tree
32321 location_t location)
32322 {
32344 }
32346 /* OpenMP 4.0:
32347 aligned ( variable-list )
32348 aligned ( variable-list : constant-expression ) */
32350 static tree
32352 {
32363 {
32373 }
32379 }
32381 /* OpenMP 4.0:
32382 linear ( variable-list )
32383 linear ( variable-list : expression )
32385 OpenMP 4.5:
32386 linear ( modifier ( variable-list ) )
32387 linear ( modifier ( variable-list ) : expression ) */
32389 static tree
32392 {
32402 {
32414 else
32416 }
32421 else
32422 {
32431 }
32434 {
32439 {
32450 {
32453 }
32456 }
32461 {
32464 }
32472 }
32475 {
32478 }
32481 }
32483 /* OpenMP 4.0:
32484 safelen ( constant-expression ) */
32486 static tree
32488 location_t location)
32489 {
32510 }
32512 /* OpenMP 4.0:
32513 simdlen ( constant-expression ) */
32515 static tree
32517 location_t location)
32518 {
32539 }
32541 /* OpenMP 4.5:
32542 vec:
32543 identifier [+/- integer]
32544 vec , identifier [+/- integer]
32545 */
32547 static tree
32549 tree list)
32550 {
32554 {
32557 }
32560 {
32567 else
32568 {
32569 t = cp_parser_lookup_name_simple
32574 id_loc);
32575 }
32581 {
32584 }
32588 {
32591 }
32595 {
32598 }
32601 add_to_vector:
32603 {
32607 }
32613 }
32616 {
32622 }
32624 }
32626 /* OpenMP 4.0:
32627 depend ( depend-kind : variable-list )
32629 depend-kind:
32630 in | out | inout
32632 OpenMP 4.5:
32633 depend ( source )
32635 depend ( sink : vec ) */
32637 static tree
32639 {
32647 {
32661 else
32663 }
32664 else
32670 {
32680 }
32687 else
32688 {
32694 }
32697 invalid_kind:
32699 resync_fail:
32704 }
32706 /* OpenMP 4.0:
32707 map ( map-kind : variable-list )
32708 map ( variable-list )
32710 map-kind:
32711 alloc | to | from | tofrom
32713 OpenMP 4.5:
32714 map-kind:
32715 alloc | to | from | tofrom | release | delete
32717 map ( always [,] map-kind: variable-list ) */
32719 static tree
32721 {
32730 {
32735 {
32738 nth++;
32744 {
32749 }
32750 }
32751 }
32755 {
32769 else
32770 {
32776 }
32779 }
32782 {
32786 }
32789 NULL);
32795 }
32797 /* OpenMP 4.0:
32798 device ( expression ) */
32800 static tree
32802 location_t location)
32803 {
32825 }
32827 /* OpenMP 4.0:
32828 dist_schedule ( static )
32829 dist_schedule ( static , expression ) */
32831 static tree
32833 location_t location)
32834 {
32847 {
32858 }
32863 location);
32867 invalid_kind:
32869 resync_fail:
32874 }
32876 /* OpenMP 4.0:
32877 proc_bind ( proc-bind-kind )
32879 proc-bind-kind:
32880 master | close | spread */
32882 static tree
32884 location_t location)
32885 {
32886 tree c;
32893 {
32903 else
32905 }
32906 else
32915 location);
32920 invalid_kind:
32922 resync_fail:
32927 }
32929 /* OpenACC:
32930 async [( int-expr )] */
32932 static tree
32934 {
32941 {
32950 }
32960 }
32962 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32963 is a bitmask in MASK. Return the list of clauses found. */
32965 static tree
32969 {
32974 {
32975 location_t here;
32976 pragma_omp_clause c_kind;
32977 omp_clause_code code;
32988 {
33040 clauses);
33058 OMP_CLAUSE_INDEPENDENT,
33070 clauses);
33076 clauses);
33100 clauses);
33122 clauses);
33134 clauses);
33148 }
33153 {
33154 /* Remove the invalid clause(s) from the list to avoid
33155 confusing the rest of the compiler. */
33158 }
33159 }
33161 saw_error:
33168 }
33170 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33171 is a bitmask in MASK. Return the list of clauses found; the result
33172 of clause default goes in *pdefault. */
33174 static tree
33178 {
33184 {
33185 pragma_omp_clause c_kind;
33196 {
33208 clauses);
33222 clauses);
33242 clauses);
33247 clauses);
33257 clauses);
33291 clauses);
33305 clauses);
33322 OMP_CLAUSE_NOTINBRANCH,
33331 {
33332 clause_not_first:
33336 }
33366 clauses);
33367 else
33377 clauses);
33395 {
33403 }
33446 clauses
33452 clauses
33464 }
33469 {
33470 /* Remove the invalid clause(s) from the list to avoid
33471 confusing the rest of the compiler. */
33474 }
33475 }
33476 saw_error:
33477 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33478 no reason to skip to the end. */
33482 {
33485 else
33487 }
33489 }
33491 /* OpenMP 2.5:
33492 structured-block:
33493 statement
33495 In practice, we're also interested in adding the statement to an
33496 outer node. So it is convenient if we work around the fact that
33497 cp_parser_statement calls add_stmt. */
33499 static unsigned
33501 {
33504 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33505 This preserves the "not within loop or switch" style error messages
33506 for nonsense cases like
33507 void foo() {
33508 #pragma omp single
33509 break;
33510 }
33511 */
33516 }
33518 static void
33520 {
33522 }
33524 static tree
33526 {
33534 }
33536 /* OpenMP 2.5:
33537 # pragma omp atomic new-line
33538 expression-stmt
33540 expression-stmt:
33541 x binop= expr | x++ | ++x | x-- | --x
33542 binop:
33543 +, *, -, /, &, ^, |, <<, >>
33545 where x is an lvalue expression with scalar type.
33547 OpenMP 3.1:
33548 # pragma omp atomic new-line
33549 update-stmt
33551 # pragma omp atomic read new-line
33552 read-stmt
33554 # pragma omp atomic write new-line
33555 write-stmt
33557 # pragma omp atomic update new-line
33558 update-stmt
33560 # pragma omp atomic capture new-line
33561 capture-stmt
33563 # pragma omp atomic capture new-line
33564 capture-block
33566 read-stmt:
33567 v = x
33568 write-stmt:
33569 x = expr
33570 update-stmt:
33571 expression-stmt | x = x binop expr
33572 capture-stmt:
33573 v = expression-stmt
33574 capture-block:
33575 { v = x; update-stmt; } | { update-stmt; v = x; }
33577 OpenMP 4.0:
33578 update-stmt:
33579 expression-stmt | x = x binop expr | x = expr binop x
33580 capture-stmt:
33581 v = update-stmt
33582 capture-block:
33583 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33585 where x and v are lvalue expressions with scalar type. */
33587 static void
33589 {
33597 {
33602 {
33608 }
33609 }
33611 {
33623 else
33627 }
33629 {
33635 {
33640 {
33643 }
33644 }
33645 }
33649 {
33659 else
33664 {
33665 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33666 opcode. */
33671 }
33675 {
33678 }
33679 else
33680 {
33686 }
33689 }
33691 restart:
33695 {
33702 /* FALLTHROUGH */
33712 /* FALLTHROUGH */
33727 /* Undo effects of boolean_increment for post {in,de}crement. */
33729 /* FALLTHRU */
33733 {
33734 /* Undo effects of boolean_increment. */
33736 {
33737 /* This is pre or post increment. */
33742 && !structured_block
33746 }
33747 }
33748 /* FALLTHRU */
33751 {
33786 {
33790 }
33793 {
33799 {
33804 }
33806 {
33818 {
33820 {
33825 }
33826 else
33828 }
33832 }
33835 {
33842 }
33846 }
33850 {
33853 {
33861 }
33863 {
33868 }
33903 }
33914 /* FALLTHROUGH */
33919 }
33926 }
33927 stmt_done:
33929 {
33940 }
33942 {
33945 }
33946 done:
33952 saw_error:
33955 {
33959 {
33963 }
33964 }
33965 }
33968 /* OpenMP 2.5:
33969 # pragma omp barrier new-line */
33971 static void
33973 {
33976 }
33978 /* OpenMP 2.5:
33979 # pragma omp critical [(name)] new-line
33980 structured-block
33982 OpenMP 4.5:
33983 # pragma omp critical [(name) [hint(expression)]] new-line
33984 structured-block */
33986 #define OMP_CRITICAL_CLAUSE_MASK \
33987 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33989 static tree
33991 {
33995 {
34009 OMP_CRITICAL_CLAUSE_MASK,
34011 }
34012 else
34017 }
34019 /* OpenMP 2.5:
34020 # pragma omp flush flush-vars[opt] new-line
34022 flush-vars:
34023 ( variable-list ) */
34025 static void
34027 {
34033 }
34035 /* Helper function, to parse omp for increment expression. */
34037 static tree
34039 {
34044 {
34047 }
34050 {
34059 /* Fall through: OpenMP disallows NE_EXPR. */
34063 }
34065 /* If decl is an iterator, preserve LHS and RHS of the relational
34066 expr until finish_omp_for. */
34077 }
34079 /* Helper function, to parse omp for increment expression. */
34081 static tree
34083 {
34087 cp_id_kind idk;
34091 {
34100 }
34109 {
34114 }
34121 {
34125 }
34138 do
34139 {
34146 {
34148 {
34151 else
34153 tf_warning_or_error);
34154 }
34155 else
34158 }
34159 }
34163 {
34169 }
34170 else
34174 }
34176 /* Parse the initialization statement of either an OpenMP for loop or
34177 a Cilk Plus for loop.
34179 Return true if the resulting construct should have an
34180 OMP_CLAUSE_PRIVATE added to it. */
34182 static tree
34191 {
34197 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34199 init-expr:
34200 var = lb
34201 integer-type var = lb
34202 random-access-iterator-type var = lb
34203 pointer-type var = lb
34204 */
34205 cp_decl_specifier_seq type_specifiers;
34207 /* First, try to parse as an initialized declaration. See
34208 cp_parser_condition, from whence the bulk of this is copied. */
34215 {
34216 /* If parsing a type specifier seq succeeded, then this
34217 MUST be a initialized declaration. */
34222 CP_PARSER_DECLARATOR_NAMED,
34233 else
34234 {
34244 {
34246 CPP_OPEN_PAREN))
34247 {
34251 else
34254 }
34255 else
34256 /* Trigger an error. */
34261 }
34265 {
34273 {
34276 auto_node);
34281 }
34284 asm_specification,
34285 LOOKUP_ONLYCONVERTING);
34288 {
34291 }
34292 else
34293 {
34296 {
34298 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34300 {
34304 {
34308 }
34310 }
34312 {
34317 }
34318 }
34319 }
34321 }
34322 else
34323 {
34324 /* Consume '='. */
34328 non_class:
34331 else
34334 asm_specification,
34335 LOOKUP_ONLYCONVERTING);
34336 }
34340 }
34341 }
34342 else
34343 {
34344 cp_id_kind idk;
34345 /* If parsing a type specifier sequence failed, then
34346 this MUST be a simple expression. */
34355 && decl
34358 {
34369 {
34374 }
34379 }
34381 && decl
34384 {
34385 tree rhs;
34393 rhs,
34394 tf_warning_or_error));
34397 }
34398 else
34399 {
34404 {
34408 }
34409 }
34410 }
34412 }
34414 /* Parse the restricted form of the for statement allowed by OpenMP. */
34416 static tree
34419 {
34423 location_t loc_first;
34434 {
34437 }
34440 {
34443 }
34446 {
34452 }
34454 {
34457 {
34459 "%<linear%> clause may not be specified together "
34462 }
34463 else
34465 }
34478 {
34481 location_t loc;
34485 {
34489 }
34492 {
34496 }
34505 add_private_clause
34512 {
34515 {
34521 }
34522 else
34524 }
34531 {
34536 {
34540 }
34543 {
34544 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34548 {
34551 }
34552 else
34553 {
34556 }
34558 }
34559 else
34560 {
34565 }
34566 }
34569 {
34570 tree c;
34572 {
34581 decl);
34585 decl);
34586 }
34588 {
34593 else
34598 {
34601 /* For linear, signal that we need to fill up
34602 the so far unknown linear step. */
34605 }
34606 }
34607 }
34616 {
34617 /* If decl is an iterator, preserve the operator on decl
34618 until finish_omp_for. */
34620 && ((processing_template_decl
34625 else
34629 }
34641 {
34644 }
34649 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34650 in between the collapsed for loops to be still considered perfectly
34651 nested. Hopefully the final version clarifies this.
34652 For now handle (multiple) {'s and empty statements. */
34655 {
34659 {
34661 bracecount++;
34662 }
34666 else
34667 {
34674 }
34675 }
34678 {
34681 }
34682 }
34687 /* Note that we saved the original contents of this flag when we entered
34688 the structured block, and so we don't need to re-save it here. */
34691 else
34694 /* Note that the grammar doesn't call for a structured block here,
34695 though the loop as a whole is a structured block. */
34702 else
34707 {
34709 {
34711 nbraces--;
34712 }
34715 else
34716 {
34718 {
34721 }
34726 }
34727 }
34730 {
34734 else
34736 }
34740 }
34742 /* Helper function for OpenMP parsing, split clauses and call
34743 finish_omp_clauses on each of the set of clauses afterwards. */
34745 static void
34748 {
34754 }
34756 /* OpenMP 4.0:
34757 #pragma omp simd simd-clause[optseq] new-line
34758 for-loop */
34760 #define OMP_SIMD_CLAUSE_MASK \
34761 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34767 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34768 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34770 static tree
34774 {
34785 {
34789 OMP_CLAUSE_ORDERED);
34791 {
34793 "%<ordered%> clause with parameter may not be specified "
34796 }
34797 }
34808 }
34810 /* OpenMP 2.5:
34811 #pragma omp for for-clause[optseq] new-line
34812 for-loop
34814 OpenMP 4.0:
34815 #pragma omp for simd for-simd-clause[optseq] new-line
34816 for-loop */
34818 #define OMP_FOR_CLAUSE_MASK \
34819 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34829 static tree
34833 {
34840 /* parallel for{, simd} disallows nowait clause, but for
34841 target {teams distribute ,}parallel for{, simd} it should be accepted. */
34844 /* Composite distribute parallel for{, simd} disallows ordered clause. */
34849 {
34854 {
34878 }
34879 }
34881 {
34884 }
34886 /* Composite distribute parallel for disallows linear clause. */
34893 {
34896 }
34907 }
34909 /* OpenMP 2.5:
34910 # pragma omp master new-line
34911 structured-block */
34913 static tree
34915 {
34919 }
34921 /* OpenMP 2.5:
34922 # pragma omp ordered new-line
34923 structured-block
34925 OpenMP 4.5:
34926 # pragma omp ordered ordered-clauses new-line
34927 structured-block */
34929 #define OMP_ORDERED_CLAUSE_MASK \
34930 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34931 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34933 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34934 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34936 static bool
34939 {
34943 {
34948 {
34950 {
34952 "%<depend%> clause may only be used in compound "
34956 }
34957 tree clauses
34959 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34963 }
34964 }
34966 tree clauses
34972 }
34974 /* OpenMP 2.5:
34976 section-scope:
34977 { section-sequence }
34979 section-sequence:
34980 section-directive[opt] structured-block
34981 section-sequence section-directive structured-block */
34983 static tree
34985 {
34997 {
35001 }
35004 {
35012 {
35016 }
35018 {
35021 }
35026 }
35037 }
35039 /* OpenMP 2.5:
35040 # pragma omp sections sections-clause[optseq] newline
35041 sections-scope */
35043 #define OMP_SECTIONS_CLAUSE_MASK \
35044 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35050 static tree
35053 {
35065 {
35068 }
35075 }
35077 /* OpenMP 2.5:
35078 # pragma omp parallel parallel-clause[optseq] new-line
35079 structured-block
35080 # pragma omp parallel for parallel-for-clause[optseq] new-line
35081 structured-block
35082 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35083 structured-block
35085 OpenMP 4.0:
35086 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35087 structured-block */
35089 #define OMP_PARALLEL_CLAUSE_MASK \
35090 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35093 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35094 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35100 static tree
35104 {
35111 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35117 {
35125 if_p);
35129 if_p);
35132 block);
35137 }
35138 /* When combined with distribute, parallel has to be followed by for.
35139 #pragma omp target parallel is allowed though. */
35143 {
35147 }
35149 {
35152 }
35154 {
35158 {
35168 block);
35171 }
35172 }
35177 {
35180 }
35188 }
35190 /* OpenMP 2.5:
35191 # pragma omp single single-clause[optseq] new-line
35192 structured-block */
35194 #define OMP_SINGLE_CLAUSE_MASK \
35195 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35196 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35197 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35198 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35200 static tree
35202 {
35212 }
35214 /* OpenMP 3.0:
35215 # pragma omp task task-clause[optseq] new-line
35216 structured-block */
35218 #define OMP_TASK_CLAUSE_MASK \
35219 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35226 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35227 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35228 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35230 static tree
35232 {
35243 }
35245 /* OpenMP 3.0:
35246 # pragma omp taskwait new-line */
35248 static void
35250 {
35253 }
35255 /* OpenMP 3.1:
35256 # pragma omp taskyield new-line */
35258 static void
35260 {
35263 }
35265 /* OpenMP 4.0:
35266 # pragma omp taskgroup new-line
35267 structured-block */
35269 static tree
35271 {
35275 if_p));
35276 }
35279 /* OpenMP 2.5:
35280 # pragma omp threadprivate (variable-list) */
35282 static void
35284 {
35285 tree vars;
35291 }
35293 /* OpenMP 4.0:
35294 # pragma omp cancel cancel-clause[optseq] new-line */
35296 #define OMP_CANCEL_CLAUSE_MASK \
35297 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35303 static void
35305 {
35309 }
35311 /* OpenMP 4.0:
35312 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35314 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35315 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35316 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35317 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35320 static void
35323 {
35324 tree clauses;
35328 {
35333 {
35336 }
35337 }
35339 {
35343 }
35346 {
35349 "%<#pragma omp cancellation point%> may only be used in"
35351 else
35355 }
35358 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35360 pragma_tok);
35362 }
35364 /* OpenMP 4.0:
35365 #pragma omp distribute distribute-clause[optseq] new-line
35366 for-loop */
35368 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35369 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35372 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35373 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35375 static tree
35379 {
35388 {
35396 else
35399 {
35405 {
35409 else
35412 }
35418 else
35432 }
35433 }
35435 {
35438 }
35443 {
35446 }
35457 }
35459 /* OpenMP 4.0:
35460 # pragma omp teams teams-clause[optseq] new-line
35461 structured-block */
35463 #define OMP_TEAMS_CLAUSE_MASK \
35464 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35472 static tree
35476 {
35485 {
35489 {
35513 }
35514 }
35516 {
35519 }
35524 {
35527 }
35535 }
35537 /* OpenMP 4.0:
35538 # pragma omp target data target-data-clause[optseq] new-line
35539 structured-block */
35541 #define OMP_TARGET_DATA_CLAUSE_MASK \
35542 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35547 static tree
35549 {
35550 tree clauses
35555 {
35558 {
35575 "%<#pragma omp target data%> with map-type other "
35576 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35580 }
35582 }
35585 {
35588 "%<#pragma omp target data%> must contain at least "
35591 }
35602 }
35604 /* OpenMP 4.5:
35605 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35606 structured-block */
35608 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35609 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35610 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35611 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35612 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35613 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35615 static tree
35618 {
35621 {
35626 {
35629 }
35630 }
35632 {
35636 }
35639 {
35641 "%<#pragma omp target enter data%> may only be "
35645 }
35647 tree clauses
35652 {
35655 {
35668 "%<#pragma omp target enter data%> with map-type other "
35672 }
35674 }
35677 {
35680 "%<#pragma omp target enter data%> must contain at least "
35683 }
35690 }
35692 /* OpenMP 4.5:
35693 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35694 structured-block */
35696 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35697 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35703 static tree
35706 {
35709 {
35714 {
35717 }
35718 }
35720 {
35724 }
35727 {
35729 "%<#pragma omp target exit data%> may only be "
35733 }
35735 tree clauses
35740 {
35743 {
35757 "%<#pragma omp target exit data%> with map-type other "
35758 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35762 }
35764 }
35767 {
35770 "%<#pragma omp target exit data%> must contain at least "
35773 }
35780 }
35782 /* OpenMP 4.0:
35783 # pragma omp target update target-update-clause[optseq] new-line */
35785 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35786 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35790 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35791 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35793 static bool
35796 {
35798 {
35800 "%<#pragma omp target update%> may only be "
35804 }
35806 tree clauses
35811 {
35813 "%<#pragma omp target update%> must contain at least one "
35816 }
35824 }
35826 /* OpenMP 4.0:
35827 # pragma omp target target-clause[optseq] new-line
35828 structured-block */
35830 #define OMP_TARGET_CLAUSE_MASK \
35831 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
35839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
35841 static bool
35844 {
35848 {
35860 {
35868 {
35869 tree stmt;
35871 {
35874 OMP_TARGET_CLAUSE_MASK,
35879 OMP_TARGET_CLAUSE_MASK,
35884 OMP_TARGET_CLAUSE_MASK,
35889 }
35891 }
35896 {
35900 if_p);
35905 if_p);
35910 if_p);
35914 }
35920 {
35921 /* For combined target teams, ensure the num_teams and
35922 thread_limit clause expressions are evaluated on the host,
35923 before entering the target construct. */
35924 tree c;
35930 {
35939 OMP_CLAUSE_FIRSTPRIVATE);
35944 }
35945 }
35954 }
35956 {
35959 }
35961 {
35965 }
35967 {
35971 }
35973 {
35977 }
35979 {
35982 }
35983 }
35985 {
35988 }
36003 check_clauses:
36005 {
36008 {
36022 "%<#pragma omp target%> with map-type other "
36023 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36027 }
36029 }
36031 }
36033 /* OpenACC 2.0:
36034 # pragma acc cache (variable-list) new-line
36035 */
36037 static tree
36039 {
36054 }
36056 /* OpenACC 2.0:
36057 # pragma acc data oacc-data-clause[optseq] new-line
36058 structured-block */
36060 #define OACC_DATA_CLAUSE_MASK \
36061 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36073 static tree
36075 {
36088 }
36090 /* OpenACC 2.0:
36091 # pragma acc host_data <clauses> new-line
36092 structured-block */
36094 #define OACC_HOST_DATA_CLAUSE_MASK \
36095 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36097 static tree
36099 {
36112 }
36114 /* OpenACC 2.0:
36115 # pragma acc declare oacc-data-clause[optseq] new-line
36116 */
36118 #define OACC_DECLARE_CLAUSE_MASK \
36119 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36132 static tree
36134 {
36143 {
36147 }
36150 {
36154 {
36158 }
36161 {
36173 {
36175 "%qD must be a global variable in "
36177 decl);
36180 }
36185 {
36189 }
36191 {
36193 "invalid use of %<extern%> variable %qD "
36197 }
36199 {
36201 "invalid use of %<global%> variable %qD "
36205 }
36207 }
36212 {
36217 }
36220 {
36221 tree id;
36225 else
36231 {
36234 {
36237 {
36241 }
36242 }
36243 }
36244 }
36245 }
36258 }
36260 /* OpenACC 2.0:
36261 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36263 or
36265 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36267 LOC is the location of the #pragma token.
36268 */
36270 #define OACC_ENTER_DATA_CLAUSE_MASK \
36271 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36276 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36279 #define OACC_EXIT_DATA_CLAUSE_MASK \
36280 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36286 static tree
36289 {
36298 {
36304 }
36311 else
36316 {
36320 }
36328 }
36330 /* OpenACC 2.0:
36331 # pragma acc loop oacc-loop-clause[optseq] new-line
36332 structured-block */
36334 #define OACC_LOOP_CLAUSE_MASK \
36335 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36336 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36337 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36338 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36346 static tree
36349 {
36358 {
36364 }
36373 }
36375 /* OpenACC 2.0:
36376 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36377 structured-block
36379 or
36381 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36382 structured-block
36383 */
36385 #define OACC_KERNELS_CLAUSE_MASK \
36386 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36401 #define OACC_PARALLEL_CLAUSE_MASK \
36402 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36408 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36409 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36420 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36421 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36423 static tree
36426 {
36427 omp_clause_mask mask;
36430 {
36443 }
36446 {
36450 {
36453 tree clauses;
36455 if_p);
36457 }
36458 }
36467 }
36469 /* OpenACC 2.0:
36470 # pragma acc update oacc-update-clause[optseq] new-line
36471 */
36473 #define OACC_UPDATE_CLAUSE_MASK \
36474 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36481 static tree
36483 {
36490 {
36492 "%<#pragma acc update%> must contain at least one "
36495 }
36503 }
36505 /* OpenACC 2.0:
36506 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36508 LOC is the location of the #pragma token.
36509 */
36511 #define OACC_WAIT_CLAUSE_MASK \
36512 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36514 static tree
36516 {
36530 }
36532 /* OpenMP 4.0:
36533 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36535 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36536 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36543 static void
36546 {
36548 cp_omp_declare_simd_data data;
36550 {
36555 /* It is safe to take the address of a local variable; it will only be
36556 used while this scope is live. */
36558 }
36560 /* Store away all pragma tokens. */
36572 {
36576 {
36589 }
36594 "%<#pragma omp declare simd%> not immediately followed by "
36598 }
36599 }
36601 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36602 This function is modelled similar to the late parsing of omp declare
36603 simd. */
36605 static tree
36607 {
36614 {
36616 "used in the same function marked as a Cilk Plus SIMD-enabled "
36622 }
36624 {
36628 }
36633 {
36640 NULL);
36654 }
36660 }
36662 /* Finalize #pragma omp declare simd clauses after direct declarator has
36663 been parsed, and put that into "omp declare simd" attribute. */
36665 static tree
36667 {
36673 {
36677 }
36682 {
36700 }
36704 }
36707 /* OpenMP 4.0:
36708 # pragma omp declare target new-line
36709 declarations and definitions
36710 # pragma omp end declare target new-line
36712 OpenMP 4.5:
36713 # pragma omp declare target ( extended-list ) new-line
36715 # pragma omp declare target declare-target-clauses[seq] new-line */
36717 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36718 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36721 static void
36723 {
36726 clauses
36730 {
36732 clauses);
36735 }
36736 else
36737 {
36741 }
36744 "%<#pragma omp declare target%> with clauses in between "
36745 "%<#pragma omp declare target%> without clauses and "
36748 {
36754 {
36757 }
36758 else
36761 {
36763 "%qD specified both in declare target %<link%> and %<to%>"
36766 }
36768 {
36775 {
36778 {
36782 }
36783 }
36784 }
36785 }
36786 }
36788 static void
36790 {
36793 {
36796 }
36798 {
36802 {
36805 }
36808 else
36809 {
36813 }
36814 }
36815 else
36816 {
36820 }
36824 "%<#pragma omp end declare target%> without corresponding "
36826 else
36828 }
36830 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
36831 expression and optional initializer clause of
36832 #pragma omp declare reduction. We store the expression(s) as
36833 either 3, 6 or 7 special statements inside of the artificial function's
36834 body. The first two statements are DECL_EXPRs for the artificial
36835 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
36836 expression that uses those variables.
36837 If there was any INITIALIZER clause, this is followed by further statements,
36838 the fourth and fifth statements are DECL_EXPRs for the artificial
36839 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
36840 constructor variant (first token after open paren is not omp_priv),
36841 then the sixth statement is a statement with the function call expression
36842 that uses the OMP_PRIV and optionally OMP_ORIG variable.
36843 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
36844 to initialize the OMP_PRIV artificial variable and there is seventh
36845 statement, a DECL_EXPR of the OMP_PRIV statement again. */
36847 static bool
36849 {
36861 tree combiner;
36876 {
36879 }
36882 {
36889 {
36892 }
36908 {
36912 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
36916 == CPP_CLOSE_PAREN
36919 {
36923 }
36928 }
36929 else
36930 {
36946 {
36951 }
36953 tree arg;
36966 }
36977 }
36983 }
36985 /* OpenMP 4.0
36986 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36987 initializer-clause[opt] new-line
36989 initializer-clause:
36990 initializer (omp_priv initializer)
36991 initializer (function-name (argument-list)) */
36993 static void
36996 {
37006 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37013 {
37045 }
37057 /* Types may not be defined in declare reduction type list. */
37060 parser->type_definition_forbidden_message
37066 saved_colon_doesnt_start_class_def_p
37071 {
37075 ;
37096 else
37101 else
37103 }
37105 /* Restore the saved message. */
37108 parser->colon_doesnt_start_class_def_p
37113 {
37114 fail:
37117 }
37123 {
37124 tree fntype
37127 NULL_TREE);
37147 {
37152 }
37154 {
37156 {
37165 }
37172 }
37173 else
37174 {
37177 }
37180 else
37183 {
37186 }
37188 {
37191 else
37196 }
37201 else
37202 {
37211 }
37218 }
37222 done:
37223 /* Free any declarators allocated. */
37225 }
37227 /* OpenMP 4.0
37228 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37229 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37230 initializer-clause[opt] new-line
37231 #pragma omp declare target new-line */
37233 static void
37236 {
37238 {
37243 {
37246 context);
37248 }
37251 {
37254 context);
37256 }
37258 {
37261 }
37263 {
37267 }
37268 }
37272 }
37274 /* OpenMP 4.5:
37275 #pragma omp taskloop taskloop-clause[optseq] new-line
37276 for-loop
37278 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37279 for-loop */
37281 #define OMP_TASKLOOP_CLAUSE_MASK \
37282 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37297 static tree
37301 {
37310 {
37315 {
37339 }
37340 }
37342 {
37345 }
37350 {
37353 }
37359 if_p);
37365 }
37368 /* OpenACC 2.0:
37369 # pragma acc routine oacc-routine-clause[optseq] new-line
37370 function-definition
37372 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37373 */
37375 #define OACC_ROUTINE_CLAUSE_MASK \
37376 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37379 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37382 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37383 component, which must resolve to a declared namespace-scope
37384 function. The clauses are either processed directly (for a named
37385 function), or defered until the immediatley following declaration
37386 is parsed. */
37388 static void
37391 {
37393 /* The checking for "another pragma following this one" in the "no optional
37394 '( name )'" case makes sure that we dont re-enter. */
37397 cp_oacc_routine_data data;
37403 /* It is safe to take the address of a local variable; it will only be
37404 used while this scope is live. */
37407 /* Look for optional '( name )'. */
37409 {
37412 /* We parse the name as an id-expression. If it resolves to
37413 anything other than a non-overloaded function at namespace
37414 scope, it's an error. */
37428 {
37432 }
37434 data.clauses
37442 {
37447 }
37449 /* Perhaps we should use the same rule as declarations in different
37450 namespaces? */
37452 {
37457 }
37460 {
37464 }
37468 }
37470 {
37471 /* Store away all pragma tokens. */
37482 /* Emit a helpful diagnostic if there's another pragma following this
37483 one. */
37485 {
37488 /* ..., and then just keep going. */
37490 }
37492 /* We only have to consider the pragma_external case here. */
37497 else
37500 }
37501 }
37503 /* Finalize #pragma acc routine clauses after direct declarator has
37504 been parsed. */
37506 static tree
37508 {
37513 {
37515 "%<#pragma acc routine%> not immediately followed by "
37518 }
37535 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37536 fndecl_seen. */
37539 }
37541 /* Apply any saved OpenACC routine clauses to a just-parsed
37542 declaration. */
37544 static void
37546 {
37548 {
37549 /* Keep going if we're in error reporting mode. */
37555 {
37557 "%<#pragma acc routine%> not immediately followed by"
37561 }
37563 {
37566 }
37569 {
37574 }
37577 {
37583 }
37585 /* Process the routine's dimension clauses. */
37589 /* Add an "omp declare target" attribute. */
37594 /* Don't unset parser->oacc_routine here: we may still need it to
37595 diagnose wrong usage. But, remember that we've used this "#pragma acc
37596 routine". */
37598 }
37599 }
37601 /* Main entry point to OpenMP statement pragmas. */
37603 static void
37605 {
37606 tree stmt;
37611 {
37634 if_p);
37639 if_p);
37656 if_p);
37661 if_p);
37669 if_p);
37678 if_p);
37692 if_p);
37697 if_p);
37701 }
37704 }
37705 \f
37706 /* Transactional Memory parsing routines. */
37708 /* Parse a transaction attribute.
37710 txn-attribute:
37711 attribute
37712 [ [ identifier ] ]
37714 We use this instead of cp_parser_attributes_opt for transactions to avoid
37715 the pedwarn in C++98 mode. */
37717 static tree
37719 {
37734 {
37738 /* For keywords, use the canonical spelling,
37739 not the parsed identifier. */
37743 }
37744 else
37748 error1:
37751 }
37753 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37755 transaction-statement:
37756 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37757 compound-statement
37758 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37759 */
37761 static tree
37763 {
37774 else
37775 {
37779 }
37781 /* Parse a noexcept specification. */
37785 {
37786 /* cancel-and-throw is unimplemented. */
37789 }
37790 else
37793 /* Keep track if we're in the lexical scope of an outer transaction. */
37805 }
37807 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37809 transaction-expression:
37810 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37811 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37812 */
37814 static tree
37816 {
37829 keyword == RID_TRANSACTION_RELAXED
37843 /* Set this early. This might mean that we allow transaction_cancel in
37844 an expression that we find out later actually has to be a constexpr.
37845 However, we expect that cxx_constant_value will be able to deal with
37846 this; also, if the noexcept has no constexpr, then what we parse next
37847 really is a transaction's body. */
37850 /* Parse a noexcept specification. */
37856 {
37863 }
37864 else
37865 {
37866 /* The only expression that is available got parsed for the noexcept
37867 already. noexcept is true then. */
37870 }
37879 }
37881 /* Parse a function-transaction-block.
37883 function-transaction-block:
37884 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37885 function-body
37886 __transaction_atomic txn-attribute[opt] function-try-block
37887 __transaction_relaxed ctor-initializer[opt] function-body
37888 __transaction_relaxed function-try-block
37889 */
37891 static bool
37893 {
37909 else
37910 {
37914 }
37922 else
37923 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37931 }
37933 /* Parse a __transaction_cancel statement.
37935 cancel-statement:
37936 __transaction_cancel txn-attribute[opt] ;
37937 __transaction_cancel txn-attribute[opt] throw-expression ;
37939 ??? Cancel and throw is not yet implemented. */
37941 static tree
37943 {
37949 RT_TRANSACTION_CANCEL);
37956 /* ??? Parse cancel-and-throw here. */
37961 {
37965 }
37967 {
37971 }
37973 {
37976 {
37982 }
37983 }
37985 {
37989 }
37995 }
37996 \f
37997 /* The parser. */
38001 \f
38002 /* Special handling for the first token or line in the file. The first
38003 thing in the file might be #pragma GCC pch_preprocess, which loads a
38004 PCH file, which is a GC collection point. So we need to handle this
38005 first pragma without benefit of an existing lexer structure.
38007 Always returns one token to the caller in *FIRST_TOKEN. This is
38008 either the true first token of the file, or the first token after
38009 the initial pragma. */
38011 static void
38013 {
38022 {
38029 }
38030 else
38033 /* Skip to the end of the pragma. */
38037 /* Now actually load the PCH file. */
38041 /* Read one more token to return to our caller. We have to do this
38042 after reading the PCH file in, since its pointers have to be
38043 live. */
38045 }
38047 /* Parses the grainsize pragma for the _Cilk_for statement.
38048 Syntax:
38049 #pragma cilk grainsize = <VALUE>. */
38051 static void
38053 {
38055 {
38060 {
38063 }
38065 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38068 else
38070 "%<#pragma cilk grainsize%> is not followed by "
38073 }
38075 }
38077 /* Normal parsing of a pragma token. Here we can (and must) use the
38078 regular lexer. */
38080 static bool
38082 {
38085 tree stmt;
38096 {
38104 {
38114 }
38119 {
38129 }
38134 {
38140 "%<#pragma omp taskwait%> may only be "
38145 }
38150 {
38156 "%<#pragma omp taskyield%> may only be "
38161 }
38166 {
38172 "%<#pragma omp cancel%> may only be "
38177 }
38198 {
38202 }
38210 {
38214 }
38222 {
38226 }
38232 {
38236 }
38244 {
38248 }
38303 "%<#pragma omp section%> may only be used in "
38308 {
38310 {
38314 }
38321 {
38324 }
38327 }
38331 {
38335 }
38343 {
38347 }
38349 /* Ignore the pragma if Cilk Plus is not enabled. */
38351 {
38354 }
38355 else
38356 {
38360 }
38367 bad_stmt:
38370 }
38374 }
38376 /* The interface the pragma parsers have to the lexer. */
38378 enum cpp_ttype
38380 {
38392 else
38393 {
38397 }
38400 }
38402 \f
38403 /* External interface. */
38405 /* Parse one entire translation unit. */
38407 void
38409 {
38422 }
38424 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38425 vectorlength clause:
38426 Syntax:
38427 vectorlength ( constant-expression ) */
38429 static tree
38432 {
38434 tree expr;
38435 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38436 safelen clause. Thus, vectorlength is represented as OMP 4.0
38437 safelen. For SIMD-enabled function it is represented by OMP 4.0
38438 simdlen. */
38441 loc);
38442 else
38444 loc);
38452 /* If expr == error_mark_node, then don't emit any errors nor
38453 create a clause. if any of the above functions returns
38454 error mark node then they would have emitted an error message. */
38456 ;
38464 else
38465 {
38466 tree c;
38468 {
38473 }
38474 else
38475 {
38480 }
38481 }
38486 }
38488 /* Handles the Cilk Plus #pragma simd linear clause.
38489 Syntax:
38490 linear ( simd-linear-variable-list )
38492 simd-linear-variable-list:
38493 simd-linear-variable
38494 simd-linear-variable-list , simd-linear-variable
38496 simd-linear-variable:
38497 id-expression
38498 id-expression : simd-linear-step
38500 simd-linear-step:
38501 conditional-expression */
38503 static tree
38505 {
38511 {
38515 }
38520 {
38523 {
38527 }
38534 {
38538 }
38539 else
38540 {
38544 /* If present, parse the linear step. Otherwise, assume the default
38545 value of 1. */
38547 {
38554 {
38555 /* If an error has occurred, then the whole pragma is
38556 considered ill-formed. Thus, no reason to keep
38557 parsing. */
38560 }
38568 else
38570 "step size must be an integer constant "
38572 }
38574 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38580 }
38585 else
38586 {
38591 }
38592 }
38596 }
38598 /* Returns the name of the next clause. If the clause is not
38599 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38600 token is not consumed. Otherwise, the appropriate enum from the
38601 pragma_simd_clause is returned and the token is consumed. */
38603 static pragma_omp_clause
38605 {
38606 pragma_omp_clause clause_type;
38623 else
38628 }
38630 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38632 static tree
38634 {
38639 {
38640 pragma_omp_clause c_kind;
38647 /* Use the OpenMP 4.0 equivalent function. */
38650 /* Use the OpenMP 4.0 equivalent function. */
38652 clauses);
38654 /* Use the OMP 4.0 equivalent function. */
38656 clauses);
38658 /* Use the OMP 4.0 equivalent function. */
38660 else
38661 {
38665 }
38666 }
38672 else
38674 }
38676 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38678 static void
38680 {
38687 {
38691 }
38700 }
38702 /* Main entry-point for parsing Cilk Plus _Cilk_for
38703 loops. The return value is error_mark_node
38704 when errors happen and CILK_FOR tree on success. */
38706 static tree
38708 {
38723 else
38729 }
38731 /* Create an identifier for a generic parameter type (a synthesized
38732 template parameter implied by `auto' or a concept identifier). */
38735 static tree
38737 {
38741 }
38743 /* Predicate that behaves as is_auto_or_concept but matches the parent
38744 node of the generic type rather than the generic type itself. This
38745 allows for type transformation in add_implicit_template_parms. */
38749 {
38751 }
38753 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38754 (creating a new template parameter list if necessary). Returns the newly
38755 created template type parm. */
38757 static tree
38759 {
38762 /* Before committing to modifying any scope, if we're in an
38763 implicit template scope, and we're trying to synthesize a
38764 constrained parameter, try to find a previous parameter with
38765 the same name. This is the same-type rule for abbreviated
38766 function templates.
38768 NOTE: We can generate implicit parameters when tentatively
38769 parsing a nested name specifier, only to reject that parse
38770 later. However, matching the same template-id as part of a
38771 direct-declarator should generate an identical template
38772 parameter, so this rule will merge them. */
38774 {
38777 {
38779 {
38782 /* Return the TEMPLATE_PARM_INDEX. */
38785 }
38787 }
38788 }
38790 /* We are either continuing a function template that already contains implicit
38791 template parameters, creating a new fully-implicit function template, or
38792 extending an existing explicit function template with implicit template
38793 parameters. */
38801 {
38805 }
38806 else
38807 {
38808 /* Roll back to the existing template parameter scope (in the case of
38809 extending an explicit function template) or introduce a new template
38810 parameter scope ahead of the function parameter scope (or class scope
38811 in the case of out-of-line member definitions). The function scope is
38812 added back after template parameter synthesis below. */
38817 {
38820 }
38822 {
38823 /* If not defining a class, then any class scope is a scope level in
38824 an out-of-line member definition. In this case simply wind back
38825 beyond the first such scope to inject the template parameter list.
38826 Otherwise wind back to the class being defined. The latter can
38827 occur in class member friend declarations such as:
38829 class A {
38830 void foo (auto);
38831 };
38832 class B {
38833 friend void A::foo (auto);
38834 };
38836 The template parameter list synthesized for the friend declaration
38837 must be injected in the scope of 'B'. This can also occur in
38838 erroneous cases such as:
38840 struct A {
38841 struct B {
38842 void foo (auto);
38843 };
38844 void B::foo (auto) {}
38845 };
38847 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38848 but, nevertheless, the template parameter list synthesized for the
38849 declarator should be injected into the scope of 'A' as if the
38850 ill-formed template was specified explicitly. */
38853 {
38856 }
38857 }
38863 {
38864 /* Introduce a new template parameter list for implicit template
38865 parameters. */
38869 parser->implicit_template_scope
38876 }
38877 else
38878 {
38879 /* Synthesize implicit template parameters at the end of the explicit
38880 template parameter list. */
38887 parser->implicit_template_parms
38889 }
38890 }
38892 /* Synthesize a new template parameter and track the current template
38893 parameter chain with implicit_template_parms. */
38897 tree synth_tmpl_parm;
38901 synth_tmpl_parm
38904 synth_tmpl_parm
38906 else
38907 {
38911 }
38913 // Attach the constraint to the parm before processing.
38916 tree new_parm
38918 input_location,
38919 node,
38923 // Chain the new parameter to the list of implicit parameters.
38925 parser->implicit_template_parms
38927 else
38932 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38935 /* If creating a fully implicit function template, start the new implicit
38936 template parameter list with this synthesized type, otherwise grow the
38937 current template parameter list. */
38940 {
38947 }
38948 else
38949 {
38954 }
38956 // If the new parameter was constrained, we need to add that to the
38957 // constraints in the template parameter list.
38959 {
38963 }
38968 }
38970 /* Finish the declaration of a fully implicit function template. Such a
38971 template has no explicit template parameter list so has not been through the
38972 normal template head and tail processing. synthesize_implicit_template_parm
38973 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38974 provided if the declaration is a class member such that its template
38975 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38976 form is returned. Otherwise NULL_TREE is returned. */
38978 static tree
38980 {
38985 {
38989 }
38999 }