| blob | 6583d4ca7db41fc96e40af718bd0ce6212f06609 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2015 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/>. */
43 \f
44 /* The lexer. */
46 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
47 and c-lex.c) and the C++ parser. */
50 {
52 };
54 /* The various kinds of non integral constant we encounter. */
56 NIC_NONE,
57 /* floating-point literal */
58 NIC_FLOAT,
59 /* %<this%> */
60 NIC_THIS,
61 /* %<__FUNCTION__%> */
62 NIC_FUNC_NAME,
63 /* %<__PRETTY_FUNCTION__%> */
64 NIC_PRETTY_FUNC,
65 /* %<__func__%> */
66 NIC_C99_FUNC,
67 /* "%<va_arg%> */
68 NIC_VA_ARG,
69 /* a cast */
70 NIC_CAST,
71 /* %<typeid%> operator */
72 NIC_TYPEID,
73 /* non-constant compound literals */
74 NIC_NCC,
75 /* a function call */
76 NIC_FUNC_CALL,
77 /* an increment */
78 NIC_INC,
79 /* an decrement */
80 NIC_DEC,
81 /* an array reference */
82 NIC_ARRAY_REF,
83 /* %<->%> */
84 NIC_ARROW,
85 /* %<.%> */
86 NIC_POINT,
87 /* the address of a label */
88 NIC_ADDR_LABEL,
89 /* %<*%> */
90 NIC_STAR,
91 /* %<&%> */
92 NIC_ADDR,
93 /* %<++%> */
94 NIC_PREINCREMENT,
95 /* %<--%> */
96 NIC_PREDECREMENT,
97 /* %<new%> */
98 NIC_NEW,
99 /* %<delete%> */
100 NIC_DEL,
101 /* calls to overloaded operators */
102 NIC_OVERLOADED,
103 /* an assignment */
104 NIC_ASSIGNMENT,
105 /* a comma operator */
106 NIC_COMMA,
107 /* a call to a constructor */
108 NIC_CONSTRUCTOR,
109 /* a transaction expression */
110 NIC_TRANSACTION
111 };
113 /* The various kinds of errors about name-lookup failing. */
115 /* NULL */
116 NLE_NULL,
117 /* is not a type */
118 NLE_TYPE,
119 /* is not a class or namespace */
120 NLE_CXX98,
121 /* is not a class, namespace, or enumeration */
122 NLE_NOT_CXX98
123 };
125 /* The various kinds of required token */
127 RT_NONE,
149 /* The type is CPP_KEYWORD */
178 RT_TRANSACTION_CANCEL /* __transaction_cancel */
179 };
181 /* Prototypes. */
187 static void cp_lexer_destroy
189 static int cp_lexer_saving_tokens
193 static void cp_lexer_get_preprocessor_token
201 static bool cp_lexer_next_token_is_not
203 static bool cp_lexer_next_token_is_keyword
207 static void cp_lexer_purge_token
209 static void cp_lexer_purge_tokens_after
211 static void cp_lexer_save_tokens
213 static void cp_lexer_commit_tokens
215 static void cp_lexer_rollback_tokens
217 static void cp_lexer_print_token
221 static void cp_lexer_start_debugging
223 static void cp_lexer_stop_debugging
229 static void cp_parser_initial_pragma
232 static tree cp_literal_operator_id
235 static void cp_parser_cilk_simd
237 static tree cp_parser_cilk_for
239 static bool cp_parser_omp_declare_reduction_exprs
241 static tree cp_parser_cilk_simd_vectorlength
243 static void cp_finalize_oacc_routine
246 /* Manifest constants. */
247 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
248 #define CP_SAVED_TOKEN_STACK 5
250 /* Variables. */
252 /* The stream to which debugging output should be written. */
255 /* Nonzero if we are parsing an unevaluated operand: an operand to
256 sizeof, typeof, or alignof. */
259 /* Dump up to NUM tokens in BUFFER to FILE starting with token
260 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
261 first token in BUFFER. If NUM is 0, dump all the tokens. If
262 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
263 highlighted by surrounding it in [[ ]]. */
265 static void
269 {
286 {
289 }
294 {
301 nprinted++;
311 {
321 }
322 }
325 {
328 }
331 }
334 /* Dump all tokens in BUFFER to stderr. */
336 void
338 {
340 }
342 DEBUG_FUNCTION void
344 {
346 }
348 DEBUG_FUNCTION void
350 {
353 else
355 }
358 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
359 description for T. */
361 static void
363 {
365 {
368 }
369 }
372 /* Dump parser context C to FILE. */
374 static void
376 {
381 }
384 /* Print the stack of parsing contexts to FILE starting with FIRST. */
386 static void
388 {
394 {
397 }
398 }
401 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
403 static void
405 {
408 }
411 /* Print an unparsed function entry UF to FILE. */
413 static void
415 {
418 tree fn;
423 i++)
424 {
430 }
435 {
438 }
444 {
447 }
449 }
452 /* Print the stack of unparsed member functions S to FILE. */
454 static void
457 {
463 {
466 }
467 }
470 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
471 the given PARSER. If FILE is NULL, the output is printed on stderr. */
473 static void
475 {
487 next_token);
488 }
491 /* Dump debugging information for the given PARSER. If FILE is NULL,
492 the output is printed on stderr. */
494 void
496 {
499 expanded_location eloc;
577 }
579 DEBUG_FUNCTION void
581 {
583 }
585 DEBUG_FUNCTION void
587 {
590 else
592 }
594 /* Allocate memory for a new lexer object and return it. */
598 {
603 /* Allocate the memory. */
606 /* Initially we are not debugging. */
611 /* Create the buffer. */
615 }
618 /* Create a new main C++ lexer, the lexer that gets tokens from the
619 preprocessor. */
623 {
625 cp_token token;
627 /* It's possible that parsing the first pragma will load a PCH file,
628 which is a GC collection point. So we have to do that before
629 allocating any memory. */
634 /* Put the first token in the buffer. */
637 /* Get the remaining tokens from the preprocessor. */
639 {
642 }
651 /* Subsequent preprocessor diagnostics should use compiler
652 diagnostic functions to get the compiler source location. */
657 }
659 /* Create a new lexer whose token stream is primed with the tokens in
660 CACHE. When these tokens are exhausted, no new tokens will be read. */
664 {
669 /* We do not own the buffer. */
676 /* Initially we are not debugging. */
681 }
683 /* Frees all resources associated with LEXER. */
685 static void
687 {
691 }
693 /* Returns nonzero if debugging information should be output. */
697 {
699 }
704 {
708 }
712 {
714 }
718 {
720 }
724 {
727 else
729 }
733 {
737 }
739 /* nonzero if we are presently saving tokens. */
743 {
745 }
747 /* Store the next token from the preprocessor in *TOKEN. Return true
748 if we reach EOF. If LEXER is NULL, assume we are handling an
749 initial #pragma pch_preprocess, and thus want the lexer to return
750 processed strings. */
752 static void
754 {
757 /* Get a new token from the preprocessor. */
758 token->type
766 /* On some systems, some header files are surrounded by an
767 implicit extern "C" block. Set a flag in the token if it
768 comes from such a header. */
773 /* Check to see if this token is a keyword. */
775 {
777 {
778 /* Mark this token as a keyword. */
780 /* Record which keyword. */
782 }
783 else
784 {
788 {
789 /* Warn about the C++0x keyword (but still treat it as
790 an identifier). */
795 /* Clear out the C_RID_CODE so we don't warn about this
796 particular identifier-turned-keyword again. */
798 }
801 }
802 }
804 {
805 /* This only happens in Objective-C++; it must be a keyword. */
808 {
809 /* Replace 'class' with '@class', 'private' with '@private',
810 etc. This prevents confusion with the C++ keyword
811 'class', and makes the tokens consistent with other
812 Objective-C 'AT' keywords. For example '@class' is
813 reported as RID_AT_CLASS which is consistent with
814 '@synchronized', which is reported as
815 RID_AT_SYNCHRONIZED.
816 */
826 }
827 }
829 {
830 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
834 }
835 }
837 /* Update the globals input_location and the input file stack from TOKEN. */
840 {
842 {
844 }
845 }
847 /* Update the globals input_location and the input file stack from LEXER. */
850 {
853 }
855 /* Return a pointer to the next token in the token stream, but do not
856 consume it. */
860 {
862 {
866 }
868 }
870 /* Return true if the next token has the indicated TYPE. */
874 {
876 }
878 /* Return true if the next token does not have the indicated TYPE. */
882 {
884 }
886 /* Return true if the next token is the indicated KEYWORD. */
890 {
892 }
896 {
898 }
902 {
904 }
906 /* Return true if the next token is not the indicated KEYWORD. */
910 {
912 }
914 /* Return true if the next token is a keyword for a decl-specifier. */
916 static bool
918 {
923 {
924 /* auto specifier: storage-class-specifier in C++,
925 simple-type-specifier in C++0x. */
927 /* Storage classes. */
933 /* Elaborated type specifiers. */
939 /* Simple type specifiers. */
953 /* GNU extensions. */
956 /* C++0x extensions. */
967 }
968 }
970 /* Returns TRUE iff the token T begins a decltype type. */
972 static bool
974 {
977 }
979 /* Returns TRUE iff the next token begins a decltype type. */
981 static bool
983 {
986 }
988 /* Return a pointer to the Nth token in the token stream. If N is 1,
989 then this is precisely equivalent to cp_lexer_peek_token (except
990 that it is not inline). One would like to disallow that case, but
991 there is one case (cp_parser_nth_token_starts_template_id) where
992 the caller passes a variable for N and it might be 1. */
996 {
999 /* N is 1-based, not zero-based. */
1010 {
1013 {
1016 }
1020 }
1023 {
1026 }
1029 }
1031 /* Return the next token, and advance the lexer's next_token pointer
1032 to point to the next non-purged token. */
1036 {
1042 do
1043 {
1046 {
1049 }
1051 }
1056 /* Provide debugging output. */
1058 {
1062 }
1065 }
1067 /* Permanently remove the next token from the token stream, and
1068 advance the next_token pointer to refer to the next non-purged
1069 token. */
1071 static void
1073 {
1082 do
1083 {
1084 tok++;
1086 {
1089 }
1090 }
1093 }
1095 /* Permanently remove all tokens after TOK, up to, but not
1096 including, the token that will be returned next by
1097 cp_lexer_peek_token. */
1099 static void
1101 {
1110 {
1115 }
1116 }
1118 /* Begin saving tokens. All tokens consumed after this point will be
1119 preserved. */
1121 static void
1123 {
1124 /* Provide debugging output. */
1129 }
1131 /* Commit to the portion of the token stream most recently saved. */
1133 static void
1135 {
1136 /* Provide debugging output. */
1141 }
1143 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1144 to the token stream. Stop saving tokens. */
1146 static void
1148 {
1149 /* Provide debugging output. */
1154 }
1156 /* RAII wrapper around the above functions, with sanity checking. Creating
1157 a variable saves tokens, which are committed when the variable is
1158 destroyed unless they are explicitly rolled back by calling the rollback
1159 member function. */
1161 struct saved_token_sentinel
1162 {
1167 {
1170 }
1172 {
1175 }
1177 {
1181 }
1182 };
1184 /* Print a representation of the TOKEN on the STREAM. */
1186 static void
1188 {
1189 /* We don't use cpp_type2name here because the parser defines
1190 a few tokens of its own. */
1192 /* cpplib-defined token types */
1193 #define OP(e, s) #e,
1194 #define TK(e, s) #e,
1195 TTYPE_TABLE
1196 #undef OP
1197 #undef TK
1198 /* C++ parser token types - see "Manifest constants", above. */
1202 };
1204 /* For some tokens, print the associated data. */
1206 {
1208 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1209 For example, `struct' is mapped to an INTEGER_CST. */
1212 /* else fall through */
1230 /* If we have a name for the token, print it out. Otherwise, we
1231 simply give the numeric code. */
1234 else
1237 }
1238 }
1240 DEBUG_FUNCTION void
1242 {
1245 }
1247 DEBUG_FUNCTION void
1249 {
1252 else
1254 }
1257 /* Start emitting debugging information. */
1259 static void
1261 {
1264 }
1266 /* Stop emitting debugging information. */
1268 static void
1270 {
1273 }
1275 /* Create a new cp_token_cache, representing a range of tokens. */
1279 {
1284 }
1286 /* Diagnose if #pragma omp declare simd isn't followed immediately
1287 by function declaration or definition. */
1291 {
1293 {
1297 }
1298 }
1300 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1301 and put that into "omp declare simd" attribute. */
1305 {
1307 {
1309 {
1312 }
1314 {
1317 }
1318 }
1319 }
1321 /* Diagnose if #pragma acc routine isn't followed immediately by function
1322 declaration or definition. */
1326 {
1328 {
1335 }
1336 }
1337 \f
1338 /* Decl-specifiers. */
1340 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1342 static void
1344 {
1346 }
1348 /* Declarators. */
1350 /* Nothing other than the parser should be creating declarators;
1351 declarators are a semi-syntactic representation of C++ entities.
1352 Other parts of the front end that need to create entities (like
1353 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1356 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1366 /* An erroneous declarator. */
1369 /* The obstack on which declarators and related data structures are
1370 allocated. */
1373 /* Alloc BYTES from the declarator memory pool. */
1377 {
1379 }
1381 /* Allocate a declarator of the indicated KIND. Clear fields that are
1382 common to all declarators. */
1386 {
1398 }
1400 /* Make a declarator for a generalized identifier. If
1401 QUALIFYING_SCOPE is non-NULL, the identifier is
1402 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1403 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1404 is, if any. */
1408 special_function_kind sfk)
1409 {
1412 /* It is valid to write:
1414 class C { void f(); };
1415 typedef C D;
1416 void D::f();
1418 The standard is not clear about whether `typedef const C D' is
1419 legal; as of 2002-09-15 the committee is considering that
1420 question. EDG 3.0 allows that syntax. Therefore, we do as
1421 well. */
1435 }
1437 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1438 of modifiers such as const or volatile to apply to the pointer
1439 type, represented as identifiers. ATTRIBUTES represent the attributes that
1440 appertain to the pointer or reference. */
1442 cp_declarator *
1444 tree attributes)
1445 {
1453 {
1457 }
1458 else
1464 }
1466 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1467 represent the attributes that appertain to the pointer or
1468 reference. */
1470 cp_declarator *
1473 {
1481 {
1485 }
1486 else
1492 }
1494 /* Like make_pointer_declarator -- but for a pointer to a non-static
1495 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1496 appertain to the pointer or reference. */
1498 cp_declarator *
1501 tree attributes)
1502 {
1511 {
1514 }
1515 else
1521 }
1523 /* Make a declarator for the function given by TARGET, with the
1524 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1525 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1526 indicates what exceptions can be thrown. */
1528 cp_declarator *
1530 tree parms,
1531 cp_cv_quals cv_qualifiers,
1532 cp_virt_specifiers virt_specifiers,
1533 cp_ref_qualifier ref_qualifier,
1534 tree tx_qualifier,
1535 tree exception_specification,
1536 tree late_return_type,
1537 tree requires_clause)
1538 {
1552 {
1556 }
1557 else
1561 }
1563 /* Make a declarator for an array of BOUNDS elements, each of which is
1564 defined by ELEMENT. */
1566 cp_declarator *
1568 {
1575 {
1579 }
1580 else
1584 }
1586 /* Determine whether the declarator we've seen so far can be a
1587 parameter pack, when followed by an ellipsis. */
1588 static bool
1590 {
1592 /* We already saw an ellipsis. */
1595 /* Search for a declarator name, or any other declarator that goes
1596 after the point where the ellipsis could appear in a parameter
1597 pack. If we find any of these, then this declarator can not be
1598 made into a parameter pack. */
1601 {
1603 {
1615 }
1616 }
1619 }
1623 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1624 DECLARATOR and DEFAULT_ARGUMENT. */
1626 cp_parameter_declarator *
1629 tree default_argument,
1631 {
1639 else
1646 }
1648 /* Returns true iff DECLARATOR is a declaration for a function. */
1650 static bool
1652 {
1654 {
1662 }
1664 }
1666 /* The parser. */
1668 /* Overview
1669 --------
1671 A cp_parser parses the token stream as specified by the C++
1672 grammar. Its job is purely parsing, not semantic analysis. For
1673 example, the parser breaks the token stream into declarators,
1674 expressions, statements, and other similar syntactic constructs.
1675 It does not check that the types of the expressions on either side
1676 of an assignment-statement are compatible, or that a function is
1677 not declared with a parameter of type `void'.
1679 The parser invokes routines elsewhere in the compiler to perform
1680 semantic analysis and to build up the abstract syntax tree for the
1681 code processed.
1683 The parser (and the template instantiation code, which is, in a
1684 way, a close relative of parsing) are the only parts of the
1685 compiler that should be calling push_scope and pop_scope, or
1686 related functions. The parser (and template instantiation code)
1687 keeps track of what scope is presently active; everything else
1688 should simply honor that. (The code that generates static
1689 initializers may also need to set the scope, in order to check
1690 access control correctly when emitting the initializers.)
1692 Methodology
1693 -----------
1695 The parser is of the standard recursive-descent variety. Upcoming
1696 tokens in the token stream are examined in order to determine which
1697 production to use when parsing a non-terminal. Some C++ constructs
1698 require arbitrary look ahead to disambiguate. For example, it is
1699 impossible, in the general case, to tell whether a statement is an
1700 expression or declaration without scanning the entire statement.
1701 Therefore, the parser is capable of "parsing tentatively." When the
1702 parser is not sure what construct comes next, it enters this mode.
1703 Then, while we attempt to parse the construct, the parser queues up
1704 error messages, rather than issuing them immediately, and saves the
1705 tokens it consumes. If the construct is parsed successfully, the
1706 parser "commits", i.e., it issues any queued error messages and
1707 the tokens that were being preserved are permanently discarded.
1708 If, however, the construct is not parsed successfully, the parser
1709 rolls back its state completely so that it can resume parsing using
1710 a different alternative.
1712 Future Improvements
1713 -------------------
1715 The performance of the parser could probably be improved substantially.
1716 We could often eliminate the need to parse tentatively by looking ahead
1717 a little bit. In some places, this approach might not entirely eliminate
1718 the need to parse tentatively, but it might still speed up the average
1719 case. */
1721 /* Flags that are passed to some parsing functions. These values can
1722 be bitwise-ored together. */
1724 enum
1725 {
1726 /* No flags. */
1728 /* The construct is optional. If it is not present, then no error
1729 should be issued. */
1731 /* When parsing a type-specifier, treat user-defined type-names
1732 as non-type identifiers. */
1734 /* When parsing a type-specifier, do not try to parse a class-specifier
1735 or enum-specifier. */
1737 /* When parsing a decl-specifier-seq, only allow type-specifier or
1738 constexpr. */
1740 };
1742 /* This type is used for parameters and variables which hold
1743 combinations of the above flags. */
1746 /* The different kinds of declarators we want to parse. */
1748 enum cp_parser_declarator_kind
1749 {
1750 /* We want an abstract declarator. */
1751 CP_PARSER_DECLARATOR_ABSTRACT,
1752 /* We want a named declarator. */
1753 CP_PARSER_DECLARATOR_NAMED,
1754 /* We don't mind, but the name must be an unqualified-id. */
1755 CP_PARSER_DECLARATOR_EITHER
1756 };
1758 /* The precedence values used to parse binary expressions. The minimum value
1759 of PREC must be 1, because zero is reserved to quickly discriminate
1760 binary operators from other tokens. */
1762 enum cp_parser_prec
1763 {
1764 PREC_NOT_OPERATOR,
1765 PREC_LOGICAL_OR_EXPRESSION,
1766 PREC_LOGICAL_AND_EXPRESSION,
1767 PREC_INCLUSIVE_OR_EXPRESSION,
1768 PREC_EXCLUSIVE_OR_EXPRESSION,
1769 PREC_AND_EXPRESSION,
1770 PREC_EQUALITY_EXPRESSION,
1771 PREC_RELATIONAL_EXPRESSION,
1772 PREC_SHIFT_EXPRESSION,
1773 PREC_ADDITIVE_EXPRESSION,
1774 PREC_MULTIPLICATIVE_EXPRESSION,
1775 PREC_PM_EXPRESSION,
1776 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1777 };
1779 /* A mapping from a token type to a corresponding tree node type, with a
1780 precedence value. */
1782 struct cp_parser_binary_operations_map_node
1783 {
1784 /* The token type. */
1786 /* The corresponding tree code. */
1788 /* The precedence of this operator. */
1790 };
1792 struct cp_parser_expression_stack_entry
1793 {
1794 /* Left hand side of the binary operation we are currently
1795 parsing. */
1796 tree lhs;
1797 /* Original tree code for left hand side, if it was a binary
1798 expression itself (used for -Wparentheses). */
1800 /* Tree code for the binary operation we are parsing. */
1802 /* Precedence of the binary operation we are parsing. */
1804 /* Location of the binary operation we are parsing. */
1805 location_t loc;
1806 };
1808 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1809 entries because precedence levels on the stack are monotonically
1810 increasing. */
1814 /* Prototypes. */
1816 /* Constructors and destructors. */
1821 /* Class variables. */
1825 /* The operator-precedence table used by cp_parser_binary_expression.
1826 Transformed into an associative array (binops_by_token) by
1827 cp_parser_new. */
1860 };
1862 /* The same as binops, but initialized by cp_parser_new so that
1863 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1864 for speed. */
1867 /* Constructors and destructors. */
1869 /* Construct a new context. The context below this one on the stack
1870 is given by NEXT. */
1874 {
1877 /* Allocate the storage. */
1879 {
1880 /* Pull the first entry from the free list. */
1884 }
1885 else
1888 /* No errors have occurred yet in this context. */
1890 /* If this is not the bottommost context, copy information that we
1891 need from the previous context. */
1893 {
1894 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1895 expression, then we are parsing one in this context, too. */
1897 /* Thread the stack. */
1899 }
1902 }
1904 /* Managing the unparsed function queues. */
1906 #define unparsed_funs_with_default_args \
1907 parser->unparsed_queues->last ().funs_with_default_args
1908 #define unparsed_funs_with_definitions \
1909 parser->unparsed_queues->last ().funs_with_definitions
1910 #define unparsed_nsdmis \
1911 parser->unparsed_queues->last ().nsdmis
1912 #define unparsed_classes \
1913 parser->unparsed_queues->last ().classes
1915 static void
1917 {
1920 }
1922 static void
1924 {
1927 }
1929 /* Prototypes. */
1931 /* Constructors and destructors. */
1936 /* Routines to parse various constructs.
1938 Those that return `tree' will return the error_mark_node (rather
1939 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1940 Sometimes, they will return an ordinary node if error-recovery was
1941 attempted, even though a parse error occurred. So, to check
1942 whether or not a parse error occurred, you should always use
1943 cp_parser_error_occurred. If the construct is optional (indicated
1944 either by an `_opt' in the name of the function that does the
1945 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1946 the construct is not present. */
1948 /* Lexical conventions [gram.lex] */
1950 static tree cp_parser_identifier
1952 static tree cp_parser_string_literal
1954 static tree cp_parser_userdef_char_literal
1956 static tree cp_parser_userdef_string_literal
1958 static tree cp_parser_userdef_numeric_literal
1961 /* Basic concepts [gram.basic] */
1963 static bool cp_parser_translation_unit
1966 /* Expressions [gram.expr] */
1968 static tree cp_parser_primary_expression
1970 static tree cp_parser_id_expression
1972 static tree cp_parser_unqualified_id
1974 static tree cp_parser_nested_name_specifier_opt
1976 static tree cp_parser_nested_name_specifier
1978 static tree cp_parser_qualifying_entity
1980 static tree cp_parser_postfix_expression
1982 static tree cp_parser_postfix_open_square_expression
1984 static tree cp_parser_postfix_dot_deref_expression
1988 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1990 static void cp_parser_pseudo_destructor_name
1992 static tree cp_parser_unary_expression
1994 static enum tree_code cp_parser_unary_operator
1996 static tree cp_parser_new_expression
2000 static tree cp_parser_new_type_id
2008 static tree cp_parser_delete_expression
2010 static tree cp_parser_cast_expression
2012 static tree cp_parser_binary_expression
2014 static tree cp_parser_question_colon_clause
2016 static tree cp_parser_assignment_expression
2018 static enum tree_code cp_parser_assignment_operator_opt
2020 static tree cp_parser_expression
2022 static tree cp_parser_constant_expression
2024 static tree cp_parser_builtin_offsetof
2026 static tree cp_parser_lambda_expression
2028 static void cp_parser_lambda_introducer
2030 static bool cp_parser_lambda_declarator_opt
2032 static void cp_parser_lambda_body
2035 /* Statements [gram.stmt.stmt] */
2037 static void cp_parser_statement
2039 static void cp_parser_label_for_labeled_statement
2041 static tree cp_parser_expression_statement
2043 static tree cp_parser_compound_statement
2045 static void cp_parser_statement_seq_opt
2047 static tree cp_parser_selection_statement
2049 static tree cp_parser_condition
2051 static tree cp_parser_iteration_statement
2053 static bool cp_parser_for_init_statement
2055 static tree cp_parser_for
2057 static tree cp_parser_c_for
2059 static tree cp_parser_range_for
2061 static void do_range_for_auto_deduction
2063 static tree cp_parser_perform_range_for_lookup
2065 static tree cp_parser_range_for_member_function
2067 static tree cp_parser_jump_statement
2069 static void cp_parser_declaration_statement
2072 static tree cp_parser_implicitly_scoped_statement
2074 static void cp_parser_already_scoped_statement
2077 /* Declarations [gram.dcl.dcl] */
2079 static void cp_parser_declaration_seq_opt
2081 static void cp_parser_declaration
2083 static void cp_parser_block_declaration
2085 static void cp_parser_simple_declaration
2087 static void cp_parser_decl_specifier_seq
2089 static tree cp_parser_storage_class_specifier_opt
2091 static tree cp_parser_function_specifier_opt
2093 static tree cp_parser_type_specifier
2096 static tree cp_parser_simple_type_specifier
2098 static tree cp_parser_type_name
2100 static tree cp_parser_type_name
2102 static tree cp_parser_nonclass_name
2104 static tree cp_parser_elaborated_type_specifier
2106 static tree cp_parser_enum_specifier
2108 static void cp_parser_enumerator_list
2110 static void cp_parser_enumerator_definition
2112 static tree cp_parser_namespace_name
2114 static void cp_parser_namespace_definition
2116 static void cp_parser_namespace_body
2118 static tree cp_parser_qualified_namespace_specifier
2120 static void cp_parser_namespace_alias_definition
2122 static bool cp_parser_using_declaration
2124 static void cp_parser_using_directive
2126 static tree cp_parser_alias_declaration
2128 static void cp_parser_asm_definition
2130 static void cp_parser_linkage_specification
2132 static void cp_parser_static_assert
2134 static tree cp_parser_decltype
2137 /* Declarators [gram.dcl.decl] */
2139 static tree cp_parser_init_declarator
2146 static enum tree_code cp_parser_ptr_operator
2148 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2150 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2152 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2154 static tree cp_parser_tx_qualifier_opt
2156 static tree cp_parser_late_return_type_opt
2158 static tree cp_parser_declarator_id
2160 static tree cp_parser_type_id
2162 static tree cp_parser_template_type_arg
2165 static tree cp_parser_type_id_1
2167 static void cp_parser_type_specifier_seq
2169 static tree cp_parser_parameter_declaration_clause
2171 static tree cp_parser_parameter_declaration_list
2175 static tree cp_parser_default_argument
2177 static void cp_parser_function_body
2179 static tree cp_parser_initializer
2181 static tree cp_parser_initializer_clause
2183 static tree cp_parser_braced_list
2188 static bool cp_parser_ctor_initializer_opt_and_function_body
2191 static tree cp_parser_late_parsing_omp_declare_simd
2194 static tree cp_parser_late_parsing_cilk_simd_fn_info
2197 static tree cp_parser_late_parsing_oacc_routine
2200 static tree synthesize_implicit_template_parm
2202 static tree finish_fully_implicit_template
2205 /* Classes [gram.class] */
2207 static tree cp_parser_class_name
2209 static tree cp_parser_class_specifier
2211 static tree cp_parser_class_head
2213 static enum tag_types cp_parser_class_key
2215 static void cp_parser_type_parameter_key
2217 static void cp_parser_member_specification_opt
2219 static void cp_parser_member_declaration
2221 static tree cp_parser_pure_specifier
2223 static tree cp_parser_constant_initializer
2226 /* Derived classes [gram.class.derived] */
2228 static tree cp_parser_base_clause
2230 static tree cp_parser_base_specifier
2233 /* Special member functions [gram.special] */
2235 static tree cp_parser_conversion_function_id
2237 static tree cp_parser_conversion_type_id
2241 static bool cp_parser_ctor_initializer_opt
2243 static void cp_parser_mem_initializer_list
2245 static tree cp_parser_mem_initializer
2247 static tree cp_parser_mem_initializer_id
2250 /* Overloading [gram.over] */
2252 static tree cp_parser_operator_function_id
2254 static tree cp_parser_operator
2257 /* Templates [gram.temp] */
2259 static void cp_parser_template_declaration
2261 static tree cp_parser_template_parameter_list
2263 static tree cp_parser_template_parameter
2265 static tree cp_parser_type_parameter
2267 static tree cp_parser_template_id
2269 static tree cp_parser_template_name
2271 static tree cp_parser_template_argument_list
2273 static tree cp_parser_template_argument
2275 static void cp_parser_explicit_instantiation
2277 static void cp_parser_explicit_specialization
2280 /* Exception handling [gram.exception] */
2282 static tree cp_parser_try_block
2284 static bool cp_parser_function_try_block
2286 static void cp_parser_handler_seq
2288 static void cp_parser_handler
2290 static tree cp_parser_exception_declaration
2292 static tree cp_parser_throw_expression
2294 static tree cp_parser_exception_specification_opt
2296 static tree cp_parser_type_id_list
2299 /* GNU Extensions */
2301 static tree cp_parser_asm_specification_opt
2303 static tree cp_parser_asm_operand_list
2305 static tree cp_parser_asm_clobber_list
2307 static tree cp_parser_asm_label_list
2309 static bool cp_next_tokens_can_be_attribute_p
2311 static bool cp_next_tokens_can_be_gnu_attribute_p
2313 static bool cp_next_tokens_can_be_std_attribute_p
2315 static bool cp_nth_tokens_can_be_std_attribute_p
2317 static bool cp_nth_tokens_can_be_gnu_attribute_p
2319 static bool cp_nth_tokens_can_be_attribute_p
2321 static tree cp_parser_attributes_opt
2323 static tree cp_parser_gnu_attributes_opt
2325 static tree cp_parser_gnu_attribute_list
2327 static tree cp_parser_std_attribute
2329 static tree cp_parser_std_attribute_spec
2331 static tree cp_parser_std_attribute_spec_seq
2333 static bool cp_parser_extension_opt
2335 static void cp_parser_label_declaration
2338 /* Concept Extensions */
2340 static tree cp_parser_requires_clause
2342 static tree cp_parser_requires_clause_opt
2344 static tree cp_parser_requires_expression
2346 static tree cp_parser_requirement_parameter_list
2348 static tree cp_parser_requirement_body
2350 static tree cp_parser_requirement_list
2352 static tree cp_parser_requirement
2354 static tree cp_parser_simple_requirement
2356 static tree cp_parser_compound_requirement
2358 static tree cp_parser_type_requirement
2360 static tree cp_parser_nested_requirement
2363 /* Transactional Memory Extensions */
2365 static tree cp_parser_transaction
2367 static tree cp_parser_transaction_expression
2369 static bool cp_parser_function_transaction
2371 static tree cp_parser_transaction_cancel
2375 pragma_external,
2376 pragma_member,
2377 pragma_objc_icode,
2378 pragma_stmt,
2379 pragma_compound
2380 };
2381 static bool cp_parser_pragma
2384 /* Objective-C++ Productions */
2386 static tree cp_parser_objc_message_receiver
2388 static tree cp_parser_objc_message_args
2390 static tree cp_parser_objc_message_expression
2392 static tree cp_parser_objc_encode_expression
2394 static tree cp_parser_objc_defs_expression
2396 static tree cp_parser_objc_protocol_expression
2398 static tree cp_parser_objc_selector_expression
2400 static tree cp_parser_objc_expression
2402 static bool cp_parser_objc_selector_p
2404 static tree cp_parser_objc_selector
2406 static tree cp_parser_objc_protocol_refs_opt
2408 static void cp_parser_objc_declaration
2410 static tree cp_parser_objc_statement
2412 static bool cp_parser_objc_valid_prefix_attributes
2414 static void cp_parser_objc_at_property_declaration
2416 static void cp_parser_objc_at_synthesize_declaration
2418 static void cp_parser_objc_at_dynamic_declaration
2420 static tree cp_parser_objc_struct_declaration
2423 /* Utility Routines */
2425 static tree cp_parser_lookup_name
2427 static tree cp_parser_lookup_name_simple
2429 static tree cp_parser_maybe_treat_template_as_class
2431 static bool cp_parser_check_declarator_template_parameters
2433 static bool cp_parser_check_template_parameters
2435 static tree cp_parser_simple_cast_expression
2437 static tree cp_parser_global_scope_opt
2439 static bool cp_parser_constructor_declarator_p
2441 static tree cp_parser_function_definition_from_specifiers_and_declarator
2443 static tree cp_parser_function_definition_after_declarator
2445 static bool cp_parser_template_declaration_after_export
2447 static void cp_parser_perform_template_parameter_access_checks
2449 static tree cp_parser_single_declaration
2451 static tree cp_parser_functional_cast
2453 static tree cp_parser_save_member_function_body
2455 static tree cp_parser_save_nsdmi
2457 static tree cp_parser_enclosed_template_argument_list
2459 static void cp_parser_save_default_args
2461 static void cp_parser_late_parsing_for_member
2463 static tree cp_parser_late_parse_one_default_arg
2465 static void cp_parser_late_parsing_nsdmi
2467 static void cp_parser_late_parsing_default_args
2469 static tree cp_parser_sizeof_operand
2471 static tree cp_parser_trait_expr
2473 static bool cp_parser_declares_only_class_p
2475 static void cp_parser_set_storage_class
2477 static void cp_parser_set_decl_spec_type
2479 static void set_and_check_decl_spec_loc
2482 static bool cp_parser_friend_p
2484 static void cp_parser_required_error
2490 static bool cp_parser_token_starts_function_definition_p
2492 static bool cp_parser_next_token_starts_class_definition_p
2494 static bool cp_parser_next_token_ends_template_argument_p
2496 static bool cp_parser_nth_token_starts_template_argument_list_p
2498 static enum tag_types cp_parser_token_is_class_key
2500 static enum tag_types cp_parser_token_is_type_parameter_key
2502 static void cp_parser_check_class_key
2504 static void cp_parser_check_access_in_redeclaration
2506 static bool cp_parser_optional_template_keyword
2508 static void cp_parser_pre_parsed_nested_name_specifier
2510 static bool cp_parser_cache_group
2512 static tree cp_parser_cache_defarg
2514 static void cp_parser_parse_tentatively
2516 static void cp_parser_commit_to_tentative_parse
2518 static void cp_parser_commit_to_topmost_tentative_parse
2520 static void cp_parser_abort_tentative_parse
2522 static bool cp_parser_parse_definitely
2526 static bool cp_parser_uncommitted_to_tentative_parse_p
2528 static void cp_parser_error
2530 static void cp_parser_name_lookup_error
2532 static bool cp_parser_simulate_error
2534 static bool cp_parser_check_type_definition
2536 static void cp_parser_check_for_definition_in_return_type
2538 static void cp_parser_check_for_invalid_template_id
2540 static bool cp_parser_non_integral_constant_expression
2542 static void cp_parser_diagnose_invalid_type_name
2544 static bool cp_parser_parse_and_diagnose_invalid_type_name
2546 static int cp_parser_skip_to_closing_parenthesis
2548 static void cp_parser_skip_to_end_of_statement
2550 static void cp_parser_consume_semicolon_at_end_of_statement
2552 static void cp_parser_skip_to_end_of_block_or_statement
2554 static bool cp_parser_skip_to_closing_brace
2556 static void cp_parser_skip_to_end_of_template_parameter_list
2558 static void cp_parser_skip_to_pragma_eol
2560 static bool cp_parser_error_occurred
2562 static bool cp_parser_allow_gnu_extensions_p
2564 static bool cp_parser_is_pure_string_literal
2566 static bool cp_parser_is_string_literal
2568 static bool cp_parser_is_keyword
2570 static tree cp_parser_make_typename_type
2574 static bool cp_parser_compound_literal_p
2576 static bool cp_parser_array_designator_p
2578 static bool cp_parser_skip_to_closing_square_bracket
2581 /* Concept-related syntactic transformations */
2586 // -------------------------------------------------------------------------- //
2587 // Unevaluated Operand Guard
2588 //
2589 // Implementation of an RAII helper for unevaluated operand parsing.
2591 {
2594 }
2597 {
2600 }
2602 // -------------------------------------------------------------------------- //
2603 // Tentative Parsing
2605 /* Returns nonzero if we are parsing tentatively. */
2609 {
2611 }
2613 /* Returns nonzero if TOKEN is a string literal. */
2615 static bool
2617 {
2623 }
2625 /* Returns nonzero if TOKEN is a string literal
2626 of a user-defined string literal. */
2628 static bool
2630 {
2637 }
2639 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2641 static bool
2643 {
2645 }
2647 /* If not parsing tentatively, issue a diagnostic of the form
2648 FILE:LINE: MESSAGE before TOKEN
2649 where TOKEN is the next token in the input stream. MESSAGE
2650 (specified by the caller) is usually of the form "expected
2651 OTHER-TOKEN". */
2653 static void
2655 {
2657 {
2659 /* This diagnostic makes more sense if it is tagged to the line
2660 of the token we just peeked at. */
2664 {
2669 }
2672 /* Because c_parser_error does not understand
2673 CPP_KEYWORD, keywords are treated like
2674 identifiers. */
2677 }
2678 }
2680 /* Issue an error about name-lookup failing. NAME is the
2681 IDENTIFIER_NODE DECL is the result of
2682 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2683 the thing that we hoped to find. */
2685 static void
2687 tree name,
2688 tree decl,
2689 name_lookup_error desired,
2690 location_t location)
2691 {
2692 /* If name lookup completely failed, tell the user that NAME was not
2693 declared. */
2695 {
2708 else
2710 }
2712 {
2714 {
2731 }
2732 }
2734 {
2736 {
2746 name);
2750 }
2751 }
2752 else
2753 {
2755 {
2768 }
2769 }
2770 }
2772 /* If we are parsing tentatively, remember that an error has occurred
2773 during this tentative parse. Returns true if the error was
2774 simulated; false if a message should be issued by the caller. */
2776 static bool
2778 {
2780 {
2783 }
2785 }
2787 /* This function is called when a type is defined. If type
2788 definitions are forbidden at this point, an error message is
2789 issued. */
2791 static bool
2793 {
2794 /* If types are forbidden here, issue a message. */
2796 {
2797 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2798 in the message need to be interpreted. */
2801 }
2803 }
2805 /* This function is called when the DECLARATOR is processed. The TYPE
2806 was a type defined in the decl-specifiers. If it is invalid to
2807 define a type in the decl-specifiers for DECLARATOR, an error is
2808 issued. TYPE_LOCATION is the location of TYPE and is used
2809 for error reporting. */
2811 static void
2814 {
2815 /* [dcl.fct] forbids type definitions in return types.
2816 Unfortunately, it's not easy to know whether or not we are
2817 processing a return type until after the fact. */
2825 {
2830 type);
2831 }
2832 }
2834 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2835 "<" in any valid C++ program. If the next token is indeed "<",
2836 issue a message warning the user about what appears to be an
2837 invalid attempt to form a template-id. LOCATION is the location
2838 of the type-specifier (TYPE) */
2840 static void
2842 tree type,
2844 location_t location)
2845 {
2849 {
2853 {
2856 else
2858 }
2859 else
2861 /* Remember the location of the invalid "<". */
2864 /* Consume the "<". */
2866 /* Parse the template arguments. */
2868 /* Permanently remove the invalid template arguments so that
2869 this error message is not issued again. */
2872 }
2873 }
2875 /* If parsing an integral constant-expression, issue an error message
2876 about the fact that THING appeared and return true. Otherwise,
2877 return false. In either case, set
2878 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2880 static bool
2882 non_integral_constant thing)
2883 {
2886 {
2888 {
2891 {
2898 "enumeration type cannot appear in a "
2989 }
2993 }
2994 }
2996 }
2998 /* Emit a diagnostic for an invalid type name. This function commits
2999 to the current active tentative parse, if any. (Otherwise, the
3000 problematic construct might be encountered again later, resulting
3001 in duplicate error messages.) LOCATION is the location of ID. */
3003 static void
3005 location_t location)
3006 {
3009 /* Try to lookup the identifier. */
3016 /* If the lookup was ambiguous, an error will already have
3017 been issued. */
3019 /* If the lookup found a template-name, it means that the user forgot
3020 to specify an argument list. Emit a useful error message. */
3022 {
3025 decl);
3027 }
3031 /* Something like 'unsigned A a;' */
3034 {
3035 /* Issue an error message. */
3037 /* If we're in a template class, it's possible that the user was
3038 referring to a type from a base class. For example:
3040 template <typename T> struct A { typedef T X; };
3041 template <typename T> struct B : public A<T> { X x; };
3043 The user should have said "typename A<T>::X". */
3057 {
3058 tree b;
3061 b;
3063 {
3067 {
3068 tree field;
3069 /* Go from a particular instantiation of the
3070 template (which will have an empty TYPE_FIELDs),
3071 to the main version. */
3074 field;
3078 {
3083 }
3086 }
3087 }
3088 }
3089 }
3090 /* Here we diagnose qualified-ids where the scope is actually correct,
3091 but the identifier does not resolve to a valid type name. */
3093 {
3095 {
3100 else
3106 }
3109 {
3110 /* A<T>::A<T>() */
3116 }
3123 {
3128 else
3134 }
3135 else
3137 }
3138 }
3140 /* Check for a common situation where a type-name should be present,
3141 but is not, and issue a sensible error message. Returns true if an
3142 invalid type-name was detected.
3144 The situation handled by this function are variable declarations of the
3145 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3146 Usually, `ID' should name a type, but if we got here it means that it
3147 does not. We try to emit the best possible error message depending on
3148 how exactly the id-expression looks like. */
3150 static bool
3152 {
3153 tree id;
3156 /* Avoid duplicate error about ambiguous lookup. */
3158 {
3162 }
3171 /* If the next token is a (, this is a function with no explicit return
3172 type, i.e. constructor, destructor or conversion op. */
3175 {
3178 }
3182 /* Emit a diagnostic for the invalid type. */
3184 out:
3185 /* If we aren't in the middle of a declarator (i.e. in a
3186 parameter-declaration-clause), skip to the end of the declaration;
3187 there's no point in trying to process it. */
3191 }
3193 /* Consume tokens up to, and including, the next non-nested closing `)'.
3194 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3195 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3196 found an unnested token of that type. */
3198 static int
3201 cpp_ttype or_ttype,
3203 {
3213 {
3216 /* Have we found what we're looking for before the closing paren? */
3222 {
3225 /* If we've run out of tokens, then there is no closing `)'. */
3228 /* This is good for lambda expression capture-lists. */
3238 /* This matches the processing in skip_to_end_of_statement. */
3258 {
3262 }
3267 }
3269 /* Consume the token. */
3271 }
3272 }
3274 /* Consume tokens up to, and including, the next non-nested closing `)'.
3275 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3276 are doing error recovery. Returns -1 if OR_COMMA is true and we
3277 found an unnested token of that type. */
3279 static int
3284 {
3288 }
3290 /* Consume tokens until we reach the end of the current statement.
3291 Normally, that will be just before consuming a `;'. However, if a
3292 non-nested `}' comes first, then we stop before consuming that. */
3294 static void
3296 {
3299 /* Unwind generic function template scope if necessary. */
3304 {
3308 {
3311 /* If we've run out of tokens, stop. */
3315 /* If the next token is a `;', we have reached the end of the
3316 statement. */
3322 /* If this is a non-nested '}', stop before consuming it.
3323 That way, when confronted with something like:
3325 { 3 + }
3327 we stop before consuming the closing '}', even though we
3328 have not yet reached a `;'. */
3332 /* If it is the closing '}' for a block that we have
3333 scanned, stop -- but only after consuming the token.
3334 That way given:
3336 void f g () { ... }
3337 typedef int I;
3339 we will stop after the body of the erroneously declared
3340 function, but before consuming the following `typedef'
3341 declaration. */
3343 {
3346 }
3354 }
3356 /* Consume the token. */
3358 }
3359 }
3361 /* This function is called at the end of a statement or declaration.
3362 If the next token is a semicolon, it is consumed; otherwise, error
3363 recovery is attempted. */
3365 static void
3367 {
3368 /* Look for the trailing `;'. */
3370 {
3371 /* If there is additional (erroneous) input, skip to the end of
3372 the statement. */
3374 /* If the next token is now a `;', consume it. */
3377 }
3378 }
3380 /* Skip tokens until we have consumed an entire block, or until we
3381 have consumed a non-nested `;'. */
3383 static void
3385 {
3388 /* Unwind generic function template scope if necessary. */
3393 {
3397 {
3400 /* If we've run out of tokens, stop. */
3404 /* Stop if this is an unnested ';'. */
3410 /* Stop if this is an unnested '}', or closes the outermost
3411 nesting level. */
3412 nesting_depth--;
3420 /* Nest. */
3421 nesting_depth++;
3426 }
3428 /* Consume the token. */
3430 }
3431 }
3433 /* Skip tokens until a non-nested closing curly brace is the next
3434 token, or there are no more tokens. Return true in the first case,
3435 false otherwise. */
3437 static bool
3439 {
3443 {
3447 {
3450 /* If we've run out of tokens, stop. */
3454 /* If the next token is a non-nested `}', then we have reached
3455 the end of the current block. */
3461 /* If it the next token is a `{', then we are entering a new
3462 block. Consume the entire block. */
3468 }
3470 /* Consume the token. */
3472 }
3473 }
3475 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3476 parameter is the PRAGMA token, allowing us to purge the entire pragma
3477 sequence. */
3479 static void
3481 {
3486 do
3490 /* Ensure that the pragma is not parsed again. */
3492 }
3494 /* Require pragma end of line, resyncing with it as necessary. The
3495 arguments are as for cp_parser_skip_to_pragma_eol. */
3497 static void
3499 {
3503 }
3505 /* This is a simple wrapper around make_typename_type. When the id is
3506 an unresolved identifier node, we can provide a superior diagnostic
3507 using cp_parser_diagnose_invalid_type_name. */
3509 static tree
3511 location_t id_location)
3512 {
3513 tree result;
3515 {
3521 }
3523 }
3525 /* This is a wrapper around the
3526 make_{pointer,ptrmem,reference}_declarator functions that decides
3527 which one to call based on the CODE and CLASS_TYPE arguments. The
3528 CODE argument should be one of the values returned by
3529 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3530 appertain to the pointer or reference. */
3534 cp_cv_quals cv_qualifiers,
3536 tree attributes)
3537 {
3544 else
3554 }
3556 /* Create a new C++ parser. */
3560 {
3565 /* cp_lexer_new_main is called before doing GC allocation because
3566 cp_lexer_new_main might load a PCH file. */
3569 /* Initialize the binops_by_token so that we can get the tree
3570 directly from the token. */
3578 /* For now, we always accept GNU extensions. */
3581 /* The `>' token is a greater-than operator, not the end of a
3582 template-id. */
3587 /* We are not parsing a constant-expression. */
3592 /* Local variable names are not forbidden. */
3595 /* We are not processing an `extern "C"' declaration. */
3598 /* We are not processing a declarator. */
3601 /* We are not processing a template-argument-list. */
3604 /* We are not in an iteration statement. */
3607 /* We are not in a switch statement. */
3610 /* We are not parsing a type-id inside an expression. */
3613 /* Declarations aren't implicitly extern "C". */
3616 /* String literals should be translated to the execution character set. */
3619 /* We are not parsing a function body. */
3622 /* We can correct until told otherwise. */
3625 /* The unparsed function queue is empty. */
3628 /* There are no classes being defined. */
3631 /* No template parameters apply. */
3634 /* Not declaring an implicit function template. */
3640 /* Active OpenACC routine clauses. */
3643 /* Allow constrained-type-specifiers. */
3647 }
3649 /* Create a cp_lexer structure which will emit the tokens in CACHE
3650 and push it onto the parser's lexer stack. This is used for delayed
3651 parsing of in-class method bodies and default arguments, and should
3652 not be confused with tentative parsing. */
3653 static void
3655 {
3660 /* Move the current source position to that of the first token in the
3661 new lexer. */
3663 }
3665 /* Pop the top lexer off the parser stack. This is never used for the
3666 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3667 static void
3669 {
3674 /* Put the current source position back where it was before this
3675 lexer was pushed. */
3677 }
3679 /* Lexical conventions [gram.lex] */
3681 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3682 identifier. */
3684 static tree
3686 {
3689 /* Look for the identifier. */
3691 /* Return the value. */
3693 }
3695 /* Parse a sequence of adjacent string constants. Returns a
3696 TREE_STRING representing the combined, nul-terminated string
3697 constant. If TRANSLATE is true, translate the string to the
3698 execution character set. If WIDE_OK is true, a wide string is
3699 invalid here.
3701 C++98 [lex.string] says that if a narrow string literal token is
3702 adjacent to a wide string literal token, the behavior is undefined.
3703 However, C99 6.4.5p4 says that this results in a wide string literal.
3704 We follow C99 here, for consistency with the C front end.
3706 This code is largely lifted from lex_string() in c-lex.c.
3708 FUTURE: ObjC++ will need to handle @-strings here. */
3709 static tree
3712 {
3713 tree value;
3720 tree string_tree;
3726 {
3729 }
3732 {
3736 }
3737 else
3738 {
3741 }
3744 /* Try to avoid the overhead of creating and destroying an obstack
3745 for the common case of just one string. */
3748 {
3756 {
3760 }
3761 else
3765 }
3766 else
3767 {
3771 do
3772 {
3774 count++;
3779 {
3782 {
3785 }
3788 {
3793 }
3795 }
3796 else
3800 {
3805 "unsupported non-standard concatenation "
3807 }
3813 {
3817 }
3818 else
3819 {
3823 }
3824 }
3828 }
3831 {
3834 }
3838 {
3843 {
3858 }
3863 {
3868 else
3870 }
3871 }
3872 else
3873 /* cpp_interpret_string has issued an error. */
3880 }
3882 /* Look up a literal operator with the name and the exact arguments. */
3884 static tree
3886 {
3893 {
3899 {
3902 {
3912 }
3915 /* May be this should be sufficient_parms_p instead,
3916 depending on how exactly should user-defined literals
3917 work in presence of default arguments on the literal
3918 operator parameters. */
3921 }
3922 }
3925 }
3927 /* Parse a user-defined char constant. Returns a call to a user-defined
3928 literal operator taking the character as an argument. */
3930 static tree
3932 {
3940 /* Build up a call to the user-defined operator */
3941 /* Lookup the name we got back from the id-expression. */
3946 {
3951 }
3955 }
3957 /* A subroutine of cp_parser_userdef_numeric_literal to
3958 create a char... template parameter pack from a string node. */
3960 static tree
3962 {
3963 tree charvec;
3969 /* Fill in CHARVEC with all of the parameters. */
3974 /* Build the argument packs. */
3981 }
3983 /* A subroutine of cp_parser_userdef_numeric_literal to
3984 create a char... template parameter pack from a string node. */
3986 static tree
3988 {
3989 tree charvec;
4000 /* First template parm is character type. */
4003 /* Fill in CHARVEC with all of the parameters. */
4010 /* Build the argument packs. */
4017 }
4019 /* Parse a user-defined numeric constant. returns a call to a user-defined
4020 literal operator. */
4022 static tree
4024 {
4035 /* Look for a literal operator taking the exact type of numeric argument
4036 as the literal value. */
4041 {
4043 tf_warning_or_error);
4046 {
4049 long_long_unsigned_type_node);
4050 }
4051 else
4052 {
4056 long_double_type_node);
4060 }
4064 }
4067 /* If the numeric argument didn't work, look for a raw literal
4068 operator taking a const char* argument consisting of the number
4069 in string format. */
4074 {
4076 tf_warning_or_error);
4079 }
4082 /* If the raw literal didn't work, look for a non-type template
4083 function with parameter pack char.... Call the function with
4084 template parameter characters representing the number. */
4088 {
4092 tf_warning_or_error);
4095 }
4104 }
4106 /* Parse a user-defined string constant. Returns a call to a user-defined
4107 literal operator taking a character pointer and the length of the string
4108 as arguments. */
4110 static tree
4112 {
4121 /* Build up a call to the user-defined operator. */
4122 /* Lookup the name we got back from the id-expression. */
4129 {
4131 tf_warning_or_error);
4134 }
4137 /* Look for a template function with typename parameter CharT
4138 and parameter pack CharT... Call the function with
4139 template parameter characters representing the string. */
4143 {
4147 tf_warning_or_error);
4150 }
4156 }
4159 /* Basic concepts [gram.basic] */
4161 /* Parse a translation-unit.
4163 translation-unit:
4164 declaration-seq [opt]
4166 Returns TRUE if all went well. */
4168 static bool
4170 {
4171 /* The address of the first non-permanent object on the declarator
4172 obstack. */
4177 /* Create the declarator obstack, if necessary. */
4179 {
4181 /* Create the error declarator. */
4183 /* Create the empty parameter list. */
4185 /* Remember where the base of the declarator obstack lies. */
4187 }
4191 /* If there are no tokens left then all went well. */
4193 {
4194 /* Get rid of the token array; we don't need it any more. */
4198 /* This file might have been a context that's implicitly extern
4199 "C". If so, pop the lang context. (Only relevant for PCH.) */
4201 {
4204 }
4206 /* Finish up. */
4210 }
4211 else
4212 {
4215 }
4217 /* Make sure the declarator obstack was fully cleaned up. */
4221 /* All went well. */
4223 }
4225 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4226 decltype context. */
4230 {
4235 }
4237 /* We're about to parse a collection of statements. If we're currently
4238 parsing tentatively, set up a firewall so that any nested
4239 cp_parser_commit_to_tentative_parse won't affect the current context. */
4241 static cp_token_position
4243 {
4250 }
4252 /* We've finished parsing the collection of statements. Wrap up the
4253 firewall and replace the relevant tokens with the parsed form. */
4255 static void
4257 tree expr)
4258 {
4262 /* Finish the firewall level. */
4264 /* And remember the result of the parse for when we try again. */
4270 }
4272 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4273 enclosing parentheses. */
4275 static tree
4277 {
4280 /* Consume the '('. */
4282 /* Start the statement-expression. */
4284 /* Parse the compound-statement. */
4286 /* Finish up. */
4288 /* Consume the ')'. */
4294 }
4296 /* Expressions [gram.expr] */
4298 /* Parse a fold-operator.
4300 fold-operator:
4301 - * / % ^ & | = < > << >>
4302 = -= *= /= %= ^= &= |= <<= >>=
4303 == != <= >= && || , .* ->*
4305 This returns the tree code corresponding to the matched operator
4306 as an int. When the current token matches a compound assignment
4307 opertor, the resulting tree code is the negative value of the
4308 non-assignment operator. */
4310 static int
4312 {
4314 {
4354 }
4355 }
4357 /* Returns true if CODE indicates a binary expression, which is not allowed in
4358 the LHS of a fold-expression. More codes will need to be added to use this
4359 function in other contexts. */
4361 static bool
4363 {
4365 {
4398 }
4399 }
4401 /* If the next token is a suitable fold operator, consume it and return as
4402 the function above. */
4404 static int
4406 {
4412 }
4414 /* Parse a fold-expression.
4416 fold-expression:
4417 ( ... folding-operator cast-expression)
4418 ( cast-expression folding-operator ... )
4419 ( cast-expression folding operator ... folding-operator cast-expression)
4421 Note that the '(' and ')' are matched in primary expression. */
4423 static tree
4425 {
4426 cp_id_kind pidk;
4428 // Left fold.
4430 {
4434 {
4437 }
4444 }
4449 {
4452 }
4455 {
4458 }
4461 /* The operands of a fold-expression are cast-expressions, so binary or
4462 conditional expressions are not allowed. We check this here to avoid
4463 tentative parsing. */
4471 // Right fold.
4476 {
4479 }
4482 // Binary left or right fold.
4487 }
4489 /* Parse a primary-expression.
4491 primary-expression:
4492 literal
4493 this
4494 ( expression )
4495 id-expression
4496 lambda-expression (C++11)
4498 GNU Extensions:
4500 primary-expression:
4501 ( compound-statement )
4502 __builtin_va_arg ( assignment-expression , type-id )
4503 __builtin_offsetof ( type-id , offsetof-expression )
4505 C++ Extensions:
4506 __has_nothrow_assign ( type-id )
4507 __has_nothrow_constructor ( type-id )
4508 __has_nothrow_copy ( type-id )
4509 __has_trivial_assign ( type-id )
4510 __has_trivial_constructor ( type-id )
4511 __has_trivial_copy ( type-id )
4512 __has_trivial_destructor ( type-id )
4513 __has_virtual_destructor ( type-id )
4514 __is_abstract ( type-id )
4515 __is_base_of ( type-id , type-id )
4516 __is_class ( type-id )
4517 __is_empty ( type-id )
4518 __is_enum ( type-id )
4519 __is_final ( type-id )
4520 __is_literal_type ( type-id )
4521 __is_pod ( type-id )
4522 __is_polymorphic ( type-id )
4523 __is_std_layout ( type-id )
4524 __is_trivial ( type-id )
4525 __is_union ( type-id )
4527 Objective-C++ Extension:
4529 primary-expression:
4530 objc-expression
4532 literal:
4533 __null
4535 ADDRESS_P is true iff this expression was immediately preceded by
4536 "&" and therefore might denote a pointer-to-member. CAST_P is true
4537 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4538 true iff this expression is a template argument.
4540 Returns a representation of the expression. Upon return, *IDK
4541 indicates what kind of id-expression (if any) was present. */
4543 static tree
4550 {
4553 /* Assume the primary expression is not an id-expression. */
4556 /* Peek at the next token. */
4559 {
4560 /* literal:
4561 integer-literal
4562 character-literal
4563 floating-literal
4564 string-literal
4565 boolean-literal
4566 pointer-literal
4567 user-defined-literal */
4579 {
4583 }
4584 /* Floating-point literals are only allowed in an integral
4585 constant expression if they are cast to an integral or
4586 enumeration type. */
4590 {
4591 /* CAST_P will be set even in invalid code like "int(2.7 +
4592 ...)". Therefore, we have to check that the next token
4593 is sure to end the cast. */
4595 {
4600 enumerator-definition. */
4602 /* The curly brace at the end of an enum-specifier. */
4604 /* The end of a statement. */
4606 /* The end of the cast-expression. */
4608 /* The end of an array bound. */
4610 /* The closing ">" in a template-argument-list. */
4613 /* C++0x only: A ">>" treated like two ">" tokens,
4614 in a template-argument-list. */
4619 }
4621 /* If we are within a cast, then the constraint that the
4622 cast is to an integral or enumeration type will be
4623 checked at that point. If we are not within a cast, then
4624 this code is invalid. */
4627 }
4647 /* ??? Should wide strings be allowed when parser->translate_strings_p
4648 is false (i.e. in attributes)? If not, we can kill the third
4649 argument to cp_parser_string_literal. */
4655 /* If we see `( { ' then we are looking at the beginning of
4656 a GNU statement-expression. */
4659 {
4660 /* Statement-expressions are not allowed by the standard. */
4664 /* And they're not allowed outside of a function-body; you
4665 cannot, for example, write:
4667 int i = ({ int j = 3; j + 1; });
4669 at class or namespace scope. */
4672 {
4674 "statement-expressions are not allowed outside "
4680 }
4681 else
4683 }
4684 /* Otherwise it's a normal parenthesized expression. */
4685 {
4686 tree expr;
4689 /* Consume the `('. */
4691 /* Within a parenthesized expression, a `>' token is always
4692 the greater-than operator. */
4693 saved_greater_than_is_operator_p
4698 /* Left fold expression. */
4700 else
4701 /* Parse the parenthesized expression. */
4706 {
4713 }
4714 else
4715 /* Let the front end know that this expression was
4716 enclosed in parentheses. This matters in case, for
4717 example, the expression is of the form `A::B', since
4718 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4719 not. */
4722 /* DR 705: Wrapping an unqualified name in parentheses
4723 suppresses arg-dependent lookup. We want to pass back
4724 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4725 (c++/37862), but none of the others. */
4729 /* The `>' token might be the end of a template-id or
4730 template-parameter-list now. */
4731 parser->greater_than_is_operator_p
4733 /* Consume the `)'. */
4739 }
4742 {
4744 {
4745 /* We might have an Objective-C++ message. */
4748 /* If that works out, we're done ... */
4751 /* ... else, fall though to see if it's a lambda. */
4752 }
4754 /* Don't warn about a failed tentative parse. */
4759 }
4763 /* We have an Objective-C++ string literal. */
4770 {
4771 /* These two are the boolean literals. */
4779 /* The `__null' literal. */
4784 /* The `nullptr' literal. */
4789 /* Recognize the `this' keyword. */
4793 {
4797 }
4798 /* Pointers cannot appear in constant-expressions. */
4803 /* The `operator' keyword can be the beginning of an
4804 id-expression. */
4811 {
4812 non_integral_constant name;
4814 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4815 __func__ are the names of variables -- but they are
4816 treated specially. Therefore, they are handled here,
4817 rather than relying on the generic id-expression logic
4818 below. Grammatically, these names are id-expressions.
4820 Consume the token. */
4824 {
4836 }
4841 /* Look up the name. */
4843 }
4846 {
4847 tree expression;
4848 tree type;
4849 source_location type_location;
4851 /* The `__builtin_va_arg' construct is used to handle
4852 `va_arg'. Consume the `__builtin_va_arg' token. */
4854 /* Look for the opening `('. */
4856 /* Now, parse the assignment-expression. */
4858 /* Look for the `,'. */
4861 /* Parse the type-id. */
4863 /* Look for the closing `)'. */
4865 /* Using `va_arg' in a constant-expression is not
4866 allowed. */
4868 NIC_VA_ARG))
4871 }
4902 // C++ concepts
4906 /* Objective-C++ expressions. */
4916 {
4921 }
4925 }
4927 /* An id-expression can start with either an identifier, a
4928 `::' as the beginning of a qualified-id, or the "operator"
4929 keyword. */
4934 {
4935 tree id_expression;
4936 tree decl;
4942 id_expression:
4943 /* Parse the id-expression. */
4944 id_expression
4961 /* If we have a template-id, then no further lookup is
4962 required. If the template-id was for a template-class, we
4963 will sometimes have a TYPE_DECL at this point. */
4967 /* Look up the name. */
4968 else
4969 {
4970 tree ambiguous_decls;
4972 /* If we already know that this lookup is ambiguous, then
4973 we've already issued an error message; there's no reason
4974 to check again. */
4977 {
4980 }
4983 none_type,
4984 template_p,
4989 /* If the lookup was ambiguous, an error will already have
4990 been issued. */
4994 /* In Objective-C++, we may have an Objective-C 2.0
4995 dot-syntax for classes here. */
5000 {
5001 tree component;
5008 }
5010 /* In Objective-C++, an instance variable (ivar) may be preferred
5011 to whatever cp_parser_lookup_name() found. */
5014 /* If name lookup gives us a SCOPE_REF, then the
5015 qualifying scope was dependent. */
5017 {
5018 /* At this point, we do not know if DECL is a valid
5019 integral constant expression. We assume that it is
5020 in fact such an expression, so that code like:
5022 template <int N> struct A {
5023 int a[B<N>::i];
5024 };
5026 is accepted. At template-instantiation time, we
5027 will check that B<N>::i is actually a constant. */
5029 }
5030 /* Check to see if DECL is a local variable in a context
5031 where that is forbidden. */
5034 {
5035 /* It might be that we only found DECL because we are
5036 trying to be generous with pre-ISO scoping rules.
5037 For example, consider:
5039 int i;
5040 void g() {
5041 for (int i = 0; i < 10; ++i) {}
5042 extern void f(int j = i);
5043 }
5045 Here, name look up will originally find the out
5046 of scope `i'. We need to issue a warning message,
5047 but then use the global `i'. */
5050 {
5053 decl);
5055 }
5056 }
5057 }
5059 decl = (finish_id_expression
5061 idk,
5066 template_arg_p,
5072 }
5074 /* Anything else is an error. */
5078 }
5079 }
5087 {
5090 }
5092 /* Parse an id-expression.
5094 id-expression:
5095 unqualified-id
5096 qualified-id
5098 qualified-id:
5099 :: [opt] nested-name-specifier template [opt] unqualified-id
5100 :: identifier
5101 :: operator-function-id
5102 :: template-id
5104 Return a representation of the unqualified portion of the
5105 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5106 a `::' or nested-name-specifier.
5108 Often, if the id-expression was a qualified-id, the caller will
5109 want to make a SCOPE_REF to represent the qualified-id. This
5110 function does not do this in order to avoid wastefully creating
5111 SCOPE_REFs when they are not required.
5113 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5114 `template' keyword.
5116 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5117 uninstantiated templates.
5119 If *TEMPLATE_P is non-NULL, it is set to true iff the
5120 `template' keyword is used to explicitly indicate that the entity
5121 named is a template.
5123 If DECLARATOR_P is true, the id-expression is appearing as part of
5124 a declarator, rather than as part of an expression. */
5126 static tree
5133 {
5137 /* Assume the `template' keyword was not used. */
5141 /* Look for the optional `::' operator. */
5142 global_scope_p
5145 /* Look for the optional nested-name-specifier. */
5146 nested_name_specifier_p
5149 check_dependency_p,
5151 declarator_p)
5153 /* If there is a nested-name-specifier, then we are looking at
5154 the first qualified-id production. */
5156 {
5157 tree saved_scope;
5158 tree saved_object_scope;
5159 tree saved_qualifying_scope;
5160 tree unqualified_id;
5163 /* See if the next token is the `template' keyword. */
5167 /* Name lookup we do during the processing of the
5168 unqualified-id might obliterate SCOPE. */
5172 /* Process the final unqualified-id. */
5174 check_dependency_p,
5175 declarator_p,
5177 /* Restore the SAVED_SCOPE for our caller. */
5183 }
5184 /* Otherwise, if we are in global scope, then we are looking at one
5185 of the other qualified-id productions. */
5187 {
5189 tree id;
5191 /* Peek at the next token. */
5194 /* If it's an identifier, and the next token is not a "<", then
5195 we can avoid the template-id case. This is an optimization
5196 for this common case. */
5198 && !cp_parser_nth_token_starts_template_argument_list_p
5203 /* Try a template-id. */
5207 none_type,
5208 declarator_p);
5209 /* If that worked, we're done. */
5213 /* Peek at the next token. (Changes in the token buffer may
5214 have invalidated the pointer obtained above.) */
5218 {
5225 /* Fall through. */
5230 }
5231 }
5232 else
5235 declarator_p,
5236 optional_p);
5237 }
5239 /* Parse an unqualified-id.
5241 unqualified-id:
5242 identifier
5243 operator-function-id
5244 conversion-function-id
5245 ~ class-name
5246 template-id
5248 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5249 keyword, in a construct like `A::template ...'.
5251 Returns a representation of unqualified-id. For the `identifier'
5252 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5253 production a BIT_NOT_EXPR is returned; the operand of the
5254 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5255 other productions, see the documentation accompanying the
5256 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5257 names are looked up in uninstantiated templates. If DECLARATOR_P
5258 is true, the unqualified-id is appearing as part of a declarator,
5259 rather than as part of an expression. */
5261 static tree
5267 {
5270 /* Peek at the next token. */
5274 {
5276 {
5277 tree id;
5279 /* We don't know yet whether or not this will be a
5280 template-id. */
5282 /* Try a template-id. */
5284 check_dependency_p,
5285 none_type,
5286 declarator_p);
5287 /* If it worked, we're done. */
5290 /* Otherwise, it's an ordinary identifier. */
5292 }
5296 check_dependency_p,
5297 none_type,
5298 declarator_p);
5301 {
5302 tree type_decl;
5303 tree qualifying_scope;
5304 tree object_scope;
5305 tree scope;
5308 /* Consume the `~' token. */
5310 /* Parse the class-name. The standard, as written, seems to
5311 say that:
5313 template <typename T> struct S { ~S (); };
5314 template <typename T> S<T>::~S() {}
5316 is invalid, since `~' must be followed by a class-name, but
5317 `S<T>' is dependent, and so not known to be a class.
5318 That's not right; we need to look in uninstantiated
5319 templates. A further complication arises from:
5321 template <typename T> void f(T t) {
5322 t.T::~T();
5323 }
5325 Here, it is not possible to look up `T' in the scope of `T'
5326 itself. We must look in both the current scope, and the
5327 scope of the containing complete expression.
5329 Yet another issue is:
5331 struct S {
5332 int S;
5333 ~S();
5334 };
5336 S::~S() {}
5338 The standard does not seem to say that the `S' in `~S'
5339 should refer to the type `S' and not the data member
5340 `S::S'. */
5342 /* DR 244 says that we look up the name after the "~" in the
5343 same scope as we looked up the qualifying name. That idea
5344 isn't fully worked out; it's more complicated than that. */
5349 /* Check for invalid scopes. */
5351 {
5355 }
5357 {
5361 scope);
5366 }
5369 /* If the name is of the form "X::~X" it's OK even if X is a
5370 typedef. */
5379 {
5382 }
5384 /* ~auto means the destructor of whatever the object is. */
5386 {
5389 "%<~auto%> only available with "
5393 }
5395 /* If there was an explicit qualification (S::~T), first look
5396 in the scope given by the qualification (i.e., S).
5398 Note: in the calls to cp_parser_class_name below we pass
5399 typename_type so that lookup finds the injected-class-name
5400 rather than the constructor. */
5404 {
5409 typename_type,
5412 declarator_p);
5415 }
5416 /* In "N::S::~S", look in "N" as well. */
5418 {
5423 type_decl
5427 typename_type,
5430 declarator_p);
5433 }
5434 /* In "p->S::~T", look in the scope given by "*p" as well. */
5436 {
5441 type_decl
5445 typename_type,
5448 declarator_p);
5451 }
5452 /* Look in the surrounding context. */
5454 {
5460 type_decl
5464 typename_type,
5467 declarator_p);
5470 {
5471 /* We couldn't find a type with this name. If we're parsing
5472 tentatively, fail and try something else. */
5474 {
5477 }
5478 /* Otherwise, accept it and check for a match at instantiation
5479 time. */
5484 }
5485 }
5486 /* If an error occurred, assume that the name of the
5487 destructor is the same as the name of the qualifying
5488 class. That allows us to keep parsing after running
5489 into ill-formed destructor names. */
5495 /* Check that destructor name and scope match. */
5497 {
5504 }
5506 /* [class.dtor]
5508 A typedef-name that names a class shall not be used as the
5509 identifier in the declarator for a destructor declaration. */
5516 type_decl);
5519 }
5523 {
5524 tree id;
5526 /* This could be a template-id, so we try that first. */
5528 /* Try a template-id. */
5531 none_type,
5532 declarator_p);
5533 /* If that worked, we're done. */
5536 /* We still don't know whether we're looking at an
5537 operator-function-id or a conversion-function-id. */
5539 /* Try an operator-function-id. */
5541 /* If that didn't work, try a conversion-function-id. */
5545 {
5546 /* 17.6.3.3.5 */
5552 }
5555 }
5556 /* Fall through. */
5563 }
5564 }
5566 /* Parse an (optional) nested-name-specifier.
5568 nested-name-specifier: [C++98]
5569 class-or-namespace-name :: nested-name-specifier [opt]
5570 class-or-namespace-name :: template nested-name-specifier [opt]
5572 nested-name-specifier: [C++0x]
5573 type-name ::
5574 namespace-name ::
5575 nested-name-specifier identifier ::
5576 nested-name-specifier template [opt] simple-template-id ::
5578 PARSER->SCOPE should be set appropriately before this function is
5579 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5580 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5581 in name lookups.
5583 Sets PARSER->SCOPE to the class (TYPE) or namespace
5584 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5585 it unchanged if there is no nested-name-specifier. Returns the new
5586 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5588 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5589 part of a declaration and/or decl-specifier. */
5591 static tree
5597 {
5602 /* Remember where the nested-name-specifier starts. */
5604 {
5607 }
5610 {
5611 tree new_scope;
5612 tree old_scope;
5613 tree saved_qualifying_scope;
5616 /* Spot cases that cannot be the beginning of a
5617 nested-name-specifier. */
5620 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5621 the already parsed nested-name-specifier. */
5623 {
5624 /* Grab the nested-name-specifier and continue the loop. */
5626 /* If we originally encountered this nested-name-specifier
5627 with IS_DECLARATION set to false, we will not have
5628 resolved TYPENAME_TYPEs, so we must do so here. */
5631 {
5636 }
5639 }
5641 /* Spot cases that cannot be the beginning of a
5642 nested-name-specifier. On the second and subsequent times
5643 through the loop, we look for the `template' keyword. */
5645 ;
5646 /* A template-id can start a nested-name-specifier. */
5648 ;
5649 /* DR 743: decltype can be used in a nested-name-specifier. */
5651 ;
5652 else
5653 {
5654 /* If the next token is not an identifier, then it is
5655 definitely not a type-name or namespace-name. */
5658 /* If the following token is neither a `<' (to begin a
5659 template-id), nor a `::', then we are not looking at a
5660 nested-name-specifier. */
5666 {
5670 }
5673 && !cp_parser_nth_token_starts_template_argument_list_p
5676 }
5678 /* The nested-name-specifier is optional, so we parse
5679 tentatively. */
5682 /* Look for the optional `template' keyword, if this isn't the
5683 first time through the loop. */
5686 else
5689 /* Save the old scope since the name lookup we are about to do
5690 might destroy it. */
5693 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5694 look up names in "X<T>::I" in order to determine that "Y" is
5695 a template. So, if we have a typename at this point, we make
5696 an effort to look through it. */
5698 && !typename_keyword_p
5703 /* Parse the qualifying entity. */
5704 new_scope
5706 typename_keyword_p,
5707 template_keyword_p,
5708 check_dependency_p,
5709 type_p,
5710 is_declaration);
5711 /* Look for the `::' token. */
5714 /* If we found what we wanted, we keep going; otherwise, we're
5715 done. */
5717 {
5720 /* Restore the OLD_SCOPE since it was valid before the
5721 failed attempt at finding the last
5722 class-or-namespace-name. */
5726 /* If the next token is a decltype, and the one after that is a
5727 `::', then the decltype has failed to resolve to a class or
5728 enumeration type. Give this error even when parsing
5729 tentatively since it can't possibly be valid--and we're going
5730 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5731 won't get another chance.*/
5735 {
5742 /* As below. */
5745 }
5749 {
5750 /* If we have a non-type template-id followed by ::, it can't
5751 possibly be valid. */
5756 {
5759 {
5765 }
5766 else
5767 {
5768 /* Variable template. */
5773 }
5780 /* As below. */
5784 }
5785 }
5789 /* If the next token is an identifier, and the one after
5790 that is a `::', then any valid interpretation would have
5791 found a class-or-namespace-name. */
5797 {
5800 {
5802 {
5803 tree decl;
5804 tree ambiguous_decls;
5807 none_type,
5816 decl);
5818 {
5819 // cp_parser_lookup_name has the same diagnostic,
5820 // thus make sure to emit it at most once.
5823 {
5828 }
5830 }
5831 else
5832 {
5834 cp_parser_name_lookup_error
5837 else
5838 cp_parser_name_lookup_error
5841 }
5842 }
5845 /* Treat this as a successful nested-name-specifier
5846 due to:
5848 [basic.lookup.qual]
5850 If the name found is not a class-name (clause
5851 _class_) or namespace-name (_namespace.def_), the
5852 program is ill-formed. */
5854 }
5856 }
5858 }
5859 /* We've found one valid nested-name-specifier. */
5861 /* Name lookup always gives us a DECL. */
5864 /* Uses of "template" must be followed by actual templates. */
5876 new_scope);
5877 /* If it is a class scope, try to complete it; we are about to
5878 be looking up names inside the class. */
5880 /* Since checking types for dependency can be expensive,
5881 avoid doing it if the type is already complete. */
5883 /* Do not try to complete dependent types. */
5885 {
5887 /* If it is a typedef to current class, use the current
5888 class instead, as the typedef won't have any names inside
5889 it yet. */
5893 }
5894 /* Make sure we look in the right scope the next time through
5895 the loop. */
5897 }
5899 /* If parsing tentatively, replace the sequence of tokens that makes
5900 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5901 token. That way, should we re-parse the token stream, we will
5902 not have to repeat the effort required to do the parse, nor will
5903 we issue duplicate error messages. */
5905 {
5909 /* Reset the contents of the START token. */
5911 /* Retrieve any deferred checks. Do not pop this access checks yet
5912 so the memory will not be reclaimed during token replacing below. */
5920 /* Purge all subsequent tokens. */
5922 }
5928 }
5930 /* Parse a nested-name-specifier. See
5931 cp_parser_nested_name_specifier_opt for details. This function
5932 behaves identically, except that it will an issue an error if no
5933 nested-name-specifier is present. */
5935 static tree
5941 {
5942 tree scope;
5944 /* Look for the nested-name-specifier. */
5946 typename_keyword_p,
5947 check_dependency_p,
5948 type_p,
5949 is_declaration);
5950 /* If it was not present, issue an error message. */
5952 {
5955 }
5958 }
5960 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5961 this is either a class-name or a namespace-name (which corresponds
5962 to the class-or-namespace-name production in the grammar). For
5963 C++0x, it can also be a type-name that refers to an enumeration
5964 type or a simple-template-id.
5966 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5967 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5968 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5969 TYPE_P is TRUE iff the next name should be taken as a class-name,
5970 even the same name is declared to be another entity in the same
5971 scope.
5973 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5974 specified by the class-or-namespace-name. If neither is found the
5975 ERROR_MARK_NODE is returned. */
5977 static tree
5984 {
5985 tree saved_scope;
5986 tree saved_qualifying_scope;
5987 tree saved_object_scope;
5988 tree scope;
5992 /* DR 743: decltype can appear in a nested-name-specifier. */
5994 {
5998 {
6001 }
6005 }
6007 /* Before we try to parse the class-name, we must save away the
6008 current PARSER->SCOPE since cp_parser_class_name will destroy
6009 it. */
6013 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6014 there is no need to look for a namespace-name. */
6015 only_class_p = template_keyword_p
6020 typename_keyword_p,
6021 template_keyword_p,
6023 check_dependency_p,
6025 is_declaration,
6028 /* If that didn't work, try for a namespace-name. */
6030 {
6031 /* Restore the saved scope. */
6035 /* If we are not looking at an identifier followed by the scope
6036 resolution operator, then this is not part of a
6037 nested-name-specifier. (Note that this function is only used
6038 to parse the components of a nested-name-specifier.) */
6043 }
6046 }
6048 /* Return true if we are looking at a compound-literal, false otherwise. */
6050 static bool
6052 {
6053 /* Consume the `('. */
6058 /* Skip tokens until the next token is a closing parenthesis.
6059 If we find the closing `)', and the next token is a `{', then
6060 we are looking at a compound-literal. */
6061 bool compound_literal_p
6066 /* Roll back the tokens we skipped. */
6070 }
6072 /* Parse a postfix-expression.
6074 postfix-expression:
6075 primary-expression
6076 postfix-expression [ expression ]
6077 postfix-expression ( expression-list [opt] )
6078 simple-type-specifier ( expression-list [opt] )
6079 typename :: [opt] nested-name-specifier identifier
6080 ( expression-list [opt] )
6081 typename :: [opt] nested-name-specifier template [opt] template-id
6082 ( expression-list [opt] )
6083 postfix-expression . template [opt] id-expression
6084 postfix-expression -> template [opt] id-expression
6085 postfix-expression . pseudo-destructor-name
6086 postfix-expression -> pseudo-destructor-name
6087 postfix-expression ++
6088 postfix-expression --
6089 dynamic_cast < type-id > ( expression )
6090 static_cast < type-id > ( expression )
6091 reinterpret_cast < type-id > ( expression )
6092 const_cast < type-id > ( expression )
6093 typeid ( expression )
6094 typeid ( type-id )
6096 GNU Extension:
6098 postfix-expression:
6099 ( type-id ) { initializer-list , [opt] }
6101 This extension is a GNU version of the C99 compound-literal
6102 construct. (The C99 grammar uses `type-name' instead of `type-id',
6103 but they are essentially the same concept.)
6105 If ADDRESS_P is true, the postfix expression is the operand of the
6106 `&' operator. CAST_P is true if this expression is the target of a
6107 cast.
6109 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6110 class member access expressions [expr.ref].
6112 Returns a representation of the expression. */
6114 static tree
6118 {
6120 location_t loc;
6127 /* Peek at the next token. */
6130 /* Some of the productions are determined by keywords. */
6133 {
6138 {
6139 tree type;
6140 tree expression;
6144 /* All of these can be handled in the same way from the point
6145 of view of parsing. Begin by consuming the token
6146 identifying the cast. */
6149 /* New types cannot be defined in the cast. */
6151 parser->type_definition_forbidden_message
6154 /* Look for the opening `<'. */
6156 /* Parse the type to which we are casting. */
6161 /* Look for the closing `>'. */
6163 /* Restore the old message. */
6166 bool saved_greater_than_is_operator_p
6170 /* And the expression which is being cast. */
6175 parser->greater_than_is_operator_p
6178 /* Only type conversions to integral or enumeration types
6179 can be used in constant-expressions. */
6185 {
6187 postfix_expression
6191 postfix_expression
6195 postfix_expression
6197 tf_warning_or_error);
6200 postfix_expression
6205 }
6206 }
6210 {
6211 tree type;
6215 /* Consume the `typeid' token. */
6217 /* Look for the `(' token. */
6219 /* Types cannot be defined in a `typeid' expression. */
6221 parser->type_definition_forbidden_message
6223 /* We can't be sure yet whether we're looking at a type-id or an
6224 expression. */
6226 /* Try a type-id first. */
6231 /* Look for the `)' token. Otherwise, we can't be sure that
6232 we're not looking at an expression: consider `typeid (int
6233 (3))', for example. */
6235 /* If all went well, simply lookup the type-id. */
6238 /* Otherwise, fall back to the expression variant. */
6239 else
6240 {
6241 tree expression;
6243 /* Look for an expression. */
6245 /* Compute its typeid. */
6247 /* Look for the `)' token. */
6249 }
6250 /* Restore the saved message. */
6252 /* `typeid' may not appear in an integral constant expression. */
6255 }
6259 {
6260 tree type;
6261 /* The syntax permitted here is the same permitted for an
6262 elaborated-type-specifier. */
6269 }
6273 {
6277 {
6282 }
6284 {
6289 }
6290 else
6291 {
6292 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6295 }
6297 postfix_expression =
6301 {
6305 }
6307 {
6312 }
6313 else
6314 {
6316 postfix_expression);
6320 }
6322 }
6325 {
6328 tree p;
6342 tf_warning_or_error);
6345 tf_warning_or_error);
6346 else
6347 {
6351 }
6353 }
6356 {
6357 tree type;
6359 /* If the next thing is a simple-type-specifier, we may be
6360 looking at a functional cast. We could also be looking at
6361 an id-expression. So, we try the functional cast, and if
6362 that doesn't work we fall back to the primary-expression. */
6364 /* Look for the simple-type-specifier. */
6368 CP_PARSER_FLAGS_NONE);
6370 /* Parse the cast itself. */
6372 postfix_expression
6374 /* If that worked, we're done. */
6378 /* If the functional-cast didn't work out, try a
6379 compound-literal. */
6382 {
6387 /* Avoid calling cp_parser_type_id pointlessly, see comment
6388 in cp_parser_cast_expression about c++/29234. */
6391 else
6392 {
6393 /* Parse the type. */
6398 /* Look for the `)'. */
6400 }
6402 /* If things aren't going well, there's no need to
6403 keep going. */
6405 {
6407 /* Parse the brace-enclosed initializer list. */
6410 }
6411 /* If that worked, we're definitely looking at a
6412 compound-literal expression. */
6414 {
6415 /* Warn the user that a compound literal is not
6416 allowed in standard C++. */
6419 /* For simplicity, we disallow compound literals in
6420 constant-expressions. We could
6421 allow compound literals of integer type, whose
6422 initializer was a constant, in constant
6423 expressions. Permitting that usage, as a further
6424 extension, would not change the meaning of any
6425 currently accepted programs. (Of course, as
6426 compound literals are not part of ISO C++, the
6427 standard has nothing to say.) */
6429 NIC_NCC))
6430 {
6433 }
6434 /* Form the representation of the compound-literal. */
6435 postfix_expression
6437 tf_warning_or_error);
6439 }
6440 }
6442 /* It must be a primary-expression. */
6443 postfix_expression
6446 decltype_p,
6448 }
6450 }
6452 /* Note that we don't need to worry about calling build_cplus_new on a
6453 class-valued CALL_EXPR in decltype when it isn't the end of the
6454 postfix-expression; unary_complex_lvalue will take care of that for
6455 all these cases. */
6457 /* Keep looping until the postfix-expression is complete. */
6459 {
6463 /* It is not a Koenig lookup function call. */
6464 postfix_expression
6467 /* Peek at the next token. */
6471 {
6474 {
6476 "two consecutive %<[%> shall "
6479 }
6480 postfix_expression
6482 postfix_expression,
6484 decltype_p);
6490 /* postfix-expression ( expression-list [opt] ) */
6491 {
6501 is_builtin_constant_p
6504 {
6505 /* The whole point of __builtin_constant_p is to allow
6506 non-constant expressions to appear as arguments. */
6507 saved_integral_constant_expression_p
6509 saved_non_integral_constant_expression_p
6512 }
6513 args = (cp_parser_parenthesized_expression_list
6518 {
6519 parser->integral_constant_expression_p
6521 parser->non_integral_constant_expression_p
6523 }
6526 {
6529 }
6531 /* Function calls are not permitted in
6532 constant-expressions. */
6535 NIC_FUNC_CALL))
6536 {
6540 }
6545 {
6547 {
6549 {
6552 postfix_expression
6554 complain);
6555 }
6556 else
6557 postfix_expression
6559 }
6560 /* We do not perform argument-dependent lookup if
6561 normal lookup finds a non-function, in accordance
6562 with the expected resolution of DR 218. */
6565 {
6569 /* Do not do argument dependent lookup if regular
6570 lookup finds a member function or a block-scope
6571 function declaration. [basic.lookup.argdep]/3 */
6574 {
6577 postfix_expression
6579 complain);
6580 }
6581 }
6582 }
6585 {
6595 "%<memset%> used with constant zero length "
6596 "parameter; this could be due to transposed "
6598 }
6601 {
6611 {
6612 postfix_expression
6616 }
6619 {
6620 postfix_expression
6621 = (build_new_method_call
6627 complain));
6628 }
6629 else
6630 postfix_expression
6634 complain);
6635 }
6639 postfix_expression = (build_offset_ref_call_from_tree
6641 complain));
6643 /* A call to a static class member, or a namespace-scope
6644 function. */
6645 postfix_expression
6648 koenig_p,
6649 complain);
6650 else
6651 /* All other function calls. */
6652 postfix_expression
6655 koenig_p,
6656 complain);
6660 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6664 }
6669 /* postfix-expression . template [opt] id-expression
6670 postfix-expression . pseudo-destructor-name
6671 postfix-expression -> template [opt] id-expression
6672 postfix-expression -> pseudo-destructor-name */
6674 /* Consume the `.' or `->' operator. */
6677 postfix_expression
6679 postfix_expression,
6686 /* postfix-expression ++ */
6687 /* Consume the `++' token. */
6689 /* Generate a representation for the complete expression. */
6690 postfix_expression
6692 POSTINCREMENT_EXPR);
6693 /* Increments may not appear in constant-expressions. */
6701 /* postfix-expression -- */
6702 /* Consume the `--' token. */
6704 /* Generate a representation for the complete expression. */
6705 postfix_expression
6707 POSTDECREMENT_EXPR);
6708 /* Decrements may not appear in constant-expressions. */
6720 else
6722 }
6723 }
6725 /* We should never get here. */
6728 }
6730 /* This function parses Cilk Plus array notations. If a normal array expr. is
6731 parsed then the array index is passed back to the caller through *INIT_INDEX
6732 and the function returns a NULL_TREE. If array notation expr. is parsed,
6733 then *INIT_INDEX is ignored by the caller and the function returns
6734 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6735 error_mark_node. */
6737 static tree
6739 tree array_value)
6740 {
6744 {
6747 }
6756 {
6759 }
6761 {
6762 /* Consume the ':'. */
6765 /* If we are here, then we have a case like this A[:]. */
6767 {
6771 }
6775 }
6776 else
6777 {
6778 /* If we are here, then there are three valid possibilities:
6779 1. ARRAY [ EXP ]
6780 2. ARRAY [ EXP : EXP ]
6781 3. ARRAY [ EXP : EXP : EXP ] */
6785 {
6786 /* This indicates that we have a normal array expression. */
6789 }
6791 /* Consume the ':'. */
6795 {
6798 }
6799 }
6804 {
6808 }
6814 }
6816 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6817 by cp_parser_builtin_offsetof. We're looking for
6819 postfix-expression [ expression ]
6820 postfix-expression [ braced-init-list ] (C++11)
6822 FOR_OFFSETOF is set if we're being called in that context, which
6823 changes how we deal with integer constant expressions. */
6825 static tree
6827 tree postfix_expression,
6830 {
6835 /* Consume the `[' token. */
6841 /* Parse the index expression. */
6842 /* ??? For offsetof, there is a question of what to allow here. If
6843 offsetof is not being used in an integral constant expression context,
6844 then we *could* get the right answer by computing the value at runtime.
6845 If we are in an integral constant expression context, then we might
6846 could accept any constant expression; hard to say without analysis.
6847 Rather than open the barn door too wide right away, allow only integer
6848 constant expressions here. */
6851 else
6852 {
6854 {
6861 {
6863 "braced list index is not allowed with array "
6867 }
6868 }
6870 {
6871 /* Here are have these two options:
6872 ARRAY[EXP : EXP] - Array notation expr with default
6873 stride of 1.
6874 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6875 stride. */
6877 postfix_expression);
6880 }
6881 else
6883 }
6887 /* Look for the closing `]'. */
6890 /* Build the ARRAY_REF. */
6894 /* When not doing offsetof, array references are not permitted in
6895 constant-expressions. */
6901 }
6903 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6904 by cp_parser_builtin_offsetof. We're looking for
6906 postfix-expression . template [opt] id-expression
6907 postfix-expression . pseudo-destructor-name
6908 postfix-expression -> template [opt] id-expression
6909 postfix-expression -> pseudo-destructor-name
6911 FOR_OFFSETOF is set if we're being called in that context. That sorta
6912 limits what of the above we'll actually accept, but nevermind.
6913 TOKEN_TYPE is the "." or "->" token, which will already have been
6914 removed from the stream. */
6916 static tree
6919 tree postfix_expression,
6921 location_t location)
6922 {
6923 tree name;
6928 /* If this is a `->' operator, dereference the pointer. */
6931 tf_warning_or_error);
6932 /* Check to see whether or not the expression is type-dependent. */
6934 /* The identifier following the `->' or `.' is not qualified. */
6940 /* Enter the scope corresponding to the type of the object
6941 given by the POSTFIX_EXPRESSION. */
6943 {
6945 /* According to the standard, no expression should ever have
6946 reference type. Unfortunately, we do not currently match
6947 the standard in this respect in that our internal representation
6948 of an expression may have reference type even when the standard
6949 says it does not. Therefore, we have to manually obtain the
6950 underlying type here. */
6952 /* The type of the POSTFIX_EXPRESSION must be complete. */
6954 {
6956 postfix_expression);
6958 }
6959 /* Unlike the object expression in other contexts, *this is not
6960 required to be of complete type for purposes of class member
6961 access (5.2.5) outside the member function body. */
6965 /* Let the name lookup machinery know that we are processing a
6966 class member access expression. */
6968 /* If something went wrong, we want to be able to discern that case,
6969 as opposed to the case where there was no SCOPE due to the type
6970 of expression being dependent. */
6973 /* If the SCOPE was erroneous, make the various semantic analysis
6974 functions exit quickly -- and without issuing additional error
6975 messages. */
6978 }
6980 /* Assume this expression is not a pseudo-destructor access. */
6983 /* If the SCOPE is a scalar type, then, if this is a valid program,
6984 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6985 is type dependent, it can be pseudo-destructor-name or something else.
6986 Try to parse it as pseudo-destructor-name first. */
6988 {
6989 tree s;
6990 tree type;
6993 /* Parse the pseudo-destructor-name. */
7002 {
7004 postfix_expression
7007 }
7008 }
7011 {
7012 /* If the SCOPE is not a scalar type, we are looking at an
7013 ordinary class member access expression, rather than a
7014 pseudo-destructor-name. */
7017 /* Parse the id-expression. */
7018 name = (cp_parser_id_expression
7025 /* In general, build a SCOPE_REF if the member name is qualified.
7026 However, if the name was not dependent and has already been
7027 resolved; there is no need to build the SCOPE_REF. For example;
7029 struct X { void f(); };
7030 template <typename T> void f(T* t) { t->X::f(); }
7032 Even though "t" is dependent, "X::f" is not and has been resolved
7033 to a BASELINK; there is no need to include scope information. */
7035 /* But we do need to remember that there was an explicit scope for
7036 virtual function calls. */
7040 /* If the name is a template-id that names a type, we will get a
7041 TYPE_DECL here. That is invalid code. */
7043 {
7046 }
7047 else
7048 {
7050 {
7052 {
7056 }
7057 else
7060 name,
7061 template_p);
7065 }
7067 adjust_result_of_qualified_name_lookup
7069 postfix_expression
7071 template_p,
7072 tf_warning_or_error);
7073 }
7074 }
7076 /* We no longer need to look up names in the scope of the object on
7077 the left-hand side of the `.' or `->' operator. */
7080 /* Outside of offsetof, these operators may not appear in
7081 constant-expressions. */
7083 && (cp_parser_non_integral_constant_expression
7088 }
7090 /* Parse a parenthesized expression-list.
7092 expression-list:
7093 assignment-expression
7094 expression-list, assignment-expression
7096 attribute-list:
7097 expression-list
7098 identifier
7099 identifier, expression-list
7101 CAST_P is true if this expression is the target of a cast.
7103 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7104 argument pack.
7106 Returns a vector of trees. Each element is a representation of an
7107 assignment-expression. NULL is returned if the ( and or ) are
7108 missing. An empty, but allocated, vector is returned on no
7109 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7110 if we are parsing an attribute list for an attribute that wants a
7111 plain identifier argument, normal_attr for an attribute that wants
7112 an expression, or non_attr if we aren't parsing an attribute list. If
7113 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7114 not all of the expressions in the list were constant. */
7122 {
7128 /* Assume all the expressions will be constant. */
7137 /* Within a parenthesized expression, a `>' token is always
7138 the greater-than operator. */
7139 saved_greater_than_is_operator_p
7143 /* Consume expressions until there are no more. */
7146 {
7147 tree expr;
7149 /* At the beginning of attribute lists, check to see if the
7150 next token is an identifier. */
7153 {
7156 /* Consume the identifier. */
7158 /* Save the identifier. */
7160 }
7161 else
7162 {
7165 /* Parse the next assignment-expression. */
7167 {
7168 /* A braced-init-list. */
7174 }
7176 {
7177 expr = (cp_parser_constant_expression
7182 }
7183 else
7185 cast_p);
7190 /* If we have an ellipsis, then this is an expression
7191 expansion. */
7194 {
7195 /* Consume the `...'. */
7198 /* Build the argument pack. */
7200 }
7202 /* Add it to the list. We add error_mark_node
7203 expressions to the list, so that we can still tell if
7204 the correct form for a parenthesized expression-list
7205 is found. That gives better errors. */
7210 }
7212 /* After the first item, attribute lists look the same as
7213 expression lists. */
7216 get_comma:;
7217 /* If the next token isn't a `,', then we are done. */
7221 /* Otherwise, consume the `,' and keep going. */
7223 }
7226 {
7229 skip_comma:;
7230 /* We try and resync to an unnested comma, as that will give the
7231 user better diagnostics. */
7239 {
7240 parser->greater_than_is_operator_p
7243 }
7244 }
7246 parser->greater_than_is_operator_p
7253 }
7255 /* Parse a pseudo-destructor-name.
7257 pseudo-destructor-name:
7258 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7259 :: [opt] nested-name-specifier template template-id :: ~ type-name
7260 :: [opt] nested-name-specifier [opt] ~ type-name
7262 If either of the first two productions is used, sets *SCOPE to the
7263 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7264 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7265 or ERROR_MARK_NODE if the parse fails. */
7267 static void
7269 tree object,
7272 {
7275 /* Handle ~auto. */
7279 {
7282 "%<~auto%> only available with "
7289 }
7291 /* Assume that things will not work out. */
7294 /* Look for the optional `::' operator. */
7296 /* Look for the optional nested-name-specifier. */
7297 nested_name_specifier_p
7304 /* Now, if we saw a nested-name-specifier, we might be doing the
7305 second production. */
7308 {
7309 /* Consume the `template' keyword. */
7311 /* Parse the template-id. */
7315 class_type,
7317 /* Look for the `::' token. */
7319 }
7320 /* If the next token is not a `~', then there might be some
7321 additional qualification. */
7323 {
7324 /* At this point, we're looking for "type-name :: ~". The type-name
7325 must not be a class-name, since this is a pseudo-destructor. So,
7326 it must be either an enum-name, or a typedef-name -- both of which
7327 are just identifiers. So, we peek ahead to check that the "::"
7328 and "~" tokens are present; if they are not, then we can avoid
7329 calling type_name. */
7333 {
7336 }
7338 /* Look for the type-name. */
7343 /* Look for the `::' token. */
7345 }
7346 else
7349 /* Look for the `~'. */
7352 /* Once we see the ~, this has to be a pseudo-destructor. */
7356 /* Look for the type-name again. We are not responsible for
7357 checking that it matches the first type-name. */
7359 }
7361 /* Parse a unary-expression.
7363 unary-expression:
7364 postfix-expression
7365 ++ cast-expression
7366 -- cast-expression
7367 unary-operator cast-expression
7368 sizeof unary-expression
7369 sizeof ( type-id )
7370 alignof ( type-id ) [C++0x]
7371 new-expression
7372 delete-expression
7374 GNU Extensions:
7376 unary-expression:
7377 __extension__ cast-expression
7378 __alignof__ unary-expression
7379 __alignof__ ( type-id )
7380 alignof unary-expression [C++0x]
7381 __real__ cast-expression
7382 __imag__ cast-expression
7383 && identifier
7384 sizeof ( type-id ) { initializer-list , [opt] }
7385 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7386 __alignof__ ( type-id ) { initializer-list , [opt] }
7388 ADDRESS_P is true iff the unary-expression is appearing as the
7389 operand of the `&' operator. CAST_P is true if this expression is
7390 the target of a cast.
7392 Returns a representation of the expression. */
7394 static tree
7397 {
7401 /* Peek at the next token. */
7403 /* Some keywords give away the kind of expression. */
7405 {
7409 {
7412 {
7415 location_t first_loc;
7418 /* Consume the token. */
7421 /* Parse the operand. */
7426 else
7427 {
7428 /* ISO C++ defines alignof only with types, not with
7429 expressions. So pedwarn if alignof is used with a non-
7430 type expression. However, __alignof__ is ok. */
7433 "ISO C++ does not allow %<alignof%> "
7437 }
7438 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7439 SIZEOF_EXPR with the original operand. */
7441 {
7443 {
7445 {
7448 error_mark_node));
7450 }
7451 else
7455 }
7457 }
7459 }
7468 {
7469 /* The saved value of the PEDANTIC flag. */
7471 tree expr;
7473 /* Save away the PEDANTIC flag. */
7475 /* Parse the cast-expression. */
7477 /* Restore the PEDANTIC flag. */
7481 }
7485 {
7486 tree expression;
7488 /* Consume the `__real__' or `__imag__' token. */
7490 /* Parse the cast-expression. */
7492 /* Create the complete representation. */
7496 expression,
7497 tf_warning_or_error);
7498 }
7506 {
7507 tree expr;
7517 parser->type_definition_forbidden_message
7520 saved_integral_constant_expression_p
7522 saved_non_integral_constant_expression_p
7526 saved_greater_than_is_operator_p
7538 parser->greater_than_is_operator_p
7541 parser->integral_constant_expression_p
7543 parser->non_integral_constant_expression_p
7550 }
7554 }
7555 }
7557 /* Look for the `:: new' and `:: delete', which also signal the
7558 beginning of a new-expression, or delete-expression,
7559 respectively. If the next token is `::', then it might be one of
7560 these. */
7562 {
7565 /* See if the token after the `::' is one of the keywords in
7566 which we're interested. */
7568 /* If it's `new', we have a new-expression. */
7571 /* Similarly, for `delete'. */
7574 }
7576 /* Look for a unary operator. */
7578 /* The `++' and `--' operators can be handled similarly, even though
7579 they are not technically unary-operators in the grammar. */
7581 {
7586 /* Handle the GNU address-of-label extension. */
7589 {
7590 tree identifier;
7591 tree expression;
7594 /* Consume the '&&' token. */
7596 /* Look for the identifier. */
7598 /* Create an expression representing the address. */
7601 NIC_ADDR_LABEL))
7604 }
7605 }
7607 {
7608 tree cast_expression;
7614 /* Consume the operator token. */
7618 /* Parse the cast-expression. */
7619 cast_expression
7624 pidk);
7625 /* Now, build an appropriate representation. */
7627 {
7631 RO_UNARY_STAR,
7632 complain);
7637 /* Fall through. */
7640 cast_expression,
7641 complain);
7648 /* Fall through. */
7650 /* Immediately fold negation of a constant, unless the constant is 0
7651 (since -0 == 0) or it would overflow. */
7656 {
7659 cast_expression);
7661 {
7664 }
7665 }
7666 /* Fall through. */
7675 }
7679 non_constant_p))
7683 }
7687 decltype_p,
7688 pidk);
7689 }
7691 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7692 unary-operator, the corresponding tree code is returned. */
7694 static enum tree_code
7696 {
7698 {
7719 }
7720 }
7722 /* Parse a new-expression.
7724 new-expression:
7725 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7726 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7728 Returns a representation of the expression. */
7730 static tree
7732 {
7735 tree type;
7738 tree ret;
7740 /* Look for the optional `::' operator. */
7741 global_scope_p
7745 /* Look for the `new' operator. */
7747 /* There's no easy way to tell a new-placement from the
7748 `( type-id )' construct. */
7750 /* Look for a new-placement. */
7752 /* If that didn't work out, there's no new-placement. */
7754 {
7758 }
7760 /* If the next token is a `(', then we have a parenthesized
7761 type-id. */
7763 {
7767 /* Consume the `('. */
7770 /* Parse the type-id. */
7771 parser->type_definition_forbidden_message
7776 /* Look for the closing `)'. */
7779 /* There should not be a direct-new-declarator in this production,
7780 but GCC used to allowed this, so we check and emit a sensible error
7781 message for this case. */
7783 {
7789 }
7790 }
7791 /* Otherwise, there must be a new-type-id. */
7792 else
7795 /* If the next token is a `(' or '{', then we have a new-initializer. */
7800 else
7803 /* A new-expression may not appear in an integral constant
7804 expression. */
7807 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
7808 of a new-type-id or type-id of a new-expression, the new-expression shall
7809 contain a new-initializer of the form ( assignment-expression )".
7810 Additionally, consistently with the spirit of DR 1467, we want to accept
7811 'new auto { 2 }' too. */
7816 {
7818 "initialization of new-expression for type %<auto%> "
7821 }
7822 else
7823 {
7824 /* Create a representation of the new-expression. */
7826 tf_warning_or_error);
7827 }
7835 }
7837 /* Parse a new-placement.
7839 new-placement:
7840 ( expression-list )
7842 Returns the same representation as for an expression-list. */
7846 {
7849 /* Parse the expression-list. */
7850 expression_list = (cp_parser_parenthesized_expression_list
7859 }
7861 /* Parse a new-type-id.
7863 new-type-id:
7864 type-specifier-seq new-declarator [opt]
7866 Returns the TYPE allocated. If the new-type-id indicates an array
7867 type, *NELTS is set to the number of elements in the last array
7868 bound; the TYPE will not include the last array bound. */
7870 static tree
7872 {
7873 cp_decl_specifier_seq type_specifier_seq;
7879 /* The type-specifier sequence must not contain type definitions.
7880 (It cannot contain declarations of new types either, but if they
7881 are not definitions we will catch that because they are not
7882 complete.) */
7884 parser->type_definition_forbidden_message
7886 /* Parse the type-specifier-seq. */
7890 /* Restore the old message. */
7896 /* Parse the new-declarator. */
7899 /* Determine the number of elements in the last array dimension, if
7900 any. */
7902 /* Skip down to the last array dimension. */
7907 {
7910 }
7915 {
7918 }
7921 {
7928 else
7930 }
7933 }
7935 /* Parse an (optional) new-declarator.
7937 new-declarator:
7938 ptr-operator new-declarator [opt]
7939 direct-new-declarator
7941 Returns the declarator. */
7945 {
7948 cp_cv_quals cv_quals;
7950 /* We don't know if there's a ptr-operator next, or not. */
7952 /* Look for a ptr-operator. */
7954 /* If that worked, look for more new-declarators. */
7956 {
7959 /* Parse another optional declarator. */
7962 declarator = cp_parser_make_indirect_declarator
7966 }
7968 /* If the next token is a `[', there is a direct-new-declarator. */
7973 }
7975 /* Parse a direct-new-declarator.
7977 direct-new-declarator:
7978 [ expression ]
7979 direct-new-declarator [constant-expression]
7981 */
7985 {
7989 {
7990 tree expression;
7993 /* Look for the opening `['. */
7998 /* The standard requires that the expression have integral
7999 type. DR 74 adds enumeration types. We believe that the
8000 real intent is that these expressions be handled like the
8001 expression in a `switch' condition, which also allows
8002 classes with a single conversion to integral or
8003 enumeration type. */
8005 {
8006 expression
8008 expression,
8011 {
8013 "expression in new-declarator must have integral "
8016 }
8017 }
8019 /* Look for the closing `]'. */
8022 /* Add this bound to the declarator. */
8025 /* If the next token is not a `[', then there are no more
8026 bounds. */
8029 }
8032 }
8034 /* Parse a new-initializer.
8036 new-initializer:
8037 ( expression-list [opt] )
8038 braced-init-list
8040 Returns a representation of the expression-list. */
8044 {
8048 {
8049 tree t;
8056 }
8057 else
8058 expression_list = (cp_parser_parenthesized_expression_list
8064 }
8066 /* Parse a delete-expression.
8068 delete-expression:
8069 :: [opt] delete cast-expression
8070 :: [opt] delete [ ] cast-expression
8072 Returns a representation of the expression. */
8074 static tree
8076 {
8079 tree expression;
8081 /* Look for the optional `::' operator. */
8082 global_scope_p
8086 /* Look for the `delete' keyword. */
8088 /* See if the array syntax is in use. */
8090 {
8091 /* Consume the `[' token. */
8093 /* Look for the `]' token. */
8095 /* Remember that this is the `[]' construct. */
8097 }
8098 else
8101 /* Parse the cast-expression. */
8104 /* A delete-expression may not appear in an integral constant
8105 expression. */
8110 tf_warning_or_error);
8111 }
8113 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8114 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8115 0 otherwise. */
8117 static int
8119 {
8122 {
8164 /* In ((type ()) () the last () isn't a valid cast-expression,
8165 so the whole must be parsed as postfix-expression. */
8170 /* '[' may start a primary-expression in obj-c++ and in C++11,
8171 as a lambda-expression, eg, '(void)[]{}'. */
8178 /* '++' and '--' may or may not start a cast-expression:
8180 struct T { void operator++(int); };
8181 void f() { (T())++; }
8183 vs
8185 int a;
8186 (int)++a; */
8191 }
8192 }
8194 /* Parse a cast-expression.
8196 cast-expression:
8197 unary-expression
8198 ( type-id ) cast-expression
8200 ADDRESS_P is true iff the unary-expression is appearing as the
8201 operand of the `&' operator. CAST_P is true if this expression is
8202 the target of a cast.
8204 Returns a representation of the expression. */
8206 static tree
8209 {
8210 /* If it's a `(', then we might be looking at a cast. */
8212 {
8218 /* There's no way to know yet whether or not this is a cast.
8219 For example, `(int (3))' is a unary-expression, while `(int)
8220 3' is a cast. So, we resort to parsing tentatively. */
8222 /* Types may not be defined in a cast. */
8224 parser->type_definition_forbidden_message
8226 /* Consume the `('. */
8228 /* A very tricky bit is that `(struct S) { 3 }' is a
8229 compound-literal (which we permit in C++ as an extension).
8230 But, that construct is not a cast-expression -- it is a
8231 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8232 is legal; if the compound-literal were a cast-expression,
8233 you'd need an extra set of parentheses.) But, if we parse
8234 the type-id, and it happens to be a class-specifier, then we
8235 will commit to the parse at that point, because we cannot
8236 undo the action that is done when creating a new class. So,
8237 then we cannot back up and do a postfix-expression.
8239 Another tricky case is the following (c++/29234):
8241 struct S { void operator () (); };
8243 void foo ()
8244 {
8245 ( S()() );
8246 }
8248 As a type-id we parse the parenthesized S()() as a function
8249 returning a function, groktypename complains and we cannot
8250 back up in this case either.
8252 Therefore, we scan ahead to the closing `)', and check to see
8253 if the tokens after the `)' can start a cast-expression. Otherwise
8254 we are dealing with an unary-expression, a postfix-expression
8255 or something else.
8257 Yet another tricky case, in C++11, is the following (c++/54891):
8259 (void)[]{};
8261 The issue is that usually, besides the case of lambda-expressions,
8262 the parenthesized type-id cannot be followed by '[', and, eg, we
8263 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8264 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8265 we don't commit, we try a cast-expression, then an unary-expression.
8267 Save tokens so that we can put them back. */
8270 /* We may be looking at a cast-expression. */
8273 cast_expression
8276 /* Roll back the tokens we skipped. */
8278 /* If we aren't looking at a cast-expression, simulate an error so
8279 that the call to cp_parser_error_occurred below returns true. */
8282 else
8283 {
8286 /* Look for the type-id. */
8288 /* Look for the closing `)'. */
8291 }
8293 /* Restore the saved message. */
8296 /* At this point this can only be either a cast or a
8297 parenthesized ctor such as `(T ())' that looks like a cast to
8298 function returning T. */
8300 {
8301 /* Only commit if the cast-expression doesn't start with
8302 '++', '--', or '[' in C++11. */
8310 pidk);
8313 {
8314 /* Warn about old-style casts, if so requested. */
8321 /* Only type conversions to integral or enumeration types
8322 can be used in constant-expressions. */
8325 NIC_CAST))
8328 /* Perform the cast. */
8331 }
8332 }
8333 else
8335 }
8337 /* If we get here, then it's not a cast, so it must be a
8338 unary-expression. */
8341 }
8343 /* Parse a binary expression of the general form:
8345 pm-expression:
8346 cast-expression
8347 pm-expression .* cast-expression
8348 pm-expression ->* cast-expression
8350 multiplicative-expression:
8351 pm-expression
8352 multiplicative-expression * pm-expression
8353 multiplicative-expression / pm-expression
8354 multiplicative-expression % pm-expression
8356 additive-expression:
8357 multiplicative-expression
8358 additive-expression + multiplicative-expression
8359 additive-expression - multiplicative-expression
8361 shift-expression:
8362 additive-expression
8363 shift-expression << additive-expression
8364 shift-expression >> additive-expression
8366 relational-expression:
8367 shift-expression
8368 relational-expression < shift-expression
8369 relational-expression > shift-expression
8370 relational-expression <= shift-expression
8371 relational-expression >= shift-expression
8373 GNU Extension:
8375 relational-expression:
8376 relational-expression <? shift-expression
8377 relational-expression >? shift-expression
8379 equality-expression:
8380 relational-expression
8381 equality-expression == relational-expression
8382 equality-expression != relational-expression
8384 and-expression:
8385 equality-expression
8386 and-expression & equality-expression
8388 exclusive-or-expression:
8389 and-expression
8390 exclusive-or-expression ^ and-expression
8392 inclusive-or-expression:
8393 exclusive-or-expression
8394 inclusive-or-expression | exclusive-or-expression
8396 logical-and-expression:
8397 inclusive-or-expression
8398 logical-and-expression && inclusive-or-expression
8400 logical-or-expression:
8401 logical-and-expression
8402 logical-or-expression || logical-and-expression
8404 All these are implemented with a single function like:
8406 binary-expression:
8407 simple-cast-expression
8408 binary-expression <token> binary-expression
8410 CAST_P is true if this expression is the target of a cast.
8412 The binops_by_token map is used to get the tree codes for each <token> type.
8413 binary-expressions are associated according to a precedence table. */
8415 #define TOKEN_PRECEDENCE(token) \
8416 (((token->type == CPP_GREATER \
8417 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8418 && !parser->greater_than_is_operator_p) \
8419 ? PREC_NOT_OPERATOR \
8420 : binops_by_token[token->type].prec)
8422 static tree
8428 {
8429 cp_parser_expression_stack stack;
8431 cp_parser_expression_stack_entry current;
8432 tree rhs;
8436 tree overload;
8438 /* Parse the first expression. */
8449 {
8450 /* Get an operator token. */
8456 {
8458 "%<>>%> operator is treated"
8462 }
8467 /* This is a fold-expression; handle it later. */
8470 /* Popping an entry off the stack means we completed a subexpression:
8471 - either we found a token which is not an operator (`>' where it is not
8472 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8473 will happen repeatedly;
8474 - or, we found an operator which has lower priority. This is the case
8475 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8476 parsing `3 * 4'. */
8478 {
8481 else
8483 }
8485 get_rhs:
8489 /* We used the operator token. */
8492 /* For "false && x" or "true || x", x will never be executed;
8493 disable warnings while evaluating it. */
8495 c_inhibit_evaluation_warnings +=
8498 c_inhibit_evaluation_warnings +=
8501 /* Extract another operand. It may be the RHS of this expression
8502 or the LHS of a new, higher priority expression. */
8507 /* Get another operator token. Look up its precedence to avoid
8508 building a useless (immediately popped) stack entry for common
8509 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8516 {
8517 /* ... and prepare to parse the RHS of the new, higher priority
8518 expression. Since precedence levels on the stack are
8519 monotonically increasing, we do not have to care about
8520 stack overflows. */
8529 pop:
8531 /* If the stack is not empty, we have parsed into LHS the right side
8532 (`4' in the example above) of an expression we had suspended.
8533 We can use the information on the stack to recover the LHS (`3')
8534 from the stack together with the tree code (`MULT_EXPR'), and
8535 the precedence of the higher level subexpression
8536 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8537 which will be used to actually build the additive expression. */
8542 }
8544 /* Undo the disabling of warnings done above. */
8546 c_inhibit_evaluation_warnings -=
8549 c_inhibit_evaluation_warnings -=
8555 /* Avoid warning for !!x == y. */
8560 /* Avoid warning for !b == y where b is boolean. */
8564 /* Avoid warning for !!b == y where b is boolean. */
8572 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8573 ERROR_MARK for everything that is not a binary expression.
8574 This makes warn_about_parentheses miss some warnings that
8575 involve unary operators. For unary expressions we should
8576 pass the correct tree_code unless the unary expression was
8577 surrounded by parentheses.
8578 */
8584 == tcc_comparison
8587 else
8595 /* If the binary operator required the use of an overloaded operator,
8596 then this expression cannot be an integral constant-expression.
8597 An overloaded operator can be used even if both operands are
8598 otherwise permissible in an integral constant-expression if at
8599 least one of the operands is of enumeration type. */
8603 NIC_OVERLOADED))
8605 }
8608 }
8610 static tree
8615 {
8618 }
8620 /* Parse the `? expression : assignment-expression' part of a
8621 conditional-expression. The LOGICAL_OR_EXPR is the
8622 logical-or-expression that started the conditional-expression.
8623 Returns a representation of the entire conditional-expression.
8625 This routine is used by cp_parser_assignment_expression.
8627 ? expression : assignment-expression
8629 GNU Extensions:
8631 ? : assignment-expression */
8633 static tree
8635 {
8637 tree assignment_expr;
8641 /* Consume the `?' token. */
8646 {
8649 /* Implicit true clause. */
8651 c_inhibit_evaluation_warnings +=
8654 }
8655 else
8656 {
8659 /* Parse the expression. */
8660 c_inhibit_evaluation_warnings +=
8663 c_inhibit_evaluation_warnings +=
8667 }
8669 /* The next token should be a `:'. */
8671 /* Parse the assignment-expression. */
8673 c_inhibit_evaluation_warnings -=
8676 /* Build the conditional-expression. */
8678 expr,
8679 assignment_expr,
8680 tf_warning_or_error);
8681 }
8683 /* Parse an assignment-expression.
8685 assignment-expression:
8686 conditional-expression
8687 logical-or-expression assignment-operator assignment_expression
8688 throw-expression
8690 CAST_P is true if this expression is the target of a cast.
8691 DECLTYPE_P is true if this expression is the operand of decltype.
8693 Returns a representation for the expression. */
8695 static tree
8698 {
8699 tree expr;
8701 /* If the next token is the `throw' keyword, then we're looking at
8702 a throw-expression. */
8705 /* Otherwise, it must be that we are looking at a
8706 logical-or-expression. */
8707 else
8708 {
8709 /* Parse the binary expressions (logical-or-expression). */
8711 decltype_p,
8713 /* If the next token is a `?' then we're actually looking at a
8714 conditional-expression. */
8717 else
8718 {
8721 /* If it's an assignment-operator, we're using the second
8722 production. */
8723 enum tree_code assignment_operator
8726 {
8728 location_t saved_input_location;
8730 /* Parse the right-hand side of the assignment. */
8736 /* An assignment may not appear in a
8737 constant-expression. */
8739 NIC_ASSIGNMENT))
8741 /* Build the assignment expression. Its default
8742 location is the location of the '=' token. */
8746 assignment_operator,
8747 rhs,
8750 }
8751 }
8752 }
8755 }
8757 /* Parse an (optional) assignment-operator.
8759 assignment-operator: one of
8760 = *= /= %= += -= >>= <<= &= ^= |=
8762 GNU Extension:
8764 assignment-operator: one of
8765 <?= >?=
8767 If the next token is an assignment operator, the corresponding tree
8768 code is returned, and the token is consumed. For example, for
8769 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8770 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8771 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8772 operator, ERROR_MARK is returned. */
8774 static enum tree_code
8776 {
8780 /* Peek at the next token. */
8784 {
8830 /* Nothing else is an assignment operator. */
8832 }
8834 /* An operator followed by ... is a fold-expression, handled elsewhere. */
8839 /* If it was an assignment operator, consume it. */
8844 }
8846 /* Parse an expression.
8848 expression:
8849 assignment-expression
8850 expression , assignment-expression
8852 CAST_P is true if this expression is the target of a cast.
8853 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8854 except possibly parenthesized or on the RHS of a comma (N3276).
8856 Returns a representation of the expression. */
8858 static tree
8861 {
8866 {
8867 tree assignment_expression;
8869 /* Parse the next assignment-expression. */
8870 assignment_expression
8873 /* We don't create a temporary for a call that is the immediate operand
8874 of decltype or on the RHS of a comma. But when we see a comma, we
8875 need to create a temporary for a call on the LHS. */
8880 assignment_expression
8884 /* If this is the first assignment-expression, we can just
8885 save it away. */
8888 else
8890 assignment_expression,
8892 /* If the next token is not a comma, or we're in a fold-expression, then
8893 we are done with the expression. */
8897 /* Consume the `,'. */
8900 /* A comma operator cannot appear in a constant-expression. */
8903 }
8906 }
8908 /* Parse a constant-expression.
8910 constant-expression:
8911 conditional-expression
8913 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8914 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8915 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8916 is false, NON_CONSTANT_P should be NULL. */
8918 static tree
8922 {
8926 tree expression;
8928 /* It might seem that we could simply parse the
8929 conditional-expression, and then check to see if it were
8930 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8931 one that the compiler can figure out is constant, possibly after
8932 doing some simplifications or optimizations. The standard has a
8933 precise definition of constant-expression, and we must honor
8934 that, even though it is somewhat more restrictive.
8936 For example:
8938 int i[(2, 3)];
8940 is not a legal declaration, because `(2, 3)' is not a
8941 constant-expression. The `,' operator is forbidden in a
8942 constant-expression. However, GCC's constant-folding machinery
8943 will fold this operation to an INTEGER_CST for `3'. */
8945 /* Save the old settings. */
8947 saved_allow_non_integral_constant_expression_p
8950 /* We are now parsing a constant-expression. */
8952 parser->allow_non_integral_constant_expression_p
8955 /* Although the grammar says "conditional-expression", we parse an
8956 "assignment-expression", which also permits "throw-expression"
8957 and the use of assignment operators. In the case that
8958 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8959 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8960 actually essential that we look for an assignment-expression.
8961 For example, cp_parser_initializer_clauses uses this function to
8962 determine whether a particular assignment-expression is in fact
8963 constant. */
8965 /* Restore the old settings. */
8966 parser->integral_constant_expression_p
8968 parser->allow_non_integral_constant_expression_p
8971 {
8972 /* Require an rvalue constant expression here; that's what our
8973 callers expect. Reference constant expressions are handled
8974 separately in e.g. cp_parser_template_argument. */
8979 }
8982 parser->non_integral_constant_expression_p
8986 }
8988 /* Parse __builtin_offsetof.
8990 offsetof-expression:
8991 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8993 offsetof-member-designator:
8994 id-expression
8995 | offsetof-member-designator "." id-expression
8996 | offsetof-member-designator "[" expression "]"
8997 | offsetof-member-designator "->" id-expression */
8999 static tree
9001 {
9004 cp_id_kind dummy;
9007 /* We're about to accept non-integral-constant things, but will
9008 definitely yield an integral constant expression. Save and
9009 restore these values around our local parsing. */
9013 /* Consume the "__builtin_offsetof" token. */
9015 /* Consume the opening `('. */
9017 /* Parse the type-id. */
9020 /* Look for the `,'. */
9024 /* Build the (type *)null that begins the traditional offsetof macro. */
9026 tf_warning_or_error);
9028 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9032 {
9035 {
9037 /* offsetof-member-designator "[" expression "]" */
9043 /* offsetof-member-designator "->" identifier */
9046 /* FALLTHRU */
9049 /* offsetof-member-designator "." identifier */
9057 /* Consume the ")" token. */
9062 /* Error. We know the following require will fail, but
9063 that gives the proper error message. */
9068 }
9069 }
9071 success:
9074 failure:
9079 }
9081 /* Parse a trait expression.
9083 Returns a representation of the expression, the underlying type
9084 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9086 static tree
9088 {
9089 cp_trait_kind kind;
9095 {
9183 }
9185 /* Consume the token. */
9196 {
9203 }
9205 {
9207 {
9211 {
9214 }
9218 }
9219 }
9223 /* Complete the trait expression, which may mean either processing
9224 the trait expr now or saving it for template instantiation. */
9226 {
9235 }
9236 }
9238 /* Lambdas that appear in variable initializer or default argument scope
9239 get that in their mangling, so we need to record it. We might as well
9240 use the count for function and namespace scopes as well. */
9244 {
9245 tree t;
9247 };
9250 static void
9252 {
9253 tree_int ti;
9255 /* Once we're inside a function, we ignore other scopes and just push
9256 the function again so that popping works properly. */
9263 {
9264 /* Don't reset the count if we're still in the same function. */
9267 }
9268 }
9270 static void
9272 {
9275 }
9277 static void
9279 {
9282 {
9285 }
9287 }
9289 /* Parse a lambda expression.
9291 lambda-expression:
9292 lambda-introducer lambda-declarator [opt] compound-statement
9294 Returns a representation of the expression. */
9296 static tree
9298 {
9300 tree type;
9308 {
9310 {
9314 }
9316 }
9318 {
9320 {
9323 }
9325 }
9327 /* We may be in the middle of deferred access check. Disable
9328 it now. */
9339 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9342 /* Now that we've started the type, add the capture fields for any
9343 explicit captures. */
9346 {
9347 /* Inside the class, surrounding template-parameter-lists do not apply. */
9348 unsigned int saved_num_template_parameter_lists
9352 bool fully_implicit_function_template_p
9356 bool auto_is_implicit_function_template_parm_p
9367 /* By virtue of defining a local class, a lambda expression has access to
9368 the private variables of enclosing classes. */
9373 {
9379 }
9381 {
9384 }
9386 /* The capture list was built up in reverse order; fix that now. */
9398 parser->fully_implicit_function_template_p
9402 parser->auto_is_implicit_function_template_parm_p
9404 }
9408 /* This field is only used during parsing of the lambda. */
9411 /* This lambda shouldn't have any proxies left at this point. */
9413 /* And now that we're done, push proxies for an enclosing lambda. */
9418 else
9424 }
9426 /* Parse the beginning of a lambda expression.
9428 lambda-introducer:
9429 [ lambda-capture [opt] ]
9431 LAMBDA_EXPR is the current representation of the lambda expression. */
9433 static void
9435 {
9436 /* Need commas after the first capture. */
9439 /* Eat the leading `['. */
9442 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9450 {
9453 }
9456 {
9458 tree capture_id;
9459 tree capture_init_expr;
9463 enum capture_kind_type
9464 {
9465 BY_COPY,
9466 BY_REFERENCE
9467 };
9471 {
9474 }
9478 else
9481 /* Possibly capture `this'. */
9483 {
9493 explicit_init_p);
9495 }
9497 /* Remember whether we want to capture as a reference or not. */
9499 {
9502 }
9504 /* Get the identifier. */
9509 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9510 delimiters, but I modified this to stop on unnested ']' as well. It
9511 was already changed to stop on unnested '}', so the
9512 "closing_parenthesis" name is no more misleading with my change. */
9513 {
9519 }
9521 /* Find the initializer for this capture. */
9525 {
9527 /* An explicit initializer exists. */
9530 "lambda capture initializers "
9536 {
9539 }
9540 }
9541 else
9542 {
9545 /* Turn the identifier into an id-expression. */
9546 capture_init_expr
9551 {
9554 }
9558 {
9561 capture_init_expr);
9565 }
9568 {
9571 capture_init_expr))
9575 }
9577 capture_init_expr
9578 = finish_id_expression
9580 capture_init_expr,
9594 {
9597 }
9598 else
9600 }
9604 {
9609 capture_id);
9613 "capture of %qD redundant with by-reference capture "
9615 }
9618 capture_id,
9619 capture_init_expr,
9621 explicit_init_p);
9622 }
9625 }
9627 /* Parse the (optional) middle of a lambda expression.
9629 lambda-declarator:
9630 < template-parameter-list [opt] >
9631 ( parameter-declaration-clause [opt] )
9632 attribute-specifier [opt]
9633 mutable [opt]
9634 exception-specification [opt]
9635 lambda-return-type-clause [opt]
9637 LAMBDA_EXPR is the current representation of the lambda expression. */
9639 static bool
9641 {
9642 /* 5.1.1.4 of the standard says:
9643 If a lambda-expression does not include a lambda-declarator, it is as if
9644 the lambda-declarator were ().
9645 This means an empty parameter list, no attributes, and no exception
9646 specification. */
9653 /* The template-parameter-list is optional, but must begin with
9654 an opening angle if present. */
9656 {
9659 "lambda templates are only available with "
9668 /* We just processed one more parameter list. */
9670 }
9672 /* The parameter-declaration-clause is optional (unless
9673 template-parameter-list was given), but must begin with an
9674 opening parenthesis if present. */
9676 {
9681 /* Parse parameters. */
9684 /* Default arguments shall not be specified in the
9685 parameter-declaration-clause of a lambda-declarator. */
9695 /* Parse optional `mutable' keyword. */
9697 {
9700 }
9704 /* Parse optional exception specification. */
9707 /* Parse optional trailing return type. */
9709 {
9713 }
9715 /* The function parameters must be in scope all the way until after the
9716 trailing-return-type in case of decltype. */
9718 }
9722 /* Create the function call operator.
9724 Messing with declarators like this is no uglier than building up the
9725 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9726 other code. */
9727 {
9728 cp_decl_specifier_seq return_type_specs;
9730 tree fco;
9737 else
9738 /* Maybe we will deduce the return type later. */
9744 sfk_none);
9749 VIRT_SPEC_UNSPECIFIED,
9750 REF_QUAL_NONE,
9751 tx_qual,
9752 exception_spec,
9758 declarator,
9759 attributes);
9761 {
9764 /* Give the object parameter a different name. */
9768 }
9770 {
9774 }
9783 }
9784 }
9786 /* Parse the body of a lambda expression, which is simply
9788 compound-statement
9790 but which requires special handling.
9791 LAMBDA_EXPR is the current representation of the lambda expression. */
9793 static void
9795 {
9800 else
9801 /* Still increment function_depth so that we don't GC in the
9802 middle of an expression. */
9806 /* Clear this in case we're in the middle of a default argument. */
9809 /* Finish the function call operator
9810 - class_specifier
9811 + late_parsing_for_member
9812 + function_definition_after_declarator
9813 + ctor_initializer_opt_and_function_body */
9814 {
9816 tree body;
9818 tree compound_stmt;
9819 tree cap;
9821 /* Let the front end know that we are going to be defining this
9822 function. */
9824 NULL_TREE,
9833 /* Push the proxies for any explicit captures. */
9840 /* 5.1.1.4 of the standard says:
9841 If a lambda-expression does not include a trailing-return-type, it
9842 is as if the trailing-return-type denotes the following type:
9843 * if the compound-statement is of the form
9844 { return attribute-specifier [opt] expression ; }
9845 the type of the returned expression after lvalue-to-rvalue
9846 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9847 (_conv.array_ 4.2), and function-to-pointer conversion
9848 (_conv.func_ 4.3);
9849 * otherwise, void. */
9851 /* In a lambda that has neither a lambda-return-type-clause
9852 nor a deducible form, errors should be reported for return statements
9853 in the body. Since we used void as the placeholder return type, parsing
9854 the body as usual will give such desired behavior. */
9858 {
9862 /* Parse tentatively in case there's more after the initial return
9863 statement. */
9874 {
9876 {
9881 }
9883 /* Will get error here if type not deduced yet. */
9887 }
9888 }
9891 {
9896 }
9900 out:
9904 /* Finish the function and generate code for it if necessary. */
9907 /* Only expand if the call op is not a template. */
9910 }
9916 else
9918 }
9920 /* Statements [gram.stmt.stmt] */
9922 /* Parse a statement.
9924 statement:
9925 labeled-statement
9926 expression-statement
9927 compound-statement
9928 selection-statement
9929 iteration-statement
9930 jump-statement
9931 declaration-statement
9932 try-block
9934 C++11:
9936 statement:
9937 labeled-statement
9938 attribute-specifier-seq (opt) expression-statement
9939 attribute-specifier-seq (opt) compound-statement
9940 attribute-specifier-seq (opt) selection-statement
9941 attribute-specifier-seq (opt) iteration-statement
9942 attribute-specifier-seq (opt) jump-statement
9943 declaration-statement
9944 attribute-specifier-seq (opt) try-block
9946 TM Extension:
9948 statement:
9949 atomic-statement
9951 IN_COMPOUND is true when the statement is nested inside a
9952 cp_parser_compound_statement; this matters for certain pragmas.
9954 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9955 is a (possibly labeled) if statement which is not enclosed in braces
9956 and has an else clause. This is used to implement -Wparentheses.
9958 CHAIN is a vector of if-else-if conditions. */
9960 static void
9963 {
9968 restart:
9971 /* There is no statement yet. */
9977 /* In obj-c++, seeing '[[' might be the either the beginning of
9978 c++11 attributes, or a nested objc-message-expression. So
9979 let's parse the c++11 attributes tentatively. */
9983 {
9986 }
9988 /* Peek at the next token. */
9990 /* Remember the location of the first token in the statement. */
9992 /* If this is a keyword, then that will often determine what kind of
9993 statement we have. */
9995 {
9999 {
10002 /* Looks like a labeled-statement with a case label.
10003 Parse the label, and then use tail recursion to parse
10004 the statement. */
10021 {
10026 }
10027 else
10041 {
10046 }
10047 else
10048 {
10052 }
10056 /* Objective-C++ exception-handling constructs. */
10070 /* This must be a namespace alias definition. */
10086 /* It might be a keyword like `int' that can start a
10087 declaration-statement. */
10089 }
10090 }
10092 {
10093 /* If the next token is a `:', then we are looking at a
10094 labeled-statement. */
10097 {
10098 /* Looks like a labeled-statement with an ordinary label.
10099 Parse the label, and then use tail recursion to parse
10100 the statement. */
10104 }
10105 }
10106 /* Anything that starts with a `{' must be a compound-statement. */
10109 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10110 a statement all its own. */
10112 {
10113 /* Only certain OpenMP pragmas are attached to statements, and thus
10114 are considered statements themselves. All others are not. In
10115 the context of a compound, accept the pragma as a "statement" and
10116 return so that we can check for a close brace. Otherwise we
10117 require a real statement and must go back and read one. */
10123 }
10125 {
10128 }
10130 /* Everything else must be a declaration-statement or an
10131 expression-statement. Try for the declaration-statement
10132 first, unless we are looking at a `;', in which case we know that
10133 we have an expression-statement. */
10135 {
10137 {
10139 {
10140 /* Attributes should be parsed as part of the the
10141 declaration, so let's un-parse them. */
10144 }
10147 /* Try to parse the declaration-statement. */
10149 /* If that worked, we're done. */
10152 }
10153 /* Look for an expression-statement instead. */
10155 }
10157 /* Set the line number for the statement. */
10161 /* Note that for now, we don't do anything with c++11 statements
10162 parsed at this level. */
10165 OPT_Wattributes,
10167 }
10169 /* Parse the label for a labeled-statement, i.e.
10171 identifier :
10172 case constant-expression :
10173 default :
10175 GNU Extension:
10176 case constant-expression ... constant-expression : statement
10178 When a label is parsed without errors, the label is added to the
10179 parse tree by the finish_* functions, so this function doesn't
10180 have to return the label. */
10182 static void
10184 {
10189 /* The next token should be an identifier. */
10193 {
10196 }
10200 {
10202 {
10206 /* Consume the `case' token. */
10208 /* Parse the constant-expression. */
10215 {
10216 /* Consume the `...' token. */
10222 /* We don't need to emit warnings here, as the common code
10223 will do this for us. */
10224 }
10225 else
10230 else
10233 expr);
10234 }
10238 /* Consume the `default' token. */
10243 else
10248 /* Anything else must be an ordinary label. */
10251 }
10253 /* Require the `:' token. */
10256 /* An ordinary label may optionally be followed by attributes.
10257 However, this is only permitted if the attributes are then
10258 followed by a semicolon. This is because, for backward
10259 compatibility, when parsing
10260 lab: __attribute__ ((unused)) int i;
10261 we want the attribute to attach to "i", not "lab". */
10264 {
10265 tree attrs;
10272 ;
10273 else
10275 }
10281 }
10283 /* Parse an expression-statement.
10285 expression-statement:
10286 expression [opt] ;
10288 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10289 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10290 indicates whether this expression-statement is part of an
10291 expression statement. */
10293 static tree
10295 {
10299 /* If the next token is a ';', then there is no expression
10300 statement. */
10302 {
10306 {
10309 }
10310 }
10312 /* Give a helpful message for "A<T>::type t;" and the like. */
10315 {
10322 {
10323 /* A::A a; */
10328 }
10329 }
10331 /* Consume the final `;'. */
10336 /* This is the final expression statement of a statement
10337 expression. */
10343 }
10345 /* Parse a compound-statement.
10347 compound-statement:
10348 { statement-seq [opt] }
10350 GNU extension:
10352 compound-statement:
10353 { label-declaration-seq [opt] statement-seq [opt] }
10355 label-declaration-seq:
10356 label-declaration
10357 label-declaration-seq label-declaration
10359 Returns a tree representing the statement. */
10361 static tree
10364 {
10365 tree compound_stmt;
10367 /* Consume the `{'. */
10374 /* Begin the compound-statement. */
10376 /* If the next keyword is `__label__' we have a label declaration. */
10379 /* Parse an (optional) statement-seq. */
10381 /* Finish the compound-statement. */
10383 /* Consume the `}'. */
10387 }
10389 /* Parse an (optional) statement-seq.
10391 statement-seq:
10392 statement
10393 statement-seq [opt] statement */
10395 static void
10397 {
10398 /* Scan statements until there aren't any more. */
10400 {
10403 /* If we are looking at a `}', then we have run out of
10404 statements; the same is true if we have reached the end
10405 of file, or have stumbled upon a stray '@end'. */
10412 /* If we are in a compound statement and find 'else' then
10413 something went wrong. */
10415 {
10418 else
10419 {
10422 }
10423 }
10425 /* Parse the statement. */
10427 }
10428 }
10430 /* Parse a selection-statement.
10432 selection-statement:
10433 if ( condition ) statement
10434 if ( condition ) statement else statement
10435 switch ( condition ) statement
10437 Returns the new IF_STMT or SWITCH_STMT.
10439 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10440 is a (possibly labeled) if statement which is not enclosed in
10441 braces and has an else clause. This is used to implement
10442 -Wparentheses.
10444 CHAIN is a vector of if-else-if conditions. This is used to implement
10445 -Wduplicated-cond. */
10447 static tree
10450 {
10453 token_indent_info guard_tinfo;
10458 /* Peek at the next token. */
10462 /* See what kind of keyword it is. */
10465 {
10468 {
10469 tree statement;
10470 tree condition;
10472 /* Look for the `('. */
10474 {
10477 }
10479 /* Begin the selection-statement. */
10482 else
10485 /* Parse the condition. */
10487 /* Look for the `)'. */
10493 {
10497 /* Add the condition. */
10504 /* Parse the then-clause. */
10508 guard_tinfo);
10513 /* If the next token is `else', parse the else-clause. */
10515 RID_ELSE))
10516 {
10517 guard_tinfo
10519 /* Consume the `else' keyword. */
10522 {
10524 RID_IF)
10526 {
10527 /* We've got "if (COND) else if (COND2)". Start
10528 the condition chain and add COND as the first
10529 element. */
10533 {
10534 /* Wrap it in a NOP_EXPR so that we can set the
10535 location of the condition. */
10537 condition);
10540 }
10541 }
10543 RID_IF))
10544 {
10545 /* This is if-else without subsequent if. Zap the
10546 condition chain; we would have already warned at
10547 this point. */
10550 }
10551 }
10553 /* Parse the else-clause. */
10559 /* If we are currently parsing a then-clause, then
10560 IF_P will not be NULL. We set it to true to
10561 indicate that this if statement has an else clause.
10562 This may trigger the Wparentheses warning below
10563 when we get back up to the parent if statement. */
10566 }
10567 else
10568 {
10569 /* This if statement does not have an else clause. If
10570 NESTED_IF is true, then the then-clause is an if
10571 statement which does have an else clause. We warn
10572 about the potential ambiguity. */
10575 "suggest explicit braces to avoid ambiguous"
10578 {
10579 /* We don't need the condition chain anymore. */
10582 }
10583 }
10585 /* Now we're all done with the if-statement. */
10587 }
10588 else
10589 {
10593 /* Add the condition. */
10596 /* Parse the body of the switch-statement. */
10602 guard_tinfo);
10606 /* Now we're all done with the switch-statement. */
10608 }
10611 }
10617 }
10618 }
10620 /* Parse a condition.
10622 condition:
10623 expression
10624 type-specifier-seq declarator = initializer-clause
10625 type-specifier-seq declarator braced-init-list
10627 GNU Extension:
10629 condition:
10630 type-specifier-seq declarator asm-specification [opt]
10631 attributes [opt] = assignment-expression
10633 Returns the expression that should be tested. */
10635 static tree
10637 {
10638 cp_decl_specifier_seq type_specifiers;
10642 /* Try the declaration first. */
10644 /* New types are not allowed in the type-specifier-seq for a
10645 condition. */
10647 parser->type_definition_forbidden_message
10649 /* Parse the type-specifier-seq. */
10651 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10654 /* Restore the saved message. */
10656 /* If all is well, we might be looking at a declaration. */
10658 {
10659 tree decl;
10660 tree asm_specification;
10661 tree attributes;
10665 /* Parse the declarator. */
10671 /* Parse the attributes. */
10673 /* Parse the asm-specification. */
10675 /* If the next token is not an `=' or '{', then we might still be
10676 looking at an expression. For example:
10678 if (A(a).x)
10680 looks like a decl-specifier-seq and a declarator -- but then
10681 there is no `=', so this is an expression. */
10686 /* If we did see an `=' or '{', then we are looking at a declaration
10687 for sure. */
10689 {
10690 tree pushed_scope;
10694 /* Create the declaration. */
10700 /* Parse the initializer. */
10702 {
10706 }
10707 else
10708 {
10709 /* Consume the `='. */
10712 }
10716 /* Process the initializer. */
10719 asm_specification,
10720 flags);
10726 }
10727 }
10728 /* If we didn't even get past the declarator successfully, we are
10729 definitely not looking at a declaration. */
10730 else
10733 /* Otherwise, we are looking at an expression. */
10735 }
10737 /* Parses a for-statement or range-for-statement until the closing ')',
10738 not included. */
10740 static tree
10742 {
10746 /* Begin the for-statement. */
10749 /* Parse the initialization. */
10754 else
10756 }
10758 static tree
10760 {
10761 /* Normal for loop */
10764 tree stmt;
10767 /* The for-init-statement has already been parsed in
10768 cp_parser_for_init_statement, so no work is needed here. */
10771 /* If there's a condition, process it. */
10775 {
10779 }
10781 /* Look for the `;'. */
10784 /* If there's an expression, process it. */
10790 }
10792 /* Tries to parse a range-based for-statement:
10794 range-based-for:
10795 decl-specifier-seq declarator : expression
10797 The decl-specifier-seq declarator and the `:' are already parsed by
10798 cp_parser_for_init_statement. If processing_template_decl it returns a
10799 newly created RANGE_FOR_STMT; if not, it is converted to a
10800 regular FOR_STMT. */
10802 static tree
10805 {
10808 /* Get the range declaration momentarily out of the way so that
10809 the range expression doesn't clash with it. */
10814 {
10817 }
10818 else
10821 /* Put the range declaration back into scope. */
10825 /* If in template, STMT is converted to a normal for-statement
10826 at instantiation. If not, it is done just ahead. */
10828 {
10836 /* do_auto_deduction doesn't mess with template init-lists. */
10839 }
10840 else
10841 {
10844 }
10846 }
10848 /* Subroutine of cp_convert_range_for: given the initializer expression,
10849 builds up the range temporary. */
10851 static tree
10853 {
10856 /* Find out the type deduced by the declaration
10857 `auto &&__range = range_expr'. */
10862 /* Create the __range variable. */
10869 }
10871 /* Used by cp_parser_range_for in template context: we aren't going to
10872 do a full conversion yet, but we still need to resolve auto in the
10873 type of the for-range-declaration if present. This is basically
10874 a shortcut version of cp_convert_range_for. */
10876 static void
10878 {
10881 {
10884 iter_type = (cp_parser_perform_range_for_lookup
10887 {
10889 iter_type);
10891 tf_warning_or_error);
10894 }
10895 }
10896 }
10898 /* Converts a range-based for-statement into a normal
10899 for-statement, as per the definition.
10901 for (RANGE_DECL : RANGE_EXPR)
10902 BLOCK
10904 should be equivalent to:
10906 {
10907 auto &&__range = RANGE_EXPR;
10908 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10909 __begin != __end;
10910 ++__begin)
10911 {
10912 RANGE_DECL = *__begin;
10913 BLOCK
10914 }
10915 }
10917 If RANGE_EXPR is an array:
10918 BEGIN_EXPR = __range
10919 END_EXPR = __range + ARRAY_SIZE(__range)
10920 Else if RANGE_EXPR has a member 'begin' or 'end':
10921 BEGIN_EXPR = __range.begin()
10922 END_EXPR = __range.end()
10923 Else:
10924 BEGIN_EXPR = begin(__range)
10925 END_EXPR = end(__range);
10927 If __range has a member 'begin' but not 'end', or vice versa, we must
10928 still use the second alternative (it will surely fail, however).
10929 When calling begin()/end() in the third alternative we must use
10930 argument dependent lookup, but always considering 'std' as an associated
10931 namespace. */
10933 tree
10936 {
10942 /* If an error happened previously do nothing or else a lot of
10943 unhelpful errors would be issued. */
10945 else
10946 {
10947 tree range_temp;
10951 /* Can't bind a reference to an array of runtime bound. */
10953 else
10954 {
10959 LOOKUP_ONLYCONVERTING);
10961 }
10964 }
10966 /* The new for initialization statement. */
10974 LOOKUP_ONLYCONVERTING);
10983 LOOKUP_ONLYCONVERTING);
10987 /* The new for condition. */
10994 /* The new increment expression. */
10997 tf_warning_or_error);
11000 /* The declaration is initialized with *__begin inside the loop body. */
11003 tf_warning_or_error),
11005 LOOKUP_ONLYCONVERTING);
11008 }
11010 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11011 We need to solve both at the same time because the method used
11012 depends on the existence of members begin or end.
11013 Returns the type deduced for the iterator expression. */
11015 static tree
11017 {
11019 {
11022 }
11025 {
11030 }
11032 {
11033 /* If RANGE is an array, we will use pointer arithmetic. */
11036 range,
11040 }
11041 else
11042 {
11043 /* If it is not an array, we must do a bit of magic. */
11053 tf_warning_or_error);
11056 tf_warning_or_error);
11059 {
11060 /* Use the member functions. */
11063 else
11069 else
11072 }
11073 else
11074 {
11075 /* Use global functions with ADL. */
11082 tf_warning_or_error);
11084 tf_warning_or_error);
11086 tf_warning_or_error);
11088 tf_warning_or_error);
11091 }
11093 /* Last common checks. */
11095 {
11096 /* If one of the expressions is an error do no more checks. */
11099 }
11102 /* Can happen, when, eg, in a template context, Koenig lookup
11103 can't resolve begin/end (c++/58503). */
11105 else
11106 {
11108 /* The unqualified type of the __begin and __end temporaries should
11109 be the same, as required by the multiple auto declaration. */
11115 }
11116 }
11117 }
11119 /* Helper function for cp_parser_perform_range_for_lookup.
11120 Builds a tree for RANGE.IDENTIFIER(). */
11122 static tree
11124 {
11137 tf_warning_or_error);
11140 }
11142 /* Parse an iteration-statement.
11144 iteration-statement:
11145 while ( condition ) statement
11146 do statement while ( expression ) ;
11147 for ( for-init-statement condition [opt] ; expression [opt] )
11148 statement
11150 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11152 static tree
11154 {
11157 tree statement;
11159 token_indent_info guard_tinfo;
11161 /* Peek at the next token. */
11168 /* Remember whether or not we are already within an iteration
11169 statement. */
11172 /* See what kind of keyword it is. */
11175 {
11177 {
11178 tree condition;
11180 /* Begin the while-statement. */
11182 /* Look for the `('. */
11184 /* Parse the condition. */
11187 /* Look for the `)'. */
11189 /* Parse the dependent statement. */
11193 /* We're done with the while-statement. */
11195 }
11199 {
11200 tree expression;
11202 /* Begin the do-statement. */
11204 /* Parse the body of the do-statement. */
11209 /* Look for the `while' keyword. */
11211 /* Look for the `('. */
11213 /* Parse the expression. */
11215 /* We're done with the do-statement. */
11217 /* Look for the `)'. */
11219 /* Look for the `;'. */
11221 }
11225 {
11226 /* Look for the `('. */
11231 /* Look for the `)'. */
11234 /* Parse the body of the for-statement. */
11239 /* We're done with the for-statement. */
11241 }
11248 }
11251 }
11253 /* Parse a for-init-statement or the declarator of a range-based-for.
11254 Returns true if a range-based-for declaration is seen.
11256 for-init-statement:
11257 expression-statement
11258 simple-declaration */
11260 static bool
11262 {
11263 /* If the next token is a `;', then we have an empty
11264 expression-statement. Grammatically, this is also a
11265 simple-declaration, but an invalid one, because it does not
11266 declare anything. Therefore, if we did not handle this case
11267 specially, we would issue an error message about an invalid
11268 declaration. */
11270 {
11274 /* A colon is used in range-based for. */
11277 /* We're going to speculatively look for a declaration, falling back
11278 to an expression, if necessary. */
11280 /* Parse the declaration. */
11283 decl);
11286 {
11287 /* It is a range-for, consume the ':' */
11291 {
11293 "range-based %<for%> loops only available with "
11296 }
11297 }
11298 else
11299 /* The ';' is not consumed yet because we told
11300 cp_parser_simple_declaration not to. */
11305 /* If the tentative parse failed, then we shall need to look for an
11306 expression-statement. */
11307 }
11308 /* If we are here, it is an expression-statement. */
11311 }
11313 /* Parse a jump-statement.
11315 jump-statement:
11316 break ;
11317 continue ;
11318 return expression [opt] ;
11319 return braced-init-list ;
11320 goto identifier ;
11322 GNU extension:
11324 jump-statement:
11325 goto * expression ;
11327 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11329 static tree
11331 {
11337 /* Peek at the next token. */
11342 /* See what kind of keyword it is. */
11345 {
11349 {
11369 }
11375 {
11382 /* Fall through. */
11392 }
11397 {
11398 tree expr;
11402 {
11406 }
11409 else
11410 /* If the next token is a `;', then there is no
11411 expression. */
11413 /* Build the return-statement. */
11415 /* Look for the final `;'. */
11417 }
11423 {
11426 }
11428 /* Create the goto-statement. */
11430 {
11431 /* Issue a warning about this use of a GNU extension. */
11433 /* Consume the '*' token. */
11435 /* Parse the dependent expression. */
11437 }
11438 else
11440 /* Look for the final `;'. */
11447 }
11450 }
11452 /* Parse a declaration-statement.
11454 declaration-statement:
11455 block-declaration */
11457 static void
11459 {
11462 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11465 /* Parse the block-declaration. */
11468 /* Free any declarators allocated. */
11470 }
11472 /* Some dependent statements (like `if (cond) statement'), are
11473 implicitly in their own scope. In other words, if the statement is
11474 a single statement (as opposed to a compound-statement), it is
11475 none-the-less treated as if it were enclosed in braces. Any
11476 declarations appearing in the dependent statement are out of scope
11477 after control passes that point. This function parses a statement,
11478 but ensures that is in its own scope, even if it is not a
11479 compound-statement.
11481 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11482 is a (possibly labeled) if statement which is not enclosed in
11483 braces and has an else clause. This is used to implement
11484 -Wparentheses.
11486 CHAIN is a vector of if-else-if conditions. This is used to implement
11487 -Wduplicated-cond.
11489 Returns the new statement. */
11491 static tree
11495 {
11496 tree statement;
11498 token_indent_info body_tinfo
11504 /* Mark if () ; with a special NOP_EXPR. */
11506 {
11517 }
11518 /* if a compound is opened, we simply parse the statement directly. */
11521 /* If the token is not a `{', then we must take special action. */
11522 else
11523 {
11524 /* Create a compound-statement. */
11526 /* Parse the dependent-statement. */
11528 /* Finish the dummy compound-statement. */
11530 }
11532 token_indent_info next_tinfo
11536 /* Return the statement. */
11538 }
11540 /* For some dependent statements (like `while (cond) statement'), we
11541 have already created a scope. Therefore, even if the dependent
11542 statement is a compound-statement, we do not want to create another
11543 scope. */
11545 static void
11548 {
11549 /* If the token is a `{', then we must take special action. */
11551 {
11552 token_indent_info body_tinfo
11556 token_indent_info next_tinfo
11559 }
11560 else
11561 {
11562 /* Avoid calling cp_parser_compound_statement, so that we
11563 don't create a new scope. Do everything else by hand. */
11565 /* If the next keyword is `__label__' we have a label declaration. */
11568 /* Parse an (optional) statement-seq. */
11571 }
11572 }
11574 /* Declarations [gram.dcl.dcl] */
11576 /* Parse an optional declaration-sequence.
11578 declaration-seq:
11579 declaration
11580 declaration-seq declaration */
11582 static void
11584 {
11586 {
11597 {
11598 /* A declaration consisting of a single semicolon is
11599 invalid. Allow it unless we're being pedantic. */
11604 }
11606 /* If we're entering or exiting a region that's implicitly
11607 extern "C", modify the lang context appropriately. */
11609 {
11612 }
11614 {
11617 }
11620 {
11621 /* A top-level declaration can consist solely of a #pragma.
11622 A nested declaration cannot, so this is done here and not
11623 in cp_parser_declaration. (A #pragma at block scope is
11624 handled in cp_parser_statement.) */
11627 }
11629 /* Parse the declaration itself. */
11631 }
11632 }
11634 /* Parse a declaration.
11636 declaration:
11637 block-declaration
11638 function-definition
11639 template-declaration
11640 explicit-instantiation
11641 explicit-specialization
11642 linkage-specification
11643 namespace-definition
11645 GNU extension:
11647 declaration:
11648 __extension__ declaration */
11650 static void
11652 {
11653 cp_token token1;
11654 cp_token token2;
11659 /* Check for the `__extension__' keyword. */
11661 {
11662 /* Parse the qualified declaration. */
11664 /* Restore the PEDANTIC flag. */
11668 }
11670 /* Try to figure out what kind of declaration is present. */
11675 else
11676 {
11679 }
11681 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11684 /* If the next token is `extern' and the following token is a string
11685 literal, then we have a linkage specification. */
11689 /* If the next token is `template', then we have either a template
11690 declaration, an explicit instantiation, or an explicit
11691 specialization. */
11693 {
11694 /* `template <>' indicates a template specialization. */
11698 /* `template <' indicates a template declaration. */
11701 /* Anything else must be an explicit instantiation. */
11702 else
11704 }
11705 /* If the next token is `export', then we have a template
11706 declaration. */
11709 /* If the next token is `extern', 'static' or 'inline' and the one
11710 after that is `template', we have a GNU extended explicit
11711 instantiation directive. */
11718 /* If the next token is `namespace', check for a named or unnamed
11719 namespace definition. */
11728 /* An unnamed namespace definition. */
11732 /* An inline (associated) namespace definition. */
11736 /* Objective-C++ declaration/definition. */
11743 /* At this point we may have a template declared by a concept
11744 introduction. */
11749 else
11750 /* Try to parse a block-declaration, or a function-definition. */
11753 /* Free any declarators allocated. */
11755 }
11757 /* Parse a block-declaration.
11759 block-declaration:
11760 simple-declaration
11761 asm-definition
11762 namespace-alias-definition
11763 using-declaration
11764 using-directive
11766 GNU Extension:
11768 block-declaration:
11769 __extension__ block-declaration
11771 C++0x Extension:
11773 block-declaration:
11774 static_assert-declaration
11776 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11777 part of a declaration-statement. */
11779 static void
11782 {
11786 /* Check for the `__extension__' keyword. */
11788 {
11789 /* Parse the qualified declaration. */
11791 /* Restore the PEDANTIC flag. */
11795 }
11797 /* Peek at the next token to figure out which kind of declaration is
11798 present. */
11801 /* If the next keyword is `asm', we have an asm-definition. */
11803 {
11807 }
11808 /* If the next keyword is `namespace', we have a
11809 namespace-alias-definition. */
11812 /* If the next keyword is `using', we have a
11813 using-declaration, a using-directive, or an alias-declaration. */
11815 {
11820 /* If the token after `using' is `namespace', then we have a
11821 using-directive. */
11825 /* If the second token after 'using' is '=', then we have an
11826 alias-declaration. */
11832 /* Otherwise, it's a using-declaration. */
11833 else
11836 }
11837 /* If the next keyword is `__label__' we have a misplaced label
11838 declaration. */
11840 {
11844 /* If the next token is now a `;', consume it. */
11847 }
11848 /* If the next token is `static_assert' we have a static assertion. */
11851 /* Anything else must be a simple-declaration. */
11852 else
11855 }
11857 /* Parse a simple-declaration.
11859 simple-declaration:
11860 decl-specifier-seq [opt] init-declarator-list [opt] ;
11862 init-declarator-list:
11863 init-declarator
11864 init-declarator-list , init-declarator
11866 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11867 function-definition as a simple-declaration.
11869 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11870 parsed declaration if it is an uninitialized single declarator not followed
11871 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11872 if present, will not be consumed. */
11874 static void
11878 {
11879 cp_decl_specifier_seq decl_specifiers;
11888 /* Defer access checks until we know what is being declared; the
11889 checks for names appearing in the decl-specifier-seq should be
11890 done as if we were in the scope of the thing being declared. */
11893 /* Parse the decl-specifier-seq. We have to keep track of whether
11894 or not the decl-specifier-seq declares a named class or
11895 enumeration type, since that is the only case in which the
11896 init-declarator-list is allowed to be empty.
11898 [dcl.dcl]
11900 In a simple-declaration, the optional init-declarator-list can be
11901 omitted only when declaring a class or enumeration, that is when
11902 the decl-specifier-seq contains either a class-specifier, an
11903 elaborated-type-specifier, or an enum-specifier. */
11905 CP_PARSER_FLAGS_OPTIONAL,
11908 /* We no longer need to defer access checks. */
11911 /* In a block scope, a valid declaration must always have a
11912 decl-specifier-seq. By not trying to parse declarators, we can
11913 resolve the declaration/expression ambiguity more quickly. */
11916 {
11919 }
11921 /* If the next two tokens are both identifiers, the code is
11922 erroneous. The usual cause of this situation is code like:
11924 T t;
11926 where "T" should name a type -- but does not. */
11929 {
11930 /* If parsing tentatively, we should commit; we really are
11931 looking at a declaration. */
11933 /* Give up. */
11935 }
11937 /* If we have seen at least one decl-specifier, and the next token
11938 is not a parenthesis, then we must be looking at a declaration.
11939 (After "int (" we might be looking at a functional cast.) */
11946 /* Keep going until we hit the `;' at the end of the simple
11947 declaration. */
11950 CPP_SEMICOLON))
11951 {
11954 tree decl;
11957 {
11958 /* If we are processing next declarator, comma is expected */
11963 {
11967 }
11968 }
11969 else
11972 /* Parse the init-declarator. */
11975 function_definition_allowed_p,
11977 declares_class_or_enum,
11979 maybe_range_for_decl,
11981 /* If an error occurred while parsing tentatively, exit quickly.
11982 (That usually happens when in the body of a function; each
11983 statement is treated as a declaration-statement until proven
11984 otherwise.) */
11987 /* Handle function definitions specially. */
11989 {
11990 /* If the next token is a `,', then we are probably
11991 processing something like:
11993 void f() {}, *p;
11995 which is erroneous. */
11997 {
12000 "mixing"
12002 }
12003 /* Otherwise, we're done with the list of declarators. */
12004 else
12005 {
12008 }
12009 }
12012 /* The next token should be either a `,' or a `;'. */
12014 /* If it's a `,', there are more declarators to come. */
12017 /* If it's a `;', we are done. */
12020 /* Anything else is an error. */
12021 else
12022 {
12023 /* If we have already issued an error message we don't need
12024 to issue another one. */
12029 /* Skip tokens until we reach the end of the statement. */
12031 /* If the next token is now a `;', consume it. */
12035 }
12036 /* After the first time around, a function-definition is not
12037 allowed -- even if it was OK at first. For example:
12039 int i, f() {}
12041 is not valid. */
12043 }
12045 /* Issue an error message if no declarators are present, and the
12046 decl-specifier-seq does not itself declare a class or
12047 enumeration: [dcl.dcl]/3. */
12049 {
12051 {
12055 /* Ensure an error is issued anyway when finish_decltype_type,
12056 called via cp_parser_decl_specifier_seq, returns a class or
12057 an enumeration (c++/51786). */
12060 }
12061 /* Perform any deferred access checks. */
12063 }
12065 /* Consume the `;'. */
12069 {
12075 }
12077 done:
12079 }
12081 /* Parse a decl-specifier-seq.
12083 decl-specifier-seq:
12084 decl-specifier-seq [opt] decl-specifier
12085 decl-specifier attribute-specifier-seq [opt] (C++11)
12087 decl-specifier:
12088 storage-class-specifier
12089 type-specifier
12090 function-specifier
12091 friend
12092 typedef
12094 GNU Extension:
12096 decl-specifier:
12097 attributes
12099 Concepts Extension:
12101 decl-specifier:
12102 concept
12104 Set *DECL_SPECS to a representation of the decl-specifier-seq.
12106 The parser flags FLAGS is used to control type-specifier parsing.
12108 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
12109 flags:
12111 1: one of the decl-specifiers is an elaborated-type-specifier
12112 (i.e., a type declaration)
12113 2: one of the decl-specifiers is an enum-specifier or a
12114 class-specifier (i.e., a type definition)
12116 */
12118 static void
12120 cp_parser_flags flags,
12123 {
12127 cp_decl_spec ds;
12129 /* Clear DECL_SPECS. */
12132 /* Assume no class or enumeration type is declared. */
12135 /* Keep reading specifiers until there are no more to read. */
12137 {
12142 /* Peek at the next token. */
12145 /* Save the first token of the decl spec list for error
12146 reporting. */
12149 /* Handle attributes. */
12151 {
12152 /* Parse the attributes. */
12155 /* In a sequence of declaration specifiers, c++11 attributes
12156 appertain to the type that precede them. In that case
12157 [dcl.spec]/1 says:
12159 The attribute-specifier-seq affects the type only for
12160 the declaration it appears in, not other declarations
12161 involving the same type.
12163 But for now let's force the user to position the
12164 attribute either at the beginning of the declaration or
12165 after the declarator-id, which would clearly mean that it
12166 applies to the declarator. */
12168 {
12170 /* The c++11 attribute is at the beginning of the
12171 declaration. It appertains to the entity being
12173 else
12174 {
12176 {
12177 /* This is an attribute following a
12178 class-specifier. */
12183 }
12184 else
12185 {
12186 decl_specs->std_attributes
12188 attrs);
12191 }
12193 }
12194 }
12196 decl_specs->attributes
12198 attrs);
12202 }
12203 /* Assume we will find a decl-specifier keyword. */
12205 /* If the next token is an appropriate keyword, we can simply
12206 add it to the list. */
12208 {
12209 /* decl-specifier:
12210 friend
12211 constexpr */
12214 {
12217 }
12218 else
12219 {
12221 /* Consume the token. */
12223 }
12236 /* function-specifier:
12237 inline
12238 virtual
12239 explicit */
12246 /* decl-specifier:
12247 typedef */
12250 /* Consume the token. */
12252 /* A constructor declarator cannot appear in a typedef. */
12254 /* The "typedef" keyword can only occur in a declaration; we
12255 may as well commit at this point. */
12262 /* storage-class-specifier:
12263 auto
12264 register
12265 static
12266 extern
12267 mutable
12269 GNU Extension:
12270 thread */
12273 {
12274 /* Consume the token. */
12277 /* Complain about `auto' as a storage specifier, if
12278 we're complaining about C++0x compatibility. */
12282 /* Set the storage class anyway. */
12284 token);
12285 }
12286 else
12287 /* C++0x auto type-specifier. */
12295 /* Consume the token. */
12298 token);
12301 /* Consume the token. */
12307 /* We did not yet find a decl-specifier yet. */
12310 }
12320 /* Constructors are a special case. The `S' in `S()' is not a
12321 decl-specifier; it is the beginning of the declarator. */
12322 constructor_p
12323 = (!found_decl_spec
12324 && constructor_possible_p
12325 && (cp_parser_constructor_declarator_p
12328 /* If we don't have a DECL_SPEC yet, then we must be looking at
12329 a type-specifier. */
12331 {
12334 tree type_spec;
12336 type_spec
12338 decl_specs,
12344 /* If this type-specifier referenced a user-defined type
12345 (a typedef, class-name, etc.), then we can't allow any
12346 more such type-specifiers henceforth.
12348 [dcl.spec]
12350 The longest sequence of decl-specifiers that could
12351 possibly be a type name is taken as the
12352 decl-specifier-seq of a declaration. The sequence shall
12353 be self-consistent as described below.
12355 [dcl.type]
12357 As a general rule, at most one type-specifier is allowed
12358 in the complete decl-specifier-seq of a declaration. The
12359 only exceptions are the following:
12361 -- const or volatile can be combined with any other
12362 type-specifier.
12364 -- signed or unsigned can be combined with char, long,
12365 short, or int.
12367 -- ..
12369 Example:
12371 typedef char* Pc;
12372 void g (const int Pc);
12374 Here, Pc is *not* part of the decl-specifier seq; it's
12375 the declarator. Therefore, once we see a type-specifier
12376 (other than a cv-qualifier), we forbid any additional
12377 user-defined types. We *do* still allow things like `int
12378 int' to be considered a decl-specifier-seq, and issue the
12379 error message later. */
12382 /* A constructor declarator cannot follow a type-specifier. */
12384 {
12389 }
12390 }
12392 /* If we still do not have a DECL_SPEC, then there are no more
12393 decl-specifiers. */
12398 /* After we see one decl-specifier, further decl-specifiers are
12399 always optional. */
12401 }
12403 /* Don't allow a friend specifier with a class definition. */
12408 }
12410 /* Parse an (optional) storage-class-specifier.
12412 storage-class-specifier:
12413 auto
12414 register
12415 static
12416 extern
12417 mutable
12419 GNU Extension:
12421 storage-class-specifier:
12422 thread
12424 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12426 static tree
12428 {
12430 {
12434 /* Fall through for C++98. */
12441 /* Consume the token. */
12446 }
12447 }
12449 /* Parse an (optional) function-specifier.
12451 function-specifier:
12452 inline
12453 virtual
12454 explicit
12456 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12457 Updates DECL_SPECS, if it is non-NULL. */
12459 static tree
12462 {
12465 {
12471 /* 14.5.2.3 [temp.mem]
12473 A member function template shall not be virtual. */
12476 else
12486 }
12488 /* Consume the token. */
12490 }
12492 /* Parse a linkage-specification.
12494 linkage-specification:
12495 extern string-literal { declaration-seq [opt] }
12496 extern string-literal declaration */
12498 static void
12500 {
12501 tree linkage;
12503 /* Look for the `extern' keyword. */
12506 /* Look for the string-literal. */
12509 /* Transform the literal into an identifier. If the literal is a
12510 wide-character string, or contains embedded NULs, then we can't
12511 handle it as the user wants. */
12514 {
12516 /* Assume C++ linkage. */
12518 }
12519 else
12522 /* We're now using the new linkage. */
12525 /* If the next token is a `{', then we're using the first
12526 production. */
12528 {
12532 /* Consume the `{' token. */
12534 /* Parse the declarations. */
12536 /* Look for the closing `}'. */
12538 }
12539 /* Otherwise, there's just one declaration. */
12540 else
12541 {
12544 saved_in_unbraced_linkage_specification_p
12548 parser->in_unbraced_linkage_specification_p
12550 }
12552 /* We're done with the linkage-specification. */
12554 }
12556 /* Parse a static_assert-declaration.
12558 static_assert-declaration:
12559 static_assert ( constant-expression , string-literal ) ;
12560 static_assert ( constant-expression ) ; (C++1Z)
12562 If MEMBER_P, this static_assert is a class member. */
12564 static void
12566 {
12567 tree condition;
12568 tree message;
12570 location_t saved_loc;
12573 /* Peek at the `static_assert' token so we can keep track of exactly
12574 where the static assertion started. */
12578 /* Look for the `static_assert' keyword. */
12580 RT_STATIC_ASSERT))
12583 /* We know we are in a static assertion; commit to any tentative
12584 parse. */
12588 /* Parse the `(' starting the static assertion condition. */
12591 /* Parse the constant-expression. Allow a non-constant expression
12592 here in order to give better diagnostics in finish_static_assert. */
12593 condition =
12599 {
12602 "static_assert without a message "
12604 /* Eat the ')' */
12609 }
12610 else
12611 {
12612 /* Parse the separating `,'. */
12615 /* Parse the string-literal message. */
12620 /* A `)' completes the static assertion. */
12626 }
12628 /* A semicolon terminates the declaration. */
12631 /* Complete the static assertion, which may mean either processing
12632 the static assert now or saving it for template instantiation. */
12634 }
12636 /* Parse the expression in decltype ( expression ). */
12638 static tree
12641 {
12643 tree expr;
12645 /* First, try parsing an id-expression. */
12656 {
12659 cp_id_kind idk;
12663 /* Lookup the name we got back from the id-expression. */
12673 {
12674 /* Complete lookup of the id-expression. */
12675 expr = (finish_id_expression
12688 /* We found an id-expression, but it was something that we
12689 should not have found. This is an error, not something
12690 we can recover from, so note that we found an
12691 id-expression and we'll recover as gracefully as
12692 possible. */
12694 }
12699 /* We have an id-expression. */
12701 }
12704 {
12705 /* Abort the id-expression parse. */
12708 /* Parsing tentatively, again. */
12711 /* Parse a class member access. */
12719 /* We have an id-expression. */
12721 }
12724 /* We have parsed the complete id-expression or member access. */
12726 else
12727 {
12728 /* Abort our attempt to parse an id-expression or member access
12729 expression. */
12732 /* Parse a full expression. */
12735 }
12738 }
12740 /* Parse a `decltype' type. Returns the type.
12742 simple-type-specifier:
12743 decltype ( expression )
12744 C++14 proposal:
12745 decltype ( auto ) */
12747 static tree
12749 {
12750 tree expr;
12759 {
12760 /* Already parsed. */
12763 }
12765 /* Look for the `decltype' token. */
12769 /* Parse the opening `('. */
12773 /* decltype (auto) */
12776 {
12783 }
12785 /* Types cannot be defined in a `decltype' expression. Save away the
12786 old message. */
12789 /* And create the new one. */
12790 parser->type_definition_forbidden_message
12793 /* The restrictions on constant-expressions do not apply inside
12794 decltype expressions. */
12795 saved_integral_constant_expression_p
12797 saved_non_integral_constant_expression_p
12801 /* Within a parenthesized expression, a `>' token is always
12802 the greater-than operator. */
12803 saved_greater_than_is_operator_p
12807 /* Do not actually evaluate the expression. */
12810 /* Do not warn about problems with the expression. */
12815 /* Go back to evaluating expressions. */
12819 /* The `>' token might be the end of a template-id or
12820 template-parameter-list now. */
12821 parser->greater_than_is_operator_p
12824 /* Restore the old message and the integral constant expression
12825 flags. */
12827 parser->integral_constant_expression_p
12829 parser->non_integral_constant_expression_p
12832 /* Parse to the closing `)'. */
12834 {
12838 }
12841 tf_warning_or_error);
12843 rewrite:
12844 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12845 it again. */
12852 }
12854 /* Special member functions [gram.special] */
12856 /* Parse a conversion-function-id.
12858 conversion-function-id:
12859 operator conversion-type-id
12861 Returns an IDENTIFIER_NODE representing the operator. */
12863 static tree
12865 {
12866 tree type;
12867 tree saved_scope;
12868 tree saved_qualifying_scope;
12869 tree saved_object_scope;
12872 /* Look for the `operator' token. */
12875 /* When we parse the conversion-type-id, the current scope will be
12876 reset. However, we need that information in able to look up the
12877 conversion function later, so we save it here. */
12881 /* We must enter the scope of the class so that the names of
12882 entities declared within the class are available in the
12883 conversion-type-id. For example, consider:
12885 struct S {
12886 typedef int I;
12887 operator I();
12888 };
12890 S::operator I() { ... }
12892 In order to see that `I' is a type-name in the definition, we
12893 must be in the scope of `S'. */
12896 /* Parse the conversion-type-id. */
12898 /* Leave the scope of the class, if any. */
12901 /* Restore the saved scope. */
12905 /* If the TYPE is invalid, indicate failure. */
12909 }
12911 /* Parse a conversion-type-id:
12913 conversion-type-id:
12914 type-specifier-seq conversion-declarator [opt]
12916 Returns the TYPE specified. */
12918 static tree
12920 {
12921 tree attributes;
12922 cp_decl_specifier_seq type_specifiers;
12924 tree type_specified;
12927 /* Parse the attributes. */
12931 parser->type_definition_forbidden_message
12934 /* Parse the type-specifiers. */
12941 /* If that didn't work, stop. */
12944 /* Parse the conversion-declarator. */
12952 /* Don't give this error when parsing tentatively. This happens to
12953 work because we always parse this definitively once. */
12956 {
12958 {
12961 }
12965 }
12968 }
12970 /* Parse an (optional) conversion-declarator.
12972 conversion-declarator:
12973 ptr-operator conversion-declarator [opt]
12975 */
12979 {
12982 cp_cv_quals cv_quals;
12984 /* We don't know if there's a ptr-operator next, or not. */
12986 /* Try the ptr-operator. */
12989 /* If it worked, look for more conversion-declarators. */
12991 {
12994 /* Parse another optional declarator. */
12997 declarator = cp_parser_make_indirect_declarator
13001 }
13004 }
13006 /* Parse an (optional) ctor-initializer.
13008 ctor-initializer:
13009 : mem-initializer-list
13011 Returns TRUE iff the ctor-initializer was actually present. */
13013 static bool
13015 {
13016 /* If the next token is not a `:', then there is no
13017 ctor-initializer. */
13019 {
13020 /* Do default initialization of any bases and members. */
13025 }
13027 /* Consume the `:' token. */
13029 /* And the mem-initializer-list. */
13033 }
13035 /* Parse a mem-initializer-list.
13037 mem-initializer-list:
13038 mem-initializer ... [opt]
13039 mem-initializer ... [opt] , mem-initializer-list */
13041 static void
13043 {
13048 /* Let the semantic analysis code know that we are starting the
13049 mem-initializer-list. */
13054 /* Loop through the list. */
13056 {
13057 tree mem_initializer;
13060 /* Parse the mem-initializer. */
13062 /* If the next token is a `...', we're expanding member initializers. */
13064 {
13065 /* Consume the `...'. */
13068 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
13069 can be expanded but members cannot. */
13072 {
13077 }
13079 /* Construct the pack expansion type. */
13082 }
13085 {
13089 }
13090 /* Look for a target constructor. */
13094 {
13097 {
13101 }
13103 }
13104 /* Add it to the list, unless it was erroneous. */
13106 {
13109 }
13110 /* If the next token is not a `,', we're done. */
13113 /* Consume the `,' token. */
13115 }
13117 /* Perform semantic analysis. */
13120 }
13122 /* Parse a mem-initializer.
13124 mem-initializer:
13125 mem-initializer-id ( expression-list [opt] )
13126 mem-initializer-id braced-init-list
13128 GNU extension:
13130 mem-initializer:
13131 ( expression-list [opt] )
13133 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
13134 class) or FIELD_DECL (for a non-static data member) to initialize;
13135 the TREE_VALUE is the expression-list. An empty initialization
13136 list is represented by void_list_node. */
13138 static tree
13140 {
13141 tree mem_initializer_id;
13142 tree expression_list;
13143 tree member;
13146 /* Find out what is being initialized. */
13148 {
13152 }
13153 else
13154 {
13158 }
13164 {
13171 }
13172 else
13173 {
13183 }
13193 }
13195 /* Parse a mem-initializer-id.
13197 mem-initializer-id:
13198 :: [opt] nested-name-specifier [opt] class-name
13199 decltype-specifier (C++11)
13200 identifier
13202 Returns a TYPE indicating the class to be initialized for the first
13203 production (and the second in C++11). Returns an IDENTIFIER_NODE
13204 indicating the data member to be initialized for the last production. */
13206 static tree
13208 {
13212 tree id;
13216 /* `typename' is not allowed in this context ([temp.res]). */
13218 {
13220 "keyword %<typename%> not allowed in this context (a qualified "
13223 }
13224 /* Look for the optional `::' operator. */
13225 global_scope_p
13229 /* Look for the optional nested-name-specifier. The simplest way to
13230 implement:
13232 [temp.res]
13234 The keyword `typename' is not permitted in a base-specifier or
13235 mem-initializer; in these contexts a qualified name that
13236 depends on a template-parameter is implicitly assumed to be a
13237 type name.
13239 is to assume that we have seen the `typename' keyword at this
13240 point. */
13241 nested_name_specifier_p
13250 /* If there is a `::' operator or a nested-name-specifier, then we
13251 are definitely looking for a class-name. */
13256 typename_type,
13260 /* Otherwise, we could also be looking for an ordinary identifier. */
13263 /* Try a decltype-specifier. */
13265 else
13266 /* Otherwise, try a class-name. */
13270 none_type,
13274 /* If we found one, we're done. */
13277 /* Otherwise, look for an ordinary identifier. */
13279 }
13281 /* Overloading [gram.over] */
13283 /* Parse an operator-function-id.
13285 operator-function-id:
13286 operator operator
13288 Returns an IDENTIFIER_NODE for the operator which is a
13289 human-readable spelling of the identifier, e.g., `operator +'. */
13291 static tree
13293 {
13294 /* Look for the `operator' keyword. */
13297 /* And then the name of the operator itself. */
13299 }
13301 /* Return an identifier node for a user-defined literal operator.
13302 The suffix identifier is chained to the operator name identifier. */
13304 static tree
13306 {
13307 tree identifier;
13314 }
13316 /* Parse an operator.
13318 operator:
13319 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13320 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13321 || ++ -- , ->* -> () []
13323 GNU Extensions:
13325 operator:
13326 <? >? <?= >?=
13328 Returns an IDENTIFIER_NODE for the operator which is a
13329 human-readable spelling of the identifier, e.g., `operator +'. */
13331 static tree
13333 {
13338 /* Peek at the next token. */
13340 /* Figure out which operator we have. */
13342 {
13344 {
13347 /* The keyword should be either `new' or `delete'. */
13352 else
13355 /* Consume the `new' or `delete' token. */
13358 /* Peek at the next token. */
13360 /* If it's a `[' token then this is the array variant of the
13361 operator. */
13363 {
13364 /* Consume the `[' token. */
13366 /* Look for the `]' token. */
13370 }
13371 /* Otherwise, we have the non-array variant. */
13372 else
13376 }
13523 /* Consume the `('. */
13525 /* Look for the matching `)'. */
13530 /* Consume the `['. */
13532 /* Look for the matching `]'. */
13547 {
13554 /* Consume the string. */
13560 {
13563 }
13564 else
13565 {
13567 /* Look for the suffix identifier. */
13572 {
13576 }
13577 else
13578 {
13581 }
13582 }
13587 {
13590 }
13593 {
13596 }
13598 {
13601 }
13603 }
13606 /* Anything else is an error. */
13608 }
13610 /* If we have selected an identifier, we need to consume the
13611 operator token. */
13614 /* Otherwise, no valid operator name was present. */
13615 else
13616 {
13619 }
13622 }
13624 /* Parse a template-declaration.
13626 template-declaration:
13627 export [opt] template < template-parameter-list > declaration
13629 If MEMBER_P is TRUE, this template-declaration occurs within a
13630 class-specifier.
13632 The grammar rule given by the standard isn't correct. What
13633 is really meant is:
13635 template-declaration:
13636 export [opt] template-parameter-list-seq
13637 decl-specifier-seq [opt] init-declarator [opt] ;
13638 export [opt] template-parameter-list-seq
13639 function-definition
13641 template-parameter-list-seq:
13642 template-parameter-list-seq [opt]
13643 template < template-parameter-list >
13645 Concept Extensions:
13647 template-parameter-list-seq:
13648 template < template-parameter-list > requires-clause [opt]
13650 requires-clause:
13651 requires logical-or-expression */
13653 static void
13655 {
13656 /* Check for `export'. */
13658 {
13659 /* Consume the `export' token. */
13661 /* Warn that we do not support `export'. */
13663 }
13666 }
13668 /* Parse a template-parameter-list.
13670 template-parameter-list:
13671 template-parameter
13672 template-parameter-list , template-parameter
13674 Returns a TREE_LIST. Each node represents a template parameter.
13675 The nodes are connected via their TREE_CHAINs. */
13677 static tree
13679 {
13684 /* The loop below parses the template parms. We first need to know
13685 the total number of template parms to be able to compute proper
13686 canonical types of each dependent type. So after the loop, when
13687 we know the total number of template parms,
13688 end_template_parm_list computes the proper canonical types and
13689 fixes up the dependent types accordingly. */
13691 {
13692 tree parameter;
13695 location_t parm_loc;
13697 /* Parse the template-parameter. */
13702 /* Add it to the list. */
13705 parm_loc,
13706 parameter,
13707 is_non_type,
13708 is_parameter_pack);
13709 else
13710 {
13713 }
13715 /* If the next token is not a `,', we're done. */
13718 /* Otherwise, consume the `,' token. */
13720 }
13723 }
13725 /* Parse a introduction-list.
13727 introduction-list:
13728 introduced-parameter
13729 introduction-list , introduced-parameter
13731 introduced-parameter:
13732 ...[opt] identifier
13734 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
13735 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
13736 WILDCARD_DECL will also have DECL_NAME set and token location in
13737 DECL_SOURCE_LOCATION. */
13739 static tree
13741 {
13745 {
13750 /* Build placeholder. */
13758 /* If the next token is not a `,', we're done. */
13761 /* Otherwise, consume the `,' token. */
13763 }
13765 /* Convert the vec into a TREE_VEC. */
13768 tree parm;
13774 }
13776 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
13777 is an abstract declarator. */
13781 {
13786 }
13788 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
13789 is an abstract declarator. */
13793 {
13797 else
13799 }
13801 /* Returns true if DECL represents a constrained-parameter. */
13805 {
13810 }
13812 /* Returns true if PARM declares a constrained-parameter. */
13816 {
13818 }
13820 /* Check that the type parameter is only a declarator-id, and that its
13821 type is not cv-qualified. */
13823 bool
13826 {
13831 {
13834 }
13836 /* Don't allow cv-qualified type parameters. */
13839 {
13842 }
13845 }
13847 /* Finish parsing/processing a template type parameter and checking
13848 various restrictions. */
13852 tree id,
13854 {
13857 else
13859 }
13861 static tree
13863 {
13864 /* FIXME: This should probably be copied, and we may need to adjust
13865 the template parameter depths. */
13875 }
13877 /* Finish parsing/processing a template template parameter by borrowing
13878 the template parameter list from the prototype parameter. */
13880 static tree
13882 tree proto,
13883 tree id,
13885 {
13889 }
13891 /* Create a new non-type template parameter from the given PARM
13892 declarator. */
13894 static tree
13897 {
13903 }
13905 /* Build a constrained template parameter based on the PARMDECL
13906 declarator. The type of PARMDECL is the constrained type, which
13907 refers to the prototype template parameter that ultimately
13908 specifies the type of the declared parameter. */
13910 static tree
13915 {
13921 /* A template parameter constrained by a variadic concept shall also
13922 be declared as a template parameter pack. */
13927 /* Build the parameter. Return an error if the declarator was invalid. */
13928 tree parm;
13933 parmdecl);
13934 else
13939 /* Finish the parameter decl and create a node attaching the
13940 default argument and constraint. */
13945 }
13947 /* Returns true if the parsed type actually represents the declaration
13948 of a type template-parameter. */
13952 {
13955 }
13958 /* Returns true if the parsed type actually represents the declaration of
13959 a template template-parameter. */
13961 static bool
13963 {
13966 }
13968 /* Parse a default argument for a type template-parameter.
13969 Note that diagnostics are handled in cp_parser_template_parameter. */
13971 static tree
13973 {
13976 /* Consume the `=' token. */
13979 /* Parse the default-argument. */
13985 }
13987 /* Parse a default argument for a template template-parameter. */
13989 static tree
13991 {
13996 /* Consume the `='. */
13998 /* Parse the id-expression. */
14000 /* save token before parsing the id-expression, for error
14001 reporting */
14003 tree default_argument
14011 /* If the id-expression was a template-id that refers to
14012 a template-class, we already have the declaration here,
14013 so no further lookup is needed. */
14014 ;
14015 else
14016 /* Look up the name. */
14017 default_argument
14019 none_type,
14025 /* See if the default argument is valid. */
14029 }
14031 /* Parse a template-parameter.
14033 template-parameter:
14034 type-parameter
14035 parameter-declaration
14037 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
14038 the parameter. The TREE_PURPOSE is the default value, if any.
14039 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
14040 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
14041 set to true iff this parameter is a parameter pack. */
14043 static tree
14046 {
14049 tree parm;
14051 /* Assume it is a type parameter or a template parameter. */
14053 /* Assume it not a parameter pack. */
14055 /* Peek at the next token. */
14057 /* If it is `class' or `template', we have a type-parameter. */
14060 /* If it is `class' or `typename' we do not know yet whether it is a
14061 type parameter or a non-type parameter. Consider:
14063 template <typename T, typename T::X X> ...
14065 or:
14067 template <class C, class D*> ...
14069 Here, the first parameter is a type parameter, and the second is
14070 a non-type parameter. We can tell by looking at the token after
14071 the identifier -- if it is a `,', `=', or `>' then we have a type
14072 parameter. */
14074 {
14075 /* Peek at the token after `class' or `typename'. */
14077 /* If it's an ellipsis, we have a template type parameter
14078 pack. */
14081 /* If it's an identifier, skip it. */
14084 /* Now, see if the token looks like the end of a template
14085 parameter. */
14090 }
14092 /* Otherwise, it is a non-type parameter or a constrained parameter.
14094 [temp.param]
14096 When parsing a default template-argument for a non-type
14097 template-parameter, the first non-nested `>' is taken as the end
14098 of the template parameter-list rather than a greater-than
14099 operator. */
14100 parameter_declarator
14107 /* If the parameter declaration is marked as a parameter pack, set
14108 *IS_PARAMETER_PACK to notify the caller. */
14113 {
14114 /* Can happen in some cases of erroneous input (c++/34892). */
14116 /* Consume the `...' for better error recovery. */
14118 }
14120 // The parameter may have been constrained.
14123 parameter_declarator,
14124 is_non_type,
14125 is_parameter_pack);
14127 // Now we're sure that the parameter is a non-type parameter.
14138 }
14140 /* Parse a type-parameter.
14142 type-parameter:
14143 class identifier [opt]
14144 class identifier [opt] = type-id
14145 typename identifier [opt]
14146 typename identifier [opt] = type-id
14147 template < template-parameter-list > class identifier [opt]
14148 template < template-parameter-list > class identifier [opt]
14149 = id-expression
14151 GNU Extension (variadic templates):
14153 type-parameter:
14154 class ... identifier [opt]
14155 typename ... identifier [opt]
14157 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
14158 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
14159 the declaration of the parameter.
14161 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
14163 static tree
14165 {
14167 tree parameter;
14169 /* Look for a keyword to tell us what kind of parameter this is. */
14175 {
14178 {
14179 tree identifier;
14180 tree default_argument;
14182 /* If the next token is an ellipsis, we have a template
14183 argument pack. */
14185 {
14186 /* Consume the `...' token. */
14191 }
14193 /* If the next token is an identifier, then it names the
14194 parameter. */
14197 else
14200 /* Create the parameter. */
14203 /* If the next token is an `=', we have a default argument. */
14205 {
14206 default_argument
14209 /* Template parameter packs cannot have default
14210 arguments. */
14212 {
14215 "template parameter pack %qD cannot have a "
14217 else
14219 "template parameter packs cannot have "
14222 }
14225 }
14226 else
14229 /* Create the combined representation of the parameter and the
14230 default argument. */
14232 }
14236 {
14237 tree identifier;
14238 tree default_argument;
14240 /* Look for the `<'. */
14242 /* Parse the template-parameter-list. */
14244 /* Look for the `>'. */
14247 // If template requirements are present, parse them.
14249 {
14254 }
14256 /* Look for the `class' or 'typename' keywords. */
14258 /* If the next token is an ellipsis, we have a template
14259 argument pack. */
14261 {
14262 /* Consume the `...' token. */
14267 }
14268 /* If the next token is an `=', then there is a
14269 default-argument. If the next token is a `>', we are at
14270 the end of the parameter-list. If the next token is a `,',
14271 then we are at the end of this parameter. */
14275 {
14277 /* Treat invalid names as if the parameter were nameless. */
14280 }
14281 else
14284 /* Create the template parameter. */
14286 identifier);
14288 /* If the next token is an `=', then there is a
14289 default-argument. */
14291 {
14292 default_argument
14295 /* Template parameter packs cannot have default
14296 arguments. */
14298 {
14301 "template parameter pack %qD cannot "
14303 identifier);
14304 else
14308 }
14309 }
14310 else
14313 /* Create the combined representation of the parameter and the
14314 default argument. */
14316 }
14322 }
14325 }
14327 /* Parse a template-id.
14329 template-id:
14330 template-name < template-argument-list [opt] >
14332 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14333 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14334 returned. Otherwise, if the template-name names a function, or set
14335 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14336 names a class, returns a TYPE_DECL for the specialization.
14338 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14339 uninstantiated templates. */
14341 static tree
14347 {
14349 tree templ;
14350 tree arguments;
14351 tree template_id;
14358 /* If the next token corresponds to a template-id, there is no need
14359 to reparse it. */
14362 {
14365 /* Get the stored value. */
14367 /* Perform any access checks that were deferred. */
14370 {
14375 tf_warning_or_error);
14376 }
14377 /* Return the stored value. */
14379 }
14381 /* Avoid performing name lookup if there is no possibility of
14382 finding a template-id. */
14385 && !cp_parser_nth_token_starts_template_argument_list_p
14387 {
14390 }
14392 /* Remember where the template-id starts. */
14398 /* Parse the template-name. */
14401 check_dependency_p,
14402 is_declaration,
14403 tag_type,
14406 {
14409 }
14411 /* If we find the sequence `[:' after a template-name, it's probably
14412 a digraph-typo for `< ::'. Substitute the tokens and check if we can
14413 parse correctly the argument list. */
14420 {
14422 /* Change `:' into `::'. */
14424 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
14425 CPP_LESS. */
14428 /* Parse the arguments. */
14431 {
14432 /* If we couldn't parse an argument list, then we revert our changes
14433 and return simply an error. Maybe this is not a template-id
14434 after all. */
14439 }
14440 /* Otherwise, emit an error about the invalid digraph, but continue
14441 parsing because we got our argument list. */
14444 {
14447 "%<<:%> is an alternate spelling for %<[%>."
14450 {
14452 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
14455 }
14456 }
14457 }
14458 else
14459 {
14460 /* Look for the `<' that starts the template-argument-list. */
14462 {
14465 }
14466 /* Parse the arguments. */
14468 }
14470 /* Build a representation of the specialization. */
14473 TEMPLATE_ID_EXPR,
14477 {
14479 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
14480 template (rather than some instantiation thereof) only if
14481 is not nested within some other construct. For example, in
14482 "template <typename T> void f(T) { A<T>::", A<T> is just an
14483 instantiation of A. */
14486 CPP_SCOPE));
14487 template_id
14489 }
14490 /* A template-like identifier may be a partial concept id. */
14496 {
14500 }
14501 else
14502 {
14503 /* If it's not a class-template or a template-template, it should be
14504 a function-template. */
14512 }
14514 /* If parsing tentatively, replace the sequence of tokens that makes
14515 up the template-id with a CPP_TEMPLATE_ID token. That way,
14516 should we re-parse the token stream, we will not have to repeat
14517 the effort required to do the parse, nor will we issue duplicate
14518 error messages about problems during instantiation of the
14519 template. */
14521 /* Don't do this if we had a parse error in a declarator; re-parsing
14522 might succeed if a name changes meaning (60361). */
14526 {
14529 /* Reset the contents of the START_OF_ID token. */
14531 /* Retrieve any deferred checks. Do not pop this access checks yet
14532 so the memory will not be reclaimed during token replacing below. */
14538 /* Purge all subsequent tokens. */
14541 /* ??? Can we actually assume that, if template_id ==
14542 error_mark_node, we will have issued a diagnostic to the
14543 user, as opposed to simply marking the tentative parse as
14544 failed? */
14547 }
14551 }
14553 /* Parse a template-name.
14555 template-name:
14556 identifier
14558 The standard should actually say:
14560 template-name:
14561 identifier
14562 operator-function-id
14564 A defect report has been filed about this issue.
14566 A conversion-function-id cannot be a template name because they cannot
14567 be part of a template-id. In fact, looking at this code:
14569 a.operator K<int>()
14571 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
14572 It is impossible to call a templated conversion-function-id with an
14573 explicit argument list, since the only allowed template parameter is
14574 the type to which it is converting.
14576 If TEMPLATE_KEYWORD_P is true, then we have just seen the
14577 `template' keyword, in a construction like:
14579 T::template f<3>()
14581 In that case `f' is taken to be a template-name, even though there
14582 is no way of knowing for sure.
14584 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
14585 name refers to a set of overloaded functions, at least one of which
14586 is a template, or an IDENTIFIER_NODE with the name of the template,
14587 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
14588 names are looked up inside uninstantiated templates. */
14590 static tree
14597 {
14598 tree identifier;
14599 tree decl;
14600 tree fns;
14603 /* If the next token is `operator', then we have either an
14604 operator-function-id or a conversion-function-id. */
14606 {
14607 /* We don't know whether we're looking at an
14608 operator-function-id or a conversion-function-id. */
14610 /* Try an operator-function-id. */
14612 /* If that didn't work, try a conversion-function-id. */
14614 {
14617 }
14618 }
14619 /* Look for the identifier. */
14620 else
14623 /* If we didn't find an identifier, we don't have a template-id. */
14627 /* If the name immediately followed the `template' keyword, then it
14628 is a template-name. However, if the next token is not `<', then
14629 we do not treat it as a template-name, since it is not being used
14630 as part of a template-id. This enables us to handle constructs
14631 like:
14633 template <typename T> struct S { S(); };
14634 template <typename T> S<T>::S();
14636 correctly. We would treat `S' as a template -- if it were `S<T>'
14637 -- but we do not if there is no `<'. */
14641 {
14642 /* In a declaration, in a dependent context, we pretend that the
14643 "template" keyword was present in order to improve error
14644 recovery. For example, given:
14646 template <typename T> void f(T::X<int>);
14648 we want to treat "X<int>" as a template-id. */
14650 && !template_keyword_p
14652 && check_dependency_p
14654 /* Do not do this for dtors (or ctors), since they never
14655 need the template keyword before their name. */
14657 {
14660 /* Explain what went wrong. */
14662 identifier);
14665 /* If parsing tentatively, find the location of the "<" token. */
14668 /* Parse the template arguments so that we can issue error
14669 messages about them. */
14672 /* Skip tokens until we find a good place from which to
14673 continue parsing. */
14678 /* If parsing tentatively, permanently remove the
14679 template argument list. That will prevent duplicate
14680 error messages from being issued about the missing
14681 "template" keyword. */
14687 }
14689 /* If the "template" keyword is present, then there is generally
14690 no point in doing name-lookup, so we just return IDENTIFIER.
14691 But, if the qualifying scope is non-dependent then we can
14692 (and must) do name-lookup normally. */
14698 }
14700 /* Look up the name. */
14702 tag_type,
14705 check_dependency_p,
14711 /* If DECL is a template, then the name was a template-name. */
14713 {
14717 }
14718 else
14719 {
14722 /* The standard does not explicitly indicate whether a name that
14723 names a set of overloaded declarations, some of which are
14724 templates, is a template-name. However, such a name should
14725 be a template-name; otherwise, there is no way to form a
14726 template-id for the overloaded templates. */
14734 {
14735 /* The name does not name a template. */
14738 }
14739 }
14741 /* If DECL is dependent, and refers to a function, then just return
14742 its name; we will look it up again during template instantiation. */
14744 {
14748 }
14751 }
14753 /* Parse a template-argument-list.
14755 template-argument-list:
14756 template-argument ... [opt]
14757 template-argument-list , template-argument ... [opt]
14759 Returns a TREE_VEC containing the arguments. */
14761 static tree
14763 {
14768 tree vec;
14775 /* Even if the template-id appears in an integral
14776 constant-expression, the contents of the argument list do
14777 not. */
14783 /* Parse the arguments. */
14784 do
14785 {
14786 tree argument;
14789 /* Consume the comma. */
14792 /* Parse the template-argument. */
14795 /* If the next token is an ellipsis, we're expanding a template
14796 argument pack. */
14798 {
14800 {
14804 }
14805 /* Consume the `...' token. */
14808 /* Make the argument into a TYPE_PACK_EXPANSION or
14809 EXPR_PACK_EXPANSION. */
14811 }
14814 {
14818 {
14821 }
14822 else
14824 }
14826 }
14842 }
14844 /* Parse a template-argument.
14846 template-argument:
14847 assignment-expression
14848 type-id
14849 id-expression
14851 The representation is that of an assignment-expression, type-id, or
14852 id-expression -- except that the qualified id-expression is
14853 evaluated, so that the value returned is either a DECL or an
14854 OVERLOAD.
14856 Although the standard says "assignment-expression", it forbids
14857 throw-expressions or assignments in the template argument.
14858 Therefore, we use "conditional-expression" instead. */
14860 static tree
14862 {
14863 tree argument;
14869 cp_id_kind idk;
14871 /* There's really no way to know what we're looking at, so we just
14872 try each alternative in order.
14874 [temp.arg]
14876 In a template-argument, an ambiguity between a type-id and an
14877 expression is resolved to a type-id, regardless of the form of
14878 the corresponding template-parameter.
14880 Therefore, we try a type-id first. */
14883 /* If there was no error parsing the type-id but the next token is a
14884 '>>', our behavior depends on which dialect of C++ we're
14885 parsing. In C++98, we probably found a typo for '> >'. But there
14886 are type-id which are also valid expressions. For instance:
14888 struct X { int operator >> (int); };
14889 template <int V> struct Foo {};
14890 Foo<X () >> 5> r;
14892 Here 'X()' is a valid type-id of a function type, but the user just
14893 wanted to write the expression "X() >> 5". Thus, we remember that we
14894 found a valid type-id, but we still try to parse the argument as an
14895 expression to see what happens.
14897 In C++0x, the '>>' will be considered two separate '>'
14898 tokens. */
14902 {
14905 }
14906 else
14907 {
14908 /* If the next token isn't a `,' or a `>', then this argument wasn't
14909 really finished. This means that the argument is not a valid
14910 type-id. */
14913 /* If that worked, we're done. */
14916 }
14917 /* We're still not sure what the argument will be. */
14919 /* Try a template. */
14927 /* If the next token isn't a `,' or a `>', then this argument wasn't
14928 really finished. */
14932 {
14933 /* Figure out what is being referred to. If the id-expression
14934 was for a class template specialization, then we will have a
14935 TYPE_DECL at this point. There is no need to do name lookup
14936 at this point in that case. */
14939 none_type,
14945 /* Handle a constrained-type-specifier for a non-type template
14946 parameter. */
14952 }
14954 {
14958 }
14959 /* It must be a non-type argument. In C++17 any constant-expression is
14960 allowed. */
14964 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
14966 -- an integral constant-expression of integral or enumeration
14967 type; or
14969 -- the name of a non-type template-parameter; or
14971 -- the name of an object or function with external linkage...
14973 -- the address of an object or function with external linkage...
14975 -- a pointer to member... */
14976 /* Look for a non-type template parameter. */
14978 {
14990 }
14992 /* If the next token is "&", the argument must be the address of an
14993 object or function with external linkage. */
14996 {
14999 }
15000 /* See if we might have an id-expression. */
15007 {
15010 address_p,
15017 else
15018 {
15019 tree probe;
15022 {
15023 /* Strip the dereference temporarily. */
15026 }
15028 /* If we're in a template, we represent a qualified-id referring
15029 to a static data member as a SCOPE_REF even if the scope isn't
15030 dependent so that we can check access control later. */
15035 {
15036 /* A variable without external linkage might still be a
15037 valid constant-expression, so no error is issued here
15038 if the external-linkage check fails. */
15041 }
15043 /* All overloaded functions are allowed; if the external
15044 linkage test does not pass, an error will be issued
15045 later. */
15046 ;
15050 /* A pointer-to-member. */
15051 ;
15053 ;
15054 else
15058 {
15061 tf_warning_or_error);
15062 else
15065 }
15066 }
15067 }
15068 /* If the argument started with "&", there are no other valid
15069 alternatives at this point. */
15071 {
15074 }
15076 general_expr:
15077 /* If the argument wasn't successfully parsed as a type-id followed
15078 by '>>', the argument can only be a constant expression now.
15079 Otherwise, we try parsing the constant-expression tentatively,
15080 because the argument could really be a type-id. */
15091 /* We did our best to parse the argument as a non type-id, but that
15092 was the only alternative that matched (albeit with a '>' after
15093 it). We can assume it's just a typo from the user, and a
15094 diagnostic will then be issued. */
15096 }
15098 /* Parse an explicit-instantiation.
15100 explicit-instantiation:
15101 template declaration
15103 Although the standard says `declaration', what it really means is:
15105 explicit-instantiation:
15106 template decl-specifier-seq [opt] declarator [opt] ;
15108 Things like `template int S<int>::i = 5, int S<double>::j;' are not
15109 supposed to be allowed. A defect report has been filed about this
15110 issue.
15112 GNU Extension:
15114 explicit-instantiation:
15115 storage-class-specifier template
15116 decl-specifier-seq [opt] declarator [opt] ;
15117 function-specifier template
15118 decl-specifier-seq [opt] declarator [opt] ; */
15120 static void
15122 {
15124 cp_decl_specifier_seq decl_specifiers;
15129 /* Look for an (optional) storage-class-specifier or
15130 function-specifier. */
15132 {
15133 extension_specifier
15136 extension_specifier
15139 }
15141 /* Look for the `template' keyword. */
15143 /* Let the front end know that we are processing an explicit
15144 instantiation. */
15146 /* [temp.explicit] says that we are supposed to ignore access
15147 control while processing explicit instantiation directives. */
15149 /* Parse a decl-specifier-seq. */
15151 CP_PARSER_FLAGS_OPTIONAL,
15154 /* If there was exactly one decl-specifier, and it declared a class,
15155 and there's no declarator, then we have an explicit type
15156 instantiation. */
15158 {
15159 tree type;
15163 /* Turn access control back on for names used during
15164 template instantiation. */
15169 }
15170 else
15171 {
15173 tree decl;
15175 /* Parse the declarator. */
15176 declarator
15187 {
15190 "explicit instantiation shall not use"
15194 "explicit instantiation shall not use"
15199 /* Turn access control back on for names used during
15200 template instantiation. */
15202 /* Do the explicit instantiation. */
15204 }
15205 else
15206 {
15208 /* Skip the body of the explicit instantiation. */
15210 }
15211 }
15212 /* We're done with the instantiation. */
15218 }
15220 /* Parse an explicit-specialization.
15222 explicit-specialization:
15223 template < > declaration
15225 Although the standard says `declaration', what it really means is:
15227 explicit-specialization:
15228 template <> decl-specifier [opt] init-declarator [opt] ;
15229 template <> function-definition
15230 template <> explicit-specialization
15231 template <> template-declaration */
15233 static void
15235 {
15239 /* Look for the `template' keyword. */
15241 /* Look for the `<'. */
15243 /* Look for the `>'. */
15245 /* We have processed another parameter list. */
15247 /* [temp]
15249 A template ... explicit specialization ... shall not have C
15250 linkage. */
15252 {
15254 /* Give it C++ linkage to avoid confusing other parts of the
15255 front end. */
15258 }
15259 else
15261 /* Let the front end know that we are beginning a specialization. */
15263 {
15266 }
15268 /* If the next keyword is `template', we need to figure out whether
15269 or not we're looking a template-declaration. */
15271 {
15276 else
15278 }
15279 else
15280 /* Parse the dependent declaration. */
15286 /* We're done with the specialization. */
15288 /* For the erroneous case of a template with C linkage, we pushed an
15289 implicit C++ linkage scope; exit that scope now. */
15292 /* We're done with this parameter list. */
15294 }
15296 /* Parse a type-specifier.
15298 type-specifier:
15299 simple-type-specifier
15300 class-specifier
15301 enum-specifier
15302 elaborated-type-specifier
15303 cv-qualifier
15305 GNU Extension:
15307 type-specifier:
15308 __complex__
15310 Returns a representation of the type-specifier. For a
15311 class-specifier, enum-specifier, or elaborated-type-specifier, a
15312 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15314 The parser flags FLAGS is used to control type-specifier parsing.
15316 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15317 in a decl-specifier-seq.
15319 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15320 class-specifier, enum-specifier, or elaborated-type-specifier, then
15321 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15322 if a type is declared; 2 if it is defined. Otherwise, it is set to
15323 zero.
15325 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15326 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15327 is set to FALSE. */
15329 static tree
15331 cp_parser_flags flags,
15336 {
15342 /* Assume this type-specifier does not declare a new type. */
15345 /* And that it does not specify a cv-qualifier. */
15348 /* Peek at the next token. */
15351 /* If we're looking at a keyword, we can use that to guide the
15352 production we choose. */
15355 {
15360 /* Look for the enum-specifier. */
15362 /* If that worked, we're done. */
15364 {
15369 type_spec,
15370 token,
15373 }
15374 else
15377 /* Any of these indicate either a class-specifier, or an
15378 elaborated-type-specifier. */
15385 /* Parse tentatively so that we can back up if we don't find a
15386 class-specifier. */
15388 /* Look for the class-specifier. */
15391 /* If that worked, we're done. */
15393 {
15398 type_spec,
15399 token,
15402 }
15404 /* Fall through. */
15405 elaborated_type_specifier:
15406 /* We're declaring (not defining) a class or enum. */
15410 /* Fall through. */
15412 /* Look for an elaborated-type-specifier. */
15413 type_spec
15414 = (cp_parser_elaborated_type_specifier
15417 is_declaration));
15420 type_spec,
15421 token,
15444 /* The `__complex__' keyword is a GNU extension. */
15450 }
15452 /* Handle simple keywords. */
15454 {
15456 {
15459 }
15461 }
15463 /* If we do not already have a type-specifier, assume we are looking
15464 at a simple-type-specifier. */
15466 decl_specs,
15467 flags);
15469 /* If we didn't find a type-specifier, and a type-specifier was not
15470 optional in this context, issue an error message. */
15472 {
15475 }
15478 }
15480 /* Parse a simple-type-specifier.
15482 simple-type-specifier:
15483 :: [opt] nested-name-specifier [opt] type-name
15484 :: [opt] nested-name-specifier template template-id
15485 char
15486 wchar_t
15487 bool
15488 short
15489 int
15490 long
15491 signed
15492 unsigned
15493 float
15494 double
15495 void
15497 C++0x Extension:
15499 simple-type-specifier:
15500 auto
15501 decltype ( expression )
15502 char16_t
15503 char32_t
15504 __underlying_type ( type-id )
15506 GNU Extension:
15508 simple-type-specifier:
15509 __int128
15510 __typeof__ unary-expression
15511 __typeof__ ( type-id )
15512 __typeof__ ( type-id ) { initializer-list , [opt] }
15514 Concepts Extension:
15516 simple-type-specifier:
15517 constrained-type-specifier
15519 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
15520 appropriately updated. */
15522 static tree
15525 cp_parser_flags flags)
15526 {
15531 /* Peek at the next token. */
15534 /* If we're looking at a keyword, things are easy. */
15536 {
15571 {
15574 }
15603 {
15604 /* The 'auto' might be the placeholder return type for a function decl
15605 with trailing return type. */
15609 {
15617 have_trailing_return_fn_decl
15620 }
15623 {
15626 }
15629 {
15632 }
15633 else
15637 {
15640 "use of %<auto%> in lambda parameter declaration "
15641 "only available with "
15643 }
15646 "use of %<auto%> in parameter declaration "
15647 "only available with "
15649 else
15651 "ISO C++ forbids use of %<auto%> in parameter "
15653 }
15654 else
15659 /* Since DR 743, decltype can either be a simple-type-specifier by
15660 itself or begin a nested-name-specifier. Parsing it will replace
15661 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
15662 handling below decide what to do. */
15668 /* Consume the `typeof' token. */
15670 /* Parse the operand to `typeof'. */
15672 /* If it is not already a TYPE, take its type. */
15678 token,
15687 token,
15697 token,
15702 }
15704 /* If token is an already-parsed decltype not followed by ::,
15705 it's a simple-type-specifier. */
15708 {
15711 {
15713 token,
15715 /* Remember that we are handling a decltype in order to
15716 implement the resolution of DR 1510 when the argument
15717 isn't instantiation dependent. */
15719 }
15722 }
15724 /* If the type-specifier was for a built-in type, we're done. */
15726 {
15727 /* Record the type. */
15734 type,
15735 token,
15740 /* Consume the token. */
15746 /* There is no valid C++ program where a non-template type is
15747 followed by a "<". That usually indicates that the user thought
15748 that the type was a template. */
15753 }
15755 /* The type-specifier must be a user-defined type. */
15757 {
15761 /* Don't gobble tokens or issue error messages if this is an
15762 optional type-specifier. */
15766 /* Look for the optional `::' operator. */
15767 global_p
15771 /* Look for the nested-name specifier. */
15772 qualified_p
15780 /* If we have seen a nested-name-specifier, and the next token
15781 is `template', then we are using the template-id production. */
15784 {
15785 /* Look for the template-id. */
15789 none_type,
15791 /* If the template-id did not name a type, we are out of
15792 luck. */
15794 {
15797 }
15798 }
15799 /* Otherwise, look for a type-name. */
15800 else
15802 /* Keep track of all name-lookups performed in class scopes. */
15804 && !global_p
15805 && !qualified_p
15809 /* If it didn't work out, we don't have a TYPE. */
15815 token,
15817 }
15819 /* If we didn't get a type-name, issue an error message. */
15821 {
15824 }
15827 {
15828 /* See if TYPE is an Objective-C type, and if so, parse and
15829 accept any protocol references following it. Do this before
15830 the cp_parser_check_for_invalid_template_id() call, because
15831 Objective-C types can be followed by '<...>' which would
15832 enclose protocol names rather than template arguments, and so
15833 everything is fine. */
15836 {
15840 /* Clobber the "unqualified" type previously entered into
15841 DECL_SPECS with the new, improved protocol-qualified version. */
15846 }
15848 /* There is no valid C++ program where a non-template type is
15849 followed by a "<". That usually indicates that the user
15850 thought that the type was a template. */
15852 none_type,
15854 }
15857 }
15859 /* Parse a type-name.
15861 type-name:
15862 class-name
15863 enum-name
15864 typedef-name
15865 simple-template-id [in c++0x]
15867 enum-name:
15868 identifier
15870 typedef-name:
15871 identifier
15873 Concepts:
15875 type-name:
15876 concept-name
15877 partial-concept-id
15879 concept-name:
15880 identifier
15882 Returns a TYPE_DECL for the type. */
15884 static tree
15886 {
15888 }
15890 /* See above. */
15891 static tree
15893 {
15894 tree type_decl;
15896 /* We can't know yet whether it is a class-name or not. */
15898 /* Try a class-name. */
15900 typename_keyword_p,
15902 none_type,
15906 /* If it's not a class-name, keep looking. */
15908 {
15910 /* It must be a typedef-name or an enum-name. */
15914 /* It is either a simple-template-id representing an
15915 instantiation of an alias template... */
15919 none_type,
15921 /* Note that this must be an instantiation of an alias template
15922 because [temp.names]/6 says:
15924 A template-id that names an alias template specialization
15925 is a type-name.
15927 Whereas [temp.names]/7 says:
15929 A simple-template-id that names a class template
15930 specialization is a class-name.
15932 With concepts, this could also be a partial-concept-id that
15933 declares a non-type template parameter. */
15940 else
15944 /* ... Or a typedef-name or an enum-name. */
15946 }
15949 }
15951 /* Check if DECL and ARGS can form a constrained-type-specifier.
15952 If ARGS is non-null, we try to form a concept check of the
15953 form DECL<?, ARGS> where ? is a wildcard that matches any
15954 kind of template argument. If ARGS is NULL, then we try to
15955 form a concept check of the form DECL<?>. */
15957 static tree
15960 {
15963 /* If we a constrained-type-specifier cannot be deduced. */
15967 /* A constrained type specifier can only be found in an
15968 overload set or as a reference to a template declaration.
15970 FIXME: This might be masking a bug. It's possible that
15971 that the deduction below is causing template specializations
15972 to be formed with the wildcard as an argument. */
15976 /* Try to build a call expression that evaluates the
15977 concept. This can fail if the overload set refers
15978 only to non-templates. */
15984 /* Deduce the checked constraint and the prototype parameter.
15986 FIXME: In certain cases, failure to deduce should be a
15987 diagnosable error. */
15988 tree conc;
15989 tree proto;
15993 /* In template parameter scope, this results in a constrained
15994 parameter. Return a descriptor of that parm. */
15998 /* In a parameter-declaration-clause, constrained-type
15999 specifiers result in invented template parameters. */
16001 {
16004 }
16005 else
16006 {
16007 /* Otherwise, we're in a context where the constrained
16008 type name is deduced and the constraint applies
16009 after deduction. */
16011 }
16014 }
16016 /* If DECL refers to a concept, return a TYPE_DECL representing
16017 the result of using the constrained type specifier in the
16018 current context. DECL refers to a concept if
16020 - it is an overload set containing a function concept taking a single
16021 type argument, or
16023 - it is a variable concept taking a single type argument. */
16025 static tree
16027 {
16033 else
16035 }
16037 /* Check if DECL and ARGS form a partial-concept-id. If so,
16038 assign ID to the resulting constrained placeholder.
16040 Returns true if the partial-concept-id designates a placeholder
16041 and false otherwise. Note that *id is set to NULL_TREE in
16042 this case. */
16044 static tree
16046 {
16048 }
16050 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
16051 or a concept-name.
16053 enum-name:
16054 identifier
16056 typedef-name:
16057 identifier
16059 concept-name:
16060 identifier
16062 Returns a TYPE_DECL for the type. */
16064 static tree
16066 {
16067 tree type_decl;
16068 tree identifier;
16075 /* Look up the type-name. */
16080 /* If we found an overload set, then it may refer to a concept-name. */
16086 {
16087 /* See if this is an Objective-C type. */
16092 }
16094 /* Issue an error if we did not find a type-name. */
16096 /* In Objective-C, we have the complication that class names are
16097 normally type names and start declarations (eg, the
16098 "NSObject" in "NSObject *object;"), but can be used in an
16099 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
16100 is an expression. So, a classname followed by a dot is not a
16101 valid type-name. */
16104 {
16109 }
16110 /* Remember that the name was used in the definition of the
16111 current class so that we can check later to see if the
16112 meaning would have been different after the class was
16113 entirely defined. */
16119 }
16121 /* Parse an elaborated-type-specifier. Note that the grammar given
16122 here incorporates the resolution to DR68.
16124 elaborated-type-specifier:
16125 class-key :: [opt] nested-name-specifier [opt] identifier
16126 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
16127 enum-key :: [opt] nested-name-specifier [opt] identifier
16128 typename :: [opt] nested-name-specifier identifier
16129 typename :: [opt] nested-name-specifier template [opt]
16130 template-id
16132 GNU extension:
16134 elaborated-type-specifier:
16135 class-key attributes :: [opt] nested-name-specifier [opt] identifier
16136 class-key attributes :: [opt] nested-name-specifier [opt]
16137 template [opt] template-id
16138 enum attributes :: [opt] nested-name-specifier [opt] identifier
16140 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
16141 declared `friend'. If IS_DECLARATION is TRUE, then this
16142 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
16143 something is being declared.
16145 Returns the TYPE specified. */
16147 static tree
16151 {
16153 tree identifier;
16156 tree globalscope;
16159 /* See if we're looking at the `enum' keyword. */
16161 {
16162 /* Consume the `enum' token. */
16164 /* Remember that it's an enumeration type. */
16166 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
16167 enums) is used here. */
16170 {
16174 /* Consume the `struct' or `class' and parse it anyway. */
16176 }
16177 /* Parse the attributes. */
16179 }
16180 /* Or, it might be `typename'. */
16182 RID_TYPENAME))
16183 {
16184 /* Consume the `typename' token. */
16186 /* Remember that it's a `typename' type. */
16188 }
16189 /* Otherwise it must be a class-key. */
16190 else
16191 {
16195 /* Parse the attributes. */
16197 }
16199 /* Look for the `::' operator. */
16202 /* Look for the nested-name-specifier. */
16204 {
16209 is_declaration))
16211 }
16212 else
16213 /* Even though `typename' is not present, the proposed resolution
16214 to Core Issue 180 says that in `class A<T>::B', `B' should be
16215 considered a type-name, even if `A<T>' is dependent. */
16220 is_declaration);
16221 /* For everything but enumeration types, consider a template-id.
16222 For an enumeration type, consider only a plain identifier. */
16224 {
16226 tree decl;
16228 /* Allow the `template' keyword. */
16230 /* If we didn't see `template', we don't know if there's a
16231 template-id or not. */
16234 /* Parse the template-id. */
16238 tag_type,
16239 is_declaration);
16240 /* If we didn't find a template-id, look for an ordinary
16241 identifier. */
16243 ;
16244 /* We can get here when cp_parser_template_id, called by
16245 cp_parser_class_name with tag_type == none_type, succeeds
16246 and caches a BASELINK. Then, when called again here,
16247 instead of failing and returning an error_mark_node
16248 returns it (see template/typename17.C in C++11).
16249 ??? Could we diagnose this earlier? */
16251 {
16254 }
16255 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
16256 in effect, then we must assume that, upon instantiation, the
16257 template will correspond to a class. */
16261 typename_type,
16263 /* If the `typename' keyword is in effect and DECL is not a type
16264 decl, then type is non existent. */
16266 ;
16272 }
16275 {
16280 {
16283 }
16285 /* For a `typename', we needn't call xref_tag. */
16291 /* Template parameter lists apply only if we are not within a
16292 function parameter list. */
16293 bool template_parm_lists_apply
16302 /* Look up a qualified name in the usual way. */
16304 {
16305 tree decl;
16306 tree ambiguous_decls;
16309 tag_type,
16316 /* If the lookup was ambiguous, an error will already have been
16317 issued. */
16321 /* If we are parsing friend declaration, DECL may be a
16322 TEMPLATE_DECL tree node here. However, we need to check
16323 whether this TEMPLATE_DECL results in valid code. Consider
16324 the following example:
16326 namespace N {
16327 template <class T> class C {};
16328 }
16329 class X {
16330 template <class T> friend class N::C; // #1, valid code
16331 };
16332 template <class T> class Y {
16333 friend class N::C; // #2, invalid code
16334 };
16336 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
16337 name lookup of `N::C'. We see that friend declaration must
16338 be template for the code to be valid. Note that
16339 processing_template_decl does not work here since it is
16340 always 1 for the above two cases. */
16342 decl = (cp_parser_maybe_treat_template_as_class
16347 {
16349 identifier,
16352 }
16355 {
16359 allow_template);
16363 }
16365 /* Forward declarations of nested types, such as
16367 class C1::C2;
16368 class C1::C2::C3;
16370 are invalid unless all components preceding the final '::'
16371 are complete. If all enclosing types are complete, these
16372 declarations become merely pointless.
16374 Invalid forward declarations of nested types are errors
16375 caught elsewhere in parsing. Those that are pointless arrive
16376 here. */
16383 }
16384 else
16385 {
16386 /* An elaborated-type-specifier sometimes introduces a new type and
16387 sometimes names an existing type. Normally, the rule is that it
16388 introduces a new type only if there is not an existing type of
16389 the same name already in scope. For example, given:
16391 struct S {};
16392 void f() { struct S s; }
16394 the `struct S' in the body of `f' is the same `struct S' as in
16395 the global scope; the existing definition is used. However, if
16396 there were no global declaration, this would introduce a new
16397 local class named `S'.
16399 An exception to this rule applies to the following code:
16401 namespace N { struct S; }
16403 Here, the elaborated-type-specifier names a new type
16404 unconditionally; even if there is already an `S' in the
16405 containing scope this declaration names a new type.
16406 This exception only applies if the elaborated-type-specifier
16407 forms the complete declaration:
16409 [class.name]
16411 A declaration consisting solely of `class-key identifier ;' is
16412 either a redeclaration of the name in the current scope or a
16413 forward declaration of the identifier as a class name. It
16414 introduces the name into the current scope.
16416 We are in this situation precisely when the next token is a `;'.
16418 An exception to the exception is that a `friend' declaration does
16419 *not* name a new type; i.e., given:
16421 struct S { friend struct T; };
16423 `T' is not a new type in the scope of `S'.
16425 Also, `new struct S' or `sizeof (struct S)' never results in the
16426 definition of a new type; a new type can only be declared in a
16427 declaration context. */
16429 tag_scope ts;
16433 /* Friends have special name lookup rules. */
16437 CPP_SEMICOLON))
16438 /* This is a `class-key identifier ;' */
16440 else
16443 template_p =
16444 (template_parm_lists_apply
16447 /* An unqualified name was used to reference this type, so
16448 there were no qualifying templates. */
16456 }
16457 }
16462 /* Allow attributes on forward declarations of classes. */
16464 {
16474 else
16477 }
16480 {
16481 /* Indicate whether this class was declared as a `class' or as a
16482 `struct'. */
16486 }
16488 /* A "<" cannot follow an elaborated type specifier. If that
16489 happens, the user was probably trying to form a template-id. */
16494 }
16496 /* Parse an enum-specifier.
16498 enum-specifier:
16499 enum-head { enumerator-list [opt] }
16500 enum-head { enumerator-list , } [C++0x]
16502 enum-head:
16503 enum-key identifier [opt] enum-base [opt]
16504 enum-key nested-name-specifier identifier enum-base [opt]
16506 enum-key:
16507 enum
16508 enum class [C++0x]
16509 enum struct [C++0x]
16511 enum-base: [C++0x]
16512 : type-specifier-seq
16514 opaque-enum-specifier:
16515 enum-key identifier enum-base [opt] ;
16517 GNU Extensions:
16518 enum-key attributes[opt] identifier [opt] enum-base [opt]
16519 { enumerator-list [opt] }attributes[opt]
16520 enum-key attributes[opt] identifier [opt] enum-base [opt]
16521 { enumerator-list, }attributes[opt] [C++0x]
16523 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
16524 if the token stream isn't an enum-specifier after all. */
16526 static tree
16528 {
16529 tree identifier;
16531 tree prev_scope;
16533 tree attributes;
16546 /* Parse tentatively so that we can back up if we don't find a
16547 enum-specifier. */
16550 /* Caller guarantees that the current token is 'enum', an identifier
16551 possibly follows, and the token after that is an opening brace.
16552 If we don't have an identifier, fabricate an anonymous name for
16553 the enumeration being defined. */
16556 /* Parse the "class" or "struct", which indicates a scoped
16557 enumeration type in C++0x. */
16560 {
16564 /* Consume the `struct' or `class' token. */
16568 }
16572 /* Clear the qualification. */
16577 /* Figure out in what scope the declaration is being placed. */
16583 nested_name_specifier
16591 {
16592 tree name;
16596 enum_type,
16601 input_location);
16603 {
16606 {
16607 /* Are template enums allowed in ISO? */
16611 /* ignore a typename reference, for it will be solved by name
16612 in start_enum. */
16614 }
16615 }
16618 else
16619 {
16624 }
16625 }
16626 else
16627 {
16630 else
16631 {
16637 }
16638 }
16641 /* Check for the `:' that denotes a specified underlying type in C++0x.
16642 Note that a ':' could also indicate a bitfield width, however. */
16644 {
16645 cp_decl_specifier_seq type_specifiers;
16647 /* Consume the `:'. */
16650 /* Parse the type-specifier-seq. */
16655 /* At this point this is surely not elaborated type specifier. */
16664 /* If that didn't work, stop. */
16666 {
16672 }
16673 }
16675 /* Look for the `{' but don't consume it yet. */
16677 {
16679 {
16682 {
16685 }
16686 }
16687 /* An opaque-enum-specifier must have a ';' here. */
16690 {
16693 {
16696 }
16697 }
16698 }
16704 {
16706 {
16710 }
16712 {
16714 }
16715 }
16717 /* Issue an error message if type-definitions are forbidden here. */
16720 else
16721 /* Create the new type. We do this before consuming the opening
16722 brace so the enum will be recorded as being on the line of its
16723 tag (or the 'enum' keyword, if there is no tag). */
16727 /* If the next token is not '{' it is an opaque-enum-specifier or an
16728 elaborated-type-specifier. */
16730 {
16734 {
16735 /* The following catches invalid code such as:
16736 enum class S<int>::E { A, B, C }; */
16744 {
16748 nested_name_specifier);
16750 }
16753 {
16755 "%qT for enum declaration does not name a class "
16758 }
16759 /* If that scope does not contain the scope in which the
16760 class was originally declared, the program is invalid. */
16762 nested_name_specifier))
16763 {
16766 "declaration of %qD in namespace %qD which does not "
16769 else
16771 "declaration of %qD in %qD which does not "
16775 }
16776 }
16781 /* Consume the opening brace. */
16788 {
16792 }
16793 else
16794 {
16800 }
16804 /* If the next token is not '}', then there are some enumerators. */
16806 {
16810 }
16811 else
16814 /* Consume the final '}'. */
16820 }
16821 else
16822 {
16823 /* If a ';' follows, then it is an opaque-enum-specifier
16824 and additional restrictions apply. */
16826 {
16833 }
16834 }
16836 /* Look for trailing attributes to apply to this enumeration, and
16837 apply them if appropriate. */
16839 {
16843 trailing_attr,
16845 }
16847 /* Finish up the enumeration. */
16849 {
16854 }
16857 {
16859 {
16862 }
16864 {
16866 }
16867 }
16868 out:
16871 }
16873 /* Parse an enumerator-list. The enumerators all have the indicated
16874 TYPE.
16876 enumerator-list:
16877 enumerator-definition
16878 enumerator-list , enumerator-definition */
16880 static void
16882 {
16884 {
16885 /* Parse an enumerator-definition. */
16888 /* If the next token is not a ',', we've reached the end of
16889 the list. */
16892 /* Otherwise, consume the `,' and keep going. */
16894 /* If the next token is a `}', there is a trailing comma. */
16896 {
16901 }
16902 }
16903 }
16905 /* Parse an enumerator-definition. The enumerator has the indicated
16906 TYPE.
16908 enumerator-definition:
16909 enumerator
16910 enumerator = constant-expression
16912 enumerator:
16913 identifier
16915 GNU Extensions:
16917 enumerator-definition:
16918 enumerator attributes [opt]
16919 enumerator attributes [opt] = constant-expression */
16921 static void
16923 {
16924 tree identifier;
16925 tree value;
16926 location_t loc;
16928 /* Save the input location because we are interested in the location
16929 of the identifier and not the location of the explicit value. */
16932 /* Look for the identifier. */
16937 /* Parse any specified attributes. */
16940 /* If the next token is an '=', then there is an explicit value. */
16942 {
16943 /* Consume the `=' token. */
16945 /* Parse the value. */
16947 }
16948 else
16951 /* If we are processing a template, make sure the initializer of the
16952 enumerator doesn't contain any bare template parameter pack. */
16956 /* Create the enumerator. */
16958 }
16960 /* Parse a namespace-name.
16962 namespace-name:
16963 original-namespace-name
16964 namespace-alias
16966 Returns the NAMESPACE_DECL for the namespace. */
16968 static tree
16970 {
16971 tree identifier;
16972 tree namespace_decl;
16976 /* Get the name of the namespace. */
16981 /* Look up the identifier in the currently active scope. Look only
16982 for namespaces, due to:
16984 [basic.lookup.udir]
16986 When looking up a namespace-name in a using-directive or alias
16987 definition, only namespace names are considered.
16989 And:
16991 [basic.lookup.qual]
16993 During the lookup of a name preceding the :: scope resolution
16994 operator, object, function, and enumerator names are ignored.
16996 (Note that cp_parser_qualifying_entity only calls this
16997 function if the token after the name is the scope resolution
16998 operator.) */
17000 none_type,
17006 /* If it's not a namespace, issue an error. */
17009 {
17014 }
17017 }
17019 /* Parse a namespace-definition.
17021 namespace-definition:
17022 named-namespace-definition
17023 unnamed-namespace-definition
17025 named-namespace-definition:
17026 original-namespace-definition
17027 extension-namespace-definition
17029 original-namespace-definition:
17030 namespace identifier { namespace-body }
17032 extension-namespace-definition:
17033 namespace original-namespace-name { namespace-body }
17035 unnamed-namespace-definition:
17036 namespace { namespace-body } */
17038 static void
17040 {
17050 {
17054 }
17055 else
17058 /* Look for the `namespace' keyword. */
17061 /* Parse any specified attributes before the identifier. */
17064 /* Get the name of the namespace. We do not attempt to distinguish
17065 between an original-namespace-definition and an
17066 extension-namespace-definition at this point. The semantic
17067 analysis routines are responsible for that. */
17070 else
17073 /* Parse any specified attributes after the identifier. */
17076 {
17079 else
17081 }
17083 /* Start the namespace. */
17086 /* Parse any nested namespace definition. */
17088 {
17093 "nested namespace definitions only available with "
17098 {
17102 else
17103 {
17106 }
17109 }
17110 }
17112 /* Look for the `{' to validate starting the namespace. */
17115 /* "inline namespace" is equivalent to a stub namespace definition
17116 followed by a strong using directive. */
17118 {
17120 /* Set up namespace association. */
17124 /* Import the contents of the inline namespace. */
17128 }
17134 /* Parse the body of the namespace. */
17140 /* Finish the nested namespace definitions. */
17144 /* Finish the namespace. */
17146 /* Look for the final `}'. */
17148 }
17150 /* Parse a namespace-body.
17152 namespace-body:
17153 declaration-seq [opt] */
17155 static void
17157 {
17159 }
17161 /* Parse a namespace-alias-definition.
17163 namespace-alias-definition:
17164 namespace identifier = qualified-namespace-specifier ; */
17166 static void
17168 {
17169 tree identifier;
17170 tree namespace_specifier;
17174 /* Look for the `namespace' keyword. */
17176 /* Look for the identifier. */
17180 /* Look for the `=' token. */
17183 {
17185 /* Skip the definition. */
17190 }
17192 /* Look for the qualified-namespace-specifier. */
17193 namespace_specifier
17195 /* Look for the `;' token. */
17198 /* Register the alias in the symbol table. */
17200 }
17202 /* Parse a qualified-namespace-specifier.
17204 qualified-namespace-specifier:
17205 :: [opt] nested-name-specifier [opt] namespace-name
17207 Returns a NAMESPACE_DECL corresponding to the specified
17208 namespace. */
17210 static tree
17212 {
17213 /* Look for the optional `::'. */
17217 /* Look for the optional nested-name-specifier. */
17225 }
17227 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
17228 access declaration.
17230 using-declaration:
17231 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
17232 using :: unqualified-id ;
17234 access-declaration:
17235 qualified-id ;
17237 */
17239 static bool
17242 {
17246 tree decl;
17247 tree identifier;
17248 tree qscope;
17253 {
17256 }
17257 else
17258 {
17259 /* Look for the `using' keyword. */
17262 /* Peek at the next token. */
17264 /* See if it's `typename'. */
17266 {
17267 /* Remember that we've seen it. */
17269 /* Consume the `typename' token. */
17271 }
17272 }
17274 /* Look for the optional global scope qualification. */
17275 global_scope_p
17280 /* If we saw `typename', or didn't see `::', then there must be a
17281 nested-name-specifier present. */
17283 {
17289 {
17292 }
17293 }
17294 /* Otherwise, we could be in either of the two productions. In that
17295 case, treat the nested-name-specifier as optional. */
17296 else
17308 /* Something has already gone wrong; there's no need to parse
17309 further. Since an error has occurred, the return value of
17310 cp_parser_parse_definitely will be false, as required. */
17314 /* Parse the unqualified-id. */
17322 {
17327 }
17329 /* The function we call to handle a using-declaration is different
17330 depending on what scope we are in. */
17332 ;
17335 /* [namespace.udecl]
17337 A using declaration shall not name a template-id. */
17340 else
17341 {
17343 {
17344 /* Create the USING_DECL. */
17351 {
17354 }
17355 else
17356 /* Add it to the list of members in this class. */
17358 }
17359 else
17360 {
17362 identifier,
17369 {
17372 }
17375 else
17377 }
17378 }
17380 /* Look for the final `;'. */
17385 "access declarations are deprecated "
17386 "in favour of using-declarations; "
17390 }
17392 /* Parse an alias-declaration.
17394 alias-declaration:
17395 using identifier attribute-specifier-seq [opt] = type-id */
17397 static tree
17399 {
17401 location_t id_location;
17403 cp_decl_specifier_seq decl_specs;
17407 /* Look for the `using' keyword. */
17408 cp_token *using_token
17430 /* Now we are going to parse the type-id of the declaration. */
17432 /*
17433 [dcl.type]/3 says:
17435 "A type-specifier-seq shall not define a class or enumeration
17436 unless it appears in the type-id of an alias-declaration (7.1.3) that
17437 is not the declaration of a template-declaration."
17439 In other words, if we currently are in an alias template, the
17440 type-id should not define a type.
17442 So let's set parser->type_definition_forbidden_message in that
17443 case; cp_parser_check_type_definition (called by
17444 cp_parser_class_specifier) will then emit an error if a type is
17445 defined in the type-id. */
17447 {
17451 }
17455 /* Restore the error message if need be. */
17461 {
17464 }
17466 /* A typedef-name can also be introduced by an alias-declaration. The
17467 identifier following the using keyword becomes a typedef-name. It has
17468 the same semantics as if it were introduced by the typedef
17469 specifier. In particular, it does not define a new type and it shall
17470 not appear in the type-id. */
17475 {
17478 ds_attribute,
17479 attrs_token);
17480 }
17482 ds_typedef,
17483 using_token);
17485 ds_alias,
17486 using_token);
17495 else
17501 // Attach constraints to the alias declaration.
17503 {
17507 }
17514 /* If decl is a template, return its TEMPLATE_DECL so that it gets
17515 added into the symbol table; otherwise, return the TYPE_DECL. */
17519 {
17523 }
17526 }
17528 /* Parse a using-directive.
17530 using-directive:
17531 using namespace :: [opt] nested-name-specifier [opt]
17532 namespace-name ; */
17534 static void
17536 {
17537 tree namespace_decl;
17538 tree attribs;
17540 /* Look for the `using' keyword. */
17542 /* And the `namespace' keyword. */
17544 /* Look for the optional `::' operator. */
17546 /* And the optional nested-name-specifier. */
17552 /* Get the namespace being used. */
17554 /* And any specified attributes. */
17556 /* Update the symbol table. */
17558 /* Look for the final `;'. */
17560 }
17562 /* Parse an asm-definition.
17564 asm-definition:
17565 asm ( string-literal ) ;
17567 GNU Extension:
17569 asm-definition:
17570 asm volatile [opt] ( string-literal ) ;
17571 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
17572 asm volatile [opt] ( string-literal : asm-operand-list [opt]
17573 : asm-operand-list [opt] ) ;
17574 asm volatile [opt] ( string-literal : asm-operand-list [opt]
17575 : asm-operand-list [opt]
17576 : asm-clobber-list [opt] ) ;
17577 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
17578 : asm-clobber-list [opt]
17579 : asm-goto-list ) ; */
17581 static void
17583 {
17584 tree string;
17589 tree asm_stmt;
17597 /* Look for the `asm' keyword. */
17602 {
17605 }
17607 /* See if the next token is `volatile'. */
17610 {
17611 /* Remember that we saw the `volatile' keyword. */
17613 /* Consume the token. */
17615 }
17619 {
17620 /* Remember that we saw the `goto' keyword. */
17622 /* Consume the token. */
17624 }
17625 /* Look for the opening `('. */
17628 /* Look for the string. */
17631 {
17635 }
17637 /* If we're allowing GNU extensions, check for the extended assembly
17638 syntax. Unfortunately, the `:' tokens need not be separated by
17639 a space in C, and so, for compatibility, we tolerate that here
17640 too. Doing that means that we have to treat the `::' operator as
17641 two `:' tokens. */
17646 {
17651 /* The extended syntax was used. */
17654 /* Look for outputs. */
17656 {
17657 /* Consume the `:'. */
17659 /* Parse the output-operands. */
17661 CPP_COLON)
17663 CPP_SCOPE)
17665 CPP_CLOSE_PAREN)
17667 {
17671 }
17672 }
17673 /* If the next token is `::', there are no outputs, and the
17674 next token is the beginning of the inputs. */
17676 /* The inputs are coming next. */
17679 /* Look for inputs. */
17682 {
17683 /* Consume the `:' or `::'. */
17685 /* Parse the output-operands. */
17687 CPP_COLON)
17689 CPP_SCOPE)
17691 CPP_CLOSE_PAREN))
17692 {
17696 }
17697 }
17699 /* The clobbers are coming next. */
17702 /* Look for clobbers. */
17705 {
17707 /* Consume the `:' or `::'. */
17709 /* Parse the clobbers. */
17711 CPP_COLON)
17713 CPP_CLOSE_PAREN))
17715 }
17718 /* The labels are coming next. */
17721 /* Look for labels. */
17724 {
17726 /* Consume the `:' or `::'. */
17728 /* Parse the labels. */
17730 }
17734 }
17738 /* Look for the closing `)'. */
17746 {
17747 /* Create the ASM_EXPR. */
17749 {
17752 /* If the extended syntax was not used, mark the ASM_EXPR. */
17754 {
17760 }
17761 }
17762 else
17764 }
17765 }
17767 /* Declarators [gram.dcl.decl] */
17769 /* Parse an init-declarator.
17771 init-declarator:
17772 declarator initializer [opt]
17774 GNU Extension:
17776 init-declarator:
17777 declarator asm-specification [opt] attributes [opt] initializer [opt]
17779 function-definition:
17780 decl-specifier-seq [opt] declarator ctor-initializer [opt]
17781 function-body
17782 decl-specifier-seq [opt] declarator function-try-block
17784 GNU Extension:
17786 function-definition:
17787 __extension__ function-definition
17789 TM Extension:
17791 function-definition:
17792 decl-specifier-seq [opt] declarator function-transaction-block
17794 The DECL_SPECIFIERS apply to this declarator. Returns a
17795 representation of the entity declared. If MEMBER_P is TRUE, then
17796 this declarator appears in a class scope. The new DECL created by
17797 this declarator is returned.
17799 The CHECKS are access checks that should be performed once we know
17800 what entity is being declared (and, therefore, what classes have
17801 befriended it).
17803 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
17804 for a function-definition here as well. If the declarator is a
17805 declarator for a function-definition, *FUNCTION_DEFINITION_P will
17806 be TRUE upon return. By that point, the function-definition will
17807 have been completely parsed.
17809 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
17810 is FALSE.
17812 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
17813 parsed declaration if it is an uninitialized single declarator not followed
17814 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
17815 if present, will not be consumed. If returned, this declarator will be
17816 created with SD_INITIALIZED but will not call cp_finish_decl.
17818 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
17819 and there is an initializer, the pointed location_t is set to the
17820 location of the '=' or `(', or '{' in C++11 token introducing the
17821 initializer. */
17823 static tree
17833 {
17837 tree prefix_attributes;
17839 tree asm_specification;
17840 tree initializer;
17842 tree scope;
17844 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
17845 initialized with "= ..", CPP_OPEN_PAREN if initialized with
17846 "(...)". */
17857 /* Gather the attributes that were provided with the
17858 decl-specifiers. */
17861 /* Assume that this is not the declarator for a function
17862 definition. */
17866 /* Default arguments are only permitted for function parameters. */
17870 /* Defer access checks while parsing the declarator; we cannot know
17871 what names are accessible until we know what is being
17872 declared. */
17875 /* Parse the declarator. */
17877 declarator
17882 /* Gather up the deferred checks. */
17887 /* If the DECLARATOR was erroneous, there's no need to go
17888 further. */
17892 /* Check that the number of template-parameter-lists is OK. */
17902 /* Figure out what scope the entity declared by the DECLARATOR is
17903 located in. `grokdeclarator' sometimes changes the scope, so
17904 we compute it now. */
17907 /* Perform any lookups in the declared type which were thought to be
17908 dependent, but are not in the scope of the declarator. */
17909 decl_specifiers->type
17912 /* If we're allowing GNU extensions, look for an
17913 asm-specification. */
17915 {
17916 /* Look for an asm-specification. */
17919 }
17920 else
17923 /* Look for attributes. */
17927 /* Peek at the next token. */
17933 {
17934 /* Check to see if the token indicates the start of a
17935 function-definition. */
17937 {
17939 {
17940 /* If a function-definition should not appear here, issue an
17941 error message. */
17945 }
17947 location_t func_brace_location
17950 /* Neither attributes nor an asm-specification are allowed
17951 on a function-definition. */
17954 "an asm-specification is not allowed "
17958 "attributes are not allowed "
17960 /* This is a function-definition. */
17963 /* Parse the function definition. */
17966 decl_specifiers,
17967 declarator,
17968 prefix_attributes);
17969 else
17970 decl =
17971 (cp_parser_function_definition_from_specifiers_and_declarator
17975 {
17976 /* This is where the prologue starts... */
17979 }
17982 }
17983 }
17985 {
17986 /* A non-template declaration involving a function parameter list
17987 containing an implicit template parameter will be made into a
17988 template. If the resulting declaration is not going to be an
17989 actual function then finish the template scope here to prevent it.
17990 An error message will be issued once we have a decl to talk about.
17992 FIXME probably we should do type deduction rather than create an
17993 implicit template, but the standard currently doesn't allow it. */
17996 }
17998 /* [dcl.dcl]
18000 Only in function declarations for constructors, destructors, and
18001 type conversions can the decl-specifier-seq be omitted.
18003 We explicitly postpone this check past the point where we handle
18004 function-definitions because we tolerate function-definitions
18005 that are missing their return types in some modes. */
18007 {
18011 }
18013 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
18017 {
18028 {
18034 }
18035 }
18036 else
18037 {
18038 /* If the init-declarator isn't initialized and isn't followed by a
18039 `,' or `;', it's not a valid init-declarator. */
18042 {
18045 else
18046 {
18050 }
18051 }
18054 }
18056 /* Because start_decl has side-effects, we should only call it if we
18057 know we're going ahead. By this point, we know that we cannot
18058 possibly be looking at any other construct. */
18061 /* Enter the newly declared entry in the symbol table. If we're
18062 processing a declaration in a class-specifier, we wait until
18063 after processing the initializer. */
18065 {
18073 /* Adjust location of decl if declarator->id_loc is more appropriate:
18074 set, and decl wasn't merged with another decl, in which case its
18075 location would be different from input_location, and more accurate. */
18080 }
18082 /* Enter the SCOPE. That way unqualified names appearing in the
18083 initializer will be looked up in SCOPE. */
18086 /* Perform deferred access control checks, now that we know in which
18087 SCOPE the declared entity resides. */
18089 {
18092 /* If the entity being declared is a function, pretend that we
18093 are in its scope. If it is a `friend', it may have access to
18094 things that would not otherwise be accessible. */
18096 {
18099 }
18101 /* Perform access checks for template parameters. */
18104 /* Perform the access control checks for the declarator and the
18105 decl-specifiers. */
18108 /* Restore the saved value. */
18111 }
18113 /* Parse the initializer. */
18118 {
18120 {
18123 else
18124 {
18125 /* If the declaration was erroneous, we don't really
18126 know what the user intended, so just silently
18127 consume the initializer. */
18134 }
18135 }
18136 else
18137 {
18138 /* We want to record the extra mangling scope for in-class
18139 initializers of class members and initializers of static data
18140 member templates. The former involves deferring
18141 parsing of the initializer until end of class as with default
18142 arguments. So right here we only handle the latter. */
18152 }
18153 }
18155 /* The old parser allows attributes to appear after a parenthesized
18156 initializer. Mark Mitchell proposed removing this functionality
18157 on the GCC mailing lists on 2002-08-13. This parser accepts the
18158 attributes -- but ignores them. */
18165 /* And now complain about a non-function implicit template. */
18170 /* For an in-class declaration, use `grokfield' to create the
18171 declaration. */
18173 {
18175 {
18178 }
18187 }
18189 /* Finish processing the declaration. But, skip member
18190 declarations. */
18192 {
18195 asm_specification,
18196 /* If the initializer is in parentheses, then this is
18197 a direct-initialization, which means that an
18198 `explicit' constructor is OK. Otherwise, an
18199 `explicit' constructor cannot be used. */
18202 }
18205 /* Core issue #226 (C++0x only): A default template-argument
18206 shall not be specified in a friend class template
18207 declaration. */
18216 {
18219 else
18221 }
18224 }
18226 /* Parse a declarator.
18228 declarator:
18229 direct-declarator
18230 ptr-operator declarator
18232 abstract-declarator:
18233 ptr-operator abstract-declarator [opt]
18234 direct-abstract-declarator
18236 GNU Extensions:
18238 declarator:
18239 attributes [opt] direct-declarator
18240 attributes [opt] ptr-operator declarator
18242 abstract-declarator:
18243 attributes [opt] ptr-operator abstract-declarator [opt]
18244 attributes [opt] direct-abstract-declarator
18246 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
18247 detect constructor, destructor or conversion operators. It is set
18248 to -1 if the declarator is a name, and +1 if it is a
18249 function. Otherwise it is set to zero. Usually you just want to
18250 test for >0, but internally the negative value is used.
18252 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
18253 a decl-specifier-seq unless it declares a constructor, destructor,
18254 or conversion. It might seem that we could check this condition in
18255 semantic analysis, rather than parsing, but that makes it difficult
18256 to handle something like `f()'. We want to notice that there are
18257 no decl-specifiers, and therefore realize that this is an
18258 expression, not a declaration.)
18260 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
18261 the declarator is a direct-declarator of the form "(...)".
18263 MEMBER_P is true iff this declarator is a member-declarator.
18265 FRIEND_P is true iff this declarator is a friend. */
18269 cp_parser_declarator_kind dcl_kind,
18273 {
18276 cp_cv_quals cv_quals;
18277 tree class_type;
18280 /* Assume this is not a constructor, destructor, or type-conversion
18281 operator. */
18288 /* Check for the ptr-operator production. */
18290 /* Parse the ptr-operator. */
18296 /* If that worked, then we have a ptr-operator. */
18298 {
18299 /* If a ptr-operator was found, then this declarator was not
18300 parenthesized. */
18303 /* The dependent declarator is optional if we are parsing an
18304 abstract-declarator. */
18308 /* Parse the dependent declarator. */
18313 friend_p);
18315 /* If we are parsing an abstract-declarator, we must handle the
18316 case where the dependent declarator is absent. */
18321 declarator = cp_parser_make_indirect_declarator
18323 }
18324 /* Everything else is a direct-declarator. */
18325 else
18326 {
18329 CPP_OPEN_PAREN);
18331 ctor_dtor_or_conv_p,
18333 }
18338 }
18340 /* Parse a direct-declarator or direct-abstract-declarator.
18342 direct-declarator:
18343 declarator-id
18344 direct-declarator ( parameter-declaration-clause )
18345 cv-qualifier-seq [opt]
18346 ref-qualifier [opt]
18347 exception-specification [opt]
18348 direct-declarator [ constant-expression [opt] ]
18349 ( declarator )
18351 direct-abstract-declarator:
18352 direct-abstract-declarator [opt]
18353 ( parameter-declaration-clause )
18354 cv-qualifier-seq [opt]
18355 ref-qualifier [opt]
18356 exception-specification [opt]
18357 direct-abstract-declarator [opt] [ constant-expression [opt] ]
18358 ( abstract-declarator )
18360 Returns a representation of the declarator. DCL_KIND is
18361 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
18362 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
18363 we are parsing a direct-declarator. It is
18364 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
18365 of ambiguity we prefer an abstract declarator, as per
18366 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
18367 as for cp_parser_declarator. */
18371 cp_parser_declarator_kind dcl_kind,
18374 {
18384 {
18385 /* Peek at the next token. */
18388 {
18389 /* This is either a parameter-declaration-clause, or a
18390 parenthesized declarator. When we know we are parsing a
18391 named declarator, it must be a parenthesized declarator
18392 if FIRST is true. For instance, `(int)' is a
18393 parameter-declaration-clause, with an omitted
18394 direct-abstract-declarator. But `((*))', is a
18395 parenthesized abstract declarator. Finally, when T is a
18396 template parameter `(T)' is a
18397 parameter-declaration-clause, and not a parenthesized
18398 named declarator.
18400 We first try and parse a parameter-declaration-clause,
18401 and then try a nested declarator (if FIRST is true).
18403 It is not an error for it not to be a
18404 parameter-declaration-clause, even when FIRST is
18405 false. Consider,
18407 int i (int);
18408 int i (3);
18410 The first is the declaration of a function while the
18411 second is the definition of a variable, including its
18412 initializer.
18414 Having seen only the parenthesis, we cannot know which of
18415 these two alternatives should be selected. Even more
18416 complex are examples like:
18418 int i (int (a));
18419 int i (int (3));
18421 The former is a function-declaration; the latter is a
18422 variable initialization.
18424 Thus again, we try a parameter-declaration-clause, and if
18425 that fails, we back out and return. */
18428 {
18429 tree params;
18432 /* In a member-declarator, the only valid interpretation
18433 of a parenthesis is the start of a
18434 parameter-declaration-clause. (It is invalid to
18435 initialize a static data member with a parenthesized
18436 initializer; only the "=" form of initialization is
18437 permitted.) */
18441 /* Consume the `('. */
18444 {
18445 /* If this is going to be an abstract declarator, we're
18446 in a declarator and we can't have default args. */
18449 }
18453 /* Parse the parameter-declaration-clause. */
18456 /* Consume the `)'. */
18459 /* If all went well, parse the cv-qualifier-seq,
18460 ref-qualifier and the exception-specification. */
18462 {
18463 cp_cv_quals cv_quals;
18464 cp_virt_specifiers virt_specifiers;
18465 cp_ref_qualifier ref_qual;
18466 tree exception_specification;
18467 tree late_return;
18468 tree attrs;
18478 /* Parse the cv-qualifier-seq. */
18480 /* Parse the ref-qualifier. */
18482 /* Parse the tx-qualifier. */
18484 /* And the exception-specification. */
18485 exception_specification
18490 /* In here, we handle cases where attribute is used after
18491 the function declaration. For example:
18492 void func (int x) __attribute__((vector(..))); */
18495 {
18499 CPP_SEMICOLON)
18501 CPP_OPEN_BRACE))
18504 ;
18505 else
18507 }
18509 late_return = (cp_parser_late_return_type_opt
18513 /* Parse the virt-specifier-seq. */
18516 /* Create the function-declarator. */
18518 params,
18519 cv_quals,
18520 virt_specifiers,
18521 ref_qual,
18522 tx_qual,
18523 exception_specification,
18524 late_return,
18525 requires_clause);
18527 /* Any subsequent parameter lists are to do with
18528 return type, so are not those of the declared
18529 function. */
18531 }
18533 /* Remove the function parms from scope. */
18537 /* Repeat the main loop. */
18539 }
18541 /* If this is the first, we can try a parenthesized
18542 declarator. */
18544 {
18550 /* Consume the `('. */
18552 /* Parse the nested declarator. */
18555 declarator
18561 /* Expect a `)'. */
18568 }
18569 /* Otherwise, we must be done. */
18570 else
18572 }
18576 {
18577 /* Parse an array-declarator. */
18586 /* Consume the `['. */
18588 /* Peek at the next token. */
18590 /* If the next token is `]', then there is no
18591 constant-expression. */
18593 {
18595 bounds
18605 {
18606 /* Normally, the array bound must be an integral constant
18607 expression. However, as an extension, we allow VLAs
18608 in function scopes as long as they aren't part of a
18609 parameter declaration. */
18613 }
18616 {
18617 /* Remember this wasn't a constant-expression. */
18620 }
18621 }
18622 else
18624 /* Look for the closing `]'. */
18626 {
18629 }
18634 }
18636 {
18637 {
18638 tree qualifying_scope;
18639 tree unqualified_name;
18640 tree attrs;
18641 special_function_kind sfk;
18646 /* Parse a declarator-id */
18649 {
18652 /* If we see an ellipsis, we should be looking at a
18653 parameter pack. */
18655 {
18656 /* Consume the `...' */
18660 }
18661 }
18664 unqualified_name
18668 {
18672 {
18673 /* Check whether an error occurred. */
18676 /* We already consumed the ellipsis to mark a
18677 parameter pack, but we have no way to report it,
18678 so abort the tentative parse. We will be exiting
18679 immediately anyway. */
18681 }
18682 else
18688 && (qualifying_scope
18690 {
18693 }
18694 }
18699 {
18704 }
18710 {
18711 /* In the declaration of a member of a template class
18712 outside of the class itself, the SCOPE will sometimes
18713 be a TYPENAME_TYPE. For example, given:
18715 template <typename T>
18716 int S<T>::R::i = 3;
18718 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
18719 this context, we must resolve S<T>::R to an ordinary
18720 type, rather than a typename type.
18722 The reason we normally avoid resolving TYPENAME_TYPEs
18723 is that a specialization of `S' might render
18724 `S<T>::R' not a type. However, if `S' is
18725 specialized, then this `i' will not be used, so there
18726 is no harm in resolving the types here. */
18727 tree type;
18729 /* Resolve the TYPENAME_TYPE. */
18732 /* If that failed, the declarator is invalid. */
18734 {
18737 "cannot define member of dependent typedef "
18739 else
18744 }
18746 }
18751 {
18752 tree class_type;
18757 else
18761 {
18764 {
18767 {
18771 "use %<%T::%D%> instead of %<%T::%D%> to "
18773 class_type,
18778 }
18779 else
18781 }
18782 else
18783 {
18784 /* We do not attempt to print the declarator
18785 here because we do not have enough
18786 information about its original syntactic
18787 form. */
18791 }
18792 }
18795 {
18801 for an anonymous type, even if the type
18802 got a name for linkage purposes. */
18804 /* Handle correctly (c++/19200):
18806 struct S {
18807 struct T{};
18808 friend void S(T);
18809 };
18811 and also:
18813 namespace N {
18814 void S();
18815 }
18817 struct S {
18818 friend void N::S();
18819 }; */
18820 && !(friend_p
18823 class_type))
18824 {
18827 }
18835 }
18836 }
18838 unqualified_name,
18839 sfk);
18846 }
18848 handle_declarator:;
18851 {
18852 /* Any names that appear after the declarator-id for a
18853 member are looked up in the containing scope. */
18855 {
18856 /* But declarations with qualified-ids can't appear in a
18857 function. */
18861 }
18863 }
18867 /* Default args are only allowed on function
18868 declarations. */
18870 else
18874 }
18875 /* We're done. */
18876 else
18878 }
18880 /* For an abstract declarator, we might wind up with nothing at this
18881 point. That's an error; the declarator is not optional. */
18885 /* If we entered a scope, we must exit it now. */
18893 }
18895 /* Parse a ptr-operator.
18897 ptr-operator:
18898 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18899 * cv-qualifier-seq [opt]
18900 &
18901 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
18902 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18904 GNU Extension:
18906 ptr-operator:
18907 & cv-qualifier-seq [opt]
18909 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18910 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18911 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18912 filled in with the TYPE containing the member. *CV_QUALS is
18913 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18914 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18915 Note that the tree codes returned by this function have nothing
18916 to do with the types of trees that will be eventually be created
18917 to represent the pointer or reference type being parsed. They are
18918 just constants with suggestive names. */
18919 static enum tree_code
18924 {
18929 /* Assume that it's not a pointer-to-member. */
18931 /* And that there are no cv-qualifiers. */
18934 /* Peek at the next token. */
18937 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18947 {
18948 /* Consume the `*', `&' or `&&'. */
18951 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18952 `&', if we are allowing GNU extensions. (The only qualifier
18953 that can legally appear after `&' is `restrict', but that is
18954 enforced during semantic analysis. */
18962 }
18963 else
18964 {
18965 /* Try the pointer-to-member case. */
18967 /* Look for the optional `::' operator. */
18970 /* Look for the nested-name specifier. */
18977 /* If we found it, and the next token is a `*', then we are
18978 indeed looking at a pointer-to-member operator. */
18981 {
18982 /* Indicate that the `*' operator was used. */
18990 else
18991 {
18992 /* The type of which the member is a member is given by the
18993 current SCOPE. */
18995 /* The next name will not be qualified. */
18999 /* Look for optional c++11 attributes. */
19003 /* Look for the optional cv-qualifier-seq. */
19005 }
19006 }
19007 /* If that didn't work we don't have a ptr-operator. */
19010 }
19013 }
19015 /* Parse an (optional) cv-qualifier-seq.
19017 cv-qualifier-seq:
19018 cv-qualifier cv-qualifier-seq [opt]
19020 cv-qualifier:
19021 const
19022 volatile
19024 GNU Extension:
19026 cv-qualifier:
19027 __restrict__
19029 Returns a bitmask representing the cv-qualifiers. */
19031 static cp_cv_quals
19033 {
19037 {
19039 cp_cv_quals cv_qualifier;
19041 /* Peek at the next token. */
19043 /* See if it's a cv-qualifier. */
19045 {
19061 }
19067 {
19070 }
19071 else
19072 {
19075 }
19076 }
19079 }
19081 /* Parse an (optional) ref-qualifier
19083 ref-qualifier:
19084 &
19085 &&
19087 Returns cp_ref_qualifier representing ref-qualifier. */
19089 static cp_ref_qualifier
19091 {
19094 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
19099 {
19104 {
19116 }
19121 {
19124 }
19125 else
19126 {
19129 }
19130 }
19133 }
19135 /* Parse an optional tx-qualifier.
19137 tx-qualifier:
19138 transaction_safe
19139 transaction_safe_dynamic */
19141 static tree
19143 {
19146 {
19151 {
19155 {
19158 {
19161 }
19162 else
19164 }
19165 }
19166 }
19168 }
19170 /* Parse an (optional) virt-specifier-seq.
19172 virt-specifier-seq:
19173 virt-specifier virt-specifier-seq [opt]
19175 virt-specifier:
19176 override
19177 final
19179 Returns a bitmask representing the virt-specifiers. */
19181 static cp_virt_specifiers
19183 {
19187 {
19189 cp_virt_specifiers virt_specifier;
19191 /* Peek at the next token. */
19193 /* See if it's a virt-specifier-qualifier. */
19197 {
19200 }
19202 {
19205 }
19207 {
19209 }
19210 else
19214 {
19217 }
19218 else
19219 {
19222 }
19223 }
19225 }
19227 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
19228 is in scope even though it isn't real. */
19230 void
19232 {
19233 tree this_parm;
19236 {
19237 /* We don't clear this between NSDMIs. Is it already what we want? */
19242 }
19245 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
19247 current_class_ref
19250 }
19252 /* Return true iff our current scope is a non-static data member
19253 initializer. */
19255 bool
19257 {
19258 /* We recognize NSDMI context by the context-less 'this' pointer set up
19259 by the function above. */
19265 }
19267 /* Parse a late-specified return type, if any. This is not a separate
19268 non-terminal, but part of a function declarator, which looks like
19270 -> trailing-type-specifier-seq abstract-declarator(opt)
19272 Returns the type indicated by the type-id.
19274 In addition to this, parse any queued up omp declare simd
19275 clauses and Cilk Plus SIMD-enabled function's vector attributes.
19277 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
19278 function. */
19280 static tree
19283 {
19287 && declarator
19294 && declarator
19297 /* Peek at the next token. */
19299 /* A late-specified return type is indicated by an initial '->'. */
19308 {
19309 /* DR 1207: 'this' is in scope in the trailing return type. */
19311 }
19314 {
19315 /* Consume the ->. */
19319 }
19321 /* Function declarations may be followed by a trailing
19322 requires-clause. */
19326 declarator->std_attributes
19330 declarator->std_attributes
19334 declarator->std_attributes
19339 {
19342 }
19345 }
19347 /* Parse a declarator-id.
19349 declarator-id:
19350 id-expression
19351 :: [opt] nested-name-specifier [opt] type-name
19353 In the `id-expression' case, the value returned is as for
19354 cp_parser_id_expression if the id-expression was an unqualified-id.
19355 If the id-expression was a qualified-id, then a SCOPE_REF is
19356 returned. The first operand is the scope (either a NAMESPACE_DECL
19357 or TREE_TYPE), but the second is still just a representation of an
19358 unqualified-id. */
19360 static tree
19362 {
19363 tree id;
19364 /* The expression must be an id-expression. Assume that qualified
19365 names are the names of types so that:
19367 template <class T>
19368 int S<T>::R::i = 3;
19370 will work; we must treat `S<T>::R' as the name of a type.
19371 Similarly, assume that qualified names are templates, where
19372 required, so that:
19374 template <class T>
19375 int S<T>::R<T>::i = 3;
19377 will work, too. */
19383 optional_p);
19387 }
19389 /* Parse a type-id.
19391 type-id:
19392 type-specifier-seq abstract-declarator [opt]
19394 Returns the TYPE specified. */
19396 static tree
19399 {
19400 cp_decl_specifier_seq type_specifier_seq;
19403 /* Parse the type-specifier-seq. */
19405 is_trailing_return,
19410 /* There might or might not be an abstract declarator. */
19412 /* Look for the declarator. */
19413 abstract_declarator
19418 /* Check to see if there really was a declarator. */
19423 /* The concepts TS allows 'auto' as a type-id. */
19424 && !flag_concepts
19425 /* None of the valid uses of 'auto' in C++14 involve the type-id
19426 nonterminal, but it is valid in a trailing-return-type. */
19429 {
19430 /* A type-id with type 'auto' is only ok if the abstract declarator
19431 is a function declarator with a late-specified return type.
19433 A type-id with 'auto' is also valid in a trailing-return-type
19434 in a compound-requirement. */
19441 else
19442 {
19445 }
19446 }
19449 is_template_arg);
19450 }
19452 static tree
19454 {
19456 }
19458 static tree
19460 {
19461 tree r;
19463 parser->type_definition_forbidden_message
19468 {
19471 }
19473 }
19475 static tree
19477 {
19479 }
19481 /* Parse a type-specifier-seq.
19483 type-specifier-seq:
19484 type-specifier type-specifier-seq [opt]
19486 GNU extension:
19488 type-specifier-seq:
19489 attributes type-specifier-seq [opt]
19491 If IS_DECLARATION is true, we are at the start of a "condition" or
19492 exception-declaration, so we might be followed by a declarator-id.
19494 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
19495 i.e. we've just seen "->".
19497 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
19499 static void
19504 {
19509 /* Clear the TYPE_SPECIFIER_SEQ. */
19512 /* In the context of a trailing return type, enum E { } is an
19513 elaborated-type-specifier followed by a function-body, not an
19514 enum-specifier. */
19518 /* Parse the type-specifiers and attributes. */
19520 {
19521 tree type_specifier;
19524 /* Check for attributes first. */
19526 {
19531 }
19533 /* record the token of the beginning of the type specifier seq,
19534 for error reporting purposes*/
19538 /* Look for the type-specifier. */
19540 flags,
19541 type_specifier_seq,
19543 NULL,
19546 {
19547 /* If the first type-specifier could not be found, this is not a
19548 type-specifier-seq at all. */
19550 {
19551 /* Set in_declarator_p to avoid skipping to the semicolon. */
19563 }
19564 /* If subsequent type-specifiers could not be found, the
19565 type-specifier-seq is complete. */
19567 }
19570 /* The standard says that a condition can be:
19572 type-specifier-seq declarator = assignment-expression
19574 However, given:
19576 struct S {};
19577 if (int S = ...)
19579 we should treat the "S" as a declarator, not as a
19580 type-specifier. The standard doesn't say that explicitly for
19581 type-specifier-seq, but it does say that for
19582 decl-specifier-seq in an ordinary declaration. Perhaps it
19583 would be clearer just to allow a decl-specifier-seq here, and
19584 then add a semantic restriction that if any decl-specifiers
19585 that are not type-specifiers appear, the program is invalid. */
19588 }
19589 }
19591 /* Return whether the function currently being declared has an associated
19592 template parameter list. */
19594 static bool
19596 {
19609 }
19611 /* Parse a parameter-declaration-clause.
19613 parameter-declaration-clause:
19614 parameter-declaration-list [opt] ... [opt]
19615 parameter-declaration-list , ...
19617 Returns a representation for the parameter declarations. A return
19618 value of NULL indicates a parameter-declaration-clause consisting
19619 only of an ellipsis. */
19621 static tree
19623 {
19624 tree parameters;
19633 parser->auto_is_implicit_function_template_parm_p
19635 }
19641 && !processing_template_parmlist
19647 /* Peek at the next token. */
19649 /* Check for trivial parameter-declaration-clauses. */
19651 {
19652 /* Consume the `...' token. */
19655 }
19657 /* There are no parameters. */
19658 {
19659 #ifndef NO_IMPLICIT_EXTERN_C
19664 else
19665 #endif
19667 }
19668 /* Check for `(void)', too, which is a special case. */
19672 {
19673 /* Consume the `void' token. */
19675 /* There are no parameters. */
19677 }
19679 /* Parse the parameter-declaration-list. */
19681 /* If a parse error occurred while parsing the
19682 parameter-declaration-list, then the entire
19683 parameter-declaration-clause is erroneous. */
19687 /* Peek at the next token. */
19689 /* If it's a `,', the clause should terminate with an ellipsis. */
19691 {
19692 /* Consume the `,'. */
19694 /* Expect an ellipsis. */
19695 ellipsis_p
19697 }
19698 /* It might also be `...' if the optional trailing `,' was
19699 omitted. */
19701 {
19702 /* Consume the `...' token. */
19704 /* And remember that we saw it. */
19706 }
19707 else
19710 /* Finish the parameter list. */
19715 }
19717 /* Parse a parameter-declaration-list.
19719 parameter-declaration-list:
19720 parameter-declaration
19721 parameter-declaration-list , parameter-declaration
19723 Returns a representation of the parameter-declaration-list, as for
19724 cp_parser_parameter_declaration_clause. However, the
19725 `void_list_node' is never appended to the list. Upon return,
19726 *IS_ERROR will be true iff an error occurred. */
19728 static tree
19730 {
19736 /* Assume all will go well. */
19738 /* The special considerations that apply to a function within an
19739 unbraced linkage specifications do not apply to the parameters
19740 to the function. */
19741 saved_in_unbraced_linkage_specification_p
19745 /* Look for more parameters. */
19747 {
19755 /* Parse the parameter. */
19756 parameter
19761 /* We don't know yet if the enclosing context is deprecated, so wait
19762 and warn in grokparms if appropriate. */
19766 {
19767 /* If a function parameter pack was specified and an implicit template
19768 parameter was introduced during cp_parser_parameter_declaration,
19769 change any implicit parameters introduced into packs. */
19773 {
19781 }
19785 PARM,
19788 }
19792 /* If a parse error occurred parsing the parameter declaration,
19793 then the entire parameter-declaration-list is erroneous. */
19795 {
19799 }
19809 {
19813 }
19815 /* Add the new parameter to the list. */
19819 /* Peek at the next token. */
19822 /* These are for Objective-C++ */
19825 /* The parameter-declaration-list is complete. */
19828 {
19831 /* Peek at the next token. */
19833 /* If it's an ellipsis, then the list is complete. */
19836 /* Otherwise, there must be more parameters. Consume the
19837 `,'. */
19839 /* When parsing something like:
19841 int i(float f, double d)
19843 we can tell after seeing the declaration for "f" that we
19844 are not looking at an initialization of a variable "i",
19845 but rather at the declaration of a function "i".
19847 Due to the fact that the parsing of template arguments
19848 (as specified to a template-id) requires backtracking we
19849 cannot use this technique when inside a template argument
19850 list. */
19854 /* However, a parameter-declaration of the form
19855 "float(f)" (which is a valid declaration of a
19856 parameter "f") can also be interpreted as an
19857 expression (the conversion of "f" to "float"). */
19860 }
19861 else
19862 {
19870 }
19871 }
19873 parser->in_unbraced_linkage_specification_p
19876 /* Reset implicit_template_scope if we are about to leave the function
19877 parameter list that introduced it. Note that for out-of-line member
19878 definitions, there will be one or more class scopes before we get to
19879 the template parameter scope. */
19883 {
19887 {
19890 }
19891 }
19894 }
19896 /* Parse a parameter declaration.
19898 parameter-declaration:
19899 decl-specifier-seq ... [opt] declarator
19900 decl-specifier-seq declarator = assignment-expression
19901 decl-specifier-seq ... [opt] abstract-declarator [opt]
19902 decl-specifier-seq abstract-declarator [opt] = assignment-expression
19904 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
19905 declares a template parameter. (In that case, a non-nested `>'
19906 token encountered during the parsing of the assignment-expression
19907 is not interpreted as a greater-than operator.)
19909 Returns a representation of the parameter, or NULL if an error
19910 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
19911 true iff the declarator is of the form "(p)". */
19917 {
19919 cp_decl_specifier_seq decl_specifiers;
19921 tree default_argument;
19926 /* In a template parameter, `>' is not an operator.
19928 [temp.param]
19930 When parsing a default template-argument for a non-type
19931 template-parameter, the first non-nested `>' is taken as the end
19932 of the template parameter-list rather than a greater-than
19933 operator. */
19935 /* Type definitions may not appear in parameter types. */
19937 parser->type_definition_forbidden_message
19940 /* Parse the declaration-specifiers. */
19942 CP_PARSER_FLAGS_NONE,
19946 /* Complain about missing 'typename' or other invalid type names. */
19951 /* If an error occurred, there's no reason to attempt to parse the
19952 rest of the declaration. */
19954 {
19957 }
19959 /* Peek at the next token. */
19962 /* If the next token is a `)', `,', `=', `>', or `...', then there
19963 is no declarator. However, when variadic templates are enabled,
19964 there may be a declarator following `...'. */
19969 {
19973 }
19974 /* Otherwise, there should be a declarator. */
19975 else
19976 {
19980 /* After seeing a decl-specifier-seq, if the next token is not a
19981 "(", there is no possibility that the code is a valid
19982 expression. Therefore, if parsing tentatively, we commit at
19983 this point. */
19985 /* In an expression context, having seen:
19987 (int((char ...
19989 we cannot be sure whether we are looking at a
19990 function-type (taking a "char" as a parameter) or a cast
19991 of some object of type "char" to "int". */
19997 /* Parse the declarator. */
20000 CP_PARSER_DECLARATOR_EITHER,
20002 parenthesized_p,
20006 /* After the declarator, allow more attributes. */
20007 decl_specifiers.attributes
20011 /* If the declarator is a template parameter pack, remember that and
20012 clear the flag in the declarator itself so we don't get errors
20013 from grokdeclarator. */
20015 {
20018 }
20019 }
20021 /* If the next token is an ellipsis, and we have not seen a declarator
20022 name, and if either the type of the declarator contains parameter
20023 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
20024 for, eg, abbreviated integral type names), then we actually have a
20025 parameter pack expansion expression. Otherwise, leave the ellipsis
20026 for a C-style variadic function. */
20029 {
20040 {
20041 /* Consume the `...'. */
20045 /* Build a pack expansion type */
20050 else
20052 }
20053 }
20055 /* The restriction on defining new types applies only to the type
20056 of the parameter, not to the default argument. */
20059 /* If the next token is `=', then process a default argument. */
20061 {
20064 /* If we are defining a class, then the tokens that make up the
20065 default argument must be saved and processed later. */
20071 // A constrained-type-specifier may declare a type template-parameter.
20073 default_argument
20076 // A constrained-type-specifier may declare a template-template-parameter.
20078 default_argument
20081 /* Outside of a class definition, we can just parse the
20082 assignment-expression. */
20083 else
20084 default_argument
20088 {
20090 "default arguments are only "
20092 }
20094 || template_parameter_pack_p
20097 {
20098 /* Find the name of the parameter pack. */
20105 template_parm_p
20111 else
20113 template_parm_p
20120 }
20121 }
20122 else
20126 declarator,
20127 default_argument,
20128 template_parameter_pack_p);
20129 }
20131 /* Parse a default argument and return it.
20133 TEMPLATE_PARM_P is true if this is a default argument for a
20134 non-type template parameter. */
20135 static tree
20137 {
20143 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
20144 set correctly. */
20147 /* Local variable names (and the `this' keyword) may not
20148 appear in a default argument. */
20151 /* Parse the assignment-expression. */
20156 /* The "this" pointer is not valid in a default argument. */
20158 {
20163 }
20164 default_argument
20166 /* Restore the "this" pointer. */
20168 {
20171 }
20180 }
20182 /* Parse a function-body.
20184 function-body:
20185 compound_statement */
20187 static void
20189 {
20193 }
20195 /* Parse a ctor-initializer-opt followed by a function-body. Return
20196 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
20197 is true we are parsing a function-try-block. */
20199 static bool
20202 {
20210 /* Begin the function body. */
20212 /* Parse the optional ctor-initializer. */
20215 /* If we're parsing a constexpr constructor definition, we need
20216 to check that the constructor body is indeed empty. However,
20217 before we get to cp_parser_function_body lot of junk has been
20218 generated, so we can't just check that we have an empty block.
20219 Rather we take a snapshot of the outermost block, and check whether
20220 cp_parser_function_body changed its state. */
20222 {
20226 }
20227 /* Parse the function-body. */
20231 /* Finish the function body. */
20235 }
20237 /* Parse an initializer.
20239 initializer:
20240 = initializer-clause
20241 ( expression-list )
20243 Returns an expression representing the initializer. If no
20244 initializer is present, NULL_TREE is returned.
20246 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
20247 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
20248 set to TRUE if there is no initializer present. If there is an
20249 initializer, and it is not a constant-expression, *NON_CONSTANT_P
20250 is set to true; otherwise it is set to false. */
20252 static tree
20255 {
20257 tree init;
20259 /* Peek at the next token. */
20262 /* Let our caller know whether or not this initializer was
20263 parenthesized. */
20265 /* Assume that the initializer is constant. */
20269 {
20270 /* Consume the `='. */
20272 /* Parse the initializer-clause. */
20274 }
20276 {
20281 non_constant_p);
20286 }
20288 {
20293 }
20294 else
20295 {
20296 /* Anything else is an error. */
20299 }
20302 }
20304 /* Parse an initializer-clause.
20306 initializer-clause:
20307 assignment-expression
20308 braced-init-list
20310 Returns an expression representing the initializer.
20312 If the `assignment-expression' production is used the value
20313 returned is simply a representation for the expression.
20315 Otherwise, calls cp_parser_braced_list. */
20317 static tree
20319 {
20320 tree initializer;
20322 /* Assume the expression is constant. */
20325 /* If it is not a `{', then we are looking at an
20326 assignment-expression. */
20328 {
20329 initializer
20332 non_constant_p);
20333 }
20334 else
20338 }
20340 /* Parse a brace-enclosed initializer list.
20342 braced-init-list:
20343 { initializer-list , [opt] }
20344 { }
20346 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
20347 the elements of the initializer-list (or NULL, if the last
20348 production is used). The TREE_TYPE for the CONSTRUCTOR will be
20349 NULL_TREE. There is no way to detect whether or not the optional
20350 trailing `,' was provided. NON_CONSTANT_P is as for
20351 cp_parser_initializer. */
20353 static tree
20355 {
20356 tree initializer;
20358 /* Consume the `{' token. */
20360 /* Create a CONSTRUCTOR to represent the braced-initializer. */
20362 /* If it's not a `}', then there is a non-trivial initializer. */
20364 {
20365 /* Parse the initializer list. */
20368 /* A trailing `,' token is allowed. */
20371 }
20372 else
20374 /* Now, there should be a trailing `}'. */
20378 }
20380 /* Consume tokens up to, and including, the next non-nested closing `]'.
20381 Returns true iff we found a closing `]'. */
20383 static bool
20385 {
20389 {
20393 {
20396 /* If we've run out of tokens, then there is no closing `]'. */
20405 {
20408 }
20413 }
20415 /* Consume the token. */
20417 }
20418 }
20420 /* Return true if we are looking at an array-designator, false otherwise. */
20422 static bool
20424 {
20425 /* Consume the `['. */
20430 /* Skip tokens until the next token is a closing square bracket.
20431 If we find the closing `]', and the next token is a `=', then
20432 we are looking at an array designator. */
20433 bool array_designator_p
20437 /* Roll back the tokens we skipped. */
20441 }
20443 /* Parse an initializer-list.
20445 initializer-list:
20446 initializer-clause ... [opt]
20447 initializer-list , initializer-clause ... [opt]
20449 GNU Extension:
20451 initializer-list:
20452 designation initializer-clause ...[opt]
20453 initializer-list , designation initializer-clause ...[opt]
20455 designation:
20456 . identifier =
20457 identifier :
20458 [ constant-expression ] =
20460 Returns a vec of constructor_elt. The VALUE of each elt is an expression
20461 for the initializer. If the INDEX of the elt is non-NULL, it is the
20462 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
20463 as for cp_parser_initializer. */
20467 {
20470 /* Assume all of the expressions are constant. */
20473 /* Parse the rest of the list. */
20475 {
20477 tree designator;
20478 tree initializer;
20481 /* If the next token is an identifier and the following one is a
20482 colon, we are looking at the GNU designated-initializer
20483 syntax. */
20487 {
20488 /* Warn the user that they are using an extension. */
20491 /* Consume the identifier. */
20493 /* Consume the `:'. */
20495 }
20496 /* Also handle the C99 syntax, '. id ='. */
20501 {
20502 /* Warn the user that they are using an extension. */
20505 /* Consume the `.'. */
20507 /* Consume the identifier. */
20509 /* Consume the `='. */
20511 }
20512 /* Also handle C99 array designators, '[ const ] ='. */
20516 {
20517 /* In C++11, [ could start a lambda-introducer. */
20523 {
20526 }
20527 else
20528 {
20533 }
20539 }
20540 else
20543 /* Parse the initializer. */
20546 /* If any clause is non-constant, so is the entire initializer. */
20550 /* If we have an ellipsis, this is an initializer pack
20551 expansion. */
20553 {
20554 /* Consume the `...'. */
20557 /* Turn the initializer into an initializer expansion. */
20559 }
20561 /* Add it to the vector. */
20564 /* If the next token is not a comma, we have reached the end of
20565 the list. */
20569 /* Peek at the next token. */
20571 /* If the next token is a `}', then we're still done. An
20572 initializer-clause can have a trailing `,' after the
20573 initializer-list and before the closing `}'. */
20577 /* Consume the `,' token. */
20579 }
20582 }
20584 /* Classes [gram.class] */
20586 /* Parse a class-name.
20588 class-name:
20589 identifier
20590 template-id
20592 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
20593 to indicate that names looked up in dependent types should be
20594 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
20595 keyword has been used to indicate that the name that appears next
20596 is a template. TAG_TYPE indicates the explicit tag given before
20597 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
20598 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
20599 is the class being defined in a class-head. If ENUM_OK is TRUE,
20600 enum-names are also accepted.
20602 Returns the TYPE_DECL representing the class. */
20604 static tree
20613 {
20614 tree decl;
20615 tree scope;
20620 /* All class-names start with an identifier. */
20623 {
20626 }
20628 /* PARSER->SCOPE can be cleared when parsing the template-arguments
20629 to a template-id, so we save it here. */
20634 /* Any name names a type if we're following the `typename' keyword
20635 in a qualified name where the enclosing scope is type-dependent. */
20638 /* Handle the common case (an identifier, but not a template-id)
20639 efficiently. */
20642 {
20646 /* Look for the identifier. */
20650 /* If the next token isn't an identifier, we are certainly not
20651 looking at a class-name. */
20654 /* If we know this is a type-name, there's no need to look it
20655 up. */
20658 else
20659 {
20660 tree ambiguous_decls;
20661 /* If we already know that this lookup is ambiguous, then
20662 we've already issued an error message; there's no reason
20663 to check again. */
20665 {
20668 }
20669 /* If the next token is a `::', then the name must be a type
20670 name.
20672 [basic.lookup.qual]
20674 During the lookup for a name preceding the :: scope
20675 resolution operator, object, function, and enumerator
20676 names are ignored. */
20679 /* Look up the name. */
20681 tag_type,
20684 check_dependency_p,
20688 {
20692 }
20693 }
20694 }
20695 else
20696 {
20697 /* Try a template-id. */
20699 check_dependency_p,
20700 tag_type,
20701 is_declaration);
20704 }
20708 /* If this is a typename, create a TYPENAME_TYPE. */
20710 {
20715 }
20719 /* Check to see that it is really the name of a class. */
20723 /* Situations like this:
20725 template <typename T> struct A {
20726 typename T::template X<int>::I i;
20727 };
20729 are problematic. Is `T::template X<int>' a class-name? The
20730 standard does not seem to be definitive, but there is no other
20731 valid interpretation of the following `::'. Therefore, those
20732 names are considered class-names. */
20733 {
20737 }
20742 /* In Objective-C 2.0, a classname followed by '.' starts a
20743 dot-syntax expression, and it's not a type-name. */
20755 }
20757 /* Parse a class-specifier.
20759 class-specifier:
20760 class-head { member-specification [opt] }
20762 Returns the TREE_TYPE representing the class. */
20764 static tree
20766 {
20767 tree type;
20781 /* Parse the class-head. */
20784 /* If the class-head was a semantic disaster, skip the entire body
20785 of the class. */
20787 {
20791 }
20793 /* Look for the `{'. */
20795 {
20798 }
20803 /* Issue an error message if type-definitions are forbidden here. */
20805 /* Remember that we are defining one more class. */
20807 /* Inside the class, surrounding template-parameter-lists do not
20808 apply. */
20809 saved_num_template_parameter_lists
20812 /* We are not in a function body. */
20815 /* Or in a loop. */
20818 /* Or in a switch. */
20821 /* We are not immediately inside an extern "lang" block. */
20822 saved_in_unbraced_linkage_specification_p
20826 // Associate constraints with the type.
20830 /* Start the class. */
20832 {
20835 }
20839 /* If the type is erroneous, skip the entire body of the class. */
20841 else
20842 /* Parse the member-specification. */
20845 /* Look for the trailing `}'. */
20847 /* Look for trailing attributes to apply to this class. */
20855 /* We've finished a type definition. Check for the common syntax
20856 error of forgetting a semicolon after the definition. We need to
20857 be careful, as we can't just check for not-a-semicolon and be done
20858 with it; the user might have typed:
20860 class X { } c = ...;
20861 class X { } *p = ...;
20863 and so forth. Instead, enumerate all the possible tokens that
20864 might follow this production; if we don't see one of them, then
20865 complain and silently insert the semicolon. */
20866 {
20871 /* Don't try to parse c++11 attributes here. As per the
20872 grammar, that should be a task for
20873 cp_parser_decl_specifier_seq. */
20877 {
20888 /* While it's legal for type qualifiers and storage class
20889 specifiers to follow type definitions in the grammar, only
20890 compiler testsuites contain code like that. Assume that if
20891 we see such code, then what we're really seeing is a case
20892 like:
20894 class X { }
20895 const <type> var = ...;
20897 or
20899 class Y { }
20900 static <type> func (...) ...
20902 i.e. the qualifier or specifier applies to the next
20903 declaration. To do so, however, we need to look ahead one
20904 more token to see if *that* token is a type specifier.
20906 This code could be improved to handle:
20908 class Z { }
20909 static const <type> var = ...; */
20912 {
20915 /* Handling user-defined types here would be nice, but very
20916 tricky. */
20917 want_semicolon
20920 }
20924 }
20926 /* If we don't have a type, then something is very wrong and we
20927 shouldn't try to do anything clever. Likewise for not seeing the
20928 closing brace. */
20930 {
20931 cp_token_position prev
20942 else
20945 /* Unget one token and smash it to look as though we encountered
20946 a semicolon in the input stream. */
20951 }
20952 }
20954 /* If this class is not itself within the scope of another class,
20955 then we need to parse the bodies of all of the queued function
20956 definitions. Note that the queued functions defined in a class
20957 are not always processed immediately following the
20958 class-specifier for that class. Consider:
20960 struct A {
20961 struct B { void f() { sizeof (A); } };
20962 };
20964 If `f' were processed before the processing of `A' were
20965 completed, there would be no way to compute the size of `A'.
20966 Note that the nesting we are interested in here is lexical --
20967 not the semantic nesting given by TYPE_CONTEXT. In particular,
20968 for:
20970 struct A { struct B; };
20971 struct A::B { void f() { } };
20973 there is no need to delay the parsing of `A::B::f'. */
20975 {
20976 tree decl;
20983 /* In a first pass, parse default arguments to the functions.
20984 Then, in a second pass, parse the bodies of the functions.
20985 This two-phased approach handles cases like:
20987 struct S {
20988 void f() { g(); }
20989 void g(int i = 3);
20990 };
20992 */
20994 {
20996 /* If there are default arguments that have not yet been processed,
20997 take care of them now. */
20999 {
21004 }
21005 /* Make sure that any template parameters are in scope. */
21007 /* Parse the default argument expressions. */
21009 /* Remove any template parameters from the symbol table. */
21011 }
21013 /* Now parse any NSDMIs. */
21017 {
21019 {
21024 }
21027 }
21034 /* Now do some post-NSDMI bookkeeping. */
21040 /* Now parse the body of the functions. */
21042 {
21043 /* OpenMP UDRs need to be parsed before all other functions. */
21050 }
21051 else
21055 }
21056 else
21059 /* Put back any saved access checks. */
21062 /* Restore saved state. */
21066 parser->num_template_parameter_lists
21068 parser->in_unbraced_linkage_specification_p
21072 }
21074 static tree
21076 {
21077 tree ret;
21082 }
21084 /* Parse a class-head.
21086 class-head:
21087 class-key identifier [opt] base-clause [opt]
21088 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
21089 class-key nested-name-specifier [opt] template-id
21090 base-clause [opt]
21092 class-virt-specifier:
21093 final
21095 GNU Extensions:
21096 class-key attributes identifier [opt] base-clause [opt]
21097 class-key attributes nested-name-specifier identifier base-clause [opt]
21098 class-key attributes nested-name-specifier [opt] template-id
21099 base-clause [opt]
21101 Upon return BASES is initialized to the list of base classes (or
21102 NULL, if there are none) in the same form returned by
21103 cp_parser_base_clause.
21105 Returns the TYPE of the indicated class. Sets
21106 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
21107 involving a nested-name-specifier was used, and FALSE otherwise.
21109 Returns error_mark_node if this is not a class-head.
21111 Returns NULL_TREE if the class-head is syntactically valid, but
21112 semantically invalid in a way that means we should skip the entire
21113 body of the class. */
21115 static tree
21118 {
21119 tree nested_name_specifier;
21123 tree attributes;
21124 tree bases;
21134 /* Assume no nested-name-specifier will be present. */
21136 /* Assume no template parameter lists will be used in defining the
21137 type. */
21141 /* Look for the class-key. */
21146 /* Parse the attributes. */
21149 /* If the next token is `::', that is invalid -- but sometimes
21150 people do try to write:
21152 struct ::S {};
21154 Handle this gracefully by accepting the extra qualifier, and then
21155 issuing an error about it later if this really is a
21156 class-head. If it turns out just to be an elaborated type
21157 specifier, remain silent. */
21163 /* Determine the name of the class. Begin by looking for an
21164 optional nested-name-specifier. */
21166 nested_name_specifier
21172 /* If there was a nested-name-specifier, then there *must* be an
21173 identifier. */
21175 {
21177 /* Although the grammar says `identifier', it really means
21178 `class-name' or `template-name'. You are only allowed to
21179 define a class that has already been declared with this
21180 syntax.
21182 The proposed resolution for Core Issue 180 says that wherever
21183 you see `class T::X' you should treat `X' as a type-name.
21185 It is OK to define an inaccessible class; for example:
21187 class A { class B; };
21188 class A::B {};
21190 We do not know if we will see a class-name, or a
21191 template-name. We look for a class-name first, in case the
21192 class-name is a template-id; if we looked for the
21193 template-name first we would stop after the template-name. */
21198 class_type,
21202 /* If that didn't work, ignore the nested-name-specifier. */
21204 {
21210 }
21211 /* If we could not find a corresponding TYPE, treat this
21212 declaration like an unqualified declaration. */
21215 /* Otherwise, count the number of templates used in TYPE and its
21216 containing scopes. */
21217 else
21218 {
21219 tree scope;
21231 }
21232 }
21233 /* Otherwise, the identifier is optional. */
21234 else
21235 {
21236 /* We don't know whether what comes next is a template-id,
21237 an identifier, or nothing at all. */
21239 /* Check for a template-id. */
21244 class_key,
21246 /* If that didn't work, it could still be an identifier. */
21248 {
21250 {
21253 }
21254 else
21256 }
21257 else
21258 {
21261 }
21262 }
21267 {
21269 class_key,
21271 }
21274 /* If it's not a `:' or a `{' then we can't really be looking at a
21275 class-head, since a class-head only appears as part of a
21276 class-specifier. We have to detect this situation before calling
21277 xref_tag, since that has irreversible side-effects. */
21279 {
21283 }
21285 /* At this point, we're going ahead with the class-specifier, even
21286 if some other problem occurs. */
21289 {
21294 }
21295 /* Issue the error about the overly-qualified name now. */
21297 {
21302 }
21304 {
21309 }
21311 {
21312 tree scope;
21314 /* Reject typedef-names in class heads. */
21316 {
21319 type);
21322 }
21324 /* Figure out in what scope the declaration is being placed. */
21326 /* If that scope does not contain the scope in which the
21327 class was originally declared, the program is invalid. */
21329 {
21332 "declaration of %qD in namespace %qD which does not "
21335 else
21341 }
21342 /* [dcl.meaning]
21344 A declarator-id shall not be qualified except for the
21345 definition of a ... nested class outside of its class
21346 ... [or] the definition or explicit instantiation of a
21347 class member of a namespace outside of its namespace. */
21349 {
21354 }
21355 }
21356 /* An explicit-specialization must be preceded by "template <>". If
21357 it is not, try to recover gracefully. */
21361 {
21365 /* Take the same action that would have been taken by
21366 cp_parser_explicit_specialization. */
21369 }
21370 /* There must be no "return" statements between this point and the
21371 end of this function; set "type "to the correct return value and
21372 use "goto done;" to return. */
21373 /* Make sure that the right number of template parameters were
21374 present. */
21378 {
21379 /* If something went wrong, there is no point in even trying to
21380 process the class-definition. */
21383 }
21385 /* Look up the type. */
21387 {
21391 {
21395 }
21396 else
21397 {
21400 }
21403 }
21405 {
21406 tree class_type;
21408 /* Given:
21410 template <typename T> struct S { struct T };
21411 template <typename T> struct S<T>::T { };
21413 we will get a TYPENAME_TYPE when processing the definition of
21414 `S::T'. We need to resolve it to the actual type before we
21415 try to define it. */
21417 {
21422 else
21423 {
21426 }
21427 }
21431 {
21434 }
21437 /* Enter the scope indicated by the nested-name-specifier. */
21439 /* Get the canonical version of this type. */
21441 /* Call push_template_decl if it seems like we should be defining a
21442 template either from the template headers or the type we're
21443 defining, so that we diagnose both extra and missing headers. */
21447 {
21450 {
21453 }
21454 }
21458 }
21460 {
21461 /* If the class was unnamed, create a dummy name. */
21466 }
21468 /* Indicate whether this class was declared as a `class' or as a
21469 `struct'. */
21474 /* If this type was already complete, and we see another definition,
21475 that's an error. */
21477 {
21479 type);
21481 type);
21484 }
21489 {
21490 /* Apply attributes now, before any use of the class as a template
21491 argument in its base list. */
21494 }
21496 /* We will have entered the scope containing the class; the names of
21497 base classes should be looked up in that context. For example:
21499 struct A { struct B {}; struct C; };
21500 struct A::C : B {};
21502 is valid. */
21504 /* Get the list of base-classes, if there is one. */
21506 {
21507 /* PR59482: enter the class scope so that base-specifiers are looked
21508 up correctly. */
21512 /* PR59482: get out of the previously pushed class scope so that the
21513 subsequent pops pop the right thing. */
21516 }
21517 else
21520 /* If we're really defining a class, process the base classes.
21521 If they're invalid, fail. */
21526 done:
21527 /* Leave the scope given by the nested-name-specifier. We will
21528 enter the class scope itself while processing the members. */
21533 {
21536 }
21542 out:
21545 }
21547 /* Parse a class-key.
21549 class-key:
21550 class
21551 struct
21552 union
21554 Returns the kind of class-key specified, or none_type to indicate
21555 error. */
21557 static enum tag_types
21559 {
21563 /* Look for the class-key. */
21568 /* Check to see if the TOKEN is a class-key. */
21573 }
21575 /* Parse a type-parameter-key.
21577 type-parameter-key:
21578 class
21579 typename
21580 */
21582 static void
21584 {
21585 /* Look for the type-parameter-key. */
21589 {
21592 /* typename is not allowed in a template template parameter
21593 by the standard until C++1Z. */
21595 "ISO C++ forbids typename key in template template parameter;"
21597 }
21598 else
21602 }
21604 /* Parse an (optional) member-specification.
21606 member-specification:
21607 member-declaration member-specification [opt]
21608 access-specifier : member-specification [opt] */
21610 static void
21612 {
21614 {
21618 /* Peek at the next token. */
21620 /* If it's a `}', or EOF then we've seen all the members. */
21626 /* See if this token is a keyword. */
21629 {
21633 /* Consume the access-specifier. */
21635 /* Remember which access-specifier is active. */
21637 /* Look for the `:'. */
21642 /* Accept #pragmas at class scope. */
21644 {
21647 }
21649 /* Otherwise, the next construction must be a
21650 member-declaration. */
21652 }
21653 }
21654 }
21656 /* Parse a member-declaration.
21658 member-declaration:
21659 decl-specifier-seq [opt] member-declarator-list [opt] ;
21660 function-definition ; [opt]
21661 :: [opt] nested-name-specifier template [opt] unqualified-id ;
21662 using-declaration
21663 template-declaration
21664 alias-declaration
21666 member-declarator-list:
21667 member-declarator
21668 member-declarator-list , member-declarator
21670 member-declarator:
21671 declarator pure-specifier [opt]
21672 declarator constant-initializer [opt]
21673 identifier [opt] : constant-expression
21675 GNU Extensions:
21677 member-declaration:
21678 __extension__ member-declaration
21680 member-declarator:
21681 declarator attributes [opt] pure-specifier [opt]
21682 declarator attributes [opt] constant-initializer [opt]
21683 identifier [opt] attributes [opt] : constant-expression
21685 C++0x Extensions:
21687 member-declaration:
21688 static_assert-declaration */
21690 static void
21692 {
21693 cp_decl_specifier_seq decl_specifiers;
21694 tree prefix_attributes;
21695 tree decl;
21704 /* Check for the `__extension__' keyword. */
21706 {
21707 /* Recurse. */
21709 /* Restore the old value of the PEDANTIC flag. */
21713 }
21715 /* Check for a template-declaration. */
21717 {
21718 /* An explicit specialization here is an error condition, and we
21719 expect the specialization handler to detect and report this. */
21723 else
21727 }
21728 /* Check for a template introduction. */
21732 /* Check for a using-declaration. */
21734 {
21736 {
21737 /* Parse the using-declaration. */
21741 }
21742 else
21743 {
21744 tree decl;
21748 /* Note that if we actually see the '=' token after the
21749 identifier, cp_parser_alias_declaration commits the
21750 tentative parse. In that case, we really expect an
21751 alias-declaration. Otherwise, we expect a using
21752 declaration. */
21753 alias_decl_expected =
21759 else
21763 }
21764 }
21766 /* Check for @defs. */
21768 {
21773 {
21778 }
21780 }
21782 /* If the next token is `static_assert' we have a static assertion. */
21784 {
21787 }
21794 /* Parse the decl-specifier-seq. */
21797 CP_PARSER_FLAGS_OPTIONAL,
21800 /* Check for an invalid type-name. */
21804 /* If there is no declarator, then the decl-specifier-seq should
21805 specify a type. */
21807 {
21808 /* If there was no decl-specifier-seq, and the next token is a
21809 `;', then we have something like:
21811 struct S { ; };
21813 [class.mem]
21815 Each member-declaration shall declare at least one member
21816 name of the class. */
21818 {
21822 }
21823 else
21824 {
21825 tree type;
21827 /* See if this declaration is a friend. */
21829 /* If there were decl-specifiers, check to see if there was
21830 a class-declaration. */
21833 /* Nested classes have already been added to the class, but
21834 a `friend' needs to be explicitly registered. */
21836 {
21837 /* If the `friend' keyword was present, the friend must
21838 be introduced with a class-key. */
21841 "in C++03 a class-key must be used "
21843 /* In this case:
21845 template <typename T> struct A {
21846 friend struct A<T>::B;
21847 };
21849 A<T>::B will be represented by a TYPENAME_TYPE, and
21850 therefore not recognized by check_tag_decl. */
21852 {
21856 }
21859 "friend declaration does not name a class or "
21861 else
21864 }
21865 /* If there is no TYPE, an error message will already have
21866 been issued. */
21868 ;
21869 /* An anonymous aggregate has to be handled specially; such
21870 a declaration really declares a data member (with a
21871 particular type), as opposed to a nested class. */
21873 {
21874 /* C++11 9.5/6. */
21877 "a storage class on an anonymous aggregate "
21880 /* Remove constructors and such from TYPE, now that we
21881 know it is an anonymous aggregate. */
21883 /* And make the corresponding data member. */
21886 /* Add it to the class. */
21888 }
21889 else
21890 cp_parser_check_access_in_redeclaration
21893 }
21894 }
21895 else
21896 {
21899 /* Clear attributes from the decl_specifiers but keep them
21900 around as prefix attributes that apply them to the entity
21901 being declared. */
21905 /* See if these declarations will be friends. */
21908 /* Keep going until we hit the `;' at the end of the
21909 declaration. */
21911 {
21913 tree first_attribute;
21915 /* Peek at the next token. */
21918 /* Check for a bitfield declaration. */
21923 {
21924 tree identifier;
21925 tree width;
21927 /* Get the name of the bitfield. Note that we cannot just
21928 check TOKEN here because it may have been invalidated by
21929 the call to cp_lexer_peek_nth_token above. */
21932 else
21935 /* Consume the `:' token. */
21937 /* Get the width of the bitfield. */
21938 width
21941 /* Look for attributes that apply to the bitfield. */
21943 /* Remember which attributes are prefix attributes and
21944 which are not. */
21946 /* Combine the attributes. */
21949 /* Create the bitfield declaration. */
21952 identifier,
21953 sfk_none)
21956 width,
21957 attributes);
21958 }
21959 else
21960 {
21962 tree initializer;
21963 tree asm_specification;
21966 /* Parse the declarator. */
21967 declarator
21972 friend_p);
21974 /* If something went wrong parsing the declarator, make sure
21975 that we at least consume some tokens. */
21977 {
21978 /* Skip to the end of the statement. */
21980 /* If the next token is not a semicolon, that is
21981 probably because we just skipped over the body of
21982 a function. So, we consume a semicolon if
21983 present, but do not issue an error message if it
21984 is not present. */
21986 CPP_SEMICOLON))
21989 }
21992 cp_parser_check_for_definition_in_return_type
21996 /* Look for an asm-specification. */
21998 /* Look for attributes that apply to the declaration. */
22000 /* Remember which attributes are prefix attributes and
22001 which are not. */
22003 /* Combine the attributes. */
22006 /* If it's an `=', then we have a constant-initializer or a
22007 pure-specifier. It is not correct to parse the
22008 initializer before registering the member declaration
22009 since the member declaration should be in scope while
22010 its initializer is processed. However, the rest of the
22011 front end does not yet provide an interface that allows
22012 us to handle this correctly. */
22014 {
22015 /* In [class.mem]:
22017 A pure-specifier shall be used only in the declaration of
22018 a virtual function.
22020 A member-declarator can contain a constant-initializer
22021 only if it declares a static member of integral or
22022 enumeration type.
22024 Therefore, if the DECLARATOR is for a function, we look
22025 for a pure-specifier; otherwise, we look for a
22026 constant-initializer. When we call `grokfield', it will
22027 perform more stringent semantics checks. */
22039 {
22041 /* Don't require a constant rvalue in C++11, since we
22042 might want a reference constant. We'll enforce
22043 constancy later. */
22045 /* Parse the initializer. */
22048 }
22049 else
22050 /* Parse the initializer. */
22052 }
22055 {
22059 else
22061 }
22062 /* Otherwise, there is no initializer. */
22063 else
22066 /* See if we are probably looking at a function
22067 definition. We are certainly not looking at a
22068 member-declarator. Calling `grokfield' has
22069 side-effects, so we must not do it unless we are sure
22070 that we are looking at a member-declarator. */
22073 {
22074 /* The grammar does not allow a pure-specifier to be
22075 used when a member function is defined. (It is
22076 possible that this fact is an oversight in the
22077 standard, since a pure function may be defined
22078 outside of the class-specifier. */
22084 declarator,
22085 attributes);
22088 /* If the member was not a friend, declare it here. */
22091 /* Peek at the next token. */
22093 /* If the next token is a semicolon, consume it. */
22097 }
22098 else
22101 /* Create the declaration. */
22106 {
22109 else
22111 }
22112 }
22117 /* Reset PREFIX_ATTRIBUTES. */
22123 /* If there is any qualification still in effect, clear it
22124 now; we will be starting fresh with the next declarator. */
22128 /* If it's a `,', then there are more declarators. */
22130 {
22133 {
22137 }
22138 }
22139 /* If the next token isn't a `;', then we have a parse error. */
22141 CPP_SEMICOLON))
22142 {
22143 /* The next token might be a ways away from where the
22144 actual semicolon is missing. Find the previous token
22145 and use that for our error position. */
22150 /* Assume that the user meant to provide a semicolon. If
22151 we were to cp_parser_skip_to_end_of_statement, we might
22152 skip to a semicolon inside a member function definition
22153 and issue nonsensical error messages. */
22155 }
22158 {
22159 /* Add DECL to the list of members. */
22161 /* Explicitly include, eg, NSDMIs, for better error
22162 recovery (c++/58650). */
22171 /* Add DECL to the queue of NSDMI to be parsed later. */
22173 }
22177 }
22178 }
22181 out:
22183 }
22185 /* Parse a pure-specifier.
22187 pure-specifier:
22188 = 0
22190 Returns INTEGER_ZERO_NODE if a pure specifier is found.
22191 Otherwise, ERROR_MARK_NODE is returned. */
22193 static tree
22195 {
22198 /* Look for the `=' token. */
22201 /* Look for the `0' token. */
22210 /* Accept = default or = delete in c++0x mode. */
22213 {
22216 }
22218 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
22220 {
22225 }
22227 {
22230 }
22233 }
22235 /* Parse a constant-initializer.
22237 constant-initializer:
22238 = constant-expression
22240 Returns a representation of the constant-expression. */
22242 static tree
22244 {
22245 /* Look for the `=' token. */
22249 /* It is invalid to write:
22251 struct S { static const int i = { 7 }; };
22253 */
22255 {
22258 /* Consume the opening brace. */
22260 /* Skip the initializer. */
22262 /* Look for the trailing `}'. */
22266 }
22269 }
22271 /* Derived classes [gram.class.derived] */
22273 /* Parse a base-clause.
22275 base-clause:
22276 : base-specifier-list
22278 base-specifier-list:
22279 base-specifier ... [opt]
22280 base-specifier-list , base-specifier ... [opt]
22282 Returns a TREE_LIST representing the base-classes, in the order in
22283 which they were declared. The representation of each node is as
22284 described by cp_parser_base_specifier.
22286 In the case that no bases are specified, this function will return
22287 NULL_TREE, not ERROR_MARK_NODE. */
22289 static tree
22291 {
22294 /* Look for the `:' that begins the list. */
22297 /* Scan the base-specifier-list. */
22299 {
22301 tree base;
22304 /* Look for the base-specifier. */
22306 /* Look for the (optional) ellipsis. */
22308 {
22309 /* Consume the `...'. */
22313 }
22315 /* Add BASE to the front of the list. */
22317 {
22319 /* Make this a pack expansion type. */
22323 {
22326 }
22327 }
22328 /* Peek at the next token. */
22330 /* If it's not a comma, then the list is complete. */
22333 /* Consume the `,'. */
22335 }
22337 /* PARSER->SCOPE may still be non-NULL at this point, if the last
22338 base class had a qualified name. However, the next name that
22339 appears is certainly not qualified. */
22345 }
22347 /* Parse a base-specifier.
22349 base-specifier:
22350 :: [opt] nested-name-specifier [opt] class-name
22351 virtual access-specifier [opt] :: [opt] nested-name-specifier
22352 [opt] class-name
22353 access-specifier virtual [opt] :: [opt] nested-name-specifier
22354 [opt] class-name
22356 Returns a TREE_LIST. The TREE_PURPOSE will be one of
22357 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
22358 indicate the specifiers provided. The TREE_VALUE will be a TYPE
22359 (or the ERROR_MARK_NODE) indicating the type that was specified. */
22361 static tree
22363 {
22371 tree type;
22373 /* Process the optional `virtual' and `access-specifier'. */
22375 {
22376 /* Peek at the next token. */
22378 /* Process `virtual'. */
22380 {
22382 /* If `virtual' appears more than once, issue an error. */
22384 {
22388 }
22392 /* Consume the `virtual' token. */
22400 /* If more than one access specifier appears, issue an
22401 error. */
22404 {
22408 }
22412 /* Consume the access-specifier. */
22420 }
22421 }
22422 /* It is not uncommon to see programs mechanically, erroneously, use
22423 the 'typename' keyword to denote (dependent) qualified types
22424 as base classes. */
22426 {
22431 else
22433 "keyword %<typename%> not allowed in this context "
22436 }
22438 /* Look for the optional `::' operator. */
22440 /* Look for the nested-name-specifier. The simplest way to
22441 implement:
22443 [temp.res]
22445 The keyword `typename' is not permitted in a base-specifier or
22446 mem-initializer; in these contexts a qualified name that
22447 depends on a template-parameter is implicitly assumed to be a
22448 type name.
22450 is to pretend that we have seen the `typename' keyword at this
22451 point. */
22455 typename_type,
22457 /* If the base class is given by a qualified name, assume that names
22458 we see are type names or templates, as appropriate. */
22464 /* DR 950 allows decltype as a base-specifier. */
22466 else
22467 {
22468 /* Otherwise, look for the class-name. */
22470 class_scope_p,
22471 template_p,
22472 typename_type,
22477 }
22483 }
22485 /* Exception handling [gram.exception] */
22487 /* Parse an (optional) noexcept-specification.
22489 noexcept-specification:
22490 noexcept ( constant-expression ) [opt]
22492 If no noexcept-specification is present, returns NULL_TREE.
22493 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
22494 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
22495 there are no parentheses. CONSUMED_EXPR will be set accordingly.
22496 Otherwise, returns a noexcept specification unless RETURN_COND is true,
22497 in which case a boolean condition is returned instead. */
22499 static tree
22504 {
22508 /* Peek at the next token. */
22511 /* Is it a noexcept-specification? */
22513 {
22514 tree expr;
22518 {
22522 {
22523 /* Types may not be defined in an exception-specification. */
22525 parser->type_definition_forbidden_message
22530 /* Restore the saved message. */
22532 }
22533 else
22534 {
22537 }
22540 }
22541 else
22542 {
22546 }
22548 /* We cannot build a noexcept-spec right away because this will check
22549 that expr is a constexpr. */
22552 else
22554 }
22555 else
22557 }
22559 /* Parse an (optional) exception-specification.
22561 exception-specification:
22562 throw ( type-id-list [opt] )
22564 Returns a TREE_LIST representing the exception-specification. The
22565 TREE_VALUE of each node is a type. */
22567 static tree
22569 {
22571 tree type_id_list;
22574 /* Peek at the next token. */
22577 /* Is it a noexcept-specification? */
22583 /* If it's not `throw', then there's no exception-specification. */
22587 #if 0
22588 /* Enable this once a lot of code has transitioned to noexcept? */
22592 #endif
22594 /* Consume the `throw'. */
22597 /* Look for the `('. */
22600 /* Peek at the next token. */
22602 /* If it's not a `)', then there is a type-id-list. */
22604 {
22605 /* Types may not be defined in an exception-specification. */
22607 parser->type_definition_forbidden_message
22609 /* Parse the type-id-list. */
22611 /* Restore the saved message. */
22613 }
22614 else
22617 /* Look for the `)'. */
22621 }
22623 /* Parse an (optional) type-id-list.
22625 type-id-list:
22626 type-id ... [opt]
22627 type-id-list , type-id ... [opt]
22629 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
22630 in the order that the types were presented. */
22632 static tree
22634 {
22638 {
22640 tree type;
22642 /* Get the next type-id. */
22644 /* Parse the optional ellipsis. */
22646 {
22647 /* Consume the `...'. */
22650 /* Turn the type into a pack expansion expression. */
22652 }
22653 /* Add it to the list. */
22655 /* Peek at the next token. */
22657 /* If it is not a `,', we are done. */
22660 /* Consume the `,'. */
22662 }
22665 }
22667 /* Parse a try-block.
22669 try-block:
22670 try compound-statement handler-seq */
22672 static tree
22674 {
22675 tree try_block;
22689 }
22691 /* Parse a function-try-block.
22693 function-try-block:
22694 try ctor-initializer [opt] function-body handler-seq */
22696 static bool
22698 {
22699 tree compound_stmt;
22700 tree try_block;
22703 /* Look for the `try' keyword. */
22706 /* Let the rest of the front end know where we are. */
22708 /* Parse the function-body. */
22709 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
22711 /* We're done with the `try' part. */
22713 /* Parse the handlers. */
22715 /* We're done with the handlers. */
22719 }
22721 /* Parse a handler-seq.
22723 handler-seq:
22724 handler handler-seq [opt] */
22726 static void
22728 {
22730 {
22733 /* Parse the handler. */
22735 /* Peek at the next token. */
22737 /* If it's not `catch' then there are no more handlers. */
22740 }
22741 }
22743 /* Parse a handler.
22745 handler:
22746 catch ( exception-declaration ) compound-statement */
22748 static void
22750 {
22751 tree handler;
22752 tree declaration;
22762 }
22764 /* Parse an exception-declaration.
22766 exception-declaration:
22767 type-specifier-seq declarator
22768 type-specifier-seq abstract-declarator
22769 type-specifier-seq
22770 ...
22772 Returns a VAR_DECL for the declaration, or NULL_TREE if the
22773 ellipsis variant is used. */
22775 static tree
22777 {
22778 cp_decl_specifier_seq type_specifiers;
22782 /* If it's an ellipsis, it's easy to handle. */
22784 {
22785 /* Consume the `...' token. */
22788 }
22790 /* Types may not be defined in exception-declarations. */
22792 parser->type_definition_forbidden_message
22795 /* Parse the type-specifier-seq. */
22799 /* If it's a `)', then there is no declarator. */
22802 else
22809 /* Restore the saved message. */
22816 }
22818 /* Parse a throw-expression.
22820 throw-expression:
22821 throw assignment-expression [opt]
22823 Returns a THROW_EXPR representing the throw-expression. */
22825 static tree
22827 {
22828 tree expression;
22833 /* Figure out whether or not there is an assignment-expression
22834 following the "throw" keyword. */
22842 else
22846 }
22848 /* GNU Extensions */
22850 /* Parse an (optional) asm-specification.
22852 asm-specification:
22853 asm ( string-literal )
22855 If the asm-specification is present, returns a STRING_CST
22856 corresponding to the string-literal. Otherwise, returns
22857 NULL_TREE. */
22859 static tree
22861 {
22863 tree asm_specification;
22865 /* Peek at the next token. */
22867 /* If the next token isn't the `asm' keyword, then there's no
22868 asm-specification. */
22872 /* Consume the `asm' token. */
22874 /* Look for the `('. */
22877 /* Look for the string-literal. */
22880 /* Look for the `)'. */
22884 }
22886 /* Parse an asm-operand-list.
22888 asm-operand-list:
22889 asm-operand
22890 asm-operand-list , asm-operand
22892 asm-operand:
22893 string-literal ( expression )
22894 [ string-literal ] string-literal ( expression )
22896 Returns a TREE_LIST representing the operands. The TREE_VALUE of
22897 each node is the expression. The TREE_PURPOSE is itself a
22898 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
22899 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
22900 is a STRING_CST for the string literal before the parenthesis. Returns
22901 ERROR_MARK_NODE if any of the operands are invalid. */
22903 static tree
22905 {
22910 {
22911 tree string_literal;
22912 tree expression;
22913 tree name;
22916 {
22917 /* Consume the `[' token. */
22919 /* Read the operand name. */
22924 /* Look for the closing `]'. */
22926 }
22927 else
22929 /* Look for the string-literal. */
22932 /* Look for the `('. */
22934 /* Parse the expression. */
22936 /* Look for the `)'. */
22944 /* Add this operand to the list. */
22946 expression,
22947 asm_operands);
22948 /* If the next token is not a `,', there are no more
22949 operands. */
22952 /* Consume the `,'. */
22954 }
22957 }
22959 /* Parse an asm-clobber-list.
22961 asm-clobber-list:
22962 string-literal
22963 asm-clobber-list , string-literal
22965 Returns a TREE_LIST, indicating the clobbers in the order that they
22966 appeared. The TREE_VALUE of each node is a STRING_CST. */
22968 static tree
22970 {
22974 {
22975 tree string_literal;
22977 /* Look for the string literal. */
22979 /* Add it to the list. */
22981 /* If the next token is not a `,', then the list is
22982 complete. */
22985 /* Consume the `,' token. */
22987 }
22990 }
22992 /* Parse an asm-label-list.
22994 asm-label-list:
22995 identifier
22996 asm-label-list , identifier
22998 Returns a TREE_LIST, indicating the labels in the order that they
22999 appeared. The TREE_VALUE of each node is a label. */
23001 static tree
23003 {
23007 {
23010 /* Look for the identifier. */
23013 {
23016 {
23022 }
23023 }
23024 /* If the next token is not a `,', then the list is
23025 complete. */
23028 /* Consume the `,' token. */
23030 }
23033 }
23035 /* Return TRUE iff the next tokens in the stream are possibly the
23036 beginning of a GNU extension attribute. */
23038 static bool
23040 {
23042 }
23044 /* Return TRUE iff the next tokens in the stream are possibly the
23045 beginning of a standard C++-11 attribute specifier. */
23047 static bool
23049 {
23051 }
23053 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23054 beginning of a standard C++-11 attribute specifier. */
23056 static bool
23058 {
23066 }
23068 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23069 beginning of a GNU extension attribute. */
23071 static bool
23073 {
23077 }
23079 /* Return true iff the next tokens can be the beginning of either a
23080 GNU attribute list, or a standard C++11 attribute sequence. */
23082 static bool
23084 {
23087 }
23089 /* Return true iff the next Nth tokens can be the beginning of either
23090 a GNU attribute list, or a standard C++11 attribute sequence. */
23092 static bool
23094 {
23097 }
23099 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
23100 of GNU attributes, or return NULL. */
23102 static tree
23104 {
23108 }
23110 #define CILK_SIMD_FN_CLAUSE_MASK \
23111 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
23112 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
23113 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
23114 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
23115 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
23117 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
23118 vector [(<clauses>)] */
23120 static void
23122 {
23126 {
23131 }
23134 {
23137 paren_scope++;
23138 }
23140 {
23143 paren_scope++;
23145 paren_scope--;
23146 /* Do not push the last ')' */
23149 }
23158 }
23160 /* Parse an (optional) series of attributes.
23162 attributes:
23163 attributes attribute
23165 attribute:
23166 __attribute__ (( attribute-list [opt] ))
23168 The return value is as for cp_parser_gnu_attribute_list. */
23170 static tree
23172 {
23176 {
23178 tree attribute_list;
23181 /* Peek at the next token. */
23183 /* If it's not `__attribute__', then we're done. */
23187 /* Consume the `__attribute__' keyword. */
23189 /* Look for the two `(' tokens. */
23193 /* Peek at the next token. */
23196 /* Parse the attribute-list. */
23198 else
23199 /* If the next token is a `)', then there is no attribute
23200 list. */
23203 /* Look for the two `)' tokens. */
23211 /* Add these new attributes to the list. */
23213 }
23216 }
23218 /* Parse a GNU attribute-list.
23220 attribute-list:
23221 attribute
23222 attribute-list , attribute
23224 attribute:
23225 identifier
23226 identifier ( identifier )
23227 identifier ( identifier , expression-list )
23228 identifier ( expression-list )
23230 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
23231 to an attribute. The TREE_PURPOSE of each node is the identifier
23232 indicating which attribute is in use. The TREE_VALUE represents
23233 the arguments, if any. */
23235 static tree
23237 {
23243 {
23245 tree identifier;
23246 tree attribute;
23248 /* Look for the identifier. We also allow keywords here; for
23249 example `__attribute__ ((const))' is legal. */
23253 {
23256 /* Consume the token, but save it since we need it for the
23257 SIMD enabled function parsing. */
23260 /* Save away the identifier that indicates which attribute
23261 this is. */
23263 /* For keywords, use the canonical spelling, not the
23264 parsed identifier. */
23270 /* Peek at the next token. */
23272 /* If it's an `(', then parse the attribute arguments. */
23274 {
23279 {
23282 }
23283 else
23284 vec = cp_parser_parenthesized_expression_list
23290 else
23291 {
23294 }
23295 /* Save the arguments away. */
23297 }
23299 {
23302 }
23305 {
23306 /* Add this attribute to the list. */
23309 }
23312 }
23313 /* Now, look for more attributes. If the next token isn't a
23314 `,', we're done. */
23318 /* Consume the comma and keep going. */
23320 }
23323 /* We built up the list in reverse order. */
23325 }
23327 /* Parse a standard C++11 attribute.
23329 The returned representation is a TREE_LIST which TREE_PURPOSE is
23330 the scoped name of the attribute, and the TREE_VALUE is its
23331 arguments list.
23333 Note that the scoped name of the attribute is itself a TREE_LIST
23334 which TREE_PURPOSE is the namespace of the attribute, and
23335 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
23336 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
23337 and which TREE_PURPOSE is directly the attribute name.
23339 Clients of the attribute code should use get_attribute_namespace
23340 and get_attribute_name to get the actual namespace and name of
23341 attributes, regardless of their being GNU or C++11 attributes.
23343 attribute:
23344 attribute-token attribute-argument-clause [opt]
23346 attribute-token:
23347 identifier
23348 attribute-scoped-token
23350 attribute-scoped-token:
23351 attribute-namespace :: identifier
23353 attribute-namespace:
23354 identifier
23356 attribute-argument-clause:
23357 ( balanced-token-seq )
23359 balanced-token-seq:
23360 balanced-token [opt]
23361 balanced-token-seq balanced-token
23363 balanced-token:
23364 ( balanced-token-seq )
23365 [ balanced-token-seq ]
23366 { balanced-token-seq }. */
23368 static tree
23370 {
23374 /* First, parse name of the attribute, a.k.a attribute-token. */
23391 {
23392 /* We are seeing a scoped attribute token. */
23402 else
23403 {
23407 }
23409 NULL_TREE);
23411 }
23412 else
23413 {
23415 NULL_TREE);
23416 /* C++11 noreturn attribute is equivalent to GNU's. */
23419 /* C++14 deprecated attribute is equivalent to GNU's. */
23421 {
23424 "%<deprecated%> is a C++14 feature;"
23427 }
23428 /* Transactional Memory TS optimize_for_synchronized attribute is
23429 equivalent to GNU transaction_callable. */
23433 /* Transactional Memory attributes are GNU attributes. */
23436 }
23438 /* Now parse the optional argument clause of the attribute. */
23443 {
23449 /* A GNU attribute that takes an identifier in parameter. */
23452 vec = cp_parser_parenthesized_expression_list
23458 else
23459 {
23462 }
23466 else
23468 }
23471 }
23473 /* Check that the attribute ATTRIBUTE appears at most once in the
23474 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
23475 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
23476 isn't implemented yet in GCC. */
23478 static void
23480 {
23482 {
23492 }
23493 }
23495 /* Parse a list of standard C++-11 attributes.
23497 attribute-list:
23498 attribute [opt]
23499 attribute-list , attribute[opt]
23500 attribute ...
23501 attribute-list , attribute ...
23502 */
23504 static tree
23506 {
23511 {
23516 {
23520 }
23523 {
23528 }
23532 }
23535 }
23537 /* Parse a standard C++-11 attribute specifier.
23539 attribute-specifier:
23540 [ [ attribute-list ] ]
23541 alignment-specifier
23543 alignment-specifier:
23544 alignas ( type-id ... [opt] )
23545 alignas ( alignment-expression ... [opt] ). */
23547 static tree
23549 {
23555 {
23564 else
23565 /* Warn about parsing c++11 attribute in non-c++1 mode, only
23566 when we are sure that we have actually parsed them. */
23568 }
23569 else
23570 {
23571 tree alignas_expr;
23573 /* Look for an alignment-specifier. */
23585 {
23588 }
23594 {
23598 alignas_expr =
23605 }
23611 {
23614 }
23617 {
23620 }
23622 /* Build the C++-11 representation of an 'aligned'
23623 attribute. */
23624 attributes =
23627 alignas_expr);
23628 }
23631 }
23633 /* Parse a standard C++-11 attribute-specifier-seq.
23635 attribute-specifier-seq:
23636 attribute-specifier-seq [opt] attribute-specifier
23637 */
23639 static tree
23641 {
23645 {
23654 }
23658 }
23660 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
23661 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
23662 current value of the PEDANTIC flag, regardless of whether or not
23663 the `__extension__' keyword is present. The caller is responsible
23664 for restoring the value of the PEDANTIC flag. */
23666 static bool
23668 {
23669 /* Save the old value of the PEDANTIC flag. */
23673 {
23674 /* Consume the `__extension__' token. */
23676 /* We're not being pedantic while the `__extension__' keyword is
23677 in effect. */
23681 }
23684 }
23686 /* Parse a label declaration.
23688 label-declaration:
23689 __label__ label-declarator-seq ;
23691 label-declarator-seq:
23692 identifier , label-declarator-seq
23693 identifier */
23695 static void
23697 {
23698 /* Look for the `__label__' keyword. */
23702 {
23703 tree identifier;
23705 /* Look for an identifier. */
23707 /* If we failed, stop. */
23710 /* Declare it as a label. */
23712 /* If the next token is a `;', stop. */
23715 /* Look for the `,' separating the label declarations. */
23717 }
23719 /* Look for the final `;'. */
23721 }
23723 // -------------------------------------------------------------------------- //
23724 // Requires Clause
23726 // Parse a requires clause.
23727 //
23728 // requires-clause:
23729 // 'requires' logical-or-expression
23730 //
23731 // The required logical-or-expression must be a constant expression. Note
23732 // that we don't check that the expression is constepxr here. We defer until
23733 // we analyze constraints and then, we only check atomic constraints.
23734 static tree
23736 {
23737 // Parse the requires clause so that it is not automatically folded.
23743 }
23745 // Optionally parse a requires clause:
23746 static tree
23748 {
23753 }
23756 /*---------------------------------------------------------------------------
23757 Requires expressions
23758 ---------------------------------------------------------------------------*/
23760 /* Parse a requires expression
23762 requirement-expression:
23763 'requires' requirement-parameter-list [opt] requirement-body */
23764 static tree
23766 {
23770 /* A requires-expression shall appear only within a concept
23771 definition or a requires-clause.
23773 TODO: Implement this diagnostic correctly. */
23775 {
23779 }
23782 {
23783 /* Local parameters are delared as variables within the scope
23784 of the expression. They are not visible past the end of
23785 the expression. Expressions within the requires-expression
23786 are unevaluated. */
23787 struct scope_sentinel
23788 {
23790 {
23793 }
23796 {
23799 }
23802 /* Parse the optional parameter list. */
23804 {
23808 }
23809 else
23812 /* Parse the requirement body. */
23816 }
23818 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
23819 the parm chain. */
23822 }
23824 /* Parse a parameterized requirement.
23826 requirement-parameter-list:
23827 '(' parameter-declaration-clause ')' */
23828 static tree
23830 {
23840 }
23842 /* Parse the body of a requirement.
23844 requirement-body:
23845 '{' requirement-list '}' */
23846 static tree
23848 {
23858 }
23860 /* Parse a list of requirements.
23862 requirement-list:
23863 requirement
23864 requirement-list ';' requirement[opt] */
23865 static tree
23867 {
23870 {
23877 /* If we see a semi-colon, consume it. */
23881 /* Stop processing at the end of the list. */
23884 }
23886 /* Reverse the order of requirements so they are analyzed in
23887 declaration order. */
23889 }
23891 /* Parse a syntactic requirement or type requirement.
23893 requirement:
23894 simple-requirement
23895 compound-requirement
23896 type-requirement
23897 nested-requirement */
23898 static tree
23900 {
23907 else
23909 }
23911 /* Parse a simple requirement.
23913 simple-requirement:
23914 expression ';' */
23915 static tree
23917 {
23926 }
23928 /* Parse a type requirement
23930 type-requirement
23931 nested-name-specifier [opt] required-type-name ';'
23933 required-type-name:
23934 type-name
23935 'template' [opt] simple-template-id */
23936 static tree
23938 {
23941 // Save the scope before parsing name specifiers.
23952 tree type;
23954 {
23963 }
23964 else
23983 }
23985 /* Parse a compound requirement
23987 compound-requirement:
23988 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
23989 static tree
23991 {
23992 /* Parse an expression enclosed in '{ }'s. */
24003 /* Parse the optional noexcept. */
24006 {
24009 }
24011 /* Parse the optional trailing return type. */
24014 {
24022 }
24025 }
24027 /* Parse a nested requirement. This is the same as a requires clause.
24029 nested-requirement:
24030 requires-clause */
24031 static tree
24033 {
24039 }
24041 /* Support Functions */
24043 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
24044 NAME should have one of the representations used for an
24045 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
24046 is returned. If PARSER->SCOPE is a dependent type, then a
24047 SCOPE_REF is returned.
24049 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
24050 returned; the name was already resolved when the TEMPLATE_ID_EXPR
24051 was formed. Abstractly, such entities should not be passed to this
24052 function, because they do not need to be looked up, but it is
24053 simpler to check for this special case here, rather than at the
24054 call-sites.
24056 In cases not explicitly covered above, this function returns a
24057 DECL, OVERLOAD, or baselink representing the result of the lookup.
24058 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
24059 is returned.
24061 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
24062 (e.g., "struct") that was used. In that case bindings that do not
24063 refer to types are ignored.
24065 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
24066 ignored.
24068 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
24069 are ignored.
24071 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
24072 types.
24074 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
24075 TREE_LIST of candidates if name-lookup results in an ambiguity, and
24076 NULL_TREE otherwise. */
24078 static tree
24085 location_t name_location)
24086 {
24087 tree decl;
24090 /* Assume that the lookup will be unambiguous. */
24094 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
24095 no longer valid. Note that if we are parsing tentatively, and
24096 the parse fails, OBJECT_TYPE will be automatically restored. */
24102 /* A template-id has already been resolved; there is no lookup to
24103 do. */
24107 {
24111 }
24113 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
24114 it should already have been checked to make sure that the name
24115 used matches the type being destroyed. */
24117 {
24118 tree type;
24120 /* Figure out to which type this destructor applies. */
24125 else
24127 /* If that's not a class type, there is no destructor. */
24134 /* If it was a class type, return the destructor. */
24136 }
24138 /* By this point, the NAME should be an ordinary identifier. If
24139 the id-expression was a qualified name, the qualifying scope is
24140 stored in PARSER->SCOPE at this point. */
24143 /* Perform the lookup. */
24145 {
24151 /* If the SCOPE is dependent, the lookup must be deferred until
24152 the template is instantiated -- unless we are explicitly
24153 looking up names in uninstantiated templates. Even then, we
24154 cannot look up the name if the scope is not a class type; it
24155 might, for example, be a template type parameter. */
24160 /* Defer lookup. */
24162 else
24163 {
24166 /* If PARSER->SCOPE is a dependent type, then it must be a
24167 class type, and we must not be checking dependencies;
24168 otherwise, we would have processed this lookup above. So
24169 that PARSER->SCOPE is not considered a dependent base by
24170 lookup_member, we must enter the scope here. */
24174 /* If the PARSER->SCOPE is a template specialization, it
24175 may be instantiated during name lookup. In that case,
24176 errors may be issued. Even if we rollback the current
24177 tentative parse, those errors are valid. */
24182 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
24183 lookup result and the nested-name-specifier nominates a class C:
24184 * if the name specified after the nested-name-specifier, when
24185 looked up in C, is the injected-class-name of C (Clause 9), or
24186 * if the name specified after the nested-name-specifier is the
24187 same as the identifier or the simple-template-id's template-
24188 name in the last component of the nested-name-specifier,
24189 the name is instead considered to name the constructor of
24190 class C. [ Note: for example, the constructor is not an
24191 acceptable lookup result in an elaborated-type-specifier so
24192 the constructor would not be used in place of the
24193 injected-class-name. --end note ] Such a constructor name
24194 shall be used only in the declarator-id of a declaration that
24195 names a constructor or in a using-declaration. */
24203 /* If we have a single function from a using decl, pull it out. */
24210 }
24212 /* If the scope is a dependent type and either we deferred lookup or
24213 we did lookup but didn't find the name, rememeber the name. */
24216 {
24218 {
24219 tree type;
24221 /* The resolution to Core Issue 180 says that `struct
24222 A::B' should be considered a type-name, even if `A'
24223 is dependent. */
24228 }
24232 CPP_CLOSE_PAREN)))
24236 else
24239 is_template);
24240 }
24243 }
24245 {
24246 /* Look up the name in the scope of the OBJECT_TYPE, unless the
24247 OBJECT_TYPE is not a class. */
24249 /* If the OBJECT_TYPE is a template specialization, it may
24250 be instantiated during name lookup. In that case, errors
24251 may be issued. Even if we rollback the current tentative
24252 parse, those errors are valid. */
24254 name,
24257 tf_warning_or_error);
24258 else
24262 /* Look it up in the enclosing context. */
24268 }
24269 else
24270 {
24276 }
24278 /* If the lookup failed, let our caller know. */
24282 /* Pull out the template from an injected-class-name (or multiple). */
24286 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
24288 {
24291 /* The error message we have to print is too complicated for
24292 cp_parser_error, so we incorporate its actions directly. */
24294 {
24296 name);
24298 }
24300 }
24308 /* If we have resolved the name of a member declaration, check to
24309 see if the declaration is accessible. When the name resolves to
24310 set of overloaded functions, accessibility is checked when
24311 overload resolution is done.
24313 During an explicit instantiation, access is not checked at all,
24314 as per [temp.explicit]. */
24321 }
24323 /* Like cp_parser_lookup_name, but for use in the typical case where
24324 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
24325 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
24327 static tree
24329 {
24331 none_type,
24336 location);
24337 }
24339 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
24340 the current context, return the TYPE_DECL. If TAG_NAME_P is
24341 true, the DECL indicates the class being defined in a class-head,
24342 or declared in an elaborated-type-specifier.
24344 Otherwise, return DECL. */
24346 static tree
24348 {
24349 /* If the TEMPLATE_DECL is being declared as part of a class-head,
24350 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
24352 struct A {
24353 template <typename T> struct B;
24354 };
24356 template <typename T> struct A::B {};
24358 Similarly, in an elaborated-type-specifier:
24360 namespace N { struct X{}; }
24362 struct A {
24363 template <typename T> friend struct N::X;
24364 };
24366 However, if the DECL refers to a class type, and we are in
24367 the scope of the class, then the name lookup automatically
24368 finds the TYPE_DECL created by build_self_reference rather
24369 than a TEMPLATE_DECL. For example, in:
24371 template <class T> struct S {
24372 S s;
24373 };
24375 there is no need to handle such case. */
24381 }
24383 /* If too many, or too few, template-parameter lists apply to the
24384 declarator, issue an error message. Returns TRUE if all went well,
24385 and FALSE otherwise. */
24387 static bool
24390 location_t declarator_location)
24391 {
24393 {
24395 {
24403 /* If the DECLARATOR has the form `X<y>' then it uses one
24404 additional level of template parameters. */
24407 return cp_parser_check_template_parameters
24409 }
24424 }
24426 }
24428 /* NUM_TEMPLATES were used in the current declaration. If that is
24429 invalid, return FALSE and issue an error messages. Otherwise,
24430 return TRUE. If DECLARATOR is non-NULL, then we are checking a
24431 declarator and we can print more accurate diagnostics. */
24433 static bool
24436 location_t location,
24438 {
24439 /* If there are the same number of template classes and parameter
24440 lists, that's OK. */
24443 /* If there are more, but only one more, then we are referring to a
24444 member template. That's OK too. */
24447 /* If there are more template classes than parameter lists, we have
24448 something like:
24450 template <class T> void S<T>::R<T>::f (); */
24452 {
24462 else
24465 }
24466 /* Otherwise, there are too many template parameter lists. We have
24467 something like:
24469 template <class T> template <class U> void S::f(); */
24472 }
24474 /* Parse an optional `::' token indicating that the following name is
24475 from the global namespace. If so, PARSER->SCOPE is set to the
24476 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
24477 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
24478 Returns the new value of PARSER->SCOPE, if the `::' token is
24479 present, and NULL_TREE otherwise. */
24481 static tree
24483 {
24486 /* Peek at the next token. */
24488 /* If we're looking at a `::' token then we're starting from the
24489 global namespace, not our current location. */
24491 {
24492 /* Consume the `::' token. */
24494 /* Set the SCOPE so that we know where to start the lookup. */
24500 }
24502 {
24506 }
24509 }
24511 /* Returns TRUE if the upcoming token sequence is the start of a
24512 constructor declarator. If FRIEND_P is true, the declarator is
24513 preceded by the `friend' specifier. */
24515 static bool
24517 {
24520 tree nested_name_specifier;
24523 /* The common case is that this is not a constructor declarator, so
24524 try to avoid doing lots of work if at all possible. It's not
24525 valid declare a constructor at function scope. */
24528 /* And only certain tokens can begin a constructor declarator. */
24536 /* Parse tentatively; we are going to roll back all of the tokens
24537 consumed here. */
24539 /* Assume that we are looking at a constructor declarator. */
24542 /* Look for the optional `::' operator. */
24545 /* Look for the nested-name-specifier. */
24546 nested_name_specifier
24557 /* Outside of a class-specifier, there must be a
24558 nested-name-specifier. */
24564 /* If we have a class scope, this is easy; DR 147 says that S::S always
24565 names the constructor, and no other qualified name could. */
24568 {
24578 }
24579 /* If we still think that this might be a constructor-declarator,
24580 look for a class-name. */
24582 {
24583 /* If we have:
24585 template <typename T> struct S {
24586 S();
24587 };
24589 we must recognize that the nested `S' names a class. */
24590 tree type_decl;
24594 none_type,
24598 /* If there was no class-name, then this is not a constructor.
24599 Otherwise, if we are in a class-specifier and we aren't
24600 handling a friend declaration, check that its type matches
24601 current_class_type (c++/38313). Note: error_mark_node
24602 is left alone for error recovery purposes. */
24604 && (outside_class_specifier_p
24609 /* If we're still considering a constructor, we have to see a `(',
24610 to begin the parameter-declaration-clause, followed by either a
24611 `)', an `...', or a decl-specifier. We need to check for a
24612 type-specifier to avoid being fooled into thinking that:
24614 S (f) (int);
24616 is a constructor. (It is actually a function named `f' that
24617 takes one parameter (of type `int') and returns a value of type
24618 `S'. */
24626 /* A parameter declaration begins with a decl-specifier,
24627 which is either the "attribute" keyword, a storage class
24628 specifier, or (usually) a type-specifier. */
24630 {
24631 tree type;
24635 /* Names appearing in the type-specifier should be looked up
24636 in the scope of the class. */
24639 else
24640 {
24643 {
24647 {
24650 }
24651 }
24653 }
24655 /* Inside the constructor parameter list, surrounding
24656 template-parameter-lists do not apply. */
24657 saved_num_template_parameter_lists
24661 /* Look for the type-specifier. */
24663 CP_PARSER_FLAGS_NONE,
24669 parser->num_template_parameter_lists
24672 /* Leave the scope of the class. */
24677 }
24678 }
24680 /* We did not really want to consume any tokens. */
24684 }
24686 /* Parse the definition of the function given by the DECL_SPECIFIERS,
24687 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
24688 they must be performed once we are in the scope of the function.
24690 Returns the function defined. */
24692 static tree
24693 cp_parser_function_definition_from_specifiers_and_declarator
24696 tree attributes,
24698 {
24699 tree fn;
24702 /* Begin the function-definition. */
24705 /* The things we're about to see are not directly qualified by any
24706 template headers we've seen thus far. */
24709 /* If there were names looked up in the decl-specifier-seq that we
24710 did not check, check them now. We must wait until we are in the
24711 scope of the function to perform the checks, since the function
24712 might be a friend. */
24716 {
24721 }
24724 {
24725 /* Skip the entire function. */
24728 }
24730 {
24731 /* Seen already, skip it. An error message has already been output. */
24735 /* If this is a function from a class, pop the nested class. */
24738 }
24739 else
24740 {
24741 timevar_id_t tv;
24744 else
24750 }
24753 }
24755 /* Parse the part of a function-definition that follows the
24756 declarator. INLINE_P is TRUE iff this function is an inline
24757 function defined within a class-specifier.
24759 Returns the function defined. */
24761 static tree
24764 {
24765 tree fn;
24771 bool fully_implicit_function_template_p
24774 tree implicit_template_parms
24777 cp_binding_level* implicit_template_scope
24783 /* If the next token is `return', then the code may be trying to
24784 make use of the "named return value" extension that G++ used to
24785 support. */
24788 {
24789 /* Consume the `return' keyword. */
24791 /* Look for the identifier that indicates what value is to be
24792 returned. */
24794 /* Issue an error message. */
24797 /* Skip tokens until we reach the start of the function body. */
24799 {
24806 }
24807 }
24808 /* The `extern' in `extern "C" void f () { ... }' does not apply to
24809 anything declared inside `f'. */
24810 saved_in_unbraced_linkage_specification_p
24813 /* Inside the function, surrounding template-parameter-lists do not
24814 apply. */
24815 saved_num_template_parameter_lists
24821 /* If the next token is `try', `__transaction_atomic', or
24822 `__transaction_relaxed`, then we are looking at either function-try-block
24823 or function-transaction-block. Note that all of these include the
24824 function-body. */
24827 RID_TRANSACTION_ATOMIC);
24829 RID_TRANSACTION_RELAXED))
24831 RID_TRANSACTION_RELAXED);
24834 else
24835 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
24840 /* Finish the function. */
24843 /* Generate code for it, if necessary. */
24845 /* Restore the saved values. */
24846 parser->in_unbraced_linkage_specification_p
24848 parser->num_template_parameter_lists
24852 parser->fully_implicit_function_template_p
24854 parser->implicit_template_parms
24856 parser->implicit_template_scope
24863 }
24865 /* Parse a template-declaration body (following argument list). */
24867 static void
24869 tree parameter_list,
24871 {
24875 /* We just processed one more parameter list. */
24878 /* Get the deferred access checks from the parameter list. These
24879 will be checked once we know what is being declared, as for a
24880 member template the checks must be performed in the scope of the
24881 class containing the member. */
24884 /* Tentatively parse for a new template parameter list, which can either be
24885 the template keyword or a template introduction. */
24891 else
24892 {
24893 /* There are no access checks when parsing a template, as we do not
24894 know if a specialization will be a friend. */
24898 checks,
24899 member_p,
24904 /* If this is a member template declaration, let the front
24905 end know. */
24907 {
24912 }
24917 }
24918 /* We are done with the current parameter list. */
24923 /* Finish up. */
24926 /* Check the template arguments for a literal operator template. */
24930 {
24934 else
24935 {
24938 {
24944 }
24946 {
24954 }
24955 else
24957 }
24959 {
24962 " Expected non-type template argument pack <char...>"
24964 decl);
24965 else
24968 decl);
24969 }
24970 }
24972 /* Register member declarations. */
24975 /* If DECL is a function template, we must return to parse it later.
24976 (Even though there is no definition, there might be default
24977 arguments that need handling.) */
24981 }
24983 /* Parse a template introduction header for a template-declaration. Returns
24984 false if tentative parse fails. */
24986 static bool
24988 {
24995 /* Look for the optional `::' operator. */
24998 /* Look for the nested-name-specifier. */
25008 /* Look up the concept for which we will be matching
25009 template parameters. */
25019 /* Look for opening brace for introduction. */
25027 /* Build vector of placeholder parameters and grab
25028 matching identifiers. */
25031 /* The introduction-list shall not be empty. */
25034 {
25037 }
25039 /* Look for closing brace for introduction. */
25044 {
25048 }
25050 /* Build and associate the constraint. */
25053 {
25055 member_p);
25057 }
25061 }
25063 /* Parse a normal template-declaration following the template keyword. */
25065 static void
25067 {
25068 tree parameter_list;
25072 /* Look for the `<' token. */
25076 {
25077 /* 14.5.2.2 [temp.mem]
25079 A local class shall not have member templates. */
25084 }
25085 /* [temp]
25087 A template ... shall not have C linkage. */
25089 {
25091 /* Give it C++ linkage to avoid confusing other parts of the
25092 front end. */
25095 }
25096 else
25099 /* We cannot perform access checks on the template parameter
25100 declarations until we know what is being declared, just as we
25101 cannot check the decl-specifier list. */
25104 /* If the next token is `>', then we have an invalid
25105 specialization. Rather than complain about an invalid template
25106 parameter, issue an error message here. */
25108 {
25112 }
25113 else
25114 {
25115 /* Parse the template parameters. */
25117 }
25119 /* Look for the `>'. */
25122 /* Manage template requirements */
25124 {
25129 }
25132 member_p);
25134 /* For the erroneous case of a template with C linkage, we pushed an
25135 implicit C++ linkage scope; exit that scope now. */
25138 }
25140 /* Parse a template-declaration, assuming that the `export' (and
25141 `extern') keywords, if present, has already been scanned. MEMBER_P
25142 is as for cp_parser_template_declaration. */
25144 static bool
25146 {
25148 {
25152 }
25157 }
25159 /* Perform the deferred access checks from a template-parameter-list.
25160 CHECKS is a TREE_LIST of access checks, as returned by
25161 get_deferred_access_checks. */
25163 static void
25164 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
25165 {
25169 }
25171 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
25172 `function-definition' sequence that follows a template header.
25173 If MEMBER_P is true, this declaration appears in a class scope.
25175 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
25176 *FRIEND_P is set to TRUE iff the declaration is a friend. */
25178 static tree
25184 {
25187 cp_decl_specifier_seq decl_specifiers;
25191 /* This function is only used when processing a template
25192 declaration. */
25196 /* Defer access checks until we know what is being declared. */
25199 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
25200 alternative. */
25203 CP_PARSER_FLAGS_OPTIONAL,
25209 /* There are no template typedefs. */
25211 {
25215 }
25217 /* Gather up the access checks that occurred the
25218 decl-specifier-seq. */
25221 /* Check for the declaration of a template class. */
25223 {
25225 {
25226 // If this is a declaration, but not a definition, associate
25227 // any constraints with the type declaration. Constraints
25228 // are associated with definitions in cp_parser_class_specifier.
25234 /* In this case:
25236 struct C {
25237 friend template <typename T> struct A<T>::B;
25238 };
25240 A<T>::B will be represented by a TYPENAME_TYPE, and
25241 therefore not recognized by shadow_tag. */
25243 && !decl
25250 else
25253 /* Perform access checks for template parameters. */
25255 }
25256 }
25258 /* Complain about missing 'typename' or other invalid type names. */
25261 {
25262 /* cp_parser_parse_and_diagnose_invalid_type_name calls
25263 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
25264 the rest of this declaration. */
25267 }
25269 /* If it's not a template class, try for a template function. If
25270 the next token is a `;', then this declaration does not declare
25271 anything. But, if there were errors in the decl-specifiers, then
25272 the error might well have come from an attempted class-specifier.
25273 In that case, there's no need to warn about a missing declarator. */
25277 {
25280 checks,
25282 member_p,
25283 declares_class_or_enum,
25287 /* 7.1.1-1 [dcl.stc]
25289 A storage-class-specifier shall not be specified in an explicit
25290 specialization... */
25292 && explicit_specialization_p
25294 {
25298 }
25302 }
25304 /* Look for a trailing `;' after the declaration. */
25310 out:
25313 /* Clear any current qualification; whatever comes next is the start
25314 of something new. */
25320 }
25322 /* Parse a cast-expression that is not the operand of a unary "&". */
25324 static tree
25326 {
25329 }
25331 /* Parse a functional cast to TYPE. Returns an expression
25332 representing the cast. */
25334 static tree
25336 {
25338 tree expression_list;
25339 tree cast;
25346 {
25354 tf_warning_or_error);
25355 }
25364 else
25365 {
25368 }
25371 tf_warning_or_error);
25372 /* [expr.const]/1: In an integral constant expression "only type
25373 conversions to integral or enumeration type can be used". */
25379 NIC_CONSTRUCTOR))
25382 }
25384 /* Save the tokens that make up the body of a member function defined
25385 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
25386 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
25387 specifiers applied to the declaration. Returns the FUNCTION_DECL
25388 for the member function. */
25390 static tree
25394 tree attributes)
25395 {
25398 tree fn;
25400 /* Create the FUNCTION_DECL. */
25404 /* If something went badly wrong, bail out now. */
25406 {
25407 /* If there's a function-body, skip it. */
25412 }
25414 /* Remember it, if there default args to post process. */
25417 /* Save away the tokens that make up the body of the
25418 function. */
25420 /* Handle function try blocks. */
25423 /* We can have braced-init-list mem-initializers before the fn body. */
25425 {
25428 {
25429 /* cache_group will stop after an un-nested { } pair, too. */
25433 /* variadic mem-inits have ... after the ')'. */
25436 }
25437 }
25439 /* Handle function try blocks. */
25444 /* Save away the inline definition; we will process it when the
25445 class is complete. */
25449 /* We need to know that this was defined in the class, so that
25450 friend templates are handled correctly. */
25453 /* Add FN to the queue of functions to be parsed later. */
25457 }
25459 /* Save the tokens that make up the in-class initializer for a non-static
25460 data member. Returns a DEFAULT_ARG. */
25462 static tree
25464 {
25466 }
25468 /* Parse a template-argument-list, as well as the trailing ">" (but
25469 not the opening "<"). See cp_parser_template_argument_list for the
25470 return value. */
25472 static tree
25474 {
25475 tree arguments;
25476 tree saved_scope;
25477 tree saved_qualifying_scope;
25478 tree saved_object_scope;
25483 /* [temp.names]
25485 When parsing a template-id, the first non-nested `>' is taken as
25486 the end of the template-argument-list rather than a greater-than
25487 operator. */
25488 saved_greater_than_is_operator_p
25491 /* Parsing the argument list may modify SCOPE, so we save it
25492 here. */
25496 /* We need to evaluate the template arguments, even though this
25497 template-id may be nested within a "sizeof". */
25502 /* Parse the template-argument-list itself. */
25506 else
25508 /* Look for the `>' that ends the template-argument-list. If we find
25509 a '>>' instead, it's probably just a typo. */
25511 {
25513 {
25514 /* In C++0x, a `>>' in a template argument list or cast
25515 expression is considered to be two separate `>'
25516 tokens. So, change the current token to a `>', but don't
25517 consume it: it will be consumed later when the outer
25518 template argument list (or cast expression) is parsed.
25519 Note that this replacement of `>' for `>>' is necessary
25520 even if we are parsing tentatively: in the tentative
25521 case, after calling
25522 cp_parser_enclosed_template_argument_list we will always
25523 throw away all of the template arguments and the first
25524 closing `>', either because the template argument list
25525 was erroneous or because we are replacing those tokens
25526 with a CPP_TEMPLATE_ID token. The second `>' (which will
25527 not have been thrown away) is needed either to close an
25528 outer template argument list or to complete a new-style
25529 cast. */
25532 }
25534 {
25535 /* If we're in a nested template argument list, the '>>' has
25536 to be a typo for '> >'. We emit the error message, but we
25537 continue parsing and we push a '>' as next token, so that
25538 the argument list will be parsed correctly. Note that the
25539 global source location is still on the token before the
25540 '>>', so we need to say explicitly where we want it. */
25546 }
25547 else
25548 {
25549 /* If this is not a nested template argument list, the '>>'
25550 is a typo for '>'. Emit an error message and continue.
25551 Same deal about the token location, but here we can get it
25552 right by consuming the '>>' before issuing the diagnostic. */
25555 "spurious %<>>%>, use %<>%> to terminate "
25557 }
25558 }
25559 else
25561 /* The `>' token might be a greater-than operator again now. */
25562 parser->greater_than_is_operator_p
25564 /* Restore the SAVED_SCOPE. */
25572 }
25574 /* MEMBER_FUNCTION is a member function, or a friend. If default
25575 arguments, or the body of the function have not yet been parsed,
25576 parse them now. */
25578 static void
25580 {
25582 /* If this member is a template, get the underlying
25583 FUNCTION_DECL. */
25587 /* There should not be any class definitions in progress at this
25588 point; the bodies of members are only parsed outside of all class
25589 definitions. */
25591 /* While we're parsing the member functions we might encounter more
25592 classes. We want to handle them right away, but we don't want
25593 them getting mixed up with functions that are currently in the
25594 queue. */
25597 /* Make sure that any template parameters are in scope. */
25600 /* If the body of the function has not yet been parsed, parse it
25601 now. */
25603 {
25604 tree function_scope;
25607 /* The function is no longer pending; we are processing it. */
25612 /* If this is a local class, enter the scope of the containing
25613 function. */
25618 /* Push the body of the function onto the lexer stack. */
25621 /* Let the front end know that we going to be defining this
25622 function. */
25626 /* Don't do access checking if it is a templated function. */
25630 /* #pragma omp declare reduction needs special parsing. */
25632 {
25637 }
25638 else
25639 /* Now, parse the body of the function. */
25646 /* Leave the scope of the containing function. */
25650 }
25652 /* Remove any template parameters from the symbol table. */
25655 /* Restore the queue. */
25658 }
25660 /* If DECL contains any default args, remember it on the unparsed
25661 functions queue. */
25663 static void
25665 {
25666 tree probe;
25669 probe;
25672 {
25676 }
25677 }
25679 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
25680 which is either a FIELD_DECL or PARM_DECL. Parse it and return
25681 the result. For a PARM_DECL, PARMTYPE is the corresponding type
25682 from the parameter-type-list. */
25684 static tree
25687 {
25689 tree parsed_arg;
25695 /* Push the saved tokens for the default argument onto the parser's
25696 lexer stack. */
25702 /* Parse the default argument. */
25713 {
25714 /* In a non-template class, check conversions now. In a template,
25715 we'll wait and instantiate these as needed. */
25718 tf_warning_or_error);
25719 else
25721 }
25723 /* If the token stream has not been completely used up, then
25724 there was extra junk after the end of the default
25725 argument. */
25727 {
25730 else
25732 }
25734 /* Revert to the main lexer. */
25738 }
25740 /* FIELD is a non-static data member with an initializer which we saved for
25741 later; parse it now. */
25743 static void
25745 {
25746 tree def;
25753 NULL_TREE);
25759 }
25761 /* FN is a FUNCTION_DECL which may contains a parameter with an
25762 unparsed DEFAULT_ARG. Parse the default args now. This function
25763 assumes that the current scope is the scope in which the default
25764 argument should be processed. */
25766 static void
25768 {
25772 /* While we're parsing the default args, we might (due to the
25773 statement expression extension) encounter more classes. We want
25774 to handle them right away, but we don't want them getting mixed
25775 up with default args that are currently in the queue. */
25778 /* Local variable names (and the `this' keyword) may not appear
25779 in a default argument. */
25790 {
25792 tree parsed_arg;
25794 tree copy;
25801 /* This can happen for a friend declaration for a function
25802 already declared with default arguments. */
25805 parsed_arg
25807 default_arg,
25810 {
25812 }
25816 /* Update any instantiations we've already created. */
25820 }
25824 /* Make sure no default arg is missing. */
25827 /* Restore the state of local_variables_forbidden_p. */
25830 /* Restore the queue. */
25832 }
25834 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
25836 sizeof ... ( identifier )
25838 where the 'sizeof' token has already been consumed. */
25840 static tree
25842 {
25843 /* Consume the `...'. */
25850 else
25858 /* The name is not qualified. */
25877 }
25879 /* Parse the operand of `sizeof' (or a similar operator). Returns
25880 either a TYPE or an expression, depending on the form of the
25881 input. The KEYWORD indicates which kind of expression we have
25882 encountered. */
25884 static tree
25886 {
25893 /* If it's a `...', then we are computing the length of a parameter
25894 pack. */
25899 /* Types cannot be defined in a `sizeof' expression. Save away the
25900 old message. */
25902 /* And create the new one. */
25908 /* The restrictions on constant-expressions do not apply inside
25909 sizeof expressions. */
25910 saved_integral_constant_expression_p
25912 saved_non_integral_constant_expression_p
25916 /* Do not actually evaluate the expression. */
25919 /* If it's a `(', then we might be looking at the type-id
25920 construction. */
25922 {
25925 /* We can't be sure yet whether we're looking at a type-id or an
25926 expression. */
25928 /* Note: as a GNU Extension, compound literals are considered
25929 postfix-expressions as they are in C99, so they are valid
25930 arguments to sizeof. See comment in cp_parser_cast_expression
25931 for details. */
25934 else
25935 {
25938 /* Look for the type-id. */
25940 /* Look for the closing `)'. */
25943 }
25945 /* If all went well, then we're done. */
25947 {
25948 cp_decl_specifier_seq decl_specs;
25950 /* Build a trivial decl-specifier-seq. */
25954 /* Call grokdeclarator to figure out what type this is. */
25957 TYPENAME,
25960 }
25961 }
25963 /* If the type-id production did not work out, then we must be
25964 looking at the unary-expression production. */
25968 /* Go back to evaluating expressions. */
25972 /* Free the message we created. */
25974 /* And restore the old one. */
25976 parser->integral_constant_expression_p
25978 parser->non_integral_constant_expression_p
25982 }
25984 /* If the current declaration has no declarator, return true. */
25986 static bool
25988 {
25989 /* If the next token is a `;' or a `,' then there is no
25990 declarator. */
25993 }
25995 /* Update the DECL_SPECS to reflect the storage class indicated by
25996 KEYWORD. */
25998 static void
26003 {
26004 cp_storage_class storage_class;
26007 {
26011 }
26013 {
26016 }
26021 {
26024 }
26027 {
26045 }
26049 /* A storage class specifier cannot be applied alongside a typedef
26050 specifier. If there is a typedef specifier present then set
26051 conflicting_specifiers_p which will trigger an error later
26052 on in grokdeclarator. */
26055 }
26057 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
26058 is true, the type is a class or enum definition. */
26060 static void
26062 tree type_spec,
26065 {
26068 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
26069 (with, for example, in "typedef int wchar_t;") we remember that
26070 this is what happened. In system headers, we ignore these
26071 declarations so that G++ can work with system headers that are not
26072 C++-safe. */
26074 && !type_definition_p
26084 {
26087 ds_redefined_builtin_type_spec,
26088 token);
26090 {
26094 }
26095 }
26098 else
26099 {
26104 }
26105 }
26107 /* True iff TOKEN is the GNU keyword __thread. */
26109 static bool
26111 {
26114 }
26116 /* Set the location for a declarator specifier and check if it is
26117 duplicated.
26119 DECL_SPECS is the sequence of declarator specifiers onto which to
26120 set the location.
26122 DS is the single declarator specifier to set which location is to
26123 be set onto the existing sequence of declarators.
26125 LOCATION is the location for the declarator specifier to
26126 consider. */
26128 static void
26131 {
26140 {
26144 }
26145 else
26146 {
26148 {
26152 else
26153 {
26156 OPT_Wlong_long,
26158 }
26159 }
26161 {
26166 else
26168 }
26169 else
26170 {
26186 "__complex"
26187 };
26190 }
26191 }
26192 }
26194 /* Return true iff the declarator specifier DS is present in the
26195 sequence of declarator specifiers DECL_SPECS. */
26197 bool
26199 cp_decl_spec ds)
26200 {
26207 }
26209 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
26210 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
26212 static bool
26214 {
26216 }
26218 /* Issue an error message indicating that TOKEN_DESC was expected.
26219 If KEYWORD is true, it indicated this function is called by
26220 cp_parser_require_keword and the required token can only be
26221 a indicated keyword. */
26223 static void
26225 required_token token_desc,
26227 {
26229 {
26298 }
26300 {
26302 {
26381 }
26382 }
26383 else
26385 }
26389 /* If the next token is of the indicated TYPE, consume it. Otherwise,
26390 issue an error message indicating that TOKEN_DESC was expected.
26392 Returns the token consumed, if the token had the appropriate type.
26393 Otherwise, returns NULL. */
26398 required_token token_desc)
26399 {
26402 else
26403 {
26404 /* Output the MESSAGE -- unless we're parsing tentatively. */
26408 }
26409 }
26411 /* An error message is produced if the next token is not '>'.
26412 All further tokens are skipped until the desired token is
26413 found or '{', '}', ';' or an unbalanced ')' or ']'. */
26415 static void
26417 {
26418 /* Current level of '< ... >'. */
26420 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
26423 /* Are we ready, yet? If not, issue error message. */
26427 /* Skip tokens until the desired token is found. */
26429 {
26430 /* Peek at the next token. */
26432 {
26440 /* C++0x views the `>>' operator as two `>' tokens, but
26441 C++98 does not. */
26444 {
26445 /* We've hit a `>>' where the first `>' closes the
26446 template argument list, and the second `>' is
26447 spurious. Just consume the `>>' and stop; we've
26448 already produced at least one error. */
26451 }
26452 /* Fall through for C++0x, so we handle the second `>' in
26453 the `>>'. */
26457 {
26458 /* We've reached the token we want, consume it and stop. */
26461 }
26480 /* The '>' was probably forgotten, don't look further. */
26485 }
26487 /* Consume this token. */
26489 }
26490 }
26492 /* If the next token is the indicated keyword, consume it. Otherwise,
26493 issue an error message indicating that TOKEN_DESC was expected.
26495 Returns the token consumed, if the token had the appropriate type.
26496 Otherwise, returns NULL. */
26501 required_token token_desc)
26502 {
26506 {
26509 }
26512 }
26514 /* Returns TRUE iff TOKEN is a token that can begin the body of a
26515 function-definition. */
26517 static bool
26519 {
26522 /* A ctor-initializer begins with a `:'. */
26524 /* A function-try-block begins with `try'. */
26526 /* A function-transaction-block begins with `__transaction_atomic'
26527 or `__transaction_relaxed'. */
26530 /* The named return value extension begins with `return'. */
26532 }
26534 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
26535 definition. */
26537 static bool
26539 {
26546 }
26548 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
26549 C++0x) ending a template-argument. */
26551 static bool
26553 {
26561 }
26563 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
26564 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
26566 static bool
26569 {
26575 /* Check for the sequence `<::' in the original code. It would be lexed as
26576 `[:', where `[' is a digraph, and there is no whitespace before
26577 `:'. */
26579 {
26584 }
26586 }
26588 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
26589 or none_type otherwise. */
26591 static enum tag_types
26593 {
26595 {
26605 }
26606 }
26608 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
26609 or none_type otherwise or if the token is null. */
26611 static enum tag_types
26613 {
26618 {
26626 }
26627 }
26629 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
26631 static void
26633 {
26637 {
26641 type))
26644 }
26645 }
26647 /* Issue an error message if DECL is redeclared with different
26648 access than its original declaration [class.access.spec/3].
26649 This applies to nested classes and nested class templates.
26650 [class.mem/1]. */
26652 static void
26654 {
26663 }
26665 /* Look for the `template' keyword, as a syntactic disambiguator.
26666 Return TRUE iff it is present, in which case it will be
26667 consumed. */
26669 static bool
26671 {
26673 {
26674 /* In C++98 the `template' keyword can only be used within templates;
26675 outside templates the parser can always figure out what is a
26676 template and what is not. In C++11, per the resolution of DR 468,
26677 `template' is allowed in cases where it is not strictly necessary. */
26680 {
26683 "in C++98 %<template%> (as a disambiguator) is only "
26685 /* If this part of the token stream is rescanned, the same
26686 error message would be generated. So, we purge the token
26687 from the stream. */
26690 }
26691 else
26692 {
26693 /* Consume the `template' keyword. */
26696 }
26697 }
26699 }
26701 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
26702 set PARSER->SCOPE, and perform other related actions. */
26704 static void
26706 {
26712 /* Get the stored value. */
26714 /* Perform any access checks that were deferred. */
26717 {
26722 }
26723 /* Set the scope from the stored value. */
26727 }
26729 /* Consume tokens up through a non-nested END token. Returns TRUE if we
26730 encounter the end of a block before what we were looking for. */
26732 static bool
26736 {
26738 {
26741 /* Abort a parenthesized expression if we encounter a semicolon. */
26745 /* If we've reached the end of the file, stop. */
26751 /* We've hit the end of an enclosing block, so there's been some
26752 kind of syntax error. */
26755 /* Consume the token. */
26757 /* See if it starts a new group. */
26759 {
26761 /* In theory this should probably check end == '}', but
26762 cp_parser_save_member_function_body needs it to exit
26763 after either '}' or ')' when called with ')'. */
26766 }
26768 {
26772 }
26777 }
26778 }
26780 /* Like above, for caching a default argument or NSDMI. Both of these are
26781 terminated by a non-nested comma, but it can be unclear whether or not a
26782 comma is nested in a template argument list unless we do more parsing.
26783 In order to handle this ambiguity, when we encounter a ',' after a '<'
26784 we try to parse what follows as a parameter-declaration-list (in the
26785 case of a default argument) or a member-declarator (in the case of an
26786 NSDMI). If that succeeds, then we stop caching. */
26788 static tree
26790 {
26795 tree default_argument;
26797 /* Add tokens until we have processed the entire default
26798 argument. We add the range [first_token, token). */
26801 {
26802 /* For list-initialization, this is straightforward. */
26805 }
26807 {
26810 /* Peek at the next token. */
26812 /* What we do depends on what token we have. */
26814 {
26815 /* In valid code, a default argument must be
26816 immediately followed by a `,' `)', or `...'. */
26819 {
26820 /* If we've seen a '<', we might be in a
26821 template-argument-list. Until Core issue 325 is
26822 resolved, we don't know how this situation ought
26823 to be handled, so try to DTRT. We check whether
26824 what comes after the comma is a valid parameter
26825 declaration list. If it is, then the comma ends
26826 the default argument; otherwise the default
26827 argument continues. */
26831 /* Set ITALP so cp_parser_parameter_declaration_list
26832 doesn't decide to commit to this parse. */
26839 {
26840 /* Parse declarators until we reach a non-comma or
26841 somthing that cannot be an initializer.
26842 Just checking whether we're looking at a single
26843 declarator is insufficient. Consider:
26844 int var = tuple<T,U>::x;
26845 The template parameter 'U' looks exactly like a
26846 declarator. */
26847 do
26848 {
26859 }
26861 /* If we met an '=' or ';' then the original comma
26862 was the end of the NSDMI. Otherwise assume
26863 we're still in the NSDMI. */
26866 }
26867 else
26868 {
26873 }
26880 }
26883 /* If we run into a non-nested `;', `}', or `]',
26884 then the code is invalid -- but the default
26885 argument is certainly over. */
26890 /* Handle correctly int n = sizeof ... ( p ); */
26893 /* Update DEPTH, if necessary. */
26908 /* This might be the comparison operator, or it might
26909 start a template argument list. */
26916 /* Fall through for C++0x, which treats the `>>'
26917 operator like two `>' tokens in certain
26918 cases. */
26922 {
26923 /* This might be an operator, or it might close a
26924 template argument list. But if a previous '<'
26925 started a template argument list, this will have
26926 closed it, so we can't be in one anymore. */
26930 }
26933 /* If we run out of tokens, issue an error message. */
26942 /* In these cases, we should look for template-ids.
26943 For example, if the default argument is
26944 `X<int, double>()', we need to do name lookup to
26945 figure out whether or not `X' is a template; if
26946 so, the `,' does not end the default argument.
26948 That is not yet done. */
26953 }
26955 /* If we've reached the end, stop. */
26959 /* Add the token to the token block. */
26961 }
26963 /* Create a DEFAULT_ARG to represent the unparsed default
26964 argument. */
26971 }
26973 /* Begin parsing tentatively. We always save tokens while parsing
26974 tentatively so that if the tentative parsing fails we can restore the
26975 tokens. */
26977 static void
26979 {
26980 /* Enter a new parsing context. */
26982 /* Begin saving tokens. */
26984 /* In order to avoid repetitive access control error messages,
26985 access checks are queued up until we are no longer parsing
26986 tentatively. */
26988 }
26990 /* Commit to the currently active tentative parse. */
26992 static void
26994 {
26998 /* Mark all of the levels as committed. */
27001 {
27008 }
27009 }
27011 /* Commit to the topmost currently active tentative parse.
27013 Note that this function shouldn't be called when there are
27014 irreversible side-effects while in a tentative state. For
27015 example, we shouldn't create a permanent entry in the symbol
27016 table, or issue an error message that might not apply if the
27017 tentative parse is aborted. */
27019 static void
27021 {
27026 {
27034 }
27035 }
27037 /* Abort the currently active tentative parse. All consumed tokens
27038 will be rolled back, and no diagnostics will be issued. */
27040 static void
27042 {
27046 /* Now, pretend that we want to see if the construct was
27047 successfully parsed. */
27049 }
27051 /* Stop parsing tentatively. If a parse error has occurred, restore the
27052 token stream. Otherwise, commit to the tokens we have consumed.
27053 Returns true if no error occurred; false otherwise. */
27055 static bool
27057 {
27061 /* Remember whether or not an error occurred, since we are about to
27062 destroy that information. */
27064 /* Remove the topmost context from the stack. */
27067 /* If no parse errors occurred, commit to the tentative parse. */
27069 {
27070 /* Commit to the tokens read tentatively, unless that was
27071 already done. */
27076 }
27077 /* Otherwise, if errors occurred, roll back our state so that things
27078 are just as they were before we began the tentative parse. */
27079 else
27080 {
27083 }
27084 /* Add the context to the front of the free list. */
27089 }
27091 /* Returns true if we are parsing tentatively and are not committed to
27092 this tentative parse. */
27094 static bool
27096 {
27099 }
27101 /* Returns nonzero iff an error has occurred during the most recent
27102 tentative parse. */
27104 static bool
27106 {
27109 }
27111 /* Returns nonzero if GNU extensions are allowed. */
27113 static bool
27115 {
27117 }
27118 \f
27119 /* Objective-C++ Productions */
27122 /* Parse an Objective-C expression, which feeds into a primary-expression
27123 above.
27125 objc-expression:
27126 objc-message-expression
27127 objc-string-literal
27128 objc-encode-expression
27129 objc-protocol-expression
27130 objc-selector-expression
27132 Returns a tree representation of the expression. */
27134 static tree
27136 {
27137 /* Try to figure out what kind of declaration is present. */
27141 {
27151 {
27163 }
27169 }
27172 }
27174 /* Parse an Objective-C message expression.
27176 objc-message-expression:
27177 [ objc-message-receiver objc-message-args ]
27179 Returns a representation of an Objective-C message. */
27181 static tree
27183 {
27192 }
27194 /* Parse an objc-message-receiver.
27196 objc-message-receiver:
27197 expression
27198 simple-type-specifier
27200 Returns a representation of the type or expression. */
27202 static tree
27204 {
27205 tree rcv;
27207 /* An Objective-C message receiver may be either (1) a type
27208 or (2) an expression. */
27212 /* If that worked out, fine. */
27219 CP_PARSER_FLAGS_NONE);
27226 }
27228 /* Parse the arguments and selectors comprising an Objective-C message.
27230 objc-message-args:
27231 objc-selector
27232 objc-selector-args
27233 objc-selector-args , objc-comma-args
27235 objc-selector-args:
27236 objc-selector [opt] : assignment-expression
27237 objc-selector-args objc-selector [opt] : assignment-expression
27239 objc-comma-args:
27240 assignment-expression
27241 objc-comma-args , assignment-expression
27243 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
27244 selector arguments and TREE_VALUE containing a list of comma
27245 arguments. */
27247 static tree
27249 {
27255 {
27261 /* Detect if we have a unary selector. */
27270 sel_args
27275 }
27277 /* Handle non-selector arguments, if any. */
27279 {
27280 tree arg;
27285 addl_args
27290 }
27293 {
27296 }
27299 }
27301 /* Parse an Objective-C encode expression.
27303 objc-encode-expression:
27304 @encode objc-typename
27306 Returns an encoded representation of the type argument. */
27308 static tree
27310 {
27311 tree type;
27321 {
27325 }
27327 /* This happens if we find @encode(T) (where T is a template
27328 typename or something dependent on a template typename) when
27329 parsing a template. In that case, we can't compile it
27330 immediately, but we rather create an AT_ENCODE_EXPR which will
27331 need to be instantiated when the template is used.
27332 */
27334 {
27338 }
27341 }
27343 /* Parse an Objective-C @defs expression. */
27345 static tree
27347 {
27348 tree name;
27356 }
27358 /* Parse an Objective-C protocol expression.
27360 objc-protocol-expression:
27361 @protocol ( identifier )
27363 Returns a representation of the protocol expression. */
27365 static tree
27367 {
27368 tree proto;
27376 }
27378 /* Parse an Objective-C selector expression.
27380 objc-selector-expression:
27381 @selector ( objc-method-signature )
27383 objc-method-signature:
27384 objc-selector
27385 objc-selector-seq
27387 objc-selector-seq:
27388 objc-selector :
27389 objc-selector-seq objc-selector :
27391 Returns a representation of the method selector. */
27393 static tree
27395 {
27407 {
27416 {
27417 /* Detect if we have a unary selector. */
27419 {
27422 }
27423 else
27424 {
27426 }
27427 }
27432 {
27433 sel_seq
27436 sel_seq
27439 }
27440 else
27441 sel_seq
27446 }
27448 finish_selector:
27452 }
27454 /* Parse a list of identifiers.
27456 objc-identifier-list:
27457 identifier
27458 objc-identifier-list , identifier
27460 Returns a TREE_LIST of identifier nodes. */
27462 static tree
27464 {
27465 tree identifier;
27466 tree list;
27477 {
27484 identifier));
27486 }
27489 }
27491 /* Parse an Objective-C alias declaration.
27493 objc-alias-declaration:
27494 @compatibility_alias identifier identifier ;
27496 This function registers the alias mapping with the Objective-C front end.
27497 It returns nothing. */
27499 static void
27501 {
27509 }
27511 /* Parse an Objective-C class forward-declaration.
27513 objc-class-declaration:
27514 @class objc-identifier-list ;
27516 The function registers the forward declarations with the Objective-C
27517 front end. It returns nothing. */
27519 static void
27521 {
27524 {
27525 tree id;
27535 else
27537 }
27539 }
27541 /* Parse a list of Objective-C protocol references.
27543 objc-protocol-refs-opt:
27544 objc-protocol-refs [opt]
27546 objc-protocol-refs:
27547 < objc-identifier-list >
27549 Returns a TREE_LIST of identifiers, if any. */
27551 static tree
27553 {
27557 {
27561 }
27564 }
27566 /* Parse a Objective-C visibility specification. */
27568 static void
27570 {
27574 {
27589 }
27591 /* Eat '@private'/'@protected'/'@public'. */
27593 }
27595 /* Parse an Objective-C method type. Return 'true' if it is a class
27596 (+) method, and 'false' if it is an instance (-) method. */
27600 {
27603 else
27605 }
27607 /* Parse an Objective-C protocol qualifier. */
27609 static tree
27611 {
27624 {
27629 }
27632 }
27634 /* Parse an Objective-C typename. */
27636 static tree
27638 {
27642 {
27648 /* An ObjC type name may consist of just protocol qualifiers, in which
27649 case the type shall default to 'id'. */
27651 {
27654 /* If the type could not be parsed, an error has already
27655 been produced. For error recovery, behave as if it had
27656 not been specified, which will use the default type
27657 'id'. */
27659 {
27661 /* We need to skip to the closing parenthesis as
27662 cp_parser_type_id() does not seem to do it for
27663 us. */
27668 }
27669 }
27673 }
27676 }
27678 /* Check to see if TYPE refers to an Objective-C selector name. */
27680 static bool
27682 {
27688 }
27690 /* Parse an Objective-C selector. */
27692 static tree
27694 {
27698 {
27701 }
27703 /* C++ operator names are allowed to appear in ObjC selectors. */
27705 {
27718 }
27719 }
27721 /* Parse an Objective-C params list. */
27723 static tree
27725 {
27731 {
27741 /* Detect if we have a unary selector. */
27744 {
27747 }
27751 {
27752 /* Something went quite wrong. There should be a colon
27753 here, but there is not. Stop parsing parameters. */
27755 }
27757 /* New ObjC allows attributes on parameters too. */
27762 params
27765 type_name,
27766 identifier,
27767 parm_attr));
27770 }
27773 {
27776 }
27778 /* We allow tail attributes for the method. */
27780 {
27788 }
27791 {
27794 }
27796 }
27798 /* Parse the non-keyword Objective-C params. */
27800 static tree
27803 {
27809 {
27811 tree parm;
27817 {
27822 }
27824 /* TODO: parse attributes for tail parameters. */
27833 }
27835 /* We allow tail attributes for the method. */
27837 {
27839 {
27844 }
27845 else
27846 /* We have an error, but parse the attributes, so that we can
27847 carry on. */
27853 }
27856 }
27858 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
27860 static void
27862 {
27865 /* If the next token is `extern' and the following token is a string
27866 literal, then we have a linkage specification. */
27868 && cp_parser_is_pure_string_literal
27871 /* Handle #pragma, if any. */
27874 /* Allow stray semicolons. */
27877 /* Mark methods as optional or required, when building protocols. */
27879 {
27882 }
27884 {
27887 }
27890 /* Other stray characters must generate errors. */
27892 {
27896 }
27897 /* Finally, try to parse a block-declaration, or a function-definition. */
27898 else
27900 }
27902 /* Parse a method signature. */
27904 static tree
27906 {
27922 }
27924 static bool
27926 {
27927 tree tattr;
27932 /* If the attributes are followed by a method introducer, this is not allowed.
27933 Dump the attributes and flag the situation. */
27938 /* Otherwise, the attributes introduce some interstitial code, possibly so
27939 rewind to allow that check. */
27942 }
27944 /* Parse an Objective-C method prototype list. */
27946 static void
27948 {
27952 {
27954 {
27959 else
27963 {
27967 }
27970 }
27976 OPT_Wattributes,
27978 else
27979 /* Allow for interspersed non-ObjC++ code. */
27983 }
27987 else
27991 }
27993 /* Parse an Objective-C method definition list. */
27995 static void
27997 {
28001 {
28002 tree meth;
28005 {
28011 else
28016 {
28020 }
28022 NULL_TREE);
28024 /* For historical reasons, we accept an optional semicolon. */
28031 {
28038 }
28039 }
28040 /* The following case will be removed once @synthesize is
28041 completely implemented. */
28052 else
28053 /* Allow for interspersed non-ObjC++ code. */
28057 }
28061 else
28065 }
28067 /* Parse Objective-C ivars. */
28069 static void
28071 {
28082 {
28083 cp_decl_specifier_seq declspecs;
28085 tree prefix_attributes;
28093 CP_PARSER_FLAGS_OPTIONAL,
28097 /* auto, register, static, extern, mutable. */
28099 {
28102 }
28104 /* thread_local. */
28106 {
28109 }
28111 /* typedef. */
28113 {
28116 }
28121 /* Keep going until we hit the `;' at the end of the
28122 declaration. */
28124 {
28129 /* Check for a (possibly unnamed) bitfield declaration. */
28137 {
28138 /* Get the name of the bitfield. */
28141 sfk_none);
28143 eat_colon:
28145 /* Get the width of the bitfield. */
28146 width
28148 }
28149 else
28150 {
28151 /* Parse the declarator. */
28152 declarator
28158 }
28160 /* Look for attributes that apply to the ivar. */
28162 /* Remember which attributes are prefix attributes and
28163 which are not. */
28165 /* Combine the attributes. */
28169 /* Create the bitfield declaration. */
28171 width,
28172 attributes);
28173 else
28178 /* Add the instance variable. */
28182 /* Reset PREFIX_ATTRIBUTES. */
28191 {
28194 }
28196 }
28200 }
28205 /* Do not consume the RID_AT_END, so it will be read again as terminating
28206 the @interface of @implementation. */
28210 /* For historical reasons, we accept an optional semicolon. */
28213 }
28215 /* Parse an Objective-C protocol declaration. */
28217 static void
28219 {
28225 {
28230 }
28232 /* See if we have a forward declaration or a definition. */
28235 /* Try a forward declaration first. */
28237 {
28239 {
28240 tree id;
28250 else
28252 }
28254 }
28256 /* Ok, we got a full-fledged definition (or at least should). */
28257 else
28258 {
28263 }
28264 }
28266 /* Parse an Objective-C superclass or category. */
28268 static void
28273 {
28279 {
28282 }
28284 {
28287 /* If there is no category name, and this is an @interface, we
28288 have a class extension. */
28290 {
28293 }
28294 else
28298 }
28299 }
28301 /* Parse an Objective-C class interface. */
28303 static void
28305 {
28312 {
28313 /* It's hard to recover because even if valid @interface stuff
28314 is to follow, we can't compile it (or validate it) if we
28315 don't even know which class it refers to. Let's assume this
28316 was a stray '@interface' token in the stream and skip it.
28317 */
28319 }
28324 /* We have either a class or a category on our hands. */
28327 else
28328 {
28330 /* Handle instance variable declarations, if any. */
28333 }
28336 }
28338 /* Parse an Objective-C class implementation. */
28340 static void
28342 {
28349 {
28350 /* It's hard to recover because even if valid @implementation
28351 stuff is to follow, we can't compile it (or validate it) if
28352 we don't even know which class it refers to. Let's assume
28353 this was a stray '@implementation' token in the stream and
28354 skip it.
28355 */
28357 }
28361 /* We have either a class or a category on our hands. */
28364 else
28365 {
28367 /* Handle instance variable declarations, if any. */
28370 }
28373 }
28375 /* Consume the @end token and finish off the implementation. */
28377 static void
28379 {
28382 }
28384 /* Parse an Objective-C declaration. */
28386 static void
28388 {
28389 /* Try to figure out what kind of declaration is present. */
28394 {
28410 }
28413 {
28436 }
28437 }
28439 /* Parse an Objective-C try-catch-finally statement.
28441 objc-try-catch-finally-stmt:
28442 @try compound-statement objc-catch-clause-seq [opt]
28443 objc-finally-clause [opt]
28445 objc-catch-clause-seq:
28446 objc-catch-clause objc-catch-clause-seq [opt]
28448 objc-catch-clause:
28449 @catch ( objc-exception-declaration ) compound-statement
28451 objc-finally-clause:
28452 @finally compound-statement
28454 objc-exception-declaration:
28455 parameter-declaration
28456 '...'
28458 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
28460 Returns NULL_TREE.
28462 PS: This function is identical to c_parser_objc_try_catch_finally_statement
28463 for C. Keep them in sync. */
28465 static tree
28467 {
28468 location_t location;
28469 tree stmt;
28474 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
28475 node, lest it get absorbed into the surrounding block. */
28481 {
28490 {
28491 /* We have "@catch (...)" (where the '...' are literally
28492 what is in the code). Skip the '...'.
28493 parameter_declaration is set to NULL_TREE, and
28494 objc_being_catch_clauses() knows that that means
28495 '...'. */
28498 }
28499 else
28500 {
28501 /* We have "@catch (NSException *exception)" or something
28502 like that. Parse the parameter declaration. */
28506 else
28511 }
28514 else
28515 {
28516 /* If there was no open parenthesis, we are recovering from
28517 an error, and we are trying to figure out what mistake
28518 the user has made. */
28520 /* If there is an immediate closing parenthesis, the user
28521 probably forgot the opening one (ie, they typed "@catch
28522 NSException *e)". Parse the closing parenthesis and keep
28523 going. */
28527 /* If these is no immediate closing parenthesis, the user
28528 probably doesn't know that parenthesis are required at
28529 all (ie, they typed "@catch NSException *e"). So, just
28530 forget about the closing parenthesis and keep going. */
28531 }
28535 }
28537 {
28540 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
28541 node, lest it get absorbed into the surrounding block. */
28545 }
28548 }
28550 /* Parse an Objective-C synchronized statement.
28552 objc-synchronized-stmt:
28553 @synchronized ( expression ) compound-statement
28555 Returns NULL_TREE. */
28557 static tree
28559 {
28560 location_t location;
28571 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
28572 node, lest it get absorbed into the surrounding block. */
28577 }
28579 /* Parse an Objective-C throw statement.
28581 objc-throw-stmt:
28582 @throw assignment-expression [opt] ;
28584 Returns a constructed '@throw' statement. */
28586 static tree
28588 {
28600 }
28602 /* Parse an Objective-C statement. */
28604 static tree
28606 {
28607 /* Try to figure out what kind of declaration is present. */
28611 {
28622 }
28625 }
28627 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
28628 look ahead to see if an objc keyword follows the attributes. This
28629 is to detect the use of prefix attributes on ObjC @interface and
28630 @protocol. */
28632 static bool
28634 {
28639 {
28642 }
28645 }
28647 /* This routine is a minimal replacement for
28648 c_parser_struct_declaration () used when parsing the list of
28649 types/names or ObjC++ properties. For example, when parsing the
28650 code
28652 @property (readonly) int a, b, c;
28654 this function is responsible for parsing "int a, int b, int c" and
28655 returning the declarations as CHAIN of DECLs.
28657 TODO: Share this code with cp_parser_objc_class_ivars. It's very
28658 similar parsing. */
28659 static tree
28661 {
28663 cp_decl_specifier_seq declspecs;
28665 tree prefix_attributes;
28668 CP_PARSER_FLAGS_NONE,
28675 /* auto, register, static, extern, mutable. */
28677 {
28680 }
28682 /* thread_local. */
28684 {
28687 }
28689 /* typedef. */
28691 {
28694 }
28699 /* Keep going until we hit the `;' at the end of the declaration. */
28701 {
28706 /* Parse the declarator. */
28710 /* Look for attributes that apply to the ivar. */
28712 /* Remember which attributes are prefix attributes and
28713 which are not. */
28715 /* Combine the attributes. */
28725 /* Reset PREFIX_ATTRIBUTES. */
28736 {
28739 }
28740 else
28742 }
28744 }
28746 /* Parse an Objective-C @property declaration. The syntax is:
28748 objc-property-declaration:
28749 '@property' objc-property-attributes[opt] struct-declaration ;
28751 objc-property-attributes:
28752 '(' objc-property-attribute-list ')'
28754 objc-property-attribute-list:
28755 objc-property-attribute
28756 objc-property-attribute-list, objc-property-attribute
28758 objc-property-attribute
28759 'getter' = identifier
28760 'setter' = identifier
28761 'readonly'
28762 'readwrite'
28763 'assign'
28764 'retain'
28765 'copy'
28766 'nonatomic'
28768 For example:
28769 @property NSString *name;
28770 @property (readonly) id object;
28771 @property (retain, nonatomic, getter=getTheName) id name;
28772 @property int a, b, c;
28774 PS: This function is identical to
28775 c_parser_objc_at_property_declaration for C. Keep them in sync. */
28776 static void
28778 {
28779 /* The following variables hold the attributes of the properties as
28780 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
28781 seen. When we see an attribute, we set them to 'true' (if they
28782 are boolean properties) or to the identifier (if they have an
28783 argument, ie, for getter and setter). Note that here we only
28784 parse the list of attributes, check the syntax and accumulate the
28785 attributes that we find. objc_add_property_declaration() will
28786 then process the information. */
28796 /* 'properties' is the list of properties that we read. Usually a
28797 single one, but maybe more (eg, in "@property int a, b, c;" there
28798 are three). */
28799 tree properties;
28800 location_t loc;
28806 /* Parse the optional attribute list... */
28808 {
28809 /* Eat the '('. */
28813 {
28819 {
28822 }
28826 {
28837 {
28841 else
28846 }
28849 {
28853 }
28855 {
28857 {
28860 }
28861 else
28865 else
28867 }
28868 else
28869 {
28871 {
28874 }
28875 else
28877 }
28883 }
28890 else
28892 }
28894 /* FIXME: "@property (setter, assign);" will generate a spurious
28895 "error: expected ‘)’ before ‘,’ token". This is because
28896 cp_parser_require, unlike the C counterpart, will produce an
28897 error even if we are in error recovery. */
28899 {
28904 }
28905 }
28907 /* ... and the property declaration(s). */
28911 {
28913 /* If the next token is now a `;', consume it. */
28917 }
28921 else
28922 {
28923 /* Comma-separated properties are chained together in
28924 reverse order; add them one by one. */
28933 }
28936 }
28938 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
28940 objc-synthesize-declaration:
28941 @synthesize objc-synthesize-identifier-list ;
28943 objc-synthesize-identifier-list:
28944 objc-synthesize-identifier
28945 objc-synthesize-identifier-list, objc-synthesize-identifier
28947 objc-synthesize-identifier
28948 identifier
28949 identifier = identifier
28951 For example:
28952 @synthesize MyProperty;
28953 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
28955 PS: This function is identical to c_parser_objc_at_synthesize_declaration
28956 for C. Keep them in sync.
28957 */
28958 static void
28960 {
28962 location_t loc;
28967 {
28971 {
28974 }
28976 {
28980 {
28983 }
28984 }
28985 else
28990 else
28992 }
28995 }
28997 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
28999 objc-dynamic-declaration:
29000 @dynamic identifier-list ;
29002 For example:
29003 @dynamic MyProperty;
29004 @dynamic MyProperty, AnotherProperty;
29006 PS: This function is identical to c_parser_objc_at_dynamic_declaration
29007 for C. Keep them in sync.
29008 */
29009 static void
29011 {
29013 location_t loc;
29018 {
29019 tree property;
29022 {
29025 }
29029 else
29031 }
29034 }
29036 \f
29037 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
29039 /* Returns name of the next clause.
29040 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
29041 the token is not consumed. Otherwise appropriate pragma_omp_clause is
29042 returned and the token is consumed. */
29044 static pragma_omp_clause
29046 {
29062 {
29067 {
29248 }
29249 }
29255 }
29257 /* Validate that a clause of the given type does not already exist. */
29259 static void
29262 {
29263 tree c;
29267 {
29270 }
29271 }
29273 /* OpenMP 2.5:
29274 variable-list:
29275 identifier
29276 variable-list , identifier
29278 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
29279 colon). An opening parenthesis will have been consumed by the caller.
29281 If KIND is nonzero, create the appropriate node and install the decl
29282 in OMP_CLAUSE_DECL and add the node to the head of the list.
29284 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
29285 return the list created.
29287 COLON can be NULL if only closing parenthesis should end the list,
29288 or pointer to bool which will receive false if the list is terminated
29289 by closing parenthesis or true if the list is terminated by colon. */
29291 static tree
29294 {
29298 {
29301 }
29303 {
29308 && current_class_ptr
29310 {
29316 }
29317 else
29318 {
29331 }
29333 ;
29335 {
29337 {
29340 {
29344 }
29345 /* FALLTHROUGH. */
29350 {
29351 location_t loc
29355 decl
29359 }
29360 /* FALLTHROUGH. */
29364 {
29372 parser->colon_corrects_to_scope_p
29376 else
29377 {
29378 /* Look for `:'. */
29382 CPP_CLOSE_SQUARE))
29384 }
29385 /* Look for the closing `]'. */
29387 RT_CLOSE_SQUARE))
29391 {
29394 {
29398 }
29402 {
29406 }
29407 }
29410 }
29414 }
29420 }
29421 else
29424 get_comma:
29428 }
29434 {
29438 }
29441 {
29444 /* Try to resync to an unnested comma. Copied from
29445 cp_parser_parenthesized_expression_list. */
29446 skip_comma:
29455 }
29458 }
29460 /* Similarly, but expect leading and trailing parenthesis. This is a very
29461 common case for omp clauses. */
29463 static tree
29465 {
29469 }
29471 /* OpenACC 2.0:
29472 copy ( variable-list )
29473 copyin ( variable-list )
29474 copyout ( variable-list )
29475 create ( variable-list )
29476 delete ( variable-list )
29477 present ( variable-list )
29478 present_or_copy ( variable-list )
29479 pcopy ( variable-list )
29480 present_or_copyin ( variable-list )
29481 pcopyin ( variable-list )
29482 present_or_copyout ( variable-list )
29483 pcopyout ( variable-list )
29484 present_or_create ( variable-list )
29485 pcreate ( variable-list ) */
29487 static tree
29489 tree list)
29490 {
29493 {
29539 }
29547 }
29549 /* OpenACC 2.0:
29550 deviceptr ( variable-list ) */
29552 static tree
29554 {
29558 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
29559 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
29560 variable-list must only allow for pointer variables. */
29563 {
29566 /* FIXME diagnostics: Ideally we should keep individual
29567 locations for all the variables in the var list to make the
29568 following errors more precise. Perhaps
29569 c_parser_omp_var_list_parens should construct a list of
29570 locations to go along with the var list. */
29575 ;
29584 }
29587 }
29589 /* OpenACC 2.0:
29590 auto
29591 independent
29592 nohost
29593 seq */
29595 static tree
29599 {
29604 }
29606 /* OpenACC:
29607 num_gangs ( expression )
29608 num_workers ( expression )
29609 vector_length ( expression ) */
29611 static tree
29614 {
29624 {
29629 }
29637 }
29639 /* OpenACC:
29641 gang [( gang-arg-list )]
29642 worker [( [num:] int-expr )]
29643 vector [( [length:] int-expr )]
29645 where gang-arg is one of:
29647 [num:] int-expr
29648 static: size-expr
29650 and size-expr may be:
29652 *
29653 int-expr
29654 */
29656 static tree
29659 {
29669 {
29672 do
29673 {
29677 /* Gang static argument. */
29680 {
29688 {
29691 }
29693 /* Check for the '*' argument. */
29697 CPP_CLOSE_PAREN)))
29698 {
29703 {
29706 }
29708 }
29709 }
29710 /* Worker num: argument and vector length: arguments. */
29714 {
29717 }
29719 /* Now collect the actual argument. */
29721 {
29724 }
29736 {
29739 }
29741 }
29746 }
29760 cleanup_error:
29763 }
29765 /* OpenACC 2.0:
29766 tile ( size-expr-list ) */
29768 static tree
29770 {
29779 do
29780 {
29784 {
29787 }
29788 else
29798 }
29801 /* Consume the trailing ')'. */
29809 }
29811 /* OpenACC 2.0
29812 Parse wait clause or directive parameters. */
29814 static tree
29816 {
29826 {
29831 }
29838 {
29842 {
29845 else
29846 {
29853 }
29854 }
29855 }
29858 }
29860 /* OpenACC:
29861 wait ( int-expr-list ) */
29863 static tree
29865 {
29874 }
29876 /* OpenMP 3.0:
29877 collapse ( constant-expression ) */
29879 static tree
29881 {
29883 location_t loc;
29884 HOST_WIDE_INT n;
29904 {
29907 }
29915 }
29917 /* OpenMP 2.5:
29918 default ( shared | none )
29920 OpenACC 2.0
29921 default (none) */
29923 static tree
29926 {
29928 tree c;
29933 {
29938 {
29953 }
29956 }
29957 else
29958 {
29959 invalid_kind:
29962 else
29964 }
29980 }
29982 /* OpenMP 3.1:
29983 final ( expression ) */
29985 static tree
29987 {
30008 }
30010 /* OpenMP 2.5:
30011 if ( expression )
30013 OpenMP 4.5:
30014 if ( directive-name-modifier : expression )
30016 directive-name-modifier:
30017 parallel | task | taskloop | target data | target | target update
30018 | target enter data | target exit data */
30020 static tree
30023 {
30031 {
30043 {
30046 {
30059 else
30060 {
30061 location_t loc
30066 }
30069 {
30071 {
30076 }
30078 {
30079 location_t loc
30083 }
30084 }
30085 }
30086 }
30088 {
30090 {
30093 }
30094 else
30095 {
30097 {
30098 location_t loc
30101 }
30103 }
30104 }
30105 }
30117 {
30120 {
30123 {
30133 }
30135 p);
30137 }
30139 {
30142 else
30145 }
30148 {
30152 }
30153 }
30161 }
30163 /* OpenMP 3.1:
30164 mergeable */
30166 static tree
30169 {
30170 tree c;
30173 location);
30178 }
30180 /* OpenMP 2.5:
30181 nowait */
30183 static tree
30186 {
30187 tree c;
30194 }
30196 /* OpenMP 2.5:
30197 num_threads ( expression ) */
30199 static tree
30201 location_t location)
30202 {
30224 }
30226 /* OpenMP 4.5:
30227 num_tasks ( expression ) */
30229 static tree
30231 location_t location)
30232 {
30254 }
30256 /* OpenMP 4.5:
30257 grainsize ( expression ) */
30259 static tree
30261 location_t location)
30262 {
30284 }
30286 /* OpenMP 4.5:
30287 priority ( expression ) */
30289 static tree
30291 location_t location)
30292 {
30314 }
30316 /* OpenMP 4.5:
30317 hint ( expression ) */
30319 static tree
30321 location_t location)
30322 {
30343 }
30345 /* OpenMP 4.5:
30346 defaultmap ( tofrom : scalar ) */
30348 static tree
30350 location_t location)
30351 {
30359 {
30362 }
30366 {
30369 }
30375 {
30378 }
30382 {
30385 }
30391 location);
30397 out_err:
30402 }
30404 /* OpenMP 2.5:
30405 ordered
30407 OpenMP 4.5:
30408 ordered ( constant-expression ) */
30410 static tree
30413 {
30415 HOST_WIDE_INT n;
30421 {
30438 {
30440 "ordered argument needs positive constant integer "
30443 }
30444 }
30450 }
30452 /* OpenMP 2.5:
30453 reduction ( reduction-operator : variable-list )
30455 reduction-operator:
30456 One of: + * - & ^ | && ||
30458 OpenMP 3.1:
30460 reduction-operator:
30461 One of: + * - & ^ | && || min max
30463 OpenMP 4.0:
30465 reduction-operator:
30466 One of: + * - & ^ | && ||
30467 id-expression */
30469 static tree
30471 {
30479 {
30489 }
30493 else
30494 {
30505 {
30535 }
30536 else
30537 {
30539 resync_fail:
30544 }
30545 }
30551 NULL);
30553 {
30556 }
30559 }
30561 /* OpenMP 2.5:
30562 schedule ( schedule-kind )
30563 schedule ( schedule-kind , expression )
30565 schedule-kind:
30566 static | dynamic | guided | runtime | auto
30568 OpenMP 4.5:
30569 schedule ( schedule-modifier : schedule-kind )
30570 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
30572 schedule-modifier:
30573 simd
30574 monotonic
30575 nonmonotonic */
30577 static tree
30579 {
30589 {
30598 else
30604 else
30605 {
30608 }
30609 }
30612 {
30617 {
30638 }
30639 }
30644 else
30650 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
30652 {
30656 }
30659 {
30674 else
30679 }
30691 invalid_kind:
30693 resync_fail:
30698 }
30700 /* OpenMP 3.0:
30701 untied */
30703 static tree
30706 {
30707 tree c;
30714 }
30716 /* OpenMP 4.0:
30717 inbranch
30718 notinbranch */
30720 static tree
30723 {
30728 }
30730 /* OpenMP 4.0:
30731 parallel
30732 for
30733 sections
30734 taskgroup */
30736 static tree
30740 {
30744 }
30746 /* OpenMP 4.5:
30747 nogroup */
30749 static tree
30752 {
30757 }
30759 /* OpenMP 4.5:
30760 simd
30761 threads */
30763 static tree
30767 {
30772 }
30774 /* OpenMP 4.0:
30775 num_teams ( expression ) */
30777 static tree
30779 location_t location)
30780 {
30802 }
30804 /* OpenMP 4.0:
30805 thread_limit ( expression ) */
30807 static tree
30809 location_t location)
30810 {
30832 }
30834 /* OpenMP 4.0:
30835 aligned ( variable-list )
30836 aligned ( variable-list : constant-expression ) */
30838 static tree
30840 {
30851 {
30861 }
30867 }
30869 /* OpenMP 4.0:
30870 linear ( variable-list )
30871 linear ( variable-list : expression )
30873 OpenMP 4.5:
30874 linear ( modifier ( variable-list ) )
30875 linear ( modifier ( variable-list ) : expression ) */
30877 static tree
30880 {
30890 {
30902 else
30904 }
30909 else
30910 {
30919 }
30922 {
30927 {
30938 {
30941 }
30944 }
30949 {
30952 }
30960 }
30963 {
30966 }
30969 }
30971 /* OpenMP 4.0:
30972 safelen ( constant-expression ) */
30974 static tree
30976 location_t location)
30977 {
30998 }
31000 /* OpenMP 4.0:
31001 simdlen ( constant-expression ) */
31003 static tree
31005 location_t location)
31006 {
31027 }
31029 /* OpenMP 4.5:
31030 vec:
31031 identifier [+/- integer]
31032 vec , identifier [+/- integer]
31033 */
31035 static tree
31037 tree list)
31038 {
31042 {
31045 }
31048 {
31055 else
31056 {
31057 t = cp_parser_lookup_name_simple
31062 id_loc);
31063 }
31069 {
31072 }
31076 {
31079 }
31083 {
31086 }
31089 add_to_vector:
31091 {
31095 }
31101 }
31104 {
31110 }
31112 }
31114 /* OpenMP 4.0:
31115 depend ( depend-kind : variable-list )
31117 depend-kind:
31118 in | out | inout
31120 OpenMP 4.5:
31121 depend ( source )
31123 depend ( sink : vec ) */
31125 static tree
31127 {
31135 {
31149 else
31151 }
31152 else
31158 {
31168 }
31175 else
31176 {
31182 }
31185 invalid_kind:
31187 resync_fail:
31192 }
31194 /* OpenMP 4.0:
31195 map ( map-kind : variable-list )
31196 map ( variable-list )
31198 map-kind:
31199 alloc | to | from | tofrom
31201 OpenMP 4.5:
31202 map-kind:
31203 alloc | to | from | tofrom | release | delete
31205 map ( always [,] map-kind: variable-list ) */
31207 static tree
31209 {
31218 {
31223 {
31226 nth++;
31232 {
31237 }
31238 }
31239 }
31243 {
31257 else
31258 {
31264 }
31267 }
31270 {
31274 }
31277 NULL);
31283 }
31285 /* OpenMP 4.0:
31286 device ( expression ) */
31288 static tree
31290 location_t location)
31291 {
31313 }
31315 /* OpenMP 4.0:
31316 dist_schedule ( static )
31317 dist_schedule ( static , expression ) */
31319 static tree
31321 location_t location)
31322 {
31335 {
31346 }
31351 location);
31355 invalid_kind:
31357 resync_fail:
31362 }
31364 /* OpenMP 4.0:
31365 proc_bind ( proc-bind-kind )
31367 proc-bind-kind:
31368 master | close | spread */
31370 static tree
31372 location_t location)
31373 {
31374 tree c;
31381 {
31391 else
31393 }
31394 else
31403 location);
31408 invalid_kind:
31410 resync_fail:
31415 }
31417 /* OpenACC:
31418 async [( int-expr )] */
31420 static tree
31422 {
31429 {
31438 }
31448 }
31450 /* Parse all OpenACC clauses. The set clauses allowed by the directive
31451 is a bitmask in MASK. Return the list of clauses found. */
31453 static tree
31457 {
31462 {
31463 location_t here;
31464 pragma_omp_clause c_kind;
31465 omp_clause_code code;
31476 {
31528 clauses);
31546 OMP_CLAUSE_INDEPENDENT,
31558 clauses);
31564 clauses);
31588 clauses);
31617 clauses);
31631 }
31636 {
31637 /* Remove the invalid clause(s) from the list to avoid
31638 confusing the rest of the compiler. */
31641 }
31642 }
31644 saw_error:
31651 }
31653 /* Parse all OpenMP clauses. The set clauses allowed by the directive
31654 is a bitmask in MASK. Return the list of clauses found; the result
31655 of clause default goes in *pdefault. */
31657 static tree
31661 {
31667 {
31668 pragma_omp_clause c_kind;
31679 {
31691 clauses);
31705 clauses);
31725 clauses);
31730 clauses);
31740 clauses);
31774 clauses);
31788 clauses);
31805 OMP_CLAUSE_NOTINBRANCH,
31814 {
31815 clause_not_first:
31819 }
31849 clauses);
31850 else
31860 clauses);
31878 {
31886 }
31929 clauses
31935 clauses
31947 }
31952 {
31953 /* Remove the invalid clause(s) from the list to avoid
31954 confusing the rest of the compiler. */
31957 }
31958 }
31959 saw_error:
31960 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
31961 no reason to skip to the end. */
31965 {
31968 else
31970 }
31972 }
31974 /* OpenMP 2.5:
31975 structured-block:
31976 statement
31978 In practice, we're also interested in adding the statement to an
31979 outer node. So it is convenient if we work around the fact that
31980 cp_parser_statement calls add_stmt. */
31982 static unsigned
31984 {
31987 /* Only move the values to IN_OMP_BLOCK if they weren't false.
31988 This preserves the "not within loop or switch" style error messages
31989 for nonsense cases like
31990 void foo() {
31991 #pragma omp single
31992 break;
31993 }
31994 */
31999 }
32001 static void
32003 {
32005 }
32007 static tree
32009 {
32017 }
32019 /* OpenMP 2.5:
32020 # pragma omp atomic new-line
32021 expression-stmt
32023 expression-stmt:
32024 x binop= expr | x++ | ++x | x-- | --x
32025 binop:
32026 +, *, -, /, &, ^, |, <<, >>
32028 where x is an lvalue expression with scalar type.
32030 OpenMP 3.1:
32031 # pragma omp atomic new-line
32032 update-stmt
32034 # pragma omp atomic read new-line
32035 read-stmt
32037 # pragma omp atomic write new-line
32038 write-stmt
32040 # pragma omp atomic update new-line
32041 update-stmt
32043 # pragma omp atomic capture new-line
32044 capture-stmt
32046 # pragma omp atomic capture new-line
32047 capture-block
32049 read-stmt:
32050 v = x
32051 write-stmt:
32052 x = expr
32053 update-stmt:
32054 expression-stmt | x = x binop expr
32055 capture-stmt:
32056 v = expression-stmt
32057 capture-block:
32058 { v = x; update-stmt; } | { update-stmt; v = x; }
32060 OpenMP 4.0:
32061 update-stmt:
32062 expression-stmt | x = x binop expr | x = expr binop x
32063 capture-stmt:
32064 v = update-stmt
32065 capture-block:
32066 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
32068 where x and v are lvalue expressions with scalar type. */
32070 static void
32072 {
32080 {
32085 {
32091 }
32092 }
32094 {
32106 else
32110 }
32112 {
32118 {
32123 {
32126 }
32127 }
32128 }
32132 {
32142 else
32147 {
32148 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
32149 opcode. */
32154 }
32158 {
32161 }
32162 else
32163 {
32169 }
32172 }
32174 restart:
32178 {
32185 /* FALLTHROUGH */
32195 /* FALLTHROUGH */
32210 /* Undo effects of boolean_increment for post {in,de}crement. */
32212 /* FALLTHRU */
32216 {
32217 /* Undo effects of boolean_increment. */
32219 {
32220 /* This is pre or post increment. */
32225 && !structured_block
32229 }
32230 }
32231 /* FALLTHRU */
32234 {
32269 {
32273 }
32276 {
32282 {
32287 }
32289 {
32301 {
32303 {
32308 }
32309 else
32311 }
32315 }
32318 {
32325 }
32329 }
32333 {
32336 {
32344 }
32346 {
32351 }
32386 }
32397 /* FALLTHROUGH */
32402 }
32409 }
32410 stmt_done:
32412 {
32423 }
32425 {
32428 }
32429 done:
32435 saw_error:
32438 {
32442 {
32446 }
32447 }
32448 }
32451 /* OpenMP 2.5:
32452 # pragma omp barrier new-line */
32454 static void
32456 {
32459 }
32461 /* OpenMP 2.5:
32462 # pragma omp critical [(name)] new-line
32463 structured-block
32465 OpenMP 4.5:
32466 # pragma omp critical [(name) [hint(expression)]] new-line
32467 structured-block */
32469 #define OMP_CRITICAL_CLAUSE_MASK \
32470 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
32472 static tree
32474 {
32478 {
32492 OMP_CRITICAL_CLAUSE_MASK,
32494 }
32495 else
32500 }
32502 /* OpenMP 2.5:
32503 # pragma omp flush flush-vars[opt] new-line
32505 flush-vars:
32506 ( variable-list ) */
32508 static void
32510 {
32516 }
32518 /* Helper function, to parse omp for increment expression. */
32520 static tree
32522 {
32527 {
32530 }
32533 {
32542 /* Fall through: OpenMP disallows NE_EXPR. */
32545 }
32547 /* If decl is an iterator, preserve LHS and RHS of the relational
32548 expr until finish_omp_for. */
32558 }
32560 /* Helper function, to parse omp for increment expression. */
32562 static tree
32564 {
32568 cp_id_kind idk;
32572 {
32581 }
32590 {
32595 }
32602 {
32606 }
32619 do
32620 {
32627 {
32629 {
32632 else
32634 tf_warning_or_error);
32635 }
32636 else
32639 }
32640 }
32644 {
32650 }
32651 else
32655 }
32657 /* Parse the initialization statement of either an OpenMP for loop or
32658 a Cilk Plus for loop.
32660 Return true if the resulting construct should have an
32661 OMP_CLAUSE_PRIVATE added to it. */
32663 static tree
32672 {
32678 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
32680 init-expr:
32681 var = lb
32682 integer-type var = lb
32683 random-access-iterator-type var = lb
32684 pointer-type var = lb
32685 */
32686 cp_decl_specifier_seq type_specifiers;
32688 /* First, try to parse as an initialized declaration. See
32689 cp_parser_condition, from whence the bulk of this is copied. */
32696 {
32697 /* If parsing a type specifier seq succeeded, then this
32698 MUST be a initialized declaration. */
32703 CP_PARSER_DECLARATOR_NAMED,
32714 else
32715 {
32725 {
32727 CPP_OPEN_PAREN))
32728 {
32732 else
32735 }
32736 else
32737 /* Trigger an error. */
32742 }
32746 {
32754 {
32757 auto_node);
32762 }
32765 asm_specification,
32766 LOOKUP_ONLYCONVERTING);
32769 {
32772 }
32773 else
32776 }
32777 else
32778 {
32779 /* Consume '='. */
32783 non_class:
32786 else
32789 asm_specification,
32790 LOOKUP_ONLYCONVERTING);
32791 }
32795 }
32796 }
32797 else
32798 {
32799 cp_id_kind idk;
32800 /* If parsing a type specifier sequence failed, then
32801 this MUST be a simple expression. */
32810 && decl
32813 {
32824 {
32829 }
32834 }
32836 && decl
32839 {
32840 tree rhs;
32848 rhs,
32849 tf_warning_or_error));
32852 }
32853 else
32854 {
32859 {
32863 }
32864 }
32865 }
32867 }
32869 /* Parse the restricted form of the for statement allowed by OpenMP. */
32871 static tree
32874 {
32878 location_t loc_first;
32889 {
32892 }
32895 {
32901 }
32903 {
32906 {
32908 "%<linear%> clause may not be specified together "
32911 }
32912 else
32914 }
32927 {
32930 location_t loc;
32934 {
32937 }
32940 {
32943 }
32952 add_private_clause
32959 {
32962 {
32968 }
32969 else
32971 }
32978 {
32983 {
32987 }
32990 {
32991 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
32995 {
32998 }
32999 else
33000 {
33003 }
33005 }
33006 else
33007 {
33012 }
33013 }
33016 {
33017 tree c;
33019 {
33028 decl);
33032 decl);
33033 }
33035 {
33040 else
33045 {
33048 /* For linear, signal that we need to fill up
33049 the so far unknown linear step. */
33052 }
33053 }
33054 }
33063 {
33064 /* If decl is an iterator, preserve the operator on decl
33065 until finish_omp_for. */
33067 && ((processing_template_decl
33072 else
33076 }
33088 {
33091 }
33096 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
33097 in between the collapsed for loops to be still considered perfectly
33098 nested. Hopefully the final version clarifies this.
33099 For now handle (multiple) {'s and empty statements. */
33101 do
33102 {
33106 {
33108 bracecount++;
33109 }
33113 else
33114 {
33121 }
33122 }
33126 {
33129 }
33130 }
33132 /* Note that we saved the original contents of this flag when we entered
33133 the structured block, and so we don't need to re-save it here. */
33136 else
33139 /* Note that the grammar doesn't call for a structured block here,
33140 though the loop as a whole is a structured block. */
33147 else
33152 {
33154 {
33156 nbraces--;
33157 }
33160 else
33161 {
33163 {
33166 }
33171 }
33172 }
33179 }
33181 /* Helper function for OpenMP parsing, split clauses and call
33182 finish_omp_clauses on each of the set of clauses afterwards. */
33184 static void
33187 {
33193 }
33195 /* OpenMP 4.0:
33196 #pragma omp simd simd-clause[optseq] new-line
33197 for-loop */
33199 #define OMP_SIMD_CLAUSE_MASK \
33200 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
33201 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
33202 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33203 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
33204 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33205 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33206 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33209 static tree
33212 {
33223 {
33227 OMP_CLAUSE_ORDERED);
33229 {
33231 "%<ordered%> clause with parameter may not be specified "
33234 }
33235 }
33246 }
33248 /* OpenMP 2.5:
33249 #pragma omp for for-clause[optseq] new-line
33250 for-loop
33252 OpenMP 4.0:
33253 #pragma omp for simd for-simd-clause[optseq] new-line
33254 for-loop */
33256 #define OMP_FOR_CLAUSE_MASK \
33257 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
33263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
33264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
33265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33267 static tree
33270 {
33279 /* Composite distribute parallel for{, simd} disallows ordered clause. */
33284 {
33289 {
33297 cclauses);
33301 cclauses);
33313 }
33314 }
33316 {
33319 }
33321 /* Composite distribute parallel for disallows linear clause. */
33328 {
33331 }
33342 }
33344 /* OpenMP 2.5:
33345 # pragma omp master new-line
33346 structured-block */
33348 static tree
33350 {
33354 }
33356 /* OpenMP 2.5:
33357 # pragma omp ordered new-line
33358 structured-block
33360 OpenMP 4.5:
33361 # pragma omp ordered ordered-clauses new-line
33362 structured-block */
33364 #define OMP_ORDERED_CLAUSE_MASK \
33365 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
33366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
33368 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
33369 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
33371 static bool
33374 {
33378 {
33382 }
33385 {
33390 {
33392 {
33394 "%<depend%> clause may only be used in compound "
33398 }
33399 tree clauses
33401 OMP_ORDERED_DEPEND_CLAUSE_MASK,
33405 }
33406 }
33408 tree clauses
33414 }
33416 /* OpenMP 2.5:
33418 section-scope:
33419 { section-sequence }
33421 section-sequence:
33422 section-directive[opt] structured-block
33423 section-sequence section-directive structured-block */
33425 static tree
33427 {
33438 {
33442 }
33445 {
33453 {
33457 }
33459 {
33462 }
33467 }
33478 }
33480 /* OpenMP 2.5:
33481 # pragma omp sections sections-clause[optseq] newline
33482 sections-scope */
33484 #define OMP_SECTIONS_CLAUSE_MASK \
33485 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
33491 static tree
33494 {
33506 {
33509 }
33516 }
33518 /* OpenMP 2.5:
33519 # pragma omp parallel parallel-clause[optseq] new-line
33520 structured-block
33521 # pragma omp parallel for parallel-for-clause[optseq] new-line
33522 structured-block
33523 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
33524 structured-block
33526 OpenMP 4.0:
33527 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
33528 structured-block */
33530 #define OMP_PARALLEL_CLAUSE_MASK \
33531 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
33532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
33535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
33536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
33537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
33539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
33541 static tree
33544 {
33551 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
33557 {
33570 block);
33575 }
33576 /* When combined with distribute, parallel has to be followed by for.
33577 #pragma omp target parallel is allowed though. */
33581 {
33585 }
33587 {
33590 }
33592 {
33596 {
33606 block);
33609 }
33610 }
33614 {
33617 }
33625 }
33627 /* OpenMP 2.5:
33628 # pragma omp single single-clause[optseq] new-line
33629 structured-block */
33631 #define OMP_SINGLE_CLAUSE_MASK \
33632 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
33635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
33637 static tree
33639 {
33649 }
33651 /* OpenMP 3.0:
33652 # pragma omp task task-clause[optseq] new-line
33653 structured-block */
33655 #define OMP_TASK_CLAUSE_MASK \
33656 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
33657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
33658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
33659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33661 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
33662 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
33663 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
33664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
33665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
33667 static tree
33669 {
33680 }
33682 /* OpenMP 3.0:
33683 # pragma omp taskwait new-line */
33685 static void
33687 {
33690 }
33692 /* OpenMP 3.1:
33693 # pragma omp taskyield new-line */
33695 static void
33697 {
33700 }
33702 /* OpenMP 4.0:
33703 # pragma omp taskgroup new-line
33704 structured-block */
33706 static tree
33708 {
33712 }
33715 /* OpenMP 2.5:
33716 # pragma omp threadprivate (variable-list) */
33718 static void
33720 {
33721 tree vars;
33727 }
33729 /* OpenMP 4.0:
33730 # pragma omp cancel cancel-clause[optseq] new-line */
33732 #define OMP_CANCEL_CLAUSE_MASK \
33733 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
33734 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
33735 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
33736 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
33737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
33739 static void
33741 {
33745 }
33747 /* OpenMP 4.0:
33748 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
33750 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
33751 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
33752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
33753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
33754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
33756 static void
33758 {
33759 tree clauses;
33763 {
33768 {
33771 }
33772 }
33774 {
33778 }
33781 OMP_CANCELLATION_POINT_CLAUSE_MASK,
33783 pragma_tok);
33785 }
33787 /* OpenMP 4.0:
33788 #pragma omp distribute distribute-clause[optseq] new-line
33789 for-loop */
33791 #define OMP_DISTRIBUTE_CLAUSE_MASK \
33792 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
33796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33798 static tree
33801 {
33810 {
33818 else
33821 {
33827 {
33830 cclauses);
33831 else
33833 cclauses);
33834 }
33839 cclauses);
33840 else
33842 cclauses);
33854 }
33855 }
33857 {
33860 }
33865 {
33868 }
33879 }
33881 /* OpenMP 4.0:
33882 # pragma omp teams teams-clause[optseq] new-line
33883 structured-block */
33885 #define OMP_TEAMS_CLAUSE_MASK \
33886 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33887 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
33889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
33891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
33892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
33894 static tree
33897 {
33906 {
33910 {
33918 cclauses);
33922 cclauses);
33934 }
33935 }
33937 {
33940 }
33945 {
33948 }
33956 }
33958 /* OpenMP 4.0:
33959 # pragma omp target data target-data-clause[optseq] new-line
33960 structured-block */
33962 #define OMP_TARGET_DATA_CLAUSE_MASK \
33963 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
33964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
33965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
33966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
33968 static tree
33970 {
33971 tree clauses
33976 {
33979 {
33996 "%<#pragma omp target data%> with map-type other "
33997 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34001 }
34003 }
34006 {
34009 "%<#pragma omp target data%> must contain at least "
34012 }
34023 }
34025 /* OpenMP 4.5:
34026 # pragma omp target enter data target-enter-data-clause[optseq] new-line
34027 structured-block */
34029 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
34030 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34033 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34034 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34036 static tree
34039 {
34042 {
34047 {
34050 }
34051 }
34053 {
34057 }
34060 {
34062 "%<#pragma omp target enter data%> may only be "
34066 }
34068 tree clauses
34073 {
34076 {
34089 "%<#pragma omp target enter data%> with map-type other "
34093 }
34095 }
34098 {
34101 "%<#pragma omp target enter data%> must contain at least "
34104 }
34111 }
34113 /* OpenMP 4.5:
34114 # pragma omp target exit data target-enter-data-clause[optseq] new-line
34115 structured-block */
34117 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
34118 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34124 static tree
34127 {
34130 {
34135 {
34138 }
34139 }
34141 {
34145 }
34148 {
34150 "%<#pragma omp target exit data%> may only be "
34154 }
34156 tree clauses
34161 {
34164 {
34178 "%<#pragma omp target exit data%> with map-type other "
34179 "than %<from%>, %<release%> or %<delete%> on %<map%>"
34183 }
34185 }
34188 {
34191 "%<#pragma omp target exit data%> must contain at least "
34194 }
34201 }
34203 /* OpenMP 4.0:
34204 # pragma omp target update target-update-clause[optseq] new-line */
34206 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
34207 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
34208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
34209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34210 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34211 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34214 static bool
34217 {
34219 {
34221 "%<#pragma omp target update%> may only be "
34225 }
34227 tree clauses
34232 {
34234 "%<#pragma omp target update%> must contain at least one "
34237 }
34245 }
34247 /* OpenMP 4.0:
34248 # pragma omp target target-clause[optseq] new-line
34249 structured-block */
34251 #define OMP_TARGET_CLAUSE_MASK \
34252 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34253 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34254 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
34260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
34262 static bool
34265 {
34269 {
34273 }
34276 {
34288 {
34296 {
34297 tree stmt;
34299 {
34302 OMP_TARGET_CLAUSE_MASK,
34303 cclauses);
34307 OMP_TARGET_CLAUSE_MASK,
34308 cclauses);
34312 OMP_TARGET_CLAUSE_MASK,
34313 cclauses);
34317 }
34319 }
34324 {
34339 }
34345 {
34346 /* For combined target teams, ensure the num_teams and
34347 thread_limit clause expressions are evaluated on the host,
34348 before entering the target construct. */
34349 tree c;
34355 {
34364 OMP_CLAUSE_FIRSTPRIVATE);
34369 }
34370 }
34379 }
34381 {
34384 }
34386 {
34390 }
34392 {
34396 }
34398 {
34402 }
34404 {
34407 }
34408 }
34423 check_clauses:
34425 {
34428 {
34442 "%<#pragma omp target%> with map-type other "
34443 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34447 }
34449 }
34451 }
34453 /* OpenACC 2.0:
34454 # pragma acc cache (variable-list) new-line
34455 */
34457 static tree
34459 {
34474 }
34476 /* OpenACC 2.0:
34477 # pragma acc data oacc-data-clause[optseq] new-line
34478 structured-block */
34480 #define OACC_DATA_CLAUSE_MASK \
34481 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
34482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
34483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
34484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
34485 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
34486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
34487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
34488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
34489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
34490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
34491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
34493 static tree
34495 {
34508 }
34510 /* OpenACC 2.0:
34511 # pragma acc declare oacc-data-clause[optseq] new-line
34512 */
34514 #define OACC_DECLARE_CLAUSE_MASK \
34515 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
34516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
34517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
34518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
34519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
34520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
34521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
34522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
34523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
34524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
34525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
34526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
34528 static tree
34530 {
34539 {
34543 }
34546 {
34550 {
34554 }
34557 {
34565 /* Generated by c_finish_omp_clauses from array sections;
34566 avoid spurious diagnostics. */
34573 {
34575 "%qD must be a global variable in"
34577 decl);
34580 }
34585 {
34589 }
34591 {
34593 "invalid use of %<extern%> variable %qD "
34597 }
34599 {
34601 "invalid use of %<global%> variable %qD "
34605 }
34607 }
34612 {
34617 }
34620 {
34621 tree id;
34625 else
34631 {
34634 {
34637 {
34640 {
34643 }
34644 }
34645 }
34646 }
34647 }
34648 }
34661 }
34663 /* OpenACC 2.0:
34664 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
34666 or
34668 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
34670 LOC is the location of the #pragma token.
34671 */
34673 #define OACC_ENTER_DATA_CLAUSE_MASK \
34674 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
34675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
34676 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
34677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
34678 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
34679 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
34680 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
34682 #define OACC_EXIT_DATA_CLAUSE_MASK \
34683 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
34684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
34685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
34686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
34687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
34689 static tree
34692 {
34697 {
34703 }
34708 {
34712 }
34719 else
34724 {
34728 }
34736 }
34738 /* OpenACC 2.0:
34739 # pragma acc loop oacc-loop-clause[optseq] new-line
34740 structured-block */
34742 #define OACC_LOOP_CLAUSE_MASK \
34743 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
34744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
34745 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
34746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
34747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
34748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
34749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
34750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
34751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
34752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
34754 static tree
34757 {
34764 {
34770 }
34779 }
34781 /* OpenACC 2.0:
34782 # pragma acc kernels oacc-kernels-clause[optseq] new-line
34783 structured-block
34785 or
34787 # pragma acc parallel oacc-parallel-clause[optseq] new-line
34788 structured-block
34789 */
34791 #define OACC_KERNELS_CLAUSE_MASK \
34792 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
34793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
34794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
34795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
34796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
34797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
34798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
34799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
34800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
34801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
34802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
34803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
34804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
34805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
34807 #define OACC_PARALLEL_CLAUSE_MASK \
34808 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
34809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
34810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
34811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
34812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
34813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
34814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
34815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
34816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
34817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
34818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
34819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
34820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
34821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
34822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
34823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
34824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
34825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
34826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
34827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
34829 static tree
34832 {
34833 omp_clause_mask mask;
34836 {
34849 }
34852 {
34856 {
34861 tree clauses;
34864 }
34865 }
34874 }
34876 /* OpenACC 2.0:
34877 # pragma acc update oacc-update-clause[optseq] new-line
34878 */
34880 #define OACC_UPDATE_CLAUSE_MASK \
34881 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
34882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
34883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
34884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
34885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
34886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
34888 static tree
34890 {
34897 {
34899 "%<#pragma acc update%> must contain at least one "
34902 }
34910 }
34912 /* OpenACC 2.0:
34913 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
34915 LOC is the location of the #pragma token.
34916 */
34918 #define OACC_WAIT_CLAUSE_MASK \
34919 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
34921 static tree
34923 {
34936 }
34938 /* OpenMP 4.0:
34939 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
34941 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
34942 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
34946 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
34947 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
34949 static void
34952 {
34954 cp_omp_declare_simd_data data;
34956 {
34961 }
34972 {
34976 {
34989 }
34994 "%<#pragma omp declare simd%> not immediately followed by "
34998 }
34999 }
35001 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
35002 This function is modelled similar to the late parsing of omp declare
35003 simd. */
35005 static tree
35007 {
35014 {
35016 "used in the same function marked as a Cilk Plus SIMD-enabled "
35022 }
35024 {
35028 }
35033 {
35040 NULL);
35054 }
35060 }
35062 /* Finalize #pragma omp declare simd clauses after direct declarator has
35063 been parsed, and put that into "omp declare simd" attribute. */
35065 static tree
35067 {
35073 {
35078 }
35083 {
35101 }
35105 }
35108 /* OpenMP 4.0:
35109 # pragma omp declare target new-line
35110 declarations and definitions
35111 # pragma omp end declare target new-line
35113 OpenMP 4.5:
35114 # pragma omp declare target ( extended-list ) new-line
35116 # pragma omp declare target declare-target-clauses[seq] new-line */
35118 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
35119 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
35122 static void
35124 {
35127 clauses
35131 {
35133 clauses);
35136 }
35137 else
35138 {
35142 }
35145 "%<#pragma omp declare target%> with clauses in between "
35146 "%<#pragma omp declare target%> without clauses and "
35149 {
35155 {
35158 }
35159 else
35162 {
35164 "%qD specified both in declare target %<link%> and %<to%>"
35167 }
35169 {
35173 {
35176 {
35179 {
35182 }
35183 }
35184 }
35185 }
35186 }
35187 }
35189 static void
35191 {
35194 {
35197 }
35199 {
35203 {
35206 }
35209 else
35210 {
35214 }
35215 }
35216 else
35217 {
35221 }
35225 "%<#pragma omp end declare target%> without corresponding "
35227 else
35229 }
35231 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
35232 expression and optional initializer clause of
35233 #pragma omp declare reduction. We store the expression(s) as
35234 either 3, 6 or 7 special statements inside of the artificial function's
35235 body. The first two statements are DECL_EXPRs for the artificial
35236 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
35237 expression that uses those variables.
35238 If there was any INITIALIZER clause, this is followed by further statements,
35239 the fourth and fifth statements are DECL_EXPRs for the artificial
35240 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
35241 constructor variant (first token after open paren is not omp_priv),
35242 then the sixth statement is a statement with the function call expression
35243 that uses the OMP_PRIV and optionally OMP_ORIG variable.
35244 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
35245 to initialize the OMP_PRIV artificial variable and there is seventh
35246 statement, a DECL_EXPR of the OMP_PRIV statement again. */
35248 static bool
35250 {
35262 tree combiner;
35277 {
35280 }
35283 {
35290 {
35293 }
35309 {
35313 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
35317 == CPP_CLOSE_PAREN
35320 {
35324 }
35329 }
35330 else
35331 {
35347 {
35352 }
35354 tree arg;
35367 }
35378 }
35384 }
35386 /* OpenMP 4.0
35387 #pragma omp declare reduction (reduction-id : typename-list : expression) \
35388 initializer-clause[opt] new-line
35390 initializer-clause:
35391 initializer (omp_priv initializer)
35392 initializer (function-name (argument-list)) */
35394 static void
35397 {
35407 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
35414 {
35446 }
35458 /* Types may not be defined in declare reduction type list. */
35461 parser->type_definition_forbidden_message
35467 saved_colon_doesnt_start_class_def_p
35472 {
35476 ;
35497 else
35502 else
35504 }
35506 /* Restore the saved message. */
35509 parser->colon_doesnt_start_class_def_p
35514 {
35515 fail:
35518 }
35524 {
35525 tree fntype
35528 NULL_TREE);
35547 {
35552 }
35554 {
35556 {
35565 }
35572 }
35573 else
35574 {
35577 }
35580 else
35583 {
35586 }
35588 {
35591 else
35596 }
35601 else
35602 {
35611 }
35618 }
35622 done:
35623 /* Free any declarators allocated. */
35625 }
35627 /* OpenMP 4.0
35628 #pragma omp declare simd declare-simd-clauses[optseq] new-line
35629 #pragma omp declare reduction (reduction-id : typename-list : expression) \
35630 initializer-clause[opt] new-line
35631 #pragma omp declare target new-line */
35633 static void
35636 {
35638 {
35643 {
35646 context);
35648 }
35651 {
35654 context);
35656 }
35658 {
35661 }
35663 {
35667 }
35668 }
35672 }
35674 /* OpenMP 4.5:
35675 #pragma omp taskloop taskloop-clause[optseq] new-line
35676 for-loop
35678 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
35679 for-loop */
35681 #define OMP_TASKLOOP_CLAUSE_MASK \
35682 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
35688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
35689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
35690 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
35695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35697 static tree
35700 {
35709 {
35714 {
35722 cclauses);
35726 cclauses);
35738 }
35739 }
35741 {
35744 }
35749 {
35752 }
35763 }
35766 /* OpenACC 2.0:
35767 # pragma acc routine oacc-routine-clause[optseq] new-line
35768 function-definition
35770 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
35771 */
35773 #define OACC_ROUTINE_CLAUSE_MASK \
35774 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
35775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
35776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
35777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
35780 /* Parse the OpenACC routine pragma. This has an optional '( name )'
35781 component, which must resolve to a declared namespace-scope
35782 function. The clauses are either processed directly (for a named
35783 function), or defered until the immediatley following declaration
35784 is parsed. */
35786 static void
35789 {
35792 cp_omp_declare_simd_data data;
35794 {
35800 }
35803 /* Create a dummy claue, to record location. */
35807 {
35812 }
35814 /* Look for optional '( name )'. */
35816 {
35818 {
35827 "%<#pragma oacc routine%> not followed by a single "
35832 }
35837 /* We parse the name as an id-expression. If it resolves to
35838 anything other than a non-overloaded function at namespace
35839 scope, it's an error. */
35853 {
35857 }
35859 /* Build a chain of clauses. */
35864 cp_lexer_peek_token
35867 /* Force clauses to be non-null, by attaching context to it. */
35873 {
35877 }
35879 /* Perhaps we should use the same rule as declarations in different
35880 namespaces? */
35882 {
35887 }
35890 {
35895 }
35902 }
35903 else
35904 {
35923 {
35924 /* Create an empty list of clauses. */
35926 NULL_TREE);
35937 }
35938 }
35939 }
35941 /* Finalize #pragma acc routine clauses after direct declarator has
35942 been parsed, and put that into "oacc routine" attribute. */
35944 static tree
35946 {
35950 location_t loc;
35956 {
35961 }
35978 /* Force clauses to be non-null, by attaching context to it. */
35983 }
35985 /* Apply any saved OpenACC routine clauses to a just-parsed
35986 declaration. */
35988 static void
35990 {
35992 {
36000 {
36003 }
36006 {
36009 }
36012 {
36016 }
36019 {
36021 fndecl);
36023 }
36026 {
36030 }
36032 /* Process for function attrib */
36036 /* Add an "omp target" attribute. */
36040 }
36041 }
36043 /* Main entry point to OpenMP statement pragmas. */
36045 static void
36047 {
36048 tree stmt;
36053 {
36132 }
36135 }
36136 \f
36137 /* Transactional Memory parsing routines. */
36139 /* Parse a transaction attribute.
36141 txn-attribute:
36142 attribute
36143 [ [ identifier ] ]
36145 We use this instead of cp_parser_attributes_opt for transactions to avoid
36146 the pedwarn in C++98 mode. */
36148 static tree
36150 {
36165 {
36169 /* For keywords, use the canonical spelling,
36170 not the parsed identifier. */
36174 }
36175 else
36179 error1:
36182 }
36184 /* Parse a __transaction_atomic or __transaction_relaxed statement.
36186 transaction-statement:
36187 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
36188 compound-statement
36189 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
36190 */
36192 static tree
36194 {
36205 else
36206 {
36210 }
36212 /* Parse a noexcept specification. */
36216 {
36217 /* cancel-and-throw is unimplemented. */
36220 }
36221 else
36224 /* Keep track if we're in the lexical scope of an outer transaction. */
36236 }
36238 /* Parse a __transaction_atomic or __transaction_relaxed expression.
36240 transaction-expression:
36241 __transaction_atomic txn-noexcept-spec[opt] ( expression )
36242 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
36243 */
36245 static tree
36247 {
36272 /* Set this early. This might mean that we allow transaction_cancel in
36273 an expression that we find out later actually has to be a constexpr.
36274 However, we expect that cxx_constant_value will be able to deal with
36275 this; also, if the noexcept has no constexpr, then what we parse next
36276 really is a transaction's body. */
36279 /* Parse a noexcept specification. */
36285 {
36292 }
36293 else
36294 {
36295 /* The only expression that is available got parsed for the noexcept
36296 already. noexcept is true then. */
36299 }
36308 }
36310 /* Parse a function-transaction-block.
36312 function-transaction-block:
36313 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
36314 function-body
36315 __transaction_atomic txn-attribute[opt] function-try-block
36316 __transaction_relaxed ctor-initializer[opt] function-body
36317 __transaction_relaxed function-try-block
36318 */
36320 static bool
36322 {
36338 else
36339 {
36343 }
36351 else
36352 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
36360 }
36362 /* Parse a __transaction_cancel statement.
36364 cancel-statement:
36365 __transaction_cancel txn-attribute[opt] ;
36366 __transaction_cancel txn-attribute[opt] throw-expression ;
36368 ??? Cancel and throw is not yet implemented. */
36370 static tree
36372 {
36378 RT_TRANSACTION_CANCEL);
36385 /* ??? Parse cancel-and-throw here. */
36390 {
36394 }
36396 {
36400 }
36402 {
36405 {
36411 }
36412 }
36414 {
36418 }
36424 }
36425 \f
36426 /* The parser. */
36430 \f
36431 /* Special handling for the first token or line in the file. The first
36432 thing in the file might be #pragma GCC pch_preprocess, which loads a
36433 PCH file, which is a GC collection point. So we need to handle this
36434 first pragma without benefit of an existing lexer structure.
36436 Always returns one token to the caller in *FIRST_TOKEN. This is
36437 either the true first token of the file, or the first token after
36438 the initial pragma. */
36440 static void
36442 {
36451 {
36458 }
36459 else
36462 /* Skip to the end of the pragma. */
36466 /* Now actually load the PCH file. */
36470 /* Read one more token to return to our caller. We have to do this
36471 after reading the PCH file in, since its pointers have to be
36472 live. */
36474 }
36476 /* Parses the grainsize pragma for the _Cilk_for statement.
36477 Syntax:
36478 #pragma cilk grainsize = <VALUE>. */
36480 static void
36482 {
36484 {
36489 {
36492 }
36494 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
36497 else
36499 "%<#pragma cilk grainsize%> is not followed by "
36502 }
36504 }
36506 /* Normal parsing of a pragma token. Here we can (and must) use the
36507 regular lexer. */
36509 static bool
36511 {
36514 tree stmt;
36525 {
36533 {
36543 }
36548 {
36558 }
36563 {
36569 "%<#pragma omp taskwait%> may only be "
36574 }
36579 {
36585 "%<#pragma omp taskyield%> may only be "
36590 }
36595 {
36601 "%<#pragma omp cancel%> may only be "
36606 }
36611 {
36617 "%<#pragma omp cancellation point%> may only be "
36622 }
36689 "%<#pragma omp section%> may only be used in "
36694 {
36696 {
36700 }
36707 {
36710 }
36713 }
36717 {
36721 }
36729 {
36733 }
36735 /* Ignore the pragma if Cilk Plus is not enabled. */
36737 {
36740 }
36741 else
36742 {
36746 }
36753 bad_stmt:
36756 }
36760 }
36762 /* The interface the pragma parsers have to the lexer. */
36764 enum cpp_ttype
36766 {
36778 else
36779 {
36783 }
36786 }
36788 \f
36789 /* External interface. */
36791 /* Parse one entire translation unit. */
36793 void
36795 {
36808 }
36810 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
36811 vectorlength clause:
36812 Syntax:
36813 vectorlength ( constant-expression ) */
36815 static tree
36818 {
36820 tree expr;
36821 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
36822 safelen clause. Thus, vectorlength is represented as OMP 4.0
36823 safelen. For SIMD-enabled function it is represented by OMP 4.0
36824 simdlen. */
36827 loc);
36828 else
36830 loc);
36838 /* If expr == error_mark_node, then don't emit any errors nor
36839 create a clause. if any of the above functions returns
36840 error mark node then they would have emitted an error message. */
36842 ;
36850 else
36851 {
36852 tree c;
36854 {
36859 }
36860 else
36861 {
36866 }
36867 }
36872 }
36874 /* Handles the Cilk Plus #pragma simd linear clause.
36875 Syntax:
36876 linear ( simd-linear-variable-list )
36878 simd-linear-variable-list:
36879 simd-linear-variable
36880 simd-linear-variable-list , simd-linear-variable
36882 simd-linear-variable:
36883 id-expression
36884 id-expression : simd-linear-step
36886 simd-linear-step:
36887 conditional-expression */
36889 static tree
36891 {
36897 {
36901 }
36906 {
36909 {
36913 }
36920 {
36924 }
36925 else
36926 {
36930 /* If present, parse the linear step. Otherwise, assume the default
36931 value of 1. */
36933 {
36940 {
36941 /* If an error has occurred, then the whole pragma is
36942 considered ill-formed. Thus, no reason to keep
36943 parsing. */
36946 }
36954 else
36956 "step size must be an integer constant "
36958 }
36960 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
36966 }
36971 else
36972 {
36977 }
36978 }
36982 }
36984 /* Returns the name of the next clause. If the clause is not
36985 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
36986 token is not consumed. Otherwise, the appropriate enum from the
36987 pragma_simd_clause is returned and the token is consumed. */
36989 static pragma_omp_clause
36991 {
36992 pragma_omp_clause clause_type;
37009 else
37014 }
37016 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
37018 static tree
37020 {
37025 {
37026 pragma_omp_clause c_kind;
37033 /* Use the OpenMP 4.0 equivalent function. */
37036 /* Use the OpenMP 4.0 equivalent function. */
37038 clauses);
37040 /* Use the OMP 4.0 equivalent function. */
37042 clauses);
37044 /* Use the OMP 4.0 equivalent function. */
37046 else
37047 {
37051 }
37052 }
37058 else
37060 }
37062 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
37064 static void
37066 {
37073 {
37077 }
37086 }
37088 /* Main entry-point for parsing Cilk Plus _Cilk_for
37089 loops. The return value is error_mark_node
37090 when errors happen and CILK_FOR tree on success. */
37092 static tree
37094 {
37109 else
37115 }
37117 /* Create an identifier for a generic parameter type (a synthesized
37118 template parameter implied by `auto' or a concept identifier). */
37121 static tree
37123 {
37127 }
37129 /* Predicate that behaves as is_auto_or_concept but matches the parent
37130 node of the generic type rather than the generic type itself. This
37131 allows for type transformation in add_implicit_template_parms. */
37135 {
37137 }
37139 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
37140 (creating a new template parameter list if necessary). Returns the newly
37141 created template type parm. */
37143 static tree
37145 {
37148 /* Before committing to modifying any scope, if we're in an
37149 implicit template scope, and we're trying to synthesize a
37150 constrained parameter, try to find a previous parameter with
37151 the same name. This is the same-type rule for abbreviated
37152 function templates. */
37154 {
37157 {
37159 {
37162 /* Return the TEMPLATE_PARM_INDEX. */
37165 }
37167 }
37168 }
37170 /* We are either continuing a function template that already contains implicit
37171 template parameters, creating a new fully-implicit function template, or
37172 extending an existing explicit function template with implicit template
37173 parameters. */
37181 {
37185 }
37186 else
37187 {
37188 /* Roll back to the existing template parameter scope (in the case of
37189 extending an explicit function template) or introduce a new template
37190 parameter scope ahead of the function parameter scope (or class scope
37191 in the case of out-of-line member definitions). The function scope is
37192 added back after template parameter synthesis below. */
37197 {
37200 }
37202 {
37203 /* If not defining a class, then any class scope is a scope level in
37204 an out-of-line member definition. In this case simply wind back
37205 beyond the first such scope to inject the template parameter list.
37206 Otherwise wind back to the class being defined. The latter can
37207 occur in class member friend declarations such as:
37209 class A {
37210 void foo (auto);
37211 };
37212 class B {
37213 friend void A::foo (auto);
37214 };
37216 The template parameter list synthesized for the friend declaration
37217 must be injected in the scope of 'B'. This can also occur in
37218 erroneous cases such as:
37220 struct A {
37221 struct B {
37222 void foo (auto);
37223 };
37224 void B::foo (auto) {}
37225 };
37227 Here the attempted definition of 'B::foo' within 'A' is ill-formed
37228 but, nevertheless, the template parameter list synthesized for the
37229 declarator should be injected into the scope of 'A' as if the
37230 ill-formed template was specified explicitly. */
37233 {
37236 }
37237 }
37243 {
37244 /* Introduce a new template parameter list for implicit template
37245 parameters. */
37249 parser->implicit_template_scope
37256 }
37257 else
37258 {
37259 /* Synthesize implicit template parameters at the end of the explicit
37260 template parameter list. */
37267 parser->implicit_template_parms
37269 }
37270 }
37272 /* Synthesize a new template parameter and track the current template
37273 parameter chain with implicit_template_parms. */
37277 tree synth_tmpl_parm;
37281 synth_tmpl_parm
37284 synth_tmpl_parm
37286 else
37287 {
37291 }
37293 // Attach the constraint to the parm before processing.
37296 tree new_parm
37298 input_location,
37299 node,
37303 // Chain the new parameter to the list of implicit parameters.
37305 parser->implicit_template_parms
37307 else
37312 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
37315 /* If creating a fully implicit function template, start the new implicit
37316 template parameter list with this synthesized type, otherwise grow the
37317 current template parameter list. */
37320 {
37327 }
37328 else
37329 {
37334 }
37336 // If the new parameter was constrained, we need to add that to the
37337 // constraints in the template parameter list.
37339 {
37343 }
37348 }
37350 /* Finish the declaration of a fully implicit function template. Such a
37351 template has no explicit template parameter list so has not been through the
37352 normal template head and tail processing. synthesize_implicit_template_parm
37353 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
37354 provided if the declaration is a class member such that its template
37355 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
37356 form is returned. Otherwise NULL_TREE is returned. */
37358 static tree
37360 {
37365 {
37369 }
37379 }