| blob | f82a90c43d2f58127507e69022d4662c8c667a1d |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2017 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
47 \f
48 /* The lexer. */
50 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
51 and c-lex.c) and the C++ parser. */
54 {
56 };
58 /* The various kinds of non integral constant we encounter. */
60 NIC_NONE,
61 /* floating-point literal */
62 NIC_FLOAT,
63 /* %<this%> */
64 NIC_THIS,
65 /* %<__FUNCTION__%> */
66 NIC_FUNC_NAME,
67 /* %<__PRETTY_FUNCTION__%> */
68 NIC_PRETTY_FUNC,
69 /* %<__func__%> */
70 NIC_C99_FUNC,
71 /* "%<va_arg%> */
72 NIC_VA_ARG,
73 /* a cast */
74 NIC_CAST,
75 /* %<typeid%> operator */
76 NIC_TYPEID,
77 /* non-constant compound literals */
78 NIC_NCC,
79 /* a function call */
80 NIC_FUNC_CALL,
81 /* an increment */
82 NIC_INC,
83 /* an decrement */
84 NIC_DEC,
85 /* an array reference */
86 NIC_ARRAY_REF,
87 /* %<->%> */
88 NIC_ARROW,
89 /* %<.%> */
90 NIC_POINT,
91 /* the address of a label */
92 NIC_ADDR_LABEL,
93 /* %<*%> */
94 NIC_STAR,
95 /* %<&%> */
96 NIC_ADDR,
97 /* %<++%> */
98 NIC_PREINCREMENT,
99 /* %<--%> */
100 NIC_PREDECREMENT,
101 /* %<new%> */
102 NIC_NEW,
103 /* %<delete%> */
104 NIC_DEL,
105 /* calls to overloaded operators */
106 NIC_OVERLOADED,
107 /* an assignment */
108 NIC_ASSIGNMENT,
109 /* a comma operator */
110 NIC_COMMA,
111 /* a call to a constructor */
112 NIC_CONSTRUCTOR,
113 /* a transaction expression */
114 NIC_TRANSACTION
115 };
117 /* The various kinds of errors about name-lookup failing. */
119 /* NULL */
120 NLE_NULL,
121 /* is not a type */
122 NLE_TYPE,
123 /* is not a class or namespace */
124 NLE_CXX98,
125 /* is not a class, namespace, or enumeration */
126 NLE_NOT_CXX98
127 };
129 /* The various kinds of required token */
131 RT_NONE,
153 /* The type is CPP_KEYWORD */
182 RT_TRANSACTION_CANCEL /* __transaction_cancel */
183 };
185 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
186 reverting it on destruction. */
188 class type_id_in_expr_sentinel
189 {
199 };
201 /* Prototypes. */
207 static void cp_lexer_destroy
209 static int cp_lexer_saving_tokens
213 static void cp_lexer_get_preprocessor_token
221 static bool cp_lexer_next_token_is_not
223 static bool cp_lexer_next_token_is_keyword
227 static void cp_lexer_purge_token
229 static void cp_lexer_purge_tokens_after
231 static void cp_lexer_save_tokens
233 static void cp_lexer_commit_tokens
235 static void cp_lexer_rollback_tokens
237 static void cp_lexer_print_token
241 static void cp_lexer_start_debugging
243 static void cp_lexer_stop_debugging
249 static void cp_parser_initial_pragma
252 static void cp_parser_cilk_simd
254 static tree cp_parser_cilk_for
256 static bool cp_parser_omp_declare_reduction_exprs
258 static tree cp_parser_cilk_simd_vectorlength
260 static void cp_finalize_oacc_routine
263 /* Manifest constants. */
264 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
265 #define CP_SAVED_TOKEN_STACK 5
267 /* Variables. */
269 /* The stream to which debugging output should be written. */
272 /* Nonzero if we are parsing an unevaluated operand: an operand to
273 sizeof, typeof, or alignof. */
276 /* Dump up to NUM tokens in BUFFER to FILE starting with token
277 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
278 first token in BUFFER. If NUM is 0, dump all the tokens. If
279 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
280 highlighted by surrounding it in [[ ]]. */
282 static void
286 {
303 {
306 }
311 {
318 nprinted++;
328 {
338 }
339 }
342 {
345 }
348 }
351 /* Dump all tokens in BUFFER to stderr. */
353 void
355 {
357 }
359 DEBUG_FUNCTION void
361 {
363 }
365 DEBUG_FUNCTION void
367 {
370 else
372 }
375 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
376 description for T. */
378 static void
380 {
382 {
385 }
386 }
389 /* Dump parser context C to FILE. */
391 static void
393 {
398 }
401 /* Print the stack of parsing contexts to FILE starting with FIRST. */
403 static void
405 {
411 {
414 }
415 }
418 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
420 static void
422 {
425 }
428 /* Print an unparsed function entry UF to FILE. */
430 static void
432 {
435 tree fn;
440 i++)
441 {
447 }
452 {
455 }
461 {
464 }
466 }
469 /* Print the stack of unparsed member functions S to FILE. */
471 static void
474 {
480 {
483 }
484 }
487 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
488 the given PARSER. If FILE is NULL, the output is printed on stderr. */
490 static void
492 {
504 next_token);
505 }
508 /* Dump debugging information for the given PARSER. If FILE is NULL,
509 the output is printed on stderr. */
511 void
513 {
516 expanded_location eloc;
594 }
596 DEBUG_FUNCTION void
598 {
600 }
602 DEBUG_FUNCTION void
604 {
607 else
609 }
611 /* Allocate memory for a new lexer object and return it. */
615 {
620 /* Allocate the memory. */
623 /* Initially we are not debugging. */
628 /* Create the buffer. */
632 }
635 /* Create a new main C++ lexer, the lexer that gets tokens from the
636 preprocessor. */
640 {
642 cp_token token;
644 /* It's possible that parsing the first pragma will load a PCH file,
645 which is a GC collection point. So we have to do that before
646 allocating any memory. */
651 /* Put the first token in the buffer. */
654 /* Get the remaining tokens from the preprocessor. */
656 {
659 }
668 /* Subsequent preprocessor diagnostics should use compiler
669 diagnostic functions to get the compiler source location. */
674 }
676 /* Create a new lexer whose token stream is primed with the tokens in
677 CACHE. When these tokens are exhausted, no new tokens will be read. */
681 {
686 /* We do not own the buffer. */
693 /* Initially we are not debugging. */
698 }
700 /* Frees all resources associated with LEXER. */
702 static void
704 {
708 }
710 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
711 be used. The point of this flag is to help the compiler to fold away calls
712 to cp_lexer_debugging_p within this source file at compile time, when the
713 lexer is not being debugged. */
715 #define LEXER_DEBUGGING_ENABLED_P false
717 /* Returns nonzero if debugging information should be output. */
721 {
726 }
731 {
735 }
739 {
741 }
745 {
747 }
751 {
754 else
756 }
760 {
763 /* Skip past purged tokens. */
765 {
767 tp--;
768 }
771 }
773 /* nonzero if we are presently saving tokens. */
777 {
779 }
781 /* Store the next token from the preprocessor in *TOKEN. Return true
782 if we reach EOF. If LEXER is NULL, assume we are handling an
783 initial #pragma pch_preprocess, and thus want the lexer to return
784 processed strings. */
786 static void
788 {
791 /* Get a new token from the preprocessor. */
792 token->type
799 /* On some systems, some header files are surrounded by an
800 implicit extern "C" block. Set a flag in the token if it
801 comes from such a header. */
806 /* Check to see if this token is a keyword. */
808 {
810 {
811 /* Mark this token as a keyword. */
813 /* Record which keyword. */
815 }
816 else
817 {
821 {
822 /* Warn about the C++0x keyword (but still treat it as
823 an identifier). */
828 /* Clear out the C_RID_CODE so we don't warn about this
829 particular identifier-turned-keyword again. */
831 }
834 }
835 }
837 {
838 /* This only happens in Objective-C++; it must be a keyword. */
841 {
842 /* Replace 'class' with '@class', 'private' with '@private',
843 etc. This prevents confusion with the C++ keyword
844 'class', and makes the tokens consistent with other
845 Objective-C 'AT' keywords. For example '@class' is
846 reported as RID_AT_CLASS which is consistent with
847 '@synchronized', which is reported as
848 RID_AT_SYNCHRONIZED.
849 */
859 }
860 }
861 }
863 /* Update the globals input_location and the input file stack from TOKEN. */
866 {
868 {
870 }
871 }
873 /* Update the globals input_location and the input file stack from LEXER. */
876 {
879 }
881 /* Return a pointer to the next token in the token stream, but do not
882 consume it. */
886 {
888 {
892 }
894 }
896 /* Return true if the next token has the indicated TYPE. */
900 {
902 }
904 /* Return true if the next token does not have the indicated TYPE. */
908 {
910 }
912 /* Return true if the next token is the indicated KEYWORD. */
916 {
918 }
922 {
924 }
928 {
930 }
932 /* Return true if the next token is not the indicated KEYWORD. */
936 {
938 }
940 /* Return true if KEYWORD can start a decl-specifier. */
942 bool
944 {
946 {
947 /* auto specifier: storage-class-specifier in C++,
948 simple-type-specifier in C++0x. */
950 /* Storage classes. */
956 /* Elaborated type specifiers. */
962 /* Simple type specifiers. */
976 /* GNU extensions. */
979 /* C++0x extensions. */
991 }
992 }
994 /* Return true if the next token is a keyword for a decl-specifier. */
996 static bool
998 {
1003 }
1005 /* Returns TRUE iff the token T begins a decltype type. */
1007 static bool
1009 {
1012 }
1014 /* Returns TRUE iff the next token begins a decltype type. */
1016 static bool
1018 {
1021 }
1023 /* Called when processing a token with tree_check_value; perform or defer the
1024 associated checks and return the value. */
1026 static tree
1028 {
1029 /* Perform any access checks that were deferred. */
1034 {
1040 }
1041 /* Return the stored value. */
1043 }
1045 /* Return a pointer to the Nth token in the token stream. If N is 1,
1046 then this is precisely equivalent to cp_lexer_peek_token (except
1047 that it is not inline). One would like to disallow that case, but
1048 there is one case (cp_parser_nth_token_starts_template_id) where
1049 the caller passes a variable for N and it might be 1. */
1053 {
1056 /* N is 1-based, not zero-based. */
1067 {
1070 {
1073 }
1077 }
1080 {
1083 }
1086 }
1088 /* Return the next token, and advance the lexer's next_token pointer
1089 to point to the next non-purged token. */
1093 {
1099 do
1100 {
1103 {
1106 }
1108 }
1113 /* Provide debugging output. */
1115 {
1119 }
1122 }
1124 /* Permanently remove the next token from the token stream, and
1125 advance the next_token pointer to refer to the next non-purged
1126 token. */
1128 static void
1130 {
1139 do
1140 {
1141 tok++;
1143 {
1146 }
1147 }
1150 }
1152 /* Permanently remove all tokens after TOK, up to, but not
1153 including, the token that will be returned next by
1154 cp_lexer_peek_token. */
1156 static void
1158 {
1167 {
1172 }
1173 }
1175 /* Begin saving tokens. All tokens consumed after this point will be
1176 preserved. */
1178 static void
1180 {
1181 /* Provide debugging output. */
1186 }
1188 /* Commit to the portion of the token stream most recently saved. */
1190 static void
1192 {
1193 /* Provide debugging output. */
1198 }
1200 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1201 to the token stream. Stop saving tokens. */
1203 static void
1205 {
1206 /* Provide debugging output. */
1211 }
1213 /* RAII wrapper around the above functions, with sanity checking. Creating
1214 a variable saves tokens, which are committed when the variable is
1215 destroyed unless they are explicitly rolled back by calling the rollback
1216 member function. */
1218 struct saved_token_sentinel
1219 {
1224 {
1227 }
1229 {
1232 }
1234 {
1238 }
1239 };
1241 /* Print a representation of the TOKEN on the STREAM. */
1243 static void
1245 {
1246 /* We don't use cpp_type2name here because the parser defines
1247 a few tokens of its own. */
1249 /* cpplib-defined token types */
1250 #define OP(e, s) #e,
1251 #define TK(e, s) #e,
1252 TTYPE_TABLE
1253 #undef OP
1254 #undef TK
1255 /* C++ parser token types - see "Manifest constants", above. */
1259 };
1261 /* For some tokens, print the associated data. */
1263 {
1265 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1266 For example, `struct' is mapped to an INTEGER_CST. */
1269 /* fall through */
1287 /* If we have a name for the token, print it out. Otherwise, we
1288 simply give the numeric code. */
1291 else
1294 }
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 }
1304 DEBUG_FUNCTION void
1306 {
1309 else
1311 }
1314 /* Start emitting debugging information. */
1316 static void
1318 {
1325 }
1327 /* Stop emitting debugging information. */
1329 static void
1331 {
1338 }
1340 /* Create a new cp_token_cache, representing a range of tokens. */
1344 {
1349 }
1351 /* Diagnose if #pragma omp declare simd isn't followed immediately
1352 by function declaration or definition. */
1356 {
1358 {
1362 }
1363 }
1365 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1366 and put that into "omp declare simd" attribute. */
1370 {
1372 {
1374 {
1377 }
1379 {
1382 }
1383 }
1384 }
1386 /* Diagnose if #pragma acc routine isn't followed immediately by function
1387 declaration or definition. */
1391 {
1393 {
1395 "%<#pragma acc routine%> not immediately followed by "
1398 }
1399 }
1400 \f
1401 /* Decl-specifiers. */
1403 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1405 static void
1407 {
1409 }
1411 /* Declarators. */
1413 /* Nothing other than the parser should be creating declarators;
1414 declarators are a semi-syntactic representation of C++ entities.
1415 Other parts of the front end that need to create entities (like
1416 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1419 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1429 /* An erroneous declarator. */
1432 /* The obstack on which declarators and related data structures are
1433 allocated. */
1436 /* Alloc BYTES from the declarator memory pool. */
1440 {
1442 }
1444 /* Allocate a declarator of the indicated KIND. Clear fields that are
1445 common to all declarators. */
1449 {
1461 }
1463 /* Make a declarator for a generalized identifier. If
1464 QUALIFYING_SCOPE is non-NULL, the identifier is
1465 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1466 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1467 is, if any. */
1471 special_function_kind sfk)
1472 {
1475 /* It is valid to write:
1477 class C { void f(); };
1478 typedef C D;
1479 void D::f();
1481 The standard is not clear about whether `typedef const C D' is
1482 legal; as of 2002-09-15 the committee is considering that
1483 question. EDG 3.0 allows that syntax. Therefore, we do as
1484 well. */
1498 }
1500 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1501 of modifiers such as const or volatile to apply to the pointer
1502 type, represented as identifiers. ATTRIBUTES represent the attributes that
1503 appertain to the pointer or reference. */
1505 cp_declarator *
1507 tree attributes)
1508 {
1516 {
1520 }
1521 else
1527 }
1529 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1530 represent the attributes that appertain to the pointer or
1531 reference. */
1533 cp_declarator *
1536 {
1544 {
1548 }
1549 else
1555 }
1557 /* Like make_pointer_declarator -- but for a pointer to a non-static
1558 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1559 appertain to the pointer or reference. */
1561 cp_declarator *
1564 tree attributes)
1565 {
1574 {
1577 }
1578 else
1584 }
1586 /* Make a declarator for the function given by TARGET, with the
1587 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1588 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1589 indicates what exceptions can be thrown. */
1591 cp_declarator *
1593 tree parms,
1594 cp_cv_quals cv_qualifiers,
1595 cp_virt_specifiers virt_specifiers,
1596 cp_ref_qualifier ref_qualifier,
1597 tree tx_qualifier,
1598 tree exception_specification,
1599 tree late_return_type,
1600 tree requires_clause)
1601 {
1615 {
1619 }
1620 else
1624 }
1626 /* Make a declarator for an array of BOUNDS elements, each of which is
1627 defined by ELEMENT. */
1629 cp_declarator *
1631 {
1638 {
1642 }
1643 else
1647 }
1649 /* Determine whether the declarator we've seen so far can be a
1650 parameter pack, when followed by an ellipsis. */
1651 static bool
1653 {
1655 /* We already saw an ellipsis. */
1658 /* Search for a declarator name, or any other declarator that goes
1659 after the point where the ellipsis could appear in a parameter
1660 pack. If we find any of these, then this declarator can not be
1661 made into a parameter pack. */
1664 {
1666 {
1679 }
1680 }
1683 }
1687 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1688 DECLARATOR and DEFAULT_ARGUMENT. */
1690 cp_parameter_declarator *
1693 tree default_argument,
1695 {
1703 else
1710 }
1712 /* Returns true iff DECLARATOR is a declaration for a function. */
1714 static bool
1716 {
1718 {
1727 }
1729 }
1731 /* The parser. */
1733 /* Overview
1734 --------
1736 A cp_parser parses the token stream as specified by the C++
1737 grammar. Its job is purely parsing, not semantic analysis. For
1738 example, the parser breaks the token stream into declarators,
1739 expressions, statements, and other similar syntactic constructs.
1740 It does not check that the types of the expressions on either side
1741 of an assignment-statement are compatible, or that a function is
1742 not declared with a parameter of type `void'.
1744 The parser invokes routines elsewhere in the compiler to perform
1745 semantic analysis and to build up the abstract syntax tree for the
1746 code processed.
1748 The parser (and the template instantiation code, which is, in a
1749 way, a close relative of parsing) are the only parts of the
1750 compiler that should be calling push_scope and pop_scope, or
1751 related functions. The parser (and template instantiation code)
1752 keeps track of what scope is presently active; everything else
1753 should simply honor that. (The code that generates static
1754 initializers may also need to set the scope, in order to check
1755 access control correctly when emitting the initializers.)
1757 Methodology
1758 -----------
1760 The parser is of the standard recursive-descent variety. Upcoming
1761 tokens in the token stream are examined in order to determine which
1762 production to use when parsing a non-terminal. Some C++ constructs
1763 require arbitrary look ahead to disambiguate. For example, it is
1764 impossible, in the general case, to tell whether a statement is an
1765 expression or declaration without scanning the entire statement.
1766 Therefore, the parser is capable of "parsing tentatively." When the
1767 parser is not sure what construct comes next, it enters this mode.
1768 Then, while we attempt to parse the construct, the parser queues up
1769 error messages, rather than issuing them immediately, and saves the
1770 tokens it consumes. If the construct is parsed successfully, the
1771 parser "commits", i.e., it issues any queued error messages and
1772 the tokens that were being preserved are permanently discarded.
1773 If, however, the construct is not parsed successfully, the parser
1774 rolls back its state completely so that it can resume parsing using
1775 a different alternative.
1777 Future Improvements
1778 -------------------
1780 The performance of the parser could probably be improved substantially.
1781 We could often eliminate the need to parse tentatively by looking ahead
1782 a little bit. In some places, this approach might not entirely eliminate
1783 the need to parse tentatively, but it might still speed up the average
1784 case. */
1786 /* Flags that are passed to some parsing functions. These values can
1787 be bitwise-ored together. */
1789 enum
1790 {
1791 /* No flags. */
1793 /* The construct is optional. If it is not present, then no error
1794 should be issued. */
1796 /* When parsing a type-specifier, treat user-defined type-names
1797 as non-type identifiers. */
1799 /* When parsing a type-specifier, do not try to parse a class-specifier
1800 or enum-specifier. */
1802 /* When parsing a decl-specifier-seq, only allow type-specifier or
1803 constexpr. */
1805 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1807 };
1809 /* This type is used for parameters and variables which hold
1810 combinations of the above flags. */
1813 /* The different kinds of declarators we want to parse. */
1815 enum cp_parser_declarator_kind
1816 {
1817 /* We want an abstract declarator. */
1818 CP_PARSER_DECLARATOR_ABSTRACT,
1819 /* We want a named declarator. */
1820 CP_PARSER_DECLARATOR_NAMED,
1821 /* We don't mind, but the name must be an unqualified-id. */
1822 CP_PARSER_DECLARATOR_EITHER
1823 };
1825 /* The precedence values used to parse binary expressions. The minimum value
1826 of PREC must be 1, because zero is reserved to quickly discriminate
1827 binary operators from other tokens. */
1829 enum cp_parser_prec
1830 {
1831 PREC_NOT_OPERATOR,
1832 PREC_LOGICAL_OR_EXPRESSION,
1833 PREC_LOGICAL_AND_EXPRESSION,
1834 PREC_INCLUSIVE_OR_EXPRESSION,
1835 PREC_EXCLUSIVE_OR_EXPRESSION,
1836 PREC_AND_EXPRESSION,
1837 PREC_EQUALITY_EXPRESSION,
1838 PREC_RELATIONAL_EXPRESSION,
1839 PREC_SHIFT_EXPRESSION,
1840 PREC_ADDITIVE_EXPRESSION,
1841 PREC_MULTIPLICATIVE_EXPRESSION,
1842 PREC_PM_EXPRESSION,
1843 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1844 };
1846 /* A mapping from a token type to a corresponding tree node type, with a
1847 precedence value. */
1849 struct cp_parser_binary_operations_map_node
1850 {
1851 /* The token type. */
1853 /* The corresponding tree code. */
1855 /* The precedence of this operator. */
1857 };
1859 struct cp_parser_expression_stack_entry
1860 {
1861 /* Left hand side of the binary operation we are currently
1862 parsing. */
1863 cp_expr lhs;
1864 /* Original tree code for left hand side, if it was a binary
1865 expression itself (used for -Wparentheses). */
1867 /* Tree code for the binary operation we are parsing. */
1869 /* Precedence of the binary operation we are parsing. */
1871 /* Location of the binary operation we are parsing. */
1872 location_t loc;
1873 };
1875 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1876 entries because precedence levels on the stack are monotonically
1877 increasing. */
1881 /* Prototypes. */
1883 /* Constructors and destructors. */
1888 /* Class variables. */
1892 /* The operator-precedence table used by cp_parser_binary_expression.
1893 Transformed into an associative array (binops_by_token) by
1894 cp_parser_new. */
1927 };
1929 /* The same as binops, but initialized by cp_parser_new so that
1930 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1931 for speed. */
1934 /* Constructors and destructors. */
1936 /* Construct a new context. The context below this one on the stack
1937 is given by NEXT. */
1941 {
1944 /* Allocate the storage. */
1946 {
1947 /* Pull the first entry from the free list. */
1951 }
1952 else
1955 /* No errors have occurred yet in this context. */
1957 /* If this is not the bottommost context, copy information that we
1958 need from the previous context. */
1960 {
1961 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1962 expression, then we are parsing one in this context, too. */
1964 /* Thread the stack. */
1966 }
1969 }
1971 /* Managing the unparsed function queues. */
1973 #define unparsed_funs_with_default_args \
1974 parser->unparsed_queues->last ().funs_with_default_args
1975 #define unparsed_funs_with_definitions \
1976 parser->unparsed_queues->last ().funs_with_definitions
1977 #define unparsed_nsdmis \
1978 parser->unparsed_queues->last ().nsdmis
1979 #define unparsed_classes \
1980 parser->unparsed_queues->last ().classes
1982 static void
1984 {
1987 }
1989 static void
1991 {
1994 }
1996 /* Prototypes. */
1998 /* Constructors and destructors. */
2003 /* Routines to parse various constructs.
2005 Those that return `tree' will return the error_mark_node (rather
2006 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2007 Sometimes, they will return an ordinary node if error-recovery was
2008 attempted, even though a parse error occurred. So, to check
2009 whether or not a parse error occurred, you should always use
2010 cp_parser_error_occurred. If the construct is optional (indicated
2011 either by an `_opt' in the name of the function that does the
2012 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2013 the construct is not present. */
2015 /* Lexical conventions [gram.lex] */
2017 static cp_expr cp_parser_identifier
2019 static cp_expr cp_parser_string_literal
2021 static cp_expr cp_parser_userdef_char_literal
2023 static tree cp_parser_userdef_string_literal
2025 static cp_expr cp_parser_userdef_numeric_literal
2028 /* Basic concepts [gram.basic] */
2030 static bool cp_parser_translation_unit
2033 /* Expressions [gram.expr] */
2035 static cp_expr cp_parser_primary_expression
2037 static cp_expr cp_parser_id_expression
2039 static cp_expr cp_parser_unqualified_id
2041 static tree cp_parser_nested_name_specifier_opt
2043 static tree cp_parser_nested_name_specifier
2045 static tree cp_parser_qualifying_entity
2047 static cp_expr cp_parser_postfix_expression
2049 static tree cp_parser_postfix_open_square_expression
2051 static tree cp_parser_postfix_dot_deref_expression
2055 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2057 static void cp_parser_pseudo_destructor_name
2059 static cp_expr cp_parser_unary_expression
2061 static enum tree_code cp_parser_unary_operator
2063 static tree cp_parser_new_expression
2067 static tree cp_parser_new_type_id
2075 static tree cp_parser_delete_expression
2077 static cp_expr cp_parser_cast_expression
2079 static cp_expr cp_parser_binary_expression
2081 static tree cp_parser_question_colon_clause
2083 static cp_expr cp_parser_assignment_expression
2085 static enum tree_code cp_parser_assignment_operator_opt
2087 static cp_expr cp_parser_expression
2089 static cp_expr cp_parser_constant_expression
2091 static cp_expr cp_parser_builtin_offsetof
2093 static cp_expr cp_parser_lambda_expression
2095 static void cp_parser_lambda_introducer
2097 static bool cp_parser_lambda_declarator_opt
2099 static void cp_parser_lambda_body
2102 /* Statements [gram.stmt.stmt] */
2104 static void cp_parser_statement
2106 static void cp_parser_label_for_labeled_statement
2108 static tree cp_parser_expression_statement
2110 static tree cp_parser_compound_statement
2112 static void cp_parser_statement_seq_opt
2114 static tree cp_parser_selection_statement
2116 static tree cp_parser_condition
2118 static tree cp_parser_iteration_statement
2120 static bool cp_parser_init_statement
2122 static tree cp_parser_for
2124 static tree cp_parser_c_for
2126 static tree cp_parser_range_for
2128 static void do_range_for_auto_deduction
2130 static tree cp_parser_perform_range_for_lookup
2132 static tree cp_parser_range_for_member_function
2134 static tree cp_parser_jump_statement
2136 static void cp_parser_declaration_statement
2139 static tree cp_parser_implicitly_scoped_statement
2141 static void cp_parser_already_scoped_statement
2144 /* Declarations [gram.dcl.dcl] */
2146 static void cp_parser_declaration_seq_opt
2148 static void cp_parser_declaration
2150 static void cp_parser_block_declaration
2152 static void cp_parser_simple_declaration
2154 static void cp_parser_decl_specifier_seq
2156 static tree cp_parser_storage_class_specifier_opt
2158 static tree cp_parser_function_specifier_opt
2160 static tree cp_parser_type_specifier
2163 static tree cp_parser_simple_type_specifier
2165 static tree cp_parser_type_name
2167 static tree cp_parser_type_name
2169 static tree cp_parser_nonclass_name
2171 static tree cp_parser_elaborated_type_specifier
2173 static tree cp_parser_enum_specifier
2175 static void cp_parser_enumerator_list
2177 static void cp_parser_enumerator_definition
2179 static tree cp_parser_namespace_name
2181 static void cp_parser_namespace_definition
2183 static void cp_parser_namespace_body
2185 static tree cp_parser_qualified_namespace_specifier
2187 static void cp_parser_namespace_alias_definition
2189 static bool cp_parser_using_declaration
2191 static void cp_parser_using_directive
2193 static tree cp_parser_alias_declaration
2195 static void cp_parser_asm_definition
2197 static void cp_parser_linkage_specification
2199 static void cp_parser_static_assert
2201 static tree cp_parser_decltype
2203 static tree cp_parser_decomposition_declaration
2206 /* Declarators [gram.dcl.decl] */
2208 static tree cp_parser_init_declarator
2215 static enum tree_code cp_parser_ptr_operator
2217 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2219 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2221 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2223 static tree cp_parser_tx_qualifier_opt
2225 static tree cp_parser_late_return_type_opt
2227 static tree cp_parser_declarator_id
2229 static tree cp_parser_type_id
2231 static tree cp_parser_template_type_arg
2234 static tree cp_parser_type_id_1
2236 static void cp_parser_type_specifier_seq
2238 static tree cp_parser_parameter_declaration_clause
2240 static tree cp_parser_parameter_declaration_list
2244 static tree cp_parser_default_argument
2246 static void cp_parser_function_body
2248 static tree cp_parser_initializer
2250 static cp_expr cp_parser_initializer_clause
2252 static cp_expr cp_parser_braced_list
2257 static bool cp_parser_ctor_initializer_opt_and_function_body
2260 static tree cp_parser_late_parsing_omp_declare_simd
2263 static tree cp_parser_late_parsing_cilk_simd_fn_info
2266 static tree cp_parser_late_parsing_oacc_routine
2269 static tree synthesize_implicit_template_parm
2271 static tree finish_fully_implicit_template
2274 /* Classes [gram.class] */
2276 static tree cp_parser_class_name
2278 static tree cp_parser_class_specifier
2280 static tree cp_parser_class_head
2282 static enum tag_types cp_parser_class_key
2284 static void cp_parser_type_parameter_key
2286 static void cp_parser_member_specification_opt
2288 static void cp_parser_member_declaration
2290 static tree cp_parser_pure_specifier
2292 static tree cp_parser_constant_initializer
2295 /* Derived classes [gram.class.derived] */
2297 static tree cp_parser_base_clause
2299 static tree cp_parser_base_specifier
2302 /* Special member functions [gram.special] */
2304 static tree cp_parser_conversion_function_id
2306 static tree cp_parser_conversion_type_id
2310 static bool cp_parser_ctor_initializer_opt
2312 static void cp_parser_mem_initializer_list
2314 static tree cp_parser_mem_initializer
2316 static tree cp_parser_mem_initializer_id
2319 /* Overloading [gram.over] */
2321 static cp_expr cp_parser_operator_function_id
2323 static cp_expr cp_parser_operator
2326 /* Templates [gram.temp] */
2328 static void cp_parser_template_declaration
2330 static tree cp_parser_template_parameter_list
2332 static tree cp_parser_template_parameter
2334 static tree cp_parser_type_parameter
2336 static tree cp_parser_template_id
2338 static tree cp_parser_template_name
2340 static tree cp_parser_template_argument_list
2342 static tree cp_parser_template_argument
2344 static void cp_parser_explicit_instantiation
2346 static void cp_parser_explicit_specialization
2349 /* Exception handling [gram.exception] */
2351 static tree cp_parser_try_block
2353 static bool cp_parser_function_try_block
2355 static void cp_parser_handler_seq
2357 static void cp_parser_handler
2359 static tree cp_parser_exception_declaration
2361 static tree cp_parser_throw_expression
2363 static tree cp_parser_exception_specification_opt
2365 static tree cp_parser_type_id_list
2368 /* GNU Extensions */
2370 static tree cp_parser_asm_specification_opt
2372 static tree cp_parser_asm_operand_list
2374 static tree cp_parser_asm_clobber_list
2376 static tree cp_parser_asm_label_list
2378 static bool cp_next_tokens_can_be_attribute_p
2380 static bool cp_next_tokens_can_be_gnu_attribute_p
2382 static bool cp_next_tokens_can_be_std_attribute_p
2384 static bool cp_nth_tokens_can_be_std_attribute_p
2386 static bool cp_nth_tokens_can_be_gnu_attribute_p
2388 static bool cp_nth_tokens_can_be_attribute_p
2390 static tree cp_parser_attributes_opt
2392 static tree cp_parser_gnu_attributes_opt
2394 static tree cp_parser_gnu_attribute_list
2396 static tree cp_parser_std_attribute
2398 static tree cp_parser_std_attribute_spec
2400 static tree cp_parser_std_attribute_spec_seq
2402 static bool cp_parser_extension_opt
2404 static void cp_parser_label_declaration
2407 /* Concept Extensions */
2409 static tree cp_parser_requires_clause
2411 static tree cp_parser_requires_clause_opt
2413 static tree cp_parser_requires_expression
2415 static tree cp_parser_requirement_parameter_list
2417 static tree cp_parser_requirement_body
2419 static tree cp_parser_requirement_list
2421 static tree cp_parser_requirement
2423 static tree cp_parser_simple_requirement
2425 static tree cp_parser_compound_requirement
2427 static tree cp_parser_type_requirement
2429 static tree cp_parser_nested_requirement
2432 /* Transactional Memory Extensions */
2434 static tree cp_parser_transaction
2436 static tree cp_parser_transaction_expression
2438 static bool cp_parser_function_transaction
2440 static tree cp_parser_transaction_cancel
2444 pragma_external,
2445 pragma_member,
2446 pragma_objc_icode,
2447 pragma_stmt,
2448 pragma_compound
2449 };
2450 static bool cp_parser_pragma
2453 /* Objective-C++ Productions */
2455 static tree cp_parser_objc_message_receiver
2457 static tree cp_parser_objc_message_args
2459 static tree cp_parser_objc_message_expression
2461 static cp_expr cp_parser_objc_encode_expression
2463 static tree cp_parser_objc_defs_expression
2465 static tree cp_parser_objc_protocol_expression
2467 static tree cp_parser_objc_selector_expression
2469 static cp_expr cp_parser_objc_expression
2471 static bool cp_parser_objc_selector_p
2473 static tree cp_parser_objc_selector
2475 static tree cp_parser_objc_protocol_refs_opt
2477 static void cp_parser_objc_declaration
2479 static tree cp_parser_objc_statement
2481 static bool cp_parser_objc_valid_prefix_attributes
2483 static void cp_parser_objc_at_property_declaration
2485 static void cp_parser_objc_at_synthesize_declaration
2487 static void cp_parser_objc_at_dynamic_declaration
2489 static tree cp_parser_objc_struct_declaration
2492 /* Utility Routines */
2494 static cp_expr cp_parser_lookup_name
2496 static tree cp_parser_lookup_name_simple
2498 static tree cp_parser_maybe_treat_template_as_class
2500 static bool cp_parser_check_declarator_template_parameters
2502 static bool cp_parser_check_template_parameters
2504 static cp_expr cp_parser_simple_cast_expression
2506 static tree cp_parser_global_scope_opt
2508 static bool cp_parser_constructor_declarator_p
2510 static tree cp_parser_function_definition_from_specifiers_and_declarator
2512 static tree cp_parser_function_definition_after_declarator
2514 static bool cp_parser_template_declaration_after_export
2516 static void cp_parser_perform_template_parameter_access_checks
2518 static tree cp_parser_single_declaration
2520 static cp_expr cp_parser_functional_cast
2522 static tree cp_parser_save_member_function_body
2524 static tree cp_parser_save_nsdmi
2526 static tree cp_parser_enclosed_template_argument_list
2528 static void cp_parser_save_default_args
2530 static void cp_parser_late_parsing_for_member
2532 static tree cp_parser_late_parse_one_default_arg
2534 static void cp_parser_late_parsing_nsdmi
2536 static void cp_parser_late_parsing_default_args
2538 static tree cp_parser_sizeof_operand
2540 static tree cp_parser_trait_expr
2542 static bool cp_parser_declares_only_class_p
2544 static void cp_parser_set_storage_class
2546 static void cp_parser_set_decl_spec_type
2548 static void set_and_check_decl_spec_loc
2551 static bool cp_parser_friend_p
2553 static void cp_parser_required_error
2559 static bool cp_parser_token_starts_function_definition_p
2561 static bool cp_parser_next_token_starts_class_definition_p
2563 static bool cp_parser_next_token_ends_template_argument_p
2565 static bool cp_parser_nth_token_starts_template_argument_list_p
2567 static enum tag_types cp_parser_token_is_class_key
2569 static enum tag_types cp_parser_token_is_type_parameter_key
2571 static void cp_parser_check_class_key
2573 static void cp_parser_check_access_in_redeclaration
2575 static bool cp_parser_optional_template_keyword
2577 static void cp_parser_pre_parsed_nested_name_specifier
2579 static bool cp_parser_cache_group
2581 static tree cp_parser_cache_defarg
2583 static void cp_parser_parse_tentatively
2585 static void cp_parser_commit_to_tentative_parse
2587 static void cp_parser_commit_to_topmost_tentative_parse
2589 static void cp_parser_abort_tentative_parse
2591 static bool cp_parser_parse_definitely
2595 static bool cp_parser_uncommitted_to_tentative_parse_p
2597 static void cp_parser_error
2599 static void cp_parser_name_lookup_error
2601 static bool cp_parser_simulate_error
2603 static bool cp_parser_check_type_definition
2605 static void cp_parser_check_for_definition_in_return_type
2607 static void cp_parser_check_for_invalid_template_id
2609 static bool cp_parser_non_integral_constant_expression
2611 static void cp_parser_diagnose_invalid_type_name
2613 static bool cp_parser_parse_and_diagnose_invalid_type_name
2615 static int cp_parser_skip_to_closing_parenthesis
2617 static void cp_parser_skip_to_end_of_statement
2619 static void cp_parser_consume_semicolon_at_end_of_statement
2621 static void cp_parser_skip_to_end_of_block_or_statement
2623 static bool cp_parser_skip_to_closing_brace
2625 static void cp_parser_skip_to_end_of_template_parameter_list
2627 static void cp_parser_skip_to_pragma_eol
2629 static bool cp_parser_error_occurred
2631 static bool cp_parser_allow_gnu_extensions_p
2633 static bool cp_parser_is_pure_string_literal
2635 static bool cp_parser_is_string_literal
2637 static bool cp_parser_is_keyword
2639 static tree cp_parser_make_typename_type
2643 static bool cp_parser_compound_literal_p
2645 static bool cp_parser_array_designator_p
2647 static bool cp_parser_init_statement_p
2649 static bool cp_parser_skip_to_closing_square_bracket
2652 /* Concept-related syntactic transformations */
2657 // -------------------------------------------------------------------------- //
2658 // Unevaluated Operand Guard
2659 //
2660 // Implementation of an RAII helper for unevaluated operand parsing.
2662 {
2665 }
2668 {
2671 }
2673 // -------------------------------------------------------------------------- //
2674 // Tentative Parsing
2676 /* Returns nonzero if we are parsing tentatively. */
2680 {
2682 }
2684 /* Returns nonzero if TOKEN is a string literal. */
2686 static bool
2688 {
2694 }
2696 /* Returns nonzero if TOKEN is a string literal
2697 of a user-defined string literal. */
2699 static bool
2701 {
2708 }
2710 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2712 static bool
2714 {
2716 }
2718 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2719 PRAGMA_NONE. */
2721 static enum pragma_kind
2723 {
2726 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2728 }
2730 /* Helper function for cp_parser_error.
2731 Having peeked a token of kind TOK1_KIND that might signify
2732 a conflict marker, peek successor tokens to determine
2733 if we actually do have a conflict marker.
2734 Specifically, we consider a run of 7 '<', '=' or '>' characters
2735 at the start of a line as a conflict marker.
2736 These come through the lexer as three pairs and a single,
2737 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2738 If it returns true, *OUT_LOC is written to with the location/range
2739 of the marker. */
2741 static bool
2744 {
2755 /* It must be at the start of the line. */
2760 /* We have a conflict marker. Construct a location of the form:
2761 <<<<<<<
2762 ^~~~~~~
2763 with start == caret, finishing at the end of the marker. */
2768 }
2770 /* If not parsing tentatively, issue a diagnostic of the form
2771 FILE:LINE: MESSAGE before TOKEN
2772 where TOKEN is the next token in the input stream. MESSAGE
2773 (specified by the caller) is usually of the form "expected
2774 OTHER-TOKEN". */
2776 static void
2778 {
2780 {
2782 /* This diagnostic makes more sense if it is tagged to the line
2783 of the token we just peeked at. */
2787 {
2792 }
2794 /* If this is actually a conflict marker, report it as such. */
2798 {
2799 location_t loc;
2801 {
2804 }
2805 }
2808 /* Because c_parser_error does not understand
2809 CPP_KEYWORD, keywords are treated like
2810 identifiers. */
2813 }
2814 }
2816 /* Issue an error about name-lookup failing. NAME is the
2817 IDENTIFIER_NODE DECL is the result of
2818 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2819 the thing that we hoped to find. */
2821 static void
2823 tree name,
2824 tree decl,
2825 name_lookup_error desired,
2826 location_t location)
2827 {
2828 /* If name lookup completely failed, tell the user that NAME was not
2829 declared. */
2831 {
2844 else
2846 }
2848 {
2850 {
2867 }
2868 }
2870 {
2872 {
2882 name);
2886 }
2887 }
2888 else
2889 {
2891 {
2904 }
2905 }
2906 }
2908 /* If we are parsing tentatively, remember that an error has occurred
2909 during this tentative parse. Returns true if the error was
2910 simulated; false if a message should be issued by the caller. */
2912 static bool
2914 {
2916 {
2919 }
2921 }
2923 /* This function is called when a type is defined. If type
2924 definitions are forbidden at this point, an error message is
2925 issued. */
2927 static bool
2929 {
2930 /* If types are forbidden here, issue a message. */
2932 {
2933 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2934 in the message need to be interpreted. */
2937 }
2939 }
2941 /* This function is called when the DECLARATOR is processed. The TYPE
2942 was a type defined in the decl-specifiers. If it is invalid to
2943 define a type in the decl-specifiers for DECLARATOR, an error is
2944 issued. TYPE_LOCATION is the location of TYPE and is used
2945 for error reporting. */
2947 static void
2950 {
2951 /* [dcl.fct] forbids type definitions in return types.
2952 Unfortunately, it's not easy to know whether or not we are
2953 processing a return type until after the fact. */
2961 {
2966 type);
2967 }
2968 }
2970 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2971 "<" in any valid C++ program. If the next token is indeed "<",
2972 issue a message warning the user about what appears to be an
2973 invalid attempt to form a template-id. LOCATION is the location
2974 of the type-specifier (TYPE) */
2976 static void
2978 tree type,
2980 location_t location)
2981 {
2985 {
2989 {
2992 else
2994 }
2995 else
2997 /* Remember the location of the invalid "<". */
3000 /* Consume the "<". */
3002 /* Parse the template arguments. */
3004 /* Permanently remove the invalid template arguments so that
3005 this error message is not issued again. */
3008 }
3009 }
3011 /* If parsing an integral constant-expression, issue an error message
3012 about the fact that THING appeared and return true. Otherwise,
3013 return false. In either case, set
3014 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3016 static bool
3018 non_integral_constant thing)
3019 {
3022 {
3024 {
3027 {
3030 "ISO C++ forbids using a floating-point literal "
3035 "enumeration type cannot appear in a "
3126 }
3130 }
3131 }
3133 }
3135 /* Emit a diagnostic for an invalid type name. This function commits
3136 to the current active tentative parse, if any. (Otherwise, the
3137 problematic construct might be encountered again later, resulting
3138 in duplicate error messages.) LOCATION is the location of ID. */
3140 static void
3142 location_t location)
3143 {
3146 /* Try to lookup the identifier. */
3153 /* If the lookup was ambiguous, an error will already have
3154 been issued. */
3156 /* If the lookup found a template-name, it means that the user forgot
3157 to specify an argument list. Emit a useful error message. */
3159 {
3162 decl);
3167 }
3171 /* Something like 'unsigned A a;' */
3174 {
3175 /* Issue an error message. */
3180 {
3186 }
3187 else
3189 /* If we're in a template class, it's possible that the user was
3190 referring to a type from a base class. For example:
3192 template <typename T> struct A { typedef T X; };
3193 template <typename T> struct B : public A<T> { X x; };
3195 The user should have said "typename A<T>::X". */
3211 {
3212 tree b;
3215 b;
3217 {
3221 {
3222 tree field;
3223 /* Go from a particular instantiation of the
3224 template (which will have an empty TYPE_FIELDs),
3225 to the main version. */
3228 field;
3232 {
3237 }
3240 }
3241 }
3242 }
3243 }
3244 /* Here we diagnose qualified-ids where the scope is actually correct,
3245 but the identifier does not resolve to a valid type name. */
3247 {
3249 {
3254 else
3260 }
3263 {
3264 /* A<T>::A<T>() */
3270 }
3277 {
3285 else
3291 }
3292 else
3294 }
3295 }
3297 /* Check for a common situation where a type-name should be present,
3298 but is not, and issue a sensible error message. Returns true if an
3299 invalid type-name was detected.
3301 The situation handled by this function are variable declarations of the
3302 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3303 Usually, `ID' should name a type, but if we got here it means that it
3304 does not. We try to emit the best possible error message depending on
3305 how exactly the id-expression looks like. */
3307 static bool
3309 {
3310 tree id;
3313 /* Avoid duplicate error about ambiguous lookup. */
3315 {
3319 }
3328 /* If the next token is a (, this is a function with no explicit return
3329 type, i.e. constructor, destructor or conversion op. */
3332 {
3335 }
3339 /* Emit a diagnostic for the invalid type. */
3341 out:
3342 /* If we aren't in the middle of a declarator (i.e. in a
3343 parameter-declaration-clause), skip to the end of the declaration;
3344 there's no point in trying to process it. */
3348 }
3350 /* Consume tokens up to, and including, the next non-nested closing `)'.
3351 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3352 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3353 found an unnested token of that type. */
3355 static int
3358 cpp_ttype or_ttype,
3360 {
3370 {
3373 /* Have we found what we're looking for before the closing paren? */
3379 {
3382 /* If we've run out of tokens, then there is no closing `)'. */
3385 /* This is good for lambda expression capture-lists. */
3395 /* This matches the processing in skip_to_end_of_statement. */
3415 {
3419 }
3424 }
3426 /* Consume the token. */
3428 }
3429 }
3431 /* Consume tokens up to, and including, the next non-nested closing `)'.
3432 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3433 are doing error recovery. Returns -1 if OR_COMMA is true and we
3434 found an unnested token of that type. */
3436 static int
3441 {
3445 }
3447 /* Consume tokens until we reach the end of the current statement.
3448 Normally, that will be just before consuming a `;'. However, if a
3449 non-nested `}' comes first, then we stop before consuming that. */
3451 static void
3453 {
3456 /* Unwind generic function template scope if necessary. */
3461 {
3465 {
3468 /* If we've run out of tokens, stop. */
3472 /* If the next token is a `;', we have reached the end of the
3473 statement. */
3479 /* If this is a non-nested '}', stop before consuming it.
3480 That way, when confronted with something like:
3482 { 3 + }
3484 we stop before consuming the closing '}', even though we
3485 have not yet reached a `;'. */
3489 /* If it is the closing '}' for a block that we have
3490 scanned, stop -- but only after consuming the token.
3491 That way given:
3493 void f g () { ... }
3494 typedef int I;
3496 we will stop after the body of the erroneously declared
3497 function, but before consuming the following `typedef'
3498 declaration. */
3500 {
3503 }
3512 }
3514 /* Consume the token. */
3516 }
3517 }
3519 /* This function is called at the end of a statement or declaration.
3520 If the next token is a semicolon, it is consumed; otherwise, error
3521 recovery is attempted. */
3523 static void
3525 {
3526 /* Look for the trailing `;'. */
3528 {
3529 /* If there is additional (erroneous) input, skip to the end of
3530 the statement. */
3532 /* If the next token is now a `;', consume it. */
3535 }
3536 }
3538 /* Skip tokens until we have consumed an entire block, or until we
3539 have consumed a non-nested `;'. */
3541 static void
3543 {
3546 /* Unwind generic function template scope if necessary. */
3551 {
3555 {
3558 /* If we've run out of tokens, stop. */
3562 /* Stop if this is an unnested ';'. */
3568 /* Stop if this is an unnested '}', or closes the outermost
3569 nesting level. */
3570 nesting_depth--;
3578 /* Nest. */
3579 nesting_depth++;
3584 }
3586 /* Consume the token. */
3588 }
3589 }
3591 /* Skip tokens until a non-nested closing curly brace is the next
3592 token, or there are no more tokens. Return true in the first case,
3593 false otherwise. */
3595 static bool
3597 {
3601 {
3605 {
3608 /* If we've run out of tokens, stop. */
3612 /* If the next token is a non-nested `}', then we have reached
3613 the end of the current block. */
3619 /* If it the next token is a `{', then we are entering a new
3620 block. Consume the entire block. */
3626 }
3628 /* Consume the token. */
3630 }
3631 }
3633 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3634 parameter is the PRAGMA token, allowing us to purge the entire pragma
3635 sequence. */
3637 static void
3639 {
3644 do
3648 /* Ensure that the pragma is not parsed again. */
3650 }
3652 /* Require pragma end of line, resyncing with it as necessary. The
3653 arguments are as for cp_parser_skip_to_pragma_eol. */
3655 static void
3657 {
3661 }
3663 /* This is a simple wrapper around make_typename_type. When the id is
3664 an unresolved identifier node, we can provide a superior diagnostic
3665 using cp_parser_diagnose_invalid_type_name. */
3667 static tree
3669 location_t id_location)
3670 {
3671 tree result;
3673 {
3679 }
3681 }
3683 /* This is a wrapper around the
3684 make_{pointer,ptrmem,reference}_declarator functions that decides
3685 which one to call based on the CODE and CLASS_TYPE arguments. The
3686 CODE argument should be one of the values returned by
3687 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3688 appertain to the pointer or reference. */
3692 cp_cv_quals cv_qualifiers,
3694 tree attributes)
3695 {
3702 else
3712 }
3714 /* Create a new C++ parser. */
3718 {
3723 /* cp_lexer_new_main is called before doing GC allocation because
3724 cp_lexer_new_main might load a PCH file. */
3727 /* Initialize the binops_by_token so that we can get the tree
3728 directly from the token. */
3736 /* For now, we always accept GNU extensions. */
3739 /* The `>' token is a greater-than operator, not the end of a
3740 template-id. */
3745 /* We are not parsing a constant-expression. */
3750 /* Local variable names are not forbidden. */
3753 /* We are not processing an `extern "C"' declaration. */
3756 /* We are not processing a declarator. */
3759 /* We are not processing a template-argument-list. */
3762 /* We are not in an iteration statement. */
3765 /* We are not in a switch statement. */
3768 /* We are not parsing a type-id inside an expression. */
3771 /* Declarations aren't implicitly extern "C". */
3774 /* String literals should be translated to the execution character set. */
3777 /* We are not parsing a function body. */
3780 /* We can correct until told otherwise. */
3783 /* The unparsed function queue is empty. */
3786 /* There are no classes being defined. */
3789 /* No template parameters apply. */
3792 /* Special parsing data structures. */
3797 /* Not declaring an implicit function template. */
3803 /* Allow constrained-type-specifiers. */
3807 }
3809 /* Create a cp_lexer structure which will emit the tokens in CACHE
3810 and push it onto the parser's lexer stack. This is used for delayed
3811 parsing of in-class method bodies and default arguments, and should
3812 not be confused with tentative parsing. */
3813 static void
3815 {
3820 /* Move the current source position to that of the first token in the
3821 new lexer. */
3823 }
3825 /* Pop the top lexer off the parser stack. This is never used for the
3826 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3827 static void
3829 {
3834 /* Put the current source position back where it was before this
3835 lexer was pushed. */
3837 }
3839 /* Lexical conventions [gram.lex] */
3841 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3842 identifier. */
3844 static cp_expr
3846 {
3849 /* Look for the identifier. */
3851 /* Return the value. */
3854 else
3856 }
3858 /* Parse a sequence of adjacent string constants. Returns a
3859 TREE_STRING representing the combined, nul-terminated string
3860 constant. If TRANSLATE is true, translate the string to the
3861 execution character set. If WIDE_OK is true, a wide string is
3862 invalid here.
3864 C++98 [lex.string] says that if a narrow string literal token is
3865 adjacent to a wide string literal token, the behavior is undefined.
3866 However, C99 6.4.5p4 says that this results in a wide string literal.
3867 We follow C99 here, for consistency with the C front end.
3869 This code is largely lifted from lex_string() in c-lex.c.
3871 FUTURE: ObjC++ will need to handle @-strings here. */
3872 static cp_expr
3875 {
3876 tree value;
3883 tree string_tree;
3889 {
3892 }
3897 {
3901 }
3902 else
3903 {
3906 }
3909 /* Try to avoid the overhead of creating and destroying an obstack
3910 for the common case of just one string. */
3913 {
3921 {
3925 }
3926 else
3930 }
3931 else
3932 {
3937 do
3938 {
3940 count++;
3945 {
3948 {
3951 }
3954 {
3959 }
3961 }
3962 else
3966 {
3970 {
3974 "unsupported non-standard concatenation "
3976 }
3977 }
3985 {
3989 }
3990 else
3991 {
3995 }
3996 }
3999 /* A string literal built by concatenation has its caret=start at
4000 the start of the initial string, and its finish at the finish of
4001 the final string literal. */
4005 }
4008 {
4011 }
4015 {
4020 {
4035 }
4040 {
4045 else
4047 }
4048 }
4049 else
4050 /* cpp_interpret_string has issued an error. */
4057 }
4059 /* Look up a literal operator with the name and the exact arguments. */
4061 static tree
4063 {
4070 {
4076 {
4079 {
4089 }
4092 /* May be this should be sufficient_parms_p instead,
4093 depending on how exactly should user-defined literals
4094 work in presence of default arguments on the literal
4095 operator parameters. */
4098 }
4099 }
4102 }
4104 /* Parse a user-defined char constant. Returns a call to a user-defined
4105 literal operator taking the character as an argument. */
4107 static cp_expr
4109 {
4117 /* Build up a call to the user-defined operator */
4118 /* Lookup the name we got back from the id-expression. */
4123 {
4128 }
4132 }
4134 /* A subroutine of cp_parser_userdef_numeric_literal to
4135 create a char... template parameter pack from a string node. */
4137 static tree
4139 {
4140 tree charvec;
4146 /* Fill in CHARVEC with all of the parameters. */
4151 /* Build the argument packs. */
4157 }
4159 /* A subroutine of cp_parser_userdef_numeric_literal to
4160 create a char... template parameter pack from a string node. */
4162 static tree
4164 {
4165 tree charvec;
4176 /* First template parm is character type. */
4179 /* Fill in CHARVEC with all of the parameters. */
4186 /* Build the argument packs. */
4192 }
4194 /* Parse a user-defined numeric constant. returns a call to a user-defined
4195 literal operator. */
4197 static cp_expr
4199 {
4210 /* Look for a literal operator taking the exact type of numeric argument
4211 as the literal value. */
4216 {
4218 tf_warning_or_error);
4221 {
4224 long_long_unsigned_type_node);
4225 }
4226 else
4227 {
4231 long_double_type_node);
4235 }
4239 }
4242 /* If the numeric argument didn't work, look for a raw literal
4243 operator taking a const char* argument consisting of the number
4244 in string format. */
4249 {
4251 tf_warning_or_error);
4254 }
4257 /* If the raw literal didn't work, look for a non-type template
4258 function with parameter pack char.... Call the function with
4259 template parameter characters representing the number. */
4263 {
4267 tf_warning_or_error);
4270 }
4279 }
4281 /* Parse a user-defined string constant. Returns a call to a user-defined
4282 literal operator taking a character pointer and the length of the string
4283 as arguments. */
4285 static tree
4287 {
4296 /* Build up a call to the user-defined operator. */
4297 /* Lookup the name we got back from the id-expression. */
4304 {
4306 tf_warning_or_error);
4309 }
4312 /* Look for a template function with typename parameter CharT
4313 and parameter pack CharT... Call the function with
4314 template parameter characters representing the string. */
4318 {
4322 tf_warning_or_error);
4325 }
4331 }
4334 /* Basic concepts [gram.basic] */
4336 /* Parse a translation-unit.
4338 translation-unit:
4339 declaration-seq [opt]
4341 Returns TRUE if all went well. */
4343 static bool
4345 {
4346 /* The address of the first non-permanent object on the declarator
4347 obstack. */
4352 /* Create the declarator obstack, if necessary. */
4354 {
4356 /* Create the error declarator. */
4358 /* Create the empty parameter list. */
4360 /* Remember where the base of the declarator obstack lies. */
4362 }
4366 /* If there are no tokens left then all went well. */
4368 {
4369 /* Get rid of the token array; we don't need it any more. */
4373 /* This file might have been a context that's implicitly extern
4374 "C". If so, pop the lang context. (Only relevant for PCH.) */
4376 {
4379 }
4381 /* Finish up. */
4385 }
4386 else
4387 {
4390 }
4392 /* Make sure the declarator obstack was fully cleaned up. */
4396 /* All went well. */
4398 }
4400 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4401 decltype context. */
4405 {
4410 }
4412 /* We're about to parse a collection of statements. If we're currently
4413 parsing tentatively, set up a firewall so that any nested
4414 cp_parser_commit_to_tentative_parse won't affect the current context. */
4416 static cp_token_position
4418 {
4425 }
4427 /* We've finished parsing the collection of statements. Wrap up the
4428 firewall and replace the relevant tokens with the parsed form. */
4430 static void
4432 tree expr)
4433 {
4437 /* Finish the firewall level. */
4439 /* And remember the result of the parse for when we try again. */
4445 }
4447 /* Like the above functions, but let the user modify the tokens. Used by
4448 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4449 later parses, so it makes sense to localize the effects of
4450 cp_parser_commit_to_tentative_parse. */
4452 struct tentative_firewall
4453 {
4458 {
4459 /* If we're currently parsing tentatively, start a committed level as a
4460 firewall and then an inner tentative parse. */
4462 {
4466 }
4467 }
4470 {
4472 {
4473 /* Finish the inner tentative parse and the firewall, propagating any
4474 uncommitted error state to the outer tentative parse. */
4480 }
4481 }
4482 };
4484 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4485 enclosing parentheses. */
4487 static cp_expr
4489 {
4492 /* Consume the '('. */
4495 /* Start the statement-expression. */
4497 /* Parse the compound-statement. */
4499 /* Finish up. */
4501 /* Consume the ')'. */
4509 }
4511 /* Expressions [gram.expr] */
4513 /* Parse a fold-operator.
4515 fold-operator:
4516 - * / % ^ & | = < > << >>
4517 = -= *= /= %= ^= &= |= <<= >>=
4518 == != <= >= && || , .* ->*
4520 This returns the tree code corresponding to the matched operator
4521 as an int. When the current token matches a compound assignment
4522 opertor, the resulting tree code is the negative value of the
4523 non-assignment operator. */
4525 static int
4527 {
4529 {
4569 }
4570 }
4572 /* Returns true if CODE indicates a binary expression, which is not allowed in
4573 the LHS of a fold-expression. More codes will need to be added to use this
4574 function in other contexts. */
4576 static bool
4578 {
4580 {
4613 }
4614 }
4616 /* If the next token is a suitable fold operator, consume it and return as
4617 the function above. */
4619 static int
4621 {
4627 }
4629 /* Parse a fold-expression.
4631 fold-expression:
4632 ( ... folding-operator cast-expression)
4633 ( cast-expression folding-operator ... )
4634 ( cast-expression folding operator ... folding-operator cast-expression)
4636 Note that the '(' and ')' are matched in primary expression. */
4638 static cp_expr
4640 {
4641 cp_id_kind pidk;
4643 // Left fold.
4645 {
4649 {
4652 }
4659 }
4664 {
4667 }
4670 {
4673 }
4676 /* The operands of a fold-expression are cast-expressions, so binary or
4677 conditional expressions are not allowed. We check this here to avoid
4678 tentative parsing. */
4688 // Right fold.
4693 {
4696 }
4699 // Binary left or right fold.
4704 }
4706 /* Parse a primary-expression.
4708 primary-expression:
4709 literal
4710 this
4711 ( expression )
4712 id-expression
4713 lambda-expression (C++11)
4715 GNU Extensions:
4717 primary-expression:
4718 ( compound-statement )
4719 __builtin_va_arg ( assignment-expression , type-id )
4720 __builtin_offsetof ( type-id , offsetof-expression )
4722 C++ Extensions:
4723 __has_nothrow_assign ( type-id )
4724 __has_nothrow_constructor ( type-id )
4725 __has_nothrow_copy ( type-id )
4726 __has_trivial_assign ( type-id )
4727 __has_trivial_constructor ( type-id )
4728 __has_trivial_copy ( type-id )
4729 __has_trivial_destructor ( type-id )
4730 __has_virtual_destructor ( type-id )
4731 __is_abstract ( type-id )
4732 __is_base_of ( type-id , type-id )
4733 __is_class ( type-id )
4734 __is_empty ( type-id )
4735 __is_enum ( type-id )
4736 __is_final ( type-id )
4737 __is_literal_type ( type-id )
4738 __is_pod ( type-id )
4739 __is_polymorphic ( type-id )
4740 __is_std_layout ( type-id )
4741 __is_trivial ( type-id )
4742 __is_union ( type-id )
4744 Objective-C++ Extension:
4746 primary-expression:
4747 objc-expression
4749 literal:
4750 __null
4752 ADDRESS_P is true iff this expression was immediately preceded by
4753 "&" and therefore might denote a pointer-to-member. CAST_P is true
4754 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4755 true iff this expression is a template argument.
4757 Returns a representation of the expression. Upon return, *IDK
4758 indicates what kind of id-expression (if any) was present. */
4760 static cp_expr
4767 {
4770 /* Assume the primary expression is not an id-expression. */
4773 /* Peek at the next token. */
4776 {
4777 /* literal:
4778 integer-literal
4779 character-literal
4780 floating-literal
4781 string-literal
4782 boolean-literal
4783 pointer-literal
4784 user-defined-literal */
4796 {
4800 }
4801 /* Floating-point literals are only allowed in an integral
4802 constant expression if they are cast to an integral or
4803 enumeration type. */
4807 {
4808 /* CAST_P will be set even in invalid code like "int(2.7 +
4809 ...)". Therefore, we have to check that the next token
4810 is sure to end the cast. */
4812 {
4817 enumerator-definition. */
4819 /* The curly brace at the end of an enum-specifier. */
4821 /* The end of a statement. */
4823 /* The end of the cast-expression. */
4825 /* The end of an array bound. */
4827 /* The closing ">" in a template-argument-list. */
4830 /* C++0x only: A ">>" treated like two ">" tokens,
4831 in a template-argument-list. */
4836 }
4838 /* If we are within a cast, then the constraint that the
4839 cast is to an integral or enumeration type will be
4840 checked at that point. If we are not within a cast, then
4841 this code is invalid. */
4844 }
4864 /* ??? Should wide strings be allowed when parser->translate_strings_p
4865 is false (i.e. in attributes)? If not, we can kill the third
4866 argument to cp_parser_string_literal. */
4872 /* If we see `( { ' then we are looking at the beginning of
4873 a GNU statement-expression. */
4876 {
4877 /* Statement-expressions are not allowed by the standard. */
4881 /* And they're not allowed outside of a function-body; you
4882 cannot, for example, write:
4884 int i = ({ int j = 3; j + 1; });
4886 at class or namespace scope. */
4889 {
4891 "statement-expressions are not allowed outside "
4897 }
4898 else
4900 }
4901 /* Otherwise it's a normal parenthesized expression. */
4902 {
4903 cp_expr expr;
4908 /* Consume the `('. */
4910 /* Within a parenthesized expression, a `>' token is always
4911 the greater-than operator. */
4912 saved_greater_than_is_operator_p
4917 /* Left fold expression. */
4919 else
4920 /* Parse the parenthesized expression. */
4925 {
4932 }
4933 else
4934 /* Let the front end know that this expression was
4935 enclosed in parentheses. This matters in case, for
4936 example, the expression is of the form `A::B', since
4937 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4938 not. */
4941 /* DR 705: Wrapping an unqualified name in parentheses
4942 suppresses arg-dependent lookup. We want to pass back
4943 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4944 (c++/37862), but none of the others. */
4948 /* The `>' token might be the end of a template-id or
4949 template-parameter-list now. */
4950 parser->greater_than_is_operator_p
4953 /* Consume the `)'. */
4962 }
4965 {
4967 {
4968 /* We might have an Objective-C++ message. */
4971 /* If that works out, we're done ... */
4974 /* ... else, fall though to see if it's a lambda. */
4975 }
4977 /* Don't warn about a failed tentative parse. */
4982 }
4986 /* We have an Objective-C++ string literal. */
4993 {
4994 /* These two are the boolean literals. */
5002 /* The `__null' literal. */
5007 /* The `nullptr' literal. */
5012 /* Recognize the `this' keyword. */
5016 {
5020 }
5021 /* Pointers cannot appear in constant-expressions. */
5026 /* The `operator' keyword can be the beginning of an
5027 id-expression. */
5034 {
5035 non_integral_constant name;
5037 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5038 __func__ are the names of variables -- but they are
5039 treated specially. Therefore, they are handled here,
5040 rather than relying on the generic id-expression logic
5041 below. Grammatically, these names are id-expressions.
5043 Consume the token. */
5047 {
5059 }
5064 /* Look up the name. */
5066 }
5069 {
5070 tree expression;
5071 tree type;
5072 source_location type_location;
5073 location_t start_loc
5075 /* The `__builtin_va_arg' construct is used to handle
5076 `va_arg'. Consume the `__builtin_va_arg' token. */
5078 /* Look for the opening `('. */
5080 /* Now, parse the assignment-expression. */
5082 /* Look for the `,'. */
5085 /* Parse the type-id. */
5086 {
5089 }
5090 /* Look for the closing `)'. */
5091 location_t finish_loc
5094 /* Using `va_arg' in a constant-expression is not
5095 allowed. */
5097 NIC_VA_ARG))
5099 /* Construct a location of the form:
5100 __builtin_va_arg (v, int)
5101 ~~~~~~~~~~~~~~~~~~~~~^~~~
5102 with the caret at the type, ranging from the start of the
5103 "__builtin_va_arg" token to the close paren. */
5104 location_t combined_loc
5107 }
5140 // C++ concepts
5144 /* Objective-C++ expressions. */
5154 {
5159 }
5160 /* FALLTHRU */
5164 }
5166 /* An id-expression can start with either an identifier, a
5167 `::' as the beginning of a qualified-id, or the "operator"
5168 keyword. */
5173 {
5174 id_expression:
5175 cp_expr id_expression;
5176 cp_expr decl;
5182 /* Parse the id-expression. */
5183 id_expression
5200 /* If we have a template-id, then no further lookup is
5201 required. If the template-id was for a template-class, we
5202 will sometimes have a TYPE_DECL at this point. */
5206 /* Look up the name. */
5207 else
5208 {
5209 tree ambiguous_decls;
5211 /* If we already know that this lookup is ambiguous, then
5212 we've already issued an error message; there's no reason
5213 to check again. */
5216 {
5219 }
5222 none_type,
5223 template_p,
5228 /* If the lookup was ambiguous, an error will already have
5229 been issued. */
5233 /* In Objective-C++, we may have an Objective-C 2.0
5234 dot-syntax for classes here. */
5239 {
5240 tree component;
5247 component);
5248 /* Build a location of the form:
5249 expr.component
5250 ~~~~~^~~~~~~~~
5251 with caret at the start of the component name (at
5252 input_location), ranging from the start of the id_expression
5253 to the end of the component name. */
5254 location_t combined_loc
5259 }
5261 /* In Objective-C++, an instance variable (ivar) may be preferred
5262 to whatever cp_parser_lookup_name() found.
5263 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5264 rest of c-family, we have to do a little extra work to preserve
5265 any location information in cp_expr "decl". Given that
5266 objc_lookup_ivar is implemented in "c-family" and "objc", we
5267 have a trip through the pure "tree" type, rather than cp_expr.
5268 Naively copying it back to "decl" would implicitly give the
5269 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5270 store an EXPR_LOCATION. Hence we only update "decl" (and
5271 hence its location_t) if we get back a different tree node. */
5273 id_expression);
5277 /* If name lookup gives us a SCOPE_REF, then the
5278 qualifying scope was dependent. */
5280 {
5281 /* At this point, we do not know if DECL is a valid
5282 integral constant expression. We assume that it is
5283 in fact such an expression, so that code like:
5285 template <int N> struct A {
5286 int a[B<N>::i];
5287 };
5289 is accepted. At template-instantiation time, we
5290 will check that B<N>::i is actually a constant. */
5292 }
5293 /* Check to see if DECL is a local variable in a context
5294 where that is forbidden. */
5297 {
5298 /* It might be that we only found DECL because we are
5299 trying to be generous with pre-ISO scoping rules.
5300 For example, consider:
5302 int i;
5303 void g() {
5304 for (int i = 0; i < 10; ++i) {}
5305 extern void f(int j = i);
5306 }
5308 Here, name look up will originally find the out
5309 of scope `i'. We need to issue a warning message,
5310 but then use the global `i'. */
5313 {
5318 }
5319 }
5320 }
5322 decl = (finish_id_expression
5324 idk,
5329 template_arg_p,
5336 }
5338 /* Anything else is an error. */
5342 }
5343 }
5351 {
5354 }
5356 /* Parse an id-expression.
5358 id-expression:
5359 unqualified-id
5360 qualified-id
5362 qualified-id:
5363 :: [opt] nested-name-specifier template [opt] unqualified-id
5364 :: identifier
5365 :: operator-function-id
5366 :: template-id
5368 Return a representation of the unqualified portion of the
5369 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5370 a `::' or nested-name-specifier.
5372 Often, if the id-expression was a qualified-id, the caller will
5373 want to make a SCOPE_REF to represent the qualified-id. This
5374 function does not do this in order to avoid wastefully creating
5375 SCOPE_REFs when they are not required.
5377 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5378 `template' keyword.
5380 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5381 uninstantiated templates.
5383 If *TEMPLATE_P is non-NULL, it is set to true iff the
5384 `template' keyword is used to explicitly indicate that the entity
5385 named is a template.
5387 If DECLARATOR_P is true, the id-expression is appearing as part of
5388 a declarator, rather than as part of an expression. */
5390 static cp_expr
5397 {
5401 /* Assume the `template' keyword was not used. */
5405 /* Look for the optional `::' operator. */
5406 global_scope_p
5409 /* Look for the optional nested-name-specifier. */
5410 nested_name_specifier_p
5413 check_dependency_p,
5415 declarator_p)
5417 /* If there is a nested-name-specifier, then we are looking at
5418 the first qualified-id production. */
5420 {
5421 tree saved_scope;
5422 tree saved_object_scope;
5423 tree saved_qualifying_scope;
5424 cp_expr unqualified_id;
5427 /* See if the next token is the `template' keyword. */
5431 /* Name lookup we do during the processing of the
5432 unqualified-id might obliterate SCOPE. */
5436 /* Process the final unqualified-id. */
5438 check_dependency_p,
5439 declarator_p,
5441 /* Restore the SAVED_SCOPE for our caller. */
5447 }
5448 /* Otherwise, if we are in global scope, then we are looking at one
5449 of the other qualified-id productions. */
5451 {
5453 tree id;
5455 /* Peek at the next token. */
5458 /* If it's an identifier, and the next token is not a "<", then
5459 we can avoid the template-id case. This is an optimization
5460 for this common case. */
5462 && !cp_parser_nth_token_starts_template_argument_list_p
5467 /* Try a template-id. */
5471 none_type,
5472 declarator_p);
5473 /* If that worked, we're done. */
5477 /* Peek at the next token. (Changes in the token buffer may
5478 have invalidated the pointer obtained above.) */
5482 {
5489 /* Fall through. */
5494 }
5495 }
5496 else
5499 declarator_p,
5500 optional_p);
5501 }
5503 /* Parse an unqualified-id.
5505 unqualified-id:
5506 identifier
5507 operator-function-id
5508 conversion-function-id
5509 ~ class-name
5510 template-id
5512 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5513 keyword, in a construct like `A::template ...'.
5515 Returns a representation of unqualified-id. For the `identifier'
5516 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5517 production a BIT_NOT_EXPR is returned; the operand of the
5518 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5519 other productions, see the documentation accompanying the
5520 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5521 names are looked up in uninstantiated templates. If DECLARATOR_P
5522 is true, the unqualified-id is appearing as part of a declarator,
5523 rather than as part of an expression. */
5525 static cp_expr
5531 {
5534 /* Peek at the next token. */
5538 {
5540 {
5541 tree id;
5543 /* We don't know yet whether or not this will be a
5544 template-id. */
5546 /* Try a template-id. */
5548 check_dependency_p,
5549 none_type,
5550 declarator_p);
5551 /* If it worked, we're done. */
5554 /* Otherwise, it's an ordinary identifier. */
5556 }
5560 check_dependency_p,
5561 none_type,
5562 declarator_p);
5565 {
5566 tree type_decl;
5567 tree qualifying_scope;
5568 tree object_scope;
5569 tree scope;
5572 /* Consume the `~' token. */
5574 /* Parse the class-name. The standard, as written, seems to
5575 say that:
5577 template <typename T> struct S { ~S (); };
5578 template <typename T> S<T>::~S() {}
5580 is invalid, since `~' must be followed by a class-name, but
5581 `S<T>' is dependent, and so not known to be a class.
5582 That's not right; we need to look in uninstantiated
5583 templates. A further complication arises from:
5585 template <typename T> void f(T t) {
5586 t.T::~T();
5587 }
5589 Here, it is not possible to look up `T' in the scope of `T'
5590 itself. We must look in both the current scope, and the
5591 scope of the containing complete expression.
5593 Yet another issue is:
5595 struct S {
5596 int S;
5597 ~S();
5598 };
5600 S::~S() {}
5602 The standard does not seem to say that the `S' in `~S'
5603 should refer to the type `S' and not the data member
5604 `S::S'. */
5606 /* DR 244 says that we look up the name after the "~" in the
5607 same scope as we looked up the qualifying name. That idea
5608 isn't fully worked out; it's more complicated than that. */
5613 /* Check for invalid scopes. */
5615 {
5619 }
5621 {
5625 scope);
5630 }
5633 /* If the name is of the form "X::~X" it's OK even if X is a
5634 typedef. */
5643 {
5646 }
5648 /* ~auto means the destructor of whatever the object is. */
5650 {
5653 "%<~auto%> only available with "
5657 }
5659 /* If there was an explicit qualification (S::~T), first look
5660 in the scope given by the qualification (i.e., S).
5662 Note: in the calls to cp_parser_class_name below we pass
5663 typename_type so that lookup finds the injected-class-name
5664 rather than the constructor. */
5668 {
5673 typename_type,
5676 declarator_p);
5679 }
5680 /* In "N::S::~S", look in "N" as well. */
5682 {
5687 type_decl
5691 typename_type,
5694 declarator_p);
5697 }
5698 /* In "p->S::~T", look in the scope given by "*p" as well. */
5700 {
5705 type_decl
5709 typename_type,
5712 declarator_p);
5715 }
5716 /* Look in the surrounding context. */
5718 {
5724 type_decl
5728 typename_type,
5731 declarator_p);
5734 {
5735 /* We couldn't find a type with this name. If we're parsing
5736 tentatively, fail and try something else. */
5738 {
5741 }
5742 /* Otherwise, accept it and check for a match at instantiation
5743 time. */
5748 }
5749 }
5750 /* If an error occurred, assume that the name of the
5751 destructor is the same as the name of the qualifying
5752 class. That allows us to keep parsing after running
5753 into ill-formed destructor names. */
5759 /* Check that destructor name and scope match. */
5761 {
5768 }
5770 /* [class.dtor]
5772 A typedef-name that names a class shall not be used as the
5773 identifier in the declarator for a destructor declaration. */
5780 type_decl);
5783 }
5787 {
5788 cp_expr id;
5790 /* This could be a template-id, so we try that first. */
5792 /* Try a template-id. */
5795 none_type,
5796 declarator_p);
5797 /* If that worked, we're done. */
5800 /* We still don't know whether we're looking at an
5801 operator-function-id or a conversion-function-id. */
5803 /* Try an operator-function-id. */
5805 /* If that didn't work, try a conversion-function-id. */
5809 {
5810 /* 17.6.3.3.5 */
5815 "literal operator suffixes not preceded by %<_%>"
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 "found %<:%> in nested-name-specifier, "
5938 }
5941 && !cp_parser_nth_token_starts_template_argument_list_p
5944 }
5946 /* The nested-name-specifier is optional, so we parse
5947 tentatively. */
5950 /* Look for the optional `template' keyword, if this isn't the
5951 first time through the loop. */
5954 else
5957 /* Save the old scope since the name lookup we are about to do
5958 might destroy it. */
5961 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5962 look up names in "X<T>::I" in order to determine that "Y" is
5963 a template. So, if we have a typename at this point, we make
5964 an effort to look through it. */
5966 && !typename_keyword_p
5971 /* Parse the qualifying entity. */
5972 new_scope
5974 typename_keyword_p,
5975 template_keyword_p,
5976 check_dependency_p,
5977 type_p,
5978 is_declaration);
5979 /* Look for the `::' token. */
5982 /* If we found what we wanted, we keep going; otherwise, we're
5983 done. */
5985 {
5988 /* Restore the OLD_SCOPE since it was valid before the
5989 failed attempt at finding the last
5990 class-or-namespace-name. */
5994 /* If the next token is a decltype, and the one after that is a
5995 `::', then the decltype has failed to resolve to a class or
5996 enumeration type. Give this error even when parsing
5997 tentatively since it can't possibly be valid--and we're going
5998 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5999 won't get another chance.*/
6003 {
6010 /* As below. */
6013 }
6017 {
6018 /* If we have a non-type template-id followed by ::, it can't
6019 possibly be valid. */
6024 {
6027 {
6033 }
6034 else
6035 {
6036 /* Variable template. */
6041 }
6048 /* As below. */
6052 }
6053 }
6057 /* If the next token is an identifier, and the one after
6058 that is a `::', then any valid interpretation would have
6059 found a class-or-namespace-name. */
6065 {
6068 {
6070 {
6071 tree decl;
6072 tree ambiguous_decls;
6075 none_type,
6084 decl);
6086 {
6087 // cp_parser_lookup_name has the same diagnostic,
6088 // thus make sure to emit it at most once.
6091 {
6096 }
6098 }
6099 else
6100 {
6102 cp_parser_name_lookup_error
6105 else
6106 cp_parser_name_lookup_error
6109 }
6110 }
6113 /* Treat this as a successful nested-name-specifier
6114 due to:
6116 [basic.lookup.qual]
6118 If the name found is not a class-name (clause
6119 _class_) or namespace-name (_namespace.def_), the
6120 program is ill-formed. */
6122 }
6124 }
6126 }
6127 /* We've found one valid nested-name-specifier. */
6129 /* Name lookup always gives us a DECL. */
6132 /* Uses of "template" must be followed by actual templates. */
6144 new_scope);
6145 /* If it is a class scope, try to complete it; we are about to
6146 be looking up names inside the class. */
6148 /* Since checking types for dependency can be expensive,
6149 avoid doing it if the type is already complete. */
6151 /* Do not try to complete dependent types. */
6153 {
6155 /* If it is a typedef to current class, use the current
6156 class instead, as the typedef won't have any names inside
6157 it yet. */
6161 }
6162 /* Make sure we look in the right scope the next time through
6163 the loop. */
6165 }
6167 /* If parsing tentatively, replace the sequence of tokens that makes
6168 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6169 token. That way, should we re-parse the token stream, we will
6170 not have to repeat the effort required to do the parse, nor will
6171 we issue duplicate error messages. */
6173 {
6177 /* Reset the contents of the START token. */
6179 /* Retrieve any deferred checks. Do not pop this access checks yet
6180 so the memory will not be reclaimed during token replacing below. */
6188 /* Purge all subsequent tokens. */
6190 }
6196 }
6198 /* Parse a nested-name-specifier. See
6199 cp_parser_nested_name_specifier_opt for details. This function
6200 behaves identically, except that it will an issue an error if no
6201 nested-name-specifier is present. */
6203 static tree
6209 {
6210 tree scope;
6212 /* Look for the nested-name-specifier. */
6214 typename_keyword_p,
6215 check_dependency_p,
6216 type_p,
6217 is_declaration);
6218 /* If it was not present, issue an error message. */
6220 {
6223 }
6226 }
6228 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6229 this is either a class-name or a namespace-name (which corresponds
6230 to the class-or-namespace-name production in the grammar). For
6231 C++0x, it can also be a type-name that refers to an enumeration
6232 type or a simple-template-id.
6234 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6235 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6236 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6237 TYPE_P is TRUE iff the next name should be taken as a class-name,
6238 even the same name is declared to be another entity in the same
6239 scope.
6241 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6242 specified by the class-or-namespace-name. If neither is found the
6243 ERROR_MARK_NODE is returned. */
6245 static tree
6252 {
6253 tree saved_scope;
6254 tree saved_qualifying_scope;
6255 tree saved_object_scope;
6256 tree scope;
6260 /* DR 743: decltype can appear in a nested-name-specifier. */
6262 {
6266 {
6269 }
6273 }
6275 /* Before we try to parse the class-name, we must save away the
6276 current PARSER->SCOPE since cp_parser_class_name will destroy
6277 it. */
6281 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6282 there is no need to look for a namespace-name. */
6283 only_class_p = template_keyword_p
6288 typename_keyword_p,
6289 template_keyword_p,
6291 check_dependency_p,
6293 is_declaration,
6296 /* If that didn't work, try for a namespace-name. */
6298 {
6299 /* Restore the saved scope. */
6303 /* If we are not looking at an identifier followed by the scope
6304 resolution operator, then this is not part of a
6305 nested-name-specifier. (Note that this function is only used
6306 to parse the components of a nested-name-specifier.) */
6311 }
6314 }
6316 /* Return true if we are looking at a compound-literal, false otherwise. */
6318 static bool
6320 {
6321 /* Consume the `('. */
6326 /* Skip tokens until the next token is a closing parenthesis.
6327 If we find the closing `)', and the next token is a `{', then
6328 we are looking at a compound-literal. */
6329 bool compound_literal_p
6334 /* Roll back the tokens we skipped. */
6338 }
6340 /* Parse a postfix-expression.
6342 postfix-expression:
6343 primary-expression
6344 postfix-expression [ expression ]
6345 postfix-expression ( expression-list [opt] )
6346 simple-type-specifier ( expression-list [opt] )
6347 typename :: [opt] nested-name-specifier identifier
6348 ( expression-list [opt] )
6349 typename :: [opt] nested-name-specifier template [opt] template-id
6350 ( expression-list [opt] )
6351 postfix-expression . template [opt] id-expression
6352 postfix-expression -> template [opt] id-expression
6353 postfix-expression . pseudo-destructor-name
6354 postfix-expression -> pseudo-destructor-name
6355 postfix-expression ++
6356 postfix-expression --
6357 dynamic_cast < type-id > ( expression )
6358 static_cast < type-id > ( expression )
6359 reinterpret_cast < type-id > ( expression )
6360 const_cast < type-id > ( expression )
6361 typeid ( expression )
6362 typeid ( type-id )
6364 GNU Extension:
6366 postfix-expression:
6367 ( type-id ) { initializer-list , [opt] }
6369 This extension is a GNU version of the C99 compound-literal
6370 construct. (The C99 grammar uses `type-name' instead of `type-id',
6371 but they are essentially the same concept.)
6373 If ADDRESS_P is true, the postfix expression is the operand of the
6374 `&' operator. CAST_P is true if this expression is the target of a
6375 cast.
6377 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6378 class member access expressions [expr.ref].
6380 Returns a representation of the expression. */
6382 static cp_expr
6386 {
6388 location_t loc;
6395 /* Peek at the next token. */
6400 /* Some of the productions are determined by keywords. */
6403 {
6408 {
6409 tree type;
6410 cp_expr expression;
6414 /* All of these can be handled in the same way from the point
6415 of view of parsing. Begin by consuming the token
6416 identifying the cast. */
6419 /* New types cannot be defined in the cast. */
6421 parser->type_definition_forbidden_message
6424 /* Look for the opening `<'. */
6426 /* Parse the type to which we are casting. */
6431 /* Look for the closing `>'. */
6433 /* Restore the old message. */
6436 bool saved_greater_than_is_operator_p
6440 /* And the expression which is being cast. */
6444 RT_CLOSE_PAREN);
6448 parser->greater_than_is_operator_p
6451 /* Only type conversions to integral or enumeration types
6452 can be used in constant-expressions. */
6455 {
6458 }
6461 {
6463 postfix_expression
6467 postfix_expression
6471 postfix_expression
6473 tf_warning_or_error);
6476 postfix_expression
6481 }
6483 /* Construct a location e.g. :
6484 reinterpret_cast <int *> (expr)
6485 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6486 ranging from the start of the "*_cast" token to the final closing
6487 paren, with the caret at the start. */
6490 }
6494 {
6495 tree type;
6499 /* Consume the `typeid' token. */
6501 /* Look for the `(' token. */
6503 /* Types cannot be defined in a `typeid' expression. */
6505 parser->type_definition_forbidden_message
6507 /* We can't be sure yet whether we're looking at a type-id or an
6508 expression. */
6510 /* Try a type-id first. */
6515 /* Look for the `)' token. Otherwise, we can't be sure that
6516 we're not looking at an expression: consider `typeid (int
6517 (3))', for example. */
6519 /* If all went well, simply lookup the type-id. */
6522 /* Otherwise, fall back to the expression variant. */
6523 else
6524 {
6525 tree expression;
6527 /* Look for an expression. */
6529 /* Compute its typeid. */
6531 /* Look for the `)' token. */
6533 }
6534 /* Restore the saved message. */
6536 /* `typeid' may not appear in an integral constant expression. */
6539 }
6543 {
6544 tree type;
6545 /* The syntax permitted here is the same permitted for an
6546 elaborated-type-specifier. */
6553 }
6557 {
6558 location_t cilk_spawn_loc
6563 {
6568 }
6570 {
6575 }
6576 else
6577 {
6578 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6581 }
6583 postfix_expression =
6587 {
6591 }
6593 {
6598 }
6599 else
6600 {
6603 postfix_expression);
6604 /* Build a location of the form:
6605 _Cilk_spawn expr
6606 ~~~~~~~~~~~~^~~~
6607 with caret at the expr, ranging from the start of the
6608 _Cilk_spawn token to the end of the expression. */
6609 location_t combined_loc =
6615 }
6617 }
6622 {
6625 tree p;
6632 {
6635 }
6641 {
6644 postfix_expression
6646 else
6647 {
6651 }
6657 tf_warning_or_error);
6658 else
6659 {
6663 }
6668 postfix_expression
6672 postfix_expression
6675 else
6676 {
6680 }
6685 }
6687 }
6690 {
6691 tree type;
6693 /* If the next thing is a simple-type-specifier, we may be
6694 looking at a functional cast. We could also be looking at
6695 an id-expression. So, we try the functional cast, and if
6696 that doesn't work we fall back to the primary-expression. */
6698 /* Look for the simple-type-specifier. */
6702 CP_PARSER_FLAGS_NONE);
6704 /* Parse the cast itself. */
6706 postfix_expression
6708 /* If that worked, we're done. */
6712 /* If the functional-cast didn't work out, try a
6713 compound-literal. */
6716 {
6721 /* Avoid calling cp_parser_type_id pointlessly, see comment
6722 in cp_parser_cast_expression about c++/29234. */
6725 else
6726 {
6727 /* Parse the type. */
6732 /* Look for the `)'. */
6734 }
6736 /* If things aren't going well, there's no need to
6737 keep going. */
6739 {
6741 /* Parse the brace-enclosed initializer list. */
6744 }
6745 /* If that worked, we're definitely looking at a
6746 compound-literal expression. */
6748 {
6749 /* Warn the user that a compound literal is not
6750 allowed in standard C++. */
6753 /* For simplicity, we disallow compound literals in
6754 constant-expressions. We could
6755 allow compound literals of integer type, whose
6756 initializer was a constant, in constant
6757 expressions. Permitting that usage, as a further
6758 extension, would not change the meaning of any
6759 currently accepted programs. (Of course, as
6760 compound literals are not part of ISO C++, the
6761 standard has nothing to say.) */
6763 NIC_NCC))
6764 {
6767 }
6768 /* Form the representation of the compound-literal. */
6769 postfix_expression
6774 }
6775 }
6777 /* It must be a primary-expression. */
6778 postfix_expression
6781 decltype_p,
6783 }
6785 }
6787 /* Note that we don't need to worry about calling build_cplus_new on a
6788 class-valued CALL_EXPR in decltype when it isn't the end of the
6789 postfix-expression; unary_complex_lvalue will take care of that for
6790 all these cases. */
6792 /* Keep looping until the postfix-expression is complete. */
6794 {
6798 /* It is not a Koenig lookup function call. */
6799 postfix_expression
6802 /* Peek at the next token. */
6806 {
6809 {
6811 "two consecutive %<[%> shall "
6814 }
6815 postfix_expression
6817 postfix_expression,
6819 decltype_p);
6828 /* postfix-expression ( expression-list [opt] ) */
6829 {
6840 is_builtin_constant_p
6843 {
6844 /* The whole point of __builtin_constant_p is to allow
6845 non-constant expressions to appear as arguments. */
6846 saved_integral_constant_expression_p
6848 saved_non_integral_constant_expression_p
6851 }
6852 args = (cp_parser_parenthesized_expression_list
6858 {
6859 parser->integral_constant_expression_p
6861 parser->non_integral_constant_expression_p
6863 }
6866 {
6869 }
6871 /* Function calls are not permitted in
6872 constant-expressions. */
6875 NIC_FUNC_CALL))
6876 {
6880 }
6885 {
6887 {
6889 {
6892 postfix_expression
6894 complain);
6895 }
6896 else
6897 postfix_expression
6899 }
6900 /* We do not perform argument-dependent lookup if
6901 normal lookup finds a non-function, in accordance
6902 with the expected resolution of DR 218. */
6905 {
6909 /* Do not do argument dependent lookup if regular
6910 lookup finds a member function or a block-scope
6911 function declaration. [basic.lookup.argdep]/3 */
6914 {
6917 postfix_expression
6919 complain);
6920 }
6921 }
6922 }
6928 {
6937 }
6940 {
6950 {
6952 postfix_expression
6956 }
6959 {
6960 postfix_expression
6961 = (build_new_method_call
6967 complain));
6968 }
6969 else
6970 postfix_expression
6974 complain);
6975 }
6979 postfix_expression = (build_offset_ref_call_from_tree
6981 complain));
6983 /* A call to a static class member, or a namespace-scope
6984 function. */
6985 postfix_expression
6988 koenig_p,
6989 complain);
6990 else
6991 /* All other function calls. */
6992 postfix_expression
6995 koenig_p,
6996 complain);
6999 {
7001 start_loc,
7002 close_paren_loc);
7004 }
7006 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7010 }
7015 /* postfix-expression . template [opt] id-expression
7016 postfix-expression . pseudo-destructor-name
7017 postfix-expression -> template [opt] id-expression
7018 postfix-expression -> pseudo-destructor-name */
7020 /* Consume the `.' or `->' operator. */
7023 postfix_expression
7025 postfix_expression,
7032 /* postfix-expression ++ */
7033 /* Consume the `++' token. */
7035 /* Generate a representation for the complete expression. */
7036 postfix_expression
7038 POSTINCREMENT_EXPR);
7039 /* Increments may not appear in constant-expressions. */
7047 /* postfix-expression -- */
7048 /* Consume the `--' token. */
7050 /* Generate a representation for the complete expression. */
7051 postfix_expression
7053 POSTDECREMENT_EXPR);
7054 /* Decrements may not appear in constant-expressions. */
7065 return is_member_access
7066 ? postfix_expression
7068 else
7070 }
7071 }
7073 /* We should never get here. */
7076 }
7078 /* This function parses Cilk Plus array notations. If a normal array expr. is
7079 parsed then the array index is passed back to the caller through *INIT_INDEX
7080 and the function returns a NULL_TREE. If array notation expr. is parsed,
7081 then *INIT_INDEX is ignored by the caller and the function returns
7082 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7083 error_mark_node. */
7085 static tree
7087 tree array_value)
7088 {
7092 {
7095 }
7104 {
7107 }
7109 {
7110 /* Consume the ':'. */
7113 /* If we are here, then we have a case like this A[:]. */
7115 {
7119 }
7123 }
7124 else
7125 {
7126 /* If we are here, then there are three valid possibilities:
7127 1. ARRAY [ EXP ]
7128 2. ARRAY [ EXP : EXP ]
7129 3. ARRAY [ EXP : EXP : EXP ] */
7133 {
7134 /* This indicates that we have a normal array expression. */
7137 }
7139 /* Consume the ':'. */
7143 {
7146 }
7147 }
7152 {
7156 }
7162 }
7164 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7165 by cp_parser_builtin_offsetof. We're looking for
7167 postfix-expression [ expression ]
7168 postfix-expression [ braced-init-list ] (C++11)
7170 FOR_OFFSETOF is set if we're being called in that context, which
7171 changes how we deal with integer constant expressions. */
7173 static tree
7175 tree postfix_expression,
7178 {
7183 /* Consume the `[' token. */
7189 /* Parse the index expression. */
7190 /* ??? For offsetof, there is a question of what to allow here. If
7191 offsetof is not being used in an integral constant expression context,
7192 then we *could* get the right answer by computing the value at runtime.
7193 If we are in an integral constant expression context, then we might
7194 could accept any constant expression; hard to say without analysis.
7195 Rather than open the barn door too wide right away, allow only integer
7196 constant expressions here. */
7199 else
7200 {
7202 {
7209 {
7211 "braced list index is not allowed with array "
7215 }
7216 }
7218 {
7219 /* Here are have these two options:
7220 ARRAY[EXP : EXP] - Array notation expr with default
7221 stride of 1.
7222 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7223 stride. */
7225 postfix_expression);
7228 }
7229 else
7231 }
7235 /* Look for the closing `]'. */
7238 /* Build the ARRAY_REF. */
7242 /* When not doing offsetof, array references are not permitted in
7243 constant-expressions. */
7249 }
7251 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7252 by cp_parser_builtin_offsetof. We're looking for
7254 postfix-expression . template [opt] id-expression
7255 postfix-expression . pseudo-destructor-name
7256 postfix-expression -> template [opt] id-expression
7257 postfix-expression -> pseudo-destructor-name
7259 FOR_OFFSETOF is set if we're being called in that context. That sorta
7260 limits what of the above we'll actually accept, but nevermind.
7261 TOKEN_TYPE is the "." or "->" token, which will already have been
7262 removed from the stream. */
7264 static tree
7267 cp_expr postfix_expression,
7269 location_t location)
7270 {
7271 tree name;
7277 /* If this is a `->' operator, dereference the pointer. */
7280 tf_warning_or_error);
7281 /* Check to see whether or not the expression is type-dependent and
7282 not the current instantiation. */
7284 /* The identifier following the `->' or `.' is not qualified. */
7290 /* Enter the scope corresponding to the type of the object
7291 given by the POSTFIX_EXPRESSION. */
7293 {
7295 /* According to the standard, no expression should ever have
7296 reference type. Unfortunately, we do not currently match
7297 the standard in this respect in that our internal representation
7298 of an expression may have reference type even when the standard
7299 says it does not. Therefore, we have to manually obtain the
7300 underlying type here. */
7302 /* The type of the POSTFIX_EXPRESSION must be complete. */
7303 /* Unlike the object expression in other contexts, *this is not
7304 required to be of complete type for purposes of class member
7305 access (5.2.5) outside the member function body. */
7308 && !(processing_template_decl
7309 && current_class_type
7310 && (same_type_ignoring_top_level_qualifiers_p
7312 {
7315 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7317 {
7318 /* In a template, be permissive by treating an object expression
7319 of incomplete type as dependent (after a pedwarn). */
7320 diagnostic_t kind = (processing_template_decl
7321 ? DK_PEDWARN
7323 cxx_incomplete_type_diagnostic
7327 {
7330 }
7331 }
7332 }
7335 {
7336 /* Let the name lookup machinery know that we are processing a
7337 class member access expression. */
7339 /* If something went wrong, we want to be able to discern that case,
7340 as opposed to the case where there was no SCOPE due to the type
7341 of expression being dependent. */
7344 /* If the SCOPE was erroneous, make the various semantic analysis
7345 functions exit quickly -- and without issuing additional error
7346 messages. */
7349 }
7350 }
7353 /* Tell cp_parser_lookup_name that there was an object, even though it's
7354 type-dependent. */
7357 /* Assume this expression is not a pseudo-destructor access. */
7360 /* If the SCOPE is a scalar type, then, if this is a valid program,
7361 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7362 is type dependent, it can be pseudo-destructor-name or something else.
7363 Try to parse it as pseudo-destructor-name first. */
7365 {
7366 tree s;
7367 tree type;
7370 /* Parse the pseudo-destructor-name. */
7379 {
7381 postfix_expression
7384 }
7385 }
7388 {
7389 /* If the SCOPE is not a scalar type, we are looking at an
7390 ordinary class member access expression, rather than a
7391 pseudo-destructor-name. */
7394 /* Parse the id-expression. */
7395 name = (cp_parser_id_expression
7402 /* In general, build a SCOPE_REF if the member name is qualified.
7403 However, if the name was not dependent and has already been
7404 resolved; there is no need to build the SCOPE_REF. For example;
7406 struct X { void f(); };
7407 template <typename T> void f(T* t) { t->X::f(); }
7409 Even though "t" is dependent, "X::f" is not and has been resolved
7410 to a BASELINK; there is no need to include scope information. */
7412 /* But we do need to remember that there was an explicit scope for
7413 virtual function calls. */
7417 /* If the name is a template-id that names a type, we will get a
7418 TYPE_DECL here. That is invalid code. */
7420 {
7423 }
7424 else
7425 {
7427 {
7429 {
7433 }
7434 else
7437 name,
7438 template_p);
7442 }
7444 adjust_result_of_qualified_name_lookup
7446 postfix_expression
7448 template_p,
7449 tf_warning_or_error);
7450 /* Build a location e.g.:
7451 ptr->access_expr
7452 ~~~^~~~~~~~~~~~~
7453 where the caret is at the deref token, ranging from
7454 the start of postfix_expression to the end of the access expr. */
7455 location_t end_loc
7457 location_t combined_loc
7460 }
7461 }
7463 /* We no longer need to look up names in the scope of the object on
7464 the left-hand side of the `.' or `->' operator. */
7467 /* Outside of offsetof, these operators may not appear in
7468 constant-expressions. */
7470 && (cp_parser_non_integral_constant_expression
7475 }
7477 /* Parse a parenthesized expression-list.
7479 expression-list:
7480 assignment-expression
7481 expression-list, assignment-expression
7483 attribute-list:
7484 expression-list
7485 identifier
7486 identifier, expression-list
7488 CAST_P is true if this expression is the target of a cast.
7490 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7491 argument pack.
7493 Returns a vector of trees. Each element is a representation of an
7494 assignment-expression. NULL is returned if the ( and or ) are
7495 missing. An empty, but allocated, vector is returned on no
7496 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7497 if we are parsing an attribute list for an attribute that wants a
7498 plain identifier argument, normal_attr for an attribute that wants
7499 an expression, or non_attr if we aren't parsing an attribute list. If
7500 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7501 not all of the expressions in the list were constant.
7502 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7503 will be written to with the location of the closing parenthesis. If
7504 an error occurs, it may or may not be written to. */
7513 {
7519 /* Assume all the expressions will be constant. */
7528 /* Within a parenthesized expression, a `>' token is always
7529 the greater-than operator. */
7530 saved_greater_than_is_operator_p
7534 /* Consume expressions until there are no more. */
7537 {
7538 tree expr;
7540 /* At the beginning of attribute lists, check to see if the
7541 next token is an identifier. */
7544 {
7547 /* Consume the identifier. */
7549 /* Save the identifier. */
7551 }
7552 else
7553 {
7556 /* Parse the next assignment-expression. */
7558 {
7559 /* A braced-init-list. */
7565 }
7567 {
7568 expr = (cp_parser_constant_expression
7573 }
7574 else
7576 cast_p);
7581 /* If we have an ellipsis, then this is an expression
7582 expansion. */
7585 {
7586 /* Consume the `...'. */
7589 /* Build the argument pack. */
7591 }
7593 /* Add it to the list. We add error_mark_node
7594 expressions to the list, so that we can still tell if
7595 the correct form for a parenthesized expression-list
7596 is found. That gives better errors. */
7601 }
7603 /* After the first item, attribute lists look the same as
7604 expression lists. */
7607 get_comma:;
7608 /* If the next token isn't a `,', then we are done. */
7612 /* Otherwise, consume the `,' and keep going. */
7614 }
7620 {
7623 skip_comma:;
7624 /* We try and resync to an unnested comma, as that will give the
7625 user better diagnostics. */
7633 {
7634 parser->greater_than_is_operator_p
7637 }
7638 }
7640 parser->greater_than_is_operator_p
7647 }
7649 /* Parse a pseudo-destructor-name.
7651 pseudo-destructor-name:
7652 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7653 :: [opt] nested-name-specifier template template-id :: ~ type-name
7654 :: [opt] nested-name-specifier [opt] ~ type-name
7656 If either of the first two productions is used, sets *SCOPE to the
7657 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7658 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7659 or ERROR_MARK_NODE if the parse fails. */
7661 static void
7663 tree object,
7666 {
7669 /* Handle ~auto. */
7673 {
7676 "%<~auto%> only available with "
7683 }
7685 /* Assume that things will not work out. */
7688 /* Look for the optional `::' operator. */
7690 /* Look for the optional nested-name-specifier. */
7691 nested_name_specifier_p
7698 /* Now, if we saw a nested-name-specifier, we might be doing the
7699 second production. */
7702 {
7703 /* Consume the `template' keyword. */
7705 /* Parse the template-id. */
7709 class_type,
7711 /* Look for the `::' token. */
7713 }
7714 /* If the next token is not a `~', then there might be some
7715 additional qualification. */
7717 {
7718 /* At this point, we're looking for "type-name :: ~". The type-name
7719 must not be a class-name, since this is a pseudo-destructor. So,
7720 it must be either an enum-name, or a typedef-name -- both of which
7721 are just identifiers. So, we peek ahead to check that the "::"
7722 and "~" tokens are present; if they are not, then we can avoid
7723 calling type_name. */
7727 {
7730 }
7732 /* Look for the type-name. */
7737 /* Look for the `::' token. */
7739 }
7740 else
7743 /* Look for the `~'. */
7746 /* Once we see the ~, this has to be a pseudo-destructor. */
7750 /* Look for the type-name again. We are not responsible for
7751 checking that it matches the first type-name. */
7753 }
7755 /* Parse a unary-expression.
7757 unary-expression:
7758 postfix-expression
7759 ++ cast-expression
7760 -- cast-expression
7761 unary-operator cast-expression
7762 sizeof unary-expression
7763 sizeof ( type-id )
7764 alignof ( type-id ) [C++0x]
7765 new-expression
7766 delete-expression
7768 GNU Extensions:
7770 unary-expression:
7771 __extension__ cast-expression
7772 __alignof__ unary-expression
7773 __alignof__ ( type-id )
7774 alignof unary-expression [C++0x]
7775 __real__ cast-expression
7776 __imag__ cast-expression
7777 && identifier
7778 sizeof ( type-id ) { initializer-list , [opt] }
7779 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7780 __alignof__ ( type-id ) { initializer-list , [opt] }
7782 ADDRESS_P is true iff the unary-expression is appearing as the
7783 operand of the `&' operator. CAST_P is true if this expression is
7784 the target of a cast.
7786 Returns a representation of the expression. */
7788 static cp_expr
7791 {
7795 /* Peek at the next token. */
7797 /* Some keywords give away the kind of expression. */
7799 {
7803 {
7806 {
7812 /* Consume the token. */
7814 /* Parse the operand. */
7819 else
7820 {
7821 /* ISO C++ defines alignof only with types, not with
7822 expressions. So pedwarn if alignof is used with a non-
7823 type expression. However, __alignof__ is ok. */
7826 "ISO C++ does not allow %<alignof%> "
7830 }
7831 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7832 SIZEOF_EXPR with the original operand. */
7834 {
7836 {
7838 {
7841 error_mark_node));
7843 }
7844 else
7848 }
7849 }
7851 /* Construct a location e.g. :
7852 alignof (expr)
7853 ^~~~~~~~~~~~~~
7854 with start == caret at the start of the "alignof"/"sizeof"
7855 token, with the endpoint at the final closing paren. */
7856 location_t finish_loc
7858 location_t compound_loc
7864 }
7873 {
7874 /* The saved value of the PEDANTIC flag. */
7876 tree expr;
7878 /* Save away the PEDANTIC flag. */
7880 /* Parse the cast-expression. */
7882 /* Restore the PEDANTIC flag. */
7886 }
7890 {
7891 tree expression;
7893 /* Consume the `__real__' or `__imag__' token. */
7895 /* Parse the cast-expression. */
7897 /* Create the complete representation. */
7901 expression,
7902 tf_warning_or_error);
7903 }
7911 {
7912 tree expr;
7922 parser->type_definition_forbidden_message
7925 saved_integral_constant_expression_p
7927 saved_non_integral_constant_expression_p
7931 saved_greater_than_is_operator_p
7943 parser->greater_than_is_operator_p
7946 parser->integral_constant_expression_p
7948 parser->non_integral_constant_expression_p
7955 }
7959 }
7960 }
7962 /* Look for the `:: new' and `:: delete', which also signal the
7963 beginning of a new-expression, or delete-expression,
7964 respectively. If the next token is `::', then it might be one of
7965 these. */
7967 {
7970 /* See if the token after the `::' is one of the keywords in
7971 which we're interested. */
7973 /* If it's `new', we have a new-expression. */
7976 /* Similarly, for `delete'. */
7979 }
7981 /* Look for a unary operator. */
7983 /* The `++' and `--' operators can be handled similarly, even though
7984 they are not technically unary-operators in the grammar. */
7986 {
7991 /* Handle the GNU address-of-label extension. */
7994 {
7995 tree identifier;
7996 tree expression;
7999 /* Consume the '&&' token. */
8001 /* Look for the identifier. */
8002 location_t finish_loc
8005 /* Construct a location of the form:
8006 &&label
8007 ^~~~~~~
8008 with caret==start at the "&&", finish at the end of the label. */
8009 location_t combined_loc
8011 /* Create an expression representing the address. */
8014 NIC_ADDR_LABEL))
8017 }
8018 }
8020 {
8021 cp_expr cast_expression;
8027 /* Consume the operator token. */
8031 /* Parse the cast-expression. */
8032 cast_expression
8037 pidk);
8039 /* Make a location:
8040 OP_TOKEN CAST_EXPRESSION
8041 ^~~~~~~~~~~~~~~~~~~~~~~~~
8042 with start==caret at the operator token, and
8043 extending to the end of the cast_expression. */
8046 /* Now, build an appropriate representation. */
8048 {
8052 RO_UNARY_STAR,
8053 complain);
8054 /* TODO: build_x_indirect_ref does not always honor the
8055 location, so ensure it is set. */
8061 /* Fall through. */
8064 cast_expression,
8065 complain);
8066 /* TODO: build_x_unary_op does not always honor the location,
8067 so ensure it is set. */
8075 /* Fall through. */
8077 /* Immediately fold negation of a constant, unless the constant is 0
8078 (since -0 == 0) or it would overflow. */
8083 {
8086 cast_expression);
8088 {
8091 }
8092 }
8093 /* Fall through. */
8102 }
8106 non_constant_p))
8110 }
8114 decltype_p,
8115 pidk);
8116 }
8118 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8119 unary-operator, the corresponding tree code is returned. */
8121 static enum tree_code
8123 {
8125 {
8146 }
8147 }
8149 /* Parse a new-expression.
8151 new-expression:
8152 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8153 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8155 Returns a representation of the expression. */
8157 static tree
8159 {
8162 tree type;
8165 tree ret;
8169 /* Look for the optional `::' operator. */
8170 global_scope_p
8174 /* Look for the `new' operator. */
8176 /* There's no easy way to tell a new-placement from the
8177 `( type-id )' construct. */
8179 /* Look for a new-placement. */
8181 /* If that didn't work out, there's no new-placement. */
8183 {
8187 }
8189 /* If the next token is a `(', then we have a parenthesized
8190 type-id. */
8192 {
8196 /* Consume the `('. */
8199 /* Parse the type-id. */
8200 parser->type_definition_forbidden_message
8202 {
8205 }
8208 /* Look for the closing `)'. */
8211 /* There should not be a direct-new-declarator in this production,
8212 but GCC used to allowed this, so we check and emit a sensible error
8213 message for this case. */
8215 {
8221 }
8222 }
8223 /* Otherwise, there must be a new-type-id. */
8224 else
8227 /* If the next token is a `(' or '{', then we have a new-initializer. */
8232 else
8235 /* A new-expression may not appear in an integral constant
8236 expression. */
8239 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8240 of a new-type-id or type-id of a new-expression, the new-expression shall
8241 contain a new-initializer of the form ( assignment-expression )".
8242 Additionally, consistently with the spirit of DR 1467, we want to accept
8243 'new auto { 2 }' too. */
8249 {
8251 "initialization of new-expression for type %<auto%> "
8254 }
8255 else
8256 {
8257 /* Construct a location e.g.:
8258 ptr = new int[100]
8259 ^~~~~~~~~~~~
8260 with caret == start at the start of the "new" token, and the end
8261 at the end of the final token we consumed. */
8266 /* Create a representation of the new-expression. */
8268 tf_warning_or_error);
8270 }
8278 }
8280 /* Parse a new-placement.
8282 new-placement:
8283 ( expression-list )
8285 Returns the same representation as for an expression-list. */
8289 {
8292 /* Parse the expression-list. */
8293 expression_list = (cp_parser_parenthesized_expression_list
8302 }
8304 /* Parse a new-type-id.
8306 new-type-id:
8307 type-specifier-seq new-declarator [opt]
8309 Returns the TYPE allocated. If the new-type-id indicates an array
8310 type, *NELTS is set to the number of elements in the last array
8311 bound; the TYPE will not include the last array bound. */
8313 static tree
8315 {
8316 cp_decl_specifier_seq type_specifier_seq;
8322 /* The type-specifier sequence must not contain type definitions.
8323 (It cannot contain declarations of new types either, but if they
8324 are not definitions we will catch that because they are not
8325 complete.) */
8327 parser->type_definition_forbidden_message
8329 /* Parse the type-specifier-seq. */
8333 /* Restore the old message. */
8339 /* Parse the new-declarator. */
8342 /* Determine the number of elements in the last array dimension, if
8343 any. */
8345 /* Skip down to the last array dimension. */
8350 {
8353 }
8358 {
8361 }
8364 {
8371 else
8373 }
8376 }
8378 /* Parse an (optional) new-declarator.
8380 new-declarator:
8381 ptr-operator new-declarator [opt]
8382 direct-new-declarator
8384 Returns the declarator. */
8388 {
8391 cp_cv_quals cv_quals;
8393 /* We don't know if there's a ptr-operator next, or not. */
8395 /* Look for a ptr-operator. */
8397 /* If that worked, look for more new-declarators. */
8399 {
8402 /* Parse another optional declarator. */
8405 declarator = cp_parser_make_indirect_declarator
8409 }
8411 /* If the next token is a `[', there is a direct-new-declarator. */
8416 }
8418 /* Parse a direct-new-declarator.
8420 direct-new-declarator:
8421 [ expression ]
8422 direct-new-declarator [constant-expression]
8424 */
8428 {
8432 {
8433 tree expression;
8436 /* Look for the opening `['. */
8441 /* The standard requires that the expression have integral
8442 type. DR 74 adds enumeration types. We believe that the
8443 real intent is that these expressions be handled like the
8444 expression in a `switch' condition, which also allows
8445 classes with a single conversion to integral or
8446 enumeration type. */
8448 {
8449 expression
8451 expression,
8454 {
8456 "expression in new-declarator must have integral "
8459 }
8460 }
8462 /* Look for the closing `]'. */
8465 /* Add this bound to the declarator. */
8468 /* If the next token is not a `[', then there are no more
8469 bounds. */
8472 }
8475 }
8477 /* Parse a new-initializer.
8479 new-initializer:
8480 ( expression-list [opt] )
8481 braced-init-list
8483 Returns a representation of the expression-list. */
8487 {
8491 {
8492 tree t;
8499 }
8500 else
8501 expression_list = (cp_parser_parenthesized_expression_list
8507 }
8509 /* Parse a delete-expression.
8511 delete-expression:
8512 :: [opt] delete cast-expression
8513 :: [opt] delete [ ] cast-expression
8515 Returns a representation of the expression. */
8517 static tree
8519 {
8522 tree expression;
8524 /* Look for the optional `::' operator. */
8525 global_scope_p
8529 /* Look for the `delete' keyword. */
8531 /* See if the array syntax is in use. */
8533 {
8534 /* Consume the `[' token. */
8536 /* Look for the `]' token. */
8538 /* Remember that this is the `[]' construct. */
8540 }
8541 else
8544 /* Parse the cast-expression. */
8547 /* A delete-expression may not appear in an integral constant
8548 expression. */
8553 tf_warning_or_error);
8554 }
8556 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8557 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8558 0 otherwise. */
8560 static int
8562 {
8565 {
8607 /* In ((type ()) () the last () isn't a valid cast-expression,
8608 so the whole must be parsed as postfix-expression. */
8613 /* '[' may start a primary-expression in obj-c++ and in C++11,
8614 as a lambda-expression, eg, '(void)[]{}'. */
8621 /* '++' and '--' may or may not start a cast-expression:
8623 struct T { void operator++(int); };
8624 void f() { (T())++; }
8626 vs
8628 int a;
8629 (int)++a; */
8634 }
8635 }
8637 /* Parse a cast-expression.
8639 cast-expression:
8640 unary-expression
8641 ( type-id ) cast-expression
8643 ADDRESS_P is true iff the unary-expression is appearing as the
8644 operand of the `&' operator. CAST_P is true if this expression is
8645 the target of a cast.
8647 Returns a representation of the expression. */
8649 static cp_expr
8652 {
8653 /* If it's a `(', then we might be looking at a cast. */
8655 {
8661 /* There's no way to know yet whether or not this is a cast.
8662 For example, `(int (3))' is a unary-expression, while `(int)
8663 3' is a cast. So, we resort to parsing tentatively. */
8665 /* Types may not be defined in a cast. */
8667 parser->type_definition_forbidden_message
8669 /* Consume the `('. */
8673 /* A very tricky bit is that `(struct S) { 3 }' is a
8674 compound-literal (which we permit in C++ as an extension).
8675 But, that construct is not a cast-expression -- it is a
8676 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8677 is legal; if the compound-literal were a cast-expression,
8678 you'd need an extra set of parentheses.) But, if we parse
8679 the type-id, and it happens to be a class-specifier, then we
8680 will commit to the parse at that point, because we cannot
8681 undo the action that is done when creating a new class. So,
8682 then we cannot back up and do a postfix-expression.
8684 Another tricky case is the following (c++/29234):
8686 struct S { void operator () (); };
8688 void foo ()
8689 {
8690 ( S()() );
8691 }
8693 As a type-id we parse the parenthesized S()() as a function
8694 returning a function, groktypename complains and we cannot
8695 back up in this case either.
8697 Therefore, we scan ahead to the closing `)', and check to see
8698 if the tokens after the `)' can start a cast-expression. Otherwise
8699 we are dealing with an unary-expression, a postfix-expression
8700 or something else.
8702 Yet another tricky case, in C++11, is the following (c++/54891):
8704 (void)[]{};
8706 The issue is that usually, besides the case of lambda-expressions,
8707 the parenthesized type-id cannot be followed by '[', and, eg, we
8708 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8709 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8710 we don't commit, we try a cast-expression, then an unary-expression.
8712 Save tokens so that we can put them back. */
8715 /* We may be looking at a cast-expression. */
8718 cast_expression
8721 /* Roll back the tokens we skipped. */
8723 /* If we aren't looking at a cast-expression, simulate an error so
8724 that the call to cp_parser_error_occurred below returns true. */
8727 else
8728 {
8731 /* Look for the type-id. */
8733 /* Look for the closing `)'. */
8736 }
8738 /* Restore the saved message. */
8741 /* At this point this can only be either a cast or a
8742 parenthesized ctor such as `(T ())' that looks like a cast to
8743 function returning T. */
8745 {
8746 /* Only commit if the cast-expression doesn't start with
8747 '++', '--', or '[' in C++11. */
8755 pidk);
8758 {
8759 /* Warn about old-style casts, if so requested. */
8767 /* Only type conversions to integral or enumeration types
8768 can be used in constant-expressions. */
8771 NIC_CAST))
8774 /* Perform the cast. */
8775 /* Make a location:
8776 (TYPE) EXPR
8777 ^~~~~~~~~~~
8778 with start==caret at the open paren, extending to the
8779 end of "expr". */
8781 open_paren_loc,
8785 }
8786 }
8787 else
8789 }
8791 /* If we get here, then it's not a cast, so it must be a
8792 unary-expression. */
8795 }
8797 /* Parse a binary expression of the general form:
8799 pm-expression:
8800 cast-expression
8801 pm-expression .* cast-expression
8802 pm-expression ->* cast-expression
8804 multiplicative-expression:
8805 pm-expression
8806 multiplicative-expression * pm-expression
8807 multiplicative-expression / pm-expression
8808 multiplicative-expression % pm-expression
8810 additive-expression:
8811 multiplicative-expression
8812 additive-expression + multiplicative-expression
8813 additive-expression - multiplicative-expression
8815 shift-expression:
8816 additive-expression
8817 shift-expression << additive-expression
8818 shift-expression >> additive-expression
8820 relational-expression:
8821 shift-expression
8822 relational-expression < shift-expression
8823 relational-expression > shift-expression
8824 relational-expression <= shift-expression
8825 relational-expression >= shift-expression
8827 GNU Extension:
8829 relational-expression:
8830 relational-expression <? shift-expression
8831 relational-expression >? shift-expression
8833 equality-expression:
8834 relational-expression
8835 equality-expression == relational-expression
8836 equality-expression != relational-expression
8838 and-expression:
8839 equality-expression
8840 and-expression & equality-expression
8842 exclusive-or-expression:
8843 and-expression
8844 exclusive-or-expression ^ and-expression
8846 inclusive-or-expression:
8847 exclusive-or-expression
8848 inclusive-or-expression | exclusive-or-expression
8850 logical-and-expression:
8851 inclusive-or-expression
8852 logical-and-expression && inclusive-or-expression
8854 logical-or-expression:
8855 logical-and-expression
8856 logical-or-expression || logical-and-expression
8858 All these are implemented with a single function like:
8860 binary-expression:
8861 simple-cast-expression
8862 binary-expression <token> binary-expression
8864 CAST_P is true if this expression is the target of a cast.
8866 The binops_by_token map is used to get the tree codes for each <token> type.
8867 binary-expressions are associated according to a precedence table. */
8869 #define TOKEN_PRECEDENCE(token) \
8870 (((token->type == CPP_GREATER \
8871 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8872 && !parser->greater_than_is_operator_p) \
8873 ? PREC_NOT_OPERATOR \
8874 : binops_by_token[token->type].prec)
8876 static cp_expr
8882 {
8883 cp_parser_expression_stack stack;
8885 cp_parser_expression_stack_entry current;
8886 cp_expr rhs;
8890 tree overload;
8892 /* Parse the first expression. */
8903 {
8904 /* Get an operator token. */
8910 {
8912 "%<>>%> operator is treated"
8916 }
8921 /* This is a fold-expression; handle it later. */
8924 /* Popping an entry off the stack means we completed a subexpression:
8925 - either we found a token which is not an operator (`>' where it is not
8926 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8927 will happen repeatedly;
8928 - or, we found an operator which has lower priority. This is the case
8929 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8930 parsing `3 * 4'. */
8932 {
8935 else
8937 }
8939 get_rhs:
8943 /* We used the operator token. */
8946 /* For "false && x" or "true || x", x will never be executed;
8947 disable warnings while evaluating it. */
8949 c_inhibit_evaluation_warnings +=
8952 c_inhibit_evaluation_warnings +=
8955 /* Extract another operand. It may be the RHS of this expression
8956 or the LHS of a new, higher priority expression. */
8961 /* Get another operator token. Look up its precedence to avoid
8962 building a useless (immediately popped) stack entry for common
8963 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8970 {
8971 /* ... and prepare to parse the RHS of the new, higher priority
8972 expression. Since precedence levels on the stack are
8973 monotonically increasing, we do not have to care about
8974 stack overflows. */
8983 pop:
8985 /* If the stack is not empty, we have parsed into LHS the right side
8986 (`4' in the example above) of an expression we had suspended.
8987 We can use the information on the stack to recover the LHS (`3')
8988 from the stack together with the tree code (`MULT_EXPR'), and
8989 the precedence of the higher level subexpression
8990 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8991 which will be used to actually build the additive expression. */
8996 }
8998 /* Undo the disabling of warnings done above. */
9000 c_inhibit_evaluation_warnings -=
9003 c_inhibit_evaluation_warnings -=
9009 /* Avoid warning for !!x == y. */
9014 /* Avoid warning for !b == y where b is boolean. */
9018 /* Avoid warning for !!b == y where b is boolean. */
9031 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9032 ERROR_MARK for everything that is not a binary expression.
9033 This makes warn_about_parentheses miss some warnings that
9034 involve unary operators. For unary expressions we should
9035 pass the correct tree_code unless the unary expression was
9036 surrounded by parentheses.
9037 */
9044 == tcc_comparison
9047 else
9048 {
9053 /* TODO: build_x_binary_op doesn't always honor the location. */
9055 }
9058 /* If the binary operator required the use of an overloaded operator,
9059 then this expression cannot be an integral constant-expression.
9060 An overloaded operator can be used even if both operands are
9061 otherwise permissible in an integral constant-expression if at
9062 least one of the operands is of enumeration type. */
9066 NIC_OVERLOADED))
9068 }
9071 }
9073 static cp_expr
9078 {
9081 }
9083 /* Parse the `? expression : assignment-expression' part of a
9084 conditional-expression. The LOGICAL_OR_EXPR is the
9085 logical-or-expression that started the conditional-expression.
9086 Returns a representation of the entire conditional-expression.
9088 This routine is used by cp_parser_assignment_expression.
9090 ? expression : assignment-expression
9092 GNU Extensions:
9094 ? : assignment-expression */
9096 static tree
9098 {
9100 cp_expr assignment_expr;
9104 /* Consume the `?' token. */
9109 {
9112 /* Implicit true clause. */
9114 c_inhibit_evaluation_warnings +=
9117 }
9118 else
9119 {
9122 /* Parse the expression. */
9123 c_inhibit_evaluation_warnings +=
9126 c_inhibit_evaluation_warnings +=
9130 }
9132 /* The next token should be a `:'. */
9134 /* Parse the assignment-expression. */
9136 c_inhibit_evaluation_warnings -=
9139 /* Make a location:
9140 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9141 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9142 with the caret at the "?", ranging from the start of
9143 the logical_or_expr to the end of the assignment_expr. */
9148 /* Build the conditional-expression. */
9150 expr,
9151 assignment_expr,
9152 tf_warning_or_error);
9153 }
9155 /* Parse an assignment-expression.
9157 assignment-expression:
9158 conditional-expression
9159 logical-or-expression assignment-operator assignment_expression
9160 throw-expression
9162 CAST_P is true if this expression is the target of a cast.
9163 DECLTYPE_P is true if this expression is the operand of decltype.
9165 Returns a representation for the expression. */
9167 static cp_expr
9170 {
9171 cp_expr expr;
9173 /* If the next token is the `throw' keyword, then we're looking at
9174 a throw-expression. */
9177 /* Otherwise, it must be that we are looking at a
9178 logical-or-expression. */
9179 else
9180 {
9181 /* Parse the binary expressions (logical-or-expression). */
9183 decltype_p,
9185 /* If the next token is a `?' then we're actually looking at a
9186 conditional-expression. */
9189 else
9190 {
9193 /* If it's an assignment-operator, we're using the second
9194 production. */
9195 enum tree_code assignment_operator
9198 {
9201 /* Parse the right-hand side of the assignment. */
9208 /* An assignment may not appear in a
9209 constant-expression. */
9211 NIC_ASSIGNMENT))
9213 /* Build the assignment expression. Its default
9214 location:
9215 LHS = RHS
9216 ~~~~^~~~~
9217 is the location of the '=' token as the
9218 caret, ranging from the start of the lhs to the
9219 end of the rhs. */
9224 assignment_operator,
9225 rhs,
9227 /* TODO: build_x_modify_expr doesn't honor the location,
9228 so we must set it here. */
9230 }
9231 }
9232 }
9235 }
9237 /* Parse an (optional) assignment-operator.
9239 assignment-operator: one of
9240 = *= /= %= += -= >>= <<= &= ^= |=
9242 GNU Extension:
9244 assignment-operator: one of
9245 <?= >?=
9247 If the next token is an assignment operator, the corresponding tree
9248 code is returned, and the token is consumed. For example, for
9249 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9250 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9251 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9252 operator, ERROR_MARK is returned. */
9254 static enum tree_code
9256 {
9260 /* Peek at the next token. */
9264 {
9310 /* Nothing else is an assignment operator. */
9312 }
9314 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9319 /* If it was an assignment operator, consume it. */
9324 }
9326 /* Parse an expression.
9328 expression:
9329 assignment-expression
9330 expression , assignment-expression
9332 CAST_P is true if this expression is the target of a cast.
9333 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9334 except possibly parenthesized or on the RHS of a comma (N3276).
9336 Returns a representation of the expression. */
9338 static cp_expr
9341 {
9346 {
9347 cp_expr assignment_expression;
9349 /* Parse the next assignment-expression. */
9350 assignment_expression
9353 /* We don't create a temporary for a call that is the immediate operand
9354 of decltype or on the RHS of a comma. But when we see a comma, we
9355 need to create a temporary for a call on the LHS. */
9360 assignment_expression
9364 /* If this is the first assignment-expression, we can just
9365 save it away. */
9368 else
9369 {
9370 /* Create a location with caret at the comma, ranging
9371 from the start of the LHS to the end of the RHS. */
9376 assignment_expression,
9379 }
9380 /* If the next token is not a comma, or we're in a fold-expression, then
9381 we are done with the expression. */
9385 /* Consume the `,'. */
9388 /* A comma operator cannot appear in a constant-expression. */
9391 }
9394 }
9396 /* Parse a constant-expression.
9398 constant-expression:
9399 conditional-expression
9401 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9402 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9403 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9404 is false, NON_CONSTANT_P should be NULL. */
9406 static cp_expr
9410 {
9414 cp_expr expression;
9416 /* It might seem that we could simply parse the
9417 conditional-expression, and then check to see if it were
9418 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9419 one that the compiler can figure out is constant, possibly after
9420 doing some simplifications or optimizations. The standard has a
9421 precise definition of constant-expression, and we must honor
9422 that, even though it is somewhat more restrictive.
9424 For example:
9426 int i[(2, 3)];
9428 is not a legal declaration, because `(2, 3)' is not a
9429 constant-expression. The `,' operator is forbidden in a
9430 constant-expression. However, GCC's constant-folding machinery
9431 will fold this operation to an INTEGER_CST for `3'. */
9433 /* Save the old settings. */
9435 saved_allow_non_integral_constant_expression_p
9438 /* We are now parsing a constant-expression. */
9440 parser->allow_non_integral_constant_expression_p
9443 /* Although the grammar says "conditional-expression", we parse an
9444 "assignment-expression", which also permits "throw-expression"
9445 and the use of assignment operators. In the case that
9446 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9447 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9448 actually essential that we look for an assignment-expression.
9449 For example, cp_parser_initializer_clauses uses this function to
9450 determine whether a particular assignment-expression is in fact
9451 constant. */
9453 /* Restore the old settings. */
9454 parser->integral_constant_expression_p
9456 parser->allow_non_integral_constant_expression_p
9459 {
9460 /* Require an rvalue constant expression here; that's what our
9461 callers expect. Reference constant expressions are handled
9462 separately in e.g. cp_parser_template_argument. */
9467 }
9470 parser->non_integral_constant_expression_p
9474 }
9476 /* Parse __builtin_offsetof.
9478 offsetof-expression:
9479 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9481 offsetof-member-designator:
9482 id-expression
9483 | offsetof-member-designator "." id-expression
9484 | offsetof-member-designator "[" expression "]"
9485 | offsetof-member-designator "->" id-expression */
9487 static cp_expr
9489 {
9491 tree type;
9492 cp_expr expr;
9493 cp_id_kind dummy;
9495 location_t finish_loc;
9497 /* We're about to accept non-integral-constant things, but will
9498 definitely yield an integral constant expression. Save and
9499 restore these values around our local parsing. */
9505 /* Consume the "__builtin_offsetof" token. */
9507 /* Consume the opening `('. */
9509 /* Parse the type-id. */
9512 /* Look for the `,'. */
9516 /* Build the (type *)null that begins the traditional offsetof macro. */
9517 tree object_ptr
9519 tf_warning_or_error);
9521 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9525 {
9528 {
9530 /* offsetof-member-designator "[" expression "]" */
9536 /* offsetof-member-designator "->" identifier */
9539 /* FALLTHRU */
9542 /* offsetof-member-designator "." identifier */
9550 /* Consume the ")" token. */
9556 /* Error. We know the following require will fail, but
9557 that gives the proper error message. */
9562 }
9563 }
9565 success:
9566 /* Make a location of the form:
9567 __builtin_offsetof (struct s, f)
9568 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9569 with caret at the type-id, ranging from the start of the
9570 "_builtin_offsetof" token to the close paren. */
9572 /* The result will be an INTEGER_CST, so we need to explicitly
9573 preserve the location. */
9576 failure:
9581 }
9583 /* Parse a trait expression.
9585 Returns a representation of the expression, the underlying type
9586 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9588 static tree
9590 {
9591 cp_trait_kind kind;
9597 {
9691 }
9693 /* Consume the token. */
9698 {
9701 }
9707 {
9710 {
9713 }
9717 }
9719 {
9721 {
9725 {
9728 }
9732 }
9733 }
9737 /* Complete the trait expression, which may mean either processing
9738 the trait expr now or saving it for template instantiation. */
9740 {
9749 }
9750 }
9752 /* Lambdas that appear in variable initializer or default argument scope
9753 get that in their mangling, so we need to record it. We might as well
9754 use the count for function and namespace scopes as well. */
9758 {
9759 tree t;
9761 };
9764 static void
9766 {
9767 tree_int ti;
9769 /* Once we're inside a function, we ignore other scopes and just push
9770 the function again so that popping works properly. */
9777 {
9778 /* Don't reset the count if we're still in the same function. */
9781 }
9782 }
9784 static void
9786 {
9789 }
9791 static void
9793 {
9796 {
9799 }
9801 }
9803 /* Parse a lambda expression.
9805 lambda-expression:
9806 lambda-introducer lambda-declarator [opt] compound-statement
9808 Returns a representation of the expression. */
9810 static cp_expr
9812 {
9814 tree type;
9822 {
9824 {
9828 }
9830 }
9832 {
9834 {
9837 }
9839 }
9841 /* We may be in the middle of deferred access check. Disable
9842 it now. */
9853 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9856 /* Now that we've started the type, add the capture fields for any
9857 explicit captures. */
9860 {
9861 /* Inside the class, surrounding template-parameter-lists do not apply. */
9862 unsigned int saved_num_template_parameter_lists
9866 bool fully_implicit_function_template_p
9870 bool auto_is_implicit_function_template_parm_p
9881 /* By virtue of defining a local class, a lambda expression has access to
9882 the private variables of enclosing classes. */
9890 {
9895 }
9897 {
9900 }
9902 /* The capture list was built up in reverse order; fix that now. */
9914 parser->fully_implicit_function_template_p
9918 parser->auto_is_implicit_function_template_parm_p
9920 }
9922 /* This field is only used during parsing of the lambda. */
9925 /* This lambda shouldn't have any proxies left at this point. */
9927 /* And now that we're done, push proxies for an enclosing lambda. */
9932 else
9940 }
9942 /* Parse the beginning of a lambda expression.
9944 lambda-introducer:
9945 [ lambda-capture [opt] ]
9947 LAMBDA_EXPR is the current representation of the lambda expression. */
9949 static void
9951 {
9952 /* Need commas after the first capture. */
9955 /* Eat the leading `['. */
9958 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9966 {
9969 }
9972 {
9974 tree capture_id;
9975 tree capture_init_expr;
9979 enum capture_kind_type
9980 {
9981 BY_COPY,
9982 BY_REFERENCE
9983 };
9987 {
9990 }
9994 else
9997 /* Possibly capture `this'. */
9999 {
10009 explicit_init_p);
10011 }
10013 /* Possibly capture `*this'. */
10016 {
10027 explicit_init_p);
10029 }
10031 /* Remember whether we want to capture as a reference or not. */
10033 {
10036 }
10038 /* Get the identifier. */
10043 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10044 delimiters, but I modified this to stop on unnested ']' as well. It
10045 was already changed to stop on unnested '}', so the
10046 "closing_parenthesis" name is no more misleading with my change. */
10047 {
10053 }
10055 /* Find the initializer for this capture. */
10059 {
10061 /* An explicit initializer exists. */
10064 "lambda capture initializers "
10070 {
10073 }
10074 }
10075 else
10076 {
10079 /* Turn the identifier into an id-expression. */
10080 capture_init_expr
10085 {
10088 }
10092 {
10095 capture_init_expr);
10099 }
10102 {
10105 capture_init_expr))
10109 }
10111 capture_init_expr
10112 = finish_id_expression
10114 capture_init_expr,
10128 {
10131 }
10132 else
10134 }
10138 {
10143 capture_id);
10147 "capture of %qD redundant with by-reference capture "
10149 }
10152 capture_id,
10153 capture_init_expr,
10155 explicit_init_p);
10156 }
10159 }
10161 /* Parse the (optional) middle of a lambda expression.
10163 lambda-declarator:
10164 < template-parameter-list [opt] >
10165 ( parameter-declaration-clause [opt] )
10166 attribute-specifier [opt]
10167 decl-specifier-seq [opt]
10168 exception-specification [opt]
10169 lambda-return-type-clause [opt]
10171 LAMBDA_EXPR is the current representation of the lambda expression. */
10173 static bool
10175 {
10176 /* 5.1.1.4 of the standard says:
10177 If a lambda-expression does not include a lambda-declarator, it is as if
10178 the lambda-declarator were ().
10179 This means an empty parameter list, no attributes, and no exception
10180 specification. */
10186 cp_decl_specifier_seq lambda_specs;
10189 /* The template-parameter-list is optional, but must begin with
10190 an opening angle if present. */
10192 {
10195 "lambda templates are only available with "
10197 else
10207 /* We just processed one more parameter list. */
10209 }
10211 /* The parameter-declaration-clause is optional (unless
10212 template-parameter-list was given), but must begin with an
10213 opening parenthesis if present. */
10215 {
10220 /* Parse parameters. */
10223 /* Default arguments shall not be specified in the
10224 parameter-declaration-clause of a lambda-declarator. */
10235 /* In the decl-specifier-seq of the lambda-declarator, each
10236 decl-specifier shall either be mutable or constexpr. */
10240 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10243 {
10248 }
10252 /* Parse optional exception specification. */
10255 /* Parse optional trailing return type. */
10257 {
10261 }
10263 /* The function parameters must be in scope all the way until after the
10264 trailing-return-type in case of decltype. */
10266 }
10270 /* Create the function call operator.
10272 Messing with declarators like this is no uglier than building up the
10273 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10274 other code. */
10275 {
10276 cp_decl_specifier_seq return_type_specs;
10278 tree fco;
10285 else
10286 /* Maybe we will deduce the return type later. */
10290 {
10294 else
10297 }
10302 sfk_none);
10307 VIRT_SPEC_UNSPECIFIED,
10308 REF_QUAL_NONE,
10309 tx_qual,
10310 exception_spec,
10316 declarator,
10317 attributes);
10319 {
10322 /* Give the object parameter a different name. */
10326 }
10328 {
10332 }
10341 }
10342 }
10344 /* Parse the body of a lambda expression, which is simply
10346 compound-statement
10348 but which requires special handling.
10349 LAMBDA_EXPR is the current representation of the lambda expression. */
10351 static void
10353 {
10358 else
10359 /* Still increment function_depth so that we don't GC in the
10360 middle of an expression. */
10364 /* Clear this in case we're in the middle of a default argument. */
10367 /* Finish the function call operator
10368 - class_specifier
10369 + late_parsing_for_member
10370 + function_definition_after_declarator
10371 + ctor_initializer_opt_and_function_body */
10372 {
10374 tree body;
10376 tree compound_stmt;
10377 tree cap;
10379 /* Let the front end know that we are going to be defining this
10380 function. */
10382 NULL_TREE,
10391 /* Push the proxies for any explicit captures. */
10398 /* 5.1.1.4 of the standard says:
10399 If a lambda-expression does not include a trailing-return-type, it
10400 is as if the trailing-return-type denotes the following type:
10401 * if the compound-statement is of the form
10402 { return attribute-specifier [opt] expression ; }
10403 the type of the returned expression after lvalue-to-rvalue
10404 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10405 (_conv.array_ 4.2), and function-to-pointer conversion
10406 (_conv.func_ 4.3);
10407 * otherwise, void. */
10409 /* In a lambda that has neither a lambda-return-type-clause
10410 nor a deducible form, errors should be reported for return statements
10411 in the body. Since we used void as the placeholder return type, parsing
10412 the body as usual will give such desired behavior. */
10416 {
10420 /* Parse tentatively in case there's more after the initial return
10421 statement. */
10432 {
10434 {
10439 }
10441 /* Will get error here if type not deduced yet. */
10445 }
10446 }
10449 {
10454 }
10458 out:
10462 /* Finish the function and generate code for it if necessary. */
10465 /* Only expand if the call op is not a template. */
10468 }
10474 else
10476 }
10478 /* Statements [gram.stmt.stmt] */
10480 /* Parse a statement.
10482 statement:
10483 labeled-statement
10484 expression-statement
10485 compound-statement
10486 selection-statement
10487 iteration-statement
10488 jump-statement
10489 declaration-statement
10490 try-block
10492 C++11:
10494 statement:
10495 labeled-statement
10496 attribute-specifier-seq (opt) expression-statement
10497 attribute-specifier-seq (opt) compound-statement
10498 attribute-specifier-seq (opt) selection-statement
10499 attribute-specifier-seq (opt) iteration-statement
10500 attribute-specifier-seq (opt) jump-statement
10501 declaration-statement
10502 attribute-specifier-seq (opt) try-block
10504 init-statement:
10505 expression-statement
10506 simple-declaration
10508 TM Extension:
10510 statement:
10511 atomic-statement
10513 IN_COMPOUND is true when the statement is nested inside a
10514 cp_parser_compound_statement; this matters for certain pragmas.
10516 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10517 is a (possibly labeled) if statement which is not enclosed in braces
10518 and has an else clause. This is used to implement -Wparentheses.
10520 CHAIN is a vector of if-else-if conditions. */
10522 static void
10525 {
10530 restart:
10533 /* There is no statement yet. */
10539 /* In obj-c++, seeing '[[' might be the either the beginning of
10540 c++11 attributes, or a nested objc-message-expression. So
10541 let's parse the c++11 attributes tentatively. */
10545 {
10548 }
10550 /* Peek at the next token. */
10552 /* Remember the location of the first token in the statement. */
10554 /* If this is a keyword, then that will often determine what kind of
10555 statement we have. */
10557 {
10561 {
10564 /* Looks like a labeled-statement with a case label.
10565 Parse the label, and then use tail recursion to parse
10566 the statement. */
10584 {
10589 }
10590 else
10604 {
10609 }
10610 else
10611 {
10615 }
10619 /* Objective-C++ exception-handling constructs. */
10633 /* This must be a namespace alias definition. */
10649 /* It might be a keyword like `int' that can start a
10650 declaration-statement. */
10652 }
10653 }
10655 {
10656 /* If the next token is a `:', then we are looking at a
10657 labeled-statement. */
10660 {
10661 /* Looks like a labeled-statement with an ordinary label.
10662 Parse the label, and then use tail recursion to parse
10663 the statement. */
10668 }
10669 }
10670 /* Anything that starts with a `{' must be a compound-statement. */
10673 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10674 a statement all its own. */
10676 {
10677 /* Only certain OpenMP pragmas are attached to statements, and thus
10678 are considered statements themselves. All others are not. In
10679 the context of a compound, accept the pragma as a "statement" and
10680 return so that we can check for a close brace. Otherwise we
10681 require a real statement and must go back and read one. */
10687 }
10689 {
10692 }
10694 /* Everything else must be a declaration-statement or an
10695 expression-statement. Try for the declaration-statement
10696 first, unless we are looking at a `;', in which case we know that
10697 we have an expression-statement. */
10699 {
10701 {
10703 {
10704 /* Attributes should be parsed as part of the the
10705 declaration, so let's un-parse them. */
10708 }
10711 /* Try to parse the declaration-statement. */
10713 /* If that worked, we're done. */
10716 }
10717 /* Look for an expression-statement instead. */
10720 /* Handle [[fallthrough]];. */
10722 {
10723 /* The next token after the fallthrough attribute is ';'. */
10725 {
10726 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10728 IFN_FALLTHROUGH,
10731 }
10732 else
10736 }
10737 }
10739 /* Set the line number for the statement. */
10743 /* Allow "[[fallthrough]];", but warn otherwise. */
10746 OPT_Wattributes,
10748 }
10750 /* Parse the label for a labeled-statement, i.e.
10752 identifier :
10753 case constant-expression :
10754 default :
10756 GNU Extension:
10757 case constant-expression ... constant-expression : statement
10759 When a label is parsed without errors, the label is added to the
10760 parse tree by the finish_* functions, so this function doesn't
10761 have to return the label. */
10763 static void
10765 {
10770 /* The next token should be an identifier. */
10774 {
10777 }
10779 /* Remember whether this case or a user-defined label is allowed to fall
10780 through to. */
10785 {
10787 {
10791 /* Consume the `case' token. */
10793 /* Parse the constant-expression. */
10800 {
10801 /* Consume the `...' token. */
10807 /* We don't need to emit warnings here, as the common code
10808 will do this for us. */
10809 }
10810 else
10814 {
10818 }
10819 else
10822 expr);
10823 }
10827 /* Consume the `default' token. */
10831 {
10835 }
10836 else
10841 /* Anything else must be an ordinary label. */
10846 }
10848 /* Require the `:' token. */
10851 /* An ordinary label may optionally be followed by attributes.
10852 However, this is only permitted if the attributes are then
10853 followed by a semicolon. This is because, for backward
10854 compatibility, when parsing
10855 lab: __attribute__ ((unused)) int i;
10856 we want the attribute to attach to "i", not "lab". */
10859 {
10860 tree attrs;
10867 ;
10868 else
10870 }
10876 }
10878 /* Parse an expression-statement.
10880 expression-statement:
10881 expression [opt] ;
10883 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10884 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10885 indicates whether this expression-statement is part of an
10886 expression statement. */
10888 static tree
10890 {
10895 /* There might be attribute fallthrough. */
10898 /* If the next token is a ';', then there is no expression
10899 statement. */
10901 {
10905 {
10908 }
10909 }
10911 /* Handle [[fallthrough]];. */
10913 {
10914 /* The next token after the fallthrough attribute is ';'. */
10916 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10919 else
10923 }
10925 /* Allow "[[fallthrough]];", but warn otherwise. */
10930 /* Give a helpful message for "A<T>::type t;" and the like. */
10933 {
10940 {
10941 /* A::A a; */
10946 }
10947 }
10949 /* Consume the final `;'. */
10954 /* This is the final expression statement of a statement
10955 expression. */
10961 }
10963 /* Parse a compound-statement.
10965 compound-statement:
10966 { statement-seq [opt] }
10968 GNU extension:
10970 compound-statement:
10971 { label-declaration-seq [opt] statement-seq [opt] }
10973 label-declaration-seq:
10974 label-declaration
10975 label-declaration-seq label-declaration
10977 Returns a tree representing the statement. */
10979 static tree
10982 {
10983 tree compound_stmt;
10985 /* Consume the `{'. */
10992 /* Begin the compound-statement. */
10994 /* If the next keyword is `__label__' we have a label declaration. */
10997 /* Parse an (optional) statement-seq. */
10999 /* Finish the compound-statement. */
11001 /* Consume the `}'. */
11005 }
11007 /* Parse an (optional) statement-seq.
11009 statement-seq:
11010 statement
11011 statement-seq [opt] statement */
11013 static void
11015 {
11016 /* Scan statements until there aren't any more. */
11018 {
11021 /* If we are looking at a `}', then we have run out of
11022 statements; the same is true if we have reached the end
11023 of file, or have stumbled upon a stray '@end'. */
11030 /* If we are in a compound statement and find 'else' then
11031 something went wrong. */
11033 {
11036 else
11037 {
11040 }
11041 }
11043 /* Parse the statement. */
11045 }
11046 }
11048 /* Return true if we're looking at (init; cond), false otherwise. */
11050 static bool
11052 {
11053 /* Save tokens so that we can put them back. */
11056 /* Look for ';' that is not nested in () or {}. */
11059 CPP_SEMICOLON,
11062 /* Roll back the tokens we skipped. */
11066 }
11068 /* Parse a selection-statement.
11070 selection-statement:
11071 if ( init-statement [opt] condition ) statement
11072 if ( init-statement [opt] condition ) statement else statement
11073 switch ( init-statement [opt] condition ) statement
11075 Returns the new IF_STMT or SWITCH_STMT.
11077 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11078 is a (possibly labeled) if statement which is not enclosed in
11079 braces and has an else clause. This is used to implement
11080 -Wparentheses.
11082 CHAIN is a vector of if-else-if conditions. This is used to implement
11083 -Wduplicated-cond. */
11085 static tree
11088 {
11091 token_indent_info guard_tinfo;
11096 /* Peek at the next token. */
11100 /* See what kind of keyword it is. */
11103 {
11106 {
11107 tree statement;
11108 tree condition;
11113 RID_CONSTEXPR))
11114 {
11120 }
11122 /* Look for the `('. */
11124 {
11127 }
11129 /* Begin the selection-statement. */
11131 {
11134 }
11135 else
11138 /* Parse the optional init-statement. */
11140 {
11141 tree decl;
11144 "init-statement in selection statements only available "
11147 }
11149 /* Parse the condition. */
11151 /* Look for the `)'. */
11157 {
11161 /* Add the condition. */
11168 /* Parse the then-clause. */
11172 /* Outside a template, the non-selected branch of a constexpr
11173 if is a 'discarded statement', i.e. unevaluated. */
11178 {
11181 }
11184 guard_tinfo);
11191 {
11195 }
11197 /* If the next token is `else', parse the else-clause. */
11199 RID_ELSE))
11200 {
11204 {
11207 }
11209 guard_tinfo
11211 /* Consume the `else' keyword. */
11214 {
11216 RID_IF)
11218 {
11219 /* We've got "if (COND) else if (COND2)". Start
11220 the condition chain and add COND as the first
11221 element. */
11225 {
11226 /* Wrap it in a NOP_EXPR so that we can set the
11227 location of the condition. */
11229 condition);
11232 }
11233 }
11235 RID_IF))
11236 {
11237 /* This is if-else without subsequent if. Zap the
11238 condition chain; we would have already warned at
11239 this point. */
11242 }
11243 }
11245 /* Parse the else-clause. */
11251 /* If we are currently parsing a then-clause, then
11252 IF_P will not be NULL. We set it to true to
11253 indicate that this if statement has an else clause.
11254 This may trigger the Wparentheses warning below
11255 when we get back up to the parent if statement. */
11260 {
11264 }
11265 }
11266 else
11267 {
11268 /* This if statement does not have an else clause. If
11269 NESTED_IF is true, then the then-clause has an if
11270 statement which does have an else clause. We warn
11271 about the potential ambiguity. */
11274 "suggest explicit braces to avoid ambiguous"
11277 {
11278 /* We don't need the condition chain anymore. */
11281 }
11282 }
11284 /* Now we're all done with the if-statement. */
11286 }
11287 else
11288 {
11292 /* Add the condition. */
11295 /* Parse the body of the switch-statement. */
11301 guard_tinfo);
11305 /* Now we're all done with the switch-statement. */
11307 }
11310 }
11316 }
11317 }
11319 /* Parse a condition.
11321 condition:
11322 expression
11323 type-specifier-seq declarator = initializer-clause
11324 type-specifier-seq declarator braced-init-list
11326 GNU Extension:
11328 condition:
11329 type-specifier-seq declarator asm-specification [opt]
11330 attributes [opt] = assignment-expression
11332 Returns the expression that should be tested. */
11334 static tree
11336 {
11337 cp_decl_specifier_seq type_specifiers;
11341 /* Try the declaration first. */
11343 /* New types are not allowed in the type-specifier-seq for a
11344 condition. */
11346 parser->type_definition_forbidden_message
11348 /* Parse the type-specifier-seq. */
11350 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11353 /* Restore the saved message. */
11355 /* If all is well, we might be looking at a declaration. */
11357 {
11358 tree decl;
11359 tree asm_specification;
11360 tree attributes;
11364 /* Parse the declarator. */
11370 /* Parse the attributes. */
11372 /* Parse the asm-specification. */
11374 /* If the next token is not an `=' or '{', then we might still be
11375 looking at an expression. For example:
11377 if (A(a).x)
11379 looks like a decl-specifier-seq and a declarator -- but then
11380 there is no `=', so this is an expression. */
11385 /* If we did see an `=' or '{', then we are looking at a declaration
11386 for sure. */
11388 {
11389 tree pushed_scope;
11393 /* Create the declaration. */
11399 /* Parse the initializer. */
11401 {
11405 }
11406 else
11407 {
11408 /* Consume the `='. */
11411 }
11415 /* Process the initializer. */
11418 asm_specification,
11419 flags);
11425 }
11426 }
11427 /* If we didn't even get past the declarator successfully, we are
11428 definitely not looking at a declaration. */
11429 else
11432 /* Otherwise, we are looking at an expression. */
11434 }
11436 /* Parses a for-statement or range-for-statement until the closing ')',
11437 not included. */
11439 static tree
11441 {
11445 /* Begin the for-statement. */
11448 /* Parse the initialization. */
11453 else
11455 }
11457 static tree
11459 {
11460 /* Normal for loop */
11463 tree stmt;
11466 /* The init-statement has already been parsed in
11467 cp_parser_init_statement, so no work is needed here. */
11470 /* If there's a condition, process it. */
11474 {
11478 }
11480 /* Look for the `;'. */
11483 /* If there's an expression, process it. */
11489 }
11491 /* Tries to parse a range-based for-statement:
11493 range-based-for:
11494 decl-specifier-seq declarator : expression
11496 The decl-specifier-seq declarator and the `:' are already parsed by
11497 cp_parser_init_statement. If processing_template_decl it returns a
11498 newly created RANGE_FOR_STMT; if not, it is converted to a
11499 regular FOR_STMT. */
11501 static tree
11504 {
11511 /* Get the range declaration momentarily out of the way so that
11512 the range expression doesn't clash with it. */
11514 {
11516 {
11518 /* For decomposition declaration get all of the corresponding
11519 declarations out of the way. */
11523 {
11529 {
11535 }
11536 }
11537 }
11539 {
11544 }
11545 }
11548 {
11551 }
11552 else
11555 /* Put the range declaration(s) back into scope. */
11557 {
11561 }
11563 /* If in template, STMT is converted to a normal for-statement
11564 at instantiation. If not, it is done just ahead. */
11566 {
11574 /* do_auto_deduction doesn't mess with template init-lists. */
11577 }
11578 else
11579 {
11583 }
11585 }
11587 /* Subroutine of cp_convert_range_for: given the initializer expression,
11588 builds up the range temporary. */
11590 static tree
11592 {
11595 /* Find out the type deduced by the declaration
11596 `auto &&__range = range_expr'. */
11601 /* Create the __range variable. */
11608 }
11610 /* Used by cp_parser_range_for in template context: we aren't going to
11611 do a full conversion yet, but we still need to resolve auto in the
11612 type of the for-range-declaration if present. This is basically
11613 a shortcut version of cp_convert_range_for. */
11615 static void
11617 {
11620 {
11623 iter_type = (cp_parser_perform_range_for_lookup
11626 {
11628 iter_type);
11630 tf_warning_or_error);
11633 }
11634 }
11635 }
11637 /* Converts a range-based for-statement into a normal
11638 for-statement, as per the definition.
11640 for (RANGE_DECL : RANGE_EXPR)
11641 BLOCK
11643 should be equivalent to:
11645 {
11646 auto &&__range = RANGE_EXPR;
11647 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11648 __begin != __end;
11649 ++__begin)
11650 {
11651 RANGE_DECL = *__begin;
11652 BLOCK
11653 }
11654 }
11656 If RANGE_EXPR is an array:
11657 BEGIN_EXPR = __range
11658 END_EXPR = __range + ARRAY_SIZE(__range)
11659 Else if RANGE_EXPR has a member 'begin' or 'end':
11660 BEGIN_EXPR = __range.begin()
11661 END_EXPR = __range.end()
11662 Else:
11663 BEGIN_EXPR = begin(__range)
11664 END_EXPR = end(__range);
11666 If __range has a member 'begin' but not 'end', or vice versa, we must
11667 still use the second alternative (it will surely fail, however).
11668 When calling begin()/end() in the third alternative we must use
11669 argument dependent lookup, but always considering 'std' as an associated
11670 namespace. */
11672 tree
11676 {
11682 /* If an error happened previously do nothing or else a lot of
11683 unhelpful errors would be issued. */
11685 else
11686 {
11687 tree range_temp;
11691 /* Can't bind a reference to an array of runtime bound. */
11693 else
11694 {
11699 LOOKUP_ONLYCONVERTING);
11701 }
11704 }
11706 /* The new for initialization statement. */
11714 LOOKUP_ONLYCONVERTING);
11725 LOOKUP_ONLYCONVERTING);
11729 /* The new for condition. */
11736 /* The new increment expression. */
11739 tf_warning_or_error);
11742 /* The declaration is initialized with *__begin inside the loop body. */
11745 tf_warning_or_error),
11747 LOOKUP_ONLYCONVERTING);
11752 }
11754 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11755 We need to solve both at the same time because the method used
11756 depends on the existence of members begin or end.
11757 Returns the type deduced for the iterator expression. */
11759 static tree
11761 {
11763 {
11766 }
11769 {
11774 }
11776 {
11777 /* If RANGE is an array, we will use pointer arithmetic. */
11780 range,
11784 }
11785 else
11786 {
11787 /* If it is not an array, we must do a bit of magic. */
11797 tf_warning_or_error);
11800 tf_warning_or_error);
11803 {
11804 /* Use the member functions. */
11807 else
11813 else
11816 }
11817 else
11818 {
11819 /* Use global functions with ADL. */
11826 tf_warning_or_error);
11828 tf_warning_or_error);
11830 tf_warning_or_error);
11832 tf_warning_or_error);
11835 }
11837 /* Last common checks. */
11839 {
11840 /* If one of the expressions is an error do no more checks. */
11843 }
11846 /* Can happen, when, eg, in a template context, Koenig lookup
11847 can't resolve begin/end (c++/58503). */
11849 else
11850 {
11852 /* The unqualified type of the __begin and __end temporaries should
11853 be the same, as required by the multiple auto declaration. */
11855 {
11862 /* P0184R0 allows __begin and __end to have different types,
11863 but make sure they are comparable so we can give a better
11865 else
11869 }
11871 }
11872 }
11873 }
11875 /* Helper function for cp_parser_perform_range_for_lookup.
11876 Builds a tree for RANGE.IDENTIFIER(). */
11878 static tree
11880 {
11893 tf_warning_or_error);
11896 }
11898 /* Parse an iteration-statement.
11900 iteration-statement:
11901 while ( condition ) statement
11902 do statement while ( expression ) ;
11903 for ( init-statement condition [opt] ; expression [opt] )
11904 statement
11906 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11908 static tree
11910 {
11913 tree statement;
11915 token_indent_info guard_tinfo;
11917 /* Peek at the next token. */
11924 /* Remember whether or not we are already within an iteration
11925 statement. */
11928 /* See what kind of keyword it is. */
11931 {
11933 {
11934 tree condition;
11936 /* Begin the while-statement. */
11938 /* Look for the `('. */
11940 /* Parse the condition. */
11943 /* Look for the `)'. */
11945 /* Parse the dependent statement. */
11949 /* We're done with the while-statement. */
11951 }
11955 {
11956 tree expression;
11958 /* Begin the do-statement. */
11960 /* Parse the body of the do-statement. */
11965 /* Look for the `while' keyword. */
11967 /* Look for the `('. */
11969 /* Parse the expression. */
11971 /* We're done with the do-statement. */
11973 /* Look for the `)'. */
11975 /* Look for the `;'. */
11977 }
11981 {
11982 /* Look for the `('. */
11987 /* Look for the `)'. */
11990 /* Parse the body of the for-statement. */
11995 /* We're done with the for-statement. */
11997 }
12004 }
12007 }
12009 /* Parse a init-statement or the declarator of a range-based-for.
12010 Returns true if a range-based-for declaration is seen.
12012 init-statement:
12013 expression-statement
12014 simple-declaration */
12016 static bool
12018 {
12019 /* If the next token is a `;', then we have an empty
12020 expression-statement. Grammatically, this is also a
12021 simple-declaration, but an invalid one, because it does not
12022 declare anything. Therefore, if we did not handle this case
12023 specially, we would issue an error message about an invalid
12024 declaration. */
12026 {
12030 /* A colon is used in range-based for. */
12033 /* We're going to speculatively look for a declaration, falling back
12034 to an expression, if necessary. */
12036 /* Parse the declaration. */
12039 decl);
12042 {
12043 /* It is a range-for, consume the ':' */
12047 {
12049 "range-based %<for%> loops only available with "
12052 }
12053 }
12054 else
12055 /* The ';' is not consumed yet because we told
12056 cp_parser_simple_declaration not to. */
12061 /* If the tentative parse failed, then we shall need to look for an
12062 expression-statement. */
12063 }
12064 /* If we are here, it is an expression-statement. */
12067 }
12069 /* Parse a jump-statement.
12071 jump-statement:
12072 break ;
12073 continue ;
12074 return expression [opt] ;
12075 return braced-init-list ;
12076 goto identifier ;
12078 GNU extension:
12080 jump-statement:
12081 goto * expression ;
12083 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12085 static tree
12087 {
12093 /* Peek at the next token. */
12098 /* See what kind of keyword it is. */
12101 {
12105 {
12125 }
12131 {
12138 /* Fall through. */
12148 }
12153 {
12154 tree expr;
12158 {
12162 }
12165 else
12166 /* If the next token is a `;', then there is no
12167 expression. */
12169 /* Build the return-statement. */
12172 else
12174 /* Look for the final `;'. */
12176 }
12182 {
12185 }
12187 /* Create the goto-statement. */
12189 {
12190 /* Issue a warning about this use of a GNU extension. */
12192 /* Consume the '*' token. */
12194 /* Parse the dependent expression. */
12196 }
12197 else
12199 /* Look for the final `;'. */
12206 }
12209 }
12211 /* Parse a declaration-statement.
12213 declaration-statement:
12214 block-declaration */
12216 static void
12218 {
12221 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12224 /* Parse the block-declaration. */
12227 /* Free any declarators allocated. */
12229 }
12231 /* Some dependent statements (like `if (cond) statement'), are
12232 implicitly in their own scope. In other words, if the statement is
12233 a single statement (as opposed to a compound-statement), it is
12234 none-the-less treated as if it were enclosed in braces. Any
12235 declarations appearing in the dependent statement are out of scope
12236 after control passes that point. This function parses a statement,
12237 but ensures that is in its own scope, even if it is not a
12238 compound-statement.
12240 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12241 is a (possibly labeled) if statement which is not enclosed in
12242 braces and has an else clause. This is used to implement
12243 -Wparentheses.
12245 CHAIN is a vector of if-else-if conditions. This is used to implement
12246 -Wduplicated-cond.
12248 Returns the new statement. */
12250 static tree
12254 {
12255 tree statement;
12257 token_indent_info body_tinfo
12263 /* Mark if () ; with a special NOP_EXPR. */
12265 {
12276 }
12277 /* if a compound is opened, we simply parse the statement directly. */
12280 /* If the token is not a `{', then we must take special action. */
12281 else
12282 {
12283 /* Create a compound-statement. */
12285 /* Parse the dependent-statement. */
12287 /* Finish the dummy compound-statement. */
12289 }
12291 token_indent_info next_tinfo
12295 /* Return the statement. */
12297 }
12299 /* For some dependent statements (like `while (cond) statement'), we
12300 have already created a scope. Therefore, even if the dependent
12301 statement is a compound-statement, we do not want to create another
12302 scope. */
12304 static void
12307 {
12308 /* If the token is a `{', then we must take special action. */
12310 {
12311 token_indent_info body_tinfo
12315 token_indent_info next_tinfo
12318 }
12319 else
12320 {
12321 /* Avoid calling cp_parser_compound_statement, so that we
12322 don't create a new scope. Do everything else by hand. */
12324 /* If the next keyword is `__label__' we have a label declaration. */
12327 /* Parse an (optional) statement-seq. */
12330 }
12331 }
12333 /* Declarations [gram.dcl.dcl] */
12335 /* Parse an optional declaration-sequence.
12337 declaration-seq:
12338 declaration
12339 declaration-seq declaration */
12341 static void
12343 {
12345 {
12356 {
12357 /* A declaration consisting of a single semicolon is
12358 invalid. Allow it unless we're being pedantic. */
12363 }
12365 /* If we're entering or exiting a region that's implicitly
12366 extern "C", modify the lang context appropriately. */
12368 {
12371 }
12373 {
12376 }
12379 {
12380 /* A top-level declaration can consist solely of a #pragma.
12381 A nested declaration cannot, so this is done here and not
12382 in cp_parser_declaration. (A #pragma at block scope is
12383 handled in cp_parser_statement.) */
12386 }
12388 /* Parse the declaration itself. */
12390 }
12391 }
12393 /* Parse a declaration.
12395 declaration:
12396 block-declaration
12397 function-definition
12398 template-declaration
12399 explicit-instantiation
12400 explicit-specialization
12401 linkage-specification
12402 namespace-definition
12404 C++17:
12405 deduction-guide
12407 GNU extension:
12409 declaration:
12410 __extension__ declaration */
12412 static void
12414 {
12415 cp_token token1;
12416 cp_token token2;
12421 /* Check for the `__extension__' keyword. */
12423 {
12424 /* Parse the qualified declaration. */
12426 /* Restore the PEDANTIC flag. */
12430 }
12432 /* Try to figure out what kind of declaration is present. */
12437 else
12438 {
12441 }
12443 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12446 /* If the next token is `extern' and the following token is a string
12447 literal, then we have a linkage specification. */
12451 /* If the next token is `template', then we have either a template
12452 declaration, an explicit instantiation, or an explicit
12453 specialization. */
12455 {
12456 /* `template <>' indicates a template specialization. */
12460 /* `template <' indicates a template declaration. */
12463 /* Anything else must be an explicit instantiation. */
12464 else
12466 }
12467 /* If the next token is `export', then we have a template
12468 declaration. */
12471 /* If the next token is `extern', 'static' or 'inline' and the one
12472 after that is `template', we have a GNU extended explicit
12473 instantiation directive. */
12480 /* If the next token is `namespace', check for a named or unnamed
12481 namespace definition. */
12490 /* An unnamed namespace definition. */
12494 /* An inline (associated) namespace definition. */
12498 /* Objective-C++ declaration/definition. */
12505 /* At this point we may have a template declared by a concept
12506 introduction. */
12511 else
12512 /* Try to parse a block-declaration, or a function-definition. */
12515 /* Free any declarators allocated. */
12517 }
12519 /* Parse a block-declaration.
12521 block-declaration:
12522 simple-declaration
12523 asm-definition
12524 namespace-alias-definition
12525 using-declaration
12526 using-directive
12528 GNU Extension:
12530 block-declaration:
12531 __extension__ block-declaration
12533 C++0x Extension:
12535 block-declaration:
12536 static_assert-declaration
12538 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12539 part of a declaration-statement. */
12541 static void
12544 {
12548 /* Check for the `__extension__' keyword. */
12550 {
12551 /* Parse the qualified declaration. */
12553 /* Restore the PEDANTIC flag. */
12557 }
12559 /* Peek at the next token to figure out which kind of declaration is
12560 present. */
12563 /* If the next keyword is `asm', we have an asm-definition. */
12565 {
12569 }
12570 /* If the next keyword is `namespace', we have a
12571 namespace-alias-definition. */
12574 /* If the next keyword is `using', we have a
12575 using-declaration, a using-directive, or an alias-declaration. */
12577 {
12582 /* If the token after `using' is `namespace', then we have a
12583 using-directive. */
12587 /* If the second token after 'using' is '=', then we have an
12588 alias-declaration. */
12594 /* Otherwise, it's a using-declaration. */
12595 else
12598 }
12599 /* If the next keyword is `__label__' we have a misplaced label
12600 declaration. */
12602 {
12606 /* If the next token is now a `;', consume it. */
12609 }
12610 /* If the next token is `static_assert' we have a static assertion. */
12613 /* Anything else must be a simple-declaration. */
12614 else
12617 }
12619 /* Parse a simple-declaration.
12621 simple-declaration:
12622 decl-specifier-seq [opt] init-declarator-list [opt] ;
12623 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12624 brace-or-equal-initializer ;
12626 init-declarator-list:
12627 init-declarator
12628 init-declarator-list , init-declarator
12630 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12631 function-definition as a simple-declaration.
12633 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12634 parsed declaration if it is an uninitialized single declarator not followed
12635 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12636 if present, will not be consumed. */
12638 static void
12642 {
12643 cp_decl_specifier_seq decl_specifiers;
12652 /* Defer access checks until we know what is being declared; the
12653 checks for names appearing in the decl-specifier-seq should be
12654 done as if we were in the scope of the thing being declared. */
12657 /* Parse the decl-specifier-seq. We have to keep track of whether
12658 or not the decl-specifier-seq declares a named class or
12659 enumeration type, since that is the only case in which the
12660 init-declarator-list is allowed to be empty.
12662 [dcl.dcl]
12664 In a simple-declaration, the optional init-declarator-list can be
12665 omitted only when declaring a class or enumeration, that is when
12666 the decl-specifier-seq contains either a class-specifier, an
12667 elaborated-type-specifier, or an enum-specifier. */
12669 CP_PARSER_FLAGS_OPTIONAL,
12672 /* We no longer need to defer access checks. */
12675 /* In a block scope, a valid declaration must always have a
12676 decl-specifier-seq. By not trying to parse declarators, we can
12677 resolve the declaration/expression ambiguity more quickly. */
12680 {
12683 }
12685 /* If the next two tokens are both identifiers, the code is
12686 erroneous. The usual cause of this situation is code like:
12688 T t;
12690 where "T" should name a type -- but does not. */
12693 {
12694 /* If parsing tentatively, we should commit; we really are
12695 looking at a declaration. */
12697 /* Give up. */
12699 }
12701 /* If we have seen at least one decl-specifier, and the next token
12702 is not a parenthesis, then we must be looking at a declaration.
12703 (After "int (" we might be looking at a functional cast.) */
12710 /* Look for C++17 decomposition declaration. */
12718 {
12719 tree decl
12721 maybe_range_for_decl,
12724 /* The next token should be either a `,' or a `;'. */
12726 /* If it's a `;', we are done. */
12729 /* Anything else is an error. */
12730 else
12731 {
12732 /* If we have already issued an error message we don't need
12733 to issue another one. */
12738 /* Skip tokens until we reach the end of the statement. */
12740 /* If the next token is now a `;', consume it. */
12744 }
12745 }
12746 else
12749 tree last_type;
12751 /* NULL_TREE if both variable and function declaration are allowed,
12752 error_mark_node if function declaration are not allowed and
12753 a FUNCTION_DECL that should be diagnosed if it is followed by
12754 variable declarations. */
12755 tree auto_function_declaration;
12758 auto_specifier_p
12762 /* Keep going until we hit the `;' at the end of the simple
12763 declaration. */
12766 CPP_SEMICOLON))
12767 {
12770 tree decl;
12774 {
12775 /* If we are processing next declarator, comma is expected */
12780 {
12784 }
12785 }
12786 else
12789 /* Parse the init-declarator. */
12792 function_definition_allowed_p,
12794 declares_class_or_enum,
12796 maybe_range_for_decl,
12799 /* If an error occurred while parsing tentatively, exit quickly.
12800 (That usually happens when in the body of a function; each
12801 statement is treated as a declaration-statement until proven
12802 otherwise.) */
12807 {
12808 /* If the init-declarator-list contains more than one
12809 init-declarator, they shall all form declarations of
12810 variables. */
12812 auto_function_declaration
12816 {
12818 "non-variable %qD in declaration with more than one "
12823 }
12824 }
12828 {
12832 {
12833 /* If the list of declarators contains more than one declarator,
12834 the type of each declared variable is determined as described
12835 above. If the type deduced for the template parameter U is not
12836 the same in each deduction, the program is ill-formed. */
12841 }
12842 else
12844 }
12846 /* Handle function definitions specially. */
12848 {
12849 /* If the next token is a `,', then we are probably
12850 processing something like:
12852 void f() {}, *p;
12854 which is erroneous. */
12856 {
12859 "mixing"
12861 }
12862 /* Otherwise, we're done with the list of declarators. */
12863 else
12864 {
12867 }
12868 }
12871 /* The next token should be either a `,' or a `;'. */
12873 /* If it's a `,', there are more declarators to come. */
12876 /* If it's a `;', we are done. */
12880 {
12885 }
12886 /* Anything else is an error. */
12887 else
12888 {
12889 /* If we have already issued an error message we don't need
12890 to issue another one. */
12895 /* Skip tokens until we reach the end of the statement. */
12897 /* If the next token is now a `;', consume it. */
12901 }
12902 /* After the first time around, a function-definition is not
12903 allowed -- even if it was OK at first. For example:
12905 int i, f() {}
12907 is not valid. */
12909 }
12911 /* Issue an error message if no declarators are present, and the
12912 decl-specifier-seq does not itself declare a class or
12913 enumeration: [dcl.dcl]/3. */
12915 {
12917 {
12921 /* Ensure an error is issued anyway when finish_decltype_type,
12922 called via cp_parser_decl_specifier_seq, returns a class or
12923 an enumeration (c++/51786). */
12926 }
12927 /* Perform any deferred access checks. */
12929 }
12931 /* Consume the `;'. */
12932 finish:
12936 {
12942 }
12944 done:
12946 }
12948 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
12949 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12950 initializer ; */
12952 static tree
12957 {
12962 /* Parse the identifier-list. */
12966 {
12974 }
12978 {
12984 else
12985 {
12988 }
12989 }
12995 tree pushed_scope;
13002 NULL_TREE);
13009 cp_expr e;
13010 cp_decl_specifier_seq decl_specs;
13015 {
13018 else
13021 tree elt_pushed_scope;
13027 {
13028 /* Ensure we've diagnosed redeclaration if we aren't creating
13029 a new VAR_DECL. */
13032 }
13033 else
13037 }
13040 {
13043 }
13047 {
13054 {
13058 }
13059 }
13061 {
13063 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13064 the underlying DECL. */
13066 }
13072 {
13075 }
13078 }
13080 /* Parse a decl-specifier-seq.
13082 decl-specifier-seq:
13083 decl-specifier-seq [opt] decl-specifier
13084 decl-specifier attribute-specifier-seq [opt] (C++11)
13086 decl-specifier:
13087 storage-class-specifier
13088 type-specifier
13089 function-specifier
13090 friend
13091 typedef
13093 GNU Extension:
13095 decl-specifier:
13096 attributes
13098 Concepts Extension:
13100 decl-specifier:
13101 concept
13103 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13105 The parser flags FLAGS is used to control type-specifier parsing.
13107 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13108 flags:
13110 1: one of the decl-specifiers is an elaborated-type-specifier
13111 (i.e., a type declaration)
13112 2: one of the decl-specifiers is an enum-specifier or a
13113 class-specifier (i.e., a type definition)
13115 */
13117 static void
13119 cp_parser_flags flags,
13122 {
13126 cp_decl_spec ds;
13128 /* Clear DECL_SPECS. */
13131 /* Assume no class or enumeration type is declared. */
13134 /* Keep reading specifiers until there are no more to read. */
13136 {
13141 /* Peek at the next token. */
13144 /* Save the first token of the decl spec list for error
13145 reporting. */
13148 /* Handle attributes. */
13150 {
13151 /* Parse the attributes. */
13154 /* In a sequence of declaration specifiers, c++11 attributes
13155 appertain to the type that precede them. In that case
13156 [dcl.spec]/1 says:
13158 The attribute-specifier-seq affects the type only for
13159 the declaration it appears in, not other declarations
13160 involving the same type.
13162 But for now let's force the user to position the
13163 attribute either at the beginning of the declaration or
13164 after the declarator-id, which would clearly mean that it
13165 applies to the declarator. */
13167 {
13169 /* The c++11 attribute is at the beginning of the
13170 declaration. It appertains to the entity being
13172 else
13173 {
13175 {
13176 /* This is an attribute following a
13177 class-specifier. */
13182 }
13183 else
13184 {
13185 decl_specs->std_attributes
13187 attrs);
13190 }
13192 }
13193 }
13195 decl_specs->attributes
13197 attrs);
13201 }
13202 /* Assume we will find a decl-specifier keyword. */
13204 /* If the next token is an appropriate keyword, we can simply
13205 add it to the list. */
13207 {
13208 /* decl-specifier:
13209 friend
13210 constexpr */
13213 {
13216 }
13217 else
13218 {
13220 /* Consume the token. */
13222 }
13235 /* function-specifier:
13236 inline
13237 virtual
13238 explicit */
13245 /* decl-specifier:
13246 typedef */
13249 /* Consume the token. */
13251 /* A constructor declarator cannot appear in a typedef. */
13253 /* The "typedef" keyword can only occur in a declaration; we
13254 may as well commit at this point. */
13261 /* storage-class-specifier:
13262 auto
13263 register
13264 static
13265 extern
13266 mutable
13268 GNU Extension:
13269 thread */
13272 {
13273 /* Consume the token. */
13276 /* Complain about `auto' as a storage specifier, if
13277 we're complaining about C++0x compatibility. */
13281 /* Set the storage class anyway. */
13283 token);
13284 }
13285 else
13286 /* C++0x auto type-specifier. */
13294 /* Consume the token. */
13297 token);
13300 /* Consume the token. */
13306 /* We did not yet find a decl-specifier yet. */
13309 }
13326 /* Constructors are a special case. The `S' in `S()' is not a
13327 decl-specifier; it is the beginning of the declarator. */
13328 constructor_p
13329 = (!found_decl_spec
13330 && constructor_possible_p
13331 && (cp_parser_constructor_declarator_p
13334 /* If we don't have a DECL_SPEC yet, then we must be looking at
13335 a type-specifier. */
13337 {
13340 tree type_spec;
13342 type_spec
13344 decl_specs,
13350 /* If this type-specifier referenced a user-defined type
13351 (a typedef, class-name, etc.), then we can't allow any
13352 more such type-specifiers henceforth.
13354 [dcl.spec]
13356 The longest sequence of decl-specifiers that could
13357 possibly be a type name is taken as the
13358 decl-specifier-seq of a declaration. The sequence shall
13359 be self-consistent as described below.
13361 [dcl.type]
13363 As a general rule, at most one type-specifier is allowed
13364 in the complete decl-specifier-seq of a declaration. The
13365 only exceptions are the following:
13367 -- const or volatile can be combined with any other
13368 type-specifier.
13370 -- signed or unsigned can be combined with char, long,
13371 short, or int.
13373 -- ..
13375 Example:
13377 typedef char* Pc;
13378 void g (const int Pc);
13380 Here, Pc is *not* part of the decl-specifier seq; it's
13381 the declarator. Therefore, once we see a type-specifier
13382 (other than a cv-qualifier), we forbid any additional
13383 user-defined types. We *do* still allow things like `int
13384 int' to be considered a decl-specifier-seq, and issue the
13385 error message later. */
13388 /* A constructor declarator cannot follow a type-specifier. */
13390 {
13395 }
13396 }
13398 /* If we still do not have a DECL_SPEC, then there are no more
13399 decl-specifiers. */
13404 /* After we see one decl-specifier, further decl-specifiers are
13405 always optional. */
13407 }
13409 /* Don't allow a friend specifier with a class definition. */
13414 }
13416 /* Parse an (optional) storage-class-specifier.
13418 storage-class-specifier:
13419 auto
13420 register
13421 static
13422 extern
13423 mutable
13425 GNU Extension:
13427 storage-class-specifier:
13428 thread
13430 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13432 static tree
13434 {
13436 {
13440 /* Fall through for C++98. */
13448 /* Consume the token. */
13453 }
13454 }
13456 /* Parse an (optional) function-specifier.
13458 function-specifier:
13459 inline
13460 virtual
13461 explicit
13463 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13464 Updates DECL_SPECS, if it is non-NULL. */
13466 static tree
13469 {
13472 {
13478 /* 14.5.2.3 [temp.mem]
13480 A member function template shall not be virtual. */
13484 else
13494 }
13496 /* Consume the token. */
13498 }
13500 /* Parse a linkage-specification.
13502 linkage-specification:
13503 extern string-literal { declaration-seq [opt] }
13504 extern string-literal declaration */
13506 static void
13508 {
13509 tree linkage;
13511 /* Look for the `extern' keyword. */
13514 /* Look for the string-literal. */
13517 /* Transform the literal into an identifier. If the literal is a
13518 wide-character string, or contains embedded NULs, then we can't
13519 handle it as the user wants. */
13522 {
13524 /* Assume C++ linkage. */
13526 }
13527 else
13530 /* We're now using the new linkage. */
13533 /* If the next token is a `{', then we're using the first
13534 production. */
13536 {
13540 /* Consume the `{' token. */
13542 /* Parse the declarations. */
13544 /* Look for the closing `}'. */
13546 }
13547 /* Otherwise, there's just one declaration. */
13548 else
13549 {
13552 saved_in_unbraced_linkage_specification_p
13556 parser->in_unbraced_linkage_specification_p
13558 }
13560 /* We're done with the linkage-specification. */
13562 }
13564 /* Parse a static_assert-declaration.
13566 static_assert-declaration:
13567 static_assert ( constant-expression , string-literal ) ;
13568 static_assert ( constant-expression ) ; (C++1Z)
13570 If MEMBER_P, this static_assert is a class member. */
13572 static void
13574 {
13575 tree condition;
13576 tree message;
13578 location_t saved_loc;
13581 /* Peek at the `static_assert' token so we can keep track of exactly
13582 where the static assertion started. */
13586 /* Look for the `static_assert' keyword. */
13588 RT_STATIC_ASSERT))
13591 /* We know we are in a static assertion; commit to any tentative
13592 parse. */
13596 /* Parse the `(' starting the static assertion condition. */
13599 /* Parse the constant-expression. Allow a non-constant expression
13600 here in order to give better diagnostics in finish_static_assert. */
13601 condition =
13607 {
13610 "static_assert without a message "
13612 /* Eat the ')' */
13617 }
13618 else
13619 {
13620 /* Parse the separating `,'. */
13623 /* Parse the string-literal message. */
13628 /* A `)' completes the static assertion. */
13634 }
13636 /* A semicolon terminates the declaration. */
13639 /* Complete the static assertion, which may mean either processing
13640 the static assert now or saving it for template instantiation. */
13642 }
13644 /* Parse the expression in decltype ( expression ). */
13646 static tree
13649 {
13651 tree expr;
13653 /* Since we're going to preserve any side-effects from this parse, set up a
13654 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13655 in the expression. */
13658 /* First, try parsing an id-expression. */
13669 {
13672 cp_id_kind idk;
13676 /* Lookup the name we got back from the id-expression. */
13686 {
13687 /* Complete lookup of the id-expression. */
13688 expr = (finish_id_expression
13701 /* We found an id-expression, but it was something that we
13702 should not have found. This is an error, not something
13703 we can recover from, so note that we found an
13704 id-expression and we'll recover as gracefully as
13705 possible. */
13707 }
13712 /* We have an id-expression. */
13714 }
13717 {
13718 /* Abort the id-expression parse. */
13721 /* Parsing tentatively, again. */
13724 /* Parse a class member access. */
13732 /* We have an id-expression. */
13734 }
13737 /* We have parsed the complete id-expression or member access. */
13739 else
13740 {
13741 /* Abort our attempt to parse an id-expression or member access
13742 expression. */
13745 /* Parse a full expression. */
13748 }
13751 }
13753 /* Parse a `decltype' type. Returns the type.
13755 simple-type-specifier:
13756 decltype ( expression )
13757 C++14 proposal:
13758 decltype ( auto ) */
13760 static tree
13762 {
13763 tree expr;
13772 {
13773 /* Already parsed. */
13776 }
13778 /* Look for the `decltype' token. */
13782 /* Parse the opening `('. */
13786 /* decltype (auto) */
13789 {
13796 }
13798 /* Types cannot be defined in a `decltype' expression. Save away the
13799 old message. */
13802 /* And create the new one. */
13803 parser->type_definition_forbidden_message
13806 /* The restrictions on constant-expressions do not apply inside
13807 decltype expressions. */
13808 saved_integral_constant_expression_p
13810 saved_non_integral_constant_expression_p
13814 /* Within a parenthesized expression, a `>' token is always
13815 the greater-than operator. */
13816 saved_greater_than_is_operator_p
13820 /* Do not actually evaluate the expression. */
13823 /* Do not warn about problems with the expression. */
13828 /* Go back to evaluating expressions. */
13832 /* The `>' token might be the end of a template-id or
13833 template-parameter-list now. */
13834 parser->greater_than_is_operator_p
13837 /* Restore the old message and the integral constant expression
13838 flags. */
13840 parser->integral_constant_expression_p
13842 parser->non_integral_constant_expression_p
13845 /* Parse to the closing `)'. */
13847 {
13851 }
13854 tf_warning_or_error);
13856 rewrite:
13857 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13858 it again. */
13867 }
13869 /* Special member functions [gram.special] */
13871 /* Parse a conversion-function-id.
13873 conversion-function-id:
13874 operator conversion-type-id
13876 Returns an IDENTIFIER_NODE representing the operator. */
13878 static tree
13880 {
13881 tree type;
13882 tree saved_scope;
13883 tree saved_qualifying_scope;
13884 tree saved_object_scope;
13887 /* Look for the `operator' token. */
13890 /* When we parse the conversion-type-id, the current scope will be
13891 reset. However, we need that information in able to look up the
13892 conversion function later, so we save it here. */
13896 /* We must enter the scope of the class so that the names of
13897 entities declared within the class are available in the
13898 conversion-type-id. For example, consider:
13900 struct S {
13901 typedef int I;
13902 operator I();
13903 };
13905 S::operator I() { ... }
13907 In order to see that `I' is a type-name in the definition, we
13908 must be in the scope of `S'. */
13911 /* Parse the conversion-type-id. */
13913 /* Leave the scope of the class, if any. */
13916 /* Restore the saved scope. */
13920 /* If the TYPE is invalid, indicate failure. */
13924 }
13926 /* Parse a conversion-type-id:
13928 conversion-type-id:
13929 type-specifier-seq conversion-declarator [opt]
13931 Returns the TYPE specified. */
13933 static tree
13935 {
13936 tree attributes;
13937 cp_decl_specifier_seq type_specifiers;
13939 tree type_specified;
13942 /* Parse the attributes. */
13946 parser->type_definition_forbidden_message
13949 /* Parse the type-specifiers. */
13956 /* If that didn't work, stop. */
13959 /* Parse the conversion-declarator. */
13967 /* Don't give this error when parsing tentatively. This happens to
13968 work because we always parse this definitively once. */
13971 {
13973 {
13976 }
13980 }
13983 }
13985 /* Parse an (optional) conversion-declarator.
13987 conversion-declarator:
13988 ptr-operator conversion-declarator [opt]
13990 */
13994 {
13997 cp_cv_quals cv_quals;
13999 /* We don't know if there's a ptr-operator next, or not. */
14001 /* Try the ptr-operator. */
14004 /* If it worked, look for more conversion-declarators. */
14006 {
14009 /* Parse another optional declarator. */
14012 declarator = cp_parser_make_indirect_declarator
14016 }
14019 }
14021 /* Parse an (optional) ctor-initializer.
14023 ctor-initializer:
14024 : mem-initializer-list
14026 Returns TRUE iff the ctor-initializer was actually present. */
14028 static bool
14030 {
14031 /* If the next token is not a `:', then there is no
14032 ctor-initializer. */
14034 {
14035 /* Do default initialization of any bases and members. */
14040 }
14042 /* Consume the `:' token. */
14044 /* And the mem-initializer-list. */
14048 }
14050 /* Parse a mem-initializer-list.
14052 mem-initializer-list:
14053 mem-initializer ... [opt]
14054 mem-initializer ... [opt] , mem-initializer-list */
14056 static void
14058 {
14063 /* Let the semantic analysis code know that we are starting the
14064 mem-initializer-list. */
14069 /* Loop through the list. */
14071 {
14072 tree mem_initializer;
14075 /* Parse the mem-initializer. */
14077 /* If the next token is a `...', we're expanding member initializers. */
14079 {
14080 /* Consume the `...'. */
14083 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14084 can be expanded but members cannot. */
14087 {
14092 }
14094 /* Construct the pack expansion type. */
14097 }
14100 {
14104 }
14105 /* Look for a target constructor. */
14109 {
14112 {
14116 }
14118 }
14119 /* Add it to the list, unless it was erroneous. */
14121 {
14124 }
14125 /* If the next token is not a `,', we're done. */
14128 /* Consume the `,' token. */
14130 }
14132 /* Perform semantic analysis. */
14135 }
14137 /* Parse a mem-initializer.
14139 mem-initializer:
14140 mem-initializer-id ( expression-list [opt] )
14141 mem-initializer-id braced-init-list
14143 GNU extension:
14145 mem-initializer:
14146 ( expression-list [opt] )
14148 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14149 class) or FIELD_DECL (for a non-static data member) to initialize;
14150 the TREE_VALUE is the expression-list. An empty initialization
14151 list is represented by void_list_node. */
14153 static tree
14155 {
14156 tree mem_initializer_id;
14157 tree expression_list;
14158 tree member;
14161 /* Find out what is being initialized. */
14163 {
14167 }
14168 else
14169 {
14173 }
14179 {
14186 }
14187 else
14188 {
14198 }
14208 }
14210 /* Parse a mem-initializer-id.
14212 mem-initializer-id:
14213 :: [opt] nested-name-specifier [opt] class-name
14214 decltype-specifier (C++11)
14215 identifier
14217 Returns a TYPE indicating the class to be initialized for the first
14218 production (and the second in C++11). Returns an IDENTIFIER_NODE
14219 indicating the data member to be initialized for the last production. */
14221 static tree
14223 {
14227 tree id;
14231 /* `typename' is not allowed in this context ([temp.res]). */
14233 {
14235 "keyword %<typename%> not allowed in this context (a qualified "
14238 }
14239 /* Look for the optional `::' operator. */
14240 global_scope_p
14244 /* Look for the optional nested-name-specifier. The simplest way to
14245 implement:
14247 [temp.res]
14249 The keyword `typename' is not permitted in a base-specifier or
14250 mem-initializer; in these contexts a qualified name that
14251 depends on a template-parameter is implicitly assumed to be a
14252 type name.
14254 is to assume that we have seen the `typename' keyword at this
14255 point. */
14256 nested_name_specifier_p
14265 /* If there is a `::' operator or a nested-name-specifier, then we
14266 are definitely looking for a class-name. */
14271 typename_type,
14275 /* Otherwise, we could also be looking for an ordinary identifier. */
14278 /* Try a decltype-specifier. */
14280 else
14281 /* Otherwise, try a class-name. */
14285 none_type,
14289 /* If we found one, we're done. */
14292 /* Otherwise, look for an ordinary identifier. */
14294 }
14296 /* Overloading [gram.over] */
14298 /* Parse an operator-function-id.
14300 operator-function-id:
14301 operator operator
14303 Returns an IDENTIFIER_NODE for the operator which is a
14304 human-readable spelling of the identifier, e.g., `operator +'. */
14306 static cp_expr
14308 {
14309 /* Look for the `operator' keyword. */
14312 /* And then the name of the operator itself. */
14314 }
14316 /* Return an identifier node for a user-defined literal operator.
14317 The suffix identifier is chained to the operator name identifier. */
14319 tree
14321 {
14322 tree identifier;
14329 }
14331 /* Parse an operator.
14333 operator:
14334 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14335 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14336 || ++ -- , ->* -> () []
14338 GNU Extensions:
14340 operator:
14341 <? >? <?= >?=
14343 Returns an IDENTIFIER_NODE for the operator which is a
14344 human-readable spelling of the identifier, e.g., `operator +'. */
14346 static cp_expr
14348 {
14353 /* Peek at the next token. */
14358 /* Figure out which operator we have. */
14360 {
14362 {
14365 /* The keyword should be either `new' or `delete'. */
14370 else
14373 /* Consume the `new' or `delete' token. */
14376 /* Peek at the next token. */
14378 /* If it's a `[' token then this is the array variant of the
14379 operator. */
14381 {
14382 /* Consume the `[' token. */
14384 /* Look for the `]' token. */
14390 }
14391 /* Otherwise, we have the non-array variant. */
14392 else
14398 }
14545 /* Consume the `('. */
14547 /* Look for the matching `)'. */
14552 /* Consume the `['. */
14554 /* Look for the matching `]'. */
14561 /* FALLTHRU */
14570 {
14577 /* Consume the string. */
14583 {
14586 }
14587 else
14588 {
14590 /* Look for the suffix identifier. */
14595 {
14599 }
14600 else
14601 {
14604 }
14605 }
14610 {
14613 }
14616 {
14619 }
14621 {
14624 }
14626 }
14629 /* Anything else is an error. */
14631 }
14633 /* If we have selected an identifier, we need to consume the
14634 operator token. */
14637 /* Otherwise, no valid operator name was present. */
14638 else
14639 {
14642 }
14645 }
14647 /* Parse a template-declaration.
14649 template-declaration:
14650 export [opt] template < template-parameter-list > declaration
14652 If MEMBER_P is TRUE, this template-declaration occurs within a
14653 class-specifier.
14655 The grammar rule given by the standard isn't correct. What
14656 is really meant is:
14658 template-declaration:
14659 export [opt] template-parameter-list-seq
14660 decl-specifier-seq [opt] init-declarator [opt] ;
14661 export [opt] template-parameter-list-seq
14662 function-definition
14664 template-parameter-list-seq:
14665 template-parameter-list-seq [opt]
14666 template < template-parameter-list >
14668 Concept Extensions:
14670 template-parameter-list-seq:
14671 template < template-parameter-list > requires-clause [opt]
14673 requires-clause:
14674 requires logical-or-expression */
14676 static void
14678 {
14679 /* Check for `export'. */
14681 {
14682 /* Consume the `export' token. */
14684 /* Warn that we do not support `export'. */
14686 }
14689 }
14691 /* Parse a template-parameter-list.
14693 template-parameter-list:
14694 template-parameter
14695 template-parameter-list , template-parameter
14697 Returns a TREE_LIST. Each node represents a template parameter.
14698 The nodes are connected via their TREE_CHAINs. */
14700 static tree
14702 {
14707 /* The loop below parses the template parms. We first need to know
14708 the total number of template parms to be able to compute proper
14709 canonical types of each dependent type. So after the loop, when
14710 we know the total number of template parms,
14711 end_template_parm_list computes the proper canonical types and
14712 fixes up the dependent types accordingly. */
14714 {
14715 tree parameter;
14718 location_t parm_loc;
14720 /* Parse the template-parameter. */
14725 /* Add it to the list. */
14728 parm_loc,
14729 parameter,
14730 is_non_type,
14731 is_parameter_pack);
14732 else
14733 {
14736 }
14738 /* If the next token is not a `,', we're done. */
14741 /* Otherwise, consume the `,' token. */
14743 }
14746 }
14748 /* Parse a introduction-list.
14750 introduction-list:
14751 introduced-parameter
14752 introduction-list , introduced-parameter
14754 introduced-parameter:
14755 ...[opt] identifier
14757 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14758 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14759 WILDCARD_DECL will also have DECL_NAME set and token location in
14760 DECL_SOURCE_LOCATION. */
14762 static tree
14764 {
14768 {
14773 /* Build placeholder. */
14781 /* If the next token is not a `,', we're done. */
14784 /* Otherwise, consume the `,' token. */
14786 }
14788 /* Convert the vec into a TREE_VEC. */
14791 tree parm;
14797 }
14799 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14800 is an abstract declarator. */
14804 {
14809 }
14811 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14812 is an abstract declarator. */
14816 {
14820 else
14822 }
14824 /* Returns true if DECL represents a constrained-parameter. */
14828 {
14833 }
14835 /* Returns true if PARM declares a constrained-parameter. */
14839 {
14841 }
14843 /* Check that the type parameter is only a declarator-id, and that its
14844 type is not cv-qualified. */
14846 bool
14849 {
14854 {
14857 }
14859 /* Don't allow cv-qualified type parameters. */
14862 {
14865 }
14868 }
14870 /* Finish parsing/processing a template type parameter and checking
14871 various restrictions. */
14875 tree id,
14877 {
14880 else
14882 }
14884 static tree
14886 {
14887 /* FIXME: This should probably be copied, and we may need to adjust
14888 the template parameter depths. */
14898 }
14900 /* Finish parsing/processing a template template parameter by borrowing
14901 the template parameter list from the prototype parameter. */
14903 static tree
14905 tree proto,
14906 tree id,
14908 {
14912 }
14914 /* Create a new non-type template parameter from the given PARM
14915 declarator. */
14917 static tree
14920 {
14926 }
14928 /* Build a constrained template parameter based on the PARMDECL
14929 declarator. The type of PARMDECL is the constrained type, which
14930 refers to the prototype template parameter that ultimately
14931 specifies the type of the declared parameter. */
14933 static tree
14938 {
14944 /* A template parameter constrained by a variadic concept shall also
14945 be declared as a template parameter pack. */
14950 /* Build the parameter. Return an error if the declarator was invalid. */
14951 tree parm;
14956 parmdecl);
14957 else
14962 /* Finish the parameter decl and create a node attaching the
14963 default argument and constraint. */
14968 }
14970 /* Returns true if the parsed type actually represents the declaration
14971 of a type template-parameter. */
14975 {
14978 }
14981 /* Returns true if the parsed type actually represents the declaration of
14982 a template template-parameter. */
14984 static bool
14986 {
14989 }
14991 /* Parse a default argument for a type template-parameter.
14992 Note that diagnostics are handled in cp_parser_template_parameter. */
14994 static tree
14996 {
14999 /* Consume the `=' token. */
15004 /* Parse the default-argument. */
15010 {
15014 }
15017 }
15019 /* Parse a default argument for a template template-parameter. */
15021 static tree
15023 {
15028 /* Consume the `='. */
15030 /* Parse the id-expression. */
15032 /* save token before parsing the id-expression, for error
15033 reporting */
15035 tree default_argument
15043 /* If the id-expression was a template-id that refers to
15044 a template-class, we already have the declaration here,
15045 so no further lookup is needed. */
15046 ;
15047 else
15048 /* Look up the name. */
15049 default_argument
15051 none_type,
15057 /* See if the default argument is valid. */
15061 }
15063 /* Parse a template-parameter.
15065 template-parameter:
15066 type-parameter
15067 parameter-declaration
15069 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15070 the parameter. The TREE_PURPOSE is the default value, if any.
15071 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15072 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15073 set to true iff this parameter is a parameter pack. */
15075 static tree
15078 {
15081 tree parm;
15083 /* Assume it is a type parameter or a template parameter. */
15085 /* Assume it not a parameter pack. */
15087 /* Peek at the next token. */
15089 /* If it is `class' or `template', we have a type-parameter. */
15092 /* If it is `class' or `typename' we do not know yet whether it is a
15093 type parameter or a non-type parameter. Consider:
15095 template <typename T, typename T::X X> ...
15097 or:
15099 template <class C, class D*> ...
15101 Here, the first parameter is a type parameter, and the second is
15102 a non-type parameter. We can tell by looking at the token after
15103 the identifier -- if it is a `,', `=', or `>' then we have a type
15104 parameter. */
15106 {
15107 /* Peek at the token after `class' or `typename'. */
15109 /* If it's an ellipsis, we have a template type parameter
15110 pack. */
15113 /* If it's an identifier, skip it. */
15116 /* Now, see if the token looks like the end of a template
15117 parameter. */
15122 }
15124 /* Otherwise, it is a non-type parameter or a constrained parameter.
15126 [temp.param]
15128 When parsing a default template-argument for a non-type
15129 template-parameter, the first non-nested `>' is taken as the end
15130 of the template parameter-list rather than a greater-than
15131 operator. */
15132 parameter_declarator
15139 /* If the parameter declaration is marked as a parameter pack, set
15140 *IS_PARAMETER_PACK to notify the caller. */
15145 {
15146 /* Can happen in some cases of erroneous input (c++/34892). */
15148 /* Consume the `...' for better error recovery. */
15150 }
15152 // The parameter may have been constrained.
15155 parameter_declarator,
15156 is_non_type,
15157 is_parameter_pack);
15159 // Now we're sure that the parameter is a non-type parameter.
15170 }
15172 /* Parse a type-parameter.
15174 type-parameter:
15175 class identifier [opt]
15176 class identifier [opt] = type-id
15177 typename identifier [opt]
15178 typename identifier [opt] = type-id
15179 template < template-parameter-list > class identifier [opt]
15180 template < template-parameter-list > class identifier [opt]
15181 = id-expression
15183 GNU Extension (variadic templates):
15185 type-parameter:
15186 class ... identifier [opt]
15187 typename ... identifier [opt]
15189 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15190 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15191 the declaration of the parameter.
15193 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15195 static tree
15197 {
15199 tree parameter;
15201 /* Look for a keyword to tell us what kind of parameter this is. */
15207 {
15210 {
15211 tree identifier;
15212 tree default_argument;
15214 /* If the next token is an ellipsis, we have a template
15215 argument pack. */
15217 {
15218 /* Consume the `...' token. */
15223 }
15225 /* If the next token is an identifier, then it names the
15226 parameter. */
15229 else
15232 /* Create the parameter. */
15235 /* If the next token is an `=', we have a default argument. */
15237 {
15238 default_argument
15241 /* Template parameter packs cannot have default
15242 arguments. */
15244 {
15247 "template parameter pack %qD cannot have a "
15249 else
15251 "template parameter packs cannot have "
15254 }
15257 }
15258 else
15261 /* Create the combined representation of the parameter and the
15262 default argument. */
15264 }
15268 {
15269 tree identifier;
15270 tree default_argument;
15272 /* Look for the `<'. */
15274 /* Parse the template-parameter-list. */
15276 /* Look for the `>'. */
15279 // If template requirements are present, parse them.
15281 {
15286 }
15288 /* Look for the `class' or 'typename' keywords. */
15290 /* If the next token is an ellipsis, we have a template
15291 argument pack. */
15293 {
15294 /* Consume the `...' token. */
15299 }
15300 /* If the next token is an `=', then there is a
15301 default-argument. If the next token is a `>', we are at
15302 the end of the parameter-list. If the next token is a `,',
15303 then we are at the end of this parameter. */
15307 {
15309 /* Treat invalid names as if the parameter were nameless. */
15312 }
15313 else
15316 /* Create the template parameter. */
15318 identifier);
15320 /* If the next token is an `=', then there is a
15321 default-argument. */
15323 {
15324 default_argument
15327 /* Template parameter packs cannot have default
15328 arguments. */
15330 {
15333 "template parameter pack %qD cannot "
15335 identifier);
15336 else
15340 }
15341 }
15342 else
15345 /* Create the combined representation of the parameter and the
15346 default argument. */
15348 }
15354 }
15357 }
15359 /* Parse a template-id.
15361 template-id:
15362 template-name < template-argument-list [opt] >
15364 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15365 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15366 returned. Otherwise, if the template-name names a function, or set
15367 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15368 names a class, returns a TYPE_DECL for the specialization.
15370 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15371 uninstantiated templates. */
15373 static tree
15379 {
15380 tree templ;
15381 tree arguments;
15382 tree template_id;
15387 /* If the next token corresponds to a template-id, there is no need
15388 to reparse it. */
15391 {
15394 }
15396 /* Avoid performing name lookup if there is no possibility of
15397 finding a template-id. */
15400 && !cp_parser_nth_token_starts_template_argument_list_p
15402 {
15405 }
15407 /* Remember where the template-id starts. */
15413 /* Parse the template-name. */
15416 check_dependency_p,
15417 is_declaration,
15418 tag_type,
15421 {
15424 }
15426 /* Since we're going to preserve any side-effects from this parse, set up a
15427 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15428 in the template arguments. */
15431 /* If we find the sequence `[:' after a template-name, it's probably
15432 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15433 parse correctly the argument list. */
15440 {
15442 /* Change `:' into `::'. */
15444 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15445 CPP_LESS. */
15448 /* Parse the arguments. */
15451 {
15452 /* If we couldn't parse an argument list, then we revert our changes
15453 and return simply an error. Maybe this is not a template-id
15454 after all. */
15459 }
15460 /* Otherwise, emit an error about the invalid digraph, but continue
15461 parsing because we got our argument list. */
15464 {
15467 "%<<:%> is an alternate spelling for %<[%>."
15470 {
15472 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15475 }
15476 }
15477 }
15478 else
15479 {
15480 /* Look for the `<' that starts the template-argument-list. */
15482 {
15485 }
15486 /* Parse the arguments. */
15488 }
15490 /* Build a representation of the specialization. */
15493 TEMPLATE_ID_EXPR,
15497 {
15499 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15500 template (rather than some instantiation thereof) only if
15501 is not nested within some other construct. For example, in
15502 "template <typename T> void f(T) { A<T>::", A<T> is just an
15503 instantiation of A. */
15506 CPP_SCOPE));
15507 template_id
15509 }
15510 /* A template-like identifier may be a partial concept id. */
15516 {
15520 }
15521 else
15522 {
15523 /* If it's not a class-template or a template-template, it should be
15524 a function-template. */
15532 }
15534 /* If parsing tentatively, replace the sequence of tokens that makes
15535 up the template-id with a CPP_TEMPLATE_ID token. That way,
15536 should we re-parse the token stream, we will not have to repeat
15537 the effort required to do the parse, nor will we issue duplicate
15538 error messages about problems during instantiation of the
15539 template. */
15541 /* Don't do this if we had a parse error in a declarator; re-parsing
15542 might succeed if a name changes meaning (60361). */
15546 {
15549 /* Reset the contents of the START_OF_ID token. */
15552 /* Update the location to be of the form:
15553 template-name < template-argument-list [opt] >
15554 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15555 with caret == start at the start of the template-name,
15556 ranging until the closing '>'. */
15557 location_t finish_loc
15559 location_t combined_loc
15563 /* Retrieve any deferred checks. Do not pop this access checks yet
15564 so the memory will not be reclaimed during token replacing below. */
15570 /* Purge all subsequent tokens. */
15573 /* ??? Can we actually assume that, if template_id ==
15574 error_mark_node, we will have issued a diagnostic to the
15575 user, as opposed to simply marking the tentative parse as
15576 failed? */
15579 }
15583 }
15585 /* Parse a template-name.
15587 template-name:
15588 identifier
15590 The standard should actually say:
15592 template-name:
15593 identifier
15594 operator-function-id
15596 A defect report has been filed about this issue.
15598 A conversion-function-id cannot be a template name because they cannot
15599 be part of a template-id. In fact, looking at this code:
15601 a.operator K<int>()
15603 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15604 It is impossible to call a templated conversion-function-id with an
15605 explicit argument list, since the only allowed template parameter is
15606 the type to which it is converting.
15608 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15609 `template' keyword, in a construction like:
15611 T::template f<3>()
15613 In that case `f' is taken to be a template-name, even though there
15614 is no way of knowing for sure.
15616 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15617 name refers to a set of overloaded functions, at least one of which
15618 is a template, or an IDENTIFIER_NODE with the name of the template,
15619 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15620 names are looked up inside uninstantiated templates. */
15622 static tree
15629 {
15630 tree identifier;
15631 tree decl;
15632 tree fns;
15635 /* If the next token is `operator', then we have either an
15636 operator-function-id or a conversion-function-id. */
15638 {
15639 /* We don't know whether we're looking at an
15640 operator-function-id or a conversion-function-id. */
15642 /* Try an operator-function-id. */
15644 /* If that didn't work, try a conversion-function-id. */
15646 {
15649 }
15650 }
15651 /* Look for the identifier. */
15652 else
15655 /* If we didn't find an identifier, we don't have a template-id. */
15659 /* If the name immediately followed the `template' keyword, then it
15660 is a template-name. However, if the next token is not `<', then
15661 we do not treat it as a template-name, since it is not being used
15662 as part of a template-id. This enables us to handle constructs
15663 like:
15665 template <typename T> struct S { S(); };
15666 template <typename T> S<T>::S();
15668 correctly. We would treat `S' as a template -- if it were `S<T>'
15669 -- but we do not if there is no `<'. */
15673 {
15674 /* In a declaration, in a dependent context, we pretend that the
15675 "template" keyword was present in order to improve error
15676 recovery. For example, given:
15678 template <typename T> void f(T::X<int>);
15680 we want to treat "X<int>" as a template-id. */
15682 && !template_keyword_p
15684 && check_dependency_p
15686 /* Do not do this for dtors (or ctors), since they never
15687 need the template keyword before their name. */
15689 {
15692 /* Explain what went wrong. */
15694 identifier);
15697 /* If parsing tentatively, find the location of the "<" token. */
15700 /* Parse the template arguments so that we can issue error
15701 messages about them. */
15704 /* Skip tokens until we find a good place from which to
15705 continue parsing. */
15710 /* If parsing tentatively, permanently remove the
15711 template argument list. That will prevent duplicate
15712 error messages from being issued about the missing
15713 "template" keyword. */
15720 }
15722 /* If the "template" keyword is present, then there is generally
15723 no point in doing name-lookup, so we just return IDENTIFIER.
15724 But, if the qualifying scope is non-dependent then we can
15725 (and must) do name-lookup normally. */
15730 {
15731 /* We're optimizing away the call to cp_parser_lookup_name, but we
15732 still need to do this. */
15735 }
15736 }
15738 /* Look up the name. */
15740 tag_type,
15743 check_dependency_p,
15749 /* If DECL is a template, then the name was a template-name. */
15751 {
15755 }
15756 else
15757 {
15760 /* The standard does not explicitly indicate whether a name that
15761 names a set of overloaded declarations, some of which are
15762 templates, is a template-name. However, such a name should
15763 be a template-name; otherwise, there is no way to form a
15764 template-id for the overloaded templates. */
15772 {
15773 /* The name does not name a template. */
15776 }
15777 }
15779 /* If DECL is dependent, and refers to a function, then just return
15780 its name; we will look it up again during template instantiation. */
15782 {
15786 }
15789 }
15791 /* Parse a template-argument-list.
15793 template-argument-list:
15794 template-argument ... [opt]
15795 template-argument-list , template-argument ... [opt]
15797 Returns a TREE_VEC containing the arguments. */
15799 static tree
15801 {
15806 tree vec;
15813 /* Even if the template-id appears in an integral
15814 constant-expression, the contents of the argument list do
15815 not. */
15821 /* Parse the arguments. */
15822 do
15823 {
15824 tree argument;
15827 /* Consume the comma. */
15830 /* Parse the template-argument. */
15833 /* If the next token is an ellipsis, we're expanding a template
15834 argument pack. */
15836 {
15838 {
15842 }
15843 /* Consume the `...' token. */
15846 /* Make the argument into a TYPE_PACK_EXPANSION or
15847 EXPR_PACK_EXPANSION. */
15849 }
15852 {
15856 {
15859 }
15860 else
15862 }
15864 }
15880 }
15882 /* Parse a template-argument.
15884 template-argument:
15885 assignment-expression
15886 type-id
15887 id-expression
15889 The representation is that of an assignment-expression, type-id, or
15890 id-expression -- except that the qualified id-expression is
15891 evaluated, so that the value returned is either a DECL or an
15892 OVERLOAD.
15894 Although the standard says "assignment-expression", it forbids
15895 throw-expressions or assignments in the template argument.
15896 Therefore, we use "conditional-expression" instead. */
15898 static tree
15900 {
15901 tree argument;
15907 cp_id_kind idk;
15909 /* There's really no way to know what we're looking at, so we just
15910 try each alternative in order.
15912 [temp.arg]
15914 In a template-argument, an ambiguity between a type-id and an
15915 expression is resolved to a type-id, regardless of the form of
15916 the corresponding template-parameter.
15918 Therefore, we try a type-id first. */
15921 /* If there was no error parsing the type-id but the next token is a
15922 '>>', our behavior depends on which dialect of C++ we're
15923 parsing. In C++98, we probably found a typo for '> >'. But there
15924 are type-id which are also valid expressions. For instance:
15926 struct X { int operator >> (int); };
15927 template <int V> struct Foo {};
15928 Foo<X () >> 5> r;
15930 Here 'X()' is a valid type-id of a function type, but the user just
15931 wanted to write the expression "X() >> 5". Thus, we remember that we
15932 found a valid type-id, but we still try to parse the argument as an
15933 expression to see what happens.
15935 In C++0x, the '>>' will be considered two separate '>'
15936 tokens. */
15940 {
15943 }
15944 else
15945 {
15946 /* If the next token isn't a `,' or a `>', then this argument wasn't
15947 really finished. This means that the argument is not a valid
15948 type-id. */
15951 /* If that worked, we're done. */
15954 }
15955 /* We're still not sure what the argument will be. */
15957 /* Try a template. */
15965 /* If the next token isn't a `,' or a `>', then this argument wasn't
15966 really finished. */
15970 {
15971 /* Figure out what is being referred to. If the id-expression
15972 was for a class template specialization, then we will have a
15973 TYPE_DECL at this point. There is no need to do name lookup
15974 at this point in that case. */
15977 none_type,
15983 /* Handle a constrained-type-specifier for a non-type template
15984 parameter. */
15990 }
15992 {
15996 }
15997 /* It must be a non-type argument. In C++17 any constant-expression is
15998 allowed. */
16002 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16004 -- an integral constant-expression of integral or enumeration
16005 type; or
16007 -- the name of a non-type template-parameter; or
16009 -- the name of an object or function with external linkage...
16011 -- the address of an object or function with external linkage...
16013 -- a pointer to member... */
16014 /* Look for a non-type template parameter. */
16016 {
16028 }
16030 /* If the next token is "&", the argument must be the address of an
16031 object or function with external linkage. */
16034 {
16037 }
16038 /* See if we might have an id-expression. */
16045 {
16048 address_p,
16055 else
16056 {
16057 tree probe;
16060 {
16061 /* Strip the dereference temporarily. */
16064 }
16066 /* If we're in a template, we represent a qualified-id referring
16067 to a static data member as a SCOPE_REF even if the scope isn't
16068 dependent so that we can check access control later. */
16073 {
16074 /* A variable without external linkage might still be a
16075 valid constant-expression, so no error is issued here
16076 if the external-linkage check fails. */
16079 }
16081 /* All overloaded functions are allowed; if the external
16082 linkage test does not pass, an error will be issued
16083 later. */
16084 ;
16088 /* A pointer-to-member. */
16089 ;
16091 ;
16092 else
16096 {
16099 tf_warning_or_error);
16100 else
16103 }
16104 }
16105 }
16106 /* If the argument started with "&", there are no other valid
16107 alternatives at this point. */
16109 {
16112 }
16114 general_expr:
16115 /* If the argument wasn't successfully parsed as a type-id followed
16116 by '>>', the argument can only be a constant expression now.
16117 Otherwise, we try parsing the constant-expression tentatively,
16118 because the argument could really be a type-id. */
16124 else
16125 {
16126 /* With C++17 generalized non-type template arguments we need to handle
16127 lvalue constant expressions, too. */
16130 }
16138 /* We did our best to parse the argument as a non type-id, but that
16139 was the only alternative that matched (albeit with a '>' after
16140 it). We can assume it's just a typo from the user, and a
16141 diagnostic will then be issued. */
16143 }
16145 /* Parse an explicit-instantiation.
16147 explicit-instantiation:
16148 template declaration
16150 Although the standard says `declaration', what it really means is:
16152 explicit-instantiation:
16153 template decl-specifier-seq [opt] declarator [opt] ;
16155 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16156 supposed to be allowed. A defect report has been filed about this
16157 issue.
16159 GNU Extension:
16161 explicit-instantiation:
16162 storage-class-specifier template
16163 decl-specifier-seq [opt] declarator [opt] ;
16164 function-specifier template
16165 decl-specifier-seq [opt] declarator [opt] ; */
16167 static void
16169 {
16171 cp_decl_specifier_seq decl_specifiers;
16176 /* Look for an (optional) storage-class-specifier or
16177 function-specifier. */
16179 {
16180 extension_specifier
16183 extension_specifier
16186 }
16188 /* Look for the `template' keyword. */
16190 /* Let the front end know that we are processing an explicit
16191 instantiation. */
16193 /* [temp.explicit] says that we are supposed to ignore access
16194 control while processing explicit instantiation directives. */
16196 /* Parse a decl-specifier-seq. */
16198 CP_PARSER_FLAGS_OPTIONAL,
16201 /* If there was exactly one decl-specifier, and it declared a class,
16202 and there's no declarator, then we have an explicit type
16203 instantiation. */
16205 {
16206 tree type;
16210 /* Turn access control back on for names used during
16211 template instantiation. */
16216 }
16217 else
16218 {
16220 tree decl;
16222 /* Parse the declarator. */
16223 declarator
16234 {
16237 "explicit instantiation shall not use"
16241 "explicit instantiation shall not use"
16246 /* Turn access control back on for names used during
16247 template instantiation. */
16249 /* Do the explicit instantiation. */
16251 }
16252 else
16253 {
16255 /* Skip the body of the explicit instantiation. */
16257 }
16258 }
16259 /* We're done with the instantiation. */
16265 }
16267 /* Parse an explicit-specialization.
16269 explicit-specialization:
16270 template < > declaration
16272 Although the standard says `declaration', what it really means is:
16274 explicit-specialization:
16275 template <> decl-specifier [opt] init-declarator [opt] ;
16276 template <> function-definition
16277 template <> explicit-specialization
16278 template <> template-declaration */
16280 static void
16282 {
16286 /* Look for the `template' keyword. */
16288 /* Look for the `<'. */
16290 /* Look for the `>'. */
16292 /* We have processed another parameter list. */
16294 /* [temp]
16296 A template ... explicit specialization ... shall not have C
16297 linkage. */
16299 {
16301 /* Give it C++ linkage to avoid confusing other parts of the
16302 front end. */
16305 }
16306 else
16308 /* Let the front end know that we are beginning a specialization. */
16310 {
16313 }
16315 /* If the next keyword is `template', we need to figure out whether
16316 or not we're looking a template-declaration. */
16318 {
16323 else
16325 }
16326 else
16327 /* Parse the dependent declaration. */
16333 /* We're done with the specialization. */
16335 /* For the erroneous case of a template with C linkage, we pushed an
16336 implicit C++ linkage scope; exit that scope now. */
16339 /* We're done with this parameter list. */
16341 }
16343 /* Parse a type-specifier.
16345 type-specifier:
16346 simple-type-specifier
16347 class-specifier
16348 enum-specifier
16349 elaborated-type-specifier
16350 cv-qualifier
16352 GNU Extension:
16354 type-specifier:
16355 __complex__
16357 Returns a representation of the type-specifier. For a
16358 class-specifier, enum-specifier, or elaborated-type-specifier, a
16359 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16361 The parser flags FLAGS is used to control type-specifier parsing.
16363 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16364 in a decl-specifier-seq.
16366 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16367 class-specifier, enum-specifier, or elaborated-type-specifier, then
16368 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16369 if a type is declared; 2 if it is defined. Otherwise, it is set to
16370 zero.
16372 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16373 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16374 is set to FALSE. */
16376 static tree
16378 cp_parser_flags flags,
16383 {
16389 /* Assume this type-specifier does not declare a new type. */
16392 /* And that it does not specify a cv-qualifier. */
16395 /* Peek at the next token. */
16398 /* If we're looking at a keyword, we can use that to guide the
16399 production we choose. */
16402 {
16407 /* Look for the enum-specifier. */
16409 /* If that worked, we're done. */
16411 {
16416 type_spec,
16417 token,
16420 }
16421 else
16424 /* Any of these indicate either a class-specifier, or an
16425 elaborated-type-specifier. */
16432 /* Parse tentatively so that we can back up if we don't find a
16433 class-specifier. */
16435 /* Look for the class-specifier. */
16438 /* If that worked, we're done. */
16440 {
16445 type_spec,
16446 token,
16449 }
16451 /* Fall through. */
16452 elaborated_type_specifier:
16453 /* We're declaring (not defining) a class or enum. */
16457 /* Fall through. */
16459 /* Look for an elaborated-type-specifier. */
16460 type_spec
16461 = (cp_parser_elaborated_type_specifier
16464 is_declaration));
16467 type_spec,
16468 token,
16491 /* The `__complex__' keyword is a GNU extension. */
16497 }
16499 /* Handle simple keywords. */
16501 {
16503 {
16506 }
16508 }
16510 /* If we do not already have a type-specifier, assume we are looking
16511 at a simple-type-specifier. */
16513 decl_specs,
16514 flags);
16516 /* If we didn't find a type-specifier, and a type-specifier was not
16517 optional in this context, issue an error message. */
16519 {
16522 }
16525 }
16527 /* Parse a simple-type-specifier.
16529 simple-type-specifier:
16530 :: [opt] nested-name-specifier [opt] type-name
16531 :: [opt] nested-name-specifier template template-id
16532 char
16533 wchar_t
16534 bool
16535 short
16536 int
16537 long
16538 signed
16539 unsigned
16540 float
16541 double
16542 void
16544 C++11 Extension:
16546 simple-type-specifier:
16547 auto
16548 decltype ( expression )
16549 char16_t
16550 char32_t
16551 __underlying_type ( type-id )
16553 C++17 extension:
16555 nested-name-specifier(opt) template-name
16557 GNU Extension:
16559 simple-type-specifier:
16560 __int128
16561 __typeof__ unary-expression
16562 __typeof__ ( type-id )
16563 __typeof__ ( type-id ) { initializer-list , [opt] }
16565 Concepts Extension:
16567 simple-type-specifier:
16568 constrained-type-specifier
16570 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16571 appropriately updated. */
16573 static tree
16576 cp_parser_flags flags)
16577 {
16582 /* Peek at the next token. */
16585 /* If we're looking at a keyword, things are easy. */
16587 {
16622 {
16625 }
16654 {
16655 /* The 'auto' might be the placeholder return type for a function decl
16656 with trailing return type. */
16665 {
16667 {
16674 }
16677 {
16680 }
16683 }
16687 {
16690 }
16693 {
16696 }
16697 else
16701 {
16704 "use of %<auto%> in lambda parameter declaration "
16705 "only available with "
16707 }
16710 "use of %<auto%> in parameter declaration "
16711 "only available with "
16715 "ISO C++ forbids use of %<auto%> in parameter "
16717 }
16718 else
16723 /* Since DR 743, decltype can either be a simple-type-specifier by
16724 itself or begin a nested-name-specifier. Parsing it will replace
16725 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16726 handling below decide what to do. */
16732 /* Consume the `typeof' token. */
16734 /* Parse the operand to `typeof'. */
16736 /* If it is not already a TYPE, take its type. */
16742 token,
16751 token,
16761 token,
16766 }
16768 /* If token is an already-parsed decltype not followed by ::,
16769 it's a simple-type-specifier. */
16772 {
16775 {
16777 token,
16779 /* Remember that we are handling a decltype in order to
16780 implement the resolution of DR 1510 when the argument
16781 isn't instantiation dependent. */
16783 }
16786 }
16788 /* If the type-specifier was for a built-in type, we're done. */
16790 {
16791 /* Record the type. */
16798 type,
16799 token,
16804 /* Consume the token. */
16810 /* There is no valid C++ program where a non-template type is
16811 followed by a "<". That usually indicates that the user thought
16812 that the type was a template. */
16817 }
16819 /* The type-specifier must be a user-defined type. */
16821 {
16825 /* Don't gobble tokens or issue error messages if this is an
16826 optional type-specifier. */
16832 /* Look for the optional `::' operator. */
16833 global_p
16837 /* Look for the nested-name specifier. */
16838 qualified_p
16845 /* If we have seen a nested-name-specifier, and the next token
16846 is `template', then we are using the template-id production. */
16849 {
16850 /* Look for the template-id. */
16854 none_type,
16856 /* If the template-id did not name a type, we are out of
16857 luck. */
16859 {
16862 }
16863 }
16864 /* Otherwise, look for a type-name. */
16865 else
16867 /* Keep track of all name-lookups performed in class scopes. */
16869 && !global_p
16870 && !qualified_p
16874 /* If it didn't work out, we don't have a TYPE. */
16879 {
16893 {
16895 none_type,
16905 else
16906 {
16911 }
16912 }
16913 else
16919 }
16922 token,
16924 }
16926 /* If we didn't get a type-name, issue an error message. */
16928 {
16931 }
16934 {
16935 /* See if TYPE is an Objective-C type, and if so, parse and
16936 accept any protocol references following it. Do this before
16937 the cp_parser_check_for_invalid_template_id() call, because
16938 Objective-C types can be followed by '<...>' which would
16939 enclose protocol names rather than template arguments, and so
16940 everything is fine. */
16943 {
16947 /* Clobber the "unqualified" type previously entered into
16948 DECL_SPECS with the new, improved protocol-qualified version. */
16953 }
16955 /* There is no valid C++ program where a non-template type is
16956 followed by a "<". That usually indicates that the user
16957 thought that the type was a template. */
16959 none_type,
16961 }
16964 }
16966 /* Parse a type-name.
16968 type-name:
16969 class-name
16970 enum-name
16971 typedef-name
16972 simple-template-id [in c++0x]
16974 enum-name:
16975 identifier
16977 typedef-name:
16978 identifier
16980 Concepts:
16982 type-name:
16983 concept-name
16984 partial-concept-id
16986 concept-name:
16987 identifier
16989 Returns a TYPE_DECL for the type. */
16991 static tree
16993 {
16995 }
16997 /* See above. */
16998 static tree
17000 {
17001 tree type_decl;
17003 /* We can't know yet whether it is a class-name or not. */
17005 /* Try a class-name. */
17007 typename_keyword_p,
17009 none_type,
17013 /* If it's not a class-name, keep looking. */
17015 {
17017 /* It must be a typedef-name or an enum-name. */
17021 /* It is either a simple-template-id representing an
17022 instantiation of an alias template... */
17026 none_type,
17028 /* Note that this must be an instantiation of an alias template
17029 because [temp.names]/6 says:
17031 A template-id that names an alias template specialization
17032 is a type-name.
17034 Whereas [temp.names]/7 says:
17036 A simple-template-id that names a class template
17037 specialization is a class-name.
17039 With concepts, this could also be a partial-concept-id that
17040 declares a non-type template parameter. */
17047 else
17051 /* ... Or a typedef-name or an enum-name. */
17053 }
17056 }
17058 /* Check if DECL and ARGS can form a constrained-type-specifier.
17059 If ARGS is non-null, we try to form a concept check of the
17060 form DECL<?, ARGS> where ? is a wildcard that matches any
17061 kind of template argument. If ARGS is NULL, then we try to
17062 form a concept check of the form DECL<?>. */
17064 static tree
17067 {
17070 /* If we a constrained-type-specifier cannot be deduced. */
17074 /* A constrained type specifier can only be found in an
17075 overload set or as a reference to a template declaration.
17077 FIXME: This might be masking a bug. It's possible that
17078 that the deduction below is causing template specializations
17079 to be formed with the wildcard as an argument. */
17083 /* Try to build a call expression that evaluates the
17084 concept. This can fail if the overload set refers
17085 only to non-templates. */
17091 /* Deduce the checked constraint and the prototype parameter.
17093 FIXME: In certain cases, failure to deduce should be a
17094 diagnosable error. */
17095 tree conc;
17096 tree proto;
17100 /* In template parameter scope, this results in a constrained
17101 parameter. Return a descriptor of that parm. */
17105 /* In a parameter-declaration-clause, constrained-type
17106 specifiers result in invented template parameters. */
17108 {
17111 }
17112 else
17113 {
17114 /* Otherwise, we're in a context where the constrained
17115 type name is deduced and the constraint applies
17116 after deduction. */
17118 }
17121 }
17123 /* If DECL refers to a concept, return a TYPE_DECL representing
17124 the result of using the constrained type specifier in the
17125 current context. DECL refers to a concept if
17127 - it is an overload set containing a function concept taking a single
17128 type argument, or
17130 - it is a variable concept taking a single type argument. */
17132 static tree
17134 {
17140 else
17142 }
17144 /* Check if DECL and ARGS form a partial-concept-id. If so,
17145 assign ID to the resulting constrained placeholder.
17147 Returns true if the partial-concept-id designates a placeholder
17148 and false otherwise. Note that *id is set to NULL_TREE in
17149 this case. */
17151 static tree
17153 {
17155 }
17157 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17158 or a concept-name.
17160 enum-name:
17161 identifier
17163 typedef-name:
17164 identifier
17166 concept-name:
17167 identifier
17169 Returns a TYPE_DECL for the type. */
17171 static tree
17173 {
17174 tree type_decl;
17175 tree identifier;
17182 /* Look up the type-name. */
17187 /* If we found an overload set, then it may refer to a concept-name. */
17193 {
17194 /* See if this is an Objective-C type. */
17199 }
17201 /* Issue an error if we did not find a type-name. */
17203 /* In Objective-C, we have the complication that class names are
17204 normally type names and start declarations (eg, the
17205 "NSObject" in "NSObject *object;"), but can be used in an
17206 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17207 is an expression. So, a classname followed by a dot is not a
17208 valid type-name. */
17211 {
17216 }
17217 /* Remember that the name was used in the definition of the
17218 current class so that we can check later to see if the
17219 meaning would have been different after the class was
17220 entirely defined. */
17226 }
17228 /* Parse an elaborated-type-specifier. Note that the grammar given
17229 here incorporates the resolution to DR68.
17231 elaborated-type-specifier:
17232 class-key :: [opt] nested-name-specifier [opt] identifier
17233 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17234 enum-key :: [opt] nested-name-specifier [opt] identifier
17235 typename :: [opt] nested-name-specifier identifier
17236 typename :: [opt] nested-name-specifier template [opt]
17237 template-id
17239 GNU extension:
17241 elaborated-type-specifier:
17242 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17243 class-key attributes :: [opt] nested-name-specifier [opt]
17244 template [opt] template-id
17245 enum attributes :: [opt] nested-name-specifier [opt] identifier
17247 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17248 declared `friend'. If IS_DECLARATION is TRUE, then this
17249 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17250 something is being declared.
17252 Returns the TYPE specified. */
17254 static tree
17258 {
17260 tree identifier;
17263 tree globalscope;
17266 /* See if we're looking at the `enum' keyword. */
17268 {
17269 /* Consume the `enum' token. */
17271 /* Remember that it's an enumeration type. */
17273 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17274 enums) is used here. */
17278 {
17285 /* Consume the `struct' or `class' and parse it anyway. */
17287 }
17288 /* Parse the attributes. */
17290 }
17291 /* Or, it might be `typename'. */
17293 RID_TYPENAME))
17294 {
17295 /* Consume the `typename' token. */
17297 /* Remember that it's a `typename' type. */
17299 }
17300 /* Otherwise it must be a class-key. */
17301 else
17302 {
17306 /* Parse the attributes. */
17308 }
17310 /* Look for the `::' operator. */
17313 /* Look for the nested-name-specifier. */
17314 tree nested_name_specifier;
17316 {
17317 nested_name_specifier
17322 is_declaration);
17325 }
17326 else
17327 /* Even though `typename' is not present, the proposed resolution
17328 to Core Issue 180 says that in `class A<T>::B', `B' should be
17329 considered a type-name, even if `A<T>' is dependent. */
17330 nested_name_specifier
17335 is_declaration);
17336 /* For everything but enumeration types, consider a template-id.
17337 For an enumeration type, consider only a plain identifier. */
17339 {
17341 tree decl;
17343 /* Allow the `template' keyword. */
17345 /* If we didn't see `template', we don't know if there's a
17346 template-id or not. */
17349 /* Parse the template-id. */
17353 tag_type,
17354 is_declaration);
17355 /* If we didn't find a template-id, look for an ordinary
17356 identifier. */
17358 ;
17359 /* We can get here when cp_parser_template_id, called by
17360 cp_parser_class_name with tag_type == none_type, succeeds
17361 and caches a BASELINK. Then, when called again here,
17362 instead of failing and returning an error_mark_node
17363 returns it (see template/typename17.C in C++11).
17364 ??? Could we diagnose this earlier? */
17366 {
17369 }
17370 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17371 in effect, then we must assume that, upon instantiation, the
17372 template will correspond to a class. */
17376 typename_type,
17378 /* If the `typename' keyword is in effect and DECL is not a type
17379 decl, then type is non existent. */
17381 ;
17383 {
17387 /* If the next token is a semicolon, this must be a specialization,
17388 instantiation, or friend declaration. Check the scope while we
17389 still know whether or not we had a nested-name-specifier. */
17394 }
17397 }
17400 {
17405 {
17408 }
17410 /* For a `typename', we needn't call xref_tag. */
17416 /* Template parameter lists apply only if we are not within a
17417 function parameter list. */
17418 bool template_parm_lists_apply
17427 /* Look up a qualified name in the usual way. */
17429 {
17430 tree decl;
17431 tree ambiguous_decls;
17434 tag_type,
17441 /* If the lookup was ambiguous, an error will already have been
17442 issued. */
17446 /* If we are parsing friend declaration, DECL may be a
17447 TEMPLATE_DECL tree node here. However, we need to check
17448 whether this TEMPLATE_DECL results in valid code. Consider
17449 the following example:
17451 namespace N {
17452 template <class T> class C {};
17453 }
17454 class X {
17455 template <class T> friend class N::C; // #1, valid code
17456 };
17457 template <class T> class Y {
17458 friend class N::C; // #2, invalid code
17459 };
17461 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17462 name lookup of `N::C'. We see that friend declaration must
17463 be template for the code to be valid. Note that
17464 processing_template_decl does not work here since it is
17465 always 1 for the above two cases. */
17467 decl = (cp_parser_maybe_treat_template_as_class
17472 {
17474 identifier,
17477 }
17480 {
17484 allow_template);
17488 }
17490 /* Forward declarations of nested types, such as
17492 class C1::C2;
17493 class C1::C2::C3;
17495 are invalid unless all components preceding the final '::'
17496 are complete. If all enclosing types are complete, these
17497 declarations become merely pointless.
17499 Invalid forward declarations of nested types are errors
17500 caught elsewhere in parsing. Those that are pointless arrive
17501 here. */
17508 }
17509 else
17510 {
17511 /* An elaborated-type-specifier sometimes introduces a new type and
17512 sometimes names an existing type. Normally, the rule is that it
17513 introduces a new type only if there is not an existing type of
17514 the same name already in scope. For example, given:
17516 struct S {};
17517 void f() { struct S s; }
17519 the `struct S' in the body of `f' is the same `struct S' as in
17520 the global scope; the existing definition is used. However, if
17521 there were no global declaration, this would introduce a new
17522 local class named `S'.
17524 An exception to this rule applies to the following code:
17526 namespace N { struct S; }
17528 Here, the elaborated-type-specifier names a new type
17529 unconditionally; even if there is already an `S' in the
17530 containing scope this declaration names a new type.
17531 This exception only applies if the elaborated-type-specifier
17532 forms the complete declaration:
17534 [class.name]
17536 A declaration consisting solely of `class-key identifier ;' is
17537 either a redeclaration of the name in the current scope or a
17538 forward declaration of the identifier as a class name. It
17539 introduces the name into the current scope.
17541 We are in this situation precisely when the next token is a `;'.
17543 An exception to the exception is that a `friend' declaration does
17544 *not* name a new type; i.e., given:
17546 struct S { friend struct T; };
17548 `T' is not a new type in the scope of `S'.
17550 Also, `new struct S' or `sizeof (struct S)' never results in the
17551 definition of a new type; a new type can only be declared in a
17552 declaration context. */
17554 tag_scope ts;
17558 /* Friends have special name lookup rules. */
17562 CPP_SEMICOLON))
17563 /* This is a `class-key identifier ;' */
17565 else
17568 template_p =
17569 (template_parm_lists_apply
17572 /* An unqualified name was used to reference this type, so
17573 there were no qualifying templates. */
17581 }
17582 }
17587 /* Allow attributes on forward declarations of classes. */
17589 {
17599 else
17602 }
17605 {
17606 /* Indicate whether this class was declared as a `class' or as a
17607 `struct'. */
17611 }
17613 /* A "<" cannot follow an elaborated type specifier. If that
17614 happens, the user was probably trying to form a template-id. */
17619 }
17621 /* Parse an enum-specifier.
17623 enum-specifier:
17624 enum-head { enumerator-list [opt] }
17625 enum-head { enumerator-list , } [C++0x]
17627 enum-head:
17628 enum-key identifier [opt] enum-base [opt]
17629 enum-key nested-name-specifier identifier enum-base [opt]
17631 enum-key:
17632 enum
17633 enum class [C++0x]
17634 enum struct [C++0x]
17636 enum-base: [C++0x]
17637 : type-specifier-seq
17639 opaque-enum-specifier:
17640 enum-key identifier enum-base [opt] ;
17642 GNU Extensions:
17643 enum-key attributes[opt] identifier [opt] enum-base [opt]
17644 { enumerator-list [opt] }attributes[opt]
17645 enum-key attributes[opt] identifier [opt] enum-base [opt]
17646 { enumerator-list, }attributes[opt] [C++0x]
17648 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17649 if the token stream isn't an enum-specifier after all. */
17651 static tree
17653 {
17654 tree identifier;
17656 tree prev_scope;
17658 tree attributes;
17671 /* Parse tentatively so that we can back up if we don't find a
17672 enum-specifier. */
17675 /* Caller guarantees that the current token is 'enum', an identifier
17676 possibly follows, and the token after that is an opening brace.
17677 If we don't have an identifier, fabricate an anonymous name for
17678 the enumeration being defined. */
17681 /* Parse the "class" or "struct", which indicates a scoped
17682 enumeration type in C++0x. */
17685 {
17689 /* Consume the `struct' or `class' token. */
17693 }
17697 /* Clear the qualification. */
17702 /* Figure out in what scope the declaration is being placed. */
17708 nested_name_specifier
17716 {
17717 tree name;
17721 enum_type,
17726 input_location);
17728 {
17731 {
17732 /* Are template enums allowed in ISO? */
17736 /* ignore a typename reference, for it will be solved by name
17737 in start_enum. */
17739 }
17740 }
17743 else
17744 {
17749 }
17750 }
17751 else
17752 {
17755 else
17756 {
17762 }
17763 }
17766 /* Check for the `:' that denotes a specified underlying type in C++0x.
17767 Note that a ':' could also indicate a bitfield width, however. */
17769 {
17770 cp_decl_specifier_seq type_specifiers;
17772 /* Consume the `:'. */
17775 /* Parse the type-specifier-seq. */
17780 /* At this point this is surely not elaborated type specifier. */
17789 /* If that didn't work, stop. */
17791 {
17797 }
17798 }
17800 /* Look for the `{' but don't consume it yet. */
17802 {
17804 {
17807 {
17810 }
17811 }
17812 /* An opaque-enum-specifier must have a ';' here. */
17815 {
17818 {
17821 }
17822 }
17823 }
17829 {
17831 {
17835 }
17837 {
17839 }
17840 }
17842 /* Issue an error message if type-definitions are forbidden here. */
17845 else
17846 /* Create the new type. We do this before consuming the opening
17847 brace so the enum will be recorded as being on the line of its
17848 tag (or the 'enum' keyword, if there is no tag). */
17852 /* If the next token is not '{' it is an opaque-enum-specifier or an
17853 elaborated-type-specifier. */
17855 {
17859 {
17860 /* The following catches invalid code such as:
17861 enum class S<int>::E { A, B, C }; */
17869 {
17873 nested_name_specifier);
17875 }
17878 {
17880 "%qT for enum declaration does not name a class "
17883 }
17884 /* If that scope does not contain the scope in which the
17885 class was originally declared, the program is invalid. */
17887 nested_name_specifier))
17888 {
17891 "declaration of %qD in namespace %qD which does not "
17894 else
17896 "declaration of %qD in %qD which does not "
17900 }
17901 /* If that scope is the scope where the declaration is being placed
17902 the program is invalid. */
17906 {
17910 }
17911 }
17916 /* Consume the opening brace. */
17923 {
17927 }
17928 else
17929 {
17935 }
17939 /* If the next token is not '}', then there are some enumerators. */
17941 {
17945 }
17946 else
17949 /* Consume the final '}'. */
17955 }
17956 else
17957 {
17958 /* If a ';' follows, then it is an opaque-enum-specifier
17959 and additional restrictions apply. */
17961 {
17968 }
17969 }
17971 /* Look for trailing attributes to apply to this enumeration, and
17972 apply them if appropriate. */
17974 {
17977 trailing_attr,
17979 }
17981 /* Finish up the enumeration. */
17983 {
17988 }
17991 {
17993 {
17996 }
17998 {
18000 }
18001 }
18002 out:
18005 }
18007 /* Parse an enumerator-list. The enumerators all have the indicated
18008 TYPE.
18010 enumerator-list:
18011 enumerator-definition
18012 enumerator-list , enumerator-definition */
18014 static void
18016 {
18018 {
18019 /* Parse an enumerator-definition. */
18022 /* If the next token is not a ',', we've reached the end of
18023 the list. */
18026 /* Otherwise, consume the `,' and keep going. */
18028 /* If the next token is a `}', there is a trailing comma. */
18030 {
18035 }
18036 }
18037 }
18039 /* Parse an enumerator-definition. The enumerator has the indicated
18040 TYPE.
18042 enumerator-definition:
18043 enumerator
18044 enumerator = constant-expression
18046 enumerator:
18047 identifier
18049 GNU Extensions:
18051 enumerator-definition:
18052 enumerator attributes [opt]
18053 enumerator attributes [opt] = constant-expression */
18055 static void
18057 {
18058 tree identifier;
18059 tree value;
18060 location_t loc;
18062 /* Save the input location because we are interested in the location
18063 of the identifier and not the location of the explicit value. */
18066 /* Look for the identifier. */
18071 /* Parse any specified attributes. */
18074 /* If the next token is an '=', then there is an explicit value. */
18076 {
18077 /* Consume the `=' token. */
18079 /* Parse the value. */
18081 }
18082 else
18085 /* If we are processing a template, make sure the initializer of the
18086 enumerator doesn't contain any bare template parameter pack. */
18090 /* Create the enumerator. */
18092 }
18094 /* Parse a namespace-name.
18096 namespace-name:
18097 original-namespace-name
18098 namespace-alias
18100 Returns the NAMESPACE_DECL for the namespace. */
18102 static tree
18104 {
18105 tree identifier;
18106 tree namespace_decl;
18110 /* Get the name of the namespace. */
18115 /* Look up the identifier in the currently active scope. Look only
18116 for namespaces, due to:
18118 [basic.lookup.udir]
18120 When looking up a namespace-name in a using-directive or alias
18121 definition, only namespace names are considered.
18123 And:
18125 [basic.lookup.qual]
18127 During the lookup of a name preceding the :: scope resolution
18128 operator, object, function, and enumerator names are ignored.
18130 (Note that cp_parser_qualifying_entity only calls this
18131 function if the token after the name is the scope resolution
18132 operator.) */
18134 none_type,
18140 /* If it's not a namespace, issue an error. */
18143 {
18148 }
18151 }
18153 /* Parse a namespace-definition.
18155 namespace-definition:
18156 named-namespace-definition
18157 unnamed-namespace-definition
18159 named-namespace-definition:
18160 original-namespace-definition
18161 extension-namespace-definition
18163 original-namespace-definition:
18164 namespace identifier { namespace-body }
18166 extension-namespace-definition:
18167 namespace original-namespace-name { namespace-body }
18169 unnamed-namespace-definition:
18170 namespace { namespace-body } */
18172 static void
18174 {
18184 {
18188 }
18189 else
18192 /* Look for the `namespace' keyword. */
18195 /* Parse any specified attributes before the identifier. */
18198 /* Get the name of the namespace. We do not attempt to distinguish
18199 between an original-namespace-definition and an
18200 extension-namespace-definition at this point. The semantic
18201 analysis routines are responsible for that. */
18204 else
18207 /* Parse any specified attributes after the identifier. */
18210 {
18213 else
18215 }
18217 /* Start the namespace. */
18220 /* Parse any nested namespace definition. */
18222 {
18227 "nested namespace definitions only available with "
18232 {
18236 else
18237 {
18240 }
18243 }
18244 }
18246 /* Look for the `{' to validate starting the namespace. */
18249 /* "inline namespace" is equivalent to a stub namespace definition
18250 followed by a strong using directive. */
18252 {
18254 /* Set up namespace association. */
18258 /* Import the contents of the inline namespace. */
18262 }
18268 /* Parse the body of the namespace. */
18274 /* Finish the nested namespace definitions. */
18278 /* Finish the namespace. */
18281 /* Look for the final `}'. */
18283 }
18285 /* Parse a namespace-body.
18287 namespace-body:
18288 declaration-seq [opt] */
18290 static void
18292 {
18294 }
18296 /* Parse a namespace-alias-definition.
18298 namespace-alias-definition:
18299 namespace identifier = qualified-namespace-specifier ; */
18301 static void
18303 {
18304 tree identifier;
18305 tree namespace_specifier;
18309 /* Look for the `namespace' keyword. */
18311 /* Look for the identifier. */
18315 /* Look for the `=' token. */
18318 {
18320 /* Skip the definition. */
18325 }
18327 /* Look for the qualified-namespace-specifier. */
18328 namespace_specifier
18330 /* Look for the `;' token. */
18333 /* Register the alias in the symbol table. */
18335 }
18337 /* Parse a qualified-namespace-specifier.
18339 qualified-namespace-specifier:
18340 :: [opt] nested-name-specifier [opt] namespace-name
18342 Returns a NAMESPACE_DECL corresponding to the specified
18343 namespace. */
18345 static tree
18347 {
18348 /* Look for the optional `::'. */
18352 /* Look for the optional nested-name-specifier. */
18360 }
18362 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18363 access declaration.
18365 using-declaration:
18366 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18367 using :: unqualified-id ;
18369 access-declaration:
18370 qualified-id ;
18372 */
18374 static bool
18377 {
18381 tree decl;
18382 tree identifier;
18383 tree qscope;
18388 {
18391 }
18392 else
18393 {
18394 /* Look for the `using' keyword. */
18397 again:
18398 /* Peek at the next token. */
18400 /* See if it's `typename'. */
18402 {
18403 /* Remember that we've seen it. */
18405 /* Consume the `typename' token. */
18407 }
18408 }
18410 /* Look for the optional global scope qualification. */
18411 global_scope_p
18416 /* If we saw `typename', or didn't see `::', then there must be a
18417 nested-name-specifier present. */
18419 {
18425 {
18428 }
18429 }
18430 /* Otherwise, we could be in either of the two productions. In that
18431 case, treat the nested-name-specifier as optional. */
18432 else
18444 /* Something has already gone wrong; there's no need to parse
18445 further. Since an error has occurred, the return value of
18446 cp_parser_parse_definitely will be false, as required. */
18450 /* Parse the unqualified-id. */
18458 {
18463 }
18465 {
18470 "pack expansion in using-declaration only available "
18473 }
18475 /* The function we call to handle a using-declaration is different
18476 depending on what scope we are in. */
18478 ;
18481 /* [namespace.udecl]
18483 A using declaration shall not name a template-id. */
18486 else
18487 {
18489 {
18490 /* Create the USING_DECL. */
18497 {
18500 }
18501 else
18502 /* Add it to the list of members in this class. */
18504 }
18505 else
18506 {
18508 identifier,
18515 {
18518 }
18521 else
18523 }
18524 }
18528 {
18532 "comma-separated list in using-declaration only available "
18535 }
18537 /* Look for the final `;'. */
18542 "access declarations are deprecated "
18543 "in favour of using-declarations; "
18547 }
18549 /* Parse an alias-declaration.
18551 alias-declaration:
18552 using identifier attribute-specifier-seq [opt] = type-id */
18554 static tree
18556 {
18558 location_t id_location;
18560 cp_decl_specifier_seq decl_specs;
18564 /* Look for the `using' keyword. */
18565 cp_token *using_token
18587 /* Now we are going to parse the type-id of the declaration. */
18589 /*
18590 [dcl.type]/3 says:
18592 "A type-specifier-seq shall not define a class or enumeration
18593 unless it appears in the type-id of an alias-declaration (7.1.3) that
18594 is not the declaration of a template-declaration."
18596 In other words, if we currently are in an alias template, the
18597 type-id should not define a type.
18599 So let's set parser->type_definition_forbidden_message in that
18600 case; cp_parser_check_type_definition (called by
18601 cp_parser_class_specifier) will then emit an error if a type is
18602 defined in the type-id. */
18604 {
18608 }
18612 /* Restore the error message if need be. */
18618 {
18621 }
18623 /* A typedef-name can also be introduced by an alias-declaration. The
18624 identifier following the using keyword becomes a typedef-name. It has
18625 the same semantics as if it were introduced by the typedef
18626 specifier. In particular, it does not define a new type and it shall
18627 not appear in the type-id. */
18632 {
18635 ds_attribute,
18636 attrs_token);
18637 }
18639 ds_typedef,
18640 using_token);
18642 ds_alias,
18643 using_token);
18652 else
18658 // Attach constraints to the alias declaration.
18660 {
18664 }
18671 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18672 added into the symbol table; otherwise, return the TYPE_DECL. */
18676 {
18680 }
18683 }
18685 /* Parse a using-directive.
18687 using-directive:
18688 using namespace :: [opt] nested-name-specifier [opt]
18689 namespace-name ; */
18691 static void
18693 {
18694 tree namespace_decl;
18695 tree attribs;
18697 /* Look for the `using' keyword. */
18699 /* And the `namespace' keyword. */
18701 /* Look for the optional `::' operator. */
18703 /* And the optional nested-name-specifier. */
18709 /* Get the namespace being used. */
18711 /* And any specified attributes. */
18713 /* Update the symbol table. */
18715 /* Look for the final `;'. */
18717 }
18719 /* Parse an asm-definition.
18721 asm-definition:
18722 asm ( string-literal ) ;
18724 GNU Extension:
18726 asm-definition:
18727 asm volatile [opt] ( string-literal ) ;
18728 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18729 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18730 : asm-operand-list [opt] ) ;
18731 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18732 : asm-operand-list [opt]
18733 : asm-clobber-list [opt] ) ;
18734 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18735 : asm-clobber-list [opt]
18736 : asm-goto-list ) ; */
18738 static void
18740 {
18741 tree string;
18746 tree asm_stmt;
18754 /* Look for the `asm' keyword. */
18759 {
18762 }
18764 /* See if the next token is `volatile'. */
18767 {
18768 /* Remember that we saw the `volatile' keyword. */
18770 /* Consume the token. */
18772 }
18776 {
18777 /* Remember that we saw the `goto' keyword. */
18779 /* Consume the token. */
18781 }
18782 /* Look for the opening `('. */
18785 /* Look for the string. */
18788 {
18792 }
18794 /* If we're allowing GNU extensions, check for the extended assembly
18795 syntax. Unfortunately, the `:' tokens need not be separated by
18796 a space in C, and so, for compatibility, we tolerate that here
18797 too. Doing that means that we have to treat the `::' operator as
18798 two `:' tokens. */
18803 {
18808 /* The extended syntax was used. */
18811 /* Look for outputs. */
18813 {
18814 /* Consume the `:'. */
18816 /* Parse the output-operands. */
18818 CPP_COLON)
18820 CPP_SCOPE)
18822 CPP_CLOSE_PAREN)
18824 {
18828 }
18829 }
18830 /* If the next token is `::', there are no outputs, and the
18831 next token is the beginning of the inputs. */
18833 /* The inputs are coming next. */
18836 /* Look for inputs. */
18839 {
18840 /* Consume the `:' or `::'. */
18842 /* Parse the output-operands. */
18844 CPP_COLON)
18846 CPP_SCOPE)
18848 CPP_CLOSE_PAREN))
18849 {
18853 }
18854 }
18856 /* The clobbers are coming next. */
18859 /* Look for clobbers. */
18862 {
18864 /* Consume the `:' or `::'. */
18866 /* Parse the clobbers. */
18868 CPP_COLON)
18870 CPP_CLOSE_PAREN))
18872 }
18875 /* The labels are coming next. */
18878 /* Look for labels. */
18881 {
18883 /* Consume the `:' or `::'. */
18885 /* Parse the labels. */
18887 }
18891 }
18895 /* Look for the closing `)'. */
18903 {
18904 /* Create the ASM_EXPR. */
18906 {
18909 /* If the extended syntax was not used, mark the ASM_EXPR. */
18911 {
18917 }
18918 }
18919 else
18921 }
18922 }
18924 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18925 type that comes from the decl-specifier-seq. */
18927 static tree
18929 {
18932 {
18945 }
18948 }
18950 /* Declarators [gram.dcl.decl] */
18952 /* Parse an init-declarator.
18954 init-declarator:
18955 declarator initializer [opt]
18957 GNU Extension:
18959 init-declarator:
18960 declarator asm-specification [opt] attributes [opt] initializer [opt]
18962 function-definition:
18963 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18964 function-body
18965 decl-specifier-seq [opt] declarator function-try-block
18967 GNU Extension:
18969 function-definition:
18970 __extension__ function-definition
18972 TM Extension:
18974 function-definition:
18975 decl-specifier-seq [opt] declarator function-transaction-block
18977 The DECL_SPECIFIERS apply to this declarator. Returns a
18978 representation of the entity declared. If MEMBER_P is TRUE, then
18979 this declarator appears in a class scope. The new DECL created by
18980 this declarator is returned.
18982 The CHECKS are access checks that should be performed once we know
18983 what entity is being declared (and, therefore, what classes have
18984 befriended it).
18986 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18987 for a function-definition here as well. If the declarator is a
18988 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18989 be TRUE upon return. By that point, the function-definition will
18990 have been completely parsed.
18992 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18993 is FALSE.
18995 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18996 parsed declaration if it is an uninitialized single declarator not followed
18997 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18998 if present, will not be consumed. If returned, this declarator will be
18999 created with SD_INITIALIZED but will not call cp_finish_decl.
19001 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19002 and there is an initializer, the pointed location_t is set to the
19003 location of the '=' or `(', or '{' in C++11 token introducing the
19004 initializer. */
19006 static tree
19017 {
19021 tree prefix_attributes;
19023 tree asm_specification;
19024 tree initializer;
19026 tree scope;
19028 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19029 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19030 "(...)". */
19041 /* Gather the attributes that were provided with the
19042 decl-specifiers. */
19045 /* Assume that this is not the declarator for a function
19046 definition. */
19050 /* Default arguments are only permitted for function parameters. */
19054 /* Defer access checks while parsing the declarator; we cannot know
19055 what names are accessible until we know what is being
19056 declared. */
19061 /* Parse the declarator. */
19062 declarator
19067 /* Gather up the deferred checks. */
19072 /* If the DECLARATOR was erroneous, there's no need to go
19073 further. */
19077 /* Check that the number of template-parameter-lists is OK. */
19087 /* Figure out what scope the entity declared by the DECLARATOR is
19088 located in. `grokdeclarator' sometimes changes the scope, so
19089 we compute it now. */
19092 /* Perform any lookups in the declared type which were thought to be
19093 dependent, but are not in the scope of the declarator. */
19094 decl_specifiers->type
19097 /* If we're allowing GNU extensions, look for an
19098 asm-specification. */
19100 {
19101 /* Look for an asm-specification. */
19104 }
19105 else
19108 /* Look for attributes. */
19112 /* Peek at the next token. */
19118 {
19119 /* Handle C++17 deduction guides. */
19123 {
19131 {
19135 }
19136 }
19138 /* Check to see if the token indicates the start of a
19139 function-definition. */
19141 {
19143 {
19144 /* If a function-definition should not appear here, issue an
19145 error message. */
19149 }
19151 location_t func_brace_location
19154 /* Neither attributes nor an asm-specification are allowed
19155 on a function-definition. */
19158 "an asm-specification is not allowed "
19162 "attributes are not allowed "
19164 /* This is a function-definition. */
19167 /* Parse the function definition. */
19170 decl_specifiers,
19171 declarator,
19172 prefix_attributes);
19173 else
19174 decl =
19175 (cp_parser_function_definition_from_specifiers_and_declarator
19179 {
19180 /* This is where the prologue starts... */
19183 }
19186 }
19187 }
19189 {
19190 /* A non-template declaration involving a function parameter list
19191 containing an implicit template parameter will be made into a
19192 template. If the resulting declaration is not going to be an
19193 actual function then finish the template scope here to prevent it.
19194 An error message will be issued once we have a decl to talk about.
19196 FIXME probably we should do type deduction rather than create an
19197 implicit template, but the standard currently doesn't allow it. */
19200 }
19202 /* [dcl.dcl]
19204 Only in function declarations for constructors, destructors, type
19205 conversions, and deduction guides can the decl-specifier-seq be omitted.
19207 We explicitly postpone this check past the point where we handle
19208 function-definitions because we tolerate function-definitions
19209 that are missing their return types in some modes. */
19211 {
19215 }
19217 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19221 {
19232 {
19238 }
19239 }
19240 else
19241 {
19242 /* If the init-declarator isn't initialized and isn't followed by a
19243 `,' or `;', it's not a valid init-declarator. */
19246 {
19249 else
19250 {
19254 }
19255 }
19258 }
19260 /* Because start_decl has side-effects, we should only call it if we
19261 know we're going ahead. By this point, we know that we cannot
19262 possibly be looking at any other construct. */
19265 /* Enter the newly declared entry in the symbol table. If we're
19266 processing a declaration in a class-specifier, we wait until
19267 after processing the initializer. */
19269 {
19277 /* Adjust location of decl if declarator->id_loc is more appropriate:
19278 set, and decl wasn't merged with another decl, in which case its
19279 location would be different from input_location, and more accurate. */
19284 }
19286 /* Enter the SCOPE. That way unqualified names appearing in the
19287 initializer will be looked up in SCOPE. */
19290 /* Perform deferred access control checks, now that we know in which
19291 SCOPE the declared entity resides. */
19293 {
19296 /* If the entity being declared is a function, pretend that we
19297 are in its scope. If it is a `friend', it may have access to
19298 things that would not otherwise be accessible. */
19300 {
19303 }
19305 /* Perform access checks for template parameters. */
19308 /* Perform the access control checks for the declarator and the
19309 decl-specifiers. */
19312 /* Restore the saved value. */
19315 }
19317 /* Parse the initializer. */
19322 {
19324 {
19327 else
19328 {
19329 /* If the declaration was erroneous, we don't really
19330 know what the user intended, so just silently
19331 consume the initializer. */
19338 }
19339 }
19340 else
19341 {
19342 /* We want to record the extra mangling scope for in-class
19343 initializers of class members and initializers of static data
19344 member templates. The former involves deferring
19345 parsing of the initializer until end of class as with default
19346 arguments. So right here we only handle the latter. */
19356 }
19357 }
19359 /* The old parser allows attributes to appear after a parenthesized
19360 initializer. Mark Mitchell proposed removing this functionality
19361 on the GCC mailing lists on 2002-08-13. This parser accepts the
19362 attributes -- but ignores them. */
19369 /* And now complain about a non-function implicit template. */
19374 /* For an in-class declaration, use `grokfield' to create the
19375 declaration. */
19377 {
19379 {
19382 }
19391 }
19393 /* Finish processing the declaration. But, skip member
19394 declarations. */
19396 {
19399 asm_specification,
19400 /* If the initializer is in parentheses, then this is
19401 a direct-initialization, which means that an
19402 `explicit' constructor is OK. Otherwise, an
19403 `explicit' constructor cannot be used. */
19406 }
19409 /* Core issue #226 (C++0x only): A default template-argument
19410 shall not be specified in a friend class template
19411 declaration. */
19420 {
19423 else
19425 }
19432 }
19434 /* Parse a declarator.
19436 declarator:
19437 direct-declarator
19438 ptr-operator declarator
19440 abstract-declarator:
19441 ptr-operator abstract-declarator [opt]
19442 direct-abstract-declarator
19444 GNU Extensions:
19446 declarator:
19447 attributes [opt] direct-declarator
19448 attributes [opt] ptr-operator declarator
19450 abstract-declarator:
19451 attributes [opt] ptr-operator abstract-declarator [opt]
19452 attributes [opt] direct-abstract-declarator
19454 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19455 detect constructors, destructors, deduction guides, or conversion operators.
19456 It is set to -1 if the declarator is a name, and +1 if it is a
19457 function. Otherwise it is set to zero. Usually you just want to
19458 test for >0, but internally the negative value is used.
19460 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19461 a decl-specifier-seq unless it declares a constructor, destructor,
19462 or conversion. It might seem that we could check this condition in
19463 semantic analysis, rather than parsing, but that makes it difficult
19464 to handle something like `f()'. We want to notice that there are
19465 no decl-specifiers, and therefore realize that this is an
19466 expression, not a declaration.)
19468 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19469 the declarator is a direct-declarator of the form "(...)".
19471 MEMBER_P is true iff this declarator is a member-declarator.
19473 FRIEND_P is true iff this declarator is a friend. */
19477 cp_parser_declarator_kind dcl_kind,
19481 {
19484 cp_cv_quals cv_quals;
19485 tree class_type;
19488 /* Assume this is not a constructor, destructor, or type-conversion
19489 operator. */
19496 /* Check for the ptr-operator production. */
19498 /* Parse the ptr-operator. */
19504 /* If that worked, then we have a ptr-operator. */
19506 {
19507 /* If a ptr-operator was found, then this declarator was not
19508 parenthesized. */
19511 /* The dependent declarator is optional if we are parsing an
19512 abstract-declarator. */
19516 /* Parse the dependent declarator. */
19521 friend_p);
19523 /* If we are parsing an abstract-declarator, we must handle the
19524 case where the dependent declarator is absent. */
19529 declarator = cp_parser_make_indirect_declarator
19531 }
19532 /* Everything else is a direct-declarator. */
19533 else
19534 {
19537 CPP_OPEN_PAREN);
19539 ctor_dtor_or_conv_p,
19541 }
19546 }
19548 /* Parse a direct-declarator or direct-abstract-declarator.
19550 direct-declarator:
19551 declarator-id
19552 direct-declarator ( parameter-declaration-clause )
19553 cv-qualifier-seq [opt]
19554 ref-qualifier [opt]
19555 exception-specification [opt]
19556 direct-declarator [ constant-expression [opt] ]
19557 ( declarator )
19559 direct-abstract-declarator:
19560 direct-abstract-declarator [opt]
19561 ( parameter-declaration-clause )
19562 cv-qualifier-seq [opt]
19563 ref-qualifier [opt]
19564 exception-specification [opt]
19565 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19566 ( abstract-declarator )
19568 Returns a representation of the declarator. DCL_KIND is
19569 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19570 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19571 we are parsing a direct-declarator. It is
19572 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19573 of ambiguity we prefer an abstract declarator, as per
19574 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19575 as for cp_parser_declarator. */
19579 cp_parser_declarator_kind dcl_kind,
19582 {
19592 {
19593 /* Peek at the next token. */
19596 {
19597 /* This is either a parameter-declaration-clause, or a
19598 parenthesized declarator. When we know we are parsing a
19599 named declarator, it must be a parenthesized declarator
19600 if FIRST is true. For instance, `(int)' is a
19601 parameter-declaration-clause, with an omitted
19602 direct-abstract-declarator. But `((*))', is a
19603 parenthesized abstract declarator. Finally, when T is a
19604 template parameter `(T)' is a
19605 parameter-declaration-clause, and not a parenthesized
19606 named declarator.
19608 We first try and parse a parameter-declaration-clause,
19609 and then try a nested declarator (if FIRST is true).
19611 It is not an error for it not to be a
19612 parameter-declaration-clause, even when FIRST is
19613 false. Consider,
19615 int i (int);
19616 int i (3);
19618 The first is the declaration of a function while the
19619 second is the definition of a variable, including its
19620 initializer.
19622 Having seen only the parenthesis, we cannot know which of
19623 these two alternatives should be selected. Even more
19624 complex are examples like:
19626 int i (int (a));
19627 int i (int (3));
19629 The former is a function-declaration; the latter is a
19630 variable initialization.
19632 Thus again, we try a parameter-declaration-clause, and if
19633 that fails, we back out and return. */
19636 {
19637 tree params;
19640 /* In a member-declarator, the only valid interpretation
19641 of a parenthesis is the start of a
19642 parameter-declaration-clause. (It is invalid to
19643 initialize a static data member with a parenthesized
19644 initializer; only the "=" form of initialization is
19645 permitted.) */
19649 /* Consume the `('. */
19652 {
19653 /* If this is going to be an abstract declarator, we're
19654 in a declarator and we can't have default args. */
19657 }
19661 /* Parse the parameter-declaration-clause. */
19664 /* Consume the `)'. */
19667 /* If all went well, parse the cv-qualifier-seq,
19668 ref-qualifier and the exception-specification. */
19670 {
19671 cp_cv_quals cv_quals;
19672 cp_virt_specifiers virt_specifiers;
19673 cp_ref_qualifier ref_qual;
19674 tree exception_specification;
19675 tree late_return;
19676 tree attrs;
19686 /* Parse the cv-qualifier-seq. */
19688 /* Parse the ref-qualifier. */
19690 /* Parse the tx-qualifier. */
19692 /* And the exception-specification. */
19693 exception_specification
19698 /* In here, we handle cases where attribute is used after
19699 the function declaration. For example:
19700 void func (int x) __attribute__((vector(..))); */
19704 {
19708 CPP_SEMICOLON)
19710 CPP_OPEN_BRACE))
19713 ;
19714 else
19716 }
19718 late_return = (cp_parser_late_return_type_opt
19722 /* Parse the virt-specifier-seq. */
19725 /* Create the function-declarator. */
19727 params,
19728 cv_quals,
19729 virt_specifiers,
19730 ref_qual,
19731 tx_qual,
19732 exception_specification,
19733 late_return,
19734 requires_clause);
19737 /* Any subsequent parameter lists are to do with
19738 return type, so are not those of the declared
19739 function. */
19741 }
19743 /* Remove the function parms from scope. */
19747 /* Repeat the main loop. */
19749 }
19751 /* If this is the first, we can try a parenthesized
19752 declarator. */
19754 {
19760 /* Consume the `('. */
19762 /* Parse the nested declarator. */
19765 declarator
19771 /* Expect a `)'. */
19778 }
19779 /* Otherwise, we must be done. */
19780 else
19782 }
19786 {
19787 /* Parse an array-declarator. */
19796 /* Consume the `['. */
19798 /* Peek at the next token. */
19800 /* If the next token is `]', then there is no
19801 constant-expression. */
19803 {
19805 bounds
19815 {
19816 /* Normally, the array bound must be an integral constant
19817 expression. However, as an extension, we allow VLAs
19818 in function scopes as long as they aren't part of a
19819 parameter declaration. */
19823 }
19826 {
19827 /* Remember this wasn't a constant-expression. */
19830 }
19831 }
19832 else
19834 /* Look for the closing `]'. */
19836 {
19839 }
19844 }
19846 {
19847 {
19848 tree qualifying_scope;
19849 tree unqualified_name;
19850 tree attrs;
19851 special_function_kind sfk;
19856 /* Parse a declarator-id */
19859 {
19862 /* If we see an ellipsis, we should be looking at a
19863 parameter pack. */
19865 {
19866 /* Consume the `...' */
19870 }
19871 }
19874 unqualified_name
19878 {
19882 {
19883 /* Check whether an error occurred. */
19886 /* We already consumed the ellipsis to mark a
19887 parameter pack, but we have no way to report it,
19888 so abort the tentative parse. We will be exiting
19889 immediately anyway. */
19891 }
19892 else
19898 && (qualifying_scope
19900 {
19903 }
19904 }
19909 {
19914 }
19920 {
19921 /* In the declaration of a member of a template class
19922 outside of the class itself, the SCOPE will sometimes
19923 be a TYPENAME_TYPE. For example, given:
19925 template <typename T>
19926 int S<T>::R::i = 3;
19928 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19929 this context, we must resolve S<T>::R to an ordinary
19930 type, rather than a typename type.
19932 The reason we normally avoid resolving TYPENAME_TYPEs
19933 is that a specialization of `S' might render
19934 `S<T>::R' not a type. However, if `S' is
19935 specialized, then this `i' will not be used, so there
19936 is no harm in resolving the types here. */
19937 tree type;
19939 /* Resolve the TYPENAME_TYPE. */
19942 /* If that failed, the declarator is invalid. */
19944 {
19947 "cannot define member of dependent typedef "
19949 else
19954 }
19956 }
19961 {
19962 tree class_type;
19967 else
19971 {
19974 {
19977 {
19981 "use %<%T::%D%> instead of %<%T::%D%> to "
19983 class_type,
19988 }
19989 else
19991 }
19992 else
19993 {
19994 /* We do not attempt to print the declarator
19995 here because we do not have enough
19996 information about its original syntactic
19997 form. */
20001 }
20002 }
20005 {
20011 for an unnamed type, even if the type
20012 got a name for linkage purposes. */
20014 /* Handle correctly (c++/19200):
20016 struct S {
20017 struct T{};
20018 friend void S(T);
20019 };
20021 and also:
20023 namespace N {
20024 void S();
20025 }
20027 struct S {
20028 friend void N::S();
20029 }; */
20030 && !(friend_p
20033 class_type))
20034 {
20037 }
20045 }
20046 }
20048 unqualified_name,
20049 sfk);
20056 }
20058 handle_declarator:;
20061 {
20062 /* Any names that appear after the declarator-id for a
20063 member are looked up in the containing scope. */
20065 {
20066 /* But declarations with qualified-ids can't appear in a
20067 function. */
20071 }
20073 }
20077 /* Default args are only allowed on function
20078 declarations. */
20080 else
20084 }
20085 /* We're done. */
20086 else
20088 }
20090 /* For an abstract declarator, we might wind up with nothing at this
20091 point. That's an error; the declarator is not optional. */
20095 /* If we entered a scope, we must exit it now. */
20103 }
20105 /* Parse a ptr-operator.
20107 ptr-operator:
20108 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20109 * cv-qualifier-seq [opt]
20110 &
20111 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20112 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20114 GNU Extension:
20116 ptr-operator:
20117 & cv-qualifier-seq [opt]
20119 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20120 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20121 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20122 filled in with the TYPE containing the member. *CV_QUALS is
20123 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20124 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20125 Note that the tree codes returned by this function have nothing
20126 to do with the types of trees that will be eventually be created
20127 to represent the pointer or reference type being parsed. They are
20128 just constants with suggestive names. */
20129 static enum tree_code
20134 {
20139 /* Assume that it's not a pointer-to-member. */
20141 /* And that there are no cv-qualifiers. */
20144 /* Peek at the next token. */
20147 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20157 {
20158 /* Consume the `*', `&' or `&&'. */
20161 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20162 `&', if we are allowing GNU extensions. (The only qualifier
20163 that can legally appear after `&' is `restrict', but that is
20164 enforced during semantic analysis. */
20172 }
20173 else
20174 {
20175 /* Try the pointer-to-member case. */
20177 /* Look for the optional `::' operator. */
20180 /* Look for the nested-name specifier. */
20187 /* If we found it, and the next token is a `*', then we are
20188 indeed looking at a pointer-to-member operator. */
20191 {
20192 /* Indicate that the `*' operator was used. */
20200 else
20201 {
20202 /* The type of which the member is a member is given by the
20203 current SCOPE. */
20205 /* The next name will not be qualified. */
20209 /* Look for optional c++11 attributes. */
20213 /* Look for the optional cv-qualifier-seq. */
20215 }
20216 }
20217 /* If that didn't work we don't have a ptr-operator. */
20220 }
20223 }
20225 /* Parse an (optional) cv-qualifier-seq.
20227 cv-qualifier-seq:
20228 cv-qualifier cv-qualifier-seq [opt]
20230 cv-qualifier:
20231 const
20232 volatile
20234 GNU Extension:
20236 cv-qualifier:
20237 __restrict__
20239 Returns a bitmask representing the cv-qualifiers. */
20241 static cp_cv_quals
20243 {
20247 {
20249 cp_cv_quals cv_qualifier;
20251 /* Peek at the next token. */
20253 /* See if it's a cv-qualifier. */
20255 {
20271 }
20277 {
20282 }
20283 else
20284 {
20287 }
20288 }
20291 }
20293 /* Parse an (optional) ref-qualifier
20295 ref-qualifier:
20296 &
20297 &&
20299 Returns cp_ref_qualifier representing ref-qualifier. */
20301 static cp_ref_qualifier
20303 {
20306 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20311 {
20316 {
20328 }
20333 {
20336 }
20337 else
20338 {
20341 }
20342 }
20345 }
20347 /* Parse an optional tx-qualifier.
20349 tx-qualifier:
20350 transaction_safe
20351 transaction_safe_dynamic */
20353 static tree
20355 {
20358 {
20363 {
20367 {
20370 {
20373 }
20374 else
20376 }
20377 }
20378 }
20380 }
20382 /* Parse an (optional) virt-specifier-seq.
20384 virt-specifier-seq:
20385 virt-specifier virt-specifier-seq [opt]
20387 virt-specifier:
20388 override
20389 final
20391 Returns a bitmask representing the virt-specifiers. */
20393 static cp_virt_specifiers
20395 {
20399 {
20401 cp_virt_specifiers virt_specifier;
20403 /* Peek at the next token. */
20405 /* See if it's a virt-specifier-qualifier. */
20409 {
20412 }
20414 {
20417 }
20419 {
20421 }
20422 else
20426 {
20431 }
20432 else
20433 {
20436 }
20437 }
20439 }
20441 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20442 is in scope even though it isn't real. */
20444 void
20446 {
20447 tree this_parm;
20450 {
20451 /* We don't clear this between NSDMIs. Is it already what we want? */
20456 }
20459 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20461 current_class_ref
20464 }
20466 /* Return true iff our current scope is a non-static data member
20467 initializer. */
20469 bool
20471 {
20472 /* We recognize NSDMI context by the context-less 'this' pointer set up
20473 by the function above. */
20479 }
20481 /* Return true iff our current scope is a default capturing generic lambda
20482 defined within a template. FIXME: This is part of a workaround (see
20483 semantics.c) to handle building lambda closure types correctly in templates
20484 which we ultimately want to defer to instantiation time. */
20486 bool
20488 {
20506 }
20508 /* Parse a late-specified return type, if any. This is not a separate
20509 non-terminal, but part of a function declarator, which looks like
20511 -> trailing-type-specifier-seq abstract-declarator(opt)
20513 Returns the type indicated by the type-id.
20515 In addition to this, parse any queued up #pragma omp declare simd
20516 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20517 #pragma acc routine clauses.
20519 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20520 function. */
20522 static tree
20525 {
20529 && declarator
20536 && declarator
20539 /* Peek at the next token. */
20541 /* A late-specified return type is indicated by an initial '->'. */
20552 {
20553 /* DR 1207: 'this' is in scope in the trailing return type. */
20555 }
20558 {
20559 /* Consume the ->. */
20563 }
20565 /* Function declarations may be followed by a trailing
20566 requires-clause. */
20570 declarator->attributes
20574 declarator->attributes
20578 declarator->attributes
20583 {
20586 }
20589 }
20591 /* Parse a declarator-id.
20593 declarator-id:
20594 id-expression
20595 :: [opt] nested-name-specifier [opt] type-name
20597 In the `id-expression' case, the value returned is as for
20598 cp_parser_id_expression if the id-expression was an unqualified-id.
20599 If the id-expression was a qualified-id, then a SCOPE_REF is
20600 returned. The first operand is the scope (either a NAMESPACE_DECL
20601 or TREE_TYPE), but the second is still just a representation of an
20602 unqualified-id. */
20604 static tree
20606 {
20607 tree id;
20608 /* The expression must be an id-expression. Assume that qualified
20609 names are the names of types so that:
20611 template <class T>
20612 int S<T>::R::i = 3;
20614 will work; we must treat `S<T>::R' as the name of a type.
20615 Similarly, assume that qualified names are templates, where
20616 required, so that:
20618 template <class T>
20619 int S<T>::R<T>::i = 3;
20621 will work, too. */
20627 optional_p);
20631 }
20633 /* Parse a type-id.
20635 type-id:
20636 type-specifier-seq abstract-declarator [opt]
20638 Returns the TYPE specified. */
20640 static tree
20643 {
20644 cp_decl_specifier_seq type_specifier_seq;
20647 /* Parse the type-specifier-seq. */
20649 is_trailing_return,
20654 /* A bare template name as a template argument is a template template
20655 argument, not a placeholder, so fail parsing it as a type argument. */
20656 {
20660 }
20664 /* There might or might not be an abstract declarator. */
20666 /* Look for the declarator. */
20667 abstract_declarator
20672 /* Check to see if there really was a declarator. */
20677 /* The concepts TS allows 'auto' as a type-id. */
20679 /* None of the valid uses of 'auto' in C++14 involve the type-id
20680 nonterminal, but it is valid in a trailing-return-type. */
20683 {
20684 /* A type-id with type 'auto' is only ok if the abstract declarator
20685 is a function declarator with a late-specified return type.
20687 A type-id with 'auto' is also valid in a trailing-return-type
20688 in a compound-requirement. */
20695 else
20696 {
20699 {
20701 auto_node);
20703 tmpl);
20704 }
20705 else
20708 }
20709 }
20712 is_template_arg);
20713 }
20715 static tree
20717 {
20719 }
20721 static tree
20723 {
20724 tree r;
20726 parser->type_definition_forbidden_message
20731 {
20734 }
20736 }
20738 static tree
20740 {
20742 }
20744 /* Parse a type-specifier-seq.
20746 type-specifier-seq:
20747 type-specifier type-specifier-seq [opt]
20749 GNU extension:
20751 type-specifier-seq:
20752 attributes type-specifier-seq [opt]
20754 If IS_DECLARATION is true, we are at the start of a "condition" or
20755 exception-declaration, so we might be followed by a declarator-id.
20757 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20758 i.e. we've just seen "->".
20760 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20762 static void
20767 {
20772 /* Clear the TYPE_SPECIFIER_SEQ. */
20775 /* In the context of a trailing return type, enum E { } is an
20776 elaborated-type-specifier followed by a function-body, not an
20777 enum-specifier. */
20781 /* Parse the type-specifiers and attributes. */
20783 {
20784 tree type_specifier;
20787 /* Check for attributes first. */
20789 {
20794 }
20796 /* record the token of the beginning of the type specifier seq,
20797 for error reporting purposes*/
20801 /* Look for the type-specifier. */
20803 flags,
20804 type_specifier_seq,
20806 NULL,
20809 {
20810 /* If the first type-specifier could not be found, this is not a
20811 type-specifier-seq at all. */
20813 {
20814 /* Set in_declarator_p to avoid skipping to the semicolon. */
20826 }
20827 /* If subsequent type-specifiers could not be found, the
20828 type-specifier-seq is complete. */
20830 }
20833 /* The standard says that a condition can be:
20835 type-specifier-seq declarator = assignment-expression
20837 However, given:
20839 struct S {};
20840 if (int S = ...)
20842 we should treat the "S" as a declarator, not as a
20843 type-specifier. The standard doesn't say that explicitly for
20844 type-specifier-seq, but it does say that for
20845 decl-specifier-seq in an ordinary declaration. Perhaps it
20846 would be clearer just to allow a decl-specifier-seq here, and
20847 then add a semantic restriction that if any decl-specifiers
20848 that are not type-specifiers appear, the program is invalid. */
20851 }
20852 }
20854 /* Return whether the function currently being declared has an associated
20855 template parameter list. */
20857 static bool
20859 {
20872 }
20874 /* Parse a parameter-declaration-clause.
20876 parameter-declaration-clause:
20877 parameter-declaration-list [opt] ... [opt]
20878 parameter-declaration-list , ...
20880 Returns a representation for the parameter declarations. A return
20881 value of NULL indicates a parameter-declaration-clause consisting
20882 only of an ellipsis. */
20884 static tree
20886 {
20887 tree parameters;
20896 parser->auto_is_implicit_function_template_parm_p
20898 }
20904 && !processing_template_parmlist
20910 /* Peek at the next token. */
20912 /* Check for trivial parameter-declaration-clauses. */
20914 {
20915 /* Consume the `...' token. */
20918 }
20920 /* There are no parameters. */
20921 {
20922 #ifndef NO_IMPLICIT_EXTERN_C
20927 else
20928 #endif
20930 }
20931 /* Check for `(void)', too, which is a special case. */
20935 {
20936 /* Consume the `void' token. */
20938 /* There are no parameters. */
20940 }
20942 /* Parse the parameter-declaration-list. */
20944 /* If a parse error occurred while parsing the
20945 parameter-declaration-list, then the entire
20946 parameter-declaration-clause is erroneous. */
20950 /* Peek at the next token. */
20952 /* If it's a `,', the clause should terminate with an ellipsis. */
20954 {
20955 /* Consume the `,'. */
20957 /* Expect an ellipsis. */
20958 ellipsis_p
20960 }
20961 /* It might also be `...' if the optional trailing `,' was
20962 omitted. */
20964 {
20965 /* Consume the `...' token. */
20967 /* And remember that we saw it. */
20969 }
20970 else
20973 /* Finish the parameter list. */
20978 }
20980 /* Parse a parameter-declaration-list.
20982 parameter-declaration-list:
20983 parameter-declaration
20984 parameter-declaration-list , parameter-declaration
20986 Returns a representation of the parameter-declaration-list, as for
20987 cp_parser_parameter_declaration_clause. However, the
20988 `void_list_node' is never appended to the list. Upon return,
20989 *IS_ERROR will be true iff an error occurred. */
20991 static tree
20993 {
20999 /* Assume all will go well. */
21001 /* The special considerations that apply to a function within an
21002 unbraced linkage specifications do not apply to the parameters
21003 to the function. */
21004 saved_in_unbraced_linkage_specification_p
21008 /* Look for more parameters. */
21010 {
21018 /* Parse the parameter. */
21019 parameter
21024 /* We don't know yet if the enclosing context is deprecated, so wait
21025 and warn in grokparms if appropriate. */
21029 {
21030 /* If a function parameter pack was specified and an implicit template
21031 parameter was introduced during cp_parser_parameter_declaration,
21032 change any implicit parameters introduced into packs. */
21036 {
21044 }
21048 PARM,
21051 }
21055 /* If a parse error occurred parsing the parameter declaration,
21056 then the entire parameter-declaration-list is erroneous. */
21058 {
21062 }
21072 {
21076 }
21078 /* Add the new parameter to the list. */
21082 /* Peek at the next token. */
21085 /* These are for Objective-C++ */
21088 /* The parameter-declaration-list is complete. */
21091 {
21094 /* Peek at the next token. */
21096 /* If it's an ellipsis, then the list is complete. */
21099 /* Otherwise, there must be more parameters. Consume the
21100 `,'. */
21102 /* When parsing something like:
21104 int i(float f, double d)
21106 we can tell after seeing the declaration for "f" that we
21107 are not looking at an initialization of a variable "i",
21108 but rather at the declaration of a function "i".
21110 Due to the fact that the parsing of template arguments
21111 (as specified to a template-id) requires backtracking we
21112 cannot use this technique when inside a template argument
21113 list. */
21117 /* However, a parameter-declaration of the form
21118 "float(f)" (which is a valid declaration of a
21119 parameter "f") can also be interpreted as an
21120 expression (the conversion of "f" to "float"). */
21123 }
21124 else
21125 {
21133 }
21134 }
21136 parser->in_unbraced_linkage_specification_p
21139 /* Reset implicit_template_scope if we are about to leave the function
21140 parameter list that introduced it. Note that for out-of-line member
21141 definitions, there will be one or more class scopes before we get to
21142 the template parameter scope. */
21146 {
21150 {
21153 }
21154 }
21157 }
21159 /* Parse a parameter declaration.
21161 parameter-declaration:
21162 decl-specifier-seq ... [opt] declarator
21163 decl-specifier-seq declarator = assignment-expression
21164 decl-specifier-seq ... [opt] abstract-declarator [opt]
21165 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21167 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21168 declares a template parameter. (In that case, a non-nested `>'
21169 token encountered during the parsing of the assignment-expression
21170 is not interpreted as a greater-than operator.)
21172 Returns a representation of the parameter, or NULL if an error
21173 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21174 true iff the declarator is of the form "(p)". */
21180 {
21182 cp_decl_specifier_seq decl_specifiers;
21184 tree default_argument;
21189 /* In a template parameter, `>' is not an operator.
21191 [temp.param]
21193 When parsing a default template-argument for a non-type
21194 template-parameter, the first non-nested `>' is taken as the end
21195 of the template parameter-list rather than a greater-than
21196 operator. */
21198 /* Type definitions may not appear in parameter types. */
21200 parser->type_definition_forbidden_message
21203 /* Parse the declaration-specifiers. */
21205 CP_PARSER_FLAGS_NONE,
21209 /* Complain about missing 'typename' or other invalid type names. */
21214 /* If an error occurred, there's no reason to attempt to parse the
21215 rest of the declaration. */
21217 {
21220 }
21222 /* Peek at the next token. */
21225 /* If the next token is a `)', `,', `=', `>', or `...', then there
21226 is no declarator. However, when variadic templates are enabled,
21227 there may be a declarator following `...'. */
21232 {
21236 }
21237 /* Otherwise, there should be a declarator. */
21238 else
21239 {
21243 /* After seeing a decl-specifier-seq, if the next token is not a
21244 "(", there is no possibility that the code is a valid
21245 expression. Therefore, if parsing tentatively, we commit at
21246 this point. */
21248 /* In an expression context, having seen:
21250 (int((char ...
21252 we cannot be sure whether we are looking at a
21253 function-type (taking a "char" as a parameter) or a cast
21254 of some object of type "char" to "int". */
21260 /* Parse the declarator. */
21263 CP_PARSER_DECLARATOR_EITHER,
21265 parenthesized_p,
21269 /* After the declarator, allow more attributes. */
21270 decl_specifiers.attributes
21274 /* If the declarator is a template parameter pack, remember that and
21275 clear the flag in the declarator itself so we don't get errors
21276 from grokdeclarator. */
21278 {
21281 }
21282 }
21284 /* If the next token is an ellipsis, and we have not seen a declarator
21285 name, and if either the type of the declarator contains parameter
21286 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21287 for, eg, abbreviated integral type names), then we actually have a
21288 parameter pack expansion expression. Otherwise, leave the ellipsis
21289 for a C-style variadic function. */
21292 {
21303 {
21304 /* Consume the `...'. */
21308 /* Build a pack expansion type */
21313 else
21315 }
21316 }
21318 /* The restriction on defining new types applies only to the type
21319 of the parameter, not to the default argument. */
21322 /* If the next token is `=', then process a default argument. */
21324 {
21327 /* If we are defining a class, then the tokens that make up the
21328 default argument must be saved and processed later. */
21334 // A constrained-type-specifier may declare a type template-parameter.
21336 default_argument
21339 // A constrained-type-specifier may declare a template-template-parameter.
21341 default_argument
21344 /* Outside of a class definition, we can just parse the
21345 assignment-expression. */
21346 else
21347 default_argument
21351 {
21353 "default arguments are only "
21355 }
21357 || template_parameter_pack_p
21360 {
21361 /* Find the name of the parameter pack. */
21368 template_parm_p
21374 else
21376 template_parm_p
21383 }
21384 }
21385 else
21389 declarator,
21390 default_argument,
21391 template_parameter_pack_p);
21392 }
21394 /* Parse a default argument and return it.
21396 TEMPLATE_PARM_P is true if this is a default argument for a
21397 non-type template parameter. */
21398 static tree
21400 {
21406 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21407 set correctly. */
21410 /* Local variable names (and the `this' keyword) may not
21411 appear in a default argument. */
21414 /* Parse the assignment-expression. */
21419 /* The "this" pointer is not valid in a default argument. */
21421 {
21426 }
21427 default_argument
21429 /* Restore the "this" pointer. */
21431 {
21434 }
21443 }
21445 /* Parse a function-body.
21447 function-body:
21448 compound_statement */
21450 static void
21452 {
21456 }
21458 /* Parse a ctor-initializer-opt followed by a function-body. Return
21459 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21460 is true we are parsing a function-try-block. */
21462 static bool
21465 {
21473 /* Begin the function body. */
21475 /* Parse the optional ctor-initializer. */
21478 /* If we're parsing a constexpr constructor definition, we need
21479 to check that the constructor body is indeed empty. However,
21480 before we get to cp_parser_function_body lot of junk has been
21481 generated, so we can't just check that we have an empty block.
21482 Rather we take a snapshot of the outermost block, and check whether
21483 cp_parser_function_body changed its state. */
21485 {
21489 }
21490 /* Parse the function-body. */
21494 /* Finish the function body. */
21498 }
21500 /* Parse an initializer.
21502 initializer:
21503 = initializer-clause
21504 ( expression-list )
21506 Returns an expression representing the initializer. If no
21507 initializer is present, NULL_TREE is returned.
21509 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21510 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21511 set to TRUE if there is no initializer present. If there is an
21512 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21513 is set to true; otherwise it is set to false. */
21515 static tree
21518 {
21520 tree init;
21522 /* Peek at the next token. */
21525 /* Let our caller know whether or not this initializer was
21526 parenthesized. */
21528 /* Assume that the initializer is constant. */
21532 {
21533 /* Consume the `='. */
21535 /* Parse the initializer-clause. */
21537 }
21539 {
21544 non_constant_p);
21549 }
21551 {
21556 }
21557 else
21558 {
21559 /* Anything else is an error. */
21562 }
21568 }
21570 /* Parse an initializer-clause.
21572 initializer-clause:
21573 assignment-expression
21574 braced-init-list
21576 Returns an expression representing the initializer.
21578 If the `assignment-expression' production is used the value
21579 returned is simply a representation for the expression.
21581 Otherwise, calls cp_parser_braced_list. */
21583 static cp_expr
21585 {
21586 cp_expr initializer;
21588 /* Assume the expression is constant. */
21591 /* If it is not a `{', then we are looking at an
21592 assignment-expression. */
21594 {
21595 initializer
21598 non_constant_p);
21599 }
21600 else
21604 }
21606 /* Parse a brace-enclosed initializer list.
21608 braced-init-list:
21609 { initializer-list , [opt] }
21610 { }
21612 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21613 the elements of the initializer-list (or NULL, if the last
21614 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21615 NULL_TREE. There is no way to detect whether or not the optional
21616 trailing `,' was provided. NON_CONSTANT_P is as for
21617 cp_parser_initializer. */
21619 static cp_expr
21621 {
21622 tree initializer;
21625 /* Consume the `{' token. */
21627 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21629 /* If it's not a `}', then there is a non-trivial initializer. */
21631 {
21632 /* Parse the initializer list. */
21635 /* A trailing `,' token is allowed. */
21638 }
21639 else
21641 /* Now, there should be a trailing `}'. */
21647 /* Build a location of the form:
21648 { ... }
21649 ^~~~~~~
21650 with caret==start at the open brace, finish at the close brace. */
21654 }
21656 /* Consume tokens up to, and including, the next non-nested closing `]'.
21657 Returns true iff we found a closing `]'. */
21659 static bool
21661 {
21665 {
21669 {
21672 /* If we've run out of tokens, then there is no closing `]'. */
21681 {
21684 }
21689 }
21691 /* Consume the token. */
21693 }
21694 }
21696 /* Return true if we are looking at an array-designator, false otherwise. */
21698 static bool
21700 {
21701 /* Consume the `['. */
21706 /* Skip tokens until the next token is a closing square bracket.
21707 If we find the closing `]', and the next token is a `=', then
21708 we are looking at an array designator. */
21709 bool array_designator_p
21713 /* Roll back the tokens we skipped. */
21717 }
21719 /* Parse an initializer-list.
21721 initializer-list:
21722 initializer-clause ... [opt]
21723 initializer-list , initializer-clause ... [opt]
21725 GNU Extension:
21727 initializer-list:
21728 designation initializer-clause ...[opt]
21729 initializer-list , designation initializer-clause ...[opt]
21731 designation:
21732 . identifier =
21733 identifier :
21734 [ constant-expression ] =
21736 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21737 for the initializer. If the INDEX of the elt is non-NULL, it is the
21738 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21739 as for cp_parser_initializer. */
21743 {
21746 /* Assume all of the expressions are constant. */
21749 /* Parse the rest of the list. */
21751 {
21753 tree designator;
21754 tree initializer;
21757 /* If the next token is an identifier and the following one is a
21758 colon, we are looking at the GNU designated-initializer
21759 syntax. */
21763 {
21764 /* Warn the user that they are using an extension. */
21767 /* Consume the identifier. */
21769 /* Consume the `:'. */
21771 }
21772 /* Also handle the C99 syntax, '. id ='. */
21777 {
21778 /* Warn the user that they are using an extension. */
21781 /* Consume the `.'. */
21783 /* Consume the identifier. */
21785 /* Consume the `='. */
21787 }
21788 /* Also handle C99 array designators, '[ const ] ='. */
21792 {
21793 /* In C++11, [ could start a lambda-introducer. */
21799 {
21802 }
21803 else
21804 {
21809 }
21815 }
21816 else
21819 /* Parse the initializer. */
21822 /* If any clause is non-constant, so is the entire initializer. */
21826 /* If we have an ellipsis, this is an initializer pack
21827 expansion. */
21829 {
21830 /* Consume the `...'. */
21833 /* Turn the initializer into an initializer expansion. */
21835 }
21837 /* Add it to the vector. */
21840 /* If the next token is not a comma, we have reached the end of
21841 the list. */
21845 /* Peek at the next token. */
21847 /* If the next token is a `}', then we're still done. An
21848 initializer-clause can have a trailing `,' after the
21849 initializer-list and before the closing `}'. */
21853 /* Consume the `,' token. */
21855 }
21858 }
21860 /* Classes [gram.class] */
21862 /* Parse a class-name.
21864 class-name:
21865 identifier
21866 template-id
21868 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21869 to indicate that names looked up in dependent types should be
21870 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21871 keyword has been used to indicate that the name that appears next
21872 is a template. TAG_TYPE indicates the explicit tag given before
21873 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21874 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21875 is the class being defined in a class-head. If ENUM_OK is TRUE,
21876 enum-names are also accepted.
21878 Returns the TYPE_DECL representing the class. */
21880 static tree
21889 {
21890 tree decl;
21891 tree scope;
21896 /* All class-names start with an identifier. */
21899 {
21902 }
21904 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21905 to a template-id, so we save it here. */
21910 /* Any name names a type if we're following the `typename' keyword
21911 in a qualified name where the enclosing scope is type-dependent. */
21914 /* Handle the common case (an identifier, but not a template-id)
21915 efficiently. */
21918 {
21922 /* Look for the identifier. */
21926 /* If the next token isn't an identifier, we are certainly not
21927 looking at a class-name. */
21930 /* If we know this is a type-name, there's no need to look it
21931 up. */
21934 else
21935 {
21936 tree ambiguous_decls;
21937 /* If we already know that this lookup is ambiguous, then
21938 we've already issued an error message; there's no reason
21939 to check again. */
21941 {
21944 }
21945 /* If the next token is a `::', then the name must be a type
21946 name.
21948 [basic.lookup.qual]
21950 During the lookup for a name preceding the :: scope
21951 resolution operator, object, function, and enumerator
21952 names are ignored. */
21955 /* Look up the name. */
21957 tag_type,
21960 check_dependency_p,
21964 {
21968 }
21969 }
21970 }
21971 else
21972 {
21973 /* Try a template-id. */
21975 check_dependency_p,
21976 tag_type,
21977 is_declaration);
21980 }
21984 /* If this is a typename, create a TYPENAME_TYPE. */
21986 {
21991 }
21995 /* Check to see that it is really the name of a class. */
21999 /* Situations like this:
22001 template <typename T> struct A {
22002 typename T::template X<int>::I i;
22003 };
22005 are problematic. Is `T::template X<int>' a class-name? The
22006 standard does not seem to be definitive, but there is no other
22007 valid interpretation of the following `::'. Therefore, those
22008 names are considered class-names. */
22009 {
22013 }
22018 /* In Objective-C 2.0, a classname followed by '.' starts a
22019 dot-syntax expression, and it's not a type-name. */
22031 }
22033 /* Parse a class-specifier.
22035 class-specifier:
22036 class-head { member-specification [opt] }
22038 Returns the TREE_TYPE representing the class. */
22040 static tree
22042 {
22043 tree type;
22057 /* Parse the class-head. */
22060 /* If the class-head was a semantic disaster, skip the entire body
22061 of the class. */
22063 {
22067 }
22069 /* Look for the `{'. */
22071 {
22074 }
22079 /* Issue an error message if type-definitions are forbidden here. */
22081 /* Remember that we are defining one more class. */
22083 /* Inside the class, surrounding template-parameter-lists do not
22084 apply. */
22085 saved_num_template_parameter_lists
22088 /* We are not in a function body. */
22091 /* Or in a loop. */
22094 /* Or in a switch. */
22097 /* We are not immediately inside an extern "lang" block. */
22098 saved_in_unbraced_linkage_specification_p
22102 // Associate constraints with the type.
22106 /* Start the class. */
22108 {
22111 }
22115 /* If the type is erroneous, skip the entire body of the class. */
22117 else
22118 /* Parse the member-specification. */
22121 /* Look for the trailing `}'. */
22123 /* Look for trailing attributes to apply to this class. */
22131 /* We've finished a type definition. Check for the common syntax
22132 error of forgetting a semicolon after the definition. We need to
22133 be careful, as we can't just check for not-a-semicolon and be done
22134 with it; the user might have typed:
22136 class X { } c = ...;
22137 class X { } *p = ...;
22139 and so forth. Instead, enumerate all the possible tokens that
22140 might follow this production; if we don't see one of them, then
22141 complain and silently insert the semicolon. */
22142 {
22147 /* Don't try to parse c++11 attributes here. As per the
22148 grammar, that should be a task for
22149 cp_parser_decl_specifier_seq. */
22153 {
22164 /* While it's legal for type qualifiers and storage class
22165 specifiers to follow type definitions in the grammar, only
22166 compiler testsuites contain code like that. Assume that if
22167 we see such code, then what we're really seeing is a case
22168 like:
22170 class X { }
22171 const <type> var = ...;
22173 or
22175 class Y { }
22176 static <type> func (...) ...
22178 i.e. the qualifier or specifier applies to the next
22179 declaration. To do so, however, we need to look ahead one
22180 more token to see if *that* token is a type specifier.
22182 This code could be improved to handle:
22184 class Z { }
22185 static const <type> var = ...; */
22188 {
22191 /* Handling user-defined types here would be nice, but very
22192 tricky. */
22193 want_semicolon
22196 }
22200 }
22202 /* If we don't have a type, then something is very wrong and we
22203 shouldn't try to do anything clever. Likewise for not seeing the
22204 closing brace. */
22206 {
22207 /* Locate the closing brace. */
22208 cp_token_position prev
22213 /* We want to suggest insertion of a ';' immediately *after* the
22214 closing brace, so, if we can, offset the location by 1 column. */
22221 /* If we successfully offset the location, suggest the fix-it. */
22234 else
22237 /* Unget one token and smash it to look as though we encountered
22238 a semicolon in the input stream. */
22243 }
22244 }
22246 /* If this class is not itself within the scope of another class,
22247 then we need to parse the bodies of all of the queued function
22248 definitions. Note that the queued functions defined in a class
22249 are not always processed immediately following the
22250 class-specifier for that class. Consider:
22252 struct A {
22253 struct B { void f() { sizeof (A); } };
22254 };
22256 If `f' were processed before the processing of `A' were
22257 completed, there would be no way to compute the size of `A'.
22258 Note that the nesting we are interested in here is lexical --
22259 not the semantic nesting given by TYPE_CONTEXT. In particular,
22260 for:
22262 struct A { struct B; };
22263 struct A::B { void f() { } };
22265 there is no need to delay the parsing of `A::B::f'. */
22267 {
22268 tree decl;
22275 /* In a first pass, parse default arguments to the functions.
22276 Then, in a second pass, parse the bodies of the functions.
22277 This two-phased approach handles cases like:
22279 struct S {
22280 void f() { g(); }
22281 void g(int i = 3);
22282 };
22284 */
22286 {
22288 /* If there are default arguments that have not yet been processed,
22289 take care of them now. */
22291 {
22296 }
22297 /* Make sure that any template parameters are in scope. */
22299 /* Parse the default argument expressions. */
22301 /* Remove any template parameters from the symbol table. */
22303 }
22305 /* Now parse any NSDMIs. */
22309 {
22311 {
22316 }
22319 }
22326 /* Now do some post-NSDMI bookkeeping. */
22332 /* Now parse the body of the functions. */
22334 {
22335 /* OpenMP UDRs need to be parsed before all other functions. */
22342 }
22343 else
22347 }
22348 else
22351 /* Put back any saved access checks. */
22354 /* Restore saved state. */
22358 parser->num_template_parameter_lists
22360 parser->in_unbraced_linkage_specification_p
22364 }
22366 static tree
22368 {
22369 tree ret;
22374 }
22376 /* Parse a class-head.
22378 class-head:
22379 class-key identifier [opt] base-clause [opt]
22380 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22381 class-key nested-name-specifier [opt] template-id
22382 base-clause [opt]
22384 class-virt-specifier:
22385 final
22387 GNU Extensions:
22388 class-key attributes identifier [opt] base-clause [opt]
22389 class-key attributes nested-name-specifier identifier base-clause [opt]
22390 class-key attributes nested-name-specifier [opt] template-id
22391 base-clause [opt]
22393 Upon return BASES is initialized to the list of base classes (or
22394 NULL, if there are none) in the same form returned by
22395 cp_parser_base_clause.
22397 Returns the TYPE of the indicated class. Sets
22398 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22399 involving a nested-name-specifier was used, and FALSE otherwise.
22401 Returns error_mark_node if this is not a class-head.
22403 Returns NULL_TREE if the class-head is syntactically valid, but
22404 semantically invalid in a way that means we should skip the entire
22405 body of the class. */
22407 static tree
22410 {
22411 tree nested_name_specifier;
22415 tree attributes;
22416 tree bases;
22426 /* Assume no nested-name-specifier will be present. */
22428 /* Assume no template parameter lists will be used in defining the
22429 type. */
22433 /* Look for the class-key. */
22440 /* Parse the attributes. */
22443 /* If the next token is `::', that is invalid -- but sometimes
22444 people do try to write:
22446 struct ::S {};
22448 Handle this gracefully by accepting the extra qualifier, and then
22449 issuing an error about it later if this really is a
22450 class-head. If it turns out just to be an elaborated type
22451 specifier, remain silent. */
22457 /* Determine the name of the class. Begin by looking for an
22458 optional nested-name-specifier. */
22460 nested_name_specifier
22466 /* If there was a nested-name-specifier, then there *must* be an
22467 identifier. */
22469 {
22471 /* Although the grammar says `identifier', it really means
22472 `class-name' or `template-name'. You are only allowed to
22473 define a class that has already been declared with this
22474 syntax.
22476 The proposed resolution for Core Issue 180 says that wherever
22477 you see `class T::X' you should treat `X' as a type-name.
22479 It is OK to define an inaccessible class; for example:
22481 class A { class B; };
22482 class A::B {};
22484 We do not know if we will see a class-name, or a
22485 template-name. We look for a class-name first, in case the
22486 class-name is a template-id; if we looked for the
22487 template-name first we would stop after the template-name. */
22492 class_type,
22496 /* If that didn't work, ignore the nested-name-specifier. */
22498 {
22504 }
22505 /* If we could not find a corresponding TYPE, treat this
22506 declaration like an unqualified declaration. */
22509 /* Otherwise, count the number of templates used in TYPE and its
22510 containing scopes. */
22511 else
22512 {
22513 tree scope;
22525 }
22526 }
22527 /* Otherwise, the identifier is optional. */
22528 else
22529 {
22530 /* We don't know whether what comes next is a template-id,
22531 an identifier, or nothing at all. */
22533 /* Check for a template-id. */
22538 class_key,
22540 /* If that didn't work, it could still be an identifier. */
22542 {
22544 {
22547 }
22548 else
22550 }
22551 else
22552 {
22555 }
22556 }
22561 {
22563 class_key,
22565 }
22568 /* If it's not a `:' or a `{' then we can't really be looking at a
22569 class-head, since a class-head only appears as part of a
22570 class-specifier. We have to detect this situation before calling
22571 xref_tag, since that has irreversible side-effects. */
22573 {
22577 }
22579 /* At this point, we're going ahead with the class-specifier, even
22580 if some other problem occurs. */
22583 {
22588 }
22589 /* Issue the error about the overly-qualified name now. */
22591 {
22596 }
22598 {
22603 }
22605 {
22606 tree scope;
22608 /* Reject typedef-names in class heads. */
22610 {
22613 type);
22616 }
22618 /* Figure out in what scope the declaration is being placed. */
22620 /* If that scope does not contain the scope in which the
22621 class was originally declared, the program is invalid. */
22623 {
22626 "declaration of %qD in namespace %qD which does not "
22629 else
22635 }
22636 /* [dcl.meaning]
22638 A declarator-id shall not be qualified except for the
22639 definition of a ... nested class outside of its class
22640 ... [or] the definition or explicit instantiation of a
22641 class member of a namespace outside of its namespace. */
22643 {
22648 }
22649 }
22650 /* An explicit-specialization must be preceded by "template <>". If
22651 it is not, try to recover gracefully. */
22654 && !processing_template_parmlist
22656 {
22657 /* Build a location of this form:
22658 struct typename <ARGS>
22659 ^~~~~~~~~~~~~~~~~~~~~~
22660 with caret==start at the start token, and
22661 finishing at the end of the type. */
22662 location_t reported_loc
22664 class_head_start_location,
22669 error_at_rich_loc
22673 /* Take the same action that would have been taken by
22674 cp_parser_explicit_specialization. */
22677 }
22678 /* There must be no "return" statements between this point and the
22679 end of this function; set "type "to the correct return value and
22680 use "goto done;" to return. */
22681 /* Make sure that the right number of template parameters were
22682 present. */
22686 {
22687 /* If something went wrong, there is no point in even trying to
22688 process the class-definition. */
22691 }
22693 /* Look up the type. */
22695 {
22699 {
22703 }
22704 else
22705 {
22709 /* Check the scope while we still know whether or not we had a
22710 nested-name-specifier. */
22713 }
22716 }
22718 {
22719 tree class_type;
22721 /* Given:
22723 template <typename T> struct S { struct T };
22724 template <typename T> struct S<T>::T { };
22726 we will get a TYPENAME_TYPE when processing the definition of
22727 `S::T'. We need to resolve it to the actual type before we
22728 try to define it. */
22730 {
22735 else
22736 {
22739 }
22740 }
22744 {
22747 }
22750 /* Enter the scope indicated by the nested-name-specifier. */
22752 /* Get the canonical version of this type. */
22754 /* Call push_template_decl if it seems like we should be defining a
22755 template either from the template headers or the type we're
22756 defining, so that we diagnose both extra and missing headers. */
22760 {
22763 {
22766 }
22767 }
22771 }
22773 {
22774 /* If the class was unnamed, create a dummy name. */
22778 ? ts_within_enclosing_non_class
22782 }
22784 /* Indicate whether this class was declared as a `class' or as a
22785 `struct'. */
22790 /* If this type was already complete, and we see another definition,
22791 that's an error. */
22793 {
22795 type);
22797 type);
22800 }
22805 {
22806 /* Apply attributes now, before any use of the class as a template
22807 argument in its base list. */
22810 }
22812 /* We will have entered the scope containing the class; the names of
22813 base classes should be looked up in that context. For example:
22815 struct A { struct B {}; struct C; };
22816 struct A::C : B {};
22818 is valid. */
22820 /* Get the list of base-classes, if there is one. */
22822 {
22823 /* PR59482: enter the class scope so that base-specifiers are looked
22824 up correctly. */
22828 /* PR59482: get out of the previously pushed class scope so that the
22829 subsequent pops pop the right thing. */
22832 }
22833 else
22836 /* If we're really defining a class, process the base classes.
22837 If they're invalid, fail. */
22841 done:
22842 /* Leave the scope given by the nested-name-specifier. We will
22843 enter the class scope itself while processing the members. */
22848 {
22851 }
22857 out:
22860 }
22862 /* Parse a class-key.
22864 class-key:
22865 class
22866 struct
22867 union
22869 Returns the kind of class-key specified, or none_type to indicate
22870 error. */
22872 static enum tag_types
22874 {
22878 /* Look for the class-key. */
22883 /* Check to see if the TOKEN is a class-key. */
22888 }
22890 /* Parse a type-parameter-key.
22892 type-parameter-key:
22893 class
22894 typename
22895 */
22897 static void
22899 {
22900 /* Look for the type-parameter-key. */
22904 {
22907 /* typename is not allowed in a template template parameter
22908 by the standard until C++1Z. */
22910 "ISO C++ forbids typename key in template template parameter;"
22912 }
22913 else
22917 }
22919 /* Parse an (optional) member-specification.
22921 member-specification:
22922 member-declaration member-specification [opt]
22923 access-specifier : member-specification [opt] */
22925 static void
22927 {
22929 {
22933 /* Peek at the next token. */
22935 /* If it's a `}', or EOF then we've seen all the members. */
22941 /* See if this token is a keyword. */
22944 {
22948 /* Consume the access-specifier. */
22950 /* Remember which access-specifier is active. */
22952 /* Look for the `:'. */
22957 /* Accept #pragmas at class scope. */
22959 {
22962 }
22964 /* Otherwise, the next construction must be a
22965 member-declaration. */
22967 }
22968 }
22969 }
22971 /* Parse a member-declaration.
22973 member-declaration:
22974 decl-specifier-seq [opt] member-declarator-list [opt] ;
22975 function-definition ; [opt]
22976 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22977 using-declaration
22978 template-declaration
22979 alias-declaration
22981 member-declarator-list:
22982 member-declarator
22983 member-declarator-list , member-declarator
22985 member-declarator:
22986 declarator pure-specifier [opt]
22987 declarator constant-initializer [opt]
22988 identifier [opt] : constant-expression
22990 GNU Extensions:
22992 member-declaration:
22993 __extension__ member-declaration
22995 member-declarator:
22996 declarator attributes [opt] pure-specifier [opt]
22997 declarator attributes [opt] constant-initializer [opt]
22998 identifier [opt] attributes [opt] : constant-expression
23000 C++0x Extensions:
23002 member-declaration:
23003 static_assert-declaration */
23005 static void
23007 {
23008 cp_decl_specifier_seq decl_specifiers;
23009 tree prefix_attributes;
23010 tree decl;
23019 /* Check for the `__extension__' keyword. */
23021 {
23022 /* Recurse. */
23024 /* Restore the old value of the PEDANTIC flag. */
23028 }
23030 /* Check for a template-declaration. */
23032 {
23033 /* An explicit specialization here is an error condition, and we
23034 expect the specialization handler to detect and report this. */
23038 else
23042 }
23043 /* Check for a template introduction. */
23047 /* Check for a using-declaration. */
23049 {
23051 {
23052 /* Parse the using-declaration. */
23056 }
23057 else
23058 {
23059 tree decl;
23063 /* Note that if we actually see the '=' token after the
23064 identifier, cp_parser_alias_declaration commits the
23065 tentative parse. In that case, we really expect an
23066 alias-declaration. Otherwise, we expect a using
23067 declaration. */
23068 alias_decl_expected =
23074 else
23078 }
23079 }
23081 /* Check for @defs. */
23083 {
23088 {
23093 }
23095 }
23097 /* If the next token is `static_assert' we have a static assertion. */
23099 {
23102 }
23109 /* Parse the decl-specifier-seq. */
23112 CP_PARSER_FLAGS_OPTIONAL,
23115 /* Check for an invalid type-name. */
23119 /* If there is no declarator, then the decl-specifier-seq should
23120 specify a type. */
23122 {
23123 /* If there was no decl-specifier-seq, and the next token is a
23124 `;', then we have something like:
23126 struct S { ; };
23128 [class.mem]
23130 Each member-declaration shall declare at least one member
23131 name of the class. */
23133 {
23136 {
23140 }
23141 }
23142 else
23143 {
23144 tree type;
23146 /* See if this declaration is a friend. */
23148 /* If there were decl-specifiers, check to see if there was
23149 a class-declaration. */
23152 /* Nested classes have already been added to the class, but
23153 a `friend' needs to be explicitly registered. */
23155 {
23156 /* If the `friend' keyword was present, the friend must
23157 be introduced with a class-key. */
23160 "in C++03 a class-key must be used "
23162 /* In this case:
23164 template <typename T> struct A {
23165 friend struct A<T>::B;
23166 };
23168 A<T>::B will be represented by a TYPENAME_TYPE, and
23169 therefore not recognized by check_tag_decl. */
23171 {
23175 }
23178 "friend declaration does not name a class or "
23180 else
23183 }
23184 /* If there is no TYPE, an error message will already have
23185 been issued. */
23187 ;
23188 /* An anonymous aggregate has to be handled specially; such
23189 a declaration really declares a data member (with a
23190 particular type), as opposed to a nested class. */
23192 {
23193 /* C++11 9.5/6. */
23196 "a storage class on an anonymous aggregate "
23199 /* Remove constructors and such from TYPE, now that we
23200 know it is an anonymous aggregate. */
23202 /* And make the corresponding data member. */
23205 /* Add it to the class. */
23207 }
23208 else
23209 cp_parser_check_access_in_redeclaration
23212 }
23213 }
23214 else
23215 {
23218 /* Clear attributes from the decl_specifiers but keep them
23219 around as prefix attributes that apply them to the entity
23220 being declared. */
23224 /* See if these declarations will be friends. */
23227 /* Keep going until we hit the `;' at the end of the
23228 declaration. */
23230 {
23232 tree first_attribute;
23234 /* Peek at the next token. */
23237 /* Check for a bitfield declaration. */
23242 {
23243 tree identifier;
23244 tree width;
23246 /* Get the name of the bitfield. Note that we cannot just
23247 check TOKEN here because it may have been invalidated by
23248 the call to cp_lexer_peek_nth_token above. */
23251 else
23254 /* Consume the `:' token. */
23256 /* Get the width of the bitfield. */
23257 width
23260 /* Look for attributes that apply to the bitfield. */
23262 /* Remember which attributes are prefix attributes and
23263 which are not. */
23265 /* Combine the attributes. */
23268 /* Create the bitfield declaration. */
23271 identifier,
23272 sfk_none)
23275 width,
23276 attributes);
23277 }
23278 else
23279 {
23281 tree initializer;
23282 tree asm_specification;
23285 /* Parse the declarator. */
23286 declarator
23291 friend_p);
23293 /* If something went wrong parsing the declarator, make sure
23294 that we at least consume some tokens. */
23296 {
23297 /* Skip to the end of the statement. */
23299 /* If the next token is not a semicolon, that is
23300 probably because we just skipped over the body of
23301 a function. So, we consume a semicolon if
23302 present, but do not issue an error message if it
23303 is not present. */
23305 CPP_SEMICOLON))
23308 }
23311 cp_parser_check_for_definition_in_return_type
23315 /* Look for an asm-specification. */
23317 /* Look for attributes that apply to the declaration. */
23319 /* Remember which attributes are prefix attributes and
23320 which are not. */
23322 /* Combine the attributes. */
23325 /* If it's an `=', then we have a constant-initializer or a
23326 pure-specifier. It is not correct to parse the
23327 initializer before registering the member declaration
23328 since the member declaration should be in scope while
23329 its initializer is processed. However, the rest of the
23330 front end does not yet provide an interface that allows
23331 us to handle this correctly. */
23333 {
23334 /* In [class.mem]:
23336 A pure-specifier shall be used only in the declaration of
23337 a virtual function.
23339 A member-declarator can contain a constant-initializer
23340 only if it declares a static member of integral or
23341 enumeration type.
23343 Therefore, if the DECLARATOR is for a function, we look
23344 for a pure-specifier; otherwise, we look for a
23345 constant-initializer. When we call `grokfield', it will
23346 perform more stringent semantics checks. */
23358 {
23360 /* Don't require a constant rvalue in C++11, since we
23361 might want a reference constant. We'll enforce
23362 constancy later. */
23364 /* Parse the initializer. */
23367 }
23368 else
23369 /* Parse the initializer. */
23371 }
23374 {
23378 else
23380 }
23381 /* Otherwise, there is no initializer. */
23382 else
23385 /* See if we are probably looking at a function
23386 definition. We are certainly not looking at a
23387 member-declarator. Calling `grokfield' has
23388 side-effects, so we must not do it unless we are sure
23389 that we are looking at a member-declarator. */
23392 {
23393 /* The grammar does not allow a pure-specifier to be
23394 used when a member function is defined. (It is
23395 possible that this fact is an oversight in the
23396 standard, since a pure function may be defined
23397 outside of the class-specifier. */
23403 declarator,
23404 attributes);
23407 /* If the member was not a friend, declare it here. */
23410 /* Peek at the next token. */
23412 /* If the next token is a semicolon, consume it. */
23414 {
23415 location_t semicolon_loc
23420 "extra %<;%> after in-class "
23422 }
23424 }
23425 else
23428 /* Create the declaration. */
23433 {
23436 else
23438 }
23439 }
23444 /* Reset PREFIX_ATTRIBUTES. */
23450 /* If there is any qualification still in effect, clear it
23451 now; we will be starting fresh with the next declarator. */
23455 /* If it's a `,', then there are more declarators. */
23457 {
23460 {
23466 }
23467 }
23468 /* If the next token isn't a `;', then we have a parse error. */
23470 CPP_SEMICOLON))
23471 {
23472 /* The next token might be a ways away from where the
23473 actual semicolon is missing. Find the previous token
23474 and use that for our error position. */
23481 /* Assume that the user meant to provide a semicolon. If
23482 we were to cp_parser_skip_to_end_of_statement, we might
23483 skip to a semicolon inside a member function definition
23484 and issue nonsensical error messages. */
23486 }
23489 {
23490 /* Add DECL to the list of members. */
23492 /* Explicitly include, eg, NSDMIs, for better error
23493 recovery (c++/58650). */
23502 /* Add DECL to the queue of NSDMI to be parsed later. */
23504 }
23508 }
23509 }
23512 out:
23514 }
23516 /* Parse a pure-specifier.
23518 pure-specifier:
23519 = 0
23521 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23522 Otherwise, ERROR_MARK_NODE is returned. */
23524 static tree
23526 {
23529 /* Look for the `=' token. */
23532 /* Look for the `0' token. */
23541 /* Accept = default or = delete in c++0x mode. */
23544 {
23547 }
23549 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23551 {
23556 }
23558 {
23561 }
23564 }
23566 /* Parse a constant-initializer.
23568 constant-initializer:
23569 = constant-expression
23571 Returns a representation of the constant-expression. */
23573 static tree
23575 {
23576 /* Look for the `=' token. */
23580 /* It is invalid to write:
23582 struct S { static const int i = { 7 }; };
23584 */
23586 {
23589 /* Consume the opening brace. */
23591 /* Skip the initializer. */
23593 /* Look for the trailing `}'. */
23597 }
23600 }
23602 /* Derived classes [gram.class.derived] */
23604 /* Parse a base-clause.
23606 base-clause:
23607 : base-specifier-list
23609 base-specifier-list:
23610 base-specifier ... [opt]
23611 base-specifier-list , base-specifier ... [opt]
23613 Returns a TREE_LIST representing the base-classes, in the order in
23614 which they were declared. The representation of each node is as
23615 described by cp_parser_base_specifier.
23617 In the case that no bases are specified, this function will return
23618 NULL_TREE, not ERROR_MARK_NODE. */
23620 static tree
23622 {
23625 /* Look for the `:' that begins the list. */
23628 /* Scan the base-specifier-list. */
23630 {
23632 tree base;
23635 /* Look for the base-specifier. */
23637 /* Look for the (optional) ellipsis. */
23639 {
23640 /* Consume the `...'. */
23644 }
23646 /* Add BASE to the front of the list. */
23648 {
23650 /* Make this a pack expansion type. */
23654 {
23657 }
23658 }
23659 /* Peek at the next token. */
23661 /* If it's not a comma, then the list is complete. */
23664 /* Consume the `,'. */
23666 }
23668 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23669 base class had a qualified name. However, the next name that
23670 appears is certainly not qualified. */
23676 }
23678 /* Parse a base-specifier.
23680 base-specifier:
23681 :: [opt] nested-name-specifier [opt] class-name
23682 virtual access-specifier [opt] :: [opt] nested-name-specifier
23683 [opt] class-name
23684 access-specifier virtual [opt] :: [opt] nested-name-specifier
23685 [opt] class-name
23687 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23688 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23689 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23690 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23692 static tree
23694 {
23702 tree type;
23704 /* Process the optional `virtual' and `access-specifier'. */
23706 {
23707 /* Peek at the next token. */
23709 /* Process `virtual'. */
23711 {
23713 /* If `virtual' appears more than once, issue an error. */
23715 {
23719 }
23723 /* Consume the `virtual' token. */
23731 /* If more than one access specifier appears, issue an
23732 error. */
23735 {
23739 }
23743 /* Consume the access-specifier. */
23751 }
23752 }
23753 /* It is not uncommon to see programs mechanically, erroneously, use
23754 the 'typename' keyword to denote (dependent) qualified types
23755 as base classes. */
23757 {
23762 else
23764 "keyword %<typename%> not allowed in this context "
23767 }
23769 /* Look for the optional `::' operator. */
23771 /* Look for the nested-name-specifier. The simplest way to
23772 implement:
23774 [temp.res]
23776 The keyword `typename' is not permitted in a base-specifier or
23777 mem-initializer; in these contexts a qualified name that
23778 depends on a template-parameter is implicitly assumed to be a
23779 type name.
23781 is to pretend that we have seen the `typename' keyword at this
23782 point. */
23788 /* If the base class is given by a qualified name, assume that names
23789 we see are type names or templates, as appropriate. */
23795 /* DR 950 allows decltype as a base-specifier. */
23797 else
23798 {
23799 /* Otherwise, look for the class-name. */
23801 class_scope_p,
23802 template_p,
23803 typename_type,
23808 }
23814 }
23816 /* Exception handling [gram.exception] */
23818 /* Parse an (optional) noexcept-specification.
23820 noexcept-specification:
23821 noexcept ( constant-expression ) [opt]
23823 If no noexcept-specification is present, returns NULL_TREE.
23824 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23825 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23826 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23827 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23828 in which case a boolean condition is returned instead. */
23830 static tree
23835 {
23839 /* Peek at the next token. */
23842 /* Is it a noexcept-specification? */
23844 {
23845 tree expr;
23849 {
23853 {
23854 /* Types may not be defined in an exception-specification. */
23856 parser->type_definition_forbidden_message
23861 /* Restore the saved message. */
23863 }
23864 else
23865 {
23868 }
23871 }
23872 else
23873 {
23877 }
23879 /* We cannot build a noexcept-spec right away because this will check
23880 that expr is a constexpr. */
23883 else
23885 }
23886 else
23888 }
23890 /* Parse an (optional) exception-specification.
23892 exception-specification:
23893 throw ( type-id-list [opt] )
23895 Returns a TREE_LIST representing the exception-specification. The
23896 TREE_VALUE of each node is a type. */
23898 static tree
23900 {
23902 tree type_id_list;
23905 /* Peek at the next token. */
23908 /* Is it a noexcept-specification? */
23914 /* If it's not `throw', then there's no exception-specification. */
23920 /* Consume the `throw'. */
23923 /* Look for the `('. */
23926 /* Peek at the next token. */
23928 /* If it's not a `)', then there is a type-id-list. */
23930 {
23931 /* Types may not be defined in an exception-specification. */
23933 parser->type_definition_forbidden_message
23935 /* Parse the type-id-list. */
23937 /* Restore the saved message. */
23941 {
23945 }
23948 "dynamic exception specifications are deprecated in "
23950 }
23951 /* In C++17, throw() is equivalent to noexcept (true). throw()
23952 is deprecated in C++11 and above as well, but is still widely used,
23953 so don't warn about it yet. */
23956 else
23959 /* Look for the `)'. */
23963 }
23965 /* Parse an (optional) type-id-list.
23967 type-id-list:
23968 type-id ... [opt]
23969 type-id-list , type-id ... [opt]
23971 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23972 in the order that the types were presented. */
23974 static tree
23976 {
23980 {
23982 tree type;
23986 /* Get the next type-id. */
23988 /* Check for invalid 'auto'. */
23990 {
23994 }
23995 /* Parse the optional ellipsis. */
23997 {
23998 /* Consume the `...'. */
24001 /* Turn the type into a pack expansion expression. */
24003 }
24004 /* Add it to the list. */
24006 /* Peek at the next token. */
24008 /* If it is not a `,', we are done. */
24011 /* Consume the `,'. */
24013 }
24016 }
24018 /* Parse a try-block.
24020 try-block:
24021 try compound-statement handler-seq */
24023 static tree
24025 {
24026 tree try_block;
24040 }
24042 /* Parse a function-try-block.
24044 function-try-block:
24045 try ctor-initializer [opt] function-body handler-seq */
24047 static bool
24049 {
24050 tree compound_stmt;
24051 tree try_block;
24054 /* Look for the `try' keyword. */
24057 /* Let the rest of the front end know where we are. */
24059 /* Parse the function-body. */
24060 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24062 /* We're done with the `try' part. */
24064 /* Parse the handlers. */
24066 /* We're done with the handlers. */
24070 }
24072 /* Parse a handler-seq.
24074 handler-seq:
24075 handler handler-seq [opt] */
24077 static void
24079 {
24081 {
24084 /* Parse the handler. */
24086 /* Peek at the next token. */
24088 /* If it's not `catch' then there are no more handlers. */
24091 }
24092 }
24094 /* Parse a handler.
24096 handler:
24097 catch ( exception-declaration ) compound-statement */
24099 static void
24101 {
24102 tree handler;
24103 tree declaration;
24113 }
24115 /* Parse an exception-declaration.
24117 exception-declaration:
24118 type-specifier-seq declarator
24119 type-specifier-seq abstract-declarator
24120 type-specifier-seq
24121 ...
24123 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24124 ellipsis variant is used. */
24126 static tree
24128 {
24129 cp_decl_specifier_seq type_specifiers;
24133 /* If it's an ellipsis, it's easy to handle. */
24135 {
24136 /* Consume the `...' token. */
24139 }
24141 /* Types may not be defined in exception-declarations. */
24143 parser->type_definition_forbidden_message
24146 /* Parse the type-specifier-seq. */
24150 /* If it's a `)', then there is no declarator. */
24153 else
24160 /* Restore the saved message. */
24167 }
24169 /* Parse a throw-expression.
24171 throw-expression:
24172 throw assignment-expression [opt]
24174 Returns a THROW_EXPR representing the throw-expression. */
24176 static tree
24178 {
24179 tree expression;
24184 /* Figure out whether or not there is an assignment-expression
24185 following the "throw" keyword. */
24193 else
24197 }
24199 /* GNU Extensions */
24201 /* Parse an (optional) asm-specification.
24203 asm-specification:
24204 asm ( string-literal )
24206 If the asm-specification is present, returns a STRING_CST
24207 corresponding to the string-literal. Otherwise, returns
24208 NULL_TREE. */
24210 static tree
24212 {
24214 tree asm_specification;
24216 /* Peek at the next token. */
24218 /* If the next token isn't the `asm' keyword, then there's no
24219 asm-specification. */
24223 /* Consume the `asm' token. */
24225 /* Look for the `('. */
24228 /* Look for the string-literal. */
24231 /* Look for the `)'. */
24235 }
24237 /* Parse an asm-operand-list.
24239 asm-operand-list:
24240 asm-operand
24241 asm-operand-list , asm-operand
24243 asm-operand:
24244 string-literal ( expression )
24245 [ string-literal ] string-literal ( expression )
24247 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24248 each node is the expression. The TREE_PURPOSE is itself a
24249 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24250 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24251 is a STRING_CST for the string literal before the parenthesis. Returns
24252 ERROR_MARK_NODE if any of the operands are invalid. */
24254 static tree
24256 {
24261 {
24262 tree string_literal;
24263 tree expression;
24264 tree name;
24267 {
24268 /* Consume the `[' token. */
24270 /* Read the operand name. */
24275 /* Look for the closing `]'. */
24277 }
24278 else
24280 /* Look for the string-literal. */
24283 /* Look for the `('. */
24285 /* Parse the expression. */
24287 /* Look for the `)'. */
24295 /* Add this operand to the list. */
24297 expression,
24298 asm_operands);
24299 /* If the next token is not a `,', there are no more
24300 operands. */
24303 /* Consume the `,'. */
24305 }
24308 }
24310 /* Parse an asm-clobber-list.
24312 asm-clobber-list:
24313 string-literal
24314 asm-clobber-list , string-literal
24316 Returns a TREE_LIST, indicating the clobbers in the order that they
24317 appeared. The TREE_VALUE of each node is a STRING_CST. */
24319 static tree
24321 {
24325 {
24326 tree string_literal;
24328 /* Look for the string literal. */
24330 /* Add it to the list. */
24332 /* If the next token is not a `,', then the list is
24333 complete. */
24336 /* Consume the `,' token. */
24338 }
24341 }
24343 /* Parse an asm-label-list.
24345 asm-label-list:
24346 identifier
24347 asm-label-list , identifier
24349 Returns a TREE_LIST, indicating the labels in the order that they
24350 appeared. The TREE_VALUE of each node is a label. */
24352 static tree
24354 {
24358 {
24361 /* Look for the identifier. */
24364 {
24367 {
24373 }
24374 }
24375 /* If the next token is not a `,', then the list is
24376 complete. */
24379 /* Consume the `,' token. */
24381 }
24384 }
24386 /* Return TRUE iff the next tokens in the stream are possibly the
24387 beginning of a GNU extension attribute. */
24389 static bool
24391 {
24393 }
24395 /* Return TRUE iff the next tokens in the stream are possibly the
24396 beginning of a standard C++-11 attribute specifier. */
24398 static bool
24400 {
24402 }
24404 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24405 beginning of a standard C++-11 attribute specifier. */
24407 static bool
24409 {
24417 }
24419 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24420 beginning of a GNU extension attribute. */
24422 static bool
24424 {
24428 }
24430 /* Return true iff the next tokens can be the beginning of either a
24431 GNU attribute list, or a standard C++11 attribute sequence. */
24433 static bool
24435 {
24438 }
24440 /* Return true iff the next Nth tokens can be the beginning of either
24441 a GNU attribute list, or a standard C++11 attribute sequence. */
24443 static bool
24445 {
24448 }
24450 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24451 of GNU attributes, or return NULL. */
24453 static tree
24455 {
24459 }
24461 #define CILK_SIMD_FN_CLAUSE_MASK \
24462 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24463 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24464 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24465 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24466 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24468 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24469 vector [(<clauses>)] */
24471 static void
24473 {
24477 {
24483 }
24486 {
24489 paren_scope++;
24490 }
24492 {
24495 paren_scope++;
24497 paren_scope--;
24498 /* Do not push the last ')' */
24501 }
24510 }
24512 /* Parse an (optional) series of attributes.
24514 attributes:
24515 attributes attribute
24517 attribute:
24518 __attribute__ (( attribute-list [opt] ))
24520 The return value is as for cp_parser_gnu_attribute_list. */
24522 static tree
24524 {
24528 {
24530 tree attribute_list;
24533 /* Peek at the next token. */
24535 /* If it's not `__attribute__', then we're done. */
24539 /* Consume the `__attribute__' keyword. */
24541 /* Look for the two `(' tokens. */
24545 /* Peek at the next token. */
24548 /* Parse the attribute-list. */
24550 else
24551 /* If the next token is a `)', then there is no attribute
24552 list. */
24555 /* Look for the two `)' tokens. */
24563 /* Add these new attributes to the list. */
24565 }
24568 }
24570 /* Parse a GNU attribute-list.
24572 attribute-list:
24573 attribute
24574 attribute-list , attribute
24576 attribute:
24577 identifier
24578 identifier ( identifier )
24579 identifier ( identifier , expression-list )
24580 identifier ( expression-list )
24582 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24583 to an attribute. The TREE_PURPOSE of each node is the identifier
24584 indicating which attribute is in use. The TREE_VALUE represents
24585 the arguments, if any. */
24587 static tree
24589 {
24595 {
24597 tree identifier;
24598 tree attribute;
24600 /* Look for the identifier. We also allow keywords here; for
24601 example `__attribute__ ((const))' is legal. */
24605 {
24608 /* Consume the token, but save it since we need it for the
24609 SIMD enabled function parsing. */
24612 /* Save away the identifier that indicates which attribute
24613 this is. */
24615 /* For keywords, use the canonical spelling, not the
24616 parsed identifier. */
24622 /* Peek at the next token. */
24624 /* If it's an `(', then parse the attribute arguments. */
24626 {
24631 {
24634 }
24635 else
24636 vec = cp_parser_parenthesized_expression_list
24642 else
24643 {
24646 }
24647 /* Save the arguments away. */
24649 }
24651 {
24654 }
24657 {
24658 /* Add this attribute to the list. */
24661 }
24664 }
24665 /* Now, look for more attributes. If the next token isn't a
24666 `,', we're done. */
24670 /* Consume the comma and keep going. */
24672 }
24675 /* We built up the list in reverse order. */
24677 }
24679 /* Parse a standard C++11 attribute.
24681 The returned representation is a TREE_LIST which TREE_PURPOSE is
24682 the scoped name of the attribute, and the TREE_VALUE is its
24683 arguments list.
24685 Note that the scoped name of the attribute is itself a TREE_LIST
24686 which TREE_PURPOSE is the namespace of the attribute, and
24687 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24688 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24689 and which TREE_PURPOSE is directly the attribute name.
24691 Clients of the attribute code should use get_attribute_namespace
24692 and get_attribute_name to get the actual namespace and name of
24693 attributes, regardless of their being GNU or C++11 attributes.
24695 attribute:
24696 attribute-token attribute-argument-clause [opt]
24698 attribute-token:
24699 identifier
24700 attribute-scoped-token
24702 attribute-scoped-token:
24703 attribute-namespace :: identifier
24705 attribute-namespace:
24706 identifier
24708 attribute-argument-clause:
24709 ( balanced-token-seq )
24711 balanced-token-seq:
24712 balanced-token [opt]
24713 balanced-token-seq balanced-token
24715 balanced-token:
24716 ( balanced-token-seq )
24717 [ balanced-token-seq ]
24718 { balanced-token-seq }. */
24720 static tree
24722 {
24726 /* First, parse name of the attribute, a.k.a attribute-token. */
24743 {
24744 /* We are seeing a scoped attribute token. */
24759 else
24760 {
24764 }
24766 NULL_TREE);
24768 }
24771 NULL_TREE);
24772 else
24773 {
24775 NULL_TREE);
24776 /* C++11 noreturn attribute is equivalent to GNU's. */
24779 /* C++14 deprecated attribute is equivalent to GNU's. */
24782 /* C++17 fallthrough attribute is equivalent to GNU's. */
24785 /* Transactional Memory TS optimize_for_synchronized attribute is
24786 equivalent to GNU transaction_callable. */
24790 /* Transactional Memory attributes are GNU attributes. */
24793 }
24795 /* Now parse the optional argument clause of the attribute. */
24800 {
24806 /* A GNU attribute that takes an identifier in parameter. */
24809 vec = cp_parser_parenthesized_expression_list
24815 else
24816 {
24819 }
24823 else
24825 }
24828 }
24830 /* Check that the attribute ATTRIBUTE appears at most once in the
24831 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24832 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24833 isn't implemented yet in GCC. */
24835 static void
24837 {
24839 {
24849 }
24850 }
24852 /* Parse a list of standard C++-11 attributes.
24854 attribute-list:
24855 attribute [opt]
24856 attribute-list , attribute[opt]
24857 attribute ...
24858 attribute-list , attribute ...
24859 */
24861 static tree
24863 {
24868 {
24873 {
24877 }
24880 {
24885 else
24886 {
24891 }
24893 }
24897 }
24900 }
24902 /* Parse a standard C++-11 attribute specifier.
24904 attribute-specifier:
24905 [ [ attribute-using-prefix [opt] attribute-list ] ]
24906 alignment-specifier
24908 attribute-using-prefix:
24909 using attribute-namespace :
24911 alignment-specifier:
24912 alignas ( type-id ... [opt] )
24913 alignas ( alignment-expression ... [opt] ). */
24915 static tree
24917 {
24923 {
24930 {
24941 {
24945 "attribute using prefix only available "
24951 }
24952 else
24954 }
24961 else
24962 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24963 when we are sure that we have actually parsed them. */
24965 }
24966 else
24967 {
24968 tree alignas_expr;
24970 /* Look for an alignment-specifier. */
24982 {
24985 }
24991 {
24998 }
25003 /* Handle alignas (pack...). */
25005 {
25008 }
25010 /* Something went wrong, so don't build the attribute. */
25015 {
25018 }
25020 /* Build the C++-11 representation of an 'aligned'
25021 attribute. */
25022 attributes =
25025 alignas_expr);
25026 }
25029 }
25031 /* Parse a standard C++-11 attribute-specifier-seq.
25033 attribute-specifier-seq:
25034 attribute-specifier-seq [opt] attribute-specifier
25035 */
25037 static tree
25039 {
25044 {
25053 else
25056 }
25059 }
25061 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25062 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25063 current value of the PEDANTIC flag, regardless of whether or not
25064 the `__extension__' keyword is present. The caller is responsible
25065 for restoring the value of the PEDANTIC flag. */
25067 static bool
25069 {
25070 /* Save the old value of the PEDANTIC flag. */
25074 {
25075 /* Consume the `__extension__' token. */
25077 /* We're not being pedantic while the `__extension__' keyword is
25078 in effect. */
25082 }
25085 }
25087 /* Parse a label declaration.
25089 label-declaration:
25090 __label__ label-declarator-seq ;
25092 label-declarator-seq:
25093 identifier , label-declarator-seq
25094 identifier */
25096 static void
25098 {
25099 /* Look for the `__label__' keyword. */
25103 {
25104 tree identifier;
25106 /* Look for an identifier. */
25108 /* If we failed, stop. */
25111 /* Declare it as a label. */
25113 /* If the next token is a `;', stop. */
25116 /* Look for the `,' separating the label declarations. */
25118 }
25120 /* Look for the final `;'. */
25122 }
25124 // -------------------------------------------------------------------------- //
25125 // Requires Clause
25127 // Parse a requires clause.
25128 //
25129 // requires-clause:
25130 // 'requires' logical-or-expression
25131 //
25132 // The required logical-or-expression must be a constant expression. Note
25133 // that we don't check that the expression is constepxr here. We defer until
25134 // we analyze constraints and then, we only check atomic constraints.
25135 static tree
25137 {
25138 // Parse the requires clause so that it is not automatically folded.
25146 }
25148 // Optionally parse a requires clause:
25149 static tree
25151 {
25154 {
25157 {
25160 /* Parse and discard the requires-clause. */
25163 }
25165 }
25168 }
25171 /*---------------------------------------------------------------------------
25172 Requires expressions
25173 ---------------------------------------------------------------------------*/
25175 /* Parse a requires expression
25177 requirement-expression:
25178 'requires' requirement-parameter-list [opt] requirement-body */
25179 static tree
25181 {
25185 /* A requires-expression shall appear only within a concept
25186 definition or a requires-clause.
25188 TODO: Implement this diagnostic correctly. */
25190 {
25194 }
25197 {
25198 /* Local parameters are delared as variables within the scope
25199 of the expression. They are not visible past the end of
25200 the expression. Expressions within the requires-expression
25201 are unevaluated. */
25202 struct scope_sentinel
25203 {
25205 {
25208 }
25211 {
25214 }
25217 /* Parse the optional parameter list. */
25219 {
25223 }
25224 else
25227 /* Parse the requirement body. */
25231 }
25233 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25234 the parm chain. */
25237 }
25239 /* Parse a parameterized requirement.
25241 requirement-parameter-list:
25242 '(' parameter-declaration-clause ')' */
25243 static tree
25245 {
25255 }
25257 /* Parse the body of a requirement.
25259 requirement-body:
25260 '{' requirement-list '}' */
25261 static tree
25263 {
25273 }
25275 /* Parse a list of requirements.
25277 requirement-list:
25278 requirement
25279 requirement-list ';' requirement[opt] */
25280 static tree
25282 {
25285 {
25292 /* If we see a semi-colon, consume it. */
25296 /* Stop processing at the end of the list. */
25299 }
25301 /* Reverse the order of requirements so they are analyzed in
25302 declaration order. */
25304 }
25306 /* Parse a syntactic requirement or type requirement.
25308 requirement:
25309 simple-requirement
25310 compound-requirement
25311 type-requirement
25312 nested-requirement */
25313 static tree
25315 {
25322 else
25324 }
25326 /* Parse a simple requirement.
25328 simple-requirement:
25329 expression ';' */
25330 static tree
25332 {
25341 }
25343 /* Parse a type requirement
25345 type-requirement
25346 nested-name-specifier [opt] required-type-name ';'
25348 required-type-name:
25349 type-name
25350 'template' [opt] simple-template-id */
25351 static tree
25353 {
25356 // Save the scope before parsing name specifiers.
25367 tree type;
25369 {
25378 }
25379 else
25398 }
25400 /* Parse a compound requirement
25402 compound-requirement:
25403 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25404 static tree
25406 {
25407 /* Parse an expression enclosed in '{ }'s. */
25418 /* Parse the optional noexcept. */
25421 {
25424 }
25426 /* Parse the optional trailing return type. */
25429 {
25437 }
25440 }
25442 /* Parse a nested requirement. This is the same as a requires clause.
25444 nested-requirement:
25445 requires-clause */
25446 static tree
25448 {
25454 }
25456 /* Support Functions */
25458 /* Return the appropriate prefer_type argument for lookup_name_real based on
25459 tag_type and template_mem_access. */
25463 {
25464 /* DR 141: When looking in the current enclosing context for a template-name
25465 after -> or ., only consider class templates. */
25469 {
25473 }
25474 }
25476 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25477 NAME should have one of the representations used for an
25478 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25479 is returned. If PARSER->SCOPE is a dependent type, then a
25480 SCOPE_REF is returned.
25482 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25483 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25484 was formed. Abstractly, such entities should not be passed to this
25485 function, because they do not need to be looked up, but it is
25486 simpler to check for this special case here, rather than at the
25487 call-sites.
25489 In cases not explicitly covered above, this function returns a
25490 DECL, OVERLOAD, or baselink representing the result of the lookup.
25491 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25492 is returned.
25494 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25495 (e.g., "struct") that was used. In that case bindings that do not
25496 refer to types are ignored.
25498 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25499 ignored.
25501 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25502 are ignored.
25504 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25505 types.
25507 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25508 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25509 NULL_TREE otherwise. */
25511 static cp_expr
25518 location_t name_location)
25519 {
25520 tree decl;
25523 /* Assume that the lookup will be unambiguous. */
25527 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25528 no longer valid. Note that if we are parsing tentatively, and
25529 the parse fails, OBJECT_TYPE will be automatically restored. */
25535 /* A template-id has already been resolved; there is no lookup to
25536 do. */
25540 {
25544 }
25546 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25547 it should already have been checked to make sure that the name
25548 used matches the type being destroyed. */
25550 {
25551 tree type;
25553 /* Figure out to which type this destructor applies. */
25558 else
25560 /* If that's not a class type, there is no destructor. */
25567 /* If it was a class type, return the destructor. */
25569 }
25571 /* By this point, the NAME should be an ordinary identifier. If
25572 the id-expression was a qualified name, the qualifying scope is
25573 stored in PARSER->SCOPE at this point. */
25576 /* Perform the lookup. */
25578 {
25584 /* If the SCOPE is dependent, the lookup must be deferred until
25585 the template is instantiated -- unless we are explicitly
25586 looking up names in uninstantiated templates. Even then, we
25587 cannot look up the name if the scope is not a class type; it
25588 might, for example, be a template type parameter. */
25593 /* Defer lookup. */
25595 else
25596 {
25599 /* If PARSER->SCOPE is a dependent type, then it must be a
25600 class type, and we must not be checking dependencies;
25601 otherwise, we would have processed this lookup above. So
25602 that PARSER->SCOPE is not considered a dependent base by
25603 lookup_member, we must enter the scope here. */
25607 /* If the PARSER->SCOPE is a template specialization, it
25608 may be instantiated during name lookup. In that case,
25609 errors may be issued. Even if we rollback the current
25610 tentative parse, those errors are valid. */
25615 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25616 lookup result and the nested-name-specifier nominates a class C:
25617 * if the name specified after the nested-name-specifier, when
25618 looked up in C, is the injected-class-name of C (Clause 9), or
25619 * if the name specified after the nested-name-specifier is the
25620 same as the identifier or the simple-template-id's template-
25621 name in the last component of the nested-name-specifier,
25622 the name is instead considered to name the constructor of
25623 class C. [ Note: for example, the constructor is not an
25624 acceptable lookup result in an elaborated-type-specifier so
25625 the constructor would not be used in place of the
25626 injected-class-name. --end note ] Such a constructor name
25627 shall be used only in the declarator-id of a declaration that
25628 names a constructor or in a using-declaration. */
25636 /* If we have a single function from a using decl, pull it out. */
25643 }
25645 /* If the scope is a dependent type and either we deferred lookup or
25646 we did lookup but didn't find the name, rememeber the name. */
25649 {
25651 {
25652 tree type;
25654 /* The resolution to Core Issue 180 says that `struct
25655 A::B' should be considered a type-name, even if `A'
25656 is dependent. */
25661 }
25665 CPP_CLOSE_PAREN)))
25669 else
25672 is_template);
25673 }
25676 }
25678 {
25679 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25680 OBJECT_TYPE is not a class. */
25682 /* If the OBJECT_TYPE is a template specialization, it may
25683 be instantiated during name lookup. In that case, errors
25684 may be issued. Even if we rollback the current tentative
25685 parse, those errors are valid. */
25687 name,
25690 tf_warning_or_error);
25691 else
25695 /* Look it up in the enclosing context. DR 141: When looking for a
25696 template-name after -> or ., only consider class templates. */
25701 /* The object is type-dependent, so we can't look anything up; we used
25702 this to get the DR 141 behavior. */
25706 }
25707 else
25708 {
25714 }
25716 /* If the lookup failed, let our caller know. */
25720 /* Pull out the template from an injected-class-name (or multiple). */
25724 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25726 {
25729 /* The error message we have to print is too complicated for
25730 cp_parser_error, so we incorporate its actions directly. */
25732 {
25734 name);
25736 }
25738 }
25746 /* If we have resolved the name of a member declaration, check to
25747 see if the declaration is accessible. When the name resolves to
25748 set of overloaded functions, accessibility is checked when
25749 overload resolution is done.
25751 During an explicit instantiation, access is not checked at all,
25752 as per [temp.explicit]. */
25759 }
25761 /* Like cp_parser_lookup_name, but for use in the typical case where
25762 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25763 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25765 static tree
25767 {
25769 none_type,
25774 location);
25775 }
25777 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25778 the current context, return the TYPE_DECL. If TAG_NAME_P is
25779 true, the DECL indicates the class being defined in a class-head,
25780 or declared in an elaborated-type-specifier.
25782 Otherwise, return DECL. */
25784 static tree
25786 {
25787 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25788 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25790 struct A {
25791 template <typename T> struct B;
25792 };
25794 template <typename T> struct A::B {};
25796 Similarly, in an elaborated-type-specifier:
25798 namespace N { struct X{}; }
25800 struct A {
25801 template <typename T> friend struct N::X;
25802 };
25804 However, if the DECL refers to a class type, and we are in
25805 the scope of the class, then the name lookup automatically
25806 finds the TYPE_DECL created by build_self_reference rather
25807 than a TEMPLATE_DECL. For example, in:
25809 template <class T> struct S {
25810 S s;
25811 };
25813 there is no need to handle such case. */
25819 }
25821 /* If too many, or too few, template-parameter lists apply to the
25822 declarator, issue an error message. Returns TRUE if all went well,
25823 and FALSE otherwise. */
25825 static bool
25828 location_t declarator_location)
25829 {
25831 {
25833 {
25841 /* If the DECLARATOR has the form `X<y>' then it uses one
25842 additional level of template parameters. */
25845 return cp_parser_check_template_parameters
25847 }
25863 }
25865 }
25867 /* NUM_TEMPLATES were used in the current declaration. If that is
25868 invalid, return FALSE and issue an error messages. Otherwise,
25869 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25870 declarator and we can print more accurate diagnostics. */
25872 static bool
25875 location_t location,
25877 {
25878 /* If there are the same number of template classes and parameter
25879 lists, that's OK. */
25882 /* If there are more, but only one more, then we are referring to a
25883 member template. That's OK too. */
25886 /* If there are more template classes than parameter lists, we have
25887 something like:
25889 template <class T> void S<T>::R<T>::f (); */
25891 {
25901 else
25904 }
25905 /* Otherwise, there are too many template parameter lists. We have
25906 something like:
25908 template <class T> template <class U> void S::f(); */
25911 }
25913 /* Parse an optional `::' token indicating that the following name is
25914 from the global namespace. If so, PARSER->SCOPE is set to the
25915 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25916 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25917 Returns the new value of PARSER->SCOPE, if the `::' token is
25918 present, and NULL_TREE otherwise. */
25920 static tree
25922 {
25925 /* Peek at the next token. */
25927 /* If we're looking at a `::' token then we're starting from the
25928 global namespace, not our current location. */
25930 {
25931 /* Consume the `::' token. */
25933 /* Set the SCOPE so that we know where to start the lookup. */
25939 }
25941 {
25945 }
25948 }
25950 /* Returns TRUE if the upcoming token sequence is the start of a
25951 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
25952 declarator is preceded by the `friend' specifier. */
25954 static bool
25956 {
25959 tree nested_name_specifier;
25962 /* The common case is that this is not a constructor declarator, so
25963 try to avoid doing lots of work if at all possible. It's not
25964 valid declare a constructor at function scope. */
25967 /* And only certain tokens can begin a constructor declarator. */
25975 /* Parse tentatively; we are going to roll back all of the tokens
25976 consumed here. */
25978 /* Assume that we are looking at a constructor declarator. */
25981 /* Look for the optional `::' operator. */
25984 /* Look for the nested-name-specifier. */
25985 nested_name_specifier
25996 /* Outside of a class-specifier, there must be a
25997 nested-name-specifier. Except in C++17 mode, where we
25998 might be declaring a guiding declaration. */
26005 /* If we have a class scope, this is easy; DR 147 says that S::S always
26006 names the constructor, and no other qualified name could. */
26009 {
26019 }
26020 /* If we still think that this might be a constructor-declarator,
26021 look for a class-name. */
26023 {
26024 /* If we have:
26026 template <typename T> struct S {
26027 S();
26028 };
26030 we must recognize that the nested `S' names a class. */
26034 tree type_decl;
26038 none_type,
26045 {
26051 none_type,
26056 else
26058 }
26060 /* If there was no class-name, then this is not a constructor.
26061 Otherwise, if we are in a class-specifier and we aren't
26062 handling a friend declaration, check that its type matches
26063 current_class_type (c++/38313). Note: error_mark_node
26064 is left alone for error recovery purposes. */
26066 && (outside_class_specifier_p
26072 /* If we're still considering a constructor, we have to see a `(',
26073 to begin the parameter-declaration-clause, followed by either a
26074 `)', an `...', or a decl-specifier. We need to check for a
26075 type-specifier to avoid being fooled into thinking that:
26077 S (f) (int);
26079 is a constructor. (It is actually a function named `f' that
26080 takes one parameter (of type `int') and returns a value of type
26081 `S'. */
26089 /* A parameter declaration begins with a decl-specifier,
26090 which is either the "attribute" keyword, a storage class
26091 specifier, or (usually) a type-specifier. */
26093 {
26094 tree type;
26098 /* Names appearing in the type-specifier should be looked up
26099 in the scope of the class. */
26103 {
26106 {
26110 {
26113 }
26114 }
26116 }
26118 /* Inside the constructor parameter list, surrounding
26119 template-parameter-lists do not apply. */
26120 saved_num_template_parameter_lists
26124 /* Look for the type-specifier. */
26126 CP_PARSER_FLAGS_NONE,
26132 parser->num_template_parameter_lists
26135 /* Leave the scope of the class. */
26140 }
26141 }
26143 /* We did not really want to consume any tokens. */
26147 }
26149 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26150 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26151 they must be performed once we are in the scope of the function.
26153 Returns the function defined. */
26155 static tree
26156 cp_parser_function_definition_from_specifiers_and_declarator
26159 tree attributes,
26161 {
26162 tree fn;
26165 /* Begin the function-definition. */
26168 /* The things we're about to see are not directly qualified by any
26169 template headers we've seen thus far. */
26172 /* If there were names looked up in the decl-specifier-seq that we
26173 did not check, check them now. We must wait until we are in the
26174 scope of the function to perform the checks, since the function
26175 might be a friend. */
26179 {
26184 }
26187 {
26188 /* Skip the entire function. */
26191 }
26193 {
26194 /* Seen already, skip it. An error message has already been output. */
26198 /* If this is a function from a class, pop the nested class. */
26201 }
26202 else
26203 {
26204 timevar_id_t tv;
26207 else
26213 }
26216 }
26218 /* Parse the part of a function-definition that follows the
26219 declarator. INLINE_P is TRUE iff this function is an inline
26220 function defined within a class-specifier.
26222 Returns the function defined. */
26224 static tree
26227 {
26228 tree fn;
26234 bool fully_implicit_function_template_p
26237 tree implicit_template_parms
26240 cp_binding_level* implicit_template_scope
26246 /* If the next token is `return', then the code may be trying to
26247 make use of the "named return value" extension that G++ used to
26248 support. */
26251 {
26252 /* Consume the `return' keyword. */
26254 /* Look for the identifier that indicates what value is to be
26255 returned. */
26257 /* Issue an error message. */
26260 /* Skip tokens until we reach the start of the function body. */
26262 {
26269 }
26270 }
26271 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26272 anything declared inside `f'. */
26273 saved_in_unbraced_linkage_specification_p
26276 /* Inside the function, surrounding template-parameter-lists do not
26277 apply. */
26278 saved_num_template_parameter_lists
26284 /* If the next token is `try', `__transaction_atomic', or
26285 `__transaction_relaxed`, then we are looking at either function-try-block
26286 or function-transaction-block. Note that all of these include the
26287 function-body. */
26290 RID_TRANSACTION_ATOMIC);
26292 RID_TRANSACTION_RELAXED))
26294 RID_TRANSACTION_RELAXED);
26297 else
26298 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26303 /* Finish the function. */
26306 /* Generate code for it, if necessary. */
26308 /* Restore the saved values. */
26309 parser->in_unbraced_linkage_specification_p
26311 parser->num_template_parameter_lists
26315 parser->fully_implicit_function_template_p
26317 parser->implicit_template_parms
26319 parser->implicit_template_scope
26326 }
26328 /* Parse a template-declaration body (following argument list). */
26330 static void
26332 tree parameter_list,
26334 {
26338 /* We just processed one more parameter list. */
26341 /* Get the deferred access checks from the parameter list. These
26342 will be checked once we know what is being declared, as for a
26343 member template the checks must be performed in the scope of the
26344 class containing the member. */
26347 /* Tentatively parse for a new template parameter list, which can either be
26348 the template keyword or a template introduction. */
26354 else
26355 {
26356 /* There are no access checks when parsing a template, as we do not
26357 know if a specialization will be a friend. */
26361 checks,
26362 member_p,
26367 /* If this is a member template declaration, let the front
26368 end know. */
26370 {
26375 }
26380 }
26381 /* We are done with the current parameter list. */
26386 /* Finish up. */
26389 /* Check the template arguments for a literal operator template. */
26393 {
26397 else
26398 {
26401 {
26407 }
26409 {
26418 }
26419 else
26421 }
26423 {
26426 " Expected non-type template argument pack <char...>"
26428 decl);
26429 else
26432 decl);
26433 }
26434 }
26436 /* Register member declarations. */
26439 /* If DECL is a function template, we must return to parse it later.
26440 (Even though there is no definition, there might be default
26441 arguments that need handling.) */
26445 }
26447 /* Parse a template introduction header for a template-declaration. Returns
26448 false if tentative parse fails. */
26450 static bool
26452 {
26459 /* Look for the optional `::' operator. */
26462 /* Look for the nested-name-specifier. */
26472 /* Look up the concept for which we will be matching
26473 template parameters. */
26483 /* Look for opening brace for introduction. */
26491 /* Build vector of placeholder parameters and grab
26492 matching identifiers. */
26495 /* The introduction-list shall not be empty. */
26498 {
26501 }
26503 /* Look for closing brace for introduction. */
26508 {
26512 }
26514 /* Build and associate the constraint. */
26517 {
26519 member_p);
26521 }
26525 }
26527 /* Parse a normal template-declaration following the template keyword. */
26529 static void
26531 {
26532 tree parameter_list;
26536 /* Look for the `<' token. */
26540 {
26541 /* 14.5.2.2 [temp.mem]
26543 A local class shall not have member templates. */
26548 }
26549 /* [temp]
26551 A template ... shall not have C linkage. */
26553 {
26555 /* Give it C++ linkage to avoid confusing other parts of the
26556 front end. */
26559 }
26560 else
26563 /* We cannot perform access checks on the template parameter
26564 declarations until we know what is being declared, just as we
26565 cannot check the decl-specifier list. */
26568 /* If the next token is `>', then we have an invalid
26569 specialization. Rather than complain about an invalid template
26570 parameter, issue an error message here. */
26572 {
26576 }
26577 else
26578 {
26579 /* Parse the template parameters. */
26581 }
26583 /* Look for the `>'. */
26586 /* Manage template requirements */
26588 {
26593 }
26596 member_p);
26598 /* For the erroneous case of a template with C linkage, we pushed an
26599 implicit C++ linkage scope; exit that scope now. */
26602 }
26604 /* Parse a template-declaration, assuming that the `export' (and
26605 `extern') keywords, if present, has already been scanned. MEMBER_P
26606 is as for cp_parser_template_declaration. */
26608 static bool
26610 {
26612 {
26616 }
26621 }
26623 /* Perform the deferred access checks from a template-parameter-list.
26624 CHECKS is a TREE_LIST of access checks, as returned by
26625 get_deferred_access_checks. */
26627 static void
26628 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26629 {
26633 }
26635 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26636 `function-definition' sequence that follows a template header.
26637 If MEMBER_P is true, this declaration appears in a class scope.
26639 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26640 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26642 static tree
26648 {
26651 cp_decl_specifier_seq decl_specifiers;
26655 /* This function is only used when processing a template
26656 declaration. */
26660 /* Defer access checks until we know what is being declared. */
26663 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26664 alternative. */
26667 CP_PARSER_FLAGS_OPTIONAL,
26673 /* There are no template typedefs. */
26675 {
26679 }
26681 /* Gather up the access checks that occurred the
26682 decl-specifier-seq. */
26685 /* Check for the declaration of a template class. */
26687 {
26690 {
26691 // If this is a declaration, but not a definition, associate
26692 // any constraints with the type declaration. Constraints
26693 // are associated with definitions in cp_parser_class_specifier.
26699 /* In this case:
26701 struct C {
26702 friend template <typename T> struct A<T>::B;
26703 };
26705 A<T>::B will be represented by a TYPENAME_TYPE, and
26706 therefore not recognized by shadow_tag. */
26708 && !decl
26715 else
26718 /* Perform access checks for template parameters. */
26721 /* Give a helpful diagnostic for
26722 template <class T> struct A { } a;
26723 if we aren't already recovering from an error. */
26726 {
26728 "a class template declaration must not declare "
26732 }
26733 }
26734 }
26736 /* Complain about missing 'typename' or other invalid type names. */
26739 {
26740 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26741 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26742 the rest of this declaration. */
26745 }
26747 /* If it's not a template class, try for a template function. If
26748 the next token is a `;', then this declaration does not declare
26749 anything. But, if there were errors in the decl-specifiers, then
26750 the error might well have come from an attempted class-specifier.
26751 In that case, there's no need to warn about a missing declarator. */
26755 {
26758 checks,
26760 member_p,
26761 declares_class_or_enum,
26765 /* 7.1.1-1 [dcl.stc]
26767 A storage-class-specifier shall not be specified in an explicit
26768 specialization... */
26770 && explicit_specialization_p
26772 {
26776 }
26780 }
26782 /* Look for a trailing `;' after the declaration. */
26788 out:
26791 /* Clear any current qualification; whatever comes next is the start
26792 of something new. */
26798 }
26800 /* Parse a cast-expression that is not the operand of a unary "&". */
26802 static cp_expr
26804 {
26807 }
26809 /* Parse a functional cast to TYPE. Returns an expression
26810 representing the cast. */
26812 static cp_expr
26814 {
26816 tree expression_list;
26817 cp_expr cast;
26826 {
26836 /* Create a location of the form:
26837 type_name{i, f}
26838 ^~~~~~~~~~~~~~~
26839 with caret == start at the start of the type name,
26840 finishing at the closing brace. */
26841 location_t finish_loc
26844 finish_loc);
26847 }
26856 else
26857 {
26860 }
26863 tf_warning_or_error);
26864 /* [expr.const]/1: In an integral constant expression "only type
26865 conversions to integral or enumeration type can be used". */
26871 NIC_CONSTRUCTOR))
26874 /* Create a location of the form:
26875 float(i)
26876 ^~~~~~~~
26877 with caret == start at the start of the type name,
26878 finishing at the closing paren. */
26879 location_t finish_loc
26884 }
26886 /* Save the tokens that make up the body of a member function defined
26887 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26888 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26889 specifiers applied to the declaration. Returns the FUNCTION_DECL
26890 for the member function. */
26892 static tree
26896 tree attributes)
26897 {
26900 tree fn;
26903 /* Create the FUNCTION_DECL. */
26907 /* If something went badly wrong, bail out now. */
26909 {
26910 /* If there's a function-body, skip it. */
26915 }
26917 /* Remember it, if there default args to post process. */
26920 /* Save away the tokens that make up the body of the
26921 function. */
26927 RID_TRANSACTION_ATOMIC))
26928 {
26930 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
26937 {
26943 }
26944 else
26947 {
26951 }
26952 }
26954 /* Handle function try blocks. */
26956 {
26959 }
26960 /* We can have braced-init-list mem-initializers before the fn body. */
26962 {
26965 {
26966 /* cache_group will stop after an un-nested { } pair, too. */
26970 /* variadic mem-inits have ... after the ')'. */
26973 }
26974 }
26976 /* Handle function try blocks. */
26982 /* Save away the inline definition; we will process it when the
26983 class is complete. */
26987 /* We need to know that this was defined in the class, so that
26988 friend templates are handled correctly. */
26991 /* Add FN to the queue of functions to be parsed later. */
26995 }
26997 /* Save the tokens that make up the in-class initializer for a non-static
26998 data member. Returns a DEFAULT_ARG. */
27000 static tree
27002 {
27004 }
27006 /* Parse a template-argument-list, as well as the trailing ">" (but
27007 not the opening "<"). See cp_parser_template_argument_list for the
27008 return value. */
27010 static tree
27012 {
27013 tree arguments;
27014 tree saved_scope;
27015 tree saved_qualifying_scope;
27016 tree saved_object_scope;
27021 /* [temp.names]
27023 When parsing a template-id, the first non-nested `>' is taken as
27024 the end of the template-argument-list rather than a greater-than
27025 operator. */
27026 saved_greater_than_is_operator_p
27029 /* Parsing the argument list may modify SCOPE, so we save it
27030 here. */
27034 /* We need to evaluate the template arguments, even though this
27035 template-id may be nested within a "sizeof". */
27040 /* Parse the template-argument-list itself. */
27044 else
27046 /* Look for the `>' that ends the template-argument-list. If we find
27047 a '>>' instead, it's probably just a typo. */
27049 {
27051 {
27052 /* In C++0x, a `>>' in a template argument list or cast
27053 expression is considered to be two separate `>'
27054 tokens. So, change the current token to a `>', but don't
27055 consume it: it will be consumed later when the outer
27056 template argument list (or cast expression) is parsed.
27057 Note that this replacement of `>' for `>>' is necessary
27058 even if we are parsing tentatively: in the tentative
27059 case, after calling
27060 cp_parser_enclosed_template_argument_list we will always
27061 throw away all of the template arguments and the first
27062 closing `>', either because the template argument list
27063 was erroneous or because we are replacing those tokens
27064 with a CPP_TEMPLATE_ID token. The second `>' (which will
27065 not have been thrown away) is needed either to close an
27066 outer template argument list or to complete a new-style
27067 cast. */
27070 }
27072 {
27073 /* If we're in a nested template argument list, the '>>' has
27074 to be a typo for '> >'. We emit the error message, but we
27075 continue parsing and we push a '>' as next token, so that
27076 the argument list will be parsed correctly. Note that the
27077 global source location is still on the token before the
27078 '>>', so we need to say explicitly where we want it. */
27086 }
27087 else
27088 {
27089 /* If this is not a nested template argument list, the '>>'
27090 is a typo for '>'. Emit an error message and continue.
27091 Same deal about the token location, but here we can get it
27092 right by consuming the '>>' before issuing the diagnostic. */
27095 "spurious %<>>%>, use %<>%> to terminate "
27097 }
27098 }
27099 else
27101 /* The `>' token might be a greater-than operator again now. */
27102 parser->greater_than_is_operator_p
27104 /* Restore the SAVED_SCOPE. */
27112 }
27114 /* MEMBER_FUNCTION is a member function, or a friend. If default
27115 arguments, or the body of the function have not yet been parsed,
27116 parse them now. */
27118 static void
27120 {
27122 /* If this member is a template, get the underlying
27123 FUNCTION_DECL. */
27127 /* There should not be any class definitions in progress at this
27128 point; the bodies of members are only parsed outside of all class
27129 definitions. */
27131 /* While we're parsing the member functions we might encounter more
27132 classes. We want to handle them right away, but we don't want
27133 them getting mixed up with functions that are currently in the
27134 queue. */
27137 /* Make sure that any template parameters are in scope. */
27140 /* If the body of the function has not yet been parsed, parse it
27141 now. */
27143 {
27144 tree function_scope;
27147 /* The function is no longer pending; we are processing it. */
27152 /* If this is a local class, enter the scope of the containing
27153 function. */
27158 /* Push the body of the function onto the lexer stack. */
27161 /* Let the front end know that we going to be defining this
27162 function. */
27166 /* Don't do access checking if it is a templated function. */
27170 /* #pragma omp declare reduction needs special parsing. */
27172 {
27177 }
27178 else
27179 /* Now, parse the body of the function. */
27186 /* Leave the scope of the containing function. */
27190 }
27192 /* Remove any template parameters from the symbol table. */
27195 /* Restore the queue. */
27198 }
27200 /* If DECL contains any default args, remember it on the unparsed
27201 functions queue. */
27203 static void
27205 {
27206 tree probe;
27209 probe;
27212 {
27216 }
27217 }
27219 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27220 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27221 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27222 from the parameter-type-list. */
27224 static tree
27227 {
27229 tree parsed_arg;
27235 /* Push the saved tokens for the default argument onto the parser's
27236 lexer stack. */
27242 /* Parse the default argument. */
27253 {
27254 /* In a non-template class, check conversions now. In a template,
27255 we'll wait and instantiate these as needed. */
27258 tf_warning_or_error);
27261 else
27263 }
27265 /* If the token stream has not been completely used up, then
27266 there was extra junk after the end of the default
27267 argument. */
27269 {
27272 else
27274 }
27276 /* Revert to the main lexer. */
27280 }
27282 /* FIELD is a non-static data member with an initializer which we saved for
27283 later; parse it now. */
27285 static void
27287 {
27288 tree def;
27295 NULL_TREE);
27301 }
27303 /* FN is a FUNCTION_DECL which may contains a parameter with an
27304 unparsed DEFAULT_ARG. Parse the default args now. This function
27305 assumes that the current scope is the scope in which the default
27306 argument should be processed. */
27308 static void
27310 {
27314 /* While we're parsing the default args, we might (due to the
27315 statement expression extension) encounter more classes. We want
27316 to handle them right away, but we don't want them getting mixed
27317 up with default args that are currently in the queue. */
27320 /* Local variable names (and the `this' keyword) may not appear
27321 in a default argument. */
27332 {
27334 tree parsed_arg;
27336 tree copy;
27343 /* This can happen for a friend declaration for a function
27344 already declared with default arguments. */
27347 parsed_arg
27349 default_arg,
27352 {
27354 }
27358 /* Update any instantiations we've already created. */
27362 }
27366 /* Make sure no default arg is missing. */
27369 /* Restore the state of local_variables_forbidden_p. */
27372 /* Restore the queue. */
27374 }
27376 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27378 sizeof ... ( identifier )
27380 where the 'sizeof' token has already been consumed. */
27382 static tree
27384 {
27385 /* Consume the `...'. */
27392 else
27400 /* The name is not qualified. */
27419 }
27421 /* Parse the operand of `sizeof' (or a similar operator). Returns
27422 either a TYPE or an expression, depending on the form of the
27423 input. The KEYWORD indicates which kind of expression we have
27424 encountered. */
27426 static tree
27428 {
27435 /* If it's a `...', then we are computing the length of a parameter
27436 pack. */
27441 /* Types cannot be defined in a `sizeof' expression. Save away the
27442 old message. */
27444 /* And create the new one. */
27450 /* The restrictions on constant-expressions do not apply inside
27451 sizeof expressions. */
27452 saved_integral_constant_expression_p
27454 saved_non_integral_constant_expression_p
27458 /* Do not actually evaluate the expression. */
27461 /* If it's a `(', then we might be looking at the type-id
27462 construction. */
27464 {
27467 /* We can't be sure yet whether we're looking at a type-id or an
27468 expression. */
27470 /* Note: as a GNU Extension, compound literals are considered
27471 postfix-expressions as they are in C99, so they are valid
27472 arguments to sizeof. See comment in cp_parser_cast_expression
27473 for details. */
27476 else
27477 {
27480 /* Look for the type-id. */
27482 /* Look for the closing `)'. */
27485 }
27487 /* If all went well, then we're done. */
27489 {
27490 cp_decl_specifier_seq decl_specs;
27492 /* Build a trivial decl-specifier-seq. */
27496 /* Call grokdeclarator to figure out what type this is. */
27499 TYPENAME,
27502 }
27503 }
27505 /* If the type-id production did not work out, then we must be
27506 looking at the unary-expression production. */
27510 /* Go back to evaluating expressions. */
27514 /* Free the message we created. */
27516 /* And restore the old one. */
27518 parser->integral_constant_expression_p
27520 parser->non_integral_constant_expression_p
27524 }
27526 /* If the current declaration has no declarator, return true. */
27528 static bool
27530 {
27531 /* If the next token is a `;' or a `,' then there is no
27532 declarator. */
27535 }
27537 /* Update the DECL_SPECS to reflect the storage class indicated by
27538 KEYWORD. */
27540 static void
27545 {
27546 cp_storage_class storage_class;
27549 {
27553 }
27555 {
27558 }
27563 {
27566 }
27569 {
27587 }
27591 /* A storage class specifier cannot be applied alongside a typedef
27592 specifier. If there is a typedef specifier present then set
27593 conflicting_specifiers_p which will trigger an error later
27594 on in grokdeclarator. */
27597 }
27599 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27600 is true, the type is a class or enum definition. */
27602 static void
27604 tree type_spec,
27607 {
27610 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27611 (with, for example, in "typedef int wchar_t;") we remember that
27612 this is what happened. In system headers, we ignore these
27613 declarations so that G++ can work with system headers that are not
27614 C++-safe. */
27616 && !type_definition_p
27626 {
27629 ds_redefined_builtin_type_spec,
27630 token);
27632 {
27636 }
27637 }
27640 else
27641 {
27646 }
27647 }
27649 /* True iff TOKEN is the GNU keyword __thread. */
27651 static bool
27653 {
27656 }
27658 /* Set the location for a declarator specifier and check if it is
27659 duplicated.
27661 DECL_SPECS is the sequence of declarator specifiers onto which to
27662 set the location.
27664 DS is the single declarator specifier to set which location is to
27665 be set onto the existing sequence of declarators.
27667 LOCATION is the location for the declarator specifier to
27668 consider. */
27670 static void
27673 {
27682 {
27686 }
27687 else
27688 {
27690 {
27694 else
27695 {
27698 OPT_Wlong_long,
27700 }
27701 }
27703 {
27708 else
27709 {
27713 }
27714 }
27715 else
27716 {
27732 "__complex"
27733 };
27737 }
27738 }
27739 }
27741 /* Return true iff the declarator specifier DS is present in the
27742 sequence of declarator specifiers DECL_SPECS. */
27744 bool
27746 cp_decl_spec ds)
27747 {
27754 }
27756 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27757 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27759 static bool
27761 {
27763 }
27765 /* Issue an error message indicating that TOKEN_DESC was expected.
27766 If KEYWORD is true, it indicated this function is called by
27767 cp_parser_require_keword and the required token can only be
27768 a indicated keyword. */
27770 static void
27772 required_token token_desc,
27774 {
27776 {
27845 }
27847 {
27849 {
27928 }
27929 }
27930 else
27932 }
27936 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27937 issue an error message indicating that TOKEN_DESC was expected.
27939 Returns the token consumed, if the token had the appropriate type.
27940 Otherwise, returns NULL. */
27945 required_token token_desc)
27946 {
27949 else
27950 {
27951 /* Output the MESSAGE -- unless we're parsing tentatively. */
27955 }
27956 }
27958 /* An error message is produced if the next token is not '>'.
27959 All further tokens are skipped until the desired token is
27960 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27962 static void
27964 {
27965 /* Current level of '< ... >'. */
27967 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27970 /* Are we ready, yet? If not, issue error message. */
27974 /* Skip tokens until the desired token is found. */
27976 {
27977 /* Peek at the next token. */
27979 {
27987 /* C++0x views the `>>' operator as two `>' tokens, but
27988 C++98 does not. */
27991 {
27992 /* We've hit a `>>' where the first `>' closes the
27993 template argument list, and the second `>' is
27994 spurious. Just consume the `>>' and stop; we've
27995 already produced at least one error. */
27998 }
27999 /* Fall through for C++0x, so we handle the second `>' in
28000 the `>>'. */
28005 {
28006 /* We've reached the token we want, consume it and stop. */
28009 }
28028 /* The '>' was probably forgotten, don't look further. */
28033 }
28035 /* Consume this token. */
28037 }
28038 }
28040 /* If the next token is the indicated keyword, consume it. Otherwise,
28041 issue an error message indicating that TOKEN_DESC was expected.
28043 Returns the token consumed, if the token had the appropriate type.
28044 Otherwise, returns NULL. */
28049 required_token token_desc)
28050 {
28054 {
28057 }
28060 }
28062 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28063 function-definition. */
28065 static bool
28067 {
28070 /* A ctor-initializer begins with a `:'. */
28072 /* A function-try-block begins with `try'. */
28074 /* A function-transaction-block begins with `__transaction_atomic'
28075 or `__transaction_relaxed'. */
28078 /* The named return value extension begins with `return'. */
28080 }
28082 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28083 definition. */
28085 static bool
28087 {
28094 }
28096 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28097 C++0x) ending a template-argument. */
28099 static bool
28101 {
28109 }
28111 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28112 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28114 static bool
28117 {
28123 /* Check for the sequence `<::' in the original code. It would be lexed as
28124 `[:', where `[' is a digraph, and there is no whitespace before
28125 `:'. */
28127 {
28132 }
28134 }
28136 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28137 or none_type otherwise. */
28139 static enum tag_types
28141 {
28143 {
28153 }
28154 }
28156 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28157 or none_type otherwise or if the token is null. */
28159 static enum tag_types
28161 {
28166 {
28174 }
28175 }
28177 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28179 static void
28181 {
28185 {
28189 type))
28192 }
28193 }
28195 /* Issue an error message if DECL is redeclared with different
28196 access than its original declaration [class.access.spec/3].
28197 This applies to nested classes, nested class templates and
28198 enumerations [class.mem/1]. */
28200 static void
28202 {
28213 }
28215 /* Look for the `template' keyword, as a syntactic disambiguator.
28216 Return TRUE iff it is present, in which case it will be
28217 consumed. */
28219 static bool
28221 {
28223 {
28224 /* In C++98 the `template' keyword can only be used within templates;
28225 outside templates the parser can always figure out what is a
28226 template and what is not. In C++11, per the resolution of DR 468,
28227 `template' is allowed in cases where it is not strictly necessary. */
28230 {
28233 "in C++98 %<template%> (as a disambiguator) is only "
28235 /* If this part of the token stream is rescanned, the same
28236 error message would be generated. So, we purge the token
28237 from the stream. */
28240 }
28241 else
28242 {
28243 /* Consume the `template' keyword. */
28246 }
28247 }
28249 }
28251 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28252 set PARSER->SCOPE, and perform other related actions. */
28254 static void
28256 {
28259 /* Get the stored value. */
28261 /* Set the scope from the stored value. */
28265 }
28267 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28268 encounter the end of a block before what we were looking for. */
28270 static bool
28274 {
28276 {
28279 /* Abort a parenthesized expression if we encounter a semicolon. */
28283 /* If we've reached the end of the file, stop. */
28289 /* We've hit the end of an enclosing block, so there's been some
28290 kind of syntax error. */
28293 /* Consume the token. */
28295 /* See if it starts a new group. */
28297 {
28299 /* In theory this should probably check end == '}', but
28300 cp_parser_save_member_function_body needs it to exit
28301 after either '}' or ')' when called with ')'. */
28304 }
28306 {
28310 }
28315 }
28316 }
28318 /* Like above, for caching a default argument or NSDMI. Both of these are
28319 terminated by a non-nested comma, but it can be unclear whether or not a
28320 comma is nested in a template argument list unless we do more parsing.
28321 In order to handle this ambiguity, when we encounter a ',' after a '<'
28322 we try to parse what follows as a parameter-declaration-list (in the
28323 case of a default argument) or a member-declarator (in the case of an
28324 NSDMI). If that succeeds, then we stop caching. */
28326 static tree
28328 {
28333 tree default_argument;
28335 /* Add tokens until we have processed the entire default
28336 argument. We add the range [first_token, token). */
28339 {
28340 /* For list-initialization, this is straightforward. */
28343 }
28345 {
28348 /* Peek at the next token. */
28350 /* What we do depends on what token we have. */
28352 {
28353 /* In valid code, a default argument must be
28354 immediately followed by a `,' `)', or `...'. */
28357 {
28358 /* If we've seen a '<', we might be in a
28359 template-argument-list. Until Core issue 325 is
28360 resolved, we don't know how this situation ought
28361 to be handled, so try to DTRT. We check whether
28362 what comes after the comma is a valid parameter
28363 declaration list. If it is, then the comma ends
28364 the default argument; otherwise the default
28365 argument continues. */
28369 /* Set ITALP so cp_parser_parameter_declaration_list
28370 doesn't decide to commit to this parse. */
28377 {
28378 /* Parse declarators until we reach a non-comma or
28379 somthing that cannot be an initializer.
28380 Just checking whether we're looking at a single
28381 declarator is insufficient. Consider:
28382 int var = tuple<T,U>::x;
28383 The template parameter 'U' looks exactly like a
28384 declarator. */
28385 do
28386 {
28397 }
28399 /* If we met an '=' or ';' then the original comma
28400 was the end of the NSDMI. Otherwise assume
28401 we're still in the NSDMI. */
28404 }
28405 else
28406 {
28411 }
28418 }
28419 /* FALLTHRU */
28422 /* If we run into a non-nested `;', `}', or `]',
28423 then the code is invalid -- but the default
28424 argument is certainly over. */
28429 /* Handle correctly int n = sizeof ... ( p ); */
28432 /* Update DEPTH, if necessary. */
28447 /* This might be the comparison operator, or it might
28448 start a template argument list. */
28455 /* Fall through for C++0x, which treats the `>>'
28456 operator like two `>' tokens in certain
28457 cases. */
28462 {
28463 /* This might be an operator, or it might close a
28464 template argument list. But if a previous '<'
28465 started a template argument list, this will have
28466 closed it, so we can't be in one anymore. */
28470 }
28473 /* If we run out of tokens, issue an error message. */
28481 /* In these cases, we should look for template-ids.
28482 For example, if the default argument is
28483 `X<int, double>()', we need to do name lookup to
28484 figure out whether or not `X' is a template; if
28485 so, the `,' does not end the default argument.
28487 That is not yet done. */
28492 }
28494 /* If we've reached the end, stop. */
28498 /* Add the token to the token block. */
28500 }
28502 /* Create a DEFAULT_ARG to represent the unparsed default
28503 argument. */
28510 }
28512 /* Begin parsing tentatively. We always save tokens while parsing
28513 tentatively so that if the tentative parsing fails we can restore the
28514 tokens. */
28516 static void
28518 {
28519 /* Enter a new parsing context. */
28521 /* Begin saving tokens. */
28523 /* In order to avoid repetitive access control error messages,
28524 access checks are queued up until we are no longer parsing
28525 tentatively. */
28527 }
28529 /* Commit to the currently active tentative parse. */
28531 static void
28533 {
28537 /* Mark all of the levels as committed. */
28540 {
28547 }
28548 }
28550 /* Commit to the topmost currently active tentative parse.
28552 Note that this function shouldn't be called when there are
28553 irreversible side-effects while in a tentative state. For
28554 example, we shouldn't create a permanent entry in the symbol
28555 table, or issue an error message that might not apply if the
28556 tentative parse is aborted. */
28558 static void
28560 {
28565 {
28573 }
28574 }
28576 /* Abort the currently active tentative parse. All consumed tokens
28577 will be rolled back, and no diagnostics will be issued. */
28579 static void
28581 {
28585 /* Now, pretend that we want to see if the construct was
28586 successfully parsed. */
28588 }
28590 /* Stop parsing tentatively. If a parse error has occurred, restore the
28591 token stream. Otherwise, commit to the tokens we have consumed.
28592 Returns true if no error occurred; false otherwise. */
28594 static bool
28596 {
28600 /* Remember whether or not an error occurred, since we are about to
28601 destroy that information. */
28603 /* Remove the topmost context from the stack. */
28606 /* If no parse errors occurred, commit to the tentative parse. */
28608 {
28609 /* Commit to the tokens read tentatively, unless that was
28610 already done. */
28615 }
28616 /* Otherwise, if errors occurred, roll back our state so that things
28617 are just as they were before we began the tentative parse. */
28618 else
28619 {
28622 }
28623 /* Add the context to the front of the free list. */
28628 }
28630 /* Returns true if we are parsing tentatively and are not committed to
28631 this tentative parse. */
28633 static bool
28635 {
28638 }
28640 /* Returns nonzero iff an error has occurred during the most recent
28641 tentative parse. */
28643 static bool
28645 {
28648 }
28650 /* Returns nonzero if GNU extensions are allowed. */
28652 static bool
28654 {
28656 }
28657 \f
28658 /* Objective-C++ Productions */
28661 /* Parse an Objective-C expression, which feeds into a primary-expression
28662 above.
28664 objc-expression:
28665 objc-message-expression
28666 objc-string-literal
28667 objc-encode-expression
28668 objc-protocol-expression
28669 objc-selector-expression
28671 Returns a tree representation of the expression. */
28673 static cp_expr
28675 {
28676 /* Try to figure out what kind of declaration is present. */
28680 {
28690 {
28702 }
28708 }
28711 }
28713 /* Parse an Objective-C message expression.
28715 objc-message-expression:
28716 [ objc-message-receiver objc-message-args ]
28718 Returns a representation of an Objective-C message. */
28720 static tree
28722 {
28734 /* Construct a location e.g.
28735 [self func1:5]
28736 ^~~~~~~~~~~~~~
28737 ranging from the '[' to the ']', with the caret at the start. */
28742 }
28744 /* Parse an objc-message-receiver.
28746 objc-message-receiver:
28747 expression
28748 simple-type-specifier
28750 Returns a representation of the type or expression. */
28752 static tree
28754 {
28755 tree rcv;
28757 /* An Objective-C message receiver may be either (1) a type
28758 or (2) an expression. */
28762 /* If that worked out, fine. */
28769 CP_PARSER_FLAGS_NONE);
28776 }
28778 /* Parse the arguments and selectors comprising an Objective-C message.
28780 objc-message-args:
28781 objc-selector
28782 objc-selector-args
28783 objc-selector-args , objc-comma-args
28785 objc-selector-args:
28786 objc-selector [opt] : assignment-expression
28787 objc-selector-args objc-selector [opt] : assignment-expression
28789 objc-comma-args:
28790 assignment-expression
28791 objc-comma-args , assignment-expression
28793 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28794 selector arguments and TREE_VALUE containing a list of comma
28795 arguments. */
28797 static tree
28799 {
28805 {
28811 /* Detect if we have a unary selector. */
28820 sel_args
28825 }
28827 /* Handle non-selector arguments, if any. */
28829 {
28830 tree arg;
28835 addl_args
28840 }
28843 {
28846 }
28849 }
28851 /* Parse an Objective-C encode expression.
28853 objc-encode-expression:
28854 @encode objc-typename
28856 Returns an encoded representation of the type argument. */
28858 static cp_expr
28860 {
28861 tree type;
28872 {
28876 }
28878 /* This happens if we find @encode(T) (where T is a template
28879 typename or something dependent on a template typename) when
28880 parsing a template. In that case, we can't compile it
28881 immediately, but we rather create an AT_ENCODE_EXPR which will
28882 need to be instantiated when the template is used.
28883 */
28885 {
28889 }
28892 /* Build a location of the form:
28893 @encode(int)
28894 ^~~~~~~~~~~~
28895 with caret==start at the @ token, finishing at the close paren. */
28896 location_t combined_loc
28901 }
28903 /* Parse an Objective-C @defs expression. */
28905 static tree
28907 {
28908 tree name;
28916 }
28918 /* Parse an Objective-C protocol expression.
28920 objc-protocol-expression:
28921 @protocol ( identifier )
28923 Returns a representation of the protocol expression. */
28925 static tree
28927 {
28928 tree proto;
28936 /* Build a location of the form:
28937 @protocol(prot)
28938 ^~~~~~~~~~~~~~~
28939 with caret==start at the @ token, finishing at the close paren. */
28940 location_t combined_loc
28946 }
28948 /* Parse an Objective-C selector expression.
28950 objc-selector-expression:
28951 @selector ( objc-method-signature )
28953 objc-method-signature:
28954 objc-selector
28955 objc-selector-seq
28957 objc-selector-seq:
28958 objc-selector :
28959 objc-selector-seq objc-selector :
28961 Returns a representation of the method selector. */
28963 static tree
28965 {
28977 {
28986 {
28987 /* Detect if we have a unary selector. */
28989 {
28992 }
28993 else
28994 {
28996 }
28997 }
29002 {
29003 sel_seq
29006 sel_seq
29009 }
29010 else
29011 sel_seq
29016 }
29018 finish_selector:
29022 /* Build a location of the form:
29023 @selector(func)
29024 ^~~~~~~~~~~~~~~
29025 with caret==start at the @ token, finishing at the close paren. */
29026 location_t combined_loc
29030 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29033 }
29035 /* Parse a list of identifiers.
29037 objc-identifier-list:
29038 identifier
29039 objc-identifier-list , identifier
29041 Returns a TREE_LIST of identifier nodes. */
29043 static tree
29045 {
29046 tree identifier;
29047 tree list;
29058 {
29065 identifier));
29067 }
29070 }
29072 /* Parse an Objective-C alias declaration.
29074 objc-alias-declaration:
29075 @compatibility_alias identifier identifier ;
29077 This function registers the alias mapping with the Objective-C front end.
29078 It returns nothing. */
29080 static void
29082 {
29090 }
29092 /* Parse an Objective-C class forward-declaration.
29094 objc-class-declaration:
29095 @class objc-identifier-list ;
29097 The function registers the forward declarations with the Objective-C
29098 front end. It returns nothing. */
29100 static void
29102 {
29105 {
29106 tree id;
29116 else
29118 }
29120 }
29122 /* Parse a list of Objective-C protocol references.
29124 objc-protocol-refs-opt:
29125 objc-protocol-refs [opt]
29127 objc-protocol-refs:
29128 < objc-identifier-list >
29130 Returns a TREE_LIST of identifiers, if any. */
29132 static tree
29134 {
29138 {
29142 }
29145 }
29147 /* Parse a Objective-C visibility specification. */
29149 static void
29151 {
29155 {
29170 }
29172 /* Eat '@private'/'@protected'/'@public'. */
29174 }
29176 /* Parse an Objective-C method type. Return 'true' if it is a class
29177 (+) method, and 'false' if it is an instance (-) method. */
29181 {
29184 else
29186 }
29188 /* Parse an Objective-C protocol qualifier. */
29190 static tree
29192 {
29205 {
29210 }
29213 }
29215 /* Parse an Objective-C typename. */
29217 static tree
29219 {
29223 {
29229 /* An ObjC type name may consist of just protocol qualifiers, in which
29230 case the type shall default to 'id'. */
29232 {
29235 /* If the type could not be parsed, an error has already
29236 been produced. For error recovery, behave as if it had
29237 not been specified, which will use the default type
29238 'id'. */
29240 {
29242 /* We need to skip to the closing parenthesis as
29243 cp_parser_type_id() does not seem to do it for
29244 us. */
29249 }
29250 }
29254 }
29257 }
29259 /* Check to see if TYPE refers to an Objective-C selector name. */
29261 static bool
29263 {
29269 }
29271 /* Parse an Objective-C selector. */
29273 static tree
29275 {
29279 {
29282 }
29284 /* C++ operator names are allowed to appear in ObjC selectors. */
29286 {
29299 }
29300 }
29302 /* Parse an Objective-C params list. */
29304 static tree
29306 {
29312 {
29322 /* Detect if we have a unary selector. */
29325 {
29328 }
29332 {
29333 /* Something went quite wrong. There should be a colon
29334 here, but there is not. Stop parsing parameters. */
29336 }
29338 /* New ObjC allows attributes on parameters too. */
29343 params
29346 type_name,
29347 identifier,
29348 parm_attr));
29351 }
29354 {
29357 }
29359 /* We allow tail attributes for the method. */
29361 {
29369 }
29372 {
29375 }
29377 }
29379 /* Parse the non-keyword Objective-C params. */
29381 static tree
29384 {
29390 {
29392 tree parm;
29398 {
29403 }
29405 /* TODO: parse attributes for tail parameters. */
29414 }
29416 /* We allow tail attributes for the method. */
29418 {
29420 {
29425 }
29426 else
29427 /* We have an error, but parse the attributes, so that we can
29428 carry on. */
29434 }
29437 }
29439 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29441 static void
29443 {
29446 /* If the next token is `extern' and the following token is a string
29447 literal, then we have a linkage specification. */
29449 && cp_parser_is_pure_string_literal
29452 /* Handle #pragma, if any. */
29455 /* Allow stray semicolons. */
29458 /* Mark methods as optional or required, when building protocols. */
29460 {
29463 }
29465 {
29468 }
29471 /* Other stray characters must generate errors. */
29473 {
29477 }
29478 /* Finally, try to parse a block-declaration, or a function-definition. */
29479 else
29481 }
29483 /* Parse a method signature. */
29485 static tree
29487 {
29503 }
29505 static bool
29507 {
29508 tree tattr;
29513 /* If the attributes are followed by a method introducer, this is not allowed.
29514 Dump the attributes and flag the situation. */
29519 /* Otherwise, the attributes introduce some interstitial code, possibly so
29520 rewind to allow that check. */
29523 }
29525 /* Parse an Objective-C method prototype list. */
29527 static void
29529 {
29533 {
29535 {
29540 else
29544 {
29548 }
29551 }
29557 OPT_Wattributes,
29559 else
29560 /* Allow for interspersed non-ObjC++ code. */
29564 }
29568 else
29572 }
29574 /* Parse an Objective-C method definition list. */
29576 static void
29578 {
29582 {
29583 tree meth;
29586 {
29592 else
29597 {
29601 }
29603 NULL_TREE);
29605 /* For historical reasons, we accept an optional semicolon. */
29612 {
29619 }
29620 }
29621 /* The following case will be removed once @synthesize is
29622 completely implemented. */
29633 else
29634 /* Allow for interspersed non-ObjC++ code. */
29638 }
29642 else
29646 }
29648 /* Parse Objective-C ivars. */
29650 static void
29652 {
29663 {
29664 cp_decl_specifier_seq declspecs;
29666 tree prefix_attributes;
29674 CP_PARSER_FLAGS_OPTIONAL,
29678 /* auto, register, static, extern, mutable. */
29680 {
29683 }
29685 /* thread_local. */
29687 {
29690 }
29692 /* typedef. */
29694 {
29697 }
29702 /* Keep going until we hit the `;' at the end of the
29703 declaration. */
29705 {
29710 /* Check for a (possibly unnamed) bitfield declaration. */
29718 {
29719 /* Get the name of the bitfield. */
29722 sfk_none);
29724 eat_colon:
29726 /* Get the width of the bitfield. */
29727 width
29729 }
29730 else
29731 {
29732 /* Parse the declarator. */
29733 declarator
29739 }
29741 /* Look for attributes that apply to the ivar. */
29743 /* Remember which attributes are prefix attributes and
29744 which are not. */
29746 /* Combine the attributes. */
29750 /* Create the bitfield declaration. */
29752 width,
29753 attributes);
29754 else
29759 /* Add the instance variable. */
29763 /* Reset PREFIX_ATTRIBUTES. */
29772 {
29775 }
29777 }
29781 }
29786 /* Do not consume the RID_AT_END, so it will be read again as terminating
29787 the @interface of @implementation. */
29791 /* For historical reasons, we accept an optional semicolon. */
29794 }
29796 /* Parse an Objective-C protocol declaration. */
29798 static void
29800 {
29806 {
29811 }
29813 /* See if we have a forward declaration or a definition. */
29816 /* Try a forward declaration first. */
29818 {
29820 {
29821 tree id;
29831 else
29833 }
29835 }
29837 /* Ok, we got a full-fledged definition (or at least should). */
29838 else
29839 {
29844 }
29845 }
29847 /* Parse an Objective-C superclass or category. */
29849 static void
29854 {
29860 {
29863 }
29865 {
29868 /* If there is no category name, and this is an @interface, we
29869 have a class extension. */
29871 {
29874 }
29875 else
29879 }
29880 }
29882 /* Parse an Objective-C class interface. */
29884 static void
29886 {
29893 {
29894 /* It's hard to recover because even if valid @interface stuff
29895 is to follow, we can't compile it (or validate it) if we
29896 don't even know which class it refers to. Let's assume this
29897 was a stray '@interface' token in the stream and skip it.
29898 */
29900 }
29905 /* We have either a class or a category on our hands. */
29908 else
29909 {
29911 /* Handle instance variable declarations, if any. */
29914 }
29917 }
29919 /* Parse an Objective-C class implementation. */
29921 static void
29923 {
29930 {
29931 /* It's hard to recover because even if valid @implementation
29932 stuff is to follow, we can't compile it (or validate it) if
29933 we don't even know which class it refers to. Let's assume
29934 this was a stray '@implementation' token in the stream and
29935 skip it.
29936 */
29938 }
29942 /* We have either a class or a category on our hands. */
29945 else
29946 {
29948 /* Handle instance variable declarations, if any. */
29951 }
29954 }
29956 /* Consume the @end token and finish off the implementation. */
29958 static void
29960 {
29963 }
29965 /* Parse an Objective-C declaration. */
29967 static void
29969 {
29970 /* Try to figure out what kind of declaration is present. */
29975 {
29991 }
29994 {
30017 }
30018 }
30020 /* Parse an Objective-C try-catch-finally statement.
30022 objc-try-catch-finally-stmt:
30023 @try compound-statement objc-catch-clause-seq [opt]
30024 objc-finally-clause [opt]
30026 objc-catch-clause-seq:
30027 objc-catch-clause objc-catch-clause-seq [opt]
30029 objc-catch-clause:
30030 @catch ( objc-exception-declaration ) compound-statement
30032 objc-finally-clause:
30033 @finally compound-statement
30035 objc-exception-declaration:
30036 parameter-declaration
30037 '...'
30039 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30041 Returns NULL_TREE.
30043 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30044 for C. Keep them in sync. */
30046 static tree
30048 {
30049 location_t location;
30050 tree stmt;
30055 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30056 node, lest it get absorbed into the surrounding block. */
30062 {
30071 {
30072 /* We have "@catch (...)" (where the '...' are literally
30073 what is in the code). Skip the '...'.
30074 parameter_declaration is set to NULL_TREE, and
30075 objc_being_catch_clauses() knows that that means
30076 '...'. */
30079 }
30080 else
30081 {
30082 /* We have "@catch (NSException *exception)" or something
30083 like that. Parse the parameter declaration. */
30087 else
30092 }
30095 else
30096 {
30097 /* If there was no open parenthesis, we are recovering from
30098 an error, and we are trying to figure out what mistake
30099 the user has made. */
30101 /* If there is an immediate closing parenthesis, the user
30102 probably forgot the opening one (ie, they typed "@catch
30103 NSException *e)". Parse the closing parenthesis and keep
30104 going. */
30108 /* If these is no immediate closing parenthesis, the user
30109 probably doesn't know that parenthesis are required at
30110 all (ie, they typed "@catch NSException *e"). So, just
30111 forget about the closing parenthesis and keep going. */
30112 }
30116 }
30118 {
30121 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30122 node, lest it get absorbed into the surrounding block. */
30126 }
30129 }
30131 /* Parse an Objective-C synchronized statement.
30133 objc-synchronized-stmt:
30134 @synchronized ( expression ) compound-statement
30136 Returns NULL_TREE. */
30138 static tree
30140 {
30141 location_t location;
30152 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30153 node, lest it get absorbed into the surrounding block. */
30158 }
30160 /* Parse an Objective-C throw statement.
30162 objc-throw-stmt:
30163 @throw assignment-expression [opt] ;
30165 Returns a constructed '@throw' statement. */
30167 static tree
30169 {
30181 }
30183 /* Parse an Objective-C statement. */
30185 static tree
30187 {
30188 /* Try to figure out what kind of declaration is present. */
30192 {
30203 }
30206 }
30208 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30209 look ahead to see if an objc keyword follows the attributes. This
30210 is to detect the use of prefix attributes on ObjC @interface and
30211 @protocol. */
30213 static bool
30215 {
30220 {
30223 }
30226 }
30228 /* This routine is a minimal replacement for
30229 c_parser_struct_declaration () used when parsing the list of
30230 types/names or ObjC++ properties. For example, when parsing the
30231 code
30233 @property (readonly) int a, b, c;
30235 this function is responsible for parsing "int a, int b, int c" and
30236 returning the declarations as CHAIN of DECLs.
30238 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30239 similar parsing. */
30240 static tree
30242 {
30244 cp_decl_specifier_seq declspecs;
30246 tree prefix_attributes;
30249 CP_PARSER_FLAGS_NONE,
30256 /* auto, register, static, extern, mutable. */
30258 {
30261 }
30263 /* thread_local. */
30265 {
30268 }
30270 /* typedef. */
30272 {
30275 }
30280 /* Keep going until we hit the `;' at the end of the declaration. */
30282 {
30287 /* Parse the declarator. */
30291 /* Look for attributes that apply to the ivar. */
30293 /* Remember which attributes are prefix attributes and
30294 which are not. */
30296 /* Combine the attributes. */
30306 /* Reset PREFIX_ATTRIBUTES. */
30317 {
30320 }
30321 else
30323 }
30325 }
30327 /* Parse an Objective-C @property declaration. The syntax is:
30329 objc-property-declaration:
30330 '@property' objc-property-attributes[opt] struct-declaration ;
30332 objc-property-attributes:
30333 '(' objc-property-attribute-list ')'
30335 objc-property-attribute-list:
30336 objc-property-attribute
30337 objc-property-attribute-list, objc-property-attribute
30339 objc-property-attribute
30340 'getter' = identifier
30341 'setter' = identifier
30342 'readonly'
30343 'readwrite'
30344 'assign'
30345 'retain'
30346 'copy'
30347 'nonatomic'
30349 For example:
30350 @property NSString *name;
30351 @property (readonly) id object;
30352 @property (retain, nonatomic, getter=getTheName) id name;
30353 @property int a, b, c;
30355 PS: This function is identical to
30356 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30357 static void
30359 {
30360 /* The following variables hold the attributes of the properties as
30361 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30362 seen. When we see an attribute, we set them to 'true' (if they
30363 are boolean properties) or to the identifier (if they have an
30364 argument, ie, for getter and setter). Note that here we only
30365 parse the list of attributes, check the syntax and accumulate the
30366 attributes that we find. objc_add_property_declaration() will
30367 then process the information. */
30377 /* 'properties' is the list of properties that we read. Usually a
30378 single one, but maybe more (eg, in "@property int a, b, c;" there
30379 are three). */
30380 tree properties;
30381 location_t loc;
30387 /* Parse the optional attribute list... */
30389 {
30390 /* Eat the '('. */
30394 {
30400 {
30403 }
30407 {
30418 {
30422 else
30427 }
30430 {
30434 }
30436 {
30438 {
30441 }
30442 else
30446 else
30448 }
30449 else
30450 {
30452 {
30455 }
30456 else
30458 }
30464 }
30471 else
30473 }
30475 /* FIXME: "@property (setter, assign);" will generate a spurious
30476 "error: expected ‘)’ before ‘,’ token". This is because
30477 cp_parser_require, unlike the C counterpart, will produce an
30478 error even if we are in error recovery. */
30480 {
30485 }
30486 }
30488 /* ... and the property declaration(s). */
30492 {
30494 /* If the next token is now a `;', consume it. */
30498 }
30502 else
30503 {
30504 /* Comma-separated properties are chained together in
30505 reverse order; add them one by one. */
30514 }
30517 }
30519 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30521 objc-synthesize-declaration:
30522 @synthesize objc-synthesize-identifier-list ;
30524 objc-synthesize-identifier-list:
30525 objc-synthesize-identifier
30526 objc-synthesize-identifier-list, objc-synthesize-identifier
30528 objc-synthesize-identifier
30529 identifier
30530 identifier = identifier
30532 For example:
30533 @synthesize MyProperty;
30534 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30536 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30537 for C. Keep them in sync.
30538 */
30539 static void
30541 {
30543 location_t loc;
30548 {
30552 {
30555 }
30557 {
30561 {
30564 }
30565 }
30566 else
30571 else
30573 }
30576 }
30578 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30580 objc-dynamic-declaration:
30581 @dynamic identifier-list ;
30583 For example:
30584 @dynamic MyProperty;
30585 @dynamic MyProperty, AnotherProperty;
30587 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30588 for C. Keep them in sync.
30589 */
30590 static void
30592 {
30594 location_t loc;
30599 {
30600 tree property;
30603 {
30606 }
30610 else
30612 }
30615 }
30617 \f
30618 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30620 /* Returns name of the next clause.
30621 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30622 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30623 returned and the token is consumed. */
30625 static pragma_omp_clause
30627 {
30643 {
30648 {
30831 }
30832 }
30838 }
30840 /* Validate that a clause of the given type does not already exist. */
30842 static void
30845 {
30846 tree c;
30850 {
30853 }
30854 }
30856 /* OpenMP 2.5:
30857 variable-list:
30858 identifier
30859 variable-list , identifier
30861 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30862 colon). An opening parenthesis will have been consumed by the caller.
30864 If KIND is nonzero, create the appropriate node and install the decl
30865 in OMP_CLAUSE_DECL and add the node to the head of the list.
30867 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30868 return the list created.
30870 COLON can be NULL if only closing parenthesis should end the list,
30871 or pointer to bool which will receive false if the list is terminated
30872 by closing parenthesis or true if the list is terminated by colon. */
30874 static tree
30877 {
30881 {
30884 }
30886 {
30891 && current_class_ptr
30893 {
30899 }
30900 else
30901 {
30914 }
30916 ;
30918 {
30920 {
30922 /* The OpenACC cache directive explicitly only allows "array
30923 elements or subarrays". */
30925 {
30929 }
30930 /* FALLTHROUGH. */
30935 {
30936 location_t loc
30941 decl
30945 }
30946 /* FALLTHROUGH. */
30950 {
30958 parser->colon_corrects_to_scope_p
30962 else
30963 {
30964 /* Look for `:'. */
30968 CPP_CLOSE_SQUARE))
30970 }
30971 /* Look for the closing `]'. */
30973 RT_CLOSE_SQUARE))
30977 }
30981 }
30987 }
30988 else
30991 get_comma:
30995 }
31001 {
31005 }
31008 {
31011 /* Try to resync to an unnested comma. Copied from
31012 cp_parser_parenthesized_expression_list. */
31013 skip_comma:
31022 }
31025 }
31027 /* Similarly, but expect leading and trailing parenthesis. This is a very
31028 common case for omp clauses. */
31030 static tree
31032 {
31036 }
31038 /* OpenACC 2.0:
31039 copy ( variable-list )
31040 copyin ( variable-list )
31041 copyout ( variable-list )
31042 create ( variable-list )
31043 delete ( variable-list )
31044 present ( variable-list )
31045 present_or_copy ( variable-list )
31046 pcopy ( variable-list )
31047 present_or_copyin ( variable-list )
31048 pcopyin ( variable-list )
31049 present_or_copyout ( variable-list )
31050 pcopyout ( variable-list )
31051 present_or_create ( variable-list )
31052 pcreate ( variable-list ) */
31054 static tree
31056 tree list)
31057 {
31060 {
31106 }
31114 }
31116 /* OpenACC 2.0:
31117 deviceptr ( variable-list ) */
31119 static tree
31121 {
31125 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31126 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31127 variable-list must only allow for pointer variables. */
31130 {
31137 }
31140 }
31142 /* OpenACC 2.0:
31143 auto
31144 independent
31145 nohost
31146 seq */
31148 static tree
31152 {
31157 }
31159 /* OpenACC:
31160 num_gangs ( expression )
31161 num_workers ( expression )
31162 vector_length ( expression ) */
31164 static tree
31167 {
31177 {
31182 }
31190 }
31192 /* OpenACC:
31194 gang [( gang-arg-list )]
31195 worker [( [num:] int-expr )]
31196 vector [( [length:] int-expr )]
31198 where gang-arg is one of:
31200 [num:] int-expr
31201 static: size-expr
31203 and size-expr may be:
31205 *
31206 int-expr
31207 */
31209 static tree
31212 {
31222 {
31225 do
31226 {
31230 /* Gang static argument. */
31233 {
31241 {
31244 }
31246 /* Check for the '*' argument. */
31250 CPP_CLOSE_PAREN)))
31251 {
31256 {
31259 }
31261 }
31262 }
31263 /* Worker num: argument and vector length: arguments. */
31267 {
31270 }
31272 /* Now collect the actual argument. */
31274 {
31277 }
31289 {
31292 }
31294 }
31299 }
31313 cleanup_error:
31316 }
31318 /* OpenACC 2.0:
31319 tile ( size-expr-list ) */
31321 static tree
31323 {
31327 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31328 so, but the spec authors never considered such a case and have
31329 differing opinions on what it might mean, including 'not
31330 allowed'.) */
31333 clause_loc);
31338 do
31339 {
31346 {
31349 }
31350 else
31354 }
31357 /* Consume the trailing ')'. */
31365 }
31367 /* OpenACC 2.0
31368 Parse wait clause or directive parameters. */
31370 static tree
31372 {
31382 {
31387 }
31394 {
31398 {
31401 else
31402 {
31409 }
31410 }
31411 }
31414 }
31416 /* OpenACC:
31417 wait ( int-expr-list ) */
31419 static tree
31421 {
31430 }
31432 /* OpenMP 3.0:
31433 collapse ( constant-expression ) */
31435 static tree
31437 {
31439 location_t loc;
31440 HOST_WIDE_INT n;
31460 {
31463 }
31472 }
31474 /* OpenMP 2.5:
31475 default ( shared | none )
31477 OpenACC 2.0
31478 default (none) */
31480 static tree
31483 {
31485 tree c;
31490 {
31495 {
31510 }
31513 }
31514 else
31515 {
31516 invalid_kind:
31519 else
31521 }
31537 }
31539 /* OpenMP 3.1:
31540 final ( expression ) */
31542 static tree
31544 {
31565 }
31567 /* OpenMP 2.5:
31568 if ( expression )
31570 OpenMP 4.5:
31571 if ( directive-name-modifier : expression )
31573 directive-name-modifier:
31574 parallel | task | taskloop | target data | target | target update
31575 | target enter data | target exit data */
31577 static tree
31580 {
31588 {
31600 {
31603 {
31616 else
31617 {
31618 location_t loc
31623 }
31626 {
31628 {
31633 }
31635 {
31636 location_t loc
31640 }
31641 }
31642 }
31643 }
31645 {
31647 {
31650 }
31651 else
31652 {
31654 {
31655 location_t loc
31658 }
31660 }
31661 }
31662 }
31674 {
31677 {
31680 {
31690 }
31692 p);
31694 }
31696 {
31699 else
31702 }
31705 {
31709 }
31710 }
31718 }
31720 /* OpenMP 3.1:
31721 mergeable */
31723 static tree
31726 {
31727 tree c;
31730 location);
31735 }
31737 /* OpenMP 2.5:
31738 nowait */
31740 static tree
31743 {
31744 tree c;
31751 }
31753 /* OpenMP 2.5:
31754 num_threads ( expression ) */
31756 static tree
31758 location_t location)
31759 {
31781 }
31783 /* OpenMP 4.5:
31784 num_tasks ( expression ) */
31786 static tree
31788 location_t location)
31789 {
31811 }
31813 /* OpenMP 4.5:
31814 grainsize ( expression ) */
31816 static tree
31818 location_t location)
31819 {
31841 }
31843 /* OpenMP 4.5:
31844 priority ( expression ) */
31846 static tree
31848 location_t location)
31849 {
31871 }
31873 /* OpenMP 4.5:
31874 hint ( expression ) */
31876 static tree
31878 location_t location)
31879 {
31900 }
31902 /* OpenMP 4.5:
31903 defaultmap ( tofrom : scalar ) */
31905 static tree
31907 location_t location)
31908 {
31916 {
31919 }
31923 {
31926 }
31932 {
31935 }
31939 {
31942 }
31948 location);
31954 out_err:
31959 }
31961 /* OpenMP 2.5:
31962 ordered
31964 OpenMP 4.5:
31965 ordered ( constant-expression ) */
31967 static tree
31970 {
31972 HOST_WIDE_INT n;
31978 {
31995 {
31997 "ordered argument needs positive constant integer "
32000 }
32001 }
32007 }
32009 /* OpenMP 2.5:
32010 reduction ( reduction-operator : variable-list )
32012 reduction-operator:
32013 One of: + * - & ^ | && ||
32015 OpenMP 3.1:
32017 reduction-operator:
32018 One of: + * - & ^ | && || min max
32020 OpenMP 4.0:
32022 reduction-operator:
32023 One of: + * - & ^ | && ||
32024 id-expression */
32026 static tree
32028 {
32036 {
32046 }
32050 else
32051 {
32062 {
32092 }
32093 else
32094 {
32096 resync_fail:
32101 }
32102 }
32108 NULL);
32110 {
32113 }
32116 }
32118 /* OpenMP 2.5:
32119 schedule ( schedule-kind )
32120 schedule ( schedule-kind , expression )
32122 schedule-kind:
32123 static | dynamic | guided | runtime | auto
32125 OpenMP 4.5:
32126 schedule ( schedule-modifier : schedule-kind )
32127 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32129 schedule-modifier:
32130 simd
32131 monotonic
32132 nonmonotonic */
32134 static tree
32136 {
32146 {
32155 else
32161 else
32162 {
32165 }
32166 }
32169 {
32174 {
32195 }
32196 }
32201 else
32207 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32209 {
32213 }
32216 {
32231 else
32236 }
32248 invalid_kind:
32250 resync_fail:
32255 }
32257 /* OpenMP 3.0:
32258 untied */
32260 static tree
32263 {
32264 tree c;
32271 }
32273 /* OpenMP 4.0:
32274 inbranch
32275 notinbranch */
32277 static tree
32280 {
32285 }
32287 /* OpenMP 4.0:
32288 parallel
32289 for
32290 sections
32291 taskgroup */
32293 static tree
32297 {
32301 }
32303 /* OpenMP 4.5:
32304 nogroup */
32306 static tree
32309 {
32314 }
32316 /* OpenMP 4.5:
32317 simd
32318 threads */
32320 static tree
32324 {
32329 }
32331 /* OpenMP 4.0:
32332 num_teams ( expression ) */
32334 static tree
32336 location_t location)
32337 {
32359 }
32361 /* OpenMP 4.0:
32362 thread_limit ( expression ) */
32364 static tree
32366 location_t location)
32367 {
32389 }
32391 /* OpenMP 4.0:
32392 aligned ( variable-list )
32393 aligned ( variable-list : constant-expression ) */
32395 static tree
32397 {
32408 {
32418 }
32424 }
32426 /* OpenMP 4.0:
32427 linear ( variable-list )
32428 linear ( variable-list : expression )
32430 OpenMP 4.5:
32431 linear ( modifier ( variable-list ) )
32432 linear ( modifier ( variable-list ) : expression ) */
32434 static tree
32437 {
32447 {
32459 else
32461 }
32466 else
32467 {
32476 }
32479 {
32484 {
32495 {
32498 }
32501 }
32506 {
32509 }
32517 }
32520 {
32523 }
32526 }
32528 /* OpenMP 4.0:
32529 safelen ( constant-expression ) */
32531 static tree
32533 location_t location)
32534 {
32555 }
32557 /* OpenMP 4.0:
32558 simdlen ( constant-expression ) */
32560 static tree
32562 location_t location)
32563 {
32584 }
32586 /* OpenMP 4.5:
32587 vec:
32588 identifier [+/- integer]
32589 vec , identifier [+/- integer]
32590 */
32592 static tree
32594 tree list)
32595 {
32599 {
32602 }
32605 {
32612 else
32613 {
32614 t = cp_parser_lookup_name_simple
32619 id_loc);
32620 }
32626 {
32629 }
32633 {
32636 }
32640 {
32643 }
32646 add_to_vector:
32648 {
32652 }
32658 }
32661 {
32667 }
32669 }
32671 /* OpenMP 4.0:
32672 depend ( depend-kind : variable-list )
32674 depend-kind:
32675 in | out | inout
32677 OpenMP 4.5:
32678 depend ( source )
32680 depend ( sink : vec ) */
32682 static tree
32684 {
32692 {
32706 else
32708 }
32709 else
32715 {
32725 }
32732 else
32733 {
32739 }
32742 invalid_kind:
32744 resync_fail:
32749 }
32751 /* OpenMP 4.0:
32752 map ( map-kind : variable-list )
32753 map ( variable-list )
32755 map-kind:
32756 alloc | to | from | tofrom
32758 OpenMP 4.5:
32759 map-kind:
32760 alloc | to | from | tofrom | release | delete
32762 map ( always [,] map-kind: variable-list ) */
32764 static tree
32766 {
32775 {
32780 {
32783 nth++;
32789 {
32794 }
32795 }
32796 }
32800 {
32814 else
32815 {
32821 }
32824 }
32827 {
32831 }
32834 NULL);
32840 }
32842 /* OpenMP 4.0:
32843 device ( expression ) */
32845 static tree
32847 location_t location)
32848 {
32870 }
32872 /* OpenMP 4.0:
32873 dist_schedule ( static )
32874 dist_schedule ( static , expression ) */
32876 static tree
32878 location_t location)
32879 {
32892 {
32903 }
32908 location);
32912 invalid_kind:
32914 resync_fail:
32919 }
32921 /* OpenMP 4.0:
32922 proc_bind ( proc-bind-kind )
32924 proc-bind-kind:
32925 master | close | spread */
32927 static tree
32929 location_t location)
32930 {
32931 tree c;
32938 {
32948 else
32950 }
32951 else
32960 location);
32965 invalid_kind:
32967 resync_fail:
32972 }
32974 /* OpenACC:
32975 async [( int-expr )] */
32977 static tree
32979 {
32986 {
32995 }
33005 }
33007 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33008 is a bitmask in MASK. Return the list of clauses found. */
33010 static tree
33014 {
33019 {
33020 location_t here;
33021 pragma_omp_clause c_kind;
33022 omp_clause_code code;
33033 {
33085 clauses);
33103 OMP_CLAUSE_INDEPENDENT,
33115 clauses);
33121 clauses);
33145 clauses);
33167 clauses);
33179 clauses);
33193 }
33198 {
33199 /* Remove the invalid clause(s) from the list to avoid
33200 confusing the rest of the compiler. */
33203 }
33204 }
33206 saw_error:
33213 }
33215 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33216 is a bitmask in MASK. Return the list of clauses found; the result
33217 of clause default goes in *pdefault. */
33219 static tree
33223 {
33229 {
33230 pragma_omp_clause c_kind;
33241 {
33253 clauses);
33267 clauses);
33287 clauses);
33292 clauses);
33302 clauses);
33336 clauses);
33350 clauses);
33367 OMP_CLAUSE_NOTINBRANCH,
33376 {
33377 clause_not_first:
33381 }
33411 clauses);
33412 else
33422 clauses);
33440 {
33448 }
33491 clauses
33497 clauses
33509 }
33514 {
33515 /* Remove the invalid clause(s) from the list to avoid
33516 confusing the rest of the compiler. */
33519 }
33520 }
33521 saw_error:
33522 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33523 no reason to skip to the end. */
33527 {
33530 else
33532 }
33534 }
33536 /* OpenMP 2.5:
33537 structured-block:
33538 statement
33540 In practice, we're also interested in adding the statement to an
33541 outer node. So it is convenient if we work around the fact that
33542 cp_parser_statement calls add_stmt. */
33544 static unsigned
33546 {
33549 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33550 This preserves the "not within loop or switch" style error messages
33551 for nonsense cases like
33552 void foo() {
33553 #pragma omp single
33554 break;
33555 }
33556 */
33561 }
33563 static void
33565 {
33567 }
33569 static tree
33571 {
33579 }
33581 /* OpenMP 2.5:
33582 # pragma omp atomic new-line
33583 expression-stmt
33585 expression-stmt:
33586 x binop= expr | x++ | ++x | x-- | --x
33587 binop:
33588 +, *, -, /, &, ^, |, <<, >>
33590 where x is an lvalue expression with scalar type.
33592 OpenMP 3.1:
33593 # pragma omp atomic new-line
33594 update-stmt
33596 # pragma omp atomic read new-line
33597 read-stmt
33599 # pragma omp atomic write new-line
33600 write-stmt
33602 # pragma omp atomic update new-line
33603 update-stmt
33605 # pragma omp atomic capture new-line
33606 capture-stmt
33608 # pragma omp atomic capture new-line
33609 capture-block
33611 read-stmt:
33612 v = x
33613 write-stmt:
33614 x = expr
33615 update-stmt:
33616 expression-stmt | x = x binop expr
33617 capture-stmt:
33618 v = expression-stmt
33619 capture-block:
33620 { v = x; update-stmt; } | { update-stmt; v = x; }
33622 OpenMP 4.0:
33623 update-stmt:
33624 expression-stmt | x = x binop expr | x = expr binop x
33625 capture-stmt:
33626 v = update-stmt
33627 capture-block:
33628 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33630 where x and v are lvalue expressions with scalar type. */
33632 static void
33634 {
33642 {
33647 {
33653 }
33654 }
33656 {
33668 else
33672 }
33674 {
33680 {
33685 {
33688 }
33689 }
33690 }
33694 {
33704 else
33709 {
33710 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33711 opcode. */
33716 }
33720 {
33723 }
33724 else
33725 {
33731 }
33734 }
33736 restart:
33740 {
33747 /* FALLTHROUGH */
33757 /* FALLTHROUGH */
33772 /* Undo effects of boolean_increment for post {in,de}crement. */
33774 /* FALLTHRU */
33778 {
33779 /* Undo effects of boolean_increment. */
33781 {
33782 /* This is pre or post increment. */
33787 && !structured_block
33791 }
33792 }
33793 /* FALLTHRU */
33796 {
33831 {
33835 }
33838 {
33844 {
33849 }
33851 {
33863 {
33865 {
33870 }
33871 else
33873 }
33877 }
33880 {
33887 }
33891 }
33895 {
33898 {
33906 }
33908 {
33913 }
33948 }
33959 /* FALLTHROUGH */
33964 }
33971 }
33972 stmt_done:
33974 {
33985 }
33987 {
33990 }
33991 done:
33997 saw_error:
34000 {
34004 {
34008 }
34009 }
34010 }
34013 /* OpenMP 2.5:
34014 # pragma omp barrier new-line */
34016 static void
34018 {
34021 }
34023 /* OpenMP 2.5:
34024 # pragma omp critical [(name)] new-line
34025 structured-block
34027 OpenMP 4.5:
34028 # pragma omp critical [(name) [hint(expression)]] new-line
34029 structured-block */
34031 #define OMP_CRITICAL_CLAUSE_MASK \
34032 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34034 static tree
34036 {
34040 {
34054 OMP_CRITICAL_CLAUSE_MASK,
34056 }
34057 else
34062 }
34064 /* OpenMP 2.5:
34065 # pragma omp flush flush-vars[opt] new-line
34067 flush-vars:
34068 ( variable-list ) */
34070 static void
34072 {
34078 }
34080 /* Helper function, to parse omp for increment expression. */
34082 static tree
34084 {
34089 {
34092 }
34095 {
34104 /* Fall through: OpenMP disallows NE_EXPR. */
34108 }
34110 /* If decl is an iterator, preserve LHS and RHS of the relational
34111 expr until finish_omp_for. */
34122 }
34124 /* Helper function, to parse omp for increment expression. */
34126 static tree
34128 {
34132 cp_id_kind idk;
34136 {
34145 }
34154 {
34159 }
34166 {
34170 }
34183 do
34184 {
34191 {
34193 {
34196 else
34198 tf_warning_or_error);
34199 }
34200 else
34203 }
34204 }
34208 {
34214 }
34215 else
34219 }
34221 /* Parse the initialization statement of either an OpenMP for loop or
34222 a Cilk Plus for loop.
34224 Return true if the resulting construct should have an
34225 OMP_CLAUSE_PRIVATE added to it. */
34227 static tree
34236 {
34242 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34244 init-expr:
34245 var = lb
34246 integer-type var = lb
34247 random-access-iterator-type var = lb
34248 pointer-type var = lb
34249 */
34250 cp_decl_specifier_seq type_specifiers;
34252 /* First, try to parse as an initialized declaration. See
34253 cp_parser_condition, from whence the bulk of this is copied. */
34260 {
34261 /* If parsing a type specifier seq succeeded, then this
34262 MUST be a initialized declaration. */
34267 CP_PARSER_DECLARATOR_NAMED,
34278 else
34279 {
34289 {
34291 CPP_OPEN_PAREN))
34292 {
34296 else
34299 }
34300 else
34301 /* Trigger an error. */
34306 }
34310 {
34318 {
34321 auto_node);
34326 }
34329 asm_specification,
34330 LOOKUP_ONLYCONVERTING);
34333 {
34336 }
34337 else
34338 {
34341 {
34343 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34345 {
34349 {
34353 }
34355 }
34357 {
34362 }
34363 }
34364 }
34366 }
34367 else
34368 {
34369 /* Consume '='. */
34373 non_class:
34376 else
34379 asm_specification,
34380 LOOKUP_ONLYCONVERTING);
34381 }
34385 }
34386 }
34387 else
34388 {
34389 cp_id_kind idk;
34390 /* If parsing a type specifier sequence failed, then
34391 this MUST be a simple expression. */
34400 && decl
34403 {
34414 {
34419 }
34424 }
34426 && decl
34429 {
34430 tree rhs;
34438 rhs,
34439 tf_warning_or_error));
34442 }
34443 else
34444 {
34449 {
34453 }
34454 }
34455 }
34457 }
34459 /* Parse the restricted form of the for statement allowed by OpenMP. */
34461 static tree
34464 {
34468 location_t loc_first;
34479 {
34482 }
34485 {
34488 }
34491 {
34497 }
34499 {
34502 {
34504 "%<linear%> clause may not be specified together "
34507 }
34508 else
34510 }
34523 {
34526 location_t loc;
34530 {
34534 }
34537 {
34541 }
34550 add_private_clause
34557 {
34560 {
34566 }
34567 else
34569 }
34576 {
34581 {
34585 }
34588 {
34589 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34593 {
34596 }
34597 else
34598 {
34601 }
34603 }
34604 else
34605 {
34610 }
34611 }
34614 {
34615 tree c;
34617 {
34626 decl);
34630 decl);
34631 }
34633 {
34638 else
34643 {
34646 /* For linear, signal that we need to fill up
34647 the so far unknown linear step. */
34650 }
34651 }
34652 }
34661 {
34662 /* If decl is an iterator, preserve the operator on decl
34663 until finish_omp_for. */
34665 && ((processing_template_decl
34670 else
34674 }
34686 {
34689 }
34694 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34695 in between the collapsed for loops to be still considered perfectly
34696 nested. Hopefully the final version clarifies this.
34697 For now handle (multiple) {'s and empty statements. */
34700 {
34704 {
34706 bracecount++;
34707 }
34711 else
34712 {
34719 }
34720 }
34723 {
34726 }
34727 }
34732 /* Note that we saved the original contents of this flag when we entered
34733 the structured block, and so we don't need to re-save it here. */
34736 else
34739 /* Note that the grammar doesn't call for a structured block here,
34740 though the loop as a whole is a structured block. */
34747 else
34752 {
34754 {
34756 nbraces--;
34757 }
34760 else
34761 {
34763 {
34766 }
34771 }
34772 }
34775 {
34779 else
34781 }
34785 }
34787 /* Helper function for OpenMP parsing, split clauses and call
34788 finish_omp_clauses on each of the set of clauses afterwards. */
34790 static void
34793 {
34799 }
34801 /* OpenMP 4.0:
34802 #pragma omp simd simd-clause[optseq] new-line
34803 for-loop */
34805 #define OMP_SIMD_CLAUSE_MASK \
34806 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34815 static tree
34819 {
34830 {
34834 OMP_CLAUSE_ORDERED);
34836 {
34838 "%<ordered%> clause with parameter may not be specified "
34841 }
34842 }
34853 }
34855 /* OpenMP 2.5:
34856 #pragma omp for for-clause[optseq] new-line
34857 for-loop
34859 OpenMP 4.0:
34860 #pragma omp for simd for-simd-clause[optseq] new-line
34861 for-loop */
34863 #define OMP_FOR_CLAUSE_MASK \
34864 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34874 static tree
34878 {
34885 /* parallel for{, simd} disallows nowait clause, but for
34886 target {teams distribute ,}parallel for{, simd} it should be accepted. */
34889 /* Composite distribute parallel for{, simd} disallows ordered clause. */
34894 {
34899 {
34923 }
34924 }
34926 {
34929 }
34931 /* Composite distribute parallel for disallows linear clause. */
34938 {
34941 }
34952 }
34954 /* OpenMP 2.5:
34955 # pragma omp master new-line
34956 structured-block */
34958 static tree
34960 {
34964 }
34966 /* OpenMP 2.5:
34967 # pragma omp ordered new-line
34968 structured-block
34970 OpenMP 4.5:
34971 # pragma omp ordered ordered-clauses new-line
34972 structured-block */
34974 #define OMP_ORDERED_CLAUSE_MASK \
34975 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34978 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34979 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34981 static bool
34984 {
34988 {
34993 {
34995 {
34997 "%<depend%> clause may only be used in compound "
35001 }
35002 tree clauses
35004 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35008 }
35009 }
35011 tree clauses
35017 }
35019 /* OpenMP 2.5:
35021 section-scope:
35022 { section-sequence }
35024 section-sequence:
35025 section-directive[opt] structured-block
35026 section-sequence section-directive structured-block */
35028 static tree
35030 {
35042 {
35046 }
35049 {
35057 {
35061 }
35063 {
35066 }
35071 }
35082 }
35084 /* OpenMP 2.5:
35085 # pragma omp sections sections-clause[optseq] newline
35086 sections-scope */
35088 #define OMP_SECTIONS_CLAUSE_MASK \
35089 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35090 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35093 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35095 static tree
35098 {
35110 {
35113 }
35120 }
35122 /* OpenMP 2.5:
35123 # pragma omp parallel parallel-clause[optseq] new-line
35124 structured-block
35125 # pragma omp parallel for parallel-for-clause[optseq] new-line
35126 structured-block
35127 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35128 structured-block
35130 OpenMP 4.0:
35131 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35132 structured-block */
35134 #define OMP_PARALLEL_CLAUSE_MASK \
35135 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35145 static tree
35149 {
35156 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35162 {
35170 if_p);
35174 if_p);
35177 block);
35182 }
35183 /* When combined with distribute, parallel has to be followed by for.
35184 #pragma omp target parallel is allowed though. */
35188 {
35192 }
35194 {
35197 }
35199 {
35203 {
35213 block);
35216 }
35217 }
35222 {
35225 }
35233 }
35235 /* OpenMP 2.5:
35236 # pragma omp single single-clause[optseq] new-line
35237 structured-block */
35239 #define OMP_SINGLE_CLAUSE_MASK \
35240 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35241 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35242 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35243 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35245 static tree
35247 {
35257 }
35259 /* OpenMP 3.0:
35260 # pragma omp task task-clause[optseq] new-line
35261 structured-block */
35263 #define OMP_TASK_CLAUSE_MASK \
35264 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35275 static tree
35277 {
35288 }
35290 /* OpenMP 3.0:
35291 # pragma omp taskwait new-line */
35293 static void
35295 {
35298 }
35300 /* OpenMP 3.1:
35301 # pragma omp taskyield new-line */
35303 static void
35305 {
35308 }
35310 /* OpenMP 4.0:
35311 # pragma omp taskgroup new-line
35312 structured-block */
35314 static tree
35316 {
35320 if_p));
35321 }
35324 /* OpenMP 2.5:
35325 # pragma omp threadprivate (variable-list) */
35327 static void
35329 {
35330 tree vars;
35336 }
35338 /* OpenMP 4.0:
35339 # pragma omp cancel cancel-clause[optseq] new-line */
35341 #define OMP_CANCEL_CLAUSE_MASK \
35342 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35348 static void
35350 {
35354 }
35356 /* OpenMP 4.0:
35357 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35359 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35360 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35365 static void
35368 {
35369 tree clauses;
35373 {
35378 {
35381 }
35382 }
35384 {
35388 }
35391 {
35396 else
35400 }
35403 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35405 pragma_tok);
35407 }
35409 /* OpenMP 4.0:
35410 #pragma omp distribute distribute-clause[optseq] new-line
35411 for-loop */
35413 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35414 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35420 static tree
35424 {
35433 {
35441 else
35444 {
35450 {
35454 else
35457 }
35463 else
35477 }
35478 }
35480 {
35483 }
35488 {
35491 }
35502 }
35504 /* OpenMP 4.0:
35505 # pragma omp teams teams-clause[optseq] new-line
35506 structured-block */
35508 #define OMP_TEAMS_CLAUSE_MASK \
35509 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35512 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35513 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35517 static tree
35521 {
35530 {
35534 {
35559 }
35560 }
35562 {
35565 }
35570 {
35573 }
35582 }
35584 /* OpenMP 4.0:
35585 # pragma omp target data target-data-clause[optseq] new-line
35586 structured-block */
35588 #define OMP_TARGET_DATA_CLAUSE_MASK \
35589 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35594 static tree
35596 {
35597 tree clauses
35602 {
35605 {
35622 "%<#pragma omp target data%> with map-type other "
35623 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35627 }
35629 }
35632 {
35635 "%<#pragma omp target data%> must contain at least "
35638 }
35649 }
35651 /* OpenMP 4.5:
35652 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35653 structured-block */
35655 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35656 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35662 static tree
35665 {
35668 {
35673 {
35676 }
35677 }
35679 {
35683 }
35686 {
35692 }
35694 tree clauses
35699 {
35702 {
35715 "%<#pragma omp target enter data%> with map-type other "
35719 }
35721 }
35724 {
35727 "%<#pragma omp target enter data%> must contain at least "
35730 }
35737 }
35739 /* OpenMP 4.5:
35740 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35741 structured-block */
35743 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35744 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35750 static tree
35753 {
35756 {
35761 {
35764 }
35765 }
35767 {
35771 }
35774 {
35780 }
35782 tree clauses
35787 {
35790 {
35804 "%<#pragma omp target exit data%> with map-type other "
35805 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35809 }
35811 }
35814 {
35817 "%<#pragma omp target exit data%> must contain at least "
35820 }
35827 }
35829 /* OpenMP 4.0:
35830 # pragma omp target update target-update-clause[optseq] new-line */
35832 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35833 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35840 static bool
35843 {
35845 {
35851 }
35853 tree clauses
35858 {
35860 "%<#pragma omp target update%> must contain at least one "
35863 }
35871 }
35873 /* OpenMP 4.0:
35874 # pragma omp target target-clause[optseq] new-line
35875 structured-block */
35877 #define OMP_TARGET_CLAUSE_MASK \
35878 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
35886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
35888 static bool
35891 {
35895 {
35907 {
35915 {
35916 tree stmt;
35918 {
35921 OMP_TARGET_CLAUSE_MASK,
35926 OMP_TARGET_CLAUSE_MASK,
35931 OMP_TARGET_CLAUSE_MASK,
35936 }
35938 }
35943 {
35947 if_p);
35952 if_p);
35957 if_p);
35961 }
35967 {
35968 /* For combined target teams, ensure the num_teams and
35969 thread_limit clause expressions are evaluated on the host,
35970 before entering the target construct. */
35971 tree c;
35977 {
35986 OMP_CLAUSE_FIRSTPRIVATE);
35991 }
35992 }
36002 }
36004 {
36007 }
36009 {
36013 }
36015 {
36019 }
36021 {
36025 }
36027 {
36030 }
36031 }
36033 {
36036 }
36051 check_clauses:
36053 {
36056 {
36070 "%<#pragma omp target%> with map-type other "
36071 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36075 }
36077 }
36079 }
36081 /* OpenACC 2.0:
36082 # pragma acc cache (variable-list) new-line
36083 */
36085 static tree
36087 {
36102 }
36104 /* OpenACC 2.0:
36105 # pragma acc data oacc-data-clause[optseq] new-line
36106 structured-block */
36108 #define OACC_DATA_CLAUSE_MASK \
36109 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36110 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36111 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36112 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36113 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36121 static tree
36123 {
36136 }
36138 /* OpenACC 2.0:
36139 # pragma acc host_data <clauses> new-line
36140 structured-block */
36142 #define OACC_HOST_DATA_CLAUSE_MASK \
36143 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36145 static tree
36147 {
36160 }
36162 /* OpenACC 2.0:
36163 # pragma acc declare oacc-data-clause[optseq] new-line
36164 */
36166 #define OACC_DECLARE_CLAUSE_MASK \
36167 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36168 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36178 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36180 static tree
36182 {
36191 {
36195 }
36198 {
36202 {
36206 }
36209 {
36221 {
36223 "%qD must be a global variable in "
36225 decl);
36228 }
36233 {
36237 }
36239 {
36241 "invalid use of %<extern%> variable %qD "
36245 }
36247 {
36249 "invalid use of %<global%> variable %qD "
36253 }
36255 }
36260 {
36265 }
36268 {
36269 tree id;
36273 else
36279 {
36282 {
36285 {
36289 }
36290 }
36291 }
36292 }
36293 }
36306 }
36308 /* OpenACC 2.0:
36309 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36311 or
36313 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36315 LOC is the location of the #pragma token.
36316 */
36318 #define OACC_ENTER_DATA_CLAUSE_MASK \
36319 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36320 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36325 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36327 #define OACC_EXIT_DATA_CLAUSE_MASK \
36328 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36329 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36334 static tree
36337 {
36346 {
36351 }
36358 else
36363 {
36367 }
36375 }
36377 /* OpenACC 2.0:
36378 # pragma acc loop oacc-loop-clause[optseq] new-line
36379 structured-block */
36381 #define OACC_LOOP_CLAUSE_MASK \
36382 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36393 static tree
36396 {
36405 {
36411 }
36420 }
36422 /* OpenACC 2.0:
36423 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36424 structured-block
36426 or
36428 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36429 structured-block
36430 */
36432 #define OACC_KERNELS_CLAUSE_MASK \
36433 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36434 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36435 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36448 #define OACC_PARALLEL_CLAUSE_MASK \
36449 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36470 static tree
36473 {
36474 omp_clause_mask mask;
36477 {
36490 }
36493 {
36497 {
36500 tree clauses;
36502 if_p);
36504 }
36505 }
36514 }
36516 /* OpenACC 2.0:
36517 # pragma acc update oacc-update-clause[optseq] new-line
36518 */
36520 #define OACC_UPDATE_CLAUSE_MASK \
36521 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36528 static tree
36530 {
36537 {
36539 "%<#pragma acc update%> must contain at least one "
36542 }
36550 }
36552 /* OpenACC 2.0:
36553 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36555 LOC is the location of the #pragma token.
36556 */
36558 #define OACC_WAIT_CLAUSE_MASK \
36559 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36561 static tree
36563 {
36577 }
36579 /* OpenMP 4.0:
36580 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36582 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36583 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36590 static void
36593 {
36595 cp_omp_declare_simd_data data;
36597 {
36602 /* It is safe to take the address of a local variable; it will only be
36603 used while this scope is live. */
36605 }
36607 /* Store away all pragma tokens. */
36619 {
36623 {
36636 }
36641 "%<#pragma omp declare simd%> not immediately followed by "
36645 }
36646 }
36648 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36649 This function is modelled similar to the late parsing of omp declare
36650 simd. */
36652 static tree
36654 {
36661 {
36663 "used in the same function marked as a Cilk Plus SIMD-enabled "
36669 }
36671 {
36675 }
36680 {
36687 NULL);
36701 }
36707 }
36709 /* Finalize #pragma omp declare simd clauses after direct declarator has
36710 been parsed, and put that into "omp declare simd" attribute. */
36712 static tree
36714 {
36720 {
36724 }
36729 {
36747 }
36751 }
36754 /* OpenMP 4.0:
36755 # pragma omp declare target new-line
36756 declarations and definitions
36757 # pragma omp end declare target new-line
36759 OpenMP 4.5:
36760 # pragma omp declare target ( extended-list ) new-line
36762 # pragma omp declare target declare-target-clauses[seq] new-line */
36764 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36765 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36768 static void
36770 {
36773 clauses
36777 {
36779 clauses);
36782 }
36783 else
36784 {
36788 }
36791 "%<#pragma omp declare target%> with clauses in between "
36792 "%<#pragma omp declare target%> without clauses and "
36795 {
36801 {
36804 }
36805 else
36808 {
36810 "%qD specified both in declare target %<link%> and %<to%>"
36813 }
36815 {
36822 {
36825 {
36829 }
36830 }
36831 }
36832 }
36833 }
36835 static void
36837 {
36840 {
36843 }
36845 {
36849 {
36852 }
36855 else
36856 {
36860 }
36861 }
36862 else
36863 {
36867 }
36871 "%<#pragma omp end declare target%> without corresponding "
36873 else
36875 }
36877 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
36878 expression and optional initializer clause of
36879 #pragma omp declare reduction. We store the expression(s) as
36880 either 3, 6 or 7 special statements inside of the artificial function's
36881 body. The first two statements are DECL_EXPRs for the artificial
36882 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
36883 expression that uses those variables.
36884 If there was any INITIALIZER clause, this is followed by further statements,
36885 the fourth and fifth statements are DECL_EXPRs for the artificial
36886 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
36887 constructor variant (first token after open paren is not omp_priv),
36888 then the sixth statement is a statement with the function call expression
36889 that uses the OMP_PRIV and optionally OMP_ORIG variable.
36890 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
36891 to initialize the OMP_PRIV artificial variable and there is seventh
36892 statement, a DECL_EXPR of the OMP_PRIV statement again. */
36894 static bool
36896 {
36908 tree combiner;
36923 {
36926 }
36929 {
36936 {
36939 }
36955 {
36959 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
36963 == CPP_CLOSE_PAREN
36966 {
36970 }
36975 }
36976 else
36977 {
36993 {
36998 }
37000 tree arg;
37013 }
37024 }
37030 }
37032 /* OpenMP 4.0
37033 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37034 initializer-clause[opt] new-line
37036 initializer-clause:
37037 initializer (omp_priv initializer)
37038 initializer (function-name (argument-list)) */
37040 static void
37043 {
37053 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37060 {
37092 }
37104 /* Types may not be defined in declare reduction type list. */
37107 parser->type_definition_forbidden_message
37113 saved_colon_doesnt_start_class_def_p
37118 {
37122 ;
37143 else
37148 else
37150 }
37152 /* Restore the saved message. */
37155 parser->colon_doesnt_start_class_def_p
37160 {
37161 fail:
37164 }
37170 {
37171 tree fntype
37174 NULL_TREE);
37194 {
37199 }
37201 {
37203 {
37212 }
37219 }
37220 else
37221 {
37224 }
37227 else
37230 {
37233 }
37235 {
37238 else
37243 }
37248 else
37249 {
37258 }
37265 }
37269 done:
37270 /* Free any declarators allocated. */
37272 }
37274 /* OpenMP 4.0
37275 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37276 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37277 initializer-clause[opt] new-line
37278 #pragma omp declare target new-line */
37280 static void
37283 {
37285 {
37290 {
37293 context);
37295 }
37298 {
37301 context);
37303 }
37305 {
37308 }
37310 {
37314 }
37315 }
37319 }
37321 /* OpenMP 4.5:
37322 #pragma omp taskloop taskloop-clause[optseq] new-line
37323 for-loop
37325 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37326 for-loop */
37328 #define OMP_TASKLOOP_CLAUSE_MASK \
37329 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37335 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37336 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37337 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37338 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37344 static tree
37348 {
37357 {
37362 {
37386 }
37387 }
37389 {
37392 }
37397 {
37400 }
37406 if_p);
37412 }
37415 /* OpenACC 2.0:
37416 # pragma acc routine oacc-routine-clause[optseq] new-line
37417 function-definition
37419 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37420 */
37422 #define OACC_ROUTINE_CLAUSE_MASK \
37423 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37424 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37429 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37430 component, which must resolve to a declared namespace-scope
37431 function. The clauses are either processed directly (for a named
37432 function), or defered until the immediatley following declaration
37433 is parsed. */
37435 static void
37438 {
37440 /* The checking for "another pragma following this one" in the "no optional
37441 '( name )'" case makes sure that we dont re-enter. */
37444 cp_oacc_routine_data data;
37450 /* It is safe to take the address of a local variable; it will only be
37451 used while this scope is live. */
37454 /* Look for optional '( name )'. */
37456 {
37459 /* We parse the name as an id-expression. If it resolves to
37460 anything other than a non-overloaded function at namespace
37461 scope, it's an error. */
37475 {
37479 }
37481 data.clauses
37489 {
37494 }
37496 /* Perhaps we should use the same rule as declarations in different
37497 namespaces? */
37499 {
37504 }
37507 {
37511 }
37515 }
37517 {
37518 /* Store away all pragma tokens. */
37529 /* Emit a helpful diagnostic if there's another pragma following this
37530 one. */
37532 {
37535 /* ..., and then just keep going. */
37537 }
37539 /* We only have to consider the pragma_external case here. */
37544 else
37547 }
37548 }
37550 /* Finalize #pragma acc routine clauses after direct declarator has
37551 been parsed. */
37553 static tree
37555 {
37560 {
37562 "%<#pragma acc routine%> not immediately followed by "
37565 }
37582 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37583 fndecl_seen. */
37586 }
37588 /* Apply any saved OpenACC routine clauses to a just-parsed
37589 declaration. */
37591 static void
37593 {
37595 {
37596 /* Keep going if we're in error reporting mode. */
37602 {
37604 "%<#pragma acc routine%> not immediately followed by"
37608 }
37610 {
37613 }
37616 {
37621 }
37624 {
37632 }
37634 /* Process the routine's dimension clauses. */
37638 /* Add an "omp declare target" attribute. */
37643 /* Don't unset parser->oacc_routine here: we may still need it to
37644 diagnose wrong usage. But, remember that we've used this "#pragma acc
37645 routine". */
37647 }
37648 }
37650 /* Main entry point to OpenMP statement pragmas. */
37652 static void
37654 {
37655 tree stmt;
37660 {
37683 if_p);
37688 if_p);
37705 if_p);
37710 if_p);
37718 if_p);
37727 if_p);
37741 if_p);
37746 if_p);
37750 }
37753 }
37754 \f
37755 /* Transactional Memory parsing routines. */
37757 /* Parse a transaction attribute.
37759 txn-attribute:
37760 attribute
37761 [ [ identifier ] ]
37763 We use this instead of cp_parser_attributes_opt for transactions to avoid
37764 the pedwarn in C++98 mode. */
37766 static tree
37768 {
37783 {
37787 /* For keywords, use the canonical spelling,
37788 not the parsed identifier. */
37792 }
37793 else
37797 error1:
37800 }
37802 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37804 transaction-statement:
37805 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37806 compound-statement
37807 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37808 */
37810 static tree
37812 {
37823 else
37824 {
37828 }
37830 /* Parse a noexcept specification. */
37834 {
37835 /* cancel-and-throw is unimplemented. */
37838 }
37839 else
37842 /* Keep track if we're in the lexical scope of an outer transaction. */
37854 }
37856 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37858 transaction-expression:
37859 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37860 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37861 */
37863 static tree
37865 {
37878 keyword == RID_TRANSACTION_RELAXED
37892 /* Set this early. This might mean that we allow transaction_cancel in
37893 an expression that we find out later actually has to be a constexpr.
37894 However, we expect that cxx_constant_value will be able to deal with
37895 this; also, if the noexcept has no constexpr, then what we parse next
37896 really is a transaction's body. */
37899 /* Parse a noexcept specification. */
37905 {
37912 }
37913 else
37914 {
37915 /* The only expression that is available got parsed for the noexcept
37916 already. noexcept is true then. */
37919 }
37928 }
37930 /* Parse a function-transaction-block.
37932 function-transaction-block:
37933 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37934 function-body
37935 __transaction_atomic txn-attribute[opt] function-try-block
37936 __transaction_relaxed ctor-initializer[opt] function-body
37937 __transaction_relaxed function-try-block
37938 */
37940 static bool
37942 {
37958 else
37959 {
37963 }
37971 else
37972 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37980 }
37982 /* Parse a __transaction_cancel statement.
37984 cancel-statement:
37985 __transaction_cancel txn-attribute[opt] ;
37986 __transaction_cancel txn-attribute[opt] throw-expression ;
37988 ??? Cancel and throw is not yet implemented. */
37990 static tree
37992 {
37998 RT_TRANSACTION_CANCEL);
38005 /* ??? Parse cancel-and-throw here. */
38010 {
38014 }
38016 {
38020 }
38022 {
38025 {
38031 }
38032 }
38034 {
38038 }
38044 }
38045 \f
38046 /* The parser. */
38050 \f
38051 /* Special handling for the first token or line in the file. The first
38052 thing in the file might be #pragma GCC pch_preprocess, which loads a
38053 PCH file, which is a GC collection point. So we need to handle this
38054 first pragma without benefit of an existing lexer structure.
38056 Always returns one token to the caller in *FIRST_TOKEN. This is
38057 either the true first token of the file, or the first token after
38058 the initial pragma. */
38060 static void
38062 {
38071 {
38078 }
38079 else
38082 /* Skip to the end of the pragma. */
38086 /* Now actually load the PCH file. */
38090 /* Read one more token to return to our caller. We have to do this
38091 after reading the PCH file in, since its pointers have to be
38092 live. */
38094 }
38096 /* Parses the grainsize pragma for the _Cilk_for statement.
38097 Syntax:
38098 #pragma cilk grainsize = <VALUE>. */
38100 static void
38102 {
38104 {
38109 {
38112 }
38114 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38117 else
38119 "%<#pragma cilk grainsize%> is not followed by "
38122 }
38124 }
38126 /* Normal parsing of a pragma token. Here we can (and must) use the
38127 regular lexer. */
38129 static bool
38131 {
38134 tree stmt;
38145 {
38153 {
38163 }
38168 {
38178 }
38183 {
38194 }
38199 {
38210 }
38215 {
38226 }
38247 {
38252 }
38260 {
38265 }
38273 {
38277 }
38283 {
38288 }
38296 {
38301 }
38356 "%<#pragma omp section%> may only be used in "
38361 {
38363 {
38367 }
38374 {
38377 }
38380 }
38384 {
38388 }
38396 {
38400 }
38402 /* Ignore the pragma if Cilk Plus is not enabled. */
38404 {
38407 }
38408 else
38409 {
38413 }
38420 bad_stmt:
38423 }
38427 }
38429 /* The interface the pragma parsers have to the lexer. */
38431 enum cpp_ttype
38433 {
38445 else
38446 {
38450 }
38453 }
38455 \f
38456 /* External interface. */
38458 /* Parse one entire translation unit. */
38460 void
38462 {
38475 }
38477 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38478 vectorlength clause:
38479 Syntax:
38480 vectorlength ( constant-expression ) */
38482 static tree
38485 {
38487 tree expr;
38488 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38489 safelen clause. Thus, vectorlength is represented as OMP 4.0
38490 safelen. For SIMD-enabled function it is represented by OMP 4.0
38491 simdlen. */
38494 loc);
38495 else
38497 loc);
38505 /* If expr == error_mark_node, then don't emit any errors nor
38506 create a clause. if any of the above functions returns
38507 error mark node then they would have emitted an error message. */
38509 ;
38517 else
38518 {
38519 tree c;
38521 {
38526 }
38527 else
38528 {
38533 }
38534 }
38539 }
38541 /* Handles the Cilk Plus #pragma simd linear clause.
38542 Syntax:
38543 linear ( simd-linear-variable-list )
38545 simd-linear-variable-list:
38546 simd-linear-variable
38547 simd-linear-variable-list , simd-linear-variable
38549 simd-linear-variable:
38550 id-expression
38551 id-expression : simd-linear-step
38553 simd-linear-step:
38554 conditional-expression */
38556 static tree
38558 {
38564 {
38568 }
38573 {
38576 {
38580 }
38587 {
38591 }
38592 else
38593 {
38597 /* If present, parse the linear step. Otherwise, assume the default
38598 value of 1. */
38600 {
38607 {
38608 /* If an error has occurred, then the whole pragma is
38609 considered ill-formed. Thus, no reason to keep
38610 parsing. */
38613 }
38621 else
38623 "step size must be an integer constant "
38625 }
38627 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38633 }
38638 else
38639 {
38644 }
38645 }
38649 }
38651 /* Returns the name of the next clause. If the clause is not
38652 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38653 token is not consumed. Otherwise, the appropriate enum from the
38654 pragma_simd_clause is returned and the token is consumed. */
38656 static pragma_omp_clause
38658 {
38659 pragma_omp_clause clause_type;
38676 else
38681 }
38683 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38685 static tree
38687 {
38692 {
38693 pragma_omp_clause c_kind;
38700 /* Use the OpenMP 4.0 equivalent function. */
38703 /* Use the OpenMP 4.0 equivalent function. */
38705 clauses);
38707 /* Use the OMP 4.0 equivalent function. */
38709 clauses);
38711 /* Use the OMP 4.0 equivalent function. */
38713 else
38714 {
38718 }
38719 }
38725 else
38727 }
38729 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38731 static void
38733 {
38740 {
38744 }
38753 }
38755 /* Main entry-point for parsing Cilk Plus _Cilk_for
38756 loops. The return value is error_mark_node
38757 when errors happen and CILK_FOR tree on success. */
38759 static tree
38761 {
38776 else
38782 }
38784 /* Create an identifier for a generic parameter type (a synthesized
38785 template parameter implied by `auto' or a concept identifier). */
38788 static tree
38790 {
38794 }
38796 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38797 (creating a new template parameter list if necessary). Returns the newly
38798 created template type parm. */
38800 static tree
38802 {
38805 /* Before committing to modifying any scope, if we're in an
38806 implicit template scope, and we're trying to synthesize a
38807 constrained parameter, try to find a previous parameter with
38808 the same name. This is the same-type rule for abbreviated
38809 function templates.
38811 NOTE: We can generate implicit parameters when tentatively
38812 parsing a nested name specifier, only to reject that parse
38813 later. However, matching the same template-id as part of a
38814 direct-declarator should generate an identical template
38815 parameter, so this rule will merge them. */
38817 {
38820 {
38822 {
38825 /* Return the TEMPLATE_PARM_INDEX. */
38828 }
38830 }
38831 }
38833 /* We are either continuing a function template that already contains implicit
38834 template parameters, creating a new fully-implicit function template, or
38835 extending an existing explicit function template with implicit template
38836 parameters. */
38844 {
38848 }
38849 else
38850 {
38851 /* Roll back to the existing template parameter scope (in the case of
38852 extending an explicit function template) or introduce a new template
38853 parameter scope ahead of the function parameter scope (or class scope
38854 in the case of out-of-line member definitions). The function scope is
38855 added back after template parameter synthesis below. */
38860 {
38863 }
38865 {
38866 /* If not defining a class, then any class scope is a scope level in
38867 an out-of-line member definition. In this case simply wind back
38868 beyond the first such scope to inject the template parameter list.
38869 Otherwise wind back to the class being defined. The latter can
38870 occur in class member friend declarations such as:
38872 class A {
38873 void foo (auto);
38874 };
38875 class B {
38876 friend void A::foo (auto);
38877 };
38879 The template parameter list synthesized for the friend declaration
38880 must be injected in the scope of 'B'. This can also occur in
38881 erroneous cases such as:
38883 struct A {
38884 struct B {
38885 void foo (auto);
38886 };
38887 void B::foo (auto) {}
38888 };
38890 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38891 but, nevertheless, the template parameter list synthesized for the
38892 declarator should be injected into the scope of 'A' as if the
38893 ill-formed template was specified explicitly. */
38896 {
38899 }
38900 }
38906 {
38907 /* Introduce a new template parameter list for implicit template
38908 parameters. */
38912 parser->implicit_template_scope
38919 }
38920 else
38921 {
38922 /* Synthesize implicit template parameters at the end of the explicit
38923 template parameter list. */
38930 parser->implicit_template_parms
38932 }
38933 }
38935 /* Synthesize a new template parameter and track the current template
38936 parameter chain with implicit_template_parms. */
38940 tree synth_tmpl_parm;
38944 synth_tmpl_parm
38947 synth_tmpl_parm
38949 else
38950 {
38954 }
38956 // Attach the constraint to the parm before processing.
38959 tree new_parm
38961 input_location,
38962 node,
38966 // Chain the new parameter to the list of implicit parameters.
38968 parser->implicit_template_parms
38970 else
38975 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38978 /* If creating a fully implicit function template, start the new implicit
38979 template parameter list with this synthesized type, otherwise grow the
38980 current template parameter list. */
38983 {
38990 }
38991 else
38992 {
38997 }
38999 // If the new parameter was constrained, we need to add that to the
39000 // constraints in the template parameter list.
39002 {
39006 }
39011 }
39013 /* Finish the declaration of a fully implicit function template. Such a
39014 template has no explicit template parameter list so has not been through the
39015 normal template head and tail processing. synthesize_implicit_template_parm
39016 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39017 provided if the declaration is a class member such that its template
39018 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39019 form is returned. Otherwise NULL_TREE is returned. */
39021 static tree
39023 {
39028 {
39032 }
39042 }