| blob | 573b97a658f57075c499977cb4dda725c06e20d2 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2017 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
47 \f
48 /* The lexer. */
50 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
51 and c-lex.c) and the C++ parser. */
54 {
56 };
58 /* The various kinds of non integral constant we encounter. */
60 NIC_NONE,
61 /* floating-point literal */
62 NIC_FLOAT,
63 /* %<this%> */
64 NIC_THIS,
65 /* %<__FUNCTION__%> */
66 NIC_FUNC_NAME,
67 /* %<__PRETTY_FUNCTION__%> */
68 NIC_PRETTY_FUNC,
69 /* %<__func__%> */
70 NIC_C99_FUNC,
71 /* "%<va_arg%> */
72 NIC_VA_ARG,
73 /* a cast */
74 NIC_CAST,
75 /* %<typeid%> operator */
76 NIC_TYPEID,
77 /* non-constant compound literals */
78 NIC_NCC,
79 /* a function call */
80 NIC_FUNC_CALL,
81 /* an increment */
82 NIC_INC,
83 /* an decrement */
84 NIC_DEC,
85 /* an array reference */
86 NIC_ARRAY_REF,
87 /* %<->%> */
88 NIC_ARROW,
89 /* %<.%> */
90 NIC_POINT,
91 /* the address of a label */
92 NIC_ADDR_LABEL,
93 /* %<*%> */
94 NIC_STAR,
95 /* %<&%> */
96 NIC_ADDR,
97 /* %<++%> */
98 NIC_PREINCREMENT,
99 /* %<--%> */
100 NIC_PREDECREMENT,
101 /* %<new%> */
102 NIC_NEW,
103 /* %<delete%> */
104 NIC_DEL,
105 /* calls to overloaded operators */
106 NIC_OVERLOADED,
107 /* an assignment */
108 NIC_ASSIGNMENT,
109 /* a comma operator */
110 NIC_COMMA,
111 /* a call to a constructor */
112 NIC_CONSTRUCTOR,
113 /* a transaction expression */
114 NIC_TRANSACTION
115 };
117 /* The various kinds of errors about name-lookup failing. */
119 /* NULL */
120 NLE_NULL,
121 /* is not a type */
122 NLE_TYPE,
123 /* is not a class or namespace */
124 NLE_CXX98,
125 /* is not a class, namespace, or enumeration */
126 NLE_NOT_CXX98
127 };
129 /* The various kinds of required token */
131 RT_NONE,
153 /* The type is CPP_KEYWORD */
182 RT_TRANSACTION_CANCEL /* __transaction_cancel */
183 };
185 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
186 reverting it on destruction. */
188 class type_id_in_expr_sentinel
189 {
199 };
201 /* Prototypes. */
207 static void cp_lexer_destroy
209 static int cp_lexer_saving_tokens
213 static void cp_lexer_get_preprocessor_token
221 static bool cp_lexer_next_token_is_not
223 static bool cp_lexer_next_token_is_keyword
227 static void cp_lexer_purge_token
229 static void cp_lexer_purge_tokens_after
231 static void cp_lexer_save_tokens
233 static void cp_lexer_commit_tokens
235 static void cp_lexer_rollback_tokens
237 static void cp_lexer_print_token
241 static void cp_lexer_start_debugging
243 static void cp_lexer_stop_debugging
249 static void cp_parser_initial_pragma
252 static void cp_parser_cilk_simd
254 static tree cp_parser_cilk_for
256 static bool cp_parser_omp_declare_reduction_exprs
258 static tree cp_parser_cilk_simd_vectorlength
260 static void cp_finalize_oacc_routine
263 /* Manifest constants. */
264 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
265 #define CP_SAVED_TOKEN_STACK 5
267 /* Variables. */
269 /* The stream to which debugging output should be written. */
272 /* Nonzero if we are parsing an unevaluated operand: an operand to
273 sizeof, typeof, or alignof. */
276 /* Dump up to NUM tokens in BUFFER to FILE starting with token
277 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
278 first token in BUFFER. If NUM is 0, dump all the tokens. If
279 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
280 highlighted by surrounding it in [[ ]]. */
282 static void
286 {
303 {
306 }
311 {
318 nprinted++;
328 {
338 }
339 }
342 {
345 }
348 }
351 /* Dump all tokens in BUFFER to stderr. */
353 void
355 {
357 }
359 DEBUG_FUNCTION void
361 {
363 }
365 DEBUG_FUNCTION void
367 {
370 else
372 }
375 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
376 description for T. */
378 static void
380 {
382 {
385 }
386 }
389 /* Dump parser context C to FILE. */
391 static void
393 {
398 }
401 /* Print the stack of parsing contexts to FILE starting with FIRST. */
403 static void
405 {
411 {
414 }
415 }
418 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
420 static void
422 {
425 }
428 /* Print an unparsed function entry UF to FILE. */
430 static void
432 {
435 tree fn;
440 i++)
441 {
447 }
452 {
455 }
461 {
464 }
466 }
469 /* Print the stack of unparsed member functions S to FILE. */
471 static void
474 {
480 {
483 }
484 }
487 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
488 the given PARSER. If FILE is NULL, the output is printed on stderr. */
490 static void
492 {
504 next_token);
505 }
508 /* Dump debugging information for the given PARSER. If FILE is NULL,
509 the output is printed on stderr. */
511 void
513 {
516 expanded_location eloc;
594 }
596 DEBUG_FUNCTION void
598 {
600 }
602 DEBUG_FUNCTION void
604 {
607 else
609 }
611 /* Allocate memory for a new lexer object and return it. */
615 {
620 /* Allocate the memory. */
623 /* Initially we are not debugging. */
628 /* Create the buffer. */
632 }
635 /* Create a new main C++ lexer, the lexer that gets tokens from the
636 preprocessor. */
640 {
642 cp_token token;
644 /* It's possible that parsing the first pragma will load a PCH file,
645 which is a GC collection point. So we have to do that before
646 allocating any memory. */
651 /* Put the first token in the buffer. */
654 /* Get the remaining tokens from the preprocessor. */
656 {
659 }
668 /* Subsequent preprocessor diagnostics should use compiler
669 diagnostic functions to get the compiler source location. */
674 }
676 /* Create a new lexer whose token stream is primed with the tokens in
677 CACHE. When these tokens are exhausted, no new tokens will be read. */
681 {
686 /* We do not own the buffer. */
693 /* Initially we are not debugging. */
698 }
700 /* Frees all resources associated with LEXER. */
702 static void
704 {
708 }
710 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
711 be used. The point of this flag is to help the compiler to fold away calls
712 to cp_lexer_debugging_p within this source file at compile time, when the
713 lexer is not being debugged. */
715 #define LEXER_DEBUGGING_ENABLED_P false
717 /* Returns nonzero if debugging information should be output. */
721 {
726 }
731 {
735 }
739 {
741 }
745 {
747 }
751 {
754 else
756 }
760 {
763 /* Skip past purged tokens. */
765 {
767 tp--;
768 }
771 }
773 /* nonzero if we are presently saving tokens. */
777 {
779 }
781 /* Store the next token from the preprocessor in *TOKEN. Return true
782 if we reach EOF. If LEXER is NULL, assume we are handling an
783 initial #pragma pch_preprocess, and thus want the lexer to return
784 processed strings. */
786 static void
788 {
791 /* Get a new token from the preprocessor. */
792 token->type
799 /* On some systems, some header files are surrounded by an
800 implicit extern "C" block. Set a flag in the token if it
801 comes from such a header. */
806 /* Check to see if this token is a keyword. */
808 {
810 {
811 /* Mark this token as a keyword. */
813 /* Record which keyword. */
815 }
816 else
817 {
821 {
822 /* Warn about the C++0x keyword (but still treat it as
823 an identifier). */
828 /* Clear out the C_RID_CODE so we don't warn about this
829 particular identifier-turned-keyword again. */
831 }
834 }
835 }
837 {
838 /* This only happens in Objective-C++; it must be a keyword. */
841 {
842 /* Replace 'class' with '@class', 'private' with '@private',
843 etc. This prevents confusion with the C++ keyword
844 'class', and makes the tokens consistent with other
845 Objective-C 'AT' keywords. For example '@class' is
846 reported as RID_AT_CLASS which is consistent with
847 '@synchronized', which is reported as
848 RID_AT_SYNCHRONIZED.
849 */
859 }
860 }
861 }
863 /* Update the globals input_location and the input file stack from TOKEN. */
866 {
868 {
870 }
871 }
873 /* Update the globals input_location and the input file stack from LEXER. */
876 {
879 }
881 /* Return a pointer to the next token in the token stream, but do not
882 consume it. */
886 {
888 {
892 }
894 }
896 /* Return true if the next token has the indicated TYPE. */
900 {
902 }
904 /* Return true if the next token does not have the indicated TYPE. */
908 {
910 }
912 /* Return true if the next token is the indicated KEYWORD. */
916 {
918 }
922 {
924 }
928 {
930 }
932 /* Return true if the next token is not the indicated KEYWORD. */
936 {
938 }
940 /* Return true if KEYWORD can start a decl-specifier. */
942 bool
944 {
946 {
947 /* auto specifier: storage-class-specifier in C++,
948 simple-type-specifier in C++0x. */
950 /* Storage classes. */
956 /* Elaborated type specifiers. */
962 /* Simple type specifiers. */
976 /* GNU extensions. */
979 /* C++0x extensions. */
991 }
992 }
994 /* Return true if the next token is a keyword for a decl-specifier. */
996 static bool
998 {
1003 }
1005 /* Returns TRUE iff the token T begins a decltype type. */
1007 static bool
1009 {
1012 }
1014 /* Returns TRUE iff the next token begins a decltype type. */
1016 static bool
1018 {
1021 }
1023 /* Called when processing a token with tree_check_value; perform or defer the
1024 associated checks and return the value. */
1026 static tree
1028 {
1029 /* Perform any access checks that were deferred. */
1034 {
1040 }
1041 /* Return the stored value. */
1043 }
1045 /* Return a pointer to the Nth token in the token stream. If N is 1,
1046 then this is precisely equivalent to cp_lexer_peek_token (except
1047 that it is not inline). One would like to disallow that case, but
1048 there is one case (cp_parser_nth_token_starts_template_id) where
1049 the caller passes a variable for N and it might be 1. */
1053 {
1056 /* N is 1-based, not zero-based. */
1067 {
1070 {
1073 }
1077 }
1080 {
1083 }
1086 }
1088 /* Return the next token, and advance the lexer's next_token pointer
1089 to point to the next non-purged token. */
1093 {
1099 do
1100 {
1103 {
1106 }
1108 }
1113 /* Provide debugging output. */
1115 {
1119 }
1122 }
1124 /* Permanently remove the next token from the token stream, and
1125 advance the next_token pointer to refer to the next non-purged
1126 token. */
1128 static void
1130 {
1139 do
1140 {
1141 tok++;
1143 {
1146 }
1147 }
1150 }
1152 /* Permanently remove all tokens after TOK, up to, but not
1153 including, the token that will be returned next by
1154 cp_lexer_peek_token. */
1156 static void
1158 {
1167 {
1172 }
1173 }
1175 /* Begin saving tokens. All tokens consumed after this point will be
1176 preserved. */
1178 static void
1180 {
1181 /* Provide debugging output. */
1186 }
1188 /* Commit to the portion of the token stream most recently saved. */
1190 static void
1192 {
1193 /* Provide debugging output. */
1198 }
1200 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1201 to the token stream. Stop saving tokens. */
1203 static void
1205 {
1206 /* Provide debugging output. */
1211 }
1213 /* RAII wrapper around the above functions, with sanity checking. Creating
1214 a variable saves tokens, which are committed when the variable is
1215 destroyed unless they are explicitly rolled back by calling the rollback
1216 member function. */
1218 struct saved_token_sentinel
1219 {
1224 {
1227 }
1229 {
1232 }
1234 {
1238 }
1239 };
1241 /* Print a representation of the TOKEN on the STREAM. */
1243 static void
1245 {
1246 /* We don't use cpp_type2name here because the parser defines
1247 a few tokens of its own. */
1249 /* cpplib-defined token types */
1250 #define OP(e, s) #e,
1251 #define TK(e, s) #e,
1252 TTYPE_TABLE
1253 #undef OP
1254 #undef TK
1255 /* C++ parser token types - see "Manifest constants", above. */
1259 };
1261 /* For some tokens, print the associated data. */
1263 {
1265 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1266 For example, `struct' is mapped to an INTEGER_CST. */
1269 /* fall through */
1287 /* If we have a name for the token, print it out. Otherwise, we
1288 simply give the numeric code. */
1291 else
1294 }
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 }
1304 DEBUG_FUNCTION void
1306 {
1309 else
1311 }
1314 /* Start emitting debugging information. */
1316 static void
1318 {
1325 }
1327 /* Stop emitting debugging information. */
1329 static void
1331 {
1338 }
1340 /* Create a new cp_token_cache, representing a range of tokens. */
1344 {
1349 }
1351 /* Diagnose if #pragma omp declare simd isn't followed immediately
1352 by function declaration or definition. */
1356 {
1358 {
1362 }
1363 }
1365 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1366 and put that into "omp declare simd" attribute. */
1370 {
1372 {
1374 {
1377 }
1379 {
1382 }
1383 }
1384 }
1386 /* Diagnose if #pragma acc routine isn't followed immediately by function
1387 declaration or definition. */
1391 {
1393 {
1395 "%<#pragma acc routine%> not immediately followed by "
1398 }
1399 }
1400 \f
1401 /* Decl-specifiers. */
1403 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1405 static void
1407 {
1409 }
1411 /* Declarators. */
1413 /* Nothing other than the parser should be creating declarators;
1414 declarators are a semi-syntactic representation of C++ entities.
1415 Other parts of the front end that need to create entities (like
1416 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1419 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1429 /* An erroneous declarator. */
1432 /* The obstack on which declarators and related data structures are
1433 allocated. */
1436 /* Alloc BYTES from the declarator memory pool. */
1440 {
1442 }
1444 /* Allocate a declarator of the indicated KIND. Clear fields that are
1445 common to all declarators. */
1449 {
1461 }
1463 /* Make a declarator for a generalized identifier. If
1464 QUALIFYING_SCOPE is non-NULL, the identifier is
1465 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1466 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1467 is, if any. */
1471 special_function_kind sfk)
1472 {
1475 /* It is valid to write:
1477 class C { void f(); };
1478 typedef C D;
1479 void D::f();
1481 The standard is not clear about whether `typedef const C D' is
1482 legal; as of 2002-09-15 the committee is considering that
1483 question. EDG 3.0 allows that syntax. Therefore, we do as
1484 well. */
1498 }
1500 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1501 of modifiers such as const or volatile to apply to the pointer
1502 type, represented as identifiers. ATTRIBUTES represent the attributes that
1503 appertain to the pointer or reference. */
1505 cp_declarator *
1507 tree attributes)
1508 {
1516 {
1520 }
1521 else
1527 }
1529 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1530 represent the attributes that appertain to the pointer or
1531 reference. */
1533 cp_declarator *
1536 {
1544 {
1548 }
1549 else
1555 }
1557 /* Like make_pointer_declarator -- but for a pointer to a non-static
1558 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1559 appertain to the pointer or reference. */
1561 cp_declarator *
1564 tree attributes)
1565 {
1574 {
1577 }
1578 else
1584 }
1586 /* Make a declarator for the function given by TARGET, with the
1587 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1588 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1589 indicates what exceptions can be thrown. */
1591 cp_declarator *
1593 tree parms,
1594 cp_cv_quals cv_qualifiers,
1595 cp_virt_specifiers virt_specifiers,
1596 cp_ref_qualifier ref_qualifier,
1597 tree tx_qualifier,
1598 tree exception_specification,
1599 tree late_return_type,
1600 tree requires_clause)
1601 {
1615 {
1619 }
1620 else
1624 }
1626 /* Make a declarator for an array of BOUNDS elements, each of which is
1627 defined by ELEMENT. */
1629 cp_declarator *
1631 {
1638 {
1642 }
1643 else
1647 }
1649 /* Determine whether the declarator we've seen so far can be a
1650 parameter pack, when followed by an ellipsis. */
1651 static bool
1653 {
1655 /* We already saw an ellipsis. */
1658 /* Search for a declarator name, or any other declarator that goes
1659 after the point where the ellipsis could appear in a parameter
1660 pack. If we find any of these, then this declarator can not be
1661 made into a parameter pack. */
1664 {
1666 {
1679 }
1680 }
1683 }
1687 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1688 DECLARATOR and DEFAULT_ARGUMENT. */
1690 cp_parameter_declarator *
1693 tree default_argument,
1695 {
1703 else
1710 }
1712 /* Returns true iff DECLARATOR is a declaration for a function. */
1714 static bool
1716 {
1718 {
1727 }
1729 }
1731 /* The parser. */
1733 /* Overview
1734 --------
1736 A cp_parser parses the token stream as specified by the C++
1737 grammar. Its job is purely parsing, not semantic analysis. For
1738 example, the parser breaks the token stream into declarators,
1739 expressions, statements, and other similar syntactic constructs.
1740 It does not check that the types of the expressions on either side
1741 of an assignment-statement are compatible, or that a function is
1742 not declared with a parameter of type `void'.
1744 The parser invokes routines elsewhere in the compiler to perform
1745 semantic analysis and to build up the abstract syntax tree for the
1746 code processed.
1748 The parser (and the template instantiation code, which is, in a
1749 way, a close relative of parsing) are the only parts of the
1750 compiler that should be calling push_scope and pop_scope, or
1751 related functions. The parser (and template instantiation code)
1752 keeps track of what scope is presently active; everything else
1753 should simply honor that. (The code that generates static
1754 initializers may also need to set the scope, in order to check
1755 access control correctly when emitting the initializers.)
1757 Methodology
1758 -----------
1760 The parser is of the standard recursive-descent variety. Upcoming
1761 tokens in the token stream are examined in order to determine which
1762 production to use when parsing a non-terminal. Some C++ constructs
1763 require arbitrary look ahead to disambiguate. For example, it is
1764 impossible, in the general case, to tell whether a statement is an
1765 expression or declaration without scanning the entire statement.
1766 Therefore, the parser is capable of "parsing tentatively." When the
1767 parser is not sure what construct comes next, it enters this mode.
1768 Then, while we attempt to parse the construct, the parser queues up
1769 error messages, rather than issuing them immediately, and saves the
1770 tokens it consumes. If the construct is parsed successfully, the
1771 parser "commits", i.e., it issues any queued error messages and
1772 the tokens that were being preserved are permanently discarded.
1773 If, however, the construct is not parsed successfully, the parser
1774 rolls back its state completely so that it can resume parsing using
1775 a different alternative.
1777 Future Improvements
1778 -------------------
1780 The performance of the parser could probably be improved substantially.
1781 We could often eliminate the need to parse tentatively by looking ahead
1782 a little bit. In some places, this approach might not entirely eliminate
1783 the need to parse tentatively, but it might still speed up the average
1784 case. */
1786 /* Flags that are passed to some parsing functions. These values can
1787 be bitwise-ored together. */
1789 enum
1790 {
1791 /* No flags. */
1793 /* The construct is optional. If it is not present, then no error
1794 should be issued. */
1796 /* When parsing a type-specifier, treat user-defined type-names
1797 as non-type identifiers. */
1799 /* When parsing a type-specifier, do not try to parse a class-specifier
1800 or enum-specifier. */
1802 /* When parsing a decl-specifier-seq, only allow type-specifier or
1803 constexpr. */
1805 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1807 };
1809 /* This type is used for parameters and variables which hold
1810 combinations of the above flags. */
1813 /* The different kinds of declarators we want to parse. */
1815 enum cp_parser_declarator_kind
1816 {
1817 /* We want an abstract declarator. */
1818 CP_PARSER_DECLARATOR_ABSTRACT,
1819 /* We want a named declarator. */
1820 CP_PARSER_DECLARATOR_NAMED,
1821 /* We don't mind, but the name must be an unqualified-id. */
1822 CP_PARSER_DECLARATOR_EITHER
1823 };
1825 /* The precedence values used to parse binary expressions. The minimum value
1826 of PREC must be 1, because zero is reserved to quickly discriminate
1827 binary operators from other tokens. */
1829 enum cp_parser_prec
1830 {
1831 PREC_NOT_OPERATOR,
1832 PREC_LOGICAL_OR_EXPRESSION,
1833 PREC_LOGICAL_AND_EXPRESSION,
1834 PREC_INCLUSIVE_OR_EXPRESSION,
1835 PREC_EXCLUSIVE_OR_EXPRESSION,
1836 PREC_AND_EXPRESSION,
1837 PREC_EQUALITY_EXPRESSION,
1838 PREC_RELATIONAL_EXPRESSION,
1839 PREC_SHIFT_EXPRESSION,
1840 PREC_ADDITIVE_EXPRESSION,
1841 PREC_MULTIPLICATIVE_EXPRESSION,
1842 PREC_PM_EXPRESSION,
1843 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1844 };
1846 /* A mapping from a token type to a corresponding tree node type, with a
1847 precedence value. */
1849 struct cp_parser_binary_operations_map_node
1850 {
1851 /* The token type. */
1853 /* The corresponding tree code. */
1855 /* The precedence of this operator. */
1857 };
1859 struct cp_parser_expression_stack_entry
1860 {
1861 /* Left hand side of the binary operation we are currently
1862 parsing. */
1863 cp_expr lhs;
1864 /* Original tree code for left hand side, if it was a binary
1865 expression itself (used for -Wparentheses). */
1867 /* Tree code for the binary operation we are parsing. */
1869 /* Precedence of the binary operation we are parsing. */
1871 /* Location of the binary operation we are parsing. */
1872 location_t loc;
1873 };
1875 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1876 entries because precedence levels on the stack are monotonically
1877 increasing. */
1881 /* Prototypes. */
1883 /* Constructors and destructors. */
1888 /* Class variables. */
1892 /* The operator-precedence table used by cp_parser_binary_expression.
1893 Transformed into an associative array (binops_by_token) by
1894 cp_parser_new. */
1927 };
1929 /* The same as binops, but initialized by cp_parser_new so that
1930 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1931 for speed. */
1934 /* Constructors and destructors. */
1936 /* Construct a new context. The context below this one on the stack
1937 is given by NEXT. */
1941 {
1944 /* Allocate the storage. */
1946 {
1947 /* Pull the first entry from the free list. */
1951 }
1952 else
1955 /* No errors have occurred yet in this context. */
1957 /* If this is not the bottommost context, copy information that we
1958 need from the previous context. */
1960 {
1961 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1962 expression, then we are parsing one in this context, too. */
1964 /* Thread the stack. */
1966 }
1969 }
1971 /* Managing the unparsed function queues. */
1973 #define unparsed_funs_with_default_args \
1974 parser->unparsed_queues->last ().funs_with_default_args
1975 #define unparsed_funs_with_definitions \
1976 parser->unparsed_queues->last ().funs_with_definitions
1977 #define unparsed_nsdmis \
1978 parser->unparsed_queues->last ().nsdmis
1979 #define unparsed_classes \
1980 parser->unparsed_queues->last ().classes
1982 static void
1984 {
1987 }
1989 static void
1991 {
1994 }
1996 /* Prototypes. */
1998 /* Constructors and destructors. */
2003 /* Routines to parse various constructs.
2005 Those that return `tree' will return the error_mark_node (rather
2006 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2007 Sometimes, they will return an ordinary node if error-recovery was
2008 attempted, even though a parse error occurred. So, to check
2009 whether or not a parse error occurred, you should always use
2010 cp_parser_error_occurred. If the construct is optional (indicated
2011 either by an `_opt' in the name of the function that does the
2012 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2013 the construct is not present. */
2015 /* Lexical conventions [gram.lex] */
2017 static cp_expr cp_parser_identifier
2019 static cp_expr cp_parser_string_literal
2021 static cp_expr cp_parser_userdef_char_literal
2023 static tree cp_parser_userdef_string_literal
2025 static cp_expr cp_parser_userdef_numeric_literal
2028 /* Basic concepts [gram.basic] */
2030 static bool cp_parser_translation_unit
2033 /* Expressions [gram.expr] */
2035 static cp_expr cp_parser_primary_expression
2037 static cp_expr cp_parser_id_expression
2039 static cp_expr cp_parser_unqualified_id
2041 static tree cp_parser_nested_name_specifier_opt
2043 static tree cp_parser_nested_name_specifier
2045 static tree cp_parser_qualifying_entity
2047 static cp_expr cp_parser_postfix_expression
2049 static tree cp_parser_postfix_open_square_expression
2051 static tree cp_parser_postfix_dot_deref_expression
2055 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2057 static void cp_parser_pseudo_destructor_name
2059 static cp_expr cp_parser_unary_expression
2061 static enum tree_code cp_parser_unary_operator
2063 static tree cp_parser_new_expression
2067 static tree cp_parser_new_type_id
2075 static tree cp_parser_delete_expression
2077 static cp_expr cp_parser_cast_expression
2079 static cp_expr cp_parser_binary_expression
2081 static tree cp_parser_question_colon_clause
2083 static cp_expr cp_parser_assignment_expression
2085 static enum tree_code cp_parser_assignment_operator_opt
2087 static cp_expr cp_parser_expression
2089 static cp_expr cp_parser_constant_expression
2091 static cp_expr cp_parser_builtin_offsetof
2093 static cp_expr cp_parser_lambda_expression
2095 static void cp_parser_lambda_introducer
2097 static bool cp_parser_lambda_declarator_opt
2099 static void cp_parser_lambda_body
2102 /* Statements [gram.stmt.stmt] */
2104 static void cp_parser_statement
2106 static void cp_parser_label_for_labeled_statement
2108 static tree cp_parser_expression_statement
2110 static tree cp_parser_compound_statement
2112 static void cp_parser_statement_seq_opt
2114 static tree cp_parser_selection_statement
2116 static tree cp_parser_condition
2118 static tree cp_parser_iteration_statement
2120 static bool cp_parser_init_statement
2122 static tree cp_parser_for
2124 static tree cp_parser_c_for
2126 static tree cp_parser_range_for
2128 static void do_range_for_auto_deduction
2130 static tree cp_parser_perform_range_for_lookup
2132 static tree cp_parser_range_for_member_function
2134 static tree cp_parser_jump_statement
2136 static void cp_parser_declaration_statement
2139 static tree cp_parser_implicitly_scoped_statement
2141 static void cp_parser_already_scoped_statement
2144 /* Declarations [gram.dcl.dcl] */
2146 static void cp_parser_declaration_seq_opt
2148 static void cp_parser_declaration
2150 static void cp_parser_block_declaration
2152 static void cp_parser_simple_declaration
2154 static void cp_parser_decl_specifier_seq
2156 static tree cp_parser_storage_class_specifier_opt
2158 static tree cp_parser_function_specifier_opt
2160 static tree cp_parser_type_specifier
2163 static tree cp_parser_simple_type_specifier
2165 static tree cp_parser_type_name
2167 static tree cp_parser_type_name
2169 static tree cp_parser_nonclass_name
2171 static tree cp_parser_elaborated_type_specifier
2173 static tree cp_parser_enum_specifier
2175 static void cp_parser_enumerator_list
2177 static void cp_parser_enumerator_definition
2179 static tree cp_parser_namespace_name
2181 static void cp_parser_namespace_definition
2183 static void cp_parser_namespace_body
2185 static tree cp_parser_qualified_namespace_specifier
2187 static void cp_parser_namespace_alias_definition
2189 static bool cp_parser_using_declaration
2191 static void cp_parser_using_directive
2193 static tree cp_parser_alias_declaration
2195 static void cp_parser_asm_definition
2197 static void cp_parser_linkage_specification
2199 static void cp_parser_static_assert
2201 static tree cp_parser_decltype
2203 static tree cp_parser_decomposition_declaration
2206 /* Declarators [gram.dcl.decl] */
2208 static tree cp_parser_init_declarator
2215 static enum tree_code cp_parser_ptr_operator
2217 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2219 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2221 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2223 static tree cp_parser_tx_qualifier_opt
2225 static tree cp_parser_late_return_type_opt
2227 static tree cp_parser_declarator_id
2229 static tree cp_parser_type_id
2231 static tree cp_parser_template_type_arg
2234 static tree cp_parser_type_id_1
2236 static void cp_parser_type_specifier_seq
2238 static tree cp_parser_parameter_declaration_clause
2240 static tree cp_parser_parameter_declaration_list
2244 static tree cp_parser_default_argument
2246 static void cp_parser_function_body
2248 static tree cp_parser_initializer
2250 static cp_expr cp_parser_initializer_clause
2252 static cp_expr cp_parser_braced_list
2257 static bool cp_parser_ctor_initializer_opt_and_function_body
2260 static tree cp_parser_late_parsing_omp_declare_simd
2263 static tree cp_parser_late_parsing_cilk_simd_fn_info
2266 static tree cp_parser_late_parsing_oacc_routine
2269 static tree synthesize_implicit_template_parm
2271 static tree finish_fully_implicit_template
2274 /* Classes [gram.class] */
2276 static tree cp_parser_class_name
2278 static tree cp_parser_class_specifier
2280 static tree cp_parser_class_head
2282 static enum tag_types cp_parser_class_key
2284 static void cp_parser_type_parameter_key
2286 static void cp_parser_member_specification_opt
2288 static void cp_parser_member_declaration
2290 static tree cp_parser_pure_specifier
2292 static tree cp_parser_constant_initializer
2295 /* Derived classes [gram.class.derived] */
2297 static tree cp_parser_base_clause
2299 static tree cp_parser_base_specifier
2302 /* Special member functions [gram.special] */
2304 static tree cp_parser_conversion_function_id
2306 static tree cp_parser_conversion_type_id
2310 static bool cp_parser_ctor_initializer_opt
2312 static void cp_parser_mem_initializer_list
2314 static tree cp_parser_mem_initializer
2316 static tree cp_parser_mem_initializer_id
2319 /* Overloading [gram.over] */
2321 static cp_expr cp_parser_operator_function_id
2323 static cp_expr cp_parser_operator
2326 /* Templates [gram.temp] */
2328 static void cp_parser_template_declaration
2330 static tree cp_parser_template_parameter_list
2332 static tree cp_parser_template_parameter
2334 static tree cp_parser_type_parameter
2336 static tree cp_parser_template_id
2338 static tree cp_parser_template_name
2340 static tree cp_parser_template_argument_list
2342 static tree cp_parser_template_argument
2344 static void cp_parser_explicit_instantiation
2346 static void cp_parser_explicit_specialization
2349 /* Exception handling [gram.exception] */
2351 static tree cp_parser_try_block
2353 static bool cp_parser_function_try_block
2355 static void cp_parser_handler_seq
2357 static void cp_parser_handler
2359 static tree cp_parser_exception_declaration
2361 static tree cp_parser_throw_expression
2363 static tree cp_parser_exception_specification_opt
2365 static tree cp_parser_type_id_list
2368 /* GNU Extensions */
2370 static tree cp_parser_asm_specification_opt
2372 static tree cp_parser_asm_operand_list
2374 static tree cp_parser_asm_clobber_list
2376 static tree cp_parser_asm_label_list
2378 static bool cp_next_tokens_can_be_attribute_p
2380 static bool cp_next_tokens_can_be_gnu_attribute_p
2382 static bool cp_next_tokens_can_be_std_attribute_p
2384 static bool cp_nth_tokens_can_be_std_attribute_p
2386 static bool cp_nth_tokens_can_be_gnu_attribute_p
2388 static bool cp_nth_tokens_can_be_attribute_p
2390 static tree cp_parser_attributes_opt
2392 static tree cp_parser_gnu_attributes_opt
2394 static tree cp_parser_gnu_attribute_list
2396 static tree cp_parser_std_attribute
2398 static tree cp_parser_std_attribute_spec
2400 static tree cp_parser_std_attribute_spec_seq
2402 static bool cp_parser_extension_opt
2404 static void cp_parser_label_declaration
2407 /* Concept Extensions */
2409 static tree cp_parser_requires_clause
2411 static tree cp_parser_requires_clause_opt
2413 static tree cp_parser_requires_expression
2415 static tree cp_parser_requirement_parameter_list
2417 static tree cp_parser_requirement_body
2419 static tree cp_parser_requirement_list
2421 static tree cp_parser_requirement
2423 static tree cp_parser_simple_requirement
2425 static tree cp_parser_compound_requirement
2427 static tree cp_parser_type_requirement
2429 static tree cp_parser_nested_requirement
2432 /* Transactional Memory Extensions */
2434 static tree cp_parser_transaction
2436 static tree cp_parser_transaction_expression
2438 static bool cp_parser_function_transaction
2440 static tree cp_parser_transaction_cancel
2444 pragma_external,
2445 pragma_member,
2446 pragma_objc_icode,
2447 pragma_stmt,
2448 pragma_compound
2449 };
2450 static bool cp_parser_pragma
2453 /* Objective-C++ Productions */
2455 static tree cp_parser_objc_message_receiver
2457 static tree cp_parser_objc_message_args
2459 static tree cp_parser_objc_message_expression
2461 static cp_expr cp_parser_objc_encode_expression
2463 static tree cp_parser_objc_defs_expression
2465 static tree cp_parser_objc_protocol_expression
2467 static tree cp_parser_objc_selector_expression
2469 static cp_expr cp_parser_objc_expression
2471 static bool cp_parser_objc_selector_p
2473 static tree cp_parser_objc_selector
2475 static tree cp_parser_objc_protocol_refs_opt
2477 static void cp_parser_objc_declaration
2479 static tree cp_parser_objc_statement
2481 static bool cp_parser_objc_valid_prefix_attributes
2483 static void cp_parser_objc_at_property_declaration
2485 static void cp_parser_objc_at_synthesize_declaration
2487 static void cp_parser_objc_at_dynamic_declaration
2489 static tree cp_parser_objc_struct_declaration
2492 /* Utility Routines */
2494 static cp_expr cp_parser_lookup_name
2496 static tree cp_parser_lookup_name_simple
2498 static tree cp_parser_maybe_treat_template_as_class
2500 static bool cp_parser_check_declarator_template_parameters
2502 static bool cp_parser_check_template_parameters
2504 static cp_expr cp_parser_simple_cast_expression
2506 static tree cp_parser_global_scope_opt
2508 static bool cp_parser_constructor_declarator_p
2510 static tree cp_parser_function_definition_from_specifiers_and_declarator
2512 static tree cp_parser_function_definition_after_declarator
2514 static bool cp_parser_template_declaration_after_export
2516 static void cp_parser_perform_template_parameter_access_checks
2518 static tree cp_parser_single_declaration
2520 static cp_expr cp_parser_functional_cast
2522 static tree cp_parser_save_member_function_body
2524 static tree cp_parser_save_nsdmi
2526 static tree cp_parser_enclosed_template_argument_list
2528 static void cp_parser_save_default_args
2530 static void cp_parser_late_parsing_for_member
2532 static tree cp_parser_late_parse_one_default_arg
2534 static void cp_parser_late_parsing_nsdmi
2536 static void cp_parser_late_parsing_default_args
2538 static tree cp_parser_sizeof_operand
2540 static tree cp_parser_trait_expr
2542 static bool cp_parser_declares_only_class_p
2544 static void cp_parser_set_storage_class
2546 static void cp_parser_set_decl_spec_type
2548 static void set_and_check_decl_spec_loc
2551 static bool cp_parser_friend_p
2553 static void cp_parser_required_error
2559 static bool cp_parser_token_starts_function_definition_p
2561 static bool cp_parser_next_token_starts_class_definition_p
2563 static bool cp_parser_next_token_ends_template_argument_p
2565 static bool cp_parser_nth_token_starts_template_argument_list_p
2567 static enum tag_types cp_parser_token_is_class_key
2569 static enum tag_types cp_parser_token_is_type_parameter_key
2571 static void cp_parser_check_class_key
2573 static void cp_parser_check_access_in_redeclaration
2575 static bool cp_parser_optional_template_keyword
2577 static void cp_parser_pre_parsed_nested_name_specifier
2579 static bool cp_parser_cache_group
2581 static tree cp_parser_cache_defarg
2583 static void cp_parser_parse_tentatively
2585 static void cp_parser_commit_to_tentative_parse
2587 static void cp_parser_commit_to_topmost_tentative_parse
2589 static void cp_parser_abort_tentative_parse
2591 static bool cp_parser_parse_definitely
2595 static bool cp_parser_uncommitted_to_tentative_parse_p
2597 static void cp_parser_error
2599 static void cp_parser_name_lookup_error
2601 static bool cp_parser_simulate_error
2603 static bool cp_parser_check_type_definition
2605 static void cp_parser_check_for_definition_in_return_type
2607 static void cp_parser_check_for_invalid_template_id
2609 static bool cp_parser_non_integral_constant_expression
2611 static void cp_parser_diagnose_invalid_type_name
2613 static bool cp_parser_parse_and_diagnose_invalid_type_name
2615 static int cp_parser_skip_to_closing_parenthesis
2617 static void cp_parser_skip_to_end_of_statement
2619 static void cp_parser_consume_semicolon_at_end_of_statement
2621 static void cp_parser_skip_to_end_of_block_or_statement
2623 static bool cp_parser_skip_to_closing_brace
2625 static void cp_parser_skip_to_end_of_template_parameter_list
2627 static void cp_parser_skip_to_pragma_eol
2629 static bool cp_parser_error_occurred
2631 static bool cp_parser_allow_gnu_extensions_p
2633 static bool cp_parser_is_pure_string_literal
2635 static bool cp_parser_is_string_literal
2637 static bool cp_parser_is_keyword
2639 static tree cp_parser_make_typename_type
2643 static bool cp_parser_compound_literal_p
2645 static bool cp_parser_array_designator_p
2647 static bool cp_parser_init_statement_p
2649 static bool cp_parser_skip_to_closing_square_bracket
2652 /* Concept-related syntactic transformations */
2657 // -------------------------------------------------------------------------- //
2658 // Unevaluated Operand Guard
2659 //
2660 // Implementation of an RAII helper for unevaluated operand parsing.
2662 {
2665 }
2668 {
2671 }
2673 // -------------------------------------------------------------------------- //
2674 // Tentative Parsing
2676 /* Returns nonzero if we are parsing tentatively. */
2680 {
2682 }
2684 /* Returns nonzero if TOKEN is a string literal. */
2686 static bool
2688 {
2694 }
2696 /* Returns nonzero if TOKEN is a string literal
2697 of a user-defined string literal. */
2699 static bool
2701 {
2708 }
2710 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2712 static bool
2714 {
2716 }
2718 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2719 PRAGMA_NONE. */
2721 static enum pragma_kind
2723 {
2726 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2728 }
2730 /* Helper function for cp_parser_error.
2731 Having peeked a token of kind TOK1_KIND that might signify
2732 a conflict marker, peek successor tokens to determine
2733 if we actually do have a conflict marker.
2734 Specifically, we consider a run of 7 '<', '=' or '>' characters
2735 at the start of a line as a conflict marker.
2736 These come through the lexer as three pairs and a single,
2737 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2738 If it returns true, *OUT_LOC is written to with the location/range
2739 of the marker. */
2741 static bool
2744 {
2755 /* It must be at the start of the line. */
2760 /* We have a conflict marker. Construct a location of the form:
2761 <<<<<<<
2762 ^~~~~~~
2763 with start == caret, finishing at the end of the marker. */
2768 }
2770 /* If not parsing tentatively, issue a diagnostic of the form
2771 FILE:LINE: MESSAGE before TOKEN
2772 where TOKEN is the next token in the input stream. MESSAGE
2773 (specified by the caller) is usually of the form "expected
2774 OTHER-TOKEN". */
2776 static void
2778 {
2780 {
2782 /* This diagnostic makes more sense if it is tagged to the line
2783 of the token we just peeked at. */
2787 {
2792 }
2794 /* If this is actually a conflict marker, report it as such. */
2798 {
2799 location_t loc;
2801 {
2804 }
2805 }
2808 /* Because c_parser_error does not understand
2809 CPP_KEYWORD, keywords are treated like
2810 identifiers. */
2813 }
2814 }
2816 /* Issue an error about name-lookup failing. NAME is the
2817 IDENTIFIER_NODE DECL is the result of
2818 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2819 the thing that we hoped to find. */
2821 static void
2823 tree name,
2824 tree decl,
2825 name_lookup_error desired,
2826 location_t location)
2827 {
2828 /* If name lookup completely failed, tell the user that NAME was not
2829 declared. */
2831 {
2844 else
2846 }
2848 {
2850 {
2867 }
2868 }
2870 {
2872 {
2882 name);
2886 }
2887 }
2888 else
2889 {
2891 {
2904 }
2905 }
2906 }
2908 /* If we are parsing tentatively, remember that an error has occurred
2909 during this tentative parse. Returns true if the error was
2910 simulated; false if a message should be issued by the caller. */
2912 static bool
2914 {
2916 {
2919 }
2921 }
2923 /* This function is called when a type is defined. If type
2924 definitions are forbidden at this point, an error message is
2925 issued. */
2927 static bool
2929 {
2930 /* If types are forbidden here, issue a message. */
2932 {
2933 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2934 in the message need to be interpreted. */
2937 }
2939 }
2941 /* This function is called when the DECLARATOR is processed. The TYPE
2942 was a type defined in the decl-specifiers. If it is invalid to
2943 define a type in the decl-specifiers for DECLARATOR, an error is
2944 issued. TYPE_LOCATION is the location of TYPE and is used
2945 for error reporting. */
2947 static void
2950 {
2951 /* [dcl.fct] forbids type definitions in return types.
2952 Unfortunately, it's not easy to know whether or not we are
2953 processing a return type until after the fact. */
2961 {
2966 type);
2967 }
2968 }
2970 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2971 "<" in any valid C++ program. If the next token is indeed "<",
2972 issue a message warning the user about what appears to be an
2973 invalid attempt to form a template-id. LOCATION is the location
2974 of the type-specifier (TYPE) */
2976 static void
2978 tree type,
2980 location_t location)
2981 {
2985 {
2991 {
2994 else
2996 }
2997 else
2999 /* Remember the location of the invalid "<". */
3002 /* Consume the "<". */
3004 /* Parse the template arguments. */
3006 /* Permanently remove the invalid template arguments so that
3007 this error message is not issued again. */
3010 }
3011 }
3013 /* If parsing an integral constant-expression, issue an error message
3014 about the fact that THING appeared and return true. Otherwise,
3015 return false. In either case, set
3016 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3018 static bool
3020 non_integral_constant thing)
3021 {
3024 {
3026 {
3029 {
3032 "ISO C++ forbids using a floating-point literal "
3037 "enumeration type cannot appear in a "
3128 }
3132 }
3133 }
3135 }
3137 /* Emit a diagnostic for an invalid type name. This function commits
3138 to the current active tentative parse, if any. (Otherwise, the
3139 problematic construct might be encountered again later, resulting
3140 in duplicate error messages.) LOCATION is the location of ID. */
3142 static void
3144 location_t location)
3145 {
3148 /* Try to lookup the identifier. */
3155 /* If the lookup was ambiguous, an error will already have
3156 been issued. */
3158 /* If the lookup found a template-name, it means that the user forgot
3159 to specify an argument list. Emit a useful error message. */
3161 {
3164 decl);
3169 }
3173 /* Something like 'unsigned A a;' */
3176 {
3177 /* Issue an error message. */
3182 {
3188 }
3189 else
3191 /* If we're in a template class, it's possible that the user was
3192 referring to a type from a base class. For example:
3194 template <typename T> struct A { typedef T X; };
3195 template <typename T> struct B : public A<T> { X x; };
3197 The user should have said "typename A<T>::X". */
3213 {
3214 tree b;
3217 b;
3219 {
3223 {
3224 tree field;
3225 /* Go from a particular instantiation of the
3226 template (which will have an empty TYPE_FIELDs),
3227 to the main version. */
3230 field;
3234 {
3239 }
3242 }
3243 }
3244 }
3245 }
3246 /* Here we diagnose qualified-ids where the scope is actually correct,
3247 but the identifier does not resolve to a valid type name. */
3249 {
3251 {
3256 else
3262 }
3265 {
3266 /* A<T>::A<T>() */
3272 }
3275 {
3278 "need %<typename%> before %<%T::%D::%E%> because "
3282 id,
3285 else
3289 }
3291 {
3299 else
3305 }
3306 else
3308 }
3309 }
3311 /* Check for a common situation where a type-name should be present,
3312 but is not, and issue a sensible error message. Returns true if an
3313 invalid type-name was detected.
3315 The situation handled by this function are variable declarations of the
3316 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3317 Usually, `ID' should name a type, but if we got here it means that it
3318 does not. We try to emit the best possible error message depending on
3319 how exactly the id-expression looks like. */
3321 static bool
3323 {
3324 tree id;
3327 /* Avoid duplicate error about ambiguous lookup. */
3329 {
3333 }
3342 /* If the next token is a (, this is a function with no explicit return
3343 type, i.e. constructor, destructor or conversion op. */
3346 {
3349 }
3353 /* Emit a diagnostic for the invalid type. */
3355 out:
3356 /* If we aren't in the middle of a declarator (i.e. in a
3357 parameter-declaration-clause), skip to the end of the declaration;
3358 there's no point in trying to process it. */
3362 }
3364 /* Consume tokens up to, and including, the next non-nested closing `)'.
3365 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3366 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3367 found an unnested token of that type. */
3369 static int
3372 cpp_ttype or_ttype,
3374 {
3384 {
3387 /* Have we found what we're looking for before the closing paren? */
3393 {
3396 /* If we've run out of tokens, then there is no closing `)'. */
3399 /* This is good for lambda expression capture-lists. */
3409 /* This matches the processing in skip_to_end_of_statement. */
3429 {
3433 }
3438 }
3440 /* Consume the token. */
3442 }
3443 }
3445 /* Consume tokens up to, and including, the next non-nested closing `)'.
3446 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3447 are doing error recovery. Returns -1 if OR_COMMA is true and we
3448 found an unnested token of that type. */
3450 static int
3455 {
3459 }
3461 /* Consume tokens until we reach the end of the current statement.
3462 Normally, that will be just before consuming a `;'. However, if a
3463 non-nested `}' comes first, then we stop before consuming that. */
3465 static void
3467 {
3470 /* Unwind generic function template scope if necessary. */
3475 {
3479 {
3482 /* If we've run out of tokens, stop. */
3486 /* If the next token is a `;', we have reached the end of the
3487 statement. */
3493 /* If this is a non-nested '}', stop before consuming it.
3494 That way, when confronted with something like:
3496 { 3 + }
3498 we stop before consuming the closing '}', even though we
3499 have not yet reached a `;'. */
3503 /* If it is the closing '}' for a block that we have
3504 scanned, stop -- but only after consuming the token.
3505 That way given:
3507 void f g () { ... }
3508 typedef int I;
3510 we will stop after the body of the erroneously declared
3511 function, but before consuming the following `typedef'
3512 declaration. */
3514 {
3517 }
3526 }
3528 /* Consume the token. */
3530 }
3531 }
3533 /* This function is called at the end of a statement or declaration.
3534 If the next token is a semicolon, it is consumed; otherwise, error
3535 recovery is attempted. */
3537 static void
3539 {
3540 /* Look for the trailing `;'. */
3542 {
3543 /* If there is additional (erroneous) input, skip to the end of
3544 the statement. */
3546 /* If the next token is now a `;', consume it. */
3549 }
3550 }
3552 /* Skip tokens until we have consumed an entire block, or until we
3553 have consumed a non-nested `;'. */
3555 static void
3557 {
3560 /* Unwind generic function template scope if necessary. */
3565 {
3569 {
3572 /* If we've run out of tokens, stop. */
3576 /* Stop if this is an unnested ';'. */
3582 /* Stop if this is an unnested '}', or closes the outermost
3583 nesting level. */
3584 nesting_depth--;
3592 /* Nest. */
3593 nesting_depth++;
3598 }
3600 /* Consume the token. */
3602 }
3603 }
3605 /* Skip tokens until a non-nested closing curly brace is the next
3606 token, or there are no more tokens. Return true in the first case,
3607 false otherwise. */
3609 static bool
3611 {
3615 {
3619 {
3622 /* If we've run out of tokens, stop. */
3626 /* If the next token is a non-nested `}', then we have reached
3627 the end of the current block. */
3633 /* If it the next token is a `{', then we are entering a new
3634 block. Consume the entire block. */
3640 }
3642 /* Consume the token. */
3644 }
3645 }
3647 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3648 parameter is the PRAGMA token, allowing us to purge the entire pragma
3649 sequence. */
3651 static void
3653 {
3658 do
3662 /* Ensure that the pragma is not parsed again. */
3664 }
3666 /* Require pragma end of line, resyncing with it as necessary. The
3667 arguments are as for cp_parser_skip_to_pragma_eol. */
3669 static void
3671 {
3675 }
3677 /* This is a simple wrapper around make_typename_type. When the id is
3678 an unresolved identifier node, we can provide a superior diagnostic
3679 using cp_parser_diagnose_invalid_type_name. */
3681 static tree
3683 location_t id_location)
3684 {
3685 tree result;
3687 {
3693 }
3695 }
3697 /* This is a wrapper around the
3698 make_{pointer,ptrmem,reference}_declarator functions that decides
3699 which one to call based on the CODE and CLASS_TYPE arguments. The
3700 CODE argument should be one of the values returned by
3701 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3702 appertain to the pointer or reference. */
3706 cp_cv_quals cv_qualifiers,
3708 tree attributes)
3709 {
3716 else
3726 }
3728 /* Create a new C++ parser. */
3732 {
3737 /* cp_lexer_new_main is called before doing GC allocation because
3738 cp_lexer_new_main might load a PCH file. */
3741 /* Initialize the binops_by_token so that we can get the tree
3742 directly from the token. */
3750 /* For now, we always accept GNU extensions. */
3753 /* The `>' token is a greater-than operator, not the end of a
3754 template-id. */
3759 /* We are not parsing a constant-expression. */
3764 /* Local variable names are not forbidden. */
3767 /* We are not processing an `extern "C"' declaration. */
3770 /* We are not processing a declarator. */
3773 /* We are not processing a template-argument-list. */
3776 /* We are not in an iteration statement. */
3779 /* We are not in a switch statement. */
3782 /* We are not parsing a type-id inside an expression. */
3785 /* Declarations aren't implicitly extern "C". */
3788 /* String literals should be translated to the execution character set. */
3791 /* We are not parsing a function body. */
3794 /* We can correct until told otherwise. */
3797 /* The unparsed function queue is empty. */
3800 /* There are no classes being defined. */
3803 /* No template parameters apply. */
3806 /* Special parsing data structures. */
3811 /* Not declaring an implicit function template. */
3817 /* Allow constrained-type-specifiers. */
3821 }
3823 /* Create a cp_lexer structure which will emit the tokens in CACHE
3824 and push it onto the parser's lexer stack. This is used for delayed
3825 parsing of in-class method bodies and default arguments, and should
3826 not be confused with tentative parsing. */
3827 static void
3829 {
3834 /* Move the current source position to that of the first token in the
3835 new lexer. */
3837 }
3839 /* Pop the top lexer off the parser stack. This is never used for the
3840 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3841 static void
3843 {
3848 /* Put the current source position back where it was before this
3849 lexer was pushed. */
3851 }
3853 /* Lexical conventions [gram.lex] */
3855 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3856 identifier. */
3858 static cp_expr
3860 {
3863 /* Look for the identifier. */
3865 /* Return the value. */
3868 else
3870 }
3872 /* Parse a sequence of adjacent string constants. Returns a
3873 TREE_STRING representing the combined, nul-terminated string
3874 constant. If TRANSLATE is true, translate the string to the
3875 execution character set. If WIDE_OK is true, a wide string is
3876 invalid here.
3878 C++98 [lex.string] says that if a narrow string literal token is
3879 adjacent to a wide string literal token, the behavior is undefined.
3880 However, C99 6.4.5p4 says that this results in a wide string literal.
3881 We follow C99 here, for consistency with the C front end.
3883 This code is largely lifted from lex_string() in c-lex.c.
3885 FUTURE: ObjC++ will need to handle @-strings here. */
3886 static cp_expr
3889 {
3890 tree value;
3897 tree string_tree;
3903 {
3906 }
3911 {
3915 }
3916 else
3917 {
3920 }
3923 /* Try to avoid the overhead of creating and destroying an obstack
3924 for the common case of just one string. */
3927 {
3935 {
3939 }
3940 else
3944 }
3945 else
3946 {
3951 do
3952 {
3954 count++;
3959 {
3962 {
3965 }
3968 {
3973 }
3975 }
3976 else
3980 {
3984 {
3988 "unsupported non-standard concatenation "
3990 }
3991 }
3999 {
4003 }
4004 else
4005 {
4009 }
4010 }
4013 /* A string literal built by concatenation has its caret=start at
4014 the start of the initial string, and its finish at the finish of
4015 the final string literal. */
4019 }
4022 {
4025 }
4029 {
4034 {
4049 }
4054 {
4059 else
4061 }
4062 }
4063 else
4064 /* cpp_interpret_string has issued an error. */
4071 }
4073 /* Look up a literal operator with the name and the exact arguments. */
4075 static tree
4077 {
4078 tree decl;
4084 {
4090 {
4093 {
4103 }
4106 /* May be this should be sufficient_parms_p instead,
4107 depending on how exactly should user-defined literals
4108 work in presence of default arguments on the literal
4109 operator parameters. */
4112 }
4113 }
4116 }
4118 /* Parse a user-defined char constant. Returns a call to a user-defined
4119 literal operator taking the character as an argument. */
4121 static cp_expr
4123 {
4131 /* Build up a call to the user-defined operator */
4132 /* Lookup the name we got back from the id-expression. */
4137 {
4142 }
4146 }
4148 /* A subroutine of cp_parser_userdef_numeric_literal to
4149 create a char... template parameter pack from a string node. */
4151 static tree
4153 {
4154 tree charvec;
4160 /* Fill in CHARVEC with all of the parameters. */
4165 /* Build the argument packs. */
4171 }
4173 /* A subroutine of cp_parser_userdef_numeric_literal to
4174 create a char... template parameter pack from a string node. */
4176 static tree
4178 {
4179 tree charvec;
4190 /* First template parm is character type. */
4193 /* Fill in CHARVEC with all of the parameters. */
4200 /* Build the argument packs. */
4206 }
4208 /* Parse a user-defined numeric constant. returns a call to a user-defined
4209 literal operator. */
4211 static cp_expr
4213 {
4224 /* Look for a literal operator taking the exact type of numeric argument
4225 as the literal value. */
4230 {
4232 tf_warning_or_error);
4235 {
4238 long_long_unsigned_type_node);
4239 }
4240 else
4241 {
4245 long_double_type_node);
4249 }
4253 }
4256 /* If the numeric argument didn't work, look for a raw literal
4257 operator taking a const char* argument consisting of the number
4258 in string format. */
4263 {
4265 tf_warning_or_error);
4268 }
4271 /* If the raw literal didn't work, look for a non-type template
4272 function with parameter pack char.... Call the function with
4273 template parameter characters representing the number. */
4277 {
4281 tf_warning_or_error);
4284 }
4293 }
4295 /* Parse a user-defined string constant. Returns a call to a user-defined
4296 literal operator taking a character pointer and the length of the string
4297 as arguments. */
4299 static tree
4301 {
4310 /* Build up a call to the user-defined operator. */
4311 /* Lookup the name we got back from the id-expression. */
4318 {
4320 tf_warning_or_error);
4323 }
4326 /* Look for a template function with typename parameter CharT
4327 and parameter pack CharT... Call the function with
4328 template parameter characters representing the string. */
4332 {
4336 tf_warning_or_error);
4339 }
4345 }
4348 /* Basic concepts [gram.basic] */
4350 /* Parse a translation-unit.
4352 translation-unit:
4353 declaration-seq [opt]
4355 Returns TRUE if all went well. */
4357 static bool
4359 {
4360 /* The address of the first non-permanent object on the declarator
4361 obstack. */
4366 /* Create the declarator obstack, if necessary. */
4368 {
4370 /* Create the error declarator. */
4372 /* Create the empty parameter list. */
4374 /* Remember where the base of the declarator obstack lies. */
4376 }
4380 /* If there are no tokens left then all went well. */
4382 {
4383 /* Get rid of the token array; we don't need it any more. */
4387 /* This file might have been a context that's implicitly extern
4388 "C". If so, pop the lang context. (Only relevant for PCH.) */
4390 {
4393 }
4395 /* Finish up. */
4399 }
4400 else
4401 {
4404 }
4406 /* Make sure the declarator obstack was fully cleaned up. */
4410 /* All went well. */
4412 }
4414 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4415 decltype context. */
4419 {
4424 }
4426 /* We're about to parse a collection of statements. If we're currently
4427 parsing tentatively, set up a firewall so that any nested
4428 cp_parser_commit_to_tentative_parse won't affect the current context. */
4430 static cp_token_position
4432 {
4439 }
4441 /* We've finished parsing the collection of statements. Wrap up the
4442 firewall and replace the relevant tokens with the parsed form. */
4444 static void
4446 tree expr)
4447 {
4451 /* Finish the firewall level. */
4453 /* And remember the result of the parse for when we try again. */
4459 }
4461 /* Like the above functions, but let the user modify the tokens. Used by
4462 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4463 later parses, so it makes sense to localize the effects of
4464 cp_parser_commit_to_tentative_parse. */
4466 struct tentative_firewall
4467 {
4472 {
4473 /* If we're currently parsing tentatively, start a committed level as a
4474 firewall and then an inner tentative parse. */
4476 {
4480 }
4481 }
4484 {
4486 {
4487 /* Finish the inner tentative parse and the firewall, propagating any
4488 uncommitted error state to the outer tentative parse. */
4494 }
4495 }
4496 };
4498 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4499 enclosing parentheses. */
4501 static cp_expr
4503 {
4506 /* Consume the '('. */
4509 /* Start the statement-expression. */
4511 /* Parse the compound-statement. */
4513 /* Finish up. */
4515 /* Consume the ')'. */
4523 }
4525 /* Expressions [gram.expr] */
4527 /* Parse a fold-operator.
4529 fold-operator:
4530 - * / % ^ & | = < > << >>
4531 = -= *= /= %= ^= &= |= <<= >>=
4532 == != <= >= && || , .* ->*
4534 This returns the tree code corresponding to the matched operator
4535 as an int. When the current token matches a compound assignment
4536 opertor, the resulting tree code is the negative value of the
4537 non-assignment operator. */
4539 static int
4541 {
4543 {
4583 }
4584 }
4586 /* Returns true if CODE indicates a binary expression, which is not allowed in
4587 the LHS of a fold-expression. More codes will need to be added to use this
4588 function in other contexts. */
4590 static bool
4592 {
4594 {
4627 }
4628 }
4630 /* If the next token is a suitable fold operator, consume it and return as
4631 the function above. */
4633 static int
4635 {
4641 }
4643 /* Parse a fold-expression.
4645 fold-expression:
4646 ( ... folding-operator cast-expression)
4647 ( cast-expression folding-operator ... )
4648 ( cast-expression folding operator ... folding-operator cast-expression)
4650 Note that the '(' and ')' are matched in primary expression. */
4652 static cp_expr
4654 {
4655 cp_id_kind pidk;
4657 // Left fold.
4659 {
4663 {
4666 }
4673 }
4678 {
4681 }
4684 {
4687 }
4690 /* The operands of a fold-expression are cast-expressions, so binary or
4691 conditional expressions are not allowed. We check this here to avoid
4692 tentative parsing. */
4702 // Right fold.
4707 {
4710 }
4713 // Binary left or right fold.
4718 }
4720 /* Parse a primary-expression.
4722 primary-expression:
4723 literal
4724 this
4725 ( expression )
4726 id-expression
4727 lambda-expression (C++11)
4729 GNU Extensions:
4731 primary-expression:
4732 ( compound-statement )
4733 __builtin_va_arg ( assignment-expression , type-id )
4734 __builtin_offsetof ( type-id , offsetof-expression )
4736 C++ Extensions:
4737 __has_nothrow_assign ( type-id )
4738 __has_nothrow_constructor ( type-id )
4739 __has_nothrow_copy ( type-id )
4740 __has_trivial_assign ( type-id )
4741 __has_trivial_constructor ( type-id )
4742 __has_trivial_copy ( type-id )
4743 __has_trivial_destructor ( type-id )
4744 __has_virtual_destructor ( type-id )
4745 __is_abstract ( type-id )
4746 __is_base_of ( type-id , type-id )
4747 __is_class ( type-id )
4748 __is_empty ( type-id )
4749 __is_enum ( type-id )
4750 __is_final ( type-id )
4751 __is_literal_type ( type-id )
4752 __is_pod ( type-id )
4753 __is_polymorphic ( type-id )
4754 __is_std_layout ( type-id )
4755 __is_trivial ( type-id )
4756 __is_union ( type-id )
4758 Objective-C++ Extension:
4760 primary-expression:
4761 objc-expression
4763 literal:
4764 __null
4766 ADDRESS_P is true iff this expression was immediately preceded by
4767 "&" and therefore might denote a pointer-to-member. CAST_P is true
4768 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4769 true iff this expression is a template argument.
4771 Returns a representation of the expression. Upon return, *IDK
4772 indicates what kind of id-expression (if any) was present. */
4774 static cp_expr
4781 {
4784 /* Assume the primary expression is not an id-expression. */
4787 /* Peek at the next token. */
4790 {
4791 /* literal:
4792 integer-literal
4793 character-literal
4794 floating-literal
4795 string-literal
4796 boolean-literal
4797 pointer-literal
4798 user-defined-literal */
4810 {
4814 }
4815 /* Floating-point literals are only allowed in an integral
4816 constant expression if they are cast to an integral or
4817 enumeration type. */
4821 {
4822 /* CAST_P will be set even in invalid code like "int(2.7 +
4823 ...)". Therefore, we have to check that the next token
4824 is sure to end the cast. */
4826 {
4831 enumerator-definition. */
4833 /* The curly brace at the end of an enum-specifier. */
4835 /* The end of a statement. */
4837 /* The end of the cast-expression. */
4839 /* The end of an array bound. */
4841 /* The closing ">" in a template-argument-list. */
4844 /* C++0x only: A ">>" treated like two ">" tokens,
4845 in a template-argument-list. */
4850 }
4852 /* If we are within a cast, then the constraint that the
4853 cast is to an integral or enumeration type will be
4854 checked at that point. If we are not within a cast, then
4855 this code is invalid. */
4858 }
4878 /* ??? Should wide strings be allowed when parser->translate_strings_p
4879 is false (i.e. in attributes)? If not, we can kill the third
4880 argument to cp_parser_string_literal. */
4886 /* If we see `( { ' then we are looking at the beginning of
4887 a GNU statement-expression. */
4890 {
4891 /* Statement-expressions are not allowed by the standard. */
4895 /* And they're not allowed outside of a function-body; you
4896 cannot, for example, write:
4898 int i = ({ int j = 3; j + 1; });
4900 at class or namespace scope. */
4903 {
4905 "statement-expressions are not allowed outside "
4911 }
4912 else
4914 }
4915 /* Otherwise it's a normal parenthesized expression. */
4916 {
4917 cp_expr expr;
4922 /* Consume the `('. */
4924 /* Within a parenthesized expression, a `>' token is always
4925 the greater-than operator. */
4926 saved_greater_than_is_operator_p
4931 /* Left fold expression. */
4933 else
4934 /* Parse the parenthesized expression. */
4939 {
4946 }
4947 else
4948 /* Let the front end know that this expression was
4949 enclosed in parentheses. This matters in case, for
4950 example, the expression is of the form `A::B', since
4951 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4952 not. */
4955 /* DR 705: Wrapping an unqualified name in parentheses
4956 suppresses arg-dependent lookup. We want to pass back
4957 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4958 (c++/37862), but none of the others. */
4962 /* The `>' token might be the end of a template-id or
4963 template-parameter-list now. */
4964 parser->greater_than_is_operator_p
4967 /* Consume the `)'. */
4976 }
4979 {
4981 {
4982 /* We might have an Objective-C++ message. */
4985 /* If that works out, we're done ... */
4988 /* ... else, fall though to see if it's a lambda. */
4989 }
4991 /* Don't warn about a failed tentative parse. */
4996 }
5000 /* We have an Objective-C++ string literal. */
5007 {
5008 /* These two are the boolean literals. */
5016 /* The `__null' literal. */
5021 /* The `nullptr' literal. */
5026 /* Recognize the `this' keyword. */
5030 {
5034 }
5035 /* Pointers cannot appear in constant-expressions. */
5040 /* The `operator' keyword can be the beginning of an
5041 id-expression. */
5048 {
5049 non_integral_constant name;
5051 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5052 __func__ are the names of variables -- but they are
5053 treated specially. Therefore, they are handled here,
5054 rather than relying on the generic id-expression logic
5055 below. Grammatically, these names are id-expressions.
5057 Consume the token. */
5061 {
5073 }
5078 /* Look up the name. */
5080 }
5083 {
5084 tree expression;
5085 tree type;
5086 source_location type_location;
5087 location_t start_loc
5089 /* The `__builtin_va_arg' construct is used to handle
5090 `va_arg'. Consume the `__builtin_va_arg' token. */
5092 /* Look for the opening `('. */
5094 /* Now, parse the assignment-expression. */
5096 /* Look for the `,'. */
5099 /* Parse the type-id. */
5100 {
5103 }
5104 /* Look for the closing `)'. */
5105 location_t finish_loc
5108 /* Using `va_arg' in a constant-expression is not
5109 allowed. */
5111 NIC_VA_ARG))
5113 /* Construct a location of the form:
5114 __builtin_va_arg (v, int)
5115 ~~~~~~~~~~~~~~~~~~~~~^~~~
5116 with the caret at the type, ranging from the start of the
5117 "__builtin_va_arg" token to the close paren. */
5118 location_t combined_loc
5121 }
5156 // C++ concepts
5160 /* Objective-C++ expressions. */
5170 {
5175 }
5176 /* FALLTHRU */
5180 }
5182 /* An id-expression can start with either an identifier, a
5183 `::' as the beginning of a qualified-id, or the "operator"
5184 keyword. */
5189 {
5190 id_expression:
5191 cp_expr id_expression;
5192 cp_expr decl;
5198 /* Parse the id-expression. */
5199 id_expression
5216 /* If we have a template-id, then no further lookup is
5217 required. If the template-id was for a template-class, we
5218 will sometimes have a TYPE_DECL at this point. */
5222 /* Look up the name. */
5223 else
5224 {
5225 tree ambiguous_decls;
5227 /* If we already know that this lookup is ambiguous, then
5228 we've already issued an error message; there's no reason
5229 to check again. */
5232 {
5235 }
5238 none_type,
5239 template_p,
5244 /* If the lookup was ambiguous, an error will already have
5245 been issued. */
5249 /* In Objective-C++, we may have an Objective-C 2.0
5250 dot-syntax for classes here. */
5255 {
5256 tree component;
5263 component);
5264 /* Build a location of the form:
5265 expr.component
5266 ~~~~~^~~~~~~~~
5267 with caret at the start of the component name (at
5268 input_location), ranging from the start of the id_expression
5269 to the end of the component name. */
5270 location_t combined_loc
5275 }
5277 /* In Objective-C++, an instance variable (ivar) may be preferred
5278 to whatever cp_parser_lookup_name() found.
5279 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5280 rest of c-family, we have to do a little extra work to preserve
5281 any location information in cp_expr "decl". Given that
5282 objc_lookup_ivar is implemented in "c-family" and "objc", we
5283 have a trip through the pure "tree" type, rather than cp_expr.
5284 Naively copying it back to "decl" would implicitly give the
5285 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5286 store an EXPR_LOCATION. Hence we only update "decl" (and
5287 hence its location_t) if we get back a different tree node. */
5289 id_expression);
5293 /* If name lookup gives us a SCOPE_REF, then the
5294 qualifying scope was dependent. */
5296 {
5297 /* At this point, we do not know if DECL is a valid
5298 integral constant expression. We assume that it is
5299 in fact such an expression, so that code like:
5301 template <int N> struct A {
5302 int a[B<N>::i];
5303 };
5305 is accepted. At template-instantiation time, we
5306 will check that B<N>::i is actually a constant. */
5308 }
5309 /* Check to see if DECL is a local variable in a context
5310 where that is forbidden. */
5313 {
5314 /* It might be that we only found DECL because we are
5315 trying to be generous with pre-ISO scoping rules.
5316 For example, consider:
5318 int i;
5319 void g() {
5320 for (int i = 0; i < 10; ++i) {}
5321 extern void f(int j = i);
5322 }
5324 Here, name look up will originally find the out
5325 of scope `i'. We need to issue a warning message,
5326 but then use the global `i'. */
5329 {
5334 }
5335 }
5336 }
5338 decl = (finish_id_expression
5340 idk,
5345 template_arg_p,
5352 }
5354 /* Anything else is an error. */
5358 }
5359 }
5367 {
5370 }
5372 /* Parse an id-expression.
5374 id-expression:
5375 unqualified-id
5376 qualified-id
5378 qualified-id:
5379 :: [opt] nested-name-specifier template [opt] unqualified-id
5380 :: identifier
5381 :: operator-function-id
5382 :: template-id
5384 Return a representation of the unqualified portion of the
5385 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5386 a `::' or nested-name-specifier.
5388 Often, if the id-expression was a qualified-id, the caller will
5389 want to make a SCOPE_REF to represent the qualified-id. This
5390 function does not do this in order to avoid wastefully creating
5391 SCOPE_REFs when they are not required.
5393 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5394 `template' keyword.
5396 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5397 uninstantiated templates.
5399 If *TEMPLATE_P is non-NULL, it is set to true iff the
5400 `template' keyword is used to explicitly indicate that the entity
5401 named is a template.
5403 If DECLARATOR_P is true, the id-expression is appearing as part of
5404 a declarator, rather than as part of an expression. */
5406 static cp_expr
5413 {
5417 /* Assume the `template' keyword was not used. */
5421 /* Look for the optional `::' operator. */
5422 global_scope_p
5425 /* Look for the optional nested-name-specifier. */
5426 nested_name_specifier_p
5429 check_dependency_p,
5431 declarator_p)
5433 /* If there is a nested-name-specifier, then we are looking at
5434 the first qualified-id production. */
5436 {
5437 tree saved_scope;
5438 tree saved_object_scope;
5439 tree saved_qualifying_scope;
5440 cp_expr unqualified_id;
5443 /* See if the next token is the `template' keyword. */
5447 /* Name lookup we do during the processing of the
5448 unqualified-id might obliterate SCOPE. */
5452 /* Process the final unqualified-id. */
5454 check_dependency_p,
5455 declarator_p,
5457 /* Restore the SAVED_SCOPE for our caller. */
5463 }
5464 /* Otherwise, if we are in global scope, then we are looking at one
5465 of the other qualified-id productions. */
5467 {
5469 tree id;
5471 /* Peek at the next token. */
5474 /* If it's an identifier, and the next token is not a "<", then
5475 we can avoid the template-id case. This is an optimization
5476 for this common case. */
5478 && !cp_parser_nth_token_starts_template_argument_list_p
5483 /* Try a template-id. */
5487 none_type,
5488 declarator_p);
5489 /* If that worked, we're done. */
5493 /* Peek at the next token. (Changes in the token buffer may
5494 have invalidated the pointer obtained above.) */
5498 {
5505 /* Fall through. */
5510 }
5511 }
5512 else
5515 declarator_p,
5516 optional_p);
5517 }
5519 /* Parse an unqualified-id.
5521 unqualified-id:
5522 identifier
5523 operator-function-id
5524 conversion-function-id
5525 ~ class-name
5526 template-id
5528 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5529 keyword, in a construct like `A::template ...'.
5531 Returns a representation of unqualified-id. For the `identifier'
5532 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5533 production a BIT_NOT_EXPR is returned; the operand of the
5534 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5535 other productions, see the documentation accompanying the
5536 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5537 names are looked up in uninstantiated templates. If DECLARATOR_P
5538 is true, the unqualified-id is appearing as part of a declarator,
5539 rather than as part of an expression. */
5541 static cp_expr
5547 {
5550 /* Peek at the next token. */
5554 {
5556 {
5557 tree id;
5559 /* We don't know yet whether or not this will be a
5560 template-id. */
5562 /* Try a template-id. */
5564 check_dependency_p,
5565 none_type,
5566 declarator_p);
5567 /* If it worked, we're done. */
5570 /* Otherwise, it's an ordinary identifier. */
5572 }
5576 check_dependency_p,
5577 none_type,
5578 declarator_p);
5581 {
5582 tree type_decl;
5583 tree qualifying_scope;
5584 tree object_scope;
5585 tree scope;
5588 /* Consume the `~' token. */
5590 /* Parse the class-name. The standard, as written, seems to
5591 say that:
5593 template <typename T> struct S { ~S (); };
5594 template <typename T> S<T>::~S() {}
5596 is invalid, since `~' must be followed by a class-name, but
5597 `S<T>' is dependent, and so not known to be a class.
5598 That's not right; we need to look in uninstantiated
5599 templates. A further complication arises from:
5601 template <typename T> void f(T t) {
5602 t.T::~T();
5603 }
5605 Here, it is not possible to look up `T' in the scope of `T'
5606 itself. We must look in both the current scope, and the
5607 scope of the containing complete expression.
5609 Yet another issue is:
5611 struct S {
5612 int S;
5613 ~S();
5614 };
5616 S::~S() {}
5618 The standard does not seem to say that the `S' in `~S'
5619 should refer to the type `S' and not the data member
5620 `S::S'. */
5622 /* DR 244 says that we look up the name after the "~" in the
5623 same scope as we looked up the qualifying name. That idea
5624 isn't fully worked out; it's more complicated than that. */
5629 /* Check for invalid scopes. */
5631 {
5635 }
5637 {
5641 scope);
5646 }
5649 /* If the name is of the form "X::~X" it's OK even if X is a
5650 typedef. */
5659 {
5662 }
5664 /* ~auto means the destructor of whatever the object is. */
5666 {
5669 "%<~auto%> only available with "
5673 }
5675 /* If there was an explicit qualification (S::~T), first look
5676 in the scope given by the qualification (i.e., S).
5678 Note: in the calls to cp_parser_class_name below we pass
5679 typename_type so that lookup finds the injected-class-name
5680 rather than the constructor. */
5684 {
5689 typename_type,
5692 declarator_p);
5695 }
5696 /* In "N::S::~S", look in "N" as well. */
5698 {
5703 type_decl
5707 typename_type,
5710 declarator_p);
5713 }
5714 /* In "p->S::~T", look in the scope given by "*p" as well. */
5716 {
5721 type_decl
5725 typename_type,
5728 declarator_p);
5731 }
5732 /* Look in the surrounding context. */
5734 {
5740 type_decl
5744 typename_type,
5747 declarator_p);
5750 {
5751 /* We couldn't find a type with this name. If we're parsing
5752 tentatively, fail and try something else. */
5754 {
5757 }
5758 /* Otherwise, accept it and check for a match at instantiation
5759 time. */
5764 }
5765 }
5766 /* If an error occurred, assume that the name of the
5767 destructor is the same as the name of the qualifying
5768 class. That allows us to keep parsing after running
5769 into ill-formed destructor names. */
5775 /* Check that destructor name and scope match. */
5777 {
5784 }
5786 /* [class.dtor]
5788 A typedef-name that names a class shall not be used as the
5789 identifier in the declarator for a destructor declaration. */
5796 type_decl);
5799 }
5803 {
5804 cp_expr id;
5806 /* This could be a template-id, so we try that first. */
5808 /* Try a template-id. */
5811 none_type,
5812 declarator_p);
5813 /* If that worked, we're done. */
5816 /* We still don't know whether we're looking at an
5817 operator-function-id or a conversion-function-id. */
5819 /* Try an operator-function-id. */
5821 /* If that didn't work, try a conversion-function-id. */
5825 {
5826 /* 17.6.3.3.5 */
5831 "literal operator suffixes not preceded by %<_%>"
5833 }
5836 }
5837 /* Fall through. */
5844 }
5845 }
5847 /* Parse an (optional) nested-name-specifier.
5849 nested-name-specifier: [C++98]
5850 class-or-namespace-name :: nested-name-specifier [opt]
5851 class-or-namespace-name :: template nested-name-specifier [opt]
5853 nested-name-specifier: [C++0x]
5854 type-name ::
5855 namespace-name ::
5856 nested-name-specifier identifier ::
5857 nested-name-specifier template [opt] simple-template-id ::
5859 PARSER->SCOPE should be set appropriately before this function is
5860 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5861 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5862 in name lookups.
5864 Sets PARSER->SCOPE to the class (TYPE) or namespace
5865 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5866 it unchanged if there is no nested-name-specifier. Returns the new
5867 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5869 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5870 part of a declaration and/or decl-specifier. */
5872 static tree
5878 {
5883 /* Remember where the nested-name-specifier starts. */
5885 {
5888 }
5891 {
5892 tree new_scope;
5893 tree old_scope;
5894 tree saved_qualifying_scope;
5897 /* Spot cases that cannot be the beginning of a
5898 nested-name-specifier. */
5901 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5902 the already parsed nested-name-specifier. */
5904 {
5905 /* Grab the nested-name-specifier and continue the loop. */
5907 /* If we originally encountered this nested-name-specifier
5908 with IS_DECLARATION set to false, we will not have
5909 resolved TYPENAME_TYPEs, so we must do so here. */
5912 {
5917 }
5920 }
5922 /* Spot cases that cannot be the beginning of a
5923 nested-name-specifier. On the second and subsequent times
5924 through the loop, we look for the `template' keyword. */
5926 ;
5927 /* A template-id can start a nested-name-specifier. */
5929 ;
5930 /* DR 743: decltype can be used in a nested-name-specifier. */
5932 ;
5933 else
5934 {
5935 /* If the next token is not an identifier, then it is
5936 definitely not a type-name or namespace-name. */
5939 /* If the following token is neither a `<' (to begin a
5940 template-id), nor a `::', then we are not looking at a
5941 nested-name-specifier. */
5947 {
5951 "found %<:%> in nested-name-specifier, "
5954 }
5957 && !cp_parser_nth_token_starts_template_argument_list_p
5960 }
5962 /* The nested-name-specifier is optional, so we parse
5963 tentatively. */
5966 /* Look for the optional `template' keyword, if this isn't the
5967 first time through the loop. */
5970 else
5973 /* Save the old scope since the name lookup we are about to do
5974 might destroy it. */
5977 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5978 look up names in "X<T>::I" in order to determine that "Y" is
5979 a template. So, if we have a typename at this point, we make
5980 an effort to look through it. */
5982 && !typename_keyword_p
5987 /* Parse the qualifying entity. */
5988 new_scope
5990 typename_keyword_p,
5991 template_keyword_p,
5992 check_dependency_p,
5993 type_p,
5994 is_declaration);
5995 /* Look for the `::' token. */
5998 /* If we found what we wanted, we keep going; otherwise, we're
5999 done. */
6001 {
6004 /* Restore the OLD_SCOPE since it was valid before the
6005 failed attempt at finding the last
6006 class-or-namespace-name. */
6010 /* If the next token is a decltype, and the one after that is a
6011 `::', then the decltype has failed to resolve to a class or
6012 enumeration type. Give this error even when parsing
6013 tentatively since it can't possibly be valid--and we're going
6014 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6015 won't get another chance.*/
6019 {
6026 /* As below. */
6029 }
6033 {
6034 /* If we have a non-type template-id followed by ::, it can't
6035 possibly be valid. */
6040 {
6043 {
6049 }
6050 else
6051 {
6052 /* Variable template. */
6057 }
6064 /* As below. */
6068 }
6069 }
6073 /* If the next token is an identifier, and the one after
6074 that is a `::', then any valid interpretation would have
6075 found a class-or-namespace-name. */
6081 {
6084 {
6086 {
6087 tree decl;
6088 tree ambiguous_decls;
6091 none_type,
6100 decl);
6102 {
6103 // cp_parser_lookup_name has the same diagnostic,
6104 // thus make sure to emit it at most once.
6107 {
6112 }
6114 }
6115 else
6116 {
6118 cp_parser_name_lookup_error
6121 else
6122 cp_parser_name_lookup_error
6125 }
6126 }
6129 /* Treat this as a successful nested-name-specifier
6130 due to:
6132 [basic.lookup.qual]
6134 If the name found is not a class-name (clause
6135 _class_) or namespace-name (_namespace.def_), the
6136 program is ill-formed. */
6138 }
6140 }
6142 }
6143 /* We've found one valid nested-name-specifier. */
6145 /* Name lookup always gives us a DECL. */
6148 /* Uses of "template" must be followed by actual templates. */
6160 new_scope);
6161 /* If it is a class scope, try to complete it; we are about to
6162 be looking up names inside the class. */
6164 /* Since checking types for dependency can be expensive,
6165 avoid doing it if the type is already complete. */
6167 /* Do not try to complete dependent types. */
6169 {
6171 /* If it is a typedef to current class, use the current
6172 class instead, as the typedef won't have any names inside
6173 it yet. */
6177 }
6178 /* Make sure we look in the right scope the next time through
6179 the loop. */
6181 }
6183 /* If parsing tentatively, replace the sequence of tokens that makes
6184 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6185 token. That way, should we re-parse the token stream, we will
6186 not have to repeat the effort required to do the parse, nor will
6187 we issue duplicate error messages. */
6189 {
6193 /* Reset the contents of the START token. */
6195 /* Retrieve any deferred checks. Do not pop this access checks yet
6196 so the memory will not be reclaimed during token replacing below. */
6204 /* Purge all subsequent tokens. */
6206 }
6212 }
6214 /* Parse a nested-name-specifier. See
6215 cp_parser_nested_name_specifier_opt for details. This function
6216 behaves identically, except that it will an issue an error if no
6217 nested-name-specifier is present. */
6219 static tree
6225 {
6226 tree scope;
6228 /* Look for the nested-name-specifier. */
6230 typename_keyword_p,
6231 check_dependency_p,
6232 type_p,
6233 is_declaration);
6234 /* If it was not present, issue an error message. */
6236 {
6239 }
6242 }
6244 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6245 this is either a class-name or a namespace-name (which corresponds
6246 to the class-or-namespace-name production in the grammar). For
6247 C++0x, it can also be a type-name that refers to an enumeration
6248 type or a simple-template-id.
6250 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6251 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6252 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6253 TYPE_P is TRUE iff the next name should be taken as a class-name,
6254 even the same name is declared to be another entity in the same
6255 scope.
6257 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6258 specified by the class-or-namespace-name. If neither is found the
6259 ERROR_MARK_NODE is returned. */
6261 static tree
6268 {
6269 tree saved_scope;
6270 tree saved_qualifying_scope;
6271 tree saved_object_scope;
6272 tree scope;
6276 /* DR 743: decltype can appear in a nested-name-specifier. */
6278 {
6282 {
6285 }
6289 }
6291 /* Before we try to parse the class-name, we must save away the
6292 current PARSER->SCOPE since cp_parser_class_name will destroy
6293 it. */
6297 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6298 there is no need to look for a namespace-name. */
6299 only_class_p = template_keyword_p
6304 typename_keyword_p,
6305 template_keyword_p,
6307 check_dependency_p,
6309 is_declaration,
6312 /* If that didn't work, try for a namespace-name. */
6314 {
6315 /* Restore the saved scope. */
6319 /* If we are not looking at an identifier followed by the scope
6320 resolution operator, then this is not part of a
6321 nested-name-specifier. (Note that this function is only used
6322 to parse the components of a nested-name-specifier.) */
6327 }
6330 }
6332 /* Return true if we are looking at a compound-literal, false otherwise. */
6334 static bool
6336 {
6337 /* Consume the `('. */
6342 /* Skip tokens until the next token is a closing parenthesis.
6343 If we find the closing `)', and the next token is a `{', then
6344 we are looking at a compound-literal. */
6345 bool compound_literal_p
6350 /* Roll back the tokens we skipped. */
6354 }
6356 /* Parse a postfix-expression.
6358 postfix-expression:
6359 primary-expression
6360 postfix-expression [ expression ]
6361 postfix-expression ( expression-list [opt] )
6362 simple-type-specifier ( expression-list [opt] )
6363 typename :: [opt] nested-name-specifier identifier
6364 ( expression-list [opt] )
6365 typename :: [opt] nested-name-specifier template [opt] template-id
6366 ( expression-list [opt] )
6367 postfix-expression . template [opt] id-expression
6368 postfix-expression -> template [opt] id-expression
6369 postfix-expression . pseudo-destructor-name
6370 postfix-expression -> pseudo-destructor-name
6371 postfix-expression ++
6372 postfix-expression --
6373 dynamic_cast < type-id > ( expression )
6374 static_cast < type-id > ( expression )
6375 reinterpret_cast < type-id > ( expression )
6376 const_cast < type-id > ( expression )
6377 typeid ( expression )
6378 typeid ( type-id )
6380 GNU Extension:
6382 postfix-expression:
6383 ( type-id ) { initializer-list , [opt] }
6385 This extension is a GNU version of the C99 compound-literal
6386 construct. (The C99 grammar uses `type-name' instead of `type-id',
6387 but they are essentially the same concept.)
6389 If ADDRESS_P is true, the postfix expression is the operand of the
6390 `&' operator. CAST_P is true if this expression is the target of a
6391 cast.
6393 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6394 class member access expressions [expr.ref].
6396 Returns a representation of the expression. */
6398 static cp_expr
6402 {
6404 location_t loc;
6411 /* Peek at the next token. */
6416 /* Some of the productions are determined by keywords. */
6419 {
6424 {
6425 tree type;
6426 cp_expr expression;
6430 /* All of these can be handled in the same way from the point
6431 of view of parsing. Begin by consuming the token
6432 identifying the cast. */
6435 /* New types cannot be defined in the cast. */
6437 parser->type_definition_forbidden_message
6440 /* Look for the opening `<'. */
6442 /* Parse the type to which we are casting. */
6447 /* Look for the closing `>'. */
6449 /* Restore the old message. */
6452 bool saved_greater_than_is_operator_p
6456 /* And the expression which is being cast. */
6460 RT_CLOSE_PAREN);
6464 parser->greater_than_is_operator_p
6467 /* Only type conversions to integral or enumeration types
6468 can be used in constant-expressions. */
6471 {
6474 }
6477 {
6479 postfix_expression
6483 postfix_expression
6487 postfix_expression
6489 tf_warning_or_error);
6492 postfix_expression
6497 }
6499 /* Construct a location e.g. :
6500 reinterpret_cast <int *> (expr)
6501 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6502 ranging from the start of the "*_cast" token to the final closing
6503 paren, with the caret at the start. */
6506 }
6510 {
6511 tree type;
6515 /* Consume the `typeid' token. */
6517 /* Look for the `(' token. */
6519 /* Types cannot be defined in a `typeid' expression. */
6521 parser->type_definition_forbidden_message
6523 /* We can't be sure yet whether we're looking at a type-id or an
6524 expression. */
6526 /* Try a type-id first. */
6531 /* Look for the `)' token. Otherwise, we can't be sure that
6532 we're not looking at an expression: consider `typeid (int
6533 (3))', for example. */
6535 /* If all went well, simply lookup the type-id. */
6538 /* Otherwise, fall back to the expression variant. */
6539 else
6540 {
6541 tree expression;
6543 /* Look for an expression. */
6545 /* Compute its typeid. */
6547 /* Look for the `)' token. */
6549 }
6550 /* Restore the saved message. */
6552 /* `typeid' may not appear in an integral constant expression. */
6555 }
6559 {
6560 tree type;
6561 /* The syntax permitted here is the same permitted for an
6562 elaborated-type-specifier. */
6569 }
6573 {
6574 location_t cilk_spawn_loc
6579 {
6584 }
6586 {
6591 }
6592 else
6593 {
6594 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6597 }
6599 postfix_expression =
6603 {
6607 }
6609 {
6614 }
6615 else
6616 {
6619 postfix_expression);
6620 /* Build a location of the form:
6621 _Cilk_spawn expr
6622 ~~~~~~~~~~~~^~~~
6623 with caret at the expr, ranging from the start of the
6624 _Cilk_spawn token to the end of the expression. */
6625 location_t combined_loc =
6631 }
6633 }
6638 {
6641 tree p;
6648 {
6651 }
6657 {
6660 postfix_expression
6662 else
6663 {
6667 }
6673 tf_warning_or_error);
6674 else
6675 {
6679 }
6684 postfix_expression
6688 postfix_expression
6691 else
6692 {
6696 }
6701 }
6703 }
6706 {
6707 tree type;
6709 /* If the next thing is a simple-type-specifier, we may be
6710 looking at a functional cast. We could also be looking at
6711 an id-expression. So, we try the functional cast, and if
6712 that doesn't work we fall back to the primary-expression. */
6714 /* Look for the simple-type-specifier. */
6718 CP_PARSER_FLAGS_NONE);
6720 /* Parse the cast itself. */
6722 postfix_expression
6724 /* If that worked, we're done. */
6728 /* If the functional-cast didn't work out, try a
6729 compound-literal. */
6732 {
6737 /* Avoid calling cp_parser_type_id pointlessly, see comment
6738 in cp_parser_cast_expression about c++/29234. */
6741 else
6742 {
6743 /* Parse the type. */
6748 /* Look for the `)'. */
6750 }
6752 /* If things aren't going well, there's no need to
6753 keep going. */
6755 {
6757 /* Parse the brace-enclosed initializer list. */
6760 }
6761 /* If that worked, we're definitely looking at a
6762 compound-literal expression. */
6764 {
6765 /* Warn the user that a compound literal is not
6766 allowed in standard C++. */
6769 /* For simplicity, we disallow compound literals in
6770 constant-expressions. We could
6771 allow compound literals of integer type, whose
6772 initializer was a constant, in constant
6773 expressions. Permitting that usage, as a further
6774 extension, would not change the meaning of any
6775 currently accepted programs. (Of course, as
6776 compound literals are not part of ISO C++, the
6777 standard has nothing to say.) */
6779 NIC_NCC))
6780 {
6783 }
6784 /* Form the representation of the compound-literal. */
6785 postfix_expression
6790 }
6791 }
6793 /* It must be a primary-expression. */
6794 postfix_expression
6797 decltype_p,
6799 }
6801 }
6803 /* Note that we don't need to worry about calling build_cplus_new on a
6804 class-valued CALL_EXPR in decltype when it isn't the end of the
6805 postfix-expression; unary_complex_lvalue will take care of that for
6806 all these cases. */
6808 /* Keep looping until the postfix-expression is complete. */
6810 {
6814 /* It is not a Koenig lookup function call. */
6815 postfix_expression
6818 /* Peek at the next token. */
6822 {
6825 {
6827 "two consecutive %<[%> shall "
6830 }
6831 postfix_expression
6833 postfix_expression,
6835 decltype_p);
6844 /* postfix-expression ( expression-list [opt] ) */
6845 {
6856 is_builtin_constant_p
6859 {
6860 /* The whole point of __builtin_constant_p is to allow
6861 non-constant expressions to appear as arguments. */
6862 saved_integral_constant_expression_p
6864 saved_non_integral_constant_expression_p
6867 }
6868 args = (cp_parser_parenthesized_expression_list
6874 {
6875 parser->integral_constant_expression_p
6877 parser->non_integral_constant_expression_p
6879 }
6882 {
6885 }
6887 /* Function calls are not permitted in
6888 constant-expressions. */
6891 NIC_FUNC_CALL))
6892 {
6896 }
6901 {
6903 {
6905 {
6908 postfix_expression
6910 complain);
6911 }
6912 else
6913 postfix_expression
6915 }
6916 /* We do not perform argument-dependent lookup if
6917 normal lookup finds a non-function, in accordance
6918 with the expected resolution of DR 218. */
6921 {
6925 /* Do not do argument dependent lookup if regular
6926 lookup finds a member function or a block-scope
6927 function declaration. [basic.lookup.argdep]/3 */
6930 {
6933 postfix_expression
6935 complain);
6936 }
6937 }
6938 }
6944 {
6953 }
6956 {
6966 {
6968 postfix_expression
6972 }
6975 {
6976 postfix_expression
6977 = (build_new_method_call
6983 complain));
6984 }
6985 else
6986 postfix_expression
6990 complain);
6991 }
6995 postfix_expression = (build_offset_ref_call_from_tree
6997 complain));
6999 /* A call to a static class member, or a namespace-scope
7000 function. */
7001 postfix_expression
7004 koenig_p,
7005 complain);
7006 else
7007 /* All other function calls. */
7008 postfix_expression
7011 koenig_p,
7012 complain);
7015 {
7017 start_loc,
7018 close_paren_loc);
7020 }
7022 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7026 }
7031 /* postfix-expression . template [opt] id-expression
7032 postfix-expression . pseudo-destructor-name
7033 postfix-expression -> template [opt] id-expression
7034 postfix-expression -> pseudo-destructor-name */
7036 /* Consume the `.' or `->' operator. */
7039 postfix_expression
7041 postfix_expression,
7048 /* postfix-expression ++ */
7049 /* Consume the `++' token. */
7051 /* Generate a representation for the complete expression. */
7052 postfix_expression
7054 POSTINCREMENT_EXPR);
7055 /* Increments may not appear in constant-expressions. */
7063 /* postfix-expression -- */
7064 /* Consume the `--' token. */
7066 /* Generate a representation for the complete expression. */
7067 postfix_expression
7069 POSTDECREMENT_EXPR);
7070 /* Decrements may not appear in constant-expressions. */
7081 return is_member_access
7082 ? postfix_expression
7084 else
7086 }
7087 }
7089 /* We should never get here. */
7092 }
7094 /* This function parses Cilk Plus array notations. If a normal array expr. is
7095 parsed then the array index is passed back to the caller through *INIT_INDEX
7096 and the function returns a NULL_TREE. If array notation expr. is parsed,
7097 then *INIT_INDEX is ignored by the caller and the function returns
7098 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7099 error_mark_node. */
7101 static tree
7103 tree array_value)
7104 {
7108 {
7111 }
7120 {
7123 }
7125 {
7126 /* Consume the ':'. */
7129 /* If we are here, then we have a case like this A[:]. */
7131 {
7135 }
7139 }
7140 else
7141 {
7142 /* If we are here, then there are three valid possibilities:
7143 1. ARRAY [ EXP ]
7144 2. ARRAY [ EXP : EXP ]
7145 3. ARRAY [ EXP : EXP : EXP ] */
7149 {
7150 /* This indicates that we have a normal array expression. */
7153 }
7155 /* Consume the ':'. */
7159 {
7162 }
7163 }
7168 {
7172 }
7178 }
7180 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7181 by cp_parser_builtin_offsetof. We're looking for
7183 postfix-expression [ expression ]
7184 postfix-expression [ braced-init-list ] (C++11)
7186 FOR_OFFSETOF is set if we're being called in that context, which
7187 changes how we deal with integer constant expressions. */
7189 static tree
7191 tree postfix_expression,
7194 {
7199 /* Consume the `[' token. */
7205 /* Parse the index expression. */
7206 /* ??? For offsetof, there is a question of what to allow here. If
7207 offsetof is not being used in an integral constant expression context,
7208 then we *could* get the right answer by computing the value at runtime.
7209 If we are in an integral constant expression context, then we might
7210 could accept any constant expression; hard to say without analysis.
7211 Rather than open the barn door too wide right away, allow only integer
7212 constant expressions here. */
7215 else
7216 {
7218 {
7225 {
7227 "braced list index is not allowed with array "
7231 }
7232 }
7234 {
7235 /* Here are have these two options:
7236 ARRAY[EXP : EXP] - Array notation expr with default
7237 stride of 1.
7238 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7239 stride. */
7241 postfix_expression);
7244 }
7245 else
7247 }
7251 /* Look for the closing `]'. */
7254 /* Build the ARRAY_REF. */
7258 /* When not doing offsetof, array references are not permitted in
7259 constant-expressions. */
7265 }
7267 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7268 by cp_parser_builtin_offsetof. We're looking for
7270 postfix-expression . template [opt] id-expression
7271 postfix-expression . pseudo-destructor-name
7272 postfix-expression -> template [opt] id-expression
7273 postfix-expression -> pseudo-destructor-name
7275 FOR_OFFSETOF is set if we're being called in that context. That sorta
7276 limits what of the above we'll actually accept, but nevermind.
7277 TOKEN_TYPE is the "." or "->" token, which will already have been
7278 removed from the stream. */
7280 static tree
7283 cp_expr postfix_expression,
7285 location_t location)
7286 {
7287 tree name;
7293 /* If this is a `->' operator, dereference the pointer. */
7296 tf_warning_or_error);
7297 /* Check to see whether or not the expression is type-dependent and
7298 not the current instantiation. */
7300 /* The identifier following the `->' or `.' is not qualified. */
7306 /* Enter the scope corresponding to the type of the object
7307 given by the POSTFIX_EXPRESSION. */
7309 {
7311 /* According to the standard, no expression should ever have
7312 reference type. Unfortunately, we do not currently match
7313 the standard in this respect in that our internal representation
7314 of an expression may have reference type even when the standard
7315 says it does not. Therefore, we have to manually obtain the
7316 underlying type here. */
7318 /* The type of the POSTFIX_EXPRESSION must be complete. */
7319 /* Unlike the object expression in other contexts, *this is not
7320 required to be of complete type for purposes of class member
7321 access (5.2.5) outside the member function body. */
7324 && !(processing_template_decl
7325 && current_class_type
7326 && (same_type_ignoring_top_level_qualifiers_p
7328 {
7331 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7333 {
7334 /* In a template, be permissive by treating an object expression
7335 of incomplete type as dependent (after a pedwarn). */
7336 diagnostic_t kind = (processing_template_decl
7337 ? DK_PEDWARN
7339 cxx_incomplete_type_diagnostic
7343 {
7346 }
7347 }
7348 }
7351 {
7352 /* Let the name lookup machinery know that we are processing a
7353 class member access expression. */
7355 /* If something went wrong, we want to be able to discern that case,
7356 as opposed to the case where there was no SCOPE due to the type
7357 of expression being dependent. */
7360 /* If the SCOPE was erroneous, make the various semantic analysis
7361 functions exit quickly -- and without issuing additional error
7362 messages. */
7365 }
7366 }
7369 /* Tell cp_parser_lookup_name that there was an object, even though it's
7370 type-dependent. */
7373 /* Assume this expression is not a pseudo-destructor access. */
7376 /* If the SCOPE is a scalar type, then, if this is a valid program,
7377 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7378 is type dependent, it can be pseudo-destructor-name or something else.
7379 Try to parse it as pseudo-destructor-name first. */
7381 {
7382 tree s;
7383 tree type;
7386 /* Parse the pseudo-destructor-name. */
7395 {
7397 postfix_expression
7400 }
7401 }
7404 {
7405 /* If the SCOPE is not a scalar type, we are looking at an
7406 ordinary class member access expression, rather than a
7407 pseudo-destructor-name. */
7410 /* Parse the id-expression. */
7411 name = (cp_parser_id_expression
7418 /* In general, build a SCOPE_REF if the member name is qualified.
7419 However, if the name was not dependent and has already been
7420 resolved; there is no need to build the SCOPE_REF. For example;
7422 struct X { void f(); };
7423 template <typename T> void f(T* t) { t->X::f(); }
7425 Even though "t" is dependent, "X::f" is not and has been resolved
7426 to a BASELINK; there is no need to include scope information. */
7428 /* But we do need to remember that there was an explicit scope for
7429 virtual function calls. */
7433 /* If the name is a template-id that names a type, we will get a
7434 TYPE_DECL here. That is invalid code. */
7436 {
7439 }
7440 else
7441 {
7443 {
7445 {
7449 }
7450 else
7453 name,
7454 template_p);
7458 }
7460 adjust_result_of_qualified_name_lookup
7462 postfix_expression
7464 template_p,
7465 tf_warning_or_error);
7466 /* Build a location e.g.:
7467 ptr->access_expr
7468 ~~~^~~~~~~~~~~~~
7469 where the caret is at the deref token, ranging from
7470 the start of postfix_expression to the end of the access expr. */
7471 location_t end_loc
7473 location_t combined_loc
7476 }
7477 }
7479 /* We no longer need to look up names in the scope of the object on
7480 the left-hand side of the `.' or `->' operator. */
7483 /* Outside of offsetof, these operators may not appear in
7484 constant-expressions. */
7486 && (cp_parser_non_integral_constant_expression
7491 }
7493 /* Parse a parenthesized expression-list.
7495 expression-list:
7496 assignment-expression
7497 expression-list, assignment-expression
7499 attribute-list:
7500 expression-list
7501 identifier
7502 identifier, expression-list
7504 CAST_P is true if this expression is the target of a cast.
7506 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7507 argument pack.
7509 Returns a vector of trees. Each element is a representation of an
7510 assignment-expression. NULL is returned if the ( and or ) are
7511 missing. An empty, but allocated, vector is returned on no
7512 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7513 if we are parsing an attribute list for an attribute that wants a
7514 plain identifier argument, normal_attr for an attribute that wants
7515 an expression, or non_attr if we aren't parsing an attribute list. If
7516 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7517 not all of the expressions in the list were constant.
7518 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7519 will be written to with the location of the closing parenthesis. If
7520 an error occurs, it may or may not be written to. */
7529 {
7535 /* Assume all the expressions will be constant. */
7544 /* Within a parenthesized expression, a `>' token is always
7545 the greater-than operator. */
7546 saved_greater_than_is_operator_p
7550 /* Consume expressions until there are no more. */
7553 {
7554 tree expr;
7556 /* At the beginning of attribute lists, check to see if the
7557 next token is an identifier. */
7560 {
7563 /* Consume the identifier. */
7565 /* Save the identifier. */
7567 }
7568 else
7569 {
7572 /* Parse the next assignment-expression. */
7574 {
7575 /* A braced-init-list. */
7581 }
7583 {
7584 expr = (cp_parser_constant_expression
7589 }
7590 else
7592 cast_p);
7597 /* If we have an ellipsis, then this is an expression
7598 expansion. */
7601 {
7602 /* Consume the `...'. */
7605 /* Build the argument pack. */
7607 }
7609 /* Add it to the list. We add error_mark_node
7610 expressions to the list, so that we can still tell if
7611 the correct form for a parenthesized expression-list
7612 is found. That gives better errors. */
7617 }
7619 /* After the first item, attribute lists look the same as
7620 expression lists. */
7623 get_comma:;
7624 /* If the next token isn't a `,', then we are done. */
7628 /* Otherwise, consume the `,' and keep going. */
7630 }
7636 {
7639 skip_comma:;
7640 /* We try and resync to an unnested comma, as that will give the
7641 user better diagnostics. */
7649 {
7650 parser->greater_than_is_operator_p
7653 }
7654 }
7656 parser->greater_than_is_operator_p
7663 }
7665 /* Parse a pseudo-destructor-name.
7667 pseudo-destructor-name:
7668 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7669 :: [opt] nested-name-specifier template template-id :: ~ type-name
7670 :: [opt] nested-name-specifier [opt] ~ type-name
7672 If either of the first two productions is used, sets *SCOPE to the
7673 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7674 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7675 or ERROR_MARK_NODE if the parse fails. */
7677 static void
7679 tree object,
7682 {
7685 /* Handle ~auto. */
7689 {
7692 "%<~auto%> only available with "
7699 }
7701 /* Assume that things will not work out. */
7704 /* Look for the optional `::' operator. */
7706 /* Look for the optional nested-name-specifier. */
7707 nested_name_specifier_p
7714 /* Now, if we saw a nested-name-specifier, we might be doing the
7715 second production. */
7718 {
7719 /* Consume the `template' keyword. */
7721 /* Parse the template-id. */
7725 class_type,
7727 /* Look for the `::' token. */
7729 }
7730 /* If the next token is not a `~', then there might be some
7731 additional qualification. */
7733 {
7734 /* At this point, we're looking for "type-name :: ~". The type-name
7735 must not be a class-name, since this is a pseudo-destructor. So,
7736 it must be either an enum-name, or a typedef-name -- both of which
7737 are just identifiers. So, we peek ahead to check that the "::"
7738 and "~" tokens are present; if they are not, then we can avoid
7739 calling type_name. */
7743 {
7746 }
7748 /* Look for the type-name. */
7753 /* Look for the `::' token. */
7755 }
7756 else
7759 /* Look for the `~'. */
7762 /* Once we see the ~, this has to be a pseudo-destructor. */
7766 /* Look for the type-name again. We are not responsible for
7767 checking that it matches the first type-name. */
7769 }
7771 /* Parse a unary-expression.
7773 unary-expression:
7774 postfix-expression
7775 ++ cast-expression
7776 -- cast-expression
7777 unary-operator cast-expression
7778 sizeof unary-expression
7779 sizeof ( type-id )
7780 alignof ( type-id ) [C++0x]
7781 new-expression
7782 delete-expression
7784 GNU Extensions:
7786 unary-expression:
7787 __extension__ cast-expression
7788 __alignof__ unary-expression
7789 __alignof__ ( type-id )
7790 alignof unary-expression [C++0x]
7791 __real__ cast-expression
7792 __imag__ cast-expression
7793 && identifier
7794 sizeof ( type-id ) { initializer-list , [opt] }
7795 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7796 __alignof__ ( type-id ) { initializer-list , [opt] }
7798 ADDRESS_P is true iff the unary-expression is appearing as the
7799 operand of the `&' operator. CAST_P is true if this expression is
7800 the target of a cast.
7802 Returns a representation of the expression. */
7804 static cp_expr
7807 {
7811 /* Peek at the next token. */
7813 /* Some keywords give away the kind of expression. */
7815 {
7819 {
7822 {
7828 /* Consume the token. */
7830 /* Parse the operand. */
7835 else
7836 {
7837 /* ISO C++ defines alignof only with types, not with
7838 expressions. So pedwarn if alignof is used with a non-
7839 type expression. However, __alignof__ is ok. */
7842 "ISO C++ does not allow %<alignof%> "
7846 }
7847 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7848 SIZEOF_EXPR with the original operand. */
7850 {
7852 {
7854 {
7857 error_mark_node));
7859 }
7860 else
7864 }
7865 }
7867 /* Construct a location e.g. :
7868 alignof (expr)
7869 ^~~~~~~~~~~~~~
7870 with start == caret at the start of the "alignof"/"sizeof"
7871 token, with the endpoint at the final closing paren. */
7872 location_t finish_loc
7874 location_t compound_loc
7880 }
7889 {
7890 /* The saved value of the PEDANTIC flag. */
7892 tree expr;
7894 /* Save away the PEDANTIC flag. */
7896 /* Parse the cast-expression. */
7898 /* Restore the PEDANTIC flag. */
7902 }
7906 {
7907 tree expression;
7909 /* Consume the `__real__' or `__imag__' token. */
7911 /* Parse the cast-expression. */
7913 /* Create the complete representation. */
7917 expression,
7918 tf_warning_or_error);
7919 }
7927 {
7928 tree expr;
7938 parser->type_definition_forbidden_message
7941 saved_integral_constant_expression_p
7943 saved_non_integral_constant_expression_p
7947 saved_greater_than_is_operator_p
7959 parser->greater_than_is_operator_p
7962 parser->integral_constant_expression_p
7964 parser->non_integral_constant_expression_p
7971 }
7975 }
7976 }
7978 /* Look for the `:: new' and `:: delete', which also signal the
7979 beginning of a new-expression, or delete-expression,
7980 respectively. If the next token is `::', then it might be one of
7981 these. */
7983 {
7986 /* See if the token after the `::' is one of the keywords in
7987 which we're interested. */
7989 /* If it's `new', we have a new-expression. */
7992 /* Similarly, for `delete'. */
7995 }
7997 /* Look for a unary operator. */
7999 /* The `++' and `--' operators can be handled similarly, even though
8000 they are not technically unary-operators in the grammar. */
8002 {
8007 /* Handle the GNU address-of-label extension. */
8010 {
8011 tree identifier;
8012 tree expression;
8015 /* Consume the '&&' token. */
8017 /* Look for the identifier. */
8018 location_t finish_loc
8021 /* Construct a location of the form:
8022 &&label
8023 ^~~~~~~
8024 with caret==start at the "&&", finish at the end of the label. */
8025 location_t combined_loc
8027 /* Create an expression representing the address. */
8030 NIC_ADDR_LABEL))
8033 }
8034 }
8036 {
8037 cp_expr cast_expression;
8043 /* Consume the operator token. */
8047 /* Parse the cast-expression. */
8048 cast_expression
8053 pidk);
8055 /* Make a location:
8056 OP_TOKEN CAST_EXPRESSION
8057 ^~~~~~~~~~~~~~~~~~~~~~~~~
8058 with start==caret at the operator token, and
8059 extending to the end of the cast_expression. */
8062 /* Now, build an appropriate representation. */
8064 {
8068 RO_UNARY_STAR,
8069 complain);
8070 /* TODO: build_x_indirect_ref does not always honor the
8071 location, so ensure it is set. */
8077 /* Fall through. */
8080 cast_expression,
8081 complain);
8082 /* TODO: build_x_unary_op does not always honor the location,
8083 so ensure it is set. */
8091 /* Fall through. */
8093 /* Immediately fold negation of a constant, unless the constant is 0
8094 (since -0 == 0) or it would overflow. */
8099 {
8102 cast_expression);
8104 {
8107 }
8108 }
8109 /* Fall through. */
8118 }
8122 non_constant_p))
8126 }
8130 decltype_p,
8131 pidk);
8132 }
8134 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8135 unary-operator, the corresponding tree code is returned. */
8137 static enum tree_code
8139 {
8141 {
8162 }
8163 }
8165 /* Parse a new-expression.
8167 new-expression:
8168 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8169 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8171 Returns a representation of the expression. */
8173 static tree
8175 {
8178 tree type;
8181 tree ret;
8185 /* Look for the optional `::' operator. */
8186 global_scope_p
8190 /* Look for the `new' operator. */
8192 /* There's no easy way to tell a new-placement from the
8193 `( type-id )' construct. */
8195 /* Look for a new-placement. */
8197 /* If that didn't work out, there's no new-placement. */
8199 {
8203 }
8205 /* If the next token is a `(', then we have a parenthesized
8206 type-id. */
8208 {
8212 /* Consume the `('. */
8215 /* Parse the type-id. */
8216 parser->type_definition_forbidden_message
8218 {
8221 }
8224 /* Look for the closing `)'. */
8227 /* There should not be a direct-new-declarator in this production,
8228 but GCC used to allowed this, so we check and emit a sensible error
8229 message for this case. */
8231 {
8237 }
8238 }
8239 /* Otherwise, there must be a new-type-id. */
8240 else
8243 /* If the next token is a `(' or '{', then we have a new-initializer. */
8248 else
8251 /* A new-expression may not appear in an integral constant
8252 expression. */
8255 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8256 of a new-type-id or type-id of a new-expression, the new-expression shall
8257 contain a new-initializer of the form ( assignment-expression )".
8258 Additionally, consistently with the spirit of DR 1467, we want to accept
8259 'new auto { 2 }' too. */
8265 {
8267 "initialization of new-expression for type %<auto%> "
8270 }
8271 else
8272 {
8273 /* Construct a location e.g.:
8274 ptr = new int[100]
8275 ^~~~~~~~~~~~
8276 with caret == start at the start of the "new" token, and the end
8277 at the end of the final token we consumed. */
8282 /* Create a representation of the new-expression. */
8284 tf_warning_or_error);
8286 }
8294 }
8296 /* Parse a new-placement.
8298 new-placement:
8299 ( expression-list )
8301 Returns the same representation as for an expression-list. */
8305 {
8308 /* Parse the expression-list. */
8309 expression_list = (cp_parser_parenthesized_expression_list
8318 }
8320 /* Parse a new-type-id.
8322 new-type-id:
8323 type-specifier-seq new-declarator [opt]
8325 Returns the TYPE allocated. If the new-type-id indicates an array
8326 type, *NELTS is set to the number of elements in the last array
8327 bound; the TYPE will not include the last array bound. */
8329 static tree
8331 {
8332 cp_decl_specifier_seq type_specifier_seq;
8338 /* The type-specifier sequence must not contain type definitions.
8339 (It cannot contain declarations of new types either, but if they
8340 are not definitions we will catch that because they are not
8341 complete.) */
8343 parser->type_definition_forbidden_message
8345 /* Parse the type-specifier-seq. */
8349 /* Restore the old message. */
8355 /* Parse the new-declarator. */
8358 /* Determine the number of elements in the last array dimension, if
8359 any. */
8361 /* Skip down to the last array dimension. */
8366 {
8369 }
8374 {
8377 }
8380 {
8387 else
8389 }
8392 }
8394 /* Parse an (optional) new-declarator.
8396 new-declarator:
8397 ptr-operator new-declarator [opt]
8398 direct-new-declarator
8400 Returns the declarator. */
8404 {
8407 cp_cv_quals cv_quals;
8409 /* We don't know if there's a ptr-operator next, or not. */
8411 /* Look for a ptr-operator. */
8413 /* If that worked, look for more new-declarators. */
8415 {
8418 /* Parse another optional declarator. */
8421 declarator = cp_parser_make_indirect_declarator
8425 }
8427 /* If the next token is a `[', there is a direct-new-declarator. */
8432 }
8434 /* Parse a direct-new-declarator.
8436 direct-new-declarator:
8437 [ expression ]
8438 direct-new-declarator [constant-expression]
8440 */
8444 {
8448 {
8449 tree expression;
8452 /* Look for the opening `['. */
8457 /* The standard requires that the expression have integral
8458 type. DR 74 adds enumeration types. We believe that the
8459 real intent is that these expressions be handled like the
8460 expression in a `switch' condition, which also allows
8461 classes with a single conversion to integral or
8462 enumeration type. */
8464 {
8465 expression
8467 expression,
8470 {
8472 "expression in new-declarator must have integral "
8475 }
8476 }
8478 /* Look for the closing `]'. */
8481 /* Add this bound to the declarator. */
8484 /* If the next token is not a `[', then there are no more
8485 bounds. */
8488 }
8491 }
8493 /* Parse a new-initializer.
8495 new-initializer:
8496 ( expression-list [opt] )
8497 braced-init-list
8499 Returns a representation of the expression-list. */
8503 {
8507 {
8508 tree t;
8515 }
8516 else
8517 expression_list = (cp_parser_parenthesized_expression_list
8523 }
8525 /* Parse a delete-expression.
8527 delete-expression:
8528 :: [opt] delete cast-expression
8529 :: [opt] delete [ ] cast-expression
8531 Returns a representation of the expression. */
8533 static tree
8535 {
8538 tree expression;
8540 /* Look for the optional `::' operator. */
8541 global_scope_p
8545 /* Look for the `delete' keyword. */
8547 /* See if the array syntax is in use. */
8549 {
8550 /* Consume the `[' token. */
8552 /* Look for the `]' token. */
8554 /* Remember that this is the `[]' construct. */
8556 }
8557 else
8560 /* Parse the cast-expression. */
8563 /* A delete-expression may not appear in an integral constant
8564 expression. */
8569 tf_warning_or_error);
8570 }
8572 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8573 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8574 0 otherwise. */
8576 static int
8578 {
8581 {
8623 /* In ((type ()) () the last () isn't a valid cast-expression,
8624 so the whole must be parsed as postfix-expression. */
8629 /* '[' may start a primary-expression in obj-c++ and in C++11,
8630 as a lambda-expression, eg, '(void)[]{}'. */
8637 /* '++' and '--' may or may not start a cast-expression:
8639 struct T { void operator++(int); };
8640 void f() { (T())++; }
8642 vs
8644 int a;
8645 (int)++a; */
8650 }
8651 }
8653 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8654 in the order: const_cast, static_cast, reinterpret_cast.
8656 Don't suggest dynamic_cast.
8658 Return the first legal cast kind found, or NULL otherwise. */
8662 {
8663 tree trial;
8665 /* Reuse the parser logic by attempting to build the various kinds of
8666 cast, with "complain" disabled.
8667 Identify the first such cast that is valid. */
8669 /* Don't attempt to run such logic within template processing. */
8673 /* First try const_cast. */
8678 /* If that fails, try static_cast. */
8683 /* Finally, try reinterpret_cast. */
8688 /* No such cast possible. */
8690 }
8692 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8693 suggesting how to convert a C-style cast of the form:
8695 (DST_TYPE)ORIG_EXPR
8697 to a C++-style cast.
8699 The primary range of RICHLOC is asssumed to be that of the original
8700 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8701 of the parens in the C-style cast. */
8703 static void
8706 tree dst_type)
8707 {
8708 /* This function is non-trivial, so bail out now if the warning isn't
8709 going to be emitted. */
8713 /* Try to find a legal C++ cast, trying them in order:
8714 const_cast, static_cast, reinterpret_cast. */
8719 /* Replace the open paren with "CAST_SUGGESTION<". */
8720 pretty_printer pp;
8724 /* Replace the close paren with "> (". */
8727 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8729 }
8732 /* Parse a cast-expression.
8734 cast-expression:
8735 unary-expression
8736 ( type-id ) cast-expression
8738 ADDRESS_P is true iff the unary-expression is appearing as the
8739 operand of the `&' operator. CAST_P is true if this expression is
8740 the target of a cast.
8742 Returns a representation of the expression. */
8744 static cp_expr
8747 {
8748 /* If it's a `(', then we might be looking at a cast. */
8750 {
8756 /* There's no way to know yet whether or not this is a cast.
8757 For example, `(int (3))' is a unary-expression, while `(int)
8758 3' is a cast. So, we resort to parsing tentatively. */
8760 /* Types may not be defined in a cast. */
8762 parser->type_definition_forbidden_message
8764 /* Consume the `('. */
8769 /* A very tricky bit is that `(struct S) { 3 }' is a
8770 compound-literal (which we permit in C++ as an extension).
8771 But, that construct is not a cast-expression -- it is a
8772 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8773 is legal; if the compound-literal were a cast-expression,
8774 you'd need an extra set of parentheses.) But, if we parse
8775 the type-id, and it happens to be a class-specifier, then we
8776 will commit to the parse at that point, because we cannot
8777 undo the action that is done when creating a new class. So,
8778 then we cannot back up and do a postfix-expression.
8780 Another tricky case is the following (c++/29234):
8782 struct S { void operator () (); };
8784 void foo ()
8785 {
8786 ( S()() );
8787 }
8789 As a type-id we parse the parenthesized S()() as a function
8790 returning a function, groktypename complains and we cannot
8791 back up in this case either.
8793 Therefore, we scan ahead to the closing `)', and check to see
8794 if the tokens after the `)' can start a cast-expression. Otherwise
8795 we are dealing with an unary-expression, a postfix-expression
8796 or something else.
8798 Yet another tricky case, in C++11, is the following (c++/54891):
8800 (void)[]{};
8802 The issue is that usually, besides the case of lambda-expressions,
8803 the parenthesized type-id cannot be followed by '[', and, eg, we
8804 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8805 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8806 we don't commit, we try a cast-expression, then an unary-expression.
8808 Save tokens so that we can put them back. */
8811 /* We may be looking at a cast-expression. */
8814 cast_expression
8817 /* Roll back the tokens we skipped. */
8819 /* If we aren't looking at a cast-expression, simulate an error so
8820 that the call to cp_parser_error_occurred below returns true. */
8823 else
8824 {
8827 /* Look for the type-id. */
8829 /* Look for the closing `)'. */
8830 cp_token *close_paren
8835 }
8837 /* Restore the saved message. */
8840 /* At this point this can only be either a cast or a
8841 parenthesized ctor such as `(T ())' that looks like a cast to
8842 function returning T. */
8844 {
8845 /* Only commit if the cast-expression doesn't start with
8846 '++', '--', or '[' in C++11. */
8854 pidk);
8857 {
8858 /* Warn about old-style casts, if so requested. */
8863 {
8869 }
8871 /* Only type conversions to integral or enumeration types
8872 can be used in constant-expressions. */
8875 NIC_CAST))
8878 /* Perform the cast. */
8879 /* Make a location:
8880 (TYPE) EXPR
8881 ^~~~~~~~~~~
8882 with start==caret at the open paren, extending to the
8883 end of "expr". */
8885 open_paren_loc,
8889 }
8890 }
8891 else
8893 }
8895 /* If we get here, then it's not a cast, so it must be a
8896 unary-expression. */
8899 }
8901 /* Parse a binary expression of the general form:
8903 pm-expression:
8904 cast-expression
8905 pm-expression .* cast-expression
8906 pm-expression ->* cast-expression
8908 multiplicative-expression:
8909 pm-expression
8910 multiplicative-expression * pm-expression
8911 multiplicative-expression / pm-expression
8912 multiplicative-expression % pm-expression
8914 additive-expression:
8915 multiplicative-expression
8916 additive-expression + multiplicative-expression
8917 additive-expression - multiplicative-expression
8919 shift-expression:
8920 additive-expression
8921 shift-expression << additive-expression
8922 shift-expression >> additive-expression
8924 relational-expression:
8925 shift-expression
8926 relational-expression < shift-expression
8927 relational-expression > shift-expression
8928 relational-expression <= shift-expression
8929 relational-expression >= shift-expression
8931 GNU Extension:
8933 relational-expression:
8934 relational-expression <? shift-expression
8935 relational-expression >? shift-expression
8937 equality-expression:
8938 relational-expression
8939 equality-expression == relational-expression
8940 equality-expression != relational-expression
8942 and-expression:
8943 equality-expression
8944 and-expression & equality-expression
8946 exclusive-or-expression:
8947 and-expression
8948 exclusive-or-expression ^ and-expression
8950 inclusive-or-expression:
8951 exclusive-or-expression
8952 inclusive-or-expression | exclusive-or-expression
8954 logical-and-expression:
8955 inclusive-or-expression
8956 logical-and-expression && inclusive-or-expression
8958 logical-or-expression:
8959 logical-and-expression
8960 logical-or-expression || logical-and-expression
8962 All these are implemented with a single function like:
8964 binary-expression:
8965 simple-cast-expression
8966 binary-expression <token> binary-expression
8968 CAST_P is true if this expression is the target of a cast.
8970 The binops_by_token map is used to get the tree codes for each <token> type.
8971 binary-expressions are associated according to a precedence table. */
8973 #define TOKEN_PRECEDENCE(token) \
8974 (((token->type == CPP_GREATER \
8975 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8976 && !parser->greater_than_is_operator_p) \
8977 ? PREC_NOT_OPERATOR \
8978 : binops_by_token[token->type].prec)
8980 static cp_expr
8986 {
8987 cp_parser_expression_stack stack;
8989 cp_parser_expression_stack_entry current;
8990 cp_expr rhs;
8994 tree overload;
8996 /* Parse the first expression. */
9007 {
9008 /* Get an operator token. */
9014 {
9016 "%<>>%> operator is treated"
9020 }
9025 /* This is a fold-expression; handle it later. */
9028 /* Popping an entry off the stack means we completed a subexpression:
9029 - either we found a token which is not an operator (`>' where it is not
9030 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9031 will happen repeatedly;
9032 - or, we found an operator which has lower priority. This is the case
9033 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9034 parsing `3 * 4'. */
9036 {
9039 else
9041 }
9043 get_rhs:
9047 /* We used the operator token. */
9050 /* For "false && x" or "true || x", x will never be executed;
9051 disable warnings while evaluating it. */
9053 c_inhibit_evaluation_warnings +=
9056 c_inhibit_evaluation_warnings +=
9059 /* Extract another operand. It may be the RHS of this expression
9060 or the LHS of a new, higher priority expression. */
9065 /* Get another operator token. Look up its precedence to avoid
9066 building a useless (immediately popped) stack entry for common
9067 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9074 {
9075 /* ... and prepare to parse the RHS of the new, higher priority
9076 expression. Since precedence levels on the stack are
9077 monotonically increasing, we do not have to care about
9078 stack overflows. */
9087 pop:
9089 /* If the stack is not empty, we have parsed into LHS the right side
9090 (`4' in the example above) of an expression we had suspended.
9091 We can use the information on the stack to recover the LHS (`3')
9092 from the stack together with the tree code (`MULT_EXPR'), and
9093 the precedence of the higher level subexpression
9094 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9095 which will be used to actually build the additive expression. */
9100 }
9102 /* Undo the disabling of warnings done above. */
9104 c_inhibit_evaluation_warnings -=
9107 c_inhibit_evaluation_warnings -=
9113 /* Avoid warning for !!x == y. */
9118 /* Avoid warning for !b == y where b is boolean. */
9122 /* Avoid warning for !!b == y where b is boolean. */
9135 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9136 ERROR_MARK for everything that is not a binary expression.
9137 This makes warn_about_parentheses miss some warnings that
9138 involve unary operators. For unary expressions we should
9139 pass the correct tree_code unless the unary expression was
9140 surrounded by parentheses.
9141 */
9148 == tcc_comparison
9151 else
9152 {
9157 /* TODO: build_x_binary_op doesn't always honor the location. */
9159 }
9162 /* If the binary operator required the use of an overloaded operator,
9163 then this expression cannot be an integral constant-expression.
9164 An overloaded operator can be used even if both operands are
9165 otherwise permissible in an integral constant-expression if at
9166 least one of the operands is of enumeration type. */
9170 NIC_OVERLOADED))
9172 }
9175 }
9177 static cp_expr
9182 {
9185 }
9187 /* Parse the `? expression : assignment-expression' part of a
9188 conditional-expression. The LOGICAL_OR_EXPR is the
9189 logical-or-expression that started the conditional-expression.
9190 Returns a representation of the entire conditional-expression.
9192 This routine is used by cp_parser_assignment_expression.
9194 ? expression : assignment-expression
9196 GNU Extensions:
9198 ? : assignment-expression */
9200 static tree
9202 {
9204 cp_expr assignment_expr;
9208 /* Consume the `?' token. */
9213 {
9216 /* Implicit true clause. */
9218 c_inhibit_evaluation_warnings +=
9221 }
9222 else
9223 {
9226 /* Parse the expression. */
9227 c_inhibit_evaluation_warnings +=
9230 c_inhibit_evaluation_warnings +=
9234 }
9236 /* The next token should be a `:'. */
9238 /* Parse the assignment-expression. */
9240 c_inhibit_evaluation_warnings -=
9243 /* Make a location:
9244 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9245 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9246 with the caret at the "?", ranging from the start of
9247 the logical_or_expr to the end of the assignment_expr. */
9252 /* Build the conditional-expression. */
9254 expr,
9255 assignment_expr,
9256 tf_warning_or_error);
9257 }
9259 /* Parse an assignment-expression.
9261 assignment-expression:
9262 conditional-expression
9263 logical-or-expression assignment-operator assignment_expression
9264 throw-expression
9266 CAST_P is true if this expression is the target of a cast.
9267 DECLTYPE_P is true if this expression is the operand of decltype.
9269 Returns a representation for the expression. */
9271 static cp_expr
9274 {
9275 cp_expr expr;
9277 /* If the next token is the `throw' keyword, then we're looking at
9278 a throw-expression. */
9281 /* Otherwise, it must be that we are looking at a
9282 logical-or-expression. */
9283 else
9284 {
9285 /* Parse the binary expressions (logical-or-expression). */
9287 decltype_p,
9289 /* If the next token is a `?' then we're actually looking at a
9290 conditional-expression. */
9293 else
9294 {
9297 /* If it's an assignment-operator, we're using the second
9298 production. */
9299 enum tree_code assignment_operator
9302 {
9305 /* Parse the right-hand side of the assignment. */
9312 /* An assignment may not appear in a
9313 constant-expression. */
9315 NIC_ASSIGNMENT))
9317 /* Build the assignment expression. Its default
9318 location:
9319 LHS = RHS
9320 ~~~~^~~~~
9321 is the location of the '=' token as the
9322 caret, ranging from the start of the lhs to the
9323 end of the rhs. */
9328 assignment_operator,
9329 rhs,
9331 /* TODO: build_x_modify_expr doesn't honor the location,
9332 so we must set it here. */
9334 }
9335 }
9336 }
9339 }
9341 /* Parse an (optional) assignment-operator.
9343 assignment-operator: one of
9344 = *= /= %= += -= >>= <<= &= ^= |=
9346 GNU Extension:
9348 assignment-operator: one of
9349 <?= >?=
9351 If the next token is an assignment operator, the corresponding tree
9352 code is returned, and the token is consumed. For example, for
9353 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9354 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9355 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9356 operator, ERROR_MARK is returned. */
9358 static enum tree_code
9360 {
9364 /* Peek at the next token. */
9368 {
9414 /* Nothing else is an assignment operator. */
9416 }
9418 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9423 /* If it was an assignment operator, consume it. */
9428 }
9430 /* Parse an expression.
9432 expression:
9433 assignment-expression
9434 expression , assignment-expression
9436 CAST_P is true if this expression is the target of a cast.
9437 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9438 except possibly parenthesized or on the RHS of a comma (N3276).
9440 Returns a representation of the expression. */
9442 static cp_expr
9445 {
9450 {
9451 cp_expr assignment_expression;
9453 /* Parse the next assignment-expression. */
9454 assignment_expression
9457 /* We don't create a temporary for a call that is the immediate operand
9458 of decltype or on the RHS of a comma. But when we see a comma, we
9459 need to create a temporary for a call on the LHS. */
9464 assignment_expression
9468 /* If this is the first assignment-expression, we can just
9469 save it away. */
9472 else
9473 {
9474 /* Create a location with caret at the comma, ranging
9475 from the start of the LHS to the end of the RHS. */
9480 assignment_expression,
9483 }
9484 /* If the next token is not a comma, or we're in a fold-expression, then
9485 we are done with the expression. */
9489 /* Consume the `,'. */
9492 /* A comma operator cannot appear in a constant-expression. */
9495 }
9498 }
9500 /* Parse a constant-expression.
9502 constant-expression:
9503 conditional-expression
9505 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9506 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9507 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9508 is false, NON_CONSTANT_P should be NULL. */
9510 static cp_expr
9514 {
9518 cp_expr expression;
9520 /* It might seem that we could simply parse the
9521 conditional-expression, and then check to see if it were
9522 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9523 one that the compiler can figure out is constant, possibly after
9524 doing some simplifications or optimizations. The standard has a
9525 precise definition of constant-expression, and we must honor
9526 that, even though it is somewhat more restrictive.
9528 For example:
9530 int i[(2, 3)];
9532 is not a legal declaration, because `(2, 3)' is not a
9533 constant-expression. The `,' operator is forbidden in a
9534 constant-expression. However, GCC's constant-folding machinery
9535 will fold this operation to an INTEGER_CST for `3'. */
9537 /* Save the old settings. */
9539 saved_allow_non_integral_constant_expression_p
9542 /* We are now parsing a constant-expression. */
9544 parser->allow_non_integral_constant_expression_p
9547 /* Although the grammar says "conditional-expression", we parse an
9548 "assignment-expression", which also permits "throw-expression"
9549 and the use of assignment operators. In the case that
9550 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9551 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9552 actually essential that we look for an assignment-expression.
9553 For example, cp_parser_initializer_clauses uses this function to
9554 determine whether a particular assignment-expression is in fact
9555 constant. */
9557 /* Restore the old settings. */
9558 parser->integral_constant_expression_p
9560 parser->allow_non_integral_constant_expression_p
9563 {
9564 /* Require an rvalue constant expression here; that's what our
9565 callers expect. Reference constant expressions are handled
9566 separately in e.g. cp_parser_template_argument. */
9575 }
9578 parser->non_integral_constant_expression_p
9582 }
9584 /* Parse __builtin_offsetof.
9586 offsetof-expression:
9587 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9589 offsetof-member-designator:
9590 id-expression
9591 | offsetof-member-designator "." id-expression
9592 | offsetof-member-designator "[" expression "]"
9593 | offsetof-member-designator "->" id-expression */
9595 static cp_expr
9597 {
9599 tree type;
9600 cp_expr expr;
9601 cp_id_kind dummy;
9603 location_t finish_loc;
9605 /* We're about to accept non-integral-constant things, but will
9606 definitely yield an integral constant expression. Save and
9607 restore these values around our local parsing. */
9613 /* Consume the "__builtin_offsetof" token. */
9615 /* Consume the opening `('. */
9617 /* Parse the type-id. */
9620 /* Look for the `,'. */
9624 /* Build the (type *)null that begins the traditional offsetof macro. */
9625 tree object_ptr
9627 tf_warning_or_error);
9629 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9633 {
9636 {
9638 /* offsetof-member-designator "[" expression "]" */
9644 /* offsetof-member-designator "->" identifier */
9647 /* FALLTHRU */
9650 /* offsetof-member-designator "." identifier */
9658 /* Consume the ")" token. */
9664 /* Error. We know the following require will fail, but
9665 that gives the proper error message. */
9670 }
9671 }
9673 success:
9674 /* Make a location of the form:
9675 __builtin_offsetof (struct s, f)
9676 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9677 with caret at the type-id, ranging from the start of the
9678 "_builtin_offsetof" token to the close paren. */
9680 /* The result will be an INTEGER_CST, so we need to explicitly
9681 preserve the location. */
9684 failure:
9689 }
9691 /* Parse a trait expression.
9693 Returns a representation of the expression, the underlying type
9694 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9696 static tree
9698 {
9699 cp_trait_kind kind;
9705 {
9807 }
9809 /* Consume the token. */
9814 {
9817 }
9823 {
9826 {
9829 }
9833 }
9835 {
9837 {
9841 {
9844 }
9848 }
9849 }
9853 /* Complete the trait expression, which may mean either processing
9854 the trait expr now or saving it for template instantiation. */
9856 {
9865 }
9866 }
9868 /* Lambdas that appear in variable initializer or default argument scope
9869 get that in their mangling, so we need to record it. We might as well
9870 use the count for function and namespace scopes as well. */
9874 {
9875 tree t;
9877 };
9880 static void
9882 {
9883 tree_int ti;
9885 /* Once we're inside a function, we ignore other scopes and just push
9886 the function again so that popping works properly. */
9893 {
9894 /* Don't reset the count if we're still in the same function. */
9897 }
9898 }
9900 static void
9902 {
9905 }
9907 static void
9909 {
9912 {
9915 }
9917 }
9919 /* Parse a lambda expression.
9921 lambda-expression:
9922 lambda-introducer lambda-declarator [opt] compound-statement
9924 Returns a representation of the expression. */
9926 static cp_expr
9928 {
9930 tree type;
9938 {
9940 {
9944 }
9946 }
9948 {
9950 {
9953 }
9955 }
9957 /* We may be in the middle of deferred access check. Disable
9958 it now. */
9969 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9972 /* Now that we've started the type, add the capture fields for any
9973 explicit captures. */
9976 {
9977 /* Inside the class, surrounding template-parameter-lists do not apply. */
9978 unsigned int saved_num_template_parameter_lists
9982 bool fully_implicit_function_template_p
9986 bool auto_is_implicit_function_template_parm_p
9997 /* By virtue of defining a local class, a lambda expression has access to
9998 the private variables of enclosing classes. */
10006 {
10011 }
10013 {
10016 }
10018 /* The capture list was built up in reverse order; fix that now. */
10030 parser->fully_implicit_function_template_p
10034 parser->auto_is_implicit_function_template_parm_p
10036 }
10038 /* This field is only used during parsing of the lambda. */
10041 /* This lambda shouldn't have any proxies left at this point. */
10043 /* And now that we're done, push proxies for an enclosing lambda. */
10048 else
10056 }
10058 /* Parse the beginning of a lambda expression.
10060 lambda-introducer:
10061 [ lambda-capture [opt] ]
10063 LAMBDA_EXPR is the current representation of the lambda expression. */
10065 static void
10067 {
10068 /* Need commas after the first capture. */
10071 /* Eat the leading `['. */
10074 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10082 {
10085 }
10088 {
10090 tree capture_id;
10091 tree capture_init_expr;
10095 enum capture_kind_type
10096 {
10097 BY_COPY,
10098 BY_REFERENCE
10099 };
10103 {
10106 }
10110 else
10113 /* Possibly capture `this'. */
10115 {
10125 explicit_init_p);
10127 }
10129 /* Possibly capture `*this'. */
10132 {
10143 explicit_init_p);
10145 }
10147 /* Remember whether we want to capture as a reference or not. */
10149 {
10152 }
10154 /* Get the identifier. */
10159 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10160 delimiters, but I modified this to stop on unnested ']' as well. It
10161 was already changed to stop on unnested '}', so the
10162 "closing_parenthesis" name is no more misleading with my change. */
10163 {
10169 }
10171 /* Find the initializer for this capture. */
10175 {
10177 /* An explicit initializer exists. */
10180 "lambda capture initializers "
10186 {
10189 }
10190 }
10191 else
10192 {
10195 /* Turn the identifier into an id-expression. */
10196 capture_init_expr
10201 {
10204 }
10208 {
10211 capture_init_expr);
10215 }
10218 {
10221 capture_init_expr))
10225 }
10227 capture_init_expr
10228 = finish_id_expression
10230 capture_init_expr,
10244 {
10247 }
10248 else
10250 }
10254 {
10259 capture_id);
10263 "capture of %qD redundant with by-reference capture "
10265 }
10268 capture_id,
10269 capture_init_expr,
10271 explicit_init_p);
10272 }
10275 }
10277 /* Parse the (optional) middle of a lambda expression.
10279 lambda-declarator:
10280 < template-parameter-list [opt] >
10281 ( parameter-declaration-clause [opt] )
10282 attribute-specifier [opt]
10283 decl-specifier-seq [opt]
10284 exception-specification [opt]
10285 lambda-return-type-clause [opt]
10287 LAMBDA_EXPR is the current representation of the lambda expression. */
10289 static bool
10291 {
10292 /* 5.1.1.4 of the standard says:
10293 If a lambda-expression does not include a lambda-declarator, it is as if
10294 the lambda-declarator were ().
10295 This means an empty parameter list, no attributes, and no exception
10296 specification. */
10302 cp_decl_specifier_seq lambda_specs;
10305 /* The template-parameter-list is optional, but must begin with
10306 an opening angle if present. */
10308 {
10311 "lambda templates are only available with "
10313 else
10323 /* We just processed one more parameter list. */
10325 }
10327 /* The parameter-declaration-clause is optional (unless
10328 template-parameter-list was given), but must begin with an
10329 opening parenthesis if present. */
10331 {
10336 /* Parse parameters. */
10339 /* Default arguments shall not be specified in the
10340 parameter-declaration-clause of a lambda-declarator. */
10351 /* In the decl-specifier-seq of the lambda-declarator, each
10352 decl-specifier shall either be mutable or constexpr. */
10356 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10359 {
10364 }
10368 /* Parse optional exception specification. */
10371 /* Parse optional trailing return type. */
10373 {
10377 }
10379 /* The function parameters must be in scope all the way until after the
10380 trailing-return-type in case of decltype. */
10382 }
10386 /* Create the function call operator.
10388 Messing with declarators like this is no uglier than building up the
10389 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10390 other code. */
10391 {
10392 cp_decl_specifier_seq return_type_specs;
10394 tree fco;
10401 else
10402 /* Maybe we will deduce the return type later. */
10406 {
10410 else
10413 }
10418 sfk_none);
10423 VIRT_SPEC_UNSPECIFIED,
10424 REF_QUAL_NONE,
10425 tx_qual,
10426 exception_spec,
10432 declarator,
10433 attributes);
10435 {
10438 /* Give the object parameter a different name. */
10442 }
10444 {
10448 }
10457 }
10458 }
10460 /* Parse the body of a lambda expression, which is simply
10462 compound-statement
10464 but which requires special handling.
10465 LAMBDA_EXPR is the current representation of the lambda expression. */
10467 static void
10469 {
10474 else
10475 /* Still increment function_depth so that we don't GC in the
10476 middle of an expression. */
10480 /* Clear this in case we're in the middle of a default argument. */
10483 /* Finish the function call operator
10484 - class_specifier
10485 + late_parsing_for_member
10486 + function_definition_after_declarator
10487 + ctor_initializer_opt_and_function_body */
10488 {
10490 tree body;
10492 tree compound_stmt;
10493 tree cap;
10495 /* Let the front end know that we are going to be defining this
10496 function. */
10498 NULL_TREE,
10507 /* Push the proxies for any explicit captures. */
10514 /* 5.1.1.4 of the standard says:
10515 If a lambda-expression does not include a trailing-return-type, it
10516 is as if the trailing-return-type denotes the following type:
10517 * if the compound-statement is of the form
10518 { return attribute-specifier [opt] expression ; }
10519 the type of the returned expression after lvalue-to-rvalue
10520 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10521 (_conv.array_ 4.2), and function-to-pointer conversion
10522 (_conv.func_ 4.3);
10523 * otherwise, void. */
10525 /* In a lambda that has neither a lambda-return-type-clause
10526 nor a deducible form, errors should be reported for return statements
10527 in the body. Since we used void as the placeholder return type, parsing
10528 the body as usual will give such desired behavior. */
10532 {
10536 /* Parse tentatively in case there's more after the initial return
10537 statement. */
10548 {
10550 {
10555 }
10557 /* Will get error here if type not deduced yet. */
10561 }
10562 }
10565 {
10570 }
10574 out:
10578 /* Finish the function and generate code for it if necessary. */
10581 /* Only expand if the call op is not a template. */
10584 }
10590 else
10592 }
10594 /* Statements [gram.stmt.stmt] */
10596 /* Parse a statement.
10598 statement:
10599 labeled-statement
10600 expression-statement
10601 compound-statement
10602 selection-statement
10603 iteration-statement
10604 jump-statement
10605 declaration-statement
10606 try-block
10608 C++11:
10610 statement:
10611 labeled-statement
10612 attribute-specifier-seq (opt) expression-statement
10613 attribute-specifier-seq (opt) compound-statement
10614 attribute-specifier-seq (opt) selection-statement
10615 attribute-specifier-seq (opt) iteration-statement
10616 attribute-specifier-seq (opt) jump-statement
10617 declaration-statement
10618 attribute-specifier-seq (opt) try-block
10620 init-statement:
10621 expression-statement
10622 simple-declaration
10624 TM Extension:
10626 statement:
10627 atomic-statement
10629 IN_COMPOUND is true when the statement is nested inside a
10630 cp_parser_compound_statement; this matters for certain pragmas.
10632 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10633 is a (possibly labeled) if statement which is not enclosed in braces
10634 and has an else clause. This is used to implement -Wparentheses.
10636 CHAIN is a vector of if-else-if conditions. */
10638 static void
10642 {
10647 restart:
10650 /* There is no statement yet. */
10656 /* In obj-c++, seeing '[[' might be the either the beginning of
10657 c++11 attributes, or a nested objc-message-expression. So
10658 let's parse the c++11 attributes tentatively. */
10662 {
10665 }
10667 /* Peek at the next token. */
10669 /* Remember the location of the first token in the statement. */
10671 /* If this is a keyword, then that will often determine what kind of
10672 statement we have. */
10674 {
10678 {
10681 /* Looks like a labeled-statement with a case label.
10682 Parse the label, and then use tail recursion to parse
10683 the statement. */
10701 {
10706 }
10707 else
10721 {
10726 }
10727 else
10728 {
10732 }
10736 /* Objective-C++ exception-handling constructs. */
10750 /* This must be a namespace alias definition. */
10766 /* It might be a keyword like `int' that can start a
10767 declaration-statement. */
10769 }
10770 }
10772 {
10773 /* If the next token is a `:', then we are looking at a
10774 labeled-statement. */
10777 {
10778 /* Looks like a labeled-statement with an ordinary label.
10779 Parse the label, and then use tail recursion to parse
10780 the statement. */
10785 }
10786 }
10787 /* Anything that starts with a `{' must be a compound-statement. */
10790 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10791 a statement all its own. */
10793 {
10794 /* Only certain OpenMP pragmas are attached to statements, and thus
10795 are considered statements themselves. All others are not. In
10796 the context of a compound, accept the pragma as a "statement" and
10797 return so that we can check for a close brace. Otherwise we
10798 require a real statement and must go back and read one. */
10804 }
10806 {
10809 }
10811 /* Everything else must be a declaration-statement or an
10812 expression-statement. Try for the declaration-statement
10813 first, unless we are looking at a `;', in which case we know that
10814 we have an expression-statement. */
10816 {
10818 {
10820 {
10821 /* Attributes should be parsed as part of the the
10822 declaration, so let's un-parse them. */
10825 }
10828 /* Try to parse the declaration-statement. */
10830 /* If that worked, we're done. */
10833 }
10834 /* All preceding labels have been parsed at this point. */
10838 /* Look for an expression-statement instead. */
10841 /* Handle [[fallthrough]];. */
10843 {
10844 /* The next token after the fallthrough attribute is ';'. */
10846 {
10847 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10849 IFN_FALLTHROUGH,
10852 }
10853 else
10857 }
10858 }
10860 /* Set the line number for the statement. */
10864 /* Allow "[[fallthrough]];", but warn otherwise. */
10867 OPT_Wattributes,
10869 }
10871 /* Parse the label for a labeled-statement, i.e.
10873 identifier :
10874 case constant-expression :
10875 default :
10877 GNU Extension:
10878 case constant-expression ... constant-expression : statement
10880 When a label is parsed without errors, the label is added to the
10881 parse tree by the finish_* functions, so this function doesn't
10882 have to return the label. */
10884 static void
10886 {
10891 /* The next token should be an identifier. */
10895 {
10898 }
10900 /* Remember whether this case or a user-defined label is allowed to fall
10901 through to. */
10906 {
10908 {
10912 /* Consume the `case' token. */
10914 /* Parse the constant-expression. */
10921 {
10922 /* Consume the `...' token. */
10928 /* We don't need to emit warnings here, as the common code
10929 will do this for us. */
10930 }
10931 else
10935 {
10939 }
10940 else
10943 expr);
10944 }
10948 /* Consume the `default' token. */
10952 {
10956 }
10957 else
10962 /* Anything else must be an ordinary label. */
10967 }
10969 /* Require the `:' token. */
10972 /* An ordinary label may optionally be followed by attributes.
10973 However, this is only permitted if the attributes are then
10974 followed by a semicolon. This is because, for backward
10975 compatibility, when parsing
10976 lab: __attribute__ ((unused)) int i;
10977 we want the attribute to attach to "i", not "lab". */
10980 {
10981 tree attrs;
10988 ;
10989 else
10991 }
10997 }
10999 /* Parse an expression-statement.
11001 expression-statement:
11002 expression [opt] ;
11004 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11005 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11006 indicates whether this expression-statement is part of an
11007 expression statement. */
11009 static tree
11011 {
11016 /* There might be attribute fallthrough. */
11019 /* If the next token is a ';', then there is no expression
11020 statement. */
11022 {
11026 {
11029 }
11030 }
11032 /* Handle [[fallthrough]];. */
11034 {
11035 /* The next token after the fallthrough attribute is ';'. */
11037 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11040 else
11044 }
11046 /* Allow "[[fallthrough]];", but warn otherwise. */
11051 /* Give a helpful message for "A<T>::type t;" and the like. */
11054 {
11061 {
11062 /* A::A a; */
11067 }
11068 }
11070 /* Consume the final `;'. */
11075 /* This is the final expression statement of a statement
11076 expression. */
11082 }
11084 /* Parse a compound-statement.
11086 compound-statement:
11087 { statement-seq [opt] }
11089 GNU extension:
11091 compound-statement:
11092 { label-declaration-seq [opt] statement-seq [opt] }
11094 label-declaration-seq:
11095 label-declaration
11096 label-declaration-seq label-declaration
11098 Returns a tree representing the statement. */
11100 static tree
11103 {
11104 tree compound_stmt;
11106 /* Consume the `{'. */
11113 /* Begin the compound-statement. */
11115 /* If the next keyword is `__label__' we have a label declaration. */
11118 /* Parse an (optional) statement-seq. */
11120 /* Finish the compound-statement. */
11122 /* Consume the `}'. */
11126 }
11128 /* Parse an (optional) statement-seq.
11130 statement-seq:
11131 statement
11132 statement-seq [opt] statement */
11134 static void
11136 {
11137 /* Scan statements until there aren't any more. */
11139 {
11142 /* If we are looking at a `}', then we have run out of
11143 statements; the same is true if we have reached the end
11144 of file, or have stumbled upon a stray '@end'. */
11151 /* If we are in a compound statement and find 'else' then
11152 something went wrong. */
11154 {
11157 else
11158 {
11161 }
11162 }
11164 /* Parse the statement. */
11166 }
11167 }
11169 /* Return true if we're looking at (init; cond), false otherwise. */
11171 static bool
11173 {
11174 /* Save tokens so that we can put them back. */
11177 /* Look for ';' that is not nested in () or {}. */
11180 CPP_SEMICOLON,
11183 /* Roll back the tokens we skipped. */
11187 }
11189 /* Parse a selection-statement.
11191 selection-statement:
11192 if ( init-statement [opt] condition ) statement
11193 if ( init-statement [opt] condition ) statement else statement
11194 switch ( init-statement [opt] condition ) statement
11196 Returns the new IF_STMT or SWITCH_STMT.
11198 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11199 is a (possibly labeled) if statement which is not enclosed in
11200 braces and has an else clause. This is used to implement
11201 -Wparentheses.
11203 CHAIN is a vector of if-else-if conditions. This is used to implement
11204 -Wduplicated-cond. */
11206 static tree
11209 {
11212 token_indent_info guard_tinfo;
11217 /* Peek at the next token. */
11221 /* See what kind of keyword it is. */
11224 {
11227 {
11228 tree statement;
11229 tree condition;
11234 RID_CONSTEXPR))
11235 {
11241 }
11243 /* Look for the `('. */
11245 {
11248 }
11250 /* Begin the selection-statement. */
11252 {
11255 }
11256 else
11259 /* Parse the optional init-statement. */
11261 {
11262 tree decl;
11265 "init-statement in selection statements only available "
11268 }
11270 /* Parse the condition. */
11272 /* Look for the `)'. */
11278 {
11282 /* Add the condition. */
11289 /* Parse the then-clause. */
11293 /* Outside a template, the non-selected branch of a constexpr
11294 if is a 'discarded statement', i.e. unevaluated. */
11299 {
11302 }
11305 guard_tinfo);
11312 {
11316 }
11318 /* If the next token is `else', parse the else-clause. */
11320 RID_ELSE))
11321 {
11325 {
11328 }
11330 guard_tinfo
11332 /* Consume the `else' keyword. */
11335 {
11337 RID_IF)
11339 {
11340 /* We've got "if (COND) else if (COND2)". Start
11341 the condition chain and add COND as the first
11342 element. */
11346 {
11347 /* Wrap it in a NOP_EXPR so that we can set the
11348 location of the condition. */
11350 condition);
11353 }
11354 }
11356 RID_IF))
11357 {
11358 /* This is if-else without subsequent if. Zap the
11359 condition chain; we would have already warned at
11360 this point. */
11363 }
11364 }
11366 /* Parse the else-clause. */
11372 /* If we are currently parsing a then-clause, then
11373 IF_P will not be NULL. We set it to true to
11374 indicate that this if statement has an else clause.
11375 This may trigger the Wparentheses warning below
11376 when we get back up to the parent if statement. */
11381 {
11385 }
11386 }
11387 else
11388 {
11389 /* This if statement does not have an else clause. If
11390 NESTED_IF is true, then the then-clause has an if
11391 statement which does have an else clause. We warn
11392 about the potential ambiguity. */
11395 "suggest explicit braces to avoid ambiguous"
11398 {
11399 /* We don't need the condition chain anymore. */
11402 }
11403 }
11405 /* Now we're all done with the if-statement. */
11407 }
11408 else
11409 {
11413 /* Add the condition. */
11416 /* Parse the body of the switch-statement. */
11422 guard_tinfo);
11426 /* Now we're all done with the switch-statement. */
11428 }
11431 }
11437 }
11438 }
11440 /* Parse a condition.
11442 condition:
11443 expression
11444 type-specifier-seq declarator = initializer-clause
11445 type-specifier-seq declarator braced-init-list
11447 GNU Extension:
11449 condition:
11450 type-specifier-seq declarator asm-specification [opt]
11451 attributes [opt] = assignment-expression
11453 Returns the expression that should be tested. */
11455 static tree
11457 {
11458 cp_decl_specifier_seq type_specifiers;
11462 /* Try the declaration first. */
11464 /* New types are not allowed in the type-specifier-seq for a
11465 condition. */
11467 parser->type_definition_forbidden_message
11469 /* Parse the type-specifier-seq. */
11471 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11474 /* Restore the saved message. */
11476 /* If all is well, we might be looking at a declaration. */
11478 {
11479 tree decl;
11480 tree asm_specification;
11481 tree attributes;
11485 /* Parse the declarator. */
11491 /* Parse the attributes. */
11493 /* Parse the asm-specification. */
11495 /* If the next token is not an `=' or '{', then we might still be
11496 looking at an expression. For example:
11498 if (A(a).x)
11500 looks like a decl-specifier-seq and a declarator -- but then
11501 there is no `=', so this is an expression. */
11506 /* If we did see an `=' or '{', then we are looking at a declaration
11507 for sure. */
11509 {
11510 tree pushed_scope;
11514 /* Create the declaration. */
11520 /* Parse the initializer. */
11522 {
11526 }
11527 else
11528 {
11529 /* Consume the `='. */
11532 }
11536 /* Process the initializer. */
11539 asm_specification,
11540 flags);
11546 }
11547 }
11548 /* If we didn't even get past the declarator successfully, we are
11549 definitely not looking at a declaration. */
11550 else
11553 /* Otherwise, we are looking at an expression. */
11555 }
11557 /* Parses a for-statement or range-for-statement until the closing ')',
11558 not included. */
11560 static tree
11562 {
11566 /* Begin the for-statement. */
11569 /* Parse the initialization. */
11574 else
11576 }
11578 static tree
11580 {
11581 /* Normal for loop */
11584 tree stmt;
11587 /* The init-statement has already been parsed in
11588 cp_parser_init_statement, so no work is needed here. */
11591 /* If there's a condition, process it. */
11595 {
11599 }
11601 /* Look for the `;'. */
11604 /* If there's an expression, process it. */
11610 }
11612 /* Tries to parse a range-based for-statement:
11614 range-based-for:
11615 decl-specifier-seq declarator : expression
11617 The decl-specifier-seq declarator and the `:' are already parsed by
11618 cp_parser_init_statement. If processing_template_decl it returns a
11619 newly created RANGE_FOR_STMT; if not, it is converted to a
11620 regular FOR_STMT. */
11622 static tree
11625 {
11632 /* Get the range declaration momentarily out of the way so that
11633 the range expression doesn't clash with it. */
11635 {
11637 {
11639 /* For decomposition declaration get all of the corresponding
11640 declarations out of the way. */
11644 {
11650 {
11656 }
11657 }
11658 }
11660 {
11665 }
11666 }
11669 {
11672 }
11673 else
11676 /* Put the range declaration(s) back into scope. */
11678 {
11682 }
11684 /* If in template, STMT is converted to a normal for-statement
11685 at instantiation. If not, it is done just ahead. */
11687 {
11695 /* do_auto_deduction doesn't mess with template init-lists. */
11698 }
11699 else
11700 {
11704 }
11706 }
11708 /* Subroutine of cp_convert_range_for: given the initializer expression,
11709 builds up the range temporary. */
11711 static tree
11713 {
11716 /* Find out the type deduced by the declaration
11717 `auto &&__range = range_expr'. */
11722 /* Create the __range variable. */
11729 }
11731 /* Used by cp_parser_range_for in template context: we aren't going to
11732 do a full conversion yet, but we still need to resolve auto in the
11733 type of the for-range-declaration if present. This is basically
11734 a shortcut version of cp_convert_range_for. */
11736 static void
11738 {
11741 {
11744 iter_type = (cp_parser_perform_range_for_lookup
11747 {
11749 iter_type);
11751 tf_warning_or_error);
11754 }
11755 }
11756 }
11758 /* Converts a range-based for-statement into a normal
11759 for-statement, as per the definition.
11761 for (RANGE_DECL : RANGE_EXPR)
11762 BLOCK
11764 should be equivalent to:
11766 {
11767 auto &&__range = RANGE_EXPR;
11768 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11769 __begin != __end;
11770 ++__begin)
11771 {
11772 RANGE_DECL = *__begin;
11773 BLOCK
11774 }
11775 }
11777 If RANGE_EXPR is an array:
11778 BEGIN_EXPR = __range
11779 END_EXPR = __range + ARRAY_SIZE(__range)
11780 Else if RANGE_EXPR has a member 'begin' or 'end':
11781 BEGIN_EXPR = __range.begin()
11782 END_EXPR = __range.end()
11783 Else:
11784 BEGIN_EXPR = begin(__range)
11785 END_EXPR = end(__range);
11787 If __range has a member 'begin' but not 'end', or vice versa, we must
11788 still use the second alternative (it will surely fail, however).
11789 When calling begin()/end() in the third alternative we must use
11790 argument dependent lookup, but always considering 'std' as an associated
11791 namespace. */
11793 tree
11797 {
11803 /* If an error happened previously do nothing or else a lot of
11804 unhelpful errors would be issued. */
11806 else
11807 {
11808 tree range_temp;
11812 /* Can't bind a reference to an array of runtime bound. */
11814 else
11815 {
11820 LOOKUP_ONLYCONVERTING);
11822 }
11825 }
11827 /* The new for initialization statement. */
11835 LOOKUP_ONLYCONVERTING);
11846 LOOKUP_ONLYCONVERTING);
11850 /* The new for condition. */
11857 /* The new increment expression. */
11860 tf_warning_or_error);
11863 /* The declaration is initialized with *__begin inside the loop body. */
11866 tf_warning_or_error),
11868 LOOKUP_ONLYCONVERTING);
11873 }
11875 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11876 We need to solve both at the same time because the method used
11877 depends on the existence of members begin or end.
11878 Returns the type deduced for the iterator expression. */
11880 static tree
11882 {
11884 {
11887 }
11890 {
11895 }
11897 {
11898 /* If RANGE is an array, we will use pointer arithmetic. */
11901 range,
11905 }
11906 else
11907 {
11908 /* If it is not an array, we must do a bit of magic. */
11918 tf_warning_or_error);
11921 tf_warning_or_error);
11924 {
11925 /* Use the member functions. */
11928 else
11934 else
11937 }
11938 else
11939 {
11940 /* Use global functions with ADL. */
11947 tf_warning_or_error);
11949 tf_warning_or_error);
11951 tf_warning_or_error);
11953 tf_warning_or_error);
11956 }
11958 /* Last common checks. */
11960 {
11961 /* If one of the expressions is an error do no more checks. */
11964 }
11967 /* Can happen, when, eg, in a template context, Koenig lookup
11968 can't resolve begin/end (c++/58503). */
11970 else
11971 {
11973 /* The unqualified type of the __begin and __end temporaries should
11974 be the same, as required by the multiple auto declaration. */
11976 {
11983 /* P0184R0 allows __begin and __end to have different types,
11984 but make sure they are comparable so we can give a better
11986 else
11990 }
11992 }
11993 }
11994 }
11996 /* Helper function for cp_parser_perform_range_for_lookup.
11997 Builds a tree for RANGE.IDENTIFIER(). */
11999 static tree
12001 {
12014 tf_warning_or_error);
12017 }
12019 /* Parse an iteration-statement.
12021 iteration-statement:
12022 while ( condition ) statement
12023 do statement while ( expression ) ;
12024 for ( init-statement condition [opt] ; expression [opt] )
12025 statement
12027 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12029 static tree
12031 {
12034 tree statement;
12036 token_indent_info guard_tinfo;
12038 /* Peek at the next token. */
12045 /* Remember whether or not we are already within an iteration
12046 statement. */
12049 /* See what kind of keyword it is. */
12052 {
12054 {
12055 tree condition;
12057 /* Begin the while-statement. */
12059 /* Look for the `('. */
12061 /* Parse the condition. */
12064 /* Look for the `)'. */
12066 /* Parse the dependent statement. */
12070 /* We're done with the while-statement. */
12072 }
12076 {
12077 tree expression;
12079 /* Begin the do-statement. */
12081 /* Parse the body of the do-statement. */
12086 /* Look for the `while' keyword. */
12088 /* Look for the `('. */
12090 /* Parse the expression. */
12092 /* We're done with the do-statement. */
12094 /* Look for the `)'. */
12096 /* Look for the `;'. */
12098 }
12102 {
12103 /* Look for the `('. */
12108 /* Look for the `)'. */
12111 /* Parse the body of the for-statement. */
12116 /* We're done with the for-statement. */
12118 }
12125 }
12128 }
12130 /* Parse a init-statement or the declarator of a range-based-for.
12131 Returns true if a range-based-for declaration is seen.
12133 init-statement:
12134 expression-statement
12135 simple-declaration */
12137 static bool
12139 {
12140 /* If the next token is a `;', then we have an empty
12141 expression-statement. Grammatically, this is also a
12142 simple-declaration, but an invalid one, because it does not
12143 declare anything. Therefore, if we did not handle this case
12144 specially, we would issue an error message about an invalid
12145 declaration. */
12147 {
12151 /* A colon is used in range-based for. */
12154 /* We're going to speculatively look for a declaration, falling back
12155 to an expression, if necessary. */
12157 /* Parse the declaration. */
12160 decl);
12163 {
12164 /* It is a range-for, consume the ':' */
12168 {
12170 "range-based %<for%> loops only available with "
12173 }
12174 }
12175 else
12176 /* The ';' is not consumed yet because we told
12177 cp_parser_simple_declaration not to. */
12182 /* If the tentative parse failed, then we shall need to look for an
12183 expression-statement. */
12184 }
12185 /* If we are here, it is an expression-statement. */
12188 }
12190 /* Parse a jump-statement.
12192 jump-statement:
12193 break ;
12194 continue ;
12195 return expression [opt] ;
12196 return braced-init-list ;
12197 goto identifier ;
12199 GNU extension:
12201 jump-statement:
12202 goto * expression ;
12204 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12206 static tree
12208 {
12214 /* Peek at the next token. */
12219 /* See what kind of keyword it is. */
12222 {
12226 {
12246 }
12252 {
12259 /* Fall through. */
12269 }
12274 {
12275 tree expr;
12279 {
12283 }
12286 else
12287 /* If the next token is a `;', then there is no
12288 expression. */
12290 /* Build the return-statement. */
12293 else
12295 /* Look for the final `;'. */
12297 }
12303 {
12306 }
12308 /* Create the goto-statement. */
12310 {
12311 /* Issue a warning about this use of a GNU extension. */
12313 /* Consume the '*' token. */
12315 /* Parse the dependent expression. */
12317 }
12318 else
12320 /* Look for the final `;'. */
12327 }
12330 }
12332 /* Parse a declaration-statement.
12334 declaration-statement:
12335 block-declaration */
12337 static void
12339 {
12342 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12345 /* Parse the block-declaration. */
12348 /* Free any declarators allocated. */
12350 }
12352 /* Some dependent statements (like `if (cond) statement'), are
12353 implicitly in their own scope. In other words, if the statement is
12354 a single statement (as opposed to a compound-statement), it is
12355 none-the-less treated as if it were enclosed in braces. Any
12356 declarations appearing in the dependent statement are out of scope
12357 after control passes that point. This function parses a statement,
12358 but ensures that is in its own scope, even if it is not a
12359 compound-statement.
12361 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12362 is a (possibly labeled) if statement which is not enclosed in
12363 braces and has an else clause. This is used to implement
12364 -Wparentheses.
12366 CHAIN is a vector of if-else-if conditions. This is used to implement
12367 -Wduplicated-cond.
12369 Returns the new statement. */
12371 static tree
12375 {
12376 tree statement;
12379 token_indent_info body_tinfo
12385 /* Mark if () ; with a special NOP_EXPR. */
12387 {
12398 }
12399 /* if a compound is opened, we simply parse the statement directly. */
12402 /* If the token is not a `{', then we must take special action. */
12403 else
12404 {
12405 /* Create a compound-statement. */
12407 /* Parse the dependent-statement. */
12410 /* Finish the dummy compound-statement. */
12412 }
12414 token_indent_info next_tinfo
12423 /* Return the statement. */
12425 }
12427 /* For some dependent statements (like `while (cond) statement'), we
12428 have already created a scope. Therefore, even if the dependent
12429 statement is a compound-statement, we do not want to create another
12430 scope. */
12432 static void
12435 {
12436 /* If the token is a `{', then we must take special action. */
12438 {
12439 token_indent_info body_tinfo
12445 token_indent_info next_tinfo
12454 }
12455 else
12456 {
12457 /* Avoid calling cp_parser_compound_statement, so that we
12458 don't create a new scope. Do everything else by hand. */
12460 /* If the next keyword is `__label__' we have a label declaration. */
12463 /* Parse an (optional) statement-seq. */
12466 }
12467 }
12469 /* Declarations [gram.dcl.dcl] */
12471 /* Parse an optional declaration-sequence.
12473 declaration-seq:
12474 declaration
12475 declaration-seq declaration */
12477 static void
12479 {
12481 {
12492 {
12493 /* A declaration consisting of a single semicolon is
12494 invalid. Allow it unless we're being pedantic. */
12499 }
12501 /* If we're entering or exiting a region that's implicitly
12502 extern "C", modify the lang context appropriately. */
12504 {
12507 }
12509 {
12512 }
12515 {
12516 /* A top-level declaration can consist solely of a #pragma.
12517 A nested declaration cannot, so this is done here and not
12518 in cp_parser_declaration. (A #pragma at block scope is
12519 handled in cp_parser_statement.) */
12522 }
12524 /* Parse the declaration itself. */
12526 }
12527 }
12529 /* Parse a declaration.
12531 declaration:
12532 block-declaration
12533 function-definition
12534 template-declaration
12535 explicit-instantiation
12536 explicit-specialization
12537 linkage-specification
12538 namespace-definition
12540 C++17:
12541 deduction-guide
12543 GNU extension:
12545 declaration:
12546 __extension__ declaration */
12548 static void
12550 {
12551 cp_token token1;
12552 cp_token token2;
12557 /* Check for the `__extension__' keyword. */
12559 {
12560 /* Parse the qualified declaration. */
12562 /* Restore the PEDANTIC flag. */
12566 }
12568 /* Try to figure out what kind of declaration is present. */
12573 else
12574 {
12577 }
12579 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12582 /* If the next token is `extern' and the following token is a string
12583 literal, then we have a linkage specification. */
12587 /* If the next token is `template', then we have either a template
12588 declaration, an explicit instantiation, or an explicit
12589 specialization. */
12591 {
12592 /* `template <>' indicates a template specialization. */
12596 /* `template <' indicates a template declaration. */
12599 /* Anything else must be an explicit instantiation. */
12600 else
12602 }
12603 /* If the next token is `export', then we have a template
12604 declaration. */
12607 /* If the next token is `extern', 'static' or 'inline' and the one
12608 after that is `template', we have a GNU extended explicit
12609 instantiation directive. */
12616 /* If the next token is `namespace', check for a named or unnamed
12617 namespace definition. */
12626 /* An unnamed namespace definition. */
12630 /* An inline (associated) namespace definition. */
12634 /* Objective-C++ declaration/definition. */
12641 /* At this point we may have a template declared by a concept
12642 introduction. */
12647 else
12648 /* Try to parse a block-declaration, or a function-definition. */
12651 /* Free any declarators allocated. */
12653 }
12655 /* Parse a block-declaration.
12657 block-declaration:
12658 simple-declaration
12659 asm-definition
12660 namespace-alias-definition
12661 using-declaration
12662 using-directive
12664 GNU Extension:
12666 block-declaration:
12667 __extension__ block-declaration
12669 C++0x Extension:
12671 block-declaration:
12672 static_assert-declaration
12674 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12675 part of a declaration-statement. */
12677 static void
12680 {
12684 /* Check for the `__extension__' keyword. */
12686 {
12687 /* Parse the qualified declaration. */
12689 /* Restore the PEDANTIC flag. */
12693 }
12695 /* Peek at the next token to figure out which kind of declaration is
12696 present. */
12699 /* If the next keyword is `asm', we have an asm-definition. */
12701 {
12705 }
12706 /* If the next keyword is `namespace', we have a
12707 namespace-alias-definition. */
12710 /* If the next keyword is `using', we have a
12711 using-declaration, a using-directive, or an alias-declaration. */
12713 {
12718 /* If the token after `using' is `namespace', then we have a
12719 using-directive. */
12723 /* If the second token after 'using' is '=', then we have an
12724 alias-declaration. */
12730 /* Otherwise, it's a using-declaration. */
12731 else
12734 }
12735 /* If the next keyword is `__label__' we have a misplaced label
12736 declaration. */
12738 {
12742 /* If the next token is now a `;', consume it. */
12745 }
12746 /* If the next token is `static_assert' we have a static assertion. */
12749 /* Anything else must be a simple-declaration. */
12750 else
12753 }
12755 /* Parse a simple-declaration.
12757 simple-declaration:
12758 decl-specifier-seq [opt] init-declarator-list [opt] ;
12759 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12760 brace-or-equal-initializer ;
12762 init-declarator-list:
12763 init-declarator
12764 init-declarator-list , init-declarator
12766 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12767 function-definition as a simple-declaration.
12769 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12770 parsed declaration if it is an uninitialized single declarator not followed
12771 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12772 if present, will not be consumed. */
12774 static void
12778 {
12779 cp_decl_specifier_seq decl_specifiers;
12788 /* Defer access checks until we know what is being declared; the
12789 checks for names appearing in the decl-specifier-seq should be
12790 done as if we were in the scope of the thing being declared. */
12793 /* Parse the decl-specifier-seq. We have to keep track of whether
12794 or not the decl-specifier-seq declares a named class or
12795 enumeration type, since that is the only case in which the
12796 init-declarator-list is allowed to be empty.
12798 [dcl.dcl]
12800 In a simple-declaration, the optional init-declarator-list can be
12801 omitted only when declaring a class or enumeration, that is when
12802 the decl-specifier-seq contains either a class-specifier, an
12803 elaborated-type-specifier, or an enum-specifier. */
12805 CP_PARSER_FLAGS_OPTIONAL,
12808 /* We no longer need to defer access checks. */
12811 /* In a block scope, a valid declaration must always have a
12812 decl-specifier-seq. By not trying to parse declarators, we can
12813 resolve the declaration/expression ambiguity more quickly. */
12816 {
12819 }
12821 /* If the next two tokens are both identifiers, the code is
12822 erroneous. The usual cause of this situation is code like:
12824 T t;
12826 where "T" should name a type -- but does not. */
12829 {
12830 /* If parsing tentatively, we should commit; we really are
12831 looking at a declaration. */
12833 /* Give up. */
12835 }
12837 /* If we have seen at least one decl-specifier, and the next token
12838 is not a parenthesis, then we must be looking at a declaration.
12839 (After "int (" we might be looking at a functional cast.) */
12846 /* Look for C++17 decomposition declaration. */
12854 {
12855 tree decl
12857 maybe_range_for_decl,
12860 /* The next token should be either a `,' or a `;'. */
12862 /* If it's a `;', we are done. */
12865 /* Anything else is an error. */
12866 else
12867 {
12868 /* If we have already issued an error message we don't need
12869 to issue another one. */
12874 /* Skip tokens until we reach the end of the statement. */
12876 /* If the next token is now a `;', consume it. */
12880 }
12881 }
12882 else
12885 tree last_type;
12887 /* NULL_TREE if both variable and function declaration are allowed,
12888 error_mark_node if function declaration are not allowed and
12889 a FUNCTION_DECL that should be diagnosed if it is followed by
12890 variable declarations. */
12891 tree auto_function_declaration;
12894 auto_specifier_p
12898 /* Keep going until we hit the `;' at the end of the simple
12899 declaration. */
12902 CPP_SEMICOLON))
12903 {
12906 tree decl;
12910 {
12911 /* If we are processing next declarator, comma is expected */
12916 {
12920 }
12921 }
12922 else
12925 /* Parse the init-declarator. */
12928 function_definition_allowed_p,
12930 declares_class_or_enum,
12932 maybe_range_for_decl,
12935 /* If an error occurred while parsing tentatively, exit quickly.
12936 (That usually happens when in the body of a function; each
12937 statement is treated as a declaration-statement until proven
12938 otherwise.) */
12943 {
12944 /* If the init-declarator-list contains more than one
12945 init-declarator, they shall all form declarations of
12946 variables. */
12948 auto_function_declaration
12952 {
12954 "non-variable %qD in declaration with more than one "
12959 }
12960 }
12964 {
12968 {
12969 /* If the list of declarators contains more than one declarator,
12970 the type of each declared variable is determined as described
12971 above. If the type deduced for the template parameter U is not
12972 the same in each deduction, the program is ill-formed. */
12977 }
12978 else
12980 }
12982 /* Handle function definitions specially. */
12984 {
12985 /* If the next token is a `,', then we are probably
12986 processing something like:
12988 void f() {}, *p;
12990 which is erroneous. */
12992 {
12995 "mixing"
12997 }
12998 /* Otherwise, we're done with the list of declarators. */
12999 else
13000 {
13003 }
13004 }
13007 /* The next token should be either a `,' or a `;'. */
13009 /* If it's a `,', there are more declarators to come. */
13012 /* If it's a `;', we are done. */
13016 {
13021 }
13022 /* Anything else is an error. */
13023 else
13024 {
13025 /* If we have already issued an error message we don't need
13026 to issue another one. */
13031 /* Skip tokens until we reach the end of the statement. */
13033 /* If the next token is now a `;', consume it. */
13037 }
13038 /* After the first time around, a function-definition is not
13039 allowed -- even if it was OK at first. For example:
13041 int i, f() {}
13043 is not valid. */
13045 }
13047 /* Issue an error message if no declarators are present, and the
13048 decl-specifier-seq does not itself declare a class or
13049 enumeration: [dcl.dcl]/3. */
13051 {
13053 {
13057 /* Ensure an error is issued anyway when finish_decltype_type,
13058 called via cp_parser_decl_specifier_seq, returns a class or
13059 an enumeration (c++/51786). */
13062 }
13063 /* Perform any deferred access checks. */
13065 }
13067 /* Consume the `;'. */
13068 finish:
13072 {
13078 }
13080 done:
13082 }
13084 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13085 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13086 initializer ; */
13088 static tree
13093 {
13098 /* Parse the identifier-list. */
13102 {
13110 }
13114 {
13120 else
13121 {
13124 }
13125 }
13131 tree pushed_scope;
13138 NULL_TREE);
13145 cp_expr e;
13146 cp_decl_specifier_seq decl_specs;
13151 {
13154 else
13157 tree elt_pushed_scope;
13163 {
13164 /* Ensure we've diagnosed redeclaration if we aren't creating
13165 a new VAR_DECL. */
13168 }
13169 else
13173 }
13176 {
13179 }
13183 {
13190 {
13194 }
13195 }
13197 {
13199 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13200 the underlying DECL. */
13202 }
13208 {
13211 }
13214 }
13216 /* Parse a decl-specifier-seq.
13218 decl-specifier-seq:
13219 decl-specifier-seq [opt] decl-specifier
13220 decl-specifier attribute-specifier-seq [opt] (C++11)
13222 decl-specifier:
13223 storage-class-specifier
13224 type-specifier
13225 function-specifier
13226 friend
13227 typedef
13229 GNU Extension:
13231 decl-specifier:
13232 attributes
13234 Concepts Extension:
13236 decl-specifier:
13237 concept
13239 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13241 The parser flags FLAGS is used to control type-specifier parsing.
13243 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13244 flags:
13246 1: one of the decl-specifiers is an elaborated-type-specifier
13247 (i.e., a type declaration)
13248 2: one of the decl-specifiers is an enum-specifier or a
13249 class-specifier (i.e., a type definition)
13251 */
13253 static void
13255 cp_parser_flags flags,
13258 {
13262 cp_decl_spec ds;
13264 /* Clear DECL_SPECS. */
13267 /* Assume no class or enumeration type is declared. */
13270 /* Keep reading specifiers until there are no more to read. */
13272 {
13277 /* Peek at the next token. */
13280 /* Save the first token of the decl spec list for error
13281 reporting. */
13284 /* Handle attributes. */
13286 {
13287 /* Parse the attributes. */
13290 /* In a sequence of declaration specifiers, c++11 attributes
13291 appertain to the type that precede them. In that case
13292 [dcl.spec]/1 says:
13294 The attribute-specifier-seq affects the type only for
13295 the declaration it appears in, not other declarations
13296 involving the same type.
13298 But for now let's force the user to position the
13299 attribute either at the beginning of the declaration or
13300 after the declarator-id, which would clearly mean that it
13301 applies to the declarator. */
13303 {
13305 /* The c++11 attribute is at the beginning of the
13306 declaration. It appertains to the entity being
13308 else
13309 {
13311 {
13312 /* This is an attribute following a
13313 class-specifier. */
13318 }
13319 else
13320 {
13321 decl_specs->std_attributes
13323 attrs);
13326 }
13328 }
13329 }
13331 decl_specs->attributes
13333 attrs);
13337 }
13338 /* Assume we will find a decl-specifier keyword. */
13340 /* If the next token is an appropriate keyword, we can simply
13341 add it to the list. */
13343 {
13344 /* decl-specifier:
13345 friend
13346 constexpr */
13349 {
13352 }
13353 else
13354 {
13356 /* Consume the token. */
13358 }
13371 /* function-specifier:
13372 inline
13373 virtual
13374 explicit */
13381 /* decl-specifier:
13382 typedef */
13385 /* Consume the token. */
13387 /* A constructor declarator cannot appear in a typedef. */
13389 /* The "typedef" keyword can only occur in a declaration; we
13390 may as well commit at this point. */
13397 /* storage-class-specifier:
13398 auto
13399 register
13400 static
13401 extern
13402 mutable
13404 GNU Extension:
13405 thread */
13408 {
13409 /* Consume the token. */
13412 /* Complain about `auto' as a storage specifier, if
13413 we're complaining about C++0x compatibility. */
13417 /* Set the storage class anyway. */
13419 token);
13420 }
13421 else
13422 /* C++0x auto type-specifier. */
13430 /* Consume the token. */
13433 token);
13436 /* Consume the token. */
13442 /* We did not yet find a decl-specifier yet. */
13445 }
13462 /* Constructors are a special case. The `S' in `S()' is not a
13463 decl-specifier; it is the beginning of the declarator. */
13464 constructor_p
13465 = (!found_decl_spec
13466 && constructor_possible_p
13467 && (cp_parser_constructor_declarator_p
13470 /* If we don't have a DECL_SPEC yet, then we must be looking at
13471 a type-specifier. */
13473 {
13476 tree type_spec;
13478 type_spec
13480 decl_specs,
13486 /* If this type-specifier referenced a user-defined type
13487 (a typedef, class-name, etc.), then we can't allow any
13488 more such type-specifiers henceforth.
13490 [dcl.spec]
13492 The longest sequence of decl-specifiers that could
13493 possibly be a type name is taken as the
13494 decl-specifier-seq of a declaration. The sequence shall
13495 be self-consistent as described below.
13497 [dcl.type]
13499 As a general rule, at most one type-specifier is allowed
13500 in the complete decl-specifier-seq of a declaration. The
13501 only exceptions are the following:
13503 -- const or volatile can be combined with any other
13504 type-specifier.
13506 -- signed or unsigned can be combined with char, long,
13507 short, or int.
13509 -- ..
13511 Example:
13513 typedef char* Pc;
13514 void g (const int Pc);
13516 Here, Pc is *not* part of the decl-specifier seq; it's
13517 the declarator. Therefore, once we see a type-specifier
13518 (other than a cv-qualifier), we forbid any additional
13519 user-defined types. We *do* still allow things like `int
13520 int' to be considered a decl-specifier-seq, and issue the
13521 error message later. */
13524 /* A constructor declarator cannot follow a type-specifier. */
13526 {
13531 }
13532 }
13534 /* If we still do not have a DECL_SPEC, then there are no more
13535 decl-specifiers. */
13540 /* After we see one decl-specifier, further decl-specifiers are
13541 always optional. */
13543 }
13545 /* Don't allow a friend specifier with a class definition. */
13550 }
13552 /* Parse an (optional) storage-class-specifier.
13554 storage-class-specifier:
13555 auto
13556 register
13557 static
13558 extern
13559 mutable
13561 GNU Extension:
13563 storage-class-specifier:
13564 thread
13566 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13568 static tree
13570 {
13572 {
13576 /* Fall through for C++98. */
13584 /* Consume the token. */
13589 }
13590 }
13592 /* Parse an (optional) function-specifier.
13594 function-specifier:
13595 inline
13596 virtual
13597 explicit
13599 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13600 Updates DECL_SPECS, if it is non-NULL. */
13602 static tree
13605 {
13608 {
13614 /* 14.5.2.3 [temp.mem]
13616 A member function template shall not be virtual. */
13620 else
13630 }
13632 /* Consume the token. */
13634 }
13636 /* Parse a linkage-specification.
13638 linkage-specification:
13639 extern string-literal { declaration-seq [opt] }
13640 extern string-literal declaration */
13642 static void
13644 {
13645 tree linkage;
13647 /* Look for the `extern' keyword. */
13650 /* Look for the string-literal. */
13653 /* Transform the literal into an identifier. If the literal is a
13654 wide-character string, or contains embedded NULs, then we can't
13655 handle it as the user wants. */
13658 {
13660 /* Assume C++ linkage. */
13662 }
13663 else
13666 /* We're now using the new linkage. */
13669 /* If the next token is a `{', then we're using the first
13670 production. */
13672 {
13676 /* Consume the `{' token. */
13678 /* Parse the declarations. */
13680 /* Look for the closing `}'. */
13682 }
13683 /* Otherwise, there's just one declaration. */
13684 else
13685 {
13688 saved_in_unbraced_linkage_specification_p
13692 parser->in_unbraced_linkage_specification_p
13694 }
13696 /* We're done with the linkage-specification. */
13698 }
13700 /* Parse a static_assert-declaration.
13702 static_assert-declaration:
13703 static_assert ( constant-expression , string-literal ) ;
13704 static_assert ( constant-expression ) ; (C++1Z)
13706 If MEMBER_P, this static_assert is a class member. */
13708 static void
13710 {
13711 tree condition;
13712 tree message;
13714 location_t saved_loc;
13717 /* Peek at the `static_assert' token so we can keep track of exactly
13718 where the static assertion started. */
13722 /* Look for the `static_assert' keyword. */
13724 RT_STATIC_ASSERT))
13727 /* We know we are in a static assertion; commit to any tentative
13728 parse. */
13732 /* Parse the `(' starting the static assertion condition. */
13735 /* Parse the constant-expression. Allow a non-constant expression
13736 here in order to give better diagnostics in finish_static_assert. */
13737 condition =
13743 {
13746 "static_assert without a message "
13748 /* Eat the ')' */
13753 }
13754 else
13755 {
13756 /* Parse the separating `,'. */
13759 /* Parse the string-literal message. */
13764 /* A `)' completes the static assertion. */
13770 }
13772 /* A semicolon terminates the declaration. */
13775 /* Complete the static assertion, which may mean either processing
13776 the static assert now or saving it for template instantiation. */
13778 }
13780 /* Parse the expression in decltype ( expression ). */
13782 static tree
13785 {
13787 tree expr;
13789 /* Since we're going to preserve any side-effects from this parse, set up a
13790 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13791 in the expression. */
13794 /* First, try parsing an id-expression. */
13805 {
13808 cp_id_kind idk;
13812 /* Lookup the name we got back from the id-expression. */
13822 {
13823 /* Complete lookup of the id-expression. */
13824 expr = (finish_id_expression
13837 /* We found an id-expression, but it was something that we
13838 should not have found. This is an error, not something
13839 we can recover from, so note that we found an
13840 id-expression and we'll recover as gracefully as
13841 possible. */
13843 }
13848 /* We have an id-expression. */
13850 }
13853 {
13854 /* Abort the id-expression parse. */
13857 /* Parsing tentatively, again. */
13860 /* Parse a class member access. */
13868 /* We have an id-expression. */
13870 }
13873 /* We have parsed the complete id-expression or member access. */
13875 else
13876 {
13877 /* Abort our attempt to parse an id-expression or member access
13878 expression. */
13881 /* Parse a full expression. */
13884 }
13887 }
13889 /* Parse a `decltype' type. Returns the type.
13891 simple-type-specifier:
13892 decltype ( expression )
13893 C++14 proposal:
13894 decltype ( auto ) */
13896 static tree
13898 {
13899 tree expr;
13908 {
13909 /* Already parsed. */
13912 }
13914 /* Look for the `decltype' token. */
13918 /* Parse the opening `('. */
13922 /* decltype (auto) */
13925 {
13932 }
13934 /* Types cannot be defined in a `decltype' expression. Save away the
13935 old message. */
13938 /* And create the new one. */
13939 parser->type_definition_forbidden_message
13942 /* The restrictions on constant-expressions do not apply inside
13943 decltype expressions. */
13944 saved_integral_constant_expression_p
13946 saved_non_integral_constant_expression_p
13950 /* Within a parenthesized expression, a `>' token is always
13951 the greater-than operator. */
13952 saved_greater_than_is_operator_p
13956 /* Do not actually evaluate the expression. */
13959 /* Do not warn about problems with the expression. */
13964 /* Go back to evaluating expressions. */
13968 /* The `>' token might be the end of a template-id or
13969 template-parameter-list now. */
13970 parser->greater_than_is_operator_p
13973 /* Restore the old message and the integral constant expression
13974 flags. */
13976 parser->integral_constant_expression_p
13978 parser->non_integral_constant_expression_p
13981 /* Parse to the closing `)'. */
13983 {
13987 }
13990 tf_warning_or_error);
13992 rewrite:
13993 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13994 it again. */
14003 }
14005 /* Special member functions [gram.special] */
14007 /* Parse a conversion-function-id.
14009 conversion-function-id:
14010 operator conversion-type-id
14012 Returns an IDENTIFIER_NODE representing the operator. */
14014 static tree
14016 {
14017 tree type;
14018 tree saved_scope;
14019 tree saved_qualifying_scope;
14020 tree saved_object_scope;
14023 /* Look for the `operator' token. */
14026 /* When we parse the conversion-type-id, the current scope will be
14027 reset. However, we need that information in able to look up the
14028 conversion function later, so we save it here. */
14032 /* We must enter the scope of the class so that the names of
14033 entities declared within the class are available in the
14034 conversion-type-id. For example, consider:
14036 struct S {
14037 typedef int I;
14038 operator I();
14039 };
14041 S::operator I() { ... }
14043 In order to see that `I' is a type-name in the definition, we
14044 must be in the scope of `S'. */
14047 /* Parse the conversion-type-id. */
14049 /* Leave the scope of the class, if any. */
14052 /* Restore the saved scope. */
14056 /* If the TYPE is invalid, indicate failure. */
14060 }
14062 /* Parse a conversion-type-id:
14064 conversion-type-id:
14065 type-specifier-seq conversion-declarator [opt]
14067 Returns the TYPE specified. */
14069 static tree
14071 {
14072 tree attributes;
14073 cp_decl_specifier_seq type_specifiers;
14075 tree type_specified;
14078 /* Parse the attributes. */
14082 parser->type_definition_forbidden_message
14085 /* Parse the type-specifiers. */
14092 /* If that didn't work, stop. */
14095 /* Parse the conversion-declarator. */
14103 /* Don't give this error when parsing tentatively. This happens to
14104 work because we always parse this definitively once. */
14107 {
14109 {
14112 }
14116 }
14119 }
14121 /* Parse an (optional) conversion-declarator.
14123 conversion-declarator:
14124 ptr-operator conversion-declarator [opt]
14126 */
14130 {
14133 cp_cv_quals cv_quals;
14135 /* We don't know if there's a ptr-operator next, or not. */
14137 /* Try the ptr-operator. */
14140 /* If it worked, look for more conversion-declarators. */
14142 {
14145 /* Parse another optional declarator. */
14148 declarator = cp_parser_make_indirect_declarator
14152 }
14155 }
14157 /* Parse an (optional) ctor-initializer.
14159 ctor-initializer:
14160 : mem-initializer-list
14162 Returns TRUE iff the ctor-initializer was actually present. */
14164 static bool
14166 {
14167 /* If the next token is not a `:', then there is no
14168 ctor-initializer. */
14170 {
14171 /* Do default initialization of any bases and members. */
14176 }
14178 /* Consume the `:' token. */
14180 /* And the mem-initializer-list. */
14184 }
14186 /* Parse a mem-initializer-list.
14188 mem-initializer-list:
14189 mem-initializer ... [opt]
14190 mem-initializer ... [opt] , mem-initializer-list */
14192 static void
14194 {
14199 /* Let the semantic analysis code know that we are starting the
14200 mem-initializer-list. */
14205 /* Loop through the list. */
14207 {
14208 tree mem_initializer;
14211 /* Parse the mem-initializer. */
14213 /* If the next token is a `...', we're expanding member initializers. */
14215 {
14216 /* Consume the `...'. */
14219 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14220 can be expanded but members cannot. */
14223 {
14228 }
14230 /* Construct the pack expansion type. */
14233 }
14236 {
14240 }
14241 /* Look for a target constructor. */
14245 {
14248 {
14252 }
14254 }
14255 /* Add it to the list, unless it was erroneous. */
14257 {
14260 }
14261 /* If the next token is not a `,', we're done. */
14264 /* Consume the `,' token. */
14266 }
14268 /* Perform semantic analysis. */
14271 }
14273 /* Parse a mem-initializer.
14275 mem-initializer:
14276 mem-initializer-id ( expression-list [opt] )
14277 mem-initializer-id braced-init-list
14279 GNU extension:
14281 mem-initializer:
14282 ( expression-list [opt] )
14284 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14285 class) or FIELD_DECL (for a non-static data member) to initialize;
14286 the TREE_VALUE is the expression-list. An empty initialization
14287 list is represented by void_list_node. */
14289 static tree
14291 {
14292 tree mem_initializer_id;
14293 tree expression_list;
14294 tree member;
14297 /* Find out what is being initialized. */
14299 {
14303 }
14304 else
14305 {
14309 }
14315 {
14322 }
14323 else
14324 {
14334 }
14344 }
14346 /* Parse a mem-initializer-id.
14348 mem-initializer-id:
14349 :: [opt] nested-name-specifier [opt] class-name
14350 decltype-specifier (C++11)
14351 identifier
14353 Returns a TYPE indicating the class to be initialized for the first
14354 production (and the second in C++11). Returns an IDENTIFIER_NODE
14355 indicating the data member to be initialized for the last production. */
14357 static tree
14359 {
14363 tree id;
14367 /* `typename' is not allowed in this context ([temp.res]). */
14369 {
14371 "keyword %<typename%> not allowed in this context (a qualified "
14374 }
14375 /* Look for the optional `::' operator. */
14376 global_scope_p
14380 /* Look for the optional nested-name-specifier. The simplest way to
14381 implement:
14383 [temp.res]
14385 The keyword `typename' is not permitted in a base-specifier or
14386 mem-initializer; in these contexts a qualified name that
14387 depends on a template-parameter is implicitly assumed to be a
14388 type name.
14390 is to assume that we have seen the `typename' keyword at this
14391 point. */
14392 nested_name_specifier_p
14401 /* If there is a `::' operator or a nested-name-specifier, then we
14402 are definitely looking for a class-name. */
14407 typename_type,
14411 /* Otherwise, we could also be looking for an ordinary identifier. */
14414 /* Try a decltype-specifier. */
14416 else
14417 /* Otherwise, try a class-name. */
14421 none_type,
14425 /* If we found one, we're done. */
14428 /* Otherwise, look for an ordinary identifier. */
14430 }
14432 /* Overloading [gram.over] */
14434 /* Parse an operator-function-id.
14436 operator-function-id:
14437 operator operator
14439 Returns an IDENTIFIER_NODE for the operator which is a
14440 human-readable spelling of the identifier, e.g., `operator +'. */
14442 static cp_expr
14444 {
14445 /* Look for the `operator' keyword. */
14448 /* And then the name of the operator itself. */
14450 }
14452 /* Return an identifier node for a user-defined literal operator.
14453 The suffix identifier is chained to the operator name identifier. */
14455 tree
14457 {
14458 tree identifier;
14465 }
14467 /* Parse an operator.
14469 operator:
14470 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14471 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14472 || ++ -- , ->* -> () []
14474 GNU Extensions:
14476 operator:
14477 <? >? <?= >?=
14479 Returns an IDENTIFIER_NODE for the operator which is a
14480 human-readable spelling of the identifier, e.g., `operator +'. */
14482 static cp_expr
14484 {
14489 /* Peek at the next token. */
14494 /* Figure out which operator we have. */
14496 {
14498 {
14501 /* The keyword should be either `new' or `delete'. */
14506 else
14509 /* Consume the `new' or `delete' token. */
14512 /* Peek at the next token. */
14514 /* If it's a `[' token then this is the array variant of the
14515 operator. */
14517 {
14518 /* Consume the `[' token. */
14520 /* Look for the `]' token. */
14526 }
14527 /* Otherwise, we have the non-array variant. */
14528 else
14534 }
14681 /* Consume the `('. */
14683 /* Look for the matching `)'. */
14688 /* Consume the `['. */
14690 /* Look for the matching `]'. */
14697 /* FALLTHRU */
14706 {
14713 /* Consume the string. */
14719 {
14722 }
14723 else
14724 {
14726 /* Look for the suffix identifier. */
14731 {
14735 }
14736 else
14737 {
14740 }
14741 }
14746 {
14749 }
14752 {
14755 }
14757 {
14760 }
14762 }
14765 /* Anything else is an error. */
14767 }
14769 /* If we have selected an identifier, we need to consume the
14770 operator token. */
14773 /* Otherwise, no valid operator name was present. */
14774 else
14775 {
14778 }
14781 }
14783 /* Parse a template-declaration.
14785 template-declaration:
14786 export [opt] template < template-parameter-list > declaration
14788 If MEMBER_P is TRUE, this template-declaration occurs within a
14789 class-specifier.
14791 The grammar rule given by the standard isn't correct. What
14792 is really meant is:
14794 template-declaration:
14795 export [opt] template-parameter-list-seq
14796 decl-specifier-seq [opt] init-declarator [opt] ;
14797 export [opt] template-parameter-list-seq
14798 function-definition
14800 template-parameter-list-seq:
14801 template-parameter-list-seq [opt]
14802 template < template-parameter-list >
14804 Concept Extensions:
14806 template-parameter-list-seq:
14807 template < template-parameter-list > requires-clause [opt]
14809 requires-clause:
14810 requires logical-or-expression */
14812 static void
14814 {
14815 /* Check for `export'. */
14817 {
14818 /* Consume the `export' token. */
14820 /* Warn that we do not support `export'. */
14822 }
14825 }
14827 /* Parse a template-parameter-list.
14829 template-parameter-list:
14830 template-parameter
14831 template-parameter-list , template-parameter
14833 Returns a TREE_LIST. Each node represents a template parameter.
14834 The nodes are connected via their TREE_CHAINs. */
14836 static tree
14838 {
14843 /* The loop below parses the template parms. We first need to know
14844 the total number of template parms to be able to compute proper
14845 canonical types of each dependent type. So after the loop, when
14846 we know the total number of template parms,
14847 end_template_parm_list computes the proper canonical types and
14848 fixes up the dependent types accordingly. */
14850 {
14851 tree parameter;
14854 location_t parm_loc;
14856 /* Parse the template-parameter. */
14861 /* Add it to the list. */
14864 parm_loc,
14865 parameter,
14866 is_non_type,
14867 is_parameter_pack);
14868 else
14869 {
14872 }
14874 /* If the next token is not a `,', we're done. */
14877 /* Otherwise, consume the `,' token. */
14879 }
14882 }
14884 /* Parse a introduction-list.
14886 introduction-list:
14887 introduced-parameter
14888 introduction-list , introduced-parameter
14890 introduced-parameter:
14891 ...[opt] identifier
14893 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14894 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14895 WILDCARD_DECL will also have DECL_NAME set and token location in
14896 DECL_SOURCE_LOCATION. */
14898 static tree
14900 {
14904 {
14909 /* Build placeholder. */
14917 /* If the next token is not a `,', we're done. */
14920 /* Otherwise, consume the `,' token. */
14922 }
14924 /* Convert the vec into a TREE_VEC. */
14927 tree parm;
14933 }
14935 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14936 is an abstract declarator. */
14940 {
14945 }
14947 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14948 is an abstract declarator. */
14952 {
14956 else
14958 }
14960 /* Returns true if DECL represents a constrained-parameter. */
14964 {
14969 }
14971 /* Returns true if PARM declares a constrained-parameter. */
14975 {
14977 }
14979 /* Check that the type parameter is only a declarator-id, and that its
14980 type is not cv-qualified. */
14982 bool
14985 {
14990 {
14993 }
14995 /* Don't allow cv-qualified type parameters. */
14998 {
15001 }
15004 }
15006 /* Finish parsing/processing a template type parameter and checking
15007 various restrictions. */
15011 tree id,
15013 {
15016 else
15018 }
15020 static tree
15022 {
15023 /* FIXME: This should probably be copied, and we may need to adjust
15024 the template parameter depths. */
15034 }
15036 /* Finish parsing/processing a template template parameter by borrowing
15037 the template parameter list from the prototype parameter. */
15039 static tree
15041 tree proto,
15042 tree id,
15044 {
15048 }
15050 /* Create a new non-type template parameter from the given PARM
15051 declarator. */
15053 static tree
15056 {
15062 }
15064 /* Build a constrained template parameter based on the PARMDECL
15065 declarator. The type of PARMDECL is the constrained type, which
15066 refers to the prototype template parameter that ultimately
15067 specifies the type of the declared parameter. */
15069 static tree
15074 {
15080 /* A template parameter constrained by a variadic concept shall also
15081 be declared as a template parameter pack. */
15086 /* Build the parameter. Return an error if the declarator was invalid. */
15087 tree parm;
15092 parmdecl);
15093 else
15098 /* Finish the parameter decl and create a node attaching the
15099 default argument and constraint. */
15104 }
15106 /* Returns true if the parsed type actually represents the declaration
15107 of a type template-parameter. */
15111 {
15114 }
15117 /* Returns true if the parsed type actually represents the declaration of
15118 a template template-parameter. */
15120 static bool
15122 {
15125 }
15127 /* Parse a default argument for a type template-parameter.
15128 Note that diagnostics are handled in cp_parser_template_parameter. */
15130 static tree
15132 {
15135 /* Consume the `=' token. */
15140 /* Parse the default-argument. */
15146 {
15150 }
15153 }
15155 /* Parse a default argument for a template template-parameter. */
15157 static tree
15159 {
15164 /* Consume the `='. */
15166 /* Parse the id-expression. */
15168 /* save token before parsing the id-expression, for error
15169 reporting */
15171 tree default_argument
15179 /* If the id-expression was a template-id that refers to
15180 a template-class, we already have the declaration here,
15181 so no further lookup is needed. */
15182 ;
15183 else
15184 /* Look up the name. */
15185 default_argument
15187 none_type,
15193 /* See if the default argument is valid. */
15197 }
15199 /* Parse a template-parameter.
15201 template-parameter:
15202 type-parameter
15203 parameter-declaration
15205 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15206 the parameter. The TREE_PURPOSE is the default value, if any.
15207 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15208 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15209 set to true iff this parameter is a parameter pack. */
15211 static tree
15214 {
15217 tree parm;
15219 /* Assume it is a type parameter or a template parameter. */
15221 /* Assume it not a parameter pack. */
15223 /* Peek at the next token. */
15225 /* If it is `template', we have a type-parameter. */
15228 /* If it is `class' or `typename' we do not know yet whether it is a
15229 type parameter or a non-type parameter. Consider:
15231 template <typename T, typename T::X X> ...
15233 or:
15235 template <class C, class D*> ...
15237 Here, the first parameter is a type parameter, and the second is
15238 a non-type parameter. We can tell by looking at the token after
15239 the identifier -- if it is a `,', `=', or `>' then we have a type
15240 parameter. */
15242 {
15243 /* Peek at the token after `class' or `typename'. */
15245 /* If it's an ellipsis, we have a template type parameter
15246 pack. */
15249 /* If it's an identifier, skip it. */
15252 /* Now, see if the token looks like the end of a template
15253 parameter. */
15258 }
15260 /* Otherwise, it is a non-type parameter or a constrained parameter.
15262 [temp.param]
15264 When parsing a default template-argument for a non-type
15265 template-parameter, the first non-nested `>' is taken as the end
15266 of the template parameter-list rather than a greater-than
15267 operator. */
15268 parameter_declarator
15275 /* If the parameter declaration is marked as a parameter pack, set
15276 *IS_PARAMETER_PACK to notify the caller. */
15281 {
15282 /* Can happen in some cases of erroneous input (c++/34892). */
15284 /* Consume the `...' for better error recovery. */
15286 }
15288 // The parameter may have been constrained.
15291 parameter_declarator,
15292 is_non_type,
15293 is_parameter_pack);
15295 // Now we're sure that the parameter is a non-type parameter.
15306 }
15308 /* Parse a type-parameter.
15310 type-parameter:
15311 class identifier [opt]
15312 class identifier [opt] = type-id
15313 typename identifier [opt]
15314 typename identifier [opt] = type-id
15315 template < template-parameter-list > class identifier [opt]
15316 template < template-parameter-list > class identifier [opt]
15317 = id-expression
15319 GNU Extension (variadic templates):
15321 type-parameter:
15322 class ... identifier [opt]
15323 typename ... identifier [opt]
15325 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15326 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15327 the declaration of the parameter.
15329 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15331 static tree
15333 {
15335 tree parameter;
15337 /* Look for a keyword to tell us what kind of parameter this is. */
15343 {
15346 {
15347 tree identifier;
15348 tree default_argument;
15350 /* If the next token is an ellipsis, we have a template
15351 argument pack. */
15353 {
15354 /* Consume the `...' token. */
15359 }
15361 /* If the next token is an identifier, then it names the
15362 parameter. */
15365 else
15368 /* Create the parameter. */
15371 /* If the next token is an `=', we have a default argument. */
15373 {
15374 default_argument
15377 /* Template parameter packs cannot have default
15378 arguments. */
15380 {
15383 "template parameter pack %qD cannot have a "
15385 else
15387 "template parameter packs cannot have "
15390 }
15393 }
15394 else
15397 /* Create the combined representation of the parameter and the
15398 default argument. */
15400 }
15404 {
15405 tree identifier;
15406 tree default_argument;
15408 /* Look for the `<'. */
15410 /* Parse the template-parameter-list. */
15412 /* Look for the `>'. */
15415 // If template requirements are present, parse them.
15417 {
15422 }
15424 /* Look for the `class' or 'typename' keywords. */
15426 /* If the next token is an ellipsis, we have a template
15427 argument pack. */
15429 {
15430 /* Consume the `...' token. */
15435 }
15436 /* If the next token is an `=', then there is a
15437 default-argument. If the next token is a `>', we are at
15438 the end of the parameter-list. If the next token is a `,',
15439 then we are at the end of this parameter. */
15443 {
15445 /* Treat invalid names as if the parameter were nameless. */
15448 }
15449 else
15452 /* Create the template parameter. */
15454 identifier);
15456 /* If the next token is an `=', then there is a
15457 default-argument. */
15459 {
15460 default_argument
15463 /* Template parameter packs cannot have default
15464 arguments. */
15466 {
15469 "template parameter pack %qD cannot "
15471 identifier);
15472 else
15476 }
15477 }
15478 else
15481 /* Create the combined representation of the parameter and the
15482 default argument. */
15484 }
15490 }
15493 }
15495 /* Parse a template-id.
15497 template-id:
15498 template-name < template-argument-list [opt] >
15500 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15501 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15502 returned. Otherwise, if the template-name names a function, or set
15503 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15504 names a class, returns a TYPE_DECL for the specialization.
15506 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15507 uninstantiated templates. */
15509 static tree
15515 {
15516 tree templ;
15517 tree arguments;
15518 tree template_id;
15523 /* If the next token corresponds to a template-id, there is no need
15524 to reparse it. */
15527 {
15530 }
15532 /* Avoid performing name lookup if there is no possibility of
15533 finding a template-id. */
15536 && !cp_parser_nth_token_starts_template_argument_list_p
15538 {
15541 }
15543 /* Remember where the template-id starts. */
15549 /* Parse the template-name. */
15552 check_dependency_p,
15553 is_declaration,
15554 tag_type,
15557 {
15560 }
15562 /* Since we're going to preserve any side-effects from this parse, set up a
15563 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15564 in the template arguments. */
15567 /* If we find the sequence `[:' after a template-name, it's probably
15568 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15569 parse correctly the argument list. */
15576 {
15578 /* Change `:' into `::'. */
15580 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15581 CPP_LESS. */
15584 /* Parse the arguments. */
15587 {
15588 /* If we couldn't parse an argument list, then we revert our changes
15589 and return simply an error. Maybe this is not a template-id
15590 after all. */
15595 }
15596 /* Otherwise, emit an error about the invalid digraph, but continue
15597 parsing because we got our argument list. */
15600 {
15603 "%<<:%> is an alternate spelling for %<[%>."
15606 {
15608 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15611 }
15612 }
15613 }
15614 else
15615 {
15616 /* Look for the `<' that starts the template-argument-list. */
15618 {
15621 }
15622 /* Parse the arguments. */
15624 }
15626 /* Build a representation of the specialization. */
15629 TEMPLATE_ID_EXPR,
15633 {
15635 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15636 template (rather than some instantiation thereof) only if
15637 is not nested within some other construct. For example, in
15638 "template <typename T> void f(T) { A<T>::", A<T> is just an
15639 instantiation of A. */
15642 CPP_SCOPE));
15643 template_id
15645 }
15646 /* A template-like identifier may be a partial concept id. */
15652 {
15656 }
15657 else
15658 {
15659 /* If it's not a class-template or a template-template, it should be
15660 a function-template. */
15668 }
15670 /* If parsing tentatively, replace the sequence of tokens that makes
15671 up the template-id with a CPP_TEMPLATE_ID token. That way,
15672 should we re-parse the token stream, we will not have to repeat
15673 the effort required to do the parse, nor will we issue duplicate
15674 error messages about problems during instantiation of the
15675 template. */
15677 /* Don't do this if we had a parse error in a declarator; re-parsing
15678 might succeed if a name changes meaning (60361). */
15682 {
15685 /* Reset the contents of the START_OF_ID token. */
15688 /* Update the location to be of the form:
15689 template-name < template-argument-list [opt] >
15690 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15691 with caret == start at the start of the template-name,
15692 ranging until the closing '>'. */
15693 location_t finish_loc
15695 location_t combined_loc
15699 /* We must mark the lookup as kept, so we don't throw it away on
15700 the first parse. */
15704 /* Retrieve any deferred checks. Do not pop this access checks yet
15705 so the memory will not be reclaimed during token replacing below. */
15711 /* Purge all subsequent tokens. */
15714 /* ??? Can we actually assume that, if template_id ==
15715 error_mark_node, we will have issued a diagnostic to the
15716 user, as opposed to simply marking the tentative parse as
15717 failed? */
15720 }
15724 }
15726 /* Parse a template-name.
15728 template-name:
15729 identifier
15731 The standard should actually say:
15733 template-name:
15734 identifier
15735 operator-function-id
15737 A defect report has been filed about this issue.
15739 A conversion-function-id cannot be a template name because they cannot
15740 be part of a template-id. In fact, looking at this code:
15742 a.operator K<int>()
15744 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15745 It is impossible to call a templated conversion-function-id with an
15746 explicit argument list, since the only allowed template parameter is
15747 the type to which it is converting.
15749 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15750 `template' keyword, in a construction like:
15752 T::template f<3>()
15754 In that case `f' is taken to be a template-name, even though there
15755 is no way of knowing for sure.
15757 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15758 name refers to a set of overloaded functions, at least one of which
15759 is a template, or an IDENTIFIER_NODE with the name of the template,
15760 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15761 names are looked up inside uninstantiated templates. */
15763 static tree
15770 {
15771 tree identifier;
15772 tree decl;
15775 /* If the next token is `operator', then we have either an
15776 operator-function-id or a conversion-function-id. */
15778 {
15779 /* We don't know whether we're looking at an
15780 operator-function-id or a conversion-function-id. */
15782 /* Try an operator-function-id. */
15784 /* If that didn't work, try a conversion-function-id. */
15786 {
15789 }
15790 }
15791 /* Look for the identifier. */
15792 else
15795 /* If we didn't find an identifier, we don't have a template-id. */
15799 /* If the name immediately followed the `template' keyword, then it
15800 is a template-name. However, if the next token is not `<', then
15801 we do not treat it as a template-name, since it is not being used
15802 as part of a template-id. This enables us to handle constructs
15803 like:
15805 template <typename T> struct S { S(); };
15806 template <typename T> S<T>::S();
15808 correctly. We would treat `S' as a template -- if it were `S<T>'
15809 -- but we do not if there is no `<'. */
15813 {
15814 /* In a declaration, in a dependent context, we pretend that the
15815 "template" keyword was present in order to improve error
15816 recovery. For example, given:
15818 template <typename T> void f(T::X<int>);
15820 we want to treat "X<int>" as a template-id. */
15822 && !template_keyword_p
15824 && check_dependency_p
15826 /* Do not do this for dtors (or ctors), since they never
15827 need the template keyword before their name. */
15829 {
15832 /* Explain what went wrong. */
15834 identifier);
15837 /* If parsing tentatively, find the location of the "<" token. */
15840 /* Parse the template arguments so that we can issue error
15841 messages about them. */
15844 /* Skip tokens until we find a good place from which to
15845 continue parsing. */
15850 /* If parsing tentatively, permanently remove the
15851 template argument list. That will prevent duplicate
15852 error messages from being issued about the missing
15853 "template" keyword. */
15860 }
15862 /* If the "template" keyword is present, then there is generally
15863 no point in doing name-lookup, so we just return IDENTIFIER.
15864 But, if the qualifying scope is non-dependent then we can
15865 (and must) do name-lookup normally. */
15870 {
15871 /* We're optimizing away the call to cp_parser_lookup_name, but we
15872 still need to do this. */
15875 }
15876 }
15878 /* Look up the name. */
15880 tag_type,
15883 check_dependency_p,
15889 /* If DECL is a template, then the name was a template-name. */
15891 {
15895 }
15896 else
15897 {
15898 /* The standard does not explicitly indicate whether a name that
15899 names a set of overloaded declarations, some of which are
15900 templates, is a template-name. However, such a name should
15901 be a template-name; otherwise, there is no way to form a
15902 template-id for the overloaded templates. */
15911 {
15912 /* The name does not name a template. */
15915 }
15916 }
15918 /* If DECL is dependent, and refers to a function, then just return
15919 its name; we will look it up again during template instantiation. */
15921 {
15925 }
15928 }
15930 /* Parse a template-argument-list.
15932 template-argument-list:
15933 template-argument ... [opt]
15934 template-argument-list , template-argument ... [opt]
15936 Returns a TREE_VEC containing the arguments. */
15938 static tree
15940 {
15945 tree vec;
15952 /* Even if the template-id appears in an integral
15953 constant-expression, the contents of the argument list do
15954 not. */
15960 /* Parse the arguments. */
15961 do
15962 {
15963 tree argument;
15966 /* Consume the comma. */
15969 /* Parse the template-argument. */
15972 /* If the next token is an ellipsis, we're expanding a template
15973 argument pack. */
15975 {
15977 {
15981 }
15982 /* Consume the `...' token. */
15985 /* Make the argument into a TYPE_PACK_EXPANSION or
15986 EXPR_PACK_EXPANSION. */
15988 }
15991 {
15995 {
15998 }
15999 else
16001 }
16003 }
16019 }
16021 /* Parse a template-argument.
16023 template-argument:
16024 assignment-expression
16025 type-id
16026 id-expression
16028 The representation is that of an assignment-expression, type-id, or
16029 id-expression -- except that the qualified id-expression is
16030 evaluated, so that the value returned is either a DECL or an
16031 OVERLOAD.
16033 Although the standard says "assignment-expression", it forbids
16034 throw-expressions or assignments in the template argument.
16035 Therefore, we use "conditional-expression" instead. */
16037 static tree
16039 {
16040 tree argument;
16046 cp_id_kind idk;
16048 /* There's really no way to know what we're looking at, so we just
16049 try each alternative in order.
16051 [temp.arg]
16053 In a template-argument, an ambiguity between a type-id and an
16054 expression is resolved to a type-id, regardless of the form of
16055 the corresponding template-parameter.
16057 Therefore, we try a type-id first. */
16060 /* If there was no error parsing the type-id but the next token is a
16061 '>>', our behavior depends on which dialect of C++ we're
16062 parsing. In C++98, we probably found a typo for '> >'. But there
16063 are type-id which are also valid expressions. For instance:
16065 struct X { int operator >> (int); };
16066 template <int V> struct Foo {};
16067 Foo<X () >> 5> r;
16069 Here 'X()' is a valid type-id of a function type, but the user just
16070 wanted to write the expression "X() >> 5". Thus, we remember that we
16071 found a valid type-id, but we still try to parse the argument as an
16072 expression to see what happens.
16074 In C++0x, the '>>' will be considered two separate '>'
16075 tokens. */
16079 {
16082 }
16083 else
16084 {
16085 /* If the next token isn't a `,' or a `>', then this argument wasn't
16086 really finished. This means that the argument is not a valid
16087 type-id. */
16090 /* If that worked, we're done. */
16093 }
16094 /* We're still not sure what the argument will be. */
16096 /* Try a template. */
16104 /* If the next token isn't a `,' or a `>', then this argument wasn't
16105 really finished. */
16109 {
16110 /* Figure out what is being referred to. If the id-expression
16111 was for a class template specialization, then we will have a
16112 TYPE_DECL at this point. There is no need to do name lookup
16113 at this point in that case. */
16116 none_type,
16122 /* Handle a constrained-type-specifier for a non-type template
16123 parameter. */
16129 }
16131 {
16135 }
16136 /* It must be a non-type argument. In C++17 any constant-expression is
16137 allowed. */
16141 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16143 -- an integral constant-expression of integral or enumeration
16144 type; or
16146 -- the name of a non-type template-parameter; or
16148 -- the name of an object or function with external linkage...
16150 -- the address of an object or function with external linkage...
16152 -- a pointer to member... */
16153 /* Look for a non-type template parameter. */
16155 {
16167 }
16169 /* If the next token is "&", the argument must be the address of an
16170 object or function with external linkage. */
16173 {
16176 }
16177 /* See if we might have an id-expression. */
16184 {
16187 address_p,
16194 else
16195 {
16196 tree probe;
16199 {
16200 /* Strip the dereference temporarily. */
16203 }
16205 /* If we're in a template, we represent a qualified-id referring
16206 to a static data member as a SCOPE_REF even if the scope isn't
16207 dependent so that we can check access control later. */
16212 {
16213 /* A variable without external linkage might still be a
16214 valid constant-expression, so no error is issued here
16215 if the external-linkage check fails. */
16218 }
16220 /* All overloaded functions are allowed; if the external
16221 linkage test does not pass, an error will be issued
16222 later. */
16223 ;
16227 /* A pointer-to-member. */
16228 ;
16230 ;
16231 else
16235 {
16238 tf_warning_or_error);
16239 else
16242 }
16243 }
16244 }
16245 /* If the argument started with "&", there are no other valid
16246 alternatives at this point. */
16248 {
16251 }
16253 general_expr:
16254 /* If the argument wasn't successfully parsed as a type-id followed
16255 by '>>', the argument can only be a constant expression now.
16256 Otherwise, we try parsing the constant-expression tentatively,
16257 because the argument could really be a type-id. */
16263 else
16264 {
16265 /* With C++17 generalized non-type template arguments we need to handle
16266 lvalue constant expressions, too. */
16269 }
16277 /* We did our best to parse the argument as a non type-id, but that
16278 was the only alternative that matched (albeit with a '>' after
16279 it). We can assume it's just a typo from the user, and a
16280 diagnostic will then be issued. */
16282 }
16284 /* Parse an explicit-instantiation.
16286 explicit-instantiation:
16287 template declaration
16289 Although the standard says `declaration', what it really means is:
16291 explicit-instantiation:
16292 template decl-specifier-seq [opt] declarator [opt] ;
16294 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16295 supposed to be allowed. A defect report has been filed about this
16296 issue.
16298 GNU Extension:
16300 explicit-instantiation:
16301 storage-class-specifier template
16302 decl-specifier-seq [opt] declarator [opt] ;
16303 function-specifier template
16304 decl-specifier-seq [opt] declarator [opt] ; */
16306 static void
16308 {
16310 cp_decl_specifier_seq decl_specifiers;
16315 /* Look for an (optional) storage-class-specifier or
16316 function-specifier. */
16318 {
16319 extension_specifier
16322 extension_specifier
16325 }
16327 /* Look for the `template' keyword. */
16329 /* Let the front end know that we are processing an explicit
16330 instantiation. */
16332 /* [temp.explicit] says that we are supposed to ignore access
16333 control while processing explicit instantiation directives. */
16335 /* Parse a decl-specifier-seq. */
16337 CP_PARSER_FLAGS_OPTIONAL,
16340 /* If there was exactly one decl-specifier, and it declared a class,
16341 and there's no declarator, then we have an explicit type
16342 instantiation. */
16344 {
16345 tree type;
16349 /* Turn access control back on for names used during
16350 template instantiation. */
16355 }
16356 else
16357 {
16359 tree decl;
16361 /* Parse the declarator. */
16362 declarator
16373 {
16376 "explicit instantiation shall not use"
16380 "explicit instantiation shall not use"
16385 /* Turn access control back on for names used during
16386 template instantiation. */
16388 /* Do the explicit instantiation. */
16390 }
16391 else
16392 {
16394 /* Skip the body of the explicit instantiation. */
16396 }
16397 }
16398 /* We're done with the instantiation. */
16404 }
16406 /* Parse an explicit-specialization.
16408 explicit-specialization:
16409 template < > declaration
16411 Although the standard says `declaration', what it really means is:
16413 explicit-specialization:
16414 template <> decl-specifier [opt] init-declarator [opt] ;
16415 template <> function-definition
16416 template <> explicit-specialization
16417 template <> template-declaration */
16419 static void
16421 {
16425 /* Look for the `template' keyword. */
16427 /* Look for the `<'. */
16429 /* Look for the `>'. */
16431 /* We have processed another parameter list. */
16433 /* [temp]
16435 A template ... explicit specialization ... shall not have C
16436 linkage. */
16438 {
16440 /* Give it C++ linkage to avoid confusing other parts of the
16441 front end. */
16444 }
16445 else
16447 /* Let the front end know that we are beginning a specialization. */
16449 {
16452 }
16454 /* If the next keyword is `template', we need to figure out whether
16455 or not we're looking a template-declaration. */
16457 {
16462 else
16464 }
16465 else
16466 /* Parse the dependent declaration. */
16472 /* We're done with the specialization. */
16474 /* For the erroneous case of a template with C linkage, we pushed an
16475 implicit C++ linkage scope; exit that scope now. */
16478 /* We're done with this parameter list. */
16480 }
16482 /* Parse a type-specifier.
16484 type-specifier:
16485 simple-type-specifier
16486 class-specifier
16487 enum-specifier
16488 elaborated-type-specifier
16489 cv-qualifier
16491 GNU Extension:
16493 type-specifier:
16494 __complex__
16496 Returns a representation of the type-specifier. For a
16497 class-specifier, enum-specifier, or elaborated-type-specifier, a
16498 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16500 The parser flags FLAGS is used to control type-specifier parsing.
16502 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16503 in a decl-specifier-seq.
16505 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16506 class-specifier, enum-specifier, or elaborated-type-specifier, then
16507 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16508 if a type is declared; 2 if it is defined. Otherwise, it is set to
16509 zero.
16511 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16512 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16513 is set to FALSE. */
16515 static tree
16517 cp_parser_flags flags,
16522 {
16528 /* Assume this type-specifier does not declare a new type. */
16531 /* And that it does not specify a cv-qualifier. */
16534 /* Peek at the next token. */
16537 /* If we're looking at a keyword, we can use that to guide the
16538 production we choose. */
16541 {
16546 /* Look for the enum-specifier. */
16548 /* If that worked, we're done. */
16550 {
16555 type_spec,
16556 token,
16559 }
16560 else
16563 /* Any of these indicate either a class-specifier, or an
16564 elaborated-type-specifier. */
16571 /* Parse tentatively so that we can back up if we don't find a
16572 class-specifier. */
16574 /* Look for the class-specifier. */
16577 /* If that worked, we're done. */
16579 {
16584 type_spec,
16585 token,
16588 }
16590 /* Fall through. */
16591 elaborated_type_specifier:
16592 /* We're declaring (not defining) a class or enum. */
16596 /* Fall through. */
16598 /* Look for an elaborated-type-specifier. */
16599 type_spec
16600 = (cp_parser_elaborated_type_specifier
16603 is_declaration));
16606 type_spec,
16607 token,
16630 /* The `__complex__' keyword is a GNU extension. */
16636 }
16638 /* Handle simple keywords. */
16640 {
16642 {
16645 }
16647 }
16649 /* If we do not already have a type-specifier, assume we are looking
16650 at a simple-type-specifier. */
16652 decl_specs,
16653 flags);
16655 /* If we didn't find a type-specifier, and a type-specifier was not
16656 optional in this context, issue an error message. */
16658 {
16661 }
16664 }
16666 /* Parse a simple-type-specifier.
16668 simple-type-specifier:
16669 :: [opt] nested-name-specifier [opt] type-name
16670 :: [opt] nested-name-specifier template template-id
16671 char
16672 wchar_t
16673 bool
16674 short
16675 int
16676 long
16677 signed
16678 unsigned
16679 float
16680 double
16681 void
16683 C++11 Extension:
16685 simple-type-specifier:
16686 auto
16687 decltype ( expression )
16688 char16_t
16689 char32_t
16690 __underlying_type ( type-id )
16692 C++17 extension:
16694 nested-name-specifier(opt) template-name
16696 GNU Extension:
16698 simple-type-specifier:
16699 __int128
16700 __typeof__ unary-expression
16701 __typeof__ ( type-id )
16702 __typeof__ ( type-id ) { initializer-list , [opt] }
16704 Concepts Extension:
16706 simple-type-specifier:
16707 constrained-type-specifier
16709 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16710 appropriately updated. */
16712 static tree
16715 cp_parser_flags flags)
16716 {
16721 /* Peek at the next token. */
16724 /* If we're looking at a keyword, things are easy. */
16726 {
16761 {
16764 }
16793 {
16794 /* The 'auto' might be the placeholder return type for a function decl
16795 with trailing return type. */
16804 {
16806 {
16813 }
16816 {
16819 }
16822 }
16826 {
16829 }
16832 {
16835 }
16836 else
16840 {
16843 "use of %<auto%> in lambda parameter declaration "
16844 "only available with "
16846 }
16849 "use of %<auto%> in parameter declaration "
16850 "only available with "
16854 "ISO C++ forbids use of %<auto%> in parameter "
16856 }
16857 else
16862 /* Since DR 743, decltype can either be a simple-type-specifier by
16863 itself or begin a nested-name-specifier. Parsing it will replace
16864 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16865 handling below decide what to do. */
16871 /* Consume the `typeof' token. */
16873 /* Parse the operand to `typeof'. */
16875 /* If it is not already a TYPE, take its type. */
16881 token,
16890 token,
16900 token,
16905 }
16907 /* If token is an already-parsed decltype not followed by ::,
16908 it's a simple-type-specifier. */
16911 {
16914 {
16916 token,
16918 /* Remember that we are handling a decltype in order to
16919 implement the resolution of DR 1510 when the argument
16920 isn't instantiation dependent. */
16922 }
16925 }
16927 /* If the type-specifier was for a built-in type, we're done. */
16929 {
16930 /* Record the type. */
16937 type,
16938 token,
16943 /* Consume the token. */
16949 /* There is no valid C++ program where a non-template type is
16950 followed by a "<". That usually indicates that the user thought
16951 that the type was a template. */
16956 }
16958 /* The type-specifier must be a user-defined type. */
16960 {
16964 /* Don't gobble tokens or issue error messages if this is an
16965 optional type-specifier. */
16971 /* Look for the optional `::' operator. */
16972 global_p
16976 /* Look for the nested-name specifier. */
16977 qualified_p
16984 /* If we have seen a nested-name-specifier, and the next token
16985 is `template', then we are using the template-id production. */
16988 {
16989 /* Look for the template-id. */
16993 none_type,
16995 /* If the template-id did not name a type, we are out of
16996 luck. */
16998 {
17001 }
17002 }
17003 /* Otherwise, look for a type-name. */
17004 else
17006 /* Keep track of all name-lookups performed in class scopes. */
17008 && !global_p
17009 && !qualified_p
17013 /* If it didn't work out, we don't have a TYPE. */
17018 {
17032 {
17034 none_type,
17044 else
17045 {
17050 }
17051 }
17052 else
17058 }
17061 token,
17063 }
17065 /* If we didn't get a type-name, issue an error message. */
17067 {
17070 }
17073 {
17074 /* See if TYPE is an Objective-C type, and if so, parse and
17075 accept any protocol references following it. Do this before
17076 the cp_parser_check_for_invalid_template_id() call, because
17077 Objective-C types can be followed by '<...>' which would
17078 enclose protocol names rather than template arguments, and so
17079 everything is fine. */
17082 {
17086 /* Clobber the "unqualified" type previously entered into
17087 DECL_SPECS with the new, improved protocol-qualified version. */
17092 }
17094 /* There is no valid C++ program where a non-template type is
17095 followed by a "<". That usually indicates that the user
17096 thought that the type was a template. */
17098 none_type,
17100 }
17103 }
17105 /* Parse a type-name.
17107 type-name:
17108 class-name
17109 enum-name
17110 typedef-name
17111 simple-template-id [in c++0x]
17113 enum-name:
17114 identifier
17116 typedef-name:
17117 identifier
17119 Concepts:
17121 type-name:
17122 concept-name
17123 partial-concept-id
17125 concept-name:
17126 identifier
17128 Returns a TYPE_DECL for the type. */
17130 static tree
17132 {
17134 }
17136 /* See above. */
17137 static tree
17139 {
17140 tree type_decl;
17142 /* We can't know yet whether it is a class-name or not. */
17144 /* Try a class-name. */
17146 typename_keyword_p,
17148 none_type,
17152 /* If it's not a class-name, keep looking. */
17154 {
17156 /* It must be a typedef-name or an enum-name. */
17160 /* It is either a simple-template-id representing an
17161 instantiation of an alias template... */
17165 none_type,
17167 /* Note that this must be an instantiation of an alias template
17168 because [temp.names]/6 says:
17170 A template-id that names an alias template specialization
17171 is a type-name.
17173 Whereas [temp.names]/7 says:
17175 A simple-template-id that names a class template
17176 specialization is a class-name.
17178 With concepts, this could also be a partial-concept-id that
17179 declares a non-type template parameter. */
17186 else
17190 /* ... Or a typedef-name or an enum-name. */
17192 }
17195 }
17197 /* Check if DECL and ARGS can form a constrained-type-specifier.
17198 If ARGS is non-null, we try to form a concept check of the
17199 form DECL<?, ARGS> where ? is a wildcard that matches any
17200 kind of template argument. If ARGS is NULL, then we try to
17201 form a concept check of the form DECL<?>. */
17203 static tree
17206 {
17209 /* If we a constrained-type-specifier cannot be deduced. */
17213 /* A constrained type specifier can only be found in an
17214 overload set or as a reference to a template declaration.
17216 FIXME: This might be masking a bug. It's possible that
17217 that the deduction below is causing template specializations
17218 to be formed with the wildcard as an argument. */
17222 /* Try to build a call expression that evaluates the
17223 concept. This can fail if the overload set refers
17224 only to non-templates. */
17230 /* Deduce the checked constraint and the prototype parameter.
17232 FIXME: In certain cases, failure to deduce should be a
17233 diagnosable error. */
17234 tree conc;
17235 tree proto;
17239 /* In template parameter scope, this results in a constrained
17240 parameter. Return a descriptor of that parm. */
17244 /* In a parameter-declaration-clause, constrained-type
17245 specifiers result in invented template parameters. */
17247 {
17250 }
17251 else
17252 {
17253 /* Otherwise, we're in a context where the constrained
17254 type name is deduced and the constraint applies
17255 after deduction. */
17257 }
17260 }
17262 /* If DECL refers to a concept, return a TYPE_DECL representing
17263 the result of using the constrained type specifier in the
17264 current context. DECL refers to a concept if
17266 - it is an overload set containing a function concept taking a single
17267 type argument, or
17269 - it is a variable concept taking a single type argument. */
17271 static tree
17273 {
17279 else
17281 }
17283 /* Check if DECL and ARGS form a partial-concept-id. If so,
17284 assign ID to the resulting constrained placeholder.
17286 Returns true if the partial-concept-id designates a placeholder
17287 and false otherwise. Note that *id is set to NULL_TREE in
17288 this case. */
17290 static tree
17292 {
17294 }
17296 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17297 or a concept-name.
17299 enum-name:
17300 identifier
17302 typedef-name:
17303 identifier
17305 concept-name:
17306 identifier
17308 Returns a TYPE_DECL for the type. */
17310 static tree
17312 {
17313 tree type_decl;
17314 tree identifier;
17321 /* Look up the type-name. */
17326 /* If we found an overload set, then it may refer to a concept-name. */
17332 {
17333 /* See if this is an Objective-C type. */
17338 }
17340 /* Issue an error if we did not find a type-name. */
17342 /* In Objective-C, we have the complication that class names are
17343 normally type names and start declarations (eg, the
17344 "NSObject" in "NSObject *object;"), but can be used in an
17345 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17346 is an expression. So, a classname followed by a dot is not a
17347 valid type-name. */
17350 {
17355 }
17356 /* Remember that the name was used in the definition of the
17357 current class so that we can check later to see if the
17358 meaning would have been different after the class was
17359 entirely defined. */
17365 }
17367 /* Parse an elaborated-type-specifier. Note that the grammar given
17368 here incorporates the resolution to DR68.
17370 elaborated-type-specifier:
17371 class-key :: [opt] nested-name-specifier [opt] identifier
17372 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17373 enum-key :: [opt] nested-name-specifier [opt] identifier
17374 typename :: [opt] nested-name-specifier identifier
17375 typename :: [opt] nested-name-specifier template [opt]
17376 template-id
17378 GNU extension:
17380 elaborated-type-specifier:
17381 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17382 class-key attributes :: [opt] nested-name-specifier [opt]
17383 template [opt] template-id
17384 enum attributes :: [opt] nested-name-specifier [opt] identifier
17386 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17387 declared `friend'. If IS_DECLARATION is TRUE, then this
17388 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17389 something is being declared.
17391 Returns the TYPE specified. */
17393 static tree
17397 {
17399 tree identifier;
17402 tree globalscope;
17405 /* See if we're looking at the `enum' keyword. */
17407 {
17408 /* Consume the `enum' token. */
17410 /* Remember that it's an enumeration type. */
17412 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17413 enums) is used here. */
17417 {
17424 /* Consume the `struct' or `class' and parse it anyway. */
17426 }
17427 /* Parse the attributes. */
17429 }
17430 /* Or, it might be `typename'. */
17432 RID_TYPENAME))
17433 {
17434 /* Consume the `typename' token. */
17436 /* Remember that it's a `typename' type. */
17438 }
17439 /* Otherwise it must be a class-key. */
17440 else
17441 {
17445 /* Parse the attributes. */
17447 }
17449 /* Look for the `::' operator. */
17452 /* Look for the nested-name-specifier. */
17453 tree nested_name_specifier;
17455 {
17456 nested_name_specifier
17461 is_declaration);
17464 }
17465 else
17466 /* Even though `typename' is not present, the proposed resolution
17467 to Core Issue 180 says that in `class A<T>::B', `B' should be
17468 considered a type-name, even if `A<T>' is dependent. */
17469 nested_name_specifier
17474 is_declaration);
17475 /* For everything but enumeration types, consider a template-id.
17476 For an enumeration type, consider only a plain identifier. */
17478 {
17480 tree decl;
17482 /* Allow the `template' keyword. */
17484 /* If we didn't see `template', we don't know if there's a
17485 template-id or not. */
17488 /* Parse the template-id. */
17492 tag_type,
17493 is_declaration);
17494 /* If we didn't find a template-id, look for an ordinary
17495 identifier. */
17497 ;
17498 /* We can get here when cp_parser_template_id, called by
17499 cp_parser_class_name with tag_type == none_type, succeeds
17500 and caches a BASELINK. Then, when called again here,
17501 instead of failing and returning an error_mark_node
17502 returns it (see template/typename17.C in C++11).
17503 ??? Could we diagnose this earlier? */
17505 {
17508 }
17509 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17510 in effect, then we must assume that, upon instantiation, the
17511 template will correspond to a class. */
17515 typename_type,
17517 /* If the `typename' keyword is in effect and DECL is not a type
17518 decl, then type is non existent. */
17520 ;
17522 {
17526 /* If the next token is a semicolon, this must be a specialization,
17527 instantiation, or friend declaration. Check the scope while we
17528 still know whether or not we had a nested-name-specifier. */
17533 }
17536 }
17539 {
17544 {
17547 }
17549 /* For a `typename', we needn't call xref_tag. */
17555 /* Template parameter lists apply only if we are not within a
17556 function parameter list. */
17557 bool template_parm_lists_apply
17566 /* Look up a qualified name in the usual way. */
17568 {
17569 tree decl;
17570 tree ambiguous_decls;
17573 tag_type,
17580 /* If the lookup was ambiguous, an error will already have been
17581 issued. */
17585 /* If we are parsing friend declaration, DECL may be a
17586 TEMPLATE_DECL tree node here. However, we need to check
17587 whether this TEMPLATE_DECL results in valid code. Consider
17588 the following example:
17590 namespace N {
17591 template <class T> class C {};
17592 }
17593 class X {
17594 template <class T> friend class N::C; // #1, valid code
17595 };
17596 template <class T> class Y {
17597 friend class N::C; // #2, invalid code
17598 };
17600 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17601 name lookup of `N::C'. We see that friend declaration must
17602 be template for the code to be valid. Note that
17603 processing_template_decl does not work here since it is
17604 always 1 for the above two cases. */
17606 decl = (cp_parser_maybe_treat_template_as_class
17611 {
17613 identifier,
17616 }
17619 {
17623 allow_template);
17627 }
17629 /* Forward declarations of nested types, such as
17631 class C1::C2;
17632 class C1::C2::C3;
17634 are invalid unless all components preceding the final '::'
17635 are complete. If all enclosing types are complete, these
17636 declarations become merely pointless.
17638 Invalid forward declarations of nested types are errors
17639 caught elsewhere in parsing. Those that are pointless arrive
17640 here. */
17647 }
17648 else
17649 {
17650 /* An elaborated-type-specifier sometimes introduces a new type and
17651 sometimes names an existing type. Normally, the rule is that it
17652 introduces a new type only if there is not an existing type of
17653 the same name already in scope. For example, given:
17655 struct S {};
17656 void f() { struct S s; }
17658 the `struct S' in the body of `f' is the same `struct S' as in
17659 the global scope; the existing definition is used. However, if
17660 there were no global declaration, this would introduce a new
17661 local class named `S'.
17663 An exception to this rule applies to the following code:
17665 namespace N { struct S; }
17667 Here, the elaborated-type-specifier names a new type
17668 unconditionally; even if there is already an `S' in the
17669 containing scope this declaration names a new type.
17670 This exception only applies if the elaborated-type-specifier
17671 forms the complete declaration:
17673 [class.name]
17675 A declaration consisting solely of `class-key identifier ;' is
17676 either a redeclaration of the name in the current scope or a
17677 forward declaration of the identifier as a class name. It
17678 introduces the name into the current scope.
17680 We are in this situation precisely when the next token is a `;'.
17682 An exception to the exception is that a `friend' declaration does
17683 *not* name a new type; i.e., given:
17685 struct S { friend struct T; };
17687 `T' is not a new type in the scope of `S'.
17689 Also, `new struct S' or `sizeof (struct S)' never results in the
17690 definition of a new type; a new type can only be declared in a
17691 declaration context. */
17693 tag_scope ts;
17697 /* Friends have special name lookup rules. */
17701 CPP_SEMICOLON))
17702 /* This is a `class-key identifier ;' */
17704 else
17707 template_p =
17708 (template_parm_lists_apply
17711 /* An unqualified name was used to reference this type, so
17712 there were no qualifying templates. */
17720 }
17721 }
17726 /* Allow attributes on forward declarations of classes. */
17728 {
17738 else
17741 }
17744 {
17745 /* Indicate whether this class was declared as a `class' or as a
17746 `struct'. */
17750 }
17752 /* A "<" cannot follow an elaborated type specifier. If that
17753 happens, the user was probably trying to form a template-id. */
17758 }
17760 /* Parse an enum-specifier.
17762 enum-specifier:
17763 enum-head { enumerator-list [opt] }
17764 enum-head { enumerator-list , } [C++0x]
17766 enum-head:
17767 enum-key identifier [opt] enum-base [opt]
17768 enum-key nested-name-specifier identifier enum-base [opt]
17770 enum-key:
17771 enum
17772 enum class [C++0x]
17773 enum struct [C++0x]
17775 enum-base: [C++0x]
17776 : type-specifier-seq
17778 opaque-enum-specifier:
17779 enum-key identifier enum-base [opt] ;
17781 GNU Extensions:
17782 enum-key attributes[opt] identifier [opt] enum-base [opt]
17783 { enumerator-list [opt] }attributes[opt]
17784 enum-key attributes[opt] identifier [opt] enum-base [opt]
17785 { enumerator-list, }attributes[opt] [C++0x]
17787 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17788 if the token stream isn't an enum-specifier after all. */
17790 static tree
17792 {
17793 tree identifier;
17795 tree prev_scope;
17797 tree attributes;
17810 /* Parse tentatively so that we can back up if we don't find a
17811 enum-specifier. */
17814 /* Caller guarantees that the current token is 'enum', an identifier
17815 possibly follows, and the token after that is an opening brace.
17816 If we don't have an identifier, fabricate an anonymous name for
17817 the enumeration being defined. */
17820 /* Parse the "class" or "struct", which indicates a scoped
17821 enumeration type in C++0x. */
17824 {
17828 /* Consume the `struct' or `class' token. */
17832 }
17836 /* Clear the qualification. */
17841 /* Figure out in what scope the declaration is being placed. */
17847 nested_name_specifier
17855 {
17856 tree name;
17860 enum_type,
17865 input_location);
17867 {
17870 {
17871 /* Are template enums allowed in ISO? */
17875 /* ignore a typename reference, for it will be solved by name
17876 in start_enum. */
17878 }
17879 }
17882 else
17883 {
17888 }
17889 }
17890 else
17891 {
17894 else
17895 {
17901 }
17902 }
17905 /* Check for the `:' that denotes a specified underlying type in C++0x.
17906 Note that a ':' could also indicate a bitfield width, however. */
17908 {
17909 cp_decl_specifier_seq type_specifiers;
17911 /* Consume the `:'. */
17914 /* Parse the type-specifier-seq. */
17919 /* At this point this is surely not elaborated type specifier. */
17928 /* If that didn't work, stop. */
17930 {
17936 }
17937 }
17939 /* Look for the `{' but don't consume it yet. */
17941 {
17943 {
17946 {
17949 }
17950 }
17951 /* An opaque-enum-specifier must have a ';' here. */
17954 {
17957 {
17960 }
17961 }
17962 }
17968 {
17970 {
17974 }
17976 {
17978 }
17979 }
17981 /* Issue an error message if type-definitions are forbidden here. */
17984 else
17985 /* Create the new type. We do this before consuming the opening
17986 brace so the enum will be recorded as being on the line of its
17987 tag (or the 'enum' keyword, if there is no tag). */
17991 /* If the next token is not '{' it is an opaque-enum-specifier or an
17992 elaborated-type-specifier. */
17994 {
17998 {
17999 /* The following catches invalid code such as:
18000 enum class S<int>::E { A, B, C }; */
18008 {
18012 nested_name_specifier);
18014 }
18017 {
18019 "%qT for enum declaration does not name a class "
18022 }
18023 /* If that scope does not contain the scope in which the
18024 class was originally declared, the program is invalid. */
18026 nested_name_specifier))
18027 {
18030 "declaration of %qD in namespace %qD which does not "
18033 else
18035 "declaration of %qD in %qD which does not "
18039 }
18040 /* If that scope is the scope where the declaration is being placed
18041 the program is invalid. */
18045 {
18049 }
18050 }
18055 /* Consume the opening brace. */
18062 {
18066 }
18067 else
18068 {
18074 }
18078 /* If the next token is not '}', then there are some enumerators. */
18080 {
18084 }
18085 else
18088 /* Consume the final '}'. */
18094 }
18095 else
18096 {
18097 /* If a ';' follows, then it is an opaque-enum-specifier
18098 and additional restrictions apply. */
18100 {
18107 }
18108 }
18110 /* Look for trailing attributes to apply to this enumeration, and
18111 apply them if appropriate. */
18113 {
18116 trailing_attr,
18118 }
18120 /* Finish up the enumeration. */
18122 {
18127 }
18130 {
18132 {
18135 }
18137 {
18139 }
18140 }
18141 out:
18144 }
18146 /* Parse an enumerator-list. The enumerators all have the indicated
18147 TYPE.
18149 enumerator-list:
18150 enumerator-definition
18151 enumerator-list , enumerator-definition */
18153 static void
18155 {
18157 {
18158 /* Parse an enumerator-definition. */
18161 /* If the next token is not a ',', we've reached the end of
18162 the list. */
18165 /* Otherwise, consume the `,' and keep going. */
18167 /* If the next token is a `}', there is a trailing comma. */
18169 {
18174 }
18175 }
18176 }
18178 /* Parse an enumerator-definition. The enumerator has the indicated
18179 TYPE.
18181 enumerator-definition:
18182 enumerator
18183 enumerator = constant-expression
18185 enumerator:
18186 identifier
18188 GNU Extensions:
18190 enumerator-definition:
18191 enumerator attributes [opt]
18192 enumerator attributes [opt] = constant-expression */
18194 static void
18196 {
18197 tree identifier;
18198 tree value;
18199 location_t loc;
18201 /* Save the input location because we are interested in the location
18202 of the identifier and not the location of the explicit value. */
18205 /* Look for the identifier. */
18210 /* Parse any specified attributes. */
18213 /* If the next token is an '=', then there is an explicit value. */
18215 {
18216 /* Consume the `=' token. */
18218 /* Parse the value. */
18220 }
18221 else
18224 /* If we are processing a template, make sure the initializer of the
18225 enumerator doesn't contain any bare template parameter pack. */
18229 /* Create the enumerator. */
18231 }
18233 /* Parse a namespace-name.
18235 namespace-name:
18236 original-namespace-name
18237 namespace-alias
18239 Returns the NAMESPACE_DECL for the namespace. */
18241 static tree
18243 {
18244 tree identifier;
18245 tree namespace_decl;
18249 /* Get the name of the namespace. */
18254 /* Look up the identifier in the currently active scope. Look only
18255 for namespaces, due to:
18257 [basic.lookup.udir]
18259 When looking up a namespace-name in a using-directive or alias
18260 definition, only namespace names are considered.
18262 And:
18264 [basic.lookup.qual]
18266 During the lookup of a name preceding the :: scope resolution
18267 operator, object, function, and enumerator names are ignored.
18269 (Note that cp_parser_qualifying_entity only calls this
18270 function if the token after the name is the scope resolution
18271 operator.) */
18273 none_type,
18279 /* If it's not a namespace, issue an error. */
18282 {
18287 }
18290 }
18292 /* Parse a namespace-definition.
18294 namespace-definition:
18295 named-namespace-definition
18296 unnamed-namespace-definition
18298 named-namespace-definition:
18299 original-namespace-definition
18300 extension-namespace-definition
18302 original-namespace-definition:
18303 namespace identifier { namespace-body }
18305 extension-namespace-definition:
18306 namespace original-namespace-name { namespace-body }
18308 unnamed-namespace-definition:
18309 namespace { namespace-body } */
18311 static void
18313 {
18314 tree identifier;
18323 {
18326 }
18328 /* Look for the `namespace' keyword. */
18329 cp_token* token
18332 /* Parse any specified attributes before the identifier. */
18336 {
18340 {
18343 /* Parse any attributes specified after the identifier. */
18345 }
18352 "nested namespace definitions only available with "
18355 /* Nested namespace names can create new namespaces (unlike
18356 other qualified-ids). */
18359 else
18362 }
18374 /* Start the namespace. */
18381 /* Look for the `{' to validate starting the namespace. */
18384 /* Parse the body of the namespace. */
18387 /* Look for the final `}'. */
18393 /* Pop the nested namespace definitions. */
18396 }
18398 /* Parse a namespace-body.
18400 namespace-body:
18401 declaration-seq [opt] */
18403 static void
18405 {
18407 }
18409 /* Parse a namespace-alias-definition.
18411 namespace-alias-definition:
18412 namespace identifier = qualified-namespace-specifier ; */
18414 static void
18416 {
18417 tree identifier;
18418 tree namespace_specifier;
18422 /* Look for the `namespace' keyword. */
18424 /* Look for the identifier. */
18428 /* Look for the `=' token. */
18431 {
18433 /* Skip the definition. */
18438 }
18440 /* Look for the qualified-namespace-specifier. */
18441 namespace_specifier
18443 /* Look for the `;' token. */
18446 /* Register the alias in the symbol table. */
18448 }
18450 /* Parse a qualified-namespace-specifier.
18452 qualified-namespace-specifier:
18453 :: [opt] nested-name-specifier [opt] namespace-name
18455 Returns a NAMESPACE_DECL corresponding to the specified
18456 namespace. */
18458 static tree
18460 {
18461 /* Look for the optional `::'. */
18465 /* Look for the optional nested-name-specifier. */
18473 }
18475 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18476 access declaration.
18478 using-declaration:
18479 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18480 using :: unqualified-id ;
18482 access-declaration:
18483 qualified-id ;
18485 */
18487 static bool
18490 {
18494 tree decl;
18495 tree identifier;
18496 tree qscope;
18501 {
18504 }
18505 else
18506 {
18507 /* Look for the `using' keyword. */
18510 again:
18511 /* Peek at the next token. */
18513 /* See if it's `typename'. */
18515 {
18516 /* Remember that we've seen it. */
18518 /* Consume the `typename' token. */
18520 }
18521 }
18523 /* Look for the optional global scope qualification. */
18524 global_scope_p
18529 /* If we saw `typename', or didn't see `::', then there must be a
18530 nested-name-specifier present. */
18532 {
18538 {
18541 }
18542 }
18543 /* Otherwise, we could be in either of the two productions. In that
18544 case, treat the nested-name-specifier as optional. */
18545 else
18557 /* Something has already gone wrong; there's no need to parse
18558 further. Since an error has occurred, the return value of
18559 cp_parser_parse_definitely will be false, as required. */
18563 /* Parse the unqualified-id. */
18571 {
18576 }
18578 {
18583 "pack expansion in using-declaration only available "
18586 }
18588 /* The function we call to handle a using-declaration is different
18589 depending on what scope we are in. */
18591 ;
18594 /* [namespace.udecl]
18596 A using declaration shall not name a template-id. */
18599 else
18600 {
18602 {
18603 /* Create the USING_DECL. */
18610 {
18613 }
18614 else
18615 /* Add it to the list of members in this class. */
18617 }
18618 else
18619 {
18621 identifier,
18628 {
18631 }
18634 else
18636 }
18637 }
18641 {
18645 "comma-separated list in using-declaration only available "
18648 }
18650 /* Look for the final `;'. */
18655 "access declarations are deprecated "
18656 "in favour of using-declarations; "
18660 }
18662 /* Parse an alias-declaration.
18664 alias-declaration:
18665 using identifier attribute-specifier-seq [opt] = type-id */
18667 static tree
18669 {
18671 location_t id_location;
18673 cp_decl_specifier_seq decl_specs;
18677 /* Look for the `using' keyword. */
18678 cp_token *using_token
18700 /* Now we are going to parse the type-id of the declaration. */
18702 /*
18703 [dcl.type]/3 says:
18705 "A type-specifier-seq shall not define a class or enumeration
18706 unless it appears in the type-id of an alias-declaration (7.1.3) that
18707 is not the declaration of a template-declaration."
18709 In other words, if we currently are in an alias template, the
18710 type-id should not define a type.
18712 So let's set parser->type_definition_forbidden_message in that
18713 case; cp_parser_check_type_definition (called by
18714 cp_parser_class_specifier) will then emit an error if a type is
18715 defined in the type-id. */
18717 {
18721 }
18725 /* Restore the error message if need be. */
18731 {
18734 }
18736 /* A typedef-name can also be introduced by an alias-declaration. The
18737 identifier following the using keyword becomes a typedef-name. It has
18738 the same semantics as if it were introduced by the typedef
18739 specifier. In particular, it does not define a new type and it shall
18740 not appear in the type-id. */
18745 {
18748 ds_attribute,
18749 attrs_token);
18750 }
18752 ds_typedef,
18753 using_token);
18755 ds_alias,
18756 using_token);
18765 else
18771 // Attach constraints to the alias declaration.
18773 {
18777 }
18784 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18785 added into the symbol table; otherwise, return the TYPE_DECL. */
18789 {
18793 }
18796 }
18798 /* Parse a using-directive.
18800 using-directive:
18801 using namespace :: [opt] nested-name-specifier [opt]
18802 namespace-name ; */
18804 static void
18806 {
18807 tree namespace_decl;
18808 tree attribs;
18810 /* Look for the `using' keyword. */
18812 /* And the `namespace' keyword. */
18814 /* Look for the optional `::' operator. */
18816 /* And the optional nested-name-specifier. */
18822 /* Get the namespace being used. */
18824 /* And any specified attributes. */
18827 /* Update the symbol table. */
18830 else
18833 /* Look for the final `;'. */
18835 }
18837 /* Parse an asm-definition.
18839 asm-definition:
18840 asm ( string-literal ) ;
18842 GNU Extension:
18844 asm-definition:
18845 asm volatile [opt] ( string-literal ) ;
18846 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18847 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18848 : asm-operand-list [opt] ) ;
18849 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18850 : asm-operand-list [opt]
18851 : asm-clobber-list [opt] ) ;
18852 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18853 : asm-clobber-list [opt]
18854 : asm-goto-list ) ; */
18856 static void
18858 {
18859 tree string;
18864 tree asm_stmt;
18872 /* Look for the `asm' keyword. */
18877 {
18880 }
18882 /* See if the next token is `volatile'. */
18885 {
18886 /* Remember that we saw the `volatile' keyword. */
18888 /* Consume the token. */
18890 }
18894 {
18895 /* Remember that we saw the `goto' keyword. */
18897 /* Consume the token. */
18899 }
18900 /* Look for the opening `('. */
18903 /* Look for the string. */
18906 {
18910 }
18912 /* If we're allowing GNU extensions, check for the extended assembly
18913 syntax. Unfortunately, the `:' tokens need not be separated by
18914 a space in C, and so, for compatibility, we tolerate that here
18915 too. Doing that means that we have to treat the `::' operator as
18916 two `:' tokens. */
18921 {
18926 /* The extended syntax was used. */
18929 /* Look for outputs. */
18931 {
18932 /* Consume the `:'. */
18934 /* Parse the output-operands. */
18936 CPP_COLON)
18938 CPP_SCOPE)
18940 CPP_CLOSE_PAREN)
18942 {
18946 }
18947 }
18948 /* If the next token is `::', there are no outputs, and the
18949 next token is the beginning of the inputs. */
18951 /* The inputs are coming next. */
18954 /* Look for inputs. */
18957 {
18958 /* Consume the `:' or `::'. */
18960 /* Parse the output-operands. */
18962 CPP_COLON)
18964 CPP_SCOPE)
18966 CPP_CLOSE_PAREN))
18967 {
18971 }
18972 }
18974 /* The clobbers are coming next. */
18977 /* Look for clobbers. */
18980 {
18982 /* Consume the `:' or `::'. */
18984 /* Parse the clobbers. */
18986 CPP_COLON)
18988 CPP_CLOSE_PAREN))
18990 }
18993 /* The labels are coming next. */
18996 /* Look for labels. */
18999 {
19001 /* Consume the `:' or `::'. */
19003 /* Parse the labels. */
19005 }
19009 }
19013 /* Look for the closing `)'. */
19021 {
19022 /* Create the ASM_EXPR. */
19024 {
19027 /* If the extended syntax was not used, mark the ASM_EXPR. */
19029 {
19035 }
19036 }
19037 else
19039 }
19040 }
19042 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19043 type that comes from the decl-specifier-seq. */
19045 static tree
19047 {
19050 {
19063 }
19066 }
19068 /* Declarators [gram.dcl.decl] */
19070 /* Parse an init-declarator.
19072 init-declarator:
19073 declarator initializer [opt]
19075 GNU Extension:
19077 init-declarator:
19078 declarator asm-specification [opt] attributes [opt] initializer [opt]
19080 function-definition:
19081 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19082 function-body
19083 decl-specifier-seq [opt] declarator function-try-block
19085 GNU Extension:
19087 function-definition:
19088 __extension__ function-definition
19090 TM Extension:
19092 function-definition:
19093 decl-specifier-seq [opt] declarator function-transaction-block
19095 The DECL_SPECIFIERS apply to this declarator. Returns a
19096 representation of the entity declared. If MEMBER_P is TRUE, then
19097 this declarator appears in a class scope. The new DECL created by
19098 this declarator is returned.
19100 The CHECKS are access checks that should be performed once we know
19101 what entity is being declared (and, therefore, what classes have
19102 befriended it).
19104 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19105 for a function-definition here as well. If the declarator is a
19106 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19107 be TRUE upon return. By that point, the function-definition will
19108 have been completely parsed.
19110 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19111 is FALSE.
19113 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19114 parsed declaration if it is an uninitialized single declarator not followed
19115 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19116 if present, will not be consumed. If returned, this declarator will be
19117 created with SD_INITIALIZED but will not call cp_finish_decl.
19119 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19120 and there is an initializer, the pointed location_t is set to the
19121 location of the '=' or `(', or '{' in C++11 token introducing the
19122 initializer. */
19124 static tree
19135 {
19139 tree prefix_attributes;
19141 tree asm_specification;
19142 tree initializer;
19144 tree scope;
19146 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19147 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19148 "(...)". */
19159 /* Gather the attributes that were provided with the
19160 decl-specifiers. */
19163 /* Assume that this is not the declarator for a function
19164 definition. */
19168 /* Default arguments are only permitted for function parameters. */
19172 /* Defer access checks while parsing the declarator; we cannot know
19173 what names are accessible until we know what is being
19174 declared. */
19179 /* Parse the declarator. */
19180 declarator
19185 /* Gather up the deferred checks. */
19190 /* If the DECLARATOR was erroneous, there's no need to go
19191 further. */
19195 /* Check that the number of template-parameter-lists is OK. */
19205 /* Figure out what scope the entity declared by the DECLARATOR is
19206 located in. `grokdeclarator' sometimes changes the scope, so
19207 we compute it now. */
19210 /* Perform any lookups in the declared type which were thought to be
19211 dependent, but are not in the scope of the declarator. */
19212 decl_specifiers->type
19215 /* If we're allowing GNU extensions, look for an
19216 asm-specification. */
19218 {
19219 /* Look for an asm-specification. */
19222 }
19223 else
19226 /* Look for attributes. */
19230 /* Peek at the next token. */
19236 {
19237 /* Handle C++17 deduction guides. */
19241 {
19249 {
19253 }
19254 }
19256 /* Check to see if the token indicates the start of a
19257 function-definition. */
19259 {
19261 {
19262 /* If a function-definition should not appear here, issue an
19263 error message. */
19267 }
19269 location_t func_brace_location
19272 /* Neither attributes nor an asm-specification are allowed
19273 on a function-definition. */
19276 "an asm-specification is not allowed "
19280 "attributes are not allowed "
19282 /* This is a function-definition. */
19285 /* Parse the function definition. */
19288 decl_specifiers,
19289 declarator,
19290 prefix_attributes);
19291 else
19292 decl =
19293 (cp_parser_function_definition_from_specifiers_and_declarator
19297 {
19298 /* This is where the prologue starts... */
19301 }
19304 }
19305 }
19307 {
19308 /* A non-template declaration involving a function parameter list
19309 containing an implicit template parameter will be made into a
19310 template. If the resulting declaration is not going to be an
19311 actual function then finish the template scope here to prevent it.
19312 An error message will be issued once we have a decl to talk about.
19314 FIXME probably we should do type deduction rather than create an
19315 implicit template, but the standard currently doesn't allow it. */
19318 }
19320 /* [dcl.dcl]
19322 Only in function declarations for constructors, destructors, type
19323 conversions, and deduction guides can the decl-specifier-seq be omitted.
19325 We explicitly postpone this check past the point where we handle
19326 function-definitions because we tolerate function-definitions
19327 that are missing their return types in some modes. */
19329 {
19333 }
19335 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19339 {
19350 {
19356 }
19357 }
19358 else
19359 {
19360 /* If the init-declarator isn't initialized and isn't followed by a
19361 `,' or `;', it's not a valid init-declarator. */
19364 {
19367 else
19368 {
19372 }
19373 }
19376 }
19378 /* Because start_decl has side-effects, we should only call it if we
19379 know we're going ahead. By this point, we know that we cannot
19380 possibly be looking at any other construct. */
19383 /* Enter the newly declared entry in the symbol table. If we're
19384 processing a declaration in a class-specifier, we wait until
19385 after processing the initializer. */
19387 {
19395 /* Adjust location of decl if declarator->id_loc is more appropriate:
19396 set, and decl wasn't merged with another decl, in which case its
19397 location would be different from input_location, and more accurate. */
19402 }
19404 /* Enter the SCOPE. That way unqualified names appearing in the
19405 initializer will be looked up in SCOPE. */
19408 /* Perform deferred access control checks, now that we know in which
19409 SCOPE the declared entity resides. */
19411 {
19414 /* If the entity being declared is a function, pretend that we
19415 are in its scope. If it is a `friend', it may have access to
19416 things that would not otherwise be accessible. */
19418 {
19421 }
19423 /* Perform access checks for template parameters. */
19426 /* Perform the access control checks for the declarator and the
19427 decl-specifiers. */
19430 /* Restore the saved value. */
19433 }
19435 /* Parse the initializer. */
19440 {
19442 {
19445 else
19446 {
19447 /* If the declaration was erroneous, we don't really
19448 know what the user intended, so just silently
19449 consume the initializer. */
19456 }
19457 }
19458 else
19459 {
19460 /* We want to record the extra mangling scope for in-class
19461 initializers of class members and initializers of static data
19462 member templates. The former involves deferring
19463 parsing of the initializer until end of class as with default
19464 arguments. So right here we only handle the latter. */
19474 }
19475 }
19477 /* The old parser allows attributes to appear after a parenthesized
19478 initializer. Mark Mitchell proposed removing this functionality
19479 on the GCC mailing lists on 2002-08-13. This parser accepts the
19480 attributes -- but ignores them. */
19487 /* And now complain about a non-function implicit template. */
19492 /* For an in-class declaration, use `grokfield' to create the
19493 declaration. */
19495 {
19497 {
19500 }
19509 }
19511 /* Finish processing the declaration. But, skip member
19512 declarations. */
19514 {
19517 asm_specification,
19518 /* If the initializer is in parentheses, then this is
19519 a direct-initialization, which means that an
19520 `explicit' constructor is OK. Otherwise, an
19521 `explicit' constructor cannot be used. */
19524 }
19527 /* Core issue #226 (C++0x only): A default template-argument
19528 shall not be specified in a friend class template
19529 declaration. */
19538 {
19541 else
19543 }
19550 }
19552 /* Parse a declarator.
19554 declarator:
19555 direct-declarator
19556 ptr-operator declarator
19558 abstract-declarator:
19559 ptr-operator abstract-declarator [opt]
19560 direct-abstract-declarator
19562 GNU Extensions:
19564 declarator:
19565 attributes [opt] direct-declarator
19566 attributes [opt] ptr-operator declarator
19568 abstract-declarator:
19569 attributes [opt] ptr-operator abstract-declarator [opt]
19570 attributes [opt] direct-abstract-declarator
19572 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19573 detect constructors, destructors, deduction guides, or conversion operators.
19574 It is set to -1 if the declarator is a name, and +1 if it is a
19575 function. Otherwise it is set to zero. Usually you just want to
19576 test for >0, but internally the negative value is used.
19578 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19579 a decl-specifier-seq unless it declares a constructor, destructor,
19580 or conversion. It might seem that we could check this condition in
19581 semantic analysis, rather than parsing, but that makes it difficult
19582 to handle something like `f()'. We want to notice that there are
19583 no decl-specifiers, and therefore realize that this is an
19584 expression, not a declaration.)
19586 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19587 the declarator is a direct-declarator of the form "(...)".
19589 MEMBER_P is true iff this declarator is a member-declarator.
19591 FRIEND_P is true iff this declarator is a friend. */
19595 cp_parser_declarator_kind dcl_kind,
19599 {
19602 cp_cv_quals cv_quals;
19603 tree class_type;
19606 /* Assume this is not a constructor, destructor, or type-conversion
19607 operator. */
19614 /* Check for the ptr-operator production. */
19616 /* Parse the ptr-operator. */
19622 /* If that worked, then we have a ptr-operator. */
19624 {
19625 /* If a ptr-operator was found, then this declarator was not
19626 parenthesized. */
19629 /* The dependent declarator is optional if we are parsing an
19630 abstract-declarator. */
19634 /* Parse the dependent declarator. */
19639 friend_p);
19641 /* If we are parsing an abstract-declarator, we must handle the
19642 case where the dependent declarator is absent. */
19647 declarator = cp_parser_make_indirect_declarator
19649 }
19650 /* Everything else is a direct-declarator. */
19651 else
19652 {
19655 CPP_OPEN_PAREN);
19657 ctor_dtor_or_conv_p,
19659 }
19664 }
19666 /* Parse a direct-declarator or direct-abstract-declarator.
19668 direct-declarator:
19669 declarator-id
19670 direct-declarator ( parameter-declaration-clause )
19671 cv-qualifier-seq [opt]
19672 ref-qualifier [opt]
19673 exception-specification [opt]
19674 direct-declarator [ constant-expression [opt] ]
19675 ( declarator )
19677 direct-abstract-declarator:
19678 direct-abstract-declarator [opt]
19679 ( parameter-declaration-clause )
19680 cv-qualifier-seq [opt]
19681 ref-qualifier [opt]
19682 exception-specification [opt]
19683 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19684 ( abstract-declarator )
19686 Returns a representation of the declarator. DCL_KIND is
19687 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19688 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19689 we are parsing a direct-declarator. It is
19690 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19691 of ambiguity we prefer an abstract declarator, as per
19692 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19693 as for cp_parser_declarator. */
19697 cp_parser_declarator_kind dcl_kind,
19700 {
19710 {
19711 /* Peek at the next token. */
19714 {
19715 /* This is either a parameter-declaration-clause, or a
19716 parenthesized declarator. When we know we are parsing a
19717 named declarator, it must be a parenthesized declarator
19718 if FIRST is true. For instance, `(int)' is a
19719 parameter-declaration-clause, with an omitted
19720 direct-abstract-declarator. But `((*))', is a
19721 parenthesized abstract declarator. Finally, when T is a
19722 template parameter `(T)' is a
19723 parameter-declaration-clause, and not a parenthesized
19724 named declarator.
19726 We first try and parse a parameter-declaration-clause,
19727 and then try a nested declarator (if FIRST is true).
19729 It is not an error for it not to be a
19730 parameter-declaration-clause, even when FIRST is
19731 false. Consider,
19733 int i (int);
19734 int i (3);
19736 The first is the declaration of a function while the
19737 second is the definition of a variable, including its
19738 initializer.
19740 Having seen only the parenthesis, we cannot know which of
19741 these two alternatives should be selected. Even more
19742 complex are examples like:
19744 int i (int (a));
19745 int i (int (3));
19747 The former is a function-declaration; the latter is a
19748 variable initialization.
19750 Thus again, we try a parameter-declaration-clause, and if
19751 that fails, we back out and return. */
19754 {
19755 tree params;
19758 /* In a member-declarator, the only valid interpretation
19759 of a parenthesis is the start of a
19760 parameter-declaration-clause. (It is invalid to
19761 initialize a static data member with a parenthesized
19762 initializer; only the "=" form of initialization is
19763 permitted.) */
19767 /* Consume the `('. */
19770 {
19771 /* If this is going to be an abstract declarator, we're
19772 in a declarator and we can't have default args. */
19775 }
19779 /* Parse the parameter-declaration-clause. */
19782 /* Consume the `)'. */
19785 /* If all went well, parse the cv-qualifier-seq,
19786 ref-qualifier and the exception-specification. */
19788 {
19789 cp_cv_quals cv_quals;
19790 cp_virt_specifiers virt_specifiers;
19791 cp_ref_qualifier ref_qual;
19792 tree exception_specification;
19793 tree late_return;
19794 tree attrs;
19804 /* Parse the cv-qualifier-seq. */
19806 /* Parse the ref-qualifier. */
19808 /* Parse the tx-qualifier. */
19810 /* And the exception-specification. */
19811 exception_specification
19816 /* In here, we handle cases where attribute is used after
19817 the function declaration. For example:
19818 void func (int x) __attribute__((vector(..))); */
19822 {
19826 CPP_SEMICOLON)
19828 CPP_OPEN_BRACE))
19831 ;
19832 else
19834 }
19836 late_return = (cp_parser_late_return_type_opt
19840 /* Parse the virt-specifier-seq. */
19843 /* Create the function-declarator. */
19845 params,
19846 cv_quals,
19847 virt_specifiers,
19848 ref_qual,
19849 tx_qual,
19850 exception_specification,
19851 late_return,
19852 requires_clause);
19855 /* Any subsequent parameter lists are to do with
19856 return type, so are not those of the declared
19857 function. */
19859 }
19861 /* Remove the function parms from scope. */
19865 /* Repeat the main loop. */
19867 }
19869 /* If this is the first, we can try a parenthesized
19870 declarator. */
19872 {
19878 /* Consume the `('. */
19880 /* Parse the nested declarator. */
19883 declarator
19889 /* Expect a `)'. */
19896 }
19897 /* Otherwise, we must be done. */
19898 else
19900 }
19904 {
19905 /* Parse an array-declarator. */
19914 /* Consume the `['. */
19916 /* Peek at the next token. */
19918 /* If the next token is `]', then there is no
19919 constant-expression. */
19921 {
19923 bounds
19933 {
19934 /* Normally, the array bound must be an integral constant
19935 expression. However, as an extension, we allow VLAs
19936 in function scopes as long as they aren't part of a
19937 parameter declaration. */
19941 }
19944 {
19945 /* Remember this wasn't a constant-expression. */
19948 }
19949 }
19950 else
19952 /* Look for the closing `]'. */
19954 {
19957 }
19962 }
19964 {
19965 {
19966 tree qualifying_scope;
19967 tree unqualified_name;
19968 tree attrs;
19969 special_function_kind sfk;
19974 /* Parse a declarator-id */
19977 {
19980 /* If we see an ellipsis, we should be looking at a
19981 parameter pack. */
19983 {
19984 /* Consume the `...' */
19988 }
19989 }
19992 unqualified_name
19996 {
20000 {
20001 /* Check whether an error occurred. */
20004 /* We already consumed the ellipsis to mark a
20005 parameter pack, but we have no way to report it,
20006 so abort the tentative parse. We will be exiting
20007 immediately anyway. */
20009 }
20010 else
20016 && (qualifying_scope
20018 {
20021 }
20022 }
20027 {
20032 }
20038 {
20039 /* In the declaration of a member of a template class
20040 outside of the class itself, the SCOPE will sometimes
20041 be a TYPENAME_TYPE. For example, given:
20043 template <typename T>
20044 int S<T>::R::i = 3;
20046 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20047 this context, we must resolve S<T>::R to an ordinary
20048 type, rather than a typename type.
20050 The reason we normally avoid resolving TYPENAME_TYPEs
20051 is that a specialization of `S' might render
20052 `S<T>::R' not a type. However, if `S' is
20053 specialized, then this `i' will not be used, so there
20054 is no harm in resolving the types here. */
20055 tree type;
20057 /* Resolve the TYPENAME_TYPE. */
20060 /* If that failed, the declarator is invalid. */
20062 {
20065 "cannot define member of dependent typedef "
20067 else
20072 }
20074 }
20079 {
20080 tree class_type;
20085 else
20089 {
20092 {
20095 {
20099 "use %<%T::%D%> instead of %<%T::%D%> to "
20101 class_type,
20106 }
20107 else
20109 }
20110 else
20111 {
20112 /* We do not attempt to print the declarator
20113 here because we do not have enough
20114 information about its original syntactic
20115 form. */
20119 }
20120 }
20123 {
20130 for an unnamed type, even if the type
20131 got a name for linkage purposes. */
20133 /* Handle correctly (c++/19200):
20135 struct S {
20136 struct T{};
20137 friend void S(T);
20138 };
20140 and also:
20142 namespace N {
20143 void S();
20144 }
20146 struct S {
20147 friend void N::S();
20148 }; */
20149 && !(friend_p
20152 class_type))
20153 {
20156 }
20164 }
20165 }
20167 unqualified_name,
20168 sfk);
20175 }
20177 handle_declarator:;
20180 {
20181 /* Any names that appear after the declarator-id for a
20182 member are looked up in the containing scope. */
20184 {
20185 /* But declarations with qualified-ids can't appear in a
20186 function. */
20190 }
20192 }
20196 /* Default args are only allowed on function
20197 declarations. */
20199 else
20203 }
20204 /* We're done. */
20205 else
20207 }
20209 /* For an abstract declarator, we might wind up with nothing at this
20210 point. That's an error; the declarator is not optional. */
20214 /* If we entered a scope, we must exit it now. */
20222 }
20224 /* Parse a ptr-operator.
20226 ptr-operator:
20227 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20228 * cv-qualifier-seq [opt]
20229 &
20230 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20231 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20233 GNU Extension:
20235 ptr-operator:
20236 & cv-qualifier-seq [opt]
20238 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20239 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20240 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20241 filled in with the TYPE containing the member. *CV_QUALS is
20242 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20243 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20244 Note that the tree codes returned by this function have nothing
20245 to do with the types of trees that will be eventually be created
20246 to represent the pointer or reference type being parsed. They are
20247 just constants with suggestive names. */
20248 static enum tree_code
20253 {
20258 /* Assume that it's not a pointer-to-member. */
20260 /* And that there are no cv-qualifiers. */
20263 /* Peek at the next token. */
20266 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20276 {
20277 /* Consume the `*', `&' or `&&'. */
20280 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20281 `&', if we are allowing GNU extensions. (The only qualifier
20282 that can legally appear after `&' is `restrict', but that is
20283 enforced during semantic analysis. */
20291 }
20292 else
20293 {
20294 /* Try the pointer-to-member case. */
20296 /* Look for the optional `::' operator. */
20299 /* Look for the nested-name specifier. */
20306 /* If we found it, and the next token is a `*', then we are
20307 indeed looking at a pointer-to-member operator. */
20310 {
20311 /* Indicate that the `*' operator was used. */
20319 else
20320 {
20321 /* The type of which the member is a member is given by the
20322 current SCOPE. */
20324 /* The next name will not be qualified. */
20328 /* Look for optional c++11 attributes. */
20332 /* Look for the optional cv-qualifier-seq. */
20334 }
20335 }
20336 /* If that didn't work we don't have a ptr-operator. */
20339 }
20342 }
20344 /* Parse an (optional) cv-qualifier-seq.
20346 cv-qualifier-seq:
20347 cv-qualifier cv-qualifier-seq [opt]
20349 cv-qualifier:
20350 const
20351 volatile
20353 GNU Extension:
20355 cv-qualifier:
20356 __restrict__
20358 Returns a bitmask representing the cv-qualifiers. */
20360 static cp_cv_quals
20362 {
20366 {
20368 cp_cv_quals cv_qualifier;
20370 /* Peek at the next token. */
20372 /* See if it's a cv-qualifier. */
20374 {
20390 }
20396 {
20401 }
20402 else
20403 {
20406 }
20407 }
20410 }
20412 /* Parse an (optional) ref-qualifier
20414 ref-qualifier:
20415 &
20416 &&
20418 Returns cp_ref_qualifier representing ref-qualifier. */
20420 static cp_ref_qualifier
20422 {
20425 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20430 {
20435 {
20447 }
20452 {
20455 }
20456 else
20457 {
20460 }
20461 }
20464 }
20466 /* Parse an optional tx-qualifier.
20468 tx-qualifier:
20469 transaction_safe
20470 transaction_safe_dynamic */
20472 static tree
20474 {
20477 {
20482 {
20486 {
20489 {
20492 }
20493 else
20495 }
20496 }
20497 }
20499 }
20501 /* Parse an (optional) virt-specifier-seq.
20503 virt-specifier-seq:
20504 virt-specifier virt-specifier-seq [opt]
20506 virt-specifier:
20507 override
20508 final
20510 Returns a bitmask representing the virt-specifiers. */
20512 static cp_virt_specifiers
20514 {
20518 {
20520 cp_virt_specifiers virt_specifier;
20522 /* Peek at the next token. */
20524 /* See if it's a virt-specifier-qualifier. */
20528 {
20531 }
20533 {
20536 }
20538 {
20540 }
20541 else
20545 {
20550 }
20551 else
20552 {
20555 }
20556 }
20558 }
20560 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20561 is in scope even though it isn't real. */
20563 void
20565 {
20566 tree this_parm;
20569 {
20570 /* We don't clear this between NSDMIs. Is it already what we want? */
20575 }
20578 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20580 current_class_ref
20583 }
20585 /* Return true iff our current scope is a non-static data member
20586 initializer. */
20588 bool
20590 {
20591 /* We recognize NSDMI context by the context-less 'this' pointer set up
20592 by the function above. */
20598 }
20600 /* Return true iff our current scope is a default capturing generic lambda
20601 defined within a template. FIXME: This is part of a workaround (see
20602 semantics.c) to handle building lambda closure types correctly in templates
20603 which we ultimately want to defer to instantiation time. */
20605 bool
20607 {
20625 }
20627 /* Parse a late-specified return type, if any. This is not a separate
20628 non-terminal, but part of a function declarator, which looks like
20630 -> trailing-type-specifier-seq abstract-declarator(opt)
20632 Returns the type indicated by the type-id.
20634 In addition to this, parse any queued up #pragma omp declare simd
20635 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20636 #pragma acc routine clauses.
20638 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20639 function. */
20641 static tree
20644 {
20648 && declarator
20655 && declarator
20658 /* Peek at the next token. */
20660 /* A late-specified return type is indicated by an initial '->'. */
20671 {
20672 /* DR 1207: 'this' is in scope in the trailing return type. */
20674 }
20677 {
20678 /* Consume the ->. */
20682 }
20684 /* Function declarations may be followed by a trailing
20685 requires-clause. */
20689 declarator->attributes
20693 declarator->attributes
20697 declarator->attributes
20702 {
20705 }
20708 }
20710 /* Parse a declarator-id.
20712 declarator-id:
20713 id-expression
20714 :: [opt] nested-name-specifier [opt] type-name
20716 In the `id-expression' case, the value returned is as for
20717 cp_parser_id_expression if the id-expression was an unqualified-id.
20718 If the id-expression was a qualified-id, then a SCOPE_REF is
20719 returned. The first operand is the scope (either a NAMESPACE_DECL
20720 or TREE_TYPE), but the second is still just a representation of an
20721 unqualified-id. */
20723 static tree
20725 {
20726 tree id;
20727 /* The expression must be an id-expression. Assume that qualified
20728 names are the names of types so that:
20730 template <class T>
20731 int S<T>::R::i = 3;
20733 will work; we must treat `S<T>::R' as the name of a type.
20734 Similarly, assume that qualified names are templates, where
20735 required, so that:
20737 template <class T>
20738 int S<T>::R<T>::i = 3;
20740 will work, too. */
20746 optional_p);
20750 }
20752 /* Parse a type-id.
20754 type-id:
20755 type-specifier-seq abstract-declarator [opt]
20757 Returns the TYPE specified. */
20759 static tree
20762 {
20763 cp_decl_specifier_seq type_specifier_seq;
20766 /* Parse the type-specifier-seq. */
20768 is_trailing_return,
20773 /* A bare template name as a template argument is a template template
20774 argument, not a placeholder, so fail parsing it as a type argument. */
20775 {
20779 }
20783 /* There might or might not be an abstract declarator. */
20785 /* Look for the declarator. */
20786 abstract_declarator
20791 /* Check to see if there really was a declarator. */
20796 /* The concepts TS allows 'auto' as a type-id. */
20798 /* None of the valid uses of 'auto' in C++14 involve the type-id
20799 nonterminal, but it is valid in a trailing-return-type. */
20802 {
20803 /* A type-id with type 'auto' is only ok if the abstract declarator
20804 is a function declarator with a late-specified return type.
20806 A type-id with 'auto' is also valid in a trailing-return-type
20807 in a compound-requirement. */
20814 else
20815 {
20818 {
20820 auto_node);
20822 tmpl);
20823 }
20824 else
20827 }
20828 }
20831 is_template_arg);
20832 }
20834 static tree
20836 {
20838 }
20840 static tree
20842 {
20843 tree r;
20845 parser->type_definition_forbidden_message
20850 {
20853 }
20855 }
20857 static tree
20859 {
20861 }
20863 /* Parse a type-specifier-seq.
20865 type-specifier-seq:
20866 type-specifier type-specifier-seq [opt]
20868 GNU extension:
20870 type-specifier-seq:
20871 attributes type-specifier-seq [opt]
20873 If IS_DECLARATION is true, we are at the start of a "condition" or
20874 exception-declaration, so we might be followed by a declarator-id.
20876 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20877 i.e. we've just seen "->".
20879 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20881 static void
20886 {
20891 /* Clear the TYPE_SPECIFIER_SEQ. */
20894 /* In the context of a trailing return type, enum E { } is an
20895 elaborated-type-specifier followed by a function-body, not an
20896 enum-specifier. */
20900 /* Parse the type-specifiers and attributes. */
20902 {
20903 tree type_specifier;
20906 /* Check for attributes first. */
20908 {
20913 }
20915 /* record the token of the beginning of the type specifier seq,
20916 for error reporting purposes*/
20920 /* Look for the type-specifier. */
20922 flags,
20923 type_specifier_seq,
20925 NULL,
20928 {
20929 /* If the first type-specifier could not be found, this is not a
20930 type-specifier-seq at all. */
20932 {
20933 /* Set in_declarator_p to avoid skipping to the semicolon. */
20945 }
20946 /* If subsequent type-specifiers could not be found, the
20947 type-specifier-seq is complete. */
20949 }
20952 /* The standard says that a condition can be:
20954 type-specifier-seq declarator = assignment-expression
20956 However, given:
20958 struct S {};
20959 if (int S = ...)
20961 we should treat the "S" as a declarator, not as a
20962 type-specifier. The standard doesn't say that explicitly for
20963 type-specifier-seq, but it does say that for
20964 decl-specifier-seq in an ordinary declaration. Perhaps it
20965 would be clearer just to allow a decl-specifier-seq here, and
20966 then add a semantic restriction that if any decl-specifiers
20967 that are not type-specifiers appear, the program is invalid. */
20970 }
20971 }
20973 /* Return whether the function currently being declared has an associated
20974 template parameter list. */
20976 static bool
20978 {
20991 }
20993 /* Parse a parameter-declaration-clause.
20995 parameter-declaration-clause:
20996 parameter-declaration-list [opt] ... [opt]
20997 parameter-declaration-list , ...
20999 Returns a representation for the parameter declarations. A return
21000 value of NULL indicates a parameter-declaration-clause consisting
21001 only of an ellipsis. */
21003 static tree
21005 {
21006 tree parameters;
21015 parser->auto_is_implicit_function_template_parm_p
21017 }
21023 && !processing_template_parmlist
21029 /* Peek at the next token. */
21031 /* Check for trivial parameter-declaration-clauses. */
21033 {
21034 /* Consume the `...' token. */
21037 }
21039 /* There are no parameters. */
21040 {
21041 #ifndef NO_IMPLICIT_EXTERN_C
21046 else
21047 #endif
21049 }
21050 /* Check for `(void)', too, which is a special case. */
21054 {
21055 /* Consume the `void' token. */
21057 /* There are no parameters. */
21059 }
21061 /* Parse the parameter-declaration-list. */
21063 /* If a parse error occurred while parsing the
21064 parameter-declaration-list, then the entire
21065 parameter-declaration-clause is erroneous. */
21069 /* Peek at the next token. */
21071 /* If it's a `,', the clause should terminate with an ellipsis. */
21073 {
21074 /* Consume the `,'. */
21076 /* Expect an ellipsis. */
21077 ellipsis_p
21079 }
21080 /* It might also be `...' if the optional trailing `,' was
21081 omitted. */
21083 {
21084 /* Consume the `...' token. */
21086 /* And remember that we saw it. */
21088 }
21089 else
21092 /* Finish the parameter list. */
21097 }
21099 /* Parse a parameter-declaration-list.
21101 parameter-declaration-list:
21102 parameter-declaration
21103 parameter-declaration-list , parameter-declaration
21105 Returns a representation of the parameter-declaration-list, as for
21106 cp_parser_parameter_declaration_clause. However, the
21107 `void_list_node' is never appended to the list. Upon return,
21108 *IS_ERROR will be true iff an error occurred. */
21110 static tree
21112 {
21118 /* Assume all will go well. */
21120 /* The special considerations that apply to a function within an
21121 unbraced linkage specifications do not apply to the parameters
21122 to the function. */
21123 saved_in_unbraced_linkage_specification_p
21127 /* Look for more parameters. */
21129 {
21137 /* Parse the parameter. */
21138 parameter
21143 /* We don't know yet if the enclosing context is deprecated, so wait
21144 and warn in grokparms if appropriate. */
21148 {
21149 /* If a function parameter pack was specified and an implicit template
21150 parameter was introduced during cp_parser_parameter_declaration,
21151 change any implicit parameters introduced into packs. */
21155 {
21163 }
21167 PARM,
21170 }
21174 /* If a parse error occurred parsing the parameter declaration,
21175 then the entire parameter-declaration-list is erroneous. */
21177 {
21181 }
21191 {
21195 }
21197 /* Add the new parameter to the list. */
21201 /* Peek at the next token. */
21204 /* These are for Objective-C++ */
21207 /* The parameter-declaration-list is complete. */
21210 {
21213 /* Peek at the next token. */
21215 /* If it's an ellipsis, then the list is complete. */
21218 /* Otherwise, there must be more parameters. Consume the
21219 `,'. */
21221 /* When parsing something like:
21223 int i(float f, double d)
21225 we can tell after seeing the declaration for "f" that we
21226 are not looking at an initialization of a variable "i",
21227 but rather at the declaration of a function "i".
21229 Due to the fact that the parsing of template arguments
21230 (as specified to a template-id) requires backtracking we
21231 cannot use this technique when inside a template argument
21232 list. */
21236 /* However, a parameter-declaration of the form
21237 "float(f)" (which is a valid declaration of a
21238 parameter "f") can also be interpreted as an
21239 expression (the conversion of "f" to "float"). */
21242 }
21243 else
21244 {
21252 }
21253 }
21255 parser->in_unbraced_linkage_specification_p
21258 /* Reset implicit_template_scope if we are about to leave the function
21259 parameter list that introduced it. Note that for out-of-line member
21260 definitions, there will be one or more class scopes before we get to
21261 the template parameter scope. */
21265 {
21269 {
21272 }
21273 }
21276 }
21278 /* Parse a parameter declaration.
21280 parameter-declaration:
21281 decl-specifier-seq ... [opt] declarator
21282 decl-specifier-seq declarator = assignment-expression
21283 decl-specifier-seq ... [opt] abstract-declarator [opt]
21284 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21286 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21287 declares a template parameter. (In that case, a non-nested `>'
21288 token encountered during the parsing of the assignment-expression
21289 is not interpreted as a greater-than operator.)
21291 Returns a representation of the parameter, or NULL if an error
21292 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21293 true iff the declarator is of the form "(p)". */
21299 {
21301 cp_decl_specifier_seq decl_specifiers;
21303 tree default_argument;
21308 /* In a template parameter, `>' is not an operator.
21310 [temp.param]
21312 When parsing a default template-argument for a non-type
21313 template-parameter, the first non-nested `>' is taken as the end
21314 of the template parameter-list rather than a greater-than
21315 operator. */
21317 /* Type definitions may not appear in parameter types. */
21319 parser->type_definition_forbidden_message
21322 /* Parse the declaration-specifiers. */
21324 CP_PARSER_FLAGS_NONE,
21328 /* Complain about missing 'typename' or other invalid type names. */
21333 /* If an error occurred, there's no reason to attempt to parse the
21334 rest of the declaration. */
21336 {
21339 }
21341 /* Peek at the next token. */
21344 /* If the next token is a `)', `,', `=', `>', or `...', then there
21345 is no declarator. However, when variadic templates are enabled,
21346 there may be a declarator following `...'. */
21351 {
21355 }
21356 /* Otherwise, there should be a declarator. */
21357 else
21358 {
21362 /* After seeing a decl-specifier-seq, if the next token is not a
21363 "(", there is no possibility that the code is a valid
21364 expression. Therefore, if parsing tentatively, we commit at
21365 this point. */
21367 /* In an expression context, having seen:
21369 (int((char ...
21371 we cannot be sure whether we are looking at a
21372 function-type (taking a "char" as a parameter) or a cast
21373 of some object of type "char" to "int". */
21379 /* Parse the declarator. */
21382 CP_PARSER_DECLARATOR_EITHER,
21384 parenthesized_p,
21388 /* After the declarator, allow more attributes. */
21389 decl_specifiers.attributes
21393 /* If the declarator is a template parameter pack, remember that and
21394 clear the flag in the declarator itself so we don't get errors
21395 from grokdeclarator. */
21397 {
21400 }
21401 }
21403 /* If the next token is an ellipsis, and we have not seen a declarator
21404 name, and if either the type of the declarator contains parameter
21405 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21406 for, eg, abbreviated integral type names), then we actually have a
21407 parameter pack expansion expression. Otherwise, leave the ellipsis
21408 for a C-style variadic function. */
21411 {
21422 {
21423 /* Consume the `...'. */
21427 /* Build a pack expansion type */
21432 else
21434 }
21435 }
21437 /* The restriction on defining new types applies only to the type
21438 of the parameter, not to the default argument. */
21441 /* If the next token is `=', then process a default argument. */
21443 {
21446 /* If we are defining a class, then the tokens that make up the
21447 default argument must be saved and processed later. */
21453 // A constrained-type-specifier may declare a type template-parameter.
21455 default_argument
21458 // A constrained-type-specifier may declare a template-template-parameter.
21460 default_argument
21463 /* Outside of a class definition, we can just parse the
21464 assignment-expression. */
21465 else
21466 default_argument
21470 {
21472 "default arguments are only "
21474 }
21476 || template_parameter_pack_p
21479 {
21480 /* Find the name of the parameter pack. */
21487 template_parm_p
21493 else
21495 template_parm_p
21502 }
21503 }
21504 else
21508 declarator,
21509 default_argument,
21510 template_parameter_pack_p);
21511 }
21513 /* Parse a default argument and return it.
21515 TEMPLATE_PARM_P is true if this is a default argument for a
21516 non-type template parameter. */
21517 static tree
21519 {
21525 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21526 set correctly. */
21529 /* Local variable names (and the `this' keyword) may not
21530 appear in a default argument. */
21533 /* Parse the assignment-expression. */
21538 /* The "this" pointer is not valid in a default argument. */
21540 {
21545 }
21546 default_argument
21548 /* Restore the "this" pointer. */
21550 {
21553 }
21562 }
21564 /* Parse a function-body.
21566 function-body:
21567 compound_statement */
21569 static void
21571 {
21575 }
21577 /* Parse a ctor-initializer-opt followed by a function-body. Return
21578 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21579 is true we are parsing a function-try-block. */
21581 static bool
21584 {
21592 /* Begin the function body. */
21594 /* Parse the optional ctor-initializer. */
21597 /* If we're parsing a constexpr constructor definition, we need
21598 to check that the constructor body is indeed empty. However,
21599 before we get to cp_parser_function_body lot of junk has been
21600 generated, so we can't just check that we have an empty block.
21601 Rather we take a snapshot of the outermost block, and check whether
21602 cp_parser_function_body changed its state. */
21604 {
21608 }
21609 /* Parse the function-body. */
21613 /* Finish the function body. */
21617 }
21619 /* Parse an initializer.
21621 initializer:
21622 = initializer-clause
21623 ( expression-list )
21625 Returns an expression representing the initializer. If no
21626 initializer is present, NULL_TREE is returned.
21628 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21629 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21630 set to TRUE if there is no initializer present. If there is an
21631 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21632 is set to true; otherwise it is set to false. */
21634 static tree
21637 {
21639 tree init;
21641 /* Peek at the next token. */
21644 /* Let our caller know whether or not this initializer was
21645 parenthesized. */
21647 /* Assume that the initializer is constant. */
21651 {
21652 /* Consume the `='. */
21654 /* Parse the initializer-clause. */
21656 }
21658 {
21663 non_constant_p);
21668 }
21670 {
21675 }
21676 else
21677 {
21678 /* Anything else is an error. */
21681 }
21687 }
21689 /* Parse an initializer-clause.
21691 initializer-clause:
21692 assignment-expression
21693 braced-init-list
21695 Returns an expression representing the initializer.
21697 If the `assignment-expression' production is used the value
21698 returned is simply a representation for the expression.
21700 Otherwise, calls cp_parser_braced_list. */
21702 static cp_expr
21704 {
21705 cp_expr initializer;
21707 /* Assume the expression is constant. */
21710 /* If it is not a `{', then we are looking at an
21711 assignment-expression. */
21713 {
21714 initializer
21717 non_constant_p);
21718 }
21719 else
21723 }
21725 /* Parse a brace-enclosed initializer list.
21727 braced-init-list:
21728 { initializer-list , [opt] }
21729 { }
21731 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21732 the elements of the initializer-list (or NULL, if the last
21733 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21734 NULL_TREE. There is no way to detect whether or not the optional
21735 trailing `,' was provided. NON_CONSTANT_P is as for
21736 cp_parser_initializer. */
21738 static cp_expr
21740 {
21741 tree initializer;
21744 /* Consume the `{' token. */
21746 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21748 /* If it's not a `}', then there is a non-trivial initializer. */
21750 {
21751 /* Parse the initializer list. */
21754 /* A trailing `,' token is allowed. */
21757 }
21758 else
21760 /* Now, there should be a trailing `}'. */
21766 /* Build a location of the form:
21767 { ... }
21768 ^~~~~~~
21769 with caret==start at the open brace, finish at the close brace. */
21773 }
21775 /* Consume tokens up to, and including, the next non-nested closing `]'.
21776 Returns true iff we found a closing `]'. */
21778 static bool
21780 {
21784 {
21788 {
21791 /* If we've run out of tokens, then there is no closing `]'. */
21800 {
21803 }
21808 }
21810 /* Consume the token. */
21812 }
21813 }
21815 /* Return true if we are looking at an array-designator, false otherwise. */
21817 static bool
21819 {
21820 /* Consume the `['. */
21825 /* Skip tokens until the next token is a closing square bracket.
21826 If we find the closing `]', and the next token is a `=', then
21827 we are looking at an array designator. */
21828 bool array_designator_p
21832 /* Roll back the tokens we skipped. */
21836 }
21838 /* Parse an initializer-list.
21840 initializer-list:
21841 initializer-clause ... [opt]
21842 initializer-list , initializer-clause ... [opt]
21844 GNU Extension:
21846 initializer-list:
21847 designation initializer-clause ...[opt]
21848 initializer-list , designation initializer-clause ...[opt]
21850 designation:
21851 . identifier =
21852 identifier :
21853 [ constant-expression ] =
21855 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21856 for the initializer. If the INDEX of the elt is non-NULL, it is the
21857 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21858 as for cp_parser_initializer. */
21862 {
21865 /* Assume all of the expressions are constant. */
21868 /* Parse the rest of the list. */
21870 {
21872 tree designator;
21873 tree initializer;
21876 /* If the next token is an identifier and the following one is a
21877 colon, we are looking at the GNU designated-initializer
21878 syntax. */
21882 {
21883 /* Warn the user that they are using an extension. */
21886 /* Consume the identifier. */
21888 /* Consume the `:'. */
21890 }
21891 /* Also handle the C99 syntax, '. id ='. */
21896 {
21897 /* Warn the user that they are using an extension. */
21900 /* Consume the `.'. */
21902 /* Consume the identifier. */
21904 /* Consume the `='. */
21906 }
21907 /* Also handle C99 array designators, '[ const ] ='. */
21911 {
21912 /* In C++11, [ could start a lambda-introducer. */
21918 {
21921 }
21922 else
21923 {
21928 }
21934 }
21935 else
21938 /* Parse the initializer. */
21941 /* If any clause is non-constant, so is the entire initializer. */
21945 /* If we have an ellipsis, this is an initializer pack
21946 expansion. */
21948 {
21949 /* Consume the `...'. */
21952 /* Turn the initializer into an initializer expansion. */
21954 }
21956 /* Add it to the vector. */
21959 /* If the next token is not a comma, we have reached the end of
21960 the list. */
21964 /* Peek at the next token. */
21966 /* If the next token is a `}', then we're still done. An
21967 initializer-clause can have a trailing `,' after the
21968 initializer-list and before the closing `}'. */
21972 /* Consume the `,' token. */
21974 }
21977 }
21979 /* Classes [gram.class] */
21981 /* Parse a class-name.
21983 class-name:
21984 identifier
21985 template-id
21987 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21988 to indicate that names looked up in dependent types should be
21989 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21990 keyword has been used to indicate that the name that appears next
21991 is a template. TAG_TYPE indicates the explicit tag given before
21992 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21993 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21994 is the class being defined in a class-head. If ENUM_OK is TRUE,
21995 enum-names are also accepted.
21997 Returns the TYPE_DECL representing the class. */
21999 static tree
22008 {
22009 tree decl;
22010 tree scope;
22015 /* All class-names start with an identifier. */
22018 {
22021 }
22023 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22024 to a template-id, so we save it here. */
22029 /* Any name names a type if we're following the `typename' keyword
22030 in a qualified name where the enclosing scope is type-dependent. */
22033 /* Handle the common case (an identifier, but not a template-id)
22034 efficiently. */
22037 {
22041 /* Look for the identifier. */
22045 /* If the next token isn't an identifier, we are certainly not
22046 looking at a class-name. */
22049 /* If we know this is a type-name, there's no need to look it
22050 up. */
22053 else
22054 {
22055 tree ambiguous_decls;
22056 /* If we already know that this lookup is ambiguous, then
22057 we've already issued an error message; there's no reason
22058 to check again. */
22060 {
22063 }
22064 /* If the next token is a `::', then the name must be a type
22065 name.
22067 [basic.lookup.qual]
22069 During the lookup for a name preceding the :: scope
22070 resolution operator, object, function, and enumerator
22071 names are ignored. */
22074 /* Look up the name. */
22076 tag_type,
22079 check_dependency_p,
22083 {
22087 }
22088 }
22089 }
22090 else
22091 {
22092 /* Try a template-id. */
22094 check_dependency_p,
22095 tag_type,
22096 is_declaration);
22099 }
22103 /* If this is a typename, create a TYPENAME_TYPE. */
22105 {
22110 }
22114 /* Check to see that it is really the name of a class. */
22118 /* Situations like this:
22120 template <typename T> struct A {
22121 typename T::template X<int>::I i;
22122 };
22124 are problematic. Is `T::template X<int>' a class-name? The
22125 standard does not seem to be definitive, but there is no other
22126 valid interpretation of the following `::'. Therefore, those
22127 names are considered class-names. */
22128 {
22132 }
22137 /* In Objective-C 2.0, a classname followed by '.' starts a
22138 dot-syntax expression, and it's not a type-name. */
22150 }
22152 /* Parse a class-specifier.
22154 class-specifier:
22155 class-head { member-specification [opt] }
22157 Returns the TREE_TYPE representing the class. */
22159 static tree
22161 {
22162 tree type;
22176 /* Parse the class-head. */
22179 /* If the class-head was a semantic disaster, skip the entire body
22180 of the class. */
22182 {
22186 }
22188 /* Look for the `{'. */
22190 {
22193 }
22198 /* Issue an error message if type-definitions are forbidden here. */
22200 /* Remember that we are defining one more class. */
22202 /* Inside the class, surrounding template-parameter-lists do not
22203 apply. */
22204 saved_num_template_parameter_lists
22207 /* We are not in a function body. */
22210 /* Or in a loop. */
22213 /* Or in a switch. */
22216 /* We are not immediately inside an extern "lang" block. */
22217 saved_in_unbraced_linkage_specification_p
22221 // Associate constraints with the type.
22225 /* Start the class. */
22227 {
22230 }
22234 /* If the type is erroneous, skip the entire body of the class. */
22236 else
22237 /* Parse the member-specification. */
22240 /* Look for the trailing `}'. */
22242 /* Look for trailing attributes to apply to this class. */
22250 /* We've finished a type definition. Check for the common syntax
22251 error of forgetting a semicolon after the definition. We need to
22252 be careful, as we can't just check for not-a-semicolon and be done
22253 with it; the user might have typed:
22255 class X { } c = ...;
22256 class X { } *p = ...;
22258 and so forth. Instead, enumerate all the possible tokens that
22259 might follow this production; if we don't see one of them, then
22260 complain and silently insert the semicolon. */
22261 {
22266 /* Don't try to parse c++11 attributes here. As per the
22267 grammar, that should be a task for
22268 cp_parser_decl_specifier_seq. */
22272 {
22283 /* While it's legal for type qualifiers and storage class
22284 specifiers to follow type definitions in the grammar, only
22285 compiler testsuites contain code like that. Assume that if
22286 we see such code, then what we're really seeing is a case
22287 like:
22289 class X { }
22290 const <type> var = ...;
22292 or
22294 class Y { }
22295 static <type> func (...) ...
22297 i.e. the qualifier or specifier applies to the next
22298 declaration. To do so, however, we need to look ahead one
22299 more token to see if *that* token is a type specifier.
22301 This code could be improved to handle:
22303 class Z { }
22304 static const <type> var = ...; */
22307 {
22310 /* Handling user-defined types here would be nice, but very
22311 tricky. */
22312 want_semicolon
22315 }
22319 }
22321 /* If we don't have a type, then something is very wrong and we
22322 shouldn't try to do anything clever. Likewise for not seeing the
22323 closing brace. */
22325 {
22326 /* Locate the closing brace. */
22327 cp_token_position prev
22332 /* We want to suggest insertion of a ';' immediately *after* the
22333 closing brace, so, if we can, offset the location by 1 column. */
22340 /* If we successfully offset the location, suggest the fix-it. */
22353 else
22356 /* Unget one token and smash it to look as though we encountered
22357 a semicolon in the input stream. */
22362 }
22363 }
22365 /* If this class is not itself within the scope of another class,
22366 then we need to parse the bodies of all of the queued function
22367 definitions. Note that the queued functions defined in a class
22368 are not always processed immediately following the
22369 class-specifier for that class. Consider:
22371 struct A {
22372 struct B { void f() { sizeof (A); } };
22373 };
22375 If `f' were processed before the processing of `A' were
22376 completed, there would be no way to compute the size of `A'.
22377 Note that the nesting we are interested in here is lexical --
22378 not the semantic nesting given by TYPE_CONTEXT. In particular,
22379 for:
22381 struct A { struct B; };
22382 struct A::B { void f() { } };
22384 there is no need to delay the parsing of `A::B::f'. */
22386 {
22387 tree decl;
22394 /* In a first pass, parse default arguments to the functions.
22395 Then, in a second pass, parse the bodies of the functions.
22396 This two-phased approach handles cases like:
22398 struct S {
22399 void f() { g(); }
22400 void g(int i = 3);
22401 };
22403 */
22405 {
22407 /* If there are default arguments that have not yet been processed,
22408 take care of them now. */
22410 {
22415 }
22416 /* Make sure that any template parameters are in scope. */
22418 /* Parse the default argument expressions. */
22420 /* Remove any template parameters from the symbol table. */
22422 }
22424 /* Now parse any NSDMIs. */
22428 {
22430 {
22435 }
22438 }
22445 /* Now do some post-NSDMI bookkeeping. */
22451 /* Now parse the body of the functions. */
22453 {
22454 /* OpenMP UDRs need to be parsed before all other functions. */
22461 }
22462 else
22466 }
22467 else
22470 /* Put back any saved access checks. */
22473 /* Restore saved state. */
22477 parser->num_template_parameter_lists
22479 parser->in_unbraced_linkage_specification_p
22483 }
22485 static tree
22487 {
22488 tree ret;
22493 }
22495 /* Parse a class-head.
22497 class-head:
22498 class-key identifier [opt] base-clause [opt]
22499 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22500 class-key nested-name-specifier [opt] template-id
22501 base-clause [opt]
22503 class-virt-specifier:
22504 final
22506 GNU Extensions:
22507 class-key attributes identifier [opt] base-clause [opt]
22508 class-key attributes nested-name-specifier identifier base-clause [opt]
22509 class-key attributes nested-name-specifier [opt] template-id
22510 base-clause [opt]
22512 Upon return BASES is initialized to the list of base classes (or
22513 NULL, if there are none) in the same form returned by
22514 cp_parser_base_clause.
22516 Returns the TYPE of the indicated class. Sets
22517 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22518 involving a nested-name-specifier was used, and FALSE otherwise.
22520 Returns error_mark_node if this is not a class-head.
22522 Returns NULL_TREE if the class-head is syntactically valid, but
22523 semantically invalid in a way that means we should skip the entire
22524 body of the class. */
22526 static tree
22529 {
22530 tree nested_name_specifier;
22534 tree attributes;
22535 tree bases;
22545 /* Assume no nested-name-specifier will be present. */
22547 /* Assume no template parameter lists will be used in defining the
22548 type. */
22552 /* Look for the class-key. */
22559 /* Parse the attributes. */
22562 /* If the next token is `::', that is invalid -- but sometimes
22563 people do try to write:
22565 struct ::S {};
22567 Handle this gracefully by accepting the extra qualifier, and then
22568 issuing an error about it later if this really is a
22569 class-head. If it turns out just to be an elaborated type
22570 specifier, remain silent. */
22576 /* Determine the name of the class. Begin by looking for an
22577 optional nested-name-specifier. */
22579 nested_name_specifier
22585 /* If there was a nested-name-specifier, then there *must* be an
22586 identifier. */
22588 {
22590 /* Although the grammar says `identifier', it really means
22591 `class-name' or `template-name'. You are only allowed to
22592 define a class that has already been declared with this
22593 syntax.
22595 The proposed resolution for Core Issue 180 says that wherever
22596 you see `class T::X' you should treat `X' as a type-name.
22598 It is OK to define an inaccessible class; for example:
22600 class A { class B; };
22601 class A::B {};
22603 We do not know if we will see a class-name, or a
22604 template-name. We look for a class-name first, in case the
22605 class-name is a template-id; if we looked for the
22606 template-name first we would stop after the template-name. */
22611 class_type,
22615 /* If that didn't work, ignore the nested-name-specifier. */
22617 {
22623 }
22624 /* If we could not find a corresponding TYPE, treat this
22625 declaration like an unqualified declaration. */
22628 /* Otherwise, count the number of templates used in TYPE and its
22629 containing scopes. */
22630 else
22631 {
22632 tree scope;
22644 }
22645 }
22646 /* Otherwise, the identifier is optional. */
22647 else
22648 {
22649 /* We don't know whether what comes next is a template-id,
22650 an identifier, or nothing at all. */
22652 /* Check for a template-id. */
22657 class_key,
22659 /* If that didn't work, it could still be an identifier. */
22661 {
22663 {
22666 }
22667 else
22669 }
22670 else
22671 {
22674 }
22675 }
22680 {
22682 class_key,
22684 }
22687 /* If it's not a `:' or a `{' then we can't really be looking at a
22688 class-head, since a class-head only appears as part of a
22689 class-specifier. We have to detect this situation before calling
22690 xref_tag, since that has irreversible side-effects. */
22692 {
22696 }
22698 /* At this point, we're going ahead with the class-specifier, even
22699 if some other problem occurs. */
22702 {
22707 }
22708 /* Issue the error about the overly-qualified name now. */
22710 {
22715 }
22717 {
22722 }
22724 {
22725 tree scope;
22727 /* Reject typedef-names in class heads. */
22729 {
22732 type);
22735 }
22737 /* Figure out in what scope the declaration is being placed. */
22739 /* If that scope does not contain the scope in which the
22740 class was originally declared, the program is invalid. */
22742 {
22745 "declaration of %qD in namespace %qD which does not "
22748 else
22754 }
22755 /* [dcl.meaning]
22757 A declarator-id shall not be qualified except for the
22758 definition of a ... nested class outside of its class
22759 ... [or] the definition or explicit instantiation of a
22760 class member of a namespace outside of its namespace. */
22762 {
22767 }
22768 }
22769 /* An explicit-specialization must be preceded by "template <>". If
22770 it is not, try to recover gracefully. */
22773 && !processing_template_parmlist
22775 {
22776 /* Build a location of this form:
22777 struct typename <ARGS>
22778 ^~~~~~~~~~~~~~~~~~~~~~
22779 with caret==start at the start token, and
22780 finishing at the end of the type. */
22781 location_t reported_loc
22783 class_head_start_location,
22788 error_at_rich_loc
22792 /* Take the same action that would have been taken by
22793 cp_parser_explicit_specialization. */
22796 }
22797 /* There must be no "return" statements between this point and the
22798 end of this function; set "type "to the correct return value and
22799 use "goto done;" to return. */
22800 /* Make sure that the right number of template parameters were
22801 present. */
22805 {
22806 /* If something went wrong, there is no point in even trying to
22807 process the class-definition. */
22810 }
22812 /* Look up the type. */
22814 {
22818 {
22822 }
22823 else
22824 {
22828 /* Check the scope while we still know whether or not we had a
22829 nested-name-specifier. */
22832 }
22835 }
22837 {
22838 tree class_type;
22840 /* Given:
22842 template <typename T> struct S { struct T };
22843 template <typename T> struct S<T>::T { };
22845 we will get a TYPENAME_TYPE when processing the definition of
22846 `S::T'. We need to resolve it to the actual type before we
22847 try to define it. */
22849 {
22854 else
22855 {
22858 }
22859 }
22863 {
22866 }
22869 /* Enter the scope indicated by the nested-name-specifier. */
22871 /* Get the canonical version of this type. */
22873 /* Call push_template_decl if it seems like we should be defining a
22874 template either from the template headers or the type we're
22875 defining, so that we diagnose both extra and missing headers. */
22879 {
22882 {
22885 }
22886 }
22890 }
22892 {
22893 /* If the class was unnamed, create a dummy name. */
22897 ? ts_within_enclosing_non_class
22901 }
22903 /* Indicate whether this class was declared as a `class' or as a
22904 `struct'. */
22909 /* If this type was already complete, and we see another definition,
22910 that's an error. */
22912 {
22914 type);
22916 type);
22919 }
22924 {
22925 /* Apply attributes now, before any use of the class as a template
22926 argument in its base list. */
22929 }
22931 /* We will have entered the scope containing the class; the names of
22932 base classes should be looked up in that context. For example:
22934 struct A { struct B {}; struct C; };
22935 struct A::C : B {};
22937 is valid. */
22939 /* Get the list of base-classes, if there is one. */
22941 {
22942 /* PR59482: enter the class scope so that base-specifiers are looked
22943 up correctly. */
22947 /* PR59482: get out of the previously pushed class scope so that the
22948 subsequent pops pop the right thing. */
22951 }
22952 else
22955 /* If we're really defining a class, process the base classes.
22956 If they're invalid, fail. */
22960 done:
22961 /* Leave the scope given by the nested-name-specifier. We will
22962 enter the class scope itself while processing the members. */
22967 {
22970 }
22976 out:
22979 }
22981 /* Parse a class-key.
22983 class-key:
22984 class
22985 struct
22986 union
22988 Returns the kind of class-key specified, or none_type to indicate
22989 error. */
22991 static enum tag_types
22993 {
22997 /* Look for the class-key. */
23002 /* Check to see if the TOKEN is a class-key. */
23007 }
23009 /* Parse a type-parameter-key.
23011 type-parameter-key:
23012 class
23013 typename
23014 */
23016 static void
23018 {
23019 /* Look for the type-parameter-key. */
23023 {
23026 /* typename is not allowed in a template template parameter
23027 by the standard until C++1Z. */
23029 "ISO C++ forbids typename key in template template parameter;"
23031 }
23032 else
23036 }
23038 /* Parse an (optional) member-specification.
23040 member-specification:
23041 member-declaration member-specification [opt]
23042 access-specifier : member-specification [opt] */
23044 static void
23046 {
23048 {
23052 /* Peek at the next token. */
23054 /* If it's a `}', or EOF then we've seen all the members. */
23060 /* See if this token is a keyword. */
23063 {
23067 /* Consume the access-specifier. */
23069 /* Remember which access-specifier is active. */
23071 /* Look for the `:'. */
23076 /* Accept #pragmas at class scope. */
23078 {
23081 }
23083 /* Otherwise, the next construction must be a
23084 member-declaration. */
23086 }
23087 }
23088 }
23090 /* Parse a member-declaration.
23092 member-declaration:
23093 decl-specifier-seq [opt] member-declarator-list [opt] ;
23094 function-definition ; [opt]
23095 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23096 using-declaration
23097 template-declaration
23098 alias-declaration
23100 member-declarator-list:
23101 member-declarator
23102 member-declarator-list , member-declarator
23104 member-declarator:
23105 declarator pure-specifier [opt]
23106 declarator constant-initializer [opt]
23107 identifier [opt] : constant-expression
23109 GNU Extensions:
23111 member-declaration:
23112 __extension__ member-declaration
23114 member-declarator:
23115 declarator attributes [opt] pure-specifier [opt]
23116 declarator attributes [opt] constant-initializer [opt]
23117 identifier [opt] attributes [opt] : constant-expression
23119 C++0x Extensions:
23121 member-declaration:
23122 static_assert-declaration */
23124 static void
23126 {
23127 cp_decl_specifier_seq decl_specifiers;
23128 tree prefix_attributes;
23129 tree decl;
23138 /* Check for the `__extension__' keyword. */
23140 {
23141 /* Recurse. */
23143 /* Restore the old value of the PEDANTIC flag. */
23147 }
23149 /* Check for a template-declaration. */
23151 {
23152 /* An explicit specialization here is an error condition, and we
23153 expect the specialization handler to detect and report this. */
23157 else
23161 }
23162 /* Check for a template introduction. */
23166 /* Check for a using-declaration. */
23168 {
23170 {
23171 /* Parse the using-declaration. */
23175 }
23176 else
23177 {
23178 tree decl;
23182 /* Note that if we actually see the '=' token after the
23183 identifier, cp_parser_alias_declaration commits the
23184 tentative parse. In that case, we really expect an
23185 alias-declaration. Otherwise, we expect a using
23186 declaration. */
23187 alias_decl_expected =
23193 else
23197 }
23198 }
23200 /* Check for @defs. */
23202 {
23207 {
23212 }
23214 }
23216 /* If the next token is `static_assert' we have a static assertion. */
23218 {
23221 }
23228 /* Parse the decl-specifier-seq. */
23231 CP_PARSER_FLAGS_OPTIONAL,
23234 /* Check for an invalid type-name. */
23238 /* If there is no declarator, then the decl-specifier-seq should
23239 specify a type. */
23241 {
23242 /* If there was no decl-specifier-seq, and the next token is a
23243 `;', then we have something like:
23245 struct S { ; };
23247 [class.mem]
23249 Each member-declaration shall declare at least one member
23250 name of the class. */
23252 {
23255 {
23259 }
23260 }
23261 else
23262 {
23263 tree type;
23265 /* See if this declaration is a friend. */
23267 /* If there were decl-specifiers, check to see if there was
23268 a class-declaration. */
23271 /* Nested classes have already been added to the class, but
23272 a `friend' needs to be explicitly registered. */
23274 {
23275 /* If the `friend' keyword was present, the friend must
23276 be introduced with a class-key. */
23279 "in C++03 a class-key must be used "
23281 /* In this case:
23283 template <typename T> struct A {
23284 friend struct A<T>::B;
23285 };
23287 A<T>::B will be represented by a TYPENAME_TYPE, and
23288 therefore not recognized by check_tag_decl. */
23290 {
23294 }
23297 "friend declaration does not name a class or "
23299 else
23302 }
23303 /* If there is no TYPE, an error message will already have
23304 been issued. */
23306 ;
23307 /* An anonymous aggregate has to be handled specially; such
23308 a declaration really declares a data member (with a
23309 particular type), as opposed to a nested class. */
23311 {
23312 /* C++11 9.5/6. */
23315 "a storage class on an anonymous aggregate "
23318 /* Remove constructors and such from TYPE, now that we
23319 know it is an anonymous aggregate. */
23321 /* And make the corresponding data member. */
23324 /* Add it to the class. */
23326 }
23327 else
23328 cp_parser_check_access_in_redeclaration
23331 }
23332 }
23333 else
23334 {
23337 /* Clear attributes from the decl_specifiers but keep them
23338 around as prefix attributes that apply them to the entity
23339 being declared. */
23343 /* See if these declarations will be friends. */
23346 /* Keep going until we hit the `;' at the end of the
23347 declaration. */
23349 {
23351 tree first_attribute;
23353 /* Peek at the next token. */
23356 /* Check for a bitfield declaration. */
23361 {
23362 tree identifier;
23363 tree width;
23365 /* Get the name of the bitfield. Note that we cannot just
23366 check TOKEN here because it may have been invalidated by
23367 the call to cp_lexer_peek_nth_token above. */
23370 else
23373 /* Consume the `:' token. */
23375 /* Get the width of the bitfield. */
23376 width
23379 /* Look for attributes that apply to the bitfield. */
23381 /* Remember which attributes are prefix attributes and
23382 which are not. */
23384 /* Combine the attributes. */
23387 /* Create the bitfield declaration. */
23390 identifier,
23391 sfk_none)
23394 width,
23395 attributes);
23396 }
23397 else
23398 {
23400 tree initializer;
23401 tree asm_specification;
23404 /* Parse the declarator. */
23405 declarator
23410 friend_p);
23412 /* If something went wrong parsing the declarator, make sure
23413 that we at least consume some tokens. */
23415 {
23416 /* Skip to the end of the statement. */
23418 /* If the next token is not a semicolon, that is
23419 probably because we just skipped over the body of
23420 a function. So, we consume a semicolon if
23421 present, but do not issue an error message if it
23422 is not present. */
23424 CPP_SEMICOLON))
23427 }
23430 cp_parser_check_for_definition_in_return_type
23434 /* Look for an asm-specification. */
23436 /* Look for attributes that apply to the declaration. */
23438 /* Remember which attributes are prefix attributes and
23439 which are not. */
23441 /* Combine the attributes. */
23444 /* If it's an `=', then we have a constant-initializer or a
23445 pure-specifier. It is not correct to parse the
23446 initializer before registering the member declaration
23447 since the member declaration should be in scope while
23448 its initializer is processed. However, the rest of the
23449 front end does not yet provide an interface that allows
23450 us to handle this correctly. */
23452 {
23453 /* In [class.mem]:
23455 A pure-specifier shall be used only in the declaration of
23456 a virtual function.
23458 A member-declarator can contain a constant-initializer
23459 only if it declares a static member of integral or
23460 enumeration type.
23462 Therefore, if the DECLARATOR is for a function, we look
23463 for a pure-specifier; otherwise, we look for a
23464 constant-initializer. When we call `grokfield', it will
23465 perform more stringent semantics checks. */
23477 {
23479 /* Don't require a constant rvalue in C++11, since we
23480 might want a reference constant. We'll enforce
23481 constancy later. */
23483 /* Parse the initializer. */
23486 }
23487 else
23488 /* Parse the initializer. */
23490 }
23493 {
23497 else
23499 }
23500 /* Otherwise, there is no initializer. */
23501 else
23504 /* See if we are probably looking at a function
23505 definition. We are certainly not looking at a
23506 member-declarator. Calling `grokfield' has
23507 side-effects, so we must not do it unless we are sure
23508 that we are looking at a member-declarator. */
23511 {
23512 /* The grammar does not allow a pure-specifier to be
23513 used when a member function is defined. (It is
23514 possible that this fact is an oversight in the
23515 standard, since a pure function may be defined
23516 outside of the class-specifier. */
23522 declarator,
23523 attributes);
23526 /* If the member was not a friend, declare it here. */
23529 /* Peek at the next token. */
23531 /* If the next token is a semicolon, consume it. */
23533 {
23534 location_t semicolon_loc
23539 "extra %<;%> after in-class "
23541 }
23543 }
23544 else
23547 /* Create the declaration. */
23552 {
23555 else
23557 }
23558 }
23563 /* Reset PREFIX_ATTRIBUTES. */
23569 /* If there is any qualification still in effect, clear it
23570 now; we will be starting fresh with the next declarator. */
23574 /* If it's a `,', then there are more declarators. */
23576 {
23579 {
23585 }
23586 }
23587 /* If the next token isn't a `;', then we have a parse error. */
23589 CPP_SEMICOLON))
23590 {
23591 /* The next token might be a ways away from where the
23592 actual semicolon is missing. Find the previous token
23593 and use that for our error position. */
23600 /* Assume that the user meant to provide a semicolon. If
23601 we were to cp_parser_skip_to_end_of_statement, we might
23602 skip to a semicolon inside a member function definition
23603 and issue nonsensical error messages. */
23605 }
23608 {
23609 /* Add DECL to the list of members. */
23611 /* Explicitly include, eg, NSDMIs, for better error
23612 recovery (c++/58650). */
23621 /* Add DECL to the queue of NSDMI to be parsed later. */
23623 }
23627 }
23628 }
23631 out:
23633 }
23635 /* Parse a pure-specifier.
23637 pure-specifier:
23638 = 0
23640 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23641 Otherwise, ERROR_MARK_NODE is returned. */
23643 static tree
23645 {
23648 /* Look for the `=' token. */
23651 /* Look for the `0' token. */
23660 /* Accept = default or = delete in c++0x mode. */
23663 {
23666 }
23668 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23670 {
23675 }
23677 {
23680 }
23683 }
23685 /* Parse a constant-initializer.
23687 constant-initializer:
23688 = constant-expression
23690 Returns a representation of the constant-expression. */
23692 static tree
23694 {
23695 /* Look for the `=' token. */
23699 /* It is invalid to write:
23701 struct S { static const int i = { 7 }; };
23703 */
23705 {
23708 /* Consume the opening brace. */
23710 /* Skip the initializer. */
23712 /* Look for the trailing `}'. */
23716 }
23719 }
23721 /* Derived classes [gram.class.derived] */
23723 /* Parse a base-clause.
23725 base-clause:
23726 : base-specifier-list
23728 base-specifier-list:
23729 base-specifier ... [opt]
23730 base-specifier-list , base-specifier ... [opt]
23732 Returns a TREE_LIST representing the base-classes, in the order in
23733 which they were declared. The representation of each node is as
23734 described by cp_parser_base_specifier.
23736 In the case that no bases are specified, this function will return
23737 NULL_TREE, not ERROR_MARK_NODE. */
23739 static tree
23741 {
23744 /* Look for the `:' that begins the list. */
23747 /* Scan the base-specifier-list. */
23749 {
23751 tree base;
23754 /* Look for the base-specifier. */
23756 /* Look for the (optional) ellipsis. */
23758 {
23759 /* Consume the `...'. */
23763 }
23765 /* Add BASE to the front of the list. */
23767 {
23769 /* Make this a pack expansion type. */
23773 {
23776 }
23777 }
23778 /* Peek at the next token. */
23780 /* If it's not a comma, then the list is complete. */
23783 /* Consume the `,'. */
23785 }
23787 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23788 base class had a qualified name. However, the next name that
23789 appears is certainly not qualified. */
23795 }
23797 /* Parse a base-specifier.
23799 base-specifier:
23800 :: [opt] nested-name-specifier [opt] class-name
23801 virtual access-specifier [opt] :: [opt] nested-name-specifier
23802 [opt] class-name
23803 access-specifier virtual [opt] :: [opt] nested-name-specifier
23804 [opt] class-name
23806 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23807 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23808 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23809 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23811 static tree
23813 {
23821 tree type;
23823 /* Process the optional `virtual' and `access-specifier'. */
23825 {
23826 /* Peek at the next token. */
23828 /* Process `virtual'. */
23830 {
23832 /* If `virtual' appears more than once, issue an error. */
23834 {
23838 }
23842 /* Consume the `virtual' token. */
23850 /* If more than one access specifier appears, issue an
23851 error. */
23854 {
23858 }
23862 /* Consume the access-specifier. */
23870 }
23871 }
23872 /* It is not uncommon to see programs mechanically, erroneously, use
23873 the 'typename' keyword to denote (dependent) qualified types
23874 as base classes. */
23876 {
23881 else
23883 "keyword %<typename%> not allowed in this context "
23886 }
23888 /* Look for the optional `::' operator. */
23890 /* Look for the nested-name-specifier. The simplest way to
23891 implement:
23893 [temp.res]
23895 The keyword `typename' is not permitted in a base-specifier or
23896 mem-initializer; in these contexts a qualified name that
23897 depends on a template-parameter is implicitly assumed to be a
23898 type name.
23900 is to pretend that we have seen the `typename' keyword at this
23901 point. */
23907 /* If the base class is given by a qualified name, assume that names
23908 we see are type names or templates, as appropriate. */
23914 /* DR 950 allows decltype as a base-specifier. */
23916 else
23917 {
23918 /* Otherwise, look for the class-name. */
23920 class_scope_p,
23921 template_p,
23922 typename_type,
23927 }
23933 }
23935 /* Exception handling [gram.exception] */
23937 /* Parse an (optional) noexcept-specification.
23939 noexcept-specification:
23940 noexcept ( constant-expression ) [opt]
23942 If no noexcept-specification is present, returns NULL_TREE.
23943 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23944 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23945 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23946 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23947 in which case a boolean condition is returned instead. */
23949 static tree
23954 {
23958 /* Peek at the next token. */
23961 /* Is it a noexcept-specification? */
23963 {
23964 tree expr;
23968 {
23972 {
23973 /* Types may not be defined in an exception-specification. */
23975 parser->type_definition_forbidden_message
23980 /* Restore the saved message. */
23982 }
23983 else
23984 {
23987 }
23990 }
23991 else
23992 {
23996 }
23998 /* We cannot build a noexcept-spec right away because this will check
23999 that expr is a constexpr. */
24002 else
24004 }
24005 else
24007 }
24009 /* Parse an (optional) exception-specification.
24011 exception-specification:
24012 throw ( type-id-list [opt] )
24014 Returns a TREE_LIST representing the exception-specification. The
24015 TREE_VALUE of each node is a type. */
24017 static tree
24019 {
24021 tree type_id_list;
24024 /* Peek at the next token. */
24027 /* Is it a noexcept-specification? */
24033 /* If it's not `throw', then there's no exception-specification. */
24039 /* Consume the `throw'. */
24042 /* Look for the `('. */
24045 /* Peek at the next token. */
24047 /* If it's not a `)', then there is a type-id-list. */
24049 {
24050 /* Types may not be defined in an exception-specification. */
24052 parser->type_definition_forbidden_message
24054 /* Parse the type-id-list. */
24056 /* Restore the saved message. */
24060 {
24064 }
24067 "dynamic exception specifications are deprecated in "
24069 }
24070 /* In C++17, throw() is equivalent to noexcept (true). throw()
24071 is deprecated in C++11 and above as well, but is still widely used,
24072 so don't warn about it yet. */
24075 else
24078 /* Look for the `)'. */
24082 }
24084 /* Parse an (optional) type-id-list.
24086 type-id-list:
24087 type-id ... [opt]
24088 type-id-list , type-id ... [opt]
24090 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24091 in the order that the types were presented. */
24093 static tree
24095 {
24099 {
24101 tree type;
24105 /* Get the next type-id. */
24107 /* Check for invalid 'auto'. */
24109 {
24113 }
24114 /* Parse the optional ellipsis. */
24116 {
24117 /* Consume the `...'. */
24120 /* Turn the type into a pack expansion expression. */
24122 }
24123 /* Add it to the list. */
24125 /* Peek at the next token. */
24127 /* If it is not a `,', we are done. */
24130 /* Consume the `,'. */
24132 }
24135 }
24137 /* Parse a try-block.
24139 try-block:
24140 try compound-statement handler-seq */
24142 static tree
24144 {
24145 tree try_block;
24159 }
24161 /* Parse a function-try-block.
24163 function-try-block:
24164 try ctor-initializer [opt] function-body handler-seq */
24166 static bool
24168 {
24169 tree compound_stmt;
24170 tree try_block;
24173 /* Look for the `try' keyword. */
24176 /* Let the rest of the front end know where we are. */
24178 /* Parse the function-body. */
24179 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24181 /* We're done with the `try' part. */
24183 /* Parse the handlers. */
24185 /* We're done with the handlers. */
24189 }
24191 /* Parse a handler-seq.
24193 handler-seq:
24194 handler handler-seq [opt] */
24196 static void
24198 {
24200 {
24203 /* Parse the handler. */
24205 /* Peek at the next token. */
24207 /* If it's not `catch' then there are no more handlers. */
24210 }
24211 }
24213 /* Parse a handler.
24215 handler:
24216 catch ( exception-declaration ) compound-statement */
24218 static void
24220 {
24221 tree handler;
24222 tree declaration;
24232 }
24234 /* Parse an exception-declaration.
24236 exception-declaration:
24237 type-specifier-seq declarator
24238 type-specifier-seq abstract-declarator
24239 type-specifier-seq
24240 ...
24242 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24243 ellipsis variant is used. */
24245 static tree
24247 {
24248 cp_decl_specifier_seq type_specifiers;
24252 /* If it's an ellipsis, it's easy to handle. */
24254 {
24255 /* Consume the `...' token. */
24258 }
24260 /* Types may not be defined in exception-declarations. */
24262 parser->type_definition_forbidden_message
24265 /* Parse the type-specifier-seq. */
24269 /* If it's a `)', then there is no declarator. */
24272 else
24279 /* Restore the saved message. */
24286 }
24288 /* Parse a throw-expression.
24290 throw-expression:
24291 throw assignment-expression [opt]
24293 Returns a THROW_EXPR representing the throw-expression. */
24295 static tree
24297 {
24298 tree expression;
24303 /* Figure out whether or not there is an assignment-expression
24304 following the "throw" keyword. */
24312 else
24316 }
24318 /* GNU Extensions */
24320 /* Parse an (optional) asm-specification.
24322 asm-specification:
24323 asm ( string-literal )
24325 If the asm-specification is present, returns a STRING_CST
24326 corresponding to the string-literal. Otherwise, returns
24327 NULL_TREE. */
24329 static tree
24331 {
24333 tree asm_specification;
24335 /* Peek at the next token. */
24337 /* If the next token isn't the `asm' keyword, then there's no
24338 asm-specification. */
24342 /* Consume the `asm' token. */
24344 /* Look for the `('. */
24347 /* Look for the string-literal. */
24350 /* Look for the `)'. */
24354 }
24356 /* Parse an asm-operand-list.
24358 asm-operand-list:
24359 asm-operand
24360 asm-operand-list , asm-operand
24362 asm-operand:
24363 string-literal ( expression )
24364 [ string-literal ] string-literal ( expression )
24366 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24367 each node is the expression. The TREE_PURPOSE is itself a
24368 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24369 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24370 is a STRING_CST for the string literal before the parenthesis. Returns
24371 ERROR_MARK_NODE if any of the operands are invalid. */
24373 static tree
24375 {
24380 {
24381 tree string_literal;
24382 tree expression;
24383 tree name;
24386 {
24387 /* Consume the `[' token. */
24389 /* Read the operand name. */
24394 /* Look for the closing `]'. */
24396 }
24397 else
24399 /* Look for the string-literal. */
24402 /* Look for the `('. */
24404 /* Parse the expression. */
24406 /* Look for the `)'. */
24414 /* Add this operand to the list. */
24416 expression,
24417 asm_operands);
24418 /* If the next token is not a `,', there are no more
24419 operands. */
24422 /* Consume the `,'. */
24424 }
24427 }
24429 /* Parse an asm-clobber-list.
24431 asm-clobber-list:
24432 string-literal
24433 asm-clobber-list , string-literal
24435 Returns a TREE_LIST, indicating the clobbers in the order that they
24436 appeared. The TREE_VALUE of each node is a STRING_CST. */
24438 static tree
24440 {
24444 {
24445 tree string_literal;
24447 /* Look for the string literal. */
24449 /* Add it to the list. */
24451 /* If the next token is not a `,', then the list is
24452 complete. */
24455 /* Consume the `,' token. */
24457 }
24460 }
24462 /* Parse an asm-label-list.
24464 asm-label-list:
24465 identifier
24466 asm-label-list , identifier
24468 Returns a TREE_LIST, indicating the labels in the order that they
24469 appeared. The TREE_VALUE of each node is a label. */
24471 static tree
24473 {
24477 {
24480 /* Look for the identifier. */
24483 {
24486 {
24492 }
24493 }
24494 /* If the next token is not a `,', then the list is
24495 complete. */
24498 /* Consume the `,' token. */
24500 }
24503 }
24505 /* Return TRUE iff the next tokens in the stream are possibly the
24506 beginning of a GNU extension attribute. */
24508 static bool
24510 {
24512 }
24514 /* Return TRUE iff the next tokens in the stream are possibly the
24515 beginning of a standard C++-11 attribute specifier. */
24517 static bool
24519 {
24521 }
24523 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24524 beginning of a standard C++-11 attribute specifier. */
24526 static bool
24528 {
24536 }
24538 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24539 beginning of a GNU extension attribute. */
24541 static bool
24543 {
24547 }
24549 /* Return true iff the next tokens can be the beginning of either a
24550 GNU attribute list, or a standard C++11 attribute sequence. */
24552 static bool
24554 {
24557 }
24559 /* Return true iff the next Nth tokens can be the beginning of either
24560 a GNU attribute list, or a standard C++11 attribute sequence. */
24562 static bool
24564 {
24567 }
24569 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24570 of GNU attributes, or return NULL. */
24572 static tree
24574 {
24578 }
24580 #define CILK_SIMD_FN_CLAUSE_MASK \
24581 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24582 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24583 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24584 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24585 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24587 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24588 vector [(<clauses>)] */
24590 static void
24592 {
24596 {
24602 }
24605 {
24608 paren_scope++;
24609 }
24611 {
24614 paren_scope++;
24616 paren_scope--;
24617 /* Do not push the last ')' */
24620 }
24629 }
24631 /* Parse an (optional) series of attributes.
24633 attributes:
24634 attributes attribute
24636 attribute:
24637 __attribute__ (( attribute-list [opt] ))
24639 The return value is as for cp_parser_gnu_attribute_list. */
24641 static tree
24643 {
24647 {
24649 tree attribute_list;
24652 /* Peek at the next token. */
24654 /* If it's not `__attribute__', then we're done. */
24658 /* Consume the `__attribute__' keyword. */
24660 /* Look for the two `(' tokens. */
24664 /* Peek at the next token. */
24667 /* Parse the attribute-list. */
24669 else
24670 /* If the next token is a `)', then there is no attribute
24671 list. */
24674 /* Look for the two `)' tokens. */
24682 /* Add these new attributes to the list. */
24684 }
24687 }
24689 /* Parse a GNU attribute-list.
24691 attribute-list:
24692 attribute
24693 attribute-list , attribute
24695 attribute:
24696 identifier
24697 identifier ( identifier )
24698 identifier ( identifier , expression-list )
24699 identifier ( expression-list )
24701 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24702 to an attribute. The TREE_PURPOSE of each node is the identifier
24703 indicating which attribute is in use. The TREE_VALUE represents
24704 the arguments, if any. */
24706 static tree
24708 {
24714 {
24716 tree identifier;
24717 tree attribute;
24719 /* Look for the identifier. We also allow keywords here; for
24720 example `__attribute__ ((const))' is legal. */
24724 {
24727 /* Consume the token, but save it since we need it for the
24728 SIMD enabled function parsing. */
24731 /* Save away the identifier that indicates which attribute
24732 this is. */
24734 /* For keywords, use the canonical spelling, not the
24735 parsed identifier. */
24741 /* Peek at the next token. */
24743 /* If it's an `(', then parse the attribute arguments. */
24745 {
24750 {
24753 }
24754 else
24755 vec = cp_parser_parenthesized_expression_list
24761 else
24762 {
24765 }
24766 /* Save the arguments away. */
24768 }
24770 {
24773 }
24776 {
24777 /* Add this attribute to the list. */
24780 }
24783 }
24784 /* Now, look for more attributes. If the next token isn't a
24785 `,', we're done. */
24789 /* Consume the comma and keep going. */
24791 }
24794 /* We built up the list in reverse order. */
24796 }
24798 /* Parse a standard C++11 attribute.
24800 The returned representation is a TREE_LIST which TREE_PURPOSE is
24801 the scoped name of the attribute, and the TREE_VALUE is its
24802 arguments list.
24804 Note that the scoped name of the attribute is itself a TREE_LIST
24805 which TREE_PURPOSE is the namespace of the attribute, and
24806 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24807 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24808 and which TREE_PURPOSE is directly the attribute name.
24810 Clients of the attribute code should use get_attribute_namespace
24811 and get_attribute_name to get the actual namespace and name of
24812 attributes, regardless of their being GNU or C++11 attributes.
24814 attribute:
24815 attribute-token attribute-argument-clause [opt]
24817 attribute-token:
24818 identifier
24819 attribute-scoped-token
24821 attribute-scoped-token:
24822 attribute-namespace :: identifier
24824 attribute-namespace:
24825 identifier
24827 attribute-argument-clause:
24828 ( balanced-token-seq )
24830 balanced-token-seq:
24831 balanced-token [opt]
24832 balanced-token-seq balanced-token
24834 balanced-token:
24835 ( balanced-token-seq )
24836 [ balanced-token-seq ]
24837 { balanced-token-seq }. */
24839 static tree
24841 {
24845 /* First, parse name of the attribute, a.k.a attribute-token. */
24862 {
24863 /* We are seeing a scoped attribute token. */
24878 else
24879 {
24883 }
24885 NULL_TREE);
24887 }
24890 NULL_TREE);
24891 else
24892 {
24894 NULL_TREE);
24895 /* C++11 noreturn attribute is equivalent to GNU's. */
24898 /* C++14 deprecated attribute is equivalent to GNU's. */
24901 /* C++17 fallthrough attribute is equivalent to GNU's. */
24904 /* Transactional Memory TS optimize_for_synchronized attribute is
24905 equivalent to GNU transaction_callable. */
24909 /* Transactional Memory attributes are GNU attributes. */
24912 }
24914 /* Now parse the optional argument clause of the attribute. */
24919 {
24925 /* A GNU attribute that takes an identifier in parameter. */
24928 vec = cp_parser_parenthesized_expression_list
24934 else
24935 {
24938 }
24942 else
24944 }
24947 }
24949 /* Check that the attribute ATTRIBUTE appears at most once in the
24950 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24951 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24952 isn't implemented yet in GCC. */
24954 static void
24956 {
24958 {
24968 }
24969 }
24971 /* Parse a list of standard C++-11 attributes.
24973 attribute-list:
24974 attribute [opt]
24975 attribute-list , attribute[opt]
24976 attribute ...
24977 attribute-list , attribute ...
24978 */
24980 static tree
24982 {
24987 {
24992 {
24996 }
24999 {
25004 else
25005 {
25010 }
25012 }
25016 }
25019 }
25021 /* Parse a standard C++-11 attribute specifier.
25023 attribute-specifier:
25024 [ [ attribute-using-prefix [opt] attribute-list ] ]
25025 alignment-specifier
25027 attribute-using-prefix:
25028 using attribute-namespace :
25030 alignment-specifier:
25031 alignas ( type-id ... [opt] )
25032 alignas ( alignment-expression ... [opt] ). */
25034 static tree
25036 {
25042 {
25049 {
25060 {
25064 "attribute using prefix only available "
25070 }
25071 else
25073 }
25080 else
25081 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25082 when we are sure that we have actually parsed them. */
25084 }
25085 else
25086 {
25087 tree alignas_expr;
25089 /* Look for an alignment-specifier. */
25101 {
25104 }
25110 {
25117 }
25122 /* Handle alignas (pack...). */
25124 {
25127 }
25129 /* Something went wrong, so don't build the attribute. */
25134 {
25137 }
25139 /* Build the C++-11 representation of an 'aligned'
25140 attribute. */
25141 attributes =
25144 alignas_expr);
25145 }
25148 }
25150 /* Parse a standard C++-11 attribute-specifier-seq.
25152 attribute-specifier-seq:
25153 attribute-specifier-seq [opt] attribute-specifier
25154 */
25156 static tree
25158 {
25163 {
25172 else
25175 }
25178 }
25180 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25181 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25182 current value of the PEDANTIC flag, regardless of whether or not
25183 the `__extension__' keyword is present. The caller is responsible
25184 for restoring the value of the PEDANTIC flag. */
25186 static bool
25188 {
25189 /* Save the old value of the PEDANTIC flag. */
25193 {
25194 /* Consume the `__extension__' token. */
25196 /* We're not being pedantic while the `__extension__' keyword is
25197 in effect. */
25201 }
25204 }
25206 /* Parse a label declaration.
25208 label-declaration:
25209 __label__ label-declarator-seq ;
25211 label-declarator-seq:
25212 identifier , label-declarator-seq
25213 identifier */
25215 static void
25217 {
25218 /* Look for the `__label__' keyword. */
25222 {
25223 tree identifier;
25225 /* Look for an identifier. */
25227 /* If we failed, stop. */
25230 /* Declare it as a label. */
25232 /* If the next token is a `;', stop. */
25235 /* Look for the `,' separating the label declarations. */
25237 }
25239 /* Look for the final `;'. */
25241 }
25243 // -------------------------------------------------------------------------- //
25244 // Requires Clause
25246 // Parse a requires clause.
25247 //
25248 // requires-clause:
25249 // 'requires' logical-or-expression
25250 //
25251 // The required logical-or-expression must be a constant expression. Note
25252 // that we don't check that the expression is constepxr here. We defer until
25253 // we analyze constraints and then, we only check atomic constraints.
25254 static tree
25256 {
25257 // Parse the requires clause so that it is not automatically folded.
25265 }
25267 // Optionally parse a requires clause:
25268 static tree
25270 {
25273 {
25276 {
25279 /* Parse and discard the requires-clause. */
25282 }
25284 }
25287 }
25290 /*---------------------------------------------------------------------------
25291 Requires expressions
25292 ---------------------------------------------------------------------------*/
25294 /* Parse a requires expression
25296 requirement-expression:
25297 'requires' requirement-parameter-list [opt] requirement-body */
25298 static tree
25300 {
25304 /* A requires-expression shall appear only within a concept
25305 definition or a requires-clause.
25307 TODO: Implement this diagnostic correctly. */
25309 {
25313 }
25316 {
25317 /* Local parameters are delared as variables within the scope
25318 of the expression. They are not visible past the end of
25319 the expression. Expressions within the requires-expression
25320 are unevaluated. */
25321 struct scope_sentinel
25322 {
25324 {
25327 }
25330 {
25333 }
25336 /* Parse the optional parameter list. */
25338 {
25342 }
25343 else
25346 /* Parse the requirement body. */
25350 }
25352 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25353 the parm chain. */
25356 }
25358 /* Parse a parameterized requirement.
25360 requirement-parameter-list:
25361 '(' parameter-declaration-clause ')' */
25362 static tree
25364 {
25374 }
25376 /* Parse the body of a requirement.
25378 requirement-body:
25379 '{' requirement-list '}' */
25380 static tree
25382 {
25392 }
25394 /* Parse a list of requirements.
25396 requirement-list:
25397 requirement
25398 requirement-list ';' requirement[opt] */
25399 static tree
25401 {
25404 {
25411 /* If we see a semi-colon, consume it. */
25415 /* Stop processing at the end of the list. */
25418 }
25420 /* Reverse the order of requirements so they are analyzed in
25421 declaration order. */
25423 }
25425 /* Parse a syntactic requirement or type requirement.
25427 requirement:
25428 simple-requirement
25429 compound-requirement
25430 type-requirement
25431 nested-requirement */
25432 static tree
25434 {
25441 else
25443 }
25445 /* Parse a simple requirement.
25447 simple-requirement:
25448 expression ';' */
25449 static tree
25451 {
25460 }
25462 /* Parse a type requirement
25464 type-requirement
25465 nested-name-specifier [opt] required-type-name ';'
25467 required-type-name:
25468 type-name
25469 'template' [opt] simple-template-id */
25470 static tree
25472 {
25475 // Save the scope before parsing name specifiers.
25486 tree type;
25488 {
25497 }
25498 else
25517 }
25519 /* Parse a compound requirement
25521 compound-requirement:
25522 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25523 static tree
25525 {
25526 /* Parse an expression enclosed in '{ }'s. */
25537 /* Parse the optional noexcept. */
25540 {
25543 }
25545 /* Parse the optional trailing return type. */
25548 {
25556 }
25559 }
25561 /* Parse a nested requirement. This is the same as a requires clause.
25563 nested-requirement:
25564 requires-clause */
25565 static tree
25567 {
25573 }
25575 /* Support Functions */
25577 /* Return the appropriate prefer_type argument for lookup_name_real based on
25578 tag_type and template_mem_access. */
25582 {
25583 /* DR 141: When looking in the current enclosing context for a template-name
25584 after -> or ., only consider class templates. */
25588 {
25592 }
25593 }
25595 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25596 NAME should have one of the representations used for an
25597 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25598 is returned. If PARSER->SCOPE is a dependent type, then a
25599 SCOPE_REF is returned.
25601 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25602 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25603 was formed. Abstractly, such entities should not be passed to this
25604 function, because they do not need to be looked up, but it is
25605 simpler to check for this special case here, rather than at the
25606 call-sites.
25608 In cases not explicitly covered above, this function returns a
25609 DECL, OVERLOAD, or baselink representing the result of the lookup.
25610 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25611 is returned.
25613 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25614 (e.g., "struct") that was used. In that case bindings that do not
25615 refer to types are ignored.
25617 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25618 ignored.
25620 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25621 are ignored.
25623 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25624 types.
25626 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25627 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25628 NULL_TREE otherwise. */
25630 static cp_expr
25637 location_t name_location)
25638 {
25639 tree decl;
25642 /* Assume that the lookup will be unambiguous. */
25646 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25647 no longer valid. Note that if we are parsing tentatively, and
25648 the parse fails, OBJECT_TYPE will be automatically restored. */
25654 /* A template-id has already been resolved; there is no lookup to
25655 do. */
25659 {
25663 }
25665 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25666 it should already have been checked to make sure that the name
25667 used matches the type being destroyed. */
25669 {
25670 tree type;
25672 /* Figure out to which type this destructor applies. */
25677 else
25679 /* If that's not a class type, there is no destructor. */
25686 /* If it was a class type, return the destructor. */
25688 }
25690 /* By this point, the NAME should be an ordinary identifier. If
25691 the id-expression was a qualified name, the qualifying scope is
25692 stored in PARSER->SCOPE at this point. */
25695 /* Perform the lookup. */
25697 {
25703 /* If the SCOPE is dependent, the lookup must be deferred until
25704 the template is instantiated -- unless we are explicitly
25705 looking up names in uninstantiated templates. Even then, we
25706 cannot look up the name if the scope is not a class type; it
25707 might, for example, be a template type parameter. */
25712 /* Defer lookup. */
25714 else
25715 {
25718 /* If PARSER->SCOPE is a dependent type, then it must be a
25719 class type, and we must not be checking dependencies;
25720 otherwise, we would have processed this lookup above. So
25721 that PARSER->SCOPE is not considered a dependent base by
25722 lookup_member, we must enter the scope here. */
25726 /* If the PARSER->SCOPE is a template specialization, it
25727 may be instantiated during name lookup. In that case,
25728 errors may be issued. Even if we rollback the current
25729 tentative parse, those errors are valid. */
25734 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25735 lookup result and the nested-name-specifier nominates a class C:
25736 * if the name specified after the nested-name-specifier, when
25737 looked up in C, is the injected-class-name of C (Clause 9), or
25738 * if the name specified after the nested-name-specifier is the
25739 same as the identifier or the simple-template-id's template-
25740 name in the last component of the nested-name-specifier,
25741 the name is instead considered to name the constructor of
25742 class C. [ Note: for example, the constructor is not an
25743 acceptable lookup result in an elaborated-type-specifier so
25744 the constructor would not be used in place of the
25745 injected-class-name. --end note ] Such a constructor name
25746 shall be used only in the declarator-id of a declaration that
25747 names a constructor or in a using-declaration. */
25755 /* If we have a single function from a using decl, pull it out. */
25762 }
25764 /* If the scope is a dependent type and either we deferred lookup or
25765 we did lookup but didn't find the name, rememeber the name. */
25768 {
25770 {
25771 tree type;
25773 /* The resolution to Core Issue 180 says that `struct
25774 A::B' should be considered a type-name, even if `A'
25775 is dependent. */
25780 }
25784 CPP_CLOSE_PAREN)))
25788 else
25791 is_template);
25792 }
25795 }
25797 {
25798 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25799 OBJECT_TYPE is not a class. */
25801 /* If the OBJECT_TYPE is a template specialization, it may
25802 be instantiated during name lookup. In that case, errors
25803 may be issued. Even if we rollback the current tentative
25804 parse, those errors are valid. */
25806 name,
25809 tf_warning_or_error);
25810 else
25814 /* Look it up in the enclosing context. DR 141: When looking for a
25815 template-name after -> or ., only consider class templates. */
25820 /* The object is type-dependent, so we can't look anything up; we used
25821 this to get the DR 141 behavior. */
25825 }
25826 else
25827 {
25833 }
25835 /* If the lookup failed, let our caller know. */
25839 /* Pull out the template from an injected-class-name (or multiple). */
25843 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25845 {
25848 /* The error message we have to print is too complicated for
25849 cp_parser_error, so we incorporate its actions directly. */
25851 {
25853 name);
25855 }
25857 }
25865 /* If we have resolved the name of a member declaration, check to
25866 see if the declaration is accessible. When the name resolves to
25867 set of overloaded functions, accessibility is checked when
25868 overload resolution is done.
25870 During an explicit instantiation, access is not checked at all,
25871 as per [temp.explicit]. */
25878 }
25880 /* Like cp_parser_lookup_name, but for use in the typical case where
25881 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25882 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25884 static tree
25886 {
25888 none_type,
25893 location);
25894 }
25896 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25897 the current context, return the TYPE_DECL. If TAG_NAME_P is
25898 true, the DECL indicates the class being defined in a class-head,
25899 or declared in an elaborated-type-specifier.
25901 Otherwise, return DECL. */
25903 static tree
25905 {
25906 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25907 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25909 struct A {
25910 template <typename T> struct B;
25911 };
25913 template <typename T> struct A::B {};
25915 Similarly, in an elaborated-type-specifier:
25917 namespace N { struct X{}; }
25919 struct A {
25920 template <typename T> friend struct N::X;
25921 };
25923 However, if the DECL refers to a class type, and we are in
25924 the scope of the class, then the name lookup automatically
25925 finds the TYPE_DECL created by build_self_reference rather
25926 than a TEMPLATE_DECL. For example, in:
25928 template <class T> struct S {
25929 S s;
25930 };
25932 there is no need to handle such case. */
25938 }
25940 /* If too many, or too few, template-parameter lists apply to the
25941 declarator, issue an error message. Returns TRUE if all went well,
25942 and FALSE otherwise. */
25944 static bool
25947 location_t declarator_location)
25948 {
25950 {
25952 {
25960 /* If the DECLARATOR has the form `X<y>' then it uses one
25961 additional level of template parameters. */
25964 return cp_parser_check_template_parameters
25966 }
25982 }
25984 }
25986 /* NUM_TEMPLATES were used in the current declaration. If that is
25987 invalid, return FALSE and issue an error messages. Otherwise,
25988 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25989 declarator and we can print more accurate diagnostics. */
25991 static bool
25994 location_t location,
25996 {
25997 /* If there are the same number of template classes and parameter
25998 lists, that's OK. */
26001 /* If there are more, but only one more, then we are referring to a
26002 member template. That's OK too. */
26005 /* If there are more template classes than parameter lists, we have
26006 something like:
26008 template <class T> void S<T>::R<T>::f (); */
26010 {
26020 else
26023 }
26024 /* Otherwise, there are too many template parameter lists. We have
26025 something like:
26027 template <class T> template <class U> void S::f(); */
26030 }
26032 /* Parse an optional `::' token indicating that the following name is
26033 from the global namespace. If so, PARSER->SCOPE is set to the
26034 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26035 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26036 Returns the new value of PARSER->SCOPE, if the `::' token is
26037 present, and NULL_TREE otherwise. */
26039 static tree
26041 {
26044 /* Peek at the next token. */
26046 /* If we're looking at a `::' token then we're starting from the
26047 global namespace, not our current location. */
26049 {
26050 /* Consume the `::' token. */
26052 /* Set the SCOPE so that we know where to start the lookup. */
26058 }
26060 {
26064 }
26067 }
26069 /* Returns TRUE if the upcoming token sequence is the start of a
26070 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26071 declarator is preceded by the `friend' specifier. */
26073 static bool
26075 {
26078 tree nested_name_specifier;
26081 /* The common case is that this is not a constructor declarator, so
26082 try to avoid doing lots of work if at all possible. It's not
26083 valid declare a constructor at function scope. */
26086 /* And only certain tokens can begin a constructor declarator. */
26094 /* Parse tentatively; we are going to roll back all of the tokens
26095 consumed here. */
26097 /* Assume that we are looking at a constructor declarator. */
26100 /* Look for the optional `::' operator. */
26103 /* Look for the nested-name-specifier. */
26104 nested_name_specifier
26115 /* Outside of a class-specifier, there must be a
26116 nested-name-specifier. Except in C++17 mode, where we
26117 might be declaring a guiding declaration. */
26124 /* If we have a class scope, this is easy; DR 147 says that S::S always
26125 names the constructor, and no other qualified name could. */
26128 {
26138 }
26139 /* If we still think that this might be a constructor-declarator,
26140 look for a class-name. */
26142 {
26143 /* If we have:
26145 template <typename T> struct S {
26146 S();
26147 };
26149 we must recognize that the nested `S' names a class. */
26153 tree type_decl;
26157 none_type,
26164 {
26170 none_type,
26175 else
26177 }
26179 /* If there was no class-name, then this is not a constructor.
26180 Otherwise, if we are in a class-specifier and we aren't
26181 handling a friend declaration, check that its type matches
26182 current_class_type (c++/38313). Note: error_mark_node
26183 is left alone for error recovery purposes. */
26185 && (outside_class_specifier_p
26191 /* If we're still considering a constructor, we have to see a `(',
26192 to begin the parameter-declaration-clause, followed by either a
26193 `)', an `...', or a decl-specifier. We need to check for a
26194 type-specifier to avoid being fooled into thinking that:
26196 S (f) (int);
26198 is a constructor. (It is actually a function named `f' that
26199 takes one parameter (of type `int') and returns a value of type
26200 `S'. */
26208 /* A parameter declaration begins with a decl-specifier,
26209 which is either the "attribute" keyword, a storage class
26210 specifier, or (usually) a type-specifier. */
26212 {
26213 tree type;
26217 /* Names appearing in the type-specifier should be looked up
26218 in the scope of the class. */
26222 {
26225 {
26229 {
26232 }
26233 }
26235 }
26237 /* Inside the constructor parameter list, surrounding
26238 template-parameter-lists do not apply. */
26239 saved_num_template_parameter_lists
26243 /* Look for the type-specifier. */
26245 CP_PARSER_FLAGS_NONE,
26251 parser->num_template_parameter_lists
26254 /* Leave the scope of the class. */
26259 }
26260 }
26262 /* We did not really want to consume any tokens. */
26266 }
26268 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26269 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26270 they must be performed once we are in the scope of the function.
26272 Returns the function defined. */
26274 static tree
26275 cp_parser_function_definition_from_specifiers_and_declarator
26278 tree attributes,
26280 {
26281 tree fn;
26284 /* Begin the function-definition. */
26287 /* The things we're about to see are not directly qualified by any
26288 template headers we've seen thus far. */
26291 /* If there were names looked up in the decl-specifier-seq that we
26292 did not check, check them now. We must wait until we are in the
26293 scope of the function to perform the checks, since the function
26294 might be a friend. */
26298 {
26303 }
26306 {
26307 /* Skip the entire function. */
26310 }
26312 {
26313 /* Seen already, skip it. An error message has already been output. */
26317 /* If this is a function from a class, pop the nested class. */
26320 }
26321 else
26322 {
26323 timevar_id_t tv;
26326 else
26332 }
26335 }
26337 /* Parse the part of a function-definition that follows the
26338 declarator. INLINE_P is TRUE iff this function is an inline
26339 function defined within a class-specifier.
26341 Returns the function defined. */
26343 static tree
26346 {
26347 tree fn;
26353 bool fully_implicit_function_template_p
26356 tree implicit_template_parms
26359 cp_binding_level* implicit_template_scope
26365 /* If the next token is `return', then the code may be trying to
26366 make use of the "named return value" extension that G++ used to
26367 support. */
26370 {
26371 /* Consume the `return' keyword. */
26373 /* Look for the identifier that indicates what value is to be
26374 returned. */
26376 /* Issue an error message. */
26379 /* Skip tokens until we reach the start of the function body. */
26381 {
26388 }
26389 }
26390 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26391 anything declared inside `f'. */
26392 saved_in_unbraced_linkage_specification_p
26395 /* Inside the function, surrounding template-parameter-lists do not
26396 apply. */
26397 saved_num_template_parameter_lists
26403 /* If the next token is `try', `__transaction_atomic', or
26404 `__transaction_relaxed`, then we are looking at either function-try-block
26405 or function-transaction-block. Note that all of these include the
26406 function-body. */
26409 RID_TRANSACTION_ATOMIC);
26411 RID_TRANSACTION_RELAXED))
26413 RID_TRANSACTION_RELAXED);
26416 else
26417 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26422 /* Finish the function. */
26425 /* Generate code for it, if necessary. */
26427 /* Restore the saved values. */
26428 parser->in_unbraced_linkage_specification_p
26430 parser->num_template_parameter_lists
26434 parser->fully_implicit_function_template_p
26436 parser->implicit_template_parms
26438 parser->implicit_template_scope
26445 }
26447 /* Parse a template-declaration body (following argument list). */
26449 static void
26451 tree parameter_list,
26453 {
26457 /* We just processed one more parameter list. */
26460 /* Get the deferred access checks from the parameter list. These
26461 will be checked once we know what is being declared, as for a
26462 member template the checks must be performed in the scope of the
26463 class containing the member. */
26466 /* Tentatively parse for a new template parameter list, which can either be
26467 the template keyword or a template introduction. */
26473 else
26474 {
26475 /* There are no access checks when parsing a template, as we do not
26476 know if a specialization will be a friend. */
26480 checks,
26481 member_p,
26486 /* If this is a member template declaration, let the front
26487 end know. */
26489 {
26494 }
26499 }
26500 /* We are done with the current parameter list. */
26505 /* Finish up. */
26508 /* Check the template arguments for a literal operator template. */
26512 {
26516 else
26517 {
26520 {
26526 }
26528 {
26537 }
26538 else
26540 }
26542 {
26545 " Expected non-type template argument pack <char...>"
26547 decl);
26548 else
26551 decl);
26552 }
26553 }
26555 /* Register member declarations. */
26558 /* If DECL is a function template, we must return to parse it later.
26559 (Even though there is no definition, there might be default
26560 arguments that need handling.) */
26564 }
26566 /* Parse a template introduction header for a template-declaration. Returns
26567 false if tentative parse fails. */
26569 static bool
26571 {
26578 /* Look for the optional `::' operator. */
26581 /* Look for the nested-name-specifier. */
26591 /* Look up the concept for which we will be matching
26592 template parameters. */
26602 /* Look for opening brace for introduction. */
26610 /* Build vector of placeholder parameters and grab
26611 matching identifiers. */
26614 /* The introduction-list shall not be empty. */
26617 {
26620 }
26622 /* Look for closing brace for introduction. */
26627 {
26631 }
26633 /* Build and associate the constraint. */
26636 {
26638 member_p);
26640 }
26644 }
26646 /* Parse a normal template-declaration following the template keyword. */
26648 static void
26650 {
26651 tree parameter_list;
26655 /* Look for the `<' token. */
26659 {
26660 /* 14.5.2.2 [temp.mem]
26662 A local class shall not have member templates. */
26667 }
26668 /* [temp]
26670 A template ... shall not have C linkage. */
26672 {
26674 /* Give it C++ linkage to avoid confusing other parts of the
26675 front end. */
26678 }
26679 else
26682 /* We cannot perform access checks on the template parameter
26683 declarations until we know what is being declared, just as we
26684 cannot check the decl-specifier list. */
26687 /* If the next token is `>', then we have an invalid
26688 specialization. Rather than complain about an invalid template
26689 parameter, issue an error message here. */
26691 {
26695 }
26696 else
26697 {
26698 /* Parse the template parameters. */
26700 }
26702 /* Look for the `>'. */
26705 /* Manage template requirements */
26707 {
26712 }
26715 member_p);
26717 /* For the erroneous case of a template with C linkage, we pushed an
26718 implicit C++ linkage scope; exit that scope now. */
26721 }
26723 /* Parse a template-declaration, assuming that the `export' (and
26724 `extern') keywords, if present, has already been scanned. MEMBER_P
26725 is as for cp_parser_template_declaration. */
26727 static bool
26729 {
26731 {
26735 }
26740 }
26742 /* Perform the deferred access checks from a template-parameter-list.
26743 CHECKS is a TREE_LIST of access checks, as returned by
26744 get_deferred_access_checks. */
26746 static void
26747 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26748 {
26752 }
26754 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26755 `function-definition' sequence that follows a template header.
26756 If MEMBER_P is true, this declaration appears in a class scope.
26758 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26759 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26761 static tree
26767 {
26770 cp_decl_specifier_seq decl_specifiers;
26774 /* This function is only used when processing a template
26775 declaration. */
26779 /* Defer access checks until we know what is being declared. */
26782 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26783 alternative. */
26786 CP_PARSER_FLAGS_OPTIONAL,
26792 /* There are no template typedefs. */
26794 {
26798 }
26800 /* Gather up the access checks that occurred the
26801 decl-specifier-seq. */
26804 /* Check for the declaration of a template class. */
26806 {
26809 {
26810 // If this is a declaration, but not a definition, associate
26811 // any constraints with the type declaration. Constraints
26812 // are associated with definitions in cp_parser_class_specifier.
26818 /* In this case:
26820 struct C {
26821 friend template <typename T> struct A<T>::B;
26822 };
26824 A<T>::B will be represented by a TYPENAME_TYPE, and
26825 therefore not recognized by shadow_tag. */
26827 && !decl
26834 else
26837 /* Perform access checks for template parameters. */
26840 /* Give a helpful diagnostic for
26841 template <class T> struct A { } a;
26842 if we aren't already recovering from an error. */
26845 {
26847 "a class template declaration must not declare "
26851 }
26852 }
26853 }
26855 /* Complain about missing 'typename' or other invalid type names. */
26858 {
26859 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26860 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26861 the rest of this declaration. */
26864 }
26866 /* If it's not a template class, try for a template function. If
26867 the next token is a `;', then this declaration does not declare
26868 anything. But, if there were errors in the decl-specifiers, then
26869 the error might well have come from an attempted class-specifier.
26870 In that case, there's no need to warn about a missing declarator. */
26874 {
26877 checks,
26879 member_p,
26880 declares_class_or_enum,
26884 /* 7.1.1-1 [dcl.stc]
26886 A storage-class-specifier shall not be specified in an explicit
26887 specialization... */
26889 && explicit_specialization_p
26891 {
26895 }
26899 }
26901 /* Look for a trailing `;' after the declaration. */
26907 out:
26910 /* Clear any current qualification; whatever comes next is the start
26911 of something new. */
26917 }
26919 /* Parse a cast-expression that is not the operand of a unary "&". */
26921 static cp_expr
26923 {
26926 }
26928 /* Parse a functional cast to TYPE. Returns an expression
26929 representing the cast. */
26931 static cp_expr
26933 {
26935 tree expression_list;
26936 cp_expr cast;
26945 {
26955 /* Create a location of the form:
26956 type_name{i, f}
26957 ^~~~~~~~~~~~~~~
26958 with caret == start at the start of the type name,
26959 finishing at the closing brace. */
26960 location_t finish_loc
26963 finish_loc);
26966 }
26975 else
26976 {
26979 }
26982 tf_warning_or_error);
26983 /* [expr.const]/1: In an integral constant expression "only type
26984 conversions to integral or enumeration type can be used". */
26990 NIC_CONSTRUCTOR))
26993 /* Create a location of the form:
26994 float(i)
26995 ^~~~~~~~
26996 with caret == start at the start of the type name,
26997 finishing at the closing paren. */
26998 location_t finish_loc
27003 }
27005 /* Save the tokens that make up the body of a member function defined
27006 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27007 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27008 specifiers applied to the declaration. Returns the FUNCTION_DECL
27009 for the member function. */
27011 static tree
27015 tree attributes)
27016 {
27019 tree fn;
27022 /* Create the FUNCTION_DECL. */
27026 /* If something went badly wrong, bail out now. */
27028 {
27029 /* If there's a function-body, skip it. */
27034 }
27036 /* Remember it, if there default args to post process. */
27039 /* Save away the tokens that make up the body of the
27040 function. */
27046 RID_TRANSACTION_ATOMIC))
27047 {
27049 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27056 {
27062 }
27063 else
27066 {
27070 }
27071 }
27073 /* Handle function try blocks. */
27075 {
27078 }
27079 /* We can have braced-init-list mem-initializers before the fn body. */
27081 {
27084 {
27085 /* cache_group will stop after an un-nested { } pair, too. */
27089 /* variadic mem-inits have ... after the ')'. */
27092 }
27093 }
27095 /* Handle function try blocks. */
27101 /* Save away the inline definition; we will process it when the
27102 class is complete. */
27106 /* We need to know that this was defined in the class, so that
27107 friend templates are handled correctly. */
27110 /* Add FN to the queue of functions to be parsed later. */
27114 }
27116 /* Save the tokens that make up the in-class initializer for a non-static
27117 data member. Returns a DEFAULT_ARG. */
27119 static tree
27121 {
27123 }
27125 /* Parse a template-argument-list, as well as the trailing ">" (but
27126 not the opening "<"). See cp_parser_template_argument_list for the
27127 return value. */
27129 static tree
27131 {
27132 tree arguments;
27133 tree saved_scope;
27134 tree saved_qualifying_scope;
27135 tree saved_object_scope;
27140 /* [temp.names]
27142 When parsing a template-id, the first non-nested `>' is taken as
27143 the end of the template-argument-list rather than a greater-than
27144 operator. */
27145 saved_greater_than_is_operator_p
27148 /* Parsing the argument list may modify SCOPE, so we save it
27149 here. */
27153 /* We need to evaluate the template arguments, even though this
27154 template-id may be nested within a "sizeof". */
27159 /* Parse the template-argument-list itself. */
27163 else
27165 /* Look for the `>' that ends the template-argument-list. If we find
27166 a '>>' instead, it's probably just a typo. */
27168 {
27170 {
27171 /* In C++0x, a `>>' in a template argument list or cast
27172 expression is considered to be two separate `>'
27173 tokens. So, change the current token to a `>', but don't
27174 consume it: it will be consumed later when the outer
27175 template argument list (or cast expression) is parsed.
27176 Note that this replacement of `>' for `>>' is necessary
27177 even if we are parsing tentatively: in the tentative
27178 case, after calling
27179 cp_parser_enclosed_template_argument_list we will always
27180 throw away all of the template arguments and the first
27181 closing `>', either because the template argument list
27182 was erroneous or because we are replacing those tokens
27183 with a CPP_TEMPLATE_ID token. The second `>' (which will
27184 not have been thrown away) is needed either to close an
27185 outer template argument list or to complete a new-style
27186 cast. */
27189 }
27191 {
27192 /* If we're in a nested template argument list, the '>>' has
27193 to be a typo for '> >'. We emit the error message, but we
27194 continue parsing and we push a '>' as next token, so that
27195 the argument list will be parsed correctly. Note that the
27196 global source location is still on the token before the
27197 '>>', so we need to say explicitly where we want it. */
27205 }
27206 else
27207 {
27208 /* If this is not a nested template argument list, the '>>'
27209 is a typo for '>'. Emit an error message and continue.
27210 Same deal about the token location, but here we can get it
27211 right by consuming the '>>' before issuing the diagnostic. */
27214 "spurious %<>>%>, use %<>%> to terminate "
27216 }
27217 }
27218 else
27220 /* The `>' token might be a greater-than operator again now. */
27221 parser->greater_than_is_operator_p
27223 /* Restore the SAVED_SCOPE. */
27231 }
27233 /* MEMBER_FUNCTION is a member function, or a friend. If default
27234 arguments, or the body of the function have not yet been parsed,
27235 parse them now. */
27237 static void
27239 {
27241 /* If this member is a template, get the underlying
27242 FUNCTION_DECL. */
27246 /* There should not be any class definitions in progress at this
27247 point; the bodies of members are only parsed outside of all class
27248 definitions. */
27250 /* While we're parsing the member functions we might encounter more
27251 classes. We want to handle them right away, but we don't want
27252 them getting mixed up with functions that are currently in the
27253 queue. */
27256 /* Make sure that any template parameters are in scope. */
27259 /* If the body of the function has not yet been parsed, parse it
27260 now. */
27262 {
27263 tree function_scope;
27266 /* The function is no longer pending; we are processing it. */
27271 /* If this is a local class, enter the scope of the containing
27272 function. */
27277 /* Push the body of the function onto the lexer stack. */
27280 /* Let the front end know that we going to be defining this
27281 function. */
27285 /* Don't do access checking if it is a templated function. */
27289 /* #pragma omp declare reduction needs special parsing. */
27291 {
27296 }
27297 else
27298 /* Now, parse the body of the function. */
27305 /* Leave the scope of the containing function. */
27309 }
27311 /* Remove any template parameters from the symbol table. */
27314 /* Restore the queue. */
27317 }
27319 /* If DECL contains any default args, remember it on the unparsed
27320 functions queue. */
27322 static void
27324 {
27325 tree probe;
27328 probe;
27331 {
27335 }
27336 }
27338 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27339 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27340 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27341 from the parameter-type-list. */
27343 static tree
27346 {
27348 tree parsed_arg;
27354 /* Push the saved tokens for the default argument onto the parser's
27355 lexer stack. */
27361 /* Parse the default argument. */
27372 {
27373 /* In a non-template class, check conversions now. In a template,
27374 we'll wait and instantiate these as needed. */
27377 tf_warning_or_error);
27380 else
27382 }
27384 /* If the token stream has not been completely used up, then
27385 there was extra junk after the end of the default
27386 argument. */
27388 {
27391 else
27393 }
27395 /* Revert to the main lexer. */
27399 }
27401 /* FIELD is a non-static data member with an initializer which we saved for
27402 later; parse it now. */
27404 static void
27406 {
27407 tree def;
27414 NULL_TREE);
27420 }
27422 /* FN is a FUNCTION_DECL which may contains a parameter with an
27423 unparsed DEFAULT_ARG. Parse the default args now. This function
27424 assumes that the current scope is the scope in which the default
27425 argument should be processed. */
27427 static void
27429 {
27433 /* While we're parsing the default args, we might (due to the
27434 statement expression extension) encounter more classes. We want
27435 to handle them right away, but we don't want them getting mixed
27436 up with default args that are currently in the queue. */
27439 /* Local variable names (and the `this' keyword) may not appear
27440 in a default argument. */
27451 {
27453 tree parsed_arg;
27455 tree copy;
27462 /* This can happen for a friend declaration for a function
27463 already declared with default arguments. */
27466 parsed_arg
27468 default_arg,
27471 {
27473 }
27477 /* Update any instantiations we've already created. */
27481 }
27485 /* Make sure no default arg is missing. */
27488 /* Restore the state of local_variables_forbidden_p. */
27491 /* Restore the queue. */
27493 }
27495 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27497 sizeof ... ( identifier )
27499 where the 'sizeof' token has already been consumed. */
27501 static tree
27503 {
27504 /* Consume the `...'. */
27511 else
27519 /* The name is not qualified. */
27538 }
27540 /* Parse the operand of `sizeof' (or a similar operator). Returns
27541 either a TYPE or an expression, depending on the form of the
27542 input. The KEYWORD indicates which kind of expression we have
27543 encountered. */
27545 static tree
27547 {
27554 /* If it's a `...', then we are computing the length of a parameter
27555 pack. */
27560 /* Types cannot be defined in a `sizeof' expression. Save away the
27561 old message. */
27563 /* And create the new one. */
27569 /* The restrictions on constant-expressions do not apply inside
27570 sizeof expressions. */
27571 saved_integral_constant_expression_p
27573 saved_non_integral_constant_expression_p
27577 /* Do not actually evaluate the expression. */
27580 /* If it's a `(', then we might be looking at the type-id
27581 construction. */
27583 {
27586 /* We can't be sure yet whether we're looking at a type-id or an
27587 expression. */
27589 /* Note: as a GNU Extension, compound literals are considered
27590 postfix-expressions as they are in C99, so they are valid
27591 arguments to sizeof. See comment in cp_parser_cast_expression
27592 for details. */
27595 else
27596 {
27599 /* Look for the type-id. */
27601 /* Look for the closing `)'. */
27604 }
27606 /* If all went well, then we're done. */
27608 {
27609 cp_decl_specifier_seq decl_specs;
27611 /* Build a trivial decl-specifier-seq. */
27615 /* Call grokdeclarator to figure out what type this is. */
27618 TYPENAME,
27621 }
27622 }
27624 /* If the type-id production did not work out, then we must be
27625 looking at the unary-expression production. */
27629 /* Go back to evaluating expressions. */
27633 /* Free the message we created. */
27635 /* And restore the old one. */
27637 parser->integral_constant_expression_p
27639 parser->non_integral_constant_expression_p
27643 }
27645 /* If the current declaration has no declarator, return true. */
27647 static bool
27649 {
27650 /* If the next token is a `;' or a `,' then there is no
27651 declarator. */
27654 }
27656 /* Update the DECL_SPECS to reflect the storage class indicated by
27657 KEYWORD. */
27659 static void
27664 {
27665 cp_storage_class storage_class;
27668 {
27672 }
27674 {
27677 }
27682 {
27685 }
27688 {
27706 }
27710 /* A storage class specifier cannot be applied alongside a typedef
27711 specifier. If there is a typedef specifier present then set
27712 conflicting_specifiers_p which will trigger an error later
27713 on in grokdeclarator. */
27716 }
27718 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27719 is true, the type is a class or enum definition. */
27721 static void
27723 tree type_spec,
27726 {
27729 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27730 (with, for example, in "typedef int wchar_t;") we remember that
27731 this is what happened. In system headers, we ignore these
27732 declarations so that G++ can work with system headers that are not
27733 C++-safe. */
27735 && !type_definition_p
27745 {
27748 ds_redefined_builtin_type_spec,
27749 token);
27751 {
27755 }
27756 }
27759 else
27760 {
27765 }
27766 }
27768 /* True iff TOKEN is the GNU keyword __thread. */
27770 static bool
27772 {
27775 }
27777 /* Set the location for a declarator specifier and check if it is
27778 duplicated.
27780 DECL_SPECS is the sequence of declarator specifiers onto which to
27781 set the location.
27783 DS is the single declarator specifier to set which location is to
27784 be set onto the existing sequence of declarators.
27786 LOCATION is the location for the declarator specifier to
27787 consider. */
27789 static void
27792 {
27801 {
27805 }
27806 else
27807 {
27809 {
27813 else
27814 {
27817 OPT_Wlong_long,
27819 }
27820 }
27822 {
27827 else
27828 {
27832 }
27833 }
27834 else
27835 {
27851 "__complex"
27852 };
27856 }
27857 }
27858 }
27860 /* Return true iff the declarator specifier DS is present in the
27861 sequence of declarator specifiers DECL_SPECS. */
27863 bool
27865 cp_decl_spec ds)
27866 {
27873 }
27875 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27876 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27878 static bool
27880 {
27882 }
27884 /* Issue an error message indicating that TOKEN_DESC was expected.
27885 If KEYWORD is true, it indicated this function is called by
27886 cp_parser_require_keword and the required token can only be
27887 a indicated keyword. */
27889 static void
27891 required_token token_desc,
27893 {
27895 {
27964 }
27966 {
27968 {
28047 }
28048 }
28049 else
28051 }
28055 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28056 issue an error message indicating that TOKEN_DESC was expected.
28058 Returns the token consumed, if the token had the appropriate type.
28059 Otherwise, returns NULL. */
28064 required_token token_desc)
28065 {
28068 else
28069 {
28070 /* Output the MESSAGE -- unless we're parsing tentatively. */
28074 }
28075 }
28077 /* An error message is produced if the next token is not '>'.
28078 All further tokens are skipped until the desired token is
28079 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28081 static void
28083 {
28084 /* Current level of '< ... >'. */
28086 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28089 /* Are we ready, yet? If not, issue error message. */
28093 /* Skip tokens until the desired token is found. */
28095 {
28096 /* Peek at the next token. */
28098 {
28106 /* C++0x views the `>>' operator as two `>' tokens, but
28107 C++98 does not. */
28110 {
28111 /* We've hit a `>>' where the first `>' closes the
28112 template argument list, and the second `>' is
28113 spurious. Just consume the `>>' and stop; we've
28114 already produced at least one error. */
28117 }
28118 /* Fall through for C++0x, so we handle the second `>' in
28119 the `>>'. */
28124 {
28125 /* We've reached the token we want, consume it and stop. */
28128 }
28147 /* The '>' was probably forgotten, don't look further. */
28152 }
28154 /* Consume this token. */
28156 }
28157 }
28159 /* If the next token is the indicated keyword, consume it. Otherwise,
28160 issue an error message indicating that TOKEN_DESC was expected.
28162 Returns the token consumed, if the token had the appropriate type.
28163 Otherwise, returns NULL. */
28168 required_token token_desc)
28169 {
28173 {
28176 }
28179 }
28181 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28182 function-definition. */
28184 static bool
28186 {
28189 /* A ctor-initializer begins with a `:'. */
28191 /* A function-try-block begins with `try'. */
28193 /* A function-transaction-block begins with `__transaction_atomic'
28194 or `__transaction_relaxed'. */
28197 /* The named return value extension begins with `return'. */
28199 }
28201 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28202 definition. */
28204 static bool
28206 {
28213 }
28215 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28216 C++0x) ending a template-argument. */
28218 static bool
28220 {
28228 }
28230 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28231 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28233 static bool
28236 {
28242 /* Check for the sequence `<::' in the original code. It would be lexed as
28243 `[:', where `[' is a digraph, and there is no whitespace before
28244 `:'. */
28246 {
28251 }
28253 }
28255 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28256 or none_type otherwise. */
28258 static enum tag_types
28260 {
28262 {
28272 }
28273 }
28275 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28276 or none_type otherwise or if the token is null. */
28278 static enum tag_types
28280 {
28285 {
28293 }
28294 }
28296 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28298 static void
28300 {
28304 {
28308 type))
28311 }
28312 }
28314 /* Issue an error message if DECL is redeclared with different
28315 access than its original declaration [class.access.spec/3].
28316 This applies to nested classes, nested class templates and
28317 enumerations [class.mem/1]. */
28319 static void
28321 {
28332 }
28334 /* Look for the `template' keyword, as a syntactic disambiguator.
28335 Return TRUE iff it is present, in which case it will be
28336 consumed. */
28338 static bool
28340 {
28342 {
28343 /* In C++98 the `template' keyword can only be used within templates;
28344 outside templates the parser can always figure out what is a
28345 template and what is not. In C++11, per the resolution of DR 468,
28346 `template' is allowed in cases where it is not strictly necessary. */
28349 {
28352 "in C++98 %<template%> (as a disambiguator) is only "
28354 /* If this part of the token stream is rescanned, the same
28355 error message would be generated. So, we purge the token
28356 from the stream. */
28359 }
28360 else
28361 {
28362 /* Consume the `template' keyword. */
28365 }
28366 }
28368 }
28370 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28371 set PARSER->SCOPE, and perform other related actions. */
28373 static void
28375 {
28378 /* Get the stored value. */
28380 /* Set the scope from the stored value. */
28384 }
28386 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28387 encounter the end of a block before what we were looking for. */
28389 static bool
28393 {
28395 {
28398 /* Abort a parenthesized expression if we encounter a semicolon. */
28402 /* If we've reached the end of the file, stop. */
28408 /* We've hit the end of an enclosing block, so there's been some
28409 kind of syntax error. */
28412 /* Consume the token. */
28414 /* See if it starts a new group. */
28416 {
28418 /* In theory this should probably check end == '}', but
28419 cp_parser_save_member_function_body needs it to exit
28420 after either '}' or ')' when called with ')'. */
28423 }
28425 {
28429 }
28434 }
28435 }
28437 /* Like above, for caching a default argument or NSDMI. Both of these are
28438 terminated by a non-nested comma, but it can be unclear whether or not a
28439 comma is nested in a template argument list unless we do more parsing.
28440 In order to handle this ambiguity, when we encounter a ',' after a '<'
28441 we try to parse what follows as a parameter-declaration-list (in the
28442 case of a default argument) or a member-declarator (in the case of an
28443 NSDMI). If that succeeds, then we stop caching. */
28445 static tree
28447 {
28452 tree default_argument;
28454 /* Add tokens until we have processed the entire default
28455 argument. We add the range [first_token, token). */
28458 {
28459 /* For list-initialization, this is straightforward. */
28462 }
28464 {
28467 /* Peek at the next token. */
28469 /* What we do depends on what token we have. */
28471 {
28472 /* In valid code, a default argument must be
28473 immediately followed by a `,' `)', or `...'. */
28476 {
28477 /* If we've seen a '<', we might be in a
28478 template-argument-list. Until Core issue 325 is
28479 resolved, we don't know how this situation ought
28480 to be handled, so try to DTRT. We check whether
28481 what comes after the comma is a valid parameter
28482 declaration list. If it is, then the comma ends
28483 the default argument; otherwise the default
28484 argument continues. */
28488 /* Set ITALP so cp_parser_parameter_declaration_list
28489 doesn't decide to commit to this parse. */
28496 {
28497 /* Parse declarators until we reach a non-comma or
28498 somthing that cannot be an initializer.
28499 Just checking whether we're looking at a single
28500 declarator is insufficient. Consider:
28501 int var = tuple<T,U>::x;
28502 The template parameter 'U' looks exactly like a
28503 declarator. */
28504 do
28505 {
28516 }
28518 /* If we met an '=' or ';' then the original comma
28519 was the end of the NSDMI. Otherwise assume
28520 we're still in the NSDMI. */
28523 }
28524 else
28525 {
28530 }
28537 }
28538 /* FALLTHRU */
28541 /* If we run into a non-nested `;', `}', or `]',
28542 then the code is invalid -- but the default
28543 argument is certainly over. */
28548 /* Handle correctly int n = sizeof ... ( p ); */
28551 /* Update DEPTH, if necessary. */
28566 /* This might be the comparison operator, or it might
28567 start a template argument list. */
28574 /* Fall through for C++0x, which treats the `>>'
28575 operator like two `>' tokens in certain
28576 cases. */
28581 {
28582 /* This might be an operator, or it might close a
28583 template argument list. But if a previous '<'
28584 started a template argument list, this will have
28585 closed it, so we can't be in one anymore. */
28589 }
28592 /* If we run out of tokens, issue an error message. */
28600 /* In these cases, we should look for template-ids.
28601 For example, if the default argument is
28602 `X<int, double>()', we need to do name lookup to
28603 figure out whether or not `X' is a template; if
28604 so, the `,' does not end the default argument.
28606 That is not yet done. */
28611 }
28613 /* If we've reached the end, stop. */
28617 /* Add the token to the token block. */
28619 }
28621 /* Create a DEFAULT_ARG to represent the unparsed default
28622 argument. */
28629 }
28631 /* Begin parsing tentatively. We always save tokens while parsing
28632 tentatively so that if the tentative parsing fails we can restore the
28633 tokens. */
28635 static void
28637 {
28638 /* Enter a new parsing context. */
28640 /* Begin saving tokens. */
28642 /* In order to avoid repetitive access control error messages,
28643 access checks are queued up until we are no longer parsing
28644 tentatively. */
28646 }
28648 /* Commit to the currently active tentative parse. */
28650 static void
28652 {
28656 /* Mark all of the levels as committed. */
28659 {
28666 }
28667 }
28669 /* Commit to the topmost currently active tentative parse.
28671 Note that this function shouldn't be called when there are
28672 irreversible side-effects while in a tentative state. For
28673 example, we shouldn't create a permanent entry in the symbol
28674 table, or issue an error message that might not apply if the
28675 tentative parse is aborted. */
28677 static void
28679 {
28684 {
28692 }
28693 }
28695 /* Abort the currently active tentative parse. All consumed tokens
28696 will be rolled back, and no diagnostics will be issued. */
28698 static void
28700 {
28704 /* Now, pretend that we want to see if the construct was
28705 successfully parsed. */
28707 }
28709 /* Stop parsing tentatively. If a parse error has occurred, restore the
28710 token stream. Otherwise, commit to the tokens we have consumed.
28711 Returns true if no error occurred; false otherwise. */
28713 static bool
28715 {
28719 /* Remember whether or not an error occurred, since we are about to
28720 destroy that information. */
28722 /* Remove the topmost context from the stack. */
28725 /* If no parse errors occurred, commit to the tentative parse. */
28727 {
28728 /* Commit to the tokens read tentatively, unless that was
28729 already done. */
28734 }
28735 /* Otherwise, if errors occurred, roll back our state so that things
28736 are just as they were before we began the tentative parse. */
28737 else
28738 {
28741 }
28742 /* Add the context to the front of the free list. */
28747 }
28749 /* Returns true if we are parsing tentatively and are not committed to
28750 this tentative parse. */
28752 static bool
28754 {
28757 }
28759 /* Returns nonzero iff an error has occurred during the most recent
28760 tentative parse. */
28762 static bool
28764 {
28767 }
28769 /* Returns nonzero if GNU extensions are allowed. */
28771 static bool
28773 {
28775 }
28776 \f
28777 /* Objective-C++ Productions */
28780 /* Parse an Objective-C expression, which feeds into a primary-expression
28781 above.
28783 objc-expression:
28784 objc-message-expression
28785 objc-string-literal
28786 objc-encode-expression
28787 objc-protocol-expression
28788 objc-selector-expression
28790 Returns a tree representation of the expression. */
28792 static cp_expr
28794 {
28795 /* Try to figure out what kind of declaration is present. */
28799 {
28809 {
28821 }
28827 }
28830 }
28832 /* Parse an Objective-C message expression.
28834 objc-message-expression:
28835 [ objc-message-receiver objc-message-args ]
28837 Returns a representation of an Objective-C message. */
28839 static tree
28841 {
28853 /* Construct a location e.g.
28854 [self func1:5]
28855 ^~~~~~~~~~~~~~
28856 ranging from the '[' to the ']', with the caret at the start. */
28861 }
28863 /* Parse an objc-message-receiver.
28865 objc-message-receiver:
28866 expression
28867 simple-type-specifier
28869 Returns a representation of the type or expression. */
28871 static tree
28873 {
28874 tree rcv;
28876 /* An Objective-C message receiver may be either (1) a type
28877 or (2) an expression. */
28881 /* If that worked out, fine. */
28888 CP_PARSER_FLAGS_NONE);
28895 }
28897 /* Parse the arguments and selectors comprising an Objective-C message.
28899 objc-message-args:
28900 objc-selector
28901 objc-selector-args
28902 objc-selector-args , objc-comma-args
28904 objc-selector-args:
28905 objc-selector [opt] : assignment-expression
28906 objc-selector-args objc-selector [opt] : assignment-expression
28908 objc-comma-args:
28909 assignment-expression
28910 objc-comma-args , assignment-expression
28912 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28913 selector arguments and TREE_VALUE containing a list of comma
28914 arguments. */
28916 static tree
28918 {
28924 {
28930 /* Detect if we have a unary selector. */
28939 sel_args
28944 }
28946 /* Handle non-selector arguments, if any. */
28948 {
28949 tree arg;
28954 addl_args
28959 }
28962 {
28965 }
28968 }
28970 /* Parse an Objective-C encode expression.
28972 objc-encode-expression:
28973 @encode objc-typename
28975 Returns an encoded representation of the type argument. */
28977 static cp_expr
28979 {
28980 tree type;
28991 {
28995 }
28997 /* This happens if we find @encode(T) (where T is a template
28998 typename or something dependent on a template typename) when
28999 parsing a template. In that case, we can't compile it
29000 immediately, but we rather create an AT_ENCODE_EXPR which will
29001 need to be instantiated when the template is used.
29002 */
29004 {
29008 }
29011 /* Build a location of the form:
29012 @encode(int)
29013 ^~~~~~~~~~~~
29014 with caret==start at the @ token, finishing at the close paren. */
29015 location_t combined_loc
29020 }
29022 /* Parse an Objective-C @defs expression. */
29024 static tree
29026 {
29027 tree name;
29035 }
29037 /* Parse an Objective-C protocol expression.
29039 objc-protocol-expression:
29040 @protocol ( identifier )
29042 Returns a representation of the protocol expression. */
29044 static tree
29046 {
29047 tree proto;
29055 /* Build a location of the form:
29056 @protocol(prot)
29057 ^~~~~~~~~~~~~~~
29058 with caret==start at the @ token, finishing at the close paren. */
29059 location_t combined_loc
29065 }
29067 /* Parse an Objective-C selector expression.
29069 objc-selector-expression:
29070 @selector ( objc-method-signature )
29072 objc-method-signature:
29073 objc-selector
29074 objc-selector-seq
29076 objc-selector-seq:
29077 objc-selector :
29078 objc-selector-seq objc-selector :
29080 Returns a representation of the method selector. */
29082 static tree
29084 {
29096 {
29105 {
29106 /* Detect if we have a unary selector. */
29108 {
29111 }
29112 else
29113 {
29115 }
29116 }
29121 {
29122 sel_seq
29125 sel_seq
29128 }
29129 else
29130 sel_seq
29135 }
29137 finish_selector:
29141 /* Build a location of the form:
29142 @selector(func)
29143 ^~~~~~~~~~~~~~~
29144 with caret==start at the @ token, finishing at the close paren. */
29145 location_t combined_loc
29149 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29152 }
29154 /* Parse a list of identifiers.
29156 objc-identifier-list:
29157 identifier
29158 objc-identifier-list , identifier
29160 Returns a TREE_LIST of identifier nodes. */
29162 static tree
29164 {
29165 tree identifier;
29166 tree list;
29177 {
29184 identifier));
29186 }
29189 }
29191 /* Parse an Objective-C alias declaration.
29193 objc-alias-declaration:
29194 @compatibility_alias identifier identifier ;
29196 This function registers the alias mapping with the Objective-C front end.
29197 It returns nothing. */
29199 static void
29201 {
29209 }
29211 /* Parse an Objective-C class forward-declaration.
29213 objc-class-declaration:
29214 @class objc-identifier-list ;
29216 The function registers the forward declarations with the Objective-C
29217 front end. It returns nothing. */
29219 static void
29221 {
29224 {
29225 tree id;
29235 else
29237 }
29239 }
29241 /* Parse a list of Objective-C protocol references.
29243 objc-protocol-refs-opt:
29244 objc-protocol-refs [opt]
29246 objc-protocol-refs:
29247 < objc-identifier-list >
29249 Returns a TREE_LIST of identifiers, if any. */
29251 static tree
29253 {
29257 {
29261 }
29264 }
29266 /* Parse a Objective-C visibility specification. */
29268 static void
29270 {
29274 {
29289 }
29291 /* Eat '@private'/'@protected'/'@public'. */
29293 }
29295 /* Parse an Objective-C method type. Return 'true' if it is a class
29296 (+) method, and 'false' if it is an instance (-) method. */
29300 {
29303 else
29305 }
29307 /* Parse an Objective-C protocol qualifier. */
29309 static tree
29311 {
29324 {
29329 }
29332 }
29334 /* Parse an Objective-C typename. */
29336 static tree
29338 {
29342 {
29348 /* An ObjC type name may consist of just protocol qualifiers, in which
29349 case the type shall default to 'id'. */
29351 {
29354 /* If the type could not be parsed, an error has already
29355 been produced. For error recovery, behave as if it had
29356 not been specified, which will use the default type
29357 'id'. */
29359 {
29361 /* We need to skip to the closing parenthesis as
29362 cp_parser_type_id() does not seem to do it for
29363 us. */
29368 }
29369 }
29373 }
29376 }
29378 /* Check to see if TYPE refers to an Objective-C selector name. */
29380 static bool
29382 {
29388 }
29390 /* Parse an Objective-C selector. */
29392 static tree
29394 {
29398 {
29401 }
29403 /* C++ operator names are allowed to appear in ObjC selectors. */
29405 {
29418 }
29419 }
29421 /* Parse an Objective-C params list. */
29423 static tree
29425 {
29431 {
29441 /* Detect if we have a unary selector. */
29444 {
29447 }
29451 {
29452 /* Something went quite wrong. There should be a colon
29453 here, but there is not. Stop parsing parameters. */
29455 }
29457 /* New ObjC allows attributes on parameters too. */
29462 params
29465 type_name,
29466 identifier,
29467 parm_attr));
29470 }
29473 {
29476 }
29478 /* We allow tail attributes for the method. */
29480 {
29488 }
29491 {
29494 }
29496 }
29498 /* Parse the non-keyword Objective-C params. */
29500 static tree
29503 {
29509 {
29511 tree parm;
29517 {
29522 }
29524 /* TODO: parse attributes for tail parameters. */
29533 }
29535 /* We allow tail attributes for the method. */
29537 {
29539 {
29544 }
29545 else
29546 /* We have an error, but parse the attributes, so that we can
29547 carry on. */
29553 }
29556 }
29558 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29560 static void
29562 {
29565 /* If the next token is `extern' and the following token is a string
29566 literal, then we have a linkage specification. */
29568 && cp_parser_is_pure_string_literal
29571 /* Handle #pragma, if any. */
29574 /* Allow stray semicolons. */
29577 /* Mark methods as optional or required, when building protocols. */
29579 {
29582 }
29584 {
29587 }
29590 /* Other stray characters must generate errors. */
29592 {
29596 }
29597 /* Finally, try to parse a block-declaration, or a function-definition. */
29598 else
29600 }
29602 /* Parse a method signature. */
29604 static tree
29606 {
29622 }
29624 static bool
29626 {
29627 tree tattr;
29632 /* If the attributes are followed by a method introducer, this is not allowed.
29633 Dump the attributes and flag the situation. */
29638 /* Otherwise, the attributes introduce some interstitial code, possibly so
29639 rewind to allow that check. */
29642 }
29644 /* Parse an Objective-C method prototype list. */
29646 static void
29648 {
29652 {
29654 {
29659 else
29663 {
29667 }
29670 }
29676 OPT_Wattributes,
29678 else
29679 /* Allow for interspersed non-ObjC++ code. */
29683 }
29687 else
29691 }
29693 /* Parse an Objective-C method definition list. */
29695 static void
29697 {
29701 {
29702 tree meth;
29705 {
29711 else
29716 {
29720 }
29722 NULL_TREE);
29724 /* For historical reasons, we accept an optional semicolon. */
29731 {
29738 }
29739 }
29740 /* The following case will be removed once @synthesize is
29741 completely implemented. */
29752 else
29753 /* Allow for interspersed non-ObjC++ code. */
29757 }
29761 else
29765 }
29767 /* Parse Objective-C ivars. */
29769 static void
29771 {
29782 {
29783 cp_decl_specifier_seq declspecs;
29785 tree prefix_attributes;
29793 CP_PARSER_FLAGS_OPTIONAL,
29797 /* auto, register, static, extern, mutable. */
29799 {
29802 }
29804 /* thread_local. */
29806 {
29809 }
29811 /* typedef. */
29813 {
29816 }
29821 /* Keep going until we hit the `;' at the end of the
29822 declaration. */
29824 {
29829 /* Check for a (possibly unnamed) bitfield declaration. */
29837 {
29838 /* Get the name of the bitfield. */
29841 sfk_none);
29843 eat_colon:
29845 /* Get the width of the bitfield. */
29846 width
29848 }
29849 else
29850 {
29851 /* Parse the declarator. */
29852 declarator
29858 }
29860 /* Look for attributes that apply to the ivar. */
29862 /* Remember which attributes are prefix attributes and
29863 which are not. */
29865 /* Combine the attributes. */
29869 /* Create the bitfield declaration. */
29871 width,
29872 attributes);
29873 else
29878 /* Add the instance variable. */
29882 /* Reset PREFIX_ATTRIBUTES. */
29891 {
29894 }
29896 }
29900 }
29905 /* Do not consume the RID_AT_END, so it will be read again as terminating
29906 the @interface of @implementation. */
29910 /* For historical reasons, we accept an optional semicolon. */
29913 }
29915 /* Parse an Objective-C protocol declaration. */
29917 static void
29919 {
29925 {
29930 }
29932 /* See if we have a forward declaration or a definition. */
29935 /* Try a forward declaration first. */
29937 {
29939 {
29940 tree id;
29950 else
29952 }
29954 }
29956 /* Ok, we got a full-fledged definition (or at least should). */
29957 else
29958 {
29963 }
29964 }
29966 /* Parse an Objective-C superclass or category. */
29968 static void
29973 {
29979 {
29982 }
29984 {
29987 /* If there is no category name, and this is an @interface, we
29988 have a class extension. */
29990 {
29993 }
29994 else
29998 }
29999 }
30001 /* Parse an Objective-C class interface. */
30003 static void
30005 {
30012 {
30013 /* It's hard to recover because even if valid @interface stuff
30014 is to follow, we can't compile it (or validate it) if we
30015 don't even know which class it refers to. Let's assume this
30016 was a stray '@interface' token in the stream and skip it.
30017 */
30019 }
30024 /* We have either a class or a category on our hands. */
30027 else
30028 {
30030 /* Handle instance variable declarations, if any. */
30033 }
30036 }
30038 /* Parse an Objective-C class implementation. */
30040 static void
30042 {
30049 {
30050 /* It's hard to recover because even if valid @implementation
30051 stuff is to follow, we can't compile it (or validate it) if
30052 we don't even know which class it refers to. Let's assume
30053 this was a stray '@implementation' token in the stream and
30054 skip it.
30055 */
30057 }
30061 /* We have either a class or a category on our hands. */
30064 else
30065 {
30067 /* Handle instance variable declarations, if any. */
30070 }
30073 }
30075 /* Consume the @end token and finish off the implementation. */
30077 static void
30079 {
30082 }
30084 /* Parse an Objective-C declaration. */
30086 static void
30088 {
30089 /* Try to figure out what kind of declaration is present. */
30094 {
30110 }
30113 {
30136 }
30137 }
30139 /* Parse an Objective-C try-catch-finally statement.
30141 objc-try-catch-finally-stmt:
30142 @try compound-statement objc-catch-clause-seq [opt]
30143 objc-finally-clause [opt]
30145 objc-catch-clause-seq:
30146 objc-catch-clause objc-catch-clause-seq [opt]
30148 objc-catch-clause:
30149 @catch ( objc-exception-declaration ) compound-statement
30151 objc-finally-clause:
30152 @finally compound-statement
30154 objc-exception-declaration:
30155 parameter-declaration
30156 '...'
30158 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30160 Returns NULL_TREE.
30162 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30163 for C. Keep them in sync. */
30165 static tree
30167 {
30168 location_t location;
30169 tree stmt;
30174 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30175 node, lest it get absorbed into the surrounding block. */
30181 {
30190 {
30191 /* We have "@catch (...)" (where the '...' are literally
30192 what is in the code). Skip the '...'.
30193 parameter_declaration is set to NULL_TREE, and
30194 objc_being_catch_clauses() knows that that means
30195 '...'. */
30198 }
30199 else
30200 {
30201 /* We have "@catch (NSException *exception)" or something
30202 like that. Parse the parameter declaration. */
30206 else
30211 }
30214 else
30215 {
30216 /* If there was no open parenthesis, we are recovering from
30217 an error, and we are trying to figure out what mistake
30218 the user has made. */
30220 /* If there is an immediate closing parenthesis, the user
30221 probably forgot the opening one (ie, they typed "@catch
30222 NSException *e)". Parse the closing parenthesis and keep
30223 going. */
30227 /* If these is no immediate closing parenthesis, the user
30228 probably doesn't know that parenthesis are required at
30229 all (ie, they typed "@catch NSException *e"). So, just
30230 forget about the closing parenthesis and keep going. */
30231 }
30235 }
30237 {
30240 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30241 node, lest it get absorbed into the surrounding block. */
30245 }
30248 }
30250 /* Parse an Objective-C synchronized statement.
30252 objc-synchronized-stmt:
30253 @synchronized ( expression ) compound-statement
30255 Returns NULL_TREE. */
30257 static tree
30259 {
30260 location_t location;
30271 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30272 node, lest it get absorbed into the surrounding block. */
30277 }
30279 /* Parse an Objective-C throw statement.
30281 objc-throw-stmt:
30282 @throw assignment-expression [opt] ;
30284 Returns a constructed '@throw' statement. */
30286 static tree
30288 {
30300 }
30302 /* Parse an Objective-C statement. */
30304 static tree
30306 {
30307 /* Try to figure out what kind of declaration is present. */
30311 {
30322 }
30325 }
30327 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30328 look ahead to see if an objc keyword follows the attributes. This
30329 is to detect the use of prefix attributes on ObjC @interface and
30330 @protocol. */
30332 static bool
30334 {
30339 {
30342 }
30345 }
30347 /* This routine is a minimal replacement for
30348 c_parser_struct_declaration () used when parsing the list of
30349 types/names or ObjC++ properties. For example, when parsing the
30350 code
30352 @property (readonly) int a, b, c;
30354 this function is responsible for parsing "int a, int b, int c" and
30355 returning the declarations as CHAIN of DECLs.
30357 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30358 similar parsing. */
30359 static tree
30361 {
30363 cp_decl_specifier_seq declspecs;
30365 tree prefix_attributes;
30368 CP_PARSER_FLAGS_NONE,
30375 /* auto, register, static, extern, mutable. */
30377 {
30380 }
30382 /* thread_local. */
30384 {
30387 }
30389 /* typedef. */
30391 {
30394 }
30399 /* Keep going until we hit the `;' at the end of the declaration. */
30401 {
30406 /* Parse the declarator. */
30410 /* Look for attributes that apply to the ivar. */
30412 /* Remember which attributes are prefix attributes and
30413 which are not. */
30415 /* Combine the attributes. */
30425 /* Reset PREFIX_ATTRIBUTES. */
30436 {
30439 }
30440 else
30442 }
30444 }
30446 /* Parse an Objective-C @property declaration. The syntax is:
30448 objc-property-declaration:
30449 '@property' objc-property-attributes[opt] struct-declaration ;
30451 objc-property-attributes:
30452 '(' objc-property-attribute-list ')'
30454 objc-property-attribute-list:
30455 objc-property-attribute
30456 objc-property-attribute-list, objc-property-attribute
30458 objc-property-attribute
30459 'getter' = identifier
30460 'setter' = identifier
30461 'readonly'
30462 'readwrite'
30463 'assign'
30464 'retain'
30465 'copy'
30466 'nonatomic'
30468 For example:
30469 @property NSString *name;
30470 @property (readonly) id object;
30471 @property (retain, nonatomic, getter=getTheName) id name;
30472 @property int a, b, c;
30474 PS: This function is identical to
30475 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30476 static void
30478 {
30479 /* The following variables hold the attributes of the properties as
30480 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30481 seen. When we see an attribute, we set them to 'true' (if they
30482 are boolean properties) or to the identifier (if they have an
30483 argument, ie, for getter and setter). Note that here we only
30484 parse the list of attributes, check the syntax and accumulate the
30485 attributes that we find. objc_add_property_declaration() will
30486 then process the information. */
30496 /* 'properties' is the list of properties that we read. Usually a
30497 single one, but maybe more (eg, in "@property int a, b, c;" there
30498 are three). */
30499 tree properties;
30500 location_t loc;
30506 /* Parse the optional attribute list... */
30508 {
30509 /* Eat the '('. */
30513 {
30519 {
30522 }
30526 {
30537 {
30541 else
30546 }
30549 {
30553 }
30555 {
30557 {
30560 }
30561 else
30565 else
30567 }
30568 else
30569 {
30571 {
30574 }
30575 else
30577 }
30583 }
30590 else
30592 }
30594 /* FIXME: "@property (setter, assign);" will generate a spurious
30595 "error: expected ‘)’ before ‘,’ token". This is because
30596 cp_parser_require, unlike the C counterpart, will produce an
30597 error even if we are in error recovery. */
30599 {
30604 }
30605 }
30607 /* ... and the property declaration(s). */
30611 {
30613 /* If the next token is now a `;', consume it. */
30617 }
30621 else
30622 {
30623 /* Comma-separated properties are chained together in
30624 reverse order; add them one by one. */
30633 }
30636 }
30638 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30640 objc-synthesize-declaration:
30641 @synthesize objc-synthesize-identifier-list ;
30643 objc-synthesize-identifier-list:
30644 objc-synthesize-identifier
30645 objc-synthesize-identifier-list, objc-synthesize-identifier
30647 objc-synthesize-identifier
30648 identifier
30649 identifier = identifier
30651 For example:
30652 @synthesize MyProperty;
30653 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30655 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30656 for C. Keep them in sync.
30657 */
30658 static void
30660 {
30662 location_t loc;
30667 {
30671 {
30674 }
30676 {
30680 {
30683 }
30684 }
30685 else
30690 else
30692 }
30695 }
30697 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30699 objc-dynamic-declaration:
30700 @dynamic identifier-list ;
30702 For example:
30703 @dynamic MyProperty;
30704 @dynamic MyProperty, AnotherProperty;
30706 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30707 for C. Keep them in sync.
30708 */
30709 static void
30711 {
30713 location_t loc;
30718 {
30719 tree property;
30722 {
30725 }
30729 else
30731 }
30734 }
30736 \f
30737 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30739 /* Returns name of the next clause.
30740 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30741 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30742 returned and the token is consumed. */
30744 static pragma_omp_clause
30746 {
30762 {
30767 {
30950 }
30951 }
30957 }
30959 /* Validate that a clause of the given type does not already exist. */
30961 static void
30964 {
30965 tree c;
30969 {
30972 }
30973 }
30975 /* OpenMP 2.5:
30976 variable-list:
30977 identifier
30978 variable-list , identifier
30980 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30981 colon). An opening parenthesis will have been consumed by the caller.
30983 If KIND is nonzero, create the appropriate node and install the decl
30984 in OMP_CLAUSE_DECL and add the node to the head of the list.
30986 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30987 return the list created.
30989 COLON can be NULL if only closing parenthesis should end the list,
30990 or pointer to bool which will receive false if the list is terminated
30991 by closing parenthesis or true if the list is terminated by colon. */
30993 static tree
30996 {
31000 {
31003 }
31005 {
31010 && current_class_ptr
31012 {
31018 }
31019 else
31020 {
31033 }
31035 ;
31037 {
31039 {
31041 /* The OpenACC cache directive explicitly only allows "array
31042 elements or subarrays". */
31044 {
31048 }
31049 /* FALLTHROUGH. */
31054 {
31055 location_t loc
31060 decl
31064 }
31065 /* FALLTHROUGH. */
31069 {
31077 parser->colon_corrects_to_scope_p
31081 else
31082 {
31083 /* Look for `:'. */
31087 CPP_CLOSE_SQUARE))
31089 }
31090 /* Look for the closing `]'. */
31092 RT_CLOSE_SQUARE))
31096 }
31100 }
31106 }
31107 else
31110 get_comma:
31114 }
31120 {
31124 }
31127 {
31130 /* Try to resync to an unnested comma. Copied from
31131 cp_parser_parenthesized_expression_list. */
31132 skip_comma:
31141 }
31144 }
31146 /* Similarly, but expect leading and trailing parenthesis. This is a very
31147 common case for omp clauses. */
31149 static tree
31151 {
31155 }
31157 /* OpenACC 2.0:
31158 copy ( variable-list )
31159 copyin ( variable-list )
31160 copyout ( variable-list )
31161 create ( variable-list )
31162 delete ( variable-list )
31163 present ( variable-list )
31164 present_or_copy ( variable-list )
31165 pcopy ( variable-list )
31166 present_or_copyin ( variable-list )
31167 pcopyin ( variable-list )
31168 present_or_copyout ( variable-list )
31169 pcopyout ( variable-list )
31170 present_or_create ( variable-list )
31171 pcreate ( variable-list ) */
31173 static tree
31175 tree list)
31176 {
31179 {
31225 }
31233 }
31235 /* OpenACC 2.0:
31236 deviceptr ( variable-list ) */
31238 static tree
31240 {
31244 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31245 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31246 variable-list must only allow for pointer variables. */
31249 {
31256 }
31259 }
31261 /* OpenACC 2.0:
31262 auto
31263 independent
31264 nohost
31265 seq */
31267 static tree
31271 {
31276 }
31278 /* OpenACC:
31279 num_gangs ( expression )
31280 num_workers ( expression )
31281 vector_length ( expression ) */
31283 static tree
31286 {
31296 {
31301 }
31309 }
31311 /* OpenACC:
31313 gang [( gang-arg-list )]
31314 worker [( [num:] int-expr )]
31315 vector [( [length:] int-expr )]
31317 where gang-arg is one of:
31319 [num:] int-expr
31320 static: size-expr
31322 and size-expr may be:
31324 *
31325 int-expr
31326 */
31328 static tree
31331 {
31341 {
31344 do
31345 {
31349 /* Gang static argument. */
31352 {
31360 {
31363 }
31365 /* Check for the '*' argument. */
31369 CPP_CLOSE_PAREN)))
31370 {
31375 {
31378 }
31380 }
31381 }
31382 /* Worker num: argument and vector length: arguments. */
31386 {
31389 }
31391 /* Now collect the actual argument. */
31393 {
31396 }
31408 {
31411 }
31413 }
31418 }
31432 cleanup_error:
31435 }
31437 /* OpenACC 2.0:
31438 tile ( size-expr-list ) */
31440 static tree
31442 {
31446 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31447 so, but the spec authors never considered such a case and have
31448 differing opinions on what it might mean, including 'not
31449 allowed'.) */
31452 clause_loc);
31457 do
31458 {
31465 {
31468 }
31469 else
31473 }
31476 /* Consume the trailing ')'. */
31484 }
31486 /* OpenACC 2.0
31487 Parse wait clause or directive parameters. */
31489 static tree
31491 {
31501 {
31506 }
31513 {
31517 {
31520 else
31521 {
31528 }
31529 }
31530 }
31533 }
31535 /* OpenACC:
31536 wait ( int-expr-list ) */
31538 static tree
31540 {
31549 }
31551 /* OpenMP 3.0:
31552 collapse ( constant-expression ) */
31554 static tree
31556 {
31558 location_t loc;
31559 HOST_WIDE_INT n;
31579 {
31582 }
31591 }
31593 /* OpenMP 2.5:
31594 default ( none | shared )
31596 OpenACC:
31597 default ( none | present ) */
31599 static tree
31602 {
31604 tree c;
31609 {
31614 {
31635 }
31638 }
31639 else
31640 {
31641 invalid_kind:
31644 else
31646 }
31663 }
31665 /* OpenMP 3.1:
31666 final ( expression ) */
31668 static tree
31670 {
31691 }
31693 /* OpenMP 2.5:
31694 if ( expression )
31696 OpenMP 4.5:
31697 if ( directive-name-modifier : expression )
31699 directive-name-modifier:
31700 parallel | task | taskloop | target data | target | target update
31701 | target enter data | target exit data */
31703 static tree
31706 {
31714 {
31726 {
31729 {
31742 else
31743 {
31744 location_t loc
31749 }
31752 {
31754 {
31759 }
31761 {
31762 location_t loc
31766 }
31767 }
31768 }
31769 }
31771 {
31773 {
31776 }
31777 else
31778 {
31780 {
31781 location_t loc
31784 }
31786 }
31787 }
31788 }
31800 {
31803 {
31806 {
31816 }
31818 p);
31820 }
31822 {
31825 else
31828 }
31831 {
31835 }
31836 }
31844 }
31846 /* OpenMP 3.1:
31847 mergeable */
31849 static tree
31852 {
31853 tree c;
31856 location);
31861 }
31863 /* OpenMP 2.5:
31864 nowait */
31866 static tree
31869 {
31870 tree c;
31877 }
31879 /* OpenMP 2.5:
31880 num_threads ( expression ) */
31882 static tree
31884 location_t location)
31885 {
31907 }
31909 /* OpenMP 4.5:
31910 num_tasks ( expression ) */
31912 static tree
31914 location_t location)
31915 {
31937 }
31939 /* OpenMP 4.5:
31940 grainsize ( expression ) */
31942 static tree
31944 location_t location)
31945 {
31967 }
31969 /* OpenMP 4.5:
31970 priority ( expression ) */
31972 static tree
31974 location_t location)
31975 {
31997 }
31999 /* OpenMP 4.5:
32000 hint ( expression ) */
32002 static tree
32004 location_t location)
32005 {
32026 }
32028 /* OpenMP 4.5:
32029 defaultmap ( tofrom : scalar ) */
32031 static tree
32033 location_t location)
32034 {
32042 {
32045 }
32049 {
32052 }
32058 {
32061 }
32065 {
32068 }
32074 location);
32080 out_err:
32085 }
32087 /* OpenMP 2.5:
32088 ordered
32090 OpenMP 4.5:
32091 ordered ( constant-expression ) */
32093 static tree
32096 {
32098 HOST_WIDE_INT n;
32104 {
32121 {
32123 "ordered argument needs positive constant integer "
32126 }
32127 }
32133 }
32135 /* OpenMP 2.5:
32136 reduction ( reduction-operator : variable-list )
32138 reduction-operator:
32139 One of: + * - & ^ | && ||
32141 OpenMP 3.1:
32143 reduction-operator:
32144 One of: + * - & ^ | && || min max
32146 OpenMP 4.0:
32148 reduction-operator:
32149 One of: + * - & ^ | && ||
32150 id-expression */
32152 static tree
32154 {
32162 {
32172 }
32176 else
32177 {
32188 {
32218 }
32219 else
32220 {
32222 resync_fail:
32227 }
32228 }
32234 NULL);
32236 {
32239 }
32242 }
32244 /* OpenMP 2.5:
32245 schedule ( schedule-kind )
32246 schedule ( schedule-kind , expression )
32248 schedule-kind:
32249 static | dynamic | guided | runtime | auto
32251 OpenMP 4.5:
32252 schedule ( schedule-modifier : schedule-kind )
32253 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32255 schedule-modifier:
32256 simd
32257 monotonic
32258 nonmonotonic */
32260 static tree
32262 {
32272 {
32281 else
32287 else
32288 {
32291 }
32292 }
32295 {
32300 {
32321 }
32322 }
32327 else
32333 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32335 {
32339 }
32342 {
32357 else
32362 }
32374 invalid_kind:
32376 resync_fail:
32381 }
32383 /* OpenMP 3.0:
32384 untied */
32386 static tree
32389 {
32390 tree c;
32397 }
32399 /* OpenMP 4.0:
32400 inbranch
32401 notinbranch */
32403 static tree
32406 {
32411 }
32413 /* OpenMP 4.0:
32414 parallel
32415 for
32416 sections
32417 taskgroup */
32419 static tree
32423 {
32427 }
32429 /* OpenMP 4.5:
32430 nogroup */
32432 static tree
32435 {
32440 }
32442 /* OpenMP 4.5:
32443 simd
32444 threads */
32446 static tree
32450 {
32455 }
32457 /* OpenMP 4.0:
32458 num_teams ( expression ) */
32460 static tree
32462 location_t location)
32463 {
32485 }
32487 /* OpenMP 4.0:
32488 thread_limit ( expression ) */
32490 static tree
32492 location_t location)
32493 {
32515 }
32517 /* OpenMP 4.0:
32518 aligned ( variable-list )
32519 aligned ( variable-list : constant-expression ) */
32521 static tree
32523 {
32534 {
32544 }
32550 }
32552 /* OpenMP 4.0:
32553 linear ( variable-list )
32554 linear ( variable-list : expression )
32556 OpenMP 4.5:
32557 linear ( modifier ( variable-list ) )
32558 linear ( modifier ( variable-list ) : expression ) */
32560 static tree
32563 {
32573 {
32585 else
32587 }
32592 else
32593 {
32602 }
32605 {
32610 {
32621 {
32624 }
32627 }
32632 {
32635 }
32643 }
32646 {
32649 }
32652 }
32654 /* OpenMP 4.0:
32655 safelen ( constant-expression ) */
32657 static tree
32659 location_t location)
32660 {
32681 }
32683 /* OpenMP 4.0:
32684 simdlen ( constant-expression ) */
32686 static tree
32688 location_t location)
32689 {
32710 }
32712 /* OpenMP 4.5:
32713 vec:
32714 identifier [+/- integer]
32715 vec , identifier [+/- integer]
32716 */
32718 static tree
32720 tree list)
32721 {
32725 {
32728 }
32731 {
32738 else
32739 {
32740 t = cp_parser_lookup_name_simple
32745 id_loc);
32746 }
32752 {
32755 }
32759 {
32762 }
32766 {
32769 }
32772 add_to_vector:
32774 {
32778 }
32784 }
32787 {
32793 }
32795 }
32797 /* OpenMP 4.0:
32798 depend ( depend-kind : variable-list )
32800 depend-kind:
32801 in | out | inout
32803 OpenMP 4.5:
32804 depend ( source )
32806 depend ( sink : vec ) */
32808 static tree
32810 {
32818 {
32832 else
32834 }
32835 else
32841 {
32851 }
32858 else
32859 {
32865 }
32868 invalid_kind:
32870 resync_fail:
32875 }
32877 /* OpenMP 4.0:
32878 map ( map-kind : variable-list )
32879 map ( variable-list )
32881 map-kind:
32882 alloc | to | from | tofrom
32884 OpenMP 4.5:
32885 map-kind:
32886 alloc | to | from | tofrom | release | delete
32888 map ( always [,] map-kind: variable-list ) */
32890 static tree
32892 {
32901 {
32906 {
32909 nth++;
32915 {
32920 }
32921 }
32922 }
32926 {
32940 else
32941 {
32947 }
32950 }
32953 {
32957 }
32960 NULL);
32966 }
32968 /* OpenMP 4.0:
32969 device ( expression ) */
32971 static tree
32973 location_t location)
32974 {
32996 }
32998 /* OpenMP 4.0:
32999 dist_schedule ( static )
33000 dist_schedule ( static , expression ) */
33002 static tree
33004 location_t location)
33005 {
33018 {
33029 }
33034 location);
33038 invalid_kind:
33040 resync_fail:
33045 }
33047 /* OpenMP 4.0:
33048 proc_bind ( proc-bind-kind )
33050 proc-bind-kind:
33051 master | close | spread */
33053 static tree
33055 location_t location)
33056 {
33057 tree c;
33064 {
33074 else
33076 }
33077 else
33086 location);
33091 invalid_kind:
33093 resync_fail:
33098 }
33100 /* OpenACC:
33101 async [( int-expr )] */
33103 static tree
33105 {
33112 {
33121 }
33131 }
33133 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33134 is a bitmask in MASK. Return the list of clauses found. */
33136 static tree
33140 {
33145 {
33146 location_t here;
33147 pragma_omp_clause c_kind;
33148 omp_clause_code code;
33159 {
33211 clauses);
33229 OMP_CLAUSE_INDEPENDENT,
33241 clauses);
33247 clauses);
33271 clauses);
33293 clauses);
33305 clauses);
33319 }
33324 {
33325 /* Remove the invalid clause(s) from the list to avoid
33326 confusing the rest of the compiler. */
33329 }
33330 }
33332 saw_error:
33339 }
33341 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33342 is a bitmask in MASK. Return the list of clauses found; the result
33343 of clause default goes in *pdefault. */
33345 static tree
33349 {
33355 {
33356 pragma_omp_clause c_kind;
33367 {
33379 clauses);
33393 clauses);
33413 clauses);
33418 clauses);
33428 clauses);
33462 clauses);
33476 clauses);
33493 OMP_CLAUSE_NOTINBRANCH,
33502 {
33503 clause_not_first:
33507 }
33537 clauses);
33538 else
33548 clauses);
33566 {
33574 }
33617 clauses
33623 clauses
33635 }
33640 {
33641 /* Remove the invalid clause(s) from the list to avoid
33642 confusing the rest of the compiler. */
33645 }
33646 }
33647 saw_error:
33648 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33649 no reason to skip to the end. */
33653 {
33656 else
33658 }
33660 }
33662 /* OpenMP 2.5:
33663 structured-block:
33664 statement
33666 In practice, we're also interested in adding the statement to an
33667 outer node. So it is convenient if we work around the fact that
33668 cp_parser_statement calls add_stmt. */
33670 static unsigned
33672 {
33675 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33676 This preserves the "not within loop or switch" style error messages
33677 for nonsense cases like
33678 void foo() {
33679 #pragma omp single
33680 break;
33681 }
33682 */
33687 }
33689 static void
33691 {
33693 }
33695 static tree
33697 {
33705 }
33707 /* OpenMP 2.5:
33708 # pragma omp atomic new-line
33709 expression-stmt
33711 expression-stmt:
33712 x binop= expr | x++ | ++x | x-- | --x
33713 binop:
33714 +, *, -, /, &, ^, |, <<, >>
33716 where x is an lvalue expression with scalar type.
33718 OpenMP 3.1:
33719 # pragma omp atomic new-line
33720 update-stmt
33722 # pragma omp atomic read new-line
33723 read-stmt
33725 # pragma omp atomic write new-line
33726 write-stmt
33728 # pragma omp atomic update new-line
33729 update-stmt
33731 # pragma omp atomic capture new-line
33732 capture-stmt
33734 # pragma omp atomic capture new-line
33735 capture-block
33737 read-stmt:
33738 v = x
33739 write-stmt:
33740 x = expr
33741 update-stmt:
33742 expression-stmt | x = x binop expr
33743 capture-stmt:
33744 v = expression-stmt
33745 capture-block:
33746 { v = x; update-stmt; } | { update-stmt; v = x; }
33748 OpenMP 4.0:
33749 update-stmt:
33750 expression-stmt | x = x binop expr | x = expr binop x
33751 capture-stmt:
33752 v = update-stmt
33753 capture-block:
33754 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33756 where x and v are lvalue expressions with scalar type. */
33758 static void
33760 {
33768 {
33773 {
33779 }
33780 }
33782 {
33794 else
33798 }
33800 {
33806 {
33811 {
33814 }
33815 }
33816 }
33820 {
33830 else
33835 {
33836 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33837 opcode. */
33842 }
33846 {
33849 }
33850 else
33851 {
33857 }
33860 }
33862 restart:
33866 {
33873 /* FALLTHROUGH */
33883 /* FALLTHROUGH */
33898 /* Undo effects of boolean_increment for post {in,de}crement. */
33900 /* FALLTHRU */
33904 {
33905 /* Undo effects of boolean_increment. */
33907 {
33908 /* This is pre or post increment. */
33913 && !structured_block
33917 }
33918 }
33919 /* FALLTHRU */
33922 {
33957 {
33961 }
33964 {
33970 {
33975 }
33977 {
33989 {
33991 {
33996 }
33997 else
33999 }
34003 }
34006 {
34013 }
34017 }
34021 {
34024 {
34032 }
34034 {
34039 }
34074 }
34085 /* FALLTHROUGH */
34090 }
34097 }
34098 stmt_done:
34100 {
34111 }
34113 {
34116 }
34117 done:
34123 saw_error:
34126 {
34130 {
34134 }
34135 }
34136 }
34139 /* OpenMP 2.5:
34140 # pragma omp barrier new-line */
34142 static void
34144 {
34147 }
34149 /* OpenMP 2.5:
34150 # pragma omp critical [(name)] new-line
34151 structured-block
34153 OpenMP 4.5:
34154 # pragma omp critical [(name) [hint(expression)]] new-line
34155 structured-block */
34157 #define OMP_CRITICAL_CLAUSE_MASK \
34158 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34160 static tree
34162 {
34166 {
34180 OMP_CRITICAL_CLAUSE_MASK,
34182 }
34183 else
34188 }
34190 /* OpenMP 2.5:
34191 # pragma omp flush flush-vars[opt] new-line
34193 flush-vars:
34194 ( variable-list ) */
34196 static void
34198 {
34204 }
34206 /* Helper function, to parse omp for increment expression. */
34208 static tree
34210 {
34215 {
34218 }
34221 {
34230 /* Fall through: OpenMP disallows NE_EXPR. */
34234 }
34236 /* If decl is an iterator, preserve LHS and RHS of the relational
34237 expr until finish_omp_for. */
34248 }
34250 /* Helper function, to parse omp for increment expression. */
34252 static tree
34254 {
34258 cp_id_kind idk;
34262 {
34271 }
34280 {
34285 }
34292 {
34296 }
34309 do
34310 {
34317 {
34319 {
34322 else
34324 tf_warning_or_error);
34325 }
34326 else
34329 }
34330 }
34334 {
34340 }
34341 else
34345 }
34347 /* Parse the initialization statement of either an OpenMP for loop or
34348 a Cilk Plus for loop.
34350 Return true if the resulting construct should have an
34351 OMP_CLAUSE_PRIVATE added to it. */
34353 static tree
34362 {
34368 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34370 init-expr:
34371 var = lb
34372 integer-type var = lb
34373 random-access-iterator-type var = lb
34374 pointer-type var = lb
34375 */
34376 cp_decl_specifier_seq type_specifiers;
34378 /* First, try to parse as an initialized declaration. See
34379 cp_parser_condition, from whence the bulk of this is copied. */
34386 {
34387 /* If parsing a type specifier seq succeeded, then this
34388 MUST be a initialized declaration. */
34393 CP_PARSER_DECLARATOR_NAMED,
34404 else
34405 {
34415 {
34417 CPP_OPEN_PAREN))
34418 {
34422 else
34425 }
34426 else
34427 /* Trigger an error. */
34432 }
34436 {
34444 {
34447 auto_node);
34452 }
34455 asm_specification,
34456 LOOKUP_ONLYCONVERTING);
34459 {
34462 }
34463 else
34464 {
34467 {
34469 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34471 {
34475 {
34479 }
34481 }
34483 {
34488 }
34489 }
34490 }
34492 }
34493 else
34494 {
34495 /* Consume '='. */
34499 non_class:
34502 else
34505 asm_specification,
34506 LOOKUP_ONLYCONVERTING);
34507 }
34511 }
34512 }
34513 else
34514 {
34515 cp_id_kind idk;
34516 /* If parsing a type specifier sequence failed, then
34517 this MUST be a simple expression. */
34526 && decl
34529 {
34540 {
34545 }
34550 }
34552 && decl
34555 {
34556 tree rhs;
34564 rhs,
34565 tf_warning_or_error));
34568 }
34569 else
34570 {
34575 {
34579 }
34580 }
34581 }
34583 }
34585 /* Parse the restricted form of the for statement allowed by OpenMP. */
34587 static tree
34590 {
34594 location_t loc_first;
34605 {
34608 }
34611 {
34614 }
34617 {
34623 }
34625 {
34628 {
34630 "%<linear%> clause may not be specified together "
34633 }
34634 else
34636 }
34649 {
34652 location_t loc;
34656 {
34660 }
34663 {
34667 }
34676 add_private_clause
34683 {
34686 {
34692 }
34693 else
34695 }
34702 {
34707 {
34711 }
34714 {
34715 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34719 {
34722 }
34723 else
34724 {
34727 }
34729 }
34730 else
34731 {
34736 }
34737 }
34740 {
34741 tree c;
34743 {
34752 decl);
34756 decl);
34757 }
34759 {
34764 else
34769 {
34772 /* For linear, signal that we need to fill up
34773 the so far unknown linear step. */
34776 }
34777 }
34778 }
34787 {
34788 /* If decl is an iterator, preserve the operator on decl
34789 until finish_omp_for. */
34791 && ((processing_template_decl
34796 else
34800 }
34812 {
34815 }
34820 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34821 in between the collapsed for loops to be still considered perfectly
34822 nested. Hopefully the final version clarifies this.
34823 For now handle (multiple) {'s and empty statements. */
34826 {
34830 {
34832 bracecount++;
34833 }
34837 else
34838 {
34845 }
34846 }
34849 {
34852 }
34853 }
34858 /* Note that we saved the original contents of this flag when we entered
34859 the structured block, and so we don't need to re-save it here. */
34862 else
34865 /* Note that the grammar doesn't call for a structured block here,
34866 though the loop as a whole is a structured block. */
34873 else
34878 {
34880 {
34882 nbraces--;
34883 }
34886 else
34887 {
34889 {
34892 }
34897 }
34898 }
34901 {
34905 else
34907 }
34911 }
34913 /* Helper function for OpenMP parsing, split clauses and call
34914 finish_omp_clauses on each of the set of clauses afterwards. */
34916 static void
34919 {
34925 }
34927 /* OpenMP 4.0:
34928 #pragma omp simd simd-clause[optseq] new-line
34929 for-loop */
34931 #define OMP_SIMD_CLAUSE_MASK \
34932 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34933 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34934 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34935 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34936 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34937 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34938 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34939 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34941 static tree
34945 {
34956 {
34960 OMP_CLAUSE_ORDERED);
34962 {
34964 "%<ordered%> clause with parameter may not be specified "
34967 }
34968 }
34979 }
34981 /* OpenMP 2.5:
34982 #pragma omp for for-clause[optseq] new-line
34983 for-loop
34985 OpenMP 4.0:
34986 #pragma omp for simd for-simd-clause[optseq] new-line
34987 for-loop */
34989 #define OMP_FOR_CLAUSE_MASK \
34990 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34991 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34992 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34996 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34997 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34998 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35000 static tree
35004 {
35011 /* parallel for{, simd} disallows nowait clause, but for
35012 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35015 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35020 {
35025 {
35049 }
35050 }
35052 {
35055 }
35057 /* Composite distribute parallel for disallows linear clause. */
35064 {
35067 }
35078 }
35080 /* OpenMP 2.5:
35081 # pragma omp master new-line
35082 structured-block */
35084 static tree
35086 {
35090 }
35092 /* OpenMP 2.5:
35093 # pragma omp ordered new-line
35094 structured-block
35096 OpenMP 4.5:
35097 # pragma omp ordered ordered-clauses new-line
35098 structured-block */
35100 #define OMP_ORDERED_CLAUSE_MASK \
35101 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35104 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35105 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35107 static bool
35110 {
35114 {
35119 {
35121 {
35123 "%<depend%> clause may only be used in compound "
35127 }
35128 tree clauses
35130 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35134 }
35135 }
35137 tree clauses
35143 }
35145 /* OpenMP 2.5:
35147 section-scope:
35148 { section-sequence }
35150 section-sequence:
35151 section-directive[opt] structured-block
35152 section-sequence section-directive structured-block */
35154 static tree
35156 {
35168 {
35172 }
35175 {
35183 {
35187 }
35189 {
35192 }
35197 }
35208 }
35210 /* OpenMP 2.5:
35211 # pragma omp sections sections-clause[optseq] newline
35212 sections-scope */
35214 #define OMP_SECTIONS_CLAUSE_MASK \
35215 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35221 static tree
35224 {
35236 {
35239 }
35246 }
35248 /* OpenMP 2.5:
35249 # pragma omp parallel parallel-clause[optseq] new-line
35250 structured-block
35251 # pragma omp parallel for parallel-for-clause[optseq] new-line
35252 structured-block
35253 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35254 structured-block
35256 OpenMP 4.0:
35257 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35258 structured-block */
35260 #define OMP_PARALLEL_CLAUSE_MASK \
35261 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35271 static tree
35275 {
35282 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35288 {
35296 if_p);
35300 if_p);
35303 block);
35308 }
35309 /* When combined with distribute, parallel has to be followed by for.
35310 #pragma omp target parallel is allowed though. */
35314 {
35318 }
35320 {
35323 }
35325 {
35329 {
35339 block);
35342 }
35343 }
35348 {
35351 }
35359 }
35361 /* OpenMP 2.5:
35362 # pragma omp single single-clause[optseq] new-line
35363 structured-block */
35365 #define OMP_SINGLE_CLAUSE_MASK \
35366 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35371 static tree
35373 {
35383 }
35385 /* OpenMP 3.0:
35386 # pragma omp task task-clause[optseq] new-line
35387 structured-block */
35389 #define OMP_TASK_CLAUSE_MASK \
35390 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35401 static tree
35403 {
35414 }
35416 /* OpenMP 3.0:
35417 # pragma omp taskwait new-line */
35419 static void
35421 {
35424 }
35426 /* OpenMP 3.1:
35427 # pragma omp taskyield new-line */
35429 static void
35431 {
35434 }
35436 /* OpenMP 4.0:
35437 # pragma omp taskgroup new-line
35438 structured-block */
35440 static tree
35442 {
35446 if_p));
35447 }
35450 /* OpenMP 2.5:
35451 # pragma omp threadprivate (variable-list) */
35453 static void
35455 {
35456 tree vars;
35462 }
35464 /* OpenMP 4.0:
35465 # pragma omp cancel cancel-clause[optseq] new-line */
35467 #define OMP_CANCEL_CLAUSE_MASK \
35468 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35474 static void
35476 {
35480 }
35482 /* OpenMP 4.0:
35483 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35485 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35486 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35491 static void
35494 {
35495 tree clauses;
35499 {
35504 {
35507 }
35508 }
35510 {
35514 }
35517 {
35522 else
35526 }
35529 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35531 pragma_tok);
35533 }
35535 /* OpenMP 4.0:
35536 #pragma omp distribute distribute-clause[optseq] new-line
35537 for-loop */
35539 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35540 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35546 static tree
35550 {
35559 {
35567 else
35570 {
35576 {
35580 else
35583 }
35589 else
35603 }
35604 }
35606 {
35609 }
35614 {
35617 }
35628 }
35630 /* OpenMP 4.0:
35631 # pragma omp teams teams-clause[optseq] new-line
35632 structured-block */
35634 #define OMP_TEAMS_CLAUSE_MASK \
35635 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35643 static tree
35647 {
35656 {
35660 {
35685 }
35686 }
35688 {
35691 }
35696 {
35699 }
35708 }
35710 /* OpenMP 4.0:
35711 # pragma omp target data target-data-clause[optseq] new-line
35712 structured-block */
35714 #define OMP_TARGET_DATA_CLAUSE_MASK \
35715 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35720 static tree
35722 {
35723 tree clauses
35728 {
35731 {
35748 "%<#pragma omp target data%> with map-type other "
35749 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35753 }
35755 }
35758 {
35761 "%<#pragma omp target data%> must contain at least "
35764 }
35775 }
35777 /* OpenMP 4.5:
35778 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35779 structured-block */
35781 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35782 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35788 static tree
35791 {
35794 {
35799 {
35802 }
35803 }
35805 {
35809 }
35812 {
35818 }
35820 tree clauses
35825 {
35828 {
35841 "%<#pragma omp target enter data%> with map-type other "
35845 }
35847 }
35850 {
35853 "%<#pragma omp target enter data%> must contain at least "
35856 }
35863 }
35865 /* OpenMP 4.5:
35866 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35867 structured-block */
35869 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35870 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35876 static tree
35879 {
35882 {
35887 {
35890 }
35891 }
35893 {
35897 }
35900 {
35906 }
35908 tree clauses
35913 {
35916 {
35930 "%<#pragma omp target exit data%> with map-type other "
35931 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35935 }
35937 }
35940 {
35943 "%<#pragma omp target exit data%> must contain at least "
35946 }
35953 }
35955 /* OpenMP 4.0:
35956 # pragma omp target update target-update-clause[optseq] new-line */
35958 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35959 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35966 static bool
35969 {
35971 {
35977 }
35979 tree clauses
35984 {
35986 "%<#pragma omp target update%> must contain at least one "
35989 }
35997 }
35999 /* OpenMP 4.0:
36000 # pragma omp target target-clause[optseq] new-line
36001 structured-block */
36003 #define OMP_TARGET_CLAUSE_MASK \
36004 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36008 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36009 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36014 static bool
36017 {
36021 {
36033 {
36041 {
36042 tree stmt;
36044 {
36047 OMP_TARGET_CLAUSE_MASK,
36052 OMP_TARGET_CLAUSE_MASK,
36057 OMP_TARGET_CLAUSE_MASK,
36062 }
36064 }
36069 {
36073 if_p);
36078 if_p);
36083 if_p);
36087 }
36093 {
36094 /* For combined target teams, ensure the num_teams and
36095 thread_limit clause expressions are evaluated on the host,
36096 before entering the target construct. */
36097 tree c;
36103 {
36112 OMP_CLAUSE_FIRSTPRIVATE);
36117 }
36118 }
36128 }
36130 {
36133 }
36135 {
36139 }
36141 {
36145 }
36147 {
36151 }
36153 {
36156 }
36157 }
36159 {
36162 }
36177 check_clauses:
36179 {
36182 {
36196 "%<#pragma omp target%> with map-type other "
36197 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36201 }
36203 }
36205 }
36207 /* OpenACC 2.0:
36208 # pragma acc cache (variable-list) new-line
36209 */
36211 static tree
36213 {
36228 }
36230 /* OpenACC 2.0:
36231 # pragma acc data oacc-data-clause[optseq] new-line
36232 structured-block */
36234 #define OACC_DATA_CLAUSE_MASK \
36235 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36236 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36238 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36240 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36241 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36242 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36243 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36244 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36245 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36247 static tree
36249 {
36262 }
36264 /* OpenACC 2.0:
36265 # pragma acc host_data <clauses> new-line
36266 structured-block */
36268 #define OACC_HOST_DATA_CLAUSE_MASK \
36269 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36271 static tree
36273 {
36286 }
36288 /* OpenACC 2.0:
36289 # pragma acc declare oacc-data-clause[optseq] new-line
36290 */
36292 #define OACC_DECLARE_CLAUSE_MASK \
36293 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36306 static tree
36308 {
36317 {
36321 }
36324 {
36328 {
36332 }
36335 {
36347 {
36349 "%qD must be a global variable in "
36351 decl);
36354 }
36359 {
36363 }
36365 {
36367 "invalid use of %<extern%> variable %qD "
36371 }
36373 {
36375 "invalid use of %<global%> variable %qD "
36379 }
36381 }
36386 {
36391 }
36394 {
36395 tree id;
36399 else
36405 {
36408 {
36411 {
36415 }
36416 }
36417 }
36418 }
36419 }
36432 }
36434 /* OpenACC 2.0:
36435 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36437 or
36439 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36441 LOC is the location of the #pragma token.
36442 */
36444 #define OACC_ENTER_DATA_CLAUSE_MASK \
36445 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36447 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36453 #define OACC_EXIT_DATA_CLAUSE_MASK \
36454 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36460 static tree
36463 {
36472 {
36477 }
36484 else
36489 {
36493 }
36501 }
36503 /* OpenACC 2.0:
36504 # pragma acc loop oacc-loop-clause[optseq] new-line
36505 structured-block */
36507 #define OACC_LOOP_CLAUSE_MASK \
36508 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36512 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36513 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36519 static tree
36522 {
36531 {
36537 }
36546 }
36548 /* OpenACC 2.0:
36549 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36550 structured-block
36552 or
36554 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36555 structured-block
36556 */
36558 #define OACC_KERNELS_CLAUSE_MASK \
36559 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36567 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36568 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36569 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36570 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36573 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36574 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36575 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36577 #define OACC_PARALLEL_CLAUSE_MASK \
36578 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36579 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36580 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36581 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36599 static tree
36602 {
36603 omp_clause_mask mask;
36606 {
36619 }
36622 {
36626 {
36629 tree clauses;
36631 if_p);
36633 }
36634 }
36643 }
36645 /* OpenACC 2.0:
36646 # pragma acc update oacc-update-clause[optseq] new-line
36647 */
36649 #define OACC_UPDATE_CLAUSE_MASK \
36650 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36654 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36655 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36657 static tree
36659 {
36666 {
36668 "%<#pragma acc update%> must contain at least one "
36671 }
36679 }
36681 /* OpenACC 2.0:
36682 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36684 LOC is the location of the #pragma token.
36685 */
36687 #define OACC_WAIT_CLAUSE_MASK \
36688 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36690 static tree
36692 {
36706 }
36708 /* OpenMP 4.0:
36709 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36711 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36712 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36719 static void
36722 {
36724 cp_omp_declare_simd_data data;
36726 {
36731 /* It is safe to take the address of a local variable; it will only be
36732 used while this scope is live. */
36734 }
36736 /* Store away all pragma tokens. */
36748 {
36752 {
36765 }
36770 "%<#pragma omp declare simd%> not immediately followed by "
36774 }
36775 }
36777 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36778 This function is modelled similar to the late parsing of omp declare
36779 simd. */
36781 static tree
36783 {
36790 {
36792 "used in the same function marked as a Cilk Plus SIMD-enabled "
36798 }
36800 {
36804 }
36809 {
36816 NULL);
36830 }
36836 }
36838 /* Finalize #pragma omp declare simd clauses after direct declarator has
36839 been parsed, and put that into "omp declare simd" attribute. */
36841 static tree
36843 {
36849 {
36853 }
36858 {
36876 }
36880 }
36883 /* OpenMP 4.0:
36884 # pragma omp declare target new-line
36885 declarations and definitions
36886 # pragma omp end declare target new-line
36888 OpenMP 4.5:
36889 # pragma omp declare target ( extended-list ) new-line
36891 # pragma omp declare target declare-target-clauses[seq] new-line */
36893 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36894 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36897 static void
36899 {
36902 clauses
36906 {
36908 clauses);
36911 }
36912 else
36913 {
36917 }
36920 "%<#pragma omp declare target%> with clauses in between "
36921 "%<#pragma omp declare target%> without clauses and "
36924 {
36930 {
36933 }
36934 else
36937 {
36939 "%qD specified both in declare target %<link%> and %<to%>"
36942 }
36944 {
36951 {
36954 {
36958 }
36959 }
36960 }
36961 }
36962 }
36964 static void
36966 {
36969 {
36972 }
36974 {
36978 {
36981 }
36984 else
36985 {
36989 }
36990 }
36991 else
36992 {
36996 }
37000 "%<#pragma omp end declare target%> without corresponding "
37002 else
37004 }
37006 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37007 expression and optional initializer clause of
37008 #pragma omp declare reduction. We store the expression(s) as
37009 either 3, 6 or 7 special statements inside of the artificial function's
37010 body. The first two statements are DECL_EXPRs for the artificial
37011 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37012 expression that uses those variables.
37013 If there was any INITIALIZER clause, this is followed by further statements,
37014 the fourth and fifth statements are DECL_EXPRs for the artificial
37015 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37016 constructor variant (first token after open paren is not omp_priv),
37017 then the sixth statement is a statement with the function call expression
37018 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37019 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37020 to initialize the OMP_PRIV artificial variable and there is seventh
37021 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37023 static bool
37025 {
37037 tree combiner;
37052 {
37055 }
37058 {
37065 {
37068 }
37084 {
37088 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37092 == CPP_CLOSE_PAREN
37095 {
37099 }
37104 }
37105 else
37106 {
37122 {
37127 }
37129 tree arg;
37142 }
37153 }
37159 }
37161 /* OpenMP 4.0
37162 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37163 initializer-clause[opt] new-line
37165 initializer-clause:
37166 initializer (omp_priv initializer)
37167 initializer (function-name (argument-list)) */
37169 static void
37172 {
37182 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37189 {
37221 }
37233 /* Types may not be defined in declare reduction type list. */
37236 parser->type_definition_forbidden_message
37242 saved_colon_doesnt_start_class_def_p
37247 {
37251 ;
37270 else
37275 else
37277 }
37279 /* Restore the saved message. */
37282 parser->colon_doesnt_start_class_def_p
37287 {
37288 fail:
37291 }
37297 {
37298 tree fntype
37301 NULL_TREE);
37321 {
37326 }
37328 {
37330 {
37339 }
37346 }
37347 else
37348 {
37351 }
37354 else
37357 {
37360 }
37362 {
37365 else
37370 }
37375 else
37376 {
37385 }
37392 }
37396 done:
37397 /* Free any declarators allocated. */
37399 }
37401 /* OpenMP 4.0
37402 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37403 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37404 initializer-clause[opt] new-line
37405 #pragma omp declare target new-line */
37407 static void
37410 {
37412 {
37417 {
37420 context);
37422 }
37425 {
37428 context);
37430 }
37432 {
37435 }
37437 {
37441 }
37442 }
37446 }
37448 /* OpenMP 4.5:
37449 #pragma omp taskloop taskloop-clause[optseq] new-line
37450 for-loop
37452 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37453 for-loop */
37455 #define OMP_TASKLOOP_CLAUSE_MASK \
37456 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37471 static tree
37475 {
37484 {
37489 {
37513 }
37514 }
37516 {
37519 }
37524 {
37527 }
37533 if_p);
37539 }
37542 /* OpenACC 2.0:
37543 # pragma acc routine oacc-routine-clause[optseq] new-line
37544 function-definition
37546 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37547 */
37549 #define OACC_ROUTINE_CLAUSE_MASK \
37550 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37556 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37557 component, which must resolve to a declared namespace-scope
37558 function. The clauses are either processed directly (for a named
37559 function), or defered until the immediatley following declaration
37560 is parsed. */
37562 static void
37565 {
37567 /* The checking for "another pragma following this one" in the "no optional
37568 '( name )'" case makes sure that we dont re-enter. */
37571 cp_oacc_routine_data data;
37577 /* It is safe to take the address of a local variable; it will only be
37578 used while this scope is live. */
37581 /* Look for optional '( name )'. */
37583 {
37586 /* We parse the name as an id-expression. If it resolves to
37587 anything other than a non-overloaded function at namespace
37588 scope, it's an error. */
37602 {
37606 }
37608 data.clauses
37616 {
37621 }
37623 /* Perhaps we should use the same rule as declarations in different
37624 namespaces? */
37626 {
37631 }
37634 {
37638 }
37642 }
37644 {
37645 /* Store away all pragma tokens. */
37656 /* Emit a helpful diagnostic if there's another pragma following this
37657 one. */
37659 {
37662 /* ..., and then just keep going. */
37664 }
37666 /* We only have to consider the pragma_external case here. */
37671 else
37674 }
37675 }
37677 /* Finalize #pragma acc routine clauses after direct declarator has
37678 been parsed. */
37680 static tree
37682 {
37687 {
37689 "%<#pragma acc routine%> not immediately followed by "
37692 }
37709 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37710 fndecl_seen. */
37713 }
37715 /* Apply any saved OpenACC routine clauses to a just-parsed
37716 declaration. */
37718 static void
37720 {
37722 {
37723 /* Keep going if we're in error reporting mode. */
37729 {
37731 "%<#pragma acc routine%> not immediately followed by"
37735 }
37737 {
37740 }
37743 {
37748 }
37751 {
37759 }
37761 /* Process the routine's dimension clauses. */
37765 /* Add an "omp declare target" attribute. */
37770 /* Don't unset parser->oacc_routine here: we may still need it to
37771 diagnose wrong usage. But, remember that we've used this "#pragma acc
37772 routine". */
37774 }
37775 }
37777 /* Main entry point to OpenMP statement pragmas. */
37779 static void
37781 {
37782 tree stmt;
37787 {
37810 if_p);
37815 if_p);
37832 if_p);
37837 if_p);
37845 if_p);
37854 if_p);
37868 if_p);
37873 if_p);
37877 }
37880 }
37881 \f
37882 /* Transactional Memory parsing routines. */
37884 /* Parse a transaction attribute.
37886 txn-attribute:
37887 attribute
37888 [ [ identifier ] ]
37890 We use this instead of cp_parser_attributes_opt for transactions to avoid
37891 the pedwarn in C++98 mode. */
37893 static tree
37895 {
37910 {
37914 /* For keywords, use the canonical spelling,
37915 not the parsed identifier. */
37919 }
37920 else
37924 error1:
37927 }
37929 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37931 transaction-statement:
37932 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37933 compound-statement
37934 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37935 */
37937 static tree
37939 {
37950 else
37951 {
37955 }
37957 /* Parse a noexcept specification. */
37961 {
37962 /* cancel-and-throw is unimplemented. */
37965 }
37966 else
37969 /* Keep track if we're in the lexical scope of an outer transaction. */
37981 }
37983 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37985 transaction-expression:
37986 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37987 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37988 */
37990 static tree
37992 {
38005 keyword == RID_TRANSACTION_RELAXED
38019 /* Set this early. This might mean that we allow transaction_cancel in
38020 an expression that we find out later actually has to be a constexpr.
38021 However, we expect that cxx_constant_value will be able to deal with
38022 this; also, if the noexcept has no constexpr, then what we parse next
38023 really is a transaction's body. */
38026 /* Parse a noexcept specification. */
38032 {
38039 }
38040 else
38041 {
38042 /* The only expression that is available got parsed for the noexcept
38043 already. noexcept is true then. */
38046 }
38055 }
38057 /* Parse a function-transaction-block.
38059 function-transaction-block:
38060 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38061 function-body
38062 __transaction_atomic txn-attribute[opt] function-try-block
38063 __transaction_relaxed ctor-initializer[opt] function-body
38064 __transaction_relaxed function-try-block
38065 */
38067 static bool
38069 {
38085 else
38086 {
38090 }
38098 else
38099 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
38107 }
38109 /* Parse a __transaction_cancel statement.
38111 cancel-statement:
38112 __transaction_cancel txn-attribute[opt] ;
38113 __transaction_cancel txn-attribute[opt] throw-expression ;
38115 ??? Cancel and throw is not yet implemented. */
38117 static tree
38119 {
38125 RT_TRANSACTION_CANCEL);
38132 /* ??? Parse cancel-and-throw here. */
38137 {
38141 }
38143 {
38147 }
38149 {
38152 {
38158 }
38159 }
38161 {
38165 }
38171 }
38172 \f
38173 /* The parser. */
38177 \f
38178 /* Special handling for the first token or line in the file. The first
38179 thing in the file might be #pragma GCC pch_preprocess, which loads a
38180 PCH file, which is a GC collection point. So we need to handle this
38181 first pragma without benefit of an existing lexer structure.
38183 Always returns one token to the caller in *FIRST_TOKEN. This is
38184 either the true first token of the file, or the first token after
38185 the initial pragma. */
38187 static void
38189 {
38198 {
38205 }
38206 else
38209 /* Skip to the end of the pragma. */
38213 /* Now actually load the PCH file. */
38217 /* Read one more token to return to our caller. We have to do this
38218 after reading the PCH file in, since its pointers have to be
38219 live. */
38221 }
38223 /* Parses the grainsize pragma for the _Cilk_for statement.
38224 Syntax:
38225 #pragma cilk grainsize = <VALUE>. */
38227 static void
38229 {
38231 {
38236 {
38239 }
38241 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38244 else
38246 "%<#pragma cilk grainsize%> is not followed by "
38249 }
38251 }
38253 /* Normal parsing of a pragma token. Here we can (and must) use the
38254 regular lexer. */
38256 static bool
38258 {
38261 tree stmt;
38272 {
38280 {
38290 }
38295 {
38305 }
38310 {
38321 }
38326 {
38337 }
38342 {
38353 }
38374 {
38379 }
38387 {
38392 }
38400 {
38404 }
38410 {
38415 }
38423 {
38428 }
38483 "%<#pragma omp section%> may only be used in "
38488 {
38490 {
38494 }
38501 {
38504 }
38507 }
38511 {
38515 }
38523 {
38527 }
38529 /* Ignore the pragma if Cilk Plus is not enabled. */
38531 {
38534 }
38535 else
38536 {
38540 }
38547 bad_stmt:
38550 }
38554 }
38556 /* The interface the pragma parsers have to the lexer. */
38558 enum cpp_ttype
38560 {
38572 else
38573 {
38577 }
38580 }
38582 \f
38583 /* External interface. */
38585 /* Parse one entire translation unit. */
38587 void
38589 {
38602 }
38604 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38605 vectorlength clause:
38606 Syntax:
38607 vectorlength ( constant-expression ) */
38609 static tree
38612 {
38614 tree expr;
38615 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38616 safelen clause. Thus, vectorlength is represented as OMP 4.0
38617 safelen. For SIMD-enabled function it is represented by OMP 4.0
38618 simdlen. */
38621 loc);
38622 else
38624 loc);
38632 /* If expr == error_mark_node, then don't emit any errors nor
38633 create a clause. if any of the above functions returns
38634 error mark node then they would have emitted an error message. */
38636 ;
38644 else
38645 {
38646 tree c;
38648 {
38653 }
38654 else
38655 {
38660 }
38661 }
38666 }
38668 /* Handles the Cilk Plus #pragma simd linear clause.
38669 Syntax:
38670 linear ( simd-linear-variable-list )
38672 simd-linear-variable-list:
38673 simd-linear-variable
38674 simd-linear-variable-list , simd-linear-variable
38676 simd-linear-variable:
38677 id-expression
38678 id-expression : simd-linear-step
38680 simd-linear-step:
38681 conditional-expression */
38683 static tree
38685 {
38691 {
38695 }
38700 {
38703 {
38707 }
38714 {
38718 }
38719 else
38720 {
38724 /* If present, parse the linear step. Otherwise, assume the default
38725 value of 1. */
38727 {
38734 {
38735 /* If an error has occurred, then the whole pragma is
38736 considered ill-formed. Thus, no reason to keep
38737 parsing. */
38740 }
38748 else
38750 "step size must be an integer constant "
38752 }
38754 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38760 }
38765 else
38766 {
38771 }
38772 }
38776 }
38778 /* Returns the name of the next clause. If the clause is not
38779 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38780 token is not consumed. Otherwise, the appropriate enum from the
38781 pragma_simd_clause is returned and the token is consumed. */
38783 static pragma_omp_clause
38785 {
38786 pragma_omp_clause clause_type;
38803 else
38808 }
38810 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38812 static tree
38814 {
38819 {
38820 pragma_omp_clause c_kind;
38827 /* Use the OpenMP 4.0 equivalent function. */
38830 /* Use the OpenMP 4.0 equivalent function. */
38832 clauses);
38834 /* Use the OMP 4.0 equivalent function. */
38836 clauses);
38838 /* Use the OMP 4.0 equivalent function. */
38840 else
38841 {
38845 }
38846 }
38852 else
38854 }
38856 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38858 static void
38860 {
38867 {
38871 }
38880 }
38882 /* Main entry-point for parsing Cilk Plus _Cilk_for
38883 loops. The return value is error_mark_node
38884 when errors happen and CILK_FOR tree on success. */
38886 static tree
38888 {
38903 else
38909 }
38911 /* Create an identifier for a generic parameter type (a synthesized
38912 template parameter implied by `auto' or a concept identifier). */
38915 static tree
38917 {
38921 }
38923 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38924 (creating a new template parameter list if necessary). Returns the newly
38925 created template type parm. */
38927 static tree
38929 {
38932 /* Before committing to modifying any scope, if we're in an
38933 implicit template scope, and we're trying to synthesize a
38934 constrained parameter, try to find a previous parameter with
38935 the same name. This is the same-type rule for abbreviated
38936 function templates.
38938 NOTE: We can generate implicit parameters when tentatively
38939 parsing a nested name specifier, only to reject that parse
38940 later. However, matching the same template-id as part of a
38941 direct-declarator should generate an identical template
38942 parameter, so this rule will merge them. */
38944 {
38947 {
38949 {
38952 /* Return the TEMPLATE_PARM_INDEX. */
38955 }
38957 }
38958 }
38960 /* We are either continuing a function template that already contains implicit
38961 template parameters, creating a new fully-implicit function template, or
38962 extending an existing explicit function template with implicit template
38963 parameters. */
38971 {
38975 }
38976 else
38977 {
38978 /* Roll back to the existing template parameter scope (in the case of
38979 extending an explicit function template) or introduce a new template
38980 parameter scope ahead of the function parameter scope (or class scope
38981 in the case of out-of-line member definitions). The function scope is
38982 added back after template parameter synthesis below. */
38987 {
38990 }
38992 {
38993 /* If not defining a class, then any class scope is a scope level in
38994 an out-of-line member definition. In this case simply wind back
38995 beyond the first such scope to inject the template parameter list.
38996 Otherwise wind back to the class being defined. The latter can
38997 occur in class member friend declarations such as:
38999 class A {
39000 void foo (auto);
39001 };
39002 class B {
39003 friend void A::foo (auto);
39004 };
39006 The template parameter list synthesized for the friend declaration
39007 must be injected in the scope of 'B'. This can also occur in
39008 erroneous cases such as:
39010 struct A {
39011 struct B {
39012 void foo (auto);
39013 };
39014 void B::foo (auto) {}
39015 };
39017 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39018 but, nevertheless, the template parameter list synthesized for the
39019 declarator should be injected into the scope of 'A' as if the
39020 ill-formed template was specified explicitly. */
39023 {
39026 }
39027 }
39033 {
39034 /* Introduce a new template parameter list for implicit template
39035 parameters. */
39039 parser->implicit_template_scope
39046 }
39047 else
39048 {
39049 /* Synthesize implicit template parameters at the end of the explicit
39050 template parameter list. */
39057 parser->implicit_template_parms
39059 }
39060 }
39062 /* Synthesize a new template parameter and track the current template
39063 parameter chain with implicit_template_parms. */
39067 tree synth_tmpl_parm;
39071 synth_tmpl_parm
39074 synth_tmpl_parm
39076 else
39077 {
39081 }
39083 // Attach the constraint to the parm before processing.
39086 tree new_parm
39088 input_location,
39089 node,
39093 // Chain the new parameter to the list of implicit parameters.
39095 parser->implicit_template_parms
39097 else
39102 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39105 /* If creating a fully implicit function template, start the new implicit
39106 template parameter list with this synthesized type, otherwise grow the
39107 current template parameter list. */
39110 {
39117 }
39118 else
39119 {
39124 }
39126 // If the new parameter was constrained, we need to add that to the
39127 // constraints in the template parameter list.
39129 {
39133 }
39138 }
39140 /* Finish the declaration of a fully implicit function template. Such a
39141 template has no explicit template parameter list so has not been through the
39142 normal template head and tail processing. synthesize_implicit_template_parm
39143 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39144 provided if the declaration is a class member such that its template
39145 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39146 form is returned. Otherwise NULL_TREE is returned. */
39148 static tree
39150 {
39155 {
39159 }
39169 }