| blob | 50528e24335fde2c7fe7cc715bdbc37fab5a3e8c |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2017 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
47 \f
48 /* The lexer. */
50 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
51 and c-lex.c) and the C++ parser. */
54 {
56 };
58 /* The various kinds of non integral constant we encounter. */
60 NIC_NONE,
61 /* floating-point literal */
62 NIC_FLOAT,
63 /* %<this%> */
64 NIC_THIS,
65 /* %<__FUNCTION__%> */
66 NIC_FUNC_NAME,
67 /* %<__PRETTY_FUNCTION__%> */
68 NIC_PRETTY_FUNC,
69 /* %<__func__%> */
70 NIC_C99_FUNC,
71 /* "%<va_arg%> */
72 NIC_VA_ARG,
73 /* a cast */
74 NIC_CAST,
75 /* %<typeid%> operator */
76 NIC_TYPEID,
77 /* non-constant compound literals */
78 NIC_NCC,
79 /* a function call */
80 NIC_FUNC_CALL,
81 /* an increment */
82 NIC_INC,
83 /* an decrement */
84 NIC_DEC,
85 /* an array reference */
86 NIC_ARRAY_REF,
87 /* %<->%> */
88 NIC_ARROW,
89 /* %<.%> */
90 NIC_POINT,
91 /* the address of a label */
92 NIC_ADDR_LABEL,
93 /* %<*%> */
94 NIC_STAR,
95 /* %<&%> */
96 NIC_ADDR,
97 /* %<++%> */
98 NIC_PREINCREMENT,
99 /* %<--%> */
100 NIC_PREDECREMENT,
101 /* %<new%> */
102 NIC_NEW,
103 /* %<delete%> */
104 NIC_DEL,
105 /* calls to overloaded operators */
106 NIC_OVERLOADED,
107 /* an assignment */
108 NIC_ASSIGNMENT,
109 /* a comma operator */
110 NIC_COMMA,
111 /* a call to a constructor */
112 NIC_CONSTRUCTOR,
113 /* a transaction expression */
114 NIC_TRANSACTION
115 };
117 /* The various kinds of errors about name-lookup failing. */
119 /* NULL */
120 NLE_NULL,
121 /* is not a type */
122 NLE_TYPE,
123 /* is not a class or namespace */
124 NLE_CXX98,
125 /* is not a class, namespace, or enumeration */
126 NLE_NOT_CXX98
127 };
129 /* The various kinds of required token */
131 RT_NONE,
153 /* The type is CPP_KEYWORD */
182 RT_TRANSACTION_CANCEL /* __transaction_cancel */
183 };
185 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
186 reverting it on destruction. */
188 class type_id_in_expr_sentinel
189 {
199 };
201 /* Prototypes. */
207 static void cp_lexer_destroy
209 static int cp_lexer_saving_tokens
213 static void cp_lexer_get_preprocessor_token
221 static bool cp_lexer_next_token_is_not
223 static bool cp_lexer_next_token_is_keyword
227 static void cp_lexer_purge_token
229 static void cp_lexer_purge_tokens_after
231 static void cp_lexer_save_tokens
233 static void cp_lexer_commit_tokens
235 static void cp_lexer_rollback_tokens
237 static void cp_lexer_print_token
241 static void cp_lexer_start_debugging
243 static void cp_lexer_stop_debugging
249 static void cp_parser_initial_pragma
252 static void cp_parser_cilk_simd
254 static tree cp_parser_cilk_for
256 static bool cp_parser_omp_declare_reduction_exprs
258 static tree cp_parser_cilk_simd_vectorlength
260 static void cp_finalize_oacc_routine
263 /* Manifest constants. */
264 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
265 #define CP_SAVED_TOKEN_STACK 5
267 /* Variables. */
269 /* The stream to which debugging output should be written. */
272 /* Nonzero if we are parsing an unevaluated operand: an operand to
273 sizeof, typeof, or alignof. */
276 /* Dump up to NUM tokens in BUFFER to FILE starting with token
277 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
278 first token in BUFFER. If NUM is 0, dump all the tokens. If
279 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
280 highlighted by surrounding it in [[ ]]. */
282 static void
286 {
303 {
306 }
311 {
318 nprinted++;
328 {
338 }
339 }
342 {
345 }
348 }
351 /* Dump all tokens in BUFFER to stderr. */
353 void
355 {
357 }
359 DEBUG_FUNCTION void
361 {
363 }
365 DEBUG_FUNCTION void
367 {
370 else
372 }
375 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
376 description for T. */
378 static void
380 {
382 {
385 }
386 }
389 /* Dump parser context C to FILE. */
391 static void
393 {
398 }
401 /* Print the stack of parsing contexts to FILE starting with FIRST. */
403 static void
405 {
411 {
414 }
415 }
418 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
420 static void
422 {
425 }
428 /* Print an unparsed function entry UF to FILE. */
430 static void
432 {
435 tree fn;
440 i++)
441 {
447 }
452 {
455 }
461 {
464 }
466 }
469 /* Print the stack of unparsed member functions S to FILE. */
471 static void
474 {
480 {
483 }
484 }
487 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
488 the given PARSER. If FILE is NULL, the output is printed on stderr. */
490 static void
492 {
504 next_token);
505 }
508 /* Dump debugging information for the given PARSER. If FILE is NULL,
509 the output is printed on stderr. */
511 void
513 {
516 expanded_location eloc;
594 }
596 DEBUG_FUNCTION void
598 {
600 }
602 DEBUG_FUNCTION void
604 {
607 else
609 }
611 /* Allocate memory for a new lexer object and return it. */
615 {
620 /* Allocate the memory. */
623 /* Initially we are not debugging. */
628 /* Create the buffer. */
632 }
635 /* Create a new main C++ lexer, the lexer that gets tokens from the
636 preprocessor. */
640 {
642 cp_token token;
644 /* It's possible that parsing the first pragma will load a PCH file,
645 which is a GC collection point. So we have to do that before
646 allocating any memory. */
651 /* Put the first token in the buffer. */
654 /* Get the remaining tokens from the preprocessor. */
656 {
659 }
668 /* Subsequent preprocessor diagnostics should use compiler
669 diagnostic functions to get the compiler source location. */
674 }
676 /* Create a new lexer whose token stream is primed with the tokens in
677 CACHE. When these tokens are exhausted, no new tokens will be read. */
681 {
686 /* We do not own the buffer. */
693 /* Initially we are not debugging. */
698 }
700 /* Frees all resources associated with LEXER. */
702 static void
704 {
708 }
710 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
711 be used. The point of this flag is to help the compiler to fold away calls
712 to cp_lexer_debugging_p within this source file at compile time, when the
713 lexer is not being debugged. */
715 #define LEXER_DEBUGGING_ENABLED_P false
717 /* Returns nonzero if debugging information should be output. */
721 {
726 }
731 {
735 }
739 {
741 }
745 {
747 }
751 {
754 else
756 }
760 {
763 /* Skip past purged tokens. */
765 {
767 tp--;
768 }
771 }
773 /* nonzero if we are presently saving tokens. */
777 {
779 }
781 /* Store the next token from the preprocessor in *TOKEN. Return true
782 if we reach EOF. If LEXER is NULL, assume we are handling an
783 initial #pragma pch_preprocess, and thus want the lexer to return
784 processed strings. */
786 static void
788 {
791 /* Get a new token from the preprocessor. */
792 token->type
799 /* On some systems, some header files are surrounded by an
800 implicit extern "C" block. Set a flag in the token if it
801 comes from such a header. */
806 /* Check to see if this token is a keyword. */
808 {
810 {
811 /* Mark this token as a keyword. */
813 /* Record which keyword. */
815 }
816 else
817 {
821 {
822 /* Warn about the C++0x keyword (but still treat it as
823 an identifier). */
828 /* Clear out the C_RID_CODE so we don't warn about this
829 particular identifier-turned-keyword again. */
831 }
834 }
835 }
837 {
838 /* This only happens in Objective-C++; it must be a keyword. */
841 {
842 /* Replace 'class' with '@class', 'private' with '@private',
843 etc. This prevents confusion with the C++ keyword
844 'class', and makes the tokens consistent with other
845 Objective-C 'AT' keywords. For example '@class' is
846 reported as RID_AT_CLASS which is consistent with
847 '@synchronized', which is reported as
848 RID_AT_SYNCHRONIZED.
849 */
859 }
860 }
861 }
863 /* Update the globals input_location and the input file stack from TOKEN. */
866 {
868 {
870 }
871 }
873 /* Update the globals input_location and the input file stack from LEXER. */
876 {
879 }
881 /* Return a pointer to the next token in the token stream, but do not
882 consume it. */
886 {
888 {
892 }
894 }
896 /* Return true if the next token has the indicated TYPE. */
900 {
902 }
904 /* Return true if the next token does not have the indicated TYPE. */
908 {
910 }
912 /* Return true if the next token is the indicated KEYWORD. */
916 {
918 }
922 {
924 }
928 {
930 }
932 /* Return true if the next token is not the indicated KEYWORD. */
936 {
938 }
940 /* Return true if KEYWORD can start a decl-specifier. */
942 bool
944 {
946 {
947 /* auto specifier: storage-class-specifier in C++,
948 simple-type-specifier in C++0x. */
950 /* Storage classes. */
956 /* Elaborated type specifiers. */
962 /* Simple type specifiers. */
976 /* GNU extensions. */
979 /* C++0x extensions. */
991 }
992 }
994 /* Return true if the next token is a keyword for a decl-specifier. */
996 static bool
998 {
1003 }
1005 /* Returns TRUE iff the token T begins a decltype type. */
1007 static bool
1009 {
1012 }
1014 /* Returns TRUE iff the next token begins a decltype type. */
1016 static bool
1018 {
1021 }
1023 /* Called when processing a token with tree_check_value; perform or defer the
1024 associated checks and return the value. */
1026 static tree
1028 {
1029 /* Perform any access checks that were deferred. */
1034 {
1040 }
1041 /* Return the stored value. */
1043 }
1045 /* Return a pointer to the Nth token in the token stream. If N is 1,
1046 then this is precisely equivalent to cp_lexer_peek_token (except
1047 that it is not inline). One would like to disallow that case, but
1048 there is one case (cp_parser_nth_token_starts_template_id) where
1049 the caller passes a variable for N and it might be 1. */
1053 {
1056 /* N is 1-based, not zero-based. */
1067 {
1070 {
1073 }
1077 }
1080 {
1083 }
1086 }
1088 /* Return the next token, and advance the lexer's next_token pointer
1089 to point to the next non-purged token. */
1093 {
1099 do
1100 {
1103 {
1106 }
1108 }
1113 /* Provide debugging output. */
1115 {
1119 }
1122 }
1124 /* Permanently remove the next token from the token stream, and
1125 advance the next_token pointer to refer to the next non-purged
1126 token. */
1128 static void
1130 {
1139 do
1140 {
1141 tok++;
1143 {
1146 }
1147 }
1150 }
1152 /* Permanently remove all tokens after TOK, up to, but not
1153 including, the token that will be returned next by
1154 cp_lexer_peek_token. */
1156 static void
1158 {
1167 {
1172 }
1173 }
1175 /* Begin saving tokens. All tokens consumed after this point will be
1176 preserved. */
1178 static void
1180 {
1181 /* Provide debugging output. */
1186 }
1188 /* Commit to the portion of the token stream most recently saved. */
1190 static void
1192 {
1193 /* Provide debugging output. */
1198 }
1200 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1201 to the token stream. Stop saving tokens. */
1203 static void
1205 {
1206 /* Provide debugging output. */
1211 }
1213 /* RAII wrapper around the above functions, with sanity checking. Creating
1214 a variable saves tokens, which are committed when the variable is
1215 destroyed unless they are explicitly rolled back by calling the rollback
1216 member function. */
1218 struct saved_token_sentinel
1219 {
1224 {
1227 }
1229 {
1232 }
1234 {
1238 }
1239 };
1241 /* Print a representation of the TOKEN on the STREAM. */
1243 static void
1245 {
1246 /* We don't use cpp_type2name here because the parser defines
1247 a few tokens of its own. */
1249 /* cpplib-defined token types */
1250 #define OP(e, s) #e,
1251 #define TK(e, s) #e,
1252 TTYPE_TABLE
1253 #undef OP
1254 #undef TK
1255 /* C++ parser token types - see "Manifest constants", above. */
1259 };
1261 /* For some tokens, print the associated data. */
1263 {
1265 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1266 For example, `struct' is mapped to an INTEGER_CST. */
1269 /* fall through */
1287 /* If we have a name for the token, print it out. Otherwise, we
1288 simply give the numeric code. */
1291 else
1294 }
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 }
1304 DEBUG_FUNCTION void
1306 {
1309 else
1311 }
1314 /* Start emitting debugging information. */
1316 static void
1318 {
1325 }
1327 /* Stop emitting debugging information. */
1329 static void
1331 {
1338 }
1340 /* Create a new cp_token_cache, representing a range of tokens. */
1344 {
1349 }
1351 /* Diagnose if #pragma omp declare simd isn't followed immediately
1352 by function declaration or definition. */
1356 {
1358 {
1362 }
1363 }
1365 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1366 and put that into "omp declare simd" attribute. */
1370 {
1372 {
1374 {
1377 }
1379 {
1382 }
1383 }
1384 }
1386 /* Diagnose if #pragma acc routine isn't followed immediately by function
1387 declaration or definition. */
1391 {
1393 {
1395 "%<#pragma acc routine%> not immediately followed by "
1398 }
1399 }
1400 \f
1401 /* Decl-specifiers. */
1403 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1405 static void
1407 {
1409 }
1411 /* Declarators. */
1413 /* Nothing other than the parser should be creating declarators;
1414 declarators are a semi-syntactic representation of C++ entities.
1415 Other parts of the front end that need to create entities (like
1416 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1419 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1429 /* An erroneous declarator. */
1432 /* The obstack on which declarators and related data structures are
1433 allocated. */
1436 /* Alloc BYTES from the declarator memory pool. */
1440 {
1442 }
1444 /* Allocate a declarator of the indicated KIND. Clear fields that are
1445 common to all declarators. */
1449 {
1461 }
1463 /* Make a declarator for a generalized identifier. If
1464 QUALIFYING_SCOPE is non-NULL, the identifier is
1465 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1466 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1467 is, if any. */
1471 special_function_kind sfk)
1472 {
1475 /* It is valid to write:
1477 class C { void f(); };
1478 typedef C D;
1479 void D::f();
1481 The standard is not clear about whether `typedef const C D' is
1482 legal; as of 2002-09-15 the committee is considering that
1483 question. EDG 3.0 allows that syntax. Therefore, we do as
1484 well. */
1498 }
1500 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1501 of modifiers such as const or volatile to apply to the pointer
1502 type, represented as identifiers. ATTRIBUTES represent the attributes that
1503 appertain to the pointer or reference. */
1505 cp_declarator *
1507 tree attributes)
1508 {
1516 {
1520 }
1521 else
1527 }
1529 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1530 represent the attributes that appertain to the pointer or
1531 reference. */
1533 cp_declarator *
1536 {
1544 {
1548 }
1549 else
1555 }
1557 /* Like make_pointer_declarator -- but for a pointer to a non-static
1558 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1559 appertain to the pointer or reference. */
1561 cp_declarator *
1564 tree attributes)
1565 {
1574 {
1577 }
1578 else
1584 }
1586 /* Make a declarator for the function given by TARGET, with the
1587 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1588 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1589 indicates what exceptions can be thrown. */
1591 cp_declarator *
1593 tree parms,
1594 cp_cv_quals cv_qualifiers,
1595 cp_virt_specifiers virt_specifiers,
1596 cp_ref_qualifier ref_qualifier,
1597 tree tx_qualifier,
1598 tree exception_specification,
1599 tree late_return_type,
1600 tree requires_clause)
1601 {
1615 {
1619 }
1620 else
1624 }
1626 /* Make a declarator for an array of BOUNDS elements, each of which is
1627 defined by ELEMENT. */
1629 cp_declarator *
1631 {
1638 {
1642 }
1643 else
1647 }
1649 /* Determine whether the declarator we've seen so far can be a
1650 parameter pack, when followed by an ellipsis. */
1651 static bool
1653 {
1655 /* We already saw an ellipsis. */
1658 /* Search for a declarator name, or any other declarator that goes
1659 after the point where the ellipsis could appear in a parameter
1660 pack. If we find any of these, then this declarator can not be
1661 made into a parameter pack. */
1664 {
1666 {
1679 }
1680 }
1683 }
1687 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1688 DECLARATOR and DEFAULT_ARGUMENT. */
1690 cp_parameter_declarator *
1693 tree default_argument,
1695 {
1703 else
1710 }
1712 /* Returns true iff DECLARATOR is a declaration for a function. */
1714 static bool
1716 {
1718 {
1727 }
1729 }
1731 /* The parser. */
1733 /* Overview
1734 --------
1736 A cp_parser parses the token stream as specified by the C++
1737 grammar. Its job is purely parsing, not semantic analysis. For
1738 example, the parser breaks the token stream into declarators,
1739 expressions, statements, and other similar syntactic constructs.
1740 It does not check that the types of the expressions on either side
1741 of an assignment-statement are compatible, or that a function is
1742 not declared with a parameter of type `void'.
1744 The parser invokes routines elsewhere in the compiler to perform
1745 semantic analysis and to build up the abstract syntax tree for the
1746 code processed.
1748 The parser (and the template instantiation code, which is, in a
1749 way, a close relative of parsing) are the only parts of the
1750 compiler that should be calling push_scope and pop_scope, or
1751 related functions. The parser (and template instantiation code)
1752 keeps track of what scope is presently active; everything else
1753 should simply honor that. (The code that generates static
1754 initializers may also need to set the scope, in order to check
1755 access control correctly when emitting the initializers.)
1757 Methodology
1758 -----------
1760 The parser is of the standard recursive-descent variety. Upcoming
1761 tokens in the token stream are examined in order to determine which
1762 production to use when parsing a non-terminal. Some C++ constructs
1763 require arbitrary look ahead to disambiguate. For example, it is
1764 impossible, in the general case, to tell whether a statement is an
1765 expression or declaration without scanning the entire statement.
1766 Therefore, the parser is capable of "parsing tentatively." When the
1767 parser is not sure what construct comes next, it enters this mode.
1768 Then, while we attempt to parse the construct, the parser queues up
1769 error messages, rather than issuing them immediately, and saves the
1770 tokens it consumes. If the construct is parsed successfully, the
1771 parser "commits", i.e., it issues any queued error messages and
1772 the tokens that were being preserved are permanently discarded.
1773 If, however, the construct is not parsed successfully, the parser
1774 rolls back its state completely so that it can resume parsing using
1775 a different alternative.
1777 Future Improvements
1778 -------------------
1780 The performance of the parser could probably be improved substantially.
1781 We could often eliminate the need to parse tentatively by looking ahead
1782 a little bit. In some places, this approach might not entirely eliminate
1783 the need to parse tentatively, but it might still speed up the average
1784 case. */
1786 /* Flags that are passed to some parsing functions. These values can
1787 be bitwise-ored together. */
1789 enum
1790 {
1791 /* No flags. */
1793 /* The construct is optional. If it is not present, then no error
1794 should be issued. */
1796 /* When parsing a type-specifier, treat user-defined type-names
1797 as non-type identifiers. */
1799 /* When parsing a type-specifier, do not try to parse a class-specifier
1800 or enum-specifier. */
1802 /* When parsing a decl-specifier-seq, only allow type-specifier or
1803 constexpr. */
1805 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1807 };
1809 /* This type is used for parameters and variables which hold
1810 combinations of the above flags. */
1813 /* The different kinds of declarators we want to parse. */
1815 enum cp_parser_declarator_kind
1816 {
1817 /* We want an abstract declarator. */
1818 CP_PARSER_DECLARATOR_ABSTRACT,
1819 /* We want a named declarator. */
1820 CP_PARSER_DECLARATOR_NAMED,
1821 /* We don't mind, but the name must be an unqualified-id. */
1822 CP_PARSER_DECLARATOR_EITHER
1823 };
1825 /* The precedence values used to parse binary expressions. The minimum value
1826 of PREC must be 1, because zero is reserved to quickly discriminate
1827 binary operators from other tokens. */
1829 enum cp_parser_prec
1830 {
1831 PREC_NOT_OPERATOR,
1832 PREC_LOGICAL_OR_EXPRESSION,
1833 PREC_LOGICAL_AND_EXPRESSION,
1834 PREC_INCLUSIVE_OR_EXPRESSION,
1835 PREC_EXCLUSIVE_OR_EXPRESSION,
1836 PREC_AND_EXPRESSION,
1837 PREC_EQUALITY_EXPRESSION,
1838 PREC_RELATIONAL_EXPRESSION,
1839 PREC_SHIFT_EXPRESSION,
1840 PREC_ADDITIVE_EXPRESSION,
1841 PREC_MULTIPLICATIVE_EXPRESSION,
1842 PREC_PM_EXPRESSION,
1843 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1844 };
1846 /* A mapping from a token type to a corresponding tree node type, with a
1847 precedence value. */
1849 struct cp_parser_binary_operations_map_node
1850 {
1851 /* The token type. */
1853 /* The corresponding tree code. */
1855 /* The precedence of this operator. */
1857 };
1859 struct cp_parser_expression_stack_entry
1860 {
1861 /* Left hand side of the binary operation we are currently
1862 parsing. */
1863 cp_expr lhs;
1864 /* Original tree code for left hand side, if it was a binary
1865 expression itself (used for -Wparentheses). */
1867 /* Tree code for the binary operation we are parsing. */
1869 /* Precedence of the binary operation we are parsing. */
1871 /* Location of the binary operation we are parsing. */
1872 location_t loc;
1873 };
1875 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1876 entries because precedence levels on the stack are monotonically
1877 increasing. */
1881 /* Prototypes. */
1883 /* Constructors and destructors. */
1888 /* Class variables. */
1892 /* The operator-precedence table used by cp_parser_binary_expression.
1893 Transformed into an associative array (binops_by_token) by
1894 cp_parser_new. */
1927 };
1929 /* The same as binops, but initialized by cp_parser_new so that
1930 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1931 for speed. */
1934 /* Constructors and destructors. */
1936 /* Construct a new context. The context below this one on the stack
1937 is given by NEXT. */
1941 {
1944 /* Allocate the storage. */
1946 {
1947 /* Pull the first entry from the free list. */
1951 }
1952 else
1955 /* No errors have occurred yet in this context. */
1957 /* If this is not the bottommost context, copy information that we
1958 need from the previous context. */
1960 {
1961 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1962 expression, then we are parsing one in this context, too. */
1964 /* Thread the stack. */
1966 }
1969 }
1971 /* Managing the unparsed function queues. */
1973 #define unparsed_funs_with_default_args \
1974 parser->unparsed_queues->last ().funs_with_default_args
1975 #define unparsed_funs_with_definitions \
1976 parser->unparsed_queues->last ().funs_with_definitions
1977 #define unparsed_nsdmis \
1978 parser->unparsed_queues->last ().nsdmis
1979 #define unparsed_classes \
1980 parser->unparsed_queues->last ().classes
1982 static void
1984 {
1987 }
1989 static void
1991 {
1994 }
1996 /* Prototypes. */
1998 /* Constructors and destructors. */
2003 /* Routines to parse various constructs.
2005 Those that return `tree' will return the error_mark_node (rather
2006 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2007 Sometimes, they will return an ordinary node if error-recovery was
2008 attempted, even though a parse error occurred. So, to check
2009 whether or not a parse error occurred, you should always use
2010 cp_parser_error_occurred. If the construct is optional (indicated
2011 either by an `_opt' in the name of the function that does the
2012 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2013 the construct is not present. */
2015 /* Lexical conventions [gram.lex] */
2017 static cp_expr cp_parser_identifier
2019 static cp_expr cp_parser_string_literal
2021 static cp_expr cp_parser_userdef_char_literal
2023 static tree cp_parser_userdef_string_literal
2025 static cp_expr cp_parser_userdef_numeric_literal
2028 /* Basic concepts [gram.basic] */
2030 static bool cp_parser_translation_unit
2033 /* Expressions [gram.expr] */
2035 static cp_expr cp_parser_primary_expression
2037 static cp_expr cp_parser_id_expression
2039 static cp_expr cp_parser_unqualified_id
2041 static tree cp_parser_nested_name_specifier_opt
2043 static tree cp_parser_nested_name_specifier
2045 static tree cp_parser_qualifying_entity
2047 static cp_expr cp_parser_postfix_expression
2049 static tree cp_parser_postfix_open_square_expression
2051 static tree cp_parser_postfix_dot_deref_expression
2055 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2057 static void cp_parser_pseudo_destructor_name
2059 static cp_expr cp_parser_unary_expression
2061 static enum tree_code cp_parser_unary_operator
2063 static tree cp_parser_new_expression
2067 static tree cp_parser_new_type_id
2075 static tree cp_parser_delete_expression
2077 static cp_expr cp_parser_cast_expression
2079 static cp_expr cp_parser_binary_expression
2081 static tree cp_parser_question_colon_clause
2083 static cp_expr cp_parser_assignment_expression
2085 static enum tree_code cp_parser_assignment_operator_opt
2087 static cp_expr cp_parser_expression
2089 static cp_expr cp_parser_constant_expression
2091 static cp_expr cp_parser_builtin_offsetof
2093 static cp_expr cp_parser_lambda_expression
2095 static void cp_parser_lambda_introducer
2097 static bool cp_parser_lambda_declarator_opt
2099 static void cp_parser_lambda_body
2102 /* Statements [gram.stmt.stmt] */
2104 static void cp_parser_statement
2106 static void cp_parser_label_for_labeled_statement
2108 static tree cp_parser_expression_statement
2110 static tree cp_parser_compound_statement
2112 static void cp_parser_statement_seq_opt
2114 static tree cp_parser_selection_statement
2116 static tree cp_parser_condition
2118 static tree cp_parser_iteration_statement
2120 static bool cp_parser_init_statement
2122 static tree cp_parser_for
2124 static tree cp_parser_c_for
2126 static tree cp_parser_range_for
2128 static void do_range_for_auto_deduction
2130 static tree cp_parser_perform_range_for_lookup
2132 static tree cp_parser_range_for_member_function
2134 static tree cp_parser_jump_statement
2136 static void cp_parser_declaration_statement
2139 static tree cp_parser_implicitly_scoped_statement
2141 static void cp_parser_already_scoped_statement
2144 /* Declarations [gram.dcl.dcl] */
2146 static void cp_parser_declaration_seq_opt
2148 static void cp_parser_declaration
2150 static void cp_parser_block_declaration
2152 static void cp_parser_simple_declaration
2154 static void cp_parser_decl_specifier_seq
2156 static tree cp_parser_storage_class_specifier_opt
2158 static tree cp_parser_function_specifier_opt
2160 static tree cp_parser_type_specifier
2163 static tree cp_parser_simple_type_specifier
2165 static tree cp_parser_type_name
2167 static tree cp_parser_type_name
2169 static tree cp_parser_nonclass_name
2171 static tree cp_parser_elaborated_type_specifier
2173 static tree cp_parser_enum_specifier
2175 static void cp_parser_enumerator_list
2177 static void cp_parser_enumerator_definition
2179 static tree cp_parser_namespace_name
2181 static void cp_parser_namespace_definition
2183 static void cp_parser_namespace_body
2185 static tree cp_parser_qualified_namespace_specifier
2187 static void cp_parser_namespace_alias_definition
2189 static bool cp_parser_using_declaration
2191 static void cp_parser_using_directive
2193 static tree cp_parser_alias_declaration
2195 static void cp_parser_asm_definition
2197 static void cp_parser_linkage_specification
2199 static void cp_parser_static_assert
2201 static tree cp_parser_decltype
2203 static tree cp_parser_decomposition_declaration
2206 /* Declarators [gram.dcl.decl] */
2208 static tree cp_parser_init_declarator
2215 static enum tree_code cp_parser_ptr_operator
2217 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2219 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2221 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2223 static tree cp_parser_tx_qualifier_opt
2225 static tree cp_parser_late_return_type_opt
2227 static tree cp_parser_declarator_id
2229 static tree cp_parser_type_id
2231 static tree cp_parser_template_type_arg
2234 static tree cp_parser_type_id_1
2236 static void cp_parser_type_specifier_seq
2238 static tree cp_parser_parameter_declaration_clause
2240 static tree cp_parser_parameter_declaration_list
2244 static tree cp_parser_default_argument
2246 static void cp_parser_function_body
2248 static tree cp_parser_initializer
2250 static cp_expr cp_parser_initializer_clause
2252 static cp_expr cp_parser_braced_list
2257 static bool cp_parser_ctor_initializer_opt_and_function_body
2260 static tree cp_parser_late_parsing_omp_declare_simd
2263 static tree cp_parser_late_parsing_cilk_simd_fn_info
2266 static tree cp_parser_late_parsing_oacc_routine
2269 static tree synthesize_implicit_template_parm
2271 static tree finish_fully_implicit_template
2274 /* Classes [gram.class] */
2276 static tree cp_parser_class_name
2278 static tree cp_parser_class_specifier
2280 static tree cp_parser_class_head
2282 static enum tag_types cp_parser_class_key
2284 static void cp_parser_type_parameter_key
2286 static void cp_parser_member_specification_opt
2288 static void cp_parser_member_declaration
2290 static tree cp_parser_pure_specifier
2292 static tree cp_parser_constant_initializer
2295 /* Derived classes [gram.class.derived] */
2297 static tree cp_parser_base_clause
2299 static tree cp_parser_base_specifier
2302 /* Special member functions [gram.special] */
2304 static tree cp_parser_conversion_function_id
2306 static tree cp_parser_conversion_type_id
2310 static bool cp_parser_ctor_initializer_opt
2312 static void cp_parser_mem_initializer_list
2314 static tree cp_parser_mem_initializer
2316 static tree cp_parser_mem_initializer_id
2319 /* Overloading [gram.over] */
2321 static cp_expr cp_parser_operator_function_id
2323 static cp_expr cp_parser_operator
2326 /* Templates [gram.temp] */
2328 static void cp_parser_template_declaration
2330 static tree cp_parser_template_parameter_list
2332 static tree cp_parser_template_parameter
2334 static tree cp_parser_type_parameter
2336 static tree cp_parser_template_id
2338 static tree cp_parser_template_name
2340 static tree cp_parser_template_argument_list
2342 static tree cp_parser_template_argument
2344 static void cp_parser_explicit_instantiation
2346 static void cp_parser_explicit_specialization
2349 /* Exception handling [gram.exception] */
2351 static tree cp_parser_try_block
2353 static bool cp_parser_function_try_block
2355 static void cp_parser_handler_seq
2357 static void cp_parser_handler
2359 static tree cp_parser_exception_declaration
2361 static tree cp_parser_throw_expression
2363 static tree cp_parser_exception_specification_opt
2365 static tree cp_parser_type_id_list
2368 /* GNU Extensions */
2370 static tree cp_parser_asm_specification_opt
2372 static tree cp_parser_asm_operand_list
2374 static tree cp_parser_asm_clobber_list
2376 static tree cp_parser_asm_label_list
2378 static bool cp_next_tokens_can_be_attribute_p
2380 static bool cp_next_tokens_can_be_gnu_attribute_p
2382 static bool cp_next_tokens_can_be_std_attribute_p
2384 static bool cp_nth_tokens_can_be_std_attribute_p
2386 static bool cp_nth_tokens_can_be_gnu_attribute_p
2388 static bool cp_nth_tokens_can_be_attribute_p
2390 static tree cp_parser_attributes_opt
2392 static tree cp_parser_gnu_attributes_opt
2394 static tree cp_parser_gnu_attribute_list
2396 static tree cp_parser_std_attribute
2398 static tree cp_parser_std_attribute_spec
2400 static tree cp_parser_std_attribute_spec_seq
2402 static bool cp_parser_extension_opt
2404 static void cp_parser_label_declaration
2407 /* Concept Extensions */
2409 static tree cp_parser_requires_clause
2411 static tree cp_parser_requires_clause_opt
2413 static tree cp_parser_requires_expression
2415 static tree cp_parser_requirement_parameter_list
2417 static tree cp_parser_requirement_body
2419 static tree cp_parser_requirement_list
2421 static tree cp_parser_requirement
2423 static tree cp_parser_simple_requirement
2425 static tree cp_parser_compound_requirement
2427 static tree cp_parser_type_requirement
2429 static tree cp_parser_nested_requirement
2432 /* Transactional Memory Extensions */
2434 static tree cp_parser_transaction
2436 static tree cp_parser_transaction_expression
2438 static bool cp_parser_function_transaction
2440 static tree cp_parser_transaction_cancel
2444 pragma_external,
2445 pragma_member,
2446 pragma_objc_icode,
2447 pragma_stmt,
2448 pragma_compound
2449 };
2450 static bool cp_parser_pragma
2453 /* Objective-C++ Productions */
2455 static tree cp_parser_objc_message_receiver
2457 static tree cp_parser_objc_message_args
2459 static tree cp_parser_objc_message_expression
2461 static cp_expr cp_parser_objc_encode_expression
2463 static tree cp_parser_objc_defs_expression
2465 static tree cp_parser_objc_protocol_expression
2467 static tree cp_parser_objc_selector_expression
2469 static cp_expr cp_parser_objc_expression
2471 static bool cp_parser_objc_selector_p
2473 static tree cp_parser_objc_selector
2475 static tree cp_parser_objc_protocol_refs_opt
2477 static void cp_parser_objc_declaration
2479 static tree cp_parser_objc_statement
2481 static bool cp_parser_objc_valid_prefix_attributes
2483 static void cp_parser_objc_at_property_declaration
2485 static void cp_parser_objc_at_synthesize_declaration
2487 static void cp_parser_objc_at_dynamic_declaration
2489 static tree cp_parser_objc_struct_declaration
2492 /* Utility Routines */
2494 static cp_expr cp_parser_lookup_name
2496 static tree cp_parser_lookup_name_simple
2498 static tree cp_parser_maybe_treat_template_as_class
2500 static bool cp_parser_check_declarator_template_parameters
2502 static bool cp_parser_check_template_parameters
2504 static cp_expr cp_parser_simple_cast_expression
2506 static tree cp_parser_global_scope_opt
2508 static bool cp_parser_constructor_declarator_p
2510 static tree cp_parser_function_definition_from_specifiers_and_declarator
2512 static tree cp_parser_function_definition_after_declarator
2514 static bool cp_parser_template_declaration_after_export
2516 static void cp_parser_perform_template_parameter_access_checks
2518 static tree cp_parser_single_declaration
2520 static cp_expr cp_parser_functional_cast
2522 static tree cp_parser_save_member_function_body
2524 static tree cp_parser_save_nsdmi
2526 static tree cp_parser_enclosed_template_argument_list
2528 static void cp_parser_save_default_args
2530 static void cp_parser_late_parsing_for_member
2532 static tree cp_parser_late_parse_one_default_arg
2534 static void cp_parser_late_parsing_nsdmi
2536 static void cp_parser_late_parsing_default_args
2538 static tree cp_parser_sizeof_operand
2540 static tree cp_parser_trait_expr
2542 static bool cp_parser_declares_only_class_p
2544 static void cp_parser_set_storage_class
2546 static void cp_parser_set_decl_spec_type
2548 static void set_and_check_decl_spec_loc
2551 static bool cp_parser_friend_p
2553 static void cp_parser_required_error
2559 static bool cp_parser_token_starts_function_definition_p
2561 static bool cp_parser_next_token_starts_class_definition_p
2563 static bool cp_parser_next_token_ends_template_argument_p
2565 static bool cp_parser_nth_token_starts_template_argument_list_p
2567 static enum tag_types cp_parser_token_is_class_key
2569 static enum tag_types cp_parser_token_is_type_parameter_key
2571 static void cp_parser_check_class_key
2573 static void cp_parser_check_access_in_redeclaration
2575 static bool cp_parser_optional_template_keyword
2577 static void cp_parser_pre_parsed_nested_name_specifier
2579 static bool cp_parser_cache_group
2581 static tree cp_parser_cache_defarg
2583 static void cp_parser_parse_tentatively
2585 static void cp_parser_commit_to_tentative_parse
2587 static void cp_parser_commit_to_topmost_tentative_parse
2589 static void cp_parser_abort_tentative_parse
2591 static bool cp_parser_parse_definitely
2595 static bool cp_parser_uncommitted_to_tentative_parse_p
2597 static void cp_parser_error
2599 static void cp_parser_name_lookup_error
2601 static bool cp_parser_simulate_error
2603 static bool cp_parser_check_type_definition
2605 static void cp_parser_check_for_definition_in_return_type
2607 static void cp_parser_check_for_invalid_template_id
2609 static bool cp_parser_non_integral_constant_expression
2611 static void cp_parser_diagnose_invalid_type_name
2613 static bool cp_parser_parse_and_diagnose_invalid_type_name
2615 static int cp_parser_skip_to_closing_parenthesis
2617 static void cp_parser_skip_to_end_of_statement
2619 static void cp_parser_consume_semicolon_at_end_of_statement
2621 static void cp_parser_skip_to_end_of_block_or_statement
2623 static bool cp_parser_skip_to_closing_brace
2625 static void cp_parser_skip_to_end_of_template_parameter_list
2627 static void cp_parser_skip_to_pragma_eol
2629 static bool cp_parser_error_occurred
2631 static bool cp_parser_allow_gnu_extensions_p
2633 static bool cp_parser_is_pure_string_literal
2635 static bool cp_parser_is_string_literal
2637 static bool cp_parser_is_keyword
2639 static tree cp_parser_make_typename_type
2643 static bool cp_parser_compound_literal_p
2645 static bool cp_parser_array_designator_p
2647 static bool cp_parser_init_statement_p
2649 static bool cp_parser_skip_to_closing_square_bracket
2652 /* Concept-related syntactic transformations */
2657 // -------------------------------------------------------------------------- //
2658 // Unevaluated Operand Guard
2659 //
2660 // Implementation of an RAII helper for unevaluated operand parsing.
2662 {
2665 }
2668 {
2671 }
2673 // -------------------------------------------------------------------------- //
2674 // Tentative Parsing
2676 /* Returns nonzero if we are parsing tentatively. */
2680 {
2682 }
2684 /* Returns nonzero if TOKEN is a string literal. */
2686 static bool
2688 {
2694 }
2696 /* Returns nonzero if TOKEN is a string literal
2697 of a user-defined string literal. */
2699 static bool
2701 {
2708 }
2710 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2712 static bool
2714 {
2716 }
2718 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2719 PRAGMA_NONE. */
2721 static enum pragma_kind
2723 {
2726 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2728 }
2730 /* Helper function for cp_parser_error.
2731 Having peeked a token of kind TOK1_KIND that might signify
2732 a conflict marker, peek successor tokens to determine
2733 if we actually do have a conflict marker.
2734 Specifically, we consider a run of 7 '<', '=' or '>' characters
2735 at the start of a line as a conflict marker.
2736 These come through the lexer as three pairs and a single,
2737 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2738 If it returns true, *OUT_LOC is written to with the location/range
2739 of the marker. */
2741 static bool
2744 {
2755 /* It must be at the start of the line. */
2760 /* We have a conflict marker. Construct a location of the form:
2761 <<<<<<<
2762 ^~~~~~~
2763 with start == caret, finishing at the end of the marker. */
2768 }
2770 /* If not parsing tentatively, issue a diagnostic of the form
2771 FILE:LINE: MESSAGE before TOKEN
2772 where TOKEN is the next token in the input stream. MESSAGE
2773 (specified by the caller) is usually of the form "expected
2774 OTHER-TOKEN". */
2776 static void
2778 {
2780 {
2782 /* This diagnostic makes more sense if it is tagged to the line
2783 of the token we just peeked at. */
2787 {
2792 }
2794 /* If this is actually a conflict marker, report it as such. */
2798 {
2799 location_t loc;
2801 {
2804 }
2805 }
2808 /* Because c_parser_error does not understand
2809 CPP_KEYWORD, keywords are treated like
2810 identifiers. */
2813 }
2814 }
2816 /* Issue an error about name-lookup failing. NAME is the
2817 IDENTIFIER_NODE DECL is the result of
2818 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2819 the thing that we hoped to find. */
2821 static void
2823 tree name,
2824 tree decl,
2825 name_lookup_error desired,
2826 location_t location)
2827 {
2828 /* If name lookup completely failed, tell the user that NAME was not
2829 declared. */
2831 {
2844 else
2846 }
2848 {
2850 {
2867 }
2868 }
2870 {
2872 {
2882 name);
2886 }
2887 }
2888 else
2889 {
2891 {
2904 }
2905 }
2906 }
2908 /* If we are parsing tentatively, remember that an error has occurred
2909 during this tentative parse. Returns true if the error was
2910 simulated; false if a message should be issued by the caller. */
2912 static bool
2914 {
2916 {
2919 }
2921 }
2923 /* This function is called when a type is defined. If type
2924 definitions are forbidden at this point, an error message is
2925 issued. */
2927 static bool
2929 {
2930 /* If types are forbidden here, issue a message. */
2932 {
2933 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2934 in the message need to be interpreted. */
2937 }
2939 }
2941 /* This function is called when the DECLARATOR is processed. The TYPE
2942 was a type defined in the decl-specifiers. If it is invalid to
2943 define a type in the decl-specifiers for DECLARATOR, an error is
2944 issued. TYPE_LOCATION is the location of TYPE and is used
2945 for error reporting. */
2947 static void
2950 {
2951 /* [dcl.fct] forbids type definitions in return types.
2952 Unfortunately, it's not easy to know whether or not we are
2953 processing a return type until after the fact. */
2961 {
2966 type);
2967 }
2968 }
2970 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2971 "<" in any valid C++ program. If the next token is indeed "<",
2972 issue a message warning the user about what appears to be an
2973 invalid attempt to form a template-id. LOCATION is the location
2974 of the type-specifier (TYPE) */
2976 static void
2978 tree type,
2980 location_t location)
2981 {
2985 {
2989 {
2992 else
2994 }
2995 else
2997 /* Remember the location of the invalid "<". */
3000 /* Consume the "<". */
3002 /* Parse the template arguments. */
3004 /* Permanently remove the invalid template arguments so that
3005 this error message is not issued again. */
3008 }
3009 }
3011 /* If parsing an integral constant-expression, issue an error message
3012 about the fact that THING appeared and return true. Otherwise,
3013 return false. In either case, set
3014 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3016 static bool
3018 non_integral_constant thing)
3019 {
3022 {
3024 {
3027 {
3030 "ISO C++ forbids using a floating-point literal "
3035 "enumeration type cannot appear in a "
3126 }
3130 }
3131 }
3133 }
3135 /* Emit a diagnostic for an invalid type name. This function commits
3136 to the current active tentative parse, if any. (Otherwise, the
3137 problematic construct might be encountered again later, resulting
3138 in duplicate error messages.) LOCATION is the location of ID. */
3140 static void
3142 location_t location)
3143 {
3146 /* Try to lookup the identifier. */
3153 /* If the lookup was ambiguous, an error will already have
3154 been issued. */
3156 /* If the lookup found a template-name, it means that the user forgot
3157 to specify an argument list. Emit a useful error message. */
3159 {
3162 decl);
3167 }
3171 /* Something like 'unsigned A a;' */
3174 {
3175 /* Issue an error message. */
3180 {
3186 }
3187 else
3189 /* If we're in a template class, it's possible that the user was
3190 referring to a type from a base class. For example:
3192 template <typename T> struct A { typedef T X; };
3193 template <typename T> struct B : public A<T> { X x; };
3195 The user should have said "typename A<T>::X". */
3211 {
3212 tree b;
3215 b;
3217 {
3221 {
3222 tree field;
3223 /* Go from a particular instantiation of the
3224 template (which will have an empty TYPE_FIELDs),
3225 to the main version. */
3228 field;
3232 {
3237 }
3240 }
3241 }
3242 }
3243 }
3244 /* Here we diagnose qualified-ids where the scope is actually correct,
3245 but the identifier does not resolve to a valid type name. */
3247 {
3249 {
3254 else
3260 }
3263 {
3264 /* A<T>::A<T>() */
3270 }
3277 {
3285 else
3291 }
3292 else
3294 }
3295 }
3297 /* Check for a common situation where a type-name should be present,
3298 but is not, and issue a sensible error message. Returns true if an
3299 invalid type-name was detected.
3301 The situation handled by this function are variable declarations of the
3302 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3303 Usually, `ID' should name a type, but if we got here it means that it
3304 does not. We try to emit the best possible error message depending on
3305 how exactly the id-expression looks like. */
3307 static bool
3309 {
3310 tree id;
3313 /* Avoid duplicate error about ambiguous lookup. */
3315 {
3319 }
3328 /* If the next token is a (, this is a function with no explicit return
3329 type, i.e. constructor, destructor or conversion op. */
3332 {
3335 }
3339 /* Emit a diagnostic for the invalid type. */
3341 out:
3342 /* If we aren't in the middle of a declarator (i.e. in a
3343 parameter-declaration-clause), skip to the end of the declaration;
3344 there's no point in trying to process it. */
3348 }
3350 /* Consume tokens up to, and including, the next non-nested closing `)'.
3351 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3352 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3353 found an unnested token of that type. */
3355 static int
3358 cpp_ttype or_ttype,
3360 {
3370 {
3373 /* Have we found what we're looking for before the closing paren? */
3379 {
3382 /* If we've run out of tokens, then there is no closing `)'. */
3385 /* This is good for lambda expression capture-lists. */
3395 /* This matches the processing in skip_to_end_of_statement. */
3415 {
3419 }
3424 }
3426 /* Consume the token. */
3428 }
3429 }
3431 /* Consume tokens up to, and including, the next non-nested closing `)'.
3432 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3433 are doing error recovery. Returns -1 if OR_COMMA is true and we
3434 found an unnested token of that type. */
3436 static int
3441 {
3445 }
3447 /* Consume tokens until we reach the end of the current statement.
3448 Normally, that will be just before consuming a `;'. However, if a
3449 non-nested `}' comes first, then we stop before consuming that. */
3451 static void
3453 {
3456 /* Unwind generic function template scope if necessary. */
3461 {
3465 {
3468 /* If we've run out of tokens, stop. */
3472 /* If the next token is a `;', we have reached the end of the
3473 statement. */
3479 /* If this is a non-nested '}', stop before consuming it.
3480 That way, when confronted with something like:
3482 { 3 + }
3484 we stop before consuming the closing '}', even though we
3485 have not yet reached a `;'. */
3489 /* If it is the closing '}' for a block that we have
3490 scanned, stop -- but only after consuming the token.
3491 That way given:
3493 void f g () { ... }
3494 typedef int I;
3496 we will stop after the body of the erroneously declared
3497 function, but before consuming the following `typedef'
3498 declaration. */
3500 {
3503 }
3512 }
3514 /* Consume the token. */
3516 }
3517 }
3519 /* This function is called at the end of a statement or declaration.
3520 If the next token is a semicolon, it is consumed; otherwise, error
3521 recovery is attempted. */
3523 static void
3525 {
3526 /* Look for the trailing `;'. */
3528 {
3529 /* If there is additional (erroneous) input, skip to the end of
3530 the statement. */
3532 /* If the next token is now a `;', consume it. */
3535 }
3536 }
3538 /* Skip tokens until we have consumed an entire block, or until we
3539 have consumed a non-nested `;'. */
3541 static void
3543 {
3546 /* Unwind generic function template scope if necessary. */
3551 {
3555 {
3558 /* If we've run out of tokens, stop. */
3562 /* Stop if this is an unnested ';'. */
3568 /* Stop if this is an unnested '}', or closes the outermost
3569 nesting level. */
3570 nesting_depth--;
3578 /* Nest. */
3579 nesting_depth++;
3584 }
3586 /* Consume the token. */
3588 }
3589 }
3591 /* Skip tokens until a non-nested closing curly brace is the next
3592 token, or there are no more tokens. Return true in the first case,
3593 false otherwise. */
3595 static bool
3597 {
3601 {
3605 {
3608 /* If we've run out of tokens, stop. */
3612 /* If the next token is a non-nested `}', then we have reached
3613 the end of the current block. */
3619 /* If it the next token is a `{', then we are entering a new
3620 block. Consume the entire block. */
3626 }
3628 /* Consume the token. */
3630 }
3631 }
3633 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3634 parameter is the PRAGMA token, allowing us to purge the entire pragma
3635 sequence. */
3637 static void
3639 {
3644 do
3648 /* Ensure that the pragma is not parsed again. */
3650 }
3652 /* Require pragma end of line, resyncing with it as necessary. The
3653 arguments are as for cp_parser_skip_to_pragma_eol. */
3655 static void
3657 {
3661 }
3663 /* This is a simple wrapper around make_typename_type. When the id is
3664 an unresolved identifier node, we can provide a superior diagnostic
3665 using cp_parser_diagnose_invalid_type_name. */
3667 static tree
3669 location_t id_location)
3670 {
3671 tree result;
3673 {
3679 }
3681 }
3683 /* This is a wrapper around the
3684 make_{pointer,ptrmem,reference}_declarator functions that decides
3685 which one to call based on the CODE and CLASS_TYPE arguments. The
3686 CODE argument should be one of the values returned by
3687 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3688 appertain to the pointer or reference. */
3692 cp_cv_quals cv_qualifiers,
3694 tree attributes)
3695 {
3702 else
3712 }
3714 /* Create a new C++ parser. */
3718 {
3723 /* cp_lexer_new_main is called before doing GC allocation because
3724 cp_lexer_new_main might load a PCH file. */
3727 /* Initialize the binops_by_token so that we can get the tree
3728 directly from the token. */
3736 /* For now, we always accept GNU extensions. */
3739 /* The `>' token is a greater-than operator, not the end of a
3740 template-id. */
3745 /* We are not parsing a constant-expression. */
3750 /* Local variable names are not forbidden. */
3753 /* We are not processing an `extern "C"' declaration. */
3756 /* We are not processing a declarator. */
3759 /* We are not processing a template-argument-list. */
3762 /* We are not in an iteration statement. */
3765 /* We are not in a switch statement. */
3768 /* We are not parsing a type-id inside an expression. */
3771 /* Declarations aren't implicitly extern "C". */
3774 /* String literals should be translated to the execution character set. */
3777 /* We are not parsing a function body. */
3780 /* We can correct until told otherwise. */
3783 /* The unparsed function queue is empty. */
3786 /* There are no classes being defined. */
3789 /* No template parameters apply. */
3792 /* Special parsing data structures. */
3797 /* Not declaring an implicit function template. */
3803 /* Allow constrained-type-specifiers. */
3807 }
3809 /* Create a cp_lexer structure which will emit the tokens in CACHE
3810 and push it onto the parser's lexer stack. This is used for delayed
3811 parsing of in-class method bodies and default arguments, and should
3812 not be confused with tentative parsing. */
3813 static void
3815 {
3820 /* Move the current source position to that of the first token in the
3821 new lexer. */
3823 }
3825 /* Pop the top lexer off the parser stack. This is never used for the
3826 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3827 static void
3829 {
3834 /* Put the current source position back where it was before this
3835 lexer was pushed. */
3837 }
3839 /* Lexical conventions [gram.lex] */
3841 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3842 identifier. */
3844 static cp_expr
3846 {
3849 /* Look for the identifier. */
3851 /* Return the value. */
3854 else
3856 }
3858 /* Parse a sequence of adjacent string constants. Returns a
3859 TREE_STRING representing the combined, nul-terminated string
3860 constant. If TRANSLATE is true, translate the string to the
3861 execution character set. If WIDE_OK is true, a wide string is
3862 invalid here.
3864 C++98 [lex.string] says that if a narrow string literal token is
3865 adjacent to a wide string literal token, the behavior is undefined.
3866 However, C99 6.4.5p4 says that this results in a wide string literal.
3867 We follow C99 here, for consistency with the C front end.
3869 This code is largely lifted from lex_string() in c-lex.c.
3871 FUTURE: ObjC++ will need to handle @-strings here. */
3872 static cp_expr
3875 {
3876 tree value;
3883 tree string_tree;
3889 {
3892 }
3897 {
3901 }
3902 else
3903 {
3906 }
3909 /* Try to avoid the overhead of creating and destroying an obstack
3910 for the common case of just one string. */
3913 {
3921 {
3925 }
3926 else
3930 }
3931 else
3932 {
3937 do
3938 {
3940 count++;
3945 {
3948 {
3951 }
3954 {
3959 }
3961 }
3962 else
3966 {
3970 {
3974 "unsupported non-standard concatenation "
3976 }
3977 }
3985 {
3989 }
3990 else
3991 {
3995 }
3996 }
3999 /* A string literal built by concatenation has its caret=start at
4000 the start of the initial string, and its finish at the finish of
4001 the final string literal. */
4005 }
4008 {
4011 }
4015 {
4020 {
4035 }
4040 {
4045 else
4047 }
4048 }
4049 else
4050 /* cpp_interpret_string has issued an error. */
4057 }
4059 /* Look up a literal operator with the name and the exact arguments. */
4061 static tree
4063 {
4070 {
4076 {
4079 {
4089 }
4092 /* May be this should be sufficient_parms_p instead,
4093 depending on how exactly should user-defined literals
4094 work in presence of default arguments on the literal
4095 operator parameters. */
4098 }
4099 }
4102 }
4104 /* Parse a user-defined char constant. Returns a call to a user-defined
4105 literal operator taking the character as an argument. */
4107 static cp_expr
4109 {
4117 /* Build up a call to the user-defined operator */
4118 /* Lookup the name we got back from the id-expression. */
4123 {
4128 }
4132 }
4134 /* A subroutine of cp_parser_userdef_numeric_literal to
4135 create a char... template parameter pack from a string node. */
4137 static tree
4139 {
4140 tree charvec;
4146 /* Fill in CHARVEC with all of the parameters. */
4151 /* Build the argument packs. */
4158 }
4160 /* A subroutine of cp_parser_userdef_numeric_literal to
4161 create a char... template parameter pack from a string node. */
4163 static tree
4165 {
4166 tree charvec;
4177 /* First template parm is character type. */
4180 /* Fill in CHARVEC with all of the parameters. */
4187 /* Build the argument packs. */
4194 }
4196 /* Parse a user-defined numeric constant. returns a call to a user-defined
4197 literal operator. */
4199 static cp_expr
4201 {
4212 /* Look for a literal operator taking the exact type of numeric argument
4213 as the literal value. */
4218 {
4220 tf_warning_or_error);
4223 {
4226 long_long_unsigned_type_node);
4227 }
4228 else
4229 {
4233 long_double_type_node);
4237 }
4241 }
4244 /* If the numeric argument didn't work, look for a raw literal
4245 operator taking a const char* argument consisting of the number
4246 in string format. */
4251 {
4253 tf_warning_or_error);
4256 }
4259 /* If the raw literal didn't work, look for a non-type template
4260 function with parameter pack char.... Call the function with
4261 template parameter characters representing the number. */
4265 {
4269 tf_warning_or_error);
4272 }
4281 }
4283 /* Parse a user-defined string constant. Returns a call to a user-defined
4284 literal operator taking a character pointer and the length of the string
4285 as arguments. */
4287 static tree
4289 {
4298 /* Build up a call to the user-defined operator. */
4299 /* Lookup the name we got back from the id-expression. */
4306 {
4308 tf_warning_or_error);
4311 }
4314 /* Look for a template function with typename parameter CharT
4315 and parameter pack CharT... Call the function with
4316 template parameter characters representing the string. */
4320 {
4324 tf_warning_or_error);
4327 }
4333 }
4336 /* Basic concepts [gram.basic] */
4338 /* Parse a translation-unit.
4340 translation-unit:
4341 declaration-seq [opt]
4343 Returns TRUE if all went well. */
4345 static bool
4347 {
4348 /* The address of the first non-permanent object on the declarator
4349 obstack. */
4354 /* Create the declarator obstack, if necessary. */
4356 {
4358 /* Create the error declarator. */
4360 /* Create the empty parameter list. */
4362 /* Remember where the base of the declarator obstack lies. */
4364 }
4368 /* If there are no tokens left then all went well. */
4370 {
4371 /* Get rid of the token array; we don't need it any more. */
4375 /* This file might have been a context that's implicitly extern
4376 "C". If so, pop the lang context. (Only relevant for PCH.) */
4378 {
4381 }
4383 /* Finish up. */
4387 }
4388 else
4389 {
4392 }
4394 /* Make sure the declarator obstack was fully cleaned up. */
4398 /* All went well. */
4400 }
4402 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4403 decltype context. */
4407 {
4412 }
4414 /* We're about to parse a collection of statements. If we're currently
4415 parsing tentatively, set up a firewall so that any nested
4416 cp_parser_commit_to_tentative_parse won't affect the current context. */
4418 static cp_token_position
4420 {
4427 }
4429 /* We've finished parsing the collection of statements. Wrap up the
4430 firewall and replace the relevant tokens with the parsed form. */
4432 static void
4434 tree expr)
4435 {
4439 /* Finish the firewall level. */
4441 /* And remember the result of the parse for when we try again. */
4447 }
4449 /* Like the above functions, but let the user modify the tokens. Used by
4450 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4451 later parses, so it makes sense to localize the effects of
4452 cp_parser_commit_to_tentative_parse. */
4454 struct tentative_firewall
4455 {
4460 {
4461 /* If we're currently parsing tentatively, start a committed level as a
4462 firewall and then an inner tentative parse. */
4464 {
4468 }
4469 }
4472 {
4474 {
4475 /* Finish the inner tentative parse and the firewall, propagating any
4476 uncommitted error state to the outer tentative parse. */
4482 }
4483 }
4484 };
4486 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4487 enclosing parentheses. */
4489 static cp_expr
4491 {
4494 /* Consume the '('. */
4497 /* Start the statement-expression. */
4499 /* Parse the compound-statement. */
4501 /* Finish up. */
4503 /* Consume the ')'. */
4511 }
4513 /* Expressions [gram.expr] */
4515 /* Parse a fold-operator.
4517 fold-operator:
4518 - * / % ^ & | = < > << >>
4519 = -= *= /= %= ^= &= |= <<= >>=
4520 == != <= >= && || , .* ->*
4522 This returns the tree code corresponding to the matched operator
4523 as an int. When the current token matches a compound assignment
4524 opertor, the resulting tree code is the negative value of the
4525 non-assignment operator. */
4527 static int
4529 {
4531 {
4571 }
4572 }
4574 /* Returns true if CODE indicates a binary expression, which is not allowed in
4575 the LHS of a fold-expression. More codes will need to be added to use this
4576 function in other contexts. */
4578 static bool
4580 {
4582 {
4615 }
4616 }
4618 /* If the next token is a suitable fold operator, consume it and return as
4619 the function above. */
4621 static int
4623 {
4629 }
4631 /* Parse a fold-expression.
4633 fold-expression:
4634 ( ... folding-operator cast-expression)
4635 ( cast-expression folding-operator ... )
4636 ( cast-expression folding operator ... folding-operator cast-expression)
4638 Note that the '(' and ')' are matched in primary expression. */
4640 static cp_expr
4642 {
4643 cp_id_kind pidk;
4645 // Left fold.
4647 {
4651 {
4654 }
4661 }
4666 {
4669 }
4672 {
4675 }
4678 /* The operands of a fold-expression are cast-expressions, so binary or
4679 conditional expressions are not allowed. We check this here to avoid
4680 tentative parsing. */
4690 // Right fold.
4695 {
4698 }
4701 // Binary left or right fold.
4706 }
4708 /* Parse a primary-expression.
4710 primary-expression:
4711 literal
4712 this
4713 ( expression )
4714 id-expression
4715 lambda-expression (C++11)
4717 GNU Extensions:
4719 primary-expression:
4720 ( compound-statement )
4721 __builtin_va_arg ( assignment-expression , type-id )
4722 __builtin_offsetof ( type-id , offsetof-expression )
4724 C++ Extensions:
4725 __has_nothrow_assign ( type-id )
4726 __has_nothrow_constructor ( type-id )
4727 __has_nothrow_copy ( type-id )
4728 __has_trivial_assign ( type-id )
4729 __has_trivial_constructor ( type-id )
4730 __has_trivial_copy ( type-id )
4731 __has_trivial_destructor ( type-id )
4732 __has_virtual_destructor ( type-id )
4733 __is_abstract ( type-id )
4734 __is_base_of ( type-id , type-id )
4735 __is_class ( type-id )
4736 __is_empty ( type-id )
4737 __is_enum ( type-id )
4738 __is_final ( type-id )
4739 __is_literal_type ( type-id )
4740 __is_pod ( type-id )
4741 __is_polymorphic ( type-id )
4742 __is_std_layout ( type-id )
4743 __is_trivial ( type-id )
4744 __is_union ( type-id )
4746 Objective-C++ Extension:
4748 primary-expression:
4749 objc-expression
4751 literal:
4752 __null
4754 ADDRESS_P is true iff this expression was immediately preceded by
4755 "&" and therefore might denote a pointer-to-member. CAST_P is true
4756 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4757 true iff this expression is a template argument.
4759 Returns a representation of the expression. Upon return, *IDK
4760 indicates what kind of id-expression (if any) was present. */
4762 static cp_expr
4769 {
4772 /* Assume the primary expression is not an id-expression. */
4775 /* Peek at the next token. */
4778 {
4779 /* literal:
4780 integer-literal
4781 character-literal
4782 floating-literal
4783 string-literal
4784 boolean-literal
4785 pointer-literal
4786 user-defined-literal */
4798 {
4802 }
4803 /* Floating-point literals are only allowed in an integral
4804 constant expression if they are cast to an integral or
4805 enumeration type. */
4809 {
4810 /* CAST_P will be set even in invalid code like "int(2.7 +
4811 ...)". Therefore, we have to check that the next token
4812 is sure to end the cast. */
4814 {
4819 enumerator-definition. */
4821 /* The curly brace at the end of an enum-specifier. */
4823 /* The end of a statement. */
4825 /* The end of the cast-expression. */
4827 /* The end of an array bound. */
4829 /* The closing ">" in a template-argument-list. */
4832 /* C++0x only: A ">>" treated like two ">" tokens,
4833 in a template-argument-list. */
4838 }
4840 /* If we are within a cast, then the constraint that the
4841 cast is to an integral or enumeration type will be
4842 checked at that point. If we are not within a cast, then
4843 this code is invalid. */
4846 }
4866 /* ??? Should wide strings be allowed when parser->translate_strings_p
4867 is false (i.e. in attributes)? If not, we can kill the third
4868 argument to cp_parser_string_literal. */
4874 /* If we see `( { ' then we are looking at the beginning of
4875 a GNU statement-expression. */
4878 {
4879 /* Statement-expressions are not allowed by the standard. */
4883 /* And they're not allowed outside of a function-body; you
4884 cannot, for example, write:
4886 int i = ({ int j = 3; j + 1; });
4888 at class or namespace scope. */
4891 {
4893 "statement-expressions are not allowed outside "
4899 }
4900 else
4902 }
4903 /* Otherwise it's a normal parenthesized expression. */
4904 {
4905 cp_expr expr;
4910 /* Consume the `('. */
4912 /* Within a parenthesized expression, a `>' token is always
4913 the greater-than operator. */
4914 saved_greater_than_is_operator_p
4919 /* Left fold expression. */
4921 else
4922 /* Parse the parenthesized expression. */
4927 {
4934 }
4935 else
4936 /* Let the front end know that this expression was
4937 enclosed in parentheses. This matters in case, for
4938 example, the expression is of the form `A::B', since
4939 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4940 not. */
4943 /* DR 705: Wrapping an unqualified name in parentheses
4944 suppresses arg-dependent lookup. We want to pass back
4945 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4946 (c++/37862), but none of the others. */
4950 /* The `>' token might be the end of a template-id or
4951 template-parameter-list now. */
4952 parser->greater_than_is_operator_p
4955 /* Consume the `)'. */
4964 }
4967 {
4969 {
4970 /* We might have an Objective-C++ message. */
4973 /* If that works out, we're done ... */
4976 /* ... else, fall though to see if it's a lambda. */
4977 }
4979 /* Don't warn about a failed tentative parse. */
4984 }
4988 /* We have an Objective-C++ string literal. */
4995 {
4996 /* These two are the boolean literals. */
5004 /* The `__null' literal. */
5009 /* The `nullptr' literal. */
5014 /* Recognize the `this' keyword. */
5018 {
5022 }
5023 /* Pointers cannot appear in constant-expressions. */
5028 /* The `operator' keyword can be the beginning of an
5029 id-expression. */
5036 {
5037 non_integral_constant name;
5039 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5040 __func__ are the names of variables -- but they are
5041 treated specially. Therefore, they are handled here,
5042 rather than relying on the generic id-expression logic
5043 below. Grammatically, these names are id-expressions.
5045 Consume the token. */
5049 {
5061 }
5066 /* Look up the name. */
5068 }
5071 {
5072 tree expression;
5073 tree type;
5074 source_location type_location;
5075 location_t start_loc
5077 /* The `__builtin_va_arg' construct is used to handle
5078 `va_arg'. Consume the `__builtin_va_arg' token. */
5080 /* Look for the opening `('. */
5082 /* Now, parse the assignment-expression. */
5084 /* Look for the `,'. */
5087 /* Parse the type-id. */
5088 {
5091 }
5092 /* Look for the closing `)'. */
5093 location_t finish_loc
5096 /* Using `va_arg' in a constant-expression is not
5097 allowed. */
5099 NIC_VA_ARG))
5101 /* Construct a location of the form:
5102 __builtin_va_arg (v, int)
5103 ~~~~~~~~~~~~~~~~~~~~~^~~~
5104 with the caret at the type, ranging from the start of the
5105 "__builtin_va_arg" token to the close paren. */
5106 location_t combined_loc
5109 }
5141 // C++ concepts
5145 /* Objective-C++ expressions. */
5155 {
5160 }
5161 /* FALLTHRU */
5165 }
5167 /* An id-expression can start with either an identifier, a
5168 `::' as the beginning of a qualified-id, or the "operator"
5169 keyword. */
5174 {
5175 id_expression:
5176 cp_expr id_expression;
5177 cp_expr decl;
5183 /* Parse the id-expression. */
5184 id_expression
5201 /* If we have a template-id, then no further lookup is
5202 required. If the template-id was for a template-class, we
5203 will sometimes have a TYPE_DECL at this point. */
5207 /* Look up the name. */
5208 else
5209 {
5210 tree ambiguous_decls;
5212 /* If we already know that this lookup is ambiguous, then
5213 we've already issued an error message; there's no reason
5214 to check again. */
5217 {
5220 }
5223 none_type,
5224 template_p,
5229 /* If the lookup was ambiguous, an error will already have
5230 been issued. */
5234 /* In Objective-C++, we may have an Objective-C 2.0
5235 dot-syntax for classes here. */
5240 {
5241 tree component;
5248 component);
5249 /* Build a location of the form:
5250 expr.component
5251 ~~~~~^~~~~~~~~
5252 with caret at the start of the component name (at
5253 input_location), ranging from the start of the id_expression
5254 to the end of the component name. */
5255 location_t combined_loc
5260 }
5262 /* In Objective-C++, an instance variable (ivar) may be preferred
5263 to whatever cp_parser_lookup_name() found.
5264 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5265 rest of c-family, we have to do a little extra work to preserve
5266 any location information in cp_expr "decl". Given that
5267 objc_lookup_ivar is implemented in "c-family" and "objc", we
5268 have a trip through the pure "tree" type, rather than cp_expr.
5269 Naively copying it back to "decl" would implicitly give the
5270 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5271 store an EXPR_LOCATION. Hence we only update "decl" (and
5272 hence its location_t) if we get back a different tree node. */
5274 id_expression);
5278 /* If name lookup gives us a SCOPE_REF, then the
5279 qualifying scope was dependent. */
5281 {
5282 /* At this point, we do not know if DECL is a valid
5283 integral constant expression. We assume that it is
5284 in fact such an expression, so that code like:
5286 template <int N> struct A {
5287 int a[B<N>::i];
5288 };
5290 is accepted. At template-instantiation time, we
5291 will check that B<N>::i is actually a constant. */
5293 }
5294 /* Check to see if DECL is a local variable in a context
5295 where that is forbidden. */
5298 {
5299 /* It might be that we only found DECL because we are
5300 trying to be generous with pre-ISO scoping rules.
5301 For example, consider:
5303 int i;
5304 void g() {
5305 for (int i = 0; i < 10; ++i) {}
5306 extern void f(int j = i);
5307 }
5309 Here, name look up will originally find the out
5310 of scope `i'. We need to issue a warning message,
5311 but then use the global `i'. */
5314 {
5319 }
5320 }
5321 }
5323 decl = (finish_id_expression
5325 idk,
5330 template_arg_p,
5337 }
5339 /* Anything else is an error. */
5343 }
5344 }
5352 {
5355 }
5357 /* Parse an id-expression.
5359 id-expression:
5360 unqualified-id
5361 qualified-id
5363 qualified-id:
5364 :: [opt] nested-name-specifier template [opt] unqualified-id
5365 :: identifier
5366 :: operator-function-id
5367 :: template-id
5369 Return a representation of the unqualified portion of the
5370 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5371 a `::' or nested-name-specifier.
5373 Often, if the id-expression was a qualified-id, the caller will
5374 want to make a SCOPE_REF to represent the qualified-id. This
5375 function does not do this in order to avoid wastefully creating
5376 SCOPE_REFs when they are not required.
5378 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5379 `template' keyword.
5381 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5382 uninstantiated templates.
5384 If *TEMPLATE_P is non-NULL, it is set to true iff the
5385 `template' keyword is used to explicitly indicate that the entity
5386 named is a template.
5388 If DECLARATOR_P is true, the id-expression is appearing as part of
5389 a declarator, rather than as part of an expression. */
5391 static cp_expr
5398 {
5402 /* Assume the `template' keyword was not used. */
5406 /* Look for the optional `::' operator. */
5407 global_scope_p
5410 /* Look for the optional nested-name-specifier. */
5411 nested_name_specifier_p
5414 check_dependency_p,
5416 declarator_p)
5418 /* If there is a nested-name-specifier, then we are looking at
5419 the first qualified-id production. */
5421 {
5422 tree saved_scope;
5423 tree saved_object_scope;
5424 tree saved_qualifying_scope;
5425 cp_expr unqualified_id;
5428 /* See if the next token is the `template' keyword. */
5432 /* Name lookup we do during the processing of the
5433 unqualified-id might obliterate SCOPE. */
5437 /* Process the final unqualified-id. */
5439 check_dependency_p,
5440 declarator_p,
5442 /* Restore the SAVED_SCOPE for our caller. */
5448 }
5449 /* Otherwise, if we are in global scope, then we are looking at one
5450 of the other qualified-id productions. */
5452 {
5454 tree id;
5456 /* Peek at the next token. */
5459 /* If it's an identifier, and the next token is not a "<", then
5460 we can avoid the template-id case. This is an optimization
5461 for this common case. */
5463 && !cp_parser_nth_token_starts_template_argument_list_p
5468 /* Try a template-id. */
5472 none_type,
5473 declarator_p);
5474 /* If that worked, we're done. */
5478 /* Peek at the next token. (Changes in the token buffer may
5479 have invalidated the pointer obtained above.) */
5483 {
5490 /* Fall through. */
5495 }
5496 }
5497 else
5500 declarator_p,
5501 optional_p);
5502 }
5504 /* Parse an unqualified-id.
5506 unqualified-id:
5507 identifier
5508 operator-function-id
5509 conversion-function-id
5510 ~ class-name
5511 template-id
5513 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5514 keyword, in a construct like `A::template ...'.
5516 Returns a representation of unqualified-id. For the `identifier'
5517 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5518 production a BIT_NOT_EXPR is returned; the operand of the
5519 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5520 other productions, see the documentation accompanying the
5521 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5522 names are looked up in uninstantiated templates. If DECLARATOR_P
5523 is true, the unqualified-id is appearing as part of a declarator,
5524 rather than as part of an expression. */
5526 static cp_expr
5532 {
5535 /* Peek at the next token. */
5539 {
5541 {
5542 tree id;
5544 /* We don't know yet whether or not this will be a
5545 template-id. */
5547 /* Try a template-id. */
5549 check_dependency_p,
5550 none_type,
5551 declarator_p);
5552 /* If it worked, we're done. */
5555 /* Otherwise, it's an ordinary identifier. */
5557 }
5561 check_dependency_p,
5562 none_type,
5563 declarator_p);
5566 {
5567 tree type_decl;
5568 tree qualifying_scope;
5569 tree object_scope;
5570 tree scope;
5573 /* Consume the `~' token. */
5575 /* Parse the class-name. The standard, as written, seems to
5576 say that:
5578 template <typename T> struct S { ~S (); };
5579 template <typename T> S<T>::~S() {}
5581 is invalid, since `~' must be followed by a class-name, but
5582 `S<T>' is dependent, and so not known to be a class.
5583 That's not right; we need to look in uninstantiated
5584 templates. A further complication arises from:
5586 template <typename T> void f(T t) {
5587 t.T::~T();
5588 }
5590 Here, it is not possible to look up `T' in the scope of `T'
5591 itself. We must look in both the current scope, and the
5592 scope of the containing complete expression.
5594 Yet another issue is:
5596 struct S {
5597 int S;
5598 ~S();
5599 };
5601 S::~S() {}
5603 The standard does not seem to say that the `S' in `~S'
5604 should refer to the type `S' and not the data member
5605 `S::S'. */
5607 /* DR 244 says that we look up the name after the "~" in the
5608 same scope as we looked up the qualifying name. That idea
5609 isn't fully worked out; it's more complicated than that. */
5614 /* Check for invalid scopes. */
5616 {
5620 }
5622 {
5626 scope);
5631 }
5634 /* If the name is of the form "X::~X" it's OK even if X is a
5635 typedef. */
5644 {
5647 }
5649 /* ~auto means the destructor of whatever the object is. */
5651 {
5654 "%<~auto%> only available with "
5658 }
5660 /* If there was an explicit qualification (S::~T), first look
5661 in the scope given by the qualification (i.e., S).
5663 Note: in the calls to cp_parser_class_name below we pass
5664 typename_type so that lookup finds the injected-class-name
5665 rather than the constructor. */
5669 {
5674 typename_type,
5677 declarator_p);
5680 }
5681 /* In "N::S::~S", look in "N" as well. */
5683 {
5688 type_decl
5692 typename_type,
5695 declarator_p);
5698 }
5699 /* In "p->S::~T", look in the scope given by "*p" as well. */
5701 {
5706 type_decl
5710 typename_type,
5713 declarator_p);
5716 }
5717 /* Look in the surrounding context. */
5719 {
5725 type_decl
5729 typename_type,
5732 declarator_p);
5735 {
5736 /* We couldn't find a type with this name. If we're parsing
5737 tentatively, fail and try something else. */
5739 {
5742 }
5743 /* Otherwise, accept it and check for a match at instantiation
5744 time. */
5749 }
5750 }
5751 /* If an error occurred, assume that the name of the
5752 destructor is the same as the name of the qualifying
5753 class. That allows us to keep parsing after running
5754 into ill-formed destructor names. */
5760 /* Check that destructor name and scope match. */
5762 {
5769 }
5771 /* [class.dtor]
5773 A typedef-name that names a class shall not be used as the
5774 identifier in the declarator for a destructor declaration. */
5781 type_decl);
5784 }
5788 {
5789 cp_expr id;
5791 /* This could be a template-id, so we try that first. */
5793 /* Try a template-id. */
5796 none_type,
5797 declarator_p);
5798 /* If that worked, we're done. */
5801 /* We still don't know whether we're looking at an
5802 operator-function-id or a conversion-function-id. */
5804 /* Try an operator-function-id. */
5806 /* If that didn't work, try a conversion-function-id. */
5810 {
5811 /* 17.6.3.3.5 */
5816 "literal operator suffixes not preceded by %<_%>"
5818 }
5821 }
5822 /* Fall through. */
5829 }
5830 }
5832 /* Parse an (optional) nested-name-specifier.
5834 nested-name-specifier: [C++98]
5835 class-or-namespace-name :: nested-name-specifier [opt]
5836 class-or-namespace-name :: template nested-name-specifier [opt]
5838 nested-name-specifier: [C++0x]
5839 type-name ::
5840 namespace-name ::
5841 nested-name-specifier identifier ::
5842 nested-name-specifier template [opt] simple-template-id ::
5844 PARSER->SCOPE should be set appropriately before this function is
5845 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5846 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5847 in name lookups.
5849 Sets PARSER->SCOPE to the class (TYPE) or namespace
5850 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5851 it unchanged if there is no nested-name-specifier. Returns the new
5852 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5854 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5855 part of a declaration and/or decl-specifier. */
5857 static tree
5863 {
5868 /* Remember where the nested-name-specifier starts. */
5870 {
5873 }
5876 {
5877 tree new_scope;
5878 tree old_scope;
5879 tree saved_qualifying_scope;
5882 /* Spot cases that cannot be the beginning of a
5883 nested-name-specifier. */
5886 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5887 the already parsed nested-name-specifier. */
5889 {
5890 /* Grab the nested-name-specifier and continue the loop. */
5892 /* If we originally encountered this nested-name-specifier
5893 with IS_DECLARATION set to false, we will not have
5894 resolved TYPENAME_TYPEs, so we must do so here. */
5897 {
5902 }
5905 }
5907 /* Spot cases that cannot be the beginning of a
5908 nested-name-specifier. On the second and subsequent times
5909 through the loop, we look for the `template' keyword. */
5911 ;
5912 /* A template-id can start a nested-name-specifier. */
5914 ;
5915 /* DR 743: decltype can be used in a nested-name-specifier. */
5917 ;
5918 else
5919 {
5920 /* If the next token is not an identifier, then it is
5921 definitely not a type-name or namespace-name. */
5924 /* If the following token is neither a `<' (to begin a
5925 template-id), nor a `::', then we are not looking at a
5926 nested-name-specifier. */
5932 {
5936 }
5939 && !cp_parser_nth_token_starts_template_argument_list_p
5942 }
5944 /* The nested-name-specifier is optional, so we parse
5945 tentatively. */
5948 /* Look for the optional `template' keyword, if this isn't the
5949 first time through the loop. */
5952 else
5955 /* Save the old scope since the name lookup we are about to do
5956 might destroy it. */
5959 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5960 look up names in "X<T>::I" in order to determine that "Y" is
5961 a template. So, if we have a typename at this point, we make
5962 an effort to look through it. */
5964 && !typename_keyword_p
5969 /* Parse the qualifying entity. */
5970 new_scope
5972 typename_keyword_p,
5973 template_keyword_p,
5974 check_dependency_p,
5975 type_p,
5976 is_declaration);
5977 /* Look for the `::' token. */
5980 /* If we found what we wanted, we keep going; otherwise, we're
5981 done. */
5983 {
5986 /* Restore the OLD_SCOPE since it was valid before the
5987 failed attempt at finding the last
5988 class-or-namespace-name. */
5992 /* If the next token is a decltype, and the one after that is a
5993 `::', then the decltype has failed to resolve to a class or
5994 enumeration type. Give this error even when parsing
5995 tentatively since it can't possibly be valid--and we're going
5996 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5997 won't get another chance.*/
6001 {
6008 /* As below. */
6011 }
6015 {
6016 /* If we have a non-type template-id followed by ::, it can't
6017 possibly be valid. */
6022 {
6025 {
6031 }
6032 else
6033 {
6034 /* Variable template. */
6039 }
6046 /* As below. */
6050 }
6051 }
6055 /* If the next token is an identifier, and the one after
6056 that is a `::', then any valid interpretation would have
6057 found a class-or-namespace-name. */
6063 {
6066 {
6068 {
6069 tree decl;
6070 tree ambiguous_decls;
6073 none_type,
6082 decl);
6084 {
6085 // cp_parser_lookup_name has the same diagnostic,
6086 // thus make sure to emit it at most once.
6089 {
6094 }
6096 }
6097 else
6098 {
6100 cp_parser_name_lookup_error
6103 else
6104 cp_parser_name_lookup_error
6107 }
6108 }
6111 /* Treat this as a successful nested-name-specifier
6112 due to:
6114 [basic.lookup.qual]
6116 If the name found is not a class-name (clause
6117 _class_) or namespace-name (_namespace.def_), the
6118 program is ill-formed. */
6120 }
6122 }
6124 }
6125 /* We've found one valid nested-name-specifier. */
6127 /* Name lookup always gives us a DECL. */
6130 /* Uses of "template" must be followed by actual templates. */
6142 new_scope);
6143 /* If it is a class scope, try to complete it; we are about to
6144 be looking up names inside the class. */
6146 /* Since checking types for dependency can be expensive,
6147 avoid doing it if the type is already complete. */
6149 /* Do not try to complete dependent types. */
6151 {
6153 /* If it is a typedef to current class, use the current
6154 class instead, as the typedef won't have any names inside
6155 it yet. */
6159 }
6160 /* Make sure we look in the right scope the next time through
6161 the loop. */
6163 }
6165 /* If parsing tentatively, replace the sequence of tokens that makes
6166 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6167 token. That way, should we re-parse the token stream, we will
6168 not have to repeat the effort required to do the parse, nor will
6169 we issue duplicate error messages. */
6171 {
6175 /* Reset the contents of the START token. */
6177 /* Retrieve any deferred checks. Do not pop this access checks yet
6178 so the memory will not be reclaimed during token replacing below. */
6186 /* Purge all subsequent tokens. */
6188 }
6194 }
6196 /* Parse a nested-name-specifier. See
6197 cp_parser_nested_name_specifier_opt for details. This function
6198 behaves identically, except that it will an issue an error if no
6199 nested-name-specifier is present. */
6201 static tree
6207 {
6208 tree scope;
6210 /* Look for the nested-name-specifier. */
6212 typename_keyword_p,
6213 check_dependency_p,
6214 type_p,
6215 is_declaration);
6216 /* If it was not present, issue an error message. */
6218 {
6221 }
6224 }
6226 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6227 this is either a class-name or a namespace-name (which corresponds
6228 to the class-or-namespace-name production in the grammar). For
6229 C++0x, it can also be a type-name that refers to an enumeration
6230 type or a simple-template-id.
6232 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6233 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6234 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6235 TYPE_P is TRUE iff the next name should be taken as a class-name,
6236 even the same name is declared to be another entity in the same
6237 scope.
6239 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6240 specified by the class-or-namespace-name. If neither is found the
6241 ERROR_MARK_NODE is returned. */
6243 static tree
6250 {
6251 tree saved_scope;
6252 tree saved_qualifying_scope;
6253 tree saved_object_scope;
6254 tree scope;
6258 /* DR 743: decltype can appear in a nested-name-specifier. */
6260 {
6264 {
6267 }
6271 }
6273 /* Before we try to parse the class-name, we must save away the
6274 current PARSER->SCOPE since cp_parser_class_name will destroy
6275 it. */
6279 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6280 there is no need to look for a namespace-name. */
6281 only_class_p = template_keyword_p
6286 typename_keyword_p,
6287 template_keyword_p,
6289 check_dependency_p,
6291 is_declaration,
6294 /* If that didn't work, try for a namespace-name. */
6296 {
6297 /* Restore the saved scope. */
6301 /* If we are not looking at an identifier followed by the scope
6302 resolution operator, then this is not part of a
6303 nested-name-specifier. (Note that this function is only used
6304 to parse the components of a nested-name-specifier.) */
6309 }
6312 }
6314 /* Return true if we are looking at a compound-literal, false otherwise. */
6316 static bool
6318 {
6319 /* Consume the `('. */
6324 /* Skip tokens until the next token is a closing parenthesis.
6325 If we find the closing `)', and the next token is a `{', then
6326 we are looking at a compound-literal. */
6327 bool compound_literal_p
6332 /* Roll back the tokens we skipped. */
6336 }
6338 /* Parse a postfix-expression.
6340 postfix-expression:
6341 primary-expression
6342 postfix-expression [ expression ]
6343 postfix-expression ( expression-list [opt] )
6344 simple-type-specifier ( expression-list [opt] )
6345 typename :: [opt] nested-name-specifier identifier
6346 ( expression-list [opt] )
6347 typename :: [opt] nested-name-specifier template [opt] template-id
6348 ( expression-list [opt] )
6349 postfix-expression . template [opt] id-expression
6350 postfix-expression -> template [opt] id-expression
6351 postfix-expression . pseudo-destructor-name
6352 postfix-expression -> pseudo-destructor-name
6353 postfix-expression ++
6354 postfix-expression --
6355 dynamic_cast < type-id > ( expression )
6356 static_cast < type-id > ( expression )
6357 reinterpret_cast < type-id > ( expression )
6358 const_cast < type-id > ( expression )
6359 typeid ( expression )
6360 typeid ( type-id )
6362 GNU Extension:
6364 postfix-expression:
6365 ( type-id ) { initializer-list , [opt] }
6367 This extension is a GNU version of the C99 compound-literal
6368 construct. (The C99 grammar uses `type-name' instead of `type-id',
6369 but they are essentially the same concept.)
6371 If ADDRESS_P is true, the postfix expression is the operand of the
6372 `&' operator. CAST_P is true if this expression is the target of a
6373 cast.
6375 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6376 class member access expressions [expr.ref].
6378 Returns a representation of the expression. */
6380 static cp_expr
6384 {
6386 location_t loc;
6393 /* Peek at the next token. */
6398 /* Some of the productions are determined by keywords. */
6401 {
6406 {
6407 tree type;
6408 cp_expr expression;
6412 /* All of these can be handled in the same way from the point
6413 of view of parsing. Begin by consuming the token
6414 identifying the cast. */
6417 /* New types cannot be defined in the cast. */
6419 parser->type_definition_forbidden_message
6422 /* Look for the opening `<'. */
6424 /* Parse the type to which we are casting. */
6429 /* Look for the closing `>'. */
6431 /* Restore the old message. */
6434 bool saved_greater_than_is_operator_p
6438 /* And the expression which is being cast. */
6442 RT_CLOSE_PAREN);
6446 parser->greater_than_is_operator_p
6449 /* Only type conversions to integral or enumeration types
6450 can be used in constant-expressions. */
6453 {
6456 }
6459 {
6461 postfix_expression
6465 postfix_expression
6469 postfix_expression
6471 tf_warning_or_error);
6474 postfix_expression
6479 }
6481 /* Construct a location e.g. :
6482 reinterpret_cast <int *> (expr)
6483 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6484 ranging from the start of the "*_cast" token to the final closing
6485 paren, with the caret at the start. */
6488 }
6492 {
6493 tree type;
6497 /* Consume the `typeid' token. */
6499 /* Look for the `(' token. */
6501 /* Types cannot be defined in a `typeid' expression. */
6503 parser->type_definition_forbidden_message
6505 /* We can't be sure yet whether we're looking at a type-id or an
6506 expression. */
6508 /* Try a type-id first. */
6513 /* Look for the `)' token. Otherwise, we can't be sure that
6514 we're not looking at an expression: consider `typeid (int
6515 (3))', for example. */
6517 /* If all went well, simply lookup the type-id. */
6520 /* Otherwise, fall back to the expression variant. */
6521 else
6522 {
6523 tree expression;
6525 /* Look for an expression. */
6527 /* Compute its typeid. */
6529 /* Look for the `)' token. */
6531 }
6532 /* Restore the saved message. */
6534 /* `typeid' may not appear in an integral constant expression. */
6537 }
6541 {
6542 tree type;
6543 /* The syntax permitted here is the same permitted for an
6544 elaborated-type-specifier. */
6551 }
6555 {
6556 location_t cilk_spawn_loc
6561 {
6566 }
6568 {
6573 }
6574 else
6575 {
6576 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6579 }
6581 postfix_expression =
6585 {
6589 }
6591 {
6596 }
6597 else
6598 {
6601 postfix_expression);
6602 /* Build a location of the form:
6603 _Cilk_spawn expr
6604 ~~~~~~~~~~~~^~~~
6605 with caret at the expr, ranging from the start of the
6606 _Cilk_spawn token to the end of the expression. */
6607 location_t combined_loc =
6613 }
6615 }
6620 {
6623 tree p;
6630 {
6633 }
6639 {
6642 postfix_expression
6644 else
6645 {
6649 }
6655 tf_warning_or_error);
6656 else
6657 {
6661 }
6666 postfix_expression
6670 postfix_expression
6673 else
6674 {
6678 }
6683 }
6685 }
6688 {
6689 tree type;
6691 /* If the next thing is a simple-type-specifier, we may be
6692 looking at a functional cast. We could also be looking at
6693 an id-expression. So, we try the functional cast, and if
6694 that doesn't work we fall back to the primary-expression. */
6696 /* Look for the simple-type-specifier. */
6700 CP_PARSER_FLAGS_NONE);
6702 /* Parse the cast itself. */
6704 postfix_expression
6706 /* If that worked, we're done. */
6710 /* If the functional-cast didn't work out, try a
6711 compound-literal. */
6714 {
6719 /* Avoid calling cp_parser_type_id pointlessly, see comment
6720 in cp_parser_cast_expression about c++/29234. */
6723 else
6724 {
6725 /* Parse the type. */
6730 /* Look for the `)'. */
6732 }
6734 /* If things aren't going well, there's no need to
6735 keep going. */
6737 {
6739 /* Parse the brace-enclosed initializer list. */
6742 }
6743 /* If that worked, we're definitely looking at a
6744 compound-literal expression. */
6746 {
6747 /* Warn the user that a compound literal is not
6748 allowed in standard C++. */
6751 /* For simplicity, we disallow compound literals in
6752 constant-expressions. We could
6753 allow compound literals of integer type, whose
6754 initializer was a constant, in constant
6755 expressions. Permitting that usage, as a further
6756 extension, would not change the meaning of any
6757 currently accepted programs. (Of course, as
6758 compound literals are not part of ISO C++, the
6759 standard has nothing to say.) */
6761 NIC_NCC))
6762 {
6765 }
6766 /* Form the representation of the compound-literal. */
6767 postfix_expression
6769 tf_warning_or_error);
6772 }
6773 }
6775 /* It must be a primary-expression. */
6776 postfix_expression
6779 decltype_p,
6781 }
6783 }
6785 /* Note that we don't need to worry about calling build_cplus_new on a
6786 class-valued CALL_EXPR in decltype when it isn't the end of the
6787 postfix-expression; unary_complex_lvalue will take care of that for
6788 all these cases. */
6790 /* Keep looping until the postfix-expression is complete. */
6792 {
6796 /* It is not a Koenig lookup function call. */
6797 postfix_expression
6800 /* Peek at the next token. */
6804 {
6807 {
6809 "two consecutive %<[%> shall "
6812 }
6813 postfix_expression
6815 postfix_expression,
6817 decltype_p);
6826 /* postfix-expression ( expression-list [opt] ) */
6827 {
6838 is_builtin_constant_p
6841 {
6842 /* The whole point of __builtin_constant_p is to allow
6843 non-constant expressions to appear as arguments. */
6844 saved_integral_constant_expression_p
6846 saved_non_integral_constant_expression_p
6849 }
6850 args = (cp_parser_parenthesized_expression_list
6856 {
6857 parser->integral_constant_expression_p
6859 parser->non_integral_constant_expression_p
6861 }
6864 {
6867 }
6869 /* Function calls are not permitted in
6870 constant-expressions. */
6873 NIC_FUNC_CALL))
6874 {
6878 }
6883 {
6885 {
6887 {
6890 postfix_expression
6892 complain);
6893 }
6894 else
6895 postfix_expression
6897 }
6898 /* We do not perform argument-dependent lookup if
6899 normal lookup finds a non-function, in accordance
6900 with the expected resolution of DR 218. */
6903 {
6907 /* Do not do argument dependent lookup if regular
6908 lookup finds a member function or a block-scope
6909 function declaration. [basic.lookup.argdep]/3 */
6912 {
6915 postfix_expression
6917 complain);
6918 }
6919 }
6920 }
6926 {
6935 }
6938 {
6948 {
6950 postfix_expression
6954 }
6957 {
6958 postfix_expression
6959 = (build_new_method_call
6965 complain));
6966 }
6967 else
6968 postfix_expression
6972 complain);
6973 }
6977 postfix_expression = (build_offset_ref_call_from_tree
6979 complain));
6981 /* A call to a static class member, or a namespace-scope
6982 function. */
6983 postfix_expression
6986 koenig_p,
6987 complain);
6988 else
6989 /* All other function calls. */
6990 postfix_expression
6993 koenig_p,
6994 complain);
6997 {
6999 start_loc,
7000 close_paren_loc);
7002 }
7004 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7008 }
7013 /* postfix-expression . template [opt] id-expression
7014 postfix-expression . pseudo-destructor-name
7015 postfix-expression -> template [opt] id-expression
7016 postfix-expression -> pseudo-destructor-name */
7018 /* Consume the `.' or `->' operator. */
7021 postfix_expression
7023 postfix_expression,
7030 /* postfix-expression ++ */
7031 /* Consume the `++' token. */
7033 /* Generate a representation for the complete expression. */
7034 postfix_expression
7036 POSTINCREMENT_EXPR);
7037 /* Increments may not appear in constant-expressions. */
7045 /* postfix-expression -- */
7046 /* Consume the `--' token. */
7048 /* Generate a representation for the complete expression. */
7049 postfix_expression
7051 POSTDECREMENT_EXPR);
7052 /* Decrements may not appear in constant-expressions. */
7063 return is_member_access
7064 ? postfix_expression
7066 else
7068 }
7069 }
7071 /* We should never get here. */
7074 }
7076 /* This function parses Cilk Plus array notations. If a normal array expr. is
7077 parsed then the array index is passed back to the caller through *INIT_INDEX
7078 and the function returns a NULL_TREE. If array notation expr. is parsed,
7079 then *INIT_INDEX is ignored by the caller and the function returns
7080 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7081 error_mark_node. */
7083 static tree
7085 tree array_value)
7086 {
7090 {
7093 }
7102 {
7105 }
7107 {
7108 /* Consume the ':'. */
7111 /* If we are here, then we have a case like this A[:]. */
7113 {
7117 }
7121 }
7122 else
7123 {
7124 /* If we are here, then there are three valid possibilities:
7125 1. ARRAY [ EXP ]
7126 2. ARRAY [ EXP : EXP ]
7127 3. ARRAY [ EXP : EXP : EXP ] */
7131 {
7132 /* This indicates that we have a normal array expression. */
7135 }
7137 /* Consume the ':'. */
7141 {
7144 }
7145 }
7150 {
7154 }
7160 }
7162 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7163 by cp_parser_builtin_offsetof. We're looking for
7165 postfix-expression [ expression ]
7166 postfix-expression [ braced-init-list ] (C++11)
7168 FOR_OFFSETOF is set if we're being called in that context, which
7169 changes how we deal with integer constant expressions. */
7171 static tree
7173 tree postfix_expression,
7176 {
7181 /* Consume the `[' token. */
7187 /* Parse the index expression. */
7188 /* ??? For offsetof, there is a question of what to allow here. If
7189 offsetof is not being used in an integral constant expression context,
7190 then we *could* get the right answer by computing the value at runtime.
7191 If we are in an integral constant expression context, then we might
7192 could accept any constant expression; hard to say without analysis.
7193 Rather than open the barn door too wide right away, allow only integer
7194 constant expressions here. */
7197 else
7198 {
7200 {
7207 {
7209 "braced list index is not allowed with array "
7213 }
7214 }
7216 {
7217 /* Here are have these two options:
7218 ARRAY[EXP : EXP] - Array notation expr with default
7219 stride of 1.
7220 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7221 stride. */
7223 postfix_expression);
7226 }
7227 else
7229 }
7233 /* Look for the closing `]'. */
7236 /* Build the ARRAY_REF. */
7240 /* When not doing offsetof, array references are not permitted in
7241 constant-expressions. */
7247 }
7249 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7250 by cp_parser_builtin_offsetof. We're looking for
7252 postfix-expression . template [opt] id-expression
7253 postfix-expression . pseudo-destructor-name
7254 postfix-expression -> template [opt] id-expression
7255 postfix-expression -> pseudo-destructor-name
7257 FOR_OFFSETOF is set if we're being called in that context. That sorta
7258 limits what of the above we'll actually accept, but nevermind.
7259 TOKEN_TYPE is the "." or "->" token, which will already have been
7260 removed from the stream. */
7262 static tree
7265 cp_expr postfix_expression,
7267 location_t location)
7268 {
7269 tree name;
7275 /* If this is a `->' operator, dereference the pointer. */
7278 tf_warning_or_error);
7279 /* Check to see whether or not the expression is type-dependent and
7280 not the current instantiation. */
7282 /* The identifier following the `->' or `.' is not qualified. */
7288 /* Enter the scope corresponding to the type of the object
7289 given by the POSTFIX_EXPRESSION. */
7291 {
7293 /* According to the standard, no expression should ever have
7294 reference type. Unfortunately, we do not currently match
7295 the standard in this respect in that our internal representation
7296 of an expression may have reference type even when the standard
7297 says it does not. Therefore, we have to manually obtain the
7298 underlying type here. */
7300 /* The type of the POSTFIX_EXPRESSION must be complete. */
7301 /* Unlike the object expression in other contexts, *this is not
7302 required to be of complete type for purposes of class member
7303 access (5.2.5) outside the member function body. */
7306 && !(processing_template_decl
7307 && current_class_type
7308 && (same_type_ignoring_top_level_qualifiers_p
7310 {
7313 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7315 {
7316 /* In a template, be permissive by treating an object expression
7317 of incomplete type as dependent (after a pedwarn). */
7318 diagnostic_t kind = (processing_template_decl
7319 ? DK_PEDWARN
7321 cxx_incomplete_type_diagnostic
7325 {
7328 }
7329 }
7330 }
7333 {
7334 /* Let the name lookup machinery know that we are processing a
7335 class member access expression. */
7337 /* If something went wrong, we want to be able to discern that case,
7338 as opposed to the case where there was no SCOPE due to the type
7339 of expression being dependent. */
7342 /* If the SCOPE was erroneous, make the various semantic analysis
7343 functions exit quickly -- and without issuing additional error
7344 messages. */
7347 }
7348 }
7351 /* Tell cp_parser_lookup_name that there was an object, even though it's
7352 type-dependent. */
7355 /* Assume this expression is not a pseudo-destructor access. */
7358 /* If the SCOPE is a scalar type, then, if this is a valid program,
7359 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7360 is type dependent, it can be pseudo-destructor-name or something else.
7361 Try to parse it as pseudo-destructor-name first. */
7363 {
7364 tree s;
7365 tree type;
7368 /* Parse the pseudo-destructor-name. */
7377 {
7379 postfix_expression
7382 }
7383 }
7386 {
7387 /* If the SCOPE is not a scalar type, we are looking at an
7388 ordinary class member access expression, rather than a
7389 pseudo-destructor-name. */
7392 /* Parse the id-expression. */
7393 name = (cp_parser_id_expression
7400 /* In general, build a SCOPE_REF if the member name is qualified.
7401 However, if the name was not dependent and has already been
7402 resolved; there is no need to build the SCOPE_REF. For example;
7404 struct X { void f(); };
7405 template <typename T> void f(T* t) { t->X::f(); }
7407 Even though "t" is dependent, "X::f" is not and has been resolved
7408 to a BASELINK; there is no need to include scope information. */
7410 /* But we do need to remember that there was an explicit scope for
7411 virtual function calls. */
7415 /* If the name is a template-id that names a type, we will get a
7416 TYPE_DECL here. That is invalid code. */
7418 {
7421 }
7422 else
7423 {
7425 {
7427 {
7431 }
7432 else
7435 name,
7436 template_p);
7440 }
7442 adjust_result_of_qualified_name_lookup
7444 postfix_expression
7446 template_p,
7447 tf_warning_or_error);
7448 /* Build a location e.g.:
7449 ptr->access_expr
7450 ~~~^~~~~~~~~~~~~
7451 where the caret is at the deref token, ranging from
7452 the start of postfix_expression to the end of the access expr. */
7453 location_t end_loc
7455 location_t combined_loc
7458 }
7459 }
7461 /* We no longer need to look up names in the scope of the object on
7462 the left-hand side of the `.' or `->' operator. */
7465 /* Outside of offsetof, these operators may not appear in
7466 constant-expressions. */
7468 && (cp_parser_non_integral_constant_expression
7473 }
7475 /* Parse a parenthesized expression-list.
7477 expression-list:
7478 assignment-expression
7479 expression-list, assignment-expression
7481 attribute-list:
7482 expression-list
7483 identifier
7484 identifier, expression-list
7486 CAST_P is true if this expression is the target of a cast.
7488 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7489 argument pack.
7491 Returns a vector of trees. Each element is a representation of an
7492 assignment-expression. NULL is returned if the ( and or ) are
7493 missing. An empty, but allocated, vector is returned on no
7494 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7495 if we are parsing an attribute list for an attribute that wants a
7496 plain identifier argument, normal_attr for an attribute that wants
7497 an expression, or non_attr if we aren't parsing an attribute list. If
7498 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7499 not all of the expressions in the list were constant.
7500 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7501 will be written to with the location of the closing parenthesis. If
7502 an error occurs, it may or may not be written to. */
7511 {
7517 /* Assume all the expressions will be constant. */
7526 /* Within a parenthesized expression, a `>' token is always
7527 the greater-than operator. */
7528 saved_greater_than_is_operator_p
7532 /* Consume expressions until there are no more. */
7535 {
7536 tree expr;
7538 /* At the beginning of attribute lists, check to see if the
7539 next token is an identifier. */
7542 {
7545 /* Consume the identifier. */
7547 /* Save the identifier. */
7549 }
7550 else
7551 {
7554 /* Parse the next assignment-expression. */
7556 {
7557 /* A braced-init-list. */
7563 }
7565 {
7566 expr = (cp_parser_constant_expression
7571 }
7572 else
7574 cast_p);
7579 /* If we have an ellipsis, then this is an expression
7580 expansion. */
7583 {
7584 /* Consume the `...'. */
7587 /* Build the argument pack. */
7589 }
7591 /* Add it to the list. We add error_mark_node
7592 expressions to the list, so that we can still tell if
7593 the correct form for a parenthesized expression-list
7594 is found. That gives better errors. */
7599 }
7601 /* After the first item, attribute lists look the same as
7602 expression lists. */
7605 get_comma:;
7606 /* If the next token isn't a `,', then we are done. */
7610 /* Otherwise, consume the `,' and keep going. */
7612 }
7618 {
7621 skip_comma:;
7622 /* We try and resync to an unnested comma, as that will give the
7623 user better diagnostics. */
7631 {
7632 parser->greater_than_is_operator_p
7635 }
7636 }
7638 parser->greater_than_is_operator_p
7645 }
7647 /* Parse a pseudo-destructor-name.
7649 pseudo-destructor-name:
7650 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7651 :: [opt] nested-name-specifier template template-id :: ~ type-name
7652 :: [opt] nested-name-specifier [opt] ~ type-name
7654 If either of the first two productions is used, sets *SCOPE to the
7655 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7656 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7657 or ERROR_MARK_NODE if the parse fails. */
7659 static void
7661 tree object,
7664 {
7667 /* Handle ~auto. */
7671 {
7674 "%<~auto%> only available with "
7681 }
7683 /* Assume that things will not work out. */
7686 /* Look for the optional `::' operator. */
7688 /* Look for the optional nested-name-specifier. */
7689 nested_name_specifier_p
7696 /* Now, if we saw a nested-name-specifier, we might be doing the
7697 second production. */
7700 {
7701 /* Consume the `template' keyword. */
7703 /* Parse the template-id. */
7707 class_type,
7709 /* Look for the `::' token. */
7711 }
7712 /* If the next token is not a `~', then there might be some
7713 additional qualification. */
7715 {
7716 /* At this point, we're looking for "type-name :: ~". The type-name
7717 must not be a class-name, since this is a pseudo-destructor. So,
7718 it must be either an enum-name, or a typedef-name -- both of which
7719 are just identifiers. So, we peek ahead to check that the "::"
7720 and "~" tokens are present; if they are not, then we can avoid
7721 calling type_name. */
7725 {
7728 }
7730 /* Look for the type-name. */
7735 /* Look for the `::' token. */
7737 }
7738 else
7741 /* Look for the `~'. */
7744 /* Once we see the ~, this has to be a pseudo-destructor. */
7748 /* Look for the type-name again. We are not responsible for
7749 checking that it matches the first type-name. */
7751 }
7753 /* Parse a unary-expression.
7755 unary-expression:
7756 postfix-expression
7757 ++ cast-expression
7758 -- cast-expression
7759 unary-operator cast-expression
7760 sizeof unary-expression
7761 sizeof ( type-id )
7762 alignof ( type-id ) [C++0x]
7763 new-expression
7764 delete-expression
7766 GNU Extensions:
7768 unary-expression:
7769 __extension__ cast-expression
7770 __alignof__ unary-expression
7771 __alignof__ ( type-id )
7772 alignof unary-expression [C++0x]
7773 __real__ cast-expression
7774 __imag__ cast-expression
7775 && identifier
7776 sizeof ( type-id ) { initializer-list , [opt] }
7777 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7778 __alignof__ ( type-id ) { initializer-list , [opt] }
7780 ADDRESS_P is true iff the unary-expression is appearing as the
7781 operand of the `&' operator. CAST_P is true if this expression is
7782 the target of a cast.
7784 Returns a representation of the expression. */
7786 static cp_expr
7789 {
7793 /* Peek at the next token. */
7795 /* Some keywords give away the kind of expression. */
7797 {
7801 {
7804 {
7807 location_t first_loc;
7810 /* Consume the token. */
7813 /* Parse the operand. */
7818 else
7819 {
7820 /* ISO C++ defines alignof only with types, not with
7821 expressions. So pedwarn if alignof is used with a non-
7822 type expression. However, __alignof__ is ok. */
7825 "ISO C++ does not allow %<alignof%> "
7829 }
7830 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7831 SIZEOF_EXPR with the original operand. */
7833 {
7835 {
7837 {
7840 error_mark_node));
7842 }
7843 else
7847 }
7849 }
7851 }
7860 {
7861 /* The saved value of the PEDANTIC flag. */
7863 tree expr;
7865 /* Save away the PEDANTIC flag. */
7867 /* Parse the cast-expression. */
7869 /* Restore the PEDANTIC flag. */
7873 }
7877 {
7878 tree expression;
7880 /* Consume the `__real__' or `__imag__' token. */
7882 /* Parse the cast-expression. */
7884 /* Create the complete representation. */
7888 expression,
7889 tf_warning_or_error);
7890 }
7898 {
7899 tree expr;
7909 parser->type_definition_forbidden_message
7912 saved_integral_constant_expression_p
7914 saved_non_integral_constant_expression_p
7918 saved_greater_than_is_operator_p
7930 parser->greater_than_is_operator_p
7933 parser->integral_constant_expression_p
7935 parser->non_integral_constant_expression_p
7942 }
7946 }
7947 }
7949 /* Look for the `:: new' and `:: delete', which also signal the
7950 beginning of a new-expression, or delete-expression,
7951 respectively. If the next token is `::', then it might be one of
7952 these. */
7954 {
7957 /* See if the token after the `::' is one of the keywords in
7958 which we're interested. */
7960 /* If it's `new', we have a new-expression. */
7963 /* Similarly, for `delete'. */
7966 }
7968 /* Look for a unary operator. */
7970 /* The `++' and `--' operators can be handled similarly, even though
7971 they are not technically unary-operators in the grammar. */
7973 {
7978 /* Handle the GNU address-of-label extension. */
7981 {
7982 tree identifier;
7983 tree expression;
7986 /* Consume the '&&' token. */
7988 /* Look for the identifier. */
7989 location_t finish_loc
7992 /* Construct a location of the form:
7993 &&label
7994 ^~~~~~~
7995 with caret==start at the "&&", finish at the end of the label. */
7996 location_t combined_loc
7998 /* Create an expression representing the address. */
8001 NIC_ADDR_LABEL))
8004 }
8005 }
8007 {
8008 cp_expr cast_expression;
8014 /* Consume the operator token. */
8018 /* Parse the cast-expression. */
8019 cast_expression
8024 pidk);
8026 /* Make a location:
8027 OP_TOKEN CAST_EXPRESSION
8028 ^~~~~~~~~~~~~~~~~~~~~~~~~
8029 with start==caret at the operator token, and
8030 extending to the end of the cast_expression. */
8033 /* Now, build an appropriate representation. */
8035 {
8039 RO_UNARY_STAR,
8040 complain);
8041 /* TODO: build_x_indirect_ref does not always honor the
8042 location, so ensure it is set. */
8048 /* Fall through. */
8051 cast_expression,
8052 complain);
8053 /* TODO: build_x_unary_op does not always honor the location,
8054 so ensure it is set. */
8062 /* Fall through. */
8064 /* Immediately fold negation of a constant, unless the constant is 0
8065 (since -0 == 0) or it would overflow. */
8070 {
8073 cast_expression);
8075 {
8078 }
8079 }
8080 /* Fall through. */
8089 }
8093 non_constant_p))
8097 }
8101 decltype_p,
8102 pidk);
8103 }
8105 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8106 unary-operator, the corresponding tree code is returned. */
8108 static enum tree_code
8110 {
8112 {
8133 }
8134 }
8136 /* Parse a new-expression.
8138 new-expression:
8139 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8140 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8142 Returns a representation of the expression. */
8144 static tree
8146 {
8149 tree type;
8152 tree ret;
8156 /* Look for the optional `::' operator. */
8157 global_scope_p
8161 /* Look for the `new' operator. */
8163 /* There's no easy way to tell a new-placement from the
8164 `( type-id )' construct. */
8166 /* Look for a new-placement. */
8168 /* If that didn't work out, there's no new-placement. */
8170 {
8174 }
8176 /* If the next token is a `(', then we have a parenthesized
8177 type-id. */
8179 {
8183 /* Consume the `('. */
8186 /* Parse the type-id. */
8187 parser->type_definition_forbidden_message
8189 {
8192 }
8195 /* Look for the closing `)'. */
8198 /* There should not be a direct-new-declarator in this production,
8199 but GCC used to allowed this, so we check and emit a sensible error
8200 message for this case. */
8202 {
8208 }
8209 }
8210 /* Otherwise, there must be a new-type-id. */
8211 else
8214 /* If the next token is a `(' or '{', then we have a new-initializer. */
8219 else
8222 /* A new-expression may not appear in an integral constant
8223 expression. */
8226 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8227 of a new-type-id or type-id of a new-expression, the new-expression shall
8228 contain a new-initializer of the form ( assignment-expression )".
8229 Additionally, consistently with the spirit of DR 1467, we want to accept
8230 'new auto { 2 }' too. */
8235 {
8237 "initialization of new-expression for type %<auto%> "
8240 }
8241 else
8242 {
8243 /* Construct a location e.g.:
8244 ptr = new int[100]
8245 ^~~~~~~~~~~~
8246 with caret == start at the start of the "new" token, and the end
8247 at the end of the final token we consumed. */
8252 /* Create a representation of the new-expression. */
8254 tf_warning_or_error);
8256 }
8264 }
8266 /* Parse a new-placement.
8268 new-placement:
8269 ( expression-list )
8271 Returns the same representation as for an expression-list. */
8275 {
8278 /* Parse the expression-list. */
8279 expression_list = (cp_parser_parenthesized_expression_list
8288 }
8290 /* Parse a new-type-id.
8292 new-type-id:
8293 type-specifier-seq new-declarator [opt]
8295 Returns the TYPE allocated. If the new-type-id indicates an array
8296 type, *NELTS is set to the number of elements in the last array
8297 bound; the TYPE will not include the last array bound. */
8299 static tree
8301 {
8302 cp_decl_specifier_seq type_specifier_seq;
8308 /* The type-specifier sequence must not contain type definitions.
8309 (It cannot contain declarations of new types either, but if they
8310 are not definitions we will catch that because they are not
8311 complete.) */
8313 parser->type_definition_forbidden_message
8315 /* Parse the type-specifier-seq. */
8319 /* Restore the old message. */
8325 /* Parse the new-declarator. */
8328 /* Determine the number of elements in the last array dimension, if
8329 any. */
8331 /* Skip down to the last array dimension. */
8336 {
8339 }
8344 {
8347 }
8350 {
8357 else
8359 }
8362 }
8364 /* Parse an (optional) new-declarator.
8366 new-declarator:
8367 ptr-operator new-declarator [opt]
8368 direct-new-declarator
8370 Returns the declarator. */
8374 {
8377 cp_cv_quals cv_quals;
8379 /* We don't know if there's a ptr-operator next, or not. */
8381 /* Look for a ptr-operator. */
8383 /* If that worked, look for more new-declarators. */
8385 {
8388 /* Parse another optional declarator. */
8391 declarator = cp_parser_make_indirect_declarator
8395 }
8397 /* If the next token is a `[', there is a direct-new-declarator. */
8402 }
8404 /* Parse a direct-new-declarator.
8406 direct-new-declarator:
8407 [ expression ]
8408 direct-new-declarator [constant-expression]
8410 */
8414 {
8418 {
8419 tree expression;
8422 /* Look for the opening `['. */
8427 /* The standard requires that the expression have integral
8428 type. DR 74 adds enumeration types. We believe that the
8429 real intent is that these expressions be handled like the
8430 expression in a `switch' condition, which also allows
8431 classes with a single conversion to integral or
8432 enumeration type. */
8434 {
8435 expression
8437 expression,
8440 {
8442 "expression in new-declarator must have integral "
8445 }
8446 }
8448 /* Look for the closing `]'. */
8451 /* Add this bound to the declarator. */
8454 /* If the next token is not a `[', then there are no more
8455 bounds. */
8458 }
8461 }
8463 /* Parse a new-initializer.
8465 new-initializer:
8466 ( expression-list [opt] )
8467 braced-init-list
8469 Returns a representation of the expression-list. */
8473 {
8477 {
8478 tree t;
8485 }
8486 else
8487 expression_list = (cp_parser_parenthesized_expression_list
8493 }
8495 /* Parse a delete-expression.
8497 delete-expression:
8498 :: [opt] delete cast-expression
8499 :: [opt] delete [ ] cast-expression
8501 Returns a representation of the expression. */
8503 static tree
8505 {
8508 tree expression;
8510 /* Look for the optional `::' operator. */
8511 global_scope_p
8515 /* Look for the `delete' keyword. */
8517 /* See if the array syntax is in use. */
8519 {
8520 /* Consume the `[' token. */
8522 /* Look for the `]' token. */
8524 /* Remember that this is the `[]' construct. */
8526 }
8527 else
8530 /* Parse the cast-expression. */
8533 /* A delete-expression may not appear in an integral constant
8534 expression. */
8539 tf_warning_or_error);
8540 }
8542 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8543 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8544 0 otherwise. */
8546 static int
8548 {
8551 {
8593 /* In ((type ()) () the last () isn't a valid cast-expression,
8594 so the whole must be parsed as postfix-expression. */
8599 /* '[' may start a primary-expression in obj-c++ and in C++11,
8600 as a lambda-expression, eg, '(void)[]{}'. */
8607 /* '++' and '--' may or may not start a cast-expression:
8609 struct T { void operator++(int); };
8610 void f() { (T())++; }
8612 vs
8614 int a;
8615 (int)++a; */
8620 }
8621 }
8623 /* Parse a cast-expression.
8625 cast-expression:
8626 unary-expression
8627 ( type-id ) cast-expression
8629 ADDRESS_P is true iff the unary-expression is appearing as the
8630 operand of the `&' operator. CAST_P is true if this expression is
8631 the target of a cast.
8633 Returns a representation of the expression. */
8635 static cp_expr
8638 {
8639 /* If it's a `(', then we might be looking at a cast. */
8641 {
8647 /* There's no way to know yet whether or not this is a cast.
8648 For example, `(int (3))' is a unary-expression, while `(int)
8649 3' is a cast. So, we resort to parsing tentatively. */
8651 /* Types may not be defined in a cast. */
8653 parser->type_definition_forbidden_message
8655 /* Consume the `('. */
8659 /* A very tricky bit is that `(struct S) { 3 }' is a
8660 compound-literal (which we permit in C++ as an extension).
8661 But, that construct is not a cast-expression -- it is a
8662 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8663 is legal; if the compound-literal were a cast-expression,
8664 you'd need an extra set of parentheses.) But, if we parse
8665 the type-id, and it happens to be a class-specifier, then we
8666 will commit to the parse at that point, because we cannot
8667 undo the action that is done when creating a new class. So,
8668 then we cannot back up and do a postfix-expression.
8670 Another tricky case is the following (c++/29234):
8672 struct S { void operator () (); };
8674 void foo ()
8675 {
8676 ( S()() );
8677 }
8679 As a type-id we parse the parenthesized S()() as a function
8680 returning a function, groktypename complains and we cannot
8681 back up in this case either.
8683 Therefore, we scan ahead to the closing `)', and check to see
8684 if the tokens after the `)' can start a cast-expression. Otherwise
8685 we are dealing with an unary-expression, a postfix-expression
8686 or something else.
8688 Yet another tricky case, in C++11, is the following (c++/54891):
8690 (void)[]{};
8692 The issue is that usually, besides the case of lambda-expressions,
8693 the parenthesized type-id cannot be followed by '[', and, eg, we
8694 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8695 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8696 we don't commit, we try a cast-expression, then an unary-expression.
8698 Save tokens so that we can put them back. */
8701 /* We may be looking at a cast-expression. */
8704 cast_expression
8707 /* Roll back the tokens we skipped. */
8709 /* If we aren't looking at a cast-expression, simulate an error so
8710 that the call to cp_parser_error_occurred below returns true. */
8713 else
8714 {
8717 /* Look for the type-id. */
8719 /* Look for the closing `)'. */
8722 }
8724 /* Restore the saved message. */
8727 /* At this point this can only be either a cast or a
8728 parenthesized ctor such as `(T ())' that looks like a cast to
8729 function returning T. */
8731 {
8732 /* Only commit if the cast-expression doesn't start with
8733 '++', '--', or '[' in C++11. */
8741 pidk);
8744 {
8745 /* Warn about old-style casts, if so requested. */
8752 /* Only type conversions to integral or enumeration types
8753 can be used in constant-expressions. */
8756 NIC_CAST))
8759 /* Perform the cast. */
8760 /* Make a location:
8761 (TYPE) EXPR
8762 ^~~~~~~~~~~
8763 with start==caret at the open paren, extending to the
8764 end of "expr". */
8766 open_paren_loc,
8770 }
8771 }
8772 else
8774 }
8776 /* If we get here, then it's not a cast, so it must be a
8777 unary-expression. */
8780 }
8782 /* Parse a binary expression of the general form:
8784 pm-expression:
8785 cast-expression
8786 pm-expression .* cast-expression
8787 pm-expression ->* cast-expression
8789 multiplicative-expression:
8790 pm-expression
8791 multiplicative-expression * pm-expression
8792 multiplicative-expression / pm-expression
8793 multiplicative-expression % pm-expression
8795 additive-expression:
8796 multiplicative-expression
8797 additive-expression + multiplicative-expression
8798 additive-expression - multiplicative-expression
8800 shift-expression:
8801 additive-expression
8802 shift-expression << additive-expression
8803 shift-expression >> additive-expression
8805 relational-expression:
8806 shift-expression
8807 relational-expression < shift-expression
8808 relational-expression > shift-expression
8809 relational-expression <= shift-expression
8810 relational-expression >= shift-expression
8812 GNU Extension:
8814 relational-expression:
8815 relational-expression <? shift-expression
8816 relational-expression >? shift-expression
8818 equality-expression:
8819 relational-expression
8820 equality-expression == relational-expression
8821 equality-expression != relational-expression
8823 and-expression:
8824 equality-expression
8825 and-expression & equality-expression
8827 exclusive-or-expression:
8828 and-expression
8829 exclusive-or-expression ^ and-expression
8831 inclusive-or-expression:
8832 exclusive-or-expression
8833 inclusive-or-expression | exclusive-or-expression
8835 logical-and-expression:
8836 inclusive-or-expression
8837 logical-and-expression && inclusive-or-expression
8839 logical-or-expression:
8840 logical-and-expression
8841 logical-or-expression || logical-and-expression
8843 All these are implemented with a single function like:
8845 binary-expression:
8846 simple-cast-expression
8847 binary-expression <token> binary-expression
8849 CAST_P is true if this expression is the target of a cast.
8851 The binops_by_token map is used to get the tree codes for each <token> type.
8852 binary-expressions are associated according to a precedence table. */
8854 #define TOKEN_PRECEDENCE(token) \
8855 (((token->type == CPP_GREATER \
8856 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8857 && !parser->greater_than_is_operator_p) \
8858 ? PREC_NOT_OPERATOR \
8859 : binops_by_token[token->type].prec)
8861 static cp_expr
8867 {
8868 cp_parser_expression_stack stack;
8870 cp_parser_expression_stack_entry current;
8871 cp_expr rhs;
8875 tree overload;
8877 /* Parse the first expression. */
8888 {
8889 /* Get an operator token. */
8895 {
8897 "%<>>%> operator is treated"
8901 }
8906 /* This is a fold-expression; handle it later. */
8909 /* Popping an entry off the stack means we completed a subexpression:
8910 - either we found a token which is not an operator (`>' where it is not
8911 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8912 will happen repeatedly;
8913 - or, we found an operator which has lower priority. This is the case
8914 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8915 parsing `3 * 4'. */
8917 {
8920 else
8922 }
8924 get_rhs:
8928 /* We used the operator token. */
8931 /* For "false && x" or "true || x", x will never be executed;
8932 disable warnings while evaluating it. */
8934 c_inhibit_evaluation_warnings +=
8937 c_inhibit_evaluation_warnings +=
8940 /* Extract another operand. It may be the RHS of this expression
8941 or the LHS of a new, higher priority expression. */
8946 /* Get another operator token. Look up its precedence to avoid
8947 building a useless (immediately popped) stack entry for common
8948 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8955 {
8956 /* ... and prepare to parse the RHS of the new, higher priority
8957 expression. Since precedence levels on the stack are
8958 monotonically increasing, we do not have to care about
8959 stack overflows. */
8968 pop:
8970 /* If the stack is not empty, we have parsed into LHS the right side
8971 (`4' in the example above) of an expression we had suspended.
8972 We can use the information on the stack to recover the LHS (`3')
8973 from the stack together with the tree code (`MULT_EXPR'), and
8974 the precedence of the higher level subexpression
8975 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8976 which will be used to actually build the additive expression. */
8981 }
8983 /* Undo the disabling of warnings done above. */
8985 c_inhibit_evaluation_warnings -=
8988 c_inhibit_evaluation_warnings -=
8994 /* Avoid warning for !!x == y. */
8999 /* Avoid warning for !b == y where b is boolean. */
9003 /* Avoid warning for !!b == y where b is boolean. */
9016 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9017 ERROR_MARK for everything that is not a binary expression.
9018 This makes warn_about_parentheses miss some warnings that
9019 involve unary operators. For unary expressions we should
9020 pass the correct tree_code unless the unary expression was
9021 surrounded by parentheses.
9022 */
9029 == tcc_comparison
9032 else
9033 {
9038 /* TODO: build_x_binary_op doesn't always honor the location. */
9040 }
9043 /* If the binary operator required the use of an overloaded operator,
9044 then this expression cannot be an integral constant-expression.
9045 An overloaded operator can be used even if both operands are
9046 otherwise permissible in an integral constant-expression if at
9047 least one of the operands is of enumeration type. */
9051 NIC_OVERLOADED))
9053 }
9056 }
9058 static cp_expr
9063 {
9066 }
9068 /* Parse the `? expression : assignment-expression' part of a
9069 conditional-expression. The LOGICAL_OR_EXPR is the
9070 logical-or-expression that started the conditional-expression.
9071 Returns a representation of the entire conditional-expression.
9073 This routine is used by cp_parser_assignment_expression.
9075 ? expression : assignment-expression
9077 GNU Extensions:
9079 ? : assignment-expression */
9081 static tree
9083 {
9085 cp_expr assignment_expr;
9089 /* Consume the `?' token. */
9094 {
9097 /* Implicit true clause. */
9099 c_inhibit_evaluation_warnings +=
9102 }
9103 else
9104 {
9107 /* Parse the expression. */
9108 c_inhibit_evaluation_warnings +=
9111 c_inhibit_evaluation_warnings +=
9115 }
9117 /* The next token should be a `:'. */
9119 /* Parse the assignment-expression. */
9121 c_inhibit_evaluation_warnings -=
9124 /* Make a location:
9125 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9126 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9127 with the caret at the "?", ranging from the start of
9128 the logical_or_expr to the end of the assignment_expr. */
9133 /* Build the conditional-expression. */
9135 expr,
9136 assignment_expr,
9137 tf_warning_or_error);
9138 }
9140 /* Parse an assignment-expression.
9142 assignment-expression:
9143 conditional-expression
9144 logical-or-expression assignment-operator assignment_expression
9145 throw-expression
9147 CAST_P is true if this expression is the target of a cast.
9148 DECLTYPE_P is true if this expression is the operand of decltype.
9150 Returns a representation for the expression. */
9152 static cp_expr
9155 {
9156 cp_expr expr;
9158 /* If the next token is the `throw' keyword, then we're looking at
9159 a throw-expression. */
9162 /* Otherwise, it must be that we are looking at a
9163 logical-or-expression. */
9164 else
9165 {
9166 /* Parse the binary expressions (logical-or-expression). */
9168 decltype_p,
9170 /* If the next token is a `?' then we're actually looking at a
9171 conditional-expression. */
9174 else
9175 {
9178 /* If it's an assignment-operator, we're using the second
9179 production. */
9180 enum tree_code assignment_operator
9183 {
9186 /* Parse the right-hand side of the assignment. */
9193 /* An assignment may not appear in a
9194 constant-expression. */
9196 NIC_ASSIGNMENT))
9198 /* Build the assignment expression. Its default
9199 location:
9200 LHS = RHS
9201 ~~~~^~~~~
9202 is the location of the '=' token as the
9203 caret, ranging from the start of the lhs to the
9204 end of the rhs. */
9209 assignment_operator,
9210 rhs,
9212 /* TODO: build_x_modify_expr doesn't honor the location,
9213 so we must set it here. */
9215 }
9216 }
9217 }
9220 }
9222 /* Parse an (optional) assignment-operator.
9224 assignment-operator: one of
9225 = *= /= %= += -= >>= <<= &= ^= |=
9227 GNU Extension:
9229 assignment-operator: one of
9230 <?= >?=
9232 If the next token is an assignment operator, the corresponding tree
9233 code is returned, and the token is consumed. For example, for
9234 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9235 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9236 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9237 operator, ERROR_MARK is returned. */
9239 static enum tree_code
9241 {
9245 /* Peek at the next token. */
9249 {
9295 /* Nothing else is an assignment operator. */
9297 }
9299 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9304 /* If it was an assignment operator, consume it. */
9309 }
9311 /* Parse an expression.
9313 expression:
9314 assignment-expression
9315 expression , assignment-expression
9317 CAST_P is true if this expression is the target of a cast.
9318 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9319 except possibly parenthesized or on the RHS of a comma (N3276).
9321 Returns a representation of the expression. */
9323 static cp_expr
9326 {
9331 {
9332 cp_expr assignment_expression;
9334 /* Parse the next assignment-expression. */
9335 assignment_expression
9338 /* We don't create a temporary for a call that is the immediate operand
9339 of decltype or on the RHS of a comma. But when we see a comma, we
9340 need to create a temporary for a call on the LHS. */
9345 assignment_expression
9349 /* If this is the first assignment-expression, we can just
9350 save it away. */
9353 else
9354 {
9355 /* Create a location with caret at the comma, ranging
9356 from the start of the LHS to the end of the RHS. */
9361 assignment_expression,
9364 }
9365 /* If the next token is not a comma, or we're in a fold-expression, then
9366 we are done with the expression. */
9370 /* Consume the `,'. */
9373 /* A comma operator cannot appear in a constant-expression. */
9376 }
9379 }
9381 /* Parse a constant-expression.
9383 constant-expression:
9384 conditional-expression
9386 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9387 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9388 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9389 is false, NON_CONSTANT_P should be NULL. */
9391 static cp_expr
9395 {
9399 cp_expr expression;
9401 /* It might seem that we could simply parse the
9402 conditional-expression, and then check to see if it were
9403 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9404 one that the compiler can figure out is constant, possibly after
9405 doing some simplifications or optimizations. The standard has a
9406 precise definition of constant-expression, and we must honor
9407 that, even though it is somewhat more restrictive.
9409 For example:
9411 int i[(2, 3)];
9413 is not a legal declaration, because `(2, 3)' is not a
9414 constant-expression. The `,' operator is forbidden in a
9415 constant-expression. However, GCC's constant-folding machinery
9416 will fold this operation to an INTEGER_CST for `3'. */
9418 /* Save the old settings. */
9420 saved_allow_non_integral_constant_expression_p
9423 /* We are now parsing a constant-expression. */
9425 parser->allow_non_integral_constant_expression_p
9428 /* Although the grammar says "conditional-expression", we parse an
9429 "assignment-expression", which also permits "throw-expression"
9430 and the use of assignment operators. In the case that
9431 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9432 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9433 actually essential that we look for an assignment-expression.
9434 For example, cp_parser_initializer_clauses uses this function to
9435 determine whether a particular assignment-expression is in fact
9436 constant. */
9438 /* Restore the old settings. */
9439 parser->integral_constant_expression_p
9441 parser->allow_non_integral_constant_expression_p
9444 {
9445 /* Require an rvalue constant expression here; that's what our
9446 callers expect. Reference constant expressions are handled
9447 separately in e.g. cp_parser_template_argument. */
9452 }
9455 parser->non_integral_constant_expression_p
9459 }
9461 /* Parse __builtin_offsetof.
9463 offsetof-expression:
9464 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9466 offsetof-member-designator:
9467 id-expression
9468 | offsetof-member-designator "." id-expression
9469 | offsetof-member-designator "[" expression "]"
9470 | offsetof-member-designator "->" id-expression */
9472 static cp_expr
9474 {
9476 tree type;
9477 cp_expr expr;
9478 cp_id_kind dummy;
9480 location_t finish_loc;
9482 /* We're about to accept non-integral-constant things, but will
9483 definitely yield an integral constant expression. Save and
9484 restore these values around our local parsing. */
9490 /* Consume the "__builtin_offsetof" token. */
9492 /* Consume the opening `('. */
9494 /* Parse the type-id. */
9497 /* Look for the `,'. */
9501 /* Build the (type *)null that begins the traditional offsetof macro. */
9502 tree object_ptr
9504 tf_warning_or_error);
9506 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9510 {
9513 {
9515 /* offsetof-member-designator "[" expression "]" */
9521 /* offsetof-member-designator "->" identifier */
9524 /* FALLTHRU */
9527 /* offsetof-member-designator "." identifier */
9535 /* Consume the ")" token. */
9541 /* Error. We know the following require will fail, but
9542 that gives the proper error message. */
9547 }
9548 }
9550 success:
9551 /* Make a location of the form:
9552 __builtin_offsetof (struct s, f)
9553 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9554 with caret at the type-id, ranging from the start of the
9555 "_builtin_offsetof" token to the close paren. */
9557 /* The result will be an INTEGER_CST, so we need to explicitly
9558 preserve the location. */
9561 failure:
9566 }
9568 /* Parse a trait expression.
9570 Returns a representation of the expression, the underlying type
9571 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9573 static tree
9575 {
9576 cp_trait_kind kind;
9582 {
9673 }
9675 /* Consume the token. */
9680 {
9683 }
9689 {
9692 {
9695 }
9699 }
9701 {
9703 {
9707 {
9710 }
9714 }
9715 }
9719 /* Complete the trait expression, which may mean either processing
9720 the trait expr now or saving it for template instantiation. */
9722 {
9731 }
9732 }
9734 /* Lambdas that appear in variable initializer or default argument scope
9735 get that in their mangling, so we need to record it. We might as well
9736 use the count for function and namespace scopes as well. */
9740 {
9741 tree t;
9743 };
9746 static void
9748 {
9749 tree_int ti;
9751 /* Once we're inside a function, we ignore other scopes and just push
9752 the function again so that popping works properly. */
9759 {
9760 /* Don't reset the count if we're still in the same function. */
9763 }
9764 }
9766 static void
9768 {
9771 }
9773 static void
9775 {
9778 {
9781 }
9783 }
9785 /* Parse a lambda expression.
9787 lambda-expression:
9788 lambda-introducer lambda-declarator [opt] compound-statement
9790 Returns a representation of the expression. */
9792 static cp_expr
9794 {
9796 tree type;
9804 {
9806 {
9810 }
9812 }
9814 {
9816 {
9819 }
9821 }
9823 /* We may be in the middle of deferred access check. Disable
9824 it now. */
9835 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9838 /* Now that we've started the type, add the capture fields for any
9839 explicit captures. */
9842 {
9843 /* Inside the class, surrounding template-parameter-lists do not apply. */
9844 unsigned int saved_num_template_parameter_lists
9848 bool fully_implicit_function_template_p
9852 bool auto_is_implicit_function_template_parm_p
9863 /* By virtue of defining a local class, a lambda expression has access to
9864 the private variables of enclosing classes. */
9872 {
9877 }
9879 {
9882 }
9884 /* The capture list was built up in reverse order; fix that now. */
9896 parser->fully_implicit_function_template_p
9900 parser->auto_is_implicit_function_template_parm_p
9902 }
9904 /* This field is only used during parsing of the lambda. */
9907 /* This lambda shouldn't have any proxies left at this point. */
9909 /* And now that we're done, push proxies for an enclosing lambda. */
9914 else
9922 }
9924 /* Parse the beginning of a lambda expression.
9926 lambda-introducer:
9927 [ lambda-capture [opt] ]
9929 LAMBDA_EXPR is the current representation of the lambda expression. */
9931 static void
9933 {
9934 /* Need commas after the first capture. */
9937 /* Eat the leading `['. */
9940 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9948 {
9951 }
9954 {
9956 tree capture_id;
9957 tree capture_init_expr;
9961 enum capture_kind_type
9962 {
9963 BY_COPY,
9964 BY_REFERENCE
9965 };
9969 {
9972 }
9976 else
9979 /* Possibly capture `this'. */
9981 {
9991 explicit_init_p);
9993 }
9995 /* Possibly capture `*this'. */
9998 {
10009 explicit_init_p);
10011 }
10013 /* Remember whether we want to capture as a reference or not. */
10015 {
10018 }
10020 /* Get the identifier. */
10025 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10026 delimiters, but I modified this to stop on unnested ']' as well. It
10027 was already changed to stop on unnested '}', so the
10028 "closing_parenthesis" name is no more misleading with my change. */
10029 {
10035 }
10037 /* Find the initializer for this capture. */
10041 {
10043 /* An explicit initializer exists. */
10046 "lambda capture initializers "
10052 {
10055 }
10056 }
10057 else
10058 {
10061 /* Turn the identifier into an id-expression. */
10062 capture_init_expr
10067 {
10070 }
10074 {
10077 capture_init_expr);
10081 }
10084 {
10087 capture_init_expr))
10091 }
10093 capture_init_expr
10094 = finish_id_expression
10096 capture_init_expr,
10110 {
10113 }
10114 else
10116 }
10120 {
10125 capture_id);
10129 "capture of %qD redundant with by-reference capture "
10131 }
10134 capture_id,
10135 capture_init_expr,
10137 explicit_init_p);
10138 }
10141 }
10143 /* Parse the (optional) middle of a lambda expression.
10145 lambda-declarator:
10146 < template-parameter-list [opt] >
10147 ( parameter-declaration-clause [opt] )
10148 attribute-specifier [opt]
10149 decl-specifier-seq [opt]
10150 exception-specification [opt]
10151 lambda-return-type-clause [opt]
10153 LAMBDA_EXPR is the current representation of the lambda expression. */
10155 static bool
10157 {
10158 /* 5.1.1.4 of the standard says:
10159 If a lambda-expression does not include a lambda-declarator, it is as if
10160 the lambda-declarator were ().
10161 This means an empty parameter list, no attributes, and no exception
10162 specification. */
10168 cp_decl_specifier_seq lambda_specs;
10171 /* The template-parameter-list is optional, but must begin with
10172 an opening angle if present. */
10174 {
10177 "lambda templates are only available with "
10179 else
10189 /* We just processed one more parameter list. */
10191 }
10193 /* The parameter-declaration-clause is optional (unless
10194 template-parameter-list was given), but must begin with an
10195 opening parenthesis if present. */
10197 {
10202 /* Parse parameters. */
10205 /* Default arguments shall not be specified in the
10206 parameter-declaration-clause of a lambda-declarator. */
10217 /* In the decl-specifier-seq of the lambda-declarator, each
10218 decl-specifier shall either be mutable or constexpr. */
10222 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10225 {
10230 }
10234 /* Parse optional exception specification. */
10237 /* Parse optional trailing return type. */
10239 {
10243 }
10245 /* The function parameters must be in scope all the way until after the
10246 trailing-return-type in case of decltype. */
10248 }
10252 /* Create the function call operator.
10254 Messing with declarators like this is no uglier than building up the
10255 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10256 other code. */
10257 {
10258 cp_decl_specifier_seq return_type_specs;
10260 tree fco;
10267 else
10268 /* Maybe we will deduce the return type later. */
10272 {
10276 else
10279 }
10284 sfk_none);
10289 VIRT_SPEC_UNSPECIFIED,
10290 REF_QUAL_NONE,
10291 tx_qual,
10292 exception_spec,
10298 declarator,
10299 attributes);
10301 {
10304 /* Give the object parameter a different name. */
10308 }
10310 {
10314 }
10323 }
10324 }
10326 /* Parse the body of a lambda expression, which is simply
10328 compound-statement
10330 but which requires special handling.
10331 LAMBDA_EXPR is the current representation of the lambda expression. */
10333 static void
10335 {
10340 else
10341 /* Still increment function_depth so that we don't GC in the
10342 middle of an expression. */
10346 /* Clear this in case we're in the middle of a default argument. */
10349 /* Finish the function call operator
10350 - class_specifier
10351 + late_parsing_for_member
10352 + function_definition_after_declarator
10353 + ctor_initializer_opt_and_function_body */
10354 {
10356 tree body;
10358 tree compound_stmt;
10359 tree cap;
10361 /* Let the front end know that we are going to be defining this
10362 function. */
10364 NULL_TREE,
10373 /* Push the proxies for any explicit captures. */
10380 /* 5.1.1.4 of the standard says:
10381 If a lambda-expression does not include a trailing-return-type, it
10382 is as if the trailing-return-type denotes the following type:
10383 * if the compound-statement is of the form
10384 { return attribute-specifier [opt] expression ; }
10385 the type of the returned expression after lvalue-to-rvalue
10386 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10387 (_conv.array_ 4.2), and function-to-pointer conversion
10388 (_conv.func_ 4.3);
10389 * otherwise, void. */
10391 /* In a lambda that has neither a lambda-return-type-clause
10392 nor a deducible form, errors should be reported for return statements
10393 in the body. Since we used void as the placeholder return type, parsing
10394 the body as usual will give such desired behavior. */
10398 {
10402 /* Parse tentatively in case there's more after the initial return
10403 statement. */
10414 {
10416 {
10421 }
10423 /* Will get error here if type not deduced yet. */
10427 }
10428 }
10431 {
10436 }
10440 out:
10444 /* Finish the function and generate code for it if necessary. */
10447 /* Only expand if the call op is not a template. */
10450 }
10456 else
10458 }
10460 /* Statements [gram.stmt.stmt] */
10462 /* Parse a statement.
10464 statement:
10465 labeled-statement
10466 expression-statement
10467 compound-statement
10468 selection-statement
10469 iteration-statement
10470 jump-statement
10471 declaration-statement
10472 try-block
10474 C++11:
10476 statement:
10477 labeled-statement
10478 attribute-specifier-seq (opt) expression-statement
10479 attribute-specifier-seq (opt) compound-statement
10480 attribute-specifier-seq (opt) selection-statement
10481 attribute-specifier-seq (opt) iteration-statement
10482 attribute-specifier-seq (opt) jump-statement
10483 declaration-statement
10484 attribute-specifier-seq (opt) try-block
10486 init-statement:
10487 expression-statement
10488 simple-declaration
10490 TM Extension:
10492 statement:
10493 atomic-statement
10495 IN_COMPOUND is true when the statement is nested inside a
10496 cp_parser_compound_statement; this matters for certain pragmas.
10498 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10499 is a (possibly labeled) if statement which is not enclosed in braces
10500 and has an else clause. This is used to implement -Wparentheses.
10502 CHAIN is a vector of if-else-if conditions. */
10504 static void
10507 {
10512 restart:
10515 /* There is no statement yet. */
10521 /* In obj-c++, seeing '[[' might be the either the beginning of
10522 c++11 attributes, or a nested objc-message-expression. So
10523 let's parse the c++11 attributes tentatively. */
10527 {
10530 }
10532 /* Peek at the next token. */
10534 /* Remember the location of the first token in the statement. */
10536 /* If this is a keyword, then that will often determine what kind of
10537 statement we have. */
10539 {
10543 {
10546 /* Looks like a labeled-statement with a case label.
10547 Parse the label, and then use tail recursion to parse
10548 the statement. */
10566 {
10571 }
10572 else
10586 {
10591 }
10592 else
10593 {
10597 }
10601 /* Objective-C++ exception-handling constructs. */
10615 /* This must be a namespace alias definition. */
10631 /* It might be a keyword like `int' that can start a
10632 declaration-statement. */
10634 }
10635 }
10637 {
10638 /* If the next token is a `:', then we are looking at a
10639 labeled-statement. */
10642 {
10643 /* Looks like a labeled-statement with an ordinary label.
10644 Parse the label, and then use tail recursion to parse
10645 the statement. */
10650 }
10651 }
10652 /* Anything that starts with a `{' must be a compound-statement. */
10655 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10656 a statement all its own. */
10658 {
10659 /* Only certain OpenMP pragmas are attached to statements, and thus
10660 are considered statements themselves. All others are not. In
10661 the context of a compound, accept the pragma as a "statement" and
10662 return so that we can check for a close brace. Otherwise we
10663 require a real statement and must go back and read one. */
10669 }
10671 {
10674 }
10676 /* Everything else must be a declaration-statement or an
10677 expression-statement. Try for the declaration-statement
10678 first, unless we are looking at a `;', in which case we know that
10679 we have an expression-statement. */
10681 {
10683 {
10685 {
10686 /* Attributes should be parsed as part of the the
10687 declaration, so let's un-parse them. */
10690 }
10693 /* Try to parse the declaration-statement. */
10695 /* If that worked, we're done. */
10698 }
10699 /* Look for an expression-statement instead. */
10702 /* Handle [[fallthrough]];. */
10704 {
10705 /* The next token after the fallthrough attribute is ';'. */
10707 {
10708 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10710 IFN_FALLTHROUGH,
10713 }
10714 else
10718 }
10719 }
10721 /* Set the line number for the statement. */
10725 /* Allow "[[fallthrough]];", but warn otherwise. */
10728 OPT_Wattributes,
10730 }
10732 /* Parse the label for a labeled-statement, i.e.
10734 identifier :
10735 case constant-expression :
10736 default :
10738 GNU Extension:
10739 case constant-expression ... constant-expression : statement
10741 When a label is parsed without errors, the label is added to the
10742 parse tree by the finish_* functions, so this function doesn't
10743 have to return the label. */
10745 static void
10747 {
10752 /* The next token should be an identifier. */
10756 {
10759 }
10761 /* Remember whether this case or a user-defined label is allowed to fall
10762 through to. */
10767 {
10769 {
10773 /* Consume the `case' token. */
10775 /* Parse the constant-expression. */
10782 {
10783 /* Consume the `...' token. */
10789 /* We don't need to emit warnings here, as the common code
10790 will do this for us. */
10791 }
10792 else
10796 {
10800 }
10801 else
10804 expr);
10805 }
10809 /* Consume the `default' token. */
10813 {
10817 }
10818 else
10823 /* Anything else must be an ordinary label. */
10828 }
10830 /* Require the `:' token. */
10833 /* An ordinary label may optionally be followed by attributes.
10834 However, this is only permitted if the attributes are then
10835 followed by a semicolon. This is because, for backward
10836 compatibility, when parsing
10837 lab: __attribute__ ((unused)) int i;
10838 we want the attribute to attach to "i", not "lab". */
10841 {
10842 tree attrs;
10849 ;
10850 else
10852 }
10858 }
10860 /* Parse an expression-statement.
10862 expression-statement:
10863 expression [opt] ;
10865 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10866 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10867 indicates whether this expression-statement is part of an
10868 expression statement. */
10870 static tree
10872 {
10877 /* There might be attribute fallthrough. */
10880 /* If the next token is a ';', then there is no expression
10881 statement. */
10883 {
10887 {
10890 }
10891 }
10893 /* Handle [[fallthrough]];. */
10895 {
10896 /* The next token after the fallthrough attribute is ';'. */
10898 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10901 else
10905 }
10907 /* Allow "[[fallthrough]];", but warn otherwise. */
10912 /* Give a helpful message for "A<T>::type t;" and the like. */
10915 {
10922 {
10923 /* A::A a; */
10928 }
10929 }
10931 /* Consume the final `;'. */
10936 /* This is the final expression statement of a statement
10937 expression. */
10943 }
10945 /* Parse a compound-statement.
10947 compound-statement:
10948 { statement-seq [opt] }
10950 GNU extension:
10952 compound-statement:
10953 { label-declaration-seq [opt] statement-seq [opt] }
10955 label-declaration-seq:
10956 label-declaration
10957 label-declaration-seq label-declaration
10959 Returns a tree representing the statement. */
10961 static tree
10964 {
10965 tree compound_stmt;
10967 /* Consume the `{'. */
10974 /* Begin the compound-statement. */
10976 /* If the next keyword is `__label__' we have a label declaration. */
10979 /* Parse an (optional) statement-seq. */
10981 /* Finish the compound-statement. */
10983 /* Consume the `}'. */
10987 }
10989 /* Parse an (optional) statement-seq.
10991 statement-seq:
10992 statement
10993 statement-seq [opt] statement */
10995 static void
10997 {
10998 /* Scan statements until there aren't any more. */
11000 {
11003 /* If we are looking at a `}', then we have run out of
11004 statements; the same is true if we have reached the end
11005 of file, or have stumbled upon a stray '@end'. */
11012 /* If we are in a compound statement and find 'else' then
11013 something went wrong. */
11015 {
11018 else
11019 {
11022 }
11023 }
11025 /* Parse the statement. */
11027 }
11028 }
11030 /* Return true if we're looking at (init; cond), false otherwise. */
11032 static bool
11034 {
11035 /* Save tokens so that we can put them back. */
11038 /* Look for ';' that is not nested in () or {}. */
11041 CPP_SEMICOLON,
11044 /* Roll back the tokens we skipped. */
11048 }
11050 /* Parse a selection-statement.
11052 selection-statement:
11053 if ( init-statement [opt] condition ) statement
11054 if ( init-statement [opt] condition ) statement else statement
11055 switch ( init-statement [opt] condition ) statement
11057 Returns the new IF_STMT or SWITCH_STMT.
11059 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11060 is a (possibly labeled) if statement which is not enclosed in
11061 braces and has an else clause. This is used to implement
11062 -Wparentheses.
11064 CHAIN is a vector of if-else-if conditions. This is used to implement
11065 -Wduplicated-cond. */
11067 static tree
11070 {
11073 token_indent_info guard_tinfo;
11078 /* Peek at the next token. */
11082 /* See what kind of keyword it is. */
11085 {
11088 {
11089 tree statement;
11090 tree condition;
11095 RID_CONSTEXPR))
11096 {
11102 }
11104 /* Look for the `('. */
11106 {
11109 }
11111 /* Begin the selection-statement. */
11113 {
11116 }
11117 else
11120 /* Parse the optional init-statement. */
11122 {
11123 tree decl;
11126 "init-statement in selection statements only available "
11129 }
11131 /* Parse the condition. */
11133 /* Look for the `)'. */
11139 {
11143 /* Add the condition. */
11150 /* Parse the then-clause. */
11154 /* Outside a template, the non-selected branch of a constexpr
11155 if is a 'discarded statement', i.e. unevaluated. */
11160 {
11163 }
11166 guard_tinfo);
11173 {
11177 }
11179 /* If the next token is `else', parse the else-clause. */
11181 RID_ELSE))
11182 {
11186 {
11189 }
11191 guard_tinfo
11193 /* Consume the `else' keyword. */
11196 {
11198 RID_IF)
11200 {
11201 /* We've got "if (COND) else if (COND2)". Start
11202 the condition chain and add COND as the first
11203 element. */
11207 {
11208 /* Wrap it in a NOP_EXPR so that we can set the
11209 location of the condition. */
11211 condition);
11214 }
11215 }
11217 RID_IF))
11218 {
11219 /* This is if-else without subsequent if. Zap the
11220 condition chain; we would have already warned at
11221 this point. */
11224 }
11225 }
11227 /* Parse the else-clause. */
11233 /* If we are currently parsing a then-clause, then
11234 IF_P will not be NULL. We set it to true to
11235 indicate that this if statement has an else clause.
11236 This may trigger the Wparentheses warning below
11237 when we get back up to the parent if statement. */
11242 {
11246 }
11247 }
11248 else
11249 {
11250 /* This if statement does not have an else clause. If
11251 NESTED_IF is true, then the then-clause has an if
11252 statement which does have an else clause. We warn
11253 about the potential ambiguity. */
11256 "suggest explicit braces to avoid ambiguous"
11259 {
11260 /* We don't need the condition chain anymore. */
11263 }
11264 }
11266 /* Now we're all done with the if-statement. */
11268 }
11269 else
11270 {
11274 /* Add the condition. */
11277 /* Parse the body of the switch-statement. */
11283 guard_tinfo);
11287 /* Now we're all done with the switch-statement. */
11289 }
11292 }
11298 }
11299 }
11301 /* Parse a condition.
11303 condition:
11304 expression
11305 type-specifier-seq declarator = initializer-clause
11306 type-specifier-seq declarator braced-init-list
11308 GNU Extension:
11310 condition:
11311 type-specifier-seq declarator asm-specification [opt]
11312 attributes [opt] = assignment-expression
11314 Returns the expression that should be tested. */
11316 static tree
11318 {
11319 cp_decl_specifier_seq type_specifiers;
11323 /* Try the declaration first. */
11325 /* New types are not allowed in the type-specifier-seq for a
11326 condition. */
11328 parser->type_definition_forbidden_message
11330 /* Parse the type-specifier-seq. */
11332 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11335 /* Restore the saved message. */
11337 /* If all is well, we might be looking at a declaration. */
11339 {
11340 tree decl;
11341 tree asm_specification;
11342 tree attributes;
11346 /* Parse the declarator. */
11352 /* Parse the attributes. */
11354 /* Parse the asm-specification. */
11356 /* If the next token is not an `=' or '{', then we might still be
11357 looking at an expression. For example:
11359 if (A(a).x)
11361 looks like a decl-specifier-seq and a declarator -- but then
11362 there is no `=', so this is an expression. */
11367 /* If we did see an `=' or '{', then we are looking at a declaration
11368 for sure. */
11370 {
11371 tree pushed_scope;
11375 /* Create the declaration. */
11381 /* Parse the initializer. */
11383 {
11387 }
11388 else
11389 {
11390 /* Consume the `='. */
11393 }
11397 /* Process the initializer. */
11400 asm_specification,
11401 flags);
11407 }
11408 }
11409 /* If we didn't even get past the declarator successfully, we are
11410 definitely not looking at a declaration. */
11411 else
11414 /* Otherwise, we are looking at an expression. */
11416 }
11418 /* Parses a for-statement or range-for-statement until the closing ')',
11419 not included. */
11421 static tree
11423 {
11427 /* Begin the for-statement. */
11430 /* Parse the initialization. */
11435 else
11437 }
11439 static tree
11441 {
11442 /* Normal for loop */
11445 tree stmt;
11448 /* The init-statement has already been parsed in
11449 cp_parser_init_statement, so no work is needed here. */
11452 /* If there's a condition, process it. */
11456 {
11460 }
11462 /* Look for the `;'. */
11465 /* If there's an expression, process it. */
11471 }
11473 /* Tries to parse a range-based for-statement:
11475 range-based-for:
11476 decl-specifier-seq declarator : expression
11478 The decl-specifier-seq declarator and the `:' are already parsed by
11479 cp_parser_init_statement. If processing_template_decl it returns a
11480 newly created RANGE_FOR_STMT; if not, it is converted to a
11481 regular FOR_STMT. */
11483 static tree
11486 {
11493 /* Get the range declaration momentarily out of the way so that
11494 the range expression doesn't clash with it. */
11496 {
11498 {
11500 /* For decomposition declaration get all of the corresponding
11501 declarations out of the way. */
11505 {
11511 {
11517 }
11518 }
11519 }
11521 {
11526 }
11527 }
11530 {
11533 }
11534 else
11537 /* Put the range declaration(s) back into scope. */
11539 {
11543 }
11545 /* If in template, STMT is converted to a normal for-statement
11546 at instantiation. If not, it is done just ahead. */
11548 {
11556 /* do_auto_deduction doesn't mess with template init-lists. */
11559 }
11560 else
11561 {
11565 }
11567 }
11569 /* Subroutine of cp_convert_range_for: given the initializer expression,
11570 builds up the range temporary. */
11572 static tree
11574 {
11577 /* Find out the type deduced by the declaration
11578 `auto &&__range = range_expr'. */
11583 /* Create the __range variable. */
11590 }
11592 /* Used by cp_parser_range_for in template context: we aren't going to
11593 do a full conversion yet, but we still need to resolve auto in the
11594 type of the for-range-declaration if present. This is basically
11595 a shortcut version of cp_convert_range_for. */
11597 static void
11599 {
11602 {
11605 iter_type = (cp_parser_perform_range_for_lookup
11608 {
11610 iter_type);
11612 tf_warning_or_error);
11615 }
11616 }
11617 }
11619 /* Converts a range-based for-statement into a normal
11620 for-statement, as per the definition.
11622 for (RANGE_DECL : RANGE_EXPR)
11623 BLOCK
11625 should be equivalent to:
11627 {
11628 auto &&__range = RANGE_EXPR;
11629 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11630 __begin != __end;
11631 ++__begin)
11632 {
11633 RANGE_DECL = *__begin;
11634 BLOCK
11635 }
11636 }
11638 If RANGE_EXPR is an array:
11639 BEGIN_EXPR = __range
11640 END_EXPR = __range + ARRAY_SIZE(__range)
11641 Else if RANGE_EXPR has a member 'begin' or 'end':
11642 BEGIN_EXPR = __range.begin()
11643 END_EXPR = __range.end()
11644 Else:
11645 BEGIN_EXPR = begin(__range)
11646 END_EXPR = end(__range);
11648 If __range has a member 'begin' but not 'end', or vice versa, we must
11649 still use the second alternative (it will surely fail, however).
11650 When calling begin()/end() in the third alternative we must use
11651 argument dependent lookup, but always considering 'std' as an associated
11652 namespace. */
11654 tree
11658 {
11664 /* If an error happened previously do nothing or else a lot of
11665 unhelpful errors would be issued. */
11667 else
11668 {
11669 tree range_temp;
11673 /* Can't bind a reference to an array of runtime bound. */
11675 else
11676 {
11681 LOOKUP_ONLYCONVERTING);
11683 }
11686 }
11688 /* The new for initialization statement. */
11696 LOOKUP_ONLYCONVERTING);
11707 LOOKUP_ONLYCONVERTING);
11711 /* The new for condition. */
11718 /* The new increment expression. */
11721 tf_warning_or_error);
11724 /* The declaration is initialized with *__begin inside the loop body. */
11727 tf_warning_or_error),
11729 LOOKUP_ONLYCONVERTING);
11734 }
11736 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11737 We need to solve both at the same time because the method used
11738 depends on the existence of members begin or end.
11739 Returns the type deduced for the iterator expression. */
11741 static tree
11743 {
11745 {
11748 }
11751 {
11756 }
11758 {
11759 /* If RANGE is an array, we will use pointer arithmetic. */
11762 range,
11766 }
11767 else
11768 {
11769 /* If it is not an array, we must do a bit of magic. */
11779 tf_warning_or_error);
11782 tf_warning_or_error);
11785 {
11786 /* Use the member functions. */
11789 else
11795 else
11798 }
11799 else
11800 {
11801 /* Use global functions with ADL. */
11808 tf_warning_or_error);
11810 tf_warning_or_error);
11812 tf_warning_or_error);
11814 tf_warning_or_error);
11817 }
11819 /* Last common checks. */
11821 {
11822 /* If one of the expressions is an error do no more checks. */
11825 }
11828 /* Can happen, when, eg, in a template context, Koenig lookup
11829 can't resolve begin/end (c++/58503). */
11831 else
11832 {
11834 /* The unqualified type of the __begin and __end temporaries should
11835 be the same, as required by the multiple auto declaration. */
11837 {
11844 /* P0184R0 allows __begin and __end to have different types,
11845 but make sure they are comparable so we can give a better
11847 else
11851 }
11853 }
11854 }
11855 }
11857 /* Helper function for cp_parser_perform_range_for_lookup.
11858 Builds a tree for RANGE.IDENTIFIER(). */
11860 static tree
11862 {
11875 tf_warning_or_error);
11878 }
11880 /* Parse an iteration-statement.
11882 iteration-statement:
11883 while ( condition ) statement
11884 do statement while ( expression ) ;
11885 for ( init-statement condition [opt] ; expression [opt] )
11886 statement
11888 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11890 static tree
11892 {
11895 tree statement;
11897 token_indent_info guard_tinfo;
11899 /* Peek at the next token. */
11906 /* Remember whether or not we are already within an iteration
11907 statement. */
11910 /* See what kind of keyword it is. */
11913 {
11915 {
11916 tree condition;
11918 /* Begin the while-statement. */
11920 /* Look for the `('. */
11922 /* Parse the condition. */
11925 /* Look for the `)'. */
11927 /* Parse the dependent statement. */
11931 /* We're done with the while-statement. */
11933 }
11937 {
11938 tree expression;
11940 /* Begin the do-statement. */
11942 /* Parse the body of the do-statement. */
11947 /* Look for the `while' keyword. */
11949 /* Look for the `('. */
11951 /* Parse the expression. */
11953 /* We're done with the do-statement. */
11955 /* Look for the `)'. */
11957 /* Look for the `;'. */
11959 }
11963 {
11964 /* Look for the `('. */
11969 /* Look for the `)'. */
11972 /* Parse the body of the for-statement. */
11977 /* We're done with the for-statement. */
11979 }
11986 }
11989 }
11991 /* Parse a init-statement or the declarator of a range-based-for.
11992 Returns true if a range-based-for declaration is seen.
11994 init-statement:
11995 expression-statement
11996 simple-declaration */
11998 static bool
12000 {
12001 /* If the next token is a `;', then we have an empty
12002 expression-statement. Grammatically, this is also a
12003 simple-declaration, but an invalid one, because it does not
12004 declare anything. Therefore, if we did not handle this case
12005 specially, we would issue an error message about an invalid
12006 declaration. */
12008 {
12012 /* A colon is used in range-based for. */
12015 /* We're going to speculatively look for a declaration, falling back
12016 to an expression, if necessary. */
12018 /* Parse the declaration. */
12021 decl);
12024 {
12025 /* It is a range-for, consume the ':' */
12029 {
12031 "range-based %<for%> loops only available with "
12034 }
12035 }
12036 else
12037 /* The ';' is not consumed yet because we told
12038 cp_parser_simple_declaration not to. */
12043 /* If the tentative parse failed, then we shall need to look for an
12044 expression-statement. */
12045 }
12046 /* If we are here, it is an expression-statement. */
12049 }
12051 /* Parse a jump-statement.
12053 jump-statement:
12054 break ;
12055 continue ;
12056 return expression [opt] ;
12057 return braced-init-list ;
12058 goto identifier ;
12060 GNU extension:
12062 jump-statement:
12063 goto * expression ;
12065 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12067 static tree
12069 {
12075 /* Peek at the next token. */
12080 /* See what kind of keyword it is. */
12083 {
12087 {
12107 }
12113 {
12120 /* Fall through. */
12130 }
12135 {
12136 tree expr;
12140 {
12144 }
12147 else
12148 /* If the next token is a `;', then there is no
12149 expression. */
12151 /* Build the return-statement. */
12154 else
12156 /* Look for the final `;'. */
12158 }
12164 {
12167 }
12169 /* Create the goto-statement. */
12171 {
12172 /* Issue a warning about this use of a GNU extension. */
12174 /* Consume the '*' token. */
12176 /* Parse the dependent expression. */
12178 }
12179 else
12181 /* Look for the final `;'. */
12188 }
12191 }
12193 /* Parse a declaration-statement.
12195 declaration-statement:
12196 block-declaration */
12198 static void
12200 {
12203 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12206 /* Parse the block-declaration. */
12209 /* Free any declarators allocated. */
12211 }
12213 /* Some dependent statements (like `if (cond) statement'), are
12214 implicitly in their own scope. In other words, if the statement is
12215 a single statement (as opposed to a compound-statement), it is
12216 none-the-less treated as if it were enclosed in braces. Any
12217 declarations appearing in the dependent statement are out of scope
12218 after control passes that point. This function parses a statement,
12219 but ensures that is in its own scope, even if it is not a
12220 compound-statement.
12222 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12223 is a (possibly labeled) if statement which is not enclosed in
12224 braces and has an else clause. This is used to implement
12225 -Wparentheses.
12227 CHAIN is a vector of if-else-if conditions. This is used to implement
12228 -Wduplicated-cond.
12230 Returns the new statement. */
12232 static tree
12236 {
12237 tree statement;
12239 token_indent_info body_tinfo
12245 /* Mark if () ; with a special NOP_EXPR. */
12247 {
12258 }
12259 /* if a compound is opened, we simply parse the statement directly. */
12262 /* If the token is not a `{', then we must take special action. */
12263 else
12264 {
12265 /* Create a compound-statement. */
12267 /* Parse the dependent-statement. */
12269 /* Finish the dummy compound-statement. */
12271 }
12273 token_indent_info next_tinfo
12277 /* Return the statement. */
12279 }
12281 /* For some dependent statements (like `while (cond) statement'), we
12282 have already created a scope. Therefore, even if the dependent
12283 statement is a compound-statement, we do not want to create another
12284 scope. */
12286 static void
12289 {
12290 /* If the token is a `{', then we must take special action. */
12292 {
12293 token_indent_info body_tinfo
12297 token_indent_info next_tinfo
12300 }
12301 else
12302 {
12303 /* Avoid calling cp_parser_compound_statement, so that we
12304 don't create a new scope. Do everything else by hand. */
12306 /* If the next keyword is `__label__' we have a label declaration. */
12309 /* Parse an (optional) statement-seq. */
12312 }
12313 }
12315 /* Declarations [gram.dcl.dcl] */
12317 /* Parse an optional declaration-sequence.
12319 declaration-seq:
12320 declaration
12321 declaration-seq declaration */
12323 static void
12325 {
12327 {
12338 {
12339 /* A declaration consisting of a single semicolon is
12340 invalid. Allow it unless we're being pedantic. */
12345 }
12347 /* If we're entering or exiting a region that's implicitly
12348 extern "C", modify the lang context appropriately. */
12350 {
12353 }
12355 {
12358 }
12361 {
12362 /* A top-level declaration can consist solely of a #pragma.
12363 A nested declaration cannot, so this is done here and not
12364 in cp_parser_declaration. (A #pragma at block scope is
12365 handled in cp_parser_statement.) */
12368 }
12370 /* Parse the declaration itself. */
12372 }
12373 }
12375 /* Parse a declaration.
12377 declaration:
12378 block-declaration
12379 function-definition
12380 template-declaration
12381 explicit-instantiation
12382 explicit-specialization
12383 linkage-specification
12384 namespace-definition
12386 C++17:
12387 deduction-guide
12389 GNU extension:
12391 declaration:
12392 __extension__ declaration */
12394 static void
12396 {
12397 cp_token token1;
12398 cp_token token2;
12403 /* Check for the `__extension__' keyword. */
12405 {
12406 /* Parse the qualified declaration. */
12408 /* Restore the PEDANTIC flag. */
12412 }
12414 /* Try to figure out what kind of declaration is present. */
12419 else
12420 {
12423 }
12425 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12428 /* If the next token is `extern' and the following token is a string
12429 literal, then we have a linkage specification. */
12433 /* If the next token is `template', then we have either a template
12434 declaration, an explicit instantiation, or an explicit
12435 specialization. */
12437 {
12438 /* `template <>' indicates a template specialization. */
12442 /* `template <' indicates a template declaration. */
12445 /* Anything else must be an explicit instantiation. */
12446 else
12448 }
12449 /* If the next token is `export', then we have a template
12450 declaration. */
12453 /* If the next token is `extern', 'static' or 'inline' and the one
12454 after that is `template', we have a GNU extended explicit
12455 instantiation directive. */
12462 /* If the next token is `namespace', check for a named or unnamed
12463 namespace definition. */
12472 /* An unnamed namespace definition. */
12476 /* An inline (associated) namespace definition. */
12480 /* Objective-C++ declaration/definition. */
12487 /* At this point we may have a template declared by a concept
12488 introduction. */
12493 else
12494 /* Try to parse a block-declaration, or a function-definition. */
12497 /* Free any declarators allocated. */
12499 }
12501 /* Parse a block-declaration.
12503 block-declaration:
12504 simple-declaration
12505 asm-definition
12506 namespace-alias-definition
12507 using-declaration
12508 using-directive
12510 GNU Extension:
12512 block-declaration:
12513 __extension__ block-declaration
12515 C++0x Extension:
12517 block-declaration:
12518 static_assert-declaration
12520 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12521 part of a declaration-statement. */
12523 static void
12526 {
12530 /* Check for the `__extension__' keyword. */
12532 {
12533 /* Parse the qualified declaration. */
12535 /* Restore the PEDANTIC flag. */
12539 }
12541 /* Peek at the next token to figure out which kind of declaration is
12542 present. */
12545 /* If the next keyword is `asm', we have an asm-definition. */
12547 {
12551 }
12552 /* If the next keyword is `namespace', we have a
12553 namespace-alias-definition. */
12556 /* If the next keyword is `using', we have a
12557 using-declaration, a using-directive, or an alias-declaration. */
12559 {
12564 /* If the token after `using' is `namespace', then we have a
12565 using-directive. */
12569 /* If the second token after 'using' is '=', then we have an
12570 alias-declaration. */
12576 /* Otherwise, it's a using-declaration. */
12577 else
12580 }
12581 /* If the next keyword is `__label__' we have a misplaced label
12582 declaration. */
12584 {
12588 /* If the next token is now a `;', consume it. */
12591 }
12592 /* If the next token is `static_assert' we have a static assertion. */
12595 /* Anything else must be a simple-declaration. */
12596 else
12599 }
12601 /* Parse a simple-declaration.
12603 simple-declaration:
12604 decl-specifier-seq [opt] init-declarator-list [opt] ;
12605 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12606 brace-or-equal-initializer ;
12608 init-declarator-list:
12609 init-declarator
12610 init-declarator-list , init-declarator
12612 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12613 function-definition as a simple-declaration.
12615 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12616 parsed declaration if it is an uninitialized single declarator not followed
12617 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12618 if present, will not be consumed. */
12620 static void
12624 {
12625 cp_decl_specifier_seq decl_specifiers;
12634 /* Defer access checks until we know what is being declared; the
12635 checks for names appearing in the decl-specifier-seq should be
12636 done as if we were in the scope of the thing being declared. */
12639 /* Parse the decl-specifier-seq. We have to keep track of whether
12640 or not the decl-specifier-seq declares a named class or
12641 enumeration type, since that is the only case in which the
12642 init-declarator-list is allowed to be empty.
12644 [dcl.dcl]
12646 In a simple-declaration, the optional init-declarator-list can be
12647 omitted only when declaring a class or enumeration, that is when
12648 the decl-specifier-seq contains either a class-specifier, an
12649 elaborated-type-specifier, or an enum-specifier. */
12651 CP_PARSER_FLAGS_OPTIONAL,
12654 /* We no longer need to defer access checks. */
12657 /* In a block scope, a valid declaration must always have a
12658 decl-specifier-seq. By not trying to parse declarators, we can
12659 resolve the declaration/expression ambiguity more quickly. */
12662 {
12665 }
12667 /* If the next two tokens are both identifiers, the code is
12668 erroneous. The usual cause of this situation is code like:
12670 T t;
12672 where "T" should name a type -- but does not. */
12675 {
12676 /* If parsing tentatively, we should commit; we really are
12677 looking at a declaration. */
12679 /* Give up. */
12681 }
12683 /* If we have seen at least one decl-specifier, and the next token
12684 is not a parenthesis, then we must be looking at a declaration.
12685 (After "int (" we might be looking at a functional cast.) */
12692 /* Look for C++17 decomposition declaration. */
12700 {
12701 tree decl
12703 maybe_range_for_decl,
12706 /* The next token should be either a `,' or a `;'. */
12708 /* If it's a `;', we are done. */
12711 /* Anything else is an error. */
12712 else
12713 {
12714 /* If we have already issued an error message we don't need
12715 to issue another one. */
12720 /* Skip tokens until we reach the end of the statement. */
12722 /* If the next token is now a `;', consume it. */
12726 }
12727 }
12728 else
12731 tree last_type;
12733 /* NULL_TREE if both variable and function declaration are allowed,
12734 error_mark_node if function declaration are not allowed and
12735 a FUNCTION_DECL that should be diagnosed if it is followed by
12736 variable declarations. */
12737 tree auto_function_declaration;
12740 auto_specifier_p
12744 /* Keep going until we hit the `;' at the end of the simple
12745 declaration. */
12748 CPP_SEMICOLON))
12749 {
12752 tree decl;
12756 {
12757 /* If we are processing next declarator, comma is expected */
12762 {
12766 }
12767 }
12768 else
12771 /* Parse the init-declarator. */
12774 function_definition_allowed_p,
12776 declares_class_or_enum,
12778 maybe_range_for_decl,
12781 /* If an error occurred while parsing tentatively, exit quickly.
12782 (That usually happens when in the body of a function; each
12783 statement is treated as a declaration-statement until proven
12784 otherwise.) */
12789 {
12790 /* If the init-declarator-list contains more than one
12791 init-declarator, they shall all form declarations of
12792 variables. */
12794 auto_function_declaration
12798 {
12800 "non-variable %qD in declaration with more than one "
12805 }
12806 }
12810 {
12814 {
12815 /* If the list of declarators contains more than one declarator,
12816 the type of each declared variable is determined as described
12817 above. If the type deduced for the template parameter U is not
12818 the same in each deduction, the program is ill-formed. */
12823 }
12824 else
12826 }
12828 /* Handle function definitions specially. */
12830 {
12831 /* If the next token is a `,', then we are probably
12832 processing something like:
12834 void f() {}, *p;
12836 which is erroneous. */
12838 {
12841 "mixing"
12843 }
12844 /* Otherwise, we're done with the list of declarators. */
12845 else
12846 {
12849 }
12850 }
12853 /* The next token should be either a `,' or a `;'. */
12855 /* If it's a `,', there are more declarators to come. */
12858 /* If it's a `;', we are done. */
12862 {
12867 }
12868 /* Anything else is an error. */
12869 else
12870 {
12871 /* If we have already issued an error message we don't need
12872 to issue another one. */
12877 /* Skip tokens until we reach the end of the statement. */
12879 /* If the next token is now a `;', consume it. */
12883 }
12884 /* After the first time around, a function-definition is not
12885 allowed -- even if it was OK at first. For example:
12887 int i, f() {}
12889 is not valid. */
12891 }
12893 /* Issue an error message if no declarators are present, and the
12894 decl-specifier-seq does not itself declare a class or
12895 enumeration: [dcl.dcl]/3. */
12897 {
12899 {
12903 /* Ensure an error is issued anyway when finish_decltype_type,
12904 called via cp_parser_decl_specifier_seq, returns a class or
12905 an enumeration (c++/51786). */
12908 }
12909 /* Perform any deferred access checks. */
12911 }
12913 /* Consume the `;'. */
12914 finish:
12918 {
12924 }
12926 done:
12928 }
12930 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
12931 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12932 initializer ; */
12934 static tree
12939 {
12944 /* Parse the identifier-list. */
12948 {
12956 }
12960 {
12966 else
12967 {
12970 }
12971 }
12977 tree pushed_scope;
12984 NULL_TREE);
12991 cp_expr e;
12992 cp_decl_specifier_seq decl_specs;
12997 {
13000 else
13003 tree elt_pushed_scope;
13009 {
13010 /* Ensure we've diagnosed redeclaration if we aren't creating
13011 a new VAR_DECL. */
13014 }
13015 else
13019 }
13022 {
13025 }
13029 {
13036 {
13040 }
13041 }
13043 {
13045 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13046 the underlying DECL. */
13048 }
13054 {
13057 }
13060 }
13062 /* Parse a decl-specifier-seq.
13064 decl-specifier-seq:
13065 decl-specifier-seq [opt] decl-specifier
13066 decl-specifier attribute-specifier-seq [opt] (C++11)
13068 decl-specifier:
13069 storage-class-specifier
13070 type-specifier
13071 function-specifier
13072 friend
13073 typedef
13075 GNU Extension:
13077 decl-specifier:
13078 attributes
13080 Concepts Extension:
13082 decl-specifier:
13083 concept
13085 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13087 The parser flags FLAGS is used to control type-specifier parsing.
13089 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13090 flags:
13092 1: one of the decl-specifiers is an elaborated-type-specifier
13093 (i.e., a type declaration)
13094 2: one of the decl-specifiers is an enum-specifier or a
13095 class-specifier (i.e., a type definition)
13097 */
13099 static void
13101 cp_parser_flags flags,
13104 {
13108 cp_decl_spec ds;
13110 /* Clear DECL_SPECS. */
13113 /* Assume no class or enumeration type is declared. */
13116 /* Keep reading specifiers until there are no more to read. */
13118 {
13123 /* Peek at the next token. */
13126 /* Save the first token of the decl spec list for error
13127 reporting. */
13130 /* Handle attributes. */
13132 {
13133 /* Parse the attributes. */
13136 /* In a sequence of declaration specifiers, c++11 attributes
13137 appertain to the type that precede them. In that case
13138 [dcl.spec]/1 says:
13140 The attribute-specifier-seq affects the type only for
13141 the declaration it appears in, not other declarations
13142 involving the same type.
13144 But for now let's force the user to position the
13145 attribute either at the beginning of the declaration or
13146 after the declarator-id, which would clearly mean that it
13147 applies to the declarator. */
13149 {
13151 /* The c++11 attribute is at the beginning of the
13152 declaration. It appertains to the entity being
13154 else
13155 {
13157 {
13158 /* This is an attribute following a
13159 class-specifier. */
13164 }
13165 else
13166 {
13167 decl_specs->std_attributes
13169 attrs);
13172 }
13174 }
13175 }
13177 decl_specs->attributes
13179 attrs);
13183 }
13184 /* Assume we will find a decl-specifier keyword. */
13186 /* If the next token is an appropriate keyword, we can simply
13187 add it to the list. */
13189 {
13190 /* decl-specifier:
13191 friend
13192 constexpr */
13195 {
13198 }
13199 else
13200 {
13202 /* Consume the token. */
13204 }
13217 /* function-specifier:
13218 inline
13219 virtual
13220 explicit */
13227 /* decl-specifier:
13228 typedef */
13231 /* Consume the token. */
13233 /* A constructor declarator cannot appear in a typedef. */
13235 /* The "typedef" keyword can only occur in a declaration; we
13236 may as well commit at this point. */
13243 /* storage-class-specifier:
13244 auto
13245 register
13246 static
13247 extern
13248 mutable
13250 GNU Extension:
13251 thread */
13254 {
13255 /* Consume the token. */
13258 /* Complain about `auto' as a storage specifier, if
13259 we're complaining about C++0x compatibility. */
13263 /* Set the storage class anyway. */
13265 token);
13266 }
13267 else
13268 /* C++0x auto type-specifier. */
13276 /* Consume the token. */
13279 token);
13282 /* Consume the token. */
13288 /* We did not yet find a decl-specifier yet. */
13291 }
13308 /* Constructors are a special case. The `S' in `S()' is not a
13309 decl-specifier; it is the beginning of the declarator. */
13310 constructor_p
13311 = (!found_decl_spec
13312 && constructor_possible_p
13313 && (cp_parser_constructor_declarator_p
13316 /* If we don't have a DECL_SPEC yet, then we must be looking at
13317 a type-specifier. */
13319 {
13322 tree type_spec;
13324 type_spec
13326 decl_specs,
13332 /* If this type-specifier referenced a user-defined type
13333 (a typedef, class-name, etc.), then we can't allow any
13334 more such type-specifiers henceforth.
13336 [dcl.spec]
13338 The longest sequence of decl-specifiers that could
13339 possibly be a type name is taken as the
13340 decl-specifier-seq of a declaration. The sequence shall
13341 be self-consistent as described below.
13343 [dcl.type]
13345 As a general rule, at most one type-specifier is allowed
13346 in the complete decl-specifier-seq of a declaration. The
13347 only exceptions are the following:
13349 -- const or volatile can be combined with any other
13350 type-specifier.
13352 -- signed or unsigned can be combined with char, long,
13353 short, or int.
13355 -- ..
13357 Example:
13359 typedef char* Pc;
13360 void g (const int Pc);
13362 Here, Pc is *not* part of the decl-specifier seq; it's
13363 the declarator. Therefore, once we see a type-specifier
13364 (other than a cv-qualifier), we forbid any additional
13365 user-defined types. We *do* still allow things like `int
13366 int' to be considered a decl-specifier-seq, and issue the
13367 error message later. */
13370 /* A constructor declarator cannot follow a type-specifier. */
13372 {
13377 }
13378 }
13380 /* If we still do not have a DECL_SPEC, then there are no more
13381 decl-specifiers. */
13386 /* After we see one decl-specifier, further decl-specifiers are
13387 always optional. */
13389 }
13391 /* Don't allow a friend specifier with a class definition. */
13396 }
13398 /* Parse an (optional) storage-class-specifier.
13400 storage-class-specifier:
13401 auto
13402 register
13403 static
13404 extern
13405 mutable
13407 GNU Extension:
13409 storage-class-specifier:
13410 thread
13412 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13414 static tree
13416 {
13418 {
13422 /* Fall through for C++98. */
13430 /* Consume the token. */
13435 }
13436 }
13438 /* Parse an (optional) function-specifier.
13440 function-specifier:
13441 inline
13442 virtual
13443 explicit
13445 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13446 Updates DECL_SPECS, if it is non-NULL. */
13448 static tree
13451 {
13454 {
13460 /* 14.5.2.3 [temp.mem]
13462 A member function template shall not be virtual. */
13466 else
13476 }
13478 /* Consume the token. */
13480 }
13482 /* Parse a linkage-specification.
13484 linkage-specification:
13485 extern string-literal { declaration-seq [opt] }
13486 extern string-literal declaration */
13488 static void
13490 {
13491 tree linkage;
13493 /* Look for the `extern' keyword. */
13496 /* Look for the string-literal. */
13499 /* Transform the literal into an identifier. If the literal is a
13500 wide-character string, or contains embedded NULs, then we can't
13501 handle it as the user wants. */
13504 {
13506 /* Assume C++ linkage. */
13508 }
13509 else
13512 /* We're now using the new linkage. */
13515 /* If the next token is a `{', then we're using the first
13516 production. */
13518 {
13522 /* Consume the `{' token. */
13524 /* Parse the declarations. */
13526 /* Look for the closing `}'. */
13528 }
13529 /* Otherwise, there's just one declaration. */
13530 else
13531 {
13534 saved_in_unbraced_linkage_specification_p
13538 parser->in_unbraced_linkage_specification_p
13540 }
13542 /* We're done with the linkage-specification. */
13544 }
13546 /* Parse a static_assert-declaration.
13548 static_assert-declaration:
13549 static_assert ( constant-expression , string-literal ) ;
13550 static_assert ( constant-expression ) ; (C++1Z)
13552 If MEMBER_P, this static_assert is a class member. */
13554 static void
13556 {
13557 tree condition;
13558 tree message;
13560 location_t saved_loc;
13563 /* Peek at the `static_assert' token so we can keep track of exactly
13564 where the static assertion started. */
13568 /* Look for the `static_assert' keyword. */
13570 RT_STATIC_ASSERT))
13573 /* We know we are in a static assertion; commit to any tentative
13574 parse. */
13578 /* Parse the `(' starting the static assertion condition. */
13581 /* Parse the constant-expression. Allow a non-constant expression
13582 here in order to give better diagnostics in finish_static_assert. */
13583 condition =
13589 {
13592 "static_assert without a message "
13594 /* Eat the ')' */
13599 }
13600 else
13601 {
13602 /* Parse the separating `,'. */
13605 /* Parse the string-literal message. */
13610 /* A `)' completes the static assertion. */
13616 }
13618 /* A semicolon terminates the declaration. */
13621 /* Complete the static assertion, which may mean either processing
13622 the static assert now or saving it for template instantiation. */
13624 }
13626 /* Parse the expression in decltype ( expression ). */
13628 static tree
13631 {
13633 tree expr;
13635 /* Since we're going to preserve any side-effects from this parse, set up a
13636 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13637 in the expression. */
13640 /* First, try parsing an id-expression. */
13651 {
13654 cp_id_kind idk;
13658 /* Lookup the name we got back from the id-expression. */
13668 {
13669 /* Complete lookup of the id-expression. */
13670 expr = (finish_id_expression
13683 /* We found an id-expression, but it was something that we
13684 should not have found. This is an error, not something
13685 we can recover from, so note that we found an
13686 id-expression and we'll recover as gracefully as
13687 possible. */
13689 }
13694 /* We have an id-expression. */
13696 }
13699 {
13700 /* Abort the id-expression parse. */
13703 /* Parsing tentatively, again. */
13706 /* Parse a class member access. */
13714 /* We have an id-expression. */
13716 }
13719 /* We have parsed the complete id-expression or member access. */
13721 else
13722 {
13723 /* Abort our attempt to parse an id-expression or member access
13724 expression. */
13727 /* Parse a full expression. */
13730 }
13733 }
13735 /* Parse a `decltype' type. Returns the type.
13737 simple-type-specifier:
13738 decltype ( expression )
13739 C++14 proposal:
13740 decltype ( auto ) */
13742 static tree
13744 {
13745 tree expr;
13754 {
13755 /* Already parsed. */
13758 }
13760 /* Look for the `decltype' token. */
13764 /* Parse the opening `('. */
13768 /* decltype (auto) */
13771 {
13778 }
13780 /* Types cannot be defined in a `decltype' expression. Save away the
13781 old message. */
13784 /* And create the new one. */
13785 parser->type_definition_forbidden_message
13788 /* The restrictions on constant-expressions do not apply inside
13789 decltype expressions. */
13790 saved_integral_constant_expression_p
13792 saved_non_integral_constant_expression_p
13796 /* Within a parenthesized expression, a `>' token is always
13797 the greater-than operator. */
13798 saved_greater_than_is_operator_p
13802 /* Do not actually evaluate the expression. */
13805 /* Do not warn about problems with the expression. */
13810 /* Go back to evaluating expressions. */
13814 /* The `>' token might be the end of a template-id or
13815 template-parameter-list now. */
13816 parser->greater_than_is_operator_p
13819 /* Restore the old message and the integral constant expression
13820 flags. */
13822 parser->integral_constant_expression_p
13824 parser->non_integral_constant_expression_p
13827 /* Parse to the closing `)'. */
13829 {
13833 }
13836 tf_warning_or_error);
13838 rewrite:
13839 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13840 it again. */
13849 }
13851 /* Special member functions [gram.special] */
13853 /* Parse a conversion-function-id.
13855 conversion-function-id:
13856 operator conversion-type-id
13858 Returns an IDENTIFIER_NODE representing the operator. */
13860 static tree
13862 {
13863 tree type;
13864 tree saved_scope;
13865 tree saved_qualifying_scope;
13866 tree saved_object_scope;
13869 /* Look for the `operator' token. */
13872 /* When we parse the conversion-type-id, the current scope will be
13873 reset. However, we need that information in able to look up the
13874 conversion function later, so we save it here. */
13878 /* We must enter the scope of the class so that the names of
13879 entities declared within the class are available in the
13880 conversion-type-id. For example, consider:
13882 struct S {
13883 typedef int I;
13884 operator I();
13885 };
13887 S::operator I() { ... }
13889 In order to see that `I' is a type-name in the definition, we
13890 must be in the scope of `S'. */
13893 /* Parse the conversion-type-id. */
13895 /* Leave the scope of the class, if any. */
13898 /* Restore the saved scope. */
13902 /* If the TYPE is invalid, indicate failure. */
13906 }
13908 /* Parse a conversion-type-id:
13910 conversion-type-id:
13911 type-specifier-seq conversion-declarator [opt]
13913 Returns the TYPE specified. */
13915 static tree
13917 {
13918 tree attributes;
13919 cp_decl_specifier_seq type_specifiers;
13921 tree type_specified;
13924 /* Parse the attributes. */
13928 parser->type_definition_forbidden_message
13931 /* Parse the type-specifiers. */
13938 /* If that didn't work, stop. */
13941 /* Parse the conversion-declarator. */
13949 /* Don't give this error when parsing tentatively. This happens to
13950 work because we always parse this definitively once. */
13953 {
13955 {
13958 }
13962 }
13965 }
13967 /* Parse an (optional) conversion-declarator.
13969 conversion-declarator:
13970 ptr-operator conversion-declarator [opt]
13972 */
13976 {
13979 cp_cv_quals cv_quals;
13981 /* We don't know if there's a ptr-operator next, or not. */
13983 /* Try the ptr-operator. */
13986 /* If it worked, look for more conversion-declarators. */
13988 {
13991 /* Parse another optional declarator. */
13994 declarator = cp_parser_make_indirect_declarator
13998 }
14001 }
14003 /* Parse an (optional) ctor-initializer.
14005 ctor-initializer:
14006 : mem-initializer-list
14008 Returns TRUE iff the ctor-initializer was actually present. */
14010 static bool
14012 {
14013 /* If the next token is not a `:', then there is no
14014 ctor-initializer. */
14016 {
14017 /* Do default initialization of any bases and members. */
14022 }
14024 /* Consume the `:' token. */
14026 /* And the mem-initializer-list. */
14030 }
14032 /* Parse a mem-initializer-list.
14034 mem-initializer-list:
14035 mem-initializer ... [opt]
14036 mem-initializer ... [opt] , mem-initializer-list */
14038 static void
14040 {
14045 /* Let the semantic analysis code know that we are starting the
14046 mem-initializer-list. */
14051 /* Loop through the list. */
14053 {
14054 tree mem_initializer;
14057 /* Parse the mem-initializer. */
14059 /* If the next token is a `...', we're expanding member initializers. */
14061 {
14062 /* Consume the `...'. */
14065 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14066 can be expanded but members cannot. */
14069 {
14074 }
14076 /* Construct the pack expansion type. */
14079 }
14082 {
14086 }
14087 /* Look for a target constructor. */
14091 {
14094 {
14098 }
14100 }
14101 /* Add it to the list, unless it was erroneous. */
14103 {
14106 }
14107 /* If the next token is not a `,', we're done. */
14110 /* Consume the `,' token. */
14112 }
14114 /* Perform semantic analysis. */
14117 }
14119 /* Parse a mem-initializer.
14121 mem-initializer:
14122 mem-initializer-id ( expression-list [opt] )
14123 mem-initializer-id braced-init-list
14125 GNU extension:
14127 mem-initializer:
14128 ( expression-list [opt] )
14130 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14131 class) or FIELD_DECL (for a non-static data member) to initialize;
14132 the TREE_VALUE is the expression-list. An empty initialization
14133 list is represented by void_list_node. */
14135 static tree
14137 {
14138 tree mem_initializer_id;
14139 tree expression_list;
14140 tree member;
14143 /* Find out what is being initialized. */
14145 {
14149 }
14150 else
14151 {
14155 }
14161 {
14168 }
14169 else
14170 {
14180 }
14190 }
14192 /* Parse a mem-initializer-id.
14194 mem-initializer-id:
14195 :: [opt] nested-name-specifier [opt] class-name
14196 decltype-specifier (C++11)
14197 identifier
14199 Returns a TYPE indicating the class to be initialized for the first
14200 production (and the second in C++11). Returns an IDENTIFIER_NODE
14201 indicating the data member to be initialized for the last production. */
14203 static tree
14205 {
14209 tree id;
14213 /* `typename' is not allowed in this context ([temp.res]). */
14215 {
14217 "keyword %<typename%> not allowed in this context (a qualified "
14220 }
14221 /* Look for the optional `::' operator. */
14222 global_scope_p
14226 /* Look for the optional nested-name-specifier. The simplest way to
14227 implement:
14229 [temp.res]
14231 The keyword `typename' is not permitted in a base-specifier or
14232 mem-initializer; in these contexts a qualified name that
14233 depends on a template-parameter is implicitly assumed to be a
14234 type name.
14236 is to assume that we have seen the `typename' keyword at this
14237 point. */
14238 nested_name_specifier_p
14247 /* If there is a `::' operator or a nested-name-specifier, then we
14248 are definitely looking for a class-name. */
14253 typename_type,
14257 /* Otherwise, we could also be looking for an ordinary identifier. */
14260 /* Try a decltype-specifier. */
14262 else
14263 /* Otherwise, try a class-name. */
14267 none_type,
14271 /* If we found one, we're done. */
14274 /* Otherwise, look for an ordinary identifier. */
14276 }
14278 /* Overloading [gram.over] */
14280 /* Parse an operator-function-id.
14282 operator-function-id:
14283 operator operator
14285 Returns an IDENTIFIER_NODE for the operator which is a
14286 human-readable spelling of the identifier, e.g., `operator +'. */
14288 static cp_expr
14290 {
14291 /* Look for the `operator' keyword. */
14294 /* And then the name of the operator itself. */
14296 }
14298 /* Return an identifier node for a user-defined literal operator.
14299 The suffix identifier is chained to the operator name identifier. */
14301 tree
14303 {
14304 tree identifier;
14311 }
14313 /* Parse an operator.
14315 operator:
14316 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14317 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14318 || ++ -- , ->* -> () []
14320 GNU Extensions:
14322 operator:
14323 <? >? <?= >?=
14325 Returns an IDENTIFIER_NODE for the operator which is a
14326 human-readable spelling of the identifier, e.g., `operator +'. */
14328 static cp_expr
14330 {
14335 /* Peek at the next token. */
14340 /* Figure out which operator we have. */
14342 {
14344 {
14347 /* The keyword should be either `new' or `delete'. */
14352 else
14355 /* Consume the `new' or `delete' token. */
14358 /* Peek at the next token. */
14360 /* If it's a `[' token then this is the array variant of the
14361 operator. */
14363 {
14364 /* Consume the `[' token. */
14366 /* Look for the `]' token. */
14372 }
14373 /* Otherwise, we have the non-array variant. */
14374 else
14380 }
14527 /* Consume the `('. */
14529 /* Look for the matching `)'. */
14534 /* Consume the `['. */
14536 /* Look for the matching `]'. */
14543 /* FALLTHRU */
14552 {
14559 /* Consume the string. */
14565 {
14568 }
14569 else
14570 {
14572 /* Look for the suffix identifier. */
14577 {
14581 }
14582 else
14583 {
14586 }
14587 }
14592 {
14595 }
14598 {
14601 }
14603 {
14606 }
14608 }
14611 /* Anything else is an error. */
14613 }
14615 /* If we have selected an identifier, we need to consume the
14616 operator token. */
14619 /* Otherwise, no valid operator name was present. */
14620 else
14621 {
14624 }
14627 }
14629 /* Parse a template-declaration.
14631 template-declaration:
14632 export [opt] template < template-parameter-list > declaration
14634 If MEMBER_P is TRUE, this template-declaration occurs within a
14635 class-specifier.
14637 The grammar rule given by the standard isn't correct. What
14638 is really meant is:
14640 template-declaration:
14641 export [opt] template-parameter-list-seq
14642 decl-specifier-seq [opt] init-declarator [opt] ;
14643 export [opt] template-parameter-list-seq
14644 function-definition
14646 template-parameter-list-seq:
14647 template-parameter-list-seq [opt]
14648 template < template-parameter-list >
14650 Concept Extensions:
14652 template-parameter-list-seq:
14653 template < template-parameter-list > requires-clause [opt]
14655 requires-clause:
14656 requires logical-or-expression */
14658 static void
14660 {
14661 /* Check for `export'. */
14663 {
14664 /* Consume the `export' token. */
14666 /* Warn that we do not support `export'. */
14668 }
14671 }
14673 /* Parse a template-parameter-list.
14675 template-parameter-list:
14676 template-parameter
14677 template-parameter-list , template-parameter
14679 Returns a TREE_LIST. Each node represents a template parameter.
14680 The nodes are connected via their TREE_CHAINs. */
14682 static tree
14684 {
14689 /* The loop below parses the template parms. We first need to know
14690 the total number of template parms to be able to compute proper
14691 canonical types of each dependent type. So after the loop, when
14692 we know the total number of template parms,
14693 end_template_parm_list computes the proper canonical types and
14694 fixes up the dependent types accordingly. */
14696 {
14697 tree parameter;
14700 location_t parm_loc;
14702 /* Parse the template-parameter. */
14707 /* Add it to the list. */
14710 parm_loc,
14711 parameter,
14712 is_non_type,
14713 is_parameter_pack);
14714 else
14715 {
14718 }
14720 /* If the next token is not a `,', we're done. */
14723 /* Otherwise, consume the `,' token. */
14725 }
14728 }
14730 /* Parse a introduction-list.
14732 introduction-list:
14733 introduced-parameter
14734 introduction-list , introduced-parameter
14736 introduced-parameter:
14737 ...[opt] identifier
14739 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14740 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14741 WILDCARD_DECL will also have DECL_NAME set and token location in
14742 DECL_SOURCE_LOCATION. */
14744 static tree
14746 {
14750 {
14755 /* Build placeholder. */
14763 /* If the next token is not a `,', we're done. */
14766 /* Otherwise, consume the `,' token. */
14768 }
14770 /* Convert the vec into a TREE_VEC. */
14773 tree parm;
14779 }
14781 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14782 is an abstract declarator. */
14786 {
14791 }
14793 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14794 is an abstract declarator. */
14798 {
14802 else
14804 }
14806 /* Returns true if DECL represents a constrained-parameter. */
14810 {
14815 }
14817 /* Returns true if PARM declares a constrained-parameter. */
14821 {
14823 }
14825 /* Check that the type parameter is only a declarator-id, and that its
14826 type is not cv-qualified. */
14828 bool
14831 {
14836 {
14839 }
14841 /* Don't allow cv-qualified type parameters. */
14844 {
14847 }
14850 }
14852 /* Finish parsing/processing a template type parameter and checking
14853 various restrictions. */
14857 tree id,
14859 {
14862 else
14864 }
14866 static tree
14868 {
14869 /* FIXME: This should probably be copied, and we may need to adjust
14870 the template parameter depths. */
14880 }
14882 /* Finish parsing/processing a template template parameter by borrowing
14883 the template parameter list from the prototype parameter. */
14885 static tree
14887 tree proto,
14888 tree id,
14890 {
14894 }
14896 /* Create a new non-type template parameter from the given PARM
14897 declarator. */
14899 static tree
14902 {
14908 }
14910 /* Build a constrained template parameter based on the PARMDECL
14911 declarator. The type of PARMDECL is the constrained type, which
14912 refers to the prototype template parameter that ultimately
14913 specifies the type of the declared parameter. */
14915 static tree
14920 {
14926 /* A template parameter constrained by a variadic concept shall also
14927 be declared as a template parameter pack. */
14932 /* Build the parameter. Return an error if the declarator was invalid. */
14933 tree parm;
14938 parmdecl);
14939 else
14944 /* Finish the parameter decl and create a node attaching the
14945 default argument and constraint. */
14950 }
14952 /* Returns true if the parsed type actually represents the declaration
14953 of a type template-parameter. */
14957 {
14960 }
14963 /* Returns true if the parsed type actually represents the declaration of
14964 a template template-parameter. */
14966 static bool
14968 {
14971 }
14973 /* Parse a default argument for a type template-parameter.
14974 Note that diagnostics are handled in cp_parser_template_parameter. */
14976 static tree
14978 {
14981 /* Consume the `=' token. */
14986 /* Parse the default-argument. */
14992 {
14996 }
14999 }
15001 /* Parse a default argument for a template template-parameter. */
15003 static tree
15005 {
15010 /* Consume the `='. */
15012 /* Parse the id-expression. */
15014 /* save token before parsing the id-expression, for error
15015 reporting */
15017 tree default_argument
15025 /* If the id-expression was a template-id that refers to
15026 a template-class, we already have the declaration here,
15027 so no further lookup is needed. */
15028 ;
15029 else
15030 /* Look up the name. */
15031 default_argument
15033 none_type,
15039 /* See if the default argument is valid. */
15043 }
15045 /* Parse a template-parameter.
15047 template-parameter:
15048 type-parameter
15049 parameter-declaration
15051 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15052 the parameter. The TREE_PURPOSE is the default value, if any.
15053 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15054 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15055 set to true iff this parameter is a parameter pack. */
15057 static tree
15060 {
15063 tree parm;
15065 /* Assume it is a type parameter or a template parameter. */
15067 /* Assume it not a parameter pack. */
15069 /* Peek at the next token. */
15071 /* If it is `class' or `template', we have a type-parameter. */
15074 /* If it is `class' or `typename' we do not know yet whether it is a
15075 type parameter or a non-type parameter. Consider:
15077 template <typename T, typename T::X X> ...
15079 or:
15081 template <class C, class D*> ...
15083 Here, the first parameter is a type parameter, and the second is
15084 a non-type parameter. We can tell by looking at the token after
15085 the identifier -- if it is a `,', `=', or `>' then we have a type
15086 parameter. */
15088 {
15089 /* Peek at the token after `class' or `typename'. */
15091 /* If it's an ellipsis, we have a template type parameter
15092 pack. */
15095 /* If it's an identifier, skip it. */
15098 /* Now, see if the token looks like the end of a template
15099 parameter. */
15104 }
15106 /* Otherwise, it is a non-type parameter or a constrained parameter.
15108 [temp.param]
15110 When parsing a default template-argument for a non-type
15111 template-parameter, the first non-nested `>' is taken as the end
15112 of the template parameter-list rather than a greater-than
15113 operator. */
15114 parameter_declarator
15121 /* If the parameter declaration is marked as a parameter pack, set
15122 *IS_PARAMETER_PACK to notify the caller. */
15127 {
15128 /* Can happen in some cases of erroneous input (c++/34892). */
15130 /* Consume the `...' for better error recovery. */
15132 }
15134 // The parameter may have been constrained.
15137 parameter_declarator,
15138 is_non_type,
15139 is_parameter_pack);
15141 // Now we're sure that the parameter is a non-type parameter.
15152 }
15154 /* Parse a type-parameter.
15156 type-parameter:
15157 class identifier [opt]
15158 class identifier [opt] = type-id
15159 typename identifier [opt]
15160 typename identifier [opt] = type-id
15161 template < template-parameter-list > class identifier [opt]
15162 template < template-parameter-list > class identifier [opt]
15163 = id-expression
15165 GNU Extension (variadic templates):
15167 type-parameter:
15168 class ... identifier [opt]
15169 typename ... identifier [opt]
15171 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15172 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15173 the declaration of the parameter.
15175 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15177 static tree
15179 {
15181 tree parameter;
15183 /* Look for a keyword to tell us what kind of parameter this is. */
15189 {
15192 {
15193 tree identifier;
15194 tree default_argument;
15196 /* If the next token is an ellipsis, we have a template
15197 argument pack. */
15199 {
15200 /* Consume the `...' token. */
15205 }
15207 /* If the next token is an identifier, then it names the
15208 parameter. */
15211 else
15214 /* Create the parameter. */
15217 /* If the next token is an `=', we have a default argument. */
15219 {
15220 default_argument
15223 /* Template parameter packs cannot have default
15224 arguments. */
15226 {
15229 "template parameter pack %qD cannot have a "
15231 else
15233 "template parameter packs cannot have "
15236 }
15239 }
15240 else
15243 /* Create the combined representation of the parameter and the
15244 default argument. */
15246 }
15250 {
15251 tree identifier;
15252 tree default_argument;
15254 /* Look for the `<'. */
15256 /* Parse the template-parameter-list. */
15258 /* Look for the `>'. */
15261 // If template requirements are present, parse them.
15263 {
15268 }
15270 /* Look for the `class' or 'typename' keywords. */
15272 /* If the next token is an ellipsis, we have a template
15273 argument pack. */
15275 {
15276 /* Consume the `...' token. */
15281 }
15282 /* If the next token is an `=', then there is a
15283 default-argument. If the next token is a `>', we are at
15284 the end of the parameter-list. If the next token is a `,',
15285 then we are at the end of this parameter. */
15289 {
15291 /* Treat invalid names as if the parameter were nameless. */
15294 }
15295 else
15298 /* Create the template parameter. */
15300 identifier);
15302 /* If the next token is an `=', then there is a
15303 default-argument. */
15305 {
15306 default_argument
15309 /* Template parameter packs cannot have default
15310 arguments. */
15312 {
15315 "template parameter pack %qD cannot "
15317 identifier);
15318 else
15322 }
15323 }
15324 else
15327 /* Create the combined representation of the parameter and the
15328 default argument. */
15330 }
15336 }
15339 }
15341 /* Parse a template-id.
15343 template-id:
15344 template-name < template-argument-list [opt] >
15346 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15347 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15348 returned. Otherwise, if the template-name names a function, or set
15349 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15350 names a class, returns a TYPE_DECL for the specialization.
15352 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15353 uninstantiated templates. */
15355 static tree
15361 {
15362 tree templ;
15363 tree arguments;
15364 tree template_id;
15369 /* If the next token corresponds to a template-id, there is no need
15370 to reparse it. */
15373 {
15376 }
15378 /* Avoid performing name lookup if there is no possibility of
15379 finding a template-id. */
15382 && !cp_parser_nth_token_starts_template_argument_list_p
15384 {
15387 }
15389 /* Remember where the template-id starts. */
15395 /* Parse the template-name. */
15398 check_dependency_p,
15399 is_declaration,
15400 tag_type,
15403 {
15406 }
15408 /* Since we're going to preserve any side-effects from this parse, set up a
15409 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15410 in the template arguments. */
15413 /* If we find the sequence `[:' after a template-name, it's probably
15414 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15415 parse correctly the argument list. */
15422 {
15424 /* Change `:' into `::'. */
15426 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15427 CPP_LESS. */
15430 /* Parse the arguments. */
15433 {
15434 /* If we couldn't parse an argument list, then we revert our changes
15435 and return simply an error. Maybe this is not a template-id
15436 after all. */
15441 }
15442 /* Otherwise, emit an error about the invalid digraph, but continue
15443 parsing because we got our argument list. */
15446 {
15449 "%<<:%> is an alternate spelling for %<[%>."
15452 {
15454 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15457 }
15458 }
15459 }
15460 else
15461 {
15462 /* Look for the `<' that starts the template-argument-list. */
15464 {
15467 }
15468 /* Parse the arguments. */
15470 }
15472 /* Build a representation of the specialization. */
15475 TEMPLATE_ID_EXPR,
15479 {
15481 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15482 template (rather than some instantiation thereof) only if
15483 is not nested within some other construct. For example, in
15484 "template <typename T> void f(T) { A<T>::", A<T> is just an
15485 instantiation of A. */
15488 CPP_SCOPE));
15489 template_id
15491 }
15492 /* A template-like identifier may be a partial concept id. */
15498 {
15502 }
15503 else
15504 {
15505 /* If it's not a class-template or a template-template, it should be
15506 a function-template. */
15514 }
15516 /* If parsing tentatively, replace the sequence of tokens that makes
15517 up the template-id with a CPP_TEMPLATE_ID token. That way,
15518 should we re-parse the token stream, we will not have to repeat
15519 the effort required to do the parse, nor will we issue duplicate
15520 error messages about problems during instantiation of the
15521 template. */
15523 /* Don't do this if we had a parse error in a declarator; re-parsing
15524 might succeed if a name changes meaning (60361). */
15528 {
15531 /* Reset the contents of the START_OF_ID token. */
15534 /* Update the location to be of the form:
15535 template-name < template-argument-list [opt] >
15536 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15537 with caret == start at the start of the template-name,
15538 ranging until the closing '>'. */
15539 location_t finish_loc
15541 location_t combined_loc
15545 /* Retrieve any deferred checks. Do not pop this access checks yet
15546 so the memory will not be reclaimed during token replacing below. */
15552 /* Purge all subsequent tokens. */
15555 /* ??? Can we actually assume that, if template_id ==
15556 error_mark_node, we will have issued a diagnostic to the
15557 user, as opposed to simply marking the tentative parse as
15558 failed? */
15561 }
15565 }
15567 /* Parse a template-name.
15569 template-name:
15570 identifier
15572 The standard should actually say:
15574 template-name:
15575 identifier
15576 operator-function-id
15578 A defect report has been filed about this issue.
15580 A conversion-function-id cannot be a template name because they cannot
15581 be part of a template-id. In fact, looking at this code:
15583 a.operator K<int>()
15585 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15586 It is impossible to call a templated conversion-function-id with an
15587 explicit argument list, since the only allowed template parameter is
15588 the type to which it is converting.
15590 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15591 `template' keyword, in a construction like:
15593 T::template f<3>()
15595 In that case `f' is taken to be a template-name, even though there
15596 is no way of knowing for sure.
15598 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15599 name refers to a set of overloaded functions, at least one of which
15600 is a template, or an IDENTIFIER_NODE with the name of the template,
15601 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15602 names are looked up inside uninstantiated templates. */
15604 static tree
15611 {
15612 tree identifier;
15613 tree decl;
15614 tree fns;
15617 /* If the next token is `operator', then we have either an
15618 operator-function-id or a conversion-function-id. */
15620 {
15621 /* We don't know whether we're looking at an
15622 operator-function-id or a conversion-function-id. */
15624 /* Try an operator-function-id. */
15626 /* If that didn't work, try a conversion-function-id. */
15628 {
15631 }
15632 }
15633 /* Look for the identifier. */
15634 else
15637 /* If we didn't find an identifier, we don't have a template-id. */
15641 /* If the name immediately followed the `template' keyword, then it
15642 is a template-name. However, if the next token is not `<', then
15643 we do not treat it as a template-name, since it is not being used
15644 as part of a template-id. This enables us to handle constructs
15645 like:
15647 template <typename T> struct S { S(); };
15648 template <typename T> S<T>::S();
15650 correctly. We would treat `S' as a template -- if it were `S<T>'
15651 -- but we do not if there is no `<'. */
15655 {
15656 /* In a declaration, in a dependent context, we pretend that the
15657 "template" keyword was present in order to improve error
15658 recovery. For example, given:
15660 template <typename T> void f(T::X<int>);
15662 we want to treat "X<int>" as a template-id. */
15664 && !template_keyword_p
15666 && check_dependency_p
15668 /* Do not do this for dtors (or ctors), since they never
15669 need the template keyword before their name. */
15671 {
15674 /* Explain what went wrong. */
15676 identifier);
15679 /* If parsing tentatively, find the location of the "<" token. */
15682 /* Parse the template arguments so that we can issue error
15683 messages about them. */
15686 /* Skip tokens until we find a good place from which to
15687 continue parsing. */
15692 /* If parsing tentatively, permanently remove the
15693 template argument list. That will prevent duplicate
15694 error messages from being issued about the missing
15695 "template" keyword. */
15702 }
15704 /* If the "template" keyword is present, then there is generally
15705 no point in doing name-lookup, so we just return IDENTIFIER.
15706 But, if the qualifying scope is non-dependent then we can
15707 (and must) do name-lookup normally. */
15712 {
15713 /* We're optimizing away the call to cp_parser_lookup_name, but we
15714 still need to do this. */
15717 }
15718 }
15720 /* Look up the name. */
15722 tag_type,
15725 check_dependency_p,
15731 /* If DECL is a template, then the name was a template-name. */
15733 {
15737 }
15738 else
15739 {
15742 /* The standard does not explicitly indicate whether a name that
15743 names a set of overloaded declarations, some of which are
15744 templates, is a template-name. However, such a name should
15745 be a template-name; otherwise, there is no way to form a
15746 template-id for the overloaded templates. */
15754 {
15755 /* The name does not name a template. */
15758 }
15759 }
15761 /* If DECL is dependent, and refers to a function, then just return
15762 its name; we will look it up again during template instantiation. */
15764 {
15768 }
15771 }
15773 /* Parse a template-argument-list.
15775 template-argument-list:
15776 template-argument ... [opt]
15777 template-argument-list , template-argument ... [opt]
15779 Returns a TREE_VEC containing the arguments. */
15781 static tree
15783 {
15788 tree vec;
15795 /* Even if the template-id appears in an integral
15796 constant-expression, the contents of the argument list do
15797 not. */
15803 /* Parse the arguments. */
15804 do
15805 {
15806 tree argument;
15809 /* Consume the comma. */
15812 /* Parse the template-argument. */
15815 /* If the next token is an ellipsis, we're expanding a template
15816 argument pack. */
15818 {
15820 {
15824 }
15825 /* Consume the `...' token. */
15828 /* Make the argument into a TYPE_PACK_EXPANSION or
15829 EXPR_PACK_EXPANSION. */
15831 }
15834 {
15838 {
15841 }
15842 else
15844 }
15846 }
15862 }
15864 /* Parse a template-argument.
15866 template-argument:
15867 assignment-expression
15868 type-id
15869 id-expression
15871 The representation is that of an assignment-expression, type-id, or
15872 id-expression -- except that the qualified id-expression is
15873 evaluated, so that the value returned is either a DECL or an
15874 OVERLOAD.
15876 Although the standard says "assignment-expression", it forbids
15877 throw-expressions or assignments in the template argument.
15878 Therefore, we use "conditional-expression" instead. */
15880 static tree
15882 {
15883 tree argument;
15889 cp_id_kind idk;
15891 /* There's really no way to know what we're looking at, so we just
15892 try each alternative in order.
15894 [temp.arg]
15896 In a template-argument, an ambiguity between a type-id and an
15897 expression is resolved to a type-id, regardless of the form of
15898 the corresponding template-parameter.
15900 Therefore, we try a type-id first. */
15903 /* If there was no error parsing the type-id but the next token is a
15904 '>>', our behavior depends on which dialect of C++ we're
15905 parsing. In C++98, we probably found a typo for '> >'. But there
15906 are type-id which are also valid expressions. For instance:
15908 struct X { int operator >> (int); };
15909 template <int V> struct Foo {};
15910 Foo<X () >> 5> r;
15912 Here 'X()' is a valid type-id of a function type, but the user just
15913 wanted to write the expression "X() >> 5". Thus, we remember that we
15914 found a valid type-id, but we still try to parse the argument as an
15915 expression to see what happens.
15917 In C++0x, the '>>' will be considered two separate '>'
15918 tokens. */
15922 {
15925 }
15926 else
15927 {
15928 /* If the next token isn't a `,' or a `>', then this argument wasn't
15929 really finished. This means that the argument is not a valid
15930 type-id. */
15933 /* If that worked, we're done. */
15936 }
15937 /* We're still not sure what the argument will be. */
15939 /* Try a template. */
15947 /* If the next token isn't a `,' or a `>', then this argument wasn't
15948 really finished. */
15952 {
15953 /* Figure out what is being referred to. If the id-expression
15954 was for a class template specialization, then we will have a
15955 TYPE_DECL at this point. There is no need to do name lookup
15956 at this point in that case. */
15959 none_type,
15965 /* Handle a constrained-type-specifier for a non-type template
15966 parameter. */
15972 }
15974 {
15978 }
15979 /* It must be a non-type argument. In C++17 any constant-expression is
15980 allowed. */
15984 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15986 -- an integral constant-expression of integral or enumeration
15987 type; or
15989 -- the name of a non-type template-parameter; or
15991 -- the name of an object or function with external linkage...
15993 -- the address of an object or function with external linkage...
15995 -- a pointer to member... */
15996 /* Look for a non-type template parameter. */
15998 {
16010 }
16012 /* If the next token is "&", the argument must be the address of an
16013 object or function with external linkage. */
16016 {
16019 }
16020 /* See if we might have an id-expression. */
16027 {
16030 address_p,
16037 else
16038 {
16039 tree probe;
16042 {
16043 /* Strip the dereference temporarily. */
16046 }
16048 /* If we're in a template, we represent a qualified-id referring
16049 to a static data member as a SCOPE_REF even if the scope isn't
16050 dependent so that we can check access control later. */
16055 {
16056 /* A variable without external linkage might still be a
16057 valid constant-expression, so no error is issued here
16058 if the external-linkage check fails. */
16061 }
16063 /* All overloaded functions are allowed; if the external
16064 linkage test does not pass, an error will be issued
16065 later. */
16066 ;
16070 /* A pointer-to-member. */
16071 ;
16073 ;
16074 else
16078 {
16081 tf_warning_or_error);
16082 else
16085 }
16086 }
16087 }
16088 /* If the argument started with "&", there are no other valid
16089 alternatives at this point. */
16091 {
16094 }
16096 general_expr:
16097 /* If the argument wasn't successfully parsed as a type-id followed
16098 by '>>', the argument can only be a constant expression now.
16099 Otherwise, we try parsing the constant-expression tentatively,
16100 because the argument could really be a type-id. */
16106 else
16107 {
16108 /* With C++17 generalized non-type template arguments we need to handle
16109 lvalue constant expressions, too. */
16112 }
16120 /* We did our best to parse the argument as a non type-id, but that
16121 was the only alternative that matched (albeit with a '>' after
16122 it). We can assume it's just a typo from the user, and a
16123 diagnostic will then be issued. */
16125 }
16127 /* Parse an explicit-instantiation.
16129 explicit-instantiation:
16130 template declaration
16132 Although the standard says `declaration', what it really means is:
16134 explicit-instantiation:
16135 template decl-specifier-seq [opt] declarator [opt] ;
16137 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16138 supposed to be allowed. A defect report has been filed about this
16139 issue.
16141 GNU Extension:
16143 explicit-instantiation:
16144 storage-class-specifier template
16145 decl-specifier-seq [opt] declarator [opt] ;
16146 function-specifier template
16147 decl-specifier-seq [opt] declarator [opt] ; */
16149 static void
16151 {
16153 cp_decl_specifier_seq decl_specifiers;
16158 /* Look for an (optional) storage-class-specifier or
16159 function-specifier. */
16161 {
16162 extension_specifier
16165 extension_specifier
16168 }
16170 /* Look for the `template' keyword. */
16172 /* Let the front end know that we are processing an explicit
16173 instantiation. */
16175 /* [temp.explicit] says that we are supposed to ignore access
16176 control while processing explicit instantiation directives. */
16178 /* Parse a decl-specifier-seq. */
16180 CP_PARSER_FLAGS_OPTIONAL,
16183 /* If there was exactly one decl-specifier, and it declared a class,
16184 and there's no declarator, then we have an explicit type
16185 instantiation. */
16187 {
16188 tree type;
16192 /* Turn access control back on for names used during
16193 template instantiation. */
16198 }
16199 else
16200 {
16202 tree decl;
16204 /* Parse the declarator. */
16205 declarator
16216 {
16219 "explicit instantiation shall not use"
16223 "explicit instantiation shall not use"
16228 /* Turn access control back on for names used during
16229 template instantiation. */
16231 /* Do the explicit instantiation. */
16233 }
16234 else
16235 {
16237 /* Skip the body of the explicit instantiation. */
16239 }
16240 }
16241 /* We're done with the instantiation. */
16247 }
16249 /* Parse an explicit-specialization.
16251 explicit-specialization:
16252 template < > declaration
16254 Although the standard says `declaration', what it really means is:
16256 explicit-specialization:
16257 template <> decl-specifier [opt] init-declarator [opt] ;
16258 template <> function-definition
16259 template <> explicit-specialization
16260 template <> template-declaration */
16262 static void
16264 {
16268 /* Look for the `template' keyword. */
16270 /* Look for the `<'. */
16272 /* Look for the `>'. */
16274 /* We have processed another parameter list. */
16276 /* [temp]
16278 A template ... explicit specialization ... shall not have C
16279 linkage. */
16281 {
16283 /* Give it C++ linkage to avoid confusing other parts of the
16284 front end. */
16287 }
16288 else
16290 /* Let the front end know that we are beginning a specialization. */
16292 {
16295 }
16297 /* If the next keyword is `template', we need to figure out whether
16298 or not we're looking a template-declaration. */
16300 {
16305 else
16307 }
16308 else
16309 /* Parse the dependent declaration. */
16315 /* We're done with the specialization. */
16317 /* For the erroneous case of a template with C linkage, we pushed an
16318 implicit C++ linkage scope; exit that scope now. */
16321 /* We're done with this parameter list. */
16323 }
16325 /* Parse a type-specifier.
16327 type-specifier:
16328 simple-type-specifier
16329 class-specifier
16330 enum-specifier
16331 elaborated-type-specifier
16332 cv-qualifier
16334 GNU Extension:
16336 type-specifier:
16337 __complex__
16339 Returns a representation of the type-specifier. For a
16340 class-specifier, enum-specifier, or elaborated-type-specifier, a
16341 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16343 The parser flags FLAGS is used to control type-specifier parsing.
16345 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16346 in a decl-specifier-seq.
16348 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16349 class-specifier, enum-specifier, or elaborated-type-specifier, then
16350 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16351 if a type is declared; 2 if it is defined. Otherwise, it is set to
16352 zero.
16354 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16355 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16356 is set to FALSE. */
16358 static tree
16360 cp_parser_flags flags,
16365 {
16371 /* Assume this type-specifier does not declare a new type. */
16374 /* And that it does not specify a cv-qualifier. */
16377 /* Peek at the next token. */
16380 /* If we're looking at a keyword, we can use that to guide the
16381 production we choose. */
16384 {
16389 /* Look for the enum-specifier. */
16391 /* If that worked, we're done. */
16393 {
16398 type_spec,
16399 token,
16402 }
16403 else
16406 /* Any of these indicate either a class-specifier, or an
16407 elaborated-type-specifier. */
16414 /* Parse tentatively so that we can back up if we don't find a
16415 class-specifier. */
16417 /* Look for the class-specifier. */
16420 /* If that worked, we're done. */
16422 {
16427 type_spec,
16428 token,
16431 }
16433 /* Fall through. */
16434 elaborated_type_specifier:
16435 /* We're declaring (not defining) a class or enum. */
16439 /* Fall through. */
16441 /* Look for an elaborated-type-specifier. */
16442 type_spec
16443 = (cp_parser_elaborated_type_specifier
16446 is_declaration));
16449 type_spec,
16450 token,
16473 /* The `__complex__' keyword is a GNU extension. */
16479 }
16481 /* Handle simple keywords. */
16483 {
16485 {
16488 }
16490 }
16492 /* If we do not already have a type-specifier, assume we are looking
16493 at a simple-type-specifier. */
16495 decl_specs,
16496 flags);
16498 /* If we didn't find a type-specifier, and a type-specifier was not
16499 optional in this context, issue an error message. */
16501 {
16504 }
16507 }
16509 /* Parse a simple-type-specifier.
16511 simple-type-specifier:
16512 :: [opt] nested-name-specifier [opt] type-name
16513 :: [opt] nested-name-specifier template template-id
16514 char
16515 wchar_t
16516 bool
16517 short
16518 int
16519 long
16520 signed
16521 unsigned
16522 float
16523 double
16524 void
16526 C++11 Extension:
16528 simple-type-specifier:
16529 auto
16530 decltype ( expression )
16531 char16_t
16532 char32_t
16533 __underlying_type ( type-id )
16535 C++17 extension:
16537 nested-name-specifier(opt) template-name
16539 GNU Extension:
16541 simple-type-specifier:
16542 __int128
16543 __typeof__ unary-expression
16544 __typeof__ ( type-id )
16545 __typeof__ ( type-id ) { initializer-list , [opt] }
16547 Concepts Extension:
16549 simple-type-specifier:
16550 constrained-type-specifier
16552 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16553 appropriately updated. */
16555 static tree
16558 cp_parser_flags flags)
16559 {
16564 /* Peek at the next token. */
16567 /* If we're looking at a keyword, things are easy. */
16569 {
16604 {
16607 }
16636 {
16637 /* The 'auto' might be the placeholder return type for a function decl
16638 with trailing return type. */
16647 {
16649 {
16656 }
16659 {
16662 }
16665 }
16669 {
16672 }
16675 {
16678 }
16679 else
16683 {
16686 "use of %<auto%> in lambda parameter declaration "
16687 "only available with "
16689 }
16692 "use of %<auto%> in parameter declaration "
16693 "only available with "
16697 "ISO C++ forbids use of %<auto%> in parameter "
16699 }
16700 else
16705 /* Since DR 743, decltype can either be a simple-type-specifier by
16706 itself or begin a nested-name-specifier. Parsing it will replace
16707 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16708 handling below decide what to do. */
16714 /* Consume the `typeof' token. */
16716 /* Parse the operand to `typeof'. */
16718 /* If it is not already a TYPE, take its type. */
16724 token,
16733 token,
16743 token,
16748 }
16750 /* If token is an already-parsed decltype not followed by ::,
16751 it's a simple-type-specifier. */
16754 {
16757 {
16759 token,
16761 /* Remember that we are handling a decltype in order to
16762 implement the resolution of DR 1510 when the argument
16763 isn't instantiation dependent. */
16765 }
16768 }
16770 /* If the type-specifier was for a built-in type, we're done. */
16772 {
16773 /* Record the type. */
16780 type,
16781 token,
16786 /* Consume the token. */
16792 /* There is no valid C++ program where a non-template type is
16793 followed by a "<". That usually indicates that the user thought
16794 that the type was a template. */
16799 }
16801 /* The type-specifier must be a user-defined type. */
16803 {
16807 /* Don't gobble tokens or issue error messages if this is an
16808 optional type-specifier. */
16814 /* Look for the optional `::' operator. */
16815 global_p
16819 /* Look for the nested-name specifier. */
16820 qualified_p
16827 /* If we have seen a nested-name-specifier, and the next token
16828 is `template', then we are using the template-id production. */
16831 {
16832 /* Look for the template-id. */
16836 none_type,
16838 /* If the template-id did not name a type, we are out of
16839 luck. */
16841 {
16844 }
16845 }
16846 /* Otherwise, look for a type-name. */
16847 else
16849 /* Keep track of all name-lookups performed in class scopes. */
16851 && !global_p
16852 && !qualified_p
16856 /* If it didn't work out, we don't have a TYPE. */
16861 {
16875 {
16877 none_type,
16887 else
16888 {
16893 }
16894 }
16895 else
16901 }
16904 token,
16906 }
16908 /* If we didn't get a type-name, issue an error message. */
16910 {
16913 }
16916 {
16917 /* See if TYPE is an Objective-C type, and if so, parse and
16918 accept any protocol references following it. Do this before
16919 the cp_parser_check_for_invalid_template_id() call, because
16920 Objective-C types can be followed by '<...>' which would
16921 enclose protocol names rather than template arguments, and so
16922 everything is fine. */
16925 {
16929 /* Clobber the "unqualified" type previously entered into
16930 DECL_SPECS with the new, improved protocol-qualified version. */
16935 }
16937 /* There is no valid C++ program where a non-template type is
16938 followed by a "<". That usually indicates that the user
16939 thought that the type was a template. */
16941 none_type,
16943 }
16946 }
16948 /* Parse a type-name.
16950 type-name:
16951 class-name
16952 enum-name
16953 typedef-name
16954 simple-template-id [in c++0x]
16956 enum-name:
16957 identifier
16959 typedef-name:
16960 identifier
16962 Concepts:
16964 type-name:
16965 concept-name
16966 partial-concept-id
16968 concept-name:
16969 identifier
16971 Returns a TYPE_DECL for the type. */
16973 static tree
16975 {
16977 }
16979 /* See above. */
16980 static tree
16982 {
16983 tree type_decl;
16985 /* We can't know yet whether it is a class-name or not. */
16987 /* Try a class-name. */
16989 typename_keyword_p,
16991 none_type,
16995 /* If it's not a class-name, keep looking. */
16997 {
16999 /* It must be a typedef-name or an enum-name. */
17003 /* It is either a simple-template-id representing an
17004 instantiation of an alias template... */
17008 none_type,
17010 /* Note that this must be an instantiation of an alias template
17011 because [temp.names]/6 says:
17013 A template-id that names an alias template specialization
17014 is a type-name.
17016 Whereas [temp.names]/7 says:
17018 A simple-template-id that names a class template
17019 specialization is a class-name.
17021 With concepts, this could also be a partial-concept-id that
17022 declares a non-type template parameter. */
17029 else
17033 /* ... Or a typedef-name or an enum-name. */
17035 }
17038 }
17040 /* Check if DECL and ARGS can form a constrained-type-specifier.
17041 If ARGS is non-null, we try to form a concept check of the
17042 form DECL<?, ARGS> where ? is a wildcard that matches any
17043 kind of template argument. If ARGS is NULL, then we try to
17044 form a concept check of the form DECL<?>. */
17046 static tree
17049 {
17052 /* If we a constrained-type-specifier cannot be deduced. */
17056 /* A constrained type specifier can only be found in an
17057 overload set or as a reference to a template declaration.
17059 FIXME: This might be masking a bug. It's possible that
17060 that the deduction below is causing template specializations
17061 to be formed with the wildcard as an argument. */
17065 /* Try to build a call expression that evaluates the
17066 concept. This can fail if the overload set refers
17067 only to non-templates. */
17073 /* Deduce the checked constraint and the prototype parameter.
17075 FIXME: In certain cases, failure to deduce should be a
17076 diagnosable error. */
17077 tree conc;
17078 tree proto;
17082 /* In template parameter scope, this results in a constrained
17083 parameter. Return a descriptor of that parm. */
17087 /* In a parameter-declaration-clause, constrained-type
17088 specifiers result in invented template parameters. */
17090 {
17093 }
17094 else
17095 {
17096 /* Otherwise, we're in a context where the constrained
17097 type name is deduced and the constraint applies
17098 after deduction. */
17100 }
17103 }
17105 /* If DECL refers to a concept, return a TYPE_DECL representing
17106 the result of using the constrained type specifier in the
17107 current context. DECL refers to a concept if
17109 - it is an overload set containing a function concept taking a single
17110 type argument, or
17112 - it is a variable concept taking a single type argument. */
17114 static tree
17116 {
17122 else
17124 }
17126 /* Check if DECL and ARGS form a partial-concept-id. If so,
17127 assign ID to the resulting constrained placeholder.
17129 Returns true if the partial-concept-id designates a placeholder
17130 and false otherwise. Note that *id is set to NULL_TREE in
17131 this case. */
17133 static tree
17135 {
17137 }
17139 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17140 or a concept-name.
17142 enum-name:
17143 identifier
17145 typedef-name:
17146 identifier
17148 concept-name:
17149 identifier
17151 Returns a TYPE_DECL for the type. */
17153 static tree
17155 {
17156 tree type_decl;
17157 tree identifier;
17164 /* Look up the type-name. */
17169 /* If we found an overload set, then it may refer to a concept-name. */
17175 {
17176 /* See if this is an Objective-C type. */
17181 }
17183 /* Issue an error if we did not find a type-name. */
17185 /* In Objective-C, we have the complication that class names are
17186 normally type names and start declarations (eg, the
17187 "NSObject" in "NSObject *object;"), but can be used in an
17188 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17189 is an expression. So, a classname followed by a dot is not a
17190 valid type-name. */
17193 {
17198 }
17199 /* Remember that the name was used in the definition of the
17200 current class so that we can check later to see if the
17201 meaning would have been different after the class was
17202 entirely defined. */
17208 }
17210 /* Parse an elaborated-type-specifier. Note that the grammar given
17211 here incorporates the resolution to DR68.
17213 elaborated-type-specifier:
17214 class-key :: [opt] nested-name-specifier [opt] identifier
17215 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17216 enum-key :: [opt] nested-name-specifier [opt] identifier
17217 typename :: [opt] nested-name-specifier identifier
17218 typename :: [opt] nested-name-specifier template [opt]
17219 template-id
17221 GNU extension:
17223 elaborated-type-specifier:
17224 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17225 class-key attributes :: [opt] nested-name-specifier [opt]
17226 template [opt] template-id
17227 enum attributes :: [opt] nested-name-specifier [opt] identifier
17229 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17230 declared `friend'. If IS_DECLARATION is TRUE, then this
17231 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17232 something is being declared.
17234 Returns the TYPE specified. */
17236 static tree
17240 {
17242 tree identifier;
17245 tree globalscope;
17248 /* See if we're looking at the `enum' keyword. */
17250 {
17251 /* Consume the `enum' token. */
17253 /* Remember that it's an enumeration type. */
17255 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17256 enums) is used here. */
17259 {
17263 /* Consume the `struct' or `class' and parse it anyway. */
17265 }
17266 /* Parse the attributes. */
17268 }
17269 /* Or, it might be `typename'. */
17271 RID_TYPENAME))
17272 {
17273 /* Consume the `typename' token. */
17275 /* Remember that it's a `typename' type. */
17277 }
17278 /* Otherwise it must be a class-key. */
17279 else
17280 {
17284 /* Parse the attributes. */
17286 }
17288 /* Look for the `::' operator. */
17291 /* Look for the nested-name-specifier. */
17292 tree nested_name_specifier;
17294 {
17295 nested_name_specifier
17300 is_declaration);
17303 }
17304 else
17305 /* Even though `typename' is not present, the proposed resolution
17306 to Core Issue 180 says that in `class A<T>::B', `B' should be
17307 considered a type-name, even if `A<T>' is dependent. */
17308 nested_name_specifier
17313 is_declaration);
17314 /* For everything but enumeration types, consider a template-id.
17315 For an enumeration type, consider only a plain identifier. */
17317 {
17319 tree decl;
17321 /* Allow the `template' keyword. */
17323 /* If we didn't see `template', we don't know if there's a
17324 template-id or not. */
17327 /* Parse the template-id. */
17331 tag_type,
17332 is_declaration);
17333 /* If we didn't find a template-id, look for an ordinary
17334 identifier. */
17336 ;
17337 /* We can get here when cp_parser_template_id, called by
17338 cp_parser_class_name with tag_type == none_type, succeeds
17339 and caches a BASELINK. Then, when called again here,
17340 instead of failing and returning an error_mark_node
17341 returns it (see template/typename17.C in C++11).
17342 ??? Could we diagnose this earlier? */
17344 {
17347 }
17348 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17349 in effect, then we must assume that, upon instantiation, the
17350 template will correspond to a class. */
17354 typename_type,
17356 /* If the `typename' keyword is in effect and DECL is not a type
17357 decl, then type is non existent. */
17359 ;
17361 {
17365 /* If the next token is a semicolon, this must be a specialization,
17366 instantiation, or friend declaration. Check the scope while we
17367 still know whether or not we had a nested-name-specifier. */
17372 }
17375 }
17378 {
17383 {
17386 }
17388 /* For a `typename', we needn't call xref_tag. */
17394 /* Template parameter lists apply only if we are not within a
17395 function parameter list. */
17396 bool template_parm_lists_apply
17405 /* Look up a qualified name in the usual way. */
17407 {
17408 tree decl;
17409 tree ambiguous_decls;
17412 tag_type,
17419 /* If the lookup was ambiguous, an error will already have been
17420 issued. */
17424 /* If we are parsing friend declaration, DECL may be a
17425 TEMPLATE_DECL tree node here. However, we need to check
17426 whether this TEMPLATE_DECL results in valid code. Consider
17427 the following example:
17429 namespace N {
17430 template <class T> class C {};
17431 }
17432 class X {
17433 template <class T> friend class N::C; // #1, valid code
17434 };
17435 template <class T> class Y {
17436 friend class N::C; // #2, invalid code
17437 };
17439 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17440 name lookup of `N::C'. We see that friend declaration must
17441 be template for the code to be valid. Note that
17442 processing_template_decl does not work here since it is
17443 always 1 for the above two cases. */
17445 decl = (cp_parser_maybe_treat_template_as_class
17450 {
17452 identifier,
17455 }
17458 {
17462 allow_template);
17466 }
17468 /* Forward declarations of nested types, such as
17470 class C1::C2;
17471 class C1::C2::C3;
17473 are invalid unless all components preceding the final '::'
17474 are complete. If all enclosing types are complete, these
17475 declarations become merely pointless.
17477 Invalid forward declarations of nested types are errors
17478 caught elsewhere in parsing. Those that are pointless arrive
17479 here. */
17486 }
17487 else
17488 {
17489 /* An elaborated-type-specifier sometimes introduces a new type and
17490 sometimes names an existing type. Normally, the rule is that it
17491 introduces a new type only if there is not an existing type of
17492 the same name already in scope. For example, given:
17494 struct S {};
17495 void f() { struct S s; }
17497 the `struct S' in the body of `f' is the same `struct S' as in
17498 the global scope; the existing definition is used. However, if
17499 there were no global declaration, this would introduce a new
17500 local class named `S'.
17502 An exception to this rule applies to the following code:
17504 namespace N { struct S; }
17506 Here, the elaborated-type-specifier names a new type
17507 unconditionally; even if there is already an `S' in the
17508 containing scope this declaration names a new type.
17509 This exception only applies if the elaborated-type-specifier
17510 forms the complete declaration:
17512 [class.name]
17514 A declaration consisting solely of `class-key identifier ;' is
17515 either a redeclaration of the name in the current scope or a
17516 forward declaration of the identifier as a class name. It
17517 introduces the name into the current scope.
17519 We are in this situation precisely when the next token is a `;'.
17521 An exception to the exception is that a `friend' declaration does
17522 *not* name a new type; i.e., given:
17524 struct S { friend struct T; };
17526 `T' is not a new type in the scope of `S'.
17528 Also, `new struct S' or `sizeof (struct S)' never results in the
17529 definition of a new type; a new type can only be declared in a
17530 declaration context. */
17532 tag_scope ts;
17536 /* Friends have special name lookup rules. */
17540 CPP_SEMICOLON))
17541 /* This is a `class-key identifier ;' */
17543 else
17546 template_p =
17547 (template_parm_lists_apply
17550 /* An unqualified name was used to reference this type, so
17551 there were no qualifying templates. */
17559 }
17560 }
17565 /* Allow attributes on forward declarations of classes. */
17567 {
17577 else
17580 }
17583 {
17584 /* Indicate whether this class was declared as a `class' or as a
17585 `struct'. */
17589 }
17591 /* A "<" cannot follow an elaborated type specifier. If that
17592 happens, the user was probably trying to form a template-id. */
17597 }
17599 /* Parse an enum-specifier.
17601 enum-specifier:
17602 enum-head { enumerator-list [opt] }
17603 enum-head { enumerator-list , } [C++0x]
17605 enum-head:
17606 enum-key identifier [opt] enum-base [opt]
17607 enum-key nested-name-specifier identifier enum-base [opt]
17609 enum-key:
17610 enum
17611 enum class [C++0x]
17612 enum struct [C++0x]
17614 enum-base: [C++0x]
17615 : type-specifier-seq
17617 opaque-enum-specifier:
17618 enum-key identifier enum-base [opt] ;
17620 GNU Extensions:
17621 enum-key attributes[opt] identifier [opt] enum-base [opt]
17622 { enumerator-list [opt] }attributes[opt]
17623 enum-key attributes[opt] identifier [opt] enum-base [opt]
17624 { enumerator-list, }attributes[opt] [C++0x]
17626 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17627 if the token stream isn't an enum-specifier after all. */
17629 static tree
17631 {
17632 tree identifier;
17634 tree prev_scope;
17636 tree attributes;
17649 /* Parse tentatively so that we can back up if we don't find a
17650 enum-specifier. */
17653 /* Caller guarantees that the current token is 'enum', an identifier
17654 possibly follows, and the token after that is an opening brace.
17655 If we don't have an identifier, fabricate an anonymous name for
17656 the enumeration being defined. */
17659 /* Parse the "class" or "struct", which indicates a scoped
17660 enumeration type in C++0x. */
17663 {
17667 /* Consume the `struct' or `class' token. */
17671 }
17675 /* Clear the qualification. */
17680 /* Figure out in what scope the declaration is being placed. */
17686 nested_name_specifier
17694 {
17695 tree name;
17699 enum_type,
17704 input_location);
17706 {
17709 {
17710 /* Are template enums allowed in ISO? */
17714 /* ignore a typename reference, for it will be solved by name
17715 in start_enum. */
17717 }
17718 }
17721 else
17722 {
17727 }
17728 }
17729 else
17730 {
17733 else
17734 {
17740 }
17741 }
17744 /* Check for the `:' that denotes a specified underlying type in C++0x.
17745 Note that a ':' could also indicate a bitfield width, however. */
17747 {
17748 cp_decl_specifier_seq type_specifiers;
17750 /* Consume the `:'. */
17753 /* Parse the type-specifier-seq. */
17758 /* At this point this is surely not elaborated type specifier. */
17767 /* If that didn't work, stop. */
17769 {
17775 }
17776 }
17778 /* Look for the `{' but don't consume it yet. */
17780 {
17782 {
17785 {
17788 }
17789 }
17790 /* An opaque-enum-specifier must have a ';' here. */
17793 {
17796 {
17799 }
17800 }
17801 }
17807 {
17809 {
17813 }
17815 {
17817 }
17818 }
17820 /* Issue an error message if type-definitions are forbidden here. */
17823 else
17824 /* Create the new type. We do this before consuming the opening
17825 brace so the enum will be recorded as being on the line of its
17826 tag (or the 'enum' keyword, if there is no tag). */
17830 /* If the next token is not '{' it is an opaque-enum-specifier or an
17831 elaborated-type-specifier. */
17833 {
17837 {
17838 /* The following catches invalid code such as:
17839 enum class S<int>::E { A, B, C }; */
17847 {
17851 nested_name_specifier);
17853 }
17856 {
17858 "%qT for enum declaration does not name a class "
17861 }
17862 /* If that scope does not contain the scope in which the
17863 class was originally declared, the program is invalid. */
17865 nested_name_specifier))
17866 {
17869 "declaration of %qD in namespace %qD which does not "
17872 else
17874 "declaration of %qD in %qD which does not "
17878 }
17879 /* If that scope is the scope where the declaration is being placed
17880 the program is invalid. */
17884 {
17888 }
17889 }
17894 /* Consume the opening brace. */
17901 {
17905 }
17906 else
17907 {
17913 }
17917 /* If the next token is not '}', then there are some enumerators. */
17919 {
17923 }
17924 else
17927 /* Consume the final '}'. */
17933 }
17934 else
17935 {
17936 /* If a ';' follows, then it is an opaque-enum-specifier
17937 and additional restrictions apply. */
17939 {
17946 }
17947 }
17949 /* Look for trailing attributes to apply to this enumeration, and
17950 apply them if appropriate. */
17952 {
17955 trailing_attr,
17957 }
17959 /* Finish up the enumeration. */
17961 {
17966 }
17969 {
17971 {
17974 }
17976 {
17978 }
17979 }
17980 out:
17983 }
17985 /* Parse an enumerator-list. The enumerators all have the indicated
17986 TYPE.
17988 enumerator-list:
17989 enumerator-definition
17990 enumerator-list , enumerator-definition */
17992 static void
17994 {
17996 {
17997 /* Parse an enumerator-definition. */
18000 /* If the next token is not a ',', we've reached the end of
18001 the list. */
18004 /* Otherwise, consume the `,' and keep going. */
18006 /* If the next token is a `}', there is a trailing comma. */
18008 {
18013 }
18014 }
18015 }
18017 /* Parse an enumerator-definition. The enumerator has the indicated
18018 TYPE.
18020 enumerator-definition:
18021 enumerator
18022 enumerator = constant-expression
18024 enumerator:
18025 identifier
18027 GNU Extensions:
18029 enumerator-definition:
18030 enumerator attributes [opt]
18031 enumerator attributes [opt] = constant-expression */
18033 static void
18035 {
18036 tree identifier;
18037 tree value;
18038 location_t loc;
18040 /* Save the input location because we are interested in the location
18041 of the identifier and not the location of the explicit value. */
18044 /* Look for the identifier. */
18049 /* Parse any specified attributes. */
18052 /* If the next token is an '=', then there is an explicit value. */
18054 {
18055 /* Consume the `=' token. */
18057 /* Parse the value. */
18059 }
18060 else
18063 /* If we are processing a template, make sure the initializer of the
18064 enumerator doesn't contain any bare template parameter pack. */
18068 /* Create the enumerator. */
18070 }
18072 /* Parse a namespace-name.
18074 namespace-name:
18075 original-namespace-name
18076 namespace-alias
18078 Returns the NAMESPACE_DECL for the namespace. */
18080 static tree
18082 {
18083 tree identifier;
18084 tree namespace_decl;
18088 /* Get the name of the namespace. */
18093 /* Look up the identifier in the currently active scope. Look only
18094 for namespaces, due to:
18096 [basic.lookup.udir]
18098 When looking up a namespace-name in a using-directive or alias
18099 definition, only namespace names are considered.
18101 And:
18103 [basic.lookup.qual]
18105 During the lookup of a name preceding the :: scope resolution
18106 operator, object, function, and enumerator names are ignored.
18108 (Note that cp_parser_qualifying_entity only calls this
18109 function if the token after the name is the scope resolution
18110 operator.) */
18112 none_type,
18118 /* If it's not a namespace, issue an error. */
18121 {
18126 }
18129 }
18131 /* Parse a namespace-definition.
18133 namespace-definition:
18134 named-namespace-definition
18135 unnamed-namespace-definition
18137 named-namespace-definition:
18138 original-namespace-definition
18139 extension-namespace-definition
18141 original-namespace-definition:
18142 namespace identifier { namespace-body }
18144 extension-namespace-definition:
18145 namespace original-namespace-name { namespace-body }
18147 unnamed-namespace-definition:
18148 namespace { namespace-body } */
18150 static void
18152 {
18162 {
18166 }
18167 else
18170 /* Look for the `namespace' keyword. */
18173 /* Parse any specified attributes before the identifier. */
18176 /* Get the name of the namespace. We do not attempt to distinguish
18177 between an original-namespace-definition and an
18178 extension-namespace-definition at this point. The semantic
18179 analysis routines are responsible for that. */
18182 else
18185 /* Parse any specified attributes after the identifier. */
18188 {
18191 else
18193 }
18195 /* Start the namespace. */
18198 /* Parse any nested namespace definition. */
18200 {
18205 "nested namespace definitions only available with "
18210 {
18214 else
18215 {
18218 }
18221 }
18222 }
18224 /* Look for the `{' to validate starting the namespace. */
18227 /* "inline namespace" is equivalent to a stub namespace definition
18228 followed by a strong using directive. */
18230 {
18232 /* Set up namespace association. */
18236 /* Import the contents of the inline namespace. */
18240 }
18246 /* Parse the body of the namespace. */
18252 /* Finish the nested namespace definitions. */
18256 /* Finish the namespace. */
18259 /* Look for the final `}'. */
18261 }
18263 /* Parse a namespace-body.
18265 namespace-body:
18266 declaration-seq [opt] */
18268 static void
18270 {
18272 }
18274 /* Parse a namespace-alias-definition.
18276 namespace-alias-definition:
18277 namespace identifier = qualified-namespace-specifier ; */
18279 static void
18281 {
18282 tree identifier;
18283 tree namespace_specifier;
18287 /* Look for the `namespace' keyword. */
18289 /* Look for the identifier. */
18293 /* Look for the `=' token. */
18296 {
18298 /* Skip the definition. */
18303 }
18305 /* Look for the qualified-namespace-specifier. */
18306 namespace_specifier
18308 /* Look for the `;' token. */
18311 /* Register the alias in the symbol table. */
18313 }
18315 /* Parse a qualified-namespace-specifier.
18317 qualified-namespace-specifier:
18318 :: [opt] nested-name-specifier [opt] namespace-name
18320 Returns a NAMESPACE_DECL corresponding to the specified
18321 namespace. */
18323 static tree
18325 {
18326 /* Look for the optional `::'. */
18330 /* Look for the optional nested-name-specifier. */
18338 }
18340 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18341 access declaration.
18343 using-declaration:
18344 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18345 using :: unqualified-id ;
18347 access-declaration:
18348 qualified-id ;
18350 */
18352 static bool
18355 {
18359 tree decl;
18360 tree identifier;
18361 tree qscope;
18366 {
18369 }
18370 else
18371 {
18372 /* Look for the `using' keyword. */
18375 again:
18376 /* Peek at the next token. */
18378 /* See if it's `typename'. */
18380 {
18381 /* Remember that we've seen it. */
18383 /* Consume the `typename' token. */
18385 }
18386 }
18388 /* Look for the optional global scope qualification. */
18389 global_scope_p
18394 /* If we saw `typename', or didn't see `::', then there must be a
18395 nested-name-specifier present. */
18397 {
18403 {
18406 }
18407 }
18408 /* Otherwise, we could be in either of the two productions. In that
18409 case, treat the nested-name-specifier as optional. */
18410 else
18422 /* Something has already gone wrong; there's no need to parse
18423 further. Since an error has occurred, the return value of
18424 cp_parser_parse_definitely will be false, as required. */
18428 /* Parse the unqualified-id. */
18436 {
18441 }
18443 {
18448 "pack expansion in using-declaration only available "
18451 }
18453 /* The function we call to handle a using-declaration is different
18454 depending on what scope we are in. */
18456 ;
18459 /* [namespace.udecl]
18461 A using declaration shall not name a template-id. */
18464 else
18465 {
18467 {
18468 /* Create the USING_DECL. */
18475 {
18478 }
18479 else
18480 /* Add it to the list of members in this class. */
18482 }
18483 else
18484 {
18486 identifier,
18493 {
18496 }
18499 else
18501 }
18502 }
18506 {
18510 "comma-separated list in using-declaration only available "
18513 }
18515 /* Look for the final `;'. */
18520 "access declarations are deprecated "
18521 "in favour of using-declarations; "
18525 }
18527 /* Parse an alias-declaration.
18529 alias-declaration:
18530 using identifier attribute-specifier-seq [opt] = type-id */
18532 static tree
18534 {
18536 location_t id_location;
18538 cp_decl_specifier_seq decl_specs;
18542 /* Look for the `using' keyword. */
18543 cp_token *using_token
18565 /* Now we are going to parse the type-id of the declaration. */
18567 /*
18568 [dcl.type]/3 says:
18570 "A type-specifier-seq shall not define a class or enumeration
18571 unless it appears in the type-id of an alias-declaration (7.1.3) that
18572 is not the declaration of a template-declaration."
18574 In other words, if we currently are in an alias template, the
18575 type-id should not define a type.
18577 So let's set parser->type_definition_forbidden_message in that
18578 case; cp_parser_check_type_definition (called by
18579 cp_parser_class_specifier) will then emit an error if a type is
18580 defined in the type-id. */
18582 {
18586 }
18590 /* Restore the error message if need be. */
18596 {
18599 }
18601 /* A typedef-name can also be introduced by an alias-declaration. The
18602 identifier following the using keyword becomes a typedef-name. It has
18603 the same semantics as if it were introduced by the typedef
18604 specifier. In particular, it does not define a new type and it shall
18605 not appear in the type-id. */
18610 {
18613 ds_attribute,
18614 attrs_token);
18615 }
18617 ds_typedef,
18618 using_token);
18620 ds_alias,
18621 using_token);
18630 else
18636 // Attach constraints to the alias declaration.
18638 {
18642 }
18649 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18650 added into the symbol table; otherwise, return the TYPE_DECL. */
18654 {
18658 }
18661 }
18663 /* Parse a using-directive.
18665 using-directive:
18666 using namespace :: [opt] nested-name-specifier [opt]
18667 namespace-name ; */
18669 static void
18671 {
18672 tree namespace_decl;
18673 tree attribs;
18675 /* Look for the `using' keyword. */
18677 /* And the `namespace' keyword. */
18679 /* Look for the optional `::' operator. */
18681 /* And the optional nested-name-specifier. */
18687 /* Get the namespace being used. */
18689 /* And any specified attributes. */
18691 /* Update the symbol table. */
18693 /* Look for the final `;'. */
18695 }
18697 /* Parse an asm-definition.
18699 asm-definition:
18700 asm ( string-literal ) ;
18702 GNU Extension:
18704 asm-definition:
18705 asm volatile [opt] ( string-literal ) ;
18706 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18707 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18708 : asm-operand-list [opt] ) ;
18709 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18710 : asm-operand-list [opt]
18711 : asm-clobber-list [opt] ) ;
18712 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18713 : asm-clobber-list [opt]
18714 : asm-goto-list ) ; */
18716 static void
18718 {
18719 tree string;
18724 tree asm_stmt;
18732 /* Look for the `asm' keyword. */
18737 {
18740 }
18742 /* See if the next token is `volatile'. */
18745 {
18746 /* Remember that we saw the `volatile' keyword. */
18748 /* Consume the token. */
18750 }
18754 {
18755 /* Remember that we saw the `goto' keyword. */
18757 /* Consume the token. */
18759 }
18760 /* Look for the opening `('. */
18763 /* Look for the string. */
18766 {
18770 }
18772 /* If we're allowing GNU extensions, check for the extended assembly
18773 syntax. Unfortunately, the `:' tokens need not be separated by
18774 a space in C, and so, for compatibility, we tolerate that here
18775 too. Doing that means that we have to treat the `::' operator as
18776 two `:' tokens. */
18781 {
18786 /* The extended syntax was used. */
18789 /* Look for outputs. */
18791 {
18792 /* Consume the `:'. */
18794 /* Parse the output-operands. */
18796 CPP_COLON)
18798 CPP_SCOPE)
18800 CPP_CLOSE_PAREN)
18802 {
18806 }
18807 }
18808 /* If the next token is `::', there are no outputs, and the
18809 next token is the beginning of the inputs. */
18811 /* The inputs are coming next. */
18814 /* Look for inputs. */
18817 {
18818 /* Consume the `:' or `::'. */
18820 /* Parse the output-operands. */
18822 CPP_COLON)
18824 CPP_SCOPE)
18826 CPP_CLOSE_PAREN))
18827 {
18831 }
18832 }
18834 /* The clobbers are coming next. */
18837 /* Look for clobbers. */
18840 {
18842 /* Consume the `:' or `::'. */
18844 /* Parse the clobbers. */
18846 CPP_COLON)
18848 CPP_CLOSE_PAREN))
18850 }
18853 /* The labels are coming next. */
18856 /* Look for labels. */
18859 {
18861 /* Consume the `:' or `::'. */
18863 /* Parse the labels. */
18865 }
18869 }
18873 /* Look for the closing `)'. */
18881 {
18882 /* Create the ASM_EXPR. */
18884 {
18887 /* If the extended syntax was not used, mark the ASM_EXPR. */
18889 {
18895 }
18896 }
18897 else
18899 }
18900 }
18902 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18903 type that comes from the decl-specifier-seq. */
18905 static tree
18907 {
18910 {
18923 }
18926 }
18928 /* Declarators [gram.dcl.decl] */
18930 /* Parse an init-declarator.
18932 init-declarator:
18933 declarator initializer [opt]
18935 GNU Extension:
18937 init-declarator:
18938 declarator asm-specification [opt] attributes [opt] initializer [opt]
18940 function-definition:
18941 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18942 function-body
18943 decl-specifier-seq [opt] declarator function-try-block
18945 GNU Extension:
18947 function-definition:
18948 __extension__ function-definition
18950 TM Extension:
18952 function-definition:
18953 decl-specifier-seq [opt] declarator function-transaction-block
18955 The DECL_SPECIFIERS apply to this declarator. Returns a
18956 representation of the entity declared. If MEMBER_P is TRUE, then
18957 this declarator appears in a class scope. The new DECL created by
18958 this declarator is returned.
18960 The CHECKS are access checks that should be performed once we know
18961 what entity is being declared (and, therefore, what classes have
18962 befriended it).
18964 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18965 for a function-definition here as well. If the declarator is a
18966 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18967 be TRUE upon return. By that point, the function-definition will
18968 have been completely parsed.
18970 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18971 is FALSE.
18973 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18974 parsed declaration if it is an uninitialized single declarator not followed
18975 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18976 if present, will not be consumed. If returned, this declarator will be
18977 created with SD_INITIALIZED but will not call cp_finish_decl.
18979 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18980 and there is an initializer, the pointed location_t is set to the
18981 location of the '=' or `(', or '{' in C++11 token introducing the
18982 initializer. */
18984 static tree
18995 {
18999 tree prefix_attributes;
19001 tree asm_specification;
19002 tree initializer;
19004 tree scope;
19006 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19007 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19008 "(...)". */
19019 /* Gather the attributes that were provided with the
19020 decl-specifiers. */
19023 /* Assume that this is not the declarator for a function
19024 definition. */
19028 /* Default arguments are only permitted for function parameters. */
19032 /* Defer access checks while parsing the declarator; we cannot know
19033 what names are accessible until we know what is being
19034 declared. */
19039 /* Parse the declarator. */
19040 declarator
19045 /* Gather up the deferred checks. */
19050 /* If the DECLARATOR was erroneous, there's no need to go
19051 further. */
19055 /* Check that the number of template-parameter-lists is OK. */
19065 /* Figure out what scope the entity declared by the DECLARATOR is
19066 located in. `grokdeclarator' sometimes changes the scope, so
19067 we compute it now. */
19070 /* Perform any lookups in the declared type which were thought to be
19071 dependent, but are not in the scope of the declarator. */
19072 decl_specifiers->type
19075 /* If we're allowing GNU extensions, look for an
19076 asm-specification. */
19078 {
19079 /* Look for an asm-specification. */
19082 }
19083 else
19086 /* Look for attributes. */
19090 /* Peek at the next token. */
19096 {
19097 /* Handle C++17 deduction guides. */
19101 {
19109 {
19113 }
19114 }
19116 /* Check to see if the token indicates the start of a
19117 function-definition. */
19119 {
19121 {
19122 /* If a function-definition should not appear here, issue an
19123 error message. */
19127 }
19129 location_t func_brace_location
19132 /* Neither attributes nor an asm-specification are allowed
19133 on a function-definition. */
19136 "an asm-specification is not allowed "
19140 "attributes are not allowed "
19142 /* This is a function-definition. */
19145 /* Parse the function definition. */
19148 decl_specifiers,
19149 declarator,
19150 prefix_attributes);
19151 else
19152 decl =
19153 (cp_parser_function_definition_from_specifiers_and_declarator
19157 {
19158 /* This is where the prologue starts... */
19161 }
19164 }
19165 }
19167 {
19168 /* A non-template declaration involving a function parameter list
19169 containing an implicit template parameter will be made into a
19170 template. If the resulting declaration is not going to be an
19171 actual function then finish the template scope here to prevent it.
19172 An error message will be issued once we have a decl to talk about.
19174 FIXME probably we should do type deduction rather than create an
19175 implicit template, but the standard currently doesn't allow it. */
19178 }
19180 /* [dcl.dcl]
19182 Only in function declarations for constructors, destructors, type
19183 conversions, and deduction guides can the decl-specifier-seq be omitted.
19185 We explicitly postpone this check past the point where we handle
19186 function-definitions because we tolerate function-definitions
19187 that are missing their return types in some modes. */
19189 {
19193 }
19195 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19199 {
19210 {
19216 }
19217 }
19218 else
19219 {
19220 /* If the init-declarator isn't initialized and isn't followed by a
19221 `,' or `;', it's not a valid init-declarator. */
19224 {
19227 else
19228 {
19232 }
19233 }
19236 }
19238 /* Because start_decl has side-effects, we should only call it if we
19239 know we're going ahead. By this point, we know that we cannot
19240 possibly be looking at any other construct. */
19243 /* Enter the newly declared entry in the symbol table. If we're
19244 processing a declaration in a class-specifier, we wait until
19245 after processing the initializer. */
19247 {
19255 /* Adjust location of decl if declarator->id_loc is more appropriate:
19256 set, and decl wasn't merged with another decl, in which case its
19257 location would be different from input_location, and more accurate. */
19262 }
19264 /* Enter the SCOPE. That way unqualified names appearing in the
19265 initializer will be looked up in SCOPE. */
19268 /* Perform deferred access control checks, now that we know in which
19269 SCOPE the declared entity resides. */
19271 {
19274 /* If the entity being declared is a function, pretend that we
19275 are in its scope. If it is a `friend', it may have access to
19276 things that would not otherwise be accessible. */
19278 {
19281 }
19283 /* Perform access checks for template parameters. */
19286 /* Perform the access control checks for the declarator and the
19287 decl-specifiers. */
19290 /* Restore the saved value. */
19293 }
19295 /* Parse the initializer. */
19300 {
19302 {
19305 else
19306 {
19307 /* If the declaration was erroneous, we don't really
19308 know what the user intended, so just silently
19309 consume the initializer. */
19316 }
19317 }
19318 else
19319 {
19320 /* We want to record the extra mangling scope for in-class
19321 initializers of class members and initializers of static data
19322 member templates. The former involves deferring
19323 parsing of the initializer until end of class as with default
19324 arguments. So right here we only handle the latter. */
19334 }
19335 }
19337 /* The old parser allows attributes to appear after a parenthesized
19338 initializer. Mark Mitchell proposed removing this functionality
19339 on the GCC mailing lists on 2002-08-13. This parser accepts the
19340 attributes -- but ignores them. */
19347 /* And now complain about a non-function implicit template. */
19352 /* For an in-class declaration, use `grokfield' to create the
19353 declaration. */
19355 {
19357 {
19360 }
19369 }
19371 /* Finish processing the declaration. But, skip member
19372 declarations. */
19374 {
19377 asm_specification,
19378 /* If the initializer is in parentheses, then this is
19379 a direct-initialization, which means that an
19380 `explicit' constructor is OK. Otherwise, an
19381 `explicit' constructor cannot be used. */
19384 }
19387 /* Core issue #226 (C++0x only): A default template-argument
19388 shall not be specified in a friend class template
19389 declaration. */
19398 {
19401 else
19403 }
19410 }
19412 /* Parse a declarator.
19414 declarator:
19415 direct-declarator
19416 ptr-operator declarator
19418 abstract-declarator:
19419 ptr-operator abstract-declarator [opt]
19420 direct-abstract-declarator
19422 GNU Extensions:
19424 declarator:
19425 attributes [opt] direct-declarator
19426 attributes [opt] ptr-operator declarator
19428 abstract-declarator:
19429 attributes [opt] ptr-operator abstract-declarator [opt]
19430 attributes [opt] direct-abstract-declarator
19432 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19433 detect constructors, destructors, deduction guides, or conversion operators.
19434 It is set to -1 if the declarator is a name, and +1 if it is a
19435 function. Otherwise it is set to zero. Usually you just want to
19436 test for >0, but internally the negative value is used.
19438 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19439 a decl-specifier-seq unless it declares a constructor, destructor,
19440 or conversion. It might seem that we could check this condition in
19441 semantic analysis, rather than parsing, but that makes it difficult
19442 to handle something like `f()'. We want to notice that there are
19443 no decl-specifiers, and therefore realize that this is an
19444 expression, not a declaration.)
19446 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19447 the declarator is a direct-declarator of the form "(...)".
19449 MEMBER_P is true iff this declarator is a member-declarator.
19451 FRIEND_P is true iff this declarator is a friend. */
19455 cp_parser_declarator_kind dcl_kind,
19459 {
19462 cp_cv_quals cv_quals;
19463 tree class_type;
19466 /* Assume this is not a constructor, destructor, or type-conversion
19467 operator. */
19474 /* Check for the ptr-operator production. */
19476 /* Parse the ptr-operator. */
19482 /* If that worked, then we have a ptr-operator. */
19484 {
19485 /* If a ptr-operator was found, then this declarator was not
19486 parenthesized. */
19489 /* The dependent declarator is optional if we are parsing an
19490 abstract-declarator. */
19494 /* Parse the dependent declarator. */
19499 friend_p);
19501 /* If we are parsing an abstract-declarator, we must handle the
19502 case where the dependent declarator is absent. */
19507 declarator = cp_parser_make_indirect_declarator
19509 }
19510 /* Everything else is a direct-declarator. */
19511 else
19512 {
19515 CPP_OPEN_PAREN);
19517 ctor_dtor_or_conv_p,
19519 }
19524 }
19526 /* Parse a direct-declarator or direct-abstract-declarator.
19528 direct-declarator:
19529 declarator-id
19530 direct-declarator ( parameter-declaration-clause )
19531 cv-qualifier-seq [opt]
19532 ref-qualifier [opt]
19533 exception-specification [opt]
19534 direct-declarator [ constant-expression [opt] ]
19535 ( declarator )
19537 direct-abstract-declarator:
19538 direct-abstract-declarator [opt]
19539 ( parameter-declaration-clause )
19540 cv-qualifier-seq [opt]
19541 ref-qualifier [opt]
19542 exception-specification [opt]
19543 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19544 ( abstract-declarator )
19546 Returns a representation of the declarator. DCL_KIND is
19547 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19548 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19549 we are parsing a direct-declarator. It is
19550 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19551 of ambiguity we prefer an abstract declarator, as per
19552 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19553 as for cp_parser_declarator. */
19557 cp_parser_declarator_kind dcl_kind,
19560 {
19570 {
19571 /* Peek at the next token. */
19574 {
19575 /* This is either a parameter-declaration-clause, or a
19576 parenthesized declarator. When we know we are parsing a
19577 named declarator, it must be a parenthesized declarator
19578 if FIRST is true. For instance, `(int)' is a
19579 parameter-declaration-clause, with an omitted
19580 direct-abstract-declarator. But `((*))', is a
19581 parenthesized abstract declarator. Finally, when T is a
19582 template parameter `(T)' is a
19583 parameter-declaration-clause, and not a parenthesized
19584 named declarator.
19586 We first try and parse a parameter-declaration-clause,
19587 and then try a nested declarator (if FIRST is true).
19589 It is not an error for it not to be a
19590 parameter-declaration-clause, even when FIRST is
19591 false. Consider,
19593 int i (int);
19594 int i (3);
19596 The first is the declaration of a function while the
19597 second is the definition of a variable, including its
19598 initializer.
19600 Having seen only the parenthesis, we cannot know which of
19601 these two alternatives should be selected. Even more
19602 complex are examples like:
19604 int i (int (a));
19605 int i (int (3));
19607 The former is a function-declaration; the latter is a
19608 variable initialization.
19610 Thus again, we try a parameter-declaration-clause, and if
19611 that fails, we back out and return. */
19614 {
19615 tree params;
19618 /* In a member-declarator, the only valid interpretation
19619 of a parenthesis is the start of a
19620 parameter-declaration-clause. (It is invalid to
19621 initialize a static data member with a parenthesized
19622 initializer; only the "=" form of initialization is
19623 permitted.) */
19627 /* Consume the `('. */
19630 {
19631 /* If this is going to be an abstract declarator, we're
19632 in a declarator and we can't have default args. */
19635 }
19639 /* Parse the parameter-declaration-clause. */
19642 /* Consume the `)'. */
19645 /* If all went well, parse the cv-qualifier-seq,
19646 ref-qualifier and the exception-specification. */
19648 {
19649 cp_cv_quals cv_quals;
19650 cp_virt_specifiers virt_specifiers;
19651 cp_ref_qualifier ref_qual;
19652 tree exception_specification;
19653 tree late_return;
19654 tree attrs;
19664 /* Parse the cv-qualifier-seq. */
19666 /* Parse the ref-qualifier. */
19668 /* Parse the tx-qualifier. */
19670 /* And the exception-specification. */
19671 exception_specification
19676 /* In here, we handle cases where attribute is used after
19677 the function declaration. For example:
19678 void func (int x) __attribute__((vector(..))); */
19682 {
19686 CPP_SEMICOLON)
19688 CPP_OPEN_BRACE))
19691 ;
19692 else
19694 }
19696 late_return = (cp_parser_late_return_type_opt
19700 /* Parse the virt-specifier-seq. */
19703 /* Create the function-declarator. */
19705 params,
19706 cv_quals,
19707 virt_specifiers,
19708 ref_qual,
19709 tx_qual,
19710 exception_specification,
19711 late_return,
19712 requires_clause);
19715 /* Any subsequent parameter lists are to do with
19716 return type, so are not those of the declared
19717 function. */
19719 }
19721 /* Remove the function parms from scope. */
19725 /* Repeat the main loop. */
19727 }
19729 /* If this is the first, we can try a parenthesized
19730 declarator. */
19732 {
19738 /* Consume the `('. */
19740 /* Parse the nested declarator. */
19743 declarator
19749 /* Expect a `)'. */
19756 }
19757 /* Otherwise, we must be done. */
19758 else
19760 }
19764 {
19765 /* Parse an array-declarator. */
19774 /* Consume the `['. */
19776 /* Peek at the next token. */
19778 /* If the next token is `]', then there is no
19779 constant-expression. */
19781 {
19783 bounds
19793 {
19794 /* Normally, the array bound must be an integral constant
19795 expression. However, as an extension, we allow VLAs
19796 in function scopes as long as they aren't part of a
19797 parameter declaration. */
19801 }
19804 {
19805 /* Remember this wasn't a constant-expression. */
19808 }
19809 }
19810 else
19812 /* Look for the closing `]'. */
19814 {
19817 }
19822 }
19824 {
19825 {
19826 tree qualifying_scope;
19827 tree unqualified_name;
19828 tree attrs;
19829 special_function_kind sfk;
19834 /* Parse a declarator-id */
19837 {
19840 /* If we see an ellipsis, we should be looking at a
19841 parameter pack. */
19843 {
19844 /* Consume the `...' */
19848 }
19849 }
19852 unqualified_name
19856 {
19860 {
19861 /* Check whether an error occurred. */
19864 /* We already consumed the ellipsis to mark a
19865 parameter pack, but we have no way to report it,
19866 so abort the tentative parse. We will be exiting
19867 immediately anyway. */
19869 }
19870 else
19876 && (qualifying_scope
19878 {
19881 }
19882 }
19887 {
19892 }
19898 {
19899 /* In the declaration of a member of a template class
19900 outside of the class itself, the SCOPE will sometimes
19901 be a TYPENAME_TYPE. For example, given:
19903 template <typename T>
19904 int S<T>::R::i = 3;
19906 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19907 this context, we must resolve S<T>::R to an ordinary
19908 type, rather than a typename type.
19910 The reason we normally avoid resolving TYPENAME_TYPEs
19911 is that a specialization of `S' might render
19912 `S<T>::R' not a type. However, if `S' is
19913 specialized, then this `i' will not be used, so there
19914 is no harm in resolving the types here. */
19915 tree type;
19917 /* Resolve the TYPENAME_TYPE. */
19920 /* If that failed, the declarator is invalid. */
19922 {
19925 "cannot define member of dependent typedef "
19927 else
19932 }
19934 }
19939 {
19940 tree class_type;
19945 else
19949 {
19952 {
19955 {
19959 "use %<%T::%D%> instead of %<%T::%D%> to "
19961 class_type,
19966 }
19967 else
19969 }
19970 else
19971 {
19972 /* We do not attempt to print the declarator
19973 here because we do not have enough
19974 information about its original syntactic
19975 form. */
19979 }
19980 }
19983 {
19989 for an unnamed type, even if the type
19990 got a name for linkage purposes. */
19992 /* Handle correctly (c++/19200):
19994 struct S {
19995 struct T{};
19996 friend void S(T);
19997 };
19999 and also:
20001 namespace N {
20002 void S();
20003 }
20005 struct S {
20006 friend void N::S();
20007 }; */
20008 && !(friend_p
20011 class_type))
20012 {
20015 }
20023 }
20024 }
20026 unqualified_name,
20027 sfk);
20034 }
20036 handle_declarator:;
20039 {
20040 /* Any names that appear after the declarator-id for a
20041 member are looked up in the containing scope. */
20043 {
20044 /* But declarations with qualified-ids can't appear in a
20045 function. */
20049 }
20051 }
20055 /* Default args are only allowed on function
20056 declarations. */
20058 else
20062 }
20063 /* We're done. */
20064 else
20066 }
20068 /* For an abstract declarator, we might wind up with nothing at this
20069 point. That's an error; the declarator is not optional. */
20073 /* If we entered a scope, we must exit it now. */
20081 }
20083 /* Parse a ptr-operator.
20085 ptr-operator:
20086 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20087 * cv-qualifier-seq [opt]
20088 &
20089 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20090 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20092 GNU Extension:
20094 ptr-operator:
20095 & cv-qualifier-seq [opt]
20097 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20098 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20099 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20100 filled in with the TYPE containing the member. *CV_QUALS is
20101 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20102 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20103 Note that the tree codes returned by this function have nothing
20104 to do with the types of trees that will be eventually be created
20105 to represent the pointer or reference type being parsed. They are
20106 just constants with suggestive names. */
20107 static enum tree_code
20112 {
20117 /* Assume that it's not a pointer-to-member. */
20119 /* And that there are no cv-qualifiers. */
20122 /* Peek at the next token. */
20125 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20135 {
20136 /* Consume the `*', `&' or `&&'. */
20139 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20140 `&', if we are allowing GNU extensions. (The only qualifier
20141 that can legally appear after `&' is `restrict', but that is
20142 enforced during semantic analysis. */
20150 }
20151 else
20152 {
20153 /* Try the pointer-to-member case. */
20155 /* Look for the optional `::' operator. */
20158 /* Look for the nested-name specifier. */
20165 /* If we found it, and the next token is a `*', then we are
20166 indeed looking at a pointer-to-member operator. */
20169 {
20170 /* Indicate that the `*' operator was used. */
20178 else
20179 {
20180 /* The type of which the member is a member is given by the
20181 current SCOPE. */
20183 /* The next name will not be qualified. */
20187 /* Look for optional c++11 attributes. */
20191 /* Look for the optional cv-qualifier-seq. */
20193 }
20194 }
20195 /* If that didn't work we don't have a ptr-operator. */
20198 }
20201 }
20203 /* Parse an (optional) cv-qualifier-seq.
20205 cv-qualifier-seq:
20206 cv-qualifier cv-qualifier-seq [opt]
20208 cv-qualifier:
20209 const
20210 volatile
20212 GNU Extension:
20214 cv-qualifier:
20215 __restrict__
20217 Returns a bitmask representing the cv-qualifiers. */
20219 static cp_cv_quals
20221 {
20225 {
20227 cp_cv_quals cv_qualifier;
20229 /* Peek at the next token. */
20231 /* See if it's a cv-qualifier. */
20233 {
20249 }
20255 {
20258 }
20259 else
20260 {
20263 }
20264 }
20267 }
20269 /* Parse an (optional) ref-qualifier
20271 ref-qualifier:
20272 &
20273 &&
20275 Returns cp_ref_qualifier representing ref-qualifier. */
20277 static cp_ref_qualifier
20279 {
20282 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20287 {
20292 {
20304 }
20309 {
20312 }
20313 else
20314 {
20317 }
20318 }
20321 }
20323 /* Parse an optional tx-qualifier.
20325 tx-qualifier:
20326 transaction_safe
20327 transaction_safe_dynamic */
20329 static tree
20331 {
20334 {
20339 {
20343 {
20346 {
20349 }
20350 else
20352 }
20353 }
20354 }
20356 }
20358 /* Parse an (optional) virt-specifier-seq.
20360 virt-specifier-seq:
20361 virt-specifier virt-specifier-seq [opt]
20363 virt-specifier:
20364 override
20365 final
20367 Returns a bitmask representing the virt-specifiers. */
20369 static cp_virt_specifiers
20371 {
20375 {
20377 cp_virt_specifiers virt_specifier;
20379 /* Peek at the next token. */
20381 /* See if it's a virt-specifier-qualifier. */
20385 {
20388 }
20390 {
20393 }
20395 {
20397 }
20398 else
20402 {
20405 }
20406 else
20407 {
20410 }
20411 }
20413 }
20415 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20416 is in scope even though it isn't real. */
20418 void
20420 {
20421 tree this_parm;
20424 {
20425 /* We don't clear this between NSDMIs. Is it already what we want? */
20430 }
20433 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20435 current_class_ref
20438 }
20440 /* Return true iff our current scope is a non-static data member
20441 initializer. */
20443 bool
20445 {
20446 /* We recognize NSDMI context by the context-less 'this' pointer set up
20447 by the function above. */
20453 }
20455 /* Return true iff our current scope is a default capturing generic lambda
20456 defined within a template. FIXME: This is part of a workaround (see
20457 semantics.c) to handle building lambda closure types correctly in templates
20458 which we ultimately want to defer to instantiation time. */
20460 bool
20462 {
20480 }
20482 /* Parse a late-specified return type, if any. This is not a separate
20483 non-terminal, but part of a function declarator, which looks like
20485 -> trailing-type-specifier-seq abstract-declarator(opt)
20487 Returns the type indicated by the type-id.
20489 In addition to this, parse any queued up #pragma omp declare simd
20490 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20491 #pragma acc routine clauses.
20493 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20494 function. */
20496 static tree
20499 {
20503 && declarator
20510 && declarator
20513 /* Peek at the next token. */
20515 /* A late-specified return type is indicated by an initial '->'. */
20526 {
20527 /* DR 1207: 'this' is in scope in the trailing return type. */
20529 }
20532 {
20533 /* Consume the ->. */
20537 }
20539 /* Function declarations may be followed by a trailing
20540 requires-clause. */
20544 declarator->attributes
20548 declarator->attributes
20552 declarator->attributes
20557 {
20560 }
20563 }
20565 /* Parse a declarator-id.
20567 declarator-id:
20568 id-expression
20569 :: [opt] nested-name-specifier [opt] type-name
20571 In the `id-expression' case, the value returned is as for
20572 cp_parser_id_expression if the id-expression was an unqualified-id.
20573 If the id-expression was a qualified-id, then a SCOPE_REF is
20574 returned. The first operand is the scope (either a NAMESPACE_DECL
20575 or TREE_TYPE), but the second is still just a representation of an
20576 unqualified-id. */
20578 static tree
20580 {
20581 tree id;
20582 /* The expression must be an id-expression. Assume that qualified
20583 names are the names of types so that:
20585 template <class T>
20586 int S<T>::R::i = 3;
20588 will work; we must treat `S<T>::R' as the name of a type.
20589 Similarly, assume that qualified names are templates, where
20590 required, so that:
20592 template <class T>
20593 int S<T>::R<T>::i = 3;
20595 will work, too. */
20601 optional_p);
20605 }
20607 /* Parse a type-id.
20609 type-id:
20610 type-specifier-seq abstract-declarator [opt]
20612 Returns the TYPE specified. */
20614 static tree
20617 {
20618 cp_decl_specifier_seq type_specifier_seq;
20621 /* Parse the type-specifier-seq. */
20623 is_trailing_return,
20628 /* A bare template name as a template argument is a template template
20629 argument, not a placeholder, so fail parsing it as a type argument. */
20630 {
20634 }
20638 /* There might or might not be an abstract declarator. */
20640 /* Look for the declarator. */
20641 abstract_declarator
20646 /* Check to see if there really was a declarator. */
20651 /* The concepts TS allows 'auto' as a type-id. */
20653 /* None of the valid uses of 'auto' in C++14 involve the type-id
20654 nonterminal, but it is valid in a trailing-return-type. */
20657 {
20658 /* A type-id with type 'auto' is only ok if the abstract declarator
20659 is a function declarator with a late-specified return type.
20661 A type-id with 'auto' is also valid in a trailing-return-type
20662 in a compound-requirement. */
20669 else
20670 {
20673 {
20675 auto_node);
20677 tmpl);
20678 }
20679 else
20682 }
20683 }
20686 is_template_arg);
20687 }
20689 static tree
20691 {
20693 }
20695 static tree
20697 {
20698 tree r;
20700 parser->type_definition_forbidden_message
20705 {
20708 }
20710 }
20712 static tree
20714 {
20716 }
20718 /* Parse a type-specifier-seq.
20720 type-specifier-seq:
20721 type-specifier type-specifier-seq [opt]
20723 GNU extension:
20725 type-specifier-seq:
20726 attributes type-specifier-seq [opt]
20728 If IS_DECLARATION is true, we are at the start of a "condition" or
20729 exception-declaration, so we might be followed by a declarator-id.
20731 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20732 i.e. we've just seen "->".
20734 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20736 static void
20741 {
20746 /* Clear the TYPE_SPECIFIER_SEQ. */
20749 /* In the context of a trailing return type, enum E { } is an
20750 elaborated-type-specifier followed by a function-body, not an
20751 enum-specifier. */
20755 /* Parse the type-specifiers and attributes. */
20757 {
20758 tree type_specifier;
20761 /* Check for attributes first. */
20763 {
20768 }
20770 /* record the token of the beginning of the type specifier seq,
20771 for error reporting purposes*/
20775 /* Look for the type-specifier. */
20777 flags,
20778 type_specifier_seq,
20780 NULL,
20783 {
20784 /* If the first type-specifier could not be found, this is not a
20785 type-specifier-seq at all. */
20787 {
20788 /* Set in_declarator_p to avoid skipping to the semicolon. */
20800 }
20801 /* If subsequent type-specifiers could not be found, the
20802 type-specifier-seq is complete. */
20804 }
20807 /* The standard says that a condition can be:
20809 type-specifier-seq declarator = assignment-expression
20811 However, given:
20813 struct S {};
20814 if (int S = ...)
20816 we should treat the "S" as a declarator, not as a
20817 type-specifier. The standard doesn't say that explicitly for
20818 type-specifier-seq, but it does say that for
20819 decl-specifier-seq in an ordinary declaration. Perhaps it
20820 would be clearer just to allow a decl-specifier-seq here, and
20821 then add a semantic restriction that if any decl-specifiers
20822 that are not type-specifiers appear, the program is invalid. */
20825 }
20826 }
20828 /* Return whether the function currently being declared has an associated
20829 template parameter list. */
20831 static bool
20833 {
20846 }
20848 /* Parse a parameter-declaration-clause.
20850 parameter-declaration-clause:
20851 parameter-declaration-list [opt] ... [opt]
20852 parameter-declaration-list , ...
20854 Returns a representation for the parameter declarations. A return
20855 value of NULL indicates a parameter-declaration-clause consisting
20856 only of an ellipsis. */
20858 static tree
20860 {
20861 tree parameters;
20870 parser->auto_is_implicit_function_template_parm_p
20872 }
20878 && !processing_template_parmlist
20884 /* Peek at the next token. */
20886 /* Check for trivial parameter-declaration-clauses. */
20888 {
20889 /* Consume the `...' token. */
20892 }
20894 /* There are no parameters. */
20895 {
20896 #ifndef NO_IMPLICIT_EXTERN_C
20901 else
20902 #endif
20904 }
20905 /* Check for `(void)', too, which is a special case. */
20909 {
20910 /* Consume the `void' token. */
20912 /* There are no parameters. */
20914 }
20916 /* Parse the parameter-declaration-list. */
20918 /* If a parse error occurred while parsing the
20919 parameter-declaration-list, then the entire
20920 parameter-declaration-clause is erroneous. */
20924 /* Peek at the next token. */
20926 /* If it's a `,', the clause should terminate with an ellipsis. */
20928 {
20929 /* Consume the `,'. */
20931 /* Expect an ellipsis. */
20932 ellipsis_p
20934 }
20935 /* It might also be `...' if the optional trailing `,' was
20936 omitted. */
20938 {
20939 /* Consume the `...' token. */
20941 /* And remember that we saw it. */
20943 }
20944 else
20947 /* Finish the parameter list. */
20952 }
20954 /* Parse a parameter-declaration-list.
20956 parameter-declaration-list:
20957 parameter-declaration
20958 parameter-declaration-list , parameter-declaration
20960 Returns a representation of the parameter-declaration-list, as for
20961 cp_parser_parameter_declaration_clause. However, the
20962 `void_list_node' is never appended to the list. Upon return,
20963 *IS_ERROR will be true iff an error occurred. */
20965 static tree
20967 {
20973 /* Assume all will go well. */
20975 /* The special considerations that apply to a function within an
20976 unbraced linkage specifications do not apply to the parameters
20977 to the function. */
20978 saved_in_unbraced_linkage_specification_p
20982 /* Look for more parameters. */
20984 {
20992 /* Parse the parameter. */
20993 parameter
20998 /* We don't know yet if the enclosing context is deprecated, so wait
20999 and warn in grokparms if appropriate. */
21003 {
21004 /* If a function parameter pack was specified and an implicit template
21005 parameter was introduced during cp_parser_parameter_declaration,
21006 change any implicit parameters introduced into packs. */
21010 {
21018 }
21022 PARM,
21025 }
21029 /* If a parse error occurred parsing the parameter declaration,
21030 then the entire parameter-declaration-list is erroneous. */
21032 {
21036 }
21046 {
21050 }
21052 /* Add the new parameter to the list. */
21056 /* Peek at the next token. */
21059 /* These are for Objective-C++ */
21062 /* The parameter-declaration-list is complete. */
21065 {
21068 /* Peek at the next token. */
21070 /* If it's an ellipsis, then the list is complete. */
21073 /* Otherwise, there must be more parameters. Consume the
21074 `,'. */
21076 /* When parsing something like:
21078 int i(float f, double d)
21080 we can tell after seeing the declaration for "f" that we
21081 are not looking at an initialization of a variable "i",
21082 but rather at the declaration of a function "i".
21084 Due to the fact that the parsing of template arguments
21085 (as specified to a template-id) requires backtracking we
21086 cannot use this technique when inside a template argument
21087 list. */
21091 /* However, a parameter-declaration of the form
21092 "float(f)" (which is a valid declaration of a
21093 parameter "f") can also be interpreted as an
21094 expression (the conversion of "f" to "float"). */
21097 }
21098 else
21099 {
21107 }
21108 }
21110 parser->in_unbraced_linkage_specification_p
21113 /* Reset implicit_template_scope if we are about to leave the function
21114 parameter list that introduced it. Note that for out-of-line member
21115 definitions, there will be one or more class scopes before we get to
21116 the template parameter scope. */
21120 {
21124 {
21127 }
21128 }
21131 }
21133 /* Parse a parameter declaration.
21135 parameter-declaration:
21136 decl-specifier-seq ... [opt] declarator
21137 decl-specifier-seq declarator = assignment-expression
21138 decl-specifier-seq ... [opt] abstract-declarator [opt]
21139 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21141 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21142 declares a template parameter. (In that case, a non-nested `>'
21143 token encountered during the parsing of the assignment-expression
21144 is not interpreted as a greater-than operator.)
21146 Returns a representation of the parameter, or NULL if an error
21147 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21148 true iff the declarator is of the form "(p)". */
21154 {
21156 cp_decl_specifier_seq decl_specifiers;
21158 tree default_argument;
21163 /* In a template parameter, `>' is not an operator.
21165 [temp.param]
21167 When parsing a default template-argument for a non-type
21168 template-parameter, the first non-nested `>' is taken as the end
21169 of the template parameter-list rather than a greater-than
21170 operator. */
21172 /* Type definitions may not appear in parameter types. */
21174 parser->type_definition_forbidden_message
21177 /* Parse the declaration-specifiers. */
21179 CP_PARSER_FLAGS_NONE,
21183 /* Complain about missing 'typename' or other invalid type names. */
21188 /* If an error occurred, there's no reason to attempt to parse the
21189 rest of the declaration. */
21191 {
21194 }
21196 /* Peek at the next token. */
21199 /* If the next token is a `)', `,', `=', `>', or `...', then there
21200 is no declarator. However, when variadic templates are enabled,
21201 there may be a declarator following `...'. */
21206 {
21210 }
21211 /* Otherwise, there should be a declarator. */
21212 else
21213 {
21217 /* After seeing a decl-specifier-seq, if the next token is not a
21218 "(", there is no possibility that the code is a valid
21219 expression. Therefore, if parsing tentatively, we commit at
21220 this point. */
21222 /* In an expression context, having seen:
21224 (int((char ...
21226 we cannot be sure whether we are looking at a
21227 function-type (taking a "char" as a parameter) or a cast
21228 of some object of type "char" to "int". */
21234 /* Parse the declarator. */
21237 CP_PARSER_DECLARATOR_EITHER,
21239 parenthesized_p,
21243 /* After the declarator, allow more attributes. */
21244 decl_specifiers.attributes
21248 /* If the declarator is a template parameter pack, remember that and
21249 clear the flag in the declarator itself so we don't get errors
21250 from grokdeclarator. */
21252 {
21255 }
21256 }
21258 /* If the next token is an ellipsis, and we have not seen a declarator
21259 name, and if either the type of the declarator contains parameter
21260 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21261 for, eg, abbreviated integral type names), then we actually have a
21262 parameter pack expansion expression. Otherwise, leave the ellipsis
21263 for a C-style variadic function. */
21266 {
21277 {
21278 /* Consume the `...'. */
21282 /* Build a pack expansion type */
21287 else
21289 }
21290 }
21292 /* The restriction on defining new types applies only to the type
21293 of the parameter, not to the default argument. */
21296 /* If the next token is `=', then process a default argument. */
21298 {
21301 /* If we are defining a class, then the tokens that make up the
21302 default argument must be saved and processed later. */
21308 // A constrained-type-specifier may declare a type template-parameter.
21310 default_argument
21313 // A constrained-type-specifier may declare a template-template-parameter.
21315 default_argument
21318 /* Outside of a class definition, we can just parse the
21319 assignment-expression. */
21320 else
21321 default_argument
21325 {
21327 "default arguments are only "
21329 }
21331 || template_parameter_pack_p
21334 {
21335 /* Find the name of the parameter pack. */
21342 template_parm_p
21348 else
21350 template_parm_p
21357 }
21358 }
21359 else
21363 declarator,
21364 default_argument,
21365 template_parameter_pack_p);
21366 }
21368 /* Parse a default argument and return it.
21370 TEMPLATE_PARM_P is true if this is a default argument for a
21371 non-type template parameter. */
21372 static tree
21374 {
21380 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21381 set correctly. */
21384 /* Local variable names (and the `this' keyword) may not
21385 appear in a default argument. */
21388 /* Parse the assignment-expression. */
21393 /* The "this" pointer is not valid in a default argument. */
21395 {
21400 }
21401 default_argument
21403 /* Restore the "this" pointer. */
21405 {
21408 }
21417 }
21419 /* Parse a function-body.
21421 function-body:
21422 compound_statement */
21424 static void
21426 {
21430 }
21432 /* Parse a ctor-initializer-opt followed by a function-body. Return
21433 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21434 is true we are parsing a function-try-block. */
21436 static bool
21439 {
21447 /* Begin the function body. */
21449 /* Parse the optional ctor-initializer. */
21452 /* If we're parsing a constexpr constructor definition, we need
21453 to check that the constructor body is indeed empty. However,
21454 before we get to cp_parser_function_body lot of junk has been
21455 generated, so we can't just check that we have an empty block.
21456 Rather we take a snapshot of the outermost block, and check whether
21457 cp_parser_function_body changed its state. */
21459 {
21463 }
21464 /* Parse the function-body. */
21468 /* Finish the function body. */
21472 }
21474 /* Parse an initializer.
21476 initializer:
21477 = initializer-clause
21478 ( expression-list )
21480 Returns an expression representing the initializer. If no
21481 initializer is present, NULL_TREE is returned.
21483 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21484 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21485 set to TRUE if there is no initializer present. If there is an
21486 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21487 is set to true; otherwise it is set to false. */
21489 static tree
21492 {
21494 tree init;
21496 /* Peek at the next token. */
21499 /* Let our caller know whether or not this initializer was
21500 parenthesized. */
21502 /* Assume that the initializer is constant. */
21506 {
21507 /* Consume the `='. */
21509 /* Parse the initializer-clause. */
21511 }
21513 {
21518 non_constant_p);
21523 }
21525 {
21530 }
21531 else
21532 {
21533 /* Anything else is an error. */
21536 }
21542 }
21544 /* Parse an initializer-clause.
21546 initializer-clause:
21547 assignment-expression
21548 braced-init-list
21550 Returns an expression representing the initializer.
21552 If the `assignment-expression' production is used the value
21553 returned is simply a representation for the expression.
21555 Otherwise, calls cp_parser_braced_list. */
21557 static cp_expr
21559 {
21560 cp_expr initializer;
21562 /* Assume the expression is constant. */
21565 /* If it is not a `{', then we are looking at an
21566 assignment-expression. */
21568 {
21569 initializer
21572 non_constant_p);
21573 }
21574 else
21578 }
21580 /* Parse a brace-enclosed initializer list.
21582 braced-init-list:
21583 { initializer-list , [opt] }
21584 { }
21586 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21587 the elements of the initializer-list (or NULL, if the last
21588 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21589 NULL_TREE. There is no way to detect whether or not the optional
21590 trailing `,' was provided. NON_CONSTANT_P is as for
21591 cp_parser_initializer. */
21593 static cp_expr
21595 {
21596 tree initializer;
21599 /* Consume the `{' token. */
21601 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21603 /* If it's not a `}', then there is a non-trivial initializer. */
21605 {
21606 /* Parse the initializer list. */
21609 /* A trailing `,' token is allowed. */
21612 }
21613 else
21615 /* Now, there should be a trailing `}'. */
21621 /* Build a location of the form:
21622 { ... }
21623 ^~~~~~~
21624 with caret==start at the open brace, finish at the close brace. */
21628 }
21630 /* Consume tokens up to, and including, the next non-nested closing `]'.
21631 Returns true iff we found a closing `]'. */
21633 static bool
21635 {
21639 {
21643 {
21646 /* If we've run out of tokens, then there is no closing `]'. */
21655 {
21658 }
21663 }
21665 /* Consume the token. */
21667 }
21668 }
21670 /* Return true if we are looking at an array-designator, false otherwise. */
21672 static bool
21674 {
21675 /* Consume the `['. */
21680 /* Skip tokens until the next token is a closing square bracket.
21681 If we find the closing `]', and the next token is a `=', then
21682 we are looking at an array designator. */
21683 bool array_designator_p
21687 /* Roll back the tokens we skipped. */
21691 }
21693 /* Parse an initializer-list.
21695 initializer-list:
21696 initializer-clause ... [opt]
21697 initializer-list , initializer-clause ... [opt]
21699 GNU Extension:
21701 initializer-list:
21702 designation initializer-clause ...[opt]
21703 initializer-list , designation initializer-clause ...[opt]
21705 designation:
21706 . identifier =
21707 identifier :
21708 [ constant-expression ] =
21710 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21711 for the initializer. If the INDEX of the elt is non-NULL, it is the
21712 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21713 as for cp_parser_initializer. */
21717 {
21720 /* Assume all of the expressions are constant. */
21723 /* Parse the rest of the list. */
21725 {
21727 tree designator;
21728 tree initializer;
21731 /* If the next token is an identifier and the following one is a
21732 colon, we are looking at the GNU designated-initializer
21733 syntax. */
21737 {
21738 /* Warn the user that they are using an extension. */
21741 /* Consume the identifier. */
21743 /* Consume the `:'. */
21745 }
21746 /* Also handle the C99 syntax, '. id ='. */
21751 {
21752 /* Warn the user that they are using an extension. */
21755 /* Consume the `.'. */
21757 /* Consume the identifier. */
21759 /* Consume the `='. */
21761 }
21762 /* Also handle C99 array designators, '[ const ] ='. */
21766 {
21767 /* In C++11, [ could start a lambda-introducer. */
21773 {
21776 }
21777 else
21778 {
21783 }
21789 }
21790 else
21793 /* Parse the initializer. */
21796 /* If any clause is non-constant, so is the entire initializer. */
21800 /* If we have an ellipsis, this is an initializer pack
21801 expansion. */
21803 {
21804 /* Consume the `...'. */
21807 /* Turn the initializer into an initializer expansion. */
21809 }
21811 /* Add it to the vector. */
21814 /* If the next token is not a comma, we have reached the end of
21815 the list. */
21819 /* Peek at the next token. */
21821 /* If the next token is a `}', then we're still done. An
21822 initializer-clause can have a trailing `,' after the
21823 initializer-list and before the closing `}'. */
21827 /* Consume the `,' token. */
21829 }
21832 }
21834 /* Classes [gram.class] */
21836 /* Parse a class-name.
21838 class-name:
21839 identifier
21840 template-id
21842 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21843 to indicate that names looked up in dependent types should be
21844 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21845 keyword has been used to indicate that the name that appears next
21846 is a template. TAG_TYPE indicates the explicit tag given before
21847 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21848 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21849 is the class being defined in a class-head. If ENUM_OK is TRUE,
21850 enum-names are also accepted.
21852 Returns the TYPE_DECL representing the class. */
21854 static tree
21863 {
21864 tree decl;
21865 tree scope;
21870 /* All class-names start with an identifier. */
21873 {
21876 }
21878 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21879 to a template-id, so we save it here. */
21884 /* Any name names a type if we're following the `typename' keyword
21885 in a qualified name where the enclosing scope is type-dependent. */
21888 /* Handle the common case (an identifier, but not a template-id)
21889 efficiently. */
21892 {
21896 /* Look for the identifier. */
21900 /* If the next token isn't an identifier, we are certainly not
21901 looking at a class-name. */
21904 /* If we know this is a type-name, there's no need to look it
21905 up. */
21908 else
21909 {
21910 tree ambiguous_decls;
21911 /* If we already know that this lookup is ambiguous, then
21912 we've already issued an error message; there's no reason
21913 to check again. */
21915 {
21918 }
21919 /* If the next token is a `::', then the name must be a type
21920 name.
21922 [basic.lookup.qual]
21924 During the lookup for a name preceding the :: scope
21925 resolution operator, object, function, and enumerator
21926 names are ignored. */
21929 /* Look up the name. */
21931 tag_type,
21934 check_dependency_p,
21938 {
21942 }
21943 }
21944 }
21945 else
21946 {
21947 /* Try a template-id. */
21949 check_dependency_p,
21950 tag_type,
21951 is_declaration);
21954 }
21958 /* If this is a typename, create a TYPENAME_TYPE. */
21960 {
21965 }
21969 /* Check to see that it is really the name of a class. */
21973 /* Situations like this:
21975 template <typename T> struct A {
21976 typename T::template X<int>::I i;
21977 };
21979 are problematic. Is `T::template X<int>' a class-name? The
21980 standard does not seem to be definitive, but there is no other
21981 valid interpretation of the following `::'. Therefore, those
21982 names are considered class-names. */
21983 {
21987 }
21992 /* In Objective-C 2.0, a classname followed by '.' starts a
21993 dot-syntax expression, and it's not a type-name. */
22005 }
22007 /* Parse a class-specifier.
22009 class-specifier:
22010 class-head { member-specification [opt] }
22012 Returns the TREE_TYPE representing the class. */
22014 static tree
22016 {
22017 tree type;
22031 /* Parse the class-head. */
22034 /* If the class-head was a semantic disaster, skip the entire body
22035 of the class. */
22037 {
22041 }
22043 /* Look for the `{'. */
22045 {
22048 }
22053 /* Issue an error message if type-definitions are forbidden here. */
22055 /* Remember that we are defining one more class. */
22057 /* Inside the class, surrounding template-parameter-lists do not
22058 apply. */
22059 saved_num_template_parameter_lists
22062 /* We are not in a function body. */
22065 /* Or in a loop. */
22068 /* Or in a switch. */
22071 /* We are not immediately inside an extern "lang" block. */
22072 saved_in_unbraced_linkage_specification_p
22076 // Associate constraints with the type.
22080 /* Start the class. */
22082 {
22085 }
22089 /* If the type is erroneous, skip the entire body of the class. */
22091 else
22092 /* Parse the member-specification. */
22095 /* Look for the trailing `}'. */
22097 /* Look for trailing attributes to apply to this class. */
22105 /* We've finished a type definition. Check for the common syntax
22106 error of forgetting a semicolon after the definition. We need to
22107 be careful, as we can't just check for not-a-semicolon and be done
22108 with it; the user might have typed:
22110 class X { } c = ...;
22111 class X { } *p = ...;
22113 and so forth. Instead, enumerate all the possible tokens that
22114 might follow this production; if we don't see one of them, then
22115 complain and silently insert the semicolon. */
22116 {
22121 /* Don't try to parse c++11 attributes here. As per the
22122 grammar, that should be a task for
22123 cp_parser_decl_specifier_seq. */
22127 {
22138 /* While it's legal for type qualifiers and storage class
22139 specifiers to follow type definitions in the grammar, only
22140 compiler testsuites contain code like that. Assume that if
22141 we see such code, then what we're really seeing is a case
22142 like:
22144 class X { }
22145 const <type> var = ...;
22147 or
22149 class Y { }
22150 static <type> func (...) ...
22152 i.e. the qualifier or specifier applies to the next
22153 declaration. To do so, however, we need to look ahead one
22154 more token to see if *that* token is a type specifier.
22156 This code could be improved to handle:
22158 class Z { }
22159 static const <type> var = ...; */
22162 {
22165 /* Handling user-defined types here would be nice, but very
22166 tricky. */
22167 want_semicolon
22170 }
22174 }
22176 /* If we don't have a type, then something is very wrong and we
22177 shouldn't try to do anything clever. Likewise for not seeing the
22178 closing brace. */
22180 {
22181 /* Locate the closing brace. */
22182 cp_token_position prev
22187 /* We want to suggest insertion of a ';' immediately *after* the
22188 closing brace, so, if we can, offset the location by 1 column. */
22195 /* If we successfully offset the location, suggest the fix-it. */
22208 else
22211 /* Unget one token and smash it to look as though we encountered
22212 a semicolon in the input stream. */
22217 }
22218 }
22220 /* If this class is not itself within the scope of another class,
22221 then we need to parse the bodies of all of the queued function
22222 definitions. Note that the queued functions defined in a class
22223 are not always processed immediately following the
22224 class-specifier for that class. Consider:
22226 struct A {
22227 struct B { void f() { sizeof (A); } };
22228 };
22230 If `f' were processed before the processing of `A' were
22231 completed, there would be no way to compute the size of `A'.
22232 Note that the nesting we are interested in here is lexical --
22233 not the semantic nesting given by TYPE_CONTEXT. In particular,
22234 for:
22236 struct A { struct B; };
22237 struct A::B { void f() { } };
22239 there is no need to delay the parsing of `A::B::f'. */
22241 {
22242 tree decl;
22249 /* In a first pass, parse default arguments to the functions.
22250 Then, in a second pass, parse the bodies of the functions.
22251 This two-phased approach handles cases like:
22253 struct S {
22254 void f() { g(); }
22255 void g(int i = 3);
22256 };
22258 */
22260 {
22262 /* If there are default arguments that have not yet been processed,
22263 take care of them now. */
22265 {
22270 }
22271 /* Make sure that any template parameters are in scope. */
22273 /* Parse the default argument expressions. */
22275 /* Remove any template parameters from the symbol table. */
22277 }
22279 /* Now parse any NSDMIs. */
22283 {
22285 {
22290 }
22293 }
22300 /* Now do some post-NSDMI bookkeeping. */
22306 /* Now parse the body of the functions. */
22308 {
22309 /* OpenMP UDRs need to be parsed before all other functions. */
22316 }
22317 else
22321 }
22322 else
22325 /* Put back any saved access checks. */
22328 /* Restore saved state. */
22332 parser->num_template_parameter_lists
22334 parser->in_unbraced_linkage_specification_p
22338 }
22340 static tree
22342 {
22343 tree ret;
22348 }
22350 /* Parse a class-head.
22352 class-head:
22353 class-key identifier [opt] base-clause [opt]
22354 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22355 class-key nested-name-specifier [opt] template-id
22356 base-clause [opt]
22358 class-virt-specifier:
22359 final
22361 GNU Extensions:
22362 class-key attributes identifier [opt] base-clause [opt]
22363 class-key attributes nested-name-specifier identifier base-clause [opt]
22364 class-key attributes nested-name-specifier [opt] template-id
22365 base-clause [opt]
22367 Upon return BASES is initialized to the list of base classes (or
22368 NULL, if there are none) in the same form returned by
22369 cp_parser_base_clause.
22371 Returns the TYPE of the indicated class. Sets
22372 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22373 involving a nested-name-specifier was used, and FALSE otherwise.
22375 Returns error_mark_node if this is not a class-head.
22377 Returns NULL_TREE if the class-head is syntactically valid, but
22378 semantically invalid in a way that means we should skip the entire
22379 body of the class. */
22381 static tree
22384 {
22385 tree nested_name_specifier;
22389 tree attributes;
22390 tree bases;
22400 /* Assume no nested-name-specifier will be present. */
22402 /* Assume no template parameter lists will be used in defining the
22403 type. */
22407 /* Look for the class-key. */
22414 /* Parse the attributes. */
22417 /* If the next token is `::', that is invalid -- but sometimes
22418 people do try to write:
22420 struct ::S {};
22422 Handle this gracefully by accepting the extra qualifier, and then
22423 issuing an error about it later if this really is a
22424 class-head. If it turns out just to be an elaborated type
22425 specifier, remain silent. */
22431 /* Determine the name of the class. Begin by looking for an
22432 optional nested-name-specifier. */
22434 nested_name_specifier
22440 /* If there was a nested-name-specifier, then there *must* be an
22441 identifier. */
22443 {
22445 /* Although the grammar says `identifier', it really means
22446 `class-name' or `template-name'. You are only allowed to
22447 define a class that has already been declared with this
22448 syntax.
22450 The proposed resolution for Core Issue 180 says that wherever
22451 you see `class T::X' you should treat `X' as a type-name.
22453 It is OK to define an inaccessible class; for example:
22455 class A { class B; };
22456 class A::B {};
22458 We do not know if we will see a class-name, or a
22459 template-name. We look for a class-name first, in case the
22460 class-name is a template-id; if we looked for the
22461 template-name first we would stop after the template-name. */
22466 class_type,
22470 /* If that didn't work, ignore the nested-name-specifier. */
22472 {
22478 }
22479 /* If we could not find a corresponding TYPE, treat this
22480 declaration like an unqualified declaration. */
22483 /* Otherwise, count the number of templates used in TYPE and its
22484 containing scopes. */
22485 else
22486 {
22487 tree scope;
22499 }
22500 }
22501 /* Otherwise, the identifier is optional. */
22502 else
22503 {
22504 /* We don't know whether what comes next is a template-id,
22505 an identifier, or nothing at all. */
22507 /* Check for a template-id. */
22512 class_key,
22514 /* If that didn't work, it could still be an identifier. */
22516 {
22518 {
22521 }
22522 else
22524 }
22525 else
22526 {
22529 }
22530 }
22535 {
22537 class_key,
22539 }
22542 /* If it's not a `:' or a `{' then we can't really be looking at a
22543 class-head, since a class-head only appears as part of a
22544 class-specifier. We have to detect this situation before calling
22545 xref_tag, since that has irreversible side-effects. */
22547 {
22551 }
22553 /* At this point, we're going ahead with the class-specifier, even
22554 if some other problem occurs. */
22557 {
22562 }
22563 /* Issue the error about the overly-qualified name now. */
22565 {
22570 }
22572 {
22577 }
22579 {
22580 tree scope;
22582 /* Reject typedef-names in class heads. */
22584 {
22587 type);
22590 }
22592 /* Figure out in what scope the declaration is being placed. */
22594 /* If that scope does not contain the scope in which the
22595 class was originally declared, the program is invalid. */
22597 {
22600 "declaration of %qD in namespace %qD which does not "
22603 else
22609 }
22610 /* [dcl.meaning]
22612 A declarator-id shall not be qualified except for the
22613 definition of a ... nested class outside of its class
22614 ... [or] the definition or explicit instantiation of a
22615 class member of a namespace outside of its namespace. */
22617 {
22622 }
22623 }
22624 /* An explicit-specialization must be preceded by "template <>". If
22625 it is not, try to recover gracefully. */
22628 && !processing_template_parmlist
22630 {
22631 /* Build a location of this form:
22632 struct typename <ARGS>
22633 ^~~~~~~~~~~~~~~~~~~~~~
22634 with caret==start at the start token, and
22635 finishing at the end of the type. */
22636 location_t reported_loc
22638 class_head_start_location,
22643 error_at_rich_loc
22647 /* Take the same action that would have been taken by
22648 cp_parser_explicit_specialization. */
22651 }
22652 /* There must be no "return" statements between this point and the
22653 end of this function; set "type "to the correct return value and
22654 use "goto done;" to return. */
22655 /* Make sure that the right number of template parameters were
22656 present. */
22660 {
22661 /* If something went wrong, there is no point in even trying to
22662 process the class-definition. */
22665 }
22667 /* Look up the type. */
22669 {
22673 {
22677 }
22678 else
22679 {
22683 /* Check the scope while we still know whether or not we had a
22684 nested-name-specifier. */
22687 }
22690 }
22692 {
22693 tree class_type;
22695 /* Given:
22697 template <typename T> struct S { struct T };
22698 template <typename T> struct S<T>::T { };
22700 we will get a TYPENAME_TYPE when processing the definition of
22701 `S::T'. We need to resolve it to the actual type before we
22702 try to define it. */
22704 {
22709 else
22710 {
22713 }
22714 }
22718 {
22721 }
22724 /* Enter the scope indicated by the nested-name-specifier. */
22726 /* Get the canonical version of this type. */
22728 /* Call push_template_decl if it seems like we should be defining a
22729 template either from the template headers or the type we're
22730 defining, so that we diagnose both extra and missing headers. */
22734 {
22737 {
22740 }
22741 }
22745 }
22747 {
22748 /* If the class was unnamed, create a dummy name. */
22752 ? ts_within_enclosing_non_class
22756 }
22758 /* Indicate whether this class was declared as a `class' or as a
22759 `struct'. */
22764 /* If this type was already complete, and we see another definition,
22765 that's an error. */
22767 {
22769 type);
22771 type);
22774 }
22779 {
22780 /* Apply attributes now, before any use of the class as a template
22781 argument in its base list. */
22784 }
22786 /* We will have entered the scope containing the class; the names of
22787 base classes should be looked up in that context. For example:
22789 struct A { struct B {}; struct C; };
22790 struct A::C : B {};
22792 is valid. */
22794 /* Get the list of base-classes, if there is one. */
22796 {
22797 /* PR59482: enter the class scope so that base-specifiers are looked
22798 up correctly. */
22802 /* PR59482: get out of the previously pushed class scope so that the
22803 subsequent pops pop the right thing. */
22806 }
22807 else
22810 /* If we're really defining a class, process the base classes.
22811 If they're invalid, fail. */
22815 done:
22816 /* Leave the scope given by the nested-name-specifier. We will
22817 enter the class scope itself while processing the members. */
22822 {
22825 }
22831 out:
22834 }
22836 /* Parse a class-key.
22838 class-key:
22839 class
22840 struct
22841 union
22843 Returns the kind of class-key specified, or none_type to indicate
22844 error. */
22846 static enum tag_types
22848 {
22852 /* Look for the class-key. */
22857 /* Check to see if the TOKEN is a class-key. */
22862 }
22864 /* Parse a type-parameter-key.
22866 type-parameter-key:
22867 class
22868 typename
22869 */
22871 static void
22873 {
22874 /* Look for the type-parameter-key. */
22878 {
22881 /* typename is not allowed in a template template parameter
22882 by the standard until C++1Z. */
22884 "ISO C++ forbids typename key in template template parameter;"
22886 }
22887 else
22891 }
22893 /* Parse an (optional) member-specification.
22895 member-specification:
22896 member-declaration member-specification [opt]
22897 access-specifier : member-specification [opt] */
22899 static void
22901 {
22903 {
22907 /* Peek at the next token. */
22909 /* If it's a `}', or EOF then we've seen all the members. */
22915 /* See if this token is a keyword. */
22918 {
22922 /* Consume the access-specifier. */
22924 /* Remember which access-specifier is active. */
22926 /* Look for the `:'. */
22931 /* Accept #pragmas at class scope. */
22933 {
22936 }
22938 /* Otherwise, the next construction must be a
22939 member-declaration. */
22941 }
22942 }
22943 }
22945 /* Parse a member-declaration.
22947 member-declaration:
22948 decl-specifier-seq [opt] member-declarator-list [opt] ;
22949 function-definition ; [opt]
22950 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22951 using-declaration
22952 template-declaration
22953 alias-declaration
22955 member-declarator-list:
22956 member-declarator
22957 member-declarator-list , member-declarator
22959 member-declarator:
22960 declarator pure-specifier [opt]
22961 declarator constant-initializer [opt]
22962 identifier [opt] : constant-expression
22964 GNU Extensions:
22966 member-declaration:
22967 __extension__ member-declaration
22969 member-declarator:
22970 declarator attributes [opt] pure-specifier [opt]
22971 declarator attributes [opt] constant-initializer [opt]
22972 identifier [opt] attributes [opt] : constant-expression
22974 C++0x Extensions:
22976 member-declaration:
22977 static_assert-declaration */
22979 static void
22981 {
22982 cp_decl_specifier_seq decl_specifiers;
22983 tree prefix_attributes;
22984 tree decl;
22993 /* Check for the `__extension__' keyword. */
22995 {
22996 /* Recurse. */
22998 /* Restore the old value of the PEDANTIC flag. */
23002 }
23004 /* Check for a template-declaration. */
23006 {
23007 /* An explicit specialization here is an error condition, and we
23008 expect the specialization handler to detect and report this. */
23012 else
23016 }
23017 /* Check for a template introduction. */
23021 /* Check for a using-declaration. */
23023 {
23025 {
23026 /* Parse the using-declaration. */
23030 }
23031 else
23032 {
23033 tree decl;
23037 /* Note that if we actually see the '=' token after the
23038 identifier, cp_parser_alias_declaration commits the
23039 tentative parse. In that case, we really expect an
23040 alias-declaration. Otherwise, we expect a using
23041 declaration. */
23042 alias_decl_expected =
23048 else
23052 }
23053 }
23055 /* Check for @defs. */
23057 {
23062 {
23067 }
23069 }
23071 /* If the next token is `static_assert' we have a static assertion. */
23073 {
23076 }
23083 /* Parse the decl-specifier-seq. */
23086 CP_PARSER_FLAGS_OPTIONAL,
23089 /* Check for an invalid type-name. */
23093 /* If there is no declarator, then the decl-specifier-seq should
23094 specify a type. */
23096 {
23097 /* If there was no decl-specifier-seq, and the next token is a
23098 `;', then we have something like:
23100 struct S { ; };
23102 [class.mem]
23104 Each member-declaration shall declare at least one member
23105 name of the class. */
23107 {
23111 }
23112 else
23113 {
23114 tree type;
23116 /* See if this declaration is a friend. */
23118 /* If there were decl-specifiers, check to see if there was
23119 a class-declaration. */
23122 /* Nested classes have already been added to the class, but
23123 a `friend' needs to be explicitly registered. */
23125 {
23126 /* If the `friend' keyword was present, the friend must
23127 be introduced with a class-key. */
23130 "in C++03 a class-key must be used "
23132 /* In this case:
23134 template <typename T> struct A {
23135 friend struct A<T>::B;
23136 };
23138 A<T>::B will be represented by a TYPENAME_TYPE, and
23139 therefore not recognized by check_tag_decl. */
23141 {
23145 }
23148 "friend declaration does not name a class or "
23150 else
23153 }
23154 /* If there is no TYPE, an error message will already have
23155 been issued. */
23157 ;
23158 /* An anonymous aggregate has to be handled specially; such
23159 a declaration really declares a data member (with a
23160 particular type), as opposed to a nested class. */
23162 {
23163 /* C++11 9.5/6. */
23166 "a storage class on an anonymous aggregate "
23169 /* Remove constructors and such from TYPE, now that we
23170 know it is an anonymous aggregate. */
23172 /* And make the corresponding data member. */
23175 /* Add it to the class. */
23177 }
23178 else
23179 cp_parser_check_access_in_redeclaration
23182 }
23183 }
23184 else
23185 {
23188 /* Clear attributes from the decl_specifiers but keep them
23189 around as prefix attributes that apply them to the entity
23190 being declared. */
23194 /* See if these declarations will be friends. */
23197 /* Keep going until we hit the `;' at the end of the
23198 declaration. */
23200 {
23202 tree first_attribute;
23204 /* Peek at the next token. */
23207 /* Check for a bitfield declaration. */
23212 {
23213 tree identifier;
23214 tree width;
23216 /* Get the name of the bitfield. Note that we cannot just
23217 check TOKEN here because it may have been invalidated by
23218 the call to cp_lexer_peek_nth_token above. */
23221 else
23224 /* Consume the `:' token. */
23226 /* Get the width of the bitfield. */
23227 width
23230 /* Look for attributes that apply to the bitfield. */
23232 /* Remember which attributes are prefix attributes and
23233 which are not. */
23235 /* Combine the attributes. */
23238 /* Create the bitfield declaration. */
23241 identifier,
23242 sfk_none)
23245 width,
23246 attributes);
23247 }
23248 else
23249 {
23251 tree initializer;
23252 tree asm_specification;
23255 /* Parse the declarator. */
23256 declarator
23261 friend_p);
23263 /* If something went wrong parsing the declarator, make sure
23264 that we at least consume some tokens. */
23266 {
23267 /* Skip to the end of the statement. */
23269 /* If the next token is not a semicolon, that is
23270 probably because we just skipped over the body of
23271 a function. So, we consume a semicolon if
23272 present, but do not issue an error message if it
23273 is not present. */
23275 CPP_SEMICOLON))
23278 }
23281 cp_parser_check_for_definition_in_return_type
23285 /* Look for an asm-specification. */
23287 /* Look for attributes that apply to the declaration. */
23289 /* Remember which attributes are prefix attributes and
23290 which are not. */
23292 /* Combine the attributes. */
23295 /* If it's an `=', then we have a constant-initializer or a
23296 pure-specifier. It is not correct to parse the
23297 initializer before registering the member declaration
23298 since the member declaration should be in scope while
23299 its initializer is processed. However, the rest of the
23300 front end does not yet provide an interface that allows
23301 us to handle this correctly. */
23303 {
23304 /* In [class.mem]:
23306 A pure-specifier shall be used only in the declaration of
23307 a virtual function.
23309 A member-declarator can contain a constant-initializer
23310 only if it declares a static member of integral or
23311 enumeration type.
23313 Therefore, if the DECLARATOR is for a function, we look
23314 for a pure-specifier; otherwise, we look for a
23315 constant-initializer. When we call `grokfield', it will
23316 perform more stringent semantics checks. */
23328 {
23330 /* Don't require a constant rvalue in C++11, since we
23331 might want a reference constant. We'll enforce
23332 constancy later. */
23334 /* Parse the initializer. */
23337 }
23338 else
23339 /* Parse the initializer. */
23341 }
23344 {
23348 else
23350 }
23351 /* Otherwise, there is no initializer. */
23352 else
23355 /* See if we are probably looking at a function
23356 definition. We are certainly not looking at a
23357 member-declarator. Calling `grokfield' has
23358 side-effects, so we must not do it unless we are sure
23359 that we are looking at a member-declarator. */
23362 {
23363 /* The grammar does not allow a pure-specifier to be
23364 used when a member function is defined. (It is
23365 possible that this fact is an oversight in the
23366 standard, since a pure function may be defined
23367 outside of the class-specifier. */
23373 declarator,
23374 attributes);
23377 /* If the member was not a friend, declare it here. */
23380 /* Peek at the next token. */
23382 /* If the next token is a semicolon, consume it. */
23386 }
23387 else
23390 /* Create the declaration. */
23395 {
23398 else
23400 }
23401 }
23406 /* Reset PREFIX_ATTRIBUTES. */
23412 /* If there is any qualification still in effect, clear it
23413 now; we will be starting fresh with the next declarator. */
23417 /* If it's a `,', then there are more declarators. */
23419 {
23422 {
23426 }
23427 }
23428 /* If the next token isn't a `;', then we have a parse error. */
23430 CPP_SEMICOLON))
23431 {
23432 /* The next token might be a ways away from where the
23433 actual semicolon is missing. Find the previous token
23434 and use that for our error position. */
23439 /* Assume that the user meant to provide a semicolon. If
23440 we were to cp_parser_skip_to_end_of_statement, we might
23441 skip to a semicolon inside a member function definition
23442 and issue nonsensical error messages. */
23444 }
23447 {
23448 /* Add DECL to the list of members. */
23450 /* Explicitly include, eg, NSDMIs, for better error
23451 recovery (c++/58650). */
23460 /* Add DECL to the queue of NSDMI to be parsed later. */
23462 }
23466 }
23467 }
23470 out:
23472 }
23474 /* Parse a pure-specifier.
23476 pure-specifier:
23477 = 0
23479 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23480 Otherwise, ERROR_MARK_NODE is returned. */
23482 static tree
23484 {
23487 /* Look for the `=' token. */
23490 /* Look for the `0' token. */
23499 /* Accept = default or = delete in c++0x mode. */
23502 {
23505 }
23507 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23509 {
23514 }
23516 {
23519 }
23522 }
23524 /* Parse a constant-initializer.
23526 constant-initializer:
23527 = constant-expression
23529 Returns a representation of the constant-expression. */
23531 static tree
23533 {
23534 /* Look for the `=' token. */
23538 /* It is invalid to write:
23540 struct S { static const int i = { 7 }; };
23542 */
23544 {
23547 /* Consume the opening brace. */
23549 /* Skip the initializer. */
23551 /* Look for the trailing `}'. */
23555 }
23558 }
23560 /* Derived classes [gram.class.derived] */
23562 /* Parse a base-clause.
23564 base-clause:
23565 : base-specifier-list
23567 base-specifier-list:
23568 base-specifier ... [opt]
23569 base-specifier-list , base-specifier ... [opt]
23571 Returns a TREE_LIST representing the base-classes, in the order in
23572 which they were declared. The representation of each node is as
23573 described by cp_parser_base_specifier.
23575 In the case that no bases are specified, this function will return
23576 NULL_TREE, not ERROR_MARK_NODE. */
23578 static tree
23580 {
23583 /* Look for the `:' that begins the list. */
23586 /* Scan the base-specifier-list. */
23588 {
23590 tree base;
23593 /* Look for the base-specifier. */
23595 /* Look for the (optional) ellipsis. */
23597 {
23598 /* Consume the `...'. */
23602 }
23604 /* Add BASE to the front of the list. */
23606 {
23608 /* Make this a pack expansion type. */
23612 {
23615 }
23616 }
23617 /* Peek at the next token. */
23619 /* If it's not a comma, then the list is complete. */
23622 /* Consume the `,'. */
23624 }
23626 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23627 base class had a qualified name. However, the next name that
23628 appears is certainly not qualified. */
23634 }
23636 /* Parse a base-specifier.
23638 base-specifier:
23639 :: [opt] nested-name-specifier [opt] class-name
23640 virtual access-specifier [opt] :: [opt] nested-name-specifier
23641 [opt] class-name
23642 access-specifier virtual [opt] :: [opt] nested-name-specifier
23643 [opt] class-name
23645 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23646 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23647 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23648 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23650 static tree
23652 {
23660 tree type;
23662 /* Process the optional `virtual' and `access-specifier'. */
23664 {
23665 /* Peek at the next token. */
23667 /* Process `virtual'. */
23669 {
23671 /* If `virtual' appears more than once, issue an error. */
23673 {
23677 }
23681 /* Consume the `virtual' token. */
23689 /* If more than one access specifier appears, issue an
23690 error. */
23693 {
23697 }
23701 /* Consume the access-specifier. */
23709 }
23710 }
23711 /* It is not uncommon to see programs mechanically, erroneously, use
23712 the 'typename' keyword to denote (dependent) qualified types
23713 as base classes. */
23715 {
23720 else
23722 "keyword %<typename%> not allowed in this context "
23725 }
23727 /* Look for the optional `::' operator. */
23729 /* Look for the nested-name-specifier. The simplest way to
23730 implement:
23732 [temp.res]
23734 The keyword `typename' is not permitted in a base-specifier or
23735 mem-initializer; in these contexts a qualified name that
23736 depends on a template-parameter is implicitly assumed to be a
23737 type name.
23739 is to pretend that we have seen the `typename' keyword at this
23740 point. */
23746 /* If the base class is given by a qualified name, assume that names
23747 we see are type names or templates, as appropriate. */
23753 /* DR 950 allows decltype as a base-specifier. */
23755 else
23756 {
23757 /* Otherwise, look for the class-name. */
23759 class_scope_p,
23760 template_p,
23761 typename_type,
23766 }
23772 }
23774 /* Exception handling [gram.exception] */
23776 /* Parse an (optional) noexcept-specification.
23778 noexcept-specification:
23779 noexcept ( constant-expression ) [opt]
23781 If no noexcept-specification is present, returns NULL_TREE.
23782 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23783 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23784 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23785 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23786 in which case a boolean condition is returned instead. */
23788 static tree
23793 {
23797 /* Peek at the next token. */
23800 /* Is it a noexcept-specification? */
23802 {
23803 tree expr;
23807 {
23811 {
23812 /* Types may not be defined in an exception-specification. */
23814 parser->type_definition_forbidden_message
23819 /* Restore the saved message. */
23821 }
23822 else
23823 {
23826 }
23829 }
23830 else
23831 {
23835 }
23837 /* We cannot build a noexcept-spec right away because this will check
23838 that expr is a constexpr. */
23841 else
23843 }
23844 else
23846 }
23848 /* Parse an (optional) exception-specification.
23850 exception-specification:
23851 throw ( type-id-list [opt] )
23853 Returns a TREE_LIST representing the exception-specification. The
23854 TREE_VALUE of each node is a type. */
23856 static tree
23858 {
23860 tree type_id_list;
23863 /* Peek at the next token. */
23866 /* Is it a noexcept-specification? */
23872 /* If it's not `throw', then there's no exception-specification. */
23878 /* Consume the `throw'. */
23881 /* Look for the `('. */
23884 /* Peek at the next token. */
23886 /* If it's not a `)', then there is a type-id-list. */
23888 {
23889 /* Types may not be defined in an exception-specification. */
23891 parser->type_definition_forbidden_message
23893 /* Parse the type-id-list. */
23895 /* Restore the saved message. */
23899 {
23903 }
23906 "dynamic exception specifications are deprecated in "
23908 }
23909 /* In C++17, throw() is equivalent to noexcept (true). throw()
23910 is deprecated in C++11 and above as well, but is still widely used,
23911 so don't warn about it yet. */
23914 else
23917 /* Look for the `)'. */
23921 }
23923 /* Parse an (optional) type-id-list.
23925 type-id-list:
23926 type-id ... [opt]
23927 type-id-list , type-id ... [opt]
23929 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23930 in the order that the types were presented. */
23932 static tree
23934 {
23938 {
23940 tree type;
23944 /* Get the next type-id. */
23946 /* Check for invalid 'auto'. */
23948 {
23952 }
23953 /* Parse the optional ellipsis. */
23955 {
23956 /* Consume the `...'. */
23959 /* Turn the type into a pack expansion expression. */
23961 }
23962 /* Add it to the list. */
23964 /* Peek at the next token. */
23966 /* If it is not a `,', we are done. */
23969 /* Consume the `,'. */
23971 }
23974 }
23976 /* Parse a try-block.
23978 try-block:
23979 try compound-statement handler-seq */
23981 static tree
23983 {
23984 tree try_block;
23998 }
24000 /* Parse a function-try-block.
24002 function-try-block:
24003 try ctor-initializer [opt] function-body handler-seq */
24005 static bool
24007 {
24008 tree compound_stmt;
24009 tree try_block;
24012 /* Look for the `try' keyword. */
24015 /* Let the rest of the front end know where we are. */
24017 /* Parse the function-body. */
24018 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24020 /* We're done with the `try' part. */
24022 /* Parse the handlers. */
24024 /* We're done with the handlers. */
24028 }
24030 /* Parse a handler-seq.
24032 handler-seq:
24033 handler handler-seq [opt] */
24035 static void
24037 {
24039 {
24042 /* Parse the handler. */
24044 /* Peek at the next token. */
24046 /* If it's not `catch' then there are no more handlers. */
24049 }
24050 }
24052 /* Parse a handler.
24054 handler:
24055 catch ( exception-declaration ) compound-statement */
24057 static void
24059 {
24060 tree handler;
24061 tree declaration;
24071 }
24073 /* Parse an exception-declaration.
24075 exception-declaration:
24076 type-specifier-seq declarator
24077 type-specifier-seq abstract-declarator
24078 type-specifier-seq
24079 ...
24081 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24082 ellipsis variant is used. */
24084 static tree
24086 {
24087 cp_decl_specifier_seq type_specifiers;
24091 /* If it's an ellipsis, it's easy to handle. */
24093 {
24094 /* Consume the `...' token. */
24097 }
24099 /* Types may not be defined in exception-declarations. */
24101 parser->type_definition_forbidden_message
24104 /* Parse the type-specifier-seq. */
24108 /* If it's a `)', then there is no declarator. */
24111 else
24118 /* Restore the saved message. */
24125 }
24127 /* Parse a throw-expression.
24129 throw-expression:
24130 throw assignment-expression [opt]
24132 Returns a THROW_EXPR representing the throw-expression. */
24134 static tree
24136 {
24137 tree expression;
24142 /* Figure out whether or not there is an assignment-expression
24143 following the "throw" keyword. */
24151 else
24155 }
24157 /* GNU Extensions */
24159 /* Parse an (optional) asm-specification.
24161 asm-specification:
24162 asm ( string-literal )
24164 If the asm-specification is present, returns a STRING_CST
24165 corresponding to the string-literal. Otherwise, returns
24166 NULL_TREE. */
24168 static tree
24170 {
24172 tree asm_specification;
24174 /* Peek at the next token. */
24176 /* If the next token isn't the `asm' keyword, then there's no
24177 asm-specification. */
24181 /* Consume the `asm' token. */
24183 /* Look for the `('. */
24186 /* Look for the string-literal. */
24189 /* Look for the `)'. */
24193 }
24195 /* Parse an asm-operand-list.
24197 asm-operand-list:
24198 asm-operand
24199 asm-operand-list , asm-operand
24201 asm-operand:
24202 string-literal ( expression )
24203 [ string-literal ] string-literal ( expression )
24205 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24206 each node is the expression. The TREE_PURPOSE is itself a
24207 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24208 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24209 is a STRING_CST for the string literal before the parenthesis. Returns
24210 ERROR_MARK_NODE if any of the operands are invalid. */
24212 static tree
24214 {
24219 {
24220 tree string_literal;
24221 tree expression;
24222 tree name;
24225 {
24226 /* Consume the `[' token. */
24228 /* Read the operand name. */
24233 /* Look for the closing `]'. */
24235 }
24236 else
24238 /* Look for the string-literal. */
24241 /* Look for the `('. */
24243 /* Parse the expression. */
24245 /* Look for the `)'. */
24253 /* Add this operand to the list. */
24255 expression,
24256 asm_operands);
24257 /* If the next token is not a `,', there are no more
24258 operands. */
24261 /* Consume the `,'. */
24263 }
24266 }
24268 /* Parse an asm-clobber-list.
24270 asm-clobber-list:
24271 string-literal
24272 asm-clobber-list , string-literal
24274 Returns a TREE_LIST, indicating the clobbers in the order that they
24275 appeared. The TREE_VALUE of each node is a STRING_CST. */
24277 static tree
24279 {
24283 {
24284 tree string_literal;
24286 /* Look for the string literal. */
24288 /* Add it to the list. */
24290 /* If the next token is not a `,', then the list is
24291 complete. */
24294 /* Consume the `,' token. */
24296 }
24299 }
24301 /* Parse an asm-label-list.
24303 asm-label-list:
24304 identifier
24305 asm-label-list , identifier
24307 Returns a TREE_LIST, indicating the labels in the order that they
24308 appeared. The TREE_VALUE of each node is a label. */
24310 static tree
24312 {
24316 {
24319 /* Look for the identifier. */
24322 {
24325 {
24331 }
24332 }
24333 /* If the next token is not a `,', then the list is
24334 complete. */
24337 /* Consume the `,' token. */
24339 }
24342 }
24344 /* Return TRUE iff the next tokens in the stream are possibly the
24345 beginning of a GNU extension attribute. */
24347 static bool
24349 {
24351 }
24353 /* Return TRUE iff the next tokens in the stream are possibly the
24354 beginning of a standard C++-11 attribute specifier. */
24356 static bool
24358 {
24360 }
24362 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24363 beginning of a standard C++-11 attribute specifier. */
24365 static bool
24367 {
24375 }
24377 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24378 beginning of a GNU extension attribute. */
24380 static bool
24382 {
24386 }
24388 /* Return true iff the next tokens can be the beginning of either a
24389 GNU attribute list, or a standard C++11 attribute sequence. */
24391 static bool
24393 {
24396 }
24398 /* Return true iff the next Nth tokens can be the beginning of either
24399 a GNU attribute list, or a standard C++11 attribute sequence. */
24401 static bool
24403 {
24406 }
24408 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24409 of GNU attributes, or return NULL. */
24411 static tree
24413 {
24417 }
24419 #define CILK_SIMD_FN_CLAUSE_MASK \
24420 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24421 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24422 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24423 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24424 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24426 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24427 vector [(<clauses>)] */
24429 static void
24431 {
24435 {
24441 }
24444 {
24447 paren_scope++;
24448 }
24450 {
24453 paren_scope++;
24455 paren_scope--;
24456 /* Do not push the last ')' */
24459 }
24468 }
24470 /* Parse an (optional) series of attributes.
24472 attributes:
24473 attributes attribute
24475 attribute:
24476 __attribute__ (( attribute-list [opt] ))
24478 The return value is as for cp_parser_gnu_attribute_list. */
24480 static tree
24482 {
24486 {
24488 tree attribute_list;
24491 /* Peek at the next token. */
24493 /* If it's not `__attribute__', then we're done. */
24497 /* Consume the `__attribute__' keyword. */
24499 /* Look for the two `(' tokens. */
24503 /* Peek at the next token. */
24506 /* Parse the attribute-list. */
24508 else
24509 /* If the next token is a `)', then there is no attribute
24510 list. */
24513 /* Look for the two `)' tokens. */
24521 /* Add these new attributes to the list. */
24523 }
24526 }
24528 /* Parse a GNU attribute-list.
24530 attribute-list:
24531 attribute
24532 attribute-list , attribute
24534 attribute:
24535 identifier
24536 identifier ( identifier )
24537 identifier ( identifier , expression-list )
24538 identifier ( expression-list )
24540 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24541 to an attribute. The TREE_PURPOSE of each node is the identifier
24542 indicating which attribute is in use. The TREE_VALUE represents
24543 the arguments, if any. */
24545 static tree
24547 {
24553 {
24555 tree identifier;
24556 tree attribute;
24558 /* Look for the identifier. We also allow keywords here; for
24559 example `__attribute__ ((const))' is legal. */
24563 {
24566 /* Consume the token, but save it since we need it for the
24567 SIMD enabled function parsing. */
24570 /* Save away the identifier that indicates which attribute
24571 this is. */
24573 /* For keywords, use the canonical spelling, not the
24574 parsed identifier. */
24580 /* Peek at the next token. */
24582 /* If it's an `(', then parse the attribute arguments. */
24584 {
24589 {
24592 }
24593 else
24594 vec = cp_parser_parenthesized_expression_list
24600 else
24601 {
24604 }
24605 /* Save the arguments away. */
24607 }
24609 {
24612 }
24615 {
24616 /* Add this attribute to the list. */
24619 }
24622 }
24623 /* Now, look for more attributes. If the next token isn't a
24624 `,', we're done. */
24628 /* Consume the comma and keep going. */
24630 }
24633 /* We built up the list in reverse order. */
24635 }
24637 /* Parse a standard C++11 attribute.
24639 The returned representation is a TREE_LIST which TREE_PURPOSE is
24640 the scoped name of the attribute, and the TREE_VALUE is its
24641 arguments list.
24643 Note that the scoped name of the attribute is itself a TREE_LIST
24644 which TREE_PURPOSE is the namespace of the attribute, and
24645 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24646 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24647 and which TREE_PURPOSE is directly the attribute name.
24649 Clients of the attribute code should use get_attribute_namespace
24650 and get_attribute_name to get the actual namespace and name of
24651 attributes, regardless of their being GNU or C++11 attributes.
24653 attribute:
24654 attribute-token attribute-argument-clause [opt]
24656 attribute-token:
24657 identifier
24658 attribute-scoped-token
24660 attribute-scoped-token:
24661 attribute-namespace :: identifier
24663 attribute-namespace:
24664 identifier
24666 attribute-argument-clause:
24667 ( balanced-token-seq )
24669 balanced-token-seq:
24670 balanced-token [opt]
24671 balanced-token-seq balanced-token
24673 balanced-token:
24674 ( balanced-token-seq )
24675 [ balanced-token-seq ]
24676 { balanced-token-seq }. */
24678 static tree
24680 {
24684 /* First, parse name of the attribute, a.k.a attribute-token. */
24701 {
24702 /* We are seeing a scoped attribute token. */
24717 else
24718 {
24722 }
24724 NULL_TREE);
24726 }
24729 NULL_TREE);
24730 else
24731 {
24733 NULL_TREE);
24734 /* C++11 noreturn attribute is equivalent to GNU's. */
24737 /* C++14 deprecated attribute is equivalent to GNU's. */
24740 /* C++17 fallthrough attribute is equivalent to GNU's. */
24743 /* Transactional Memory TS optimize_for_synchronized attribute is
24744 equivalent to GNU transaction_callable. */
24748 /* Transactional Memory attributes are GNU attributes. */
24751 }
24753 /* Now parse the optional argument clause of the attribute. */
24758 {
24764 /* A GNU attribute that takes an identifier in parameter. */
24767 vec = cp_parser_parenthesized_expression_list
24773 else
24774 {
24777 }
24781 else
24783 }
24786 }
24788 /* Check that the attribute ATTRIBUTE appears at most once in the
24789 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24790 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24791 isn't implemented yet in GCC. */
24793 static void
24795 {
24797 {
24807 }
24808 }
24810 /* Parse a list of standard C++-11 attributes.
24812 attribute-list:
24813 attribute [opt]
24814 attribute-list , attribute[opt]
24815 attribute ...
24816 attribute-list , attribute ...
24817 */
24819 static tree
24821 {
24826 {
24831 {
24835 }
24838 {
24843 else
24847 }
24851 }
24854 }
24856 /* Parse a standard C++-11 attribute specifier.
24858 attribute-specifier:
24859 [ [ attribute-using-prefix [opt] attribute-list ] ]
24860 alignment-specifier
24862 attribute-using-prefix:
24863 using attribute-namespace :
24865 alignment-specifier:
24866 alignas ( type-id ... [opt] )
24867 alignas ( alignment-expression ... [opt] ). */
24869 static tree
24871 {
24877 {
24884 {
24895 {
24899 "attribute using prefix only available "
24905 }
24906 else
24908 }
24915 else
24916 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24917 when we are sure that we have actually parsed them. */
24919 }
24920 else
24921 {
24922 tree alignas_expr;
24924 /* Look for an alignment-specifier. */
24936 {
24939 }
24945 {
24952 }
24957 /* Handle alignas (pack...). */
24959 {
24962 }
24964 /* Something went wrong, so don't build the attribute. */
24969 {
24972 }
24974 /* Build the C++-11 representation of an 'aligned'
24975 attribute. */
24976 attributes =
24979 alignas_expr);
24980 }
24983 }
24985 /* Parse a standard C++-11 attribute-specifier-seq.
24987 attribute-specifier-seq:
24988 attribute-specifier-seq [opt] attribute-specifier
24989 */
24991 static tree
24993 {
24998 {
25007 else
25010 }
25013 }
25015 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25016 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25017 current value of the PEDANTIC flag, regardless of whether or not
25018 the `__extension__' keyword is present. The caller is responsible
25019 for restoring the value of the PEDANTIC flag. */
25021 static bool
25023 {
25024 /* Save the old value of the PEDANTIC flag. */
25028 {
25029 /* Consume the `__extension__' token. */
25031 /* We're not being pedantic while the `__extension__' keyword is
25032 in effect. */
25036 }
25039 }
25041 /* Parse a label declaration.
25043 label-declaration:
25044 __label__ label-declarator-seq ;
25046 label-declarator-seq:
25047 identifier , label-declarator-seq
25048 identifier */
25050 static void
25052 {
25053 /* Look for the `__label__' keyword. */
25057 {
25058 tree identifier;
25060 /* Look for an identifier. */
25062 /* If we failed, stop. */
25065 /* Declare it as a label. */
25067 /* If the next token is a `;', stop. */
25070 /* Look for the `,' separating the label declarations. */
25072 }
25074 /* Look for the final `;'. */
25076 }
25078 // -------------------------------------------------------------------------- //
25079 // Requires Clause
25081 // Parse a requires clause.
25082 //
25083 // requires-clause:
25084 // 'requires' logical-or-expression
25085 //
25086 // The required logical-or-expression must be a constant expression. Note
25087 // that we don't check that the expression is constepxr here. We defer until
25088 // we analyze constraints and then, we only check atomic constraints.
25089 static tree
25091 {
25092 // Parse the requires clause so that it is not automatically folded.
25100 }
25102 // Optionally parse a requires clause:
25103 static tree
25105 {
25108 {
25111 {
25114 /* Parse and discard the requires-clause. */
25117 }
25119 }
25122 }
25125 /*---------------------------------------------------------------------------
25126 Requires expressions
25127 ---------------------------------------------------------------------------*/
25129 /* Parse a requires expression
25131 requirement-expression:
25132 'requires' requirement-parameter-list [opt] requirement-body */
25133 static tree
25135 {
25139 /* A requires-expression shall appear only within a concept
25140 definition or a requires-clause.
25142 TODO: Implement this diagnostic correctly. */
25144 {
25148 }
25151 {
25152 /* Local parameters are delared as variables within the scope
25153 of the expression. They are not visible past the end of
25154 the expression. Expressions within the requires-expression
25155 are unevaluated. */
25156 struct scope_sentinel
25157 {
25159 {
25162 }
25165 {
25168 }
25171 /* Parse the optional parameter list. */
25173 {
25177 }
25178 else
25181 /* Parse the requirement body. */
25185 }
25187 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25188 the parm chain. */
25191 }
25193 /* Parse a parameterized requirement.
25195 requirement-parameter-list:
25196 '(' parameter-declaration-clause ')' */
25197 static tree
25199 {
25209 }
25211 /* Parse the body of a requirement.
25213 requirement-body:
25214 '{' requirement-list '}' */
25215 static tree
25217 {
25227 }
25229 /* Parse a list of requirements.
25231 requirement-list:
25232 requirement
25233 requirement-list ';' requirement[opt] */
25234 static tree
25236 {
25239 {
25246 /* If we see a semi-colon, consume it. */
25250 /* Stop processing at the end of the list. */
25253 }
25255 /* Reverse the order of requirements so they are analyzed in
25256 declaration order. */
25258 }
25260 /* Parse a syntactic requirement or type requirement.
25262 requirement:
25263 simple-requirement
25264 compound-requirement
25265 type-requirement
25266 nested-requirement */
25267 static tree
25269 {
25276 else
25278 }
25280 /* Parse a simple requirement.
25282 simple-requirement:
25283 expression ';' */
25284 static tree
25286 {
25295 }
25297 /* Parse a type requirement
25299 type-requirement
25300 nested-name-specifier [opt] required-type-name ';'
25302 required-type-name:
25303 type-name
25304 'template' [opt] simple-template-id */
25305 static tree
25307 {
25310 // Save the scope before parsing name specifiers.
25321 tree type;
25323 {
25332 }
25333 else
25352 }
25354 /* Parse a compound requirement
25356 compound-requirement:
25357 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25358 static tree
25360 {
25361 /* Parse an expression enclosed in '{ }'s. */
25372 /* Parse the optional noexcept. */
25375 {
25378 }
25380 /* Parse the optional trailing return type. */
25383 {
25391 }
25394 }
25396 /* Parse a nested requirement. This is the same as a requires clause.
25398 nested-requirement:
25399 requires-clause */
25400 static tree
25402 {
25408 }
25410 /* Support Functions */
25412 /* Return the appropriate prefer_type argument for lookup_name_real based on
25413 tag_type and template_mem_access. */
25417 {
25418 /* DR 141: When looking in the current enclosing context for a template-name
25419 after -> or ., only consider class templates. */
25423 {
25427 }
25428 }
25430 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25431 NAME should have one of the representations used for an
25432 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25433 is returned. If PARSER->SCOPE is a dependent type, then a
25434 SCOPE_REF is returned.
25436 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25437 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25438 was formed. Abstractly, such entities should not be passed to this
25439 function, because they do not need to be looked up, but it is
25440 simpler to check for this special case here, rather than at the
25441 call-sites.
25443 In cases not explicitly covered above, this function returns a
25444 DECL, OVERLOAD, or baselink representing the result of the lookup.
25445 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25446 is returned.
25448 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25449 (e.g., "struct") that was used. In that case bindings that do not
25450 refer to types are ignored.
25452 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25453 ignored.
25455 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25456 are ignored.
25458 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25459 types.
25461 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25462 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25463 NULL_TREE otherwise. */
25465 static cp_expr
25472 location_t name_location)
25473 {
25474 tree decl;
25477 /* Assume that the lookup will be unambiguous. */
25481 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25482 no longer valid. Note that if we are parsing tentatively, and
25483 the parse fails, OBJECT_TYPE will be automatically restored. */
25489 /* A template-id has already been resolved; there is no lookup to
25490 do. */
25494 {
25498 }
25500 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25501 it should already have been checked to make sure that the name
25502 used matches the type being destroyed. */
25504 {
25505 tree type;
25507 /* Figure out to which type this destructor applies. */
25512 else
25514 /* If that's not a class type, there is no destructor. */
25521 /* If it was a class type, return the destructor. */
25523 }
25525 /* By this point, the NAME should be an ordinary identifier. If
25526 the id-expression was a qualified name, the qualifying scope is
25527 stored in PARSER->SCOPE at this point. */
25530 /* Perform the lookup. */
25532 {
25538 /* If the SCOPE is dependent, the lookup must be deferred until
25539 the template is instantiated -- unless we are explicitly
25540 looking up names in uninstantiated templates. Even then, we
25541 cannot look up the name if the scope is not a class type; it
25542 might, for example, be a template type parameter. */
25547 /* Defer lookup. */
25549 else
25550 {
25553 /* If PARSER->SCOPE is a dependent type, then it must be a
25554 class type, and we must not be checking dependencies;
25555 otherwise, we would have processed this lookup above. So
25556 that PARSER->SCOPE is not considered a dependent base by
25557 lookup_member, we must enter the scope here. */
25561 /* If the PARSER->SCOPE is a template specialization, it
25562 may be instantiated during name lookup. In that case,
25563 errors may be issued. Even if we rollback the current
25564 tentative parse, those errors are valid. */
25569 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25570 lookup result and the nested-name-specifier nominates a class C:
25571 * if the name specified after the nested-name-specifier, when
25572 looked up in C, is the injected-class-name of C (Clause 9), or
25573 * if the name specified after the nested-name-specifier is the
25574 same as the identifier or the simple-template-id's template-
25575 name in the last component of the nested-name-specifier,
25576 the name is instead considered to name the constructor of
25577 class C. [ Note: for example, the constructor is not an
25578 acceptable lookup result in an elaborated-type-specifier so
25579 the constructor would not be used in place of the
25580 injected-class-name. --end note ] Such a constructor name
25581 shall be used only in the declarator-id of a declaration that
25582 names a constructor or in a using-declaration. */
25590 /* If we have a single function from a using decl, pull it out. */
25597 }
25599 /* If the scope is a dependent type and either we deferred lookup or
25600 we did lookup but didn't find the name, rememeber the name. */
25603 {
25605 {
25606 tree type;
25608 /* The resolution to Core Issue 180 says that `struct
25609 A::B' should be considered a type-name, even if `A'
25610 is dependent. */
25615 }
25619 CPP_CLOSE_PAREN)))
25623 else
25626 is_template);
25627 }
25630 }
25632 {
25633 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25634 OBJECT_TYPE is not a class. */
25636 /* If the OBJECT_TYPE is a template specialization, it may
25637 be instantiated during name lookup. In that case, errors
25638 may be issued. Even if we rollback the current tentative
25639 parse, those errors are valid. */
25641 name,
25644 tf_warning_or_error);
25645 else
25649 /* Look it up in the enclosing context. DR 141: When looking for a
25650 template-name after -> or ., only consider class templates. */
25655 /* The object is type-dependent, so we can't look anything up; we used
25656 this to get the DR 141 behavior. */
25660 }
25661 else
25662 {
25668 }
25670 /* If the lookup failed, let our caller know. */
25674 /* Pull out the template from an injected-class-name (or multiple). */
25678 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25680 {
25683 /* The error message we have to print is too complicated for
25684 cp_parser_error, so we incorporate its actions directly. */
25686 {
25688 name);
25690 }
25692 }
25700 /* If we have resolved the name of a member declaration, check to
25701 see if the declaration is accessible. When the name resolves to
25702 set of overloaded functions, accessibility is checked when
25703 overload resolution is done.
25705 During an explicit instantiation, access is not checked at all,
25706 as per [temp.explicit]. */
25713 }
25715 /* Like cp_parser_lookup_name, but for use in the typical case where
25716 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25717 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25719 static tree
25721 {
25723 none_type,
25728 location);
25729 }
25731 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25732 the current context, return the TYPE_DECL. If TAG_NAME_P is
25733 true, the DECL indicates the class being defined in a class-head,
25734 or declared in an elaborated-type-specifier.
25736 Otherwise, return DECL. */
25738 static tree
25740 {
25741 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25742 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25744 struct A {
25745 template <typename T> struct B;
25746 };
25748 template <typename T> struct A::B {};
25750 Similarly, in an elaborated-type-specifier:
25752 namespace N { struct X{}; }
25754 struct A {
25755 template <typename T> friend struct N::X;
25756 };
25758 However, if the DECL refers to a class type, and we are in
25759 the scope of the class, then the name lookup automatically
25760 finds the TYPE_DECL created by build_self_reference rather
25761 than a TEMPLATE_DECL. For example, in:
25763 template <class T> struct S {
25764 S s;
25765 };
25767 there is no need to handle such case. */
25773 }
25775 /* If too many, or too few, template-parameter lists apply to the
25776 declarator, issue an error message. Returns TRUE if all went well,
25777 and FALSE otherwise. */
25779 static bool
25782 location_t declarator_location)
25783 {
25785 {
25787 {
25795 /* If the DECLARATOR has the form `X<y>' then it uses one
25796 additional level of template parameters. */
25799 return cp_parser_check_template_parameters
25801 }
25817 }
25819 }
25821 /* NUM_TEMPLATES were used in the current declaration. If that is
25822 invalid, return FALSE and issue an error messages. Otherwise,
25823 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25824 declarator and we can print more accurate diagnostics. */
25826 static bool
25829 location_t location,
25831 {
25832 /* If there are the same number of template classes and parameter
25833 lists, that's OK. */
25836 /* If there are more, but only one more, then we are referring to a
25837 member template. That's OK too. */
25840 /* If there are more template classes than parameter lists, we have
25841 something like:
25843 template <class T> void S<T>::R<T>::f (); */
25845 {
25855 else
25858 }
25859 /* Otherwise, there are too many template parameter lists. We have
25860 something like:
25862 template <class T> template <class U> void S::f(); */
25865 }
25867 /* Parse an optional `::' token indicating that the following name is
25868 from the global namespace. If so, PARSER->SCOPE is set to the
25869 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25870 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25871 Returns the new value of PARSER->SCOPE, if the `::' token is
25872 present, and NULL_TREE otherwise. */
25874 static tree
25876 {
25879 /* Peek at the next token. */
25881 /* If we're looking at a `::' token then we're starting from the
25882 global namespace, not our current location. */
25884 {
25885 /* Consume the `::' token. */
25887 /* Set the SCOPE so that we know where to start the lookup. */
25893 }
25895 {
25899 }
25902 }
25904 /* Returns TRUE if the upcoming token sequence is the start of a
25905 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
25906 declarator is preceded by the `friend' specifier. */
25908 static bool
25910 {
25913 tree nested_name_specifier;
25916 /* The common case is that this is not a constructor declarator, so
25917 try to avoid doing lots of work if at all possible. It's not
25918 valid declare a constructor at function scope. */
25921 /* And only certain tokens can begin a constructor declarator. */
25929 /* Parse tentatively; we are going to roll back all of the tokens
25930 consumed here. */
25932 /* Assume that we are looking at a constructor declarator. */
25935 /* Look for the optional `::' operator. */
25938 /* Look for the nested-name-specifier. */
25939 nested_name_specifier
25950 /* Outside of a class-specifier, there must be a
25951 nested-name-specifier. Except in C++17 mode, where we
25952 might be declaring a guiding declaration. */
25959 /* If we have a class scope, this is easy; DR 147 says that S::S always
25960 names the constructor, and no other qualified name could. */
25963 {
25973 }
25974 /* If we still think that this might be a constructor-declarator,
25975 look for a class-name. */
25977 {
25978 /* If we have:
25980 template <typename T> struct S {
25981 S();
25982 };
25984 we must recognize that the nested `S' names a class. */
25988 tree type_decl;
25992 none_type,
25999 {
26005 none_type,
26010 else
26012 }
26014 /* If there was no class-name, then this is not a constructor.
26015 Otherwise, if we are in a class-specifier and we aren't
26016 handling a friend declaration, check that its type matches
26017 current_class_type (c++/38313). Note: error_mark_node
26018 is left alone for error recovery purposes. */
26020 && (outside_class_specifier_p
26026 /* If we're still considering a constructor, we have to see a `(',
26027 to begin the parameter-declaration-clause, followed by either a
26028 `)', an `...', or a decl-specifier. We need to check for a
26029 type-specifier to avoid being fooled into thinking that:
26031 S (f) (int);
26033 is a constructor. (It is actually a function named `f' that
26034 takes one parameter (of type `int') and returns a value of type
26035 `S'. */
26043 /* A parameter declaration begins with a decl-specifier,
26044 which is either the "attribute" keyword, a storage class
26045 specifier, or (usually) a type-specifier. */
26047 {
26048 tree type;
26052 /* Names appearing in the type-specifier should be looked up
26053 in the scope of the class. */
26057 {
26060 {
26064 {
26067 }
26068 }
26070 }
26072 /* Inside the constructor parameter list, surrounding
26073 template-parameter-lists do not apply. */
26074 saved_num_template_parameter_lists
26078 /* Look for the type-specifier. */
26080 CP_PARSER_FLAGS_NONE,
26086 parser->num_template_parameter_lists
26089 /* Leave the scope of the class. */
26094 }
26095 }
26097 /* We did not really want to consume any tokens. */
26101 }
26103 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26104 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26105 they must be performed once we are in the scope of the function.
26107 Returns the function defined. */
26109 static tree
26110 cp_parser_function_definition_from_specifiers_and_declarator
26113 tree attributes,
26115 {
26116 tree fn;
26119 /* Begin the function-definition. */
26122 /* The things we're about to see are not directly qualified by any
26123 template headers we've seen thus far. */
26126 /* If there were names looked up in the decl-specifier-seq that we
26127 did not check, check them now. We must wait until we are in the
26128 scope of the function to perform the checks, since the function
26129 might be a friend. */
26133 {
26138 }
26141 {
26142 /* Skip the entire function. */
26145 }
26147 {
26148 /* Seen already, skip it. An error message has already been output. */
26152 /* If this is a function from a class, pop the nested class. */
26155 }
26156 else
26157 {
26158 timevar_id_t tv;
26161 else
26167 }
26170 }
26172 /* Parse the part of a function-definition that follows the
26173 declarator. INLINE_P is TRUE iff this function is an inline
26174 function defined within a class-specifier.
26176 Returns the function defined. */
26178 static tree
26181 {
26182 tree fn;
26188 bool fully_implicit_function_template_p
26191 tree implicit_template_parms
26194 cp_binding_level* implicit_template_scope
26200 /* If the next token is `return', then the code may be trying to
26201 make use of the "named return value" extension that G++ used to
26202 support. */
26205 {
26206 /* Consume the `return' keyword. */
26208 /* Look for the identifier that indicates what value is to be
26209 returned. */
26211 /* Issue an error message. */
26214 /* Skip tokens until we reach the start of the function body. */
26216 {
26223 }
26224 }
26225 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26226 anything declared inside `f'. */
26227 saved_in_unbraced_linkage_specification_p
26230 /* Inside the function, surrounding template-parameter-lists do not
26231 apply. */
26232 saved_num_template_parameter_lists
26238 /* If the next token is `try', `__transaction_atomic', or
26239 `__transaction_relaxed`, then we are looking at either function-try-block
26240 or function-transaction-block. Note that all of these include the
26241 function-body. */
26244 RID_TRANSACTION_ATOMIC);
26246 RID_TRANSACTION_RELAXED))
26248 RID_TRANSACTION_RELAXED);
26251 else
26252 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
26257 /* Finish the function. */
26260 /* Generate code for it, if necessary. */
26262 /* Restore the saved values. */
26263 parser->in_unbraced_linkage_specification_p
26265 parser->num_template_parameter_lists
26269 parser->fully_implicit_function_template_p
26271 parser->implicit_template_parms
26273 parser->implicit_template_scope
26280 }
26282 /* Parse a template-declaration body (following argument list). */
26284 static void
26286 tree parameter_list,
26288 {
26292 /* We just processed one more parameter list. */
26295 /* Get the deferred access checks from the parameter list. These
26296 will be checked once we know what is being declared, as for a
26297 member template the checks must be performed in the scope of the
26298 class containing the member. */
26301 /* Tentatively parse for a new template parameter list, which can either be
26302 the template keyword or a template introduction. */
26308 else
26309 {
26310 /* There are no access checks when parsing a template, as we do not
26311 know if a specialization will be a friend. */
26315 checks,
26316 member_p,
26321 /* If this is a member template declaration, let the front
26322 end know. */
26324 {
26329 }
26334 }
26335 /* We are done with the current parameter list. */
26340 /* Finish up. */
26343 /* Check the template arguments for a literal operator template. */
26347 {
26351 else
26352 {
26355 {
26361 }
26363 {
26372 }
26373 else
26375 }
26377 {
26380 " Expected non-type template argument pack <char...>"
26382 decl);
26383 else
26386 decl);
26387 }
26388 }
26390 /* Register member declarations. */
26393 /* If DECL is a function template, we must return to parse it later.
26394 (Even though there is no definition, there might be default
26395 arguments that need handling.) */
26399 }
26401 /* Parse a template introduction header for a template-declaration. Returns
26402 false if tentative parse fails. */
26404 static bool
26406 {
26413 /* Look for the optional `::' operator. */
26416 /* Look for the nested-name-specifier. */
26426 /* Look up the concept for which we will be matching
26427 template parameters. */
26437 /* Look for opening brace for introduction. */
26445 /* Build vector of placeholder parameters and grab
26446 matching identifiers. */
26449 /* The introduction-list shall not be empty. */
26452 {
26455 }
26457 /* Look for closing brace for introduction. */
26462 {
26466 }
26468 /* Build and associate the constraint. */
26471 {
26473 member_p);
26475 }
26479 }
26481 /* Parse a normal template-declaration following the template keyword. */
26483 static void
26485 {
26486 tree parameter_list;
26490 /* Look for the `<' token. */
26494 {
26495 /* 14.5.2.2 [temp.mem]
26497 A local class shall not have member templates. */
26502 }
26503 /* [temp]
26505 A template ... shall not have C linkage. */
26507 {
26509 /* Give it C++ linkage to avoid confusing other parts of the
26510 front end. */
26513 }
26514 else
26517 /* We cannot perform access checks on the template parameter
26518 declarations until we know what is being declared, just as we
26519 cannot check the decl-specifier list. */
26522 /* If the next token is `>', then we have an invalid
26523 specialization. Rather than complain about an invalid template
26524 parameter, issue an error message here. */
26526 {
26530 }
26531 else
26532 {
26533 /* Parse the template parameters. */
26535 }
26537 /* Look for the `>'. */
26540 /* Manage template requirements */
26542 {
26547 }
26550 member_p);
26552 /* For the erroneous case of a template with C linkage, we pushed an
26553 implicit C++ linkage scope; exit that scope now. */
26556 }
26558 /* Parse a template-declaration, assuming that the `export' (and
26559 `extern') keywords, if present, has already been scanned. MEMBER_P
26560 is as for cp_parser_template_declaration. */
26562 static bool
26564 {
26566 {
26570 }
26575 }
26577 /* Perform the deferred access checks from a template-parameter-list.
26578 CHECKS is a TREE_LIST of access checks, as returned by
26579 get_deferred_access_checks. */
26581 static void
26582 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
26583 {
26587 }
26589 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26590 `function-definition' sequence that follows a template header.
26591 If MEMBER_P is true, this declaration appears in a class scope.
26593 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26594 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26596 static tree
26602 {
26605 cp_decl_specifier_seq decl_specifiers;
26609 /* This function is only used when processing a template
26610 declaration. */
26614 /* Defer access checks until we know what is being declared. */
26617 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26618 alternative. */
26621 CP_PARSER_FLAGS_OPTIONAL,
26627 /* There are no template typedefs. */
26629 {
26633 }
26635 /* Gather up the access checks that occurred the
26636 decl-specifier-seq. */
26639 /* Check for the declaration of a template class. */
26641 {
26644 {
26645 // If this is a declaration, but not a definition, associate
26646 // any constraints with the type declaration. Constraints
26647 // are associated with definitions in cp_parser_class_specifier.
26653 /* In this case:
26655 struct C {
26656 friend template <typename T> struct A<T>::B;
26657 };
26659 A<T>::B will be represented by a TYPENAME_TYPE, and
26660 therefore not recognized by shadow_tag. */
26662 && !decl
26669 else
26672 /* Perform access checks for template parameters. */
26675 /* Give a helpful diagnostic for
26676 template <class T> struct A { } a;
26677 if we aren't already recovering from an error. */
26680 {
26682 "a class template declaration must not declare "
26686 }
26687 }
26688 }
26690 /* Complain about missing 'typename' or other invalid type names. */
26693 {
26694 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26695 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26696 the rest of this declaration. */
26699 }
26701 /* If it's not a template class, try for a template function. If
26702 the next token is a `;', then this declaration does not declare
26703 anything. But, if there were errors in the decl-specifiers, then
26704 the error might well have come from an attempted class-specifier.
26705 In that case, there's no need to warn about a missing declarator. */
26709 {
26712 checks,
26714 member_p,
26715 declares_class_or_enum,
26719 /* 7.1.1-1 [dcl.stc]
26721 A storage-class-specifier shall not be specified in an explicit
26722 specialization... */
26724 && explicit_specialization_p
26726 {
26730 }
26734 }
26736 /* Look for a trailing `;' after the declaration. */
26742 out:
26745 /* Clear any current qualification; whatever comes next is the start
26746 of something new. */
26752 }
26754 /* Parse a cast-expression that is not the operand of a unary "&". */
26756 static cp_expr
26758 {
26761 }
26763 /* Parse a functional cast to TYPE. Returns an expression
26764 representing the cast. */
26766 static cp_expr
26768 {
26770 tree expression_list;
26771 cp_expr cast;
26780 {
26789 tf_warning_or_error);
26790 /* Create a location of the form:
26791 type_name{i, f}
26792 ^~~~~~~~~~~~~~~
26793 with caret == start at the start of the type name,
26794 finishing at the closing brace. */
26795 location_t finish_loc
26798 finish_loc);
26801 }
26810 else
26811 {
26814 }
26817 tf_warning_or_error);
26818 /* [expr.const]/1: In an integral constant expression "only type
26819 conversions to integral or enumeration type can be used". */
26825 NIC_CONSTRUCTOR))
26828 /* Create a location of the form:
26829 float(i)
26830 ^~~~~~~~
26831 with caret == start at the start of the type name,
26832 finishing at the closing paren. */
26833 location_t finish_loc
26838 }
26840 /* Save the tokens that make up the body of a member function defined
26841 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26842 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26843 specifiers applied to the declaration. Returns the FUNCTION_DECL
26844 for the member function. */
26846 static tree
26850 tree attributes)
26851 {
26854 tree fn;
26857 /* Create the FUNCTION_DECL. */
26861 /* If something went badly wrong, bail out now. */
26863 {
26864 /* If there's a function-body, skip it. */
26869 }
26871 /* Remember it, if there default args to post process. */
26874 /* Save away the tokens that make up the body of the
26875 function. */
26881 RID_TRANSACTION_ATOMIC))
26882 {
26884 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
26891 {
26897 }
26898 else
26901 {
26905 }
26906 }
26908 /* Handle function try blocks. */
26910 {
26913 }
26914 /* We can have braced-init-list mem-initializers before the fn body. */
26916 {
26919 {
26920 /* cache_group will stop after an un-nested { } pair, too. */
26924 /* variadic mem-inits have ... after the ')'. */
26927 }
26928 }
26930 /* Handle function try blocks. */
26936 /* Save away the inline definition; we will process it when the
26937 class is complete. */
26941 /* We need to know that this was defined in the class, so that
26942 friend templates are handled correctly. */
26945 /* Add FN to the queue of functions to be parsed later. */
26949 }
26951 /* Save the tokens that make up the in-class initializer for a non-static
26952 data member. Returns a DEFAULT_ARG. */
26954 static tree
26956 {
26958 }
26960 /* Parse a template-argument-list, as well as the trailing ">" (but
26961 not the opening "<"). See cp_parser_template_argument_list for the
26962 return value. */
26964 static tree
26966 {
26967 tree arguments;
26968 tree saved_scope;
26969 tree saved_qualifying_scope;
26970 tree saved_object_scope;
26975 /* [temp.names]
26977 When parsing a template-id, the first non-nested `>' is taken as
26978 the end of the template-argument-list rather than a greater-than
26979 operator. */
26980 saved_greater_than_is_operator_p
26983 /* Parsing the argument list may modify SCOPE, so we save it
26984 here. */
26988 /* We need to evaluate the template arguments, even though this
26989 template-id may be nested within a "sizeof". */
26994 /* Parse the template-argument-list itself. */
26998 else
27000 /* Look for the `>' that ends the template-argument-list. If we find
27001 a '>>' instead, it's probably just a typo. */
27003 {
27005 {
27006 /* In C++0x, a `>>' in a template argument list or cast
27007 expression is considered to be two separate `>'
27008 tokens. So, change the current token to a `>', but don't
27009 consume it: it will be consumed later when the outer
27010 template argument list (or cast expression) is parsed.
27011 Note that this replacement of `>' for `>>' is necessary
27012 even if we are parsing tentatively: in the tentative
27013 case, after calling
27014 cp_parser_enclosed_template_argument_list we will always
27015 throw away all of the template arguments and the first
27016 closing `>', either because the template argument list
27017 was erroneous or because we are replacing those tokens
27018 with a CPP_TEMPLATE_ID token. The second `>' (which will
27019 not have been thrown away) is needed either to close an
27020 outer template argument list or to complete a new-style
27021 cast. */
27024 }
27026 {
27027 /* If we're in a nested template argument list, the '>>' has
27028 to be a typo for '> >'. We emit the error message, but we
27029 continue parsing and we push a '>' as next token, so that
27030 the argument list will be parsed correctly. Note that the
27031 global source location is still on the token before the
27032 '>>', so we need to say explicitly where we want it. */
27040 }
27041 else
27042 {
27043 /* If this is not a nested template argument list, the '>>'
27044 is a typo for '>'. Emit an error message and continue.
27045 Same deal about the token location, but here we can get it
27046 right by consuming the '>>' before issuing the diagnostic. */
27049 "spurious %<>>%>, use %<>%> to terminate "
27051 }
27052 }
27053 else
27055 /* The `>' token might be a greater-than operator again now. */
27056 parser->greater_than_is_operator_p
27058 /* Restore the SAVED_SCOPE. */
27066 }
27068 /* MEMBER_FUNCTION is a member function, or a friend. If default
27069 arguments, or the body of the function have not yet been parsed,
27070 parse them now. */
27072 static void
27074 {
27076 /* If this member is a template, get the underlying
27077 FUNCTION_DECL. */
27081 /* There should not be any class definitions in progress at this
27082 point; the bodies of members are only parsed outside of all class
27083 definitions. */
27085 /* While we're parsing the member functions we might encounter more
27086 classes. We want to handle them right away, but we don't want
27087 them getting mixed up with functions that are currently in the
27088 queue. */
27091 /* Make sure that any template parameters are in scope. */
27094 /* If the body of the function has not yet been parsed, parse it
27095 now. */
27097 {
27098 tree function_scope;
27101 /* The function is no longer pending; we are processing it. */
27106 /* If this is a local class, enter the scope of the containing
27107 function. */
27112 /* Push the body of the function onto the lexer stack. */
27115 /* Let the front end know that we going to be defining this
27116 function. */
27120 /* Don't do access checking if it is a templated function. */
27124 /* #pragma omp declare reduction needs special parsing. */
27126 {
27131 }
27132 else
27133 /* Now, parse the body of the function. */
27140 /* Leave the scope of the containing function. */
27144 }
27146 /* Remove any template parameters from the symbol table. */
27149 /* Restore the queue. */
27152 }
27154 /* If DECL contains any default args, remember it on the unparsed
27155 functions queue. */
27157 static void
27159 {
27160 tree probe;
27163 probe;
27166 {
27170 }
27171 }
27173 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27174 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27175 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27176 from the parameter-type-list. */
27178 static tree
27181 {
27183 tree parsed_arg;
27189 /* Push the saved tokens for the default argument onto the parser's
27190 lexer stack. */
27196 /* Parse the default argument. */
27207 {
27208 /* In a non-template class, check conversions now. In a template,
27209 we'll wait and instantiate these as needed. */
27212 tf_warning_or_error);
27215 else
27217 }
27219 /* If the token stream has not been completely used up, then
27220 there was extra junk after the end of the default
27221 argument. */
27223 {
27226 else
27228 }
27230 /* Revert to the main lexer. */
27234 }
27236 /* FIELD is a non-static data member with an initializer which we saved for
27237 later; parse it now. */
27239 static void
27241 {
27242 tree def;
27249 NULL_TREE);
27255 }
27257 /* FN is a FUNCTION_DECL which may contains a parameter with an
27258 unparsed DEFAULT_ARG. Parse the default args now. This function
27259 assumes that the current scope is the scope in which the default
27260 argument should be processed. */
27262 static void
27264 {
27268 /* While we're parsing the default args, we might (due to the
27269 statement expression extension) encounter more classes. We want
27270 to handle them right away, but we don't want them getting mixed
27271 up with default args that are currently in the queue. */
27274 /* Local variable names (and the `this' keyword) may not appear
27275 in a default argument. */
27286 {
27288 tree parsed_arg;
27290 tree copy;
27297 /* This can happen for a friend declaration for a function
27298 already declared with default arguments. */
27301 parsed_arg
27303 default_arg,
27306 {
27308 }
27312 /* Update any instantiations we've already created. */
27316 }
27320 /* Make sure no default arg is missing. */
27323 /* Restore the state of local_variables_forbidden_p. */
27326 /* Restore the queue. */
27328 }
27330 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27332 sizeof ... ( identifier )
27334 where the 'sizeof' token has already been consumed. */
27336 static tree
27338 {
27339 /* Consume the `...'. */
27346 else
27354 /* The name is not qualified. */
27373 }
27375 /* Parse the operand of `sizeof' (or a similar operator). Returns
27376 either a TYPE or an expression, depending on the form of the
27377 input. The KEYWORD indicates which kind of expression we have
27378 encountered. */
27380 static tree
27382 {
27389 /* If it's a `...', then we are computing the length of a parameter
27390 pack. */
27395 /* Types cannot be defined in a `sizeof' expression. Save away the
27396 old message. */
27398 /* And create the new one. */
27404 /* The restrictions on constant-expressions do not apply inside
27405 sizeof expressions. */
27406 saved_integral_constant_expression_p
27408 saved_non_integral_constant_expression_p
27412 /* Do not actually evaluate the expression. */
27415 /* If it's a `(', then we might be looking at the type-id
27416 construction. */
27418 {
27421 /* We can't be sure yet whether we're looking at a type-id or an
27422 expression. */
27424 /* Note: as a GNU Extension, compound literals are considered
27425 postfix-expressions as they are in C99, so they are valid
27426 arguments to sizeof. See comment in cp_parser_cast_expression
27427 for details. */
27430 else
27431 {
27434 /* Look for the type-id. */
27436 /* Look for the closing `)'. */
27439 }
27441 /* If all went well, then we're done. */
27443 {
27444 cp_decl_specifier_seq decl_specs;
27446 /* Build a trivial decl-specifier-seq. */
27450 /* Call grokdeclarator to figure out what type this is. */
27453 TYPENAME,
27456 }
27457 }
27459 /* If the type-id production did not work out, then we must be
27460 looking at the unary-expression production. */
27464 /* Go back to evaluating expressions. */
27468 /* Free the message we created. */
27470 /* And restore the old one. */
27472 parser->integral_constant_expression_p
27474 parser->non_integral_constant_expression_p
27478 }
27480 /* If the current declaration has no declarator, return true. */
27482 static bool
27484 {
27485 /* If the next token is a `;' or a `,' then there is no
27486 declarator. */
27489 }
27491 /* Update the DECL_SPECS to reflect the storage class indicated by
27492 KEYWORD. */
27494 static void
27499 {
27500 cp_storage_class storage_class;
27503 {
27507 }
27509 {
27512 }
27517 {
27520 }
27523 {
27541 }
27545 /* A storage class specifier cannot be applied alongside a typedef
27546 specifier. If there is a typedef specifier present then set
27547 conflicting_specifiers_p which will trigger an error later
27548 on in grokdeclarator. */
27551 }
27553 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27554 is true, the type is a class or enum definition. */
27556 static void
27558 tree type_spec,
27561 {
27564 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27565 (with, for example, in "typedef int wchar_t;") we remember that
27566 this is what happened. In system headers, we ignore these
27567 declarations so that G++ can work with system headers that are not
27568 C++-safe. */
27570 && !type_definition_p
27580 {
27583 ds_redefined_builtin_type_spec,
27584 token);
27586 {
27590 }
27591 }
27594 else
27595 {
27600 }
27601 }
27603 /* True iff TOKEN is the GNU keyword __thread. */
27605 static bool
27607 {
27610 }
27612 /* Set the location for a declarator specifier and check if it is
27613 duplicated.
27615 DECL_SPECS is the sequence of declarator specifiers onto which to
27616 set the location.
27618 DS is the single declarator specifier to set which location is to
27619 be set onto the existing sequence of declarators.
27621 LOCATION is the location for the declarator specifier to
27622 consider. */
27624 static void
27627 {
27636 {
27640 }
27641 else
27642 {
27644 {
27648 else
27649 {
27652 OPT_Wlong_long,
27654 }
27655 }
27657 {
27662 else
27664 }
27665 else
27666 {
27682 "__complex"
27683 };
27686 }
27687 }
27688 }
27690 /* Return true iff the declarator specifier DS is present in the
27691 sequence of declarator specifiers DECL_SPECS. */
27693 bool
27695 cp_decl_spec ds)
27696 {
27703 }
27705 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27706 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27708 static bool
27710 {
27712 }
27714 /* Issue an error message indicating that TOKEN_DESC was expected.
27715 If KEYWORD is true, it indicated this function is called by
27716 cp_parser_require_keword and the required token can only be
27717 a indicated keyword. */
27719 static void
27721 required_token token_desc,
27723 {
27725 {
27794 }
27796 {
27798 {
27877 }
27878 }
27879 else
27881 }
27885 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27886 issue an error message indicating that TOKEN_DESC was expected.
27888 Returns the token consumed, if the token had the appropriate type.
27889 Otherwise, returns NULL. */
27894 required_token token_desc)
27895 {
27898 else
27899 {
27900 /* Output the MESSAGE -- unless we're parsing tentatively. */
27904 }
27905 }
27907 /* An error message is produced if the next token is not '>'.
27908 All further tokens are skipped until the desired token is
27909 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27911 static void
27913 {
27914 /* Current level of '< ... >'. */
27916 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27919 /* Are we ready, yet? If not, issue error message. */
27923 /* Skip tokens until the desired token is found. */
27925 {
27926 /* Peek at the next token. */
27928 {
27936 /* C++0x views the `>>' operator as two `>' tokens, but
27937 C++98 does not. */
27940 {
27941 /* We've hit a `>>' where the first `>' closes the
27942 template argument list, and the second `>' is
27943 spurious. Just consume the `>>' and stop; we've
27944 already produced at least one error. */
27947 }
27948 /* Fall through for C++0x, so we handle the second `>' in
27949 the `>>'. */
27954 {
27955 /* We've reached the token we want, consume it and stop. */
27958 }
27977 /* The '>' was probably forgotten, don't look further. */
27982 }
27984 /* Consume this token. */
27986 }
27987 }
27989 /* If the next token is the indicated keyword, consume it. Otherwise,
27990 issue an error message indicating that TOKEN_DESC was expected.
27992 Returns the token consumed, if the token had the appropriate type.
27993 Otherwise, returns NULL. */
27998 required_token token_desc)
27999 {
28003 {
28006 }
28009 }
28011 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28012 function-definition. */
28014 static bool
28016 {
28019 /* A ctor-initializer begins with a `:'. */
28021 /* A function-try-block begins with `try'. */
28023 /* A function-transaction-block begins with `__transaction_atomic'
28024 or `__transaction_relaxed'. */
28027 /* The named return value extension begins with `return'. */
28029 }
28031 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28032 definition. */
28034 static bool
28036 {
28043 }
28045 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28046 C++0x) ending a template-argument. */
28048 static bool
28050 {
28058 }
28060 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28061 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28063 static bool
28066 {
28072 /* Check for the sequence `<::' in the original code. It would be lexed as
28073 `[:', where `[' is a digraph, and there is no whitespace before
28074 `:'. */
28076 {
28081 }
28083 }
28085 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28086 or none_type otherwise. */
28088 static enum tag_types
28090 {
28092 {
28102 }
28103 }
28105 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28106 or none_type otherwise or if the token is null. */
28108 static enum tag_types
28110 {
28115 {
28123 }
28124 }
28126 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28128 static void
28130 {
28134 {
28138 type))
28141 }
28142 }
28144 /* Issue an error message if DECL is redeclared with different
28145 access than its original declaration [class.access.spec/3].
28146 This applies to nested classes, nested class templates and
28147 enumerations [class.mem/1]. */
28149 static void
28151 {
28162 }
28164 /* Look for the `template' keyword, as a syntactic disambiguator.
28165 Return TRUE iff it is present, in which case it will be
28166 consumed. */
28168 static bool
28170 {
28172 {
28173 /* In C++98 the `template' keyword can only be used within templates;
28174 outside templates the parser can always figure out what is a
28175 template and what is not. In C++11, per the resolution of DR 468,
28176 `template' is allowed in cases where it is not strictly necessary. */
28179 {
28182 "in C++98 %<template%> (as a disambiguator) is only "
28184 /* If this part of the token stream is rescanned, the same
28185 error message would be generated. So, we purge the token
28186 from the stream. */
28189 }
28190 else
28191 {
28192 /* Consume the `template' keyword. */
28195 }
28196 }
28198 }
28200 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28201 set PARSER->SCOPE, and perform other related actions. */
28203 static void
28205 {
28208 /* Get the stored value. */
28210 /* Set the scope from the stored value. */
28214 }
28216 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28217 encounter the end of a block before what we were looking for. */
28219 static bool
28223 {
28225 {
28228 /* Abort a parenthesized expression if we encounter a semicolon. */
28232 /* If we've reached the end of the file, stop. */
28238 /* We've hit the end of an enclosing block, so there's been some
28239 kind of syntax error. */
28242 /* Consume the token. */
28244 /* See if it starts a new group. */
28246 {
28248 /* In theory this should probably check end == '}', but
28249 cp_parser_save_member_function_body needs it to exit
28250 after either '}' or ')' when called with ')'. */
28253 }
28255 {
28259 }
28264 }
28265 }
28267 /* Like above, for caching a default argument or NSDMI. Both of these are
28268 terminated by a non-nested comma, but it can be unclear whether or not a
28269 comma is nested in a template argument list unless we do more parsing.
28270 In order to handle this ambiguity, when we encounter a ',' after a '<'
28271 we try to parse what follows as a parameter-declaration-list (in the
28272 case of a default argument) or a member-declarator (in the case of an
28273 NSDMI). If that succeeds, then we stop caching. */
28275 static tree
28277 {
28282 tree default_argument;
28284 /* Add tokens until we have processed the entire default
28285 argument. We add the range [first_token, token). */
28288 {
28289 /* For list-initialization, this is straightforward. */
28292 }
28294 {
28297 /* Peek at the next token. */
28299 /* What we do depends on what token we have. */
28301 {
28302 /* In valid code, a default argument must be
28303 immediately followed by a `,' `)', or `...'. */
28306 {
28307 /* If we've seen a '<', we might be in a
28308 template-argument-list. Until Core issue 325 is
28309 resolved, we don't know how this situation ought
28310 to be handled, so try to DTRT. We check whether
28311 what comes after the comma is a valid parameter
28312 declaration list. If it is, then the comma ends
28313 the default argument; otherwise the default
28314 argument continues. */
28318 /* Set ITALP so cp_parser_parameter_declaration_list
28319 doesn't decide to commit to this parse. */
28326 {
28327 /* Parse declarators until we reach a non-comma or
28328 somthing that cannot be an initializer.
28329 Just checking whether we're looking at a single
28330 declarator is insufficient. Consider:
28331 int var = tuple<T,U>::x;
28332 The template parameter 'U' looks exactly like a
28333 declarator. */
28334 do
28335 {
28346 }
28348 /* If we met an '=' or ';' then the original comma
28349 was the end of the NSDMI. Otherwise assume
28350 we're still in the NSDMI. */
28353 }
28354 else
28355 {
28360 }
28367 }
28368 /* FALLTHRU */
28371 /* If we run into a non-nested `;', `}', or `]',
28372 then the code is invalid -- but the default
28373 argument is certainly over. */
28378 /* Handle correctly int n = sizeof ... ( p ); */
28381 /* Update DEPTH, if necessary. */
28396 /* This might be the comparison operator, or it might
28397 start a template argument list. */
28404 /* Fall through for C++0x, which treats the `>>'
28405 operator like two `>' tokens in certain
28406 cases. */
28411 {
28412 /* This might be an operator, or it might close a
28413 template argument list. But if a previous '<'
28414 started a template argument list, this will have
28415 closed it, so we can't be in one anymore. */
28419 }
28422 /* If we run out of tokens, issue an error message. */
28430 /* In these cases, we should look for template-ids.
28431 For example, if the default argument is
28432 `X<int, double>()', we need to do name lookup to
28433 figure out whether or not `X' is a template; if
28434 so, the `,' does not end the default argument.
28436 That is not yet done. */
28441 }
28443 /* If we've reached the end, stop. */
28447 /* Add the token to the token block. */
28449 }
28451 /* Create a DEFAULT_ARG to represent the unparsed default
28452 argument. */
28459 }
28461 /* Begin parsing tentatively. We always save tokens while parsing
28462 tentatively so that if the tentative parsing fails we can restore the
28463 tokens. */
28465 static void
28467 {
28468 /* Enter a new parsing context. */
28470 /* Begin saving tokens. */
28472 /* In order to avoid repetitive access control error messages,
28473 access checks are queued up until we are no longer parsing
28474 tentatively. */
28476 }
28478 /* Commit to the currently active tentative parse. */
28480 static void
28482 {
28486 /* Mark all of the levels as committed. */
28489 {
28496 }
28497 }
28499 /* Commit to the topmost currently active tentative parse.
28501 Note that this function shouldn't be called when there are
28502 irreversible side-effects while in a tentative state. For
28503 example, we shouldn't create a permanent entry in the symbol
28504 table, or issue an error message that might not apply if the
28505 tentative parse is aborted. */
28507 static void
28509 {
28514 {
28522 }
28523 }
28525 /* Abort the currently active tentative parse. All consumed tokens
28526 will be rolled back, and no diagnostics will be issued. */
28528 static void
28530 {
28534 /* Now, pretend that we want to see if the construct was
28535 successfully parsed. */
28537 }
28539 /* Stop parsing tentatively. If a parse error has occurred, restore the
28540 token stream. Otherwise, commit to the tokens we have consumed.
28541 Returns true if no error occurred; false otherwise. */
28543 static bool
28545 {
28549 /* Remember whether or not an error occurred, since we are about to
28550 destroy that information. */
28552 /* Remove the topmost context from the stack. */
28555 /* If no parse errors occurred, commit to the tentative parse. */
28557 {
28558 /* Commit to the tokens read tentatively, unless that was
28559 already done. */
28564 }
28565 /* Otherwise, if errors occurred, roll back our state so that things
28566 are just as they were before we began the tentative parse. */
28567 else
28568 {
28571 }
28572 /* Add the context to the front of the free list. */
28577 }
28579 /* Returns true if we are parsing tentatively and are not committed to
28580 this tentative parse. */
28582 static bool
28584 {
28587 }
28589 /* Returns nonzero iff an error has occurred during the most recent
28590 tentative parse. */
28592 static bool
28594 {
28597 }
28599 /* Returns nonzero if GNU extensions are allowed. */
28601 static bool
28603 {
28605 }
28606 \f
28607 /* Objective-C++ Productions */
28610 /* Parse an Objective-C expression, which feeds into a primary-expression
28611 above.
28613 objc-expression:
28614 objc-message-expression
28615 objc-string-literal
28616 objc-encode-expression
28617 objc-protocol-expression
28618 objc-selector-expression
28620 Returns a tree representation of the expression. */
28622 static cp_expr
28624 {
28625 /* Try to figure out what kind of declaration is present. */
28629 {
28639 {
28651 }
28657 }
28660 }
28662 /* Parse an Objective-C message expression.
28664 objc-message-expression:
28665 [ objc-message-receiver objc-message-args ]
28667 Returns a representation of an Objective-C message. */
28669 static tree
28671 {
28683 /* Construct a location e.g.
28684 [self func1:5]
28685 ^~~~~~~~~~~~~~
28686 ranging from the '[' to the ']', with the caret at the start. */
28691 }
28693 /* Parse an objc-message-receiver.
28695 objc-message-receiver:
28696 expression
28697 simple-type-specifier
28699 Returns a representation of the type or expression. */
28701 static tree
28703 {
28704 tree rcv;
28706 /* An Objective-C message receiver may be either (1) a type
28707 or (2) an expression. */
28711 /* If that worked out, fine. */
28718 CP_PARSER_FLAGS_NONE);
28725 }
28727 /* Parse the arguments and selectors comprising an Objective-C message.
28729 objc-message-args:
28730 objc-selector
28731 objc-selector-args
28732 objc-selector-args , objc-comma-args
28734 objc-selector-args:
28735 objc-selector [opt] : assignment-expression
28736 objc-selector-args objc-selector [opt] : assignment-expression
28738 objc-comma-args:
28739 assignment-expression
28740 objc-comma-args , assignment-expression
28742 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28743 selector arguments and TREE_VALUE containing a list of comma
28744 arguments. */
28746 static tree
28748 {
28754 {
28760 /* Detect if we have a unary selector. */
28769 sel_args
28774 }
28776 /* Handle non-selector arguments, if any. */
28778 {
28779 tree arg;
28784 addl_args
28789 }
28792 {
28795 }
28798 }
28800 /* Parse an Objective-C encode expression.
28802 objc-encode-expression:
28803 @encode objc-typename
28805 Returns an encoded representation of the type argument. */
28807 static cp_expr
28809 {
28810 tree type;
28821 {
28825 }
28827 /* This happens if we find @encode(T) (where T is a template
28828 typename or something dependent on a template typename) when
28829 parsing a template. In that case, we can't compile it
28830 immediately, but we rather create an AT_ENCODE_EXPR which will
28831 need to be instantiated when the template is used.
28832 */
28834 {
28838 }
28841 /* Build a location of the form:
28842 @encode(int)
28843 ^~~~~~~~~~~~
28844 with caret==start at the @ token, finishing at the close paren. */
28845 location_t combined_loc
28850 }
28852 /* Parse an Objective-C @defs expression. */
28854 static tree
28856 {
28857 tree name;
28865 }
28867 /* Parse an Objective-C protocol expression.
28869 objc-protocol-expression:
28870 @protocol ( identifier )
28872 Returns a representation of the protocol expression. */
28874 static tree
28876 {
28877 tree proto;
28885 /* Build a location of the form:
28886 @protocol(prot)
28887 ^~~~~~~~~~~~~~~
28888 with caret==start at the @ token, finishing at the close paren. */
28889 location_t combined_loc
28895 }
28897 /* Parse an Objective-C selector expression.
28899 objc-selector-expression:
28900 @selector ( objc-method-signature )
28902 objc-method-signature:
28903 objc-selector
28904 objc-selector-seq
28906 objc-selector-seq:
28907 objc-selector :
28908 objc-selector-seq objc-selector :
28910 Returns a representation of the method selector. */
28912 static tree
28914 {
28926 {
28935 {
28936 /* Detect if we have a unary selector. */
28938 {
28941 }
28942 else
28943 {
28945 }
28946 }
28951 {
28952 sel_seq
28955 sel_seq
28958 }
28959 else
28960 sel_seq
28965 }
28967 finish_selector:
28971 /* Build a location of the form:
28972 @selector(func)
28973 ^~~~~~~~~~~~~~~
28974 with caret==start at the @ token, finishing at the close paren. */
28975 location_t combined_loc
28979 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28982 }
28984 /* Parse a list of identifiers.
28986 objc-identifier-list:
28987 identifier
28988 objc-identifier-list , identifier
28990 Returns a TREE_LIST of identifier nodes. */
28992 static tree
28994 {
28995 tree identifier;
28996 tree list;
29007 {
29014 identifier));
29016 }
29019 }
29021 /* Parse an Objective-C alias declaration.
29023 objc-alias-declaration:
29024 @compatibility_alias identifier identifier ;
29026 This function registers the alias mapping with the Objective-C front end.
29027 It returns nothing. */
29029 static void
29031 {
29039 }
29041 /* Parse an Objective-C class forward-declaration.
29043 objc-class-declaration:
29044 @class objc-identifier-list ;
29046 The function registers the forward declarations with the Objective-C
29047 front end. It returns nothing. */
29049 static void
29051 {
29054 {
29055 tree id;
29065 else
29067 }
29069 }
29071 /* Parse a list of Objective-C protocol references.
29073 objc-protocol-refs-opt:
29074 objc-protocol-refs [opt]
29076 objc-protocol-refs:
29077 < objc-identifier-list >
29079 Returns a TREE_LIST of identifiers, if any. */
29081 static tree
29083 {
29087 {
29091 }
29094 }
29096 /* Parse a Objective-C visibility specification. */
29098 static void
29100 {
29104 {
29119 }
29121 /* Eat '@private'/'@protected'/'@public'. */
29123 }
29125 /* Parse an Objective-C method type. Return 'true' if it is a class
29126 (+) method, and 'false' if it is an instance (-) method. */
29130 {
29133 else
29135 }
29137 /* Parse an Objective-C protocol qualifier. */
29139 static tree
29141 {
29154 {
29159 }
29162 }
29164 /* Parse an Objective-C typename. */
29166 static tree
29168 {
29172 {
29178 /* An ObjC type name may consist of just protocol qualifiers, in which
29179 case the type shall default to 'id'. */
29181 {
29184 /* If the type could not be parsed, an error has already
29185 been produced. For error recovery, behave as if it had
29186 not been specified, which will use the default type
29187 'id'. */
29189 {
29191 /* We need to skip to the closing parenthesis as
29192 cp_parser_type_id() does not seem to do it for
29193 us. */
29198 }
29199 }
29203 }
29206 }
29208 /* Check to see if TYPE refers to an Objective-C selector name. */
29210 static bool
29212 {
29218 }
29220 /* Parse an Objective-C selector. */
29222 static tree
29224 {
29228 {
29231 }
29233 /* C++ operator names are allowed to appear in ObjC selectors. */
29235 {
29248 }
29249 }
29251 /* Parse an Objective-C params list. */
29253 static tree
29255 {
29261 {
29271 /* Detect if we have a unary selector. */
29274 {
29277 }
29281 {
29282 /* Something went quite wrong. There should be a colon
29283 here, but there is not. Stop parsing parameters. */
29285 }
29287 /* New ObjC allows attributes on parameters too. */
29292 params
29295 type_name,
29296 identifier,
29297 parm_attr));
29300 }
29303 {
29306 }
29308 /* We allow tail attributes for the method. */
29310 {
29318 }
29321 {
29324 }
29326 }
29328 /* Parse the non-keyword Objective-C params. */
29330 static tree
29333 {
29339 {
29341 tree parm;
29347 {
29352 }
29354 /* TODO: parse attributes for tail parameters. */
29363 }
29365 /* We allow tail attributes for the method. */
29367 {
29369 {
29374 }
29375 else
29376 /* We have an error, but parse the attributes, so that we can
29377 carry on. */
29383 }
29386 }
29388 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29390 static void
29392 {
29395 /* If the next token is `extern' and the following token is a string
29396 literal, then we have a linkage specification. */
29398 && cp_parser_is_pure_string_literal
29401 /* Handle #pragma, if any. */
29404 /* Allow stray semicolons. */
29407 /* Mark methods as optional or required, when building protocols. */
29409 {
29412 }
29414 {
29417 }
29420 /* Other stray characters must generate errors. */
29422 {
29426 }
29427 /* Finally, try to parse a block-declaration, or a function-definition. */
29428 else
29430 }
29432 /* Parse a method signature. */
29434 static tree
29436 {
29452 }
29454 static bool
29456 {
29457 tree tattr;
29462 /* If the attributes are followed by a method introducer, this is not allowed.
29463 Dump the attributes and flag the situation. */
29468 /* Otherwise, the attributes introduce some interstitial code, possibly so
29469 rewind to allow that check. */
29472 }
29474 /* Parse an Objective-C method prototype list. */
29476 static void
29478 {
29482 {
29484 {
29489 else
29493 {
29497 }
29500 }
29506 OPT_Wattributes,
29508 else
29509 /* Allow for interspersed non-ObjC++ code. */
29513 }
29517 else
29521 }
29523 /* Parse an Objective-C method definition list. */
29525 static void
29527 {
29531 {
29532 tree meth;
29535 {
29541 else
29546 {
29550 }
29552 NULL_TREE);
29554 /* For historical reasons, we accept an optional semicolon. */
29561 {
29568 }
29569 }
29570 /* The following case will be removed once @synthesize is
29571 completely implemented. */
29582 else
29583 /* Allow for interspersed non-ObjC++ code. */
29587 }
29591 else
29595 }
29597 /* Parse Objective-C ivars. */
29599 static void
29601 {
29612 {
29613 cp_decl_specifier_seq declspecs;
29615 tree prefix_attributes;
29623 CP_PARSER_FLAGS_OPTIONAL,
29627 /* auto, register, static, extern, mutable. */
29629 {
29632 }
29634 /* thread_local. */
29636 {
29639 }
29641 /* typedef. */
29643 {
29646 }
29651 /* Keep going until we hit the `;' at the end of the
29652 declaration. */
29654 {
29659 /* Check for a (possibly unnamed) bitfield declaration. */
29667 {
29668 /* Get the name of the bitfield. */
29671 sfk_none);
29673 eat_colon:
29675 /* Get the width of the bitfield. */
29676 width
29678 }
29679 else
29680 {
29681 /* Parse the declarator. */
29682 declarator
29688 }
29690 /* Look for attributes that apply to the ivar. */
29692 /* Remember which attributes are prefix attributes and
29693 which are not. */
29695 /* Combine the attributes. */
29699 /* Create the bitfield declaration. */
29701 width,
29702 attributes);
29703 else
29708 /* Add the instance variable. */
29712 /* Reset PREFIX_ATTRIBUTES. */
29721 {
29724 }
29726 }
29730 }
29735 /* Do not consume the RID_AT_END, so it will be read again as terminating
29736 the @interface of @implementation. */
29740 /* For historical reasons, we accept an optional semicolon. */
29743 }
29745 /* Parse an Objective-C protocol declaration. */
29747 static void
29749 {
29755 {
29760 }
29762 /* See if we have a forward declaration or a definition. */
29765 /* Try a forward declaration first. */
29767 {
29769 {
29770 tree id;
29780 else
29782 }
29784 }
29786 /* Ok, we got a full-fledged definition (or at least should). */
29787 else
29788 {
29793 }
29794 }
29796 /* Parse an Objective-C superclass or category. */
29798 static void
29803 {
29809 {
29812 }
29814 {
29817 /* If there is no category name, and this is an @interface, we
29818 have a class extension. */
29820 {
29823 }
29824 else
29828 }
29829 }
29831 /* Parse an Objective-C class interface. */
29833 static void
29835 {
29842 {
29843 /* It's hard to recover because even if valid @interface stuff
29844 is to follow, we can't compile it (or validate it) if we
29845 don't even know which class it refers to. Let's assume this
29846 was a stray '@interface' token in the stream and skip it.
29847 */
29849 }
29854 /* We have either a class or a category on our hands. */
29857 else
29858 {
29860 /* Handle instance variable declarations, if any. */
29863 }
29866 }
29868 /* Parse an Objective-C class implementation. */
29870 static void
29872 {
29879 {
29880 /* It's hard to recover because even if valid @implementation
29881 stuff is to follow, we can't compile it (or validate it) if
29882 we don't even know which class it refers to. Let's assume
29883 this was a stray '@implementation' token in the stream and
29884 skip it.
29885 */
29887 }
29891 /* We have either a class or a category on our hands. */
29894 else
29895 {
29897 /* Handle instance variable declarations, if any. */
29900 }
29903 }
29905 /* Consume the @end token and finish off the implementation. */
29907 static void
29909 {
29912 }
29914 /* Parse an Objective-C declaration. */
29916 static void
29918 {
29919 /* Try to figure out what kind of declaration is present. */
29924 {
29940 }
29943 {
29966 }
29967 }
29969 /* Parse an Objective-C try-catch-finally statement.
29971 objc-try-catch-finally-stmt:
29972 @try compound-statement objc-catch-clause-seq [opt]
29973 objc-finally-clause [opt]
29975 objc-catch-clause-seq:
29976 objc-catch-clause objc-catch-clause-seq [opt]
29978 objc-catch-clause:
29979 @catch ( objc-exception-declaration ) compound-statement
29981 objc-finally-clause:
29982 @finally compound-statement
29984 objc-exception-declaration:
29985 parameter-declaration
29986 '...'
29988 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29990 Returns NULL_TREE.
29992 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29993 for C. Keep them in sync. */
29995 static tree
29997 {
29998 location_t location;
29999 tree stmt;
30004 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30005 node, lest it get absorbed into the surrounding block. */
30011 {
30020 {
30021 /* We have "@catch (...)" (where the '...' are literally
30022 what is in the code). Skip the '...'.
30023 parameter_declaration is set to NULL_TREE, and
30024 objc_being_catch_clauses() knows that that means
30025 '...'. */
30028 }
30029 else
30030 {
30031 /* We have "@catch (NSException *exception)" or something
30032 like that. Parse the parameter declaration. */
30036 else
30041 }
30044 else
30045 {
30046 /* If there was no open parenthesis, we are recovering from
30047 an error, and we are trying to figure out what mistake
30048 the user has made. */
30050 /* If there is an immediate closing parenthesis, the user
30051 probably forgot the opening one (ie, they typed "@catch
30052 NSException *e)". Parse the closing parenthesis and keep
30053 going. */
30057 /* If these is no immediate closing parenthesis, the user
30058 probably doesn't know that parenthesis are required at
30059 all (ie, they typed "@catch NSException *e"). So, just
30060 forget about the closing parenthesis and keep going. */
30061 }
30065 }
30067 {
30070 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30071 node, lest it get absorbed into the surrounding block. */
30075 }
30078 }
30080 /* Parse an Objective-C synchronized statement.
30082 objc-synchronized-stmt:
30083 @synchronized ( expression ) compound-statement
30085 Returns NULL_TREE. */
30087 static tree
30089 {
30090 location_t location;
30101 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30102 node, lest it get absorbed into the surrounding block. */
30107 }
30109 /* Parse an Objective-C throw statement.
30111 objc-throw-stmt:
30112 @throw assignment-expression [opt] ;
30114 Returns a constructed '@throw' statement. */
30116 static tree
30118 {
30130 }
30132 /* Parse an Objective-C statement. */
30134 static tree
30136 {
30137 /* Try to figure out what kind of declaration is present. */
30141 {
30152 }
30155 }
30157 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30158 look ahead to see if an objc keyword follows the attributes. This
30159 is to detect the use of prefix attributes on ObjC @interface and
30160 @protocol. */
30162 static bool
30164 {
30169 {
30172 }
30175 }
30177 /* This routine is a minimal replacement for
30178 c_parser_struct_declaration () used when parsing the list of
30179 types/names or ObjC++ properties. For example, when parsing the
30180 code
30182 @property (readonly) int a, b, c;
30184 this function is responsible for parsing "int a, int b, int c" and
30185 returning the declarations as CHAIN of DECLs.
30187 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30188 similar parsing. */
30189 static tree
30191 {
30193 cp_decl_specifier_seq declspecs;
30195 tree prefix_attributes;
30198 CP_PARSER_FLAGS_NONE,
30205 /* auto, register, static, extern, mutable. */
30207 {
30210 }
30212 /* thread_local. */
30214 {
30217 }
30219 /* typedef. */
30221 {
30224 }
30229 /* Keep going until we hit the `;' at the end of the declaration. */
30231 {
30236 /* Parse the declarator. */
30240 /* Look for attributes that apply to the ivar. */
30242 /* Remember which attributes are prefix attributes and
30243 which are not. */
30245 /* Combine the attributes. */
30255 /* Reset PREFIX_ATTRIBUTES. */
30266 {
30269 }
30270 else
30272 }
30274 }
30276 /* Parse an Objective-C @property declaration. The syntax is:
30278 objc-property-declaration:
30279 '@property' objc-property-attributes[opt] struct-declaration ;
30281 objc-property-attributes:
30282 '(' objc-property-attribute-list ')'
30284 objc-property-attribute-list:
30285 objc-property-attribute
30286 objc-property-attribute-list, objc-property-attribute
30288 objc-property-attribute
30289 'getter' = identifier
30290 'setter' = identifier
30291 'readonly'
30292 'readwrite'
30293 'assign'
30294 'retain'
30295 'copy'
30296 'nonatomic'
30298 For example:
30299 @property NSString *name;
30300 @property (readonly) id object;
30301 @property (retain, nonatomic, getter=getTheName) id name;
30302 @property int a, b, c;
30304 PS: This function is identical to
30305 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30306 static void
30308 {
30309 /* The following variables hold the attributes of the properties as
30310 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30311 seen. When we see an attribute, we set them to 'true' (if they
30312 are boolean properties) or to the identifier (if they have an
30313 argument, ie, for getter and setter). Note that here we only
30314 parse the list of attributes, check the syntax and accumulate the
30315 attributes that we find. objc_add_property_declaration() will
30316 then process the information. */
30326 /* 'properties' is the list of properties that we read. Usually a
30327 single one, but maybe more (eg, in "@property int a, b, c;" there
30328 are three). */
30329 tree properties;
30330 location_t loc;
30336 /* Parse the optional attribute list... */
30338 {
30339 /* Eat the '('. */
30343 {
30349 {
30352 }
30356 {
30367 {
30371 else
30376 }
30379 {
30383 }
30385 {
30387 {
30390 }
30391 else
30395 else
30397 }
30398 else
30399 {
30401 {
30404 }
30405 else
30407 }
30413 }
30420 else
30422 }
30424 /* FIXME: "@property (setter, assign);" will generate a spurious
30425 "error: expected ‘)’ before ‘,’ token". This is because
30426 cp_parser_require, unlike the C counterpart, will produce an
30427 error even if we are in error recovery. */
30429 {
30434 }
30435 }
30437 /* ... and the property declaration(s). */
30441 {
30443 /* If the next token is now a `;', consume it. */
30447 }
30451 else
30452 {
30453 /* Comma-separated properties are chained together in
30454 reverse order; add them one by one. */
30463 }
30466 }
30468 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30470 objc-synthesize-declaration:
30471 @synthesize objc-synthesize-identifier-list ;
30473 objc-synthesize-identifier-list:
30474 objc-synthesize-identifier
30475 objc-synthesize-identifier-list, objc-synthesize-identifier
30477 objc-synthesize-identifier
30478 identifier
30479 identifier = identifier
30481 For example:
30482 @synthesize MyProperty;
30483 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30485 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30486 for C. Keep them in sync.
30487 */
30488 static void
30490 {
30492 location_t loc;
30497 {
30501 {
30504 }
30506 {
30510 {
30513 }
30514 }
30515 else
30520 else
30522 }
30525 }
30527 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30529 objc-dynamic-declaration:
30530 @dynamic identifier-list ;
30532 For example:
30533 @dynamic MyProperty;
30534 @dynamic MyProperty, AnotherProperty;
30536 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30537 for C. Keep them in sync.
30538 */
30539 static void
30541 {
30543 location_t loc;
30548 {
30549 tree property;
30552 {
30555 }
30559 else
30561 }
30564 }
30566 \f
30567 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30569 /* Returns name of the next clause.
30570 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30571 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30572 returned and the token is consumed. */
30574 static pragma_omp_clause
30576 {
30592 {
30597 {
30780 }
30781 }
30787 }
30789 /* Validate that a clause of the given type does not already exist. */
30791 static void
30794 {
30795 tree c;
30799 {
30802 }
30803 }
30805 /* OpenMP 2.5:
30806 variable-list:
30807 identifier
30808 variable-list , identifier
30810 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
30811 colon). An opening parenthesis will have been consumed by the caller.
30813 If KIND is nonzero, create the appropriate node and install the decl
30814 in OMP_CLAUSE_DECL and add the node to the head of the list.
30816 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
30817 return the list created.
30819 COLON can be NULL if only closing parenthesis should end the list,
30820 or pointer to bool which will receive false if the list is terminated
30821 by closing parenthesis or true if the list is terminated by colon. */
30823 static tree
30826 {
30830 {
30833 }
30835 {
30840 && current_class_ptr
30842 {
30848 }
30849 else
30850 {
30863 }
30865 ;
30867 {
30869 {
30871 /* The OpenACC cache directive explicitly only allows "array
30872 elements or subarrays". */
30874 {
30878 }
30879 /* FALLTHROUGH. */
30884 {
30885 location_t loc
30890 decl
30894 }
30895 /* FALLTHROUGH. */
30899 {
30907 parser->colon_corrects_to_scope_p
30911 else
30912 {
30913 /* Look for `:'. */
30917 CPP_CLOSE_SQUARE))
30919 }
30920 /* Look for the closing `]'. */
30922 RT_CLOSE_SQUARE))
30926 }
30930 }
30936 }
30937 else
30940 get_comma:
30944 }
30950 {
30954 }
30957 {
30960 /* Try to resync to an unnested comma. Copied from
30961 cp_parser_parenthesized_expression_list. */
30962 skip_comma:
30971 }
30974 }
30976 /* Similarly, but expect leading and trailing parenthesis. This is a very
30977 common case for omp clauses. */
30979 static tree
30981 {
30985 }
30987 /* OpenACC 2.0:
30988 copy ( variable-list )
30989 copyin ( variable-list )
30990 copyout ( variable-list )
30991 create ( variable-list )
30992 delete ( variable-list )
30993 present ( variable-list )
30994 present_or_copy ( variable-list )
30995 pcopy ( variable-list )
30996 present_or_copyin ( variable-list )
30997 pcopyin ( variable-list )
30998 present_or_copyout ( variable-list )
30999 pcopyout ( variable-list )
31000 present_or_create ( variable-list )
31001 pcreate ( variable-list ) */
31003 static tree
31005 tree list)
31006 {
31009 {
31055 }
31063 }
31065 /* OpenACC 2.0:
31066 deviceptr ( variable-list ) */
31068 static tree
31070 {
31074 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31075 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31076 variable-list must only allow for pointer variables. */
31079 {
31086 }
31089 }
31091 /* OpenACC 2.0:
31092 auto
31093 independent
31094 nohost
31095 seq */
31097 static tree
31101 {
31106 }
31108 /* OpenACC:
31109 num_gangs ( expression )
31110 num_workers ( expression )
31111 vector_length ( expression ) */
31113 static tree
31116 {
31126 {
31131 }
31139 }
31141 /* OpenACC:
31143 gang [( gang-arg-list )]
31144 worker [( [num:] int-expr )]
31145 vector [( [length:] int-expr )]
31147 where gang-arg is one of:
31149 [num:] int-expr
31150 static: size-expr
31152 and size-expr may be:
31154 *
31155 int-expr
31156 */
31158 static tree
31161 {
31171 {
31174 do
31175 {
31179 /* Gang static argument. */
31182 {
31190 {
31193 }
31195 /* Check for the '*' argument. */
31199 CPP_CLOSE_PAREN)))
31200 {
31205 {
31208 }
31210 }
31211 }
31212 /* Worker num: argument and vector length: arguments. */
31216 {
31219 }
31221 /* Now collect the actual argument. */
31223 {
31226 }
31238 {
31241 }
31243 }
31248 }
31262 cleanup_error:
31265 }
31267 /* OpenACC 2.0:
31268 tile ( size-expr-list ) */
31270 static tree
31272 {
31276 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31277 so, but the spec authors never considered such a case and have
31278 differing opinions on what it might mean, including 'not
31279 allowed'.) */
31282 clause_loc);
31287 do
31288 {
31295 {
31298 }
31299 else
31303 }
31306 /* Consume the trailing ')'. */
31314 }
31316 /* OpenACC 2.0
31317 Parse wait clause or directive parameters. */
31319 static tree
31321 {
31331 {
31336 }
31343 {
31347 {
31350 else
31351 {
31358 }
31359 }
31360 }
31363 }
31365 /* OpenACC:
31366 wait ( int-expr-list ) */
31368 static tree
31370 {
31379 }
31381 /* OpenMP 3.0:
31382 collapse ( constant-expression ) */
31384 static tree
31386 {
31388 location_t loc;
31389 HOST_WIDE_INT n;
31409 {
31412 }
31421 }
31423 /* OpenMP 2.5:
31424 default ( shared | none )
31426 OpenACC 2.0
31427 default (none) */
31429 static tree
31432 {
31434 tree c;
31439 {
31444 {
31459 }
31462 }
31463 else
31464 {
31465 invalid_kind:
31468 else
31470 }
31486 }
31488 /* OpenMP 3.1:
31489 final ( expression ) */
31491 static tree
31493 {
31514 }
31516 /* OpenMP 2.5:
31517 if ( expression )
31519 OpenMP 4.5:
31520 if ( directive-name-modifier : expression )
31522 directive-name-modifier:
31523 parallel | task | taskloop | target data | target | target update
31524 | target enter data | target exit data */
31526 static tree
31529 {
31537 {
31549 {
31552 {
31565 else
31566 {
31567 location_t loc
31572 }
31575 {
31577 {
31582 }
31584 {
31585 location_t loc
31589 }
31590 }
31591 }
31592 }
31594 {
31596 {
31599 }
31600 else
31601 {
31603 {
31604 location_t loc
31607 }
31609 }
31610 }
31611 }
31623 {
31626 {
31629 {
31639 }
31641 p);
31643 }
31645 {
31648 else
31651 }
31654 {
31658 }
31659 }
31667 }
31669 /* OpenMP 3.1:
31670 mergeable */
31672 static tree
31675 {
31676 tree c;
31679 location);
31684 }
31686 /* OpenMP 2.5:
31687 nowait */
31689 static tree
31692 {
31693 tree c;
31700 }
31702 /* OpenMP 2.5:
31703 num_threads ( expression ) */
31705 static tree
31707 location_t location)
31708 {
31730 }
31732 /* OpenMP 4.5:
31733 num_tasks ( expression ) */
31735 static tree
31737 location_t location)
31738 {
31760 }
31762 /* OpenMP 4.5:
31763 grainsize ( expression ) */
31765 static tree
31767 location_t location)
31768 {
31790 }
31792 /* OpenMP 4.5:
31793 priority ( expression ) */
31795 static tree
31797 location_t location)
31798 {
31820 }
31822 /* OpenMP 4.5:
31823 hint ( expression ) */
31825 static tree
31827 location_t location)
31828 {
31849 }
31851 /* OpenMP 4.5:
31852 defaultmap ( tofrom : scalar ) */
31854 static tree
31856 location_t location)
31857 {
31865 {
31868 }
31872 {
31875 }
31881 {
31884 }
31888 {
31891 }
31897 location);
31903 out_err:
31908 }
31910 /* OpenMP 2.5:
31911 ordered
31913 OpenMP 4.5:
31914 ordered ( constant-expression ) */
31916 static tree
31919 {
31921 HOST_WIDE_INT n;
31927 {
31944 {
31946 "ordered argument needs positive constant integer "
31949 }
31950 }
31956 }
31958 /* OpenMP 2.5:
31959 reduction ( reduction-operator : variable-list )
31961 reduction-operator:
31962 One of: + * - & ^ | && ||
31964 OpenMP 3.1:
31966 reduction-operator:
31967 One of: + * - & ^ | && || min max
31969 OpenMP 4.0:
31971 reduction-operator:
31972 One of: + * - & ^ | && ||
31973 id-expression */
31975 static tree
31977 {
31985 {
31995 }
31999 else
32000 {
32011 {
32041 }
32042 else
32043 {
32045 resync_fail:
32050 }
32051 }
32057 NULL);
32059 {
32062 }
32065 }
32067 /* OpenMP 2.5:
32068 schedule ( schedule-kind )
32069 schedule ( schedule-kind , expression )
32071 schedule-kind:
32072 static | dynamic | guided | runtime | auto
32074 OpenMP 4.5:
32075 schedule ( schedule-modifier : schedule-kind )
32076 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32078 schedule-modifier:
32079 simd
32080 monotonic
32081 nonmonotonic */
32083 static tree
32085 {
32095 {
32104 else
32110 else
32111 {
32114 }
32115 }
32118 {
32123 {
32144 }
32145 }
32150 else
32156 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32158 {
32162 }
32165 {
32180 else
32185 }
32197 invalid_kind:
32199 resync_fail:
32204 }
32206 /* OpenMP 3.0:
32207 untied */
32209 static tree
32212 {
32213 tree c;
32220 }
32222 /* OpenMP 4.0:
32223 inbranch
32224 notinbranch */
32226 static tree
32229 {
32234 }
32236 /* OpenMP 4.0:
32237 parallel
32238 for
32239 sections
32240 taskgroup */
32242 static tree
32246 {
32250 }
32252 /* OpenMP 4.5:
32253 nogroup */
32255 static tree
32258 {
32263 }
32265 /* OpenMP 4.5:
32266 simd
32267 threads */
32269 static tree
32273 {
32278 }
32280 /* OpenMP 4.0:
32281 num_teams ( expression ) */
32283 static tree
32285 location_t location)
32286 {
32308 }
32310 /* OpenMP 4.0:
32311 thread_limit ( expression ) */
32313 static tree
32315 location_t location)
32316 {
32338 }
32340 /* OpenMP 4.0:
32341 aligned ( variable-list )
32342 aligned ( variable-list : constant-expression ) */
32344 static tree
32346 {
32357 {
32367 }
32373 }
32375 /* OpenMP 4.0:
32376 linear ( variable-list )
32377 linear ( variable-list : expression )
32379 OpenMP 4.5:
32380 linear ( modifier ( variable-list ) )
32381 linear ( modifier ( variable-list ) : expression ) */
32383 static tree
32386 {
32396 {
32408 else
32410 }
32415 else
32416 {
32425 }
32428 {
32433 {
32444 {
32447 }
32450 }
32455 {
32458 }
32466 }
32469 {
32472 }
32475 }
32477 /* OpenMP 4.0:
32478 safelen ( constant-expression ) */
32480 static tree
32482 location_t location)
32483 {
32504 }
32506 /* OpenMP 4.0:
32507 simdlen ( constant-expression ) */
32509 static tree
32511 location_t location)
32512 {
32533 }
32535 /* OpenMP 4.5:
32536 vec:
32537 identifier [+/- integer]
32538 vec , identifier [+/- integer]
32539 */
32541 static tree
32543 tree list)
32544 {
32548 {
32551 }
32554 {
32561 else
32562 {
32563 t = cp_parser_lookup_name_simple
32568 id_loc);
32569 }
32575 {
32578 }
32582 {
32585 }
32589 {
32592 }
32595 add_to_vector:
32597 {
32601 }
32607 }
32610 {
32616 }
32618 }
32620 /* OpenMP 4.0:
32621 depend ( depend-kind : variable-list )
32623 depend-kind:
32624 in | out | inout
32626 OpenMP 4.5:
32627 depend ( source )
32629 depend ( sink : vec ) */
32631 static tree
32633 {
32641 {
32655 else
32657 }
32658 else
32664 {
32674 }
32681 else
32682 {
32688 }
32691 invalid_kind:
32693 resync_fail:
32698 }
32700 /* OpenMP 4.0:
32701 map ( map-kind : variable-list )
32702 map ( variable-list )
32704 map-kind:
32705 alloc | to | from | tofrom
32707 OpenMP 4.5:
32708 map-kind:
32709 alloc | to | from | tofrom | release | delete
32711 map ( always [,] map-kind: variable-list ) */
32713 static tree
32715 {
32724 {
32729 {
32732 nth++;
32738 {
32743 }
32744 }
32745 }
32749 {
32763 else
32764 {
32770 }
32773 }
32776 {
32780 }
32783 NULL);
32789 }
32791 /* OpenMP 4.0:
32792 device ( expression ) */
32794 static tree
32796 location_t location)
32797 {
32819 }
32821 /* OpenMP 4.0:
32822 dist_schedule ( static )
32823 dist_schedule ( static , expression ) */
32825 static tree
32827 location_t location)
32828 {
32841 {
32852 }
32857 location);
32861 invalid_kind:
32863 resync_fail:
32868 }
32870 /* OpenMP 4.0:
32871 proc_bind ( proc-bind-kind )
32873 proc-bind-kind:
32874 master | close | spread */
32876 static tree
32878 location_t location)
32879 {
32880 tree c;
32887 {
32897 else
32899 }
32900 else
32909 location);
32914 invalid_kind:
32916 resync_fail:
32921 }
32923 /* OpenACC:
32924 async [( int-expr )] */
32926 static tree
32928 {
32935 {
32944 }
32954 }
32956 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32957 is a bitmask in MASK. Return the list of clauses found. */
32959 static tree
32963 {
32968 {
32969 location_t here;
32970 pragma_omp_clause c_kind;
32971 omp_clause_code code;
32982 {
33034 clauses);
33052 OMP_CLAUSE_INDEPENDENT,
33064 clauses);
33070 clauses);
33094 clauses);
33116 clauses);
33128 clauses);
33142 }
33147 {
33148 /* Remove the invalid clause(s) from the list to avoid
33149 confusing the rest of the compiler. */
33152 }
33153 }
33155 saw_error:
33162 }
33164 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33165 is a bitmask in MASK. Return the list of clauses found; the result
33166 of clause default goes in *pdefault. */
33168 static tree
33172 {
33178 {
33179 pragma_omp_clause c_kind;
33190 {
33202 clauses);
33216 clauses);
33236 clauses);
33241 clauses);
33251 clauses);
33285 clauses);
33299 clauses);
33316 OMP_CLAUSE_NOTINBRANCH,
33325 {
33326 clause_not_first:
33330 }
33360 clauses);
33361 else
33371 clauses);
33389 {
33397 }
33440 clauses
33446 clauses
33458 }
33463 {
33464 /* Remove the invalid clause(s) from the list to avoid
33465 confusing the rest of the compiler. */
33468 }
33469 }
33470 saw_error:
33471 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33472 no reason to skip to the end. */
33476 {
33479 else
33481 }
33483 }
33485 /* OpenMP 2.5:
33486 structured-block:
33487 statement
33489 In practice, we're also interested in adding the statement to an
33490 outer node. So it is convenient if we work around the fact that
33491 cp_parser_statement calls add_stmt. */
33493 static unsigned
33495 {
33498 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33499 This preserves the "not within loop or switch" style error messages
33500 for nonsense cases like
33501 void foo() {
33502 #pragma omp single
33503 break;
33504 }
33505 */
33510 }
33512 static void
33514 {
33516 }
33518 static tree
33520 {
33528 }
33530 /* OpenMP 2.5:
33531 # pragma omp atomic new-line
33532 expression-stmt
33534 expression-stmt:
33535 x binop= expr | x++ | ++x | x-- | --x
33536 binop:
33537 +, *, -, /, &, ^, |, <<, >>
33539 where x is an lvalue expression with scalar type.
33541 OpenMP 3.1:
33542 # pragma omp atomic new-line
33543 update-stmt
33545 # pragma omp atomic read new-line
33546 read-stmt
33548 # pragma omp atomic write new-line
33549 write-stmt
33551 # pragma omp atomic update new-line
33552 update-stmt
33554 # pragma omp atomic capture new-line
33555 capture-stmt
33557 # pragma omp atomic capture new-line
33558 capture-block
33560 read-stmt:
33561 v = x
33562 write-stmt:
33563 x = expr
33564 update-stmt:
33565 expression-stmt | x = x binop expr
33566 capture-stmt:
33567 v = expression-stmt
33568 capture-block:
33569 { v = x; update-stmt; } | { update-stmt; v = x; }
33571 OpenMP 4.0:
33572 update-stmt:
33573 expression-stmt | x = x binop expr | x = expr binop x
33574 capture-stmt:
33575 v = update-stmt
33576 capture-block:
33577 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33579 where x and v are lvalue expressions with scalar type. */
33581 static void
33583 {
33591 {
33596 {
33602 }
33603 }
33605 {
33617 else
33621 }
33623 {
33629 {
33634 {
33637 }
33638 }
33639 }
33643 {
33653 else
33658 {
33659 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33660 opcode. */
33665 }
33669 {
33672 }
33673 else
33674 {
33680 }
33683 }
33685 restart:
33689 {
33696 /* FALLTHROUGH */
33706 /* FALLTHROUGH */
33721 /* Undo effects of boolean_increment for post {in,de}crement. */
33723 /* FALLTHRU */
33727 {
33728 /* Undo effects of boolean_increment. */
33730 {
33731 /* This is pre or post increment. */
33736 && !structured_block
33740 }
33741 }
33742 /* FALLTHRU */
33745 {
33780 {
33784 }
33787 {
33793 {
33798 }
33800 {
33812 {
33814 {
33819 }
33820 else
33822 }
33826 }
33829 {
33836 }
33840 }
33844 {
33847 {
33855 }
33857 {
33862 }
33897 }
33908 /* FALLTHROUGH */
33913 }
33920 }
33921 stmt_done:
33923 {
33934 }
33936 {
33939 }
33940 done:
33946 saw_error:
33949 {
33953 {
33957 }
33958 }
33959 }
33962 /* OpenMP 2.5:
33963 # pragma omp barrier new-line */
33965 static void
33967 {
33970 }
33972 /* OpenMP 2.5:
33973 # pragma omp critical [(name)] new-line
33974 structured-block
33976 OpenMP 4.5:
33977 # pragma omp critical [(name) [hint(expression)]] new-line
33978 structured-block */
33980 #define OMP_CRITICAL_CLAUSE_MASK \
33981 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33983 static tree
33985 {
33989 {
34003 OMP_CRITICAL_CLAUSE_MASK,
34005 }
34006 else
34011 }
34013 /* OpenMP 2.5:
34014 # pragma omp flush flush-vars[opt] new-line
34016 flush-vars:
34017 ( variable-list ) */
34019 static void
34021 {
34027 }
34029 /* Helper function, to parse omp for increment expression. */
34031 static tree
34033 {
34038 {
34041 }
34044 {
34053 /* Fall through: OpenMP disallows NE_EXPR. */
34057 }
34059 /* If decl is an iterator, preserve LHS and RHS of the relational
34060 expr until finish_omp_for. */
34071 }
34073 /* Helper function, to parse omp for increment expression. */
34075 static tree
34077 {
34081 cp_id_kind idk;
34085 {
34094 }
34103 {
34108 }
34115 {
34119 }
34132 do
34133 {
34140 {
34142 {
34145 else
34147 tf_warning_or_error);
34148 }
34149 else
34152 }
34153 }
34157 {
34163 }
34164 else
34168 }
34170 /* Parse the initialization statement of either an OpenMP for loop or
34171 a Cilk Plus for loop.
34173 Return true if the resulting construct should have an
34174 OMP_CLAUSE_PRIVATE added to it. */
34176 static tree
34185 {
34191 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34193 init-expr:
34194 var = lb
34195 integer-type var = lb
34196 random-access-iterator-type var = lb
34197 pointer-type var = lb
34198 */
34199 cp_decl_specifier_seq type_specifiers;
34201 /* First, try to parse as an initialized declaration. See
34202 cp_parser_condition, from whence the bulk of this is copied. */
34209 {
34210 /* If parsing a type specifier seq succeeded, then this
34211 MUST be a initialized declaration. */
34216 CP_PARSER_DECLARATOR_NAMED,
34227 else
34228 {
34238 {
34240 CPP_OPEN_PAREN))
34241 {
34245 else
34248 }
34249 else
34250 /* Trigger an error. */
34255 }
34259 {
34267 {
34270 auto_node);
34275 }
34278 asm_specification,
34279 LOOKUP_ONLYCONVERTING);
34282 {
34285 }
34286 else
34287 {
34290 {
34292 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34294 {
34298 {
34302 }
34304 }
34306 {
34311 }
34312 }
34313 }
34315 }
34316 else
34317 {
34318 /* Consume '='. */
34322 non_class:
34325 else
34328 asm_specification,
34329 LOOKUP_ONLYCONVERTING);
34330 }
34334 }
34335 }
34336 else
34337 {
34338 cp_id_kind idk;
34339 /* If parsing a type specifier sequence failed, then
34340 this MUST be a simple expression. */
34349 && decl
34352 {
34363 {
34368 }
34373 }
34375 && decl
34378 {
34379 tree rhs;
34387 rhs,
34388 tf_warning_or_error));
34391 }
34392 else
34393 {
34398 {
34402 }
34403 }
34404 }
34406 }
34408 /* Parse the restricted form of the for statement allowed by OpenMP. */
34410 static tree
34413 {
34417 location_t loc_first;
34428 {
34431 }
34434 {
34437 }
34440 {
34446 }
34448 {
34451 {
34453 "%<linear%> clause may not be specified together "
34456 }
34457 else
34459 }
34472 {
34475 location_t loc;
34479 {
34483 }
34486 {
34490 }
34499 add_private_clause
34506 {
34509 {
34515 }
34516 else
34518 }
34525 {
34530 {
34534 }
34537 {
34538 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34542 {
34545 }
34546 else
34547 {
34550 }
34552 }
34553 else
34554 {
34559 }
34560 }
34563 {
34564 tree c;
34566 {
34575 decl);
34579 decl);
34580 }
34582 {
34587 else
34592 {
34595 /* For linear, signal that we need to fill up
34596 the so far unknown linear step. */
34599 }
34600 }
34601 }
34610 {
34611 /* If decl is an iterator, preserve the operator on decl
34612 until finish_omp_for. */
34614 && ((processing_template_decl
34619 else
34623 }
34635 {
34638 }
34643 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34644 in between the collapsed for loops to be still considered perfectly
34645 nested. Hopefully the final version clarifies this.
34646 For now handle (multiple) {'s and empty statements. */
34649 {
34653 {
34655 bracecount++;
34656 }
34660 else
34661 {
34668 }
34669 }
34672 {
34675 }
34676 }
34681 /* Note that we saved the original contents of this flag when we entered
34682 the structured block, and so we don't need to re-save it here. */
34685 else
34688 /* Note that the grammar doesn't call for a structured block here,
34689 though the loop as a whole is a structured block. */
34696 else
34701 {
34703 {
34705 nbraces--;
34706 }
34709 else
34710 {
34712 {
34715 }
34720 }
34721 }
34724 {
34728 else
34730 }
34734 }
34736 /* Helper function for OpenMP parsing, split clauses and call
34737 finish_omp_clauses on each of the set of clauses afterwards. */
34739 static void
34742 {
34748 }
34750 /* OpenMP 4.0:
34751 #pragma omp simd simd-clause[optseq] new-line
34752 for-loop */
34754 #define OMP_SIMD_CLAUSE_MASK \
34755 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34764 static tree
34768 {
34779 {
34783 OMP_CLAUSE_ORDERED);
34785 {
34787 "%<ordered%> clause with parameter may not be specified "
34790 }
34791 }
34802 }
34804 /* OpenMP 2.5:
34805 #pragma omp for for-clause[optseq] new-line
34806 for-loop
34808 OpenMP 4.0:
34809 #pragma omp for simd for-simd-clause[optseq] new-line
34810 for-loop */
34812 #define OMP_FOR_CLAUSE_MASK \
34813 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
34819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
34820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34823 static tree
34827 {
34834 /* parallel for{, simd} disallows nowait clause, but for
34835 target {teams distribute ,}parallel for{, simd} it should be accepted. */
34838 /* Composite distribute parallel for{, simd} disallows ordered clause. */
34843 {
34848 {
34872 }
34873 }
34875 {
34878 }
34880 /* Composite distribute parallel for disallows linear clause. */
34887 {
34890 }
34901 }
34903 /* OpenMP 2.5:
34904 # pragma omp master new-line
34905 structured-block */
34907 static tree
34909 {
34913 }
34915 /* OpenMP 2.5:
34916 # pragma omp ordered new-line
34917 structured-block
34919 OpenMP 4.5:
34920 # pragma omp ordered ordered-clauses new-line
34921 structured-block */
34923 #define OMP_ORDERED_CLAUSE_MASK \
34924 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
34925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
34927 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
34928 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34930 static bool
34933 {
34937 {
34942 {
34944 {
34946 "%<depend%> clause may only be used in compound "
34950 }
34951 tree clauses
34953 OMP_ORDERED_DEPEND_CLAUSE_MASK,
34957 }
34958 }
34960 tree clauses
34966 }
34968 /* OpenMP 2.5:
34970 section-scope:
34971 { section-sequence }
34973 section-sequence:
34974 section-directive[opt] structured-block
34975 section-sequence section-directive structured-block */
34977 static tree
34979 {
34991 {
34995 }
34998 {
35006 {
35010 }
35012 {
35015 }
35020 }
35031 }
35033 /* OpenMP 2.5:
35034 # pragma omp sections sections-clause[optseq] newline
35035 sections-scope */
35037 #define OMP_SECTIONS_CLAUSE_MASK \
35038 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35044 static tree
35047 {
35059 {
35062 }
35069 }
35071 /* OpenMP 2.5:
35072 # pragma omp parallel parallel-clause[optseq] new-line
35073 structured-block
35074 # pragma omp parallel for parallel-for-clause[optseq] new-line
35075 structured-block
35076 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35077 structured-block
35079 OpenMP 4.0:
35080 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35081 structured-block */
35083 #define OMP_PARALLEL_CLAUSE_MASK \
35084 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35089 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35090 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35094 static tree
35098 {
35105 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35111 {
35119 if_p);
35123 if_p);
35126 block);
35131 }
35132 /* When combined with distribute, parallel has to be followed by for.
35133 #pragma omp target parallel is allowed though. */
35137 {
35141 }
35143 {
35146 }
35148 {
35152 {
35162 block);
35165 }
35166 }
35171 {
35174 }
35182 }
35184 /* OpenMP 2.5:
35185 # pragma omp single single-clause[optseq] new-line
35186 structured-block */
35188 #define OMP_SINGLE_CLAUSE_MASK \
35189 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35192 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35194 static tree
35196 {
35206 }
35208 /* OpenMP 3.0:
35209 # pragma omp task task-clause[optseq] new-line
35210 structured-block */
35212 #define OMP_TASK_CLAUSE_MASK \
35213 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35216 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35217 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35224 static tree
35226 {
35237 }
35239 /* OpenMP 3.0:
35240 # pragma omp taskwait new-line */
35242 static void
35244 {
35247 }
35249 /* OpenMP 3.1:
35250 # pragma omp taskyield new-line */
35252 static void
35254 {
35257 }
35259 /* OpenMP 4.0:
35260 # pragma omp taskgroup new-line
35261 structured-block */
35263 static tree
35265 {
35269 if_p));
35270 }
35273 /* OpenMP 2.5:
35274 # pragma omp threadprivate (variable-list) */
35276 static void
35278 {
35279 tree vars;
35285 }
35287 /* OpenMP 4.0:
35288 # pragma omp cancel cancel-clause[optseq] new-line */
35290 #define OMP_CANCEL_CLAUSE_MASK \
35291 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35297 static void
35299 {
35303 }
35305 /* OpenMP 4.0:
35306 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35308 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35309 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35312 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35314 static void
35317 {
35318 tree clauses;
35322 {
35327 {
35330 }
35331 }
35333 {
35337 }
35340 {
35343 "%<#pragma omp cancellation point%> may only be used in"
35345 else
35349 }
35352 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35354 pragma_tok);
35356 }
35358 /* OpenMP 4.0:
35359 #pragma omp distribute distribute-clause[optseq] new-line
35360 for-loop */
35362 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35363 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35369 static tree
35373 {
35382 {
35390 else
35393 {
35399 {
35403 else
35406 }
35412 else
35426 }
35427 }
35429 {
35432 }
35437 {
35440 }
35451 }
35453 /* OpenMP 4.0:
35454 # pragma omp teams teams-clause[optseq] new-line
35455 structured-block */
35457 #define OMP_TEAMS_CLAUSE_MASK \
35458 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35466 static tree
35470 {
35479 {
35483 {
35508 }
35509 }
35511 {
35514 }
35519 {
35522 }
35531 }
35533 /* OpenMP 4.0:
35534 # pragma omp target data target-data-clause[optseq] new-line
35535 structured-block */
35537 #define OMP_TARGET_DATA_CLAUSE_MASK \
35538 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35543 static tree
35545 {
35546 tree clauses
35551 {
35554 {
35571 "%<#pragma omp target data%> with map-type other "
35572 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35576 }
35578 }
35581 {
35584 "%<#pragma omp target data%> must contain at least "
35587 }
35598 }
35600 /* OpenMP 4.5:
35601 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35602 structured-block */
35604 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35605 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35606 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35611 static tree
35614 {
35617 {
35622 {
35625 }
35626 }
35628 {
35632 }
35635 {
35637 "%<#pragma omp target enter data%> may only be "
35641 }
35643 tree clauses
35648 {
35651 {
35664 "%<#pragma omp target enter data%> with map-type other "
35668 }
35670 }
35673 {
35676 "%<#pragma omp target enter data%> must contain at least "
35679 }
35686 }
35688 /* OpenMP 4.5:
35689 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35690 structured-block */
35692 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35693 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35699 static tree
35702 {
35705 {
35710 {
35713 }
35714 }
35716 {
35720 }
35723 {
35725 "%<#pragma omp target exit data%> may only be "
35729 }
35731 tree clauses
35736 {
35739 {
35753 "%<#pragma omp target exit data%> with map-type other "
35754 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35758 }
35760 }
35763 {
35766 "%<#pragma omp target exit data%> must contain at least "
35769 }
35776 }
35778 /* OpenMP 4.0:
35779 # pragma omp target update target-update-clause[optseq] new-line */
35781 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
35782 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
35783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35789 static bool
35792 {
35794 {
35796 "%<#pragma omp target update%> may only be "
35800 }
35802 tree clauses
35807 {
35809 "%<#pragma omp target update%> must contain at least one "
35812 }
35820 }
35822 /* OpenMP 4.0:
35823 # pragma omp target target-clause[optseq] new-line
35824 structured-block */
35826 #define OMP_TARGET_CLAUSE_MASK \
35827 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
35835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
35837 static bool
35840 {
35844 {
35856 {
35864 {
35865 tree stmt;
35867 {
35870 OMP_TARGET_CLAUSE_MASK,
35875 OMP_TARGET_CLAUSE_MASK,
35880 OMP_TARGET_CLAUSE_MASK,
35885 }
35887 }
35892 {
35896 if_p);
35901 if_p);
35906 if_p);
35910 }
35916 {
35917 /* For combined target teams, ensure the num_teams and
35918 thread_limit clause expressions are evaluated on the host,
35919 before entering the target construct. */
35920 tree c;
35926 {
35935 OMP_CLAUSE_FIRSTPRIVATE);
35940 }
35941 }
35951 }
35953 {
35956 }
35958 {
35962 }
35964 {
35968 }
35970 {
35974 }
35976 {
35979 }
35980 }
35982 {
35985 }
36000 check_clauses:
36002 {
36005 {
36019 "%<#pragma omp target%> with map-type other "
36020 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36024 }
36026 }
36028 }
36030 /* OpenACC 2.0:
36031 # pragma acc cache (variable-list) new-line
36032 */
36034 static tree
36036 {
36051 }
36053 /* OpenACC 2.0:
36054 # pragma acc data oacc-data-clause[optseq] new-line
36055 structured-block */
36057 #define OACC_DATA_CLAUSE_MASK \
36058 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36070 static tree
36072 {
36085 }
36087 /* OpenACC 2.0:
36088 # pragma acc host_data <clauses> new-line
36089 structured-block */
36091 #define OACC_HOST_DATA_CLAUSE_MASK \
36092 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36094 static tree
36096 {
36109 }
36111 /* OpenACC 2.0:
36112 # pragma acc declare oacc-data-clause[optseq] new-line
36113 */
36115 #define OACC_DECLARE_CLAUSE_MASK \
36116 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36129 static tree
36131 {
36140 {
36144 }
36147 {
36151 {
36155 }
36158 {
36170 {
36172 "%qD must be a global variable in "
36174 decl);
36177 }
36182 {
36186 }
36188 {
36190 "invalid use of %<extern%> variable %qD "
36194 }
36196 {
36198 "invalid use of %<global%> variable %qD "
36202 }
36204 }
36209 {
36214 }
36217 {
36218 tree id;
36222 else
36228 {
36231 {
36234 {
36238 }
36239 }
36240 }
36241 }
36242 }
36255 }
36257 /* OpenACC 2.0:
36258 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36260 or
36262 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36264 LOC is the location of the #pragma token.
36265 */
36267 #define OACC_ENTER_DATA_CLAUSE_MASK \
36268 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36276 #define OACC_EXIT_DATA_CLAUSE_MASK \
36277 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36278 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36283 static tree
36286 {
36295 {
36300 }
36307 else
36312 {
36316 }
36324 }
36326 /* OpenACC 2.0:
36327 # pragma acc loop oacc-loop-clause[optseq] new-line
36328 structured-block */
36330 #define OACC_LOOP_CLAUSE_MASK \
36331 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36335 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36336 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36337 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36338 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36342 static tree
36345 {
36354 {
36360 }
36369 }
36371 /* OpenACC 2.0:
36372 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36373 structured-block
36375 or
36377 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36378 structured-block
36379 */
36381 #define OACC_KERNELS_CLAUSE_MASK \
36382 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36397 #define OACC_PARALLEL_CLAUSE_MASK \
36398 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36400 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36408 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36409 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36419 static tree
36422 {
36423 omp_clause_mask mask;
36426 {
36439 }
36442 {
36446 {
36449 tree clauses;
36451 if_p);
36453 }
36454 }
36463 }
36465 /* OpenACC 2.0:
36466 # pragma acc update oacc-update-clause[optseq] new-line
36467 */
36469 #define OACC_UPDATE_CLAUSE_MASK \
36470 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36472 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36473 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36477 static tree
36479 {
36486 {
36488 "%<#pragma acc update%> must contain at least one "
36491 }
36499 }
36501 /* OpenACC 2.0:
36502 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36504 LOC is the location of the #pragma token.
36505 */
36507 #define OACC_WAIT_CLAUSE_MASK \
36508 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36510 static tree
36512 {
36526 }
36528 /* OpenMP 4.0:
36529 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36531 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36532 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36539 static void
36542 {
36544 cp_omp_declare_simd_data data;
36546 {
36551 /* It is safe to take the address of a local variable; it will only be
36552 used while this scope is live. */
36554 }
36556 /* Store away all pragma tokens. */
36568 {
36572 {
36585 }
36590 "%<#pragma omp declare simd%> not immediately followed by "
36594 }
36595 }
36597 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36598 This function is modelled similar to the late parsing of omp declare
36599 simd. */
36601 static tree
36603 {
36610 {
36612 "used in the same function marked as a Cilk Plus SIMD-enabled "
36618 }
36620 {
36624 }
36629 {
36636 NULL);
36650 }
36656 }
36658 /* Finalize #pragma omp declare simd clauses after direct declarator has
36659 been parsed, and put that into "omp declare simd" attribute. */
36661 static tree
36663 {
36669 {
36673 }
36678 {
36696 }
36700 }
36703 /* OpenMP 4.0:
36704 # pragma omp declare target new-line
36705 declarations and definitions
36706 # pragma omp end declare target new-line
36708 OpenMP 4.5:
36709 # pragma omp declare target ( extended-list ) new-line
36711 # pragma omp declare target declare-target-clauses[seq] new-line */
36713 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36714 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36717 static void
36719 {
36722 clauses
36726 {
36728 clauses);
36731 }
36732 else
36733 {
36737 }
36740 "%<#pragma omp declare target%> with clauses in between "
36741 "%<#pragma omp declare target%> without clauses and "
36744 {
36750 {
36753 }
36754 else
36757 {
36759 "%qD specified both in declare target %<link%> and %<to%>"
36762 }
36764 {
36771 {
36774 {
36778 }
36779 }
36780 }
36781 }
36782 }
36784 static void
36786 {
36789 {
36792 }
36794 {
36798 {
36801 }
36804 else
36805 {
36809 }
36810 }
36811 else
36812 {
36816 }
36820 "%<#pragma omp end declare target%> without corresponding "
36822 else
36824 }
36826 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
36827 expression and optional initializer clause of
36828 #pragma omp declare reduction. We store the expression(s) as
36829 either 3, 6 or 7 special statements inside of the artificial function's
36830 body. The first two statements are DECL_EXPRs for the artificial
36831 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
36832 expression that uses those variables.
36833 If there was any INITIALIZER clause, this is followed by further statements,
36834 the fourth and fifth statements are DECL_EXPRs for the artificial
36835 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
36836 constructor variant (first token after open paren is not omp_priv),
36837 then the sixth statement is a statement with the function call expression
36838 that uses the OMP_PRIV and optionally OMP_ORIG variable.
36839 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
36840 to initialize the OMP_PRIV artificial variable and there is seventh
36841 statement, a DECL_EXPR of the OMP_PRIV statement again. */
36843 static bool
36845 {
36857 tree combiner;
36872 {
36875 }
36878 {
36885 {
36888 }
36904 {
36908 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
36912 == CPP_CLOSE_PAREN
36915 {
36919 }
36924 }
36925 else
36926 {
36942 {
36947 }
36949 tree arg;
36962 }
36973 }
36979 }
36981 /* OpenMP 4.0
36982 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36983 initializer-clause[opt] new-line
36985 initializer-clause:
36986 initializer (omp_priv initializer)
36987 initializer (function-name (argument-list)) */
36989 static void
36992 {
37002 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37009 {
37041 }
37053 /* Types may not be defined in declare reduction type list. */
37056 parser->type_definition_forbidden_message
37062 saved_colon_doesnt_start_class_def_p
37067 {
37071 ;
37092 else
37097 else
37099 }
37101 /* Restore the saved message. */
37104 parser->colon_doesnt_start_class_def_p
37109 {
37110 fail:
37113 }
37119 {
37120 tree fntype
37123 NULL_TREE);
37143 {
37148 }
37150 {
37152 {
37161 }
37168 }
37169 else
37170 {
37173 }
37176 else
37179 {
37182 }
37184 {
37187 else
37192 }
37197 else
37198 {
37207 }
37214 }
37218 done:
37219 /* Free any declarators allocated. */
37221 }
37223 /* OpenMP 4.0
37224 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37225 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37226 initializer-clause[opt] new-line
37227 #pragma omp declare target new-line */
37229 static void
37232 {
37234 {
37239 {
37242 context);
37244 }
37247 {
37250 context);
37252 }
37254 {
37257 }
37259 {
37263 }
37264 }
37268 }
37270 /* OpenMP 4.5:
37271 #pragma omp taskloop taskloop-clause[optseq] new-line
37272 for-loop
37274 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37275 for-loop */
37277 #define OMP_TASKLOOP_CLAUSE_MASK \
37278 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37293 static tree
37297 {
37306 {
37311 {
37335 }
37336 }
37338 {
37341 }
37346 {
37349 }
37355 if_p);
37361 }
37364 /* OpenACC 2.0:
37365 # pragma acc routine oacc-routine-clause[optseq] new-line
37366 function-definition
37368 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37369 */
37371 #define OACC_ROUTINE_CLAUSE_MASK \
37372 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37373 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37374 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37378 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37379 component, which must resolve to a declared namespace-scope
37380 function. The clauses are either processed directly (for a named
37381 function), or defered until the immediatley following declaration
37382 is parsed. */
37384 static void
37387 {
37389 /* The checking for "another pragma following this one" in the "no optional
37390 '( name )'" case makes sure that we dont re-enter. */
37393 cp_oacc_routine_data data;
37399 /* It is safe to take the address of a local variable; it will only be
37400 used while this scope is live. */
37403 /* Look for optional '( name )'. */
37405 {
37408 /* We parse the name as an id-expression. If it resolves to
37409 anything other than a non-overloaded function at namespace
37410 scope, it's an error. */
37424 {
37428 }
37430 data.clauses
37438 {
37443 }
37445 /* Perhaps we should use the same rule as declarations in different
37446 namespaces? */
37448 {
37453 }
37456 {
37460 }
37464 }
37466 {
37467 /* Store away all pragma tokens. */
37478 /* Emit a helpful diagnostic if there's another pragma following this
37479 one. */
37481 {
37484 /* ..., and then just keep going. */
37486 }
37488 /* We only have to consider the pragma_external case here. */
37493 else
37496 }
37497 }
37499 /* Finalize #pragma acc routine clauses after direct declarator has
37500 been parsed. */
37502 static tree
37504 {
37509 {
37511 "%<#pragma acc routine%> not immediately followed by "
37514 }
37531 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37532 fndecl_seen. */
37535 }
37537 /* Apply any saved OpenACC routine clauses to a just-parsed
37538 declaration. */
37540 static void
37542 {
37544 {
37545 /* Keep going if we're in error reporting mode. */
37551 {
37553 "%<#pragma acc routine%> not immediately followed by"
37557 }
37559 {
37562 }
37565 {
37570 }
37573 {
37581 }
37583 /* Process the routine's dimension clauses. */
37587 /* Add an "omp declare target" attribute. */
37592 /* Don't unset parser->oacc_routine here: we may still need it to
37593 diagnose wrong usage. But, remember that we've used this "#pragma acc
37594 routine". */
37596 }
37597 }
37599 /* Main entry point to OpenMP statement pragmas. */
37601 static void
37603 {
37604 tree stmt;
37609 {
37632 if_p);
37637 if_p);
37654 if_p);
37659 if_p);
37667 if_p);
37676 if_p);
37690 if_p);
37695 if_p);
37699 }
37702 }
37703 \f
37704 /* Transactional Memory parsing routines. */
37706 /* Parse a transaction attribute.
37708 txn-attribute:
37709 attribute
37710 [ [ identifier ] ]
37712 We use this instead of cp_parser_attributes_opt for transactions to avoid
37713 the pedwarn in C++98 mode. */
37715 static tree
37717 {
37732 {
37736 /* For keywords, use the canonical spelling,
37737 not the parsed identifier. */
37741 }
37742 else
37746 error1:
37749 }
37751 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37753 transaction-statement:
37754 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37755 compound-statement
37756 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37757 */
37759 static tree
37761 {
37772 else
37773 {
37777 }
37779 /* Parse a noexcept specification. */
37783 {
37784 /* cancel-and-throw is unimplemented. */
37787 }
37788 else
37791 /* Keep track if we're in the lexical scope of an outer transaction. */
37803 }
37805 /* Parse a __transaction_atomic or __transaction_relaxed expression.
37807 transaction-expression:
37808 __transaction_atomic txn-noexcept-spec[opt] ( expression )
37809 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
37810 */
37812 static tree
37814 {
37827 keyword == RID_TRANSACTION_RELAXED
37841 /* Set this early. This might mean that we allow transaction_cancel in
37842 an expression that we find out later actually has to be a constexpr.
37843 However, we expect that cxx_constant_value will be able to deal with
37844 this; also, if the noexcept has no constexpr, then what we parse next
37845 really is a transaction's body. */
37848 /* Parse a noexcept specification. */
37854 {
37861 }
37862 else
37863 {
37864 /* The only expression that is available got parsed for the noexcept
37865 already. noexcept is true then. */
37868 }
37877 }
37879 /* Parse a function-transaction-block.
37881 function-transaction-block:
37882 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
37883 function-body
37884 __transaction_atomic txn-attribute[opt] function-try-block
37885 __transaction_relaxed ctor-initializer[opt] function-body
37886 __transaction_relaxed function-try-block
37887 */
37889 static bool
37891 {
37907 else
37908 {
37912 }
37920 else
37921 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
37929 }
37931 /* Parse a __transaction_cancel statement.
37933 cancel-statement:
37934 __transaction_cancel txn-attribute[opt] ;
37935 __transaction_cancel txn-attribute[opt] throw-expression ;
37937 ??? Cancel and throw is not yet implemented. */
37939 static tree
37941 {
37947 RT_TRANSACTION_CANCEL);
37954 /* ??? Parse cancel-and-throw here. */
37959 {
37963 }
37965 {
37969 }
37971 {
37974 {
37980 }
37981 }
37983 {
37987 }
37993 }
37994 \f
37995 /* The parser. */
37999 \f
38000 /* Special handling for the first token or line in the file. The first
38001 thing in the file might be #pragma GCC pch_preprocess, which loads a
38002 PCH file, which is a GC collection point. So we need to handle this
38003 first pragma without benefit of an existing lexer structure.
38005 Always returns one token to the caller in *FIRST_TOKEN. This is
38006 either the true first token of the file, or the first token after
38007 the initial pragma. */
38009 static void
38011 {
38020 {
38027 }
38028 else
38031 /* Skip to the end of the pragma. */
38035 /* Now actually load the PCH file. */
38039 /* Read one more token to return to our caller. We have to do this
38040 after reading the PCH file in, since its pointers have to be
38041 live. */
38043 }
38045 /* Parses the grainsize pragma for the _Cilk_for statement.
38046 Syntax:
38047 #pragma cilk grainsize = <VALUE>. */
38049 static void
38051 {
38053 {
38058 {
38061 }
38063 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38066 else
38068 "%<#pragma cilk grainsize%> is not followed by "
38071 }
38073 }
38075 /* Normal parsing of a pragma token. Here we can (and must) use the
38076 regular lexer. */
38078 static bool
38080 {
38083 tree stmt;
38094 {
38102 {
38112 }
38117 {
38127 }
38132 {
38138 "%<#pragma omp taskwait%> may only be "
38143 }
38148 {
38154 "%<#pragma omp taskyield%> may only be "
38159 }
38164 {
38170 "%<#pragma omp cancel%> may only be "
38175 }
38196 {
38200 }
38208 {
38212 }
38220 {
38224 }
38230 {
38234 }
38242 {
38246 }
38301 "%<#pragma omp section%> may only be used in "
38306 {
38308 {
38312 }
38319 {
38322 }
38325 }
38329 {
38333 }
38341 {
38345 }
38347 /* Ignore the pragma if Cilk Plus is not enabled. */
38349 {
38352 }
38353 else
38354 {
38358 }
38365 bad_stmt:
38368 }
38372 }
38374 /* The interface the pragma parsers have to the lexer. */
38376 enum cpp_ttype
38378 {
38390 else
38391 {
38395 }
38398 }
38400 \f
38401 /* External interface. */
38403 /* Parse one entire translation unit. */
38405 void
38407 {
38420 }
38422 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38423 vectorlength clause:
38424 Syntax:
38425 vectorlength ( constant-expression ) */
38427 static tree
38430 {
38432 tree expr;
38433 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38434 safelen clause. Thus, vectorlength is represented as OMP 4.0
38435 safelen. For SIMD-enabled function it is represented by OMP 4.0
38436 simdlen. */
38439 loc);
38440 else
38442 loc);
38450 /* If expr == error_mark_node, then don't emit any errors nor
38451 create a clause. if any of the above functions returns
38452 error mark node then they would have emitted an error message. */
38454 ;
38462 else
38463 {
38464 tree c;
38466 {
38471 }
38472 else
38473 {
38478 }
38479 }
38484 }
38486 /* Handles the Cilk Plus #pragma simd linear clause.
38487 Syntax:
38488 linear ( simd-linear-variable-list )
38490 simd-linear-variable-list:
38491 simd-linear-variable
38492 simd-linear-variable-list , simd-linear-variable
38494 simd-linear-variable:
38495 id-expression
38496 id-expression : simd-linear-step
38498 simd-linear-step:
38499 conditional-expression */
38501 static tree
38503 {
38509 {
38513 }
38518 {
38521 {
38525 }
38532 {
38536 }
38537 else
38538 {
38542 /* If present, parse the linear step. Otherwise, assume the default
38543 value of 1. */
38545 {
38552 {
38553 /* If an error has occurred, then the whole pragma is
38554 considered ill-formed. Thus, no reason to keep
38555 parsing. */
38558 }
38566 else
38568 "step size must be an integer constant "
38570 }
38572 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38578 }
38583 else
38584 {
38589 }
38590 }
38594 }
38596 /* Returns the name of the next clause. If the clause is not
38597 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38598 token is not consumed. Otherwise, the appropriate enum from the
38599 pragma_simd_clause is returned and the token is consumed. */
38601 static pragma_omp_clause
38603 {
38604 pragma_omp_clause clause_type;
38621 else
38626 }
38628 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38630 static tree
38632 {
38637 {
38638 pragma_omp_clause c_kind;
38645 /* Use the OpenMP 4.0 equivalent function. */
38648 /* Use the OpenMP 4.0 equivalent function. */
38650 clauses);
38652 /* Use the OMP 4.0 equivalent function. */
38654 clauses);
38656 /* Use the OMP 4.0 equivalent function. */
38658 else
38659 {
38663 }
38664 }
38670 else
38672 }
38674 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38676 static void
38678 {
38685 {
38689 }
38698 }
38700 /* Main entry-point for parsing Cilk Plus _Cilk_for
38701 loops. The return value is error_mark_node
38702 when errors happen and CILK_FOR tree on success. */
38704 static tree
38706 {
38721 else
38727 }
38729 /* Create an identifier for a generic parameter type (a synthesized
38730 template parameter implied by `auto' or a concept identifier). */
38733 static tree
38735 {
38739 }
38741 /* Predicate that behaves as is_auto_or_concept but matches the parent
38742 node of the generic type rather than the generic type itself. This
38743 allows for type transformation in add_implicit_template_parms. */
38747 {
38749 }
38751 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38752 (creating a new template parameter list if necessary). Returns the newly
38753 created template type parm. */
38755 static tree
38757 {
38760 /* Before committing to modifying any scope, if we're in an
38761 implicit template scope, and we're trying to synthesize a
38762 constrained parameter, try to find a previous parameter with
38763 the same name. This is the same-type rule for abbreviated
38764 function templates.
38766 NOTE: We can generate implicit parameters when tentatively
38767 parsing a nested name specifier, only to reject that parse
38768 later. However, matching the same template-id as part of a
38769 direct-declarator should generate an identical template
38770 parameter, so this rule will merge them. */
38772 {
38775 {
38777 {
38780 /* Return the TEMPLATE_PARM_INDEX. */
38783 }
38785 }
38786 }
38788 /* We are either continuing a function template that already contains implicit
38789 template parameters, creating a new fully-implicit function template, or
38790 extending an existing explicit function template with implicit template
38791 parameters. */
38799 {
38803 }
38804 else
38805 {
38806 /* Roll back to the existing template parameter scope (in the case of
38807 extending an explicit function template) or introduce a new template
38808 parameter scope ahead of the function parameter scope (or class scope
38809 in the case of out-of-line member definitions). The function scope is
38810 added back after template parameter synthesis below. */
38815 {
38818 }
38820 {
38821 /* If not defining a class, then any class scope is a scope level in
38822 an out-of-line member definition. In this case simply wind back
38823 beyond the first such scope to inject the template parameter list.
38824 Otherwise wind back to the class being defined. The latter can
38825 occur in class member friend declarations such as:
38827 class A {
38828 void foo (auto);
38829 };
38830 class B {
38831 friend void A::foo (auto);
38832 };
38834 The template parameter list synthesized for the friend declaration
38835 must be injected in the scope of 'B'. This can also occur in
38836 erroneous cases such as:
38838 struct A {
38839 struct B {
38840 void foo (auto);
38841 };
38842 void B::foo (auto) {}
38843 };
38845 Here the attempted definition of 'B::foo' within 'A' is ill-formed
38846 but, nevertheless, the template parameter list synthesized for the
38847 declarator should be injected into the scope of 'A' as if the
38848 ill-formed template was specified explicitly. */
38851 {
38854 }
38855 }
38861 {
38862 /* Introduce a new template parameter list for implicit template
38863 parameters. */
38867 parser->implicit_template_scope
38874 }
38875 else
38876 {
38877 /* Synthesize implicit template parameters at the end of the explicit
38878 template parameter list. */
38885 parser->implicit_template_parms
38887 }
38888 }
38890 /* Synthesize a new template parameter and track the current template
38891 parameter chain with implicit_template_parms. */
38895 tree synth_tmpl_parm;
38899 synth_tmpl_parm
38902 synth_tmpl_parm
38904 else
38905 {
38909 }
38911 // Attach the constraint to the parm before processing.
38914 tree new_parm
38916 input_location,
38917 node,
38921 // Chain the new parameter to the list of implicit parameters.
38923 parser->implicit_template_parms
38925 else
38930 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
38933 /* If creating a fully implicit function template, start the new implicit
38934 template parameter list with this synthesized type, otherwise grow the
38935 current template parameter list. */
38938 {
38945 }
38946 else
38947 {
38952 }
38954 // If the new parameter was constrained, we need to add that to the
38955 // constraints in the template parameter list.
38957 {
38961 }
38966 }
38968 /* Finish the declaration of a fully implicit function template. Such a
38969 template has no explicit template parameter list so has not been through the
38970 normal template head and tail processing. synthesize_implicit_template_parm
38971 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38972 provided if the declaration is a class member such that its template
38973 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38974 form is returned. Otherwise NULL_TREE is returned. */
38976 static tree
38978 {
38983 {
38987 }
38997 }