| blob | 891341d1e8132784cdd1bdb8ce24a77c1bfe7ddd |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2017 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
47 \f
48 /* The lexer. */
50 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
51 and c-lex.c) and the C++ parser. */
54 {
56 };
58 /* The various kinds of non integral constant we encounter. */
60 NIC_NONE,
61 /* floating-point literal */
62 NIC_FLOAT,
63 /* %<this%> */
64 NIC_THIS,
65 /* %<__FUNCTION__%> */
66 NIC_FUNC_NAME,
67 /* %<__PRETTY_FUNCTION__%> */
68 NIC_PRETTY_FUNC,
69 /* %<__func__%> */
70 NIC_C99_FUNC,
71 /* "%<va_arg%> */
72 NIC_VA_ARG,
73 /* a cast */
74 NIC_CAST,
75 /* %<typeid%> operator */
76 NIC_TYPEID,
77 /* non-constant compound literals */
78 NIC_NCC,
79 /* a function call */
80 NIC_FUNC_CALL,
81 /* an increment */
82 NIC_INC,
83 /* an decrement */
84 NIC_DEC,
85 /* an array reference */
86 NIC_ARRAY_REF,
87 /* %<->%> */
88 NIC_ARROW,
89 /* %<.%> */
90 NIC_POINT,
91 /* the address of a label */
92 NIC_ADDR_LABEL,
93 /* %<*%> */
94 NIC_STAR,
95 /* %<&%> */
96 NIC_ADDR,
97 /* %<++%> */
98 NIC_PREINCREMENT,
99 /* %<--%> */
100 NIC_PREDECREMENT,
101 /* %<new%> */
102 NIC_NEW,
103 /* %<delete%> */
104 NIC_DEL,
105 /* calls to overloaded operators */
106 NIC_OVERLOADED,
107 /* an assignment */
108 NIC_ASSIGNMENT,
109 /* a comma operator */
110 NIC_COMMA,
111 /* a call to a constructor */
112 NIC_CONSTRUCTOR,
113 /* a transaction expression */
114 NIC_TRANSACTION
115 };
117 /* The various kinds of errors about name-lookup failing. */
119 /* NULL */
120 NLE_NULL,
121 /* is not a type */
122 NLE_TYPE,
123 /* is not a class or namespace */
124 NLE_CXX98,
125 /* is not a class, namespace, or enumeration */
126 NLE_NOT_CXX98
127 };
129 /* The various kinds of required token */
131 RT_NONE,
153 /* The type is CPP_KEYWORD */
182 RT_TRANSACTION_CANCEL /* __transaction_cancel */
183 };
185 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
186 reverting it on destruction. */
188 class type_id_in_expr_sentinel
189 {
199 };
201 /* Prototypes. */
207 static void cp_lexer_destroy
209 static int cp_lexer_saving_tokens
213 static void cp_lexer_get_preprocessor_token
221 static bool cp_lexer_next_token_is_not
223 static bool cp_lexer_next_token_is_keyword
227 static void cp_lexer_purge_token
229 static void cp_lexer_purge_tokens_after
231 static void cp_lexer_save_tokens
233 static void cp_lexer_commit_tokens
235 static void cp_lexer_rollback_tokens
237 static void cp_lexer_print_token
241 static void cp_lexer_start_debugging
243 static void cp_lexer_stop_debugging
249 static void cp_parser_initial_pragma
252 static void cp_parser_cilk_simd
254 static tree cp_parser_cilk_for
256 static bool cp_parser_omp_declare_reduction_exprs
258 static tree cp_parser_cilk_simd_vectorlength
260 static void cp_finalize_oacc_routine
263 /* Manifest constants. */
264 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
265 #define CP_SAVED_TOKEN_STACK 5
267 /* Variables. */
269 /* The stream to which debugging output should be written. */
272 /* Nonzero if we are parsing an unevaluated operand: an operand to
273 sizeof, typeof, or alignof. */
276 /* Dump up to NUM tokens in BUFFER to FILE starting with token
277 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
278 first token in BUFFER. If NUM is 0, dump all the tokens. If
279 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
280 highlighted by surrounding it in [[ ]]. */
282 static void
286 {
303 {
306 }
311 {
318 nprinted++;
328 {
338 }
339 }
342 {
345 }
348 }
351 /* Dump all tokens in BUFFER to stderr. */
353 void
355 {
357 }
359 DEBUG_FUNCTION void
361 {
363 }
365 DEBUG_FUNCTION void
367 {
370 else
372 }
375 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
376 description for T. */
378 static void
380 {
382 {
385 }
386 }
389 /* Dump parser context C to FILE. */
391 static void
393 {
398 }
401 /* Print the stack of parsing contexts to FILE starting with FIRST. */
403 static void
405 {
411 {
414 }
415 }
418 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
420 static void
422 {
425 }
428 /* Print an unparsed function entry UF to FILE. */
430 static void
432 {
435 tree fn;
440 i++)
441 {
447 }
452 {
455 }
461 {
464 }
466 }
469 /* Print the stack of unparsed member functions S to FILE. */
471 static void
474 {
480 {
483 }
484 }
487 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
488 the given PARSER. If FILE is NULL, the output is printed on stderr. */
490 static void
492 {
504 next_token);
505 }
508 /* Dump debugging information for the given PARSER. If FILE is NULL,
509 the output is printed on stderr. */
511 void
513 {
516 expanded_location eloc;
594 }
596 DEBUG_FUNCTION void
598 {
600 }
602 DEBUG_FUNCTION void
604 {
607 else
609 }
611 /* Allocate memory for a new lexer object and return it. */
615 {
620 /* Allocate the memory. */
623 /* Initially we are not debugging. */
628 /* Create the buffer. */
632 }
635 /* Create a new main C++ lexer, the lexer that gets tokens from the
636 preprocessor. */
640 {
642 cp_token token;
644 /* It's possible that parsing the first pragma will load a PCH file,
645 which is a GC collection point. So we have to do that before
646 allocating any memory. */
651 /* Put the first token in the buffer. */
654 /* Get the remaining tokens from the preprocessor. */
656 {
659 }
668 /* Subsequent preprocessor diagnostics should use compiler
669 diagnostic functions to get the compiler source location. */
674 }
676 /* Create a new lexer whose token stream is primed with the tokens in
677 CACHE. When these tokens are exhausted, no new tokens will be read. */
681 {
686 /* We do not own the buffer. */
693 /* Initially we are not debugging. */
698 }
700 /* Frees all resources associated with LEXER. */
702 static void
704 {
708 }
710 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
711 be used. The point of this flag is to help the compiler to fold away calls
712 to cp_lexer_debugging_p within this source file at compile time, when the
713 lexer is not being debugged. */
715 #define LEXER_DEBUGGING_ENABLED_P false
717 /* Returns nonzero if debugging information should be output. */
721 {
726 }
731 {
735 }
739 {
741 }
745 {
747 }
751 {
754 else
756 }
760 {
763 /* Skip past purged tokens. */
765 {
767 tp--;
768 }
771 }
773 /* nonzero if we are presently saving tokens. */
777 {
779 }
781 /* Store the next token from the preprocessor in *TOKEN. Return true
782 if we reach EOF. If LEXER is NULL, assume we are handling an
783 initial #pragma pch_preprocess, and thus want the lexer to return
784 processed strings. */
786 static void
788 {
791 /* Get a new token from the preprocessor. */
792 token->type
799 /* On some systems, some header files are surrounded by an
800 implicit extern "C" block. Set a flag in the token if it
801 comes from such a header. */
806 /* Check to see if this token is a keyword. */
808 {
810 {
811 /* Mark this token as a keyword. */
813 /* Record which keyword. */
815 }
816 else
817 {
821 {
822 /* Warn about the C++0x keyword (but still treat it as
823 an identifier). */
828 /* Clear out the C_RID_CODE so we don't warn about this
829 particular identifier-turned-keyword again. */
831 }
834 }
835 }
837 {
838 /* This only happens in Objective-C++; it must be a keyword. */
841 {
842 /* Replace 'class' with '@class', 'private' with '@private',
843 etc. This prevents confusion with the C++ keyword
844 'class', and makes the tokens consistent with other
845 Objective-C 'AT' keywords. For example '@class' is
846 reported as RID_AT_CLASS which is consistent with
847 '@synchronized', which is reported as
848 RID_AT_SYNCHRONIZED.
849 */
859 }
860 }
861 }
863 /* Update the globals input_location and the input file stack from TOKEN. */
866 {
868 {
870 }
871 }
873 /* Update the globals input_location and the input file stack from LEXER. */
876 {
879 }
881 /* Return a pointer to the next token in the token stream, but do not
882 consume it. */
886 {
888 {
892 }
894 }
896 /* Return true if the next token has the indicated TYPE. */
900 {
902 }
904 /* Return true if the next token does not have the indicated TYPE. */
908 {
910 }
912 /* Return true if the next token is the indicated KEYWORD. */
916 {
918 }
922 {
924 }
928 {
930 }
932 /* Return true if the next token is not the indicated KEYWORD. */
936 {
938 }
940 /* Return true if KEYWORD can start a decl-specifier. */
942 bool
944 {
946 {
947 /* auto specifier: storage-class-specifier in C++,
948 simple-type-specifier in C++0x. */
950 /* Storage classes. */
956 /* Elaborated type specifiers. */
962 /* Simple type specifiers. */
976 /* GNU extensions. */
979 /* C++0x extensions. */
991 }
992 }
994 /* Return true if the next token is a keyword for a decl-specifier. */
996 static bool
998 {
1003 }
1005 /* Returns TRUE iff the token T begins a decltype type. */
1007 static bool
1009 {
1012 }
1014 /* Returns TRUE iff the next token begins a decltype type. */
1016 static bool
1018 {
1021 }
1023 /* Called when processing a token with tree_check_value; perform or defer the
1024 associated checks and return the value. */
1026 static tree
1028 {
1029 /* Perform any access checks that were deferred. */
1034 {
1040 }
1041 /* Return the stored value. */
1043 }
1045 /* Return a pointer to the Nth token in the token stream. If N is 1,
1046 then this is precisely equivalent to cp_lexer_peek_token (except
1047 that it is not inline). One would like to disallow that case, but
1048 there is one case (cp_parser_nth_token_starts_template_id) where
1049 the caller passes a variable for N and it might be 1. */
1053 {
1056 /* N is 1-based, not zero-based. */
1067 {
1070 {
1073 }
1077 }
1080 {
1083 }
1086 }
1088 /* Return the next token, and advance the lexer's next_token pointer
1089 to point to the next non-purged token. */
1093 {
1099 do
1100 {
1103 {
1106 }
1108 }
1113 /* Provide debugging output. */
1115 {
1119 }
1122 }
1124 /* Permanently remove the next token from the token stream, and
1125 advance the next_token pointer to refer to the next non-purged
1126 token. */
1128 static void
1130 {
1139 do
1140 {
1141 tok++;
1143 {
1146 }
1147 }
1150 }
1152 /* Permanently remove all tokens after TOK, up to, but not
1153 including, the token that will be returned next by
1154 cp_lexer_peek_token. */
1156 static void
1158 {
1167 {
1172 }
1173 }
1175 /* Begin saving tokens. All tokens consumed after this point will be
1176 preserved. */
1178 static void
1180 {
1181 /* Provide debugging output. */
1186 }
1188 /* Commit to the portion of the token stream most recently saved. */
1190 static void
1192 {
1193 /* Provide debugging output. */
1198 }
1200 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1201 to the token stream. Stop saving tokens. */
1203 static void
1205 {
1206 /* Provide debugging output. */
1211 }
1213 /* RAII wrapper around the above functions, with sanity checking. Creating
1214 a variable saves tokens, which are committed when the variable is
1215 destroyed unless they are explicitly rolled back by calling the rollback
1216 member function. */
1218 struct saved_token_sentinel
1219 {
1224 {
1227 }
1229 {
1232 }
1234 {
1238 }
1239 };
1241 /* Print a representation of the TOKEN on the STREAM. */
1243 static void
1245 {
1246 /* We don't use cpp_type2name here because the parser defines
1247 a few tokens of its own. */
1249 /* cpplib-defined token types */
1250 #define OP(e, s) #e,
1251 #define TK(e, s) #e,
1252 TTYPE_TABLE
1253 #undef OP
1254 #undef TK
1255 /* C++ parser token types - see "Manifest constants", above. */
1259 };
1261 /* For some tokens, print the associated data. */
1263 {
1265 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1266 For example, `struct' is mapped to an INTEGER_CST. */
1269 /* fall through */
1287 /* If we have a name for the token, print it out. Otherwise, we
1288 simply give the numeric code. */
1291 else
1294 }
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 }
1304 DEBUG_FUNCTION void
1306 {
1309 else
1311 }
1314 /* Start emitting debugging information. */
1316 static void
1318 {
1325 }
1327 /* Stop emitting debugging information. */
1329 static void
1331 {
1338 }
1340 /* Create a new cp_token_cache, representing a range of tokens. */
1344 {
1349 }
1351 /* Diagnose if #pragma omp declare simd isn't followed immediately
1352 by function declaration or definition. */
1356 {
1358 {
1362 }
1363 }
1365 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1366 and put that into "omp declare simd" attribute. */
1370 {
1372 {
1374 {
1377 }
1379 {
1382 }
1383 }
1384 }
1386 /* Diagnose if #pragma acc routine isn't followed immediately by function
1387 declaration or definition. */
1391 {
1393 {
1395 "%<#pragma acc routine%> not immediately followed by "
1398 }
1399 }
1400 \f
1401 /* Decl-specifiers. */
1403 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1405 static void
1407 {
1409 }
1411 /* Declarators. */
1413 /* Nothing other than the parser should be creating declarators;
1414 declarators are a semi-syntactic representation of C++ entities.
1415 Other parts of the front end that need to create entities (like
1416 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1419 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1429 /* An erroneous declarator. */
1432 /* The obstack on which declarators and related data structures are
1433 allocated. */
1436 /* Alloc BYTES from the declarator memory pool. */
1440 {
1442 }
1444 /* Allocate a declarator of the indicated KIND. Clear fields that are
1445 common to all declarators. */
1449 {
1461 }
1463 /* Make a declarator for a generalized identifier. If
1464 QUALIFYING_SCOPE is non-NULL, the identifier is
1465 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1466 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1467 is, if any. */
1471 special_function_kind sfk)
1472 {
1475 /* It is valid to write:
1477 class C { void f(); };
1478 typedef C D;
1479 void D::f();
1481 The standard is not clear about whether `typedef const C D' is
1482 legal; as of 2002-09-15 the committee is considering that
1483 question. EDG 3.0 allows that syntax. Therefore, we do as
1484 well. */
1498 }
1500 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1501 of modifiers such as const or volatile to apply to the pointer
1502 type, represented as identifiers. ATTRIBUTES represent the attributes that
1503 appertain to the pointer or reference. */
1505 cp_declarator *
1507 tree attributes)
1508 {
1516 {
1520 }
1521 else
1527 }
1529 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1530 represent the attributes that appertain to the pointer or
1531 reference. */
1533 cp_declarator *
1536 {
1544 {
1548 }
1549 else
1555 }
1557 /* Like make_pointer_declarator -- but for a pointer to a non-static
1558 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1559 appertain to the pointer or reference. */
1561 cp_declarator *
1564 tree attributes)
1565 {
1574 {
1577 }
1578 else
1584 }
1586 /* Make a declarator for the function given by TARGET, with the
1587 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1588 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1589 indicates what exceptions can be thrown. */
1591 cp_declarator *
1593 tree parms,
1594 cp_cv_quals cv_qualifiers,
1595 cp_virt_specifiers virt_specifiers,
1596 cp_ref_qualifier ref_qualifier,
1597 tree tx_qualifier,
1598 tree exception_specification,
1599 tree late_return_type,
1600 tree requires_clause)
1601 {
1615 {
1619 }
1620 else
1624 }
1626 /* Make a declarator for an array of BOUNDS elements, each of which is
1627 defined by ELEMENT. */
1629 cp_declarator *
1631 {
1638 {
1642 }
1643 else
1647 }
1649 /* Determine whether the declarator we've seen so far can be a
1650 parameter pack, when followed by an ellipsis. */
1651 static bool
1653 {
1655 /* We already saw an ellipsis. */
1658 /* Search for a declarator name, or any other declarator that goes
1659 after the point where the ellipsis could appear in a parameter
1660 pack. If we find any of these, then this declarator can not be
1661 made into a parameter pack. */
1664 {
1666 {
1679 }
1680 }
1683 }
1687 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1688 DECLARATOR and DEFAULT_ARGUMENT. */
1690 cp_parameter_declarator *
1693 tree default_argument,
1695 {
1703 else
1710 }
1712 /* Returns true iff DECLARATOR is a declaration for a function. */
1714 static bool
1716 {
1718 {
1727 }
1729 }
1731 /* The parser. */
1733 /* Overview
1734 --------
1736 A cp_parser parses the token stream as specified by the C++
1737 grammar. Its job is purely parsing, not semantic analysis. For
1738 example, the parser breaks the token stream into declarators,
1739 expressions, statements, and other similar syntactic constructs.
1740 It does not check that the types of the expressions on either side
1741 of an assignment-statement are compatible, or that a function is
1742 not declared with a parameter of type `void'.
1744 The parser invokes routines elsewhere in the compiler to perform
1745 semantic analysis and to build up the abstract syntax tree for the
1746 code processed.
1748 The parser (and the template instantiation code, which is, in a
1749 way, a close relative of parsing) are the only parts of the
1750 compiler that should be calling push_scope and pop_scope, or
1751 related functions. The parser (and template instantiation code)
1752 keeps track of what scope is presently active; everything else
1753 should simply honor that. (The code that generates static
1754 initializers may also need to set the scope, in order to check
1755 access control correctly when emitting the initializers.)
1757 Methodology
1758 -----------
1760 The parser is of the standard recursive-descent variety. Upcoming
1761 tokens in the token stream are examined in order to determine which
1762 production to use when parsing a non-terminal. Some C++ constructs
1763 require arbitrary look ahead to disambiguate. For example, it is
1764 impossible, in the general case, to tell whether a statement is an
1765 expression or declaration without scanning the entire statement.
1766 Therefore, the parser is capable of "parsing tentatively." When the
1767 parser is not sure what construct comes next, it enters this mode.
1768 Then, while we attempt to parse the construct, the parser queues up
1769 error messages, rather than issuing them immediately, and saves the
1770 tokens it consumes. If the construct is parsed successfully, the
1771 parser "commits", i.e., it issues any queued error messages and
1772 the tokens that were being preserved are permanently discarded.
1773 If, however, the construct is not parsed successfully, the parser
1774 rolls back its state completely so that it can resume parsing using
1775 a different alternative.
1777 Future Improvements
1778 -------------------
1780 The performance of the parser could probably be improved substantially.
1781 We could often eliminate the need to parse tentatively by looking ahead
1782 a little bit. In some places, this approach might not entirely eliminate
1783 the need to parse tentatively, but it might still speed up the average
1784 case. */
1786 /* Flags that are passed to some parsing functions. These values can
1787 be bitwise-ored together. */
1789 enum
1790 {
1791 /* No flags. */
1793 /* The construct is optional. If it is not present, then no error
1794 should be issued. */
1796 /* When parsing a type-specifier, treat user-defined type-names
1797 as non-type identifiers. */
1799 /* When parsing a type-specifier, do not try to parse a class-specifier
1800 or enum-specifier. */
1802 /* When parsing a decl-specifier-seq, only allow type-specifier or
1803 constexpr. */
1805 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1807 };
1809 /* This type is used for parameters and variables which hold
1810 combinations of the above flags. */
1813 /* The different kinds of declarators we want to parse. */
1815 enum cp_parser_declarator_kind
1816 {
1817 /* We want an abstract declarator. */
1818 CP_PARSER_DECLARATOR_ABSTRACT,
1819 /* We want a named declarator. */
1820 CP_PARSER_DECLARATOR_NAMED,
1821 /* We don't mind, but the name must be an unqualified-id. */
1822 CP_PARSER_DECLARATOR_EITHER
1823 };
1825 /* The precedence values used to parse binary expressions. The minimum value
1826 of PREC must be 1, because zero is reserved to quickly discriminate
1827 binary operators from other tokens. */
1829 enum cp_parser_prec
1830 {
1831 PREC_NOT_OPERATOR,
1832 PREC_LOGICAL_OR_EXPRESSION,
1833 PREC_LOGICAL_AND_EXPRESSION,
1834 PREC_INCLUSIVE_OR_EXPRESSION,
1835 PREC_EXCLUSIVE_OR_EXPRESSION,
1836 PREC_AND_EXPRESSION,
1837 PREC_EQUALITY_EXPRESSION,
1838 PREC_RELATIONAL_EXPRESSION,
1839 PREC_SHIFT_EXPRESSION,
1840 PREC_ADDITIVE_EXPRESSION,
1841 PREC_MULTIPLICATIVE_EXPRESSION,
1842 PREC_PM_EXPRESSION,
1843 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1844 };
1846 /* A mapping from a token type to a corresponding tree node type, with a
1847 precedence value. */
1849 struct cp_parser_binary_operations_map_node
1850 {
1851 /* The token type. */
1853 /* The corresponding tree code. */
1855 /* The precedence of this operator. */
1857 };
1859 struct cp_parser_expression_stack_entry
1860 {
1861 /* Left hand side of the binary operation we are currently
1862 parsing. */
1863 cp_expr lhs;
1864 /* Original tree code for left hand side, if it was a binary
1865 expression itself (used for -Wparentheses). */
1867 /* Tree code for the binary operation we are parsing. */
1869 /* Precedence of the binary operation we are parsing. */
1871 /* Location of the binary operation we are parsing. */
1872 location_t loc;
1873 };
1875 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1876 entries because precedence levels on the stack are monotonically
1877 increasing. */
1881 /* Prototypes. */
1883 /* Constructors and destructors. */
1888 /* Class variables. */
1892 /* The operator-precedence table used by cp_parser_binary_expression.
1893 Transformed into an associative array (binops_by_token) by
1894 cp_parser_new. */
1927 };
1929 /* The same as binops, but initialized by cp_parser_new so that
1930 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1931 for speed. */
1934 /* Constructors and destructors. */
1936 /* Construct a new context. The context below this one on the stack
1937 is given by NEXT. */
1941 {
1944 /* Allocate the storage. */
1946 {
1947 /* Pull the first entry from the free list. */
1951 }
1952 else
1955 /* No errors have occurred yet in this context. */
1957 /* If this is not the bottommost context, copy information that we
1958 need from the previous context. */
1960 {
1961 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1962 expression, then we are parsing one in this context, too. */
1964 /* Thread the stack. */
1966 }
1969 }
1971 /* Managing the unparsed function queues. */
1973 #define unparsed_funs_with_default_args \
1974 parser->unparsed_queues->last ().funs_with_default_args
1975 #define unparsed_funs_with_definitions \
1976 parser->unparsed_queues->last ().funs_with_definitions
1977 #define unparsed_nsdmis \
1978 parser->unparsed_queues->last ().nsdmis
1979 #define unparsed_classes \
1980 parser->unparsed_queues->last ().classes
1982 static void
1984 {
1987 }
1989 static void
1991 {
1994 }
1996 /* Prototypes. */
1998 /* Constructors and destructors. */
2003 /* Routines to parse various constructs.
2005 Those that return `tree' will return the error_mark_node (rather
2006 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2007 Sometimes, they will return an ordinary node if error-recovery was
2008 attempted, even though a parse error occurred. So, to check
2009 whether or not a parse error occurred, you should always use
2010 cp_parser_error_occurred. If the construct is optional (indicated
2011 either by an `_opt' in the name of the function that does the
2012 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2013 the construct is not present. */
2015 /* Lexical conventions [gram.lex] */
2017 static cp_expr cp_parser_identifier
2019 static cp_expr cp_parser_string_literal
2021 static cp_expr cp_parser_userdef_char_literal
2023 static tree cp_parser_userdef_string_literal
2025 static cp_expr cp_parser_userdef_numeric_literal
2028 /* Basic concepts [gram.basic] */
2030 static bool cp_parser_translation_unit
2033 /* Expressions [gram.expr] */
2035 static cp_expr cp_parser_primary_expression
2037 static cp_expr cp_parser_id_expression
2039 static cp_expr cp_parser_unqualified_id
2041 static tree cp_parser_nested_name_specifier_opt
2043 static tree cp_parser_nested_name_specifier
2045 static tree cp_parser_qualifying_entity
2047 static cp_expr cp_parser_postfix_expression
2049 static tree cp_parser_postfix_open_square_expression
2051 static tree cp_parser_postfix_dot_deref_expression
2055 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2057 static void cp_parser_pseudo_destructor_name
2059 static cp_expr cp_parser_unary_expression
2061 static enum tree_code cp_parser_unary_operator
2063 static tree cp_parser_new_expression
2067 static tree cp_parser_new_type_id
2075 static tree cp_parser_delete_expression
2077 static cp_expr cp_parser_cast_expression
2079 static cp_expr cp_parser_binary_expression
2081 static tree cp_parser_question_colon_clause
2083 static cp_expr cp_parser_assignment_expression
2085 static enum tree_code cp_parser_assignment_operator_opt
2087 static cp_expr cp_parser_expression
2089 static cp_expr cp_parser_constant_expression
2091 static cp_expr cp_parser_builtin_offsetof
2093 static cp_expr cp_parser_lambda_expression
2095 static void cp_parser_lambda_introducer
2097 static bool cp_parser_lambda_declarator_opt
2099 static void cp_parser_lambda_body
2102 /* Statements [gram.stmt.stmt] */
2104 static void cp_parser_statement
2106 static void cp_parser_label_for_labeled_statement
2108 static tree cp_parser_expression_statement
2110 static tree cp_parser_compound_statement
2112 static void cp_parser_statement_seq_opt
2114 static tree cp_parser_selection_statement
2116 static tree cp_parser_condition
2118 static tree cp_parser_iteration_statement
2120 static bool cp_parser_init_statement
2122 static tree cp_parser_for
2124 static tree cp_parser_c_for
2126 static tree cp_parser_range_for
2128 static void do_range_for_auto_deduction
2130 static tree cp_parser_perform_range_for_lookup
2132 static tree cp_parser_range_for_member_function
2134 static tree cp_parser_jump_statement
2136 static void cp_parser_declaration_statement
2139 static tree cp_parser_implicitly_scoped_statement
2141 static void cp_parser_already_scoped_statement
2144 /* Declarations [gram.dcl.dcl] */
2146 static void cp_parser_declaration_seq_opt
2148 static void cp_parser_declaration
2150 static void cp_parser_block_declaration
2152 static void cp_parser_simple_declaration
2154 static void cp_parser_decl_specifier_seq
2156 static tree cp_parser_storage_class_specifier_opt
2158 static tree cp_parser_function_specifier_opt
2160 static tree cp_parser_type_specifier
2163 static tree cp_parser_simple_type_specifier
2165 static tree cp_parser_type_name
2167 static tree cp_parser_type_name
2169 static tree cp_parser_nonclass_name
2171 static tree cp_parser_elaborated_type_specifier
2173 static tree cp_parser_enum_specifier
2175 static void cp_parser_enumerator_list
2177 static void cp_parser_enumerator_definition
2179 static tree cp_parser_namespace_name
2181 static void cp_parser_namespace_definition
2183 static void cp_parser_namespace_body
2185 static tree cp_parser_qualified_namespace_specifier
2187 static void cp_parser_namespace_alias_definition
2189 static bool cp_parser_using_declaration
2191 static void cp_parser_using_directive
2193 static tree cp_parser_alias_declaration
2195 static void cp_parser_asm_definition
2197 static void cp_parser_linkage_specification
2199 static void cp_parser_static_assert
2201 static tree cp_parser_decltype
2203 static tree cp_parser_decomposition_declaration
2206 /* Declarators [gram.dcl.decl] */
2208 static tree cp_parser_init_declarator
2215 static enum tree_code cp_parser_ptr_operator
2217 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2219 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2221 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2223 static tree cp_parser_tx_qualifier_opt
2225 static tree cp_parser_late_return_type_opt
2227 static tree cp_parser_declarator_id
2229 static tree cp_parser_type_id
2231 static tree cp_parser_template_type_arg
2234 static tree cp_parser_type_id_1
2236 static void cp_parser_type_specifier_seq
2238 static tree cp_parser_parameter_declaration_clause
2240 static tree cp_parser_parameter_declaration_list
2244 static tree cp_parser_default_argument
2246 static void cp_parser_function_body
2248 static tree cp_parser_initializer
2250 static cp_expr cp_parser_initializer_clause
2252 static cp_expr cp_parser_braced_list
2257 static bool cp_parser_ctor_initializer_opt_and_function_body
2260 static tree cp_parser_late_parsing_omp_declare_simd
2263 static tree cp_parser_late_parsing_cilk_simd_fn_info
2266 static tree cp_parser_late_parsing_oacc_routine
2269 static tree synthesize_implicit_template_parm
2271 static tree finish_fully_implicit_template
2274 /* Classes [gram.class] */
2276 static tree cp_parser_class_name
2278 static tree cp_parser_class_specifier
2280 static tree cp_parser_class_head
2282 static enum tag_types cp_parser_class_key
2284 static void cp_parser_type_parameter_key
2286 static void cp_parser_member_specification_opt
2288 static void cp_parser_member_declaration
2290 static tree cp_parser_pure_specifier
2292 static tree cp_parser_constant_initializer
2295 /* Derived classes [gram.class.derived] */
2297 static tree cp_parser_base_clause
2299 static tree cp_parser_base_specifier
2302 /* Special member functions [gram.special] */
2304 static tree cp_parser_conversion_function_id
2306 static tree cp_parser_conversion_type_id
2310 static bool cp_parser_ctor_initializer_opt
2312 static void cp_parser_mem_initializer_list
2314 static tree cp_parser_mem_initializer
2316 static tree cp_parser_mem_initializer_id
2319 /* Overloading [gram.over] */
2321 static cp_expr cp_parser_operator_function_id
2323 static cp_expr cp_parser_operator
2326 /* Templates [gram.temp] */
2328 static void cp_parser_template_declaration
2330 static tree cp_parser_template_parameter_list
2332 static tree cp_parser_template_parameter
2334 static tree cp_parser_type_parameter
2336 static tree cp_parser_template_id
2338 static tree cp_parser_template_name
2340 static tree cp_parser_template_argument_list
2342 static tree cp_parser_template_argument
2344 static void cp_parser_explicit_instantiation
2346 static void cp_parser_explicit_specialization
2349 /* Exception handling [gram.exception] */
2351 static tree cp_parser_try_block
2353 static bool cp_parser_function_try_block
2355 static void cp_parser_handler_seq
2357 static void cp_parser_handler
2359 static tree cp_parser_exception_declaration
2361 static tree cp_parser_throw_expression
2363 static tree cp_parser_exception_specification_opt
2365 static tree cp_parser_type_id_list
2368 /* GNU Extensions */
2370 static tree cp_parser_asm_specification_opt
2372 static tree cp_parser_asm_operand_list
2374 static tree cp_parser_asm_clobber_list
2376 static tree cp_parser_asm_label_list
2378 static bool cp_next_tokens_can_be_attribute_p
2380 static bool cp_next_tokens_can_be_gnu_attribute_p
2382 static bool cp_next_tokens_can_be_std_attribute_p
2384 static bool cp_nth_tokens_can_be_std_attribute_p
2386 static bool cp_nth_tokens_can_be_gnu_attribute_p
2388 static bool cp_nth_tokens_can_be_attribute_p
2390 static tree cp_parser_attributes_opt
2392 static tree cp_parser_gnu_attributes_opt
2394 static tree cp_parser_gnu_attribute_list
2396 static tree cp_parser_std_attribute
2398 static tree cp_parser_std_attribute_spec
2400 static tree cp_parser_std_attribute_spec_seq
2402 static bool cp_parser_extension_opt
2404 static void cp_parser_label_declaration
2407 /* Concept Extensions */
2409 static tree cp_parser_requires_clause
2411 static tree cp_parser_requires_clause_opt
2413 static tree cp_parser_requires_expression
2415 static tree cp_parser_requirement_parameter_list
2417 static tree cp_parser_requirement_body
2419 static tree cp_parser_requirement_list
2421 static tree cp_parser_requirement
2423 static tree cp_parser_simple_requirement
2425 static tree cp_parser_compound_requirement
2427 static tree cp_parser_type_requirement
2429 static tree cp_parser_nested_requirement
2432 /* Transactional Memory Extensions */
2434 static tree cp_parser_transaction
2436 static tree cp_parser_transaction_expression
2438 static bool cp_parser_function_transaction
2440 static tree cp_parser_transaction_cancel
2444 pragma_external,
2445 pragma_member,
2446 pragma_objc_icode,
2447 pragma_stmt,
2448 pragma_compound
2449 };
2450 static bool cp_parser_pragma
2453 /* Objective-C++ Productions */
2455 static tree cp_parser_objc_message_receiver
2457 static tree cp_parser_objc_message_args
2459 static tree cp_parser_objc_message_expression
2461 static cp_expr cp_parser_objc_encode_expression
2463 static tree cp_parser_objc_defs_expression
2465 static tree cp_parser_objc_protocol_expression
2467 static tree cp_parser_objc_selector_expression
2469 static cp_expr cp_parser_objc_expression
2471 static bool cp_parser_objc_selector_p
2473 static tree cp_parser_objc_selector
2475 static tree cp_parser_objc_protocol_refs_opt
2477 static void cp_parser_objc_declaration
2479 static tree cp_parser_objc_statement
2481 static bool cp_parser_objc_valid_prefix_attributes
2483 static void cp_parser_objc_at_property_declaration
2485 static void cp_parser_objc_at_synthesize_declaration
2487 static void cp_parser_objc_at_dynamic_declaration
2489 static tree cp_parser_objc_struct_declaration
2492 /* Utility Routines */
2494 static cp_expr cp_parser_lookup_name
2496 static tree cp_parser_lookup_name_simple
2498 static tree cp_parser_maybe_treat_template_as_class
2500 static bool cp_parser_check_declarator_template_parameters
2502 static bool cp_parser_check_template_parameters
2504 static cp_expr cp_parser_simple_cast_expression
2506 static tree cp_parser_global_scope_opt
2508 static bool cp_parser_constructor_declarator_p
2510 static tree cp_parser_function_definition_from_specifiers_and_declarator
2512 static tree cp_parser_function_definition_after_declarator
2514 static bool cp_parser_template_declaration_after_export
2516 static void cp_parser_perform_template_parameter_access_checks
2518 static tree cp_parser_single_declaration
2520 static cp_expr cp_parser_functional_cast
2522 static tree cp_parser_save_member_function_body
2524 static tree cp_parser_save_nsdmi
2526 static tree cp_parser_enclosed_template_argument_list
2528 static void cp_parser_save_default_args
2530 static void cp_parser_late_parsing_for_member
2532 static tree cp_parser_late_parse_one_default_arg
2534 static void cp_parser_late_parsing_nsdmi
2536 static void cp_parser_late_parsing_default_args
2538 static tree cp_parser_sizeof_operand
2540 static tree cp_parser_trait_expr
2542 static bool cp_parser_declares_only_class_p
2544 static void cp_parser_set_storage_class
2546 static void cp_parser_set_decl_spec_type
2548 static void set_and_check_decl_spec_loc
2551 static bool cp_parser_friend_p
2553 static void cp_parser_required_error
2559 static bool cp_parser_token_starts_function_definition_p
2561 static bool cp_parser_next_token_starts_class_definition_p
2563 static bool cp_parser_next_token_ends_template_argument_p
2565 static bool cp_parser_nth_token_starts_template_argument_list_p
2567 static enum tag_types cp_parser_token_is_class_key
2569 static enum tag_types cp_parser_token_is_type_parameter_key
2571 static void cp_parser_check_class_key
2573 static void cp_parser_check_access_in_redeclaration
2575 static bool cp_parser_optional_template_keyword
2577 static void cp_parser_pre_parsed_nested_name_specifier
2579 static bool cp_parser_cache_group
2581 static tree cp_parser_cache_defarg
2583 static void cp_parser_parse_tentatively
2585 static void cp_parser_commit_to_tentative_parse
2587 static void cp_parser_commit_to_topmost_tentative_parse
2589 static void cp_parser_abort_tentative_parse
2591 static bool cp_parser_parse_definitely
2595 static bool cp_parser_uncommitted_to_tentative_parse_p
2597 static void cp_parser_error
2599 static void cp_parser_name_lookup_error
2601 static bool cp_parser_simulate_error
2603 static bool cp_parser_check_type_definition
2605 static void cp_parser_check_for_definition_in_return_type
2607 static void cp_parser_check_for_invalid_template_id
2609 static bool cp_parser_non_integral_constant_expression
2611 static void cp_parser_diagnose_invalid_type_name
2613 static bool cp_parser_parse_and_diagnose_invalid_type_name
2615 static int cp_parser_skip_to_closing_parenthesis
2617 static void cp_parser_skip_to_end_of_statement
2619 static void cp_parser_consume_semicolon_at_end_of_statement
2621 static void cp_parser_skip_to_end_of_block_or_statement
2623 static bool cp_parser_skip_to_closing_brace
2625 static void cp_parser_skip_to_end_of_template_parameter_list
2627 static void cp_parser_skip_to_pragma_eol
2629 static bool cp_parser_error_occurred
2631 static bool cp_parser_allow_gnu_extensions_p
2633 static bool cp_parser_is_pure_string_literal
2635 static bool cp_parser_is_string_literal
2637 static bool cp_parser_is_keyword
2639 static tree cp_parser_make_typename_type
2643 static bool cp_parser_compound_literal_p
2645 static bool cp_parser_array_designator_p
2647 static bool cp_parser_init_statement_p
2649 static bool cp_parser_skip_to_closing_square_bracket
2652 /* Concept-related syntactic transformations */
2657 // -------------------------------------------------------------------------- //
2658 // Unevaluated Operand Guard
2659 //
2660 // Implementation of an RAII helper for unevaluated operand parsing.
2662 {
2665 }
2668 {
2671 }
2673 // -------------------------------------------------------------------------- //
2674 // Tentative Parsing
2676 /* Returns nonzero if we are parsing tentatively. */
2680 {
2682 }
2684 /* Returns nonzero if TOKEN is a string literal. */
2686 static bool
2688 {
2694 }
2696 /* Returns nonzero if TOKEN is a string literal
2697 of a user-defined string literal. */
2699 static bool
2701 {
2708 }
2710 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2712 static bool
2714 {
2716 }
2718 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2719 PRAGMA_NONE. */
2721 static enum pragma_kind
2723 {
2726 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2728 }
2730 /* Helper function for cp_parser_error.
2731 Having peeked a token of kind TOK1_KIND that might signify
2732 a conflict marker, peek successor tokens to determine
2733 if we actually do have a conflict marker.
2734 Specifically, we consider a run of 7 '<', '=' or '>' characters
2735 at the start of a line as a conflict marker.
2736 These come through the lexer as three pairs and a single,
2737 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2738 If it returns true, *OUT_LOC is written to with the location/range
2739 of the marker. */
2741 static bool
2744 {
2755 /* It must be at the start of the line. */
2760 /* We have a conflict marker. Construct a location of the form:
2761 <<<<<<<
2762 ^~~~~~~
2763 with start == caret, finishing at the end of the marker. */
2768 }
2770 /* If not parsing tentatively, issue a diagnostic of the form
2771 FILE:LINE: MESSAGE before TOKEN
2772 where TOKEN is the next token in the input stream. MESSAGE
2773 (specified by the caller) is usually of the form "expected
2774 OTHER-TOKEN". */
2776 static void
2778 {
2780 {
2782 /* This diagnostic makes more sense if it is tagged to the line
2783 of the token we just peeked at. */
2787 {
2792 }
2794 /* If this is actually a conflict marker, report it as such. */
2798 {
2799 location_t loc;
2801 {
2804 }
2805 }
2808 /* Because c_parser_error does not understand
2809 CPP_KEYWORD, keywords are treated like
2810 identifiers. */
2813 }
2814 }
2816 /* Issue an error about name-lookup failing. NAME is the
2817 IDENTIFIER_NODE DECL is the result of
2818 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2819 the thing that we hoped to find. */
2821 static void
2823 tree name,
2824 tree decl,
2825 name_lookup_error desired,
2826 location_t location)
2827 {
2828 /* If name lookup completely failed, tell the user that NAME was not
2829 declared. */
2831 {
2844 else
2846 }
2848 {
2850 {
2867 }
2868 }
2870 {
2872 {
2882 name);
2886 }
2887 }
2888 else
2889 {
2891 {
2904 }
2905 }
2906 }
2908 /* If we are parsing tentatively, remember that an error has occurred
2909 during this tentative parse. Returns true if the error was
2910 simulated; false if a message should be issued by the caller. */
2912 static bool
2914 {
2916 {
2919 }
2921 }
2923 /* This function is called when a type is defined. If type
2924 definitions are forbidden at this point, an error message is
2925 issued. */
2927 static bool
2929 {
2930 /* If types are forbidden here, issue a message. */
2932 {
2933 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2934 in the message need to be interpreted. */
2937 }
2939 }
2941 /* This function is called when the DECLARATOR is processed. The TYPE
2942 was a type defined in the decl-specifiers. If it is invalid to
2943 define a type in the decl-specifiers for DECLARATOR, an error is
2944 issued. TYPE_LOCATION is the location of TYPE and is used
2945 for error reporting. */
2947 static void
2950 {
2951 /* [dcl.fct] forbids type definitions in return types.
2952 Unfortunately, it's not easy to know whether or not we are
2953 processing a return type until after the fact. */
2961 {
2966 type);
2967 }
2968 }
2970 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2971 "<" in any valid C++ program. If the next token is indeed "<",
2972 issue a message warning the user about what appears to be an
2973 invalid attempt to form a template-id. LOCATION is the location
2974 of the type-specifier (TYPE) */
2976 static void
2978 tree type,
2980 location_t location)
2981 {
2985 {
2989 {
2992 else
2994 }
2995 else
2997 /* Remember the location of the invalid "<". */
3000 /* Consume the "<". */
3002 /* Parse the template arguments. */
3004 /* Permanently remove the invalid template arguments so that
3005 this error message is not issued again. */
3008 }
3009 }
3011 /* If parsing an integral constant-expression, issue an error message
3012 about the fact that THING appeared and return true. Otherwise,
3013 return false. In either case, set
3014 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3016 static bool
3018 non_integral_constant thing)
3019 {
3022 {
3024 {
3027 {
3030 "ISO C++ forbids using a floating-point literal "
3035 "enumeration type cannot appear in a "
3126 }
3130 }
3131 }
3133 }
3135 /* Emit a diagnostic for an invalid type name. This function commits
3136 to the current active tentative parse, if any. (Otherwise, the
3137 problematic construct might be encountered again later, resulting
3138 in duplicate error messages.) LOCATION is the location of ID. */
3140 static void
3142 location_t location)
3143 {
3146 /* Try to lookup the identifier. */
3153 /* If the lookup was ambiguous, an error will already have
3154 been issued. */
3156 /* If the lookup found a template-name, it means that the user forgot
3157 to specify an argument list. Emit a useful error message. */
3159 {
3162 decl);
3167 }
3171 /* Something like 'unsigned A a;' */
3174 {
3175 /* Issue an error message. */
3180 {
3186 }
3187 else
3189 /* If we're in a template class, it's possible that the user was
3190 referring to a type from a base class. For example:
3192 template <typename T> struct A { typedef T X; };
3193 template <typename T> struct B : public A<T> { X x; };
3195 The user should have said "typename A<T>::X". */
3211 {
3212 tree b;
3215 b;
3217 {
3221 {
3222 tree field;
3223 /* Go from a particular instantiation of the
3224 template (which will have an empty TYPE_FIELDs),
3225 to the main version. */
3228 field;
3232 {
3237 }
3240 }
3241 }
3242 }
3243 }
3244 /* Here we diagnose qualified-ids where the scope is actually correct,
3245 but the identifier does not resolve to a valid type name. */
3247 {
3249 {
3254 else
3260 }
3263 {
3264 /* A<T>::A<T>() */
3270 }
3277 {
3285 else
3291 }
3292 else
3294 }
3295 }
3297 /* Check for a common situation where a type-name should be present,
3298 but is not, and issue a sensible error message. Returns true if an
3299 invalid type-name was detected.
3301 The situation handled by this function are variable declarations of the
3302 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3303 Usually, `ID' should name a type, but if we got here it means that it
3304 does not. We try to emit the best possible error message depending on
3305 how exactly the id-expression looks like. */
3307 static bool
3309 {
3310 tree id;
3313 /* Avoid duplicate error about ambiguous lookup. */
3315 {
3319 }
3328 /* If the next token is a (, this is a function with no explicit return
3329 type, i.e. constructor, destructor or conversion op. */
3332 {
3335 }
3339 /* Emit a diagnostic for the invalid type. */
3341 out:
3342 /* If we aren't in the middle of a declarator (i.e. in a
3343 parameter-declaration-clause), skip to the end of the declaration;
3344 there's no point in trying to process it. */
3348 }
3350 /* Consume tokens up to, and including, the next non-nested closing `)'.
3351 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3352 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3353 found an unnested token of that type. */
3355 static int
3358 cpp_ttype or_ttype,
3360 {
3370 {
3373 /* Have we found what we're looking for before the closing paren? */
3379 {
3382 /* If we've run out of tokens, then there is no closing `)'. */
3385 /* This is good for lambda expression capture-lists. */
3395 /* This matches the processing in skip_to_end_of_statement. */
3415 {
3419 }
3424 }
3426 /* Consume the token. */
3428 }
3429 }
3431 /* Consume tokens up to, and including, the next non-nested closing `)'.
3432 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3433 are doing error recovery. Returns -1 if OR_COMMA is true and we
3434 found an unnested token of that type. */
3436 static int
3441 {
3445 }
3447 /* Consume tokens until we reach the end of the current statement.
3448 Normally, that will be just before consuming a `;'. However, if a
3449 non-nested `}' comes first, then we stop before consuming that. */
3451 static void
3453 {
3456 /* Unwind generic function template scope if necessary. */
3461 {
3465 {
3468 /* If we've run out of tokens, stop. */
3472 /* If the next token is a `;', we have reached the end of the
3473 statement. */
3479 /* If this is a non-nested '}', stop before consuming it.
3480 That way, when confronted with something like:
3482 { 3 + }
3484 we stop before consuming the closing '}', even though we
3485 have not yet reached a `;'. */
3489 /* If it is the closing '}' for a block that we have
3490 scanned, stop -- but only after consuming the token.
3491 That way given:
3493 void f g () { ... }
3494 typedef int I;
3496 we will stop after the body of the erroneously declared
3497 function, but before consuming the following `typedef'
3498 declaration. */
3500 {
3503 }
3512 }
3514 /* Consume the token. */
3516 }
3517 }
3519 /* This function is called at the end of a statement or declaration.
3520 If the next token is a semicolon, it is consumed; otherwise, error
3521 recovery is attempted. */
3523 static void
3525 {
3526 /* Look for the trailing `;'. */
3528 {
3529 /* If there is additional (erroneous) input, skip to the end of
3530 the statement. */
3532 /* If the next token is now a `;', consume it. */
3535 }
3536 }
3538 /* Skip tokens until we have consumed an entire block, or until we
3539 have consumed a non-nested `;'. */
3541 static void
3543 {
3546 /* Unwind generic function template scope if necessary. */
3551 {
3555 {
3558 /* If we've run out of tokens, stop. */
3562 /* Stop if this is an unnested ';'. */
3568 /* Stop if this is an unnested '}', or closes the outermost
3569 nesting level. */
3570 nesting_depth--;
3578 /* Nest. */
3579 nesting_depth++;
3584 }
3586 /* Consume the token. */
3588 }
3589 }
3591 /* Skip tokens until a non-nested closing curly brace is the next
3592 token, or there are no more tokens. Return true in the first case,
3593 false otherwise. */
3595 static bool
3597 {
3601 {
3605 {
3608 /* If we've run out of tokens, stop. */
3612 /* If the next token is a non-nested `}', then we have reached
3613 the end of the current block. */
3619 /* If it the next token is a `{', then we are entering a new
3620 block. Consume the entire block. */
3626 }
3628 /* Consume the token. */
3630 }
3631 }
3633 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3634 parameter is the PRAGMA token, allowing us to purge the entire pragma
3635 sequence. */
3637 static void
3639 {
3644 do
3648 /* Ensure that the pragma is not parsed again. */
3650 }
3652 /* Require pragma end of line, resyncing with it as necessary. The
3653 arguments are as for cp_parser_skip_to_pragma_eol. */
3655 static void
3657 {
3661 }
3663 /* This is a simple wrapper around make_typename_type. When the id is
3664 an unresolved identifier node, we can provide a superior diagnostic
3665 using cp_parser_diagnose_invalid_type_name. */
3667 static tree
3669 location_t id_location)
3670 {
3671 tree result;
3673 {
3679 }
3681 }
3683 /* This is a wrapper around the
3684 make_{pointer,ptrmem,reference}_declarator functions that decides
3685 which one to call based on the CODE and CLASS_TYPE arguments. The
3686 CODE argument should be one of the values returned by
3687 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3688 appertain to the pointer or reference. */
3692 cp_cv_quals cv_qualifiers,
3694 tree attributes)
3695 {
3702 else
3712 }
3714 /* Create a new C++ parser. */
3718 {
3723 /* cp_lexer_new_main is called before doing GC allocation because
3724 cp_lexer_new_main might load a PCH file. */
3727 /* Initialize the binops_by_token so that we can get the tree
3728 directly from the token. */
3736 /* For now, we always accept GNU extensions. */
3739 /* The `>' token is a greater-than operator, not the end of a
3740 template-id. */
3745 /* We are not parsing a constant-expression. */
3750 /* Local variable names are not forbidden. */
3753 /* We are not processing an `extern "C"' declaration. */
3756 /* We are not processing a declarator. */
3759 /* We are not processing a template-argument-list. */
3762 /* We are not in an iteration statement. */
3765 /* We are not in a switch statement. */
3768 /* We are not parsing a type-id inside an expression. */
3771 /* Declarations aren't implicitly extern "C". */
3774 /* String literals should be translated to the execution character set. */
3777 /* We are not parsing a function body. */
3780 /* We can correct until told otherwise. */
3783 /* The unparsed function queue is empty. */
3786 /* There are no classes being defined. */
3789 /* No template parameters apply. */
3792 /* Special parsing data structures. */
3797 /* Not declaring an implicit function template. */
3803 /* Allow constrained-type-specifiers. */
3807 }
3809 /* Create a cp_lexer structure which will emit the tokens in CACHE
3810 and push it onto the parser's lexer stack. This is used for delayed
3811 parsing of in-class method bodies and default arguments, and should
3812 not be confused with tentative parsing. */
3813 static void
3815 {
3820 /* Move the current source position to that of the first token in the
3821 new lexer. */
3823 }
3825 /* Pop the top lexer off the parser stack. This is never used for the
3826 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3827 static void
3829 {
3834 /* Put the current source position back where it was before this
3835 lexer was pushed. */
3837 }
3839 /* Lexical conventions [gram.lex] */
3841 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3842 identifier. */
3844 static cp_expr
3846 {
3849 /* Look for the identifier. */
3851 /* Return the value. */
3854 else
3856 }
3858 /* Parse a sequence of adjacent string constants. Returns a
3859 TREE_STRING representing the combined, nul-terminated string
3860 constant. If TRANSLATE is true, translate the string to the
3861 execution character set. If WIDE_OK is true, a wide string is
3862 invalid here.
3864 C++98 [lex.string] says that if a narrow string literal token is
3865 adjacent to a wide string literal token, the behavior is undefined.
3866 However, C99 6.4.5p4 says that this results in a wide string literal.
3867 We follow C99 here, for consistency with the C front end.
3869 This code is largely lifted from lex_string() in c-lex.c.
3871 FUTURE: ObjC++ will need to handle @-strings here. */
3872 static cp_expr
3875 {
3876 tree value;
3883 tree string_tree;
3889 {
3892 }
3897 {
3901 }
3902 else
3903 {
3906 }
3909 /* Try to avoid the overhead of creating and destroying an obstack
3910 for the common case of just one string. */
3913 {
3921 {
3925 }
3926 else
3930 }
3931 else
3932 {
3937 do
3938 {
3940 count++;
3945 {
3948 {
3951 }
3954 {
3959 }
3961 }
3962 else
3966 {
3970 {
3974 "unsupported non-standard concatenation "
3976 }
3977 }
3985 {
3989 }
3990 else
3991 {
3995 }
3996 }
3999 /* A string literal built by concatenation has its caret=start at
4000 the start of the initial string, and its finish at the finish of
4001 the final string literal. */
4005 }
4008 {
4011 }
4015 {
4020 {
4035 }
4040 {
4045 else
4047 }
4048 }
4049 else
4050 /* cpp_interpret_string has issued an error. */
4057 }
4059 /* Look up a literal operator with the name and the exact arguments. */
4061 static tree
4063 {
4064 tree decl;
4070 {
4076 {
4079 {
4089 }
4092 /* May be this should be sufficient_parms_p instead,
4093 depending on how exactly should user-defined literals
4094 work in presence of default arguments on the literal
4095 operator parameters. */
4098 }
4099 }
4102 }
4104 /* Parse a user-defined char constant. Returns a call to a user-defined
4105 literal operator taking the character as an argument. */
4107 static cp_expr
4109 {
4117 /* Build up a call to the user-defined operator */
4118 /* Lookup the name we got back from the id-expression. */
4123 {
4128 }
4132 }
4134 /* A subroutine of cp_parser_userdef_numeric_literal to
4135 create a char... template parameter pack from a string node. */
4137 static tree
4139 {
4140 tree charvec;
4146 /* Fill in CHARVEC with all of the parameters. */
4151 /* Build the argument packs. */
4157 }
4159 /* A subroutine of cp_parser_userdef_numeric_literal to
4160 create a char... template parameter pack from a string node. */
4162 static tree
4164 {
4165 tree charvec;
4176 /* First template parm is character type. */
4179 /* Fill in CHARVEC with all of the parameters. */
4186 /* Build the argument packs. */
4192 }
4194 /* Parse a user-defined numeric constant. returns a call to a user-defined
4195 literal operator. */
4197 static cp_expr
4199 {
4210 /* Look for a literal operator taking the exact type of numeric argument
4211 as the literal value. */
4216 {
4218 tf_warning_or_error);
4221 {
4224 long_long_unsigned_type_node);
4225 }
4226 else
4227 {
4231 long_double_type_node);
4235 }
4239 }
4242 /* If the numeric argument didn't work, look for a raw literal
4243 operator taking a const char* argument consisting of the number
4244 in string format. */
4249 {
4251 tf_warning_or_error);
4254 }
4257 /* If the raw literal didn't work, look for a non-type template
4258 function with parameter pack char.... Call the function with
4259 template parameter characters representing the number. */
4263 {
4267 tf_warning_or_error);
4270 }
4279 }
4281 /* Parse a user-defined string constant. Returns a call to a user-defined
4282 literal operator taking a character pointer and the length of the string
4283 as arguments. */
4285 static tree
4287 {
4296 /* Build up a call to the user-defined operator. */
4297 /* Lookup the name we got back from the id-expression. */
4304 {
4306 tf_warning_or_error);
4309 }
4312 /* Look for a template function with typename parameter CharT
4313 and parameter pack CharT... Call the function with
4314 template parameter characters representing the string. */
4318 {
4322 tf_warning_or_error);
4325 }
4331 }
4334 /* Basic concepts [gram.basic] */
4336 /* Parse a translation-unit.
4338 translation-unit:
4339 declaration-seq [opt]
4341 Returns TRUE if all went well. */
4343 static bool
4345 {
4346 /* The address of the first non-permanent object on the declarator
4347 obstack. */
4352 /* Create the declarator obstack, if necessary. */
4354 {
4356 /* Create the error declarator. */
4358 /* Create the empty parameter list. */
4360 /* Remember where the base of the declarator obstack lies. */
4362 }
4366 /* If there are no tokens left then all went well. */
4368 {
4369 /* Get rid of the token array; we don't need it any more. */
4373 /* This file might have been a context that's implicitly extern
4374 "C". If so, pop the lang context. (Only relevant for PCH.) */
4376 {
4379 }
4381 /* Finish up. */
4385 }
4386 else
4387 {
4390 }
4392 /* Make sure the declarator obstack was fully cleaned up. */
4396 /* All went well. */
4398 }
4400 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4401 decltype context. */
4405 {
4410 }
4412 /* We're about to parse a collection of statements. If we're currently
4413 parsing tentatively, set up a firewall so that any nested
4414 cp_parser_commit_to_tentative_parse won't affect the current context. */
4416 static cp_token_position
4418 {
4425 }
4427 /* We've finished parsing the collection of statements. Wrap up the
4428 firewall and replace the relevant tokens with the parsed form. */
4430 static void
4432 tree expr)
4433 {
4437 /* Finish the firewall level. */
4439 /* And remember the result of the parse for when we try again. */
4445 }
4447 /* Like the above functions, but let the user modify the tokens. Used by
4448 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4449 later parses, so it makes sense to localize the effects of
4450 cp_parser_commit_to_tentative_parse. */
4452 struct tentative_firewall
4453 {
4458 {
4459 /* If we're currently parsing tentatively, start a committed level as a
4460 firewall and then an inner tentative parse. */
4462 {
4466 }
4467 }
4470 {
4472 {
4473 /* Finish the inner tentative parse and the firewall, propagating any
4474 uncommitted error state to the outer tentative parse. */
4480 }
4481 }
4482 };
4484 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4485 enclosing parentheses. */
4487 static cp_expr
4489 {
4492 /* Consume the '('. */
4495 /* Start the statement-expression. */
4497 /* Parse the compound-statement. */
4499 /* Finish up. */
4501 /* Consume the ')'. */
4509 }
4511 /* Expressions [gram.expr] */
4513 /* Parse a fold-operator.
4515 fold-operator:
4516 - * / % ^ & | = < > << >>
4517 = -= *= /= %= ^= &= |= <<= >>=
4518 == != <= >= && || , .* ->*
4520 This returns the tree code corresponding to the matched operator
4521 as an int. When the current token matches a compound assignment
4522 opertor, the resulting tree code is the negative value of the
4523 non-assignment operator. */
4525 static int
4527 {
4529 {
4569 }
4570 }
4572 /* Returns true if CODE indicates a binary expression, which is not allowed in
4573 the LHS of a fold-expression. More codes will need to be added to use this
4574 function in other contexts. */
4576 static bool
4578 {
4580 {
4613 }
4614 }
4616 /* If the next token is a suitable fold operator, consume it and return as
4617 the function above. */
4619 static int
4621 {
4627 }
4629 /* Parse a fold-expression.
4631 fold-expression:
4632 ( ... folding-operator cast-expression)
4633 ( cast-expression folding-operator ... )
4634 ( cast-expression folding operator ... folding-operator cast-expression)
4636 Note that the '(' and ')' are matched in primary expression. */
4638 static cp_expr
4640 {
4641 cp_id_kind pidk;
4643 // Left fold.
4645 {
4649 {
4652 }
4659 }
4664 {
4667 }
4670 {
4673 }
4676 /* The operands of a fold-expression are cast-expressions, so binary or
4677 conditional expressions are not allowed. We check this here to avoid
4678 tentative parsing. */
4688 // Right fold.
4693 {
4696 }
4699 // Binary left or right fold.
4704 }
4706 /* Parse a primary-expression.
4708 primary-expression:
4709 literal
4710 this
4711 ( expression )
4712 id-expression
4713 lambda-expression (C++11)
4715 GNU Extensions:
4717 primary-expression:
4718 ( compound-statement )
4719 __builtin_va_arg ( assignment-expression , type-id )
4720 __builtin_offsetof ( type-id , offsetof-expression )
4722 C++ Extensions:
4723 __has_nothrow_assign ( type-id )
4724 __has_nothrow_constructor ( type-id )
4725 __has_nothrow_copy ( type-id )
4726 __has_trivial_assign ( type-id )
4727 __has_trivial_constructor ( type-id )
4728 __has_trivial_copy ( type-id )
4729 __has_trivial_destructor ( type-id )
4730 __has_virtual_destructor ( type-id )
4731 __is_abstract ( type-id )
4732 __is_base_of ( type-id , type-id )
4733 __is_class ( type-id )
4734 __is_empty ( type-id )
4735 __is_enum ( type-id )
4736 __is_final ( type-id )
4737 __is_literal_type ( type-id )
4738 __is_pod ( type-id )
4739 __is_polymorphic ( type-id )
4740 __is_std_layout ( type-id )
4741 __is_trivial ( type-id )
4742 __is_union ( type-id )
4744 Objective-C++ Extension:
4746 primary-expression:
4747 objc-expression
4749 literal:
4750 __null
4752 ADDRESS_P is true iff this expression was immediately preceded by
4753 "&" and therefore might denote a pointer-to-member. CAST_P is true
4754 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4755 true iff this expression is a template argument.
4757 Returns a representation of the expression. Upon return, *IDK
4758 indicates what kind of id-expression (if any) was present. */
4760 static cp_expr
4767 {
4770 /* Assume the primary expression is not an id-expression. */
4773 /* Peek at the next token. */
4776 {
4777 /* literal:
4778 integer-literal
4779 character-literal
4780 floating-literal
4781 string-literal
4782 boolean-literal
4783 pointer-literal
4784 user-defined-literal */
4796 {
4800 }
4801 /* Floating-point literals are only allowed in an integral
4802 constant expression if they are cast to an integral or
4803 enumeration type. */
4807 {
4808 /* CAST_P will be set even in invalid code like "int(2.7 +
4809 ...)". Therefore, we have to check that the next token
4810 is sure to end the cast. */
4812 {
4817 enumerator-definition. */
4819 /* The curly brace at the end of an enum-specifier. */
4821 /* The end of a statement. */
4823 /* The end of the cast-expression. */
4825 /* The end of an array bound. */
4827 /* The closing ">" in a template-argument-list. */
4830 /* C++0x only: A ">>" treated like two ">" tokens,
4831 in a template-argument-list. */
4836 }
4838 /* If we are within a cast, then the constraint that the
4839 cast is to an integral or enumeration type will be
4840 checked at that point. If we are not within a cast, then
4841 this code is invalid. */
4844 }
4864 /* ??? Should wide strings be allowed when parser->translate_strings_p
4865 is false (i.e. in attributes)? If not, we can kill the third
4866 argument to cp_parser_string_literal. */
4872 /* If we see `( { ' then we are looking at the beginning of
4873 a GNU statement-expression. */
4876 {
4877 /* Statement-expressions are not allowed by the standard. */
4881 /* And they're not allowed outside of a function-body; you
4882 cannot, for example, write:
4884 int i = ({ int j = 3; j + 1; });
4886 at class or namespace scope. */
4889 {
4891 "statement-expressions are not allowed outside "
4897 }
4898 else
4900 }
4901 /* Otherwise it's a normal parenthesized expression. */
4902 {
4903 cp_expr expr;
4908 /* Consume the `('. */
4910 /* Within a parenthesized expression, a `>' token is always
4911 the greater-than operator. */
4912 saved_greater_than_is_operator_p
4917 /* Left fold expression. */
4919 else
4920 /* Parse the parenthesized expression. */
4925 {
4932 }
4933 else
4934 /* Let the front end know that this expression was
4935 enclosed in parentheses. This matters in case, for
4936 example, the expression is of the form `A::B', since
4937 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4938 not. */
4941 /* DR 705: Wrapping an unqualified name in parentheses
4942 suppresses arg-dependent lookup. We want to pass back
4943 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4944 (c++/37862), but none of the others. */
4948 /* The `>' token might be the end of a template-id or
4949 template-parameter-list now. */
4950 parser->greater_than_is_operator_p
4953 /* Consume the `)'. */
4962 }
4965 {
4967 {
4968 /* We might have an Objective-C++ message. */
4971 /* If that works out, we're done ... */
4974 /* ... else, fall though to see if it's a lambda. */
4975 }
4977 /* Don't warn about a failed tentative parse. */
4982 }
4986 /* We have an Objective-C++ string literal. */
4993 {
4994 /* These two are the boolean literals. */
5002 /* The `__null' literal. */
5007 /* The `nullptr' literal. */
5012 /* Recognize the `this' keyword. */
5016 {
5020 }
5021 /* Pointers cannot appear in constant-expressions. */
5026 /* The `operator' keyword can be the beginning of an
5027 id-expression. */
5034 {
5035 non_integral_constant name;
5037 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5038 __func__ are the names of variables -- but they are
5039 treated specially. Therefore, they are handled here,
5040 rather than relying on the generic id-expression logic
5041 below. Grammatically, these names are id-expressions.
5043 Consume the token. */
5047 {
5059 }
5064 /* Look up the name. */
5066 }
5069 {
5070 tree expression;
5071 tree type;
5072 source_location type_location;
5073 location_t start_loc
5075 /* The `__builtin_va_arg' construct is used to handle
5076 `va_arg'. Consume the `__builtin_va_arg' token. */
5078 /* Look for the opening `('. */
5080 /* Now, parse the assignment-expression. */
5082 /* Look for the `,'. */
5085 /* Parse the type-id. */
5086 {
5089 }
5090 /* Look for the closing `)'. */
5091 location_t finish_loc
5094 /* Using `va_arg' in a constant-expression is not
5095 allowed. */
5097 NIC_VA_ARG))
5099 /* Construct a location of the form:
5100 __builtin_va_arg (v, int)
5101 ~~~~~~~~~~~~~~~~~~~~~^~~~
5102 with the caret at the type, ranging from the start of the
5103 "__builtin_va_arg" token to the close paren. */
5104 location_t combined_loc
5107 }
5142 // C++ concepts
5146 /* Objective-C++ expressions. */
5156 {
5161 }
5162 /* FALLTHRU */
5166 }
5168 /* An id-expression can start with either an identifier, a
5169 `::' as the beginning of a qualified-id, or the "operator"
5170 keyword. */
5175 {
5176 id_expression:
5177 cp_expr id_expression;
5178 cp_expr decl;
5184 /* Parse the id-expression. */
5185 id_expression
5202 /* If we have a template-id, then no further lookup is
5203 required. If the template-id was for a template-class, we
5204 will sometimes have a TYPE_DECL at this point. */
5208 /* Look up the name. */
5209 else
5210 {
5211 tree ambiguous_decls;
5213 /* If we already know that this lookup is ambiguous, then
5214 we've already issued an error message; there's no reason
5215 to check again. */
5218 {
5221 }
5224 none_type,
5225 template_p,
5230 /* If the lookup was ambiguous, an error will already have
5231 been issued. */
5235 /* In Objective-C++, we may have an Objective-C 2.0
5236 dot-syntax for classes here. */
5241 {
5242 tree component;
5249 component);
5250 /* Build a location of the form:
5251 expr.component
5252 ~~~~~^~~~~~~~~
5253 with caret at the start of the component name (at
5254 input_location), ranging from the start of the id_expression
5255 to the end of the component name. */
5256 location_t combined_loc
5261 }
5263 /* In Objective-C++, an instance variable (ivar) may be preferred
5264 to whatever cp_parser_lookup_name() found.
5265 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5266 rest of c-family, we have to do a little extra work to preserve
5267 any location information in cp_expr "decl". Given that
5268 objc_lookup_ivar is implemented in "c-family" and "objc", we
5269 have a trip through the pure "tree" type, rather than cp_expr.
5270 Naively copying it back to "decl" would implicitly give the
5271 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5272 store an EXPR_LOCATION. Hence we only update "decl" (and
5273 hence its location_t) if we get back a different tree node. */
5275 id_expression);
5279 /* If name lookup gives us a SCOPE_REF, then the
5280 qualifying scope was dependent. */
5282 {
5283 /* At this point, we do not know if DECL is a valid
5284 integral constant expression. We assume that it is
5285 in fact such an expression, so that code like:
5287 template <int N> struct A {
5288 int a[B<N>::i];
5289 };
5291 is accepted. At template-instantiation time, we
5292 will check that B<N>::i is actually a constant. */
5294 }
5295 /* Check to see if DECL is a local variable in a context
5296 where that is forbidden. */
5299 {
5300 /* It might be that we only found DECL because we are
5301 trying to be generous with pre-ISO scoping rules.
5302 For example, consider:
5304 int i;
5305 void g() {
5306 for (int i = 0; i < 10; ++i) {}
5307 extern void f(int j = i);
5308 }
5310 Here, name look up will originally find the out
5311 of scope `i'. We need to issue a warning message,
5312 but then use the global `i'. */
5315 {
5320 }
5321 }
5322 }
5324 decl = (finish_id_expression
5326 idk,
5331 template_arg_p,
5338 }
5340 /* Anything else is an error. */
5344 }
5345 }
5353 {
5356 }
5358 /* Parse an id-expression.
5360 id-expression:
5361 unqualified-id
5362 qualified-id
5364 qualified-id:
5365 :: [opt] nested-name-specifier template [opt] unqualified-id
5366 :: identifier
5367 :: operator-function-id
5368 :: template-id
5370 Return a representation of the unqualified portion of the
5371 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5372 a `::' or nested-name-specifier.
5374 Often, if the id-expression was a qualified-id, the caller will
5375 want to make a SCOPE_REF to represent the qualified-id. This
5376 function does not do this in order to avoid wastefully creating
5377 SCOPE_REFs when they are not required.
5379 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5380 `template' keyword.
5382 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5383 uninstantiated templates.
5385 If *TEMPLATE_P is non-NULL, it is set to true iff the
5386 `template' keyword is used to explicitly indicate that the entity
5387 named is a template.
5389 If DECLARATOR_P is true, the id-expression is appearing as part of
5390 a declarator, rather than as part of an expression. */
5392 static cp_expr
5399 {
5403 /* Assume the `template' keyword was not used. */
5407 /* Look for the optional `::' operator. */
5408 global_scope_p
5411 /* Look for the optional nested-name-specifier. */
5412 nested_name_specifier_p
5415 check_dependency_p,
5417 declarator_p)
5419 /* If there is a nested-name-specifier, then we are looking at
5420 the first qualified-id production. */
5422 {
5423 tree saved_scope;
5424 tree saved_object_scope;
5425 tree saved_qualifying_scope;
5426 cp_expr unqualified_id;
5429 /* See if the next token is the `template' keyword. */
5433 /* Name lookup we do during the processing of the
5434 unqualified-id might obliterate SCOPE. */
5438 /* Process the final unqualified-id. */
5440 check_dependency_p,
5441 declarator_p,
5443 /* Restore the SAVED_SCOPE for our caller. */
5449 }
5450 /* Otherwise, if we are in global scope, then we are looking at one
5451 of the other qualified-id productions. */
5453 {
5455 tree id;
5457 /* Peek at the next token. */
5460 /* If it's an identifier, and the next token is not a "<", then
5461 we can avoid the template-id case. This is an optimization
5462 for this common case. */
5464 && !cp_parser_nth_token_starts_template_argument_list_p
5469 /* Try a template-id. */
5473 none_type,
5474 declarator_p);
5475 /* If that worked, we're done. */
5479 /* Peek at the next token. (Changes in the token buffer may
5480 have invalidated the pointer obtained above.) */
5484 {
5491 /* Fall through. */
5496 }
5497 }
5498 else
5501 declarator_p,
5502 optional_p);
5503 }
5505 /* Parse an unqualified-id.
5507 unqualified-id:
5508 identifier
5509 operator-function-id
5510 conversion-function-id
5511 ~ class-name
5512 template-id
5514 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5515 keyword, in a construct like `A::template ...'.
5517 Returns a representation of unqualified-id. For the `identifier'
5518 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5519 production a BIT_NOT_EXPR is returned; the operand of the
5520 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5521 other productions, see the documentation accompanying the
5522 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5523 names are looked up in uninstantiated templates. If DECLARATOR_P
5524 is true, the unqualified-id is appearing as part of a declarator,
5525 rather than as part of an expression. */
5527 static cp_expr
5533 {
5536 /* Peek at the next token. */
5540 {
5542 {
5543 tree id;
5545 /* We don't know yet whether or not this will be a
5546 template-id. */
5548 /* Try a template-id. */
5550 check_dependency_p,
5551 none_type,
5552 declarator_p);
5553 /* If it worked, we're done. */
5556 /* Otherwise, it's an ordinary identifier. */
5558 }
5562 check_dependency_p,
5563 none_type,
5564 declarator_p);
5567 {
5568 tree type_decl;
5569 tree qualifying_scope;
5570 tree object_scope;
5571 tree scope;
5574 /* Consume the `~' token. */
5576 /* Parse the class-name. The standard, as written, seems to
5577 say that:
5579 template <typename T> struct S { ~S (); };
5580 template <typename T> S<T>::~S() {}
5582 is invalid, since `~' must be followed by a class-name, but
5583 `S<T>' is dependent, and so not known to be a class.
5584 That's not right; we need to look in uninstantiated
5585 templates. A further complication arises from:
5587 template <typename T> void f(T t) {
5588 t.T::~T();
5589 }
5591 Here, it is not possible to look up `T' in the scope of `T'
5592 itself. We must look in both the current scope, and the
5593 scope of the containing complete expression.
5595 Yet another issue is:
5597 struct S {
5598 int S;
5599 ~S();
5600 };
5602 S::~S() {}
5604 The standard does not seem to say that the `S' in `~S'
5605 should refer to the type `S' and not the data member
5606 `S::S'. */
5608 /* DR 244 says that we look up the name after the "~" in the
5609 same scope as we looked up the qualifying name. That idea
5610 isn't fully worked out; it's more complicated than that. */
5615 /* Check for invalid scopes. */
5617 {
5621 }
5623 {
5627 scope);
5632 }
5635 /* If the name is of the form "X::~X" it's OK even if X is a
5636 typedef. */
5645 {
5648 }
5650 /* ~auto means the destructor of whatever the object is. */
5652 {
5655 "%<~auto%> only available with "
5659 }
5661 /* If there was an explicit qualification (S::~T), first look
5662 in the scope given by the qualification (i.e., S).
5664 Note: in the calls to cp_parser_class_name below we pass
5665 typename_type so that lookup finds the injected-class-name
5666 rather than the constructor. */
5670 {
5675 typename_type,
5678 declarator_p);
5681 }
5682 /* In "N::S::~S", look in "N" as well. */
5684 {
5689 type_decl
5693 typename_type,
5696 declarator_p);
5699 }
5700 /* In "p->S::~T", look in the scope given by "*p" as well. */
5702 {
5707 type_decl
5711 typename_type,
5714 declarator_p);
5717 }
5718 /* Look in the surrounding context. */
5720 {
5726 type_decl
5730 typename_type,
5733 declarator_p);
5736 {
5737 /* We couldn't find a type with this name. If we're parsing
5738 tentatively, fail and try something else. */
5740 {
5743 }
5744 /* Otherwise, accept it and check for a match at instantiation
5745 time. */
5750 }
5751 }
5752 /* If an error occurred, assume that the name of the
5753 destructor is the same as the name of the qualifying
5754 class. That allows us to keep parsing after running
5755 into ill-formed destructor names. */
5761 /* Check that destructor name and scope match. */
5763 {
5770 }
5772 /* [class.dtor]
5774 A typedef-name that names a class shall not be used as the
5775 identifier in the declarator for a destructor declaration. */
5782 type_decl);
5785 }
5789 {
5790 cp_expr id;
5792 /* This could be a template-id, so we try that first. */
5794 /* Try a template-id. */
5797 none_type,
5798 declarator_p);
5799 /* If that worked, we're done. */
5802 /* We still don't know whether we're looking at an
5803 operator-function-id or a conversion-function-id. */
5805 /* Try an operator-function-id. */
5807 /* If that didn't work, try a conversion-function-id. */
5811 {
5812 /* 17.6.3.3.5 */
5817 "literal operator suffixes not preceded by %<_%>"
5819 }
5822 }
5823 /* Fall through. */
5830 }
5831 }
5833 /* Parse an (optional) nested-name-specifier.
5835 nested-name-specifier: [C++98]
5836 class-or-namespace-name :: nested-name-specifier [opt]
5837 class-or-namespace-name :: template nested-name-specifier [opt]
5839 nested-name-specifier: [C++0x]
5840 type-name ::
5841 namespace-name ::
5842 nested-name-specifier identifier ::
5843 nested-name-specifier template [opt] simple-template-id ::
5845 PARSER->SCOPE should be set appropriately before this function is
5846 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5847 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5848 in name lookups.
5850 Sets PARSER->SCOPE to the class (TYPE) or namespace
5851 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5852 it unchanged if there is no nested-name-specifier. Returns the new
5853 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5855 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5856 part of a declaration and/or decl-specifier. */
5858 static tree
5864 {
5869 /* Remember where the nested-name-specifier starts. */
5871 {
5874 }
5877 {
5878 tree new_scope;
5879 tree old_scope;
5880 tree saved_qualifying_scope;
5883 /* Spot cases that cannot be the beginning of a
5884 nested-name-specifier. */
5887 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5888 the already parsed nested-name-specifier. */
5890 {
5891 /* Grab the nested-name-specifier and continue the loop. */
5893 /* If we originally encountered this nested-name-specifier
5894 with IS_DECLARATION set to false, we will not have
5895 resolved TYPENAME_TYPEs, so we must do so here. */
5898 {
5903 }
5906 }
5908 /* Spot cases that cannot be the beginning of a
5909 nested-name-specifier. On the second and subsequent times
5910 through the loop, we look for the `template' keyword. */
5912 ;
5913 /* A template-id can start a nested-name-specifier. */
5915 ;
5916 /* DR 743: decltype can be used in a nested-name-specifier. */
5918 ;
5919 else
5920 {
5921 /* If the next token is not an identifier, then it is
5922 definitely not a type-name or namespace-name. */
5925 /* If the following token is neither a `<' (to begin a
5926 template-id), nor a `::', then we are not looking at a
5927 nested-name-specifier. */
5933 {
5937 "found %<:%> in nested-name-specifier, "
5940 }
5943 && !cp_parser_nth_token_starts_template_argument_list_p
5946 }
5948 /* The nested-name-specifier is optional, so we parse
5949 tentatively. */
5952 /* Look for the optional `template' keyword, if this isn't the
5953 first time through the loop. */
5956 else
5959 /* Save the old scope since the name lookup we are about to do
5960 might destroy it. */
5963 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5964 look up names in "X<T>::I" in order to determine that "Y" is
5965 a template. So, if we have a typename at this point, we make
5966 an effort to look through it. */
5968 && !typename_keyword_p
5973 /* Parse the qualifying entity. */
5974 new_scope
5976 typename_keyword_p,
5977 template_keyword_p,
5978 check_dependency_p,
5979 type_p,
5980 is_declaration);
5981 /* Look for the `::' token. */
5984 /* If we found what we wanted, we keep going; otherwise, we're
5985 done. */
5987 {
5990 /* Restore the OLD_SCOPE since it was valid before the
5991 failed attempt at finding the last
5992 class-or-namespace-name. */
5996 /* If the next token is a decltype, and the one after that is a
5997 `::', then the decltype has failed to resolve to a class or
5998 enumeration type. Give this error even when parsing
5999 tentatively since it can't possibly be valid--and we're going
6000 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6001 won't get another chance.*/
6005 {
6012 /* As below. */
6015 }
6019 {
6020 /* If we have a non-type template-id followed by ::, it can't
6021 possibly be valid. */
6026 {
6029 {
6035 }
6036 else
6037 {
6038 /* Variable template. */
6043 }
6050 /* As below. */
6054 }
6055 }
6059 /* If the next token is an identifier, and the one after
6060 that is a `::', then any valid interpretation would have
6061 found a class-or-namespace-name. */
6067 {
6070 {
6072 {
6073 tree decl;
6074 tree ambiguous_decls;
6077 none_type,
6086 decl);
6088 {
6089 // cp_parser_lookup_name has the same diagnostic,
6090 // thus make sure to emit it at most once.
6093 {
6098 }
6100 }
6101 else
6102 {
6104 cp_parser_name_lookup_error
6107 else
6108 cp_parser_name_lookup_error
6111 }
6112 }
6115 /* Treat this as a successful nested-name-specifier
6116 due to:
6118 [basic.lookup.qual]
6120 If the name found is not a class-name (clause
6121 _class_) or namespace-name (_namespace.def_), the
6122 program is ill-formed. */
6124 }
6126 }
6128 }
6129 /* We've found one valid nested-name-specifier. */
6131 /* Name lookup always gives us a DECL. */
6134 /* Uses of "template" must be followed by actual templates. */
6146 new_scope);
6147 /* If it is a class scope, try to complete it; we are about to
6148 be looking up names inside the class. */
6150 /* Since checking types for dependency can be expensive,
6151 avoid doing it if the type is already complete. */
6153 /* Do not try to complete dependent types. */
6155 {
6157 /* If it is a typedef to current class, use the current
6158 class instead, as the typedef won't have any names inside
6159 it yet. */
6163 }
6164 /* Make sure we look in the right scope the next time through
6165 the loop. */
6167 }
6169 /* If parsing tentatively, replace the sequence of tokens that makes
6170 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6171 token. That way, should we re-parse the token stream, we will
6172 not have to repeat the effort required to do the parse, nor will
6173 we issue duplicate error messages. */
6175 {
6179 /* Reset the contents of the START token. */
6181 /* Retrieve any deferred checks. Do not pop this access checks yet
6182 so the memory will not be reclaimed during token replacing below. */
6190 /* Purge all subsequent tokens. */
6192 }
6198 }
6200 /* Parse a nested-name-specifier. See
6201 cp_parser_nested_name_specifier_opt for details. This function
6202 behaves identically, except that it will an issue an error if no
6203 nested-name-specifier is present. */
6205 static tree
6211 {
6212 tree scope;
6214 /* Look for the nested-name-specifier. */
6216 typename_keyword_p,
6217 check_dependency_p,
6218 type_p,
6219 is_declaration);
6220 /* If it was not present, issue an error message. */
6222 {
6225 }
6228 }
6230 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6231 this is either a class-name or a namespace-name (which corresponds
6232 to the class-or-namespace-name production in the grammar). For
6233 C++0x, it can also be a type-name that refers to an enumeration
6234 type or a simple-template-id.
6236 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6237 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6238 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6239 TYPE_P is TRUE iff the next name should be taken as a class-name,
6240 even the same name is declared to be another entity in the same
6241 scope.
6243 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6244 specified by the class-or-namespace-name. If neither is found the
6245 ERROR_MARK_NODE is returned. */
6247 static tree
6254 {
6255 tree saved_scope;
6256 tree saved_qualifying_scope;
6257 tree saved_object_scope;
6258 tree scope;
6262 /* DR 743: decltype can appear in a nested-name-specifier. */
6264 {
6268 {
6271 }
6275 }
6277 /* Before we try to parse the class-name, we must save away the
6278 current PARSER->SCOPE since cp_parser_class_name will destroy
6279 it. */
6283 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6284 there is no need to look for a namespace-name. */
6285 only_class_p = template_keyword_p
6290 typename_keyword_p,
6291 template_keyword_p,
6293 check_dependency_p,
6295 is_declaration,
6298 /* If that didn't work, try for a namespace-name. */
6300 {
6301 /* Restore the saved scope. */
6305 /* If we are not looking at an identifier followed by the scope
6306 resolution operator, then this is not part of a
6307 nested-name-specifier. (Note that this function is only used
6308 to parse the components of a nested-name-specifier.) */
6313 }
6316 }
6318 /* Return true if we are looking at a compound-literal, false otherwise. */
6320 static bool
6322 {
6323 /* Consume the `('. */
6328 /* Skip tokens until the next token is a closing parenthesis.
6329 If we find the closing `)', and the next token is a `{', then
6330 we are looking at a compound-literal. */
6331 bool compound_literal_p
6336 /* Roll back the tokens we skipped. */
6340 }
6342 /* Parse a postfix-expression.
6344 postfix-expression:
6345 primary-expression
6346 postfix-expression [ expression ]
6347 postfix-expression ( expression-list [opt] )
6348 simple-type-specifier ( expression-list [opt] )
6349 typename :: [opt] nested-name-specifier identifier
6350 ( expression-list [opt] )
6351 typename :: [opt] nested-name-specifier template [opt] template-id
6352 ( expression-list [opt] )
6353 postfix-expression . template [opt] id-expression
6354 postfix-expression -> template [opt] id-expression
6355 postfix-expression . pseudo-destructor-name
6356 postfix-expression -> pseudo-destructor-name
6357 postfix-expression ++
6358 postfix-expression --
6359 dynamic_cast < type-id > ( expression )
6360 static_cast < type-id > ( expression )
6361 reinterpret_cast < type-id > ( expression )
6362 const_cast < type-id > ( expression )
6363 typeid ( expression )
6364 typeid ( type-id )
6366 GNU Extension:
6368 postfix-expression:
6369 ( type-id ) { initializer-list , [opt] }
6371 This extension is a GNU version of the C99 compound-literal
6372 construct. (The C99 grammar uses `type-name' instead of `type-id',
6373 but they are essentially the same concept.)
6375 If ADDRESS_P is true, the postfix expression is the operand of the
6376 `&' operator. CAST_P is true if this expression is the target of a
6377 cast.
6379 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6380 class member access expressions [expr.ref].
6382 Returns a representation of the expression. */
6384 static cp_expr
6388 {
6390 location_t loc;
6397 /* Peek at the next token. */
6402 /* Some of the productions are determined by keywords. */
6405 {
6410 {
6411 tree type;
6412 cp_expr expression;
6416 /* All of these can be handled in the same way from the point
6417 of view of parsing. Begin by consuming the token
6418 identifying the cast. */
6421 /* New types cannot be defined in the cast. */
6423 parser->type_definition_forbidden_message
6426 /* Look for the opening `<'. */
6428 /* Parse the type to which we are casting. */
6433 /* Look for the closing `>'. */
6435 /* Restore the old message. */
6438 bool saved_greater_than_is_operator_p
6442 /* And the expression which is being cast. */
6446 RT_CLOSE_PAREN);
6450 parser->greater_than_is_operator_p
6453 /* Only type conversions to integral or enumeration types
6454 can be used in constant-expressions. */
6457 {
6460 }
6463 {
6465 postfix_expression
6469 postfix_expression
6473 postfix_expression
6475 tf_warning_or_error);
6478 postfix_expression
6483 }
6485 /* Construct a location e.g. :
6486 reinterpret_cast <int *> (expr)
6487 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6488 ranging from the start of the "*_cast" token to the final closing
6489 paren, with the caret at the start. */
6492 }
6496 {
6497 tree type;
6501 /* Consume the `typeid' token. */
6503 /* Look for the `(' token. */
6505 /* Types cannot be defined in a `typeid' expression. */
6507 parser->type_definition_forbidden_message
6509 /* We can't be sure yet whether we're looking at a type-id or an
6510 expression. */
6512 /* Try a type-id first. */
6517 /* Look for the `)' token. Otherwise, we can't be sure that
6518 we're not looking at an expression: consider `typeid (int
6519 (3))', for example. */
6521 /* If all went well, simply lookup the type-id. */
6524 /* Otherwise, fall back to the expression variant. */
6525 else
6526 {
6527 tree expression;
6529 /* Look for an expression. */
6531 /* Compute its typeid. */
6533 /* Look for the `)' token. */
6535 }
6536 /* Restore the saved message. */
6538 /* `typeid' may not appear in an integral constant expression. */
6541 }
6545 {
6546 tree type;
6547 /* The syntax permitted here is the same permitted for an
6548 elaborated-type-specifier. */
6555 }
6559 {
6560 location_t cilk_spawn_loc
6565 {
6570 }
6572 {
6577 }
6578 else
6579 {
6580 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6583 }
6585 postfix_expression =
6589 {
6593 }
6595 {
6600 }
6601 else
6602 {
6605 postfix_expression);
6606 /* Build a location of the form:
6607 _Cilk_spawn expr
6608 ~~~~~~~~~~~~^~~~
6609 with caret at the expr, ranging from the start of the
6610 _Cilk_spawn token to the end of the expression. */
6611 location_t combined_loc =
6617 }
6619 }
6624 {
6627 tree p;
6634 {
6637 }
6643 {
6646 postfix_expression
6648 else
6649 {
6653 }
6659 tf_warning_or_error);
6660 else
6661 {
6665 }
6670 postfix_expression
6674 postfix_expression
6677 else
6678 {
6682 }
6687 }
6689 }
6692 {
6693 tree type;
6695 /* If the next thing is a simple-type-specifier, we may be
6696 looking at a functional cast. We could also be looking at
6697 an id-expression. So, we try the functional cast, and if
6698 that doesn't work we fall back to the primary-expression. */
6700 /* Look for the simple-type-specifier. */
6704 CP_PARSER_FLAGS_NONE);
6706 /* Parse the cast itself. */
6708 postfix_expression
6710 /* If that worked, we're done. */
6714 /* If the functional-cast didn't work out, try a
6715 compound-literal. */
6718 {
6723 /* Avoid calling cp_parser_type_id pointlessly, see comment
6724 in cp_parser_cast_expression about c++/29234. */
6727 else
6728 {
6729 /* Parse the type. */
6734 /* Look for the `)'. */
6736 }
6738 /* If things aren't going well, there's no need to
6739 keep going. */
6741 {
6743 /* Parse the brace-enclosed initializer list. */
6746 }
6747 /* If that worked, we're definitely looking at a
6748 compound-literal expression. */
6750 {
6751 /* Warn the user that a compound literal is not
6752 allowed in standard C++. */
6755 /* For simplicity, we disallow compound literals in
6756 constant-expressions. We could
6757 allow compound literals of integer type, whose
6758 initializer was a constant, in constant
6759 expressions. Permitting that usage, as a further
6760 extension, would not change the meaning of any
6761 currently accepted programs. (Of course, as
6762 compound literals are not part of ISO C++, the
6763 standard has nothing to say.) */
6765 NIC_NCC))
6766 {
6769 }
6770 /* Form the representation of the compound-literal. */
6771 postfix_expression
6776 }
6777 }
6779 /* It must be a primary-expression. */
6780 postfix_expression
6783 decltype_p,
6785 }
6787 }
6789 /* Note that we don't need to worry about calling build_cplus_new on a
6790 class-valued CALL_EXPR in decltype when it isn't the end of the
6791 postfix-expression; unary_complex_lvalue will take care of that for
6792 all these cases. */
6794 /* Keep looping until the postfix-expression is complete. */
6796 {
6800 /* It is not a Koenig lookup function call. */
6801 postfix_expression
6804 /* Peek at the next token. */
6808 {
6811 {
6813 "two consecutive %<[%> shall "
6816 }
6817 postfix_expression
6819 postfix_expression,
6821 decltype_p);
6830 /* postfix-expression ( expression-list [opt] ) */
6831 {
6842 is_builtin_constant_p
6845 {
6846 /* The whole point of __builtin_constant_p is to allow
6847 non-constant expressions to appear as arguments. */
6848 saved_integral_constant_expression_p
6850 saved_non_integral_constant_expression_p
6853 }
6854 args = (cp_parser_parenthesized_expression_list
6860 {
6861 parser->integral_constant_expression_p
6863 parser->non_integral_constant_expression_p
6865 }
6868 {
6871 }
6873 /* Function calls are not permitted in
6874 constant-expressions. */
6877 NIC_FUNC_CALL))
6878 {
6882 }
6887 {
6889 {
6891 {
6894 postfix_expression
6896 complain);
6897 }
6898 else
6899 postfix_expression
6901 }
6902 /* We do not perform argument-dependent lookup if
6903 normal lookup finds a non-function, in accordance
6904 with the expected resolution of DR 218. */
6907 {
6911 /* Do not do argument dependent lookup if regular
6912 lookup finds a member function or a block-scope
6913 function declaration. [basic.lookup.argdep]/3 */
6916 {
6919 postfix_expression
6921 complain);
6922 }
6923 }
6924 }
6930 {
6939 }
6942 {
6952 {
6954 postfix_expression
6958 }
6961 {
6962 postfix_expression
6963 = (build_new_method_call
6969 complain));
6970 }
6971 else
6972 postfix_expression
6976 complain);
6977 }
6981 postfix_expression = (build_offset_ref_call_from_tree
6983 complain));
6985 /* A call to a static class member, or a namespace-scope
6986 function. */
6987 postfix_expression
6990 koenig_p,
6991 complain);
6992 else
6993 /* All other function calls. */
6994 postfix_expression
6997 koenig_p,
6998 complain);
7001 {
7003 start_loc,
7004 close_paren_loc);
7006 }
7008 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7012 }
7017 /* postfix-expression . template [opt] id-expression
7018 postfix-expression . pseudo-destructor-name
7019 postfix-expression -> template [opt] id-expression
7020 postfix-expression -> pseudo-destructor-name */
7022 /* Consume the `.' or `->' operator. */
7025 postfix_expression
7027 postfix_expression,
7034 /* postfix-expression ++ */
7035 /* Consume the `++' token. */
7037 /* Generate a representation for the complete expression. */
7038 postfix_expression
7040 POSTINCREMENT_EXPR);
7041 /* Increments may not appear in constant-expressions. */
7049 /* postfix-expression -- */
7050 /* Consume the `--' token. */
7052 /* Generate a representation for the complete expression. */
7053 postfix_expression
7055 POSTDECREMENT_EXPR);
7056 /* Decrements may not appear in constant-expressions. */
7067 return is_member_access
7068 ? postfix_expression
7070 else
7072 }
7073 }
7075 /* We should never get here. */
7078 }
7080 /* This function parses Cilk Plus array notations. If a normal array expr. is
7081 parsed then the array index is passed back to the caller through *INIT_INDEX
7082 and the function returns a NULL_TREE. If array notation expr. is parsed,
7083 then *INIT_INDEX is ignored by the caller and the function returns
7084 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7085 error_mark_node. */
7087 static tree
7089 tree array_value)
7090 {
7094 {
7097 }
7106 {
7109 }
7111 {
7112 /* Consume the ':'. */
7115 /* If we are here, then we have a case like this A[:]. */
7117 {
7121 }
7125 }
7126 else
7127 {
7128 /* If we are here, then there are three valid possibilities:
7129 1. ARRAY [ EXP ]
7130 2. ARRAY [ EXP : EXP ]
7131 3. ARRAY [ EXP : EXP : EXP ] */
7135 {
7136 /* This indicates that we have a normal array expression. */
7139 }
7141 /* Consume the ':'. */
7145 {
7148 }
7149 }
7154 {
7158 }
7164 }
7166 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7167 by cp_parser_builtin_offsetof. We're looking for
7169 postfix-expression [ expression ]
7170 postfix-expression [ braced-init-list ] (C++11)
7172 FOR_OFFSETOF is set if we're being called in that context, which
7173 changes how we deal with integer constant expressions. */
7175 static tree
7177 tree postfix_expression,
7180 {
7185 /* Consume the `[' token. */
7191 /* Parse the index expression. */
7192 /* ??? For offsetof, there is a question of what to allow here. If
7193 offsetof is not being used in an integral constant expression context,
7194 then we *could* get the right answer by computing the value at runtime.
7195 If we are in an integral constant expression context, then we might
7196 could accept any constant expression; hard to say without analysis.
7197 Rather than open the barn door too wide right away, allow only integer
7198 constant expressions here. */
7201 else
7202 {
7204 {
7211 {
7213 "braced list index is not allowed with array "
7217 }
7218 }
7220 {
7221 /* Here are have these two options:
7222 ARRAY[EXP : EXP] - Array notation expr with default
7223 stride of 1.
7224 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7225 stride. */
7227 postfix_expression);
7230 }
7231 else
7233 }
7237 /* Look for the closing `]'. */
7240 /* Build the ARRAY_REF. */
7244 /* When not doing offsetof, array references are not permitted in
7245 constant-expressions. */
7251 }
7253 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7254 by cp_parser_builtin_offsetof. We're looking for
7256 postfix-expression . template [opt] id-expression
7257 postfix-expression . pseudo-destructor-name
7258 postfix-expression -> template [opt] id-expression
7259 postfix-expression -> pseudo-destructor-name
7261 FOR_OFFSETOF is set if we're being called in that context. That sorta
7262 limits what of the above we'll actually accept, but nevermind.
7263 TOKEN_TYPE is the "." or "->" token, which will already have been
7264 removed from the stream. */
7266 static tree
7269 cp_expr postfix_expression,
7271 location_t location)
7272 {
7273 tree name;
7279 /* If this is a `->' operator, dereference the pointer. */
7282 tf_warning_or_error);
7283 /* Check to see whether or not the expression is type-dependent and
7284 not the current instantiation. */
7286 /* The identifier following the `->' or `.' is not qualified. */
7292 /* Enter the scope corresponding to the type of the object
7293 given by the POSTFIX_EXPRESSION. */
7295 {
7297 /* According to the standard, no expression should ever have
7298 reference type. Unfortunately, we do not currently match
7299 the standard in this respect in that our internal representation
7300 of an expression may have reference type even when the standard
7301 says it does not. Therefore, we have to manually obtain the
7302 underlying type here. */
7304 /* The type of the POSTFIX_EXPRESSION must be complete. */
7305 /* Unlike the object expression in other contexts, *this is not
7306 required to be of complete type for purposes of class member
7307 access (5.2.5) outside the member function body. */
7310 && !(processing_template_decl
7311 && current_class_type
7312 && (same_type_ignoring_top_level_qualifiers_p
7314 {
7317 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7319 {
7320 /* In a template, be permissive by treating an object expression
7321 of incomplete type as dependent (after a pedwarn). */
7322 diagnostic_t kind = (processing_template_decl
7323 ? DK_PEDWARN
7325 cxx_incomplete_type_diagnostic
7329 {
7332 }
7333 }
7334 }
7337 {
7338 /* Let the name lookup machinery know that we are processing a
7339 class member access expression. */
7341 /* If something went wrong, we want to be able to discern that case,
7342 as opposed to the case where there was no SCOPE due to the type
7343 of expression being dependent. */
7346 /* If the SCOPE was erroneous, make the various semantic analysis
7347 functions exit quickly -- and without issuing additional error
7348 messages. */
7351 }
7352 }
7355 /* Tell cp_parser_lookup_name that there was an object, even though it's
7356 type-dependent. */
7359 /* Assume this expression is not a pseudo-destructor access. */
7362 /* If the SCOPE is a scalar type, then, if this is a valid program,
7363 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7364 is type dependent, it can be pseudo-destructor-name or something else.
7365 Try to parse it as pseudo-destructor-name first. */
7367 {
7368 tree s;
7369 tree type;
7372 /* Parse the pseudo-destructor-name. */
7381 {
7383 postfix_expression
7386 }
7387 }
7390 {
7391 /* If the SCOPE is not a scalar type, we are looking at an
7392 ordinary class member access expression, rather than a
7393 pseudo-destructor-name. */
7396 /* Parse the id-expression. */
7397 name = (cp_parser_id_expression
7404 /* In general, build a SCOPE_REF if the member name is qualified.
7405 However, if the name was not dependent and has already been
7406 resolved; there is no need to build the SCOPE_REF. For example;
7408 struct X { void f(); };
7409 template <typename T> void f(T* t) { t->X::f(); }
7411 Even though "t" is dependent, "X::f" is not and has been resolved
7412 to a BASELINK; there is no need to include scope information. */
7414 /* But we do need to remember that there was an explicit scope for
7415 virtual function calls. */
7419 /* If the name is a template-id that names a type, we will get a
7420 TYPE_DECL here. That is invalid code. */
7422 {
7425 }
7426 else
7427 {
7429 {
7431 {
7435 }
7436 else
7439 name,
7440 template_p);
7444 }
7446 adjust_result_of_qualified_name_lookup
7448 postfix_expression
7450 template_p,
7451 tf_warning_or_error);
7452 /* Build a location e.g.:
7453 ptr->access_expr
7454 ~~~^~~~~~~~~~~~~
7455 where the caret is at the deref token, ranging from
7456 the start of postfix_expression to the end of the access expr. */
7457 location_t end_loc
7459 location_t combined_loc
7462 }
7463 }
7465 /* We no longer need to look up names in the scope of the object on
7466 the left-hand side of the `.' or `->' operator. */
7469 /* Outside of offsetof, these operators may not appear in
7470 constant-expressions. */
7472 && (cp_parser_non_integral_constant_expression
7477 }
7479 /* Parse a parenthesized expression-list.
7481 expression-list:
7482 assignment-expression
7483 expression-list, assignment-expression
7485 attribute-list:
7486 expression-list
7487 identifier
7488 identifier, expression-list
7490 CAST_P is true if this expression is the target of a cast.
7492 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7493 argument pack.
7495 Returns a vector of trees. Each element is a representation of an
7496 assignment-expression. NULL is returned if the ( and or ) are
7497 missing. An empty, but allocated, vector is returned on no
7498 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7499 if we are parsing an attribute list for an attribute that wants a
7500 plain identifier argument, normal_attr for an attribute that wants
7501 an expression, or non_attr if we aren't parsing an attribute list. If
7502 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7503 not all of the expressions in the list were constant.
7504 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7505 will be written to with the location of the closing parenthesis. If
7506 an error occurs, it may or may not be written to. */
7515 {
7521 /* Assume all the expressions will be constant. */
7530 /* Within a parenthesized expression, a `>' token is always
7531 the greater-than operator. */
7532 saved_greater_than_is_operator_p
7536 /* Consume expressions until there are no more. */
7539 {
7540 tree expr;
7542 /* At the beginning of attribute lists, check to see if the
7543 next token is an identifier. */
7546 {
7549 /* Consume the identifier. */
7551 /* Save the identifier. */
7553 }
7554 else
7555 {
7558 /* Parse the next assignment-expression. */
7560 {
7561 /* A braced-init-list. */
7567 }
7569 {
7570 expr = (cp_parser_constant_expression
7575 }
7576 else
7578 cast_p);
7583 /* If we have an ellipsis, then this is an expression
7584 expansion. */
7587 {
7588 /* Consume the `...'. */
7591 /* Build the argument pack. */
7593 }
7595 /* Add it to the list. We add error_mark_node
7596 expressions to the list, so that we can still tell if
7597 the correct form for a parenthesized expression-list
7598 is found. That gives better errors. */
7603 }
7605 /* After the first item, attribute lists look the same as
7606 expression lists. */
7609 get_comma:;
7610 /* If the next token isn't a `,', then we are done. */
7614 /* Otherwise, consume the `,' and keep going. */
7616 }
7622 {
7625 skip_comma:;
7626 /* We try and resync to an unnested comma, as that will give the
7627 user better diagnostics. */
7635 {
7636 parser->greater_than_is_operator_p
7639 }
7640 }
7642 parser->greater_than_is_operator_p
7649 }
7651 /* Parse a pseudo-destructor-name.
7653 pseudo-destructor-name:
7654 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7655 :: [opt] nested-name-specifier template template-id :: ~ type-name
7656 :: [opt] nested-name-specifier [opt] ~ type-name
7658 If either of the first two productions is used, sets *SCOPE to the
7659 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7660 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7661 or ERROR_MARK_NODE if the parse fails. */
7663 static void
7665 tree object,
7668 {
7671 /* Handle ~auto. */
7675 {
7678 "%<~auto%> only available with "
7685 }
7687 /* Assume that things will not work out. */
7690 /* Look for the optional `::' operator. */
7692 /* Look for the optional nested-name-specifier. */
7693 nested_name_specifier_p
7700 /* Now, if we saw a nested-name-specifier, we might be doing the
7701 second production. */
7704 {
7705 /* Consume the `template' keyword. */
7707 /* Parse the template-id. */
7711 class_type,
7713 /* Look for the `::' token. */
7715 }
7716 /* If the next token is not a `~', then there might be some
7717 additional qualification. */
7719 {
7720 /* At this point, we're looking for "type-name :: ~". The type-name
7721 must not be a class-name, since this is a pseudo-destructor. So,
7722 it must be either an enum-name, or a typedef-name -- both of which
7723 are just identifiers. So, we peek ahead to check that the "::"
7724 and "~" tokens are present; if they are not, then we can avoid
7725 calling type_name. */
7729 {
7732 }
7734 /* Look for the type-name. */
7739 /* Look for the `::' token. */
7741 }
7742 else
7745 /* Look for the `~'. */
7748 /* Once we see the ~, this has to be a pseudo-destructor. */
7752 /* Look for the type-name again. We are not responsible for
7753 checking that it matches the first type-name. */
7755 }
7757 /* Parse a unary-expression.
7759 unary-expression:
7760 postfix-expression
7761 ++ cast-expression
7762 -- cast-expression
7763 unary-operator cast-expression
7764 sizeof unary-expression
7765 sizeof ( type-id )
7766 alignof ( type-id ) [C++0x]
7767 new-expression
7768 delete-expression
7770 GNU Extensions:
7772 unary-expression:
7773 __extension__ cast-expression
7774 __alignof__ unary-expression
7775 __alignof__ ( type-id )
7776 alignof unary-expression [C++0x]
7777 __real__ cast-expression
7778 __imag__ cast-expression
7779 && identifier
7780 sizeof ( type-id ) { initializer-list , [opt] }
7781 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7782 __alignof__ ( type-id ) { initializer-list , [opt] }
7784 ADDRESS_P is true iff the unary-expression is appearing as the
7785 operand of the `&' operator. CAST_P is true if this expression is
7786 the target of a cast.
7788 Returns a representation of the expression. */
7790 static cp_expr
7793 {
7797 /* Peek at the next token. */
7799 /* Some keywords give away the kind of expression. */
7801 {
7805 {
7808 {
7814 /* Consume the token. */
7816 /* Parse the operand. */
7821 else
7822 {
7823 /* ISO C++ defines alignof only with types, not with
7824 expressions. So pedwarn if alignof is used with a non-
7825 type expression. However, __alignof__ is ok. */
7828 "ISO C++ does not allow %<alignof%> "
7832 }
7833 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7834 SIZEOF_EXPR with the original operand. */
7836 {
7838 {
7840 {
7843 error_mark_node));
7845 }
7846 else
7850 }
7851 }
7853 /* Construct a location e.g. :
7854 alignof (expr)
7855 ^~~~~~~~~~~~~~
7856 with start == caret at the start of the "alignof"/"sizeof"
7857 token, with the endpoint at the final closing paren. */
7858 location_t finish_loc
7860 location_t compound_loc
7866 }
7875 {
7876 /* The saved value of the PEDANTIC flag. */
7878 tree expr;
7880 /* Save away the PEDANTIC flag. */
7882 /* Parse the cast-expression. */
7884 /* Restore the PEDANTIC flag. */
7888 }
7892 {
7893 tree expression;
7895 /* Consume the `__real__' or `__imag__' token. */
7897 /* Parse the cast-expression. */
7899 /* Create the complete representation. */
7903 expression,
7904 tf_warning_or_error);
7905 }
7913 {
7914 tree expr;
7924 parser->type_definition_forbidden_message
7927 saved_integral_constant_expression_p
7929 saved_non_integral_constant_expression_p
7933 saved_greater_than_is_operator_p
7945 parser->greater_than_is_operator_p
7948 parser->integral_constant_expression_p
7950 parser->non_integral_constant_expression_p
7957 }
7961 }
7962 }
7964 /* Look for the `:: new' and `:: delete', which also signal the
7965 beginning of a new-expression, or delete-expression,
7966 respectively. If the next token is `::', then it might be one of
7967 these. */
7969 {
7972 /* See if the token after the `::' is one of the keywords in
7973 which we're interested. */
7975 /* If it's `new', we have a new-expression. */
7978 /* Similarly, for `delete'. */
7981 }
7983 /* Look for a unary operator. */
7985 /* The `++' and `--' operators can be handled similarly, even though
7986 they are not technically unary-operators in the grammar. */
7988 {
7993 /* Handle the GNU address-of-label extension. */
7996 {
7997 tree identifier;
7998 tree expression;
8001 /* Consume the '&&' token. */
8003 /* Look for the identifier. */
8004 location_t finish_loc
8007 /* Construct a location of the form:
8008 &&label
8009 ^~~~~~~
8010 with caret==start at the "&&", finish at the end of the label. */
8011 location_t combined_loc
8013 /* Create an expression representing the address. */
8016 NIC_ADDR_LABEL))
8019 }
8020 }
8022 {
8023 cp_expr cast_expression;
8029 /* Consume the operator token. */
8033 /* Parse the cast-expression. */
8034 cast_expression
8039 pidk);
8041 /* Make a location:
8042 OP_TOKEN CAST_EXPRESSION
8043 ^~~~~~~~~~~~~~~~~~~~~~~~~
8044 with start==caret at the operator token, and
8045 extending to the end of the cast_expression. */
8048 /* Now, build an appropriate representation. */
8050 {
8054 RO_UNARY_STAR,
8055 complain);
8056 /* TODO: build_x_indirect_ref does not always honor the
8057 location, so ensure it is set. */
8063 /* Fall through. */
8066 cast_expression,
8067 complain);
8068 /* TODO: build_x_unary_op does not always honor the location,
8069 so ensure it is set. */
8077 /* Fall through. */
8079 /* Immediately fold negation of a constant, unless the constant is 0
8080 (since -0 == 0) or it would overflow. */
8085 {
8088 cast_expression);
8090 {
8093 }
8094 }
8095 /* Fall through. */
8104 }
8108 non_constant_p))
8112 }
8116 decltype_p,
8117 pidk);
8118 }
8120 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8121 unary-operator, the corresponding tree code is returned. */
8123 static enum tree_code
8125 {
8127 {
8148 }
8149 }
8151 /* Parse a new-expression.
8153 new-expression:
8154 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8155 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8157 Returns a representation of the expression. */
8159 static tree
8161 {
8164 tree type;
8167 tree ret;
8171 /* Look for the optional `::' operator. */
8172 global_scope_p
8176 /* Look for the `new' operator. */
8178 /* There's no easy way to tell a new-placement from the
8179 `( type-id )' construct. */
8181 /* Look for a new-placement. */
8183 /* If that didn't work out, there's no new-placement. */
8185 {
8189 }
8191 /* If the next token is a `(', then we have a parenthesized
8192 type-id. */
8194 {
8198 /* Consume the `('. */
8201 /* Parse the type-id. */
8202 parser->type_definition_forbidden_message
8204 {
8207 }
8210 /* Look for the closing `)'. */
8213 /* There should not be a direct-new-declarator in this production,
8214 but GCC used to allowed this, so we check and emit a sensible error
8215 message for this case. */
8217 {
8223 }
8224 }
8225 /* Otherwise, there must be a new-type-id. */
8226 else
8229 /* If the next token is a `(' or '{', then we have a new-initializer. */
8234 else
8237 /* A new-expression may not appear in an integral constant
8238 expression. */
8241 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8242 of a new-type-id or type-id of a new-expression, the new-expression shall
8243 contain a new-initializer of the form ( assignment-expression )".
8244 Additionally, consistently with the spirit of DR 1467, we want to accept
8245 'new auto { 2 }' too. */
8251 {
8253 "initialization of new-expression for type %<auto%> "
8256 }
8257 else
8258 {
8259 /* Construct a location e.g.:
8260 ptr = new int[100]
8261 ^~~~~~~~~~~~
8262 with caret == start at the start of the "new" token, and the end
8263 at the end of the final token we consumed. */
8268 /* Create a representation of the new-expression. */
8270 tf_warning_or_error);
8272 }
8280 }
8282 /* Parse a new-placement.
8284 new-placement:
8285 ( expression-list )
8287 Returns the same representation as for an expression-list. */
8291 {
8294 /* Parse the expression-list. */
8295 expression_list = (cp_parser_parenthesized_expression_list
8304 }
8306 /* Parse a new-type-id.
8308 new-type-id:
8309 type-specifier-seq new-declarator [opt]
8311 Returns the TYPE allocated. If the new-type-id indicates an array
8312 type, *NELTS is set to the number of elements in the last array
8313 bound; the TYPE will not include the last array bound. */
8315 static tree
8317 {
8318 cp_decl_specifier_seq type_specifier_seq;
8324 /* The type-specifier sequence must not contain type definitions.
8325 (It cannot contain declarations of new types either, but if they
8326 are not definitions we will catch that because they are not
8327 complete.) */
8329 parser->type_definition_forbidden_message
8331 /* Parse the type-specifier-seq. */
8335 /* Restore the old message. */
8341 /* Parse the new-declarator. */
8344 /* Determine the number of elements in the last array dimension, if
8345 any. */
8347 /* Skip down to the last array dimension. */
8352 {
8355 }
8360 {
8363 }
8366 {
8373 else
8375 }
8378 }
8380 /* Parse an (optional) new-declarator.
8382 new-declarator:
8383 ptr-operator new-declarator [opt]
8384 direct-new-declarator
8386 Returns the declarator. */
8390 {
8393 cp_cv_quals cv_quals;
8395 /* We don't know if there's a ptr-operator next, or not. */
8397 /* Look for a ptr-operator. */
8399 /* If that worked, look for more new-declarators. */
8401 {
8404 /* Parse another optional declarator. */
8407 declarator = cp_parser_make_indirect_declarator
8411 }
8413 /* If the next token is a `[', there is a direct-new-declarator. */
8418 }
8420 /* Parse a direct-new-declarator.
8422 direct-new-declarator:
8423 [ expression ]
8424 direct-new-declarator [constant-expression]
8426 */
8430 {
8434 {
8435 tree expression;
8438 /* Look for the opening `['. */
8443 /* The standard requires that the expression have integral
8444 type. DR 74 adds enumeration types. We believe that the
8445 real intent is that these expressions be handled like the
8446 expression in a `switch' condition, which also allows
8447 classes with a single conversion to integral or
8448 enumeration type. */
8450 {
8451 expression
8453 expression,
8456 {
8458 "expression in new-declarator must have integral "
8461 }
8462 }
8464 /* Look for the closing `]'. */
8467 /* Add this bound to the declarator. */
8470 /* If the next token is not a `[', then there are no more
8471 bounds. */
8474 }
8477 }
8479 /* Parse a new-initializer.
8481 new-initializer:
8482 ( expression-list [opt] )
8483 braced-init-list
8485 Returns a representation of the expression-list. */
8489 {
8493 {
8494 tree t;
8501 }
8502 else
8503 expression_list = (cp_parser_parenthesized_expression_list
8509 }
8511 /* Parse a delete-expression.
8513 delete-expression:
8514 :: [opt] delete cast-expression
8515 :: [opt] delete [ ] cast-expression
8517 Returns a representation of the expression. */
8519 static tree
8521 {
8524 tree expression;
8526 /* Look for the optional `::' operator. */
8527 global_scope_p
8531 /* Look for the `delete' keyword. */
8533 /* See if the array syntax is in use. */
8535 {
8536 /* Consume the `[' token. */
8538 /* Look for the `]' token. */
8540 /* Remember that this is the `[]' construct. */
8542 }
8543 else
8546 /* Parse the cast-expression. */
8549 /* A delete-expression may not appear in an integral constant
8550 expression. */
8555 tf_warning_or_error);
8556 }
8558 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8559 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8560 0 otherwise. */
8562 static int
8564 {
8567 {
8609 /* In ((type ()) () the last () isn't a valid cast-expression,
8610 so the whole must be parsed as postfix-expression. */
8615 /* '[' may start a primary-expression in obj-c++ and in C++11,
8616 as a lambda-expression, eg, '(void)[]{}'. */
8623 /* '++' and '--' may or may not start a cast-expression:
8625 struct T { void operator++(int); };
8626 void f() { (T())++; }
8628 vs
8630 int a;
8631 (int)++a; */
8636 }
8637 }
8639 /* Parse a cast-expression.
8641 cast-expression:
8642 unary-expression
8643 ( type-id ) cast-expression
8645 ADDRESS_P is true iff the unary-expression is appearing as the
8646 operand of the `&' operator. CAST_P is true if this expression is
8647 the target of a cast.
8649 Returns a representation of the expression. */
8651 static cp_expr
8654 {
8655 /* If it's a `(', then we might be looking at a cast. */
8657 {
8663 /* There's no way to know yet whether or not this is a cast.
8664 For example, `(int (3))' is a unary-expression, while `(int)
8665 3' is a cast. So, we resort to parsing tentatively. */
8667 /* Types may not be defined in a cast. */
8669 parser->type_definition_forbidden_message
8671 /* Consume the `('. */
8675 /* A very tricky bit is that `(struct S) { 3 }' is a
8676 compound-literal (which we permit in C++ as an extension).
8677 But, that construct is not a cast-expression -- it is a
8678 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8679 is legal; if the compound-literal were a cast-expression,
8680 you'd need an extra set of parentheses.) But, if we parse
8681 the type-id, and it happens to be a class-specifier, then we
8682 will commit to the parse at that point, because we cannot
8683 undo the action that is done when creating a new class. So,
8684 then we cannot back up and do a postfix-expression.
8686 Another tricky case is the following (c++/29234):
8688 struct S { void operator () (); };
8690 void foo ()
8691 {
8692 ( S()() );
8693 }
8695 As a type-id we parse the parenthesized S()() as a function
8696 returning a function, groktypename complains and we cannot
8697 back up in this case either.
8699 Therefore, we scan ahead to the closing `)', and check to see
8700 if the tokens after the `)' can start a cast-expression. Otherwise
8701 we are dealing with an unary-expression, a postfix-expression
8702 or something else.
8704 Yet another tricky case, in C++11, is the following (c++/54891):
8706 (void)[]{};
8708 The issue is that usually, besides the case of lambda-expressions,
8709 the parenthesized type-id cannot be followed by '[', and, eg, we
8710 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8711 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8712 we don't commit, we try a cast-expression, then an unary-expression.
8714 Save tokens so that we can put them back. */
8717 /* We may be looking at a cast-expression. */
8720 cast_expression
8723 /* Roll back the tokens we skipped. */
8725 /* If we aren't looking at a cast-expression, simulate an error so
8726 that the call to cp_parser_error_occurred below returns true. */
8729 else
8730 {
8733 /* Look for the type-id. */
8735 /* Look for the closing `)'. */
8738 }
8740 /* Restore the saved message. */
8743 /* At this point this can only be either a cast or a
8744 parenthesized ctor such as `(T ())' that looks like a cast to
8745 function returning T. */
8747 {
8748 /* Only commit if the cast-expression doesn't start with
8749 '++', '--', or '[' in C++11. */
8757 pidk);
8760 {
8761 /* Warn about old-style casts, if so requested. */
8769 /* Only type conversions to integral or enumeration types
8770 can be used in constant-expressions. */
8773 NIC_CAST))
8776 /* Perform the cast. */
8777 /* Make a location:
8778 (TYPE) EXPR
8779 ^~~~~~~~~~~
8780 with start==caret at the open paren, extending to the
8781 end of "expr". */
8783 open_paren_loc,
8787 }
8788 }
8789 else
8791 }
8793 /* If we get here, then it's not a cast, so it must be a
8794 unary-expression. */
8797 }
8799 /* Parse a binary expression of the general form:
8801 pm-expression:
8802 cast-expression
8803 pm-expression .* cast-expression
8804 pm-expression ->* cast-expression
8806 multiplicative-expression:
8807 pm-expression
8808 multiplicative-expression * pm-expression
8809 multiplicative-expression / pm-expression
8810 multiplicative-expression % pm-expression
8812 additive-expression:
8813 multiplicative-expression
8814 additive-expression + multiplicative-expression
8815 additive-expression - multiplicative-expression
8817 shift-expression:
8818 additive-expression
8819 shift-expression << additive-expression
8820 shift-expression >> additive-expression
8822 relational-expression:
8823 shift-expression
8824 relational-expression < shift-expression
8825 relational-expression > shift-expression
8826 relational-expression <= shift-expression
8827 relational-expression >= shift-expression
8829 GNU Extension:
8831 relational-expression:
8832 relational-expression <? shift-expression
8833 relational-expression >? shift-expression
8835 equality-expression:
8836 relational-expression
8837 equality-expression == relational-expression
8838 equality-expression != relational-expression
8840 and-expression:
8841 equality-expression
8842 and-expression & equality-expression
8844 exclusive-or-expression:
8845 and-expression
8846 exclusive-or-expression ^ and-expression
8848 inclusive-or-expression:
8849 exclusive-or-expression
8850 inclusive-or-expression | exclusive-or-expression
8852 logical-and-expression:
8853 inclusive-or-expression
8854 logical-and-expression && inclusive-or-expression
8856 logical-or-expression:
8857 logical-and-expression
8858 logical-or-expression || logical-and-expression
8860 All these are implemented with a single function like:
8862 binary-expression:
8863 simple-cast-expression
8864 binary-expression <token> binary-expression
8866 CAST_P is true if this expression is the target of a cast.
8868 The binops_by_token map is used to get the tree codes for each <token> type.
8869 binary-expressions are associated according to a precedence table. */
8871 #define TOKEN_PRECEDENCE(token) \
8872 (((token->type == CPP_GREATER \
8873 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8874 && !parser->greater_than_is_operator_p) \
8875 ? PREC_NOT_OPERATOR \
8876 : binops_by_token[token->type].prec)
8878 static cp_expr
8884 {
8885 cp_parser_expression_stack stack;
8887 cp_parser_expression_stack_entry current;
8888 cp_expr rhs;
8892 tree overload;
8894 /* Parse the first expression. */
8905 {
8906 /* Get an operator token. */
8912 {
8914 "%<>>%> operator is treated"
8918 }
8923 /* This is a fold-expression; handle it later. */
8926 /* Popping an entry off the stack means we completed a subexpression:
8927 - either we found a token which is not an operator (`>' where it is not
8928 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8929 will happen repeatedly;
8930 - or, we found an operator which has lower priority. This is the case
8931 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8932 parsing `3 * 4'. */
8934 {
8937 else
8939 }
8941 get_rhs:
8945 /* We used the operator token. */
8948 /* For "false && x" or "true || x", x will never be executed;
8949 disable warnings while evaluating it. */
8951 c_inhibit_evaluation_warnings +=
8954 c_inhibit_evaluation_warnings +=
8957 /* Extract another operand. It may be the RHS of this expression
8958 or the LHS of a new, higher priority expression. */
8963 /* Get another operator token. Look up its precedence to avoid
8964 building a useless (immediately popped) stack entry for common
8965 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8972 {
8973 /* ... and prepare to parse the RHS of the new, higher priority
8974 expression. Since precedence levels on the stack are
8975 monotonically increasing, we do not have to care about
8976 stack overflows. */
8985 pop:
8987 /* If the stack is not empty, we have parsed into LHS the right side
8988 (`4' in the example above) of an expression we had suspended.
8989 We can use the information on the stack to recover the LHS (`3')
8990 from the stack together with the tree code (`MULT_EXPR'), and
8991 the precedence of the higher level subexpression
8992 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8993 which will be used to actually build the additive expression. */
8998 }
9000 /* Undo the disabling of warnings done above. */
9002 c_inhibit_evaluation_warnings -=
9005 c_inhibit_evaluation_warnings -=
9011 /* Avoid warning for !!x == y. */
9016 /* Avoid warning for !b == y where b is boolean. */
9020 /* Avoid warning for !!b == y where b is boolean. */
9033 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9034 ERROR_MARK for everything that is not a binary expression.
9035 This makes warn_about_parentheses miss some warnings that
9036 involve unary operators. For unary expressions we should
9037 pass the correct tree_code unless the unary expression was
9038 surrounded by parentheses.
9039 */
9046 == tcc_comparison
9049 else
9050 {
9055 /* TODO: build_x_binary_op doesn't always honor the location. */
9057 }
9060 /* If the binary operator required the use of an overloaded operator,
9061 then this expression cannot be an integral constant-expression.
9062 An overloaded operator can be used even if both operands are
9063 otherwise permissible in an integral constant-expression if at
9064 least one of the operands is of enumeration type. */
9068 NIC_OVERLOADED))
9070 }
9073 }
9075 static cp_expr
9080 {
9083 }
9085 /* Parse the `? expression : assignment-expression' part of a
9086 conditional-expression. The LOGICAL_OR_EXPR is the
9087 logical-or-expression that started the conditional-expression.
9088 Returns a representation of the entire conditional-expression.
9090 This routine is used by cp_parser_assignment_expression.
9092 ? expression : assignment-expression
9094 GNU Extensions:
9096 ? : assignment-expression */
9098 static tree
9100 {
9102 cp_expr assignment_expr;
9106 /* Consume the `?' token. */
9111 {
9114 /* Implicit true clause. */
9116 c_inhibit_evaluation_warnings +=
9119 }
9120 else
9121 {
9124 /* Parse the expression. */
9125 c_inhibit_evaluation_warnings +=
9128 c_inhibit_evaluation_warnings +=
9132 }
9134 /* The next token should be a `:'. */
9136 /* Parse the assignment-expression. */
9138 c_inhibit_evaluation_warnings -=
9141 /* Make a location:
9142 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9143 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9144 with the caret at the "?", ranging from the start of
9145 the logical_or_expr to the end of the assignment_expr. */
9150 /* Build the conditional-expression. */
9152 expr,
9153 assignment_expr,
9154 tf_warning_or_error);
9155 }
9157 /* Parse an assignment-expression.
9159 assignment-expression:
9160 conditional-expression
9161 logical-or-expression assignment-operator assignment_expression
9162 throw-expression
9164 CAST_P is true if this expression is the target of a cast.
9165 DECLTYPE_P is true if this expression is the operand of decltype.
9167 Returns a representation for the expression. */
9169 static cp_expr
9172 {
9173 cp_expr expr;
9175 /* If the next token is the `throw' keyword, then we're looking at
9176 a throw-expression. */
9179 /* Otherwise, it must be that we are looking at a
9180 logical-or-expression. */
9181 else
9182 {
9183 /* Parse the binary expressions (logical-or-expression). */
9185 decltype_p,
9187 /* If the next token is a `?' then we're actually looking at a
9188 conditional-expression. */
9191 else
9192 {
9195 /* If it's an assignment-operator, we're using the second
9196 production. */
9197 enum tree_code assignment_operator
9200 {
9203 /* Parse the right-hand side of the assignment. */
9210 /* An assignment may not appear in a
9211 constant-expression. */
9213 NIC_ASSIGNMENT))
9215 /* Build the assignment expression. Its default
9216 location:
9217 LHS = RHS
9218 ~~~~^~~~~
9219 is the location of the '=' token as the
9220 caret, ranging from the start of the lhs to the
9221 end of the rhs. */
9226 assignment_operator,
9227 rhs,
9229 /* TODO: build_x_modify_expr doesn't honor the location,
9230 so we must set it here. */
9232 }
9233 }
9234 }
9237 }
9239 /* Parse an (optional) assignment-operator.
9241 assignment-operator: one of
9242 = *= /= %= += -= >>= <<= &= ^= |=
9244 GNU Extension:
9246 assignment-operator: one of
9247 <?= >?=
9249 If the next token is an assignment operator, the corresponding tree
9250 code is returned, and the token is consumed. For example, for
9251 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9252 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9253 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9254 operator, ERROR_MARK is returned. */
9256 static enum tree_code
9258 {
9262 /* Peek at the next token. */
9266 {
9312 /* Nothing else is an assignment operator. */
9314 }
9316 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9321 /* If it was an assignment operator, consume it. */
9326 }
9328 /* Parse an expression.
9330 expression:
9331 assignment-expression
9332 expression , assignment-expression
9334 CAST_P is true if this expression is the target of a cast.
9335 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9336 except possibly parenthesized or on the RHS of a comma (N3276).
9338 Returns a representation of the expression. */
9340 static cp_expr
9343 {
9348 {
9349 cp_expr assignment_expression;
9351 /* Parse the next assignment-expression. */
9352 assignment_expression
9355 /* We don't create a temporary for a call that is the immediate operand
9356 of decltype or on the RHS of a comma. But when we see a comma, we
9357 need to create a temporary for a call on the LHS. */
9362 assignment_expression
9366 /* If this is the first assignment-expression, we can just
9367 save it away. */
9370 else
9371 {
9372 /* Create a location with caret at the comma, ranging
9373 from the start of the LHS to the end of the RHS. */
9378 assignment_expression,
9381 }
9382 /* If the next token is not a comma, or we're in a fold-expression, then
9383 we are done with the expression. */
9387 /* Consume the `,'. */
9390 /* A comma operator cannot appear in a constant-expression. */
9393 }
9396 }
9398 /* Parse a constant-expression.
9400 constant-expression:
9401 conditional-expression
9403 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9404 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9405 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9406 is false, NON_CONSTANT_P should be NULL. */
9408 static cp_expr
9412 {
9416 cp_expr expression;
9418 /* It might seem that we could simply parse the
9419 conditional-expression, and then check to see if it were
9420 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9421 one that the compiler can figure out is constant, possibly after
9422 doing some simplifications or optimizations. The standard has a
9423 precise definition of constant-expression, and we must honor
9424 that, even though it is somewhat more restrictive.
9426 For example:
9428 int i[(2, 3)];
9430 is not a legal declaration, because `(2, 3)' is not a
9431 constant-expression. The `,' operator is forbidden in a
9432 constant-expression. However, GCC's constant-folding machinery
9433 will fold this operation to an INTEGER_CST for `3'. */
9435 /* Save the old settings. */
9437 saved_allow_non_integral_constant_expression_p
9440 /* We are now parsing a constant-expression. */
9442 parser->allow_non_integral_constant_expression_p
9445 /* Although the grammar says "conditional-expression", we parse an
9446 "assignment-expression", which also permits "throw-expression"
9447 and the use of assignment operators. In the case that
9448 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9449 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9450 actually essential that we look for an assignment-expression.
9451 For example, cp_parser_initializer_clauses uses this function to
9452 determine whether a particular assignment-expression is in fact
9453 constant. */
9455 /* Restore the old settings. */
9456 parser->integral_constant_expression_p
9458 parser->allow_non_integral_constant_expression_p
9461 {
9462 /* Require an rvalue constant expression here; that's what our
9463 callers expect. Reference constant expressions are handled
9464 separately in e.g. cp_parser_template_argument. */
9469 }
9472 parser->non_integral_constant_expression_p
9476 }
9478 /* Parse __builtin_offsetof.
9480 offsetof-expression:
9481 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9483 offsetof-member-designator:
9484 id-expression
9485 | offsetof-member-designator "." id-expression
9486 | offsetof-member-designator "[" expression "]"
9487 | offsetof-member-designator "->" id-expression */
9489 static cp_expr
9491 {
9493 tree type;
9494 cp_expr expr;
9495 cp_id_kind dummy;
9497 location_t finish_loc;
9499 /* We're about to accept non-integral-constant things, but will
9500 definitely yield an integral constant expression. Save and
9501 restore these values around our local parsing. */
9507 /* Consume the "__builtin_offsetof" token. */
9509 /* Consume the opening `('. */
9511 /* Parse the type-id. */
9514 /* Look for the `,'. */
9518 /* Build the (type *)null that begins the traditional offsetof macro. */
9519 tree object_ptr
9521 tf_warning_or_error);
9523 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9527 {
9530 {
9532 /* offsetof-member-designator "[" expression "]" */
9538 /* offsetof-member-designator "->" identifier */
9541 /* FALLTHRU */
9544 /* offsetof-member-designator "." identifier */
9552 /* Consume the ")" token. */
9558 /* Error. We know the following require will fail, but
9559 that gives the proper error message. */
9564 }
9565 }
9567 success:
9568 /* Make a location of the form:
9569 __builtin_offsetof (struct s, f)
9570 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9571 with caret at the type-id, ranging from the start of the
9572 "_builtin_offsetof" token to the close paren. */
9574 /* The result will be an INTEGER_CST, so we need to explicitly
9575 preserve the location. */
9578 failure:
9583 }
9585 /* Parse a trait expression.
9587 Returns a representation of the expression, the underlying type
9588 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9590 static tree
9592 {
9593 cp_trait_kind kind;
9599 {
9701 }
9703 /* Consume the token. */
9708 {
9711 }
9717 {
9720 {
9723 }
9727 }
9729 {
9731 {
9735 {
9738 }
9742 }
9743 }
9747 /* Complete the trait expression, which may mean either processing
9748 the trait expr now or saving it for template instantiation. */
9750 {
9759 }
9760 }
9762 /* Lambdas that appear in variable initializer or default argument scope
9763 get that in their mangling, so we need to record it. We might as well
9764 use the count for function and namespace scopes as well. */
9768 {
9769 tree t;
9771 };
9774 static void
9776 {
9777 tree_int ti;
9779 /* Once we're inside a function, we ignore other scopes and just push
9780 the function again so that popping works properly. */
9787 {
9788 /* Don't reset the count if we're still in the same function. */
9791 }
9792 }
9794 static void
9796 {
9799 }
9801 static void
9803 {
9806 {
9809 }
9811 }
9813 /* Parse a lambda expression.
9815 lambda-expression:
9816 lambda-introducer lambda-declarator [opt] compound-statement
9818 Returns a representation of the expression. */
9820 static cp_expr
9822 {
9824 tree type;
9832 {
9834 {
9838 }
9840 }
9842 {
9844 {
9847 }
9849 }
9851 /* We may be in the middle of deferred access check. Disable
9852 it now. */
9863 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9866 /* Now that we've started the type, add the capture fields for any
9867 explicit captures. */
9870 {
9871 /* Inside the class, surrounding template-parameter-lists do not apply. */
9872 unsigned int saved_num_template_parameter_lists
9876 bool fully_implicit_function_template_p
9880 bool auto_is_implicit_function_template_parm_p
9891 /* By virtue of defining a local class, a lambda expression has access to
9892 the private variables of enclosing classes. */
9900 {
9905 }
9907 {
9910 }
9912 /* The capture list was built up in reverse order; fix that now. */
9924 parser->fully_implicit_function_template_p
9928 parser->auto_is_implicit_function_template_parm_p
9930 }
9932 /* This field is only used during parsing of the lambda. */
9935 /* This lambda shouldn't have any proxies left at this point. */
9937 /* And now that we're done, push proxies for an enclosing lambda. */
9942 else
9950 }
9952 /* Parse the beginning of a lambda expression.
9954 lambda-introducer:
9955 [ lambda-capture [opt] ]
9957 LAMBDA_EXPR is the current representation of the lambda expression. */
9959 static void
9961 {
9962 /* Need commas after the first capture. */
9965 /* Eat the leading `['. */
9968 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9976 {
9979 }
9982 {
9984 tree capture_id;
9985 tree capture_init_expr;
9989 enum capture_kind_type
9990 {
9991 BY_COPY,
9992 BY_REFERENCE
9993 };
9997 {
10000 }
10004 else
10007 /* Possibly capture `this'. */
10009 {
10019 explicit_init_p);
10021 }
10023 /* Possibly capture `*this'. */
10026 {
10037 explicit_init_p);
10039 }
10041 /* Remember whether we want to capture as a reference or not. */
10043 {
10046 }
10048 /* Get the identifier. */
10053 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10054 delimiters, but I modified this to stop on unnested ']' as well. It
10055 was already changed to stop on unnested '}', so the
10056 "closing_parenthesis" name is no more misleading with my change. */
10057 {
10063 }
10065 /* Find the initializer for this capture. */
10069 {
10071 /* An explicit initializer exists. */
10074 "lambda capture initializers "
10080 {
10083 }
10084 }
10085 else
10086 {
10089 /* Turn the identifier into an id-expression. */
10090 capture_init_expr
10095 {
10098 }
10102 {
10105 capture_init_expr);
10109 }
10112 {
10115 capture_init_expr))
10119 }
10121 capture_init_expr
10122 = finish_id_expression
10124 capture_init_expr,
10138 {
10141 }
10142 else
10144 }
10148 {
10153 capture_id);
10157 "capture of %qD redundant with by-reference capture "
10159 }
10162 capture_id,
10163 capture_init_expr,
10165 explicit_init_p);
10166 }
10169 }
10171 /* Parse the (optional) middle of a lambda expression.
10173 lambda-declarator:
10174 < template-parameter-list [opt] >
10175 ( parameter-declaration-clause [opt] )
10176 attribute-specifier [opt]
10177 decl-specifier-seq [opt]
10178 exception-specification [opt]
10179 lambda-return-type-clause [opt]
10181 LAMBDA_EXPR is the current representation of the lambda expression. */
10183 static bool
10185 {
10186 /* 5.1.1.4 of the standard says:
10187 If a lambda-expression does not include a lambda-declarator, it is as if
10188 the lambda-declarator were ().
10189 This means an empty parameter list, no attributes, and no exception
10190 specification. */
10196 cp_decl_specifier_seq lambda_specs;
10199 /* The template-parameter-list is optional, but must begin with
10200 an opening angle if present. */
10202 {
10205 "lambda templates are only available with "
10207 else
10217 /* We just processed one more parameter list. */
10219 }
10221 /* The parameter-declaration-clause is optional (unless
10222 template-parameter-list was given), but must begin with an
10223 opening parenthesis if present. */
10225 {
10230 /* Parse parameters. */
10233 /* Default arguments shall not be specified in the
10234 parameter-declaration-clause of a lambda-declarator. */
10245 /* In the decl-specifier-seq of the lambda-declarator, each
10246 decl-specifier shall either be mutable or constexpr. */
10250 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10253 {
10258 }
10262 /* Parse optional exception specification. */
10265 /* Parse optional trailing return type. */
10267 {
10271 }
10273 /* The function parameters must be in scope all the way until after the
10274 trailing-return-type in case of decltype. */
10276 }
10280 /* Create the function call operator.
10282 Messing with declarators like this is no uglier than building up the
10283 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10284 other code. */
10285 {
10286 cp_decl_specifier_seq return_type_specs;
10288 tree fco;
10295 else
10296 /* Maybe we will deduce the return type later. */
10300 {
10304 else
10307 }
10312 sfk_none);
10317 VIRT_SPEC_UNSPECIFIED,
10318 REF_QUAL_NONE,
10319 tx_qual,
10320 exception_spec,
10326 declarator,
10327 attributes);
10329 {
10332 /* Give the object parameter a different name. */
10336 }
10338 {
10342 }
10351 }
10352 }
10354 /* Parse the body of a lambda expression, which is simply
10356 compound-statement
10358 but which requires special handling.
10359 LAMBDA_EXPR is the current representation of the lambda expression. */
10361 static void
10363 {
10368 else
10369 /* Still increment function_depth so that we don't GC in the
10370 middle of an expression. */
10374 /* Clear this in case we're in the middle of a default argument. */
10377 /* Finish the function call operator
10378 - class_specifier
10379 + late_parsing_for_member
10380 + function_definition_after_declarator
10381 + ctor_initializer_opt_and_function_body */
10382 {
10384 tree body;
10386 tree compound_stmt;
10387 tree cap;
10389 /* Let the front end know that we are going to be defining this
10390 function. */
10392 NULL_TREE,
10401 /* Push the proxies for any explicit captures. */
10408 /* 5.1.1.4 of the standard says:
10409 If a lambda-expression does not include a trailing-return-type, it
10410 is as if the trailing-return-type denotes the following type:
10411 * if the compound-statement is of the form
10412 { return attribute-specifier [opt] expression ; }
10413 the type of the returned expression after lvalue-to-rvalue
10414 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10415 (_conv.array_ 4.2), and function-to-pointer conversion
10416 (_conv.func_ 4.3);
10417 * otherwise, void. */
10419 /* In a lambda that has neither a lambda-return-type-clause
10420 nor a deducible form, errors should be reported for return statements
10421 in the body. Since we used void as the placeholder return type, parsing
10422 the body as usual will give such desired behavior. */
10426 {
10430 /* Parse tentatively in case there's more after the initial return
10431 statement. */
10442 {
10444 {
10449 }
10451 /* Will get error here if type not deduced yet. */
10455 }
10456 }
10459 {
10464 }
10468 out:
10472 /* Finish the function and generate code for it if necessary. */
10475 /* Only expand if the call op is not a template. */
10478 }
10484 else
10486 }
10488 /* Statements [gram.stmt.stmt] */
10490 /* Parse a statement.
10492 statement:
10493 labeled-statement
10494 expression-statement
10495 compound-statement
10496 selection-statement
10497 iteration-statement
10498 jump-statement
10499 declaration-statement
10500 try-block
10502 C++11:
10504 statement:
10505 labeled-statement
10506 attribute-specifier-seq (opt) expression-statement
10507 attribute-specifier-seq (opt) compound-statement
10508 attribute-specifier-seq (opt) selection-statement
10509 attribute-specifier-seq (opt) iteration-statement
10510 attribute-specifier-seq (opt) jump-statement
10511 declaration-statement
10512 attribute-specifier-seq (opt) try-block
10514 init-statement:
10515 expression-statement
10516 simple-declaration
10518 TM Extension:
10520 statement:
10521 atomic-statement
10523 IN_COMPOUND is true when the statement is nested inside a
10524 cp_parser_compound_statement; this matters for certain pragmas.
10526 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10527 is a (possibly labeled) if statement which is not enclosed in braces
10528 and has an else clause. This is used to implement -Wparentheses.
10530 CHAIN is a vector of if-else-if conditions. */
10532 static void
10535 {
10540 restart:
10543 /* There is no statement yet. */
10549 /* In obj-c++, seeing '[[' might be the either the beginning of
10550 c++11 attributes, or a nested objc-message-expression. So
10551 let's parse the c++11 attributes tentatively. */
10555 {
10558 }
10560 /* Peek at the next token. */
10562 /* Remember the location of the first token in the statement. */
10564 /* If this is a keyword, then that will often determine what kind of
10565 statement we have. */
10567 {
10571 {
10574 /* Looks like a labeled-statement with a case label.
10575 Parse the label, and then use tail recursion to parse
10576 the statement. */
10594 {
10599 }
10600 else
10614 {
10619 }
10620 else
10621 {
10625 }
10629 /* Objective-C++ exception-handling constructs. */
10643 /* This must be a namespace alias definition. */
10659 /* It might be a keyword like `int' that can start a
10660 declaration-statement. */
10662 }
10663 }
10665 {
10666 /* If the next token is a `:', then we are looking at a
10667 labeled-statement. */
10670 {
10671 /* Looks like a labeled-statement with an ordinary label.
10672 Parse the label, and then use tail recursion to parse
10673 the statement. */
10678 }
10679 }
10680 /* Anything that starts with a `{' must be a compound-statement. */
10683 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10684 a statement all its own. */
10686 {
10687 /* Only certain OpenMP pragmas are attached to statements, and thus
10688 are considered statements themselves. All others are not. In
10689 the context of a compound, accept the pragma as a "statement" and
10690 return so that we can check for a close brace. Otherwise we
10691 require a real statement and must go back and read one. */
10697 }
10699 {
10702 }
10704 /* Everything else must be a declaration-statement or an
10705 expression-statement. Try for the declaration-statement
10706 first, unless we are looking at a `;', in which case we know that
10707 we have an expression-statement. */
10709 {
10711 {
10713 {
10714 /* Attributes should be parsed as part of the the
10715 declaration, so let's un-parse them. */
10718 }
10721 /* Try to parse the declaration-statement. */
10723 /* If that worked, we're done. */
10726 }
10727 /* Look for an expression-statement instead. */
10730 /* Handle [[fallthrough]];. */
10732 {
10733 /* The next token after the fallthrough attribute is ';'. */
10735 {
10736 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10738 IFN_FALLTHROUGH,
10741 }
10742 else
10746 }
10747 }
10749 /* Set the line number for the statement. */
10753 /* Allow "[[fallthrough]];", but warn otherwise. */
10756 OPT_Wattributes,
10758 }
10760 /* Parse the label for a labeled-statement, i.e.
10762 identifier :
10763 case constant-expression :
10764 default :
10766 GNU Extension:
10767 case constant-expression ... constant-expression : statement
10769 When a label is parsed without errors, the label is added to the
10770 parse tree by the finish_* functions, so this function doesn't
10771 have to return the label. */
10773 static void
10775 {
10780 /* The next token should be an identifier. */
10784 {
10787 }
10789 /* Remember whether this case or a user-defined label is allowed to fall
10790 through to. */
10795 {
10797 {
10801 /* Consume the `case' token. */
10803 /* Parse the constant-expression. */
10810 {
10811 /* Consume the `...' token. */
10817 /* We don't need to emit warnings here, as the common code
10818 will do this for us. */
10819 }
10820 else
10824 {
10828 }
10829 else
10832 expr);
10833 }
10837 /* Consume the `default' token. */
10841 {
10845 }
10846 else
10851 /* Anything else must be an ordinary label. */
10856 }
10858 /* Require the `:' token. */
10861 /* An ordinary label may optionally be followed by attributes.
10862 However, this is only permitted if the attributes are then
10863 followed by a semicolon. This is because, for backward
10864 compatibility, when parsing
10865 lab: __attribute__ ((unused)) int i;
10866 we want the attribute to attach to "i", not "lab". */
10869 {
10870 tree attrs;
10877 ;
10878 else
10880 }
10886 }
10888 /* Parse an expression-statement.
10890 expression-statement:
10891 expression [opt] ;
10893 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10894 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10895 indicates whether this expression-statement is part of an
10896 expression statement. */
10898 static tree
10900 {
10905 /* There might be attribute fallthrough. */
10908 /* If the next token is a ';', then there is no expression
10909 statement. */
10911 {
10915 {
10918 }
10919 }
10921 /* Handle [[fallthrough]];. */
10923 {
10924 /* The next token after the fallthrough attribute is ';'. */
10926 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10929 else
10933 }
10935 /* Allow "[[fallthrough]];", but warn otherwise. */
10940 /* Give a helpful message for "A<T>::type t;" and the like. */
10943 {
10950 {
10951 /* A::A a; */
10956 }
10957 }
10959 /* Consume the final `;'. */
10964 /* This is the final expression statement of a statement
10965 expression. */
10971 }
10973 /* Parse a compound-statement.
10975 compound-statement:
10976 { statement-seq [opt] }
10978 GNU extension:
10980 compound-statement:
10981 { label-declaration-seq [opt] statement-seq [opt] }
10983 label-declaration-seq:
10984 label-declaration
10985 label-declaration-seq label-declaration
10987 Returns a tree representing the statement. */
10989 static tree
10992 {
10993 tree compound_stmt;
10995 /* Consume the `{'. */
11002 /* Begin the compound-statement. */
11004 /* If the next keyword is `__label__' we have a label declaration. */
11007 /* Parse an (optional) statement-seq. */
11009 /* Finish the compound-statement. */
11011 /* Consume the `}'. */
11015 }
11017 /* Parse an (optional) statement-seq.
11019 statement-seq:
11020 statement
11021 statement-seq [opt] statement */
11023 static void
11025 {
11026 /* Scan statements until there aren't any more. */
11028 {
11031 /* If we are looking at a `}', then we have run out of
11032 statements; the same is true if we have reached the end
11033 of file, or have stumbled upon a stray '@end'. */
11040 /* If we are in a compound statement and find 'else' then
11041 something went wrong. */
11043 {
11046 else
11047 {
11050 }
11051 }
11053 /* Parse the statement. */
11055 }
11056 }
11058 /* Return true if we're looking at (init; cond), false otherwise. */
11060 static bool
11062 {
11063 /* Save tokens so that we can put them back. */
11066 /* Look for ';' that is not nested in () or {}. */
11069 CPP_SEMICOLON,
11072 /* Roll back the tokens we skipped. */
11076 }
11078 /* Parse a selection-statement.
11080 selection-statement:
11081 if ( init-statement [opt] condition ) statement
11082 if ( init-statement [opt] condition ) statement else statement
11083 switch ( init-statement [opt] condition ) statement
11085 Returns the new IF_STMT or SWITCH_STMT.
11087 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11088 is a (possibly labeled) if statement which is not enclosed in
11089 braces and has an else clause. This is used to implement
11090 -Wparentheses.
11092 CHAIN is a vector of if-else-if conditions. This is used to implement
11093 -Wduplicated-cond. */
11095 static tree
11098 {
11101 token_indent_info guard_tinfo;
11106 /* Peek at the next token. */
11110 /* See what kind of keyword it is. */
11113 {
11116 {
11117 tree statement;
11118 tree condition;
11123 RID_CONSTEXPR))
11124 {
11130 }
11132 /* Look for the `('. */
11134 {
11137 }
11139 /* Begin the selection-statement. */
11141 {
11144 }
11145 else
11148 /* Parse the optional init-statement. */
11150 {
11151 tree decl;
11154 "init-statement in selection statements only available "
11157 }
11159 /* Parse the condition. */
11161 /* Look for the `)'. */
11167 {
11171 /* Add the condition. */
11178 /* Parse the then-clause. */
11182 /* Outside a template, the non-selected branch of a constexpr
11183 if is a 'discarded statement', i.e. unevaluated. */
11188 {
11191 }
11194 guard_tinfo);
11201 {
11205 }
11207 /* If the next token is `else', parse the else-clause. */
11209 RID_ELSE))
11210 {
11214 {
11217 }
11219 guard_tinfo
11221 /* Consume the `else' keyword. */
11224 {
11226 RID_IF)
11228 {
11229 /* We've got "if (COND) else if (COND2)". Start
11230 the condition chain and add COND as the first
11231 element. */
11235 {
11236 /* Wrap it in a NOP_EXPR so that we can set the
11237 location of the condition. */
11239 condition);
11242 }
11243 }
11245 RID_IF))
11246 {
11247 /* This is if-else without subsequent if. Zap the
11248 condition chain; we would have already warned at
11249 this point. */
11252 }
11253 }
11255 /* Parse the else-clause. */
11261 /* If we are currently parsing a then-clause, then
11262 IF_P will not be NULL. We set it to true to
11263 indicate that this if statement has an else clause.
11264 This may trigger the Wparentheses warning below
11265 when we get back up to the parent if statement. */
11270 {
11274 }
11275 }
11276 else
11277 {
11278 /* This if statement does not have an else clause. If
11279 NESTED_IF is true, then the then-clause has an if
11280 statement which does have an else clause. We warn
11281 about the potential ambiguity. */
11284 "suggest explicit braces to avoid ambiguous"
11287 {
11288 /* We don't need the condition chain anymore. */
11291 }
11292 }
11294 /* Now we're all done with the if-statement. */
11296 }
11297 else
11298 {
11302 /* Add the condition. */
11305 /* Parse the body of the switch-statement. */
11311 guard_tinfo);
11315 /* Now we're all done with the switch-statement. */
11317 }
11320 }
11326 }
11327 }
11329 /* Parse a condition.
11331 condition:
11332 expression
11333 type-specifier-seq declarator = initializer-clause
11334 type-specifier-seq declarator braced-init-list
11336 GNU Extension:
11338 condition:
11339 type-specifier-seq declarator asm-specification [opt]
11340 attributes [opt] = assignment-expression
11342 Returns the expression that should be tested. */
11344 static tree
11346 {
11347 cp_decl_specifier_seq type_specifiers;
11351 /* Try the declaration first. */
11353 /* New types are not allowed in the type-specifier-seq for a
11354 condition. */
11356 parser->type_definition_forbidden_message
11358 /* Parse the type-specifier-seq. */
11360 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11363 /* Restore the saved message. */
11365 /* If all is well, we might be looking at a declaration. */
11367 {
11368 tree decl;
11369 tree asm_specification;
11370 tree attributes;
11374 /* Parse the declarator. */
11380 /* Parse the attributes. */
11382 /* Parse the asm-specification. */
11384 /* If the next token is not an `=' or '{', then we might still be
11385 looking at an expression. For example:
11387 if (A(a).x)
11389 looks like a decl-specifier-seq and a declarator -- but then
11390 there is no `=', so this is an expression. */
11395 /* If we did see an `=' or '{', then we are looking at a declaration
11396 for sure. */
11398 {
11399 tree pushed_scope;
11403 /* Create the declaration. */
11409 /* Parse the initializer. */
11411 {
11415 }
11416 else
11417 {
11418 /* Consume the `='. */
11421 }
11425 /* Process the initializer. */
11428 asm_specification,
11429 flags);
11435 }
11436 }
11437 /* If we didn't even get past the declarator successfully, we are
11438 definitely not looking at a declaration. */
11439 else
11442 /* Otherwise, we are looking at an expression. */
11444 }
11446 /* Parses a for-statement or range-for-statement until the closing ')',
11447 not included. */
11449 static tree
11451 {
11455 /* Begin the for-statement. */
11458 /* Parse the initialization. */
11463 else
11465 }
11467 static tree
11469 {
11470 /* Normal for loop */
11473 tree stmt;
11476 /* The init-statement has already been parsed in
11477 cp_parser_init_statement, so no work is needed here. */
11480 /* If there's a condition, process it. */
11484 {
11488 }
11490 /* Look for the `;'. */
11493 /* If there's an expression, process it. */
11499 }
11501 /* Tries to parse a range-based for-statement:
11503 range-based-for:
11504 decl-specifier-seq declarator : expression
11506 The decl-specifier-seq declarator and the `:' are already parsed by
11507 cp_parser_init_statement. If processing_template_decl it returns a
11508 newly created RANGE_FOR_STMT; if not, it is converted to a
11509 regular FOR_STMT. */
11511 static tree
11514 {
11521 /* Get the range declaration momentarily out of the way so that
11522 the range expression doesn't clash with it. */
11524 {
11526 {
11528 /* For decomposition declaration get all of the corresponding
11529 declarations out of the way. */
11533 {
11539 {
11545 }
11546 }
11547 }
11549 {
11554 }
11555 }
11558 {
11561 }
11562 else
11565 /* Put the range declaration(s) back into scope. */
11567 {
11571 }
11573 /* If in template, STMT is converted to a normal for-statement
11574 at instantiation. If not, it is done just ahead. */
11576 {
11584 /* do_auto_deduction doesn't mess with template init-lists. */
11587 }
11588 else
11589 {
11593 }
11595 }
11597 /* Subroutine of cp_convert_range_for: given the initializer expression,
11598 builds up the range temporary. */
11600 static tree
11602 {
11605 /* Find out the type deduced by the declaration
11606 `auto &&__range = range_expr'. */
11611 /* Create the __range variable. */
11618 }
11620 /* Used by cp_parser_range_for in template context: we aren't going to
11621 do a full conversion yet, but we still need to resolve auto in the
11622 type of the for-range-declaration if present. This is basically
11623 a shortcut version of cp_convert_range_for. */
11625 static void
11627 {
11630 {
11633 iter_type = (cp_parser_perform_range_for_lookup
11636 {
11638 iter_type);
11640 tf_warning_or_error);
11643 }
11644 }
11645 }
11647 /* Converts a range-based for-statement into a normal
11648 for-statement, as per the definition.
11650 for (RANGE_DECL : RANGE_EXPR)
11651 BLOCK
11653 should be equivalent to:
11655 {
11656 auto &&__range = RANGE_EXPR;
11657 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11658 __begin != __end;
11659 ++__begin)
11660 {
11661 RANGE_DECL = *__begin;
11662 BLOCK
11663 }
11664 }
11666 If RANGE_EXPR is an array:
11667 BEGIN_EXPR = __range
11668 END_EXPR = __range + ARRAY_SIZE(__range)
11669 Else if RANGE_EXPR has a member 'begin' or 'end':
11670 BEGIN_EXPR = __range.begin()
11671 END_EXPR = __range.end()
11672 Else:
11673 BEGIN_EXPR = begin(__range)
11674 END_EXPR = end(__range);
11676 If __range has a member 'begin' but not 'end', or vice versa, we must
11677 still use the second alternative (it will surely fail, however).
11678 When calling begin()/end() in the third alternative we must use
11679 argument dependent lookup, but always considering 'std' as an associated
11680 namespace. */
11682 tree
11686 {
11692 /* If an error happened previously do nothing or else a lot of
11693 unhelpful errors would be issued. */
11695 else
11696 {
11697 tree range_temp;
11701 /* Can't bind a reference to an array of runtime bound. */
11703 else
11704 {
11709 LOOKUP_ONLYCONVERTING);
11711 }
11714 }
11716 /* The new for initialization statement. */
11724 LOOKUP_ONLYCONVERTING);
11735 LOOKUP_ONLYCONVERTING);
11739 /* The new for condition. */
11746 /* The new increment expression. */
11749 tf_warning_or_error);
11752 /* The declaration is initialized with *__begin inside the loop body. */
11755 tf_warning_or_error),
11757 LOOKUP_ONLYCONVERTING);
11762 }
11764 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11765 We need to solve both at the same time because the method used
11766 depends on the existence of members begin or end.
11767 Returns the type deduced for the iterator expression. */
11769 static tree
11771 {
11773 {
11776 }
11779 {
11784 }
11786 {
11787 /* If RANGE is an array, we will use pointer arithmetic. */
11790 range,
11794 }
11795 else
11796 {
11797 /* If it is not an array, we must do a bit of magic. */
11807 tf_warning_or_error);
11810 tf_warning_or_error);
11813 {
11814 /* Use the member functions. */
11817 else
11823 else
11826 }
11827 else
11828 {
11829 /* Use global functions with ADL. */
11836 tf_warning_or_error);
11838 tf_warning_or_error);
11840 tf_warning_or_error);
11842 tf_warning_or_error);
11845 }
11847 /* Last common checks. */
11849 {
11850 /* If one of the expressions is an error do no more checks. */
11853 }
11856 /* Can happen, when, eg, in a template context, Koenig lookup
11857 can't resolve begin/end (c++/58503). */
11859 else
11860 {
11862 /* The unqualified type of the __begin and __end temporaries should
11863 be the same, as required by the multiple auto declaration. */
11865 {
11872 /* P0184R0 allows __begin and __end to have different types,
11873 but make sure they are comparable so we can give a better
11875 else
11879 }
11881 }
11882 }
11883 }
11885 /* Helper function for cp_parser_perform_range_for_lookup.
11886 Builds a tree for RANGE.IDENTIFIER(). */
11888 static tree
11890 {
11903 tf_warning_or_error);
11906 }
11908 /* Parse an iteration-statement.
11910 iteration-statement:
11911 while ( condition ) statement
11912 do statement while ( expression ) ;
11913 for ( init-statement condition [opt] ; expression [opt] )
11914 statement
11916 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11918 static tree
11920 {
11923 tree statement;
11925 token_indent_info guard_tinfo;
11927 /* Peek at the next token. */
11934 /* Remember whether or not we are already within an iteration
11935 statement. */
11938 /* See what kind of keyword it is. */
11941 {
11943 {
11944 tree condition;
11946 /* Begin the while-statement. */
11948 /* Look for the `('. */
11950 /* Parse the condition. */
11953 /* Look for the `)'. */
11955 /* Parse the dependent statement. */
11959 /* We're done with the while-statement. */
11961 }
11965 {
11966 tree expression;
11968 /* Begin the do-statement. */
11970 /* Parse the body of the do-statement. */
11975 /* Look for the `while' keyword. */
11977 /* Look for the `('. */
11979 /* Parse the expression. */
11981 /* We're done with the do-statement. */
11983 /* Look for the `)'. */
11985 /* Look for the `;'. */
11987 }
11991 {
11992 /* Look for the `('. */
11997 /* Look for the `)'. */
12000 /* Parse the body of the for-statement. */
12005 /* We're done with the for-statement. */
12007 }
12014 }
12017 }
12019 /* Parse a init-statement or the declarator of a range-based-for.
12020 Returns true if a range-based-for declaration is seen.
12022 init-statement:
12023 expression-statement
12024 simple-declaration */
12026 static bool
12028 {
12029 /* If the next token is a `;', then we have an empty
12030 expression-statement. Grammatically, this is also a
12031 simple-declaration, but an invalid one, because it does not
12032 declare anything. Therefore, if we did not handle this case
12033 specially, we would issue an error message about an invalid
12034 declaration. */
12036 {
12040 /* A colon is used in range-based for. */
12043 /* We're going to speculatively look for a declaration, falling back
12044 to an expression, if necessary. */
12046 /* Parse the declaration. */
12049 decl);
12052 {
12053 /* It is a range-for, consume the ':' */
12057 {
12059 "range-based %<for%> loops only available with "
12062 }
12063 }
12064 else
12065 /* The ';' is not consumed yet because we told
12066 cp_parser_simple_declaration not to. */
12071 /* If the tentative parse failed, then we shall need to look for an
12072 expression-statement. */
12073 }
12074 /* If we are here, it is an expression-statement. */
12077 }
12079 /* Parse a jump-statement.
12081 jump-statement:
12082 break ;
12083 continue ;
12084 return expression [opt] ;
12085 return braced-init-list ;
12086 goto identifier ;
12088 GNU extension:
12090 jump-statement:
12091 goto * expression ;
12093 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12095 static tree
12097 {
12103 /* Peek at the next token. */
12108 /* See what kind of keyword it is. */
12111 {
12115 {
12135 }
12141 {
12148 /* Fall through. */
12158 }
12163 {
12164 tree expr;
12168 {
12172 }
12175 else
12176 /* If the next token is a `;', then there is no
12177 expression. */
12179 /* Build the return-statement. */
12182 else
12184 /* Look for the final `;'. */
12186 }
12192 {
12195 }
12197 /* Create the goto-statement. */
12199 {
12200 /* Issue a warning about this use of a GNU extension. */
12202 /* Consume the '*' token. */
12204 /* Parse the dependent expression. */
12206 }
12207 else
12209 /* Look for the final `;'. */
12216 }
12219 }
12221 /* Parse a declaration-statement.
12223 declaration-statement:
12224 block-declaration */
12226 static void
12228 {
12231 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12234 /* Parse the block-declaration. */
12237 /* Free any declarators allocated. */
12239 }
12241 /* Some dependent statements (like `if (cond) statement'), are
12242 implicitly in their own scope. In other words, if the statement is
12243 a single statement (as opposed to a compound-statement), it is
12244 none-the-less treated as if it were enclosed in braces. Any
12245 declarations appearing in the dependent statement are out of scope
12246 after control passes that point. This function parses a statement,
12247 but ensures that is in its own scope, even if it is not a
12248 compound-statement.
12250 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12251 is a (possibly labeled) if statement which is not enclosed in
12252 braces and has an else clause. This is used to implement
12253 -Wparentheses.
12255 CHAIN is a vector of if-else-if conditions. This is used to implement
12256 -Wduplicated-cond.
12258 Returns the new statement. */
12260 static tree
12264 {
12265 tree statement;
12267 token_indent_info body_tinfo
12273 /* Mark if () ; with a special NOP_EXPR. */
12275 {
12286 }
12287 /* if a compound is opened, we simply parse the statement directly. */
12290 /* If the token is not a `{', then we must take special action. */
12291 else
12292 {
12293 /* Create a compound-statement. */
12295 /* Parse the dependent-statement. */
12297 /* Finish the dummy compound-statement. */
12299 }
12301 token_indent_info next_tinfo
12305 /* Return the statement. */
12307 }
12309 /* For some dependent statements (like `while (cond) statement'), we
12310 have already created a scope. Therefore, even if the dependent
12311 statement is a compound-statement, we do not want to create another
12312 scope. */
12314 static void
12317 {
12318 /* If the token is a `{', then we must take special action. */
12320 {
12321 token_indent_info body_tinfo
12325 token_indent_info next_tinfo
12328 }
12329 else
12330 {
12331 /* Avoid calling cp_parser_compound_statement, so that we
12332 don't create a new scope. Do everything else by hand. */
12334 /* If the next keyword is `__label__' we have a label declaration. */
12337 /* Parse an (optional) statement-seq. */
12340 }
12341 }
12343 /* Declarations [gram.dcl.dcl] */
12345 /* Parse an optional declaration-sequence.
12347 declaration-seq:
12348 declaration
12349 declaration-seq declaration */
12351 static void
12353 {
12355 {
12366 {
12367 /* A declaration consisting of a single semicolon is
12368 invalid. Allow it unless we're being pedantic. */
12373 }
12375 /* If we're entering or exiting a region that's implicitly
12376 extern "C", modify the lang context appropriately. */
12378 {
12381 }
12383 {
12386 }
12389 {
12390 /* A top-level declaration can consist solely of a #pragma.
12391 A nested declaration cannot, so this is done here and not
12392 in cp_parser_declaration. (A #pragma at block scope is
12393 handled in cp_parser_statement.) */
12396 }
12398 /* Parse the declaration itself. */
12400 }
12401 }
12403 /* Parse a declaration.
12405 declaration:
12406 block-declaration
12407 function-definition
12408 template-declaration
12409 explicit-instantiation
12410 explicit-specialization
12411 linkage-specification
12412 namespace-definition
12414 C++17:
12415 deduction-guide
12417 GNU extension:
12419 declaration:
12420 __extension__ declaration */
12422 static void
12424 {
12425 cp_token token1;
12426 cp_token token2;
12431 /* Check for the `__extension__' keyword. */
12433 {
12434 /* Parse the qualified declaration. */
12436 /* Restore the PEDANTIC flag. */
12440 }
12442 /* Try to figure out what kind of declaration is present. */
12447 else
12448 {
12451 }
12453 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12456 /* If the next token is `extern' and the following token is a string
12457 literal, then we have a linkage specification. */
12461 /* If the next token is `template', then we have either a template
12462 declaration, an explicit instantiation, or an explicit
12463 specialization. */
12465 {
12466 /* `template <>' indicates a template specialization. */
12470 /* `template <' indicates a template declaration. */
12473 /* Anything else must be an explicit instantiation. */
12474 else
12476 }
12477 /* If the next token is `export', then we have a template
12478 declaration. */
12481 /* If the next token is `extern', 'static' or 'inline' and the one
12482 after that is `template', we have a GNU extended explicit
12483 instantiation directive. */
12490 /* If the next token is `namespace', check for a named or unnamed
12491 namespace definition. */
12500 /* An unnamed namespace definition. */
12504 /* An inline (associated) namespace definition. */
12508 /* Objective-C++ declaration/definition. */
12515 /* At this point we may have a template declared by a concept
12516 introduction. */
12521 else
12522 /* Try to parse a block-declaration, or a function-definition. */
12525 /* Free any declarators allocated. */
12527 }
12529 /* Parse a block-declaration.
12531 block-declaration:
12532 simple-declaration
12533 asm-definition
12534 namespace-alias-definition
12535 using-declaration
12536 using-directive
12538 GNU Extension:
12540 block-declaration:
12541 __extension__ block-declaration
12543 C++0x Extension:
12545 block-declaration:
12546 static_assert-declaration
12548 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12549 part of a declaration-statement. */
12551 static void
12554 {
12558 /* Check for the `__extension__' keyword. */
12560 {
12561 /* Parse the qualified declaration. */
12563 /* Restore the PEDANTIC flag. */
12567 }
12569 /* Peek at the next token to figure out which kind of declaration is
12570 present. */
12573 /* If the next keyword is `asm', we have an asm-definition. */
12575 {
12579 }
12580 /* If the next keyword is `namespace', we have a
12581 namespace-alias-definition. */
12584 /* If the next keyword is `using', we have a
12585 using-declaration, a using-directive, or an alias-declaration. */
12587 {
12592 /* If the token after `using' is `namespace', then we have a
12593 using-directive. */
12597 /* If the second token after 'using' is '=', then we have an
12598 alias-declaration. */
12604 /* Otherwise, it's a using-declaration. */
12605 else
12608 }
12609 /* If the next keyword is `__label__' we have a misplaced label
12610 declaration. */
12612 {
12616 /* If the next token is now a `;', consume it. */
12619 }
12620 /* If the next token is `static_assert' we have a static assertion. */
12623 /* Anything else must be a simple-declaration. */
12624 else
12627 }
12629 /* Parse a simple-declaration.
12631 simple-declaration:
12632 decl-specifier-seq [opt] init-declarator-list [opt] ;
12633 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12634 brace-or-equal-initializer ;
12636 init-declarator-list:
12637 init-declarator
12638 init-declarator-list , init-declarator
12640 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12641 function-definition as a simple-declaration.
12643 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12644 parsed declaration if it is an uninitialized single declarator not followed
12645 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12646 if present, will not be consumed. */
12648 static void
12652 {
12653 cp_decl_specifier_seq decl_specifiers;
12662 /* Defer access checks until we know what is being declared; the
12663 checks for names appearing in the decl-specifier-seq should be
12664 done as if we were in the scope of the thing being declared. */
12667 /* Parse the decl-specifier-seq. We have to keep track of whether
12668 or not the decl-specifier-seq declares a named class or
12669 enumeration type, since that is the only case in which the
12670 init-declarator-list is allowed to be empty.
12672 [dcl.dcl]
12674 In a simple-declaration, the optional init-declarator-list can be
12675 omitted only when declaring a class or enumeration, that is when
12676 the decl-specifier-seq contains either a class-specifier, an
12677 elaborated-type-specifier, or an enum-specifier. */
12679 CP_PARSER_FLAGS_OPTIONAL,
12682 /* We no longer need to defer access checks. */
12685 /* In a block scope, a valid declaration must always have a
12686 decl-specifier-seq. By not trying to parse declarators, we can
12687 resolve the declaration/expression ambiguity more quickly. */
12690 {
12693 }
12695 /* If the next two tokens are both identifiers, the code is
12696 erroneous. The usual cause of this situation is code like:
12698 T t;
12700 where "T" should name a type -- but does not. */
12703 {
12704 /* If parsing tentatively, we should commit; we really are
12705 looking at a declaration. */
12707 /* Give up. */
12709 }
12711 /* If we have seen at least one decl-specifier, and the next token
12712 is not a parenthesis, then we must be looking at a declaration.
12713 (After "int (" we might be looking at a functional cast.) */
12720 /* Look for C++17 decomposition declaration. */
12728 {
12729 tree decl
12731 maybe_range_for_decl,
12734 /* The next token should be either a `,' or a `;'. */
12736 /* If it's a `;', we are done. */
12739 /* Anything else is an error. */
12740 else
12741 {
12742 /* If we have already issued an error message we don't need
12743 to issue another one. */
12748 /* Skip tokens until we reach the end of the statement. */
12750 /* If the next token is now a `;', consume it. */
12754 }
12755 }
12756 else
12759 tree last_type;
12761 /* NULL_TREE if both variable and function declaration are allowed,
12762 error_mark_node if function declaration are not allowed and
12763 a FUNCTION_DECL that should be diagnosed if it is followed by
12764 variable declarations. */
12765 tree auto_function_declaration;
12768 auto_specifier_p
12772 /* Keep going until we hit the `;' at the end of the simple
12773 declaration. */
12776 CPP_SEMICOLON))
12777 {
12780 tree decl;
12784 {
12785 /* If we are processing next declarator, comma is expected */
12790 {
12794 }
12795 }
12796 else
12799 /* Parse the init-declarator. */
12802 function_definition_allowed_p,
12804 declares_class_or_enum,
12806 maybe_range_for_decl,
12809 /* If an error occurred while parsing tentatively, exit quickly.
12810 (That usually happens when in the body of a function; each
12811 statement is treated as a declaration-statement until proven
12812 otherwise.) */
12817 {
12818 /* If the init-declarator-list contains more than one
12819 init-declarator, they shall all form declarations of
12820 variables. */
12822 auto_function_declaration
12826 {
12828 "non-variable %qD in declaration with more than one "
12833 }
12834 }
12838 {
12842 {
12843 /* If the list of declarators contains more than one declarator,
12844 the type of each declared variable is determined as described
12845 above. If the type deduced for the template parameter U is not
12846 the same in each deduction, the program is ill-formed. */
12851 }
12852 else
12854 }
12856 /* Handle function definitions specially. */
12858 {
12859 /* If the next token is a `,', then we are probably
12860 processing something like:
12862 void f() {}, *p;
12864 which is erroneous. */
12866 {
12869 "mixing"
12871 }
12872 /* Otherwise, we're done with the list of declarators. */
12873 else
12874 {
12877 }
12878 }
12881 /* The next token should be either a `,' or a `;'. */
12883 /* If it's a `,', there are more declarators to come. */
12886 /* If it's a `;', we are done. */
12890 {
12895 }
12896 /* Anything else is an error. */
12897 else
12898 {
12899 /* If we have already issued an error message we don't need
12900 to issue another one. */
12905 /* Skip tokens until we reach the end of the statement. */
12907 /* If the next token is now a `;', consume it. */
12911 }
12912 /* After the first time around, a function-definition is not
12913 allowed -- even if it was OK at first. For example:
12915 int i, f() {}
12917 is not valid. */
12919 }
12921 /* Issue an error message if no declarators are present, and the
12922 decl-specifier-seq does not itself declare a class or
12923 enumeration: [dcl.dcl]/3. */
12925 {
12927 {
12931 /* Ensure an error is issued anyway when finish_decltype_type,
12932 called via cp_parser_decl_specifier_seq, returns a class or
12933 an enumeration (c++/51786). */
12936 }
12937 /* Perform any deferred access checks. */
12939 }
12941 /* Consume the `;'. */
12942 finish:
12946 {
12952 }
12954 done:
12956 }
12958 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
12959 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12960 initializer ; */
12962 static tree
12967 {
12972 /* Parse the identifier-list. */
12976 {
12984 }
12988 {
12994 else
12995 {
12998 }
12999 }
13005 tree pushed_scope;
13012 NULL_TREE);
13019 cp_expr e;
13020 cp_decl_specifier_seq decl_specs;
13025 {
13028 else
13031 tree elt_pushed_scope;
13037 {
13038 /* Ensure we've diagnosed redeclaration if we aren't creating
13039 a new VAR_DECL. */
13042 }
13043 else
13047 }
13050 {
13053 }
13057 {
13064 {
13068 }
13069 }
13071 {
13073 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13074 the underlying DECL. */
13076 }
13082 {
13085 }
13088 }
13090 /* Parse a decl-specifier-seq.
13092 decl-specifier-seq:
13093 decl-specifier-seq [opt] decl-specifier
13094 decl-specifier attribute-specifier-seq [opt] (C++11)
13096 decl-specifier:
13097 storage-class-specifier
13098 type-specifier
13099 function-specifier
13100 friend
13101 typedef
13103 GNU Extension:
13105 decl-specifier:
13106 attributes
13108 Concepts Extension:
13110 decl-specifier:
13111 concept
13113 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13115 The parser flags FLAGS is used to control type-specifier parsing.
13117 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13118 flags:
13120 1: one of the decl-specifiers is an elaborated-type-specifier
13121 (i.e., a type declaration)
13122 2: one of the decl-specifiers is an enum-specifier or a
13123 class-specifier (i.e., a type definition)
13125 */
13127 static void
13129 cp_parser_flags flags,
13132 {
13136 cp_decl_spec ds;
13138 /* Clear DECL_SPECS. */
13141 /* Assume no class or enumeration type is declared. */
13144 /* Keep reading specifiers until there are no more to read. */
13146 {
13151 /* Peek at the next token. */
13154 /* Save the first token of the decl spec list for error
13155 reporting. */
13158 /* Handle attributes. */
13160 {
13161 /* Parse the attributes. */
13164 /* In a sequence of declaration specifiers, c++11 attributes
13165 appertain to the type that precede them. In that case
13166 [dcl.spec]/1 says:
13168 The attribute-specifier-seq affects the type only for
13169 the declaration it appears in, not other declarations
13170 involving the same type.
13172 But for now let's force the user to position the
13173 attribute either at the beginning of the declaration or
13174 after the declarator-id, which would clearly mean that it
13175 applies to the declarator. */
13177 {
13179 /* The c++11 attribute is at the beginning of the
13180 declaration. It appertains to the entity being
13182 else
13183 {
13185 {
13186 /* This is an attribute following a
13187 class-specifier. */
13192 }
13193 else
13194 {
13195 decl_specs->std_attributes
13197 attrs);
13200 }
13202 }
13203 }
13205 decl_specs->attributes
13207 attrs);
13211 }
13212 /* Assume we will find a decl-specifier keyword. */
13214 /* If the next token is an appropriate keyword, we can simply
13215 add it to the list. */
13217 {
13218 /* decl-specifier:
13219 friend
13220 constexpr */
13223 {
13226 }
13227 else
13228 {
13230 /* Consume the token. */
13232 }
13245 /* function-specifier:
13246 inline
13247 virtual
13248 explicit */
13255 /* decl-specifier:
13256 typedef */
13259 /* Consume the token. */
13261 /* A constructor declarator cannot appear in a typedef. */
13263 /* The "typedef" keyword can only occur in a declaration; we
13264 may as well commit at this point. */
13271 /* storage-class-specifier:
13272 auto
13273 register
13274 static
13275 extern
13276 mutable
13278 GNU Extension:
13279 thread */
13282 {
13283 /* Consume the token. */
13286 /* Complain about `auto' as a storage specifier, if
13287 we're complaining about C++0x compatibility. */
13291 /* Set the storage class anyway. */
13293 token);
13294 }
13295 else
13296 /* C++0x auto type-specifier. */
13304 /* Consume the token. */
13307 token);
13310 /* Consume the token. */
13316 /* We did not yet find a decl-specifier yet. */
13319 }
13336 /* Constructors are a special case. The `S' in `S()' is not a
13337 decl-specifier; it is the beginning of the declarator. */
13338 constructor_p
13339 = (!found_decl_spec
13340 && constructor_possible_p
13341 && (cp_parser_constructor_declarator_p
13344 /* If we don't have a DECL_SPEC yet, then we must be looking at
13345 a type-specifier. */
13347 {
13350 tree type_spec;
13352 type_spec
13354 decl_specs,
13360 /* If this type-specifier referenced a user-defined type
13361 (a typedef, class-name, etc.), then we can't allow any
13362 more such type-specifiers henceforth.
13364 [dcl.spec]
13366 The longest sequence of decl-specifiers that could
13367 possibly be a type name is taken as the
13368 decl-specifier-seq of a declaration. The sequence shall
13369 be self-consistent as described below.
13371 [dcl.type]
13373 As a general rule, at most one type-specifier is allowed
13374 in the complete decl-specifier-seq of a declaration. The
13375 only exceptions are the following:
13377 -- const or volatile can be combined with any other
13378 type-specifier.
13380 -- signed or unsigned can be combined with char, long,
13381 short, or int.
13383 -- ..
13385 Example:
13387 typedef char* Pc;
13388 void g (const int Pc);
13390 Here, Pc is *not* part of the decl-specifier seq; it's
13391 the declarator. Therefore, once we see a type-specifier
13392 (other than a cv-qualifier), we forbid any additional
13393 user-defined types. We *do* still allow things like `int
13394 int' to be considered a decl-specifier-seq, and issue the
13395 error message later. */
13398 /* A constructor declarator cannot follow a type-specifier. */
13400 {
13405 }
13406 }
13408 /* If we still do not have a DECL_SPEC, then there are no more
13409 decl-specifiers. */
13414 /* After we see one decl-specifier, further decl-specifiers are
13415 always optional. */
13417 }
13419 /* Don't allow a friend specifier with a class definition. */
13424 }
13426 /* Parse an (optional) storage-class-specifier.
13428 storage-class-specifier:
13429 auto
13430 register
13431 static
13432 extern
13433 mutable
13435 GNU Extension:
13437 storage-class-specifier:
13438 thread
13440 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13442 static tree
13444 {
13446 {
13450 /* Fall through for C++98. */
13458 /* Consume the token. */
13463 }
13464 }
13466 /* Parse an (optional) function-specifier.
13468 function-specifier:
13469 inline
13470 virtual
13471 explicit
13473 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13474 Updates DECL_SPECS, if it is non-NULL. */
13476 static tree
13479 {
13482 {
13488 /* 14.5.2.3 [temp.mem]
13490 A member function template shall not be virtual. */
13494 else
13504 }
13506 /* Consume the token. */
13508 }
13510 /* Parse a linkage-specification.
13512 linkage-specification:
13513 extern string-literal { declaration-seq [opt] }
13514 extern string-literal declaration */
13516 static void
13518 {
13519 tree linkage;
13521 /* Look for the `extern' keyword. */
13524 /* Look for the string-literal. */
13527 /* Transform the literal into an identifier. If the literal is a
13528 wide-character string, or contains embedded NULs, then we can't
13529 handle it as the user wants. */
13532 {
13534 /* Assume C++ linkage. */
13536 }
13537 else
13540 /* We're now using the new linkage. */
13543 /* If the next token is a `{', then we're using the first
13544 production. */
13546 {
13550 /* Consume the `{' token. */
13552 /* Parse the declarations. */
13554 /* Look for the closing `}'. */
13556 }
13557 /* Otherwise, there's just one declaration. */
13558 else
13559 {
13562 saved_in_unbraced_linkage_specification_p
13566 parser->in_unbraced_linkage_specification_p
13568 }
13570 /* We're done with the linkage-specification. */
13572 }
13574 /* Parse a static_assert-declaration.
13576 static_assert-declaration:
13577 static_assert ( constant-expression , string-literal ) ;
13578 static_assert ( constant-expression ) ; (C++1Z)
13580 If MEMBER_P, this static_assert is a class member. */
13582 static void
13584 {
13585 tree condition;
13586 tree message;
13588 location_t saved_loc;
13591 /* Peek at the `static_assert' token so we can keep track of exactly
13592 where the static assertion started. */
13596 /* Look for the `static_assert' keyword. */
13598 RT_STATIC_ASSERT))
13601 /* We know we are in a static assertion; commit to any tentative
13602 parse. */
13606 /* Parse the `(' starting the static assertion condition. */
13609 /* Parse the constant-expression. Allow a non-constant expression
13610 here in order to give better diagnostics in finish_static_assert. */
13611 condition =
13617 {
13620 "static_assert without a message "
13622 /* Eat the ')' */
13627 }
13628 else
13629 {
13630 /* Parse the separating `,'. */
13633 /* Parse the string-literal message. */
13638 /* A `)' completes the static assertion. */
13644 }
13646 /* A semicolon terminates the declaration. */
13649 /* Complete the static assertion, which may mean either processing
13650 the static assert now or saving it for template instantiation. */
13652 }
13654 /* Parse the expression in decltype ( expression ). */
13656 static tree
13659 {
13661 tree expr;
13663 /* Since we're going to preserve any side-effects from this parse, set up a
13664 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13665 in the expression. */
13668 /* First, try parsing an id-expression. */
13679 {
13682 cp_id_kind idk;
13686 /* Lookup the name we got back from the id-expression. */
13696 {
13697 /* Complete lookup of the id-expression. */
13698 expr = (finish_id_expression
13711 /* We found an id-expression, but it was something that we
13712 should not have found. This is an error, not something
13713 we can recover from, so note that we found an
13714 id-expression and we'll recover as gracefully as
13715 possible. */
13717 }
13722 /* We have an id-expression. */
13724 }
13727 {
13728 /* Abort the id-expression parse. */
13731 /* Parsing tentatively, again. */
13734 /* Parse a class member access. */
13742 /* We have an id-expression. */
13744 }
13747 /* We have parsed the complete id-expression or member access. */
13749 else
13750 {
13751 /* Abort our attempt to parse an id-expression or member access
13752 expression. */
13755 /* Parse a full expression. */
13758 }
13761 }
13763 /* Parse a `decltype' type. Returns the type.
13765 simple-type-specifier:
13766 decltype ( expression )
13767 C++14 proposal:
13768 decltype ( auto ) */
13770 static tree
13772 {
13773 tree expr;
13782 {
13783 /* Already parsed. */
13786 }
13788 /* Look for the `decltype' token. */
13792 /* Parse the opening `('. */
13796 /* decltype (auto) */
13799 {
13806 }
13808 /* Types cannot be defined in a `decltype' expression. Save away the
13809 old message. */
13812 /* And create the new one. */
13813 parser->type_definition_forbidden_message
13816 /* The restrictions on constant-expressions do not apply inside
13817 decltype expressions. */
13818 saved_integral_constant_expression_p
13820 saved_non_integral_constant_expression_p
13824 /* Within a parenthesized expression, a `>' token is always
13825 the greater-than operator. */
13826 saved_greater_than_is_operator_p
13830 /* Do not actually evaluate the expression. */
13833 /* Do not warn about problems with the expression. */
13838 /* Go back to evaluating expressions. */
13842 /* The `>' token might be the end of a template-id or
13843 template-parameter-list now. */
13844 parser->greater_than_is_operator_p
13847 /* Restore the old message and the integral constant expression
13848 flags. */
13850 parser->integral_constant_expression_p
13852 parser->non_integral_constant_expression_p
13855 /* Parse to the closing `)'. */
13857 {
13861 }
13864 tf_warning_or_error);
13866 rewrite:
13867 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13868 it again. */
13877 }
13879 /* Special member functions [gram.special] */
13881 /* Parse a conversion-function-id.
13883 conversion-function-id:
13884 operator conversion-type-id
13886 Returns an IDENTIFIER_NODE representing the operator. */
13888 static tree
13890 {
13891 tree type;
13892 tree saved_scope;
13893 tree saved_qualifying_scope;
13894 tree saved_object_scope;
13897 /* Look for the `operator' token. */
13900 /* When we parse the conversion-type-id, the current scope will be
13901 reset. However, we need that information in able to look up the
13902 conversion function later, so we save it here. */
13906 /* We must enter the scope of the class so that the names of
13907 entities declared within the class are available in the
13908 conversion-type-id. For example, consider:
13910 struct S {
13911 typedef int I;
13912 operator I();
13913 };
13915 S::operator I() { ... }
13917 In order to see that `I' is a type-name in the definition, we
13918 must be in the scope of `S'. */
13921 /* Parse the conversion-type-id. */
13923 /* Leave the scope of the class, if any. */
13926 /* Restore the saved scope. */
13930 /* If the TYPE is invalid, indicate failure. */
13934 }
13936 /* Parse a conversion-type-id:
13938 conversion-type-id:
13939 type-specifier-seq conversion-declarator [opt]
13941 Returns the TYPE specified. */
13943 static tree
13945 {
13946 tree attributes;
13947 cp_decl_specifier_seq type_specifiers;
13949 tree type_specified;
13952 /* Parse the attributes. */
13956 parser->type_definition_forbidden_message
13959 /* Parse the type-specifiers. */
13966 /* If that didn't work, stop. */
13969 /* Parse the conversion-declarator. */
13977 /* Don't give this error when parsing tentatively. This happens to
13978 work because we always parse this definitively once. */
13981 {
13983 {
13986 }
13990 }
13993 }
13995 /* Parse an (optional) conversion-declarator.
13997 conversion-declarator:
13998 ptr-operator conversion-declarator [opt]
14000 */
14004 {
14007 cp_cv_quals cv_quals;
14009 /* We don't know if there's a ptr-operator next, or not. */
14011 /* Try the ptr-operator. */
14014 /* If it worked, look for more conversion-declarators. */
14016 {
14019 /* Parse another optional declarator. */
14022 declarator = cp_parser_make_indirect_declarator
14026 }
14029 }
14031 /* Parse an (optional) ctor-initializer.
14033 ctor-initializer:
14034 : mem-initializer-list
14036 Returns TRUE iff the ctor-initializer was actually present. */
14038 static bool
14040 {
14041 /* If the next token is not a `:', then there is no
14042 ctor-initializer. */
14044 {
14045 /* Do default initialization of any bases and members. */
14050 }
14052 /* Consume the `:' token. */
14054 /* And the mem-initializer-list. */
14058 }
14060 /* Parse a mem-initializer-list.
14062 mem-initializer-list:
14063 mem-initializer ... [opt]
14064 mem-initializer ... [opt] , mem-initializer-list */
14066 static void
14068 {
14073 /* Let the semantic analysis code know that we are starting the
14074 mem-initializer-list. */
14079 /* Loop through the list. */
14081 {
14082 tree mem_initializer;
14085 /* Parse the mem-initializer. */
14087 /* If the next token is a `...', we're expanding member initializers. */
14089 {
14090 /* Consume the `...'. */
14093 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14094 can be expanded but members cannot. */
14097 {
14102 }
14104 /* Construct the pack expansion type. */
14107 }
14110 {
14114 }
14115 /* Look for a target constructor. */
14119 {
14122 {
14126 }
14128 }
14129 /* Add it to the list, unless it was erroneous. */
14131 {
14134 }
14135 /* If the next token is not a `,', we're done. */
14138 /* Consume the `,' token. */
14140 }
14142 /* Perform semantic analysis. */
14145 }
14147 /* Parse a mem-initializer.
14149 mem-initializer:
14150 mem-initializer-id ( expression-list [opt] )
14151 mem-initializer-id braced-init-list
14153 GNU extension:
14155 mem-initializer:
14156 ( expression-list [opt] )
14158 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14159 class) or FIELD_DECL (for a non-static data member) to initialize;
14160 the TREE_VALUE is the expression-list. An empty initialization
14161 list is represented by void_list_node. */
14163 static tree
14165 {
14166 tree mem_initializer_id;
14167 tree expression_list;
14168 tree member;
14171 /* Find out what is being initialized. */
14173 {
14177 }
14178 else
14179 {
14183 }
14189 {
14196 }
14197 else
14198 {
14208 }
14218 }
14220 /* Parse a mem-initializer-id.
14222 mem-initializer-id:
14223 :: [opt] nested-name-specifier [opt] class-name
14224 decltype-specifier (C++11)
14225 identifier
14227 Returns a TYPE indicating the class to be initialized for the first
14228 production (and the second in C++11). Returns an IDENTIFIER_NODE
14229 indicating the data member to be initialized for the last production. */
14231 static tree
14233 {
14237 tree id;
14241 /* `typename' is not allowed in this context ([temp.res]). */
14243 {
14245 "keyword %<typename%> not allowed in this context (a qualified "
14248 }
14249 /* Look for the optional `::' operator. */
14250 global_scope_p
14254 /* Look for the optional nested-name-specifier. The simplest way to
14255 implement:
14257 [temp.res]
14259 The keyword `typename' is not permitted in a base-specifier or
14260 mem-initializer; in these contexts a qualified name that
14261 depends on a template-parameter is implicitly assumed to be a
14262 type name.
14264 is to assume that we have seen the `typename' keyword at this
14265 point. */
14266 nested_name_specifier_p
14275 /* If there is a `::' operator or a nested-name-specifier, then we
14276 are definitely looking for a class-name. */
14281 typename_type,
14285 /* Otherwise, we could also be looking for an ordinary identifier. */
14288 /* Try a decltype-specifier. */
14290 else
14291 /* Otherwise, try a class-name. */
14295 none_type,
14299 /* If we found one, we're done. */
14302 /* Otherwise, look for an ordinary identifier. */
14304 }
14306 /* Overloading [gram.over] */
14308 /* Parse an operator-function-id.
14310 operator-function-id:
14311 operator operator
14313 Returns an IDENTIFIER_NODE for the operator which is a
14314 human-readable spelling of the identifier, e.g., `operator +'. */
14316 static cp_expr
14318 {
14319 /* Look for the `operator' keyword. */
14322 /* And then the name of the operator itself. */
14324 }
14326 /* Return an identifier node for a user-defined literal operator.
14327 The suffix identifier is chained to the operator name identifier. */
14329 tree
14331 {
14332 tree identifier;
14339 }
14341 /* Parse an operator.
14343 operator:
14344 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14345 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14346 || ++ -- , ->* -> () []
14348 GNU Extensions:
14350 operator:
14351 <? >? <?= >?=
14353 Returns an IDENTIFIER_NODE for the operator which is a
14354 human-readable spelling of the identifier, e.g., `operator +'. */
14356 static cp_expr
14358 {
14363 /* Peek at the next token. */
14368 /* Figure out which operator we have. */
14370 {
14372 {
14375 /* The keyword should be either `new' or `delete'. */
14380 else
14383 /* Consume the `new' or `delete' token. */
14386 /* Peek at the next token. */
14388 /* If it's a `[' token then this is the array variant of the
14389 operator. */
14391 {
14392 /* Consume the `[' token. */
14394 /* Look for the `]' token. */
14400 }
14401 /* Otherwise, we have the non-array variant. */
14402 else
14408 }
14555 /* Consume the `('. */
14557 /* Look for the matching `)'. */
14562 /* Consume the `['. */
14564 /* Look for the matching `]'. */
14571 /* FALLTHRU */
14580 {
14587 /* Consume the string. */
14593 {
14596 }
14597 else
14598 {
14600 /* Look for the suffix identifier. */
14605 {
14609 }
14610 else
14611 {
14614 }
14615 }
14620 {
14623 }
14626 {
14629 }
14631 {
14634 }
14636 }
14639 /* Anything else is an error. */
14641 }
14643 /* If we have selected an identifier, we need to consume the
14644 operator token. */
14647 /* Otherwise, no valid operator name was present. */
14648 else
14649 {
14652 }
14655 }
14657 /* Parse a template-declaration.
14659 template-declaration:
14660 export [opt] template < template-parameter-list > declaration
14662 If MEMBER_P is TRUE, this template-declaration occurs within a
14663 class-specifier.
14665 The grammar rule given by the standard isn't correct. What
14666 is really meant is:
14668 template-declaration:
14669 export [opt] template-parameter-list-seq
14670 decl-specifier-seq [opt] init-declarator [opt] ;
14671 export [opt] template-parameter-list-seq
14672 function-definition
14674 template-parameter-list-seq:
14675 template-parameter-list-seq [opt]
14676 template < template-parameter-list >
14678 Concept Extensions:
14680 template-parameter-list-seq:
14681 template < template-parameter-list > requires-clause [opt]
14683 requires-clause:
14684 requires logical-or-expression */
14686 static void
14688 {
14689 /* Check for `export'. */
14691 {
14692 /* Consume the `export' token. */
14694 /* Warn that we do not support `export'. */
14696 }
14699 }
14701 /* Parse a template-parameter-list.
14703 template-parameter-list:
14704 template-parameter
14705 template-parameter-list , template-parameter
14707 Returns a TREE_LIST. Each node represents a template parameter.
14708 The nodes are connected via their TREE_CHAINs. */
14710 static tree
14712 {
14717 /* The loop below parses the template parms. We first need to know
14718 the total number of template parms to be able to compute proper
14719 canonical types of each dependent type. So after the loop, when
14720 we know the total number of template parms,
14721 end_template_parm_list computes the proper canonical types and
14722 fixes up the dependent types accordingly. */
14724 {
14725 tree parameter;
14728 location_t parm_loc;
14730 /* Parse the template-parameter. */
14735 /* Add it to the list. */
14738 parm_loc,
14739 parameter,
14740 is_non_type,
14741 is_parameter_pack);
14742 else
14743 {
14746 }
14748 /* If the next token is not a `,', we're done. */
14751 /* Otherwise, consume the `,' token. */
14753 }
14756 }
14758 /* Parse a introduction-list.
14760 introduction-list:
14761 introduced-parameter
14762 introduction-list , introduced-parameter
14764 introduced-parameter:
14765 ...[opt] identifier
14767 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14768 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14769 WILDCARD_DECL will also have DECL_NAME set and token location in
14770 DECL_SOURCE_LOCATION. */
14772 static tree
14774 {
14778 {
14783 /* Build placeholder. */
14791 /* If the next token is not a `,', we're done. */
14794 /* Otherwise, consume the `,' token. */
14796 }
14798 /* Convert the vec into a TREE_VEC. */
14801 tree parm;
14807 }
14809 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14810 is an abstract declarator. */
14814 {
14819 }
14821 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14822 is an abstract declarator. */
14826 {
14830 else
14832 }
14834 /* Returns true if DECL represents a constrained-parameter. */
14838 {
14843 }
14845 /* Returns true if PARM declares a constrained-parameter. */
14849 {
14851 }
14853 /* Check that the type parameter is only a declarator-id, and that its
14854 type is not cv-qualified. */
14856 bool
14859 {
14864 {
14867 }
14869 /* Don't allow cv-qualified type parameters. */
14872 {
14875 }
14878 }
14880 /* Finish parsing/processing a template type parameter and checking
14881 various restrictions. */
14885 tree id,
14887 {
14890 else
14892 }
14894 static tree
14896 {
14897 /* FIXME: This should probably be copied, and we may need to adjust
14898 the template parameter depths. */
14908 }
14910 /* Finish parsing/processing a template template parameter by borrowing
14911 the template parameter list from the prototype parameter. */
14913 static tree
14915 tree proto,
14916 tree id,
14918 {
14922 }
14924 /* Create a new non-type template parameter from the given PARM
14925 declarator. */
14927 static tree
14930 {
14936 }
14938 /* Build a constrained template parameter based on the PARMDECL
14939 declarator. The type of PARMDECL is the constrained type, which
14940 refers to the prototype template parameter that ultimately
14941 specifies the type of the declared parameter. */
14943 static tree
14948 {
14954 /* A template parameter constrained by a variadic concept shall also
14955 be declared as a template parameter pack. */
14960 /* Build the parameter. Return an error if the declarator was invalid. */
14961 tree parm;
14966 parmdecl);
14967 else
14972 /* Finish the parameter decl and create a node attaching the
14973 default argument and constraint. */
14978 }
14980 /* Returns true if the parsed type actually represents the declaration
14981 of a type template-parameter. */
14985 {
14988 }
14991 /* Returns true if the parsed type actually represents the declaration of
14992 a template template-parameter. */
14994 static bool
14996 {
14999 }
15001 /* Parse a default argument for a type template-parameter.
15002 Note that diagnostics are handled in cp_parser_template_parameter. */
15004 static tree
15006 {
15009 /* Consume the `=' token. */
15014 /* Parse the default-argument. */
15020 {
15024 }
15027 }
15029 /* Parse a default argument for a template template-parameter. */
15031 static tree
15033 {
15038 /* Consume the `='. */
15040 /* Parse the id-expression. */
15042 /* save token before parsing the id-expression, for error
15043 reporting */
15045 tree default_argument
15053 /* If the id-expression was a template-id that refers to
15054 a template-class, we already have the declaration here,
15055 so no further lookup is needed. */
15056 ;
15057 else
15058 /* Look up the name. */
15059 default_argument
15061 none_type,
15067 /* See if the default argument is valid. */
15071 }
15073 /* Parse a template-parameter.
15075 template-parameter:
15076 type-parameter
15077 parameter-declaration
15079 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15080 the parameter. The TREE_PURPOSE is the default value, if any.
15081 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15082 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15083 set to true iff this parameter is a parameter pack. */
15085 static tree
15088 {
15091 tree parm;
15093 /* Assume it is a type parameter or a template parameter. */
15095 /* Assume it not a parameter pack. */
15097 /* Peek at the next token. */
15099 /* If it is `template', we have a type-parameter. */
15102 /* If it is `class' or `typename' we do not know yet whether it is a
15103 type parameter or a non-type parameter. Consider:
15105 template <typename T, typename T::X X> ...
15107 or:
15109 template <class C, class D*> ...
15111 Here, the first parameter is a type parameter, and the second is
15112 a non-type parameter. We can tell by looking at the token after
15113 the identifier -- if it is a `,', `=', or `>' then we have a type
15114 parameter. */
15116 {
15117 /* Peek at the token after `class' or `typename'. */
15119 /* If it's an ellipsis, we have a template type parameter
15120 pack. */
15123 /* If it's an identifier, skip it. */
15126 /* Now, see if the token looks like the end of a template
15127 parameter. */
15132 }
15134 /* Otherwise, it is a non-type parameter or a constrained parameter.
15136 [temp.param]
15138 When parsing a default template-argument for a non-type
15139 template-parameter, the first non-nested `>' is taken as the end
15140 of the template parameter-list rather than a greater-than
15141 operator. */
15142 parameter_declarator
15149 /* If the parameter declaration is marked as a parameter pack, set
15150 *IS_PARAMETER_PACK to notify the caller. */
15155 {
15156 /* Can happen in some cases of erroneous input (c++/34892). */
15158 /* Consume the `...' for better error recovery. */
15160 }
15162 // The parameter may have been constrained.
15165 parameter_declarator,
15166 is_non_type,
15167 is_parameter_pack);
15169 // Now we're sure that the parameter is a non-type parameter.
15180 }
15182 /* Parse a type-parameter.
15184 type-parameter:
15185 class identifier [opt]
15186 class identifier [opt] = type-id
15187 typename identifier [opt]
15188 typename identifier [opt] = type-id
15189 template < template-parameter-list > class identifier [opt]
15190 template < template-parameter-list > class identifier [opt]
15191 = id-expression
15193 GNU Extension (variadic templates):
15195 type-parameter:
15196 class ... identifier [opt]
15197 typename ... identifier [opt]
15199 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15200 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15201 the declaration of the parameter.
15203 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15205 static tree
15207 {
15209 tree parameter;
15211 /* Look for a keyword to tell us what kind of parameter this is. */
15217 {
15220 {
15221 tree identifier;
15222 tree default_argument;
15224 /* If the next token is an ellipsis, we have a template
15225 argument pack. */
15227 {
15228 /* Consume the `...' token. */
15233 }
15235 /* If the next token is an identifier, then it names the
15236 parameter. */
15239 else
15242 /* Create the parameter. */
15245 /* If the next token is an `=', we have a default argument. */
15247 {
15248 default_argument
15251 /* Template parameter packs cannot have default
15252 arguments. */
15254 {
15257 "template parameter pack %qD cannot have a "
15259 else
15261 "template parameter packs cannot have "
15264 }
15267 }
15268 else
15271 /* Create the combined representation of the parameter and the
15272 default argument. */
15274 }
15278 {
15279 tree identifier;
15280 tree default_argument;
15282 /* Look for the `<'. */
15284 /* Parse the template-parameter-list. */
15286 /* Look for the `>'. */
15289 // If template requirements are present, parse them.
15291 {
15296 }
15298 /* Look for the `class' or 'typename' keywords. */
15300 /* If the next token is an ellipsis, we have a template
15301 argument pack. */
15303 {
15304 /* Consume the `...' token. */
15309 }
15310 /* If the next token is an `=', then there is a
15311 default-argument. If the next token is a `>', we are at
15312 the end of the parameter-list. If the next token is a `,',
15313 then we are at the end of this parameter. */
15317 {
15319 /* Treat invalid names as if the parameter were nameless. */
15322 }
15323 else
15326 /* Create the template parameter. */
15328 identifier);
15330 /* If the next token is an `=', then there is a
15331 default-argument. */
15333 {
15334 default_argument
15337 /* Template parameter packs cannot have default
15338 arguments. */
15340 {
15343 "template parameter pack %qD cannot "
15345 identifier);
15346 else
15350 }
15351 }
15352 else
15355 /* Create the combined representation of the parameter and the
15356 default argument. */
15358 }
15364 }
15367 }
15369 /* Parse a template-id.
15371 template-id:
15372 template-name < template-argument-list [opt] >
15374 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15375 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15376 returned. Otherwise, if the template-name names a function, or set
15377 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15378 names a class, returns a TYPE_DECL for the specialization.
15380 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15381 uninstantiated templates. */
15383 static tree
15389 {
15390 tree templ;
15391 tree arguments;
15392 tree template_id;
15397 /* If the next token corresponds to a template-id, there is no need
15398 to reparse it. */
15401 {
15404 }
15406 /* Avoid performing name lookup if there is no possibility of
15407 finding a template-id. */
15410 && !cp_parser_nth_token_starts_template_argument_list_p
15412 {
15415 }
15417 /* Remember where the template-id starts. */
15423 /* Parse the template-name. */
15426 check_dependency_p,
15427 is_declaration,
15428 tag_type,
15431 {
15434 }
15436 /* Since we're going to preserve any side-effects from this parse, set up a
15437 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15438 in the template arguments. */
15441 /* If we find the sequence `[:' after a template-name, it's probably
15442 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15443 parse correctly the argument list. */
15450 {
15452 /* Change `:' into `::'. */
15454 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15455 CPP_LESS. */
15458 /* Parse the arguments. */
15461 {
15462 /* If we couldn't parse an argument list, then we revert our changes
15463 and return simply an error. Maybe this is not a template-id
15464 after all. */
15469 }
15470 /* Otherwise, emit an error about the invalid digraph, but continue
15471 parsing because we got our argument list. */
15474 {
15477 "%<<:%> is an alternate spelling for %<[%>."
15480 {
15482 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15485 }
15486 }
15487 }
15488 else
15489 {
15490 /* Look for the `<' that starts the template-argument-list. */
15492 {
15495 }
15496 /* Parse the arguments. */
15498 }
15500 /* Build a representation of the specialization. */
15503 TEMPLATE_ID_EXPR,
15507 {
15509 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15510 template (rather than some instantiation thereof) only if
15511 is not nested within some other construct. For example, in
15512 "template <typename T> void f(T) { A<T>::", A<T> is just an
15513 instantiation of A. */
15516 CPP_SCOPE));
15517 template_id
15519 }
15520 /* A template-like identifier may be a partial concept id. */
15526 {
15530 }
15531 else
15532 {
15533 /* If it's not a class-template or a template-template, it should be
15534 a function-template. */
15542 }
15544 /* If parsing tentatively, replace the sequence of tokens that makes
15545 up the template-id with a CPP_TEMPLATE_ID token. That way,
15546 should we re-parse the token stream, we will not have to repeat
15547 the effort required to do the parse, nor will we issue duplicate
15548 error messages about problems during instantiation of the
15549 template. */
15551 /* Don't do this if we had a parse error in a declarator; re-parsing
15552 might succeed if a name changes meaning (60361). */
15556 {
15559 /* Reset the contents of the START_OF_ID token. */
15562 /* Update the location to be of the form:
15563 template-name < template-argument-list [opt] >
15564 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15565 with caret == start at the start of the template-name,
15566 ranging until the closing '>'. */
15567 location_t finish_loc
15569 location_t combined_loc
15573 /* We must mark the lookup as kept, so we don't throw it away on
15574 the first parse. */
15578 /* Retrieve any deferred checks. Do not pop this access checks yet
15579 so the memory will not be reclaimed during token replacing below. */
15585 /* Purge all subsequent tokens. */
15588 /* ??? Can we actually assume that, if template_id ==
15589 error_mark_node, we will have issued a diagnostic to the
15590 user, as opposed to simply marking the tentative parse as
15591 failed? */
15594 }
15598 }
15600 /* Parse a template-name.
15602 template-name:
15603 identifier
15605 The standard should actually say:
15607 template-name:
15608 identifier
15609 operator-function-id
15611 A defect report has been filed about this issue.
15613 A conversion-function-id cannot be a template name because they cannot
15614 be part of a template-id. In fact, looking at this code:
15616 a.operator K<int>()
15618 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15619 It is impossible to call a templated conversion-function-id with an
15620 explicit argument list, since the only allowed template parameter is
15621 the type to which it is converting.
15623 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15624 `template' keyword, in a construction like:
15626 T::template f<3>()
15628 In that case `f' is taken to be a template-name, even though there
15629 is no way of knowing for sure.
15631 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15632 name refers to a set of overloaded functions, at least one of which
15633 is a template, or an IDENTIFIER_NODE with the name of the template,
15634 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15635 names are looked up inside uninstantiated templates. */
15637 static tree
15644 {
15645 tree identifier;
15646 tree decl;
15649 /* If the next token is `operator', then we have either an
15650 operator-function-id or a conversion-function-id. */
15652 {
15653 /* We don't know whether we're looking at an
15654 operator-function-id or a conversion-function-id. */
15656 /* Try an operator-function-id. */
15658 /* If that didn't work, try a conversion-function-id. */
15660 {
15663 }
15664 }
15665 /* Look for the identifier. */
15666 else
15669 /* If we didn't find an identifier, we don't have a template-id. */
15673 /* If the name immediately followed the `template' keyword, then it
15674 is a template-name. However, if the next token is not `<', then
15675 we do not treat it as a template-name, since it is not being used
15676 as part of a template-id. This enables us to handle constructs
15677 like:
15679 template <typename T> struct S { S(); };
15680 template <typename T> S<T>::S();
15682 correctly. We would treat `S' as a template -- if it were `S<T>'
15683 -- but we do not if there is no `<'. */
15687 {
15688 /* In a declaration, in a dependent context, we pretend that the
15689 "template" keyword was present in order to improve error
15690 recovery. For example, given:
15692 template <typename T> void f(T::X<int>);
15694 we want to treat "X<int>" as a template-id. */
15696 && !template_keyword_p
15698 && check_dependency_p
15700 /* Do not do this for dtors (or ctors), since they never
15701 need the template keyword before their name. */
15703 {
15706 /* Explain what went wrong. */
15708 identifier);
15711 /* If parsing tentatively, find the location of the "<" token. */
15714 /* Parse the template arguments so that we can issue error
15715 messages about them. */
15718 /* Skip tokens until we find a good place from which to
15719 continue parsing. */
15724 /* If parsing tentatively, permanently remove the
15725 template argument list. That will prevent duplicate
15726 error messages from being issued about the missing
15727 "template" keyword. */
15734 }
15736 /* If the "template" keyword is present, then there is generally
15737 no point in doing name-lookup, so we just return IDENTIFIER.
15738 But, if the qualifying scope is non-dependent then we can
15739 (and must) do name-lookup normally. */
15744 {
15745 /* We're optimizing away the call to cp_parser_lookup_name, but we
15746 still need to do this. */
15749 }
15750 }
15752 /* Look up the name. */
15754 tag_type,
15757 check_dependency_p,
15763 /* If DECL is a template, then the name was a template-name. */
15765 {
15769 }
15770 else
15771 {
15772 /* The standard does not explicitly indicate whether a name that
15773 names a set of overloaded declarations, some of which are
15774 templates, is a template-name. However, such a name should
15775 be a template-name; otherwise, there is no way to form a
15776 template-id for the overloaded templates. */
15785 {
15786 /* The name does not name a template. */
15789 }
15790 }
15792 /* If DECL is dependent, and refers to a function, then just return
15793 its name; we will look it up again during template instantiation. */
15795 {
15799 }
15802 }
15804 /* Parse a template-argument-list.
15806 template-argument-list:
15807 template-argument ... [opt]
15808 template-argument-list , template-argument ... [opt]
15810 Returns a TREE_VEC containing the arguments. */
15812 static tree
15814 {
15819 tree vec;
15826 /* Even if the template-id appears in an integral
15827 constant-expression, the contents of the argument list do
15828 not. */
15834 /* Parse the arguments. */
15835 do
15836 {
15837 tree argument;
15840 /* Consume the comma. */
15843 /* Parse the template-argument. */
15846 /* If the next token is an ellipsis, we're expanding a template
15847 argument pack. */
15849 {
15851 {
15855 }
15856 /* Consume the `...' token. */
15859 /* Make the argument into a TYPE_PACK_EXPANSION or
15860 EXPR_PACK_EXPANSION. */
15862 }
15865 {
15869 {
15872 }
15873 else
15875 }
15877 }
15893 }
15895 /* Parse a template-argument.
15897 template-argument:
15898 assignment-expression
15899 type-id
15900 id-expression
15902 The representation is that of an assignment-expression, type-id, or
15903 id-expression -- except that the qualified id-expression is
15904 evaluated, so that the value returned is either a DECL or an
15905 OVERLOAD.
15907 Although the standard says "assignment-expression", it forbids
15908 throw-expressions or assignments in the template argument.
15909 Therefore, we use "conditional-expression" instead. */
15911 static tree
15913 {
15914 tree argument;
15920 cp_id_kind idk;
15922 /* There's really no way to know what we're looking at, so we just
15923 try each alternative in order.
15925 [temp.arg]
15927 In a template-argument, an ambiguity between a type-id and an
15928 expression is resolved to a type-id, regardless of the form of
15929 the corresponding template-parameter.
15931 Therefore, we try a type-id first. */
15934 /* If there was no error parsing the type-id but the next token is a
15935 '>>', our behavior depends on which dialect of C++ we're
15936 parsing. In C++98, we probably found a typo for '> >'. But there
15937 are type-id which are also valid expressions. For instance:
15939 struct X { int operator >> (int); };
15940 template <int V> struct Foo {};
15941 Foo<X () >> 5> r;
15943 Here 'X()' is a valid type-id of a function type, but the user just
15944 wanted to write the expression "X() >> 5". Thus, we remember that we
15945 found a valid type-id, but we still try to parse the argument as an
15946 expression to see what happens.
15948 In C++0x, the '>>' will be considered two separate '>'
15949 tokens. */
15953 {
15956 }
15957 else
15958 {
15959 /* If the next token isn't a `,' or a `>', then this argument wasn't
15960 really finished. This means that the argument is not a valid
15961 type-id. */
15964 /* If that worked, we're done. */
15967 }
15968 /* We're still not sure what the argument will be. */
15970 /* Try a template. */
15978 /* If the next token isn't a `,' or a `>', then this argument wasn't
15979 really finished. */
15983 {
15984 /* Figure out what is being referred to. If the id-expression
15985 was for a class template specialization, then we will have a
15986 TYPE_DECL at this point. There is no need to do name lookup
15987 at this point in that case. */
15990 none_type,
15996 /* Handle a constrained-type-specifier for a non-type template
15997 parameter. */
16003 }
16005 {
16009 }
16010 /* It must be a non-type argument. In C++17 any constant-expression is
16011 allowed. */
16015 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16017 -- an integral constant-expression of integral or enumeration
16018 type; or
16020 -- the name of a non-type template-parameter; or
16022 -- the name of an object or function with external linkage...
16024 -- the address of an object or function with external linkage...
16026 -- a pointer to member... */
16027 /* Look for a non-type template parameter. */
16029 {
16041 }
16043 /* If the next token is "&", the argument must be the address of an
16044 object or function with external linkage. */
16047 {
16050 }
16051 /* See if we might have an id-expression. */
16058 {
16061 address_p,
16068 else
16069 {
16070 tree probe;
16073 {
16074 /* Strip the dereference temporarily. */
16077 }
16079 /* If we're in a template, we represent a qualified-id referring
16080 to a static data member as a SCOPE_REF even if the scope isn't
16081 dependent so that we can check access control later. */
16086 {
16087 /* A variable without external linkage might still be a
16088 valid constant-expression, so no error is issued here
16089 if the external-linkage check fails. */
16092 }
16094 /* All overloaded functions are allowed; if the external
16095 linkage test does not pass, an error will be issued
16096 later. */
16097 ;
16101 /* A pointer-to-member. */
16102 ;
16104 ;
16105 else
16109 {
16112 tf_warning_or_error);
16113 else
16116 }
16117 }
16118 }
16119 /* If the argument started with "&", there are no other valid
16120 alternatives at this point. */
16122 {
16125 }
16127 general_expr:
16128 /* If the argument wasn't successfully parsed as a type-id followed
16129 by '>>', the argument can only be a constant expression now.
16130 Otherwise, we try parsing the constant-expression tentatively,
16131 because the argument could really be a type-id. */
16137 else
16138 {
16139 /* With C++17 generalized non-type template arguments we need to handle
16140 lvalue constant expressions, too. */
16143 }
16151 /* We did our best to parse the argument as a non type-id, but that
16152 was the only alternative that matched (albeit with a '>' after
16153 it). We can assume it's just a typo from the user, and a
16154 diagnostic will then be issued. */
16156 }
16158 /* Parse an explicit-instantiation.
16160 explicit-instantiation:
16161 template declaration
16163 Although the standard says `declaration', what it really means is:
16165 explicit-instantiation:
16166 template decl-specifier-seq [opt] declarator [opt] ;
16168 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16169 supposed to be allowed. A defect report has been filed about this
16170 issue.
16172 GNU Extension:
16174 explicit-instantiation:
16175 storage-class-specifier template
16176 decl-specifier-seq [opt] declarator [opt] ;
16177 function-specifier template
16178 decl-specifier-seq [opt] declarator [opt] ; */
16180 static void
16182 {
16184 cp_decl_specifier_seq decl_specifiers;
16189 /* Look for an (optional) storage-class-specifier or
16190 function-specifier. */
16192 {
16193 extension_specifier
16196 extension_specifier
16199 }
16201 /* Look for the `template' keyword. */
16203 /* Let the front end know that we are processing an explicit
16204 instantiation. */
16206 /* [temp.explicit] says that we are supposed to ignore access
16207 control while processing explicit instantiation directives. */
16209 /* Parse a decl-specifier-seq. */
16211 CP_PARSER_FLAGS_OPTIONAL,
16214 /* If there was exactly one decl-specifier, and it declared a class,
16215 and there's no declarator, then we have an explicit type
16216 instantiation. */
16218 {
16219 tree type;
16223 /* Turn access control back on for names used during
16224 template instantiation. */
16229 }
16230 else
16231 {
16233 tree decl;
16235 /* Parse the declarator. */
16236 declarator
16247 {
16250 "explicit instantiation shall not use"
16254 "explicit instantiation shall not use"
16259 /* Turn access control back on for names used during
16260 template instantiation. */
16262 /* Do the explicit instantiation. */
16264 }
16265 else
16266 {
16268 /* Skip the body of the explicit instantiation. */
16270 }
16271 }
16272 /* We're done with the instantiation. */
16278 }
16280 /* Parse an explicit-specialization.
16282 explicit-specialization:
16283 template < > declaration
16285 Although the standard says `declaration', what it really means is:
16287 explicit-specialization:
16288 template <> decl-specifier [opt] init-declarator [opt] ;
16289 template <> function-definition
16290 template <> explicit-specialization
16291 template <> template-declaration */
16293 static void
16295 {
16299 /* Look for the `template' keyword. */
16301 /* Look for the `<'. */
16303 /* Look for the `>'. */
16305 /* We have processed another parameter list. */
16307 /* [temp]
16309 A template ... explicit specialization ... shall not have C
16310 linkage. */
16312 {
16314 /* Give it C++ linkage to avoid confusing other parts of the
16315 front end. */
16318 }
16319 else
16321 /* Let the front end know that we are beginning a specialization. */
16323 {
16326 }
16328 /* If the next keyword is `template', we need to figure out whether
16329 or not we're looking a template-declaration. */
16331 {
16336 else
16338 }
16339 else
16340 /* Parse the dependent declaration. */
16346 /* We're done with the specialization. */
16348 /* For the erroneous case of a template with C linkage, we pushed an
16349 implicit C++ linkage scope; exit that scope now. */
16352 /* We're done with this parameter list. */
16354 }
16356 /* Parse a type-specifier.
16358 type-specifier:
16359 simple-type-specifier
16360 class-specifier
16361 enum-specifier
16362 elaborated-type-specifier
16363 cv-qualifier
16365 GNU Extension:
16367 type-specifier:
16368 __complex__
16370 Returns a representation of the type-specifier. For a
16371 class-specifier, enum-specifier, or elaborated-type-specifier, a
16372 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16374 The parser flags FLAGS is used to control type-specifier parsing.
16376 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16377 in a decl-specifier-seq.
16379 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16380 class-specifier, enum-specifier, or elaborated-type-specifier, then
16381 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16382 if a type is declared; 2 if it is defined. Otherwise, it is set to
16383 zero.
16385 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16386 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16387 is set to FALSE. */
16389 static tree
16391 cp_parser_flags flags,
16396 {
16402 /* Assume this type-specifier does not declare a new type. */
16405 /* And that it does not specify a cv-qualifier. */
16408 /* Peek at the next token. */
16411 /* If we're looking at a keyword, we can use that to guide the
16412 production we choose. */
16415 {
16420 /* Look for the enum-specifier. */
16422 /* If that worked, we're done. */
16424 {
16429 type_spec,
16430 token,
16433 }
16434 else
16437 /* Any of these indicate either a class-specifier, or an
16438 elaborated-type-specifier. */
16445 /* Parse tentatively so that we can back up if we don't find a
16446 class-specifier. */
16448 /* Look for the class-specifier. */
16451 /* If that worked, we're done. */
16453 {
16458 type_spec,
16459 token,
16462 }
16464 /* Fall through. */
16465 elaborated_type_specifier:
16466 /* We're declaring (not defining) a class or enum. */
16470 /* Fall through. */
16472 /* Look for an elaborated-type-specifier. */
16473 type_spec
16474 = (cp_parser_elaborated_type_specifier
16477 is_declaration));
16480 type_spec,
16481 token,
16504 /* The `__complex__' keyword is a GNU extension. */
16510 }
16512 /* Handle simple keywords. */
16514 {
16516 {
16519 }
16521 }
16523 /* If we do not already have a type-specifier, assume we are looking
16524 at a simple-type-specifier. */
16526 decl_specs,
16527 flags);
16529 /* If we didn't find a type-specifier, and a type-specifier was not
16530 optional in this context, issue an error message. */
16532 {
16535 }
16538 }
16540 /* Parse a simple-type-specifier.
16542 simple-type-specifier:
16543 :: [opt] nested-name-specifier [opt] type-name
16544 :: [opt] nested-name-specifier template template-id
16545 char
16546 wchar_t
16547 bool
16548 short
16549 int
16550 long
16551 signed
16552 unsigned
16553 float
16554 double
16555 void
16557 C++11 Extension:
16559 simple-type-specifier:
16560 auto
16561 decltype ( expression )
16562 char16_t
16563 char32_t
16564 __underlying_type ( type-id )
16566 C++17 extension:
16568 nested-name-specifier(opt) template-name
16570 GNU Extension:
16572 simple-type-specifier:
16573 __int128
16574 __typeof__ unary-expression
16575 __typeof__ ( type-id )
16576 __typeof__ ( type-id ) { initializer-list , [opt] }
16578 Concepts Extension:
16580 simple-type-specifier:
16581 constrained-type-specifier
16583 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16584 appropriately updated. */
16586 static tree
16589 cp_parser_flags flags)
16590 {
16595 /* Peek at the next token. */
16598 /* If we're looking at a keyword, things are easy. */
16600 {
16635 {
16638 }
16667 {
16668 /* The 'auto' might be the placeholder return type for a function decl
16669 with trailing return type. */
16678 {
16680 {
16687 }
16690 {
16693 }
16696 }
16700 {
16703 }
16706 {
16709 }
16710 else
16714 {
16717 "use of %<auto%> in lambda parameter declaration "
16718 "only available with "
16720 }
16723 "use of %<auto%> in parameter declaration "
16724 "only available with "
16728 "ISO C++ forbids use of %<auto%> in parameter "
16730 }
16731 else
16736 /* Since DR 743, decltype can either be a simple-type-specifier by
16737 itself or begin a nested-name-specifier. Parsing it will replace
16738 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16739 handling below decide what to do. */
16745 /* Consume the `typeof' token. */
16747 /* Parse the operand to `typeof'. */
16749 /* If it is not already a TYPE, take its type. */
16755 token,
16764 token,
16774 token,
16779 }
16781 /* If token is an already-parsed decltype not followed by ::,
16782 it's a simple-type-specifier. */
16785 {
16788 {
16790 token,
16792 /* Remember that we are handling a decltype in order to
16793 implement the resolution of DR 1510 when the argument
16794 isn't instantiation dependent. */
16796 }
16799 }
16801 /* If the type-specifier was for a built-in type, we're done. */
16803 {
16804 /* Record the type. */
16811 type,
16812 token,
16817 /* Consume the token. */
16823 /* There is no valid C++ program where a non-template type is
16824 followed by a "<". That usually indicates that the user thought
16825 that the type was a template. */
16830 }
16832 /* The type-specifier must be a user-defined type. */
16834 {
16838 /* Don't gobble tokens or issue error messages if this is an
16839 optional type-specifier. */
16845 /* Look for the optional `::' operator. */
16846 global_p
16850 /* Look for the nested-name specifier. */
16851 qualified_p
16858 /* If we have seen a nested-name-specifier, and the next token
16859 is `template', then we are using the template-id production. */
16862 {
16863 /* Look for the template-id. */
16867 none_type,
16869 /* If the template-id did not name a type, we are out of
16870 luck. */
16872 {
16875 }
16876 }
16877 /* Otherwise, look for a type-name. */
16878 else
16880 /* Keep track of all name-lookups performed in class scopes. */
16882 && !global_p
16883 && !qualified_p
16887 /* If it didn't work out, we don't have a TYPE. */
16892 {
16906 {
16908 none_type,
16918 else
16919 {
16924 }
16925 }
16926 else
16932 }
16935 token,
16937 }
16939 /* If we didn't get a type-name, issue an error message. */
16941 {
16944 }
16947 {
16948 /* See if TYPE is an Objective-C type, and if so, parse and
16949 accept any protocol references following it. Do this before
16950 the cp_parser_check_for_invalid_template_id() call, because
16951 Objective-C types can be followed by '<...>' which would
16952 enclose protocol names rather than template arguments, and so
16953 everything is fine. */
16956 {
16960 /* Clobber the "unqualified" type previously entered into
16961 DECL_SPECS with the new, improved protocol-qualified version. */
16966 }
16968 /* There is no valid C++ program where a non-template type is
16969 followed by a "<". That usually indicates that the user
16970 thought that the type was a template. */
16972 none_type,
16974 }
16977 }
16979 /* Parse a type-name.
16981 type-name:
16982 class-name
16983 enum-name
16984 typedef-name
16985 simple-template-id [in c++0x]
16987 enum-name:
16988 identifier
16990 typedef-name:
16991 identifier
16993 Concepts:
16995 type-name:
16996 concept-name
16997 partial-concept-id
16999 concept-name:
17000 identifier
17002 Returns a TYPE_DECL for the type. */
17004 static tree
17006 {
17008 }
17010 /* See above. */
17011 static tree
17013 {
17014 tree type_decl;
17016 /* We can't know yet whether it is a class-name or not. */
17018 /* Try a class-name. */
17020 typename_keyword_p,
17022 none_type,
17026 /* If it's not a class-name, keep looking. */
17028 {
17030 /* It must be a typedef-name or an enum-name. */
17034 /* It is either a simple-template-id representing an
17035 instantiation of an alias template... */
17039 none_type,
17041 /* Note that this must be an instantiation of an alias template
17042 because [temp.names]/6 says:
17044 A template-id that names an alias template specialization
17045 is a type-name.
17047 Whereas [temp.names]/7 says:
17049 A simple-template-id that names a class template
17050 specialization is a class-name.
17052 With concepts, this could also be a partial-concept-id that
17053 declares a non-type template parameter. */
17060 else
17064 /* ... Or a typedef-name or an enum-name. */
17066 }
17069 }
17071 /* Check if DECL and ARGS can form a constrained-type-specifier.
17072 If ARGS is non-null, we try to form a concept check of the
17073 form DECL<?, ARGS> where ? is a wildcard that matches any
17074 kind of template argument. If ARGS is NULL, then we try to
17075 form a concept check of the form DECL<?>. */
17077 static tree
17080 {
17083 /* If we a constrained-type-specifier cannot be deduced. */
17087 /* A constrained type specifier can only be found in an
17088 overload set or as a reference to a template declaration.
17090 FIXME: This might be masking a bug. It's possible that
17091 that the deduction below is causing template specializations
17092 to be formed with the wildcard as an argument. */
17096 /* Try to build a call expression that evaluates the
17097 concept. This can fail if the overload set refers
17098 only to non-templates. */
17104 /* Deduce the checked constraint and the prototype parameter.
17106 FIXME: In certain cases, failure to deduce should be a
17107 diagnosable error. */
17108 tree conc;
17109 tree proto;
17113 /* In template parameter scope, this results in a constrained
17114 parameter. Return a descriptor of that parm. */
17118 /* In a parameter-declaration-clause, constrained-type
17119 specifiers result in invented template parameters. */
17121 {
17124 }
17125 else
17126 {
17127 /* Otherwise, we're in a context where the constrained
17128 type name is deduced and the constraint applies
17129 after deduction. */
17131 }
17134 }
17136 /* If DECL refers to a concept, return a TYPE_DECL representing
17137 the result of using the constrained type specifier in the
17138 current context. DECL refers to a concept if
17140 - it is an overload set containing a function concept taking a single
17141 type argument, or
17143 - it is a variable concept taking a single type argument. */
17145 static tree
17147 {
17153 else
17155 }
17157 /* Check if DECL and ARGS form a partial-concept-id. If so,
17158 assign ID to the resulting constrained placeholder.
17160 Returns true if the partial-concept-id designates a placeholder
17161 and false otherwise. Note that *id is set to NULL_TREE in
17162 this case. */
17164 static tree
17166 {
17168 }
17170 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17171 or a concept-name.
17173 enum-name:
17174 identifier
17176 typedef-name:
17177 identifier
17179 concept-name:
17180 identifier
17182 Returns a TYPE_DECL for the type. */
17184 static tree
17186 {
17187 tree type_decl;
17188 tree identifier;
17195 /* Look up the type-name. */
17200 /* If we found an overload set, then it may refer to a concept-name. */
17206 {
17207 /* See if this is an Objective-C type. */
17212 }
17214 /* Issue an error if we did not find a type-name. */
17216 /* In Objective-C, we have the complication that class names are
17217 normally type names and start declarations (eg, the
17218 "NSObject" in "NSObject *object;"), but can be used in an
17219 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17220 is an expression. So, a classname followed by a dot is not a
17221 valid type-name. */
17224 {
17229 }
17230 /* Remember that the name was used in the definition of the
17231 current class so that we can check later to see if the
17232 meaning would have been different after the class was
17233 entirely defined. */
17239 }
17241 /* Parse an elaborated-type-specifier. Note that the grammar given
17242 here incorporates the resolution to DR68.
17244 elaborated-type-specifier:
17245 class-key :: [opt] nested-name-specifier [opt] identifier
17246 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17247 enum-key :: [opt] nested-name-specifier [opt] identifier
17248 typename :: [opt] nested-name-specifier identifier
17249 typename :: [opt] nested-name-specifier template [opt]
17250 template-id
17252 GNU extension:
17254 elaborated-type-specifier:
17255 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17256 class-key attributes :: [opt] nested-name-specifier [opt]
17257 template [opt] template-id
17258 enum attributes :: [opt] nested-name-specifier [opt] identifier
17260 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17261 declared `friend'. If IS_DECLARATION is TRUE, then this
17262 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17263 something is being declared.
17265 Returns the TYPE specified. */
17267 static tree
17271 {
17273 tree identifier;
17276 tree globalscope;
17279 /* See if we're looking at the `enum' keyword. */
17281 {
17282 /* Consume the `enum' token. */
17284 /* Remember that it's an enumeration type. */
17286 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17287 enums) is used here. */
17291 {
17298 /* Consume the `struct' or `class' and parse it anyway. */
17300 }
17301 /* Parse the attributes. */
17303 }
17304 /* Or, it might be `typename'. */
17306 RID_TYPENAME))
17307 {
17308 /* Consume the `typename' token. */
17310 /* Remember that it's a `typename' type. */
17312 }
17313 /* Otherwise it must be a class-key. */
17314 else
17315 {
17319 /* Parse the attributes. */
17321 }
17323 /* Look for the `::' operator. */
17326 /* Look for the nested-name-specifier. */
17327 tree nested_name_specifier;
17329 {
17330 nested_name_specifier
17335 is_declaration);
17338 }
17339 else
17340 /* Even though `typename' is not present, the proposed resolution
17341 to Core Issue 180 says that in `class A<T>::B', `B' should be
17342 considered a type-name, even if `A<T>' is dependent. */
17343 nested_name_specifier
17348 is_declaration);
17349 /* For everything but enumeration types, consider a template-id.
17350 For an enumeration type, consider only a plain identifier. */
17352 {
17354 tree decl;
17356 /* Allow the `template' keyword. */
17358 /* If we didn't see `template', we don't know if there's a
17359 template-id or not. */
17362 /* Parse the template-id. */
17366 tag_type,
17367 is_declaration);
17368 /* If we didn't find a template-id, look for an ordinary
17369 identifier. */
17371 ;
17372 /* We can get here when cp_parser_template_id, called by
17373 cp_parser_class_name with tag_type == none_type, succeeds
17374 and caches a BASELINK. Then, when called again here,
17375 instead of failing and returning an error_mark_node
17376 returns it (see template/typename17.C in C++11).
17377 ??? Could we diagnose this earlier? */
17379 {
17382 }
17383 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17384 in effect, then we must assume that, upon instantiation, the
17385 template will correspond to a class. */
17389 typename_type,
17391 /* If the `typename' keyword is in effect and DECL is not a type
17392 decl, then type is non existent. */
17394 ;
17396 {
17400 /* If the next token is a semicolon, this must be a specialization,
17401 instantiation, or friend declaration. Check the scope while we
17402 still know whether or not we had a nested-name-specifier. */
17407 }
17410 }
17413 {
17418 {
17421 }
17423 /* For a `typename', we needn't call xref_tag. */
17429 /* Template parameter lists apply only if we are not within a
17430 function parameter list. */
17431 bool template_parm_lists_apply
17440 /* Look up a qualified name in the usual way. */
17442 {
17443 tree decl;
17444 tree ambiguous_decls;
17447 tag_type,
17454 /* If the lookup was ambiguous, an error will already have been
17455 issued. */
17459 /* If we are parsing friend declaration, DECL may be a
17460 TEMPLATE_DECL tree node here. However, we need to check
17461 whether this TEMPLATE_DECL results in valid code. Consider
17462 the following example:
17464 namespace N {
17465 template <class T> class C {};
17466 }
17467 class X {
17468 template <class T> friend class N::C; // #1, valid code
17469 };
17470 template <class T> class Y {
17471 friend class N::C; // #2, invalid code
17472 };
17474 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17475 name lookup of `N::C'. We see that friend declaration must
17476 be template for the code to be valid. Note that
17477 processing_template_decl does not work here since it is
17478 always 1 for the above two cases. */
17480 decl = (cp_parser_maybe_treat_template_as_class
17485 {
17487 identifier,
17490 }
17493 {
17497 allow_template);
17501 }
17503 /* Forward declarations of nested types, such as
17505 class C1::C2;
17506 class C1::C2::C3;
17508 are invalid unless all components preceding the final '::'
17509 are complete. If all enclosing types are complete, these
17510 declarations become merely pointless.
17512 Invalid forward declarations of nested types are errors
17513 caught elsewhere in parsing. Those that are pointless arrive
17514 here. */
17521 }
17522 else
17523 {
17524 /* An elaborated-type-specifier sometimes introduces a new type and
17525 sometimes names an existing type. Normally, the rule is that it
17526 introduces a new type only if there is not an existing type of
17527 the same name already in scope. For example, given:
17529 struct S {};
17530 void f() { struct S s; }
17532 the `struct S' in the body of `f' is the same `struct S' as in
17533 the global scope; the existing definition is used. However, if
17534 there were no global declaration, this would introduce a new
17535 local class named `S'.
17537 An exception to this rule applies to the following code:
17539 namespace N { struct S; }
17541 Here, the elaborated-type-specifier names a new type
17542 unconditionally; even if there is already an `S' in the
17543 containing scope this declaration names a new type.
17544 This exception only applies if the elaborated-type-specifier
17545 forms the complete declaration:
17547 [class.name]
17549 A declaration consisting solely of `class-key identifier ;' is
17550 either a redeclaration of the name in the current scope or a
17551 forward declaration of the identifier as a class name. It
17552 introduces the name into the current scope.
17554 We are in this situation precisely when the next token is a `;'.
17556 An exception to the exception is that a `friend' declaration does
17557 *not* name a new type; i.e., given:
17559 struct S { friend struct T; };
17561 `T' is not a new type in the scope of `S'.
17563 Also, `new struct S' or `sizeof (struct S)' never results in the
17564 definition of a new type; a new type can only be declared in a
17565 declaration context. */
17567 tag_scope ts;
17571 /* Friends have special name lookup rules. */
17575 CPP_SEMICOLON))
17576 /* This is a `class-key identifier ;' */
17578 else
17581 template_p =
17582 (template_parm_lists_apply
17585 /* An unqualified name was used to reference this type, so
17586 there were no qualifying templates. */
17594 }
17595 }
17600 /* Allow attributes on forward declarations of classes. */
17602 {
17612 else
17615 }
17618 {
17619 /* Indicate whether this class was declared as a `class' or as a
17620 `struct'. */
17624 }
17626 /* A "<" cannot follow an elaborated type specifier. If that
17627 happens, the user was probably trying to form a template-id. */
17632 }
17634 /* Parse an enum-specifier.
17636 enum-specifier:
17637 enum-head { enumerator-list [opt] }
17638 enum-head { enumerator-list , } [C++0x]
17640 enum-head:
17641 enum-key identifier [opt] enum-base [opt]
17642 enum-key nested-name-specifier identifier enum-base [opt]
17644 enum-key:
17645 enum
17646 enum class [C++0x]
17647 enum struct [C++0x]
17649 enum-base: [C++0x]
17650 : type-specifier-seq
17652 opaque-enum-specifier:
17653 enum-key identifier enum-base [opt] ;
17655 GNU Extensions:
17656 enum-key attributes[opt] identifier [opt] enum-base [opt]
17657 { enumerator-list [opt] }attributes[opt]
17658 enum-key attributes[opt] identifier [opt] enum-base [opt]
17659 { enumerator-list, }attributes[opt] [C++0x]
17661 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17662 if the token stream isn't an enum-specifier after all. */
17664 static tree
17666 {
17667 tree identifier;
17669 tree prev_scope;
17671 tree attributes;
17684 /* Parse tentatively so that we can back up if we don't find a
17685 enum-specifier. */
17688 /* Caller guarantees that the current token is 'enum', an identifier
17689 possibly follows, and the token after that is an opening brace.
17690 If we don't have an identifier, fabricate an anonymous name for
17691 the enumeration being defined. */
17694 /* Parse the "class" or "struct", which indicates a scoped
17695 enumeration type in C++0x. */
17698 {
17702 /* Consume the `struct' or `class' token. */
17706 }
17710 /* Clear the qualification. */
17715 /* Figure out in what scope the declaration is being placed. */
17721 nested_name_specifier
17729 {
17730 tree name;
17734 enum_type,
17739 input_location);
17741 {
17744 {
17745 /* Are template enums allowed in ISO? */
17749 /* ignore a typename reference, for it will be solved by name
17750 in start_enum. */
17752 }
17753 }
17756 else
17757 {
17762 }
17763 }
17764 else
17765 {
17768 else
17769 {
17775 }
17776 }
17779 /* Check for the `:' that denotes a specified underlying type in C++0x.
17780 Note that a ':' could also indicate a bitfield width, however. */
17782 {
17783 cp_decl_specifier_seq type_specifiers;
17785 /* Consume the `:'. */
17788 /* Parse the type-specifier-seq. */
17793 /* At this point this is surely not elaborated type specifier. */
17802 /* If that didn't work, stop. */
17804 {
17810 }
17811 }
17813 /* Look for the `{' but don't consume it yet. */
17815 {
17817 {
17820 {
17823 }
17824 }
17825 /* An opaque-enum-specifier must have a ';' here. */
17828 {
17831 {
17834 }
17835 }
17836 }
17842 {
17844 {
17848 }
17850 {
17852 }
17853 }
17855 /* Issue an error message if type-definitions are forbidden here. */
17858 else
17859 /* Create the new type. We do this before consuming the opening
17860 brace so the enum will be recorded as being on the line of its
17861 tag (or the 'enum' keyword, if there is no tag). */
17865 /* If the next token is not '{' it is an opaque-enum-specifier or an
17866 elaborated-type-specifier. */
17868 {
17872 {
17873 /* The following catches invalid code such as:
17874 enum class S<int>::E { A, B, C }; */
17882 {
17886 nested_name_specifier);
17888 }
17891 {
17893 "%qT for enum declaration does not name a class "
17896 }
17897 /* If that scope does not contain the scope in which the
17898 class was originally declared, the program is invalid. */
17900 nested_name_specifier))
17901 {
17904 "declaration of %qD in namespace %qD which does not "
17907 else
17909 "declaration of %qD in %qD which does not "
17913 }
17914 /* If that scope is the scope where the declaration is being placed
17915 the program is invalid. */
17919 {
17923 }
17924 }
17929 /* Consume the opening brace. */
17936 {
17940 }
17941 else
17942 {
17948 }
17952 /* If the next token is not '}', then there are some enumerators. */
17954 {
17958 }
17959 else
17962 /* Consume the final '}'. */
17968 }
17969 else
17970 {
17971 /* If a ';' follows, then it is an opaque-enum-specifier
17972 and additional restrictions apply. */
17974 {
17981 }
17982 }
17984 /* Look for trailing attributes to apply to this enumeration, and
17985 apply them if appropriate. */
17987 {
17990 trailing_attr,
17992 }
17994 /* Finish up the enumeration. */
17996 {
18001 }
18004 {
18006 {
18009 }
18011 {
18013 }
18014 }
18015 out:
18018 }
18020 /* Parse an enumerator-list. The enumerators all have the indicated
18021 TYPE.
18023 enumerator-list:
18024 enumerator-definition
18025 enumerator-list , enumerator-definition */
18027 static void
18029 {
18031 {
18032 /* Parse an enumerator-definition. */
18035 /* If the next token is not a ',', we've reached the end of
18036 the list. */
18039 /* Otherwise, consume the `,' and keep going. */
18041 /* If the next token is a `}', there is a trailing comma. */
18043 {
18048 }
18049 }
18050 }
18052 /* Parse an enumerator-definition. The enumerator has the indicated
18053 TYPE.
18055 enumerator-definition:
18056 enumerator
18057 enumerator = constant-expression
18059 enumerator:
18060 identifier
18062 GNU Extensions:
18064 enumerator-definition:
18065 enumerator attributes [opt]
18066 enumerator attributes [opt] = constant-expression */
18068 static void
18070 {
18071 tree identifier;
18072 tree value;
18073 location_t loc;
18075 /* Save the input location because we are interested in the location
18076 of the identifier and not the location of the explicit value. */
18079 /* Look for the identifier. */
18084 /* Parse any specified attributes. */
18087 /* If the next token is an '=', then there is an explicit value. */
18089 {
18090 /* Consume the `=' token. */
18092 /* Parse the value. */
18094 }
18095 else
18098 /* If we are processing a template, make sure the initializer of the
18099 enumerator doesn't contain any bare template parameter pack. */
18103 /* Create the enumerator. */
18105 }
18107 /* Parse a namespace-name.
18109 namespace-name:
18110 original-namespace-name
18111 namespace-alias
18113 Returns the NAMESPACE_DECL for the namespace. */
18115 static tree
18117 {
18118 tree identifier;
18119 tree namespace_decl;
18123 /* Get the name of the namespace. */
18128 /* Look up the identifier in the currently active scope. Look only
18129 for namespaces, due to:
18131 [basic.lookup.udir]
18133 When looking up a namespace-name in a using-directive or alias
18134 definition, only namespace names are considered.
18136 And:
18138 [basic.lookup.qual]
18140 During the lookup of a name preceding the :: scope resolution
18141 operator, object, function, and enumerator names are ignored.
18143 (Note that cp_parser_qualifying_entity only calls this
18144 function if the token after the name is the scope resolution
18145 operator.) */
18147 none_type,
18153 /* If it's not a namespace, issue an error. */
18156 {
18161 }
18164 }
18166 /* Parse a namespace-definition.
18168 namespace-definition:
18169 named-namespace-definition
18170 unnamed-namespace-definition
18172 named-namespace-definition:
18173 original-namespace-definition
18174 extension-namespace-definition
18176 original-namespace-definition:
18177 namespace identifier { namespace-body }
18179 extension-namespace-definition:
18180 namespace original-namespace-name { namespace-body }
18182 unnamed-namespace-definition:
18183 namespace { namespace-body } */
18185 static void
18187 {
18188 tree identifier;
18197 {
18200 }
18202 /* Look for the `namespace' keyword. */
18203 cp_token* token
18206 /* Parse any specified attributes before the identifier. */
18210 {
18214 {
18217 /* Parse any attributes specified after the identifier. */
18219 }
18226 "nested namespace definitions only available with "
18229 /* Nested namespace names can create new namespaces (unlike
18230 other qualified-ids). */
18233 else
18236 }
18248 /* Start the namespace. */
18255 /* Look for the `{' to validate starting the namespace. */
18258 /* Parse the body of the namespace. */
18261 /* Look for the final `}'. */
18267 /* Pop the nested namespace definitions. */
18270 }
18272 /* Parse a namespace-body.
18274 namespace-body:
18275 declaration-seq [opt] */
18277 static void
18279 {
18281 }
18283 /* Parse a namespace-alias-definition.
18285 namespace-alias-definition:
18286 namespace identifier = qualified-namespace-specifier ; */
18288 static void
18290 {
18291 tree identifier;
18292 tree namespace_specifier;
18296 /* Look for the `namespace' keyword. */
18298 /* Look for the identifier. */
18302 /* Look for the `=' token. */
18305 {
18307 /* Skip the definition. */
18312 }
18314 /* Look for the qualified-namespace-specifier. */
18315 namespace_specifier
18317 /* Look for the `;' token. */
18320 /* Register the alias in the symbol table. */
18322 }
18324 /* Parse a qualified-namespace-specifier.
18326 qualified-namespace-specifier:
18327 :: [opt] nested-name-specifier [opt] namespace-name
18329 Returns a NAMESPACE_DECL corresponding to the specified
18330 namespace. */
18332 static tree
18334 {
18335 /* Look for the optional `::'. */
18339 /* Look for the optional nested-name-specifier. */
18347 }
18349 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18350 access declaration.
18352 using-declaration:
18353 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18354 using :: unqualified-id ;
18356 access-declaration:
18357 qualified-id ;
18359 */
18361 static bool
18364 {
18368 tree decl;
18369 tree identifier;
18370 tree qscope;
18375 {
18378 }
18379 else
18380 {
18381 /* Look for the `using' keyword. */
18384 again:
18385 /* Peek at the next token. */
18387 /* See if it's `typename'. */
18389 {
18390 /* Remember that we've seen it. */
18392 /* Consume the `typename' token. */
18394 }
18395 }
18397 /* Look for the optional global scope qualification. */
18398 global_scope_p
18403 /* If we saw `typename', or didn't see `::', then there must be a
18404 nested-name-specifier present. */
18406 {
18412 {
18415 }
18416 }
18417 /* Otherwise, we could be in either of the two productions. In that
18418 case, treat the nested-name-specifier as optional. */
18419 else
18431 /* Something has already gone wrong; there's no need to parse
18432 further. Since an error has occurred, the return value of
18433 cp_parser_parse_definitely will be false, as required. */
18437 /* Parse the unqualified-id. */
18445 {
18450 }
18452 {
18457 "pack expansion in using-declaration only available "
18460 }
18462 /* The function we call to handle a using-declaration is different
18463 depending on what scope we are in. */
18465 ;
18468 /* [namespace.udecl]
18470 A using declaration shall not name a template-id. */
18473 else
18474 {
18476 {
18477 /* Create the USING_DECL. */
18484 {
18487 }
18488 else
18489 /* Add it to the list of members in this class. */
18491 }
18492 else
18493 {
18495 identifier,
18502 {
18505 }
18508 else
18510 }
18511 }
18515 {
18519 "comma-separated list in using-declaration only available "
18522 }
18524 /* Look for the final `;'. */
18529 "access declarations are deprecated "
18530 "in favour of using-declarations; "
18534 }
18536 /* Parse an alias-declaration.
18538 alias-declaration:
18539 using identifier attribute-specifier-seq [opt] = type-id */
18541 static tree
18543 {
18545 location_t id_location;
18547 cp_decl_specifier_seq decl_specs;
18551 /* Look for the `using' keyword. */
18552 cp_token *using_token
18574 /* Now we are going to parse the type-id of the declaration. */
18576 /*
18577 [dcl.type]/3 says:
18579 "A type-specifier-seq shall not define a class or enumeration
18580 unless it appears in the type-id of an alias-declaration (7.1.3) that
18581 is not the declaration of a template-declaration."
18583 In other words, if we currently are in an alias template, the
18584 type-id should not define a type.
18586 So let's set parser->type_definition_forbidden_message in that
18587 case; cp_parser_check_type_definition (called by
18588 cp_parser_class_specifier) will then emit an error if a type is
18589 defined in the type-id. */
18591 {
18595 }
18599 /* Restore the error message if need be. */
18605 {
18608 }
18610 /* A typedef-name can also be introduced by an alias-declaration. The
18611 identifier following the using keyword becomes a typedef-name. It has
18612 the same semantics as if it were introduced by the typedef
18613 specifier. In particular, it does not define a new type and it shall
18614 not appear in the type-id. */
18619 {
18622 ds_attribute,
18623 attrs_token);
18624 }
18626 ds_typedef,
18627 using_token);
18629 ds_alias,
18630 using_token);
18639 else
18645 // Attach constraints to the alias declaration.
18647 {
18651 }
18658 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18659 added into the symbol table; otherwise, return the TYPE_DECL. */
18663 {
18667 }
18670 }
18672 /* Parse a using-directive.
18674 using-directive:
18675 using namespace :: [opt] nested-name-specifier [opt]
18676 namespace-name ; */
18678 static void
18680 {
18681 tree namespace_decl;
18682 tree attribs;
18684 /* Look for the `using' keyword. */
18686 /* And the `namespace' keyword. */
18688 /* Look for the optional `::' operator. */
18690 /* And the optional nested-name-specifier. */
18696 /* Get the namespace being used. */
18698 /* And any specified attributes. */
18701 /* Update the symbol table. */
18704 else
18707 /* Look for the final `;'. */
18709 }
18711 /* Parse an asm-definition.
18713 asm-definition:
18714 asm ( string-literal ) ;
18716 GNU Extension:
18718 asm-definition:
18719 asm volatile [opt] ( string-literal ) ;
18720 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18721 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18722 : asm-operand-list [opt] ) ;
18723 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18724 : asm-operand-list [opt]
18725 : asm-clobber-list [opt] ) ;
18726 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18727 : asm-clobber-list [opt]
18728 : asm-goto-list ) ; */
18730 static void
18732 {
18733 tree string;
18738 tree asm_stmt;
18746 /* Look for the `asm' keyword. */
18751 {
18754 }
18756 /* See if the next token is `volatile'. */
18759 {
18760 /* Remember that we saw the `volatile' keyword. */
18762 /* Consume the token. */
18764 }
18768 {
18769 /* Remember that we saw the `goto' keyword. */
18771 /* Consume the token. */
18773 }
18774 /* Look for the opening `('. */
18777 /* Look for the string. */
18780 {
18784 }
18786 /* If we're allowing GNU extensions, check for the extended assembly
18787 syntax. Unfortunately, the `:' tokens need not be separated by
18788 a space in C, and so, for compatibility, we tolerate that here
18789 too. Doing that means that we have to treat the `::' operator as
18790 two `:' tokens. */
18795 {
18800 /* The extended syntax was used. */
18803 /* Look for outputs. */
18805 {
18806 /* Consume the `:'. */
18808 /* Parse the output-operands. */
18810 CPP_COLON)
18812 CPP_SCOPE)
18814 CPP_CLOSE_PAREN)
18816 {
18820 }
18821 }
18822 /* If the next token is `::', there are no outputs, and the
18823 next token is the beginning of the inputs. */
18825 /* The inputs are coming next. */
18828 /* Look for inputs. */
18831 {
18832 /* Consume the `:' or `::'. */
18834 /* Parse the output-operands. */
18836 CPP_COLON)
18838 CPP_SCOPE)
18840 CPP_CLOSE_PAREN))
18841 {
18845 }
18846 }
18848 /* The clobbers are coming next. */
18851 /* Look for clobbers. */
18854 {
18856 /* Consume the `:' or `::'. */
18858 /* Parse the clobbers. */
18860 CPP_COLON)
18862 CPP_CLOSE_PAREN))
18864 }
18867 /* The labels are coming next. */
18870 /* Look for labels. */
18873 {
18875 /* Consume the `:' or `::'. */
18877 /* Parse the labels. */
18879 }
18883 }
18887 /* Look for the closing `)'. */
18895 {
18896 /* Create the ASM_EXPR. */
18898 {
18901 /* If the extended syntax was not used, mark the ASM_EXPR. */
18903 {
18909 }
18910 }
18911 else
18913 }
18914 }
18916 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18917 type that comes from the decl-specifier-seq. */
18919 static tree
18921 {
18924 {
18937 }
18940 }
18942 /* Declarators [gram.dcl.decl] */
18944 /* Parse an init-declarator.
18946 init-declarator:
18947 declarator initializer [opt]
18949 GNU Extension:
18951 init-declarator:
18952 declarator asm-specification [opt] attributes [opt] initializer [opt]
18954 function-definition:
18955 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18956 function-body
18957 decl-specifier-seq [opt] declarator function-try-block
18959 GNU Extension:
18961 function-definition:
18962 __extension__ function-definition
18964 TM Extension:
18966 function-definition:
18967 decl-specifier-seq [opt] declarator function-transaction-block
18969 The DECL_SPECIFIERS apply to this declarator. Returns a
18970 representation of the entity declared. If MEMBER_P is TRUE, then
18971 this declarator appears in a class scope. The new DECL created by
18972 this declarator is returned.
18974 The CHECKS are access checks that should be performed once we know
18975 what entity is being declared (and, therefore, what classes have
18976 befriended it).
18978 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18979 for a function-definition here as well. If the declarator is a
18980 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18981 be TRUE upon return. By that point, the function-definition will
18982 have been completely parsed.
18984 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18985 is FALSE.
18987 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18988 parsed declaration if it is an uninitialized single declarator not followed
18989 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18990 if present, will not be consumed. If returned, this declarator will be
18991 created with SD_INITIALIZED but will not call cp_finish_decl.
18993 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18994 and there is an initializer, the pointed location_t is set to the
18995 location of the '=' or `(', or '{' in C++11 token introducing the
18996 initializer. */
18998 static tree
19009 {
19013 tree prefix_attributes;
19015 tree asm_specification;
19016 tree initializer;
19018 tree scope;
19020 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19021 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19022 "(...)". */
19033 /* Gather the attributes that were provided with the
19034 decl-specifiers. */
19037 /* Assume that this is not the declarator for a function
19038 definition. */
19042 /* Default arguments are only permitted for function parameters. */
19046 /* Defer access checks while parsing the declarator; we cannot know
19047 what names are accessible until we know what is being
19048 declared. */
19053 /* Parse the declarator. */
19054 declarator
19059 /* Gather up the deferred checks. */
19064 /* If the DECLARATOR was erroneous, there's no need to go
19065 further. */
19069 /* Check that the number of template-parameter-lists is OK. */
19079 /* Figure out what scope the entity declared by the DECLARATOR is
19080 located in. `grokdeclarator' sometimes changes the scope, so
19081 we compute it now. */
19084 /* Perform any lookups in the declared type which were thought to be
19085 dependent, but are not in the scope of the declarator. */
19086 decl_specifiers->type
19089 /* If we're allowing GNU extensions, look for an
19090 asm-specification. */
19092 {
19093 /* Look for an asm-specification. */
19096 }
19097 else
19100 /* Look for attributes. */
19104 /* Peek at the next token. */
19110 {
19111 /* Handle C++17 deduction guides. */
19115 {
19123 {
19127 }
19128 }
19130 /* Check to see if the token indicates the start of a
19131 function-definition. */
19133 {
19135 {
19136 /* If a function-definition should not appear here, issue an
19137 error message. */
19141 }
19143 location_t func_brace_location
19146 /* Neither attributes nor an asm-specification are allowed
19147 on a function-definition. */
19150 "an asm-specification is not allowed "
19154 "attributes are not allowed "
19156 /* This is a function-definition. */
19159 /* Parse the function definition. */
19162 decl_specifiers,
19163 declarator,
19164 prefix_attributes);
19165 else
19166 decl =
19167 (cp_parser_function_definition_from_specifiers_and_declarator
19171 {
19172 /* This is where the prologue starts... */
19175 }
19178 }
19179 }
19181 {
19182 /* A non-template declaration involving a function parameter list
19183 containing an implicit template parameter will be made into a
19184 template. If the resulting declaration is not going to be an
19185 actual function then finish the template scope here to prevent it.
19186 An error message will be issued once we have a decl to talk about.
19188 FIXME probably we should do type deduction rather than create an
19189 implicit template, but the standard currently doesn't allow it. */
19192 }
19194 /* [dcl.dcl]
19196 Only in function declarations for constructors, destructors, type
19197 conversions, and deduction guides can the decl-specifier-seq be omitted.
19199 We explicitly postpone this check past the point where we handle
19200 function-definitions because we tolerate function-definitions
19201 that are missing their return types in some modes. */
19203 {
19207 }
19209 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19213 {
19224 {
19230 }
19231 }
19232 else
19233 {
19234 /* If the init-declarator isn't initialized and isn't followed by a
19235 `,' or `;', it's not a valid init-declarator. */
19238 {
19241 else
19242 {
19246 }
19247 }
19250 }
19252 /* Because start_decl has side-effects, we should only call it if we
19253 know we're going ahead. By this point, we know that we cannot
19254 possibly be looking at any other construct. */
19257 /* Enter the newly declared entry in the symbol table. If we're
19258 processing a declaration in a class-specifier, we wait until
19259 after processing the initializer. */
19261 {
19269 /* Adjust location of decl if declarator->id_loc is more appropriate:
19270 set, and decl wasn't merged with another decl, in which case its
19271 location would be different from input_location, and more accurate. */
19276 }
19278 /* Enter the SCOPE. That way unqualified names appearing in the
19279 initializer will be looked up in SCOPE. */
19282 /* Perform deferred access control checks, now that we know in which
19283 SCOPE the declared entity resides. */
19285 {
19288 /* If the entity being declared is a function, pretend that we
19289 are in its scope. If it is a `friend', it may have access to
19290 things that would not otherwise be accessible. */
19292 {
19295 }
19297 /* Perform access checks for template parameters. */
19300 /* Perform the access control checks for the declarator and the
19301 decl-specifiers. */
19304 /* Restore the saved value. */
19307 }
19309 /* Parse the initializer. */
19314 {
19316 {
19319 else
19320 {
19321 /* If the declaration was erroneous, we don't really
19322 know what the user intended, so just silently
19323 consume the initializer. */
19330 }
19331 }
19332 else
19333 {
19334 /* We want to record the extra mangling scope for in-class
19335 initializers of class members and initializers of static data
19336 member templates. The former involves deferring
19337 parsing of the initializer until end of class as with default
19338 arguments. So right here we only handle the latter. */
19348 }
19349 }
19351 /* The old parser allows attributes to appear after a parenthesized
19352 initializer. Mark Mitchell proposed removing this functionality
19353 on the GCC mailing lists on 2002-08-13. This parser accepts the
19354 attributes -- but ignores them. */
19361 /* And now complain about a non-function implicit template. */
19366 /* For an in-class declaration, use `grokfield' to create the
19367 declaration. */
19369 {
19371 {
19374 }
19383 }
19385 /* Finish processing the declaration. But, skip member
19386 declarations. */
19388 {
19391 asm_specification,
19392 /* If the initializer is in parentheses, then this is
19393 a direct-initialization, which means that an
19394 `explicit' constructor is OK. Otherwise, an
19395 `explicit' constructor cannot be used. */
19398 }
19401 /* Core issue #226 (C++0x only): A default template-argument
19402 shall not be specified in a friend class template
19403 declaration. */
19412 {
19415 else
19417 }
19424 }
19426 /* Parse a declarator.
19428 declarator:
19429 direct-declarator
19430 ptr-operator declarator
19432 abstract-declarator:
19433 ptr-operator abstract-declarator [opt]
19434 direct-abstract-declarator
19436 GNU Extensions:
19438 declarator:
19439 attributes [opt] direct-declarator
19440 attributes [opt] ptr-operator declarator
19442 abstract-declarator:
19443 attributes [opt] ptr-operator abstract-declarator [opt]
19444 attributes [opt] direct-abstract-declarator
19446 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19447 detect constructors, destructors, deduction guides, or conversion operators.
19448 It is set to -1 if the declarator is a name, and +1 if it is a
19449 function. Otherwise it is set to zero. Usually you just want to
19450 test for >0, but internally the negative value is used.
19452 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19453 a decl-specifier-seq unless it declares a constructor, destructor,
19454 or conversion. It might seem that we could check this condition in
19455 semantic analysis, rather than parsing, but that makes it difficult
19456 to handle something like `f()'. We want to notice that there are
19457 no decl-specifiers, and therefore realize that this is an
19458 expression, not a declaration.)
19460 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19461 the declarator is a direct-declarator of the form "(...)".
19463 MEMBER_P is true iff this declarator is a member-declarator.
19465 FRIEND_P is true iff this declarator is a friend. */
19469 cp_parser_declarator_kind dcl_kind,
19473 {
19476 cp_cv_quals cv_quals;
19477 tree class_type;
19480 /* Assume this is not a constructor, destructor, or type-conversion
19481 operator. */
19488 /* Check for the ptr-operator production. */
19490 /* Parse the ptr-operator. */
19496 /* If that worked, then we have a ptr-operator. */
19498 {
19499 /* If a ptr-operator was found, then this declarator was not
19500 parenthesized. */
19503 /* The dependent declarator is optional if we are parsing an
19504 abstract-declarator. */
19508 /* Parse the dependent declarator. */
19513 friend_p);
19515 /* If we are parsing an abstract-declarator, we must handle the
19516 case where the dependent declarator is absent. */
19521 declarator = cp_parser_make_indirect_declarator
19523 }
19524 /* Everything else is a direct-declarator. */
19525 else
19526 {
19529 CPP_OPEN_PAREN);
19531 ctor_dtor_or_conv_p,
19533 }
19538 }
19540 /* Parse a direct-declarator or direct-abstract-declarator.
19542 direct-declarator:
19543 declarator-id
19544 direct-declarator ( parameter-declaration-clause )
19545 cv-qualifier-seq [opt]
19546 ref-qualifier [opt]
19547 exception-specification [opt]
19548 direct-declarator [ constant-expression [opt] ]
19549 ( declarator )
19551 direct-abstract-declarator:
19552 direct-abstract-declarator [opt]
19553 ( parameter-declaration-clause )
19554 cv-qualifier-seq [opt]
19555 ref-qualifier [opt]
19556 exception-specification [opt]
19557 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19558 ( abstract-declarator )
19560 Returns a representation of the declarator. DCL_KIND is
19561 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19562 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19563 we are parsing a direct-declarator. It is
19564 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19565 of ambiguity we prefer an abstract declarator, as per
19566 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19567 as for cp_parser_declarator. */
19571 cp_parser_declarator_kind dcl_kind,
19574 {
19584 {
19585 /* Peek at the next token. */
19588 {
19589 /* This is either a parameter-declaration-clause, or a
19590 parenthesized declarator. When we know we are parsing a
19591 named declarator, it must be a parenthesized declarator
19592 if FIRST is true. For instance, `(int)' is a
19593 parameter-declaration-clause, with an omitted
19594 direct-abstract-declarator. But `((*))', is a
19595 parenthesized abstract declarator. Finally, when T is a
19596 template parameter `(T)' is a
19597 parameter-declaration-clause, and not a parenthesized
19598 named declarator.
19600 We first try and parse a parameter-declaration-clause,
19601 and then try a nested declarator (if FIRST is true).
19603 It is not an error for it not to be a
19604 parameter-declaration-clause, even when FIRST is
19605 false. Consider,
19607 int i (int);
19608 int i (3);
19610 The first is the declaration of a function while the
19611 second is the definition of a variable, including its
19612 initializer.
19614 Having seen only the parenthesis, we cannot know which of
19615 these two alternatives should be selected. Even more
19616 complex are examples like:
19618 int i (int (a));
19619 int i (int (3));
19621 The former is a function-declaration; the latter is a
19622 variable initialization.
19624 Thus again, we try a parameter-declaration-clause, and if
19625 that fails, we back out and return. */
19628 {
19629 tree params;
19632 /* In a member-declarator, the only valid interpretation
19633 of a parenthesis is the start of a
19634 parameter-declaration-clause. (It is invalid to
19635 initialize a static data member with a parenthesized
19636 initializer; only the "=" form of initialization is
19637 permitted.) */
19641 /* Consume the `('. */
19644 {
19645 /* If this is going to be an abstract declarator, we're
19646 in a declarator and we can't have default args. */
19649 }
19653 /* Parse the parameter-declaration-clause. */
19656 /* Consume the `)'. */
19659 /* If all went well, parse the cv-qualifier-seq,
19660 ref-qualifier and the exception-specification. */
19662 {
19663 cp_cv_quals cv_quals;
19664 cp_virt_specifiers virt_specifiers;
19665 cp_ref_qualifier ref_qual;
19666 tree exception_specification;
19667 tree late_return;
19668 tree attrs;
19678 /* Parse the cv-qualifier-seq. */
19680 /* Parse the ref-qualifier. */
19682 /* Parse the tx-qualifier. */
19684 /* And the exception-specification. */
19685 exception_specification
19690 /* In here, we handle cases where attribute is used after
19691 the function declaration. For example:
19692 void func (int x) __attribute__((vector(..))); */
19696 {
19700 CPP_SEMICOLON)
19702 CPP_OPEN_BRACE))
19705 ;
19706 else
19708 }
19710 late_return = (cp_parser_late_return_type_opt
19714 /* Parse the virt-specifier-seq. */
19717 /* Create the function-declarator. */
19719 params,
19720 cv_quals,
19721 virt_specifiers,
19722 ref_qual,
19723 tx_qual,
19724 exception_specification,
19725 late_return,
19726 requires_clause);
19729 /* Any subsequent parameter lists are to do with
19730 return type, so are not those of the declared
19731 function. */
19733 }
19735 /* Remove the function parms from scope. */
19739 /* Repeat the main loop. */
19741 }
19743 /* If this is the first, we can try a parenthesized
19744 declarator. */
19746 {
19752 /* Consume the `('. */
19754 /* Parse the nested declarator. */
19757 declarator
19763 /* Expect a `)'. */
19770 }
19771 /* Otherwise, we must be done. */
19772 else
19774 }
19778 {
19779 /* Parse an array-declarator. */
19788 /* Consume the `['. */
19790 /* Peek at the next token. */
19792 /* If the next token is `]', then there is no
19793 constant-expression. */
19795 {
19797 bounds
19807 {
19808 /* Normally, the array bound must be an integral constant
19809 expression. However, as an extension, we allow VLAs
19810 in function scopes as long as they aren't part of a
19811 parameter declaration. */
19815 }
19818 {
19819 /* Remember this wasn't a constant-expression. */
19822 }
19823 }
19824 else
19826 /* Look for the closing `]'. */
19828 {
19831 }
19836 }
19838 {
19839 {
19840 tree qualifying_scope;
19841 tree unqualified_name;
19842 tree attrs;
19843 special_function_kind sfk;
19848 /* Parse a declarator-id */
19851 {
19854 /* If we see an ellipsis, we should be looking at a
19855 parameter pack. */
19857 {
19858 /* Consume the `...' */
19862 }
19863 }
19866 unqualified_name
19870 {
19874 {
19875 /* Check whether an error occurred. */
19878 /* We already consumed the ellipsis to mark a
19879 parameter pack, but we have no way to report it,
19880 so abort the tentative parse. We will be exiting
19881 immediately anyway. */
19883 }
19884 else
19890 && (qualifying_scope
19892 {
19895 }
19896 }
19901 {
19906 }
19912 {
19913 /* In the declaration of a member of a template class
19914 outside of the class itself, the SCOPE will sometimes
19915 be a TYPENAME_TYPE. For example, given:
19917 template <typename T>
19918 int S<T>::R::i = 3;
19920 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19921 this context, we must resolve S<T>::R to an ordinary
19922 type, rather than a typename type.
19924 The reason we normally avoid resolving TYPENAME_TYPEs
19925 is that a specialization of `S' might render
19926 `S<T>::R' not a type. However, if `S' is
19927 specialized, then this `i' will not be used, so there
19928 is no harm in resolving the types here. */
19929 tree type;
19931 /* Resolve the TYPENAME_TYPE. */
19934 /* If that failed, the declarator is invalid. */
19936 {
19939 "cannot define member of dependent typedef "
19941 else
19946 }
19948 }
19953 {
19954 tree class_type;
19959 else
19963 {
19966 {
19969 {
19973 "use %<%T::%D%> instead of %<%T::%D%> to "
19975 class_type,
19980 }
19981 else
19983 }
19984 else
19985 {
19986 /* We do not attempt to print the declarator
19987 here because we do not have enough
19988 information about its original syntactic
19989 form. */
19993 }
19994 }
19997 {
20003 for an unnamed type, even if the type
20004 got a name for linkage purposes. */
20006 /* Handle correctly (c++/19200):
20008 struct S {
20009 struct T{};
20010 friend void S(T);
20011 };
20013 and also:
20015 namespace N {
20016 void S();
20017 }
20019 struct S {
20020 friend void N::S();
20021 }; */
20022 && !(friend_p
20025 class_type))
20026 {
20029 }
20037 }
20038 }
20040 unqualified_name,
20041 sfk);
20048 }
20050 handle_declarator:;
20053 {
20054 /* Any names that appear after the declarator-id for a
20055 member are looked up in the containing scope. */
20057 {
20058 /* But declarations with qualified-ids can't appear in a
20059 function. */
20063 }
20065 }
20069 /* Default args are only allowed on function
20070 declarations. */
20072 else
20076 }
20077 /* We're done. */
20078 else
20080 }
20082 /* For an abstract declarator, we might wind up with nothing at this
20083 point. That's an error; the declarator is not optional. */
20087 /* If we entered a scope, we must exit it now. */
20095 }
20097 /* Parse a ptr-operator.
20099 ptr-operator:
20100 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20101 * cv-qualifier-seq [opt]
20102 &
20103 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20104 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20106 GNU Extension:
20108 ptr-operator:
20109 & cv-qualifier-seq [opt]
20111 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20112 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20113 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20114 filled in with the TYPE containing the member. *CV_QUALS is
20115 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20116 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20117 Note that the tree codes returned by this function have nothing
20118 to do with the types of trees that will be eventually be created
20119 to represent the pointer or reference type being parsed. They are
20120 just constants with suggestive names. */
20121 static enum tree_code
20126 {
20131 /* Assume that it's not a pointer-to-member. */
20133 /* And that there are no cv-qualifiers. */
20136 /* Peek at the next token. */
20139 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20149 {
20150 /* Consume the `*', `&' or `&&'. */
20153 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20154 `&', if we are allowing GNU extensions. (The only qualifier
20155 that can legally appear after `&' is `restrict', but that is
20156 enforced during semantic analysis. */
20164 }
20165 else
20166 {
20167 /* Try the pointer-to-member case. */
20169 /* Look for the optional `::' operator. */
20172 /* Look for the nested-name specifier. */
20179 /* If we found it, and the next token is a `*', then we are
20180 indeed looking at a pointer-to-member operator. */
20183 {
20184 /* Indicate that the `*' operator was used. */
20192 else
20193 {
20194 /* The type of which the member is a member is given by the
20195 current SCOPE. */
20197 /* The next name will not be qualified. */
20201 /* Look for optional c++11 attributes. */
20205 /* Look for the optional cv-qualifier-seq. */
20207 }
20208 }
20209 /* If that didn't work we don't have a ptr-operator. */
20212 }
20215 }
20217 /* Parse an (optional) cv-qualifier-seq.
20219 cv-qualifier-seq:
20220 cv-qualifier cv-qualifier-seq [opt]
20222 cv-qualifier:
20223 const
20224 volatile
20226 GNU Extension:
20228 cv-qualifier:
20229 __restrict__
20231 Returns a bitmask representing the cv-qualifiers. */
20233 static cp_cv_quals
20235 {
20239 {
20241 cp_cv_quals cv_qualifier;
20243 /* Peek at the next token. */
20245 /* See if it's a cv-qualifier. */
20247 {
20263 }
20269 {
20274 }
20275 else
20276 {
20279 }
20280 }
20283 }
20285 /* Parse an (optional) ref-qualifier
20287 ref-qualifier:
20288 &
20289 &&
20291 Returns cp_ref_qualifier representing ref-qualifier. */
20293 static cp_ref_qualifier
20295 {
20298 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20303 {
20308 {
20320 }
20325 {
20328 }
20329 else
20330 {
20333 }
20334 }
20337 }
20339 /* Parse an optional tx-qualifier.
20341 tx-qualifier:
20342 transaction_safe
20343 transaction_safe_dynamic */
20345 static tree
20347 {
20350 {
20355 {
20359 {
20362 {
20365 }
20366 else
20368 }
20369 }
20370 }
20372 }
20374 /* Parse an (optional) virt-specifier-seq.
20376 virt-specifier-seq:
20377 virt-specifier virt-specifier-seq [opt]
20379 virt-specifier:
20380 override
20381 final
20383 Returns a bitmask representing the virt-specifiers. */
20385 static cp_virt_specifiers
20387 {
20391 {
20393 cp_virt_specifiers virt_specifier;
20395 /* Peek at the next token. */
20397 /* See if it's a virt-specifier-qualifier. */
20401 {
20404 }
20406 {
20409 }
20411 {
20413 }
20414 else
20418 {
20423 }
20424 else
20425 {
20428 }
20429 }
20431 }
20433 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20434 is in scope even though it isn't real. */
20436 void
20438 {
20439 tree this_parm;
20442 {
20443 /* We don't clear this between NSDMIs. Is it already what we want? */
20448 }
20451 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20453 current_class_ref
20456 }
20458 /* Return true iff our current scope is a non-static data member
20459 initializer. */
20461 bool
20463 {
20464 /* We recognize NSDMI context by the context-less 'this' pointer set up
20465 by the function above. */
20471 }
20473 /* Return true iff our current scope is a default capturing generic lambda
20474 defined within a template. FIXME: This is part of a workaround (see
20475 semantics.c) to handle building lambda closure types correctly in templates
20476 which we ultimately want to defer to instantiation time. */
20478 bool
20480 {
20498 }
20500 /* Parse a late-specified return type, if any. This is not a separate
20501 non-terminal, but part of a function declarator, which looks like
20503 -> trailing-type-specifier-seq abstract-declarator(opt)
20505 Returns the type indicated by the type-id.
20507 In addition to this, parse any queued up #pragma omp declare simd
20508 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20509 #pragma acc routine clauses.
20511 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20512 function. */
20514 static tree
20517 {
20521 && declarator
20528 && declarator
20531 /* Peek at the next token. */
20533 /* A late-specified return type is indicated by an initial '->'. */
20544 {
20545 /* DR 1207: 'this' is in scope in the trailing return type. */
20547 }
20550 {
20551 /* Consume the ->. */
20555 }
20557 /* Function declarations may be followed by a trailing
20558 requires-clause. */
20562 declarator->attributes
20566 declarator->attributes
20570 declarator->attributes
20575 {
20578 }
20581 }
20583 /* Parse a declarator-id.
20585 declarator-id:
20586 id-expression
20587 :: [opt] nested-name-specifier [opt] type-name
20589 In the `id-expression' case, the value returned is as for
20590 cp_parser_id_expression if the id-expression was an unqualified-id.
20591 If the id-expression was a qualified-id, then a SCOPE_REF is
20592 returned. The first operand is the scope (either a NAMESPACE_DECL
20593 or TREE_TYPE), but the second is still just a representation of an
20594 unqualified-id. */
20596 static tree
20598 {
20599 tree id;
20600 /* The expression must be an id-expression. Assume that qualified
20601 names are the names of types so that:
20603 template <class T>
20604 int S<T>::R::i = 3;
20606 will work; we must treat `S<T>::R' as the name of a type.
20607 Similarly, assume that qualified names are templates, where
20608 required, so that:
20610 template <class T>
20611 int S<T>::R<T>::i = 3;
20613 will work, too. */
20619 optional_p);
20623 }
20625 /* Parse a type-id.
20627 type-id:
20628 type-specifier-seq abstract-declarator [opt]
20630 Returns the TYPE specified. */
20632 static tree
20635 {
20636 cp_decl_specifier_seq type_specifier_seq;
20639 /* Parse the type-specifier-seq. */
20641 is_trailing_return,
20646 /* A bare template name as a template argument is a template template
20647 argument, not a placeholder, so fail parsing it as a type argument. */
20648 {
20652 }
20656 /* There might or might not be an abstract declarator. */
20658 /* Look for the declarator. */
20659 abstract_declarator
20664 /* Check to see if there really was a declarator. */
20669 /* The concepts TS allows 'auto' as a type-id. */
20671 /* None of the valid uses of 'auto' in C++14 involve the type-id
20672 nonterminal, but it is valid in a trailing-return-type. */
20675 {
20676 /* A type-id with type 'auto' is only ok if the abstract declarator
20677 is a function declarator with a late-specified return type.
20679 A type-id with 'auto' is also valid in a trailing-return-type
20680 in a compound-requirement. */
20687 else
20688 {
20691 {
20693 auto_node);
20695 tmpl);
20696 }
20697 else
20700 }
20701 }
20704 is_template_arg);
20705 }
20707 static tree
20709 {
20711 }
20713 static tree
20715 {
20716 tree r;
20718 parser->type_definition_forbidden_message
20723 {
20726 }
20728 }
20730 static tree
20732 {
20734 }
20736 /* Parse a type-specifier-seq.
20738 type-specifier-seq:
20739 type-specifier type-specifier-seq [opt]
20741 GNU extension:
20743 type-specifier-seq:
20744 attributes type-specifier-seq [opt]
20746 If IS_DECLARATION is true, we are at the start of a "condition" or
20747 exception-declaration, so we might be followed by a declarator-id.
20749 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20750 i.e. we've just seen "->".
20752 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20754 static void
20759 {
20764 /* Clear the TYPE_SPECIFIER_SEQ. */
20767 /* In the context of a trailing return type, enum E { } is an
20768 elaborated-type-specifier followed by a function-body, not an
20769 enum-specifier. */
20773 /* Parse the type-specifiers and attributes. */
20775 {
20776 tree type_specifier;
20779 /* Check for attributes first. */
20781 {
20786 }
20788 /* record the token of the beginning of the type specifier seq,
20789 for error reporting purposes*/
20793 /* Look for the type-specifier. */
20795 flags,
20796 type_specifier_seq,
20798 NULL,
20801 {
20802 /* If the first type-specifier could not be found, this is not a
20803 type-specifier-seq at all. */
20805 {
20806 /* Set in_declarator_p to avoid skipping to the semicolon. */
20818 }
20819 /* If subsequent type-specifiers could not be found, the
20820 type-specifier-seq is complete. */
20822 }
20825 /* The standard says that a condition can be:
20827 type-specifier-seq declarator = assignment-expression
20829 However, given:
20831 struct S {};
20832 if (int S = ...)
20834 we should treat the "S" as a declarator, not as a
20835 type-specifier. The standard doesn't say that explicitly for
20836 type-specifier-seq, but it does say that for
20837 decl-specifier-seq in an ordinary declaration. Perhaps it
20838 would be clearer just to allow a decl-specifier-seq here, and
20839 then add a semantic restriction that if any decl-specifiers
20840 that are not type-specifiers appear, the program is invalid. */
20843 }
20844 }
20846 /* Return whether the function currently being declared has an associated
20847 template parameter list. */
20849 static bool
20851 {
20864 }
20866 /* Parse a parameter-declaration-clause.
20868 parameter-declaration-clause:
20869 parameter-declaration-list [opt] ... [opt]
20870 parameter-declaration-list , ...
20872 Returns a representation for the parameter declarations. A return
20873 value of NULL indicates a parameter-declaration-clause consisting
20874 only of an ellipsis. */
20876 static tree
20878 {
20879 tree parameters;
20888 parser->auto_is_implicit_function_template_parm_p
20890 }
20896 && !processing_template_parmlist
20902 /* Peek at the next token. */
20904 /* Check for trivial parameter-declaration-clauses. */
20906 {
20907 /* Consume the `...' token. */
20910 }
20912 /* There are no parameters. */
20913 {
20914 #ifndef NO_IMPLICIT_EXTERN_C
20919 else
20920 #endif
20922 }
20923 /* Check for `(void)', too, which is a special case. */
20927 {
20928 /* Consume the `void' token. */
20930 /* There are no parameters. */
20932 }
20934 /* Parse the parameter-declaration-list. */
20936 /* If a parse error occurred while parsing the
20937 parameter-declaration-list, then the entire
20938 parameter-declaration-clause is erroneous. */
20942 /* Peek at the next token. */
20944 /* If it's a `,', the clause should terminate with an ellipsis. */
20946 {
20947 /* Consume the `,'. */
20949 /* Expect an ellipsis. */
20950 ellipsis_p
20952 }
20953 /* It might also be `...' if the optional trailing `,' was
20954 omitted. */
20956 {
20957 /* Consume the `...' token. */
20959 /* And remember that we saw it. */
20961 }
20962 else
20965 /* Finish the parameter list. */
20970 }
20972 /* Parse a parameter-declaration-list.
20974 parameter-declaration-list:
20975 parameter-declaration
20976 parameter-declaration-list , parameter-declaration
20978 Returns a representation of the parameter-declaration-list, as for
20979 cp_parser_parameter_declaration_clause. However, the
20980 `void_list_node' is never appended to the list. Upon return,
20981 *IS_ERROR will be true iff an error occurred. */
20983 static tree
20985 {
20991 /* Assume all will go well. */
20993 /* The special considerations that apply to a function within an
20994 unbraced linkage specifications do not apply to the parameters
20995 to the function. */
20996 saved_in_unbraced_linkage_specification_p
21000 /* Look for more parameters. */
21002 {
21010 /* Parse the parameter. */
21011 parameter
21016 /* We don't know yet if the enclosing context is deprecated, so wait
21017 and warn in grokparms if appropriate. */
21021 {
21022 /* If a function parameter pack was specified and an implicit template
21023 parameter was introduced during cp_parser_parameter_declaration,
21024 change any implicit parameters introduced into packs. */
21028 {
21036 }
21040 PARM,
21043 }
21047 /* If a parse error occurred parsing the parameter declaration,
21048 then the entire parameter-declaration-list is erroneous. */
21050 {
21054 }
21064 {
21068 }
21070 /* Add the new parameter to the list. */
21074 /* Peek at the next token. */
21077 /* These are for Objective-C++ */
21080 /* The parameter-declaration-list is complete. */
21083 {
21086 /* Peek at the next token. */
21088 /* If it's an ellipsis, then the list is complete. */
21091 /* Otherwise, there must be more parameters. Consume the
21092 `,'. */
21094 /* When parsing something like:
21096 int i(float f, double d)
21098 we can tell after seeing the declaration for "f" that we
21099 are not looking at an initialization of a variable "i",
21100 but rather at the declaration of a function "i".
21102 Due to the fact that the parsing of template arguments
21103 (as specified to a template-id) requires backtracking we
21104 cannot use this technique when inside a template argument
21105 list. */
21109 /* However, a parameter-declaration of the form
21110 "float(f)" (which is a valid declaration of a
21111 parameter "f") can also be interpreted as an
21112 expression (the conversion of "f" to "float"). */
21115 }
21116 else
21117 {
21125 }
21126 }
21128 parser->in_unbraced_linkage_specification_p
21131 /* Reset implicit_template_scope if we are about to leave the function
21132 parameter list that introduced it. Note that for out-of-line member
21133 definitions, there will be one or more class scopes before we get to
21134 the template parameter scope. */
21138 {
21142 {
21145 }
21146 }
21149 }
21151 /* Parse a parameter declaration.
21153 parameter-declaration:
21154 decl-specifier-seq ... [opt] declarator
21155 decl-specifier-seq declarator = assignment-expression
21156 decl-specifier-seq ... [opt] abstract-declarator [opt]
21157 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21159 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21160 declares a template parameter. (In that case, a non-nested `>'
21161 token encountered during the parsing of the assignment-expression
21162 is not interpreted as a greater-than operator.)
21164 Returns a representation of the parameter, or NULL if an error
21165 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21166 true iff the declarator is of the form "(p)". */
21172 {
21174 cp_decl_specifier_seq decl_specifiers;
21176 tree default_argument;
21181 /* In a template parameter, `>' is not an operator.
21183 [temp.param]
21185 When parsing a default template-argument for a non-type
21186 template-parameter, the first non-nested `>' is taken as the end
21187 of the template parameter-list rather than a greater-than
21188 operator. */
21190 /* Type definitions may not appear in parameter types. */
21192 parser->type_definition_forbidden_message
21195 /* Parse the declaration-specifiers. */
21197 CP_PARSER_FLAGS_NONE,
21201 /* Complain about missing 'typename' or other invalid type names. */
21206 /* If an error occurred, there's no reason to attempt to parse the
21207 rest of the declaration. */
21209 {
21212 }
21214 /* Peek at the next token. */
21217 /* If the next token is a `)', `,', `=', `>', or `...', then there
21218 is no declarator. However, when variadic templates are enabled,
21219 there may be a declarator following `...'. */
21224 {
21228 }
21229 /* Otherwise, there should be a declarator. */
21230 else
21231 {
21235 /* After seeing a decl-specifier-seq, if the next token is not a
21236 "(", there is no possibility that the code is a valid
21237 expression. Therefore, if parsing tentatively, we commit at
21238 this point. */
21240 /* In an expression context, having seen:
21242 (int((char ...
21244 we cannot be sure whether we are looking at a
21245 function-type (taking a "char" as a parameter) or a cast
21246 of some object of type "char" to "int". */
21252 /* Parse the declarator. */
21255 CP_PARSER_DECLARATOR_EITHER,
21257 parenthesized_p,
21261 /* After the declarator, allow more attributes. */
21262 decl_specifiers.attributes
21266 /* If the declarator is a template parameter pack, remember that and
21267 clear the flag in the declarator itself so we don't get errors
21268 from grokdeclarator. */
21270 {
21273 }
21274 }
21276 /* If the next token is an ellipsis, and we have not seen a declarator
21277 name, and if either the type of the declarator contains parameter
21278 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21279 for, eg, abbreviated integral type names), then we actually have a
21280 parameter pack expansion expression. Otherwise, leave the ellipsis
21281 for a C-style variadic function. */
21284 {
21295 {
21296 /* Consume the `...'. */
21300 /* Build a pack expansion type */
21305 else
21307 }
21308 }
21310 /* The restriction on defining new types applies only to the type
21311 of the parameter, not to the default argument. */
21314 /* If the next token is `=', then process a default argument. */
21316 {
21319 /* If we are defining a class, then the tokens that make up the
21320 default argument must be saved and processed later. */
21326 // A constrained-type-specifier may declare a type template-parameter.
21328 default_argument
21331 // A constrained-type-specifier may declare a template-template-parameter.
21333 default_argument
21336 /* Outside of a class definition, we can just parse the
21337 assignment-expression. */
21338 else
21339 default_argument
21343 {
21345 "default arguments are only "
21347 }
21349 || template_parameter_pack_p
21352 {
21353 /* Find the name of the parameter pack. */
21360 template_parm_p
21366 else
21368 template_parm_p
21375 }
21376 }
21377 else
21381 declarator,
21382 default_argument,
21383 template_parameter_pack_p);
21384 }
21386 /* Parse a default argument and return it.
21388 TEMPLATE_PARM_P is true if this is a default argument for a
21389 non-type template parameter. */
21390 static tree
21392 {
21398 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21399 set correctly. */
21402 /* Local variable names (and the `this' keyword) may not
21403 appear in a default argument. */
21406 /* Parse the assignment-expression. */
21411 /* The "this" pointer is not valid in a default argument. */
21413 {
21418 }
21419 default_argument
21421 /* Restore the "this" pointer. */
21423 {
21426 }
21435 }
21437 /* Parse a function-body.
21439 function-body:
21440 compound_statement */
21442 static void
21444 {
21448 }
21450 /* Parse a ctor-initializer-opt followed by a function-body. Return
21451 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21452 is true we are parsing a function-try-block. */
21454 static bool
21457 {
21465 /* Begin the function body. */
21467 /* Parse the optional ctor-initializer. */
21470 /* If we're parsing a constexpr constructor definition, we need
21471 to check that the constructor body is indeed empty. However,
21472 before we get to cp_parser_function_body lot of junk has been
21473 generated, so we can't just check that we have an empty block.
21474 Rather we take a snapshot of the outermost block, and check whether
21475 cp_parser_function_body changed its state. */
21477 {
21481 }
21482 /* Parse the function-body. */
21486 /* Finish the function body. */
21490 }
21492 /* Parse an initializer.
21494 initializer:
21495 = initializer-clause
21496 ( expression-list )
21498 Returns an expression representing the initializer. If no
21499 initializer is present, NULL_TREE is returned.
21501 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21502 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21503 set to TRUE if there is no initializer present. If there is an
21504 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21505 is set to true; otherwise it is set to false. */
21507 static tree
21510 {
21512 tree init;
21514 /* Peek at the next token. */
21517 /* Let our caller know whether or not this initializer was
21518 parenthesized. */
21520 /* Assume that the initializer is constant. */
21524 {
21525 /* Consume the `='. */
21527 /* Parse the initializer-clause. */
21529 }
21531 {
21536 non_constant_p);
21541 }
21543 {
21548 }
21549 else
21550 {
21551 /* Anything else is an error. */
21554 }
21560 }
21562 /* Parse an initializer-clause.
21564 initializer-clause:
21565 assignment-expression
21566 braced-init-list
21568 Returns an expression representing the initializer.
21570 If the `assignment-expression' production is used the value
21571 returned is simply a representation for the expression.
21573 Otherwise, calls cp_parser_braced_list. */
21575 static cp_expr
21577 {
21578 cp_expr initializer;
21580 /* Assume the expression is constant. */
21583 /* If it is not a `{', then we are looking at an
21584 assignment-expression. */
21586 {
21587 initializer
21590 non_constant_p);
21591 }
21592 else
21596 }
21598 /* Parse a brace-enclosed initializer list.
21600 braced-init-list:
21601 { initializer-list , [opt] }
21602 { }
21604 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21605 the elements of the initializer-list (or NULL, if the last
21606 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21607 NULL_TREE. There is no way to detect whether or not the optional
21608 trailing `,' was provided. NON_CONSTANT_P is as for
21609 cp_parser_initializer. */
21611 static cp_expr
21613 {
21614 tree initializer;
21617 /* Consume the `{' token. */
21619 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21621 /* If it's not a `}', then there is a non-trivial initializer. */
21623 {
21624 /* Parse the initializer list. */
21627 /* A trailing `,' token is allowed. */
21630 }
21631 else
21633 /* Now, there should be a trailing `}'. */
21639 /* Build a location of the form:
21640 { ... }
21641 ^~~~~~~
21642 with caret==start at the open brace, finish at the close brace. */
21646 }
21648 /* Consume tokens up to, and including, the next non-nested closing `]'.
21649 Returns true iff we found a closing `]'. */
21651 static bool
21653 {
21657 {
21661 {
21664 /* If we've run out of tokens, then there is no closing `]'. */
21673 {
21676 }
21681 }
21683 /* Consume the token. */
21685 }
21686 }
21688 /* Return true if we are looking at an array-designator, false otherwise. */
21690 static bool
21692 {
21693 /* Consume the `['. */
21698 /* Skip tokens until the next token is a closing square bracket.
21699 If we find the closing `]', and the next token is a `=', then
21700 we are looking at an array designator. */
21701 bool array_designator_p
21705 /* Roll back the tokens we skipped. */
21709 }
21711 /* Parse an initializer-list.
21713 initializer-list:
21714 initializer-clause ... [opt]
21715 initializer-list , initializer-clause ... [opt]
21717 GNU Extension:
21719 initializer-list:
21720 designation initializer-clause ...[opt]
21721 initializer-list , designation initializer-clause ...[opt]
21723 designation:
21724 . identifier =
21725 identifier :
21726 [ constant-expression ] =
21728 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21729 for the initializer. If the INDEX of the elt is non-NULL, it is the
21730 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21731 as for cp_parser_initializer. */
21735 {
21738 /* Assume all of the expressions are constant. */
21741 /* Parse the rest of the list. */
21743 {
21745 tree designator;
21746 tree initializer;
21749 /* If the next token is an identifier and the following one is a
21750 colon, we are looking at the GNU designated-initializer
21751 syntax. */
21755 {
21756 /* Warn the user that they are using an extension. */
21759 /* Consume the identifier. */
21761 /* Consume the `:'. */
21763 }
21764 /* Also handle the C99 syntax, '. id ='. */
21769 {
21770 /* Warn the user that they are using an extension. */
21773 /* Consume the `.'. */
21775 /* Consume the identifier. */
21777 /* Consume the `='. */
21779 }
21780 /* Also handle C99 array designators, '[ const ] ='. */
21784 {
21785 /* In C++11, [ could start a lambda-introducer. */
21791 {
21794 }
21795 else
21796 {
21801 }
21807 }
21808 else
21811 /* Parse the initializer. */
21814 /* If any clause is non-constant, so is the entire initializer. */
21818 /* If we have an ellipsis, this is an initializer pack
21819 expansion. */
21821 {
21822 /* Consume the `...'. */
21825 /* Turn the initializer into an initializer expansion. */
21827 }
21829 /* Add it to the vector. */
21832 /* If the next token is not a comma, we have reached the end of
21833 the list. */
21837 /* Peek at the next token. */
21839 /* If the next token is a `}', then we're still done. An
21840 initializer-clause can have a trailing `,' after the
21841 initializer-list and before the closing `}'. */
21845 /* Consume the `,' token. */
21847 }
21850 }
21852 /* Classes [gram.class] */
21854 /* Parse a class-name.
21856 class-name:
21857 identifier
21858 template-id
21860 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21861 to indicate that names looked up in dependent types should be
21862 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21863 keyword has been used to indicate that the name that appears next
21864 is a template. TAG_TYPE indicates the explicit tag given before
21865 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21866 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21867 is the class being defined in a class-head. If ENUM_OK is TRUE,
21868 enum-names are also accepted.
21870 Returns the TYPE_DECL representing the class. */
21872 static tree
21881 {
21882 tree decl;
21883 tree scope;
21888 /* All class-names start with an identifier. */
21891 {
21894 }
21896 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21897 to a template-id, so we save it here. */
21902 /* Any name names a type if we're following the `typename' keyword
21903 in a qualified name where the enclosing scope is type-dependent. */
21906 /* Handle the common case (an identifier, but not a template-id)
21907 efficiently. */
21910 {
21914 /* Look for the identifier. */
21918 /* If the next token isn't an identifier, we are certainly not
21919 looking at a class-name. */
21922 /* If we know this is a type-name, there's no need to look it
21923 up. */
21926 else
21927 {
21928 tree ambiguous_decls;
21929 /* If we already know that this lookup is ambiguous, then
21930 we've already issued an error message; there's no reason
21931 to check again. */
21933 {
21936 }
21937 /* If the next token is a `::', then the name must be a type
21938 name.
21940 [basic.lookup.qual]
21942 During the lookup for a name preceding the :: scope
21943 resolution operator, object, function, and enumerator
21944 names are ignored. */
21947 /* Look up the name. */
21949 tag_type,
21952 check_dependency_p,
21956 {
21960 }
21961 }
21962 }
21963 else
21964 {
21965 /* Try a template-id. */
21967 check_dependency_p,
21968 tag_type,
21969 is_declaration);
21972 }
21976 /* If this is a typename, create a TYPENAME_TYPE. */
21978 {
21983 }
21987 /* Check to see that it is really the name of a class. */
21991 /* Situations like this:
21993 template <typename T> struct A {
21994 typename T::template X<int>::I i;
21995 };
21997 are problematic. Is `T::template X<int>' a class-name? The
21998 standard does not seem to be definitive, but there is no other
21999 valid interpretation of the following `::'. Therefore, those
22000 names are considered class-names. */
22001 {
22005 }
22010 /* In Objective-C 2.0, a classname followed by '.' starts a
22011 dot-syntax expression, and it's not a type-name. */
22023 }
22025 /* Parse a class-specifier.
22027 class-specifier:
22028 class-head { member-specification [opt] }
22030 Returns the TREE_TYPE representing the class. */
22032 static tree
22034 {
22035 tree type;
22049 /* Parse the class-head. */
22052 /* If the class-head was a semantic disaster, skip the entire body
22053 of the class. */
22055 {
22059 }
22061 /* Look for the `{'. */
22063 {
22066 }
22071 /* Issue an error message if type-definitions are forbidden here. */
22073 /* Remember that we are defining one more class. */
22075 /* Inside the class, surrounding template-parameter-lists do not
22076 apply. */
22077 saved_num_template_parameter_lists
22080 /* We are not in a function body. */
22083 /* Or in a loop. */
22086 /* Or in a switch. */
22089 /* We are not immediately inside an extern "lang" block. */
22090 saved_in_unbraced_linkage_specification_p
22094 // Associate constraints with the type.
22098 /* Start the class. */
22100 {
22103 }
22107 /* If the type is erroneous, skip the entire body of the class. */
22109 else
22110 /* Parse the member-specification. */
22113 /* Look for the trailing `}'. */
22115 /* Look for trailing attributes to apply to this class. */
22123 /* We've finished a type definition. Check for the common syntax
22124 error of forgetting a semicolon after the definition. We need to
22125 be careful, as we can't just check for not-a-semicolon and be done
22126 with it; the user might have typed:
22128 class X { } c = ...;
22129 class X { } *p = ...;
22131 and so forth. Instead, enumerate all the possible tokens that
22132 might follow this production; if we don't see one of them, then
22133 complain and silently insert the semicolon. */
22134 {
22139 /* Don't try to parse c++11 attributes here. As per the
22140 grammar, that should be a task for
22141 cp_parser_decl_specifier_seq. */
22145 {
22156 /* While it's legal for type qualifiers and storage class
22157 specifiers to follow type definitions in the grammar, only
22158 compiler testsuites contain code like that. Assume that if
22159 we see such code, then what we're really seeing is a case
22160 like:
22162 class X { }
22163 const <type> var = ...;
22165 or
22167 class Y { }
22168 static <type> func (...) ...
22170 i.e. the qualifier or specifier applies to the next
22171 declaration. To do so, however, we need to look ahead one
22172 more token to see if *that* token is a type specifier.
22174 This code could be improved to handle:
22176 class Z { }
22177 static const <type> var = ...; */
22180 {
22183 /* Handling user-defined types here would be nice, but very
22184 tricky. */
22185 want_semicolon
22188 }
22192 }
22194 /* If we don't have a type, then something is very wrong and we
22195 shouldn't try to do anything clever. Likewise for not seeing the
22196 closing brace. */
22198 {
22199 /* Locate the closing brace. */
22200 cp_token_position prev
22205 /* We want to suggest insertion of a ';' immediately *after* the
22206 closing brace, so, if we can, offset the location by 1 column. */
22213 /* If we successfully offset the location, suggest the fix-it. */
22226 else
22229 /* Unget one token and smash it to look as though we encountered
22230 a semicolon in the input stream. */
22235 }
22236 }
22238 /* If this class is not itself within the scope of another class,
22239 then we need to parse the bodies of all of the queued function
22240 definitions. Note that the queued functions defined in a class
22241 are not always processed immediately following the
22242 class-specifier for that class. Consider:
22244 struct A {
22245 struct B { void f() { sizeof (A); } };
22246 };
22248 If `f' were processed before the processing of `A' were
22249 completed, there would be no way to compute the size of `A'.
22250 Note that the nesting we are interested in here is lexical --
22251 not the semantic nesting given by TYPE_CONTEXT. In particular,
22252 for:
22254 struct A { struct B; };
22255 struct A::B { void f() { } };
22257 there is no need to delay the parsing of `A::B::f'. */
22259 {
22260 tree decl;
22267 /* In a first pass, parse default arguments to the functions.
22268 Then, in a second pass, parse the bodies of the functions.
22269 This two-phased approach handles cases like:
22271 struct S {
22272 void f() { g(); }
22273 void g(int i = 3);
22274 };
22276 */
22278 {
22280 /* If there are default arguments that have not yet been processed,
22281 take care of them now. */
22283 {
22288 }
22289 /* Make sure that any template parameters are in scope. */
22291 /* Parse the default argument expressions. */
22293 /* Remove any template parameters from the symbol table. */
22295 }
22297 /* Now parse any NSDMIs. */
22301 {
22303 {
22308 }
22311 }
22318 /* Now do some post-NSDMI bookkeeping. */
22324 /* Now parse the body of the functions. */
22326 {
22327 /* OpenMP UDRs need to be parsed before all other functions. */
22334 }
22335 else
22339 }
22340 else
22343 /* Put back any saved access checks. */
22346 /* Restore saved state. */
22350 parser->num_template_parameter_lists
22352 parser->in_unbraced_linkage_specification_p
22356 }
22358 static tree
22360 {
22361 tree ret;
22366 }
22368 /* Parse a class-head.
22370 class-head:
22371 class-key identifier [opt] base-clause [opt]
22372 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22373 class-key nested-name-specifier [opt] template-id
22374 base-clause [opt]
22376 class-virt-specifier:
22377 final
22379 GNU Extensions:
22380 class-key attributes identifier [opt] base-clause [opt]
22381 class-key attributes nested-name-specifier identifier base-clause [opt]
22382 class-key attributes nested-name-specifier [opt] template-id
22383 base-clause [opt]
22385 Upon return BASES is initialized to the list of base classes (or
22386 NULL, if there are none) in the same form returned by
22387 cp_parser_base_clause.
22389 Returns the TYPE of the indicated class. Sets
22390 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22391 involving a nested-name-specifier was used, and FALSE otherwise.
22393 Returns error_mark_node if this is not a class-head.
22395 Returns NULL_TREE if the class-head is syntactically valid, but
22396 semantically invalid in a way that means we should skip the entire
22397 body of the class. */
22399 static tree
22402 {
22403 tree nested_name_specifier;
22407 tree attributes;
22408 tree bases;
22418 /* Assume no nested-name-specifier will be present. */
22420 /* Assume no template parameter lists will be used in defining the
22421 type. */
22425 /* Look for the class-key. */
22432 /* Parse the attributes. */
22435 /* If the next token is `::', that is invalid -- but sometimes
22436 people do try to write:
22438 struct ::S {};
22440 Handle this gracefully by accepting the extra qualifier, and then
22441 issuing an error about it later if this really is a
22442 class-head. If it turns out just to be an elaborated type
22443 specifier, remain silent. */
22449 /* Determine the name of the class. Begin by looking for an
22450 optional nested-name-specifier. */
22452 nested_name_specifier
22458 /* If there was a nested-name-specifier, then there *must* be an
22459 identifier. */
22461 {
22463 /* Although the grammar says `identifier', it really means
22464 `class-name' or `template-name'. You are only allowed to
22465 define a class that has already been declared with this
22466 syntax.
22468 The proposed resolution for Core Issue 180 says that wherever
22469 you see `class T::X' you should treat `X' as a type-name.
22471 It is OK to define an inaccessible class; for example:
22473 class A { class B; };
22474 class A::B {};
22476 We do not know if we will see a class-name, or a
22477 template-name. We look for a class-name first, in case the
22478 class-name is a template-id; if we looked for the
22479 template-name first we would stop after the template-name. */
22484 class_type,
22488 /* If that didn't work, ignore the nested-name-specifier. */
22490 {
22496 }
22497 /* If we could not find a corresponding TYPE, treat this
22498 declaration like an unqualified declaration. */
22501 /* Otherwise, count the number of templates used in TYPE and its
22502 containing scopes. */
22503 else
22504 {
22505 tree scope;
22517 }
22518 }
22519 /* Otherwise, the identifier is optional. */
22520 else
22521 {
22522 /* We don't know whether what comes next is a template-id,
22523 an identifier, or nothing at all. */
22525 /* Check for a template-id. */
22530 class_key,
22532 /* If that didn't work, it could still be an identifier. */
22534 {
22536 {
22539 }
22540 else
22542 }
22543 else
22544 {
22547 }
22548 }
22553 {
22555 class_key,
22557 }
22560 /* If it's not a `:' or a `{' then we can't really be looking at a
22561 class-head, since a class-head only appears as part of a
22562 class-specifier. We have to detect this situation before calling
22563 xref_tag, since that has irreversible side-effects. */
22565 {
22569 }
22571 /* At this point, we're going ahead with the class-specifier, even
22572 if some other problem occurs. */
22575 {
22580 }
22581 /* Issue the error about the overly-qualified name now. */
22583 {
22588 }
22590 {
22595 }
22597 {
22598 tree scope;
22600 /* Reject typedef-names in class heads. */
22602 {
22605 type);
22608 }
22610 /* Figure out in what scope the declaration is being placed. */
22612 /* If that scope does not contain the scope in which the
22613 class was originally declared, the program is invalid. */
22615 {
22618 "declaration of %qD in namespace %qD which does not "
22621 else
22627 }
22628 /* [dcl.meaning]
22630 A declarator-id shall not be qualified except for the
22631 definition of a ... nested class outside of its class
22632 ... [or] the definition or explicit instantiation of a
22633 class member of a namespace outside of its namespace. */
22635 {
22640 }
22641 }
22642 /* An explicit-specialization must be preceded by "template <>". If
22643 it is not, try to recover gracefully. */
22646 && !processing_template_parmlist
22648 {
22649 /* Build a location of this form:
22650 struct typename <ARGS>
22651 ^~~~~~~~~~~~~~~~~~~~~~
22652 with caret==start at the start token, and
22653 finishing at the end of the type. */
22654 location_t reported_loc
22656 class_head_start_location,
22661 error_at_rich_loc
22665 /* Take the same action that would have been taken by
22666 cp_parser_explicit_specialization. */
22669 }
22670 /* There must be no "return" statements between this point and the
22671 end of this function; set "type "to the correct return value and
22672 use "goto done;" to return. */
22673 /* Make sure that the right number of template parameters were
22674 present. */
22678 {
22679 /* If something went wrong, there is no point in even trying to
22680 process the class-definition. */
22683 }
22685 /* Look up the type. */
22687 {
22691 {
22695 }
22696 else
22697 {
22701 /* Check the scope while we still know whether or not we had a
22702 nested-name-specifier. */
22705 }
22708 }
22710 {
22711 tree class_type;
22713 /* Given:
22715 template <typename T> struct S { struct T };
22716 template <typename T> struct S<T>::T { };
22718 we will get a TYPENAME_TYPE when processing the definition of
22719 `S::T'. We need to resolve it to the actual type before we
22720 try to define it. */
22722 {
22727 else
22728 {
22731 }
22732 }
22736 {
22739 }
22742 /* Enter the scope indicated by the nested-name-specifier. */
22744 /* Get the canonical version of this type. */
22746 /* Call push_template_decl if it seems like we should be defining a
22747 template either from the template headers or the type we're
22748 defining, so that we diagnose both extra and missing headers. */
22752 {
22755 {
22758 }
22759 }
22763 }
22765 {
22766 /* If the class was unnamed, create a dummy name. */
22770 ? ts_within_enclosing_non_class
22774 }
22776 /* Indicate whether this class was declared as a `class' or as a
22777 `struct'. */
22782 /* If this type was already complete, and we see another definition,
22783 that's an error. */
22785 {
22787 type);
22789 type);
22792 }
22797 {
22798 /* Apply attributes now, before any use of the class as a template
22799 argument in its base list. */
22802 }
22804 /* We will have entered the scope containing the class; the names of
22805 base classes should be looked up in that context. For example:
22807 struct A { struct B {}; struct C; };
22808 struct A::C : B {};
22810 is valid. */
22812 /* Get the list of base-classes, if there is one. */
22814 {
22815 /* PR59482: enter the class scope so that base-specifiers are looked
22816 up correctly. */
22820 /* PR59482: get out of the previously pushed class scope so that the
22821 subsequent pops pop the right thing. */
22824 }
22825 else
22828 /* If we're really defining a class, process the base classes.
22829 If they're invalid, fail. */
22833 done:
22834 /* Leave the scope given by the nested-name-specifier. We will
22835 enter the class scope itself while processing the members. */
22840 {
22843 }
22849 out:
22852 }
22854 /* Parse a class-key.
22856 class-key:
22857 class
22858 struct
22859 union
22861 Returns the kind of class-key specified, or none_type to indicate
22862 error. */
22864 static enum tag_types
22866 {
22870 /* Look for the class-key. */
22875 /* Check to see if the TOKEN is a class-key. */
22880 }
22882 /* Parse a type-parameter-key.
22884 type-parameter-key:
22885 class
22886 typename
22887 */
22889 static void
22891 {
22892 /* Look for the type-parameter-key. */
22896 {
22899 /* typename is not allowed in a template template parameter
22900 by the standard until C++1Z. */
22902 "ISO C++ forbids typename key in template template parameter;"
22904 }
22905 else
22909 }
22911 /* Parse an (optional) member-specification.
22913 member-specification:
22914 member-declaration member-specification [opt]
22915 access-specifier : member-specification [opt] */
22917 static void
22919 {
22921 {
22925 /* Peek at the next token. */
22927 /* If it's a `}', or EOF then we've seen all the members. */
22933 /* See if this token is a keyword. */
22936 {
22940 /* Consume the access-specifier. */
22942 /* Remember which access-specifier is active. */
22944 /* Look for the `:'. */
22949 /* Accept #pragmas at class scope. */
22951 {
22954 }
22956 /* Otherwise, the next construction must be a
22957 member-declaration. */
22959 }
22960 }
22961 }
22963 /* Parse a member-declaration.
22965 member-declaration:
22966 decl-specifier-seq [opt] member-declarator-list [opt] ;
22967 function-definition ; [opt]
22968 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22969 using-declaration
22970 template-declaration
22971 alias-declaration
22973 member-declarator-list:
22974 member-declarator
22975 member-declarator-list , member-declarator
22977 member-declarator:
22978 declarator pure-specifier [opt]
22979 declarator constant-initializer [opt]
22980 identifier [opt] : constant-expression
22982 GNU Extensions:
22984 member-declaration:
22985 __extension__ member-declaration
22987 member-declarator:
22988 declarator attributes [opt] pure-specifier [opt]
22989 declarator attributes [opt] constant-initializer [opt]
22990 identifier [opt] attributes [opt] : constant-expression
22992 C++0x Extensions:
22994 member-declaration:
22995 static_assert-declaration */
22997 static void
22999 {
23000 cp_decl_specifier_seq decl_specifiers;
23001 tree prefix_attributes;
23002 tree decl;
23011 /* Check for the `__extension__' keyword. */
23013 {
23014 /* Recurse. */
23016 /* Restore the old value of the PEDANTIC flag. */
23020 }
23022 /* Check for a template-declaration. */
23024 {
23025 /* An explicit specialization here is an error condition, and we
23026 expect the specialization handler to detect and report this. */
23030 else
23034 }
23035 /* Check for a template introduction. */
23039 /* Check for a using-declaration. */
23041 {
23043 {
23044 /* Parse the using-declaration. */
23048 }
23049 else
23050 {
23051 tree decl;
23055 /* Note that if we actually see the '=' token after the
23056 identifier, cp_parser_alias_declaration commits the
23057 tentative parse. In that case, we really expect an
23058 alias-declaration. Otherwise, we expect a using
23059 declaration. */
23060 alias_decl_expected =
23066 else
23070 }
23071 }
23073 /* Check for @defs. */
23075 {
23080 {
23085 }
23087 }
23089 /* If the next token is `static_assert' we have a static assertion. */
23091 {
23094 }
23101 /* Parse the decl-specifier-seq. */
23104 CP_PARSER_FLAGS_OPTIONAL,
23107 /* Check for an invalid type-name. */
23111 /* If there is no declarator, then the decl-specifier-seq should
23112 specify a type. */
23114 {
23115 /* If there was no decl-specifier-seq, and the next token is a
23116 `;', then we have something like:
23118 struct S { ; };
23120 [class.mem]
23122 Each member-declaration shall declare at least one member
23123 name of the class. */
23125 {
23128 {
23132 }
23133 }
23134 else
23135 {
23136 tree type;
23138 /* See if this declaration is a friend. */
23140 /* If there were decl-specifiers, check to see if there was
23141 a class-declaration. */
23144 /* Nested classes have already been added to the class, but
23145 a `friend' needs to be explicitly registered. */
23147 {
23148 /* If the `friend' keyword was present, the friend must
23149 be introduced with a class-key. */
23152 "in C++03 a class-key must be used "
23154 /* In this case:
23156 template <typename T> struct A {
23157 friend struct A<T>::B;
23158 };
23160 A<T>::B will be represented by a TYPENAME_TYPE, and
23161 therefore not recognized by check_tag_decl. */
23163 {
23167 }
23170 "friend declaration does not name a class or "
23172 else
23175 }
23176 /* If there is no TYPE, an error message will already have
23177 been issued. */
23179 ;
23180 /* An anonymous aggregate has to be handled specially; such
23181 a declaration really declares a data member (with a
23182 particular type), as opposed to a nested class. */
23184 {
23185 /* C++11 9.5/6. */
23188 "a storage class on an anonymous aggregate "
23191 /* Remove constructors and such from TYPE, now that we
23192 know it is an anonymous aggregate. */
23194 /* And make the corresponding data member. */
23197 /* Add it to the class. */
23199 }
23200 else
23201 cp_parser_check_access_in_redeclaration
23204 }
23205 }
23206 else
23207 {
23210 /* Clear attributes from the decl_specifiers but keep them
23211 around as prefix attributes that apply them to the entity
23212 being declared. */
23216 /* See if these declarations will be friends. */
23219 /* Keep going until we hit the `;' at the end of the
23220 declaration. */
23222 {
23224 tree first_attribute;
23226 /* Peek at the next token. */
23229 /* Check for a bitfield declaration. */
23234 {
23235 tree identifier;
23236 tree width;
23238 /* Get the name of the bitfield. Note that we cannot just
23239 check TOKEN here because it may have been invalidated by
23240 the call to cp_lexer_peek_nth_token above. */
23243 else
23246 /* Consume the `:' token. */
23248 /* Get the width of the bitfield. */
23249 width
23252 /* Look for attributes that apply to the bitfield. */
23254 /* Remember which attributes are prefix attributes and
23255 which are not. */
23257 /* Combine the attributes. */
23260 /* Create the bitfield declaration. */
23263 identifier,
23264 sfk_none)
23267 width,
23268 attributes);
23269 }
23270 else
23271 {
23273 tree initializer;
23274 tree asm_specification;
23277 /* Parse the declarator. */
23278 declarator
23283 friend_p);
23285 /* If something went wrong parsing the declarator, make sure
23286 that we at least consume some tokens. */
23288 {
23289 /* Skip to the end of the statement. */
23291 /* If the next token is not a semicolon, that is
23292 probably because we just skipped over the body of
23293 a function. So, we consume a semicolon if
23294 present, but do not issue an error message if it
23295 is not present. */
23297 CPP_SEMICOLON))
23300 }
23303 cp_parser_check_for_definition_in_return_type
23307 /* Look for an asm-specification. */
23309 /* Look for attributes that apply to the declaration. */
23311 /* Remember which attributes are prefix attributes and
23312 which are not. */
23314 /* Combine the attributes. */
23317 /* If it's an `=', then we have a constant-initializer or a
23318 pure-specifier. It is not correct to parse the
23319 initializer before registering the member declaration
23320 since the member declaration should be in scope while
23321 its initializer is processed. However, the rest of the
23322 front end does not yet provide an interface that allows
23323 us to handle this correctly. */
23325 {
23326 /* In [class.mem]:
23328 A pure-specifier shall be used only in the declaration of
23329 a virtual function.
23331 A member-declarator can contain a constant-initializer
23332 only if it declares a static member of integral or
23333 enumeration type.
23335 Therefore, if the DECLARATOR is for a function, we look
23336 for a pure-specifier; otherwise, we look for a
23337 constant-initializer. When we call `grokfield', it will
23338 perform more stringent semantics checks. */
23350 {
23352 /* Don't require a constant rvalue in C++11, since we
23353 might want a reference constant. We'll enforce
23354 constancy later. */
23356 /* Parse the initializer. */
23359 }
23360 else
23361 /* Parse the initializer. */
23363 }
23366 {
23370 else
23372 }
23373 /* Otherwise, there is no initializer. */
23374 else
23377 /* See if we are probably looking at a function
23378 definition. We are certainly not looking at a
23379 member-declarator. Calling `grokfield' has
23380 side-effects, so we must not do it unless we are sure
23381 that we are looking at a member-declarator. */
23384 {
23385 /* The grammar does not allow a pure-specifier to be
23386 used when a member function is defined. (It is
23387 possible that this fact is an oversight in the
23388 standard, since a pure function may be defined
23389 outside of the class-specifier. */
23395 declarator,
23396 attributes);
23399 /* If the member was not a friend, declare it here. */
23402 /* Peek at the next token. */
23404 /* If the next token is a semicolon, consume it. */
23406 {
23407 location_t semicolon_loc
23412 "extra %<;%> after in-class "
23414 }
23416 }
23417 else
23420 /* Create the declaration. */
23425 {
23428 else
23430 }
23431 }
23436 /* Reset PREFIX_ATTRIBUTES. */
23442 /* If there is any qualification still in effect, clear it
23443 now; we will be starting fresh with the next declarator. */
23447 /* If it's a `,', then there are more declarators. */
23449 {
23452 {
23458 }
23459 }
23460 /* If the next token isn't a `;', then we have a parse error. */
23462 CPP_SEMICOLON))
23463 {
23464 /* The next token might be a ways away from where the
23465 actual semicolon is missing. Find the previous token
23466 and use that for our error position. */
23473 /* Assume that the user meant to provide a semicolon. If
23474 we were to cp_parser_skip_to_end_of_statement, we might
23475 skip to a semicolon inside a member function definition
23476 and issue nonsensical error messages. */
23478 }
23481 {
23482 /* Add DECL to the list of members. */
23484 /* Explicitly include, eg, NSDMIs, for better error
23485 recovery (c++/58650). */
23494 /* Add DECL to the queue of NSDMI to be parsed later. */
23496 }
23500 }
23501 }
23504 out:
23506 }
23508 /* Parse a pure-specifier.
23510 pure-specifier:
23511 = 0
23513 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23514 Otherwise, ERROR_MARK_NODE is returned. */
23516 static tree
23518 {
23521 /* Look for the `=' token. */
23524 /* Look for the `0' token. */
23533 /* Accept = default or = delete in c++0x mode. */
23536 {
23539 }
23541 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23543 {
23548 }
23550 {
23553 }
23556 }
23558 /* Parse a constant-initializer.
23560 constant-initializer:
23561 = constant-expression
23563 Returns a representation of the constant-expression. */
23565 static tree
23567 {
23568 /* Look for the `=' token. */
23572 /* It is invalid to write:
23574 struct S { static const int i = { 7 }; };
23576 */
23578 {
23581 /* Consume the opening brace. */
23583 /* Skip the initializer. */
23585 /* Look for the trailing `}'. */
23589 }
23592 }
23594 /* Derived classes [gram.class.derived] */
23596 /* Parse a base-clause.
23598 base-clause:
23599 : base-specifier-list
23601 base-specifier-list:
23602 base-specifier ... [opt]
23603 base-specifier-list , base-specifier ... [opt]
23605 Returns a TREE_LIST representing the base-classes, in the order in
23606 which they were declared. The representation of each node is as
23607 described by cp_parser_base_specifier.
23609 In the case that no bases are specified, this function will return
23610 NULL_TREE, not ERROR_MARK_NODE. */
23612 static tree
23614 {
23617 /* Look for the `:' that begins the list. */
23620 /* Scan the base-specifier-list. */
23622 {
23624 tree base;
23627 /* Look for the base-specifier. */
23629 /* Look for the (optional) ellipsis. */
23631 {
23632 /* Consume the `...'. */
23636 }
23638 /* Add BASE to the front of the list. */
23640 {
23642 /* Make this a pack expansion type. */
23646 {
23649 }
23650 }
23651 /* Peek at the next token. */
23653 /* If it's not a comma, then the list is complete. */
23656 /* Consume the `,'. */
23658 }
23660 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23661 base class had a qualified name. However, the next name that
23662 appears is certainly not qualified. */
23668 }
23670 /* Parse a base-specifier.
23672 base-specifier:
23673 :: [opt] nested-name-specifier [opt] class-name
23674 virtual access-specifier [opt] :: [opt] nested-name-specifier
23675 [opt] class-name
23676 access-specifier virtual [opt] :: [opt] nested-name-specifier
23677 [opt] class-name
23679 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23680 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23681 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23682 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23684 static tree
23686 {
23694 tree type;
23696 /* Process the optional `virtual' and `access-specifier'. */
23698 {
23699 /* Peek at the next token. */
23701 /* Process `virtual'. */
23703 {
23705 /* If `virtual' appears more than once, issue an error. */
23707 {
23711 }
23715 /* Consume the `virtual' token. */
23723 /* If more than one access specifier appears, issue an
23724 error. */
23727 {
23731 }
23735 /* Consume the access-specifier. */
23743 }
23744 }
23745 /* It is not uncommon to see programs mechanically, erroneously, use
23746 the 'typename' keyword to denote (dependent) qualified types
23747 as base classes. */
23749 {
23754 else
23756 "keyword %<typename%> not allowed in this context "
23759 }
23761 /* Look for the optional `::' operator. */
23763 /* Look for the nested-name-specifier. The simplest way to
23764 implement:
23766 [temp.res]
23768 The keyword `typename' is not permitted in a base-specifier or
23769 mem-initializer; in these contexts a qualified name that
23770 depends on a template-parameter is implicitly assumed to be a
23771 type name.
23773 is to pretend that we have seen the `typename' keyword at this
23774 point. */
23780 /* If the base class is given by a qualified name, assume that names
23781 we see are type names or templates, as appropriate. */
23787 /* DR 950 allows decltype as a base-specifier. */
23789 else
23790 {
23791 /* Otherwise, look for the class-name. */
23793 class_scope_p,
23794 template_p,
23795 typename_type,
23800 }
23806 }
23808 /* Exception handling [gram.exception] */
23810 /* Parse an (optional) noexcept-specification.
23812 noexcept-specification:
23813 noexcept ( constant-expression ) [opt]
23815 If no noexcept-specification is present, returns NULL_TREE.
23816 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23817 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23818 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23819 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23820 in which case a boolean condition is returned instead. */
23822 static tree
23827 {
23831 /* Peek at the next token. */
23834 /* Is it a noexcept-specification? */
23836 {
23837 tree expr;
23841 {
23845 {
23846 /* Types may not be defined in an exception-specification. */
23848 parser->type_definition_forbidden_message
23853 /* Restore the saved message. */
23855 }
23856 else
23857 {
23860 }
23863 }
23864 else
23865 {
23869 }
23871 /* We cannot build a noexcept-spec right away because this will check
23872 that expr is a constexpr. */
23875 else
23877 }
23878 else
23880 }
23882 /* Parse an (optional) exception-specification.
23884 exception-specification:
23885 throw ( type-id-list [opt] )
23887 Returns a TREE_LIST representing the exception-specification. The
23888 TREE_VALUE of each node is a type. */
23890 static tree
23892 {
23894 tree type_id_list;
23897 /* Peek at the next token. */
23900 /* Is it a noexcept-specification? */
23906 /* If it's not `throw', then there's no exception-specification. */
23912 /* Consume the `throw'. */
23915 /* Look for the `('. */
23918 /* Peek at the next token. */
23920 /* If it's not a `)', then there is a type-id-list. */
23922 {
23923 /* Types may not be defined in an exception-specification. */
23925 parser->type_definition_forbidden_message
23927 /* Parse the type-id-list. */
23929 /* Restore the saved message. */
23933 {
23937 }
23940 "dynamic exception specifications are deprecated in "
23942 }
23943 /* In C++17, throw() is equivalent to noexcept (true). throw()
23944 is deprecated in C++11 and above as well, but is still widely used,
23945 so don't warn about it yet. */
23948 else
23951 /* Look for the `)'. */
23955 }
23957 /* Parse an (optional) type-id-list.
23959 type-id-list:
23960 type-id ... [opt]
23961 type-id-list , type-id ... [opt]
23963 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23964 in the order that the types were presented. */
23966 static tree
23968 {
23972 {
23974 tree type;
23978 /* Get the next type-id. */
23980 /* Check for invalid 'auto'. */
23982 {
23986 }
23987 /* Parse the optional ellipsis. */
23989 {
23990 /* Consume the `...'. */
23993 /* Turn the type into a pack expansion expression. */
23995 }
23996 /* Add it to the list. */
23998 /* Peek at the next token. */
24000 /* If it is not a `,', we are done. */
24003 /* Consume the `,'. */
24005 }
24008 }
24010 /* Parse a try-block.
24012 try-block:
24013 try compound-statement handler-seq */
24015 static tree
24017 {
24018 tree try_block;
24032 }
24034 /* Parse a function-try-block.
24036 function-try-block:
24037 try ctor-initializer [opt] function-body handler-seq */
24039 static bool
24041 {
24042 tree compound_stmt;
24043 tree try_block;
24046 /* Look for the `try' keyword. */
24049 /* Let the rest of the front end know where we are. */
24051 /* Parse the function-body. */
24052 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24054 /* We're done with the `try' part. */
24056 /* Parse the handlers. */
24058 /* We're done with the handlers. */
24062 }
24064 /* Parse a handler-seq.
24066 handler-seq:
24067 handler handler-seq [opt] */
24069 static void
24071 {
24073 {
24076 /* Parse the handler. */
24078 /* Peek at the next token. */
24080 /* If it's not `catch' then there are no more handlers. */
24083 }
24084 }
24086 /* Parse a handler.
24088 handler:
24089 catch ( exception-declaration ) compound-statement */
24091 static void
24093 {
24094 tree handler;
24095 tree declaration;
24105 }
24107 /* Parse an exception-declaration.
24109 exception-declaration:
24110 type-specifier-seq declarator
24111 type-specifier-seq abstract-declarator
24112 type-specifier-seq
24113 ...
24115 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24116 ellipsis variant is used. */
24118 static tree
24120 {
24121 cp_decl_specifier_seq type_specifiers;
24125 /* If it's an ellipsis, it's easy to handle. */
24127 {
24128 /* Consume the `...' token. */
24131 }
24133 /* Types may not be defined in exception-declarations. */
24135 parser->type_definition_forbidden_message
24138 /* Parse the type-specifier-seq. */
24142 /* If it's a `)', then there is no declarator. */
24145 else
24152 /* Restore the saved message. */
24159 }
24161 /* Parse a throw-expression.
24163 throw-expression:
24164 throw assignment-expression [opt]
24166 Returns a THROW_EXPR representing the throw-expression. */
24168 static tree
24170 {
24171 tree expression;
24176 /* Figure out whether or not there is an assignment-expression
24177 following the "throw" keyword. */
24185 else
24189 }
24191 /* GNU Extensions */
24193 /* Parse an (optional) asm-specification.
24195 asm-specification:
24196 asm ( string-literal )
24198 If the asm-specification is present, returns a STRING_CST
24199 corresponding to the string-literal. Otherwise, returns
24200 NULL_TREE. */
24202 static tree
24204 {
24206 tree asm_specification;
24208 /* Peek at the next token. */
24210 /* If the next token isn't the `asm' keyword, then there's no
24211 asm-specification. */
24215 /* Consume the `asm' token. */
24217 /* Look for the `('. */
24220 /* Look for the string-literal. */
24223 /* Look for the `)'. */
24227 }
24229 /* Parse an asm-operand-list.
24231 asm-operand-list:
24232 asm-operand
24233 asm-operand-list , asm-operand
24235 asm-operand:
24236 string-literal ( expression )
24237 [ string-literal ] string-literal ( expression )
24239 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24240 each node is the expression. The TREE_PURPOSE is itself a
24241 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24242 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24243 is a STRING_CST for the string literal before the parenthesis. Returns
24244 ERROR_MARK_NODE if any of the operands are invalid. */
24246 static tree
24248 {
24253 {
24254 tree string_literal;
24255 tree expression;
24256 tree name;
24259 {
24260 /* Consume the `[' token. */
24262 /* Read the operand name. */
24267 /* Look for the closing `]'. */
24269 }
24270 else
24272 /* Look for the string-literal. */
24275 /* Look for the `('. */
24277 /* Parse the expression. */
24279 /* Look for the `)'. */
24287 /* Add this operand to the list. */
24289 expression,
24290 asm_operands);
24291 /* If the next token is not a `,', there are no more
24292 operands. */
24295 /* Consume the `,'. */
24297 }
24300 }
24302 /* Parse an asm-clobber-list.
24304 asm-clobber-list:
24305 string-literal
24306 asm-clobber-list , string-literal
24308 Returns a TREE_LIST, indicating the clobbers in the order that they
24309 appeared. The TREE_VALUE of each node is a STRING_CST. */
24311 static tree
24313 {
24317 {
24318 tree string_literal;
24320 /* Look for the string literal. */
24322 /* Add it to the list. */
24324 /* If the next token is not a `,', then the list is
24325 complete. */
24328 /* Consume the `,' token. */
24330 }
24333 }
24335 /* Parse an asm-label-list.
24337 asm-label-list:
24338 identifier
24339 asm-label-list , identifier
24341 Returns a TREE_LIST, indicating the labels in the order that they
24342 appeared. The TREE_VALUE of each node is a label. */
24344 static tree
24346 {
24350 {
24353 /* Look for the identifier. */
24356 {
24359 {
24365 }
24366 }
24367 /* If the next token is not a `,', then the list is
24368 complete. */
24371 /* Consume the `,' token. */
24373 }
24376 }
24378 /* Return TRUE iff the next tokens in the stream are possibly the
24379 beginning of a GNU extension attribute. */
24381 static bool
24383 {
24385 }
24387 /* Return TRUE iff the next tokens in the stream are possibly the
24388 beginning of a standard C++-11 attribute specifier. */
24390 static bool
24392 {
24394 }
24396 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24397 beginning of a standard C++-11 attribute specifier. */
24399 static bool
24401 {
24409 }
24411 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24412 beginning of a GNU extension attribute. */
24414 static bool
24416 {
24420 }
24422 /* Return true iff the next tokens can be the beginning of either a
24423 GNU attribute list, or a standard C++11 attribute sequence. */
24425 static bool
24427 {
24430 }
24432 /* Return true iff the next Nth tokens can be the beginning of either
24433 a GNU attribute list, or a standard C++11 attribute sequence. */
24435 static bool
24437 {
24440 }
24442 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24443 of GNU attributes, or return NULL. */
24445 static tree
24447 {
24451 }
24453 #define CILK_SIMD_FN_CLAUSE_MASK \
24454 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24455 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24456 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24457 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24458 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24460 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24461 vector [(<clauses>)] */
24463 static void
24465 {
24469 {
24475 }
24478 {
24481 paren_scope++;
24482 }
24484 {
24487 paren_scope++;
24489 paren_scope--;
24490 /* Do not push the last ')' */
24493 }
24502 }
24504 /* Parse an (optional) series of attributes.
24506 attributes:
24507 attributes attribute
24509 attribute:
24510 __attribute__ (( attribute-list [opt] ))
24512 The return value is as for cp_parser_gnu_attribute_list. */
24514 static tree
24516 {
24520 {
24522 tree attribute_list;
24525 /* Peek at the next token. */
24527 /* If it's not `__attribute__', then we're done. */
24531 /* Consume the `__attribute__' keyword. */
24533 /* Look for the two `(' tokens. */
24537 /* Peek at the next token. */
24540 /* Parse the attribute-list. */
24542 else
24543 /* If the next token is a `)', then there is no attribute
24544 list. */
24547 /* Look for the two `)' tokens. */
24555 /* Add these new attributes to the list. */
24557 }
24560 }
24562 /* Parse a GNU attribute-list.
24564 attribute-list:
24565 attribute
24566 attribute-list , attribute
24568 attribute:
24569 identifier
24570 identifier ( identifier )
24571 identifier ( identifier , expression-list )
24572 identifier ( expression-list )
24574 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24575 to an attribute. The TREE_PURPOSE of each node is the identifier
24576 indicating which attribute is in use. The TREE_VALUE represents
24577 the arguments, if any. */
24579 static tree
24581 {
24587 {
24589 tree identifier;
24590 tree attribute;
24592 /* Look for the identifier. We also allow keywords here; for
24593 example `__attribute__ ((const))' is legal. */
24597 {
24600 /* Consume the token, but save it since we need it for the
24601 SIMD enabled function parsing. */
24604 /* Save away the identifier that indicates which attribute
24605 this is. */
24607 /* For keywords, use the canonical spelling, not the
24608 parsed identifier. */
24614 /* Peek at the next token. */
24616 /* If it's an `(', then parse the attribute arguments. */
24618 {
24623 {
24626 }
24627 else
24628 vec = cp_parser_parenthesized_expression_list
24634 else
24635 {
24638 }
24639 /* Save the arguments away. */
24641 }
24643 {
24646 }
24649 {
24650 /* Add this attribute to the list. */
24653 }
24656 }
24657 /* Now, look for more attributes. If the next token isn't a
24658 `,', we're done. */
24662 /* Consume the comma and keep going. */
24664 }
24667 /* We built up the list in reverse order. */
24669 }
24671 /* Parse a standard C++11 attribute.
24673 The returned representation is a TREE_LIST which TREE_PURPOSE is
24674 the scoped name of the attribute, and the TREE_VALUE is its
24675 arguments list.
24677 Note that the scoped name of the attribute is itself a TREE_LIST
24678 which TREE_PURPOSE is the namespace of the attribute, and
24679 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24680 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24681 and which TREE_PURPOSE is directly the attribute name.
24683 Clients of the attribute code should use get_attribute_namespace
24684 and get_attribute_name to get the actual namespace and name of
24685 attributes, regardless of their being GNU or C++11 attributes.
24687 attribute:
24688 attribute-token attribute-argument-clause [opt]
24690 attribute-token:
24691 identifier
24692 attribute-scoped-token
24694 attribute-scoped-token:
24695 attribute-namespace :: identifier
24697 attribute-namespace:
24698 identifier
24700 attribute-argument-clause:
24701 ( balanced-token-seq )
24703 balanced-token-seq:
24704 balanced-token [opt]
24705 balanced-token-seq balanced-token
24707 balanced-token:
24708 ( balanced-token-seq )
24709 [ balanced-token-seq ]
24710 { balanced-token-seq }. */
24712 static tree
24714 {
24718 /* First, parse name of the attribute, a.k.a attribute-token. */
24735 {
24736 /* We are seeing a scoped attribute token. */
24751 else
24752 {
24756 }
24758 NULL_TREE);
24760 }
24763 NULL_TREE);
24764 else
24765 {
24767 NULL_TREE);
24768 /* C++11 noreturn attribute is equivalent to GNU's. */
24771 /* C++14 deprecated attribute is equivalent to GNU's. */
24774 /* C++17 fallthrough attribute is equivalent to GNU's. */
24777 /* Transactional Memory TS optimize_for_synchronized attribute is
24778 equivalent to GNU transaction_callable. */
24782 /* Transactional Memory attributes are GNU attributes. */
24785 }
24787 /* Now parse the optional argument clause of the attribute. */
24792 {
24798 /* A GNU attribute that takes an identifier in parameter. */
24801 vec = cp_parser_parenthesized_expression_list
24807 else
24808 {
24811 }
24815 else
24817 }
24820 }
24822 /* Check that the attribute ATTRIBUTE appears at most once in the
24823 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24824 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24825 isn't implemented yet in GCC. */
24827 static void
24829 {
24831 {
24841 }
24842 }
24844 /* Parse a list of standard C++-11 attributes.
24846 attribute-list:
24847 attribute [opt]
24848 attribute-list , attribute[opt]
24849 attribute ...
24850 attribute-list , attribute ...
24851 */
24853 static tree
24855 {
24860 {
24865 {
24869 }
24872 {
24877 else
24878 {
24883 }
24885 }
24889 }
24892 }
24894 /* Parse a standard C++-11 attribute specifier.
24896 attribute-specifier:
24897 [ [ attribute-using-prefix [opt] attribute-list ] ]
24898 alignment-specifier
24900 attribute-using-prefix:
24901 using attribute-namespace :
24903 alignment-specifier:
24904 alignas ( type-id ... [opt] )
24905 alignas ( alignment-expression ... [opt] ). */
24907 static tree
24909 {
24915 {
24922 {
24933 {
24937 "attribute using prefix only available "
24943 }
24944 else
24946 }
24953 else
24954 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24955 when we are sure that we have actually parsed them. */
24957 }
24958 else
24959 {
24960 tree alignas_expr;
24962 /* Look for an alignment-specifier. */
24974 {
24977 }
24983 {
24990 }
24995 /* Handle alignas (pack...). */
24997 {
25000 }
25002 /* Something went wrong, so don't build the attribute. */
25007 {
25010 }
25012 /* Build the C++-11 representation of an 'aligned'
25013 attribute. */
25014 attributes =
25017 alignas_expr);
25018 }
25021 }
25023 /* Parse a standard C++-11 attribute-specifier-seq.
25025 attribute-specifier-seq:
25026 attribute-specifier-seq [opt] attribute-specifier
25027 */
25029 static tree
25031 {
25036 {
25045 else
25048 }
25051 }
25053 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25054 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25055 current value of the PEDANTIC flag, regardless of whether or not
25056 the `__extension__' keyword is present. The caller is responsible
25057 for restoring the value of the PEDANTIC flag. */
25059 static bool
25061 {
25062 /* Save the old value of the PEDANTIC flag. */
25066 {
25067 /* Consume the `__extension__' token. */
25069 /* We're not being pedantic while the `__extension__' keyword is
25070 in effect. */
25074 }
25077 }
25079 /* Parse a label declaration.
25081 label-declaration:
25082 __label__ label-declarator-seq ;
25084 label-declarator-seq:
25085 identifier , label-declarator-seq
25086 identifier */
25088 static void
25090 {
25091 /* Look for the `__label__' keyword. */
25095 {
25096 tree identifier;
25098 /* Look for an identifier. */
25100 /* If we failed, stop. */
25103 /* Declare it as a label. */
25105 /* If the next token is a `;', stop. */
25108 /* Look for the `,' separating the label declarations. */
25110 }
25112 /* Look for the final `;'. */
25114 }
25116 // -------------------------------------------------------------------------- //
25117 // Requires Clause
25119 // Parse a requires clause.
25120 //
25121 // requires-clause:
25122 // 'requires' logical-or-expression
25123 //
25124 // The required logical-or-expression must be a constant expression. Note
25125 // that we don't check that the expression is constepxr here. We defer until
25126 // we analyze constraints and then, we only check atomic constraints.
25127 static tree
25129 {
25130 // Parse the requires clause so that it is not automatically folded.
25138 }
25140 // Optionally parse a requires clause:
25141 static tree
25143 {
25146 {
25149 {
25152 /* Parse and discard the requires-clause. */
25155 }
25157 }
25160 }
25163 /*---------------------------------------------------------------------------
25164 Requires expressions
25165 ---------------------------------------------------------------------------*/
25167 /* Parse a requires expression
25169 requirement-expression:
25170 'requires' requirement-parameter-list [opt] requirement-body */
25171 static tree
25173 {
25177 /* A requires-expression shall appear only within a concept
25178 definition or a requires-clause.
25180 TODO: Implement this diagnostic correctly. */
25182 {
25186 }
25189 {
25190 /* Local parameters are delared as variables within the scope
25191 of the expression. They are not visible past the end of
25192 the expression. Expressions within the requires-expression
25193 are unevaluated. */
25194 struct scope_sentinel
25195 {
25197 {
25200 }
25203 {
25206 }
25209 /* Parse the optional parameter list. */
25211 {
25215 }
25216 else
25219 /* Parse the requirement body. */
25223 }
25225 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25226 the parm chain. */
25229 }
25231 /* Parse a parameterized requirement.
25233 requirement-parameter-list:
25234 '(' parameter-declaration-clause ')' */
25235 static tree
25237 {
25247 }
25249 /* Parse the body of a requirement.
25251 requirement-body:
25252 '{' requirement-list '}' */
25253 static tree
25255 {
25265 }
25267 /* Parse a list of requirements.
25269 requirement-list:
25270 requirement
25271 requirement-list ';' requirement[opt] */
25272 static tree
25274 {
25277 {
25284 /* If we see a semi-colon, consume it. */
25288 /* Stop processing at the end of the list. */
25291 }
25293 /* Reverse the order of requirements so they are analyzed in
25294 declaration order. */
25296 }
25298 /* Parse a syntactic requirement or type requirement.
25300 requirement:
25301 simple-requirement
25302 compound-requirement
25303 type-requirement
25304 nested-requirement */
25305 static tree
25307 {
25314 else
25316 }
25318 /* Parse a simple requirement.
25320 simple-requirement:
25321 expression ';' */
25322 static tree
25324 {
25333 }
25335 /* Parse a type requirement
25337 type-requirement
25338 nested-name-specifier [opt] required-type-name ';'
25340 required-type-name:
25341 type-name
25342 'template' [opt] simple-template-id */
25343 static tree
25345 {
25348 // Save the scope before parsing name specifiers.
25359 tree type;
25361 {
25370 }
25371 else
25390 }
25392 /* Parse a compound requirement
25394 compound-requirement:
25395 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25396 static tree
25398 {
25399 /* Parse an expression enclosed in '{ }'s. */
25410 /* Parse the optional noexcept. */
25413 {
25416 }
25418 /* Parse the optional trailing return type. */
25421 {
25429 }
25432 }
25434 /* Parse a nested requirement. This is the same as a requires clause.
25436 nested-requirement:
25437 requires-clause */
25438 static tree
25440 {
25446 }
25448 /* Support Functions */
25450 /* Return the appropriate prefer_type argument for lookup_name_real based on
25451 tag_type and template_mem_access. */
25455 {
25456 /* DR 141: When looking in the current enclosing context for a template-name
25457 after -> or ., only consider class templates. */
25461 {
25465 }
25466 }
25468 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25469 NAME should have one of the representations used for an
25470 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25471 is returned. If PARSER->SCOPE is a dependent type, then a
25472 SCOPE_REF is returned.
25474 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25475 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25476 was formed. Abstractly, such entities should not be passed to this
25477 function, because they do not need to be looked up, but it is
25478 simpler to check for this special case here, rather than at the
25479 call-sites.
25481 In cases not explicitly covered above, this function returns a
25482 DECL, OVERLOAD, or baselink representing the result of the lookup.
25483 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25484 is returned.
25486 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25487 (e.g., "struct") that was used. In that case bindings that do not
25488 refer to types are ignored.
25490 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25491 ignored.
25493 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25494 are ignored.
25496 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25497 types.
25499 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25500 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25501 NULL_TREE otherwise. */
25503 static cp_expr
25510 location_t name_location)
25511 {
25512 tree decl;
25515 /* Assume that the lookup will be unambiguous. */
25519 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25520 no longer valid. Note that if we are parsing tentatively, and
25521 the parse fails, OBJECT_TYPE will be automatically restored. */
25527 /* A template-id has already been resolved; there is no lookup to
25528 do. */
25532 {
25536 }
25538 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25539 it should already have been checked to make sure that the name
25540 used matches the type being destroyed. */
25542 {
25543 tree type;
25545 /* Figure out to which type this destructor applies. */
25550 else
25552 /* If that's not a class type, there is no destructor. */
25559 /* If it was a class type, return the destructor. */
25561 }
25563 /* By this point, the NAME should be an ordinary identifier. If
25564 the id-expression was a qualified name, the qualifying scope is
25565 stored in PARSER->SCOPE at this point. */
25568 /* Perform the lookup. */
25570 {
25576 /* If the SCOPE is dependent, the lookup must be deferred until
25577 the template is instantiated -- unless we are explicitly
25578 looking up names in uninstantiated templates. Even then, we
25579 cannot look up the name if the scope is not a class type; it
25580 might, for example, be a template type parameter. */
25585 /* Defer lookup. */
25587 else
25588 {
25591 /* If PARSER->SCOPE is a dependent type, then it must be a
25592 class type, and we must not be checking dependencies;
25593 otherwise, we would have processed this lookup above. So
25594 that PARSER->SCOPE is not considered a dependent base by
25595 lookup_member, we must enter the scope here. */
25599 /* If the PARSER->SCOPE is a template specialization, it
25600 may be instantiated during name lookup. In that case,
25601 errors may be issued. Even if we rollback the current
25602 tentative parse, those errors are valid. */
25607 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25608 lookup result and the nested-name-specifier nominates a class C:
25609 * if the name specified after the nested-name-specifier, when
25610 looked up in C, is the injected-class-name of C (Clause 9), or
25611 * if the name specified after the nested-name-specifier is the
25612 same as the identifier or the simple-template-id's template-
25613 name in the last component of the nested-name-specifier,
25614 the name is instead considered to name the constructor of
25615 class C. [ Note: for example, the constructor is not an
25616 acceptable lookup result in an elaborated-type-specifier so
25617 the constructor would not be used in place of the
25618 injected-class-name. --end note ] Such a constructor name
25619 shall be used only in the declarator-id of a declaration that
25620 names a constructor or in a using-declaration. */
25628 /* If we have a single function from a using decl, pull it out. */
25635 }
25637 /* If the scope is a dependent type and either we deferred lookup or
25638 we did lookup but didn't find the name, rememeber the name. */
25641 {
25643 {
25644 tree type;
25646 /* The resolution to Core Issue 180 says that `struct
25647 A::B' should be considered a type-name, even if `A'
25648 is dependent. */
25653 }
25657 CPP_CLOSE_PAREN)))
25661 else
25664 is_template);
25665 }
25668 }
25670 {
25671 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25672 OBJECT_TYPE is not a class. */
25674 /* If the OBJECT_TYPE is a template specialization, it may
25675 be instantiated during name lookup. In that case, errors
25676 may be issued. Even if we rollback the current tentative
25677 parse, those errors are valid. */
25679 name,
25682 tf_warning_or_error);
25683 else
25687 /* Look it up in the enclosing context. DR 141: When looking for a
25688 template-name after -> or ., only consider class templates. */
25693 /* The object is type-dependent, so we can't look anything up; we used
25694 this to get the DR 141 behavior. */
25698 }
25699 else
25700 {
25706 }
25708 /* If the lookup failed, let our caller know. */
25712 /* Pull out the template from an injected-class-name (or multiple). */
25716 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25718 {
25721 /* The error message we have to print is too complicated for
25722 cp_parser_error, so we incorporate its actions directly. */
25724 {
25726 name);
25728 }
25730 }
25738 /* If we have resolved the name of a member declaration, check to
25739 see if the declaration is accessible. When the name resolves to
25740 set of overloaded functions, accessibility is checked when
25741 overload resolution is done.
25743 During an explicit instantiation, access is not checked at all,
25744 as per [temp.explicit]. */
25751 }
25753 /* Like cp_parser_lookup_name, but for use in the typical case where
25754 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25755 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25757 static tree
25759 {
25761 none_type,
25766 location);
25767 }
25769 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25770 the current context, return the TYPE_DECL. If TAG_NAME_P is
25771 true, the DECL indicates the class being defined in a class-head,
25772 or declared in an elaborated-type-specifier.
25774 Otherwise, return DECL. */
25776 static tree
25778 {
25779 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25780 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25782 struct A {
25783 template <typename T> struct B;
25784 };
25786 template <typename T> struct A::B {};
25788 Similarly, in an elaborated-type-specifier:
25790 namespace N { struct X{}; }
25792 struct A {
25793 template <typename T> friend struct N::X;
25794 };
25796 However, if the DECL refers to a class type, and we are in
25797 the scope of the class, then the name lookup automatically
25798 finds the TYPE_DECL created by build_self_reference rather
25799 than a TEMPLATE_DECL. For example, in:
25801 template <class T> struct S {
25802 S s;
25803 };
25805 there is no need to handle such case. */
25811 }
25813 /* If too many, or too few, template-parameter lists apply to the
25814 declarator, issue an error message. Returns TRUE if all went well,
25815 and FALSE otherwise. */
25817 static bool
25820 location_t declarator_location)
25821 {
25823 {
25825 {
25833 /* If the DECLARATOR has the form `X<y>' then it uses one
25834 additional level of template parameters. */
25837 return cp_parser_check_template_parameters
25839 }
25855 }
25857 }
25859 /* NUM_TEMPLATES were used in the current declaration. If that is
25860 invalid, return FALSE and issue an error messages. Otherwise,
25861 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25862 declarator and we can print more accurate diagnostics. */
25864 static bool
25867 location_t location,
25869 {
25870 /* If there are the same number of template classes and parameter
25871 lists, that's OK. */
25874 /* If there are more, but only one more, then we are referring to a
25875 member template. That's OK too. */
25878 /* If there are more template classes than parameter lists, we have
25879 something like:
25881 template <class T> void S<T>::R<T>::f (); */
25883 {
25893 else
25896 }
25897 /* Otherwise, there are too many template parameter lists. We have
25898 something like:
25900 template <class T> template <class U> void S::f(); */
25903 }
25905 /* Parse an optional `::' token indicating that the following name is
25906 from the global namespace. If so, PARSER->SCOPE is set to the
25907 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25908 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25909 Returns the new value of PARSER->SCOPE, if the `::' token is
25910 present, and NULL_TREE otherwise. */
25912 static tree
25914 {
25917 /* Peek at the next token. */
25919 /* If we're looking at a `::' token then we're starting from the
25920 global namespace, not our current location. */
25922 {
25923 /* Consume the `::' token. */
25925 /* Set the SCOPE so that we know where to start the lookup. */
25931 }
25933 {
25937 }
25940 }
25942 /* Returns TRUE if the upcoming token sequence is the start of a
25943 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
25944 declarator is preceded by the `friend' specifier. */
25946 static bool
25948 {
25951 tree nested_name_specifier;
25954 /* The common case is that this is not a constructor declarator, so
25955 try to avoid doing lots of work if at all possible. It's not
25956 valid declare a constructor at function scope. */
25959 /* And only certain tokens can begin a constructor declarator. */
25967 /* Parse tentatively; we are going to roll back all of the tokens
25968 consumed here. */
25970 /* Assume that we are looking at a constructor declarator. */
25973 /* Look for the optional `::' operator. */
25976 /* Look for the nested-name-specifier. */
25977 nested_name_specifier
25988 /* Outside of a class-specifier, there must be a
25989 nested-name-specifier. Except in C++17 mode, where we
25990 might be declaring a guiding declaration. */
25997 /* If we have a class scope, this is easy; DR 147 says that S::S always
25998 names the constructor, and no other qualified name could. */
26001 {
26011 }
26012 /* If we still think that this might be a constructor-declarator,
26013 look for a class-name. */
26015 {
26016 /* If we have:
26018 template <typename T> struct S {
26019 S();
26020 };
26022 we must recognize that the nested `S' names a class. */
26026 tree type_decl;
26030 none_type,
26037 {
26043 none_type,
26048 else
26050 }
26052 /* If there was no class-name, then this is not a constructor.
26053 Otherwise, if we are in a class-specifier and we aren't
26054 handling a friend declaration, check that its type matches
26055 current_class_type (c++/38313). Note: error_mark_node
26056 is left alone for error recovery purposes. */
26058 && (outside_class_specifier_p
26064 /* If we're still considering a constructor, we have to see a `(',
26065 to begin the parameter-declaration-clause, followed by either a
26066 `)', an `...', or a decl-specifier. We need to check for a
26067 type-specifier to avoid being fooled into thinking that:
26069 S (f) (int);
26071 is a constructor. (It is actually a function named `f' that
26072 takes one parameter (of type `int') and returns a value of type
26073 `S'. */
26081 /* A parameter declaration begins with a decl-specifier,
26082 which is either the "attribute" keyword, a storage class
26083 specifier, or (usually) a type-specifier. */
26085 {
26086 tree type;
26090 /* Names appearing in the type-specifier should be looked up
26091 in the scope of the class. */
26095 {
26098 {
26102 {
26105 }
26106 }
26108 }
26110 /* Inside the constructor parameter list, surrounding
26111 template-parameter-lists do not apply. */
26112 saved_num_template_parameter_lists
26116 /* Look for the type-specifier. */
26118 CP_PARSER_FLAGS_NONE,
26124 parser->num_template_parameter_lists
26127 /* Leave the scope of the class. */
26132 }
26133 }
26135 /* We did not really want to consume any tokens. */
26139 }
26141 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26142 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26143 they must be performed once we are in the scope of the function.
26145 Returns the function defined. */
26147 static tree
26148 cp_parser_function_definition_from_specifiers_and_declarator
26151 tree attributes,
26153 {
26154 tree fn;
26157 /* Begin the function-definition. */
26160 /* The things we're about to see are not directly qualified by any
26161 template headers we've seen thus far. */
26164 /* If there were names looked up in the decl-specifier-seq that we
26165 did not check, check them now. We must wait until we are in the
26166 scope of the function to perform the checks, since the function
26167 might be a friend. */
26171 {
26176 }
26179 {
26180 /* Skip the entire function. */
26183 }
26185 {
26186 /* Seen already, skip it. An error message has already been output. */
26190 /* If this is a function from a class, pop the nested class. */
26193 }
26194 else
26195 {
26196 timevar_id_t tv;
26199 else
26205 }
26208 }
26210 /* Parse the part of a function-definition that follows the
26211 declarator. INLINE_P is TRUE iff this function is an inline
26212 function defined within a class-specifier.
26214 Returns the function defined. */
26216 static tree
26219 {
26220 tree fn;
26226 bool fully_implicit_function_template_p
26229 tree implicit_template_parms
26232 cp_binding_level* implicit_template_scope
26238 /* If the next token is `return', then the code may be trying to
26239 make use of the "named return value" extension that G++ used to
26240 support. */
26243 {
26244 /* Consume the `return' keyword. */
26246 /* Look for the identifier that indicates what value is to be
26247 returned. */
26249 /* Issue an error message. */
26252 /* Skip tokens until we reach the start of the function body. */
26254 {
26261 }
26262 }
26263 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26264 anything declared inside `f'. */
26265 saved_in_unbraced_linkage_specification_p
26268 /* Inside the function, surrounding template-parameter-lists do not
26269 apply. */
26270 saved_num_template_parameter_lists
26276 /* If the next token is `try', `__transaction_atomic', or
26277 `__transaction_relaxed`, then we are looking at either function-try-block
26278 or function-transaction-block. Note that all of these include the
26279 function-body. */
26282 RID_TRANSACTION_ATOMIC);
26284 RID_TRANSACTION_RELAXED))
26286 RID_TRANSACTION_RELAXED);
26289 else
26290 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26295 /* Finish the function. */
26298 /* Generate code for it, if necessary. */
26300 /* Restore the saved values. */
26301 parser->in_unbraced_linkage_specification_p
26303 parser->num_template_parameter_lists
26307 parser->fully_implicit_function_template_p
26309 parser->implicit_template_parms
26311 parser->implicit_template_scope
26318 }
26320 /* Parse a template-declaration body (following argument list). */
26322 static void
26324 tree parameter_list,
26326 {
26330 /* We just processed one more parameter list. */
26333 /* Get the deferred access checks from the parameter list. These
26334 will be checked once we know what is being declared, as for a
26335 member template the checks must be performed in the scope of the
26336 class containing the member. */
26339 /* Tentatively parse for a new template parameter list, which can either be
26340 the template keyword or a template introduction. */
26346 else
26347 {
26348 /* There are no access checks when parsing a template, as we do not
26349 know if a specialization will be a friend. */
26353 checks,
26354 member_p,
26359 /* If this is a member template declaration, let the front
26360 end know. */
26362 {
26367 }
26372 }
26373 /* We are done with the current parameter list. */
26378 /* Finish up. */
26381 /* Check the template arguments for a literal operator template. */
26385 {
26389 else
26390 {
26393 {
26399 }
26401 {
26410 }
26411 else
26413 }
26415 {
26418 " Expected non-type template argument pack <char...>"
26420 decl);
26421 else
26424 decl);
26425 }
26426 }
26428 /* Register member declarations. */
26431 /* If DECL is a function template, we must return to parse it later.
26432 (Even though there is no definition, there might be default
26433 arguments that need handling.) */
26437 }
26439 /* Parse a template introduction header for a template-declaration. Returns
26440 false if tentative parse fails. */
26442 static bool
26444 {
26451 /* Look for the optional `::' operator. */
26454 /* Look for the nested-name-specifier. */
26464 /* Look up the concept for which we will be matching
26465 template parameters. */
26475 /* Look for opening brace for introduction. */
26483 /* Build vector of placeholder parameters and grab
26484 matching identifiers. */
26487 /* The introduction-list shall not be empty. */
26490 {
26493 }
26495 /* Look for closing brace for introduction. */
26500 {
26504 }
26506 /* Build and associate the constraint. */
26509 {
26511 member_p);
26513 }
26517 }
26519 /* Parse a normal template-declaration following the template keyword. */
26521 static void
26523 {
26524 tree parameter_list;
26528 /* Look for the `<' token. */
26532 {
26533 /* 14.5.2.2 [temp.mem]
26535 A local class shall not have member templates. */
26540 }
26541 /* [temp]
26543 A template ... shall not have C linkage. */
26545 {
26547 /* Give it C++ linkage to avoid confusing other parts of the
26548 front end. */
26551 }
26552 else
26555 /* We cannot perform access checks on the template parameter
26556 declarations until we know what is being declared, just as we
26557 cannot check the decl-specifier list. */
26560 /* If the next token is `>', then we have an invalid
26561 specialization. Rather than complain about an invalid template
26562 parameter, issue an error message here. */
26564 {
26568 }
26569 else
26570 {
26571 /* Parse the template parameters. */
26573 }
26575 /* Look for the `>'. */
26578 /* Manage template requirements */
26580 {
26585 }
26588 member_p);
26590 /* For the erroneous case of a template with C linkage, we pushed an
26591 implicit C++ linkage scope; exit that scope now. */
26594 }
26596 /* Parse a template-declaration, assuming that the `export' (and
26597 `extern') keywords, if present, has already been scanned. MEMBER_P
26598 is as for cp_parser_template_declaration. */
26600 static bool
26602 {
26604 {
26608 }
26613 }
26615 /* Perform the deferred access checks from a template-parameter-list.
26616 CHECKS is a TREE_LIST of access checks, as returned by
26617 get_deferred_access_checks. */
26619 static void
26620 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26621 {
26625 }
26627 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26628 `function-definition' sequence that follows a template header.
26629 If MEMBER_P is true, this declaration appears in a class scope.
26631 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26632 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26634 static tree
26640 {
26643 cp_decl_specifier_seq decl_specifiers;
26647 /* This function is only used when processing a template
26648 declaration. */
26652 /* Defer access checks until we know what is being declared. */
26655 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26656 alternative. */
26659 CP_PARSER_FLAGS_OPTIONAL,
26665 /* There are no template typedefs. */
26667 {
26671 }
26673 /* Gather up the access checks that occurred the
26674 decl-specifier-seq. */
26677 /* Check for the declaration of a template class. */
26679 {
26682 {
26683 // If this is a declaration, but not a definition, associate
26684 // any constraints with the type declaration. Constraints
26685 // are associated with definitions in cp_parser_class_specifier.
26691 /* In this case:
26693 struct C {
26694 friend template <typename T> struct A<T>::B;
26695 };
26697 A<T>::B will be represented by a TYPENAME_TYPE, and
26698 therefore not recognized by shadow_tag. */
26700 && !decl
26707 else
26710 /* Perform access checks for template parameters. */
26713 /* Give a helpful diagnostic for
26714 template <class T> struct A { } a;
26715 if we aren't already recovering from an error. */
26718 {
26720 "a class template declaration must not declare "
26724 }
26725 }
26726 }
26728 /* Complain about missing 'typename' or other invalid type names. */
26731 {
26732 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26733 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26734 the rest of this declaration. */
26737 }
26739 /* If it's not a template class, try for a template function. If
26740 the next token is a `;', then this declaration does not declare
26741 anything. But, if there were errors in the decl-specifiers, then
26742 the error might well have come from an attempted class-specifier.
26743 In that case, there's no need to warn about a missing declarator. */
26747 {
26750 checks,
26752 member_p,
26753 declares_class_or_enum,
26757 /* 7.1.1-1 [dcl.stc]
26759 A storage-class-specifier shall not be specified in an explicit
26760 specialization... */
26762 && explicit_specialization_p
26764 {
26768 }
26772 }
26774 /* Look for a trailing `;' after the declaration. */
26780 out:
26783 /* Clear any current qualification; whatever comes next is the start
26784 of something new. */
26790 }
26792 /* Parse a cast-expression that is not the operand of a unary "&". */
26794 static cp_expr
26796 {
26799 }
26801 /* Parse a functional cast to TYPE. Returns an expression
26802 representing the cast. */
26804 static cp_expr
26806 {
26808 tree expression_list;
26809 cp_expr cast;
26818 {
26828 /* Create a location of the form:
26829 type_name{i, f}
26830 ^~~~~~~~~~~~~~~
26831 with caret == start at the start of the type name,
26832 finishing at the closing brace. */
26833 location_t finish_loc
26836 finish_loc);
26839 }
26848 else
26849 {
26852 }
26855 tf_warning_or_error);
26856 /* [expr.const]/1: In an integral constant expression "only type
26857 conversions to integral or enumeration type can be used". */
26863 NIC_CONSTRUCTOR))
26866 /* Create a location of the form:
26867 float(i)
26868 ^~~~~~~~
26869 with caret == start at the start of the type name,
26870 finishing at the closing paren. */
26871 location_t finish_loc
26876 }
26878 /* Save the tokens that make up the body of a member function defined
26879 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26880 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26881 specifiers applied to the declaration. Returns the FUNCTION_DECL
26882 for the member function. */
26884 static tree
26888 tree attributes)
26889 {
26892 tree fn;
26895 /* Create the FUNCTION_DECL. */
26899 /* If something went badly wrong, bail out now. */
26901 {
26902 /* If there's a function-body, skip it. */
26907 }
26909 /* Remember it, if there default args to post process. */
26912 /* Save away the tokens that make up the body of the
26913 function. */
26919 RID_TRANSACTION_ATOMIC))
26920 {
26922 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
26929 {
26935 }
26936 else
26939 {
26943 }
26944 }
26946 /* Handle function try blocks. */
26948 {
26951 }
26952 /* We can have braced-init-list mem-initializers before the fn body. */
26954 {
26957 {
26958 /* cache_group will stop after an un-nested { } pair, too. */
26962 /* variadic mem-inits have ... after the ')'. */
26965 }
26966 }
26968 /* Handle function try blocks. */
26974 /* Save away the inline definition; we will process it when the
26975 class is complete. */
26979 /* We need to know that this was defined in the class, so that
26980 friend templates are handled correctly. */
26983 /* Add FN to the queue of functions to be parsed later. */
26987 }
26989 /* Save the tokens that make up the in-class initializer for a non-static
26990 data member. Returns a DEFAULT_ARG. */
26992 static tree
26994 {
26996 }
26998 /* Parse a template-argument-list, as well as the trailing ">" (but
26999 not the opening "<"). See cp_parser_template_argument_list for the
27000 return value. */
27002 static tree
27004 {
27005 tree arguments;
27006 tree saved_scope;
27007 tree saved_qualifying_scope;
27008 tree saved_object_scope;
27013 /* [temp.names]
27015 When parsing a template-id, the first non-nested `>' is taken as
27016 the end of the template-argument-list rather than a greater-than
27017 operator. */
27018 saved_greater_than_is_operator_p
27021 /* Parsing the argument list may modify SCOPE, so we save it
27022 here. */
27026 /* We need to evaluate the template arguments, even though this
27027 template-id may be nested within a "sizeof". */
27032 /* Parse the template-argument-list itself. */
27036 else
27038 /* Look for the `>' that ends the template-argument-list. If we find
27039 a '>>' instead, it's probably just a typo. */
27041 {
27043 {
27044 /* In C++0x, a `>>' in a template argument list or cast
27045 expression is considered to be two separate `>'
27046 tokens. So, change the current token to a `>', but don't
27047 consume it: it will be consumed later when the outer
27048 template argument list (or cast expression) is parsed.
27049 Note that this replacement of `>' for `>>' is necessary
27050 even if we are parsing tentatively: in the tentative
27051 case, after calling
27052 cp_parser_enclosed_template_argument_list we will always
27053 throw away all of the template arguments and the first
27054 closing `>', either because the template argument list
27055 was erroneous or because we are replacing those tokens
27056 with a CPP_TEMPLATE_ID token. The second `>' (which will
27057 not have been thrown away) is needed either to close an
27058 outer template argument list or to complete a new-style
27059 cast. */
27062 }
27064 {
27065 /* If we're in a nested template argument list, the '>>' has
27066 to be a typo for '> >'. We emit the error message, but we
27067 continue parsing and we push a '>' as next token, so that
27068 the argument list will be parsed correctly. Note that the
27069 global source location is still on the token before the
27070 '>>', so we need to say explicitly where we want it. */
27078 }
27079 else
27080 {
27081 /* If this is not a nested template argument list, the '>>'
27082 is a typo for '>'. Emit an error message and continue.
27083 Same deal about the token location, but here we can get it
27084 right by consuming the '>>' before issuing the diagnostic. */
27087 "spurious %<>>%>, use %<>%> to terminate "
27089 }
27090 }
27091 else
27093 /* The `>' token might be a greater-than operator again now. */
27094 parser->greater_than_is_operator_p
27096 /* Restore the SAVED_SCOPE. */
27104 }
27106 /* MEMBER_FUNCTION is a member function, or a friend. If default
27107 arguments, or the body of the function have not yet been parsed,
27108 parse them now. */
27110 static void
27112 {
27114 /* If this member is a template, get the underlying
27115 FUNCTION_DECL. */
27119 /* There should not be any class definitions in progress at this
27120 point; the bodies of members are only parsed outside of all class
27121 definitions. */
27123 /* While we're parsing the member functions we might encounter more
27124 classes. We want to handle them right away, but we don't want
27125 them getting mixed up with functions that are currently in the
27126 queue. */
27129 /* Make sure that any template parameters are in scope. */
27132 /* If the body of the function has not yet been parsed, parse it
27133 now. */
27135 {
27136 tree function_scope;
27139 /* The function is no longer pending; we are processing it. */
27144 /* If this is a local class, enter the scope of the containing
27145 function. */
27150 /* Push the body of the function onto the lexer stack. */
27153 /* Let the front end know that we going to be defining this
27154 function. */
27158 /* Don't do access checking if it is a templated function. */
27162 /* #pragma omp declare reduction needs special parsing. */
27164 {
27169 }
27170 else
27171 /* Now, parse the body of the function. */
27178 /* Leave the scope of the containing function. */
27182 }
27184 /* Remove any template parameters from the symbol table. */
27187 /* Restore the queue. */
27190 }
27192 /* If DECL contains any default args, remember it on the unparsed
27193 functions queue. */
27195 static void
27197 {
27198 tree probe;
27201 probe;
27204 {
27208 }
27209 }
27211 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27212 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27213 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27214 from the parameter-type-list. */
27216 static tree
27219 {
27221 tree parsed_arg;
27227 /* Push the saved tokens for the default argument onto the parser's
27228 lexer stack. */
27234 /* Parse the default argument. */
27245 {
27246 /* In a non-template class, check conversions now. In a template,
27247 we'll wait and instantiate these as needed. */
27250 tf_warning_or_error);
27253 else
27255 }
27257 /* If the token stream has not been completely used up, then
27258 there was extra junk after the end of the default
27259 argument. */
27261 {
27264 else
27266 }
27268 /* Revert to the main lexer. */
27272 }
27274 /* FIELD is a non-static data member with an initializer which we saved for
27275 later; parse it now. */
27277 static void
27279 {
27280 tree def;
27287 NULL_TREE);
27293 }
27295 /* FN is a FUNCTION_DECL which may contains a parameter with an
27296 unparsed DEFAULT_ARG. Parse the default args now. This function
27297 assumes that the current scope is the scope in which the default
27298 argument should be processed. */
27300 static void
27302 {
27306 /* While we're parsing the default args, we might (due to the
27307 statement expression extension) encounter more classes. We want
27308 to handle them right away, but we don't want them getting mixed
27309 up with default args that are currently in the queue. */
27312 /* Local variable names (and the `this' keyword) may not appear
27313 in a default argument. */
27324 {
27326 tree parsed_arg;
27328 tree copy;
27335 /* This can happen for a friend declaration for a function
27336 already declared with default arguments. */
27339 parsed_arg
27341 default_arg,
27344 {
27346 }
27350 /* Update any instantiations we've already created. */
27354 }
27358 /* Make sure no default arg is missing. */
27361 /* Restore the state of local_variables_forbidden_p. */
27364 /* Restore the queue. */
27366 }
27368 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27370 sizeof ... ( identifier )
27372 where the 'sizeof' token has already been consumed. */
27374 static tree
27376 {
27377 /* Consume the `...'. */
27384 else
27392 /* The name is not qualified. */
27411 }
27413 /* Parse the operand of `sizeof' (or a similar operator). Returns
27414 either a TYPE or an expression, depending on the form of the
27415 input. The KEYWORD indicates which kind of expression we have
27416 encountered. */
27418 static tree
27420 {
27427 /* If it's a `...', then we are computing the length of a parameter
27428 pack. */
27433 /* Types cannot be defined in a `sizeof' expression. Save away the
27434 old message. */
27436 /* And create the new one. */
27442 /* The restrictions on constant-expressions do not apply inside
27443 sizeof expressions. */
27444 saved_integral_constant_expression_p
27446 saved_non_integral_constant_expression_p
27450 /* Do not actually evaluate the expression. */
27453 /* If it's a `(', then we might be looking at the type-id
27454 construction. */
27456 {
27459 /* We can't be sure yet whether we're looking at a type-id or an
27460 expression. */
27462 /* Note: as a GNU Extension, compound literals are considered
27463 postfix-expressions as they are in C99, so they are valid
27464 arguments to sizeof. See comment in cp_parser_cast_expression
27465 for details. */
27468 else
27469 {
27472 /* Look for the type-id. */
27474 /* Look for the closing `)'. */
27477 }
27479 /* If all went well, then we're done. */
27481 {
27482 cp_decl_specifier_seq decl_specs;
27484 /* Build a trivial decl-specifier-seq. */
27488 /* Call grokdeclarator to figure out what type this is. */
27491 TYPENAME,
27494 }
27495 }
27497 /* If the type-id production did not work out, then we must be
27498 looking at the unary-expression production. */
27502 /* Go back to evaluating expressions. */
27506 /* Free the message we created. */
27508 /* And restore the old one. */
27510 parser->integral_constant_expression_p
27512 parser->non_integral_constant_expression_p
27516 }
27518 /* If the current declaration has no declarator, return true. */
27520 static bool
27522 {
27523 /* If the next token is a `;' or a `,' then there is no
27524 declarator. */
27527 }
27529 /* Update the DECL_SPECS to reflect the storage class indicated by
27530 KEYWORD. */
27532 static void
27537 {
27538 cp_storage_class storage_class;
27541 {
27545 }
27547 {
27550 }
27555 {
27558 }
27561 {
27579 }
27583 /* A storage class specifier cannot be applied alongside a typedef
27584 specifier. If there is a typedef specifier present then set
27585 conflicting_specifiers_p which will trigger an error later
27586 on in grokdeclarator. */
27589 }
27591 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27592 is true, the type is a class or enum definition. */
27594 static void
27596 tree type_spec,
27599 {
27602 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27603 (with, for example, in "typedef int wchar_t;") we remember that
27604 this is what happened. In system headers, we ignore these
27605 declarations so that G++ can work with system headers that are not
27606 C++-safe. */
27608 && !type_definition_p
27618 {
27621 ds_redefined_builtin_type_spec,
27622 token);
27624 {
27628 }
27629 }
27632 else
27633 {
27638 }
27639 }
27641 /* True iff TOKEN is the GNU keyword __thread. */
27643 static bool
27645 {
27648 }
27650 /* Set the location for a declarator specifier and check if it is
27651 duplicated.
27653 DECL_SPECS is the sequence of declarator specifiers onto which to
27654 set the location.
27656 DS is the single declarator specifier to set which location is to
27657 be set onto the existing sequence of declarators.
27659 LOCATION is the location for the declarator specifier to
27660 consider. */
27662 static void
27665 {
27674 {
27678 }
27679 else
27680 {
27682 {
27686 else
27687 {
27690 OPT_Wlong_long,
27692 }
27693 }
27695 {
27700 else
27701 {
27705 }
27706 }
27707 else
27708 {
27724 "__complex"
27725 };
27729 }
27730 }
27731 }
27733 /* Return true iff the declarator specifier DS is present in the
27734 sequence of declarator specifiers DECL_SPECS. */
27736 bool
27738 cp_decl_spec ds)
27739 {
27746 }
27748 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27749 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27751 static bool
27753 {
27755 }
27757 /* Issue an error message indicating that TOKEN_DESC was expected.
27758 If KEYWORD is true, it indicated this function is called by
27759 cp_parser_require_keword and the required token can only be
27760 a indicated keyword. */
27762 static void
27764 required_token token_desc,
27766 {
27768 {
27837 }
27839 {
27841 {
27920 }
27921 }
27922 else
27924 }
27928 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27929 issue an error message indicating that TOKEN_DESC was expected.
27931 Returns the token consumed, if the token had the appropriate type.
27932 Otherwise, returns NULL. */
27937 required_token token_desc)
27938 {
27941 else
27942 {
27943 /* Output the MESSAGE -- unless we're parsing tentatively. */
27947 }
27948 }
27950 /* An error message is produced if the next token is not '>'.
27951 All further tokens are skipped until the desired token is
27952 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27954 static void
27956 {
27957 /* Current level of '< ... >'. */
27959 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27962 /* Are we ready, yet? If not, issue error message. */
27966 /* Skip tokens until the desired token is found. */
27968 {
27969 /* Peek at the next token. */
27971 {
27979 /* C++0x views the `>>' operator as two `>' tokens, but
27980 C++98 does not. */
27983 {
27984 /* We've hit a `>>' where the first `>' closes the
27985 template argument list, and the second `>' is
27986 spurious. Just consume the `>>' and stop; we've
27987 already produced at least one error. */
27990 }
27991 /* Fall through for C++0x, so we handle the second `>' in
27992 the `>>'. */
27997 {
27998 /* We've reached the token we want, consume it and stop. */
28001 }
28020 /* The '>' was probably forgotten, don't look further. */
28025 }
28027 /* Consume this token. */
28029 }
28030 }
28032 /* If the next token is the indicated keyword, consume it. Otherwise,
28033 issue an error message indicating that TOKEN_DESC was expected.
28035 Returns the token consumed, if the token had the appropriate type.
28036 Otherwise, returns NULL. */
28041 required_token token_desc)
28042 {
28046 {
28049 }
28052 }
28054 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28055 function-definition. */
28057 static bool
28059 {
28062 /* A ctor-initializer begins with a `:'. */
28064 /* A function-try-block begins with `try'. */
28066 /* A function-transaction-block begins with `__transaction_atomic'
28067 or `__transaction_relaxed'. */
28070 /* The named return value extension begins with `return'. */
28072 }
28074 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28075 definition. */
28077 static bool
28079 {
28086 }
28088 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28089 C++0x) ending a template-argument. */
28091 static bool
28093 {
28101 }
28103 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28104 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28106 static bool
28109 {
28115 /* Check for the sequence `<::' in the original code. It would be lexed as
28116 `[:', where `[' is a digraph, and there is no whitespace before
28117 `:'. */
28119 {
28124 }
28126 }
28128 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28129 or none_type otherwise. */
28131 static enum tag_types
28133 {
28135 {
28145 }
28146 }
28148 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28149 or none_type otherwise or if the token is null. */
28151 static enum tag_types
28153 {
28158 {
28166 }
28167 }
28169 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28171 static void
28173 {
28177 {
28181 type))
28184 }
28185 }
28187 /* Issue an error message if DECL is redeclared with different
28188 access than its original declaration [class.access.spec/3].
28189 This applies to nested classes, nested class templates and
28190 enumerations [class.mem/1]. */
28192 static void
28194 {
28205 }
28207 /* Look for the `template' keyword, as a syntactic disambiguator.
28208 Return TRUE iff it is present, in which case it will be
28209 consumed. */
28211 static bool
28213 {
28215 {
28216 /* In C++98 the `template' keyword can only be used within templates;
28217 outside templates the parser can always figure out what is a
28218 template and what is not. In C++11, per the resolution of DR 468,
28219 `template' is allowed in cases where it is not strictly necessary. */
28222 {
28225 "in C++98 %<template%> (as a disambiguator) is only "
28227 /* If this part of the token stream is rescanned, the same
28228 error message would be generated. So, we purge the token
28229 from the stream. */
28232 }
28233 else
28234 {
28235 /* Consume the `template' keyword. */
28238 }
28239 }
28241 }
28243 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28244 set PARSER->SCOPE, and perform other related actions. */
28246 static void
28248 {
28251 /* Get the stored value. */
28253 /* Set the scope from the stored value. */
28257 }
28259 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28260 encounter the end of a block before what we were looking for. */
28262 static bool
28266 {
28268 {
28271 /* Abort a parenthesized expression if we encounter a semicolon. */
28275 /* If we've reached the end of the file, stop. */
28281 /* We've hit the end of an enclosing block, so there's been some
28282 kind of syntax error. */
28285 /* Consume the token. */
28287 /* See if it starts a new group. */
28289 {
28291 /* In theory this should probably check end == '}', but
28292 cp_parser_save_member_function_body needs it to exit
28293 after either '}' or ')' when called with ')'. */
28296 }
28298 {
28302 }
28307 }
28308 }
28310 /* Like above, for caching a default argument or NSDMI. Both of these are
28311 terminated by a non-nested comma, but it can be unclear whether or not a
28312 comma is nested in a template argument list unless we do more parsing.
28313 In order to handle this ambiguity, when we encounter a ',' after a '<'
28314 we try to parse what follows as a parameter-declaration-list (in the
28315 case of a default argument) or a member-declarator (in the case of an
28316 NSDMI). If that succeeds, then we stop caching. */
28318 static tree
28320 {
28325 tree default_argument;
28327 /* Add tokens until we have processed the entire default
28328 argument. We add the range [first_token, token). */
28331 {
28332 /* For list-initialization, this is straightforward. */
28335 }
28337 {
28340 /* Peek at the next token. */
28342 /* What we do depends on what token we have. */
28344 {
28345 /* In valid code, a default argument must be
28346 immediately followed by a `,' `)', or `...'. */
28349 {
28350 /* If we've seen a '<', we might be in a
28351 template-argument-list. Until Core issue 325 is
28352 resolved, we don't know how this situation ought
28353 to be handled, so try to DTRT. We check whether
28354 what comes after the comma is a valid parameter
28355 declaration list. If it is, then the comma ends
28356 the default argument; otherwise the default
28357 argument continues. */
28361 /* Set ITALP so cp_parser_parameter_declaration_list
28362 doesn't decide to commit to this parse. */
28369 {
28370 /* Parse declarators until we reach a non-comma or
28371 somthing that cannot be an initializer.
28372 Just checking whether we're looking at a single
28373 declarator is insufficient. Consider:
28374 int var = tuple<T,U>::x;
28375 The template parameter 'U' looks exactly like a
28376 declarator. */
28377 do
28378 {
28389 }
28391 /* If we met an '=' or ';' then the original comma
28392 was the end of the NSDMI. Otherwise assume
28393 we're still in the NSDMI. */
28396 }
28397 else
28398 {
28403 }
28410 }
28411 /* FALLTHRU */
28414 /* If we run into a non-nested `;', `}', or `]',
28415 then the code is invalid -- but the default
28416 argument is certainly over. */
28421 /* Handle correctly int n = sizeof ... ( p ); */
28424 /* Update DEPTH, if necessary. */
28439 /* This might be the comparison operator, or it might
28440 start a template argument list. */
28447 /* Fall through for C++0x, which treats the `>>'
28448 operator like two `>' tokens in certain
28449 cases. */
28454 {
28455 /* This might be an operator, or it might close a
28456 template argument list. But if a previous '<'
28457 started a template argument list, this will have
28458 closed it, so we can't be in one anymore. */
28462 }
28465 /* If we run out of tokens, issue an error message. */
28473 /* In these cases, we should look for template-ids.
28474 For example, if the default argument is
28475 `X<int, double>()', we need to do name lookup to
28476 figure out whether or not `X' is a template; if
28477 so, the `,' does not end the default argument.
28479 That is not yet done. */
28484 }
28486 /* If we've reached the end, stop. */
28490 /* Add the token to the token block. */
28492 }
28494 /* Create a DEFAULT_ARG to represent the unparsed default
28495 argument. */
28502 }
28504 /* Begin parsing tentatively. We always save tokens while parsing
28505 tentatively so that if the tentative parsing fails we can restore the
28506 tokens. */
28508 static void
28510 {
28511 /* Enter a new parsing context. */
28513 /* Begin saving tokens. */
28515 /* In order to avoid repetitive access control error messages,
28516 access checks are queued up until we are no longer parsing
28517 tentatively. */
28519 }
28521 /* Commit to the currently active tentative parse. */
28523 static void
28525 {
28529 /* Mark all of the levels as committed. */
28532 {
28539 }
28540 }
28542 /* Commit to the topmost currently active tentative parse.
28544 Note that this function shouldn't be called when there are
28545 irreversible side-effects while in a tentative state. For
28546 example, we shouldn't create a permanent entry in the symbol
28547 table, or issue an error message that might not apply if the
28548 tentative parse is aborted. */
28550 static void
28552 {
28557 {
28565 }
28566 }
28568 /* Abort the currently active tentative parse. All consumed tokens
28569 will be rolled back, and no diagnostics will be issued. */
28571 static void
28573 {
28577 /* Now, pretend that we want to see if the construct was
28578 successfully parsed. */
28580 }
28582 /* Stop parsing tentatively. If a parse error has occurred, restore the
28583 token stream. Otherwise, commit to the tokens we have consumed.
28584 Returns true if no error occurred; false otherwise. */
28586 static bool
28588 {
28592 /* Remember whether or not an error occurred, since we are about to
28593 destroy that information. */
28595 /* Remove the topmost context from the stack. */
28598 /* If no parse errors occurred, commit to the tentative parse. */
28600 {
28601 /* Commit to the tokens read tentatively, unless that was
28602 already done. */
28607 }
28608 /* Otherwise, if errors occurred, roll back our state so that things
28609 are just as they were before we began the tentative parse. */
28610 else
28611 {
28614 }
28615 /* Add the context to the front of the free list. */
28620 }
28622 /* Returns true if we are parsing tentatively and are not committed to
28623 this tentative parse. */
28625 static bool
28627 {
28630 }
28632 /* Returns nonzero iff an error has occurred during the most recent
28633 tentative parse. */
28635 static bool
28637 {
28640 }
28642 /* Returns nonzero if GNU extensions are allowed. */
28644 static bool
28646 {
28648 }
28649 \f
28650 /* Objective-C++ Productions */
28653 /* Parse an Objective-C expression, which feeds into a primary-expression
28654 above.
28656 objc-expression:
28657 objc-message-expression
28658 objc-string-literal
28659 objc-encode-expression
28660 objc-protocol-expression
28661 objc-selector-expression
28663 Returns a tree representation of the expression. */
28665 static cp_expr
28667 {
28668 /* Try to figure out what kind of declaration is present. */
28672 {
28682 {
28694 }
28700 }
28703 }
28705 /* Parse an Objective-C message expression.
28707 objc-message-expression:
28708 [ objc-message-receiver objc-message-args ]
28710 Returns a representation of an Objective-C message. */
28712 static tree
28714 {
28726 /* Construct a location e.g.
28727 [self func1:5]
28728 ^~~~~~~~~~~~~~
28729 ranging from the '[' to the ']', with the caret at the start. */
28734 }
28736 /* Parse an objc-message-receiver.
28738 objc-message-receiver:
28739 expression
28740 simple-type-specifier
28742 Returns a representation of the type or expression. */
28744 static tree
28746 {
28747 tree rcv;
28749 /* An Objective-C message receiver may be either (1) a type
28750 or (2) an expression. */
28754 /* If that worked out, fine. */
28761 CP_PARSER_FLAGS_NONE);
28768 }
28770 /* Parse the arguments and selectors comprising an Objective-C message.
28772 objc-message-args:
28773 objc-selector
28774 objc-selector-args
28775 objc-selector-args , objc-comma-args
28777 objc-selector-args:
28778 objc-selector [opt] : assignment-expression
28779 objc-selector-args objc-selector [opt] : assignment-expression
28781 objc-comma-args:
28782 assignment-expression
28783 objc-comma-args , assignment-expression
28785 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28786 selector arguments and TREE_VALUE containing a list of comma
28787 arguments. */
28789 static tree
28791 {
28797 {
28803 /* Detect if we have a unary selector. */
28812 sel_args
28817 }
28819 /* Handle non-selector arguments, if any. */
28821 {
28822 tree arg;
28827 addl_args
28832 }
28835 {
28838 }
28841 }
28843 /* Parse an Objective-C encode expression.
28845 objc-encode-expression:
28846 @encode objc-typename
28848 Returns an encoded representation of the type argument. */
28850 static cp_expr
28852 {
28853 tree type;
28864 {
28868 }
28870 /* This happens if we find @encode(T) (where T is a template
28871 typename or something dependent on a template typename) when
28872 parsing a template. In that case, we can't compile it
28873 immediately, but we rather create an AT_ENCODE_EXPR which will
28874 need to be instantiated when the template is used.
28875 */
28877 {
28881 }
28884 /* Build a location of the form:
28885 @encode(int)
28886 ^~~~~~~~~~~~
28887 with caret==start at the @ token, finishing at the close paren. */
28888 location_t combined_loc
28893 }
28895 /* Parse an Objective-C @defs expression. */
28897 static tree
28899 {
28900 tree name;
28908 }
28910 /* Parse an Objective-C protocol expression.
28912 objc-protocol-expression:
28913 @protocol ( identifier )
28915 Returns a representation of the protocol expression. */
28917 static tree
28919 {
28920 tree proto;
28928 /* Build a location of the form:
28929 @protocol(prot)
28930 ^~~~~~~~~~~~~~~
28931 with caret==start at the @ token, finishing at the close paren. */
28932 location_t combined_loc
28938 }
28940 /* Parse an Objective-C selector expression.
28942 objc-selector-expression:
28943 @selector ( objc-method-signature )
28945 objc-method-signature:
28946 objc-selector
28947 objc-selector-seq
28949 objc-selector-seq:
28950 objc-selector :
28951 objc-selector-seq objc-selector :
28953 Returns a representation of the method selector. */
28955 static tree
28957 {
28969 {
28978 {
28979 /* Detect if we have a unary selector. */
28981 {
28984 }
28985 else
28986 {
28988 }
28989 }
28994 {
28995 sel_seq
28998 sel_seq
29001 }
29002 else
29003 sel_seq
29008 }
29010 finish_selector:
29014 /* Build a location of the form:
29015 @selector(func)
29016 ^~~~~~~~~~~~~~~
29017 with caret==start at the @ token, finishing at the close paren. */
29018 location_t combined_loc
29022 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29025 }
29027 /* Parse a list of identifiers.
29029 objc-identifier-list:
29030 identifier
29031 objc-identifier-list , identifier
29033 Returns a TREE_LIST of identifier nodes. */
29035 static tree
29037 {
29038 tree identifier;
29039 tree list;
29050 {
29057 identifier));
29059 }
29062 }
29064 /* Parse an Objective-C alias declaration.
29066 objc-alias-declaration:
29067 @compatibility_alias identifier identifier ;
29069 This function registers the alias mapping with the Objective-C front end.
29070 It returns nothing. */
29072 static void
29074 {
29082 }
29084 /* Parse an Objective-C class forward-declaration.
29086 objc-class-declaration:
29087 @class objc-identifier-list ;
29089 The function registers the forward declarations with the Objective-C
29090 front end. It returns nothing. */
29092 static void
29094 {
29097 {
29098 tree id;
29108 else
29110 }
29112 }
29114 /* Parse a list of Objective-C protocol references.
29116 objc-protocol-refs-opt:
29117 objc-protocol-refs [opt]
29119 objc-protocol-refs:
29120 < objc-identifier-list >
29122 Returns a TREE_LIST of identifiers, if any. */
29124 static tree
29126 {
29130 {
29134 }
29137 }
29139 /* Parse a Objective-C visibility specification. */
29141 static void
29143 {
29147 {
29162 }
29164 /* Eat '@private'/'@protected'/'@public'. */
29166 }
29168 /* Parse an Objective-C method type. Return 'true' if it is a class
29169 (+) method, and 'false' if it is an instance (-) method. */
29173 {
29176 else
29178 }
29180 /* Parse an Objective-C protocol qualifier. */
29182 static tree
29184 {
29197 {
29202 }
29205 }
29207 /* Parse an Objective-C typename. */
29209 static tree
29211 {
29215 {
29221 /* An ObjC type name may consist of just protocol qualifiers, in which
29222 case the type shall default to 'id'. */
29224 {
29227 /* If the type could not be parsed, an error has already
29228 been produced. For error recovery, behave as if it had
29229 not been specified, which will use the default type
29230 'id'. */
29232 {
29234 /* We need to skip to the closing parenthesis as
29235 cp_parser_type_id() does not seem to do it for
29236 us. */
29241 }
29242 }
29246 }
29249 }
29251 /* Check to see if TYPE refers to an Objective-C selector name. */
29253 static bool
29255 {
29261 }
29263 /* Parse an Objective-C selector. */
29265 static tree
29267 {
29271 {
29274 }
29276 /* C++ operator names are allowed to appear in ObjC selectors. */
29278 {
29291 }
29292 }
29294 /* Parse an Objective-C params list. */
29296 static tree
29298 {
29304 {
29314 /* Detect if we have a unary selector. */
29317 {
29320 }
29324 {
29325 /* Something went quite wrong. There should be a colon
29326 here, but there is not. Stop parsing parameters. */
29328 }
29330 /* New ObjC allows attributes on parameters too. */
29335 params
29338 type_name,
29339 identifier,
29340 parm_attr));
29343 }
29346 {
29349 }
29351 /* We allow tail attributes for the method. */
29353 {
29361 }
29364 {
29367 }
29369 }
29371 /* Parse the non-keyword Objective-C params. */
29373 static tree
29376 {
29382 {
29384 tree parm;
29390 {
29395 }
29397 /* TODO: parse attributes for tail parameters. */
29406 }
29408 /* We allow tail attributes for the method. */
29410 {
29412 {
29417 }
29418 else
29419 /* We have an error, but parse the attributes, so that we can
29420 carry on. */
29426 }
29429 }
29431 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29433 static void
29435 {
29438 /* If the next token is `extern' and the following token is a string
29439 literal, then we have a linkage specification. */
29441 && cp_parser_is_pure_string_literal
29444 /* Handle #pragma, if any. */
29447 /* Allow stray semicolons. */
29450 /* Mark methods as optional or required, when building protocols. */
29452 {
29455 }
29457 {
29460 }
29463 /* Other stray characters must generate errors. */
29465 {
29469 }
29470 /* Finally, try to parse a block-declaration, or a function-definition. */
29471 else
29473 }
29475 /* Parse a method signature. */
29477 static tree
29479 {
29495 }
29497 static bool
29499 {
29500 tree tattr;
29505 /* If the attributes are followed by a method introducer, this is not allowed.
29506 Dump the attributes and flag the situation. */
29511 /* Otherwise, the attributes introduce some interstitial code, possibly so
29512 rewind to allow that check. */
29515 }
29517 /* Parse an Objective-C method prototype list. */
29519 static void
29521 {
29525 {
29527 {
29532 else
29536 {
29540 }
29543 }
29549 OPT_Wattributes,
29551 else
29552 /* Allow for interspersed non-ObjC++ code. */
29556 }
29560 else
29564 }
29566 /* Parse an Objective-C method definition list. */
29568 static void
29570 {
29574 {
29575 tree meth;
29578 {
29584 else
29589 {
29593 }
29595 NULL_TREE);
29597 /* For historical reasons, we accept an optional semicolon. */
29604 {
29611 }
29612 }
29613 /* The following case will be removed once @synthesize is
29614 completely implemented. */
29625 else
29626 /* Allow for interspersed non-ObjC++ code. */
29630 }
29634 else
29638 }
29640 /* Parse Objective-C ivars. */
29642 static void
29644 {
29655 {
29656 cp_decl_specifier_seq declspecs;
29658 tree prefix_attributes;
29666 CP_PARSER_FLAGS_OPTIONAL,
29670 /* auto, register, static, extern, mutable. */
29672 {
29675 }
29677 /* thread_local. */
29679 {
29682 }
29684 /* typedef. */
29686 {
29689 }
29694 /* Keep going until we hit the `;' at the end of the
29695 declaration. */
29697 {
29702 /* Check for a (possibly unnamed) bitfield declaration. */
29710 {
29711 /* Get the name of the bitfield. */
29714 sfk_none);
29716 eat_colon:
29718 /* Get the width of the bitfield. */
29719 width
29721 }
29722 else
29723 {
29724 /* Parse the declarator. */
29725 declarator
29731 }
29733 /* Look for attributes that apply to the ivar. */
29735 /* Remember which attributes are prefix attributes and
29736 which are not. */
29738 /* Combine the attributes. */
29742 /* Create the bitfield declaration. */
29744 width,
29745 attributes);
29746 else
29751 /* Add the instance variable. */
29755 /* Reset PREFIX_ATTRIBUTES. */
29764 {
29767 }
29769 }
29773 }
29778 /* Do not consume the RID_AT_END, so it will be read again as terminating
29779 the @interface of @implementation. */
29783 /* For historical reasons, we accept an optional semicolon. */
29786 }
29788 /* Parse an Objective-C protocol declaration. */
29790 static void
29792 {
29798 {
29803 }
29805 /* See if we have a forward declaration or a definition. */
29808 /* Try a forward declaration first. */
29810 {
29812 {
29813 tree id;
29823 else
29825 }
29827 }
29829 /* Ok, we got a full-fledged definition (or at least should). */
29830 else
29831 {
29836 }
29837 }
29839 /* Parse an Objective-C superclass or category. */
29841 static void
29846 {
29852 {
29855 }
29857 {
29860 /* If there is no category name, and this is an @interface, we
29861 have a class extension. */
29863 {
29866 }
29867 else
29871 }
29872 }
29874 /* Parse an Objective-C class interface. */
29876 static void
29878 {
29885 {
29886 /* It's hard to recover because even if valid @interface stuff
29887 is to follow, we can't compile it (or validate it) if we
29888 don't even know which class it refers to. Let's assume this
29889 was a stray '@interface' token in the stream and skip it.
29890 */
29892 }
29897 /* We have either a class or a category on our hands. */
29900 else
29901 {
29903 /* Handle instance variable declarations, if any. */
29906 }
29909 }
29911 /* Parse an Objective-C class implementation. */
29913 static void
29915 {
29922 {
29923 /* It's hard to recover because even if valid @implementation
29924 stuff is to follow, we can't compile it (or validate it) if
29925 we don't even know which class it refers to. Let's assume
29926 this was a stray '@implementation' token in the stream and
29927 skip it.
29928 */
29930 }
29934 /* We have either a class or a category on our hands. */
29937 else
29938 {
29940 /* Handle instance variable declarations, if any. */
29943 }
29946 }
29948 /* Consume the @end token and finish off the implementation. */
29950 static void
29952 {
29955 }
29957 /* Parse an Objective-C declaration. */
29959 static void
29961 {
29962 /* Try to figure out what kind of declaration is present. */
29967 {
29983 }
29986 {
30009 }
30010 }
30012 /* Parse an Objective-C try-catch-finally statement.
30014 objc-try-catch-finally-stmt:
30015 @try compound-statement objc-catch-clause-seq [opt]
30016 objc-finally-clause [opt]
30018 objc-catch-clause-seq:
30019 objc-catch-clause objc-catch-clause-seq [opt]
30021 objc-catch-clause:
30022 @catch ( objc-exception-declaration ) compound-statement
30024 objc-finally-clause:
30025 @finally compound-statement
30027 objc-exception-declaration:
30028 parameter-declaration
30029 '...'
30031 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30033 Returns NULL_TREE.
30035 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30036 for C. Keep them in sync. */
30038 static tree
30040 {
30041 location_t location;
30042 tree stmt;
30047 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30048 node, lest it get absorbed into the surrounding block. */
30054 {
30063 {
30064 /* We have "@catch (...)" (where the '...' are literally
30065 what is in the code). Skip the '...'.
30066 parameter_declaration is set to NULL_TREE, and
30067 objc_being_catch_clauses() knows that that means
30068 '...'. */
30071 }
30072 else
30073 {
30074 /* We have "@catch (NSException *exception)" or something
30075 like that. Parse the parameter declaration. */
30079 else
30084 }
30087 else
30088 {
30089 /* If there was no open parenthesis, we are recovering from
30090 an error, and we are trying to figure out what mistake
30091 the user has made. */
30093 /* If there is an immediate closing parenthesis, the user
30094 probably forgot the opening one (ie, they typed "@catch
30095 NSException *e)". Parse the closing parenthesis and keep
30096 going. */
30100 /* If these is no immediate closing parenthesis, the user
30101 probably doesn't know that parenthesis are required at
30102 all (ie, they typed "@catch NSException *e"). So, just
30103 forget about the closing parenthesis and keep going. */
30104 }
30108 }
30110 {
30113 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30114 node, lest it get absorbed into the surrounding block. */
30118 }
30121 }
30123 /* Parse an Objective-C synchronized statement.
30125 objc-synchronized-stmt:
30126 @synchronized ( expression ) compound-statement
30128 Returns NULL_TREE. */
30130 static tree
30132 {
30133 location_t location;
30144 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30145 node, lest it get absorbed into the surrounding block. */
30150 }
30152 /* Parse an Objective-C throw statement.
30154 objc-throw-stmt:
30155 @throw assignment-expression [opt] ;
30157 Returns a constructed '@throw' statement. */
30159 static tree
30161 {
30173 }
30175 /* Parse an Objective-C statement. */
30177 static tree
30179 {
30180 /* Try to figure out what kind of declaration is present. */
30184 {
30195 }
30198 }
30200 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30201 look ahead to see if an objc keyword follows the attributes. This
30202 is to detect the use of prefix attributes on ObjC @interface and
30203 @protocol. */
30205 static bool
30207 {
30212 {
30215 }
30218 }
30220 /* This routine is a minimal replacement for
30221 c_parser_struct_declaration () used when parsing the list of
30222 types/names or ObjC++ properties. For example, when parsing the
30223 code
30225 @property (readonly) int a, b, c;
30227 this function is responsible for parsing "int a, int b, int c" and
30228 returning the declarations as CHAIN of DECLs.
30230 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30231 similar parsing. */
30232 static tree
30234 {
30236 cp_decl_specifier_seq declspecs;
30238 tree prefix_attributes;
30241 CP_PARSER_FLAGS_NONE,
30248 /* auto, register, static, extern, mutable. */
30250 {
30253 }
30255 /* thread_local. */
30257 {
30260 }
30262 /* typedef. */
30264 {
30267 }
30272 /* Keep going until we hit the `;' at the end of the declaration. */
30274 {
30279 /* Parse the declarator. */
30283 /* Look for attributes that apply to the ivar. */
30285 /* Remember which attributes are prefix attributes and
30286 which are not. */
30288 /* Combine the attributes. */
30298 /* Reset PREFIX_ATTRIBUTES. */
30309 {
30312 }
30313 else
30315 }
30317 }
30319 /* Parse an Objective-C @property declaration. The syntax is:
30321 objc-property-declaration:
30322 '@property' objc-property-attributes[opt] struct-declaration ;
30324 objc-property-attributes:
30325 '(' objc-property-attribute-list ')'
30327 objc-property-attribute-list:
30328 objc-property-attribute
30329 objc-property-attribute-list, objc-property-attribute
30331 objc-property-attribute
30332 'getter' = identifier
30333 'setter' = identifier
30334 'readonly'
30335 'readwrite'
30336 'assign'
30337 'retain'
30338 'copy'
30339 'nonatomic'
30341 For example:
30342 @property NSString *name;
30343 @property (readonly) id object;
30344 @property (retain, nonatomic, getter=getTheName) id name;
30345 @property int a, b, c;
30347 PS: This function is identical to
30348 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30349 static void
30351 {
30352 /* The following variables hold the attributes of the properties as
30353 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30354 seen. When we see an attribute, we set them to 'true' (if they
30355 are boolean properties) or to the identifier (if they have an
30356 argument, ie, for getter and setter). Note that here we only
30357 parse the list of attributes, check the syntax and accumulate the
30358 attributes that we find. objc_add_property_declaration() will
30359 then process the information. */
30369 /* 'properties' is the list of properties that we read. Usually a
30370 single one, but maybe more (eg, in "@property int a, b, c;" there
30371 are three). */
30372 tree properties;
30373 location_t loc;
30379 /* Parse the optional attribute list... */
30381 {
30382 /* Eat the '('. */
30386 {
30392 {
30395 }
30399 {
30410 {
30414 else
30419 }
30422 {
30426 }
30428 {
30430 {
30433 }
30434 else
30438 else
30440 }
30441 else
30442 {
30444 {
30447 }
30448 else
30450 }
30456 }
30463 else
30465 }
30467 /* FIXME: "@property (setter, assign);" will generate a spurious
30468 "error: expected ‘)’ before ‘,’ token". This is because
30469 cp_parser_require, unlike the C counterpart, will produce an
30470 error even if we are in error recovery. */
30472 {
30477 }
30478 }
30480 /* ... and the property declaration(s). */
30484 {
30486 /* If the next token is now a `;', consume it. */
30490 }
30494 else
30495 {
30496 /* Comma-separated properties are chained together in
30497 reverse order; add them one by one. */
30506 }
30509 }
30511 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30513 objc-synthesize-declaration:
30514 @synthesize objc-synthesize-identifier-list ;
30516 objc-synthesize-identifier-list:
30517 objc-synthesize-identifier
30518 objc-synthesize-identifier-list, objc-synthesize-identifier
30520 objc-synthesize-identifier
30521 identifier
30522 identifier = identifier
30524 For example:
30525 @synthesize MyProperty;
30526 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30528 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30529 for C. Keep them in sync.
30530 */
30531 static void
30533 {
30535 location_t loc;
30540 {
30544 {
30547 }
30549 {
30553 {
30556 }
30557 }
30558 else
30563 else
30565 }
30568 }
30570 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30572 objc-dynamic-declaration:
30573 @dynamic identifier-list ;
30575 For example:
30576 @dynamic MyProperty;
30577 @dynamic MyProperty, AnotherProperty;
30579 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30580 for C. Keep them in sync.
30581 */
30582 static void
30584 {
30586 location_t loc;
30591 {
30592 tree property;
30595 {
30598 }
30602 else
30604 }
30607 }
30609 \f
30610 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30612 /* Returns name of the next clause.
30613 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30614 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30615 returned and the token is consumed. */
30617 static pragma_omp_clause
30619 {
30635 {
30640 {
30823 }
30824 }
30830 }
30832 /* Validate that a clause of the given type does not already exist. */
30834 static void
30837 {
30838 tree c;
30842 {
30845 }
30846 }
30848 /* OpenMP 2.5:
30849 variable-list:
30850 identifier
30851 variable-list , identifier
30853 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30854 colon). An opening parenthesis will have been consumed by the caller.
30856 If KIND is nonzero, create the appropriate node and install the decl
30857 in OMP_CLAUSE_DECL and add the node to the head of the list.
30859 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30860 return the list created.
30862 COLON can be NULL if only closing parenthesis should end the list,
30863 or pointer to bool which will receive false if the list is terminated
30864 by closing parenthesis or true if the list is terminated by colon. */
30866 static tree
30869 {
30873 {
30876 }
30878 {
30883 && current_class_ptr
30885 {
30891 }
30892 else
30893 {
30906 }
30908 ;
30910 {
30912 {
30914 /* The OpenACC cache directive explicitly only allows "array
30915 elements or subarrays". */
30917 {
30921 }
30922 /* FALLTHROUGH. */
30927 {
30928 location_t loc
30933 decl
30937 }
30938 /* FALLTHROUGH. */
30942 {
30950 parser->colon_corrects_to_scope_p
30954 else
30955 {
30956 /* Look for `:'. */
30960 CPP_CLOSE_SQUARE))
30962 }
30963 /* Look for the closing `]'. */
30965 RT_CLOSE_SQUARE))
30969 }
30973 }
30979 }
30980 else
30983 get_comma:
30987 }
30993 {
30997 }
31000 {
31003 /* Try to resync to an unnested comma. Copied from
31004 cp_parser_parenthesized_expression_list. */
31005 skip_comma:
31014 }
31017 }
31019 /* Similarly, but expect leading and trailing parenthesis. This is a very
31020 common case for omp clauses. */
31022 static tree
31024 {
31028 }
31030 /* OpenACC 2.0:
31031 copy ( variable-list )
31032 copyin ( variable-list )
31033 copyout ( variable-list )
31034 create ( variable-list )
31035 delete ( variable-list )
31036 present ( variable-list )
31037 present_or_copy ( variable-list )
31038 pcopy ( variable-list )
31039 present_or_copyin ( variable-list )
31040 pcopyin ( variable-list )
31041 present_or_copyout ( variable-list )
31042 pcopyout ( variable-list )
31043 present_or_create ( variable-list )
31044 pcreate ( variable-list ) */
31046 static tree
31048 tree list)
31049 {
31052 {
31098 }
31106 }
31108 /* OpenACC 2.0:
31109 deviceptr ( variable-list ) */
31111 static tree
31113 {
31117 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31118 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31119 variable-list must only allow for pointer variables. */
31122 {
31129 }
31132 }
31134 /* OpenACC 2.0:
31135 auto
31136 independent
31137 nohost
31138 seq */
31140 static tree
31144 {
31149 }
31151 /* OpenACC:
31152 num_gangs ( expression )
31153 num_workers ( expression )
31154 vector_length ( expression ) */
31156 static tree
31159 {
31169 {
31174 }
31182 }
31184 /* OpenACC:
31186 gang [( gang-arg-list )]
31187 worker [( [num:] int-expr )]
31188 vector [( [length:] int-expr )]
31190 where gang-arg is one of:
31192 [num:] int-expr
31193 static: size-expr
31195 and size-expr may be:
31197 *
31198 int-expr
31199 */
31201 static tree
31204 {
31214 {
31217 do
31218 {
31222 /* Gang static argument. */
31225 {
31233 {
31236 }
31238 /* Check for the '*' argument. */
31242 CPP_CLOSE_PAREN)))
31243 {
31248 {
31251 }
31253 }
31254 }
31255 /* Worker num: argument and vector length: arguments. */
31259 {
31262 }
31264 /* Now collect the actual argument. */
31266 {
31269 }
31281 {
31284 }
31286 }
31291 }
31305 cleanup_error:
31308 }
31310 /* OpenACC 2.0:
31311 tile ( size-expr-list ) */
31313 static tree
31315 {
31319 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31320 so, but the spec authors never considered such a case and have
31321 differing opinions on what it might mean, including 'not
31322 allowed'.) */
31325 clause_loc);
31330 do
31331 {
31338 {
31341 }
31342 else
31346 }
31349 /* Consume the trailing ')'. */
31357 }
31359 /* OpenACC 2.0
31360 Parse wait clause or directive parameters. */
31362 static tree
31364 {
31374 {
31379 }
31386 {
31390 {
31393 else
31394 {
31401 }
31402 }
31403 }
31406 }
31408 /* OpenACC:
31409 wait ( int-expr-list ) */
31411 static tree
31413 {
31422 }
31424 /* OpenMP 3.0:
31425 collapse ( constant-expression ) */
31427 static tree
31429 {
31431 location_t loc;
31432 HOST_WIDE_INT n;
31452 {
31455 }
31464 }
31466 /* OpenMP 2.5:
31467 default ( none | shared )
31469 OpenACC:
31470 default ( none | present ) */
31472 static tree
31475 {
31477 tree c;
31482 {
31487 {
31508 }
31511 }
31512 else
31513 {
31514 invalid_kind:
31517 else
31519 }
31536 }
31538 /* OpenMP 3.1:
31539 final ( expression ) */
31541 static tree
31543 {
31564 }
31566 /* OpenMP 2.5:
31567 if ( expression )
31569 OpenMP 4.5:
31570 if ( directive-name-modifier : expression )
31572 directive-name-modifier:
31573 parallel | task | taskloop | target data | target | target update
31574 | target enter data | target exit data */
31576 static tree
31579 {
31587 {
31599 {
31602 {
31615 else
31616 {
31617 location_t loc
31622 }
31625 {
31627 {
31632 }
31634 {
31635 location_t loc
31639 }
31640 }
31641 }
31642 }
31644 {
31646 {
31649 }
31650 else
31651 {
31653 {
31654 location_t loc
31657 }
31659 }
31660 }
31661 }
31673 {
31676 {
31679 {
31689 }
31691 p);
31693 }
31695 {
31698 else
31701 }
31704 {
31708 }
31709 }
31717 }
31719 /* OpenMP 3.1:
31720 mergeable */
31722 static tree
31725 {
31726 tree c;
31729 location);
31734 }
31736 /* OpenMP 2.5:
31737 nowait */
31739 static tree
31742 {
31743 tree c;
31750 }
31752 /* OpenMP 2.5:
31753 num_threads ( expression ) */
31755 static tree
31757 location_t location)
31758 {
31780 }
31782 /* OpenMP 4.5:
31783 num_tasks ( expression ) */
31785 static tree
31787 location_t location)
31788 {
31810 }
31812 /* OpenMP 4.5:
31813 grainsize ( expression ) */
31815 static tree
31817 location_t location)
31818 {
31840 }
31842 /* OpenMP 4.5:
31843 priority ( expression ) */
31845 static tree
31847 location_t location)
31848 {
31870 }
31872 /* OpenMP 4.5:
31873 hint ( expression ) */
31875 static tree
31877 location_t location)
31878 {
31899 }
31901 /* OpenMP 4.5:
31902 defaultmap ( tofrom : scalar ) */
31904 static tree
31906 location_t location)
31907 {
31915 {
31918 }
31922 {
31925 }
31931 {
31934 }
31938 {
31941 }
31947 location);
31953 out_err:
31958 }
31960 /* OpenMP 2.5:
31961 ordered
31963 OpenMP 4.5:
31964 ordered ( constant-expression ) */
31966 static tree
31969 {
31971 HOST_WIDE_INT n;
31977 {
31994 {
31996 "ordered argument needs positive constant integer "
31999 }
32000 }
32006 }
32008 /* OpenMP 2.5:
32009 reduction ( reduction-operator : variable-list )
32011 reduction-operator:
32012 One of: + * - & ^ | && ||
32014 OpenMP 3.1:
32016 reduction-operator:
32017 One of: + * - & ^ | && || min max
32019 OpenMP 4.0:
32021 reduction-operator:
32022 One of: + * - & ^ | && ||
32023 id-expression */
32025 static tree
32027 {
32035 {
32045 }
32049 else
32050 {
32061 {
32091 }
32092 else
32093 {
32095 resync_fail:
32100 }
32101 }
32107 NULL);
32109 {
32112 }
32115 }
32117 /* OpenMP 2.5:
32118 schedule ( schedule-kind )
32119 schedule ( schedule-kind , expression )
32121 schedule-kind:
32122 static | dynamic | guided | runtime | auto
32124 OpenMP 4.5:
32125 schedule ( schedule-modifier : schedule-kind )
32126 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32128 schedule-modifier:
32129 simd
32130 monotonic
32131 nonmonotonic */
32133 static tree
32135 {
32145 {
32154 else
32160 else
32161 {
32164 }
32165 }
32168 {
32173 {
32194 }
32195 }
32200 else
32206 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32208 {
32212 }
32215 {
32230 else
32235 }
32247 invalid_kind:
32249 resync_fail:
32254 }
32256 /* OpenMP 3.0:
32257 untied */
32259 static tree
32262 {
32263 tree c;
32270 }
32272 /* OpenMP 4.0:
32273 inbranch
32274 notinbranch */
32276 static tree
32279 {
32284 }
32286 /* OpenMP 4.0:
32287 parallel
32288 for
32289 sections
32290 taskgroup */
32292 static tree
32296 {
32300 }
32302 /* OpenMP 4.5:
32303 nogroup */
32305 static tree
32308 {
32313 }
32315 /* OpenMP 4.5:
32316 simd
32317 threads */
32319 static tree
32323 {
32328 }
32330 /* OpenMP 4.0:
32331 num_teams ( expression ) */
32333 static tree
32335 location_t location)
32336 {
32358 }
32360 /* OpenMP 4.0:
32361 thread_limit ( expression ) */
32363 static tree
32365 location_t location)
32366 {
32388 }
32390 /* OpenMP 4.0:
32391 aligned ( variable-list )
32392 aligned ( variable-list : constant-expression ) */
32394 static tree
32396 {
32407 {
32417 }
32423 }
32425 /* OpenMP 4.0:
32426 linear ( variable-list )
32427 linear ( variable-list : expression )
32429 OpenMP 4.5:
32430 linear ( modifier ( variable-list ) )
32431 linear ( modifier ( variable-list ) : expression ) */
32433 static tree
32436 {
32446 {
32458 else
32460 }
32465 else
32466 {
32475 }
32478 {
32483 {
32494 {
32497 }
32500 }
32505 {
32508 }
32516 }
32519 {
32522 }
32525 }
32527 /* OpenMP 4.0:
32528 safelen ( constant-expression ) */
32530 static tree
32532 location_t location)
32533 {
32554 }
32556 /* OpenMP 4.0:
32557 simdlen ( constant-expression ) */
32559 static tree
32561 location_t location)
32562 {
32583 }
32585 /* OpenMP 4.5:
32586 vec:
32587 identifier [+/- integer]
32588 vec , identifier [+/- integer]
32589 */
32591 static tree
32593 tree list)
32594 {
32598 {
32601 }
32604 {
32611 else
32612 {
32613 t = cp_parser_lookup_name_simple
32618 id_loc);
32619 }
32625 {
32628 }
32632 {
32635 }
32639 {
32642 }
32645 add_to_vector:
32647 {
32651 }
32657 }
32660 {
32666 }
32668 }
32670 /* OpenMP 4.0:
32671 depend ( depend-kind : variable-list )
32673 depend-kind:
32674 in | out | inout
32676 OpenMP 4.5:
32677 depend ( source )
32679 depend ( sink : vec ) */
32681 static tree
32683 {
32691 {
32705 else
32707 }
32708 else
32714 {
32724 }
32731 else
32732 {
32738 }
32741 invalid_kind:
32743 resync_fail:
32748 }
32750 /* OpenMP 4.0:
32751 map ( map-kind : variable-list )
32752 map ( variable-list )
32754 map-kind:
32755 alloc | to | from | tofrom
32757 OpenMP 4.5:
32758 map-kind:
32759 alloc | to | from | tofrom | release | delete
32761 map ( always [,] map-kind: variable-list ) */
32763 static tree
32765 {
32774 {
32779 {
32782 nth++;
32788 {
32793 }
32794 }
32795 }
32799 {
32813 else
32814 {
32820 }
32823 }
32826 {
32830 }
32833 NULL);
32839 }
32841 /* OpenMP 4.0:
32842 device ( expression ) */
32844 static tree
32846 location_t location)
32847 {
32869 }
32871 /* OpenMP 4.0:
32872 dist_schedule ( static )
32873 dist_schedule ( static , expression ) */
32875 static tree
32877 location_t location)
32878 {
32891 {
32902 }
32907 location);
32911 invalid_kind:
32913 resync_fail:
32918 }
32920 /* OpenMP 4.0:
32921 proc_bind ( proc-bind-kind )
32923 proc-bind-kind:
32924 master | close | spread */
32926 static tree
32928 location_t location)
32929 {
32930 tree c;
32937 {
32947 else
32949 }
32950 else
32959 location);
32964 invalid_kind:
32966 resync_fail:
32971 }
32973 /* OpenACC:
32974 async [( int-expr )] */
32976 static tree
32978 {
32985 {
32994 }
33004 }
33006 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33007 is a bitmask in MASK. Return the list of clauses found. */
33009 static tree
33013 {
33018 {
33019 location_t here;
33020 pragma_omp_clause c_kind;
33021 omp_clause_code code;
33032 {
33084 clauses);
33102 OMP_CLAUSE_INDEPENDENT,
33114 clauses);
33120 clauses);
33144 clauses);
33166 clauses);
33178 clauses);
33192 }
33197 {
33198 /* Remove the invalid clause(s) from the list to avoid
33199 confusing the rest of the compiler. */
33202 }
33203 }
33205 saw_error:
33212 }
33214 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33215 is a bitmask in MASK. Return the list of clauses found; the result
33216 of clause default goes in *pdefault. */
33218 static tree
33222 {
33228 {
33229 pragma_omp_clause c_kind;
33240 {
33252 clauses);
33266 clauses);
33286 clauses);
33291 clauses);
33301 clauses);
33335 clauses);
33349 clauses);
33366 OMP_CLAUSE_NOTINBRANCH,
33375 {
33376 clause_not_first:
33380 }
33410 clauses);
33411 else
33421 clauses);
33439 {
33447 }
33490 clauses
33496 clauses
33508 }
33513 {
33514 /* Remove the invalid clause(s) from the list to avoid
33515 confusing the rest of the compiler. */
33518 }
33519 }
33520 saw_error:
33521 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33522 no reason to skip to the end. */
33526 {
33529 else
33531 }
33533 }
33535 /* OpenMP 2.5:
33536 structured-block:
33537 statement
33539 In practice, we're also interested in adding the statement to an
33540 outer node. So it is convenient if we work around the fact that
33541 cp_parser_statement calls add_stmt. */
33543 static unsigned
33545 {
33548 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33549 This preserves the "not within loop or switch" style error messages
33550 for nonsense cases like
33551 void foo() {
33552 #pragma omp single
33553 break;
33554 }
33555 */
33560 }
33562 static void
33564 {
33566 }
33568 static tree
33570 {
33578 }
33580 /* OpenMP 2.5:
33581 # pragma omp atomic new-line
33582 expression-stmt
33584 expression-stmt:
33585 x binop= expr | x++ | ++x | x-- | --x
33586 binop:
33587 +, *, -, /, &, ^, |, <<, >>
33589 where x is an lvalue expression with scalar type.
33591 OpenMP 3.1:
33592 # pragma omp atomic new-line
33593 update-stmt
33595 # pragma omp atomic read new-line
33596 read-stmt
33598 # pragma omp atomic write new-line
33599 write-stmt
33601 # pragma omp atomic update new-line
33602 update-stmt
33604 # pragma omp atomic capture new-line
33605 capture-stmt
33607 # pragma omp atomic capture new-line
33608 capture-block
33610 read-stmt:
33611 v = x
33612 write-stmt:
33613 x = expr
33614 update-stmt:
33615 expression-stmt | x = x binop expr
33616 capture-stmt:
33617 v = expression-stmt
33618 capture-block:
33619 { v = x; update-stmt; } | { update-stmt; v = x; }
33621 OpenMP 4.0:
33622 update-stmt:
33623 expression-stmt | x = x binop expr | x = expr binop x
33624 capture-stmt:
33625 v = update-stmt
33626 capture-block:
33627 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33629 where x and v are lvalue expressions with scalar type. */
33631 static void
33633 {
33641 {
33646 {
33652 }
33653 }
33655 {
33667 else
33671 }
33673 {
33679 {
33684 {
33687 }
33688 }
33689 }
33693 {
33703 else
33708 {
33709 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33710 opcode. */
33715 }
33719 {
33722 }
33723 else
33724 {
33730 }
33733 }
33735 restart:
33739 {
33746 /* FALLTHROUGH */
33756 /* FALLTHROUGH */
33771 /* Undo effects of boolean_increment for post {in,de}crement. */
33773 /* FALLTHRU */
33777 {
33778 /* Undo effects of boolean_increment. */
33780 {
33781 /* This is pre or post increment. */
33786 && !structured_block
33790 }
33791 }
33792 /* FALLTHRU */
33795 {
33830 {
33834 }
33837 {
33843 {
33848 }
33850 {
33862 {
33864 {
33869 }
33870 else
33872 }
33876 }
33879 {
33886 }
33890 }
33894 {
33897 {
33905 }
33907 {
33912 }
33947 }
33958 /* FALLTHROUGH */
33963 }
33970 }
33971 stmt_done:
33973 {
33984 }
33986 {
33989 }
33990 done:
33996 saw_error:
33999 {
34003 {
34007 }
34008 }
34009 }
34012 /* OpenMP 2.5:
34013 # pragma omp barrier new-line */
34015 static void
34017 {
34020 }
34022 /* OpenMP 2.5:
34023 # pragma omp critical [(name)] new-line
34024 structured-block
34026 OpenMP 4.5:
34027 # pragma omp critical [(name) [hint(expression)]] new-line
34028 structured-block */
34030 #define OMP_CRITICAL_CLAUSE_MASK \
34031 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34033 static tree
34035 {
34039 {
34053 OMP_CRITICAL_CLAUSE_MASK,
34055 }
34056 else
34061 }
34063 /* OpenMP 2.5:
34064 # pragma omp flush flush-vars[opt] new-line
34066 flush-vars:
34067 ( variable-list ) */
34069 static void
34071 {
34077 }
34079 /* Helper function, to parse omp for increment expression. */
34081 static tree
34083 {
34088 {
34091 }
34094 {
34103 /* Fall through: OpenMP disallows NE_EXPR. */
34107 }
34109 /* If decl is an iterator, preserve LHS and RHS of the relational
34110 expr until finish_omp_for. */
34121 }
34123 /* Helper function, to parse omp for increment expression. */
34125 static tree
34127 {
34131 cp_id_kind idk;
34135 {
34144 }
34153 {
34158 }
34165 {
34169 }
34182 do
34183 {
34190 {
34192 {
34195 else
34197 tf_warning_or_error);
34198 }
34199 else
34202 }
34203 }
34207 {
34213 }
34214 else
34218 }
34220 /* Parse the initialization statement of either an OpenMP for loop or
34221 a Cilk Plus for loop.
34223 Return true if the resulting construct should have an
34224 OMP_CLAUSE_PRIVATE added to it. */
34226 static tree
34235 {
34241 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34243 init-expr:
34244 var = lb
34245 integer-type var = lb
34246 random-access-iterator-type var = lb
34247 pointer-type var = lb
34248 */
34249 cp_decl_specifier_seq type_specifiers;
34251 /* First, try to parse as an initialized declaration. See
34252 cp_parser_condition, from whence the bulk of this is copied. */
34259 {
34260 /* If parsing a type specifier seq succeeded, then this
34261 MUST be a initialized declaration. */
34266 CP_PARSER_DECLARATOR_NAMED,
34277 else
34278 {
34288 {
34290 CPP_OPEN_PAREN))
34291 {
34295 else
34298 }
34299 else
34300 /* Trigger an error. */
34305 }
34309 {
34317 {
34320 auto_node);
34325 }
34328 asm_specification,
34329 LOOKUP_ONLYCONVERTING);
34332 {
34335 }
34336 else
34337 {
34340 {
34342 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34344 {
34348 {
34352 }
34354 }
34356 {
34361 }
34362 }
34363 }
34365 }
34366 else
34367 {
34368 /* Consume '='. */
34372 non_class:
34375 else
34378 asm_specification,
34379 LOOKUP_ONLYCONVERTING);
34380 }
34384 }
34385 }
34386 else
34387 {
34388 cp_id_kind idk;
34389 /* If parsing a type specifier sequence failed, then
34390 this MUST be a simple expression. */
34399 && decl
34402 {
34413 {
34418 }
34423 }
34425 && decl
34428 {
34429 tree rhs;
34437 rhs,
34438 tf_warning_or_error));
34441 }
34442 else
34443 {
34448 {
34452 }
34453 }
34454 }
34456 }
34458 /* Parse the restricted form of the for statement allowed by OpenMP. */
34460 static tree
34463 {
34467 location_t loc_first;
34478 {
34481 }
34484 {
34487 }
34490 {
34496 }
34498 {
34501 {
34503 "%<linear%> clause may not be specified together "
34506 }
34507 else
34509 }
34522 {
34525 location_t loc;
34529 {
34533 }
34536 {
34540 }
34549 add_private_clause
34556 {
34559 {
34565 }
34566 else
34568 }
34575 {
34580 {
34584 }
34587 {
34588 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34592 {
34595 }
34596 else
34597 {
34600 }
34602 }
34603 else
34604 {
34609 }
34610 }
34613 {
34614 tree c;
34616 {
34625 decl);
34629 decl);
34630 }
34632 {
34637 else
34642 {
34645 /* For linear, signal that we need to fill up
34646 the so far unknown linear step. */
34649 }
34650 }
34651 }
34660 {
34661 /* If decl is an iterator, preserve the operator on decl
34662 until finish_omp_for. */
34664 && ((processing_template_decl
34669 else
34673 }
34685 {
34688 }
34693 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34694 in between the collapsed for loops to be still considered perfectly
34695 nested. Hopefully the final version clarifies this.
34696 For now handle (multiple) {'s and empty statements. */
34699 {
34703 {
34705 bracecount++;
34706 }
34710 else
34711 {
34718 }
34719 }
34722 {
34725 }
34726 }
34731 /* Note that we saved the original contents of this flag when we entered
34732 the structured block, and so we don't need to re-save it here. */
34735 else
34738 /* Note that the grammar doesn't call for a structured block here,
34739 though the loop as a whole is a structured block. */
34746 else
34751 {
34753 {
34755 nbraces--;
34756 }
34759 else
34760 {
34762 {
34765 }
34770 }
34771 }
34774 {
34778 else
34780 }
34784 }
34786 /* Helper function for OpenMP parsing, split clauses and call
34787 finish_omp_clauses on each of the set of clauses afterwards. */
34789 static void
34792 {
34798 }
34800 /* OpenMP 4.0:
34801 #pragma omp simd simd-clause[optseq] new-line
34802 for-loop */
34804 #define OMP_SIMD_CLAUSE_MASK \
34805 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34814 static tree
34818 {
34829 {
34833 OMP_CLAUSE_ORDERED);
34835 {
34837 "%<ordered%> clause with parameter may not be specified "
34840 }
34841 }
34852 }
34854 /* OpenMP 2.5:
34855 #pragma omp for for-clause[optseq] new-line
34856 for-loop
34858 OpenMP 4.0:
34859 #pragma omp for simd for-simd-clause[optseq] new-line
34860 for-loop */
34862 #define OMP_FOR_CLAUSE_MASK \
34863 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34873 static tree
34877 {
34884 /* parallel for{, simd} disallows nowait clause, but for
34885 target {teams distribute ,}parallel for{, simd} it should be accepted. */
34888 /* Composite distribute parallel for{, simd} disallows ordered clause. */
34893 {
34898 {
34922 }
34923 }
34925 {
34928 }
34930 /* Composite distribute parallel for disallows linear clause. */
34937 {
34940 }
34951 }
34953 /* OpenMP 2.5:
34954 # pragma omp master new-line
34955 structured-block */
34957 static tree
34959 {
34963 }
34965 /* OpenMP 2.5:
34966 # pragma omp ordered new-line
34967 structured-block
34969 OpenMP 4.5:
34970 # pragma omp ordered ordered-clauses new-line
34971 structured-block */
34973 #define OMP_ORDERED_CLAUSE_MASK \
34974 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34977 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34978 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34980 static bool
34983 {
34987 {
34992 {
34994 {
34996 "%<depend%> clause may only be used in compound "
35000 }
35001 tree clauses
35003 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35007 }
35008 }
35010 tree clauses
35016 }
35018 /* OpenMP 2.5:
35020 section-scope:
35021 { section-sequence }
35023 section-sequence:
35024 section-directive[opt] structured-block
35025 section-sequence section-directive structured-block */
35027 static tree
35029 {
35041 {
35045 }
35048 {
35056 {
35060 }
35062 {
35065 }
35070 }
35081 }
35083 /* OpenMP 2.5:
35084 # pragma omp sections sections-clause[optseq] newline
35085 sections-scope */
35087 #define OMP_SECTIONS_CLAUSE_MASK \
35088 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35089 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35090 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35094 static tree
35097 {
35109 {
35112 }
35119 }
35121 /* OpenMP 2.5:
35122 # pragma omp parallel parallel-clause[optseq] new-line
35123 structured-block
35124 # pragma omp parallel for parallel-for-clause[optseq] new-line
35125 structured-block
35126 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35127 structured-block
35129 OpenMP 4.0:
35130 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35131 structured-block */
35133 #define OMP_PARALLEL_CLAUSE_MASK \
35134 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35144 static tree
35148 {
35155 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35161 {
35169 if_p);
35173 if_p);
35176 block);
35181 }
35182 /* When combined with distribute, parallel has to be followed by for.
35183 #pragma omp target parallel is allowed though. */
35187 {
35191 }
35193 {
35196 }
35198 {
35202 {
35212 block);
35215 }
35216 }
35221 {
35224 }
35232 }
35234 /* OpenMP 2.5:
35235 # pragma omp single single-clause[optseq] new-line
35236 structured-block */
35238 #define OMP_SINGLE_CLAUSE_MASK \
35239 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35240 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35241 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35242 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35244 static tree
35246 {
35256 }
35258 /* OpenMP 3.0:
35259 # pragma omp task task-clause[optseq] new-line
35260 structured-block */
35262 #define OMP_TASK_CLAUSE_MASK \
35263 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35274 static tree
35276 {
35287 }
35289 /* OpenMP 3.0:
35290 # pragma omp taskwait new-line */
35292 static void
35294 {
35297 }
35299 /* OpenMP 3.1:
35300 # pragma omp taskyield new-line */
35302 static void
35304 {
35307 }
35309 /* OpenMP 4.0:
35310 # pragma omp taskgroup new-line
35311 structured-block */
35313 static tree
35315 {
35319 if_p));
35320 }
35323 /* OpenMP 2.5:
35324 # pragma omp threadprivate (variable-list) */
35326 static void
35328 {
35329 tree vars;
35335 }
35337 /* OpenMP 4.0:
35338 # pragma omp cancel cancel-clause[optseq] new-line */
35340 #define OMP_CANCEL_CLAUSE_MASK \
35341 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35347 static void
35349 {
35353 }
35355 /* OpenMP 4.0:
35356 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35358 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35359 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35364 static void
35367 {
35368 tree clauses;
35372 {
35377 {
35380 }
35381 }
35383 {
35387 }
35390 {
35395 else
35399 }
35402 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35404 pragma_tok);
35406 }
35408 /* OpenMP 4.0:
35409 #pragma omp distribute distribute-clause[optseq] new-line
35410 for-loop */
35412 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35413 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35419 static tree
35423 {
35432 {
35440 else
35443 {
35449 {
35453 else
35456 }
35462 else
35476 }
35477 }
35479 {
35482 }
35487 {
35490 }
35501 }
35503 /* OpenMP 4.0:
35504 # pragma omp teams teams-clause[optseq] new-line
35505 structured-block */
35507 #define OMP_TEAMS_CLAUSE_MASK \
35508 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35512 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35513 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35516 static tree
35520 {
35529 {
35533 {
35558 }
35559 }
35561 {
35564 }
35569 {
35572 }
35581 }
35583 /* OpenMP 4.0:
35584 # pragma omp target data target-data-clause[optseq] new-line
35585 structured-block */
35587 #define OMP_TARGET_DATA_CLAUSE_MASK \
35588 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35593 static tree
35595 {
35596 tree clauses
35601 {
35604 {
35621 "%<#pragma omp target data%> with map-type other "
35622 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35626 }
35628 }
35631 {
35634 "%<#pragma omp target data%> must contain at least "
35637 }
35648 }
35650 /* OpenMP 4.5:
35651 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35652 structured-block */
35654 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35655 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35661 static tree
35664 {
35667 {
35672 {
35675 }
35676 }
35678 {
35682 }
35685 {
35691 }
35693 tree clauses
35698 {
35701 {
35714 "%<#pragma omp target enter data%> with map-type other "
35718 }
35720 }
35723 {
35726 "%<#pragma omp target enter data%> must contain at least "
35729 }
35736 }
35738 /* OpenMP 4.5:
35739 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35740 structured-block */
35742 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35743 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35749 static tree
35752 {
35755 {
35760 {
35763 }
35764 }
35766 {
35770 }
35773 {
35779 }
35781 tree clauses
35786 {
35789 {
35803 "%<#pragma omp target exit data%> with map-type other "
35804 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35808 }
35810 }
35813 {
35816 "%<#pragma omp target exit data%> must contain at least "
35819 }
35826 }
35828 /* OpenMP 4.0:
35829 # pragma omp target update target-update-clause[optseq] new-line */
35831 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35832 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35839 static bool
35842 {
35844 {
35850 }
35852 tree clauses
35857 {
35859 "%<#pragma omp target update%> must contain at least one "
35862 }
35870 }
35872 /* OpenMP 4.0:
35873 # pragma omp target target-clause[optseq] new-line
35874 structured-block */
35876 #define OMP_TARGET_CLAUSE_MASK \
35877 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
35885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
35887 static bool
35890 {
35894 {
35906 {
35914 {
35915 tree stmt;
35917 {
35920 OMP_TARGET_CLAUSE_MASK,
35925 OMP_TARGET_CLAUSE_MASK,
35930 OMP_TARGET_CLAUSE_MASK,
35935 }
35937 }
35942 {
35946 if_p);
35951 if_p);
35956 if_p);
35960 }
35966 {
35967 /* For combined target teams, ensure the num_teams and
35968 thread_limit clause expressions are evaluated on the host,
35969 before entering the target construct. */
35970 tree c;
35976 {
35985 OMP_CLAUSE_FIRSTPRIVATE);
35990 }
35991 }
36001 }
36003 {
36006 }
36008 {
36012 }
36014 {
36018 }
36020 {
36024 }
36026 {
36029 }
36030 }
36032 {
36035 }
36050 check_clauses:
36052 {
36055 {
36069 "%<#pragma omp target%> with map-type other "
36070 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36074 }
36076 }
36078 }
36080 /* OpenACC 2.0:
36081 # pragma acc cache (variable-list) new-line
36082 */
36084 static tree
36086 {
36101 }
36103 /* OpenACC 2.0:
36104 # pragma acc data oacc-data-clause[optseq] new-line
36105 structured-block */
36107 #define OACC_DATA_CLAUSE_MASK \
36108 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36109 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36110 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36111 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36112 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36113 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36120 static tree
36122 {
36135 }
36137 /* OpenACC 2.0:
36138 # pragma acc host_data <clauses> new-line
36139 structured-block */
36141 #define OACC_HOST_DATA_CLAUSE_MASK \
36142 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36144 static tree
36146 {
36159 }
36161 /* OpenACC 2.0:
36162 # pragma acc declare oacc-data-clause[optseq] new-line
36163 */
36165 #define OACC_DECLARE_CLAUSE_MASK \
36166 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36168 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36174 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36175 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36176 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36177 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36179 static tree
36181 {
36190 {
36194 }
36197 {
36201 {
36205 }
36208 {
36220 {
36222 "%qD must be a global variable in "
36224 decl);
36227 }
36232 {
36236 }
36238 {
36240 "invalid use of %<extern%> variable %qD "
36244 }
36246 {
36248 "invalid use of %<global%> variable %qD "
36252 }
36254 }
36259 {
36264 }
36267 {
36268 tree id;
36272 else
36278 {
36281 {
36284 {
36288 }
36289 }
36290 }
36291 }
36292 }
36305 }
36307 /* OpenACC 2.0:
36308 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36310 or
36312 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36314 LOC is the location of the #pragma token.
36315 */
36317 #define OACC_ENTER_DATA_CLAUSE_MASK \
36318 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36319 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36320 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36324 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36326 #define OACC_EXIT_DATA_CLAUSE_MASK \
36327 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36328 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36329 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36333 static tree
36336 {
36345 {
36350 }
36357 else
36362 {
36366 }
36374 }
36376 /* OpenACC 2.0:
36377 # pragma acc loop oacc-loop-clause[optseq] new-line
36378 structured-block */
36380 #define OACC_LOOP_CLAUSE_MASK \
36381 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36392 static tree
36395 {
36404 {
36410 }
36419 }
36421 /* OpenACC 2.0:
36422 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36423 structured-block
36425 or
36427 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36428 structured-block
36429 */
36431 #define OACC_KERNELS_CLAUSE_MASK \
36432 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36433 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36434 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36435 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36447 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36450 #define OACC_PARALLEL_CLAUSE_MASK \
36451 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36472 static tree
36475 {
36476 omp_clause_mask mask;
36479 {
36492 }
36495 {
36499 {
36502 tree clauses;
36504 if_p);
36506 }
36507 }
36516 }
36518 /* OpenACC 2.0:
36519 # pragma acc update oacc-update-clause[optseq] new-line
36520 */
36522 #define OACC_UPDATE_CLAUSE_MASK \
36523 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36530 static tree
36532 {
36539 {
36541 "%<#pragma acc update%> must contain at least one "
36544 }
36552 }
36554 /* OpenACC 2.0:
36555 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36557 LOC is the location of the #pragma token.
36558 */
36560 #define OACC_WAIT_CLAUSE_MASK \
36561 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36563 static tree
36565 {
36579 }
36581 /* OpenMP 4.0:
36582 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36584 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36585 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36592 static void
36595 {
36597 cp_omp_declare_simd_data data;
36599 {
36604 /* It is safe to take the address of a local variable; it will only be
36605 used while this scope is live. */
36607 }
36609 /* Store away all pragma tokens. */
36621 {
36625 {
36638 }
36643 "%<#pragma omp declare simd%> not immediately followed by "
36647 }
36648 }
36650 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36651 This function is modelled similar to the late parsing of omp declare
36652 simd. */
36654 static tree
36656 {
36663 {
36665 "used in the same function marked as a Cilk Plus SIMD-enabled "
36671 }
36673 {
36677 }
36682 {
36689 NULL);
36703 }
36709 }
36711 /* Finalize #pragma omp declare simd clauses after direct declarator has
36712 been parsed, and put that into "omp declare simd" attribute. */
36714 static tree
36716 {
36722 {
36726 }
36731 {
36749 }
36753 }
36756 /* OpenMP 4.0:
36757 # pragma omp declare target new-line
36758 declarations and definitions
36759 # pragma omp end declare target new-line
36761 OpenMP 4.5:
36762 # pragma omp declare target ( extended-list ) new-line
36764 # pragma omp declare target declare-target-clauses[seq] new-line */
36766 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36767 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36768 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36770 static void
36772 {
36775 clauses
36779 {
36781 clauses);
36784 }
36785 else
36786 {
36790 }
36793 "%<#pragma omp declare target%> with clauses in between "
36794 "%<#pragma omp declare target%> without clauses and "
36797 {
36803 {
36806 }
36807 else
36810 {
36812 "%qD specified both in declare target %<link%> and %<to%>"
36815 }
36817 {
36824 {
36827 {
36831 }
36832 }
36833 }
36834 }
36835 }
36837 static void
36839 {
36842 {
36845 }
36847 {
36851 {
36854 }
36857 else
36858 {
36862 }
36863 }
36864 else
36865 {
36869 }
36873 "%<#pragma omp end declare target%> without corresponding "
36875 else
36877 }
36879 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
36880 expression and optional initializer clause of
36881 #pragma omp declare reduction. We store the expression(s) as
36882 either 3, 6 or 7 special statements inside of the artificial function's
36883 body. The first two statements are DECL_EXPRs for the artificial
36884 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
36885 expression that uses those variables.
36886 If there was any INITIALIZER clause, this is followed by further statements,
36887 the fourth and fifth statements are DECL_EXPRs for the artificial
36888 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
36889 constructor variant (first token after open paren is not omp_priv),
36890 then the sixth statement is a statement with the function call expression
36891 that uses the OMP_PRIV and optionally OMP_ORIG variable.
36892 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
36893 to initialize the OMP_PRIV artificial variable and there is seventh
36894 statement, a DECL_EXPR of the OMP_PRIV statement again. */
36896 static bool
36898 {
36910 tree combiner;
36925 {
36928 }
36931 {
36938 {
36941 }
36957 {
36961 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
36965 == CPP_CLOSE_PAREN
36968 {
36972 }
36977 }
36978 else
36979 {
36995 {
37000 }
37002 tree arg;
37015 }
37026 }
37032 }
37034 /* OpenMP 4.0
37035 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37036 initializer-clause[opt] new-line
37038 initializer-clause:
37039 initializer (omp_priv initializer)
37040 initializer (function-name (argument-list)) */
37042 static void
37045 {
37055 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37062 {
37094 }
37106 /* Types may not be defined in declare reduction type list. */
37109 parser->type_definition_forbidden_message
37115 saved_colon_doesnt_start_class_def_p
37120 {
37124 ;
37145 else
37150 else
37152 }
37154 /* Restore the saved message. */
37157 parser->colon_doesnt_start_class_def_p
37162 {
37163 fail:
37166 }
37172 {
37173 tree fntype
37176 NULL_TREE);
37196 {
37201 }
37203 {
37205 {
37214 }
37221 }
37222 else
37223 {
37226 }
37229 else
37232 {
37235 }
37237 {
37240 else
37245 }
37250 else
37251 {
37260 }
37267 }
37271 done:
37272 /* Free any declarators allocated. */
37274 }
37276 /* OpenMP 4.0
37277 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37278 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37279 initializer-clause[opt] new-line
37280 #pragma omp declare target new-line */
37282 static void
37285 {
37287 {
37292 {
37295 context);
37297 }
37300 {
37303 context);
37305 }
37307 {
37310 }
37312 {
37316 }
37317 }
37321 }
37323 /* OpenMP 4.5:
37324 #pragma omp taskloop taskloop-clause[optseq] new-line
37325 for-loop
37327 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37328 for-loop */
37330 #define OMP_TASKLOOP_CLAUSE_MASK \
37331 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37335 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37336 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37337 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37338 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37346 static tree
37350 {
37359 {
37364 {
37388 }
37389 }
37391 {
37394 }
37399 {
37402 }
37408 if_p);
37414 }
37417 /* OpenACC 2.0:
37418 # pragma acc routine oacc-routine-clause[optseq] new-line
37419 function-definition
37421 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37422 */
37424 #define OACC_ROUTINE_CLAUSE_MASK \
37425 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37431 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37432 component, which must resolve to a declared namespace-scope
37433 function. The clauses are either processed directly (for a named
37434 function), or defered until the immediatley following declaration
37435 is parsed. */
37437 static void
37440 {
37442 /* The checking for "another pragma following this one" in the "no optional
37443 '( name )'" case makes sure that we dont re-enter. */
37446 cp_oacc_routine_data data;
37452 /* It is safe to take the address of a local variable; it will only be
37453 used while this scope is live. */
37456 /* Look for optional '( name )'. */
37458 {
37461 /* We parse the name as an id-expression. If it resolves to
37462 anything other than a non-overloaded function at namespace
37463 scope, it's an error. */
37477 {
37481 }
37483 data.clauses
37491 {
37496 }
37498 /* Perhaps we should use the same rule as declarations in different
37499 namespaces? */
37501 {
37506 }
37509 {
37513 }
37517 }
37519 {
37520 /* Store away all pragma tokens. */
37531 /* Emit a helpful diagnostic if there's another pragma following this
37532 one. */
37534 {
37537 /* ..., and then just keep going. */
37539 }
37541 /* We only have to consider the pragma_external case here. */
37546 else
37549 }
37550 }
37552 /* Finalize #pragma acc routine clauses after direct declarator has
37553 been parsed. */
37555 static tree
37557 {
37562 {
37564 "%<#pragma acc routine%> not immediately followed by "
37567 }
37584 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37585 fndecl_seen. */
37588 }
37590 /* Apply any saved OpenACC routine clauses to a just-parsed
37591 declaration. */
37593 static void
37595 {
37597 {
37598 /* Keep going if we're in error reporting mode. */
37604 {
37606 "%<#pragma acc routine%> not immediately followed by"
37610 }
37612 {
37615 }
37618 {
37623 }
37626 {
37634 }
37636 /* Process the routine's dimension clauses. */
37640 /* Add an "omp declare target" attribute. */
37645 /* Don't unset parser->oacc_routine here: we may still need it to
37646 diagnose wrong usage. But, remember that we've used this "#pragma acc
37647 routine". */
37649 }
37650 }
37652 /* Main entry point to OpenMP statement pragmas. */
37654 static void
37656 {
37657 tree stmt;
37662 {
37685 if_p);
37690 if_p);
37707 if_p);
37712 if_p);
37720 if_p);
37729 if_p);
37743 if_p);
37748 if_p);
37752 }
37755 }
37756 \f
37757 /* Transactional Memory parsing routines. */
37759 /* Parse a transaction attribute.
37761 txn-attribute:
37762 attribute
37763 [ [ identifier ] ]
37765 We use this instead of cp_parser_attributes_opt for transactions to avoid
37766 the pedwarn in C++98 mode. */
37768 static tree
37770 {
37785 {
37789 /* For keywords, use the canonical spelling,
37790 not the parsed identifier. */
37794 }
37795 else
37799 error1:
37802 }
37804 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37806 transaction-statement:
37807 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37808 compound-statement
37809 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37810 */
37812 static tree
37814 {
37825 else
37826 {
37830 }
37832 /* Parse a noexcept specification. */
37836 {
37837 /* cancel-and-throw is unimplemented. */
37840 }
37841 else
37844 /* Keep track if we're in the lexical scope of an outer transaction. */
37856 }
37858 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37860 transaction-expression:
37861 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37862 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37863 */
37865 static tree
37867 {
37880 keyword == RID_TRANSACTION_RELAXED
37894 /* Set this early. This might mean that we allow transaction_cancel in
37895 an expression that we find out later actually has to be a constexpr.
37896 However, we expect that cxx_constant_value will be able to deal with
37897 this; also, if the noexcept has no constexpr, then what we parse next
37898 really is a transaction's body. */
37901 /* Parse a noexcept specification. */
37907 {
37914 }
37915 else
37916 {
37917 /* The only expression that is available got parsed for the noexcept
37918 already. noexcept is true then. */
37921 }
37930 }
37932 /* Parse a function-transaction-block.
37934 function-transaction-block:
37935 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37936 function-body
37937 __transaction_atomic txn-attribute[opt] function-try-block
37938 __transaction_relaxed ctor-initializer[opt] function-body
37939 __transaction_relaxed function-try-block
37940 */
37942 static bool
37944 {
37960 else
37961 {
37965 }
37973 else
37974 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37982 }
37984 /* Parse a __transaction_cancel statement.
37986 cancel-statement:
37987 __transaction_cancel txn-attribute[opt] ;
37988 __transaction_cancel txn-attribute[opt] throw-expression ;
37990 ??? Cancel and throw is not yet implemented. */
37992 static tree
37994 {
38000 RT_TRANSACTION_CANCEL);
38007 /* ??? Parse cancel-and-throw here. */
38012 {
38016 }
38018 {
38022 }
38024 {
38027 {
38033 }
38034 }
38036 {
38040 }
38046 }
38047 \f
38048 /* The parser. */
38052 \f
38053 /* Special handling for the first token or line in the file. The first
38054 thing in the file might be #pragma GCC pch_preprocess, which loads a
38055 PCH file, which is a GC collection point. So we need to handle this
38056 first pragma without benefit of an existing lexer structure.
38058 Always returns one token to the caller in *FIRST_TOKEN. This is
38059 either the true first token of the file, or the first token after
38060 the initial pragma. */
38062 static void
38064 {
38073 {
38080 }
38081 else
38084 /* Skip to the end of the pragma. */
38088 /* Now actually load the PCH file. */
38092 /* Read one more token to return to our caller. We have to do this
38093 after reading the PCH file in, since its pointers have to be
38094 live. */
38096 }
38098 /* Parses the grainsize pragma for the _Cilk_for statement.
38099 Syntax:
38100 #pragma cilk grainsize = <VALUE>. */
38102 static void
38104 {
38106 {
38111 {
38114 }
38116 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38119 else
38121 "%<#pragma cilk grainsize%> is not followed by "
38124 }
38126 }
38128 /* Normal parsing of a pragma token. Here we can (and must) use the
38129 regular lexer. */
38131 static bool
38133 {
38136 tree stmt;
38147 {
38155 {
38165 }
38170 {
38180 }
38185 {
38196 }
38201 {
38212 }
38217 {
38228 }
38249 {
38254 }
38262 {
38267 }
38275 {
38279 }
38285 {
38290 }
38298 {
38303 }
38358 "%<#pragma omp section%> may only be used in "
38363 {
38365 {
38369 }
38376 {
38379 }
38382 }
38386 {
38390 }
38398 {
38402 }
38404 /* Ignore the pragma if Cilk Plus is not enabled. */
38406 {
38409 }
38410 else
38411 {
38415 }
38422 bad_stmt:
38425 }
38429 }
38431 /* The interface the pragma parsers have to the lexer. */
38433 enum cpp_ttype
38435 {
38447 else
38448 {
38452 }
38455 }
38457 \f
38458 /* External interface. */
38460 /* Parse one entire translation unit. */
38462 void
38464 {
38477 }
38479 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38480 vectorlength clause:
38481 Syntax:
38482 vectorlength ( constant-expression ) */
38484 static tree
38487 {
38489 tree expr;
38490 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38491 safelen clause. Thus, vectorlength is represented as OMP 4.0
38492 safelen. For SIMD-enabled function it is represented by OMP 4.0
38493 simdlen. */
38496 loc);
38497 else
38499 loc);
38507 /* If expr == error_mark_node, then don't emit any errors nor
38508 create a clause. if any of the above functions returns
38509 error mark node then they would have emitted an error message. */
38511 ;
38519 else
38520 {
38521 tree c;
38523 {
38528 }
38529 else
38530 {
38535 }
38536 }
38541 }
38543 /* Handles the Cilk Plus #pragma simd linear clause.
38544 Syntax:
38545 linear ( simd-linear-variable-list )
38547 simd-linear-variable-list:
38548 simd-linear-variable
38549 simd-linear-variable-list , simd-linear-variable
38551 simd-linear-variable:
38552 id-expression
38553 id-expression : simd-linear-step
38555 simd-linear-step:
38556 conditional-expression */
38558 static tree
38560 {
38566 {
38570 }
38575 {
38578 {
38582 }
38589 {
38593 }
38594 else
38595 {
38599 /* If present, parse the linear step. Otherwise, assume the default
38600 value of 1. */
38602 {
38609 {
38610 /* If an error has occurred, then the whole pragma is
38611 considered ill-formed. Thus, no reason to keep
38612 parsing. */
38615 }
38623 else
38625 "step size must be an integer constant "
38627 }
38629 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38635 }
38640 else
38641 {
38646 }
38647 }
38651 }
38653 /* Returns the name of the next clause. If the clause is not
38654 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38655 token is not consumed. Otherwise, the appropriate enum from the
38656 pragma_simd_clause is returned and the token is consumed. */
38658 static pragma_omp_clause
38660 {
38661 pragma_omp_clause clause_type;
38678 else
38683 }
38685 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38687 static tree
38689 {
38694 {
38695 pragma_omp_clause c_kind;
38702 /* Use the OpenMP 4.0 equivalent function. */
38705 /* Use the OpenMP 4.0 equivalent function. */
38707 clauses);
38709 /* Use the OMP 4.0 equivalent function. */
38711 clauses);
38713 /* Use the OMP 4.0 equivalent function. */
38715 else
38716 {
38720 }
38721 }
38727 else
38729 }
38731 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38733 static void
38735 {
38742 {
38746 }
38755 }
38757 /* Main entry-point for parsing Cilk Plus _Cilk_for
38758 loops. The return value is error_mark_node
38759 when errors happen and CILK_FOR tree on success. */
38761 static tree
38763 {
38778 else
38784 }
38786 /* Create an identifier for a generic parameter type (a synthesized
38787 template parameter implied by `auto' or a concept identifier). */
38790 static tree
38792 {
38796 }
38798 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38799 (creating a new template parameter list if necessary). Returns the newly
38800 created template type parm. */
38802 static tree
38804 {
38807 /* Before committing to modifying any scope, if we're in an
38808 implicit template scope, and we're trying to synthesize a
38809 constrained parameter, try to find a previous parameter with
38810 the same name. This is the same-type rule for abbreviated
38811 function templates.
38813 NOTE: We can generate implicit parameters when tentatively
38814 parsing a nested name specifier, only to reject that parse
38815 later. However, matching the same template-id as part of a
38816 direct-declarator should generate an identical template
38817 parameter, so this rule will merge them. */
38819 {
38822 {
38824 {
38827 /* Return the TEMPLATE_PARM_INDEX. */
38830 }
38832 }
38833 }
38835 /* We are either continuing a function template that already contains implicit
38836 template parameters, creating a new fully-implicit function template, or
38837 extending an existing explicit function template with implicit template
38838 parameters. */
38846 {
38850 }
38851 else
38852 {
38853 /* Roll back to the existing template parameter scope (in the case of
38854 extending an explicit function template) or introduce a new template
38855 parameter scope ahead of the function parameter scope (or class scope
38856 in the case of out-of-line member definitions). The function scope is
38857 added back after template parameter synthesis below. */
38862 {
38865 }
38867 {
38868 /* If not defining a class, then any class scope is a scope level in
38869 an out-of-line member definition. In this case simply wind back
38870 beyond the first such scope to inject the template parameter list.
38871 Otherwise wind back to the class being defined. The latter can
38872 occur in class member friend declarations such as:
38874 class A {
38875 void foo (auto);
38876 };
38877 class B {
38878 friend void A::foo (auto);
38879 };
38881 The template parameter list synthesized for the friend declaration
38882 must be injected in the scope of 'B'. This can also occur in
38883 erroneous cases such as:
38885 struct A {
38886 struct B {
38887 void foo (auto);
38888 };
38889 void B::foo (auto) {}
38890 };
38892 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38893 but, nevertheless, the template parameter list synthesized for the
38894 declarator should be injected into the scope of 'A' as if the
38895 ill-formed template was specified explicitly. */
38898 {
38901 }
38902 }
38908 {
38909 /* Introduce a new template parameter list for implicit template
38910 parameters. */
38914 parser->implicit_template_scope
38921 }
38922 else
38923 {
38924 /* Synthesize implicit template parameters at the end of the explicit
38925 template parameter list. */
38932 parser->implicit_template_parms
38934 }
38935 }
38937 /* Synthesize a new template parameter and track the current template
38938 parameter chain with implicit_template_parms. */
38942 tree synth_tmpl_parm;
38946 synth_tmpl_parm
38949 synth_tmpl_parm
38951 else
38952 {
38956 }
38958 // Attach the constraint to the parm before processing.
38961 tree new_parm
38963 input_location,
38964 node,
38968 // Chain the new parameter to the list of implicit parameters.
38970 parser->implicit_template_parms
38972 else
38977 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38980 /* If creating a fully implicit function template, start the new implicit
38981 template parameter list with this synthesized type, otherwise grow the
38982 current template parameter list. */
38985 {
38992 }
38993 else
38994 {
38999 }
39001 // If the new parameter was constrained, we need to add that to the
39002 // constraints in the template parameter list.
39004 {
39008 }
39013 }
39015 /* Finish the declaration of a fully implicit function template. Such a
39016 template has no explicit template parameter list so has not been through the
39017 normal template head and tail processing. synthesize_implicit_template_parm
39018 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39019 provided if the declaration is a class member such that its template
39020 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39021 form is returned. Otherwise NULL_TREE is returned. */
39023 static tree
39025 {
39030 {
39034 }
39044 }