| blob | 90d5d007317c679768fb6969831065b57f1a3ef9 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2018 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/>. */
22 #define INCLUDE_UNIQUE_PTR
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
116 };
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 };
186 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
187 reverting it on destruction. */
189 class type_id_in_expr_sentinel
190 {
200 };
202 /* Prototypes. */
208 static void cp_lexer_destroy
210 static int cp_lexer_saving_tokens
214 static void cp_lexer_get_preprocessor_token
222 static bool cp_lexer_next_token_is_not
224 static bool cp_lexer_next_token_is_keyword
228 static void cp_lexer_purge_token
230 static void cp_lexer_purge_tokens_after
232 static void cp_lexer_save_tokens
234 static void cp_lexer_commit_tokens
236 static void cp_lexer_rollback_tokens
238 static void cp_lexer_print_token
242 static void cp_lexer_start_debugging
244 static void cp_lexer_stop_debugging
250 static void cp_parser_initial_pragma
253 static bool cp_parser_omp_declare_reduction_exprs
255 static void cp_finalize_oacc_routine
258 /* Manifest constants. */
259 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
260 #define CP_SAVED_TOKEN_STACK 5
262 /* Variables. */
264 /* The stream to which debugging output should be written. */
267 /* Nonzero if we are parsing an unevaluated operand: an operand to
268 sizeof, typeof, or alignof. */
271 /* Dump up to NUM tokens in BUFFER to FILE starting with token
272 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
273 first token in BUFFER. If NUM is 0, dump all the tokens. If
274 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
275 highlighted by surrounding it in [[ ]]. */
277 static void
281 {
298 {
301 }
306 {
313 nprinted++;
323 {
333 }
334 }
337 {
340 }
343 }
346 /* Dump all tokens in BUFFER to stderr. */
348 void
350 {
352 }
354 DEBUG_FUNCTION void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
365 else
367 }
370 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
371 description for T. */
373 static void
375 {
377 {
380 }
381 }
384 /* Dump parser context C to FILE. */
386 static void
388 {
393 }
396 /* Print the stack of parsing contexts to FILE starting with FIRST. */
398 static void
400 {
406 {
409 }
410 }
413 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
415 static void
417 {
420 }
423 /* Print an unparsed function entry UF to FILE. */
425 static void
427 {
430 tree fn;
435 i++)
436 {
442 }
447 {
450 }
456 {
459 }
461 }
464 /* Print the stack of unparsed member functions S to FILE. */
466 static void
469 {
475 {
478 }
479 }
482 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
483 the given PARSER. If FILE is NULL, the output is printed on stderr. */
485 static void
487 {
499 next_token);
500 }
503 /* Dump debugging information for the given PARSER. If FILE is NULL,
504 the output is printed on stderr. */
506 void
508 {
511 expanded_location eloc;
587 }
589 DEBUG_FUNCTION void
591 {
593 }
595 DEBUG_FUNCTION void
597 {
600 else
602 }
604 /* Allocate memory for a new lexer object and return it. */
608 {
613 /* Allocate the memory. */
616 /* Initially we are not debugging. */
621 /* Create the buffer. */
625 }
628 /* Create a new main C++ lexer, the lexer that gets tokens from the
629 preprocessor. */
633 {
635 cp_token token;
637 /* It's possible that parsing the first pragma will load a PCH file,
638 which is a GC collection point. So we have to do that before
639 allocating any memory. */
644 /* Put the first token in the buffer. */
647 /* Get the remaining tokens from the preprocessor. */
649 {
652 }
661 /* Subsequent preprocessor diagnostics should use compiler
662 diagnostic functions to get the compiler source location. */
667 }
669 /* Create a new lexer whose token stream is primed with the tokens in
670 CACHE. When these tokens are exhausted, no new tokens will be read. */
674 {
679 /* We do not own the buffer. */
686 /* Initially we are not debugging. */
691 }
693 /* Frees all resources associated with LEXER. */
695 static void
697 {
701 }
703 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
704 be used. The point of this flag is to help the compiler to fold away calls
705 to cp_lexer_debugging_p within this source file at compile time, when the
706 lexer is not being debugged. */
708 #define LEXER_DEBUGGING_ENABLED_P false
710 /* Returns nonzero if debugging information should be output. */
714 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
756 /* Skip past purged tokens. */
758 {
760 tp--;
761 }
764 }
766 /* nonzero if we are presently saving tokens. */
770 {
772 }
774 /* Store the next token from the preprocessor in *TOKEN. Return true
775 if we reach EOF. If LEXER is NULL, assume we are handling an
776 initial #pragma pch_preprocess, and thus want the lexer to return
777 processed strings. */
779 static void
781 {
784 /* Get a new token from the preprocessor. */
785 token->type
792 /* On some systems, some header files are surrounded by an
793 implicit extern "C" block. Set a flag in the token if it
794 comes from such a header. */
799 /* Check to see if this token is a keyword. */
801 {
803 {
804 /* Mark this token as a keyword. */
806 /* Record which keyword. */
808 }
809 else
810 {
814 {
815 /* Warn about the C++0x keyword (but still treat it as
816 an identifier). */
821 /* Clear out the C_RID_CODE so we don't warn about this
822 particular identifier-turned-keyword again. */
824 }
827 }
828 }
830 {
831 /* This only happens in Objective-C++; it must be a keyword. */
834 {
835 /* Replace 'class' with '@class', 'private' with '@private',
836 etc. This prevents confusion with the C++ keyword
837 'class', and makes the tokens consistent with other
838 Objective-C 'AT' keywords. For example '@class' is
839 reported as RID_AT_CLASS which is consistent with
840 '@synchronized', which is reported as
841 RID_AT_SYNCHRONIZED.
842 */
852 }
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if KEYWORD can start a decl-specifier. */
935 bool
937 {
939 {
940 /* auto specifier: storage-class-specifier in C++,
941 simple-type-specifier in C++0x. */
943 /* Storage classes. */
949 /* Elaborated type specifiers. */
955 /* Simple type specifiers. */
969 /* GNU extensions. */
972 /* C++0x extensions. */
984 }
985 }
987 /* Return true if the next token is a keyword for a decl-specifier. */
989 static bool
991 {
996 }
998 /* Returns TRUE iff the token T begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Returns TRUE iff the next token begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Called when processing a token with tree_check_value; perform or defer the
1017 associated checks and return the value. */
1019 static tree
1021 {
1022 /* Perform any access checks that were deferred. */
1027 {
1033 }
1034 /* Return the stored value. */
1036 }
1038 /* Return a pointer to the Nth token in the token stream. If N is 1,
1039 then this is precisely equivalent to cp_lexer_peek_token (except
1040 that it is not inline). One would like to disallow that case, but
1041 there is one case (cp_parser_nth_token_starts_template_id) where
1042 the caller passes a variable for N and it might be 1. */
1046 {
1049 /* N is 1-based, not zero-based. */
1060 {
1063 {
1066 }
1070 }
1073 {
1076 }
1079 }
1081 /* Return the next token, and advance the lexer's next_token pointer
1082 to point to the next non-purged token. */
1086 {
1092 do
1093 {
1096 {
1099 }
1101 }
1106 /* Provide debugging output. */
1108 {
1112 }
1115 }
1117 /* Permanently remove the next token from the token stream, and
1118 advance the next_token pointer to refer to the next non-purged
1119 token. */
1121 static void
1123 {
1132 do
1133 {
1134 tok++;
1136 {
1139 }
1140 }
1143 }
1145 /* Permanently remove all tokens after TOK, up to, but not
1146 including, the token that will be returned next by
1147 cp_lexer_peek_token. */
1149 static void
1151 {
1160 {
1165 }
1166 }
1168 /* Begin saving tokens. All tokens consumed after this point will be
1169 preserved. */
1171 static void
1173 {
1174 /* Provide debugging output. */
1179 }
1181 /* Commit to the portion of the token stream most recently saved. */
1183 static void
1185 {
1186 /* Provide debugging output. */
1191 }
1193 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1194 to the token stream. Stop saving tokens. */
1196 static void
1198 {
1199 /* Provide debugging output. */
1204 }
1206 /* RAII wrapper around the above functions, with sanity checking. Creating
1207 a variable saves tokens, which are committed when the variable is
1208 destroyed unless they are explicitly rolled back by calling the rollback
1209 member function. */
1211 struct saved_token_sentinel
1212 {
1217 {
1220 }
1222 {
1225 }
1227 {
1231 }
1232 };
1234 /* Print a representation of the TOKEN on the STREAM. */
1236 static void
1238 {
1239 /* We don't use cpp_type2name here because the parser defines
1240 a few tokens of its own. */
1242 /* cpplib-defined token types */
1243 #define OP(e, s) #e,
1244 #define TK(e, s) #e,
1245 TTYPE_TABLE
1246 #undef OP
1247 #undef TK
1248 /* C++ parser token types - see "Manifest constants", above. */
1252 };
1254 /* For some tokens, print the associated data. */
1256 {
1258 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1259 For example, `struct' is mapped to an INTEGER_CST. */
1262 /* fall through */
1280 /* If we have a name for the token, print it out. Otherwise, we
1281 simply give the numeric code. */
1284 else
1287 }
1288 }
1290 DEBUG_FUNCTION void
1292 {
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 else
1304 }
1307 /* Start emitting debugging information. */
1309 static void
1311 {
1318 }
1320 /* Stop emitting debugging information. */
1322 static void
1324 {
1331 }
1333 /* Create a new cp_token_cache, representing a range of tokens. */
1337 {
1342 }
1344 /* Diagnose if #pragma omp declare simd isn't followed immediately
1345 by function declaration or definition. */
1349 {
1351 {
1355 }
1356 }
1358 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1359 and put that into "omp declare simd" attribute. */
1363 {
1365 {
1367 {
1370 }
1372 {
1375 }
1376 }
1377 }
1379 /* Diagnose if #pragma acc routine isn't followed immediately by function
1380 declaration or definition. */
1384 {
1386 {
1388 "%<#pragma acc routine%> not immediately followed by "
1391 }
1392 }
1393 \f
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1398 static void
1400 {
1402 }
1404 /* Declarators. */
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1412 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1422 /* An erroneous declarator. */
1425 /* The obstack on which declarators and related data structures are
1426 allocated. */
1429 /* Alloc BYTES from the declarator memory pool. */
1433 {
1435 }
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1442 {
1455 }
1457 /* Make a declarator for a generalized identifier. If
1458 QUALIFYING_SCOPE is non-NULL, the identifier is
1459 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1460 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1461 is, if any. */
1465 special_function_kind sfk)
1466 {
1469 /* It is valid to write:
1471 class C { void f(); };
1472 typedef C D;
1473 void D::f();
1475 The standard is not clear about whether `typedef const C D' is
1476 legal; as of 2002-09-15 the committee is considering that
1477 question. EDG 3.0 allows that syntax. Therefore, we do as
1478 well. */
1492 }
1494 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1495 of modifiers such as const or volatile to apply to the pointer
1496 type, represented as identifiers. ATTRIBUTES represent the attributes that
1497 appertain to the pointer or reference. */
1499 cp_declarator *
1501 tree attributes)
1502 {
1510 {
1514 }
1515 else
1521 }
1523 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1524 represent the attributes that appertain to the pointer or
1525 reference. */
1527 cp_declarator *
1530 {
1538 {
1542 }
1543 else
1549 }
1551 /* Like make_pointer_declarator -- but for a pointer to a non-static
1552 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1553 appertain to the pointer or reference. */
1555 cp_declarator *
1558 tree attributes)
1559 {
1568 {
1571 }
1572 else
1578 }
1580 /* Make a declarator for the function given by TARGET, with the
1581 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1582 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1583 indicates what exceptions can be thrown. */
1585 cp_declarator *
1587 tree parms,
1588 cp_cv_quals cv_qualifiers,
1589 cp_virt_specifiers virt_specifiers,
1590 cp_ref_qualifier ref_qualifier,
1591 tree tx_qualifier,
1592 tree exception_specification,
1593 tree late_return_type,
1594 tree requires_clause)
1595 {
1609 {
1613 }
1614 else
1618 }
1620 /* Make a declarator for an array of BOUNDS elements, each of which is
1621 defined by ELEMENT. */
1623 cp_declarator *
1625 {
1632 {
1636 }
1637 else
1641 }
1643 /* Determine whether the declarator we've seen so far can be a
1644 parameter pack, when followed by an ellipsis. */
1645 static bool
1647 {
1649 /* We already saw an ellipsis. */
1652 /* Search for a declarator name, or any other declarator that goes
1653 after the point where the ellipsis could appear in a parameter
1654 pack. If we find any of these, then this declarator can not be
1655 made into a parameter pack. */
1658 {
1660 {
1673 }
1674 }
1677 }
1681 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1682 DECLARATOR and DEFAULT_ARGUMENT. */
1684 cp_parameter_declarator *
1687 tree default_argument,
1688 location_t loc,
1690 {
1698 else
1706 }
1708 /* Returns true iff DECLARATOR is a declaration for a function. */
1710 static bool
1712 {
1714 {
1723 }
1725 }
1727 /* The parser. */
1729 /* Overview
1730 --------
1732 A cp_parser parses the token stream as specified by the C++
1733 grammar. Its job is purely parsing, not semantic analysis. For
1734 example, the parser breaks the token stream into declarators,
1735 expressions, statements, and other similar syntactic constructs.
1736 It does not check that the types of the expressions on either side
1737 of an assignment-statement are compatible, or that a function is
1738 not declared with a parameter of type `void'.
1740 The parser invokes routines elsewhere in the compiler to perform
1741 semantic analysis and to build up the abstract syntax tree for the
1742 code processed.
1744 The parser (and the template instantiation code, which is, in a
1745 way, a close relative of parsing) are the only parts of the
1746 compiler that should be calling push_scope and pop_scope, or
1747 related functions. The parser (and template instantiation code)
1748 keeps track of what scope is presently active; everything else
1749 should simply honor that. (The code that generates static
1750 initializers may also need to set the scope, in order to check
1751 access control correctly when emitting the initializers.)
1753 Methodology
1754 -----------
1756 The parser is of the standard recursive-descent variety. Upcoming
1757 tokens in the token stream are examined in order to determine which
1758 production to use when parsing a non-terminal. Some C++ constructs
1759 require arbitrary look ahead to disambiguate. For example, it is
1760 impossible, in the general case, to tell whether a statement is an
1761 expression or declaration without scanning the entire statement.
1762 Therefore, the parser is capable of "parsing tentatively." When the
1763 parser is not sure what construct comes next, it enters this mode.
1764 Then, while we attempt to parse the construct, the parser queues up
1765 error messages, rather than issuing them immediately, and saves the
1766 tokens it consumes. If the construct is parsed successfully, the
1767 parser "commits", i.e., it issues any queued error messages and
1768 the tokens that were being preserved are permanently discarded.
1769 If, however, the construct is not parsed successfully, the parser
1770 rolls back its state completely so that it can resume parsing using
1771 a different alternative.
1773 Future Improvements
1774 -------------------
1776 The performance of the parser could probably be improved substantially.
1777 We could often eliminate the need to parse tentatively by looking ahead
1778 a little bit. In some places, this approach might not entirely eliminate
1779 the need to parse tentatively, but it might still speed up the average
1780 case. */
1782 /* Flags that are passed to some parsing functions. These values can
1783 be bitwise-ored together. */
1785 enum
1786 {
1787 /* No flags. */
1789 /* The construct is optional. If it is not present, then no error
1790 should be issued. */
1792 /* When parsing a type-specifier, treat user-defined type-names
1793 as non-type identifiers. */
1795 /* When parsing a type-specifier, do not try to parse a class-specifier
1796 or enum-specifier. */
1798 /* When parsing a decl-specifier-seq, only allow type-specifier or
1799 constexpr. */
1801 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1803 };
1805 /* This type is used for parameters and variables which hold
1806 combinations of the above flags. */
1809 /* The different kinds of declarators we want to parse. */
1811 enum cp_parser_declarator_kind
1812 {
1813 /* We want an abstract declarator. */
1814 CP_PARSER_DECLARATOR_ABSTRACT,
1815 /* We want a named declarator. */
1816 CP_PARSER_DECLARATOR_NAMED,
1817 /* We don't mind, but the name must be an unqualified-id. */
1818 CP_PARSER_DECLARATOR_EITHER
1819 };
1821 /* The precedence values used to parse binary expressions. The minimum value
1822 of PREC must be 1, because zero is reserved to quickly discriminate
1823 binary operators from other tokens. */
1825 enum cp_parser_prec
1826 {
1827 PREC_NOT_OPERATOR,
1828 PREC_LOGICAL_OR_EXPRESSION,
1829 PREC_LOGICAL_AND_EXPRESSION,
1830 PREC_INCLUSIVE_OR_EXPRESSION,
1831 PREC_EXCLUSIVE_OR_EXPRESSION,
1832 PREC_AND_EXPRESSION,
1833 PREC_EQUALITY_EXPRESSION,
1834 PREC_RELATIONAL_EXPRESSION,
1835 PREC_SHIFT_EXPRESSION,
1836 PREC_ADDITIVE_EXPRESSION,
1837 PREC_MULTIPLICATIVE_EXPRESSION,
1838 PREC_PM_EXPRESSION,
1839 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1840 };
1842 /* A mapping from a token type to a corresponding tree node type, with a
1843 precedence value. */
1845 struct cp_parser_binary_operations_map_node
1846 {
1847 /* The token type. */
1849 /* The corresponding tree code. */
1851 /* The precedence of this operator. */
1853 };
1855 struct cp_parser_expression_stack_entry
1856 {
1857 /* Left hand side of the binary operation we are currently
1858 parsing. */
1859 cp_expr lhs;
1860 /* Original tree code for left hand side, if it was a binary
1861 expression itself (used for -Wparentheses). */
1863 /* Tree code for the binary operation we are parsing. */
1865 /* Precedence of the binary operation we are parsing. */
1867 /* Location of the binary operation we are parsing. */
1868 location_t loc;
1869 };
1871 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1872 entries because precedence levels on the stack are monotonically
1873 increasing. */
1877 /* Prototypes. */
1879 /* Constructors and destructors. */
1884 /* Class variables. */
1888 /* The operator-precedence table used by cp_parser_binary_expression.
1889 Transformed into an associative array (binops_by_token) by
1890 cp_parser_new. */
1923 };
1925 /* The same as binops, but initialized by cp_parser_new so that
1926 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1927 for speed. */
1930 /* Constructors and destructors. */
1932 /* Construct a new context. The context below this one on the stack
1933 is given by NEXT. */
1937 {
1940 /* Allocate the storage. */
1942 {
1943 /* Pull the first entry from the free list. */
1947 }
1948 else
1951 /* No errors have occurred yet in this context. */
1953 /* If this is not the bottommost context, copy information that we
1954 need from the previous context. */
1956 {
1957 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1958 expression, then we are parsing one in this context, too. */
1960 /* Thread the stack. */
1962 }
1965 }
1967 /* Managing the unparsed function queues. */
1969 #define unparsed_funs_with_default_args \
1970 parser->unparsed_queues->last ().funs_with_default_args
1971 #define unparsed_funs_with_definitions \
1972 parser->unparsed_queues->last ().funs_with_definitions
1973 #define unparsed_nsdmis \
1974 parser->unparsed_queues->last ().nsdmis
1975 #define unparsed_classes \
1976 parser->unparsed_queues->last ().classes
1978 static void
1980 {
1983 }
1985 static void
1987 {
1990 }
1992 /* Prototypes. */
1994 /* Constructors and destructors. */
1999 /* Routines to parse various constructs.
2001 Those that return `tree' will return the error_mark_node (rather
2002 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2003 Sometimes, they will return an ordinary node if error-recovery was
2004 attempted, even though a parse error occurred. So, to check
2005 whether or not a parse error occurred, you should always use
2006 cp_parser_error_occurred. If the construct is optional (indicated
2007 either by an `_opt' in the name of the function that does the
2008 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2009 the construct is not present. */
2011 /* Lexical conventions [gram.lex] */
2013 static cp_expr cp_parser_identifier
2015 static cp_expr cp_parser_string_literal
2017 static cp_expr cp_parser_userdef_char_literal
2019 static tree cp_parser_userdef_string_literal
2021 static cp_expr cp_parser_userdef_numeric_literal
2024 /* Basic concepts [gram.basic] */
2026 static bool cp_parser_translation_unit
2029 /* Expressions [gram.expr] */
2031 static cp_expr cp_parser_primary_expression
2033 static cp_expr cp_parser_id_expression
2035 static cp_expr cp_parser_unqualified_id
2037 static tree cp_parser_nested_name_specifier_opt
2039 static tree cp_parser_nested_name_specifier
2041 static tree cp_parser_qualifying_entity
2043 static cp_expr cp_parser_postfix_expression
2045 static tree cp_parser_postfix_open_square_expression
2047 static tree cp_parser_postfix_dot_deref_expression
2052 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2054 static void cp_parser_pseudo_destructor_name
2056 static cp_expr cp_parser_unary_expression
2058 static enum tree_code cp_parser_unary_operator
2060 static tree cp_parser_new_expression
2064 static tree cp_parser_new_type_id
2072 static tree cp_parser_delete_expression
2074 static cp_expr cp_parser_cast_expression
2076 static cp_expr cp_parser_binary_expression
2078 static tree cp_parser_question_colon_clause
2080 static cp_expr cp_parser_assignment_expression
2082 static enum tree_code cp_parser_assignment_operator_opt
2084 static cp_expr cp_parser_expression
2086 static cp_expr cp_parser_constant_expression
2088 static cp_expr cp_parser_builtin_offsetof
2090 static cp_expr cp_parser_lambda_expression
2092 static void cp_parser_lambda_introducer
2094 static bool cp_parser_lambda_declarator_opt
2096 static void cp_parser_lambda_body
2099 /* Statements [gram.stmt.stmt] */
2101 static void cp_parser_statement
2103 static void cp_parser_label_for_labeled_statement
2105 static tree cp_parser_expression_statement
2107 static tree cp_parser_compound_statement
2109 static void cp_parser_statement_seq_opt
2111 static tree cp_parser_selection_statement
2113 static tree cp_parser_condition
2115 static tree cp_parser_iteration_statement
2117 static bool cp_parser_init_statement
2119 static tree cp_parser_for
2121 static tree cp_parser_c_for
2123 static tree cp_parser_range_for
2125 static void do_range_for_auto_deduction
2127 static tree cp_parser_perform_range_for_lookup
2129 static tree cp_parser_range_for_member_function
2131 static tree cp_parser_jump_statement
2133 static void cp_parser_declaration_statement
2136 static tree cp_parser_implicitly_scoped_statement
2138 static void cp_parser_already_scoped_statement
2141 /* Declarations [gram.dcl.dcl] */
2143 static void cp_parser_declaration_seq_opt
2145 static void cp_parser_declaration
2147 static void cp_parser_block_declaration
2149 static void cp_parser_simple_declaration
2151 static void cp_parser_decl_specifier_seq
2153 static tree cp_parser_storage_class_specifier_opt
2155 static tree cp_parser_function_specifier_opt
2157 static tree cp_parser_type_specifier
2160 static tree cp_parser_simple_type_specifier
2162 static tree cp_parser_type_name
2164 static tree cp_parser_type_name
2166 static tree cp_parser_nonclass_name
2168 static tree cp_parser_elaborated_type_specifier
2170 static tree cp_parser_enum_specifier
2172 static void cp_parser_enumerator_list
2174 static void cp_parser_enumerator_definition
2176 static tree cp_parser_namespace_name
2178 static void cp_parser_namespace_definition
2180 static void cp_parser_namespace_body
2182 static tree cp_parser_qualified_namespace_specifier
2184 static void cp_parser_namespace_alias_definition
2186 static bool cp_parser_using_declaration
2188 static void cp_parser_using_directive
2190 static tree cp_parser_alias_declaration
2192 static void cp_parser_asm_definition
2194 static void cp_parser_linkage_specification
2196 static void cp_parser_static_assert
2198 static tree cp_parser_decltype
2200 static tree cp_parser_decomposition_declaration
2203 /* Declarators [gram.dcl.decl] */
2205 static tree cp_parser_init_declarator
2212 static enum tree_code cp_parser_ptr_operator
2214 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2216 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2218 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2220 static tree cp_parser_tx_qualifier_opt
2222 static tree cp_parser_late_return_type_opt
2224 static tree cp_parser_declarator_id
2226 static tree cp_parser_type_id
2228 static tree cp_parser_template_type_arg
2231 static tree cp_parser_type_id_1
2233 static void cp_parser_type_specifier_seq
2235 static tree cp_parser_parameter_declaration_clause
2237 static tree cp_parser_parameter_declaration_list
2241 static tree cp_parser_default_argument
2243 static void cp_parser_function_body
2245 static tree cp_parser_initializer
2247 static cp_expr cp_parser_initializer_clause
2249 static cp_expr cp_parser_braced_list
2254 static void cp_parser_ctor_initializer_opt_and_function_body
2257 static tree cp_parser_late_parsing_omp_declare_simd
2260 static tree cp_parser_late_parsing_oacc_routine
2263 static tree synthesize_implicit_template_parm
2265 static tree finish_fully_implicit_template
2267 static void abort_fully_implicit_template
2270 /* Classes [gram.class] */
2272 static tree cp_parser_class_name
2274 static tree cp_parser_class_specifier
2276 static tree cp_parser_class_head
2278 static enum tag_types cp_parser_class_key
2280 static void cp_parser_type_parameter_key
2282 static void cp_parser_member_specification_opt
2284 static void cp_parser_member_declaration
2286 static tree cp_parser_pure_specifier
2288 static tree cp_parser_constant_initializer
2291 /* Derived classes [gram.class.derived] */
2293 static tree cp_parser_base_clause
2295 static tree cp_parser_base_specifier
2298 /* Special member functions [gram.special] */
2300 static tree cp_parser_conversion_function_id
2302 static tree cp_parser_conversion_type_id
2306 static void cp_parser_ctor_initializer_opt
2308 static void cp_parser_mem_initializer_list
2310 static tree cp_parser_mem_initializer
2312 static tree cp_parser_mem_initializer_id
2315 /* Overloading [gram.over] */
2317 static cp_expr cp_parser_operator_function_id
2319 static cp_expr cp_parser_operator
2322 /* Templates [gram.temp] */
2324 static void cp_parser_template_declaration
2326 static tree cp_parser_template_parameter_list
2328 static tree cp_parser_template_parameter
2330 static tree cp_parser_type_parameter
2332 static tree cp_parser_template_id
2334 static tree cp_parser_template_name
2336 static tree cp_parser_template_argument_list
2338 static tree cp_parser_template_argument
2340 static void cp_parser_explicit_instantiation
2342 static void cp_parser_explicit_specialization
2345 /* Exception handling [gram.exception] */
2347 static tree cp_parser_try_block
2349 static void cp_parser_function_try_block
2351 static void cp_parser_handler_seq
2353 static void cp_parser_handler
2355 static tree cp_parser_exception_declaration
2357 static tree cp_parser_throw_expression
2359 static tree cp_parser_exception_specification_opt
2361 static tree cp_parser_type_id_list
2364 /* GNU Extensions */
2366 static tree cp_parser_asm_specification_opt
2368 static tree cp_parser_asm_operand_list
2370 static tree cp_parser_asm_clobber_list
2372 static tree cp_parser_asm_label_list
2374 static bool cp_next_tokens_can_be_attribute_p
2376 static bool cp_next_tokens_can_be_gnu_attribute_p
2378 static bool cp_next_tokens_can_be_std_attribute_p
2380 static bool cp_nth_tokens_can_be_std_attribute_p
2382 static bool cp_nth_tokens_can_be_gnu_attribute_p
2384 static bool cp_nth_tokens_can_be_attribute_p
2386 static tree cp_parser_attributes_opt
2388 static tree cp_parser_gnu_attributes_opt
2390 static tree cp_parser_gnu_attribute_list
2392 static tree cp_parser_std_attribute
2394 static tree cp_parser_std_attribute_spec
2396 static tree cp_parser_std_attribute_spec_seq
2398 static size_t cp_parser_skip_attributes_opt
2400 static bool cp_parser_extension_opt
2402 static void cp_parser_label_declaration
2405 /* Concept Extensions */
2407 static tree cp_parser_requires_clause
2409 static tree cp_parser_requires_clause_opt
2411 static tree cp_parser_requires_expression
2413 static tree cp_parser_requirement_parameter_list
2415 static tree cp_parser_requirement_body
2417 static tree cp_parser_requirement_list
2419 static tree cp_parser_requirement
2421 static tree cp_parser_simple_requirement
2423 static tree cp_parser_compound_requirement
2425 static tree cp_parser_type_requirement
2427 static tree cp_parser_nested_requirement
2430 /* Transactional Memory Extensions */
2432 static tree cp_parser_transaction
2434 static tree cp_parser_transaction_expression
2436 static void cp_parser_function_transaction
2438 static tree cp_parser_transaction_cancel
2442 pragma_external,
2443 pragma_member,
2444 pragma_objc_icode,
2445 pragma_stmt,
2446 pragma_compound
2447 };
2448 static bool cp_parser_pragma
2451 /* Objective-C++ Productions */
2453 static tree cp_parser_objc_message_receiver
2455 static tree cp_parser_objc_message_args
2457 static tree cp_parser_objc_message_expression
2459 static cp_expr cp_parser_objc_encode_expression
2461 static tree cp_parser_objc_defs_expression
2463 static tree cp_parser_objc_protocol_expression
2465 static tree cp_parser_objc_selector_expression
2467 static cp_expr cp_parser_objc_expression
2469 static bool cp_parser_objc_selector_p
2471 static tree cp_parser_objc_selector
2473 static tree cp_parser_objc_protocol_refs_opt
2475 static void cp_parser_objc_declaration
2477 static tree cp_parser_objc_statement
2479 static bool cp_parser_objc_valid_prefix_attributes
2481 static void cp_parser_objc_at_property_declaration
2483 static void cp_parser_objc_at_synthesize_declaration
2485 static void cp_parser_objc_at_dynamic_declaration
2487 static tree cp_parser_objc_struct_declaration
2490 /* Utility Routines */
2492 static cp_expr cp_parser_lookup_name
2494 static tree cp_parser_lookup_name_simple
2496 static tree cp_parser_maybe_treat_template_as_class
2498 static bool cp_parser_check_declarator_template_parameters
2500 static bool cp_parser_check_template_parameters
2502 static cp_expr cp_parser_simple_cast_expression
2504 static tree cp_parser_global_scope_opt
2506 static bool cp_parser_constructor_declarator_p
2508 static tree cp_parser_function_definition_from_specifiers_and_declarator
2510 static tree cp_parser_function_definition_after_declarator
2512 static bool cp_parser_template_declaration_after_export
2514 static void cp_parser_perform_template_parameter_access_checks
2516 static tree cp_parser_single_declaration
2518 static cp_expr cp_parser_functional_cast
2520 static tree cp_parser_save_member_function_body
2522 static tree cp_parser_save_nsdmi
2524 static tree cp_parser_enclosed_template_argument_list
2526 static void cp_parser_save_default_args
2528 static void cp_parser_late_parsing_for_member
2530 static tree cp_parser_late_parse_one_default_arg
2532 static void cp_parser_late_parsing_nsdmi
2534 static void cp_parser_late_parsing_default_args
2536 static tree cp_parser_sizeof_operand
2538 static cp_expr cp_parser_trait_expr
2540 static bool cp_parser_declares_only_class_p
2542 static void cp_parser_set_storage_class
2544 static void cp_parser_set_decl_spec_type
2546 static void set_and_check_decl_spec_loc
2549 static bool cp_parser_friend_p
2551 static void cp_parser_required_error
2557 static bool cp_parser_token_starts_function_definition_p
2559 static bool cp_parser_next_token_starts_class_definition_p
2561 static bool cp_parser_next_token_ends_template_argument_p
2563 static bool cp_parser_nth_token_starts_template_argument_list_p
2565 static enum tag_types cp_parser_token_is_class_key
2567 static enum tag_types cp_parser_token_is_type_parameter_key
2569 static void cp_parser_check_class_key
2571 static void cp_parser_check_access_in_redeclaration
2573 static bool cp_parser_optional_template_keyword
2575 static void cp_parser_pre_parsed_nested_name_specifier
2577 static bool cp_parser_cache_group
2579 static tree cp_parser_cache_defarg
2581 static void cp_parser_parse_tentatively
2583 static void cp_parser_commit_to_tentative_parse
2585 static void cp_parser_commit_to_topmost_tentative_parse
2587 static void cp_parser_abort_tentative_parse
2589 static bool cp_parser_parse_definitely
2593 static bool cp_parser_uncommitted_to_tentative_parse_p
2595 static void cp_parser_error
2597 static void cp_parser_name_lookup_error
2599 static bool cp_parser_simulate_error
2601 static bool cp_parser_check_type_definition
2603 static void cp_parser_check_for_definition_in_return_type
2605 static void cp_parser_check_for_invalid_template_id
2607 static bool cp_parser_non_integral_constant_expression
2609 static void cp_parser_diagnose_invalid_type_name
2611 static bool cp_parser_parse_and_diagnose_invalid_type_name
2613 static int cp_parser_skip_to_closing_parenthesis
2615 static void cp_parser_skip_to_end_of_statement
2617 static void cp_parser_consume_semicolon_at_end_of_statement
2619 static void cp_parser_skip_to_end_of_block_or_statement
2621 static bool cp_parser_skip_to_closing_brace
2623 static void cp_parser_skip_to_end_of_template_parameter_list
2625 static void cp_parser_skip_to_pragma_eol
2627 static bool cp_parser_error_occurred
2629 static bool cp_parser_allow_gnu_extensions_p
2631 static bool cp_parser_is_pure_string_literal
2633 static bool cp_parser_is_string_literal
2635 static bool cp_parser_is_keyword
2637 static tree cp_parser_make_typename_type
2641 static bool cp_parser_compound_literal_p
2643 static bool cp_parser_array_designator_p
2645 static bool cp_parser_init_statement_p
2647 static bool cp_parser_skip_to_closing_square_bracket
2650 /* Concept-related syntactic transformations */
2655 // -------------------------------------------------------------------------- //
2656 // Unevaluated Operand Guard
2657 //
2658 // Implementation of an RAII helper for unevaluated operand parsing.
2660 {
2663 }
2666 {
2669 }
2671 // -------------------------------------------------------------------------- //
2672 // Tentative Parsing
2674 /* Returns nonzero if we are parsing tentatively. */
2678 {
2680 }
2682 /* Returns nonzero if TOKEN is a string literal. */
2684 static bool
2686 {
2692 }
2694 /* Returns nonzero if TOKEN is a string literal
2695 of a user-defined string literal. */
2697 static bool
2699 {
2706 }
2708 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2710 static bool
2712 {
2714 }
2716 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2717 PRAGMA_NONE. */
2719 static enum pragma_kind
2721 {
2724 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2726 }
2728 /* Helper function for cp_parser_error.
2729 Having peeked a token of kind TOK1_KIND that might signify
2730 a conflict marker, peek successor tokens to determine
2731 if we actually do have a conflict marker.
2732 Specifically, we consider a run of 7 '<', '=' or '>' characters
2733 at the start of a line as a conflict marker.
2734 These come through the lexer as three pairs and a single,
2735 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2736 If it returns true, *OUT_LOC is written to with the location/range
2737 of the marker. */
2739 static bool
2742 {
2753 /* It must be at the start of the line. */
2758 /* We have a conflict marker. Construct a location of the form:
2759 <<<<<<<
2760 ^~~~~~~
2761 with start == caret, finishing at the end of the marker. */
2766 }
2768 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2769 RT_CLOSE_PAREN. */
2773 {
2775 {
2783 }
2784 }
2786 /* Attempt to convert TOKEN_DESC from a required_token to an
2787 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2789 static enum cpp_ttype
2791 {
2793 {
2814 /* Use CPP_EOF as a "no completions possible" code. */
2816 }
2817 }
2820 /* Subroutine of cp_parser_error and cp_parser_required_error.
2822 Issue a diagnostic of the form
2823 FILE:LINE: MESSAGE before TOKEN
2824 where TOKEN is the next token in the input stream. MESSAGE
2825 (specified by the caller) is usually of the form "expected
2826 OTHER-TOKEN".
2828 This bypasses the check for tentative passing, and potentially
2829 adds material needed by cp_parser_required_error.
2831 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2832 suggesting insertion of the missing token.
2834 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2835 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2836 location. */
2838 static void
2840 required_token missing_token_desc,
2841 location_t matching_location)
2842 {
2844 /* This diagnostic makes more sense if it is tagged to the line
2845 of the token we just peeked at. */
2849 {
2854 }
2856 /* If this is actually a conflict marker, report it as such. */
2860 {
2861 location_t loc;
2863 {
2866 /* Consume tokens until the end of the source line. */
2868 {
2878 }
2880 }
2881 }
2888 {
2889 /* Potentially supply a fix-it hint, suggesting to add the
2890 missing token immediately after the *previous* token.
2891 This may move the primary location within richloc. */
2893 location_t prev_token_loc
2897 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2898 Attempt to consolidate diagnostics by printing it as a
2899 secondary range within the main diagnostic. */
2901 added_matching_location
2903 }
2905 /* Actually emit the error. */
2907 /* Because c_parser_error does not understand
2908 CPP_KEYWORD, keywords are treated like
2909 identifiers. */
2914 {
2915 /* If we weren't able to consolidate matching_location, then
2916 print it as a secondary diagnostic. */
2921 }
2922 }
2924 /* If not parsing tentatively, issue a diagnostic of the form
2925 FILE:LINE: MESSAGE before TOKEN
2926 where TOKEN is the next token in the input stream. MESSAGE
2927 (specified by the caller) is usually of the form "expected
2928 OTHER-TOKEN". */
2930 static void
2932 {
2935 }
2937 /* Issue an error about name-lookup failing. NAME is the
2938 IDENTIFIER_NODE DECL is the result of
2939 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2940 the thing that we hoped to find. */
2942 static void
2944 tree name,
2945 tree decl,
2946 name_lookup_error desired,
2947 location_t location)
2948 {
2949 /* If name lookup completely failed, tell the user that NAME was not
2950 declared. */
2952 {
2965 else
2967 }
2969 {
2971 {
2988 }
2989 }
2991 {
2993 {
3003 name);
3007 }
3008 }
3009 else
3010 {
3012 {
3025 }
3026 }
3027 }
3029 /* If we are parsing tentatively, remember that an error has occurred
3030 during this tentative parse. Returns true if the error was
3031 simulated; false if a message should be issued by the caller. */
3033 static bool
3035 {
3037 {
3040 }
3042 }
3044 /* This function is called when a type is defined. If type
3045 definitions are forbidden at this point, an error message is
3046 issued. */
3048 static bool
3050 {
3051 /* If types are forbidden here, issue a message. */
3053 {
3054 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3055 in the message need to be interpreted. */
3058 }
3060 }
3062 /* This function is called when the DECLARATOR is processed. The TYPE
3063 was a type defined in the decl-specifiers. If it is invalid to
3064 define a type in the decl-specifiers for DECLARATOR, an error is
3065 issued. TYPE_LOCATION is the location of TYPE and is used
3066 for error reporting. */
3068 static void
3071 {
3072 /* [dcl.fct] forbids type definitions in return types.
3073 Unfortunately, it's not easy to know whether or not we are
3074 processing a return type until after the fact. */
3082 {
3087 type);
3088 }
3089 }
3091 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3092 "<" in any valid C++ program. If the next token is indeed "<",
3093 issue a message warning the user about what appears to be an
3094 invalid attempt to form a template-id. LOCATION is the location
3095 of the type-specifier (TYPE) */
3097 static void
3099 tree type,
3101 location_t location)
3102 {
3106 {
3112 {
3115 else
3117 }
3118 else
3120 /* Remember the location of the invalid "<". */
3123 /* Consume the "<". */
3125 /* Parse the template arguments. */
3127 /* Permanently remove the invalid template arguments so that
3128 this error message is not issued again. */
3131 }
3132 }
3134 /* If parsing an integral constant-expression, issue an error message
3135 about the fact that THING appeared and return true. Otherwise,
3136 return false. In either case, set
3137 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3139 static bool
3141 non_integral_constant thing)
3142 {
3145 {
3147 {
3150 {
3153 "ISO C++ forbids using a floating-point literal "
3158 "enumeration type cannot appear in a "
3249 }
3253 }
3254 }
3256 }
3258 /* Emit a diagnostic for an invalid type name. This function commits
3259 to the current active tentative parse, if any. (Otherwise, the
3260 problematic construct might be encountered again later, resulting
3261 in duplicate error messages.) LOCATION is the location of ID. */
3263 static void
3265 location_t location)
3266 {
3269 /* Try to lookup the identifier. */
3276 /* If the lookup was ambiguous, an error will already have
3277 been issued. */
3279 /* If the lookup found a template-name, it means that the user forgot
3280 to specify an argument list. Emit a useful error message. */
3282 {
3285 decl);
3290 }
3294 /* Something like 'unsigned A a;' */
3297 {
3298 /* Issue an error message. */
3299 name_hint hint;
3303 {
3309 }
3310 else
3312 /* If we're in a template class, it's possible that the user was
3313 referring to a type from a base class. For example:
3315 template <typename T> struct A { typedef T X; };
3316 template <typename T> struct B : public A<T> { X x; };
3318 The user should have said "typename A<T>::X". */
3334 {
3335 tree b;
3338 b;
3340 {
3344 {
3345 tree field;
3346 /* Go from a particular instantiation of the
3347 template (which will have an empty TYPE_FIELDs),
3348 to the main version. */
3351 field;
3355 {
3360 }
3363 }
3364 }
3365 }
3366 }
3367 /* Here we diagnose qualified-ids where the scope is actually correct,
3368 but the identifier does not resolve to a valid type name. */
3370 {
3372 {
3381 else
3390 }
3393 {
3394 /* A<T>::A<T>() */
3400 }
3403 {
3406 "need %<typename%> before %<%T::%D::%E%> because "
3410 id,
3413 else
3417 }
3419 {
3431 else
3437 }
3438 else
3440 }
3441 }
3443 /* Check for a common situation where a type-name should be present,
3444 but is not, and issue a sensible error message. Returns true if an
3445 invalid type-name was detected.
3447 The situation handled by this function are variable declarations of the
3448 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3449 Usually, `ID' should name a type, but if we got here it means that it
3450 does not. We try to emit the best possible error message depending on
3451 how exactly the id-expression looks like. */
3453 static bool
3455 {
3456 tree id;
3459 /* Avoid duplicate error about ambiguous lookup. */
3461 {
3465 }
3474 /* If the next token is a (, this is a function with no explicit return
3475 type, i.e. constructor, destructor or conversion op. */
3478 {
3481 }
3485 /* Emit a diagnostic for the invalid type. */
3487 out:
3488 /* If we aren't in the middle of a declarator (i.e. in a
3489 parameter-declaration-clause), skip to the end of the declaration;
3490 there's no point in trying to process it. */
3494 }
3496 /* Consume tokens up to, and including, the next non-nested closing `)'.
3497 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3498 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3499 found an unnested token of that type. */
3501 static int
3504 cpp_ttype or_ttype,
3506 {
3517 {
3520 /* Have we found what we're looking for before the closing paren? */
3526 {
3529 /* If we've run out of tokens, then there is no closing `)'. */
3532 /* This is good for lambda expression capture-lists. */
3542 /* This matches the processing in skip_to_end_of_statement. */
3562 {
3566 }
3576 condop_depth--;
3581 }
3583 /* Consume the token. */
3585 }
3586 }
3588 /* Consume tokens up to, and including, the next non-nested closing `)'.
3589 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3590 are doing error recovery. Returns -1 if OR_COMMA is true and we
3591 found an unnested token of that type. */
3593 static int
3598 {
3602 }
3604 /* Consume tokens until we reach the end of the current statement.
3605 Normally, that will be just before consuming a `;'. However, if a
3606 non-nested `}' comes first, then we stop before consuming that. */
3608 static void
3610 {
3613 /* Unwind generic function template scope if necessary. */
3618 {
3622 {
3625 /* If we've run out of tokens, stop. */
3629 /* If the next token is a `;', we have reached the end of the
3630 statement. */
3636 /* If this is a non-nested '}', stop before consuming it.
3637 That way, when confronted with something like:
3639 { 3 + }
3641 we stop before consuming the closing '}', even though we
3642 have not yet reached a `;'. */
3646 /* If it is the closing '}' for a block that we have
3647 scanned, stop -- but only after consuming the token.
3648 That way given:
3650 void f g () { ... }
3651 typedef int I;
3653 we will stop after the body of the erroneously declared
3654 function, but before consuming the following `typedef'
3655 declaration. */
3657 {
3660 }
3669 }
3671 /* Consume the token. */
3673 }
3674 }
3676 /* This function is called at the end of a statement or declaration.
3677 If the next token is a semicolon, it is consumed; otherwise, error
3678 recovery is attempted. */
3680 static void
3682 {
3683 /* Look for the trailing `;'. */
3685 {
3686 /* If there is additional (erroneous) input, skip to the end of
3687 the statement. */
3689 /* If the next token is now a `;', consume it. */
3692 }
3693 }
3695 /* Skip tokens until we have consumed an entire block, or until we
3696 have consumed a non-nested `;'. */
3698 static void
3700 {
3703 /* Unwind generic function template scope if necessary. */
3708 {
3712 {
3715 /* If we've run out of tokens, stop. */
3719 /* Stop if this is an unnested ';'. */
3725 /* Stop if this is an unnested '}', or closes the outermost
3726 nesting level. */
3727 nesting_depth--;
3735 /* Nest. */
3736 nesting_depth++;
3741 }
3743 /* Consume the token. */
3745 }
3746 }
3748 /* Skip tokens until a non-nested closing curly brace is the next
3749 token, or there are no more tokens. Return true in the first case,
3750 false otherwise. */
3752 static bool
3754 {
3758 {
3762 {
3765 /* If we've run out of tokens, stop. */
3769 /* If the next token is a non-nested `}', then we have reached
3770 the end of the current block. */
3776 /* If it the next token is a `{', then we are entering a new
3777 block. Consume the entire block. */
3783 }
3785 /* Consume the token. */
3787 }
3788 }
3790 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3791 parameter is the PRAGMA token, allowing us to purge the entire pragma
3792 sequence. */
3794 static void
3796 {
3801 do
3805 /* Ensure that the pragma is not parsed again. */
3807 }
3809 /* Require pragma end of line, resyncing with it as necessary. The
3810 arguments are as for cp_parser_skip_to_pragma_eol. */
3812 static void
3814 {
3818 }
3820 /* This is a simple wrapper around make_typename_type. When the id is
3821 an unresolved identifier node, we can provide a superior diagnostic
3822 using cp_parser_diagnose_invalid_type_name. */
3824 static tree
3826 location_t id_location)
3827 {
3828 tree result;
3830 {
3836 }
3838 }
3840 /* This is a wrapper around the
3841 make_{pointer,ptrmem,reference}_declarator functions that decides
3842 which one to call based on the CODE and CLASS_TYPE arguments. The
3843 CODE argument should be one of the values returned by
3844 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3845 appertain to the pointer or reference. */
3849 cp_cv_quals cv_qualifiers,
3851 tree attributes)
3852 {
3859 else
3869 }
3871 /* Create a new C++ parser. */
3875 {
3880 /* cp_lexer_new_main is called before doing GC allocation because
3881 cp_lexer_new_main might load a PCH file. */
3884 /* Initialize the binops_by_token so that we can get the tree
3885 directly from the token. */
3893 /* For now, we always accept GNU extensions. */
3896 /* The `>' token is a greater-than operator, not the end of a
3897 template-id. */
3902 /* We are not parsing a constant-expression. */
3907 /* Local variable names are not forbidden. */
3910 /* We are not processing an `extern "C"' declaration. */
3913 /* We are not processing a declarator. */
3916 /* We are not processing a template-argument-list. */
3919 /* We are not in an iteration statement. */
3922 /* We are not in a switch statement. */
3925 /* We are not parsing a type-id inside an expression. */
3928 /* Declarations aren't implicitly extern "C". */
3931 /* String literals should be translated to the execution character set. */
3934 /* We are not parsing a function body. */
3937 /* We can correct until told otherwise. */
3940 /* The unparsed function queue is empty. */
3943 /* There are no classes being defined. */
3946 /* No template parameters apply. */
3949 /* Special parsing data structures. */
3953 /* Not declaring an implicit function template. */
3959 /* Allow constrained-type-specifiers. */
3962 /* We haven't yet seen an 'extern "C"'. */
3966 }
3968 /* Create a cp_lexer structure which will emit the tokens in CACHE
3969 and push it onto the parser's lexer stack. This is used for delayed
3970 parsing of in-class method bodies and default arguments, and should
3971 not be confused with tentative parsing. */
3972 static void
3974 {
3979 /* Move the current source position to that of the first token in the
3980 new lexer. */
3982 }
3984 /* Pop the top lexer off the parser stack. This is never used for the
3985 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3986 static void
3988 {
3993 /* Put the current source position back where it was before this
3994 lexer was pushed. */
3996 }
3998 /* Lexical conventions [gram.lex] */
4000 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4001 identifier. */
4003 static cp_expr
4005 {
4008 /* Look for the identifier. */
4010 /* Return the value. */
4013 else
4015 }
4017 /* Parse a sequence of adjacent string constants. Returns a
4018 TREE_STRING representing the combined, nul-terminated string
4019 constant. If TRANSLATE is true, translate the string to the
4020 execution character set. If WIDE_OK is true, a wide string is
4021 invalid here.
4023 C++98 [lex.string] says that if a narrow string literal token is
4024 adjacent to a wide string literal token, the behavior is undefined.
4025 However, C99 6.4.5p4 says that this results in a wide string literal.
4026 We follow C99 here, for consistency with the C front end.
4028 This code is largely lifted from lex_string() in c-lex.c.
4030 FUTURE: ObjC++ will need to handle @-strings here. */
4031 static cp_expr
4034 {
4035 tree value;
4042 tree string_tree;
4048 {
4051 }
4056 {
4060 }
4061 else
4062 {
4065 }
4068 /* Try to avoid the overhead of creating and destroying an obstack
4069 for the common case of just one string. */
4072 {
4080 {
4084 }
4085 else
4089 }
4090 else
4091 {
4096 do
4097 {
4099 count++;
4104 {
4107 {
4110 }
4113 {
4118 }
4120 }
4121 else
4125 {
4129 {
4133 "unsupported non-standard concatenation "
4135 }
4136 }
4144 {
4148 }
4149 else
4150 {
4154 }
4155 }
4158 /* A string literal built by concatenation has its caret=start at
4159 the start of the initial string, and its finish at the finish of
4160 the final string literal. */
4164 }
4167 {
4170 }
4174 {
4179 {
4194 }
4199 {
4204 else
4206 }
4207 }
4208 else
4209 /* cpp_interpret_string has issued an error. */
4216 }
4218 /* Look up a literal operator with the name and the exact arguments. */
4220 static tree
4222 {
4223 tree decl;
4229 {
4235 {
4238 {
4248 }
4251 /* May be this should be sufficient_parms_p instead,
4252 depending on how exactly should user-defined literals
4253 work in presence of default arguments on the literal
4254 operator parameters. */
4257 }
4258 }
4261 }
4263 /* Parse a user-defined char constant. Returns a call to a user-defined
4264 literal operator taking the character as an argument. */
4266 static cp_expr
4268 {
4276 /* Build up a call to the user-defined operator */
4277 /* Lookup the name we got back from the id-expression. */
4282 {
4287 }
4291 }
4293 /* A subroutine of cp_parser_userdef_numeric_literal to
4294 create a char... template parameter pack from a string node. */
4296 static tree
4298 {
4299 tree charvec;
4305 /* Fill in CHARVEC with all of the parameters. */
4308 {
4317 }
4319 /* Build the argument packs. */
4325 }
4327 /* A subroutine of cp_parser_userdef_numeric_literal to
4328 create a char... template parameter pack from a string node. */
4330 static tree
4332 {
4333 tree charvec;
4344 /* First template parm is character type. */
4347 /* Fill in CHARVEC with all of the parameters. */
4354 /* Build the argument packs. */
4360 }
4362 /* Parse a user-defined numeric constant. returns a call to a user-defined
4363 literal operator. */
4365 static cp_expr
4367 {
4378 /* Look for a literal operator taking the exact type of numeric argument
4379 as the literal value. */
4384 {
4386 tf_warning_or_error);
4389 {
4392 long_long_unsigned_type_node);
4393 }
4394 else
4395 {
4399 long_double_type_node);
4403 }
4407 }
4410 /* If the numeric argument didn't work, look for a raw literal
4411 operator taking a const char* argument consisting of the number
4412 in string format. */
4417 {
4419 tf_warning_or_error);
4422 }
4425 /* If the raw literal didn't work, look for a non-type template
4426 function with parameter pack char.... Call the function with
4427 template parameter characters representing the number. */
4431 {
4434 {
4436 num_string);
4438 }
4441 tf_warning_or_error);
4444 }
4448 /* In C++14 the standard library defines complex number suffixes that
4449 conflict with GNU extensions. Prefer them if <complex> is #included. */
4459 {
4464 {
4465 /* No <complex>, so pedwarn and use GNU semantics. */
4468 }
4469 }
4471 bool complained
4478 {
4480 "(from <complex>) to enable the C++14 user-defined literal "
4485 }
4492 else
4493 {
4494 /* Use the built-in semantics. */
4495 tree type;
4497 {
4500 else
4502 }
4511 }
4514 /* Avoid repeated diagnostics. */
4517 }
4519 /* Parse a user-defined string constant. Returns a call to a user-defined
4520 literal operator taking a character pointer and the length of the string
4521 as arguments. */
4523 static tree
4525 {
4534 /* Build up a call to the user-defined operator. */
4535 /* Lookup the name we got back from the id-expression. */
4542 {
4544 tf_warning_or_error);
4547 }
4550 /* Look for a template function with typename parameter CharT
4551 and parameter pack CharT... Call the function with
4552 template parameter characters representing the string. */
4556 {
4560 tf_warning_or_error);
4563 }
4569 }
4572 /* Basic concepts [gram.basic] */
4574 /* Parse a translation-unit.
4576 translation-unit:
4577 declaration-seq [opt]
4579 Returns TRUE if all went well. */
4581 static bool
4583 {
4584 /* The address of the first non-permanent object on the declarator
4585 obstack. */
4590 /* Create the declarator obstack, if necessary. */
4592 {
4594 /* Create the error declarator. */
4596 /* Create the empty parameter list. */
4598 UNKNOWN_LOCATION);
4599 /* Remember where the base of the declarator obstack lies. */
4601 }
4605 /* If there are no tokens left then all went well. */
4607 {
4608 /* Get rid of the token array; we don't need it any more. */
4612 /* This file might have been a context that's implicitly extern
4613 "C". If so, pop the lang context. (Only relevant for PCH.) */
4615 {
4618 }
4620 /* Finish up. */
4624 }
4625 else
4626 {
4629 }
4631 /* Make sure the declarator obstack was fully cleaned up. */
4635 /* All went well. */
4637 }
4639 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4640 decltype context. */
4644 {
4649 }
4651 /* We're about to parse a collection of statements. If we're currently
4652 parsing tentatively, set up a firewall so that any nested
4653 cp_parser_commit_to_tentative_parse won't affect the current context. */
4655 static cp_token_position
4657 {
4664 }
4666 /* We've finished parsing the collection of statements. Wrap up the
4667 firewall and replace the relevant tokens with the parsed form. */
4669 static void
4671 tree expr)
4672 {
4676 /* Finish the firewall level. */
4678 /* And remember the result of the parse for when we try again. */
4684 }
4686 /* Like the above functions, but let the user modify the tokens. Used by
4687 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4688 later parses, so it makes sense to localize the effects of
4689 cp_parser_commit_to_tentative_parse. */
4691 struct tentative_firewall
4692 {
4697 {
4698 /* If we're currently parsing tentatively, start a committed level as a
4699 firewall and then an inner tentative parse. */
4701 {
4705 }
4706 }
4709 {
4711 {
4712 /* Finish the inner tentative parse and the firewall, propagating any
4713 uncommitted error state to the outer tentative parse. */
4719 }
4720 }
4721 };
4723 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4724 This class is for tracking such a matching pair of symbols.
4725 In particular, it tracks the location of the first token,
4726 so that if the second token is missing, we can highlight the
4727 location of the first token when notifying the user about the
4728 problem. */
4731 class token_pair
4732 {
4734 /* token_pair's ctor. */
4737 /* If the next token is the opening symbol for this pair, consume it and
4738 return true.
4739 Otherwise, issue an error and return false.
4740 In either case, record the location of the opening token. */
4743 {
4747 }
4749 /* Consume the next token from PARSER, recording its location as
4750 that of the opening token within the pair. */
4753 {
4758 }
4760 /* If the next token is the closing symbol for this pair, consume it
4761 and return it.
4762 Otherwise, issue an error, highlighting the location of the
4763 corresponding opening token, and return NULL. */
4766 {
4769 m_open_loc);
4770 }
4773 location_t m_open_loc;
4774 };
4776 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4778 struct matching_paren_traits
4779 {
4784 };
4786 /* "matching_parens" is a token_pair<T> class for tracking matching
4787 pairs of parentheses. */
4791 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4793 struct matching_brace_traits
4794 {
4799 };
4801 /* "matching_braces" is a token_pair<T> class for tracking matching
4802 pairs of braces. */
4807 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4808 enclosing parentheses. */
4810 static cp_expr
4812 {
4815 /* Consume the '('. */
4817 matching_parens parens;
4819 /* Start the statement-expression. */
4821 /* Parse the compound-statement. */
4823 /* Finish up. */
4825 /* Consume the ')'. */
4833 }
4835 /* Expressions [gram.expr] */
4837 /* Parse a fold-operator.
4839 fold-operator:
4840 - * / % ^ & | = < > << >>
4841 = -= *= /= %= ^= &= |= <<= >>=
4842 == != <= >= && || , .* ->*
4844 This returns the tree code corresponding to the matched operator
4845 as an int. When the current token matches a compound assignment
4846 opertor, the resulting tree code is the negative value of the
4847 non-assignment operator. */
4849 static int
4851 {
4853 {
4893 }
4894 }
4896 /* Returns true if CODE indicates a binary expression, which is not allowed in
4897 the LHS of a fold-expression. More codes will need to be added to use this
4898 function in other contexts. */
4900 static bool
4902 {
4904 {
4937 }
4938 }
4940 /* If the next token is a suitable fold operator, consume it and return as
4941 the function above. */
4943 static int
4945 {
4951 }
4953 /* Parse a fold-expression.
4955 fold-expression:
4956 ( ... folding-operator cast-expression)
4957 ( cast-expression folding-operator ... )
4958 ( cast-expression folding operator ... folding-operator cast-expression)
4960 Note that the '(' and ')' are matched in primary expression. */
4962 static cp_expr
4964 {
4965 cp_id_kind pidk;
4967 // Left fold.
4969 {
4973 {
4976 }
4983 }
4988 {
4991 }
4994 {
4997 }
5000 /* The operands of a fold-expression are cast-expressions, so binary or
5001 conditional expressions are not allowed. We check this here to avoid
5002 tentative parsing. */
5014 // Right fold.
5019 {
5022 }
5025 // Binary left or right fold.
5030 }
5032 /* Parse a primary-expression.
5034 primary-expression:
5035 literal
5036 this
5037 ( expression )
5038 id-expression
5039 lambda-expression (C++11)
5041 GNU Extensions:
5043 primary-expression:
5044 ( compound-statement )
5045 __builtin_va_arg ( assignment-expression , type-id )
5046 __builtin_offsetof ( type-id , offsetof-expression )
5048 C++ Extensions:
5049 __has_nothrow_assign ( type-id )
5050 __has_nothrow_constructor ( type-id )
5051 __has_nothrow_copy ( type-id )
5052 __has_trivial_assign ( type-id )
5053 __has_trivial_constructor ( type-id )
5054 __has_trivial_copy ( type-id )
5055 __has_trivial_destructor ( type-id )
5056 __has_virtual_destructor ( type-id )
5057 __is_abstract ( type-id )
5058 __is_base_of ( type-id , type-id )
5059 __is_class ( type-id )
5060 __is_empty ( type-id )
5061 __is_enum ( type-id )
5062 __is_final ( type-id )
5063 __is_literal_type ( type-id )
5064 __is_pod ( type-id )
5065 __is_polymorphic ( type-id )
5066 __is_std_layout ( type-id )
5067 __is_trivial ( type-id )
5068 __is_union ( type-id )
5070 Objective-C++ Extension:
5072 primary-expression:
5073 objc-expression
5075 literal:
5076 __null
5078 ADDRESS_P is true iff this expression was immediately preceded by
5079 "&" and therefore might denote a pointer-to-member. CAST_P is true
5080 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5081 true iff this expression is a template argument.
5083 Returns a representation of the expression. Upon return, *IDK
5084 indicates what kind of id-expression (if any) was present. */
5086 static cp_expr
5093 {
5096 /* Assume the primary expression is not an id-expression. */
5099 /* Peek at the next token. */
5102 {
5103 /* literal:
5104 integer-literal
5105 character-literal
5106 floating-literal
5107 string-literal
5108 boolean-literal
5109 pointer-literal
5110 user-defined-literal */
5122 {
5126 }
5127 /* Floating-point literals are only allowed in an integral
5128 constant expression if they are cast to an integral or
5129 enumeration type. */
5133 {
5134 /* CAST_P will be set even in invalid code like "int(2.7 +
5135 ...)". Therefore, we have to check that the next token
5136 is sure to end the cast. */
5138 {
5143 enumerator-definition. */
5145 /* The curly brace at the end of an enum-specifier. */
5147 /* The end of a statement. */
5149 /* The end of the cast-expression. */
5151 /* The end of an array bound. */
5153 /* The closing ">" in a template-argument-list. */
5156 /* C++0x only: A ">>" treated like two ">" tokens,
5157 in a template-argument-list. */
5162 }
5164 /* If we are within a cast, then the constraint that the
5165 cast is to an integral or enumeration type will be
5166 checked at that point. If we are not within a cast, then
5167 this code is invalid. */
5170 }
5190 /* ??? Should wide strings be allowed when parser->translate_strings_p
5191 is false (i.e. in attributes)? If not, we can kill the third
5192 argument to cp_parser_string_literal. */
5198 /* If we see `( { ' then we are looking at the beginning of
5199 a GNU statement-expression. */
5202 {
5203 /* Statement-expressions are not allowed by the standard. */
5207 /* And they're not allowed outside of a function-body; you
5208 cannot, for example, write:
5210 int i = ({ int j = 3; j + 1; });
5212 at class or namespace scope. */
5215 {
5217 "statement-expressions are not allowed outside "
5223 }
5224 else
5226 }
5227 /* Otherwise it's a normal parenthesized expression. */
5228 {
5229 cp_expr expr;
5234 /* Consume the `('. */
5235 matching_parens parens;
5237 /* Within a parenthesized expression, a `>' token is always
5238 the greater-than operator. */
5239 saved_greater_than_is_operator_p
5244 /* Left fold expression. */
5246 else
5247 /* Parse the parenthesized expression. */
5252 {
5259 }
5260 else
5261 /* Let the front end know that this expression was
5262 enclosed in parentheses. This matters in case, for
5263 example, the expression is of the form `A::B', since
5264 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5265 not. */
5268 /* DR 705: Wrapping an unqualified name in parentheses
5269 suppresses arg-dependent lookup. We want to pass back
5270 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5271 (c++/37862), but none of the others. */
5275 /* The `>' token might be the end of a template-id or
5276 template-parameter-list now. */
5277 parser->greater_than_is_operator_p
5280 /* Consume the `)'. */
5289 }
5292 {
5294 {
5295 /* We might have an Objective-C++ message. */
5298 /* If that works out, we're done ... */
5301 /* ... else, fall though to see if it's a lambda. */
5302 }
5304 /* Don't warn about a failed tentative parse. */
5309 }
5313 /* We have an Objective-C++ string literal. */
5320 {
5321 /* These two are the boolean literals. */
5329 /* The `__null' literal. */
5334 /* The `nullptr' literal. */
5339 /* Recognize the `this' keyword. */
5343 {
5347 }
5348 /* Pointers cannot appear in constant-expressions. */
5353 /* The `operator' keyword can be the beginning of an
5354 id-expression. */
5361 {
5362 non_integral_constant name;
5364 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5365 __func__ are the names of variables -- but they are
5366 treated specially. Therefore, they are handled here,
5367 rather than relying on the generic id-expression logic
5368 below. Grammatically, these names are id-expressions.
5370 Consume the token. */
5374 {
5386 }
5391 /* Look up the name. */
5393 }
5396 {
5397 tree expression;
5398 tree type;
5399 source_location type_location;
5400 location_t start_loc
5402 /* The `__builtin_va_arg' construct is used to handle
5403 `va_arg'. Consume the `__builtin_va_arg' token. */
5405 /* Look for the opening `('. */
5406 matching_parens parens;
5408 /* Now, parse the assignment-expression. */
5410 /* Look for the `,'. */
5413 /* Parse the type-id. */
5414 {
5417 }
5418 /* Look for the closing `)'. */
5419 location_t finish_loc
5422 /* Using `va_arg' in a constant-expression is not
5423 allowed. */
5425 NIC_VA_ARG))
5427 /* Construct a location of the form:
5428 __builtin_va_arg (v, int)
5429 ~~~~~~~~~~~~~~~~~~~~~^~~~
5430 with the caret at the type, ranging from the start of the
5431 "__builtin_va_arg" token to the close paren. */
5432 location_t combined_loc
5435 }
5470 // C++ concepts
5474 /* Objective-C++ expressions. */
5484 {
5489 }
5490 /* FALLTHRU */
5494 }
5496 /* An id-expression can start with either an identifier, a
5497 `::' as the beginning of a qualified-id, or the "operator"
5498 keyword. */
5503 {
5504 id_expression:
5505 cp_expr id_expression;
5506 cp_expr decl;
5512 /* Parse the id-expression. */
5513 id_expression
5530 /* If we have a template-id, then no further lookup is
5531 required. If the template-id was for a template-class, we
5532 will sometimes have a TYPE_DECL at this point. */
5536 /* Look up the name. */
5537 else
5538 {
5539 tree ambiguous_decls;
5541 /* If we already know that this lookup is ambiguous, then
5542 we've already issued an error message; there's no reason
5543 to check again. */
5546 {
5549 }
5552 none_type,
5553 template_p,
5558 /* If the lookup was ambiguous, an error will already have
5559 been issued. */
5563 /* In Objective-C++, we may have an Objective-C 2.0
5564 dot-syntax for classes here. */
5569 {
5570 tree component;
5577 component);
5578 /* Build a location of the form:
5579 expr.component
5580 ~~~~~^~~~~~~~~
5581 with caret at the start of the component name (at
5582 input_location), ranging from the start of the id_expression
5583 to the end of the component name. */
5584 location_t combined_loc
5589 }
5591 /* In Objective-C++, an instance variable (ivar) may be preferred
5592 to whatever cp_parser_lookup_name() found.
5593 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5594 rest of c-family, we have to do a little extra work to preserve
5595 any location information in cp_expr "decl". Given that
5596 objc_lookup_ivar is implemented in "c-family" and "objc", we
5597 have a trip through the pure "tree" type, rather than cp_expr.
5598 Naively copying it back to "decl" would implicitly give the
5599 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5600 store an EXPR_LOCATION. Hence we only update "decl" (and
5601 hence its location_t) if we get back a different tree node. */
5603 id_expression);
5607 /* If name lookup gives us a SCOPE_REF, then the
5608 qualifying scope was dependent. */
5610 {
5611 /* At this point, we do not know if DECL is a valid
5612 integral constant expression. We assume that it is
5613 in fact such an expression, so that code like:
5615 template <int N> struct A {
5616 int a[B<N>::i];
5617 };
5619 is accepted. At template-instantiation time, we
5620 will check that B<N>::i is actually a constant. */
5622 }
5623 /* Check to see if DECL is a local variable in a context
5624 where that is forbidden. */
5627 {
5632 }
5633 }
5637 /* It's too difficult to mark ths in all the places where
5638 we know for sure we need to keep the lookup, so do it
5639 now. The cost is extra GC to recycle the lookups
5640 resolved at parse time. */
5643 decl = (finish_id_expression
5645 idk,
5650 template_arg_p,
5657 }
5659 /* Anything else is an error. */
5663 }
5664 }
5672 {
5675 }
5677 /* Parse an id-expression.
5679 id-expression:
5680 unqualified-id
5681 qualified-id
5683 qualified-id:
5684 :: [opt] nested-name-specifier template [opt] unqualified-id
5685 :: identifier
5686 :: operator-function-id
5687 :: template-id
5689 Return a representation of the unqualified portion of the
5690 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5691 a `::' or nested-name-specifier.
5693 Often, if the id-expression was a qualified-id, the caller will
5694 want to make a SCOPE_REF to represent the qualified-id. This
5695 function does not do this in order to avoid wastefully creating
5696 SCOPE_REFs when they are not required.
5698 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5699 `template' keyword.
5701 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5702 uninstantiated templates.
5704 If *TEMPLATE_P is non-NULL, it is set to true iff the
5705 `template' keyword is used to explicitly indicate that the entity
5706 named is a template.
5708 If DECLARATOR_P is true, the id-expression is appearing as part of
5709 a declarator, rather than as part of an expression. */
5711 static cp_expr
5718 {
5722 /* Assume the `template' keyword was not used. */
5726 /* Look for the optional `::' operator. */
5727 global_scope_p
5728 = (!template_keyword_p
5733 /* Look for the optional nested-name-specifier. */
5734 nested_name_specifier_p
5737 check_dependency_p,
5739 declarator_p,
5740 template_keyword_p)
5743 /* If there is a nested-name-specifier, then we are looking at
5744 the first qualified-id production. */
5746 {
5747 tree saved_scope;
5748 tree saved_object_scope;
5749 tree saved_qualifying_scope;
5750 cp_expr unqualified_id;
5753 /* See if the next token is the `template' keyword. */
5757 /* Name lookup we do during the processing of the
5758 unqualified-id might obliterate SCOPE. */
5762 /* Process the final unqualified-id. */
5764 check_dependency_p,
5765 declarator_p,
5767 /* Restore the SAVED_SCOPE for our caller. */
5773 }
5774 /* Otherwise, if we are in global scope, then we are looking at one
5775 of the other qualified-id productions. */
5777 {
5779 tree id;
5781 /* Peek at the next token. */
5784 /* If it's an identifier, and the next token is not a "<", then
5785 we can avoid the template-id case. This is an optimization
5786 for this common case. */
5788 && !cp_parser_nth_token_starts_template_argument_list_p
5793 /* Try a template-id. */
5797 none_type,
5798 declarator_p);
5799 /* If that worked, we're done. */
5803 /* Peek at the next token. (Changes in the token buffer may
5804 have invalidated the pointer obtained above.) */
5808 {
5815 /* Fall through. */
5820 }
5821 }
5822 else
5825 declarator_p,
5826 optional_p);
5827 }
5829 /* Parse an unqualified-id.
5831 unqualified-id:
5832 identifier
5833 operator-function-id
5834 conversion-function-id
5835 ~ class-name
5836 template-id
5838 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5839 keyword, in a construct like `A::template ...'.
5841 Returns a representation of unqualified-id. For the `identifier'
5842 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5843 production a BIT_NOT_EXPR is returned; the operand of the
5844 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5845 other productions, see the documentation accompanying the
5846 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5847 names are looked up in uninstantiated templates. If DECLARATOR_P
5848 is true, the unqualified-id is appearing as part of a declarator,
5849 rather than as part of an expression. */
5851 static cp_expr
5857 {
5860 /* Peek at the next token. */
5864 {
5866 {
5867 tree id;
5869 /* We don't know yet whether or not this will be a
5870 template-id. */
5872 /* Try a template-id. */
5874 check_dependency_p,
5875 none_type,
5876 declarator_p);
5877 /* If it worked, we're done. */
5880 /* Otherwise, it's an ordinary identifier. */
5882 }
5886 check_dependency_p,
5887 none_type,
5888 declarator_p);
5891 {
5892 tree type_decl;
5893 tree qualifying_scope;
5894 tree object_scope;
5895 tree scope;
5898 /* Consume the `~' token. */
5900 /* Parse the class-name. The standard, as written, seems to
5901 say that:
5903 template <typename T> struct S { ~S (); };
5904 template <typename T> S<T>::~S() {}
5906 is invalid, since `~' must be followed by a class-name, but
5907 `S<T>' is dependent, and so not known to be a class.
5908 That's not right; we need to look in uninstantiated
5909 templates. A further complication arises from:
5911 template <typename T> void f(T t) {
5912 t.T::~T();
5913 }
5915 Here, it is not possible to look up `T' in the scope of `T'
5916 itself. We must look in both the current scope, and the
5917 scope of the containing complete expression.
5919 Yet another issue is:
5921 struct S {
5922 int S;
5923 ~S();
5924 };
5926 S::~S() {}
5928 The standard does not seem to say that the `S' in `~S'
5929 should refer to the type `S' and not the data member
5930 `S::S'. */
5932 /* DR 244 says that we look up the name after the "~" in the
5933 same scope as we looked up the qualifying name. That idea
5934 isn't fully worked out; it's more complicated than that. */
5939 /* Check for invalid scopes. */
5941 {
5945 }
5947 {
5951 scope);
5956 }
5959 /* If the name is of the form "X::~X" it's OK even if X is a
5960 typedef. */
5969 {
5972 }
5974 /* ~auto means the destructor of whatever the object is. */
5976 {
5979 "%<~auto%> only available with "
5983 }
5985 /* If there was an explicit qualification (S::~T), first look
5986 in the scope given by the qualification (i.e., S).
5988 Note: in the calls to cp_parser_class_name below we pass
5989 typename_type so that lookup finds the injected-class-name
5990 rather than the constructor. */
5994 {
5999 typename_type,
6002 declarator_p);
6005 }
6006 /* In "N::S::~S", look in "N" as well. */
6008 {
6013 type_decl
6017 typename_type,
6020 declarator_p);
6023 }
6024 /* In "p->S::~T", look in the scope given by "*p" as well. */
6026 {
6031 type_decl
6035 typename_type,
6038 declarator_p);
6041 }
6042 /* Look in the surrounding context. */
6044 {
6050 type_decl
6054 typename_type,
6057 declarator_p);
6060 {
6061 /* We couldn't find a type with this name. If we're parsing
6062 tentatively, fail and try something else. */
6064 {
6067 }
6068 /* Otherwise, accept it and check for a match at instantiation
6069 time. */
6074 }
6075 }
6076 /* If an error occurred, assume that the name of the
6077 destructor is the same as the name of the qualifying
6078 class. That allows us to keep parsing after running
6079 into ill-formed destructor names. */
6085 /* Check that destructor name and scope match. */
6087 {
6094 }
6096 /* [class.dtor]
6098 A typedef-name that names a class shall not be used as the
6099 identifier in the declarator for a destructor declaration. */
6106 type_decl);
6109 }
6113 {
6114 cp_expr id;
6116 /* This could be a template-id, so we try that first. */
6118 /* Try a template-id. */
6121 none_type,
6122 declarator_p);
6123 /* If that worked, we're done. */
6126 /* We still don't know whether we're looking at an
6127 operator-function-id or a conversion-function-id. */
6129 /* Try an operator-function-id. */
6131 /* If that didn't work, try a conversion-function-id. */
6136 }
6137 /* Fall through. */
6144 }
6145 }
6147 /* Parse an (optional) nested-name-specifier.
6149 nested-name-specifier: [C++98]
6150 class-or-namespace-name :: nested-name-specifier [opt]
6151 class-or-namespace-name :: template nested-name-specifier [opt]
6153 nested-name-specifier: [C++0x]
6154 type-name ::
6155 namespace-name ::
6156 nested-name-specifier identifier ::
6157 nested-name-specifier template [opt] simple-template-id ::
6159 PARSER->SCOPE should be set appropriately before this function is
6160 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6161 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6162 in name lookups.
6164 Sets PARSER->SCOPE to the class (TYPE) or namespace
6165 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6166 it unchanged if there is no nested-name-specifier. Returns the new
6167 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6169 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6170 part of a declaration and/or decl-specifier. */
6172 static tree
6179 {
6184 /* Remember where the nested-name-specifier starts. */
6186 {
6189 }
6192 {
6193 tree new_scope;
6194 tree old_scope;
6195 tree saved_qualifying_scope;
6197 /* Spot cases that cannot be the beginning of a
6198 nested-name-specifier. */
6201 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6202 the already parsed nested-name-specifier. */
6204 {
6205 /* Grab the nested-name-specifier and continue the loop. */
6207 /* If we originally encountered this nested-name-specifier
6208 with IS_DECLARATION set to false, we will not have
6209 resolved TYPENAME_TYPEs, so we must do so here. */
6212 {
6217 }
6220 }
6222 /* Spot cases that cannot be the beginning of a
6223 nested-name-specifier. On the second and subsequent times
6224 through the loop, we look for the `template' keyword. */
6226 ;
6227 /* A template-id can start a nested-name-specifier. */
6229 ;
6230 /* DR 743: decltype can be used in a nested-name-specifier. */
6232 ;
6233 else
6234 {
6235 /* If the next token is not an identifier, then it is
6236 definitely not a type-name or namespace-name. */
6239 /* If the following token is neither a `<' (to begin a
6240 template-id), nor a `::', then we are not looking at a
6241 nested-name-specifier. */
6247 {
6251 "found %<:%> in nested-name-specifier, "
6254 }
6257 && !cp_parser_nth_token_starts_template_argument_list_p
6260 }
6262 /* The nested-name-specifier is optional, so we parse
6263 tentatively. */
6266 /* Look for the optional `template' keyword, if this isn't the
6267 first time through the loop. */
6271 /* Save the old scope since the name lookup we are about to do
6272 might destroy it. */
6275 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6276 look up names in "X<T>::I" in order to determine that "Y" is
6277 a template. So, if we have a typename at this point, we make
6278 an effort to look through it. */
6280 && !typename_keyword_p
6285 /* Parse the qualifying entity. */
6286 new_scope
6288 typename_keyword_p,
6289 template_keyword_p,
6290 check_dependency_p,
6291 type_p,
6292 is_declaration);
6293 /* Look for the `::' token. */
6296 /* If we found what we wanted, we keep going; otherwise, we're
6297 done. */
6299 {
6302 /* Restore the OLD_SCOPE since it was valid before the
6303 failed attempt at finding the last
6304 class-or-namespace-name. */
6308 /* If the next token is a decltype, and the one after that is a
6309 `::', then the decltype has failed to resolve to a class or
6310 enumeration type. Give this error even when parsing
6311 tentatively since it can't possibly be valid--and we're going
6312 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6313 won't get another chance.*/
6317 {
6324 /* As below. */
6327 }
6331 {
6332 /* If we have a non-type template-id followed by ::, it can't
6333 possibly be valid. */
6338 {
6341 {
6347 }
6348 else
6349 {
6350 /* Variable template. */
6355 }
6362 /* As below. */
6366 }
6367 }
6371 /* If the next token is an identifier, and the one after
6372 that is a `::', then any valid interpretation would have
6373 found a class-or-namespace-name. */
6379 {
6382 {
6384 {
6385 tree decl;
6386 tree ambiguous_decls;
6389 none_type,
6398 decl);
6400 {
6401 // cp_parser_lookup_name has the same diagnostic,
6402 // thus make sure to emit it at most once.
6405 {
6410 }
6412 }
6413 else
6414 {
6416 cp_parser_name_lookup_error
6419 else
6420 cp_parser_name_lookup_error
6423 }
6424 }
6427 /* Treat this as a successful nested-name-specifier
6428 due to:
6430 [basic.lookup.qual]
6432 If the name found is not a class-name (clause
6433 _class_) or namespace-name (_namespace.def_), the
6434 program is ill-formed. */
6436 }
6438 }
6440 }
6441 /* We've found one valid nested-name-specifier. */
6443 /* Name lookup always gives us a DECL. */
6446 /* Uses of "template" must be followed by actual templates. */
6458 new_scope);
6459 /* If it is a class scope, try to complete it; we are about to
6460 be looking up names inside the class. */
6462 /* Since checking types for dependency can be expensive,
6463 avoid doing it if the type is already complete. */
6465 /* Do not try to complete dependent types. */
6467 {
6469 /* If it is a typedef to current class, use the current
6470 class instead, as the typedef won't have any names inside
6471 it yet. */
6475 }
6476 /* Make sure we look in the right scope the next time through
6477 the loop. */
6479 }
6481 /* If parsing tentatively, replace the sequence of tokens that makes
6482 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6483 token. That way, should we re-parse the token stream, we will
6484 not have to repeat the effort required to do the parse, nor will
6485 we issue duplicate error messages. */
6487 {
6491 /* Reset the contents of the START token. */
6493 /* Retrieve any deferred checks. Do not pop this access checks yet
6494 so the memory will not be reclaimed during token replacing below. */
6502 /* Purge all subsequent tokens. */
6504 }
6510 }
6512 /* Parse a nested-name-specifier. See
6513 cp_parser_nested_name_specifier_opt for details. This function
6514 behaves identically, except that it will an issue an error if no
6515 nested-name-specifier is present. */
6517 static tree
6523 {
6524 tree scope;
6526 /* Look for the nested-name-specifier. */
6528 typename_keyword_p,
6529 check_dependency_p,
6530 type_p,
6531 is_declaration);
6532 /* If it was not present, issue an error message. */
6534 {
6537 }
6540 }
6542 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6543 this is either a class-name or a namespace-name (which corresponds
6544 to the class-or-namespace-name production in the grammar). For
6545 C++0x, it can also be a type-name that refers to an enumeration
6546 type or a simple-template-id.
6548 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6549 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6550 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6551 TYPE_P is TRUE iff the next name should be taken as a class-name,
6552 even the same name is declared to be another entity in the same
6553 scope.
6555 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6556 specified by the class-or-namespace-name. If neither is found the
6557 ERROR_MARK_NODE is returned. */
6559 static tree
6566 {
6567 tree saved_scope;
6568 tree saved_qualifying_scope;
6569 tree saved_object_scope;
6570 tree scope;
6574 /* DR 743: decltype can appear in a nested-name-specifier. */
6576 {
6580 {
6583 }
6587 }
6589 /* Before we try to parse the class-name, we must save away the
6590 current PARSER->SCOPE since cp_parser_class_name will destroy
6591 it. */
6595 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6596 there is no need to look for a namespace-name. */
6597 only_class_p = template_keyword_p
6602 typename_keyword_p,
6603 template_keyword_p,
6605 check_dependency_p,
6607 is_declaration,
6610 /* If that didn't work, try for a namespace-name. */
6612 {
6613 /* Restore the saved scope. */
6617 /* If we are not looking at an identifier followed by the scope
6618 resolution operator, then this is not part of a
6619 nested-name-specifier. (Note that this function is only used
6620 to parse the components of a nested-name-specifier.) */
6625 }
6628 }
6630 /* Return true if we are looking at a compound-literal, false otherwise. */
6632 static bool
6634 {
6637 /* Skip tokens until the next token is a closing parenthesis.
6638 If we find the closing `)', and the next token is a `{', then
6639 we are looking at a compound-literal. */
6640 bool compound_literal_p
6645 /* Roll back the tokens we skipped. */
6649 }
6651 /* Return true if EXPR is the integer constant zero or a complex constant
6652 of zero, without any folding, but ignoring location wrappers. */
6654 bool
6656 {
6659 }
6661 /* Parse a postfix-expression.
6663 postfix-expression:
6664 primary-expression
6665 postfix-expression [ expression ]
6666 postfix-expression ( expression-list [opt] )
6667 simple-type-specifier ( expression-list [opt] )
6668 typename :: [opt] nested-name-specifier identifier
6669 ( expression-list [opt] )
6670 typename :: [opt] nested-name-specifier template [opt] template-id
6671 ( expression-list [opt] )
6672 postfix-expression . template [opt] id-expression
6673 postfix-expression -> template [opt] id-expression
6674 postfix-expression . pseudo-destructor-name
6675 postfix-expression -> pseudo-destructor-name
6676 postfix-expression ++
6677 postfix-expression --
6678 dynamic_cast < type-id > ( expression )
6679 static_cast < type-id > ( expression )
6680 reinterpret_cast < type-id > ( expression )
6681 const_cast < type-id > ( expression )
6682 typeid ( expression )
6683 typeid ( type-id )
6685 GNU Extension:
6687 postfix-expression:
6688 ( type-id ) { initializer-list , [opt] }
6690 This extension is a GNU version of the C99 compound-literal
6691 construct. (The C99 grammar uses `type-name' instead of `type-id',
6692 but they are essentially the same concept.)
6694 If ADDRESS_P is true, the postfix expression is the operand of the
6695 `&' operator. CAST_P is true if this expression is the target of a
6696 cast.
6698 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6699 class member access expressions [expr.ref].
6701 Returns a representation of the expression. */
6703 static cp_expr
6707 {
6709 location_t loc;
6715 /* Peek at the next token. */
6720 /* Some of the productions are determined by keywords. */
6723 {
6728 {
6729 tree type;
6730 cp_expr expression;
6734 /* All of these can be handled in the same way from the point
6735 of view of parsing. Begin by consuming the token
6736 identifying the cast. */
6739 /* New types cannot be defined in the cast. */
6741 parser->type_definition_forbidden_message
6744 /* Look for the opening `<'. */
6746 /* Parse the type to which we are casting. */
6751 /* Look for the closing `>'. */
6753 /* Restore the old message. */
6756 bool saved_greater_than_is_operator_p
6760 /* And the expression which is being cast. */
6761 matching_parens parens;
6765 RT_CLOSE_PAREN);
6769 parser->greater_than_is_operator_p
6772 /* Only type conversions to integral or enumeration types
6773 can be used in constant-expressions. */
6776 {
6779 }
6782 {
6784 postfix_expression
6788 postfix_expression
6792 postfix_expression
6794 tf_warning_or_error);
6797 postfix_expression
6802 }
6804 /* Construct a location e.g. :
6805 reinterpret_cast <int *> (expr)
6806 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6807 ranging from the start of the "*_cast" token to the final closing
6808 paren, with the caret at the start. */
6811 }
6815 {
6816 tree type;
6820 /* Consume the `typeid' token. */
6822 /* Look for the `(' token. */
6823 matching_parens parens;
6825 /* Types cannot be defined in a `typeid' expression. */
6827 parser->type_definition_forbidden_message
6829 /* We can't be sure yet whether we're looking at a type-id or an
6830 expression. */
6832 /* Try a type-id first. */
6837 /* Look for the `)' token. Otherwise, we can't be sure that
6838 we're not looking at an expression: consider `typeid (int
6839 (3))', for example. */
6841 /* If all went well, simply lookup the type-id. */
6844 /* Otherwise, fall back to the expression variant. */
6845 else
6846 {
6847 tree expression;
6849 /* Look for an expression. */
6851 /* Compute its typeid. */
6853 /* Look for the `)' token. */
6855 }
6856 /* Restore the saved message. */
6858 /* `typeid' may not appear in an integral constant expression. */
6862 /* Construct a location e.g. :
6863 typeid (expr)
6864 ^~~~~~~~~~~~~
6865 ranging from the start of the "typeid" token to the final closing
6866 paren, with the caret at the start. */
6868 {
6869 location_t typeid_loc
6873 }
6874 }
6878 {
6879 tree type;
6880 /* The syntax permitted here is the same permitted for an
6881 elaborated-type-specifier. */
6888 }
6894 {
6897 tree p;
6904 {
6907 }
6913 {
6916 postfix_expression
6918 else
6919 {
6923 }
6929 tf_warning_or_error);
6930 else
6931 {
6935 }
6940 postfix_expression
6944 postfix_expression
6947 else
6948 {
6952 }
6957 }
6959 }
6962 {
6963 tree type;
6965 /* If the next thing is a simple-type-specifier, we may be
6966 looking at a functional cast. We could also be looking at
6967 an id-expression. So, we try the functional cast, and if
6968 that doesn't work we fall back to the primary-expression. */
6970 /* Look for the simple-type-specifier. */
6974 CP_PARSER_FLAGS_NONE);
6976 /* Parse the cast itself. */
6978 postfix_expression
6980 /* If that worked, we're done. */
6984 /* If the functional-cast didn't work out, try a
6985 compound-literal. */
6988 {
6993 matching_parens parens;
6996 /* Avoid calling cp_parser_type_id pointlessly, see comment
6997 in cp_parser_cast_expression about c++/29234. */
7000 else
7001 {
7002 /* Parse the type. */
7008 }
7010 /* If things aren't going well, there's no need to
7011 keep going. */
7013 {
7015 /* Parse the brace-enclosed initializer list. */
7018 }
7019 /* If that worked, we're definitely looking at a
7020 compound-literal expression. */
7022 {
7023 /* Warn the user that a compound literal is not
7024 allowed in standard C++. */
7027 /* For simplicity, we disallow compound literals in
7028 constant-expressions. We could
7029 allow compound literals of integer type, whose
7030 initializer was a constant, in constant
7031 expressions. Permitting that usage, as a further
7032 extension, would not change the meaning of any
7033 currently accepted programs. (Of course, as
7034 compound literals are not part of ISO C++, the
7035 standard has nothing to say.) */
7037 NIC_NCC))
7038 {
7041 }
7042 /* Form the representation of the compound-literal. */
7043 postfix_expression
7048 }
7049 }
7051 /* It must be a primary-expression. */
7052 postfix_expression
7055 decltype_p,
7057 }
7059 }
7061 /* Note that we don't need to worry about calling build_cplus_new on a
7062 class-valued CALL_EXPR in decltype when it isn't the end of the
7063 postfix-expression; unary_complex_lvalue will take care of that for
7064 all these cases. */
7066 /* Keep looping until the postfix-expression is complete. */
7068 {
7072 /* It is not a Koenig lookup function call. */
7073 postfix_expression
7076 /* Peek at the next token. */
7080 {
7083 {
7085 "two consecutive %<[%> shall "
7088 }
7089 postfix_expression
7091 postfix_expression,
7093 decltype_p);
7102 /* postfix-expression ( expression-list [opt] ) */
7103 {
7114 is_builtin_constant_p
7117 {
7118 /* The whole point of __builtin_constant_p is to allow
7119 non-constant expressions to appear as arguments. */
7120 saved_integral_constant_expression_p
7122 saved_non_integral_constant_expression_p
7125 }
7126 args = (cp_parser_parenthesized_expression_list
7133 {
7134 parser->integral_constant_expression_p
7136 parser->non_integral_constant_expression_p
7138 }
7141 {
7144 }
7146 /* Function calls are not permitted in
7147 constant-expressions. */
7150 NIC_FUNC_CALL))
7151 {
7155 }
7160 {
7162 {
7164 {
7167 postfix_expression
7169 complain);
7170 }
7171 else
7172 postfix_expression
7174 }
7175 /* We do not perform argument-dependent lookup if
7176 normal lookup finds a non-function, in accordance
7177 with the expected resolution of DR 218. */
7180 {
7184 /* Do not do argument dependent lookup if regular
7185 lookup finds a member function or a block-scope
7186 function declaration. [basic.lookup.argdep]/3 */
7189 {
7192 postfix_expression
7194 complain);
7195 }
7196 }
7197 }
7200 {
7210 {
7212 postfix_expression
7216 }
7219 {
7220 postfix_expression
7221 = (build_new_method_call
7227 complain));
7228 }
7229 else
7230 postfix_expression
7234 complain);
7235 }
7239 postfix_expression = (build_offset_ref_call_from_tree
7241 complain));
7243 /* A call to a static class member, or a namespace-scope
7244 function. */
7245 postfix_expression
7248 koenig_p,
7249 complain);
7250 else
7251 /* All other function calls. */
7252 postfix_expression
7255 koenig_p,
7256 complain);
7259 {
7261 start_loc,
7262 close_paren_loc);
7264 }
7266 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7270 }
7275 /* postfix-expression . template [opt] id-expression
7276 postfix-expression . pseudo-destructor-name
7277 postfix-expression -> template [opt] id-expression
7278 postfix-expression -> pseudo-destructor-name */
7280 /* Consume the `.' or `->' operator. */
7283 postfix_expression
7285 postfix_expression,
7292 /* postfix-expression ++ */
7293 /* Consume the `++' token. */
7295 /* Generate a representation for the complete expression. */
7296 postfix_expression
7298 POSTINCREMENT_EXPR);
7299 /* Increments may not appear in constant-expressions. */
7307 /* postfix-expression -- */
7308 /* Consume the `--' token. */
7310 /* Generate a representation for the complete expression. */
7311 postfix_expression
7313 POSTDECREMENT_EXPR);
7314 /* Decrements may not appear in constant-expressions. */
7325 return is_member_access
7326 ? postfix_expression
7328 else
7330 }
7331 }
7333 /* We should never get here. */
7336 }
7338 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7339 by cp_parser_builtin_offsetof. We're looking for
7341 postfix-expression [ expression ]
7342 postfix-expression [ braced-init-list ] (C++11)
7344 FOR_OFFSETOF is set if we're being called in that context, which
7345 changes how we deal with integer constant expressions. */
7347 static tree
7349 tree postfix_expression,
7352 {
7357 /* Consume the `[' token. */
7363 /* Parse the index expression. */
7364 /* ??? For offsetof, there is a question of what to allow here. If
7365 offsetof is not being used in an integral constant expression context,
7366 then we *could* get the right answer by computing the value at runtime.
7367 If we are in an integral constant expression context, then we might
7368 could accept any constant expression; hard to say without analysis.
7369 Rather than open the barn door too wide right away, allow only integer
7370 constant expressions here. */
7373 else
7374 {
7376 {
7381 }
7382 else
7384 }
7388 /* Look for the closing `]'. */
7391 /* Build the ARRAY_REF. */
7395 /* When not doing offsetof, array references are not permitted in
7396 constant-expressions. */
7402 }
7404 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7405 dereference of incomplete type, returns true if error_mark_node should
7406 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7407 and *DEPENDENT_P. */
7409 bool
7412 {
7413 /* In a template, be permissive by treating an object expression
7414 of incomplete type as dependent (after a pedwarn). */
7415 diagnostic_t kind = (processing_template_decl
7419 {
7431 /* Don't emit any diagnostic for OVERLOADs. */
7435 /* Avoid clobbering e.g. DECLs. */
7439 }
7451 {
7454 }
7456 }
7458 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7459 by cp_parser_builtin_offsetof. We're looking for
7461 postfix-expression . template [opt] id-expression
7462 postfix-expression . pseudo-destructor-name
7463 postfix-expression -> template [opt] id-expression
7464 postfix-expression -> pseudo-destructor-name
7466 FOR_OFFSETOF is set if we're being called in that context. That sorta
7467 limits what of the above we'll actually accept, but nevermind.
7468 TOKEN_TYPE is the "." or "->" token, which will already have been
7469 removed from the stream. */
7471 static tree
7474 cp_expr postfix_expression,
7476 location_t location)
7477 {
7478 tree name;
7484 /* If this is a `->' operator, dereference the pointer. */
7487 tf_warning_or_error);
7488 /* Check to see whether or not the expression is type-dependent and
7489 not the current instantiation. */
7491 /* The identifier following the `->' or `.' is not qualified. */
7497 /* Enter the scope corresponding to the type of the object
7498 given by the POSTFIX_EXPRESSION. */
7500 {
7502 /* According to the standard, no expression should ever have
7503 reference type. Unfortunately, we do not currently match
7504 the standard in this respect in that our internal representation
7505 of an expression may have reference type even when the standard
7506 says it does not. Therefore, we have to manually obtain the
7507 underlying type here. */
7509 /* The type of the POSTFIX_EXPRESSION must be complete. */
7510 /* Unlike the object expression in other contexts, *this is not
7511 required to be of complete type for purposes of class member
7512 access (5.2.5) outside the member function body. */
7516 {
7522 }
7525 {
7526 /* Let the name lookup machinery know that we are processing a
7527 class member access expression. */
7529 /* If something went wrong, we want to be able to discern that case,
7530 as opposed to the case where there was no SCOPE due to the type
7531 of expression being dependent. */
7534 /* If the SCOPE was erroneous, make the various semantic analysis
7535 functions exit quickly -- and without issuing additional error
7536 messages. */
7539 }
7540 }
7543 /* Tell cp_parser_lookup_name that there was an object, even though it's
7544 type-dependent. */
7547 /* Assume this expression is not a pseudo-destructor access. */
7550 /* If the SCOPE is a scalar type, then, if this is a valid program,
7551 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7552 is type dependent, it can be pseudo-destructor-name or something else.
7553 Try to parse it as pseudo-destructor-name first. */
7555 {
7556 tree s;
7557 tree type;
7560 /* Parse the pseudo-destructor-name. */
7569 {
7571 postfix_expression
7574 }
7575 }
7578 {
7579 /* If the SCOPE is not a scalar type, we are looking at an
7580 ordinary class member access expression, rather than a
7581 pseudo-destructor-name. */
7584 /* Parse the id-expression. */
7585 name = (cp_parser_id_expression
7592 /* In general, build a SCOPE_REF if the member name is qualified.
7593 However, if the name was not dependent and has already been
7594 resolved; there is no need to build the SCOPE_REF. For example;
7596 struct X { void f(); };
7597 template <typename T> void f(T* t) { t->X::f(); }
7599 Even though "t" is dependent, "X::f" is not and has been resolved
7600 to a BASELINK; there is no need to include scope information. */
7602 /* But we do need to remember that there was an explicit scope for
7603 virtual function calls. */
7607 /* If the name is a template-id that names a type, we will get a
7608 TYPE_DECL here. That is invalid code. */
7610 {
7613 }
7614 else
7615 {
7617 {
7619 {
7623 }
7624 else
7627 name,
7628 template_p);
7632 }
7634 adjust_result_of_qualified_name_lookup
7636 postfix_expression
7638 template_p,
7639 tf_warning_or_error);
7640 /* Build a location e.g.:
7641 ptr->access_expr
7642 ~~~^~~~~~~~~~~~~
7643 where the caret is at the deref token, ranging from
7644 the start of postfix_expression to the end of the access expr. */
7645 location_t end_loc
7647 location_t combined_loc
7650 }
7651 }
7653 /* We no longer need to look up names in the scope of the object on
7654 the left-hand side of the `.' or `->' operator. */
7657 /* Outside of offsetof, these operators may not appear in
7658 constant-expressions. */
7660 && (cp_parser_non_integral_constant_expression
7665 }
7667 /* Parse a parenthesized expression-list.
7669 expression-list:
7670 assignment-expression
7671 expression-list, assignment-expression
7673 attribute-list:
7674 expression-list
7675 identifier
7676 identifier, expression-list
7678 CAST_P is true if this expression is the target of a cast.
7680 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7681 argument pack.
7683 WRAP_LOCATIONS_P is true if expressions within this list for which
7684 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7685 their source locations.
7687 Returns a vector of trees. Each element is a representation of an
7688 assignment-expression. NULL is returned if the ( and or ) are
7689 missing. An empty, but allocated, vector is returned on no
7690 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7691 if we are parsing an attribute list for an attribute that wants a
7692 plain identifier argument, normal_attr for an attribute that wants
7693 an expression, or non_attr if we aren't parsing an attribute list. If
7694 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7695 not all of the expressions in the list were constant.
7696 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7697 will be written to with the location of the closing parenthesis. If
7698 an error occurs, it may or may not be written to. */
7708 {
7714 /* Assume all the expressions will be constant. */
7718 matching_parens parens;
7724 /* Within a parenthesized expression, a `>' token is always
7725 the greater-than operator. */
7726 saved_greater_than_is_operator_p
7732 /* Consume expressions until there are no more. */
7735 {
7736 /* At the beginning of attribute lists, check to see if the
7737 next token is an identifier. */
7740 {
7743 /* Consume the identifier. */
7745 /* Save the identifier. */
7747 }
7748 else
7749 {
7752 /* Parse the next assignment-expression. */
7754 {
7755 /* A braced-init-list. */
7761 }
7763 {
7764 expr = (cp_parser_constant_expression
7769 }
7770 else
7772 cast_p);
7777 /* If we have an ellipsis, then this is an expression
7778 expansion. */
7781 {
7782 /* Consume the `...'. */
7785 /* Build the argument pack. */
7787 }
7792 /* Add it to the list. We add error_mark_node
7793 expressions to the list, so that we can still tell if
7794 the correct form for a parenthesized expression-list
7795 is found. That gives better errors. */
7800 }
7802 /* After the first item, attribute lists look the same as
7803 expression lists. */
7806 get_comma:;
7807 /* If the next token isn't a `,', then we are done. */
7811 /* Otherwise, consume the `,' and keep going. */
7813 }
7819 {
7822 skip_comma:;
7823 /* We try and resync to an unnested comma, as that will give the
7824 user better diagnostics. */
7832 {
7833 parser->greater_than_is_operator_p
7836 }
7837 }
7839 parser->greater_than_is_operator_p
7846 }
7848 /* Parse a pseudo-destructor-name.
7850 pseudo-destructor-name:
7851 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7852 :: [opt] nested-name-specifier template template-id :: ~ type-name
7853 :: [opt] nested-name-specifier [opt] ~ type-name
7855 If either of the first two productions is used, sets *SCOPE to the
7856 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7857 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7858 or ERROR_MARK_NODE if the parse fails. */
7860 static void
7862 tree object,
7865 {
7868 /* Handle ~auto. */
7872 {
7875 "%<~auto%> only available with "
7882 }
7884 /* Assume that things will not work out. */
7887 /* Look for the optional `::' operator. */
7889 /* Look for the optional nested-name-specifier. */
7890 nested_name_specifier_p
7897 /* Now, if we saw a nested-name-specifier, we might be doing the
7898 second production. */
7901 {
7902 /* Consume the `template' keyword. */
7904 /* Parse the template-id. */
7908 class_type,
7910 /* Look for the `::' token. */
7912 }
7913 /* If the next token is not a `~', then there might be some
7914 additional qualification. */
7916 {
7917 /* At this point, we're looking for "type-name :: ~". The type-name
7918 must not be a class-name, since this is a pseudo-destructor. So,
7919 it must be either an enum-name, or a typedef-name -- both of which
7920 are just identifiers. So, we peek ahead to check that the "::"
7921 and "~" tokens are present; if they are not, then we can avoid
7922 calling type_name. */
7926 {
7929 }
7931 /* Look for the type-name. */
7936 /* Look for the `::' token. */
7938 }
7939 else
7942 /* Look for the `~'. */
7945 /* Once we see the ~, this has to be a pseudo-destructor. */
7949 /* Look for the type-name again. We are not responsible for
7950 checking that it matches the first type-name. */
7952 }
7954 /* Parse a unary-expression.
7956 unary-expression:
7957 postfix-expression
7958 ++ cast-expression
7959 -- cast-expression
7960 unary-operator cast-expression
7961 sizeof unary-expression
7962 sizeof ( type-id )
7963 alignof ( type-id ) [C++0x]
7964 new-expression
7965 delete-expression
7967 GNU Extensions:
7969 unary-expression:
7970 __extension__ cast-expression
7971 __alignof__ unary-expression
7972 __alignof__ ( type-id )
7973 alignof unary-expression [C++0x]
7974 __real__ cast-expression
7975 __imag__ cast-expression
7976 && identifier
7977 sizeof ( type-id ) { initializer-list , [opt] }
7978 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7979 __alignof__ ( type-id ) { initializer-list , [opt] }
7981 ADDRESS_P is true iff the unary-expression is appearing as the
7982 operand of the `&' operator. CAST_P is true if this expression is
7983 the target of a cast.
7985 Returns a representation of the expression. */
7987 static cp_expr
7990 {
7994 /* Peek at the next token. */
7996 /* Some keywords give away the kind of expression. */
7998 {
8002 {
8005 {
8013 /* Consume the token. */
8015 /* Parse the operand. */
8021 else
8022 {
8023 /* ISO C++ defines alignof only with types, not with
8024 expressions. So pedwarn if alignof is used with a non-
8025 type expression. However, __alignof__ is ok. */
8028 "ISO C++ does not allow %<alignof%> "
8032 }
8033 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8034 SIZEOF_EXPR with the original operand. */
8036 {
8038 {
8040 {
8043 error_mark_node));
8045 }
8046 else
8050 }
8051 }
8053 /* Construct a location e.g. :
8054 alignof (expr)
8055 ^~~~~~~~~~~~~~
8056 with start == caret at the start of the "alignof"/"sizeof"
8057 token, with the endpoint at the final closing paren. */
8058 location_t finish_loc
8060 location_t compound_loc
8067 }
8076 {
8077 /* The saved value of the PEDANTIC flag. */
8079 tree expr;
8081 /* Save away the PEDANTIC flag. */
8083 /* Parse the cast-expression. */
8085 /* Restore the PEDANTIC flag. */
8089 }
8093 {
8094 tree expression;
8096 /* Consume the `__real__' or `__imag__' token. */
8098 /* Parse the cast-expression. */
8100 /* Create the complete representation. */
8104 expression,
8105 tf_warning_or_error);
8106 }
8114 {
8115 tree expr;
8124 matching_parens parens;
8128 parser->type_definition_forbidden_message
8131 saved_integral_constant_expression_p
8133 saved_non_integral_constant_expression_p
8137 saved_greater_than_is_operator_p
8149 parser->greater_than_is_operator_p
8152 parser->integral_constant_expression_p
8154 parser->non_integral_constant_expression_p
8159 location_t finish_loc
8163 /* Construct a location of the form:
8164 noexcept (expr)
8165 ^~~~~~~~~~~~~~~
8166 with start == caret, finishing at the close-paren. */
8167 location_t noexcept_loc
8171 noexcept_loc);
8172 }
8176 }
8177 }
8179 /* Look for the `:: new' and `:: delete', which also signal the
8180 beginning of a new-expression, or delete-expression,
8181 respectively. If the next token is `::', then it might be one of
8182 these. */
8184 {
8187 /* See if the token after the `::' is one of the keywords in
8188 which we're interested. */
8190 /* If it's `new', we have a new-expression. */
8193 /* Similarly, for `delete'. */
8196 }
8198 /* Look for a unary operator. */
8200 /* The `++' and `--' operators can be handled similarly, even though
8201 they are not technically unary-operators in the grammar. */
8203 {
8208 /* Handle the GNU address-of-label extension. */
8211 {
8212 tree identifier;
8213 tree expression;
8216 /* Consume the '&&' token. */
8218 /* Look for the identifier. */
8219 location_t finish_loc
8222 /* Construct a location of the form:
8223 &&label
8224 ^~~~~~~
8225 with caret==start at the "&&", finish at the end of the label. */
8226 location_t combined_loc
8228 /* Create an expression representing the address. */
8231 NIC_ADDR_LABEL))
8234 }
8235 }
8237 {
8238 cp_expr cast_expression;
8244 /* Consume the operator token. */
8248 /* Parse the cast-expression. */
8249 cast_expression
8254 pidk);
8256 /* Make a location:
8257 OP_TOKEN CAST_EXPRESSION
8258 ^~~~~~~~~~~~~~~~~~~~~~~~~
8259 with start==caret at the operator token, and
8260 extending to the end of the cast_expression. */
8263 /* Now, build an appropriate representation. */
8265 {
8269 RO_UNARY_STAR,
8270 complain);
8271 /* TODO: build_x_indirect_ref does not always honor the
8272 location, so ensure it is set. */
8278 /* Fall through. */
8281 cast_expression,
8282 complain);
8283 /* TODO: build_x_unary_op does not always honor the location,
8284 so ensure it is set. */
8292 /* Fall through. */
8294 /* Immediately fold negation of a constant, unless the constant is 0
8295 (since -0 == 0) or it would overflow. */
8300 {
8303 cast_expression);
8305 {
8308 }
8309 }
8310 /* Fall through. */
8319 }
8323 non_constant_p))
8327 }
8331 decltype_p,
8332 pidk);
8333 }
8335 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8336 unary-operator, the corresponding tree code is returned. */
8338 static enum tree_code
8340 {
8342 {
8363 }
8364 }
8366 /* Parse a new-expression.
8368 new-expression:
8369 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8370 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8372 Returns a representation of the expression. */
8374 static tree
8376 {
8379 tree type;
8382 tree ret;
8386 /* Look for the optional `::' operator. */
8387 global_scope_p
8391 /* Look for the `new' operator. */
8393 /* There's no easy way to tell a new-placement from the
8394 `( type-id )' construct. */
8396 /* Look for a new-placement. */
8398 /* If that didn't work out, there's no new-placement. */
8400 {
8404 }
8406 /* If the next token is a `(', then we have a parenthesized
8407 type-id. */
8409 {
8413 /* Consume the `('. */
8414 matching_parens parens;
8417 /* Parse the type-id. */
8418 parser->type_definition_forbidden_message
8420 {
8423 }
8426 /* Look for the closing `)'. */
8429 /* There should not be a direct-new-declarator in this production,
8430 but GCC used to allowed this, so we check and emit a sensible error
8431 message for this case. */
8433 {
8439 }
8440 }
8441 /* Otherwise, there must be a new-type-id. */
8442 else
8445 /* If the next token is a `(' or '{', then we have a new-initializer. */
8450 else
8453 /* A new-expression may not appear in an integral constant
8454 expression. */
8457 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8458 of a new-type-id or type-id of a new-expression, the new-expression shall
8459 contain a new-initializer of the form ( assignment-expression )".
8460 Additionally, consistently with the spirit of DR 1467, we want to accept
8461 'new auto { 2 }' too. */
8467 {
8469 "initialization of new-expression for type %<auto%> "
8472 }
8473 else
8474 {
8475 /* Construct a location e.g.:
8476 ptr = new int[100]
8477 ^~~~~~~~~~~~
8478 with caret == start at the start of the "new" token, and the end
8479 at the end of the final token we consumed. */
8484 /* Create a representation of the new-expression. */
8486 tf_warning_or_error);
8488 }
8496 }
8498 /* Parse a new-placement.
8500 new-placement:
8501 ( expression-list )
8503 Returns the same representation as for an expression-list. */
8507 {
8510 /* Parse the expression-list. */
8511 expression_list = (cp_parser_parenthesized_expression_list
8520 }
8522 /* Parse a new-type-id.
8524 new-type-id:
8525 type-specifier-seq new-declarator [opt]
8527 Returns the TYPE allocated. If the new-type-id indicates an array
8528 type, *NELTS is set to the number of elements in the last array
8529 bound; the TYPE will not include the last array bound. */
8531 static tree
8533 {
8534 cp_decl_specifier_seq type_specifier_seq;
8540 /* The type-specifier sequence must not contain type definitions.
8541 (It cannot contain declarations of new types either, but if they
8542 are not definitions we will catch that because they are not
8543 complete.) */
8545 parser->type_definition_forbidden_message
8547 /* Parse the type-specifier-seq. */
8551 /* Restore the old message. */
8557 /* Parse the new-declarator. */
8560 /* Determine the number of elements in the last array dimension, if
8561 any. */
8563 /* Skip down to the last array dimension. */
8568 {
8571 }
8576 {
8579 }
8582 {
8589 else
8591 }
8594 }
8596 /* Parse an (optional) new-declarator.
8598 new-declarator:
8599 ptr-operator new-declarator [opt]
8600 direct-new-declarator
8602 Returns the declarator. */
8606 {
8609 cp_cv_quals cv_quals;
8611 /* We don't know if there's a ptr-operator next, or not. */
8613 /* Look for a ptr-operator. */
8615 /* If that worked, look for more new-declarators. */
8617 {
8620 /* Parse another optional declarator. */
8623 declarator = cp_parser_make_indirect_declarator
8627 }
8629 /* If the next token is a `[', there is a direct-new-declarator. */
8634 }
8636 /* Parse a direct-new-declarator.
8638 direct-new-declarator:
8639 [ expression ]
8640 direct-new-declarator [constant-expression]
8642 */
8646 {
8650 {
8651 tree expression;
8654 /* Look for the opening `['. */
8659 /* The standard requires that the expression have integral
8660 type. DR 74 adds enumeration types. We believe that the
8661 real intent is that these expressions be handled like the
8662 expression in a `switch' condition, which also allows
8663 classes with a single conversion to integral or
8664 enumeration type. */
8666 {
8667 expression
8669 expression,
8672 {
8674 "expression in new-declarator must have integral "
8677 }
8678 }
8680 /* Look for the closing `]'. */
8683 /* Add this bound to the declarator. */
8686 /* If the next token is not a `[', then there are no more
8687 bounds. */
8690 }
8693 }
8695 /* Parse a new-initializer.
8697 new-initializer:
8698 ( expression-list [opt] )
8699 braced-init-list
8701 Returns a representation of the expression-list. */
8705 {
8709 {
8710 tree t;
8717 }
8718 else
8719 expression_list = (cp_parser_parenthesized_expression_list
8725 }
8727 /* Parse a delete-expression.
8729 delete-expression:
8730 :: [opt] delete cast-expression
8731 :: [opt] delete [ ] cast-expression
8733 Returns a representation of the expression. */
8735 static tree
8737 {
8740 tree expression;
8742 /* Look for the optional `::' operator. */
8743 global_scope_p
8747 /* Look for the `delete' keyword. */
8749 /* See if the array syntax is in use. */
8751 {
8752 /* Consume the `[' token. */
8754 /* Look for the `]' token. */
8756 /* Remember that this is the `[]' construct. */
8758 }
8759 else
8762 /* Parse the cast-expression. */
8765 /* A delete-expression may not appear in an integral constant
8766 expression. */
8771 tf_warning_or_error);
8772 }
8774 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8775 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8776 0 otherwise. */
8778 static int
8780 {
8783 {
8825 /* In ((type ()) () the last () isn't a valid cast-expression,
8826 so the whole must be parsed as postfix-expression. */
8831 /* '[' may start a primary-expression in obj-c++ and in C++11,
8832 as a lambda-expression, eg, '(void)[]{}'. */
8839 /* '++' and '--' may or may not start a cast-expression:
8841 struct T { void operator++(int); };
8842 void f() { (T())++; }
8844 vs
8846 int a;
8847 (int)++a; */
8852 }
8853 }
8855 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8856 in the order: const_cast, static_cast, reinterpret_cast.
8858 Don't suggest dynamic_cast.
8860 Return the first legal cast kind found, or NULL otherwise. */
8864 {
8865 tree trial;
8867 /* Reuse the parser logic by attempting to build the various kinds of
8868 cast, with "complain" disabled.
8869 Identify the first such cast that is valid. */
8871 /* Don't attempt to run such logic within template processing. */
8875 /* First try const_cast. */
8880 /* If that fails, try static_cast. */
8885 /* Finally, try reinterpret_cast. */
8890 /* No such cast possible. */
8892 }
8894 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8895 suggesting how to convert a C-style cast of the form:
8897 (DST_TYPE)ORIG_EXPR
8899 to a C++-style cast.
8901 The primary range of RICHLOC is asssumed to be that of the original
8902 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8903 of the parens in the C-style cast. */
8905 static void
8908 tree dst_type)
8909 {
8910 /* This function is non-trivial, so bail out now if the warning isn't
8911 going to be emitted. */
8915 /* Try to find a legal C++ cast, trying them in order:
8916 const_cast, static_cast, reinterpret_cast. */
8921 /* Replace the open paren with "CAST_SUGGESTION<". */
8922 pretty_printer pp;
8926 /* Replace the close paren with "> (". */
8929 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8931 }
8934 /* Parse a cast-expression.
8936 cast-expression:
8937 unary-expression
8938 ( type-id ) cast-expression
8940 ADDRESS_P is true iff the unary-expression is appearing as the
8941 operand of the `&' operator. CAST_P is true if this expression is
8942 the target of a cast.
8944 Returns a representation of the expression. */
8946 static cp_expr
8949 {
8950 /* If it's a `(', then we might be looking at a cast. */
8952 {
8958 /* There's no way to know yet whether or not this is a cast.
8959 For example, `(int (3))' is a unary-expression, while `(int)
8960 3' is a cast. So, we resort to parsing tentatively. */
8962 /* Types may not be defined in a cast. */
8964 parser->type_definition_forbidden_message
8966 /* Consume the `('. */
8967 matching_parens parens;
8972 /* A very tricky bit is that `(struct S) { 3 }' is a
8973 compound-literal (which we permit in C++ as an extension).
8974 But, that construct is not a cast-expression -- it is a
8975 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8976 is legal; if the compound-literal were a cast-expression,
8977 you'd need an extra set of parentheses.) But, if we parse
8978 the type-id, and it happens to be a class-specifier, then we
8979 will commit to the parse at that point, because we cannot
8980 undo the action that is done when creating a new class. So,
8981 then we cannot back up and do a postfix-expression.
8983 Another tricky case is the following (c++/29234):
8985 struct S { void operator () (); };
8987 void foo ()
8988 {
8989 ( S()() );
8990 }
8992 As a type-id we parse the parenthesized S()() as a function
8993 returning a function, groktypename complains and we cannot
8994 back up in this case either.
8996 Therefore, we scan ahead to the closing `)', and check to see
8997 if the tokens after the `)' can start a cast-expression. Otherwise
8998 we are dealing with an unary-expression, a postfix-expression
8999 or something else.
9001 Yet another tricky case, in C++11, is the following (c++/54891):
9003 (void)[]{};
9005 The issue is that usually, besides the case of lambda-expressions,
9006 the parenthesized type-id cannot be followed by '[', and, eg, we
9007 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9008 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9009 we don't commit, we try a cast-expression, then an unary-expression.
9011 Save tokens so that we can put them back. */
9014 /* We may be looking at a cast-expression. */
9017 cast_expression
9020 /* Roll back the tokens we skipped. */
9022 /* If we aren't looking at a cast-expression, simulate an error so
9023 that the call to cp_parser_error_occurred below returns true. */
9026 else
9027 {
9030 /* Look for the type-id. */
9032 /* Look for the closing `)'. */
9037 }
9039 /* Restore the saved message. */
9042 /* At this point this can only be either a cast or a
9043 parenthesized ctor such as `(T ())' that looks like a cast to
9044 function returning T. */
9046 {
9047 /* Only commit if the cast-expression doesn't start with
9048 '++', '--', or '[' in C++11. */
9056 pidk);
9059 {
9060 /* Warn about old-style casts, if so requested. */
9065 {
9071 }
9073 /* Only type conversions to integral or enumeration types
9074 can be used in constant-expressions. */
9077 NIC_CAST))
9080 /* Perform the cast. */
9081 /* Make a location:
9082 (TYPE) EXPR
9083 ^~~~~~~~~~~
9084 with start==caret at the open paren, extending to the
9085 end of "expr". */
9087 open_paren_loc,
9091 }
9092 }
9093 else
9095 }
9097 /* If we get here, then it's not a cast, so it must be a
9098 unary-expression. */
9101 }
9103 /* Parse a binary expression of the general form:
9105 pm-expression:
9106 cast-expression
9107 pm-expression .* cast-expression
9108 pm-expression ->* cast-expression
9110 multiplicative-expression:
9111 pm-expression
9112 multiplicative-expression * pm-expression
9113 multiplicative-expression / pm-expression
9114 multiplicative-expression % pm-expression
9116 additive-expression:
9117 multiplicative-expression
9118 additive-expression + multiplicative-expression
9119 additive-expression - multiplicative-expression
9121 shift-expression:
9122 additive-expression
9123 shift-expression << additive-expression
9124 shift-expression >> additive-expression
9126 relational-expression:
9127 shift-expression
9128 relational-expression < shift-expression
9129 relational-expression > shift-expression
9130 relational-expression <= shift-expression
9131 relational-expression >= shift-expression
9133 GNU Extension:
9135 relational-expression:
9136 relational-expression <? shift-expression
9137 relational-expression >? shift-expression
9139 equality-expression:
9140 relational-expression
9141 equality-expression == relational-expression
9142 equality-expression != relational-expression
9144 and-expression:
9145 equality-expression
9146 and-expression & equality-expression
9148 exclusive-or-expression:
9149 and-expression
9150 exclusive-or-expression ^ and-expression
9152 inclusive-or-expression:
9153 exclusive-or-expression
9154 inclusive-or-expression | exclusive-or-expression
9156 logical-and-expression:
9157 inclusive-or-expression
9158 logical-and-expression && inclusive-or-expression
9160 logical-or-expression:
9161 logical-and-expression
9162 logical-or-expression || logical-and-expression
9164 All these are implemented with a single function like:
9166 binary-expression:
9167 simple-cast-expression
9168 binary-expression <token> binary-expression
9170 CAST_P is true if this expression is the target of a cast.
9172 The binops_by_token map is used to get the tree codes for each <token> type.
9173 binary-expressions are associated according to a precedence table. */
9175 #define TOKEN_PRECEDENCE(token) \
9176 (((token->type == CPP_GREATER \
9177 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9178 && !parser->greater_than_is_operator_p) \
9179 ? PREC_NOT_OPERATOR \
9180 : binops_by_token[token->type].prec)
9182 static cp_expr
9188 {
9189 cp_parser_expression_stack stack;
9191 cp_parser_expression_stack_entry current;
9192 cp_expr rhs;
9196 tree overload;
9198 /* Parse the first expression. */
9209 {
9210 /* Get an operator token. */
9216 {
9218 "%<>>%> operator is treated"
9222 }
9227 /* This is a fold-expression; handle it later. */
9230 /* Popping an entry off the stack means we completed a subexpression:
9231 - either we found a token which is not an operator (`>' where it is not
9232 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9233 will happen repeatedly;
9234 - or, we found an operator which has lower priority. This is the case
9235 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9236 parsing `3 * 4'. */
9238 {
9241 else
9243 }
9245 get_rhs:
9249 /* We used the operator token. */
9252 /* For "false && x" or "true || x", x will never be executed;
9253 disable warnings while evaluating it. */
9255 c_inhibit_evaluation_warnings +=
9258 c_inhibit_evaluation_warnings +=
9261 /* Extract another operand. It may be the RHS of this expression
9262 or the LHS of a new, higher priority expression. */
9267 /* Get another operator token. Look up its precedence to avoid
9268 building a useless (immediately popped) stack entry for common
9269 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9276 {
9277 /* ... and prepare to parse the RHS of the new, higher priority
9278 expression. Since precedence levels on the stack are
9279 monotonically increasing, we do not have to care about
9280 stack overflows. */
9289 pop:
9291 /* If the stack is not empty, we have parsed into LHS the right side
9292 (`4' in the example above) of an expression we had suspended.
9293 We can use the information on the stack to recover the LHS (`3')
9294 from the stack together with the tree code (`MULT_EXPR'), and
9295 the precedence of the higher level subexpression
9296 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9297 which will be used to actually build the additive expression. */
9302 }
9304 /* Undo the disabling of warnings done above. */
9306 c_inhibit_evaluation_warnings -=
9309 c_inhibit_evaluation_warnings -=
9315 /* Avoid warning for !!x == y. */
9320 /* Avoid warning for !b == y where b is boolean. */
9324 /* Avoid warning for !!b == y where b is boolean. */
9337 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9338 ERROR_MARK for everything that is not a binary expression.
9339 This makes warn_about_parentheses miss some warnings that
9340 involve unary operators. For unary expressions we should
9341 pass the correct tree_code unless the unary expression was
9342 surrounded by parentheses.
9343 */
9347 {
9350 else
9351 {
9352 current.lhs
9355 == tcc_comparison
9359 }
9360 }
9361 else
9362 {
9367 /* TODO: build_x_binary_op doesn't always honor the location. */
9369 }
9372 /* If the binary operator required the use of an overloaded operator,
9373 then this expression cannot be an integral constant-expression.
9374 An overloaded operator can be used even if both operands are
9375 otherwise permissible in an integral constant-expression if at
9376 least one of the operands is of enumeration type. */
9380 NIC_OVERLOADED))
9382 }
9385 }
9387 static cp_expr
9392 {
9395 }
9397 /* Parse the `? expression : assignment-expression' part of a
9398 conditional-expression. The LOGICAL_OR_EXPR is the
9399 logical-or-expression that started the conditional-expression.
9400 Returns a representation of the entire conditional-expression.
9402 This routine is used by cp_parser_assignment_expression.
9404 ? expression : assignment-expression
9406 GNU Extensions:
9408 ? : assignment-expression */
9410 static tree
9412 {
9414 cp_expr assignment_expr;
9418 /* Consume the `?' token. */
9423 {
9426 /* Implicit true clause. */
9428 c_inhibit_evaluation_warnings +=
9431 }
9432 else
9433 {
9436 /* Parse the expression. */
9437 c_inhibit_evaluation_warnings +=
9440 c_inhibit_evaluation_warnings +=
9444 }
9446 /* The next token should be a `:'. */
9448 /* Parse the assignment-expression. */
9450 c_inhibit_evaluation_warnings -=
9453 /* Make a location:
9454 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9455 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9456 with the caret at the "?", ranging from the start of
9457 the logical_or_expr to the end of the assignment_expr. */
9462 /* Build the conditional-expression. */
9464 expr,
9465 assignment_expr,
9466 tf_warning_or_error);
9467 }
9469 /* Parse an assignment-expression.
9471 assignment-expression:
9472 conditional-expression
9473 logical-or-expression assignment-operator assignment_expression
9474 throw-expression
9476 CAST_P is true if this expression is the target of a cast.
9477 DECLTYPE_P is true if this expression is the operand of decltype.
9479 Returns a representation for the expression. */
9481 static cp_expr
9484 {
9485 cp_expr expr;
9487 /* If the next token is the `throw' keyword, then we're looking at
9488 a throw-expression. */
9491 /* Otherwise, it must be that we are looking at a
9492 logical-or-expression. */
9493 else
9494 {
9495 /* Parse the binary expressions (logical-or-expression). */
9497 decltype_p,
9499 /* If the next token is a `?' then we're actually looking at a
9500 conditional-expression. */
9503 else
9504 {
9507 /* If it's an assignment-operator, we're using the second
9508 production. */
9509 enum tree_code assignment_operator
9512 {
9515 /* Parse the right-hand side of the assignment. */
9522 /* An assignment may not appear in a
9523 constant-expression. */
9525 NIC_ASSIGNMENT))
9527 /* Build the assignment expression. Its default
9528 location:
9529 LHS = RHS
9530 ~~~~^~~~~
9531 is the location of the '=' token as the
9532 caret, ranging from the start of the lhs to the
9533 end of the rhs. */
9538 assignment_operator,
9539 rhs,
9541 /* TODO: build_x_modify_expr doesn't honor the location,
9542 so we must set it here. */
9544 }
9545 }
9546 }
9549 }
9551 /* Parse an (optional) assignment-operator.
9553 assignment-operator: one of
9554 = *= /= %= += -= >>= <<= &= ^= |=
9556 GNU Extension:
9558 assignment-operator: one of
9559 <?= >?=
9561 If the next token is an assignment operator, the corresponding tree
9562 code is returned, and the token is consumed. For example, for
9563 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9564 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9565 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9566 operator, ERROR_MARK is returned. */
9568 static enum tree_code
9570 {
9574 /* Peek at the next token. */
9578 {
9624 /* Nothing else is an assignment operator. */
9626 }
9628 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9633 /* If it was an assignment operator, consume it. */
9638 }
9640 /* Parse an expression.
9642 expression:
9643 assignment-expression
9644 expression , assignment-expression
9646 CAST_P is true if this expression is the target of a cast.
9647 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9648 except possibly parenthesized or on the RHS of a comma (N3276).
9650 Returns a representation of the expression. */
9652 static cp_expr
9655 {
9660 {
9661 cp_expr assignment_expression;
9663 /* Parse the next assignment-expression. */
9664 assignment_expression
9667 /* We don't create a temporary for a call that is the immediate operand
9668 of decltype or on the RHS of a comma. But when we see a comma, we
9669 need to create a temporary for a call on the LHS. */
9674 assignment_expression
9678 /* If this is the first assignment-expression, we can just
9679 save it away. */
9682 else
9683 {
9684 /* Create a location with caret at the comma, ranging
9685 from the start of the LHS to the end of the RHS. */
9690 assignment_expression,
9693 }
9694 /* If the next token is not a comma, or we're in a fold-expression, then
9695 we are done with the expression. */
9699 /* Consume the `,'. */
9702 /* A comma operator cannot appear in a constant-expression. */
9705 }
9708 }
9710 /* Parse a constant-expression.
9712 constant-expression:
9713 conditional-expression
9715 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9716 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9717 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9718 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9719 only parse a conditional-expression, otherwise parse an
9720 assignment-expression. See below for rationale. */
9722 static cp_expr
9727 {
9731 cp_expr expression;
9733 /* It might seem that we could simply parse the
9734 conditional-expression, and then check to see if it were
9735 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9736 one that the compiler can figure out is constant, possibly after
9737 doing some simplifications or optimizations. The standard has a
9738 precise definition of constant-expression, and we must honor
9739 that, even though it is somewhat more restrictive.
9741 For example:
9743 int i[(2, 3)];
9745 is not a legal declaration, because `(2, 3)' is not a
9746 constant-expression. The `,' operator is forbidden in a
9747 constant-expression. However, GCC's constant-folding machinery
9748 will fold this operation to an INTEGER_CST for `3'. */
9750 /* Save the old settings. */
9752 saved_allow_non_integral_constant_expression_p
9755 /* We are now parsing a constant-expression. */
9757 parser->allow_non_integral_constant_expression_p
9760 /* Although the grammar says "conditional-expression", when not STRICT_P,
9761 we parse an "assignment-expression", which also permits
9762 "throw-expression" and the use of assignment operators. In the case
9763 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9764 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9765 actually essential that we look for an assignment-expression.
9766 For example, cp_parser_initializer_clauses uses this function to
9767 determine whether a particular assignment-expression is in fact
9768 constant. */
9770 {
9771 /* Parse the binary expressions (logical-or-expression). */
9774 /* If the next token is a `?' then we're actually looking at
9775 a conditional-expression; otherwise we're done. */
9778 }
9779 else
9781 /* Restore the old settings. */
9782 parser->integral_constant_expression_p
9784 parser->allow_non_integral_constant_expression_p
9787 {
9788 /* Require an rvalue constant expression here; that's what our
9789 callers expect. Reference constant expressions are handled
9790 separately in e.g. cp_parser_template_argument. */
9799 }
9802 parser->non_integral_constant_expression_p
9806 }
9808 /* Parse __builtin_offsetof.
9810 offsetof-expression:
9811 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9813 offsetof-member-designator:
9814 id-expression
9815 | offsetof-member-designator "." id-expression
9816 | offsetof-member-designator "[" expression "]"
9817 | offsetof-member-designator "->" id-expression */
9819 static cp_expr
9821 {
9823 tree type;
9824 cp_expr expr;
9825 cp_id_kind dummy;
9827 location_t finish_loc;
9829 /* We're about to accept non-integral-constant things, but will
9830 definitely yield an integral constant expression. Save and
9831 restore these values around our local parsing. */
9837 /* Consume the "__builtin_offsetof" token. */
9839 /* Consume the opening `('. */
9840 matching_parens parens;
9842 /* Parse the type-id. */
9844 {
9846 parser->type_definition_forbidden_message
9850 }
9851 /* Look for the `,'. */
9855 /* Build the (type *)null that begins the traditional offsetof macro. */
9856 tree object_ptr
9858 tf_warning_or_error);
9860 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9864 {
9867 {
9869 /* offsetof-member-designator "[" expression "]" */
9875 /* offsetof-member-designator "->" identifier */
9878 /* FALLTHRU */
9881 /* offsetof-member-designator "." identifier */
9889 /* Consume the ")" token. */
9895 /* Error. We know the following require will fail, but
9896 that gives the proper error message. */
9901 }
9902 }
9904 success:
9905 /* Make a location of the form:
9906 __builtin_offsetof (struct s, f)
9907 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9908 with caret at the type-id, ranging from the start of the
9909 "_builtin_offsetof" token to the close paren. */
9911 /* The result will be an INTEGER_CST, so we need to explicitly
9912 preserve the location. */
9915 failure:
9921 }
9923 /* Parse a trait expression.
9925 Returns a representation of the expression, the underlying type
9926 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9928 static cp_expr
9930 {
9931 cp_trait_kind kind;
9937 {
10039 }
10041 /* Get location of initial token. */
10044 /* Consume the token. */
10047 matching_parens parens;
10050 {
10053 }
10059 {
10062 {
10065 }
10069 }
10071 {
10073 {
10077 {
10080 }
10084 }
10085 }
10090 /* Construct a location of the form:
10091 __is_trivially_copyable(_Tp)
10092 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10093 with start == caret, finishing at the close-paren. */
10096 /* Complete the trait expression, which may mean either processing
10097 the trait expr now or saving it for template instantiation. */
10099 {
10108 }
10109 }
10111 /* Parse a lambda expression.
10113 lambda-expression:
10114 lambda-introducer lambda-declarator [opt] compound-statement
10116 Returns a representation of the expression. */
10118 static cp_expr
10120 {
10122 tree type;
10130 {
10132 {
10136 }
10138 }
10140 {
10142 {
10145 }
10147 }
10149 /* We may be in the middle of deferred access check. Disable
10150 it now. */
10161 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10164 /* Now that we've started the type, add the capture fields for any
10165 explicit captures. */
10168 {
10169 /* Inside the class, surrounding template-parameter-lists do not apply. */
10170 unsigned int saved_num_template_parameter_lists
10174 bool fully_implicit_function_template_p
10178 bool auto_is_implicit_function_template_parm_p
10189 /* By virtue of defining a local class, a lambda expression has access to
10190 the private variables of enclosing classes. */
10198 {
10203 }
10205 {
10208 }
10210 /* The capture list was built up in reverse order; fix that now. */
10222 parser->fully_implicit_function_template_p
10226 parser->auto_is_implicit_function_template_parm_p
10228 }
10230 /* This field is only used during parsing of the lambda. */
10233 /* This lambda shouldn't have any proxies left at this point. */
10235 /* And now that we're done, push proxies for an enclosing lambda. */
10238 /* Update the lambda expression to a range. */
10246 else
10254 }
10256 /* Parse the beginning of a lambda expression.
10258 lambda-introducer:
10259 [ lambda-capture [opt] ]
10261 LAMBDA_EXPR is the current representation of the lambda expression. */
10263 static void
10265 {
10266 /* Need commas after the first capture. */
10269 /* Eat the leading `['. */
10272 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10280 {
10283 }
10286 {
10288 tree capture_id;
10289 tree capture_init_expr;
10293 enum capture_kind_type
10294 {
10295 BY_COPY,
10296 BY_REFERENCE
10297 };
10301 {
10304 }
10308 else
10311 /* Possibly capture `this'. */
10313 {
10324 explicit_init_p);
10326 }
10328 /* Possibly capture `*this'. */
10331 {
10342 explicit_init_p);
10344 }
10346 /* Remember whether we want to capture as a reference or not. */
10348 {
10351 }
10353 /* Get the identifier. */
10358 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10359 delimiters, but I modified this to stop on unnested ']' as well. It
10360 was already changed to stop on unnested '}', so the
10361 "closing_parenthesis" name is no more misleading with my change. */
10362 {
10368 }
10370 /* Find the initializer for this capture. */
10374 {
10376 /* An explicit initializer exists. */
10379 "lambda capture initializers "
10385 {
10388 }
10389 }
10390 else
10391 {
10394 /* Turn the identifier into an id-expression. */
10395 capture_init_expr
10400 {
10403 }
10406 {
10409 capture_init_expr);
10414 }
10417 {
10420 capture_init_expr))
10424 }
10426 capture_init_expr
10427 = finish_id_expression
10429 capture_init_expr,
10443 {
10446 }
10447 }
10451 {
10456 capture_id);
10460 "capture of %qD redundant with by-reference capture "
10462 }
10465 capture_id,
10466 capture_init_expr,
10468 explicit_init_p);
10470 /* If there is any qualification still in effect, clear it
10471 now; we will be starting fresh with the next capture. */
10475 }
10478 }
10480 /* Parse the (optional) middle of a lambda expression.
10482 lambda-declarator:
10483 < template-parameter-list [opt] >
10484 ( parameter-declaration-clause [opt] )
10485 attribute-specifier [opt]
10486 decl-specifier-seq [opt]
10487 exception-specification [opt]
10488 lambda-return-type-clause [opt]
10490 LAMBDA_EXPR is the current representation of the lambda expression. */
10492 static bool
10494 {
10495 /* 5.1.1.4 of the standard says:
10496 If a lambda-expression does not include a lambda-declarator, it is as if
10497 the lambda-declarator were ().
10498 This means an empty parameter list, no attributes, and no exception
10499 specification. */
10506 cp_decl_specifier_seq lambda_specs;
10509 /* The template-parameter-list is optional, but must begin with
10510 an opening angle if present. */
10512 {
10515 "lambda templates are only available with "
10519 "lambda templates are only available with "
10528 /* We just processed one more parameter list. */
10530 }
10532 /* The parameter-declaration-clause is optional (unless
10533 template-parameter-list was given), but must begin with an
10534 opening parenthesis if present. */
10536 {
10537 matching_parens parens;
10542 /* Parse parameters. */
10545 /* Default arguments shall not be specified in the
10546 parameter-declaration-clause of a lambda-declarator. */
10557 /* In the decl-specifier-seq of the lambda-declarator, each
10558 decl-specifier shall either be mutable or constexpr. */
10562 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10565 {
10570 }
10574 /* Parse optional exception specification. */
10577 /* Parse optional trailing return type. */
10579 {
10582 }
10584 /* The function parameters must be in scope all the way until after the
10585 trailing-return-type in case of decltype. */
10587 }
10591 /* Create the function call operator.
10593 Messing with declarators like this is no uglier than building up the
10594 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10595 other code. */
10596 {
10597 cp_decl_specifier_seq return_type_specs;
10599 tree fco;
10607 {
10611 else
10614 }
10623 VIRT_SPEC_UNSPECIFIED,
10624 REF_QUAL_NONE,
10625 tx_qual,
10626 exception_spec,
10634 declarator,
10635 attributes);
10637 {
10640 /* Give the object parameter a different name. */
10642 }
10644 {
10648 }
10657 }
10658 }
10660 /* Parse the body of a lambda expression, which is simply
10662 compound-statement
10664 but which requires special handling.
10665 LAMBDA_EXPR is the current representation of the lambda expression. */
10667 static void
10669 {
10676 else
10677 /* Still increment function_depth so that we don't GC in the
10678 middle of an expression. */
10683 /* Clear this in case we're in the middle of a default argument. */
10687 {
10691 matching_braces braces;
10694 {
10697 /* Originally C++11 required us to peek for 'return expr'; and
10698 process it specially here to deduce the return type. N3638
10699 removed the need for that. */
10707 }
10710 }
10717 else
10719 }
10721 /* Statements [gram.stmt.stmt] */
10723 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10725 static void
10727 {
10731 /* A concept is never expanded normally. */
10737 }
10739 /* Parse a statement.
10741 statement:
10742 labeled-statement
10743 expression-statement
10744 compound-statement
10745 selection-statement
10746 iteration-statement
10747 jump-statement
10748 declaration-statement
10749 try-block
10751 C++11:
10753 statement:
10754 labeled-statement
10755 attribute-specifier-seq (opt) expression-statement
10756 attribute-specifier-seq (opt) compound-statement
10757 attribute-specifier-seq (opt) selection-statement
10758 attribute-specifier-seq (opt) iteration-statement
10759 attribute-specifier-seq (opt) jump-statement
10760 declaration-statement
10761 attribute-specifier-seq (opt) try-block
10763 init-statement:
10764 expression-statement
10765 simple-declaration
10767 TM Extension:
10769 statement:
10770 atomic-statement
10772 IN_COMPOUND is true when the statement is nested inside a
10773 cp_parser_compound_statement; this matters for certain pragmas.
10775 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10776 is a (possibly labeled) if statement which is not enclosed in braces
10777 and has an else clause. This is used to implement -Wparentheses.
10779 CHAIN is a vector of if-else-if conditions. */
10781 static void
10785 {
10790 restart:
10793 /* There is no statement yet. */
10799 /* In obj-c++, seeing '[[' might be the either the beginning of
10800 c++11 attributes, or a nested objc-message-expression. So
10801 let's parse the c++11 attributes tentatively. */
10805 {
10808 }
10810 /* Peek at the next token. */
10812 /* Remember the location of the first token in the statement. */
10815 /* If this is a keyword, then that will often determine what kind of
10816 statement we have. */
10818 {
10822 {
10825 /* Looks like a labeled-statement with a case label.
10826 Parse the label, and then use tail recursion to parse
10827 the statement. */
10850 /* Objective-C++ exception-handling constructs. */
10864 /* This must be a namespace alias definition. */
10880 /* It might be a keyword like `int' that can start a
10881 declaration-statement. */
10883 }
10884 }
10886 {
10887 /* If the next token is a `:', then we are looking at a
10888 labeled-statement. */
10891 {
10892 /* Looks like a labeled-statement with an ordinary label.
10893 Parse the label, and then use tail recursion to parse
10894 the statement. */
10899 }
10900 }
10901 /* Anything that starts with a `{' must be a compound-statement. */
10904 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10905 a statement all its own. */
10907 {
10908 /* Only certain OpenMP pragmas are attached to statements, and thus
10909 are considered statements themselves. All others are not. In
10910 the context of a compound, accept the pragma as a "statement" and
10911 return so that we can check for a close brace. Otherwise we
10912 require a real statement and must go back and read one. */
10918 }
10920 {
10923 }
10925 /* Everything else must be a declaration-statement or an
10926 expression-statement. Try for the declaration-statement
10927 first, unless we are looking at a `;', in which case we know that
10928 we have an expression-statement. */
10930 {
10932 {
10934 {
10935 /* Attributes should be parsed as part of the the
10936 declaration, so let's un-parse them. */
10939 }
10942 /* Try to parse the declaration-statement. */
10944 /* If that worked, we're done. */
10947 }
10948 /* All preceding labels have been parsed at this point. */
10952 /* Look for an expression-statement instead. */
10955 /* Handle [[fallthrough]];. */
10957 {
10958 /* The next token after the fallthrough attribute is ';'. */
10960 {
10961 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10963 IFN_FALLTHROUGH,
10966 }
10967 else
10971 }
10972 }
10974 /* Set the line number for the statement. */
10978 /* Allow "[[fallthrough]];", but warn otherwise. */
10981 OPT_Wattributes,
10983 }
10985 /* Append ATTR to attribute list ATTRS. */
10987 static tree
10989 {
10995 }
10997 /* Parse the label for a labeled-statement, i.e.
10999 identifier :
11000 case constant-expression :
11001 default :
11003 GNU Extension:
11004 case constant-expression ... constant-expression : statement
11006 When a label is parsed without errors, the label is added to the
11007 parse tree by the finish_* functions, so this function doesn't
11008 have to return the label. */
11010 static void
11012 {
11017 /* The next token should be an identifier. */
11021 {
11024 }
11026 /* Remember whether this case or a user-defined label is allowed to fall
11027 through to. */
11032 {
11034 {
11038 /* Consume the `case' token. */
11040 /* Parse the constant-expression. */
11047 {
11048 /* Consume the `...' token. */
11054 /* We don't need to emit warnings here, as the common code
11055 will do this for us. */
11056 }
11057 else
11061 {
11065 }
11066 else
11069 expr);
11070 }
11074 /* Consume the `default' token. */
11078 {
11082 }
11083 else
11088 /* Anything else must be an ordinary label. */
11093 }
11095 /* Require the `:' token. */
11098 /* An ordinary label may optionally be followed by attributes.
11099 However, this is only permitted if the attributes are then
11100 followed by a semicolon. This is because, for backward
11101 compatibility, when parsing
11102 lab: __attribute__ ((unused)) int i;
11103 we want the attribute to attach to "i", not "lab". */
11106 {
11107 tree attrs;
11114 ;
11115 else
11117 }
11123 }
11125 /* Parse an expression-statement.
11127 expression-statement:
11128 expression [opt] ;
11130 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11131 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11132 indicates whether this expression-statement is part of an
11133 expression statement. */
11135 static tree
11137 {
11142 /* There might be attribute fallthrough. */
11145 /* If the next token is a ';', then there is no expression
11146 statement. */
11148 {
11152 {
11155 }
11156 }
11158 /* Handle [[fallthrough]];. */
11160 {
11161 /* The next token after the fallthrough attribute is ';'. */
11163 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11166 else
11170 }
11172 /* Allow "[[fallthrough]];", but warn otherwise. */
11177 /* Give a helpful message for "A<T>::type t;" and the like. */
11180 {
11187 {
11188 /* A::A a; */
11193 }
11194 }
11196 /* Consume the final `;'. */
11201 /* This is the final expression statement of a statement
11202 expression. */
11208 }
11210 /* Parse a compound-statement.
11212 compound-statement:
11213 { statement-seq [opt] }
11215 GNU extension:
11217 compound-statement:
11218 { label-declaration-seq [opt] statement-seq [opt] }
11220 label-declaration-seq:
11221 label-declaration
11222 label-declaration-seq label-declaration
11224 Returns a tree representing the statement. */
11226 static tree
11229 {
11230 tree compound_stmt;
11231 matching_braces braces;
11233 /* Consume the `{'. */
11240 /* Begin the compound-statement. */
11242 /* If the next keyword is `__label__' we have a label declaration. */
11245 /* Parse an (optional) statement-seq. */
11247 /* Finish the compound-statement. */
11249 /* Consume the `}'. */
11253 }
11255 /* Parse an (optional) statement-seq.
11257 statement-seq:
11258 statement
11259 statement-seq [opt] statement */
11261 static void
11263 {
11264 /* Scan statements until there aren't any more. */
11266 {
11269 /* If we are looking at a `}', then we have run out of
11270 statements; the same is true if we have reached the end
11271 of file, or have stumbled upon a stray '@end'. */
11278 /* If we are in a compound statement and find 'else' then
11279 something went wrong. */
11281 {
11284 else
11285 {
11288 }
11289 }
11291 /* Parse the statement. */
11293 }
11294 }
11296 /* Return true if this is the C++20 version of range-based-for with
11297 init-statement. */
11299 static bool
11301 {
11304 /* Save tokens so that we can put them back. */
11307 /* There has to be an unnested ; followed by an unnested :. */
11310 CPP_SEMICOLON,
11314 /* We found the semicolon, eat it now. */
11317 /* Now look for ':' that is not nested in () or {}. */
11320 CPP_COLON,
11323 out:
11324 /* Roll back the tokens we skipped. */
11328 }
11330 /* Return true if we're looking at (init; cond), false otherwise. */
11332 static bool
11334 {
11335 /* Save tokens so that we can put them back. */
11338 /* Look for ';' that is not nested in () or {}. */
11341 CPP_SEMICOLON,
11344 /* Roll back the tokens we skipped. */
11348 }
11350 /* Parse a selection-statement.
11352 selection-statement:
11353 if ( init-statement [opt] condition ) statement
11354 if ( init-statement [opt] condition ) statement else statement
11355 switch ( init-statement [opt] condition ) statement
11357 Returns the new IF_STMT or SWITCH_STMT.
11359 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11360 is a (possibly labeled) if statement which is not enclosed in
11361 braces and has an else clause. This is used to implement
11362 -Wparentheses.
11364 CHAIN is a vector of if-else-if conditions. This is used to implement
11365 -Wduplicated-cond. */
11367 static tree
11370 {
11373 token_indent_info guard_tinfo;
11378 /* Peek at the next token. */
11382 /* See what kind of keyword it is. */
11385 {
11388 {
11389 tree statement;
11390 tree condition;
11395 RID_CONSTEXPR))
11396 {
11402 }
11404 /* Look for the `('. */
11405 matching_parens parens;
11407 {
11410 }
11412 /* Begin the selection-statement. */
11414 {
11417 }
11418 else
11421 /* Parse the optional init-statement. */
11423 {
11424 tree decl;
11427 "init-statement in selection statements only available "
11430 }
11432 /* Parse the condition. */
11434 /* Look for the `)'. */
11440 {
11444 /* Add the condition. */
11451 /* Parse the then-clause. */
11455 /* Outside a template, the non-selected branch of a constexpr
11456 if is a 'discarded statement', i.e. unevaluated. */
11461 {
11464 }
11467 guard_tinfo);
11474 {
11478 }
11480 /* If the next token is `else', parse the else-clause. */
11482 RID_ELSE))
11483 {
11487 {
11490 }
11492 guard_tinfo
11494 /* Consume the `else' keyword. */
11497 {
11499 RID_IF)
11501 {
11502 /* We've got "if (COND) else if (COND2)". Start
11503 the condition chain and add COND as the first
11504 element. */
11508 {
11509 /* Wrap it in a NOP_EXPR so that we can set the
11510 location of the condition. */
11512 condition);
11515 }
11516 }
11518 RID_IF))
11519 {
11520 /* This is if-else without subsequent if. Zap the
11521 condition chain; we would have already warned at
11522 this point. */
11525 }
11526 }
11528 /* Parse the else-clause. */
11534 /* If we are currently parsing a then-clause, then
11535 IF_P will not be NULL. We set it to true to
11536 indicate that this if statement has an else clause.
11537 This may trigger the Wparentheses warning below
11538 when we get back up to the parent if statement. */
11543 {
11547 }
11548 }
11549 else
11550 {
11551 /* This if statement does not have an else clause. If
11552 NESTED_IF is true, then the then-clause has an if
11553 statement which does have an else clause. We warn
11554 about the potential ambiguity. */
11557 "suggest explicit braces to avoid ambiguous"
11560 {
11561 /* We don't need the condition chain anymore. */
11564 }
11565 }
11567 /* Now we're all done with the if-statement. */
11569 }
11570 else
11571 {
11575 /* Add the condition. */
11578 /* Parse the body of the switch-statement. */
11584 guard_tinfo);
11588 /* Now we're all done with the switch-statement. */
11590 }
11593 }
11599 }
11600 }
11602 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11603 If we have seen at least one decl-specifier, and the next token
11604 is not a parenthesis, then we must be looking at a declaration.
11605 (After "int (" we might be looking at a functional cast.) */
11607 static void
11610 {
11616 }
11618 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
11619 The declarator shall not specify a function or an array. Returns
11620 TRUE if the declarator is valid, FALSE otherwise. */
11622 static bool
11625 location_t loc)
11626 {
11630 {
11635 else
11643 }
11644 else
11646 }
11648 /* Parse a condition.
11650 condition:
11651 expression
11652 type-specifier-seq declarator = initializer-clause
11653 type-specifier-seq declarator braced-init-list
11655 GNU Extension:
11657 condition:
11658 type-specifier-seq declarator asm-specification [opt]
11659 attributes [opt] = assignment-expression
11661 Returns the expression that should be tested. */
11663 static tree
11665 {
11666 cp_decl_specifier_seq type_specifiers;
11670 /* Try the declaration first. */
11672 /* New types are not allowed in the type-specifier-seq for a
11673 condition. */
11675 parser->type_definition_forbidden_message
11677 /* Parse the type-specifier-seq. */
11679 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11682 /* Restore the saved message. */
11688 /* If all is well, we might be looking at a declaration. */
11690 {
11691 tree decl;
11692 tree asm_specification;
11693 tree attributes;
11698 /* Parse the declarator. */
11704 /* Parse the attributes. */
11706 /* Parse the asm-specification. */
11708 /* If the next token is not an `=' or '{', then we might still be
11709 looking at an expression. For example:
11711 if (A(a).x)
11713 looks like a decl-specifier-seq and a declarator -- but then
11714 there is no `=', so this is an expression. */
11719 /* If we did see an `=' or '{', then we are looking at a declaration
11720 for sure. */
11722 {
11723 tree pushed_scope;
11730 /* Create the declaration. */
11736 /* Parse the initializer. */
11738 {
11742 }
11744 {
11745 /* Consume the `='. */
11749 }
11750 else
11751 {
11754 }
11758 /* Process the initializer. */
11761 asm_specification,
11762 flags);
11768 }
11769 }
11770 /* If we didn't even get past the declarator successfully, we are
11771 definitely not looking at a declaration. */
11772 else
11775 /* Otherwise, we are looking at an expression. */
11777 }
11779 /* Parses a for-statement or range-for-statement until the closing ')',
11780 not included. */
11782 static tree
11784 {
11788 /* Begin the for-statement. */
11791 /* Parse the initialization. */
11796 else
11798 }
11800 static tree
11803 {
11804 /* Normal for loop */
11807 tree stmt;
11810 /* The init-statement has already been parsed in
11811 cp_parser_init_statement, so no work is needed here. */
11814 /* If there's a condition, process it. */
11818 {
11822 }
11824 {
11828 }
11830 /* Look for the `;'. */
11833 /* If there's an expression, process it. */
11839 }
11841 /* Tries to parse a range-based for-statement:
11843 range-based-for:
11844 decl-specifier-seq declarator : expression
11846 The decl-specifier-seq declarator and the `:' are already parsed by
11847 cp_parser_init_statement. If processing_template_decl it returns a
11848 newly created RANGE_FOR_STMT; if not, it is converted to a
11849 regular FOR_STMT. */
11851 static tree
11854 {
11861 /* Get the range declaration momentarily out of the way so that
11862 the range expression doesn't clash with it. */
11864 {
11866 {
11868 /* For decomposition declaration get all of the corresponding
11869 declarations out of the way. */
11873 {
11879 {
11885 }
11886 }
11887 }
11889 {
11894 }
11895 }
11898 {
11901 }
11902 else
11905 /* Put the range declaration(s) back into scope. */
11907 {
11911 }
11913 /* If in template, STMT is converted to a normal for-statement
11914 at instantiation. If not, it is done just ahead. */
11916 {
11926 /* do_auto_deduction doesn't mess with template init-lists. */
11929 }
11930 else
11931 {
11935 unroll);
11936 }
11938 }
11940 /* Subroutine of cp_convert_range_for: given the initializer expression,
11941 builds up the range temporary. */
11943 static tree
11945 {
11948 /* Find out the type deduced by the declaration
11949 `auto &&__range = range_expr'. */
11954 /* Create the __range variable. */
11961 }
11963 /* Used by cp_parser_range_for in template context: we aren't going to
11964 do a full conversion yet, but we still need to resolve auto in the
11965 type of the for-range-declaration if present. This is basically
11966 a shortcut version of cp_convert_range_for. */
11968 static void
11970 {
11973 {
11976 iter_type = (cp_parser_perform_range_for_lookup
11979 {
11981 iter_type);
11983 RO_UNARY_STAR,
11984 tf_warning_or_error);
11987 }
11988 }
11989 }
11991 /* Converts a range-based for-statement into a normal
11992 for-statement, as per the definition.
11994 for (RANGE_DECL : RANGE_EXPR)
11995 BLOCK
11997 should be equivalent to:
11999 {
12000 auto &&__range = RANGE_EXPR;
12001 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
12002 __begin != __end;
12003 ++__begin)
12004 {
12005 RANGE_DECL = *__begin;
12006 BLOCK
12007 }
12008 }
12010 If RANGE_EXPR is an array:
12011 BEGIN_EXPR = __range
12012 END_EXPR = __range + ARRAY_SIZE(__range)
12013 Else if RANGE_EXPR has a member 'begin' or 'end':
12014 BEGIN_EXPR = __range.begin()
12015 END_EXPR = __range.end()
12016 Else:
12017 BEGIN_EXPR = begin(__range)
12018 END_EXPR = end(__range);
12020 If __range has a member 'begin' but not 'end', or vice versa, we must
12021 still use the second alternative (it will surely fail, however).
12022 When calling begin()/end() in the third alternative we must use
12023 argument dependent lookup, but always considering 'std' as an associated
12024 namespace. */
12026 tree
12030 {
12038 /* If an error happened previously do nothing or else a lot of
12039 unhelpful errors would be issued. */
12041 else
12042 {
12043 tree range_temp;
12047 /* Can't bind a reference to an array of runtime bound. */
12049 else
12050 {
12055 LOOKUP_ONLYCONVERTING);
12057 }
12060 }
12062 /* The new for initialization statement. */
12070 LOOKUP_ONLYCONVERTING);
12081 LOOKUP_ONLYCONVERTING);
12085 /* The new for condition. */
12092 /* The new increment expression. */
12095 tf_warning_or_error);
12101 /* The declaration is initialized with *__begin inside the loop body. */
12104 tf_warning_or_error),
12106 LOOKUP_ONLYCONVERTING);
12111 }
12113 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12114 We need to solve both at the same time because the method used
12115 depends on the existence of members begin or end.
12116 Returns the type deduced for the iterator expression. */
12118 static tree
12120 {
12122 {
12125 }
12128 {
12133 }
12135 {
12136 /* If RANGE is an array, we will use pointer arithmetic. */
12139 range,
12143 }
12144 else
12145 {
12146 /* If it is not an array, we must do a bit of magic. */
12156 tf_warning_or_error);
12159 tf_warning_or_error);
12162 {
12163 /* Use the member functions. */
12166 }
12167 else
12168 {
12169 /* Use global functions with ADL. */
12176 tf_warning_or_error);
12178 tf_warning_or_error);
12180 tf_warning_or_error);
12182 tf_warning_or_error);
12185 }
12187 /* Last common checks. */
12189 {
12190 /* If one of the expressions is an error do no more checks. */
12193 }
12196 /* Can happen, when, eg, in a template context, Koenig lookup
12197 can't resolve begin/end (c++/58503). */
12199 else
12200 {
12202 /* The unqualified type of the __begin and __end temporaries should
12203 be the same, as required by the multiple auto declaration. */
12205 {
12212 /* P0184R0 allows __begin and __end to have different types,
12213 but make sure they are comparable so we can give a better
12215 else
12219 }
12221 }
12222 }
12223 }
12225 /* Helper function for cp_parser_perform_range_for_lookup.
12226 Builds a tree for RANGE.IDENTIFIER(). */
12228 static tree
12230 {
12243 tf_warning_or_error);
12246 }
12248 /* Parse an iteration-statement.
12250 iteration-statement:
12251 while ( condition ) statement
12252 do statement while ( expression ) ;
12253 for ( init-statement condition [opt] ; expression [opt] )
12254 statement
12256 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12258 static tree
12261 {
12264 tree statement;
12266 token_indent_info guard_tinfo;
12268 /* Peek at the next token. */
12275 /* Remember whether or not we are already within an iteration
12276 statement. */
12279 /* See what kind of keyword it is. */
12282 {
12284 {
12285 tree condition;
12287 /* Begin the while-statement. */
12289 /* Look for the `('. */
12290 matching_parens parens;
12292 /* Parse the condition. */
12295 /* Look for the `)'. */
12297 /* Parse the dependent statement. */
12303 /* We're done with the while-statement. */
12305 }
12309 {
12310 tree expression;
12312 /* Begin the do-statement. */
12314 /* Parse the body of the do-statement. */
12321 /* Look for the `while' keyword. */
12323 /* Look for the `('. */
12324 matching_parens parens;
12326 /* Parse the expression. */
12328 /* We're done with the do-statement. */
12330 /* Look for the `)'. */
12332 /* Look for the `;'. */
12334 }
12338 {
12339 /* Look for the `('. */
12340 matching_parens parens;
12345 /* Look for the `)'. */
12348 /* Parse the body of the for-statement. */
12355 /* We're done with the for-statement. */
12357 }
12364 }
12367 }
12369 /* Parse a init-statement or the declarator of a range-based-for.
12370 Returns true if a range-based-for declaration is seen.
12372 init-statement:
12373 expression-statement
12374 simple-declaration */
12376 static bool
12378 {
12379 /* If the next token is a `;', then we have an empty
12380 expression-statement. Grammatically, this is also a
12381 simple-declaration, but an invalid one, because it does not
12382 declare anything. Therefore, if we did not handle this case
12383 specially, we would issue an error message about an invalid
12384 declaration. */
12386 {
12390 /* Try to parse the init-statement. */
12392 {
12393 tree dummy;
12395 /* Parse the declaration. */
12401 /* That didn't work, try to parse it as an expression-statement. */
12405 {
12407 "range-based %<for%> loops with initializer only "
12410 }
12411 }
12413 /* A colon is used in range-based for. */
12416 /* We're going to speculatively look for a declaration, falling back
12417 to an expression, if necessary. */
12419 /* Parse the declaration. */
12422 decl);
12425 {
12426 /* It is a range-for, consume the ':'. */
12431 "range-based %<for%> loops only available with "
12433 }
12434 else
12435 /* The ';' is not consumed yet because we told
12436 cp_parser_simple_declaration not to. */
12441 /* If the tentative parse failed, then we shall need to look for an
12442 expression-statement. */
12443 }
12444 /* If we are here, it is an expression-statement. */
12447 }
12449 /* Parse a jump-statement.
12451 jump-statement:
12452 break ;
12453 continue ;
12454 return expression [opt] ;
12455 return braced-init-list ;
12456 goto identifier ;
12458 GNU extension:
12460 jump-statement:
12461 goto * expression ;
12463 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12465 static tree
12467 {
12473 /* Peek at the next token. */
12478 /* See what kind of keyword it is. */
12481 {
12485 {
12502 }
12508 {
12512 /* Fall through. */
12522 }
12527 {
12528 tree expr;
12532 {
12536 }
12539 else
12540 /* If the next token is a `;', then there is no
12541 expression. */
12543 /* Build the return-statement. */
12546 else
12548 /* Look for the final `;'. */
12550 }
12556 {
12559 }
12561 /* Create the goto-statement. */
12563 {
12564 /* Issue a warning about this use of a GNU extension. */
12566 /* Consume the '*' token. */
12568 /* Parse the dependent expression. */
12570 }
12571 else
12573 /* Look for the final `;'. */
12580 }
12583 }
12585 /* Parse a declaration-statement.
12587 declaration-statement:
12588 block-declaration */
12590 static void
12592 {
12595 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12598 /* Parse the block-declaration. */
12601 /* Free any declarators allocated. */
12603 }
12605 /* Some dependent statements (like `if (cond) statement'), are
12606 implicitly in their own scope. In other words, if the statement is
12607 a single statement (as opposed to a compound-statement), it is
12608 none-the-less treated as if it were enclosed in braces. Any
12609 declarations appearing in the dependent statement are out of scope
12610 after control passes that point. This function parses a statement,
12611 but ensures that is in its own scope, even if it is not a
12612 compound-statement.
12614 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12615 is a (possibly labeled) if statement which is not enclosed in
12616 braces and has an else clause. This is used to implement
12617 -Wparentheses.
12619 CHAIN is a vector of if-else-if conditions. This is used to implement
12620 -Wduplicated-cond.
12622 Returns the new statement. */
12624 static tree
12628 {
12629 tree statement;
12632 token_indent_info body_tinfo
12638 /* Mark if () ; with a special NOP_EXPR. */
12640 {
12651 }
12652 /* if a compound is opened, we simply parse the statement directly. */
12655 /* If the token is not a `{', then we must take special action. */
12656 else
12657 {
12658 /* Create a compound-statement. */
12660 /* Parse the dependent-statement. */
12663 /* Finish the dummy compound-statement. */
12665 }
12667 token_indent_info next_tinfo
12676 /* Return the statement. */
12678 }
12680 /* For some dependent statements (like `while (cond) statement'), we
12681 have already created a scope. Therefore, even if the dependent
12682 statement is a compound-statement, we do not want to create another
12683 scope. */
12685 static void
12688 {
12689 /* If the token is a `{', then we must take special action. */
12691 {
12692 token_indent_info body_tinfo
12698 token_indent_info next_tinfo
12707 }
12708 else
12709 {
12710 /* Avoid calling cp_parser_compound_statement, so that we
12711 don't create a new scope. Do everything else by hand. */
12712 matching_braces braces;
12714 /* If the next keyword is `__label__' we have a label declaration. */
12717 /* Parse an (optional) statement-seq. */
12720 }
12721 }
12723 /* Declarations [gram.dcl.dcl] */
12725 /* Parse an optional declaration-sequence.
12727 declaration-seq:
12728 declaration
12729 declaration-seq declaration */
12731 static void
12733 {
12735 {
12746 {
12747 /* A declaration consisting of a single semicolon is
12748 invalid. Allow it unless we're being pedantic. */
12753 }
12755 /* If we're entering or exiting a region that's implicitly
12756 extern "C", modify the lang context appropriately. */
12758 {
12761 }
12763 {
12766 }
12769 {
12770 /* A top-level declaration can consist solely of a #pragma.
12771 A nested declaration cannot, so this is done here and not
12772 in cp_parser_declaration. (A #pragma at block scope is
12773 handled in cp_parser_statement.) */
12776 }
12778 /* Parse the declaration itself. */
12780 }
12781 }
12783 /* Parse a declaration.
12785 declaration:
12786 block-declaration
12787 function-definition
12788 template-declaration
12789 explicit-instantiation
12790 explicit-specialization
12791 linkage-specification
12792 namespace-definition
12794 C++17:
12795 deduction-guide
12797 GNU extension:
12799 declaration:
12800 __extension__ declaration */
12802 static void
12804 {
12805 cp_token token1;
12806 cp_token token2;
12811 /* Check for the `__extension__' keyword. */
12813 {
12814 /* Parse the qualified declaration. */
12816 /* Restore the PEDANTIC flag. */
12820 }
12822 /* Try to figure out what kind of declaration is present. */
12827 else
12828 {
12831 }
12833 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12836 /* If the next token is `extern' and the following token is a string
12837 literal, then we have a linkage specification. */
12841 /* If the next token is `template', then we have either a template
12842 declaration, an explicit instantiation, or an explicit
12843 specialization. */
12845 {
12846 /* `template <>' indicates a template specialization. */
12850 /* `template <' indicates a template declaration. */
12853 /* Anything else must be an explicit instantiation. */
12854 else
12856 }
12857 /* If the next token is `export', then we have a template
12858 declaration. */
12861 /* If the next token is `extern', 'static' or 'inline' and the one
12862 after that is `template', we have a GNU extended explicit
12863 instantiation directive. */
12870 /* If the next token is `namespace', check for a named or unnamed
12871 namespace definition. */
12880 /* An unnamed namespace definition. */
12884 /* An inline (associated) namespace definition. */
12888 /* Objective-C++ declaration/definition. */
12895 /* At this point we may have a template declared by a concept
12896 introduction. */
12901 else
12902 /* Try to parse a block-declaration, or a function-definition. */
12905 /* Free any declarators allocated. */
12907 }
12909 /* Parse a block-declaration.
12911 block-declaration:
12912 simple-declaration
12913 asm-definition
12914 namespace-alias-definition
12915 using-declaration
12916 using-directive
12918 GNU Extension:
12920 block-declaration:
12921 __extension__ block-declaration
12923 C++0x Extension:
12925 block-declaration:
12926 static_assert-declaration
12928 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12929 part of a declaration-statement. */
12931 static void
12934 {
12938 /* Check for the `__extension__' keyword. */
12940 {
12941 /* Parse the qualified declaration. */
12943 /* Restore the PEDANTIC flag. */
12947 }
12949 /* Peek at the next token to figure out which kind of declaration is
12950 present. */
12953 /* If the next keyword is `asm', we have an asm-definition. */
12955 {
12959 }
12960 /* If the next keyword is `namespace', we have a
12961 namespace-alias-definition. */
12964 /* If the next keyword is `using', we have a
12965 using-declaration, a using-directive, or an alias-declaration. */
12967 {
12972 /* If the token after `using' is `namespace', then we have a
12973 using-directive. */
12977 /* If the second token after 'using' is '=', then we have an
12978 alias-declaration. */
12984 /* Otherwise, it's a using-declaration. */
12985 else
12988 }
12989 /* If the next keyword is `__label__' we have a misplaced label
12990 declaration. */
12992 {
12996 /* If the next token is now a `;', consume it. */
12999 }
13000 /* If the next token is `static_assert' we have a static assertion. */
13003 /* Anything else must be a simple-declaration. */
13004 else
13007 }
13009 /* Parse a simple-declaration.
13011 simple-declaration:
13012 decl-specifier-seq [opt] init-declarator-list [opt] ;
13013 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13014 brace-or-equal-initializer ;
13016 init-declarator-list:
13017 init-declarator
13018 init-declarator-list , init-declarator
13020 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
13021 function-definition as a simple-declaration.
13023 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
13024 parsed declaration if it is an uninitialized single declarator not followed
13025 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
13026 if present, will not be consumed. */
13028 static void
13032 {
13033 cp_decl_specifier_seq decl_specifiers;
13042 /* Defer access checks until we know what is being declared; the
13043 checks for names appearing in the decl-specifier-seq should be
13044 done as if we were in the scope of the thing being declared. */
13047 /* Parse the decl-specifier-seq. We have to keep track of whether
13048 or not the decl-specifier-seq declares a named class or
13049 enumeration type, since that is the only case in which the
13050 init-declarator-list is allowed to be empty.
13052 [dcl.dcl]
13054 In a simple-declaration, the optional init-declarator-list can be
13055 omitted only when declaring a class or enumeration, that is when
13056 the decl-specifier-seq contains either a class-specifier, an
13057 elaborated-type-specifier, or an enum-specifier. */
13059 CP_PARSER_FLAGS_OPTIONAL,
13062 /* We no longer need to defer access checks. */
13065 /* In a block scope, a valid declaration must always have a
13066 decl-specifier-seq. By not trying to parse declarators, we can
13067 resolve the declaration/expression ambiguity more quickly. */
13070 {
13073 }
13075 /* If the next two tokens are both identifiers, the code is
13076 erroneous. The usual cause of this situation is code like:
13078 T t;
13080 where "T" should name a type -- but does not. */
13083 {
13084 /* If parsing tentatively, we should commit; we really are
13085 looking at a declaration. */
13087 /* Give up. */
13089 }
13094 /* Look for C++17 decomposition declaration. */
13102 {
13103 tree decl
13105 maybe_range_for_decl,
13108 /* The next token should be either a `,' or a `;'. */
13110 /* If it's a `;', we are done. */
13114 {
13118 }
13119 /* Anything else is an error. */
13120 else
13121 {
13122 /* If we have already issued an error message we don't need
13123 to issue another one. */
13128 /* Skip tokens until we reach the end of the statement. */
13130 /* If the next token is now a `;', consume it. */
13134 }
13135 }
13136 else
13139 tree last_type;
13141 /* NULL_TREE if both variable and function declaration are allowed,
13142 error_mark_node if function declaration are not allowed and
13143 a FUNCTION_DECL that should be diagnosed if it is followed by
13144 variable declarations. */
13145 tree auto_function_declaration;
13148 auto_specifier_p
13152 /* Keep going until we hit the `;' at the end of the simple
13153 declaration. */
13156 CPP_SEMICOLON))
13157 {
13160 tree decl;
13164 {
13165 /* If we are processing next declarator, comma is expected */
13170 {
13174 }
13175 }
13176 else
13179 /* Parse the init-declarator. */
13182 function_definition_allowed_p,
13184 declares_class_or_enum,
13186 maybe_range_for_decl,
13189 /* If an error occurred while parsing tentatively, exit quickly.
13190 (That usually happens when in the body of a function; each
13191 statement is treated as a declaration-statement until proven
13192 otherwise.) */
13197 {
13198 /* If the init-declarator-list contains more than one
13199 init-declarator, they shall all form declarations of
13200 variables. */
13202 auto_function_declaration
13206 {
13208 "non-variable %qD in declaration with more than one "
13213 }
13214 }
13218 {
13222 {
13223 /* If the list of declarators contains more than one declarator,
13224 the type of each declared variable is determined as described
13225 above. If the type deduced for the template parameter U is not
13226 the same in each deduction, the program is ill-formed. */
13231 }
13232 else
13234 }
13236 /* Handle function definitions specially. */
13238 {
13239 /* If the next token is a `,', then we are probably
13240 processing something like:
13242 void f() {}, *p;
13244 which is erroneous. */
13246 {
13249 "mixing"
13251 }
13252 /* Otherwise, we're done with the list of declarators. */
13253 else
13254 {
13257 }
13258 }
13261 /* The next token should be either a `,' or a `;'. */
13263 /* If it's a `,', there are more declarators to come. */
13266 /* If it's a `;', we are done. */
13270 {
13275 }
13276 /* Anything else is an error. */
13277 else
13278 {
13279 /* If we have already issued an error message we don't need
13280 to issue another one. */
13285 /* Skip tokens until we reach the end of the statement. */
13287 /* If the next token is now a `;', consume it. */
13291 }
13292 /* After the first time around, a function-definition is not
13293 allowed -- even if it was OK at first. For example:
13295 int i, f() {}
13297 is not valid. */
13299 }
13301 /* Issue an error message if no declarators are present, and the
13302 decl-specifier-seq does not itself declare a class or
13303 enumeration: [dcl.dcl]/3. */
13305 {
13307 {
13311 /* Ensure an error is issued anyway when finish_decltype_type,
13312 called via cp_parser_decl_specifier_seq, returns a class or
13313 an enumeration (c++/51786). */
13316 }
13317 /* Perform any deferred access checks. */
13319 }
13321 /* Consume the `;'. */
13322 finish:
13326 {
13332 }
13334 done:
13336 }
13338 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13339 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13340 initializer ; */
13342 static tree
13347 {
13352 /* Parse the identifier-list. */
13356 {
13364 }
13368 {
13374 else
13375 {
13378 }
13379 }
13385 tree pushed_scope;
13392 NULL_TREE);
13399 cp_expr e;
13400 cp_decl_specifier_seq decl_specs;
13405 {
13408 else
13411 tree elt_pushed_scope;
13417 {
13418 /* Ensure we've diagnosed redeclaration if we aren't creating
13419 a new VAR_DECL. */
13422 }
13423 else
13427 }
13430 {
13433 }
13437 {
13445 || (is_direct_init
13448 {
13452 }
13455 {
13460 }
13461 }
13463 {
13465 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13466 the underlying DECL. */
13468 }
13474 {
13477 }
13480 }
13482 /* Parse a decl-specifier-seq.
13484 decl-specifier-seq:
13485 decl-specifier-seq [opt] decl-specifier
13486 decl-specifier attribute-specifier-seq [opt] (C++11)
13488 decl-specifier:
13489 storage-class-specifier
13490 type-specifier
13491 function-specifier
13492 friend
13493 typedef
13495 GNU Extension:
13497 decl-specifier:
13498 attributes
13500 Concepts Extension:
13502 decl-specifier:
13503 concept
13505 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13507 The parser flags FLAGS is used to control type-specifier parsing.
13509 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13510 flags:
13512 1: one of the decl-specifiers is an elaborated-type-specifier
13513 (i.e., a type declaration)
13514 2: one of the decl-specifiers is an enum-specifier or a
13515 class-specifier (i.e., a type definition)
13517 */
13519 static void
13521 cp_parser_flags flags,
13524 {
13528 cp_decl_spec ds;
13530 /* Clear DECL_SPECS. */
13533 /* Assume no class or enumeration type is declared. */
13536 /* Keep reading specifiers until there are no more to read. */
13538 {
13543 /* Peek at the next token. */
13546 /* Save the first token of the decl spec list for error
13547 reporting. */
13550 /* Handle attributes. */
13552 {
13553 /* Parse the attributes. */
13556 /* In a sequence of declaration specifiers, c++11 attributes
13557 appertain to the type that precede them. In that case
13558 [dcl.spec]/1 says:
13560 The attribute-specifier-seq affects the type only for
13561 the declaration it appears in, not other declarations
13562 involving the same type.
13564 But for now let's force the user to position the
13565 attribute either at the beginning of the declaration or
13566 after the declarator-id, which would clearly mean that it
13567 applies to the declarator. */
13569 {
13571 /* The c++11 attribute is at the beginning of the
13572 declaration. It appertains to the entity being
13574 else
13575 {
13577 {
13578 /* This is an attribute following a
13579 class-specifier. */
13584 }
13585 else
13586 {
13587 decl_specs->std_attributes
13591 }
13593 }
13594 }
13596 decl_specs->attributes
13601 }
13602 /* Assume we will find a decl-specifier keyword. */
13604 /* If the next token is an appropriate keyword, we can simply
13605 add it to the list. */
13607 {
13608 /* decl-specifier:
13609 friend
13610 constexpr */
13613 {
13618 }
13619 else
13620 {
13622 /* Consume the token. */
13624 }
13637 /* function-specifier:
13638 inline
13639 virtual
13640 explicit */
13647 /* decl-specifier:
13648 typedef */
13651 /* Consume the token. */
13653 /* A constructor declarator cannot appear in a typedef. */
13655 /* The "typedef" keyword can only occur in a declaration; we
13656 may as well commit at this point. */
13663 /* storage-class-specifier:
13664 auto
13665 register
13666 static
13667 extern
13668 mutable
13670 GNU Extension:
13671 thread */
13674 {
13675 /* Consume the token. */
13678 /* Complain about `auto' as a storage specifier, if
13679 we're complaining about C++0x compatibility. */
13683 "%<auto%> changes meaning in C++11; "
13686 /* Set the storage class anyway. */
13688 token);
13689 }
13690 else
13691 /* C++0x auto type-specifier. */
13699 /* Consume the token. */
13702 token);
13705 /* Consume the token. */
13711 /* We did not yet find a decl-specifier yet. */
13714 }
13731 /* Constructors are a special case. The `S' in `S()' is not a
13732 decl-specifier; it is the beginning of the declarator. */
13733 constructor_p
13734 = (!found_decl_spec
13735 && constructor_possible_p
13736 && (cp_parser_constructor_declarator_p
13739 /* If we don't have a DECL_SPEC yet, then we must be looking at
13740 a type-specifier. */
13742 {
13745 tree type_spec;
13747 type_spec
13749 decl_specs,
13755 /* If this type-specifier referenced a user-defined type
13756 (a typedef, class-name, etc.), then we can't allow any
13757 more such type-specifiers henceforth.
13759 [dcl.spec]
13761 The longest sequence of decl-specifiers that could
13762 possibly be a type name is taken as the
13763 decl-specifier-seq of a declaration. The sequence shall
13764 be self-consistent as described below.
13766 [dcl.type]
13768 As a general rule, at most one type-specifier is allowed
13769 in the complete decl-specifier-seq of a declaration. The
13770 only exceptions are the following:
13772 -- const or volatile can be combined with any other
13773 type-specifier.
13775 -- signed or unsigned can be combined with char, long,
13776 short, or int.
13778 -- ..
13780 Example:
13782 typedef char* Pc;
13783 void g (const int Pc);
13785 Here, Pc is *not* part of the decl-specifier seq; it's
13786 the declarator. Therefore, once we see a type-specifier
13787 (other than a cv-qualifier), we forbid any additional
13788 user-defined types. We *do* still allow things like `int
13789 int' to be considered a decl-specifier-seq, and issue the
13790 error message later. */
13793 /* A constructor declarator cannot follow a type-specifier. */
13795 {
13803 }
13804 }
13806 /* If we still do not have a DECL_SPEC, then there are no more
13807 decl-specifiers. */
13812 /* After we see one decl-specifier, further decl-specifiers are
13813 always optional. */
13815 }
13817 /* Don't allow a friend specifier with a class definition. */
13822 }
13824 /* Parse an (optional) storage-class-specifier.
13826 storage-class-specifier:
13827 auto
13828 register
13829 static
13830 extern
13831 mutable
13833 GNU Extension:
13835 storage-class-specifier:
13836 thread
13838 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13840 static tree
13842 {
13844 {
13848 /* Fall through for C++98. */
13856 /* Consume the token. */
13861 }
13862 }
13864 /* Parse an (optional) function-specifier.
13866 function-specifier:
13867 inline
13868 virtual
13869 explicit
13871 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13872 Updates DECL_SPECS, if it is non-NULL. */
13874 static tree
13877 {
13880 {
13886 /* 14.5.2.3 [temp.mem]
13888 A member function template shall not be virtual. */
13892 else
13902 }
13904 /* Consume the token. */
13906 }
13908 /* Parse a linkage-specification.
13910 linkage-specification:
13911 extern string-literal { declaration-seq [opt] }
13912 extern string-literal declaration */
13914 static void
13916 {
13917 tree linkage;
13919 /* Look for the `extern' keyword. */
13920 cp_token *extern_token
13923 /* Look for the string-literal. */
13927 /* Transform the literal into an identifier. If the literal is a
13928 wide-character string, or contains embedded NULs, then we can't
13929 handle it as the user wants. */
13932 {
13934 /* Assume C++ linkage. */
13936 }
13937 else
13940 /* We're now using the new linkage. */
13943 /* Preserve the location of the the innermost linkage specification,
13944 tracking the locations of nested specifications via a local. */
13945 location_t saved_location
13947 /* Construct a location ranging from the start of the "extern" to
13948 the end of the string-literal, with the caret at the start, e.g.:
13949 extern "C" {
13950 ^~~~~~~~~~
13951 */
13952 parser->innermost_linkage_specification_location
13957 /* If the next token is a `{', then we're using the first
13958 production. */
13960 {
13964 /* Consume the `{' token. */
13965 matching_braces braces;
13967 /* Parse the declarations. */
13969 /* Look for the closing `}'. */
13971 }
13972 /* Otherwise, there's just one declaration. */
13973 else
13974 {
13977 saved_in_unbraced_linkage_specification_p
13981 parser->in_unbraced_linkage_specification_p
13983 }
13985 /* We're done with the linkage-specification. */
13988 /* Restore location of parent linkage specification, if any. */
13990 }
13992 /* Parse a static_assert-declaration.
13994 static_assert-declaration:
13995 static_assert ( constant-expression , string-literal ) ;
13996 static_assert ( constant-expression ) ; (C++17)
13998 If MEMBER_P, this static_assert is a class member. */
14000 static void
14002 {
14003 cp_expr condition;
14004 location_t token_loc;
14005 tree message;
14008 /* Peek at the `static_assert' token so we can keep track of exactly
14009 where the static assertion started. */
14012 /* Look for the `static_assert' keyword. */
14014 RT_STATIC_ASSERT))
14017 /* We know we are in a static assertion; commit to any tentative
14018 parse. */
14022 /* Parse the `(' starting the static assertion condition. */
14023 matching_parens parens;
14026 /* Parse the constant-expression. Allow a non-constant expression
14027 here in order to give better diagnostics in finish_static_assert. */
14028 condition =
14034 {
14037 "static_assert without a message "
14039 /* Eat the ')' */
14044 }
14045 else
14046 {
14047 /* Parse the separating `,'. */
14050 /* Parse the string-literal message. */
14055 /* A `)' completes the static assertion. */
14061 }
14063 /* A semicolon terminates the declaration. */
14066 /* Get the location for the static assertion. Use that of the
14067 condition if available, otherwise, use that of the "static_assert"
14068 token. */
14073 /* Complete the static assertion, which may mean either processing
14074 the static assert now or saving it for template instantiation. */
14076 }
14078 /* Parse the expression in decltype ( expression ). */
14080 static tree
14083 {
14085 tree expr;
14087 /* Since we're going to preserve any side-effects from this parse, set up a
14088 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14089 in the expression. */
14092 /* First, try parsing an id-expression. */
14103 {
14106 cp_id_kind idk;
14110 /* Lookup the name we got back from the id-expression. */
14115 /* A template without args is not a complete id-expression. */
14124 {
14125 /* Complete lookup of the id-expression. */
14126 expr = (finish_id_expression
14139 /* We found an id-expression, but it was something that we
14140 should not have found. This is an error, not something
14141 we can recover from, so note that we found an
14142 id-expression and we'll recover as gracefully as
14143 possible. */
14145 }
14150 /* We have an id-expression. */
14152 }
14155 {
14156 /* Abort the id-expression parse. */
14159 /* Parsing tentatively, again. */
14162 /* Parse a class member access. */
14170 /* We have an id-expression. */
14172 }
14175 /* We have parsed the complete id-expression or member access. */
14177 else
14178 {
14179 /* Abort our attempt to parse an id-expression or member access
14180 expression. */
14183 /* Commit to the tentative_firewall so we get syntax errors. */
14186 /* Parse a full expression. */
14189 }
14192 }
14194 /* Parse a `decltype' type. Returns the type.
14196 simple-type-specifier:
14197 decltype ( expression )
14198 C++14 proposal:
14199 decltype ( auto ) */
14201 static tree
14203 {
14208 {
14209 /* Already parsed. */
14212 }
14214 /* Look for the `decltype' token. */
14218 /* Parse the opening `('. */
14219 matching_parens parens;
14229 /* decltype (auto) */
14231 else
14232 {
14233 /* decltype (expression) */
14235 /* Types cannot be defined in a `decltype' expression. Save away the
14236 old message and set the new one. */
14238 parser->type_definition_forbidden_message
14241 /* The restrictions on constant-expressions do not apply inside
14242 decltype expressions. */
14243 bool saved_integral_constant_expression_p
14245 bool saved_non_integral_constant_expression_p
14249 /* Within a parenthesized expression, a `>' token is always
14250 the greater-than operator. */
14251 bool saved_greater_than_is_operator_p
14255 /* Do not actually evaluate the expression. */
14258 /* Do not warn about problems with the expression. */
14263 /* Go back to evaluating expressions. */
14267 /* The `>' token might be the end of a template-id or
14268 template-parameter-list now. */
14269 parser->greater_than_is_operator_p
14272 /* Restore the old message and the integral constant expression
14273 flags. */
14275 parser->integral_constant_expression_p
14277 parser->non_integral_constant_expression_p
14279 }
14281 /* Parse to the closing `)'. */
14283 {
14288 }
14291 {
14292 /* Build auto. */
14295 }
14296 else
14298 tf_warning_or_error);
14300 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14301 it again. */
14312 }
14314 /* Special member functions [gram.special] */
14316 /* Parse a conversion-function-id.
14318 conversion-function-id:
14319 operator conversion-type-id
14321 Returns an IDENTIFIER_NODE representing the operator. */
14323 static tree
14325 {
14326 tree type;
14327 tree saved_scope;
14328 tree saved_qualifying_scope;
14329 tree saved_object_scope;
14332 /* Look for the `operator' token. */
14335 /* When we parse the conversion-type-id, the current scope will be
14336 reset. However, we need that information in able to look up the
14337 conversion function later, so we save it here. */
14341 /* We must enter the scope of the class so that the names of
14342 entities declared within the class are available in the
14343 conversion-type-id. For example, consider:
14345 struct S {
14346 typedef int I;
14347 operator I();
14348 };
14350 S::operator I() { ... }
14352 In order to see that `I' is a type-name in the definition, we
14353 must be in the scope of `S'. */
14356 /* Parse the conversion-type-id. */
14358 /* Leave the scope of the class, if any. */
14361 /* Restore the saved scope. */
14365 /* If the TYPE is invalid, indicate failure. */
14369 }
14371 /* Parse a conversion-type-id:
14373 conversion-type-id:
14374 type-specifier-seq conversion-declarator [opt]
14376 Returns the TYPE specified. */
14378 static tree
14380 {
14381 tree attributes;
14382 cp_decl_specifier_seq type_specifiers;
14384 tree type_specified;
14387 /* Parse the attributes. */
14391 parser->type_definition_forbidden_message
14394 /* Parse the type-specifiers. */
14401 /* If that didn't work, stop. */
14404 /* Parse the conversion-declarator. */
14412 /* Don't give this error when parsing tentatively. This happens to
14413 work because we always parse this definitively once. */
14416 {
14418 {
14421 }
14425 }
14428 }
14430 /* Parse an (optional) conversion-declarator.
14432 conversion-declarator:
14433 ptr-operator conversion-declarator [opt]
14435 */
14439 {
14442 cp_cv_quals cv_quals;
14444 /* We don't know if there's a ptr-operator next, or not. */
14446 /* Try the ptr-operator. */
14449 /* If it worked, look for more conversion-declarators. */
14451 {
14454 /* Parse another optional declarator. */
14457 declarator = cp_parser_make_indirect_declarator
14461 }
14464 }
14466 /* Parse an (optional) ctor-initializer.
14468 ctor-initializer:
14469 : mem-initializer-list */
14471 static void
14473 {
14474 /* If the next token is not a `:', then there is no
14475 ctor-initializer. */
14477 {
14478 /* Do default initialization of any bases and members. */
14482 }
14484 /* Consume the `:' token. */
14486 /* And the mem-initializer-list. */
14488 }
14490 /* Parse a mem-initializer-list.
14492 mem-initializer-list:
14493 mem-initializer ... [opt]
14494 mem-initializer ... [opt] , mem-initializer-list */
14496 static void
14498 {
14503 /* Let the semantic analysis code know that we are starting the
14504 mem-initializer-list. */
14509 /* Loop through the list. */
14511 {
14512 tree mem_initializer;
14515 /* Parse the mem-initializer. */
14517 /* If the next token is a `...', we're expanding member initializers. */
14523 {
14524 /* Consume the `...'. */
14528 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14529 can be expanded but members cannot. */
14532 {
14537 }
14539 /* Construct the pack expansion type. */
14542 }
14545 {
14549 }
14550 /* Look for a target constructor. */
14554 {
14557 {
14561 }
14563 }
14564 /* Add it to the list, unless it was erroneous. */
14566 {
14569 }
14570 /* If the next token is not a `,', we're done. */
14573 /* Consume the `,' token. */
14575 }
14577 /* Perform semantic analysis. */
14580 }
14582 /* Parse a mem-initializer.
14584 mem-initializer:
14585 mem-initializer-id ( expression-list [opt] )
14586 mem-initializer-id braced-init-list
14588 GNU extension:
14590 mem-initializer:
14591 ( expression-list [opt] )
14593 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14594 class) or FIELD_DECL (for a non-static data member) to initialize;
14595 the TREE_VALUE is the expression-list. An empty initialization
14596 list is represented by void_list_node. */
14598 static tree
14600 {
14601 tree mem_initializer_id;
14602 tree expression_list;
14603 tree member;
14606 /* Find out what is being initialized. */
14608 {
14612 }
14613 else
14614 {
14618 }
14624 {
14631 }
14632 else
14633 {
14643 }
14653 }
14655 /* Parse a mem-initializer-id.
14657 mem-initializer-id:
14658 :: [opt] nested-name-specifier [opt] class-name
14659 decltype-specifier (C++11)
14660 identifier
14662 Returns a TYPE indicating the class to be initialized for the first
14663 production (and the second in C++11). Returns an IDENTIFIER_NODE
14664 indicating the data member to be initialized for the last production. */
14666 static tree
14668 {
14672 tree id;
14676 /* `typename' is not allowed in this context ([temp.res]). */
14678 {
14680 "keyword %<typename%> not allowed in this context (a qualified "
14683 }
14684 /* Look for the optional `::' operator. */
14685 global_scope_p
14689 /* Look for the optional nested-name-specifier. The simplest way to
14690 implement:
14692 [temp.res]
14694 The keyword `typename' is not permitted in a base-specifier or
14695 mem-initializer; in these contexts a qualified name that
14696 depends on a template-parameter is implicitly assumed to be a
14697 type name.
14699 is to assume that we have seen the `typename' keyword at this
14700 point. */
14701 nested_name_specifier_p
14710 /* If there is a `::' operator or a nested-name-specifier, then we
14711 are definitely looking for a class-name. */
14716 typename_type,
14720 /* Otherwise, we could also be looking for an ordinary identifier. */
14723 /* Try a decltype-specifier. */
14725 else
14726 /* Otherwise, try a class-name. */
14730 none_type,
14734 /* If we found one, we're done. */
14737 /* Otherwise, look for an ordinary identifier. */
14739 }
14741 /* Overloading [gram.over] */
14743 /* Parse an operator-function-id.
14745 operator-function-id:
14746 operator operator
14748 Returns an IDENTIFIER_NODE for the operator which is a
14749 human-readable spelling of the identifier, e.g., `operator +'. */
14751 static cp_expr
14753 {
14754 /* Look for the `operator' keyword. */
14757 /* And then the name of the operator itself. */
14759 }
14761 /* Return an identifier node for a user-defined literal operator.
14762 The suffix identifier is chained to the operator name identifier. */
14764 tree
14766 {
14767 tree identifier;
14774 }
14776 /* Parse an operator.
14778 operator:
14779 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14780 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14781 || ++ -- , ->* -> () []
14783 GNU Extensions:
14785 operator:
14786 <? >? <?= >?=
14788 Returns an IDENTIFIER_NODE for the operator which is a
14789 human-readable spelling of the identifier, e.g., `operator +'. */
14791 static cp_expr
14793 {
14798 /* Peek at the next token. */
14803 /* Figure out which operator we have. */
14808 {
14810 {
14811 /* The keyword should be either `new' or `delete'. */
14816 else
14819 /* Consume the `new' or `delete' token. */
14822 /* Peek at the next token. */
14824 /* If it's a `[' token then this is the array variant of the
14825 operator. */
14827 {
14828 /* Consume the `[' token. */
14830 /* Look for the `]' token. */
14835 }
14839 }
14997 {
14998 /* Consume the `('. */
14999 matching_parens parens;
15001 /* Look for the matching `)'. */
15006 }
15009 /* Consume the `['. */
15011 /* Look for the matching `]'. */
15020 /* FALLTHRU */
15029 {
15036 /* Consume the string. */
15042 {
15045 }
15046 else
15047 {
15049 /* Look for the suffix identifier. */
15054 {
15058 }
15059 else
15060 {
15063 }
15064 }
15069 {
15072 }
15075 {
15078 }
15080 {
15083 }
15085 }
15088 /* Anything else is an error. */
15090 }
15092 /* If we have selected an identifier, we need to consume the
15093 operator token. */
15095 {
15099 }
15100 /* Otherwise, no valid operator name was present. */
15101 else
15102 {
15105 }
15108 }
15110 /* Parse a template-declaration.
15112 template-declaration:
15113 export [opt] template < template-parameter-list > declaration
15115 If MEMBER_P is TRUE, this template-declaration occurs within a
15116 class-specifier.
15118 The grammar rule given by the standard isn't correct. What
15119 is really meant is:
15121 template-declaration:
15122 export [opt] template-parameter-list-seq
15123 decl-specifier-seq [opt] init-declarator [opt] ;
15124 export [opt] template-parameter-list-seq
15125 function-definition
15127 template-parameter-list-seq:
15128 template-parameter-list-seq [opt]
15129 template < template-parameter-list >
15131 Concept Extensions:
15133 template-parameter-list-seq:
15134 template < template-parameter-list > requires-clause [opt]
15136 requires-clause:
15137 requires logical-or-expression */
15139 static void
15141 {
15142 /* Check for `export'. */
15144 {
15145 /* Consume the `export' token. */
15147 /* Warn that we do not support `export'. */
15149 }
15152 }
15154 /* Parse a template-parameter-list.
15156 template-parameter-list:
15157 template-parameter
15158 template-parameter-list , template-parameter
15160 Returns a TREE_LIST. Each node represents a template parameter.
15161 The nodes are connected via their TREE_CHAINs. */
15163 static tree
15165 {
15170 /* The loop below parses the template parms. We first need to know
15171 the total number of template parms to be able to compute proper
15172 canonical types of each dependent type. So after the loop, when
15173 we know the total number of template parms,
15174 end_template_parm_list computes the proper canonical types and
15175 fixes up the dependent types accordingly. */
15177 {
15178 tree parameter;
15181 location_t parm_loc;
15183 /* Parse the template-parameter. */
15188 /* Add it to the list. */
15191 parm_loc,
15192 parameter,
15193 is_non_type,
15194 is_parameter_pack);
15195 else
15196 {
15199 }
15201 /* If the next token is not a `,', we're done. */
15204 /* Otherwise, consume the `,' token. */
15206 }
15209 }
15211 /* Parse a introduction-list.
15213 introduction-list:
15214 introduced-parameter
15215 introduction-list , introduced-parameter
15217 introduced-parameter:
15218 ...[opt] identifier
15220 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15221 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15222 WILDCARD_DECL will also have DECL_NAME set and token location in
15223 DECL_SOURCE_LOCATION. */
15225 static tree
15227 {
15231 {
15236 /* Build placeholder. */
15244 /* If the next token is not a `,', we're done. */
15247 /* Otherwise, consume the `,' token. */
15249 }
15251 /* Convert the vec into a TREE_VEC. */
15254 tree parm;
15260 }
15262 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15263 is an abstract declarator. */
15267 {
15272 }
15274 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15275 is an abstract declarator. */
15279 {
15283 else
15285 }
15287 /* Returns true if DECL represents a constrained-parameter. */
15291 {
15296 }
15298 /* Returns true if PARM declares a constrained-parameter. */
15302 {
15304 }
15306 /* Check that the type parameter is only a declarator-id, and that its
15307 type is not cv-qualified. */
15309 bool
15312 {
15317 {
15320 }
15322 /* Don't allow cv-qualified type parameters. */
15325 {
15328 }
15331 }
15333 /* Finish parsing/processing a template type parameter and checking
15334 various restrictions. */
15338 tree id,
15340 {
15343 else
15345 }
15347 static tree
15349 {
15350 /* FIXME: This should probably be copied, and we may need to adjust
15351 the template parameter depths. */
15361 }
15363 /* Finish parsing/processing a template template parameter by borrowing
15364 the template parameter list from the prototype parameter. */
15366 static tree
15368 tree proto,
15369 tree id,
15371 {
15375 }
15377 /* Create a new non-type template parameter from the given PARM
15378 declarator. */
15380 static tree
15383 {
15389 }
15391 /* Build a constrained template parameter based on the PARMDECL
15392 declarator. The type of PARMDECL is the constrained type, which
15393 refers to the prototype template parameter that ultimately
15394 specifies the type of the declared parameter. */
15396 static tree
15401 {
15407 /* A template parameter constrained by a variadic concept shall also
15408 be declared as a template parameter pack. */
15413 /* Build the parameter. Return an error if the declarator was invalid. */
15414 tree parm;
15419 parmdecl);
15420 else
15425 /* Finish the parameter decl and create a node attaching the
15426 default argument and constraint. */
15431 }
15433 /* Returns true if the parsed type actually represents the declaration
15434 of a type template-parameter. */
15438 {
15441 }
15444 /* Returns true if the parsed type actually represents the declaration of
15445 a template template-parameter. */
15447 static bool
15449 {
15452 }
15454 /* Parse a default argument for a type template-parameter.
15455 Note that diagnostics are handled in cp_parser_template_parameter. */
15457 static tree
15459 {
15462 /* Consume the `=' token. */
15467 /* Parse the default-argument. */
15473 {
15477 }
15480 }
15482 /* Parse a default argument for a template template-parameter. */
15484 static tree
15486 {
15491 /* Consume the `='. */
15493 /* Parse the id-expression. */
15495 /* save token before parsing the id-expression, for error
15496 reporting */
15498 tree default_argument
15506 /* If the id-expression was a template-id that refers to
15507 a template-class, we already have the declaration here,
15508 so no further lookup is needed. */
15509 ;
15510 else
15511 /* Look up the name. */
15512 default_argument
15514 none_type,
15520 /* See if the default argument is valid. */
15524 }
15526 /* Parse a template-parameter.
15528 template-parameter:
15529 type-parameter
15530 parameter-declaration
15532 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15533 the parameter. The TREE_PURPOSE is the default value, if any.
15534 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15535 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15536 set to true iff this parameter is a parameter pack. */
15538 static tree
15541 {
15544 tree parm;
15546 /* Assume it is a type parameter or a template parameter. */
15548 /* Assume it not a parameter pack. */
15550 /* Peek at the next token. */
15552 /* If it is `template', we have a type-parameter. */
15555 /* If it is `class' or `typename' we do not know yet whether it is a
15556 type parameter or a non-type parameter. Consider:
15558 template <typename T, typename T::X X> ...
15560 or:
15562 template <class C, class D*> ...
15564 Here, the first parameter is a type parameter, and the second is
15565 a non-type parameter. We can tell by looking at the token after
15566 the identifier -- if it is a `,', `=', or `>' then we have a type
15567 parameter. */
15569 {
15570 /* Peek at the token after `class' or `typename'. */
15572 /* If it's an ellipsis, we have a template type parameter
15573 pack. */
15576 /* If it's an identifier, skip it. */
15579 /* Now, see if the token looks like the end of a template
15580 parameter. */
15585 }
15587 /* Otherwise, it is a non-type parameter or a constrained parameter.
15589 [temp.param]
15591 When parsing a default template-argument for a non-type
15592 template-parameter, the first non-nested `>' is taken as the end
15593 of the template parameter-list rather than a greater-than
15594 operator. */
15595 parameter_declarator
15602 /* If the parameter declaration is marked as a parameter pack, set
15603 *IS_PARAMETER_PACK to notify the caller. */
15608 {
15609 /* Can happen in some cases of erroneous input (c++/34892). */
15611 /* Consume the `...' for better error recovery. */
15613 }
15615 // The parameter may have been constrained.
15618 parameter_declarator,
15619 is_non_type,
15620 is_parameter_pack);
15622 // Now we're sure that the parameter is a non-type parameter.
15633 }
15635 /* Parse a type-parameter.
15637 type-parameter:
15638 class identifier [opt]
15639 class identifier [opt] = type-id
15640 typename identifier [opt]
15641 typename identifier [opt] = type-id
15642 template < template-parameter-list > class identifier [opt]
15643 template < template-parameter-list > class identifier [opt]
15644 = id-expression
15646 GNU Extension (variadic templates):
15648 type-parameter:
15649 class ... identifier [opt]
15650 typename ... identifier [opt]
15652 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15653 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15654 the declaration of the parameter.
15656 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15658 static tree
15660 {
15662 tree parameter;
15664 /* Look for a keyword to tell us what kind of parameter this is. */
15670 {
15673 {
15674 tree identifier;
15675 tree default_argument;
15677 /* If the next token is an ellipsis, we have a template
15678 argument pack. */
15680 {
15681 /* Consume the `...' token. */
15686 }
15688 /* If the next token is an identifier, then it names the
15689 parameter. */
15692 else
15695 /* Create the parameter. */
15698 /* If the next token is an `=', we have a default argument. */
15700 {
15701 default_argument
15704 /* Template parameter packs cannot have default
15705 arguments. */
15707 {
15710 "template parameter pack %qD cannot have a "
15712 else
15714 "template parameter packs cannot have "
15717 }
15720 }
15721 else
15724 /* Create the combined representation of the parameter and the
15725 default argument. */
15727 }
15731 {
15732 tree identifier;
15733 tree default_argument;
15735 /* Look for the `<'. */
15737 /* Parse the template-parameter-list. */
15739 /* Look for the `>'. */
15742 // If template requirements are present, parse them.
15744 {
15749 }
15751 /* Look for the `class' or 'typename' keywords. */
15753 /* If the next token is an ellipsis, we have a template
15754 argument pack. */
15756 {
15757 /* Consume the `...' token. */
15762 }
15763 /* If the next token is an `=', then there is a
15764 default-argument. If the next token is a `>', we are at
15765 the end of the parameter-list. If the next token is a `,',
15766 then we are at the end of this parameter. */
15770 {
15772 /* Treat invalid names as if the parameter were nameless. */
15775 }
15776 else
15779 /* Create the template parameter. */
15781 identifier);
15783 /* If the next token is an `=', then there is a
15784 default-argument. */
15786 {
15787 default_argument
15790 /* Template parameter packs cannot have default
15791 arguments. */
15793 {
15796 "template parameter pack %qD cannot "
15798 identifier);
15799 else
15803 }
15804 }
15805 else
15808 /* Create the combined representation of the parameter and the
15809 default argument. */
15811 }
15817 }
15820 }
15822 /* Parse a template-id.
15824 template-id:
15825 template-name < template-argument-list [opt] >
15827 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15828 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15829 returned. Otherwise, if the template-name names a function, or set
15830 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15831 names a class, returns a TYPE_DECL for the specialization.
15833 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15834 uninstantiated templates. */
15836 static tree
15842 {
15843 tree templ;
15844 tree arguments;
15845 tree template_id;
15850 /* If the next token corresponds to a template-id, there is no need
15851 to reparse it. */
15854 {
15857 }
15859 /* Avoid performing name lookup if there is no possibility of
15860 finding a template-id. */
15863 && !cp_parser_nth_token_starts_template_argument_list_p
15865 {
15868 }
15870 /* Remember where the template-id starts. */
15876 /* Parse the template-name. */
15879 check_dependency_p,
15880 is_declaration,
15881 tag_type,
15884 {
15887 }
15889 /* Since we're going to preserve any side-effects from this parse, set up a
15890 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15891 in the template arguments. */
15894 /* If we find the sequence `[:' after a template-name, it's probably
15895 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15896 parse correctly the argument list. */
15903 {
15905 /* Change `:' into `::'. */
15907 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15908 CPP_LESS. */
15911 /* Parse the arguments. */
15914 {
15915 /* If we couldn't parse an argument list, then we revert our changes
15916 and return simply an error. Maybe this is not a template-id
15917 after all. */
15922 }
15923 /* Otherwise, emit an error about the invalid digraph, but continue
15924 parsing because we got our argument list. */
15927 {
15930 "%<<:%> is an alternate spelling for %<[%>."
15933 {
15935 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15938 }
15939 }
15940 }
15941 else
15942 {
15943 /* Look for the `<' that starts the template-argument-list. */
15945 {
15948 }
15949 /* Parse the arguments. */
15951 }
15953 /* Set the location to be of the form:
15954 template-name < template-argument-list [opt] >
15955 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15956 with caret == start at the start of the template-name,
15957 ranging until the closing '>'. */
15958 location_t finish_loc
15960 location_t combined_loc
15963 /* Check for concepts autos where they don't belong. We could
15964 identify types in some cases of idnetifier TEMPL, looking ahead
15965 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
15966 types. We reject them in functions, but if what we have is an
15967 identifier, even with none_type we can't conclude it's NOT a
15968 type, we have to wait for template substitution. */
15971 /* Build a representation of the specialization. */
15974 TEMPLATE_ID_EXPR,
15978 {
15979 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15980 template (rather than some instantiation thereof) only if
15981 is not nested within some other construct. For example, in
15982 "template <typename T> void f(T) { A<T>::", A<T> is just an
15983 instantiation of A. */
15984 bool entering_scope
15987 template_id
15989 }
15990 /* A template-like identifier may be a partial concept id. */
15996 {
16000 }
16001 else
16002 {
16003 /* If it's not a class-template or a template-template, it should be
16004 a function-template. */
16012 }
16014 /* If parsing tentatively, replace the sequence of tokens that makes
16015 up the template-id with a CPP_TEMPLATE_ID token. That way,
16016 should we re-parse the token stream, we will not have to repeat
16017 the effort required to do the parse, nor will we issue duplicate
16018 error messages about problems during instantiation of the
16019 template. */
16021 /* Don't do this if we had a parse error in a declarator; re-parsing
16022 might succeed if a name changes meaning (60361). */
16026 {
16027 /* Reset the contents of the START_OF_ID token. */
16031 /* Retrieve any deferred checks. Do not pop this access checks yet
16032 so the memory will not be reclaimed during token replacing below. */
16038 /* Purge all subsequent tokens. */
16041 /* ??? Can we actually assume that, if template_id ==
16042 error_mark_node, we will have issued a diagnostic to the
16043 user, as opposed to simply marking the tentative parse as
16044 failed? */
16047 }
16051 }
16053 /* Parse a template-name.
16055 template-name:
16056 identifier
16058 The standard should actually say:
16060 template-name:
16061 identifier
16062 operator-function-id
16064 A defect report has been filed about this issue.
16066 A conversion-function-id cannot be a template name because they cannot
16067 be part of a template-id. In fact, looking at this code:
16069 a.operator K<int>()
16071 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16072 It is impossible to call a templated conversion-function-id with an
16073 explicit argument list, since the only allowed template parameter is
16074 the type to which it is converting.
16076 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16077 `template' keyword, in a construction like:
16079 T::template f<3>()
16081 In that case `f' is taken to be a template-name, even though there
16082 is no way of knowing for sure.
16084 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16085 name refers to a set of overloaded functions, at least one of which
16086 is a template, or an IDENTIFIER_NODE with the name of the template,
16087 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16088 names are looked up inside uninstantiated templates. */
16090 static tree
16097 {
16098 tree identifier;
16099 tree decl;
16102 /* If the next token is `operator', then we have either an
16103 operator-function-id or a conversion-function-id. */
16105 {
16106 /* We don't know whether we're looking at an
16107 operator-function-id or a conversion-function-id. */
16109 /* Try an operator-function-id. */
16111 /* If that didn't work, try a conversion-function-id. */
16113 {
16116 }
16117 }
16118 /* Look for the identifier. */
16119 else
16122 /* If we didn't find an identifier, we don't have a template-id. */
16126 /* If the name immediately followed the `template' keyword, then it
16127 is a template-name. However, if the next token is not `<', then
16128 we do not treat it as a template-name, since it is not being used
16129 as part of a template-id. This enables us to handle constructs
16130 like:
16132 template <typename T> struct S { S(); };
16133 template <typename T> S<T>::S();
16135 correctly. We would treat `S' as a template -- if it were `S<T>'
16136 -- but we do not if there is no `<'. */
16140 {
16141 /* In a declaration, in a dependent context, we pretend that the
16142 "template" keyword was present in order to improve error
16143 recovery. For example, given:
16145 template <typename T> void f(T::X<int>);
16147 we want to treat "X<int>" as a template-id. */
16149 && !template_keyword_p
16151 && check_dependency_p
16153 /* Do not do this for dtors (or ctors), since they never
16154 need the template keyword before their name. */
16156 {
16159 /* Explain what went wrong. */
16161 identifier);
16164 /* If parsing tentatively, find the location of the "<" token. */
16167 /* Parse the template arguments so that we can issue error
16168 messages about them. */
16171 /* Skip tokens until we find a good place from which to
16172 continue parsing. */
16177 /* If parsing tentatively, permanently remove the
16178 template argument list. That will prevent duplicate
16179 error messages from being issued about the missing
16180 "template" keyword. */
16187 }
16189 /* If the "template" keyword is present, then there is generally
16190 no point in doing name-lookup, so we just return IDENTIFIER.
16191 But, if the qualifying scope is non-dependent then we can
16192 (and must) do name-lookup normally. */
16194 {
16200 {
16201 /* We're optimizing away the call to cp_parser_lookup_name, but
16202 we still need to do this. */
16205 }
16206 }
16207 }
16209 /* Look up the name. */
16211 tag_type,
16214 check_dependency_p,
16220 /* If DECL is a template, then the name was a template-name. */
16222 {
16226 }
16227 else
16228 {
16229 /* The standard does not explicitly indicate whether a name that
16230 names a set of overloaded declarations, some of which are
16231 templates, is a template-name. However, such a name should
16232 be a template-name; otherwise, there is no way to form a
16233 template-id for the overloaded templates. */
16242 {
16243 /* The name does not name a template. */
16246 }
16247 }
16249 /* If DECL is dependent, and refers to a function, then just return
16250 its name; we will look it up again during template instantiation. */
16252 {
16256 }
16259 }
16261 /* Parse a template-argument-list.
16263 template-argument-list:
16264 template-argument ... [opt]
16265 template-argument-list , template-argument ... [opt]
16267 Returns a TREE_VEC containing the arguments. */
16269 static tree
16271 {
16276 tree vec;
16283 /* Even if the template-id appears in an integral
16284 constant-expression, the contents of the argument list do
16285 not. */
16291 /* Parse the arguments. */
16292 do
16293 {
16294 tree argument;
16297 /* Consume the comma. */
16300 /* Parse the template-argument. */
16303 /* If the next token is an ellipsis, we're expanding a template
16304 argument pack. */
16306 {
16308 {
16312 }
16313 /* Consume the `...' token. */
16316 /* Make the argument into a TYPE_PACK_EXPANSION or
16317 EXPR_PACK_EXPANSION. */
16319 }
16322 {
16326 {
16329 }
16330 else
16332 }
16334 }
16350 }
16352 /* Parse a template-argument.
16354 template-argument:
16355 assignment-expression
16356 type-id
16357 id-expression
16359 The representation is that of an assignment-expression, type-id, or
16360 id-expression -- except that the qualified id-expression is
16361 evaluated, so that the value returned is either a DECL or an
16362 OVERLOAD.
16364 Although the standard says "assignment-expression", it forbids
16365 throw-expressions or assignments in the template argument.
16366 Therefore, we use "conditional-expression" instead. */
16368 static tree
16370 {
16371 tree argument;
16377 cp_id_kind idk;
16379 /* There's really no way to know what we're looking at, so we just
16380 try each alternative in order.
16382 [temp.arg]
16384 In a template-argument, an ambiguity between a type-id and an
16385 expression is resolved to a type-id, regardless of the form of
16386 the corresponding template-parameter.
16388 Therefore, we try a type-id first. */
16391 /* If there was no error parsing the type-id but the next token is a
16392 '>>', our behavior depends on which dialect of C++ we're
16393 parsing. In C++98, we probably found a typo for '> >'. But there
16394 are type-id which are also valid expressions. For instance:
16396 struct X { int operator >> (int); };
16397 template <int V> struct Foo {};
16398 Foo<X () >> 5> r;
16400 Here 'X()' is a valid type-id of a function type, but the user just
16401 wanted to write the expression "X() >> 5". Thus, we remember that we
16402 found a valid type-id, but we still try to parse the argument as an
16403 expression to see what happens.
16405 In C++0x, the '>>' will be considered two separate '>'
16406 tokens. */
16410 {
16413 }
16414 else
16415 {
16416 /* If the next token isn't a `,' or a `>', then this argument wasn't
16417 really finished. This means that the argument is not a valid
16418 type-id. */
16421 /* If that worked, we're done. */
16424 }
16425 /* We're still not sure what the argument will be. */
16427 /* Try a template. */
16435 /* If the next token isn't a `,' or a `>', then this argument wasn't
16436 really finished. */
16440 {
16441 /* Figure out what is being referred to. If the id-expression
16442 was for a class template specialization, then we will have a
16443 TYPE_DECL at this point. There is no need to do name lookup
16444 at this point in that case. */
16447 none_type,
16453 /* Handle a constrained-type-specifier for a non-type template
16454 parameter. */
16460 }
16462 {
16466 }
16467 /* It must be a non-type argument. In C++17 any constant-expression is
16468 allowed. */
16472 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16474 -- an integral constant-expression of integral or enumeration
16475 type; or
16477 -- the name of a non-type template-parameter; or
16479 -- the name of an object or function with external linkage...
16481 -- the address of an object or function with external linkage...
16483 -- a pointer to member... */
16484 /* Look for a non-type template parameter. */
16486 {
16498 }
16500 /* If the next token is "&", the argument must be the address of an
16501 object or function with external linkage. */
16504 {
16507 }
16508 /* See if we might have an id-expression. */
16515 {
16518 address_p,
16525 else
16526 {
16527 tree probe;
16530 {
16531 /* Strip the dereference temporarily. */
16534 }
16536 /* If we're in a template, we represent a qualified-id referring
16537 to a static data member as a SCOPE_REF even if the scope isn't
16538 dependent so that we can check access control later. */
16543 {
16544 /* A variable without external linkage might still be a
16545 valid constant-expression, so no error is issued here
16546 if the external-linkage check fails. */
16549 }
16551 /* All overloaded functions are allowed; if the external
16552 linkage test does not pass, an error will be issued
16553 later. */
16554 ;
16558 /* A pointer-to-member. */
16559 ;
16561 ;
16562 else
16566 {
16569 tf_warning_or_error);
16570 else
16573 }
16574 }
16575 }
16576 /* If the argument started with "&", there are no other valid
16577 alternatives at this point. */
16579 {
16582 }
16584 general_expr:
16585 /* If the argument wasn't successfully parsed as a type-id followed
16586 by '>>', the argument can only be a constant expression now.
16587 Otherwise, we try parsing the constant-expression tentatively,
16588 because the argument could really be a type-id. */
16594 else
16595 {
16596 /* With C++17 generalized non-type template arguments we need to handle
16597 lvalue constant expressions, too. */
16600 }
16608 /* We did our best to parse the argument as a non type-id, but that
16609 was the only alternative that matched (albeit with a '>' after
16610 it). We can assume it's just a typo from the user, and a
16611 diagnostic will then be issued. */
16613 }
16615 /* Parse an explicit-instantiation.
16617 explicit-instantiation:
16618 template declaration
16620 Although the standard says `declaration', what it really means is:
16622 explicit-instantiation:
16623 template decl-specifier-seq [opt] declarator [opt] ;
16625 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16626 supposed to be allowed. A defect report has been filed about this
16627 issue.
16629 GNU Extension:
16631 explicit-instantiation:
16632 storage-class-specifier template
16633 decl-specifier-seq [opt] declarator [opt] ;
16634 function-specifier template
16635 decl-specifier-seq [opt] declarator [opt] ; */
16637 static void
16639 {
16641 cp_decl_specifier_seq decl_specifiers;
16646 /* Look for an (optional) storage-class-specifier or
16647 function-specifier. */
16649 {
16650 extension_specifier
16653 extension_specifier
16656 }
16658 /* Look for the `template' keyword. */
16660 /* Let the front end know that we are processing an explicit
16661 instantiation. */
16663 /* [temp.explicit] says that we are supposed to ignore access
16664 control while processing explicit instantiation directives. */
16666 /* Parse a decl-specifier-seq. */
16668 CP_PARSER_FLAGS_OPTIONAL,
16671 /* If there was exactly one decl-specifier, and it declared a class,
16672 and there's no declarator, then we have an explicit type
16673 instantiation. */
16675 {
16676 tree type;
16680 /* Turn access control back on for names used during
16681 template instantiation. */
16686 }
16687 else
16688 {
16690 tree decl;
16692 /* Parse the declarator. */
16693 declarator
16704 {
16707 "explicit instantiation shall not use"
16711 "explicit instantiation shall not use"
16716 /* Turn access control back on for names used during
16717 template instantiation. */
16719 /* Do the explicit instantiation. */
16721 }
16722 else
16723 {
16725 /* Skip the body of the explicit instantiation. */
16727 }
16728 }
16729 /* We're done with the instantiation. */
16735 }
16737 /* Parse an explicit-specialization.
16739 explicit-specialization:
16740 template < > declaration
16742 Although the standard says `declaration', what it really means is:
16744 explicit-specialization:
16745 template <> decl-specifier [opt] init-declarator [opt] ;
16746 template <> function-definition
16747 template <> explicit-specialization
16748 template <> template-declaration */
16750 static void
16752 {
16756 /* Look for the `template' keyword. */
16758 /* Look for the `<'. */
16760 /* Look for the `>'. */
16762 /* We have processed another parameter list. */
16764 /* [temp]
16766 A template ... explicit specialization ... shall not have C
16767 linkage. */
16769 {
16772 /* Give it C++ linkage to avoid confusing other parts of the
16773 front end. */
16776 }
16777 else
16779 /* Let the front end know that we are beginning a specialization. */
16781 {
16784 }
16786 /* If the next keyword is `template', we need to figure out whether
16787 or not we're looking a template-declaration. */
16789 {
16794 else
16796 }
16797 else
16798 /* Parse the dependent declaration. */
16804 /* We're done with the specialization. */
16806 /* For the erroneous case of a template with C linkage, we pushed an
16807 implicit C++ linkage scope; exit that scope now. */
16810 /* We're done with this parameter list. */
16812 }
16814 /* Parse a type-specifier.
16816 type-specifier:
16817 simple-type-specifier
16818 class-specifier
16819 enum-specifier
16820 elaborated-type-specifier
16821 cv-qualifier
16823 GNU Extension:
16825 type-specifier:
16826 __complex__
16828 Returns a representation of the type-specifier. For a
16829 class-specifier, enum-specifier, or elaborated-type-specifier, a
16830 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16832 The parser flags FLAGS is used to control type-specifier parsing.
16834 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16835 in a decl-specifier-seq.
16837 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16838 class-specifier, enum-specifier, or elaborated-type-specifier, then
16839 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16840 if a type is declared; 2 if it is defined. Otherwise, it is set to
16841 zero.
16843 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16844 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16845 is set to FALSE. */
16847 static tree
16849 cp_parser_flags flags,
16854 {
16860 /* Assume this type-specifier does not declare a new type. */
16863 /* And that it does not specify a cv-qualifier. */
16866 /* Peek at the next token. */
16869 /* If we're looking at a keyword, we can use that to guide the
16870 production we choose. */
16873 {
16878 /* Look for the enum-specifier. */
16880 /* If that worked, we're done. */
16882 {
16887 type_spec,
16888 token,
16891 }
16892 else
16895 /* Any of these indicate either a class-specifier, or an
16896 elaborated-type-specifier. */
16903 /* Parse tentatively so that we can back up if we don't find a
16904 class-specifier. */
16906 /* Look for the class-specifier. */
16909 /* If that worked, we're done. */
16911 {
16916 type_spec,
16917 token,
16920 }
16922 /* Fall through. */
16923 elaborated_type_specifier:
16924 /* We're declaring (not defining) a class or enum. */
16928 /* Fall through. */
16930 /* Look for an elaborated-type-specifier. */
16931 type_spec
16932 = (cp_parser_elaborated_type_specifier
16935 is_declaration));
16938 type_spec,
16939 token,
16962 /* The `__complex__' keyword is a GNU extension. */
16968 }
16970 /* Handle simple keywords. */
16972 {
16974 {
16977 }
16979 }
16981 /* If we do not already have a type-specifier, assume we are looking
16982 at a simple-type-specifier. */
16984 decl_specs,
16985 flags);
16987 /* If we didn't find a type-specifier, and a type-specifier was not
16988 optional in this context, issue an error message. */
16990 {
16993 }
16996 }
16998 /* Parse a simple-type-specifier.
17000 simple-type-specifier:
17001 :: [opt] nested-name-specifier [opt] type-name
17002 :: [opt] nested-name-specifier template template-id
17003 char
17004 wchar_t
17005 bool
17006 short
17007 int
17008 long
17009 signed
17010 unsigned
17011 float
17012 double
17013 void
17015 C++11 Extension:
17017 simple-type-specifier:
17018 auto
17019 decltype ( expression )
17020 char16_t
17021 char32_t
17022 __underlying_type ( type-id )
17024 C++17 extension:
17026 nested-name-specifier(opt) template-name
17028 GNU Extension:
17030 simple-type-specifier:
17031 __int128
17032 __typeof__ unary-expression
17033 __typeof__ ( type-id )
17034 __typeof__ ( type-id ) { initializer-list , [opt] }
17036 Concepts Extension:
17038 simple-type-specifier:
17039 constrained-type-specifier
17041 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17042 appropriately updated. */
17044 static tree
17047 cp_parser_flags flags)
17048 {
17053 /* Peek at the next token. */
17056 /* If we're looking at a keyword, things are easy. */
17058 {
17093 {
17096 }
17125 {
17126 /* The 'auto' might be the placeholder return type for a function decl
17127 with trailing return type. */
17136 {
17138 {
17145 }
17148 {
17151 }
17154 }
17158 {
17161 }
17164 {
17167 }
17168 else
17172 {
17175 "use of %<auto%> in lambda parameter declaration "
17176 "only available with "
17178 }
17181 "use of %<auto%> in parameter declaration "
17182 "only available with "
17186 "use of %<auto%> in parameter declaration "
17188 }
17189 else
17194 /* Since DR 743, decltype can either be a simple-type-specifier by
17195 itself or begin a nested-name-specifier. Parsing it will replace
17196 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17197 handling below decide what to do. */
17203 /* Consume the `typeof' token. */
17205 /* Parse the operand to `typeof'. */
17207 /* If it is not already a TYPE, take its type. */
17213 token,
17222 token,
17232 token,
17237 }
17239 /* If token is an already-parsed decltype not followed by ::,
17240 it's a simple-type-specifier. */
17243 {
17246 {
17248 token,
17250 /* Remember that we are handling a decltype in order to
17251 implement the resolution of DR 1510 when the argument
17252 isn't instantiation dependent. */
17254 }
17257 }
17259 /* If the type-specifier was for a built-in type, we're done. */
17261 {
17262 /* Record the type. */
17269 type,
17270 token,
17275 /* Consume the token. */
17281 /* There is no valid C++ program where a non-template type is
17282 followed by a "<". That usually indicates that the user thought
17283 that the type was a template. */
17288 }
17290 /* The type-specifier must be a user-defined type. */
17292 {
17296 /* Don't gobble tokens or issue error messages if this is an
17297 optional type-specifier. */
17303 /* Look for the optional `::' operator. */
17304 global_p
17308 /* Look for the nested-name specifier. */
17309 qualified_p
17316 /* If we have seen a nested-name-specifier, and the next token
17317 is `template', then we are using the template-id production. */
17320 {
17321 /* Look for the template-id. */
17325 none_type,
17327 /* If the template-id did not name a type, we are out of
17328 luck. */
17330 {
17333 }
17334 }
17335 /* Otherwise, look for a type-name. */
17336 else
17338 /* Keep track of all name-lookups performed in class scopes. */
17340 && !global_p
17341 && !qualified_p
17345 /* If it didn't work out, we don't have a TYPE. */
17350 {
17364 {
17366 none_type,
17376 else
17377 {
17382 }
17383 }
17384 else
17390 }
17393 token,
17395 }
17397 /* If we didn't get a type-name, issue an error message. */
17399 {
17402 }
17405 {
17406 /* See if TYPE is an Objective-C type, and if so, parse and
17407 accept any protocol references following it. Do this before
17408 the cp_parser_check_for_invalid_template_id() call, because
17409 Objective-C types can be followed by '<...>' which would
17410 enclose protocol names rather than template arguments, and so
17411 everything is fine. */
17414 {
17418 /* Clobber the "unqualified" type previously entered into
17419 DECL_SPECS with the new, improved protocol-qualified version. */
17424 }
17426 /* There is no valid C++ program where a non-template type is
17427 followed by a "<". That usually indicates that the user
17428 thought that the type was a template. */
17430 none_type,
17432 }
17435 }
17437 /* Parse a type-name.
17439 type-name:
17440 class-name
17441 enum-name
17442 typedef-name
17443 simple-template-id [in c++0x]
17445 enum-name:
17446 identifier
17448 typedef-name:
17449 identifier
17451 Concepts:
17453 type-name:
17454 concept-name
17455 partial-concept-id
17457 concept-name:
17458 identifier
17460 Returns a TYPE_DECL for the type. */
17462 static tree
17464 {
17466 }
17468 /* See above. */
17469 static tree
17471 {
17472 tree type_decl;
17474 /* We can't know yet whether it is a class-name or not. */
17476 /* Try a class-name. */
17478 typename_keyword_p,
17480 none_type,
17484 /* If it's not a class-name, keep looking. */
17486 {
17488 /* It must be a typedef-name or an enum-name. */
17492 /* It is either a simple-template-id representing an
17493 instantiation of an alias template... */
17497 none_type,
17499 /* Note that this must be an instantiation of an alias template
17500 because [temp.names]/6 says:
17502 A template-id that names an alias template specialization
17503 is a type-name.
17505 Whereas [temp.names]/7 says:
17507 A simple-template-id that names a class template
17508 specialization is a class-name.
17510 With concepts, this could also be a partial-concept-id that
17511 declares a non-type template parameter. */
17518 else
17522 /* ... Or a typedef-name or an enum-name. */
17524 }
17527 }
17529 /* Check if DECL and ARGS can form a constrained-type-specifier.
17530 If ARGS is non-null, we try to form a concept check of the
17531 form DECL<?, ARGS> where ? is a wildcard that matches any
17532 kind of template argument. If ARGS is NULL, then we try to
17533 form a concept check of the form DECL<?>. */
17535 static tree
17538 {
17541 /* If we a constrained-type-specifier cannot be deduced. */
17545 /* A constrained type specifier can only be found in an
17546 overload set or as a reference to a template declaration.
17548 FIXME: This might be masking a bug. It's possible that
17549 that the deduction below is causing template specializations
17550 to be formed with the wildcard as an argument. */
17554 /* Try to build a call expression that evaluates the
17555 concept. This can fail if the overload set refers
17556 only to non-templates. */
17562 /* Deduce the checked constraint and the prototype parameter.
17564 FIXME: In certain cases, failure to deduce should be a
17565 diagnosable error. */
17566 tree conc;
17567 tree proto;
17571 /* In template parameter scope, this results in a constrained
17572 parameter. Return a descriptor of that parm. */
17576 /* In a parameter-declaration-clause, constrained-type
17577 specifiers result in invented template parameters. */
17579 {
17582 }
17583 else
17584 {
17585 /* Otherwise, we're in a context where the constrained
17586 type name is deduced and the constraint applies
17587 after deduction. */
17589 }
17592 }
17594 /* If DECL refers to a concept, return a TYPE_DECL representing
17595 the result of using the constrained type specifier in the
17596 current context. DECL refers to a concept if
17598 - it is an overload set containing a function concept taking a single
17599 type argument, or
17601 - it is a variable concept taking a single type argument. */
17603 static tree
17605 {
17611 else
17613 }
17615 /* Check if DECL and ARGS form a partial-concept-id. If so,
17616 assign ID to the resulting constrained placeholder.
17618 Returns true if the partial-concept-id designates a placeholder
17619 and false otherwise. Note that *id is set to NULL_TREE in
17620 this case. */
17622 static tree
17624 {
17626 }
17628 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17629 or a concept-name.
17631 enum-name:
17632 identifier
17634 typedef-name:
17635 identifier
17637 concept-name:
17638 identifier
17640 Returns a TYPE_DECL for the type. */
17642 static tree
17644 {
17645 tree type_decl;
17646 tree identifier;
17653 /* Look up the type-name. */
17658 /* If we found an overload set, then it may refer to a concept-name. */
17664 {
17665 /* See if this is an Objective-C type. */
17670 }
17672 /* Issue an error if we did not find a type-name. */
17674 /* In Objective-C, we have the complication that class names are
17675 normally type names and start declarations (eg, the
17676 "NSObject" in "NSObject *object;"), but can be used in an
17677 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17678 is an expression. So, a classname followed by a dot is not a
17679 valid type-name. */
17682 {
17687 }
17688 /* Remember that the name was used in the definition of the
17689 current class so that we can check later to see if the
17690 meaning would have been different after the class was
17691 entirely defined. */
17697 }
17699 /* Parse an elaborated-type-specifier. Note that the grammar given
17700 here incorporates the resolution to DR68.
17702 elaborated-type-specifier:
17703 class-key :: [opt] nested-name-specifier [opt] identifier
17704 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17705 enum-key :: [opt] nested-name-specifier [opt] identifier
17706 typename :: [opt] nested-name-specifier identifier
17707 typename :: [opt] nested-name-specifier template [opt]
17708 template-id
17710 GNU extension:
17712 elaborated-type-specifier:
17713 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17714 class-key attributes :: [opt] nested-name-specifier [opt]
17715 template [opt] template-id
17716 enum attributes :: [opt] nested-name-specifier [opt] identifier
17718 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17719 declared `friend'. If IS_DECLARATION is TRUE, then this
17720 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17721 something is being declared.
17723 Returns the TYPE specified. */
17725 static tree
17729 {
17731 tree identifier;
17734 tree globalscope;
17737 /* See if we're looking at the `enum' keyword. */
17739 {
17740 /* Consume the `enum' token. */
17742 /* Remember that it's an enumeration type. */
17744 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17745 enums) is used here. */
17749 {
17756 /* Consume the `struct' or `class' and parse it anyway. */
17758 }
17759 /* Parse the attributes. */
17761 }
17762 /* Or, it might be `typename'. */
17764 RID_TYPENAME))
17765 {
17766 /* Consume the `typename' token. */
17768 /* Remember that it's a `typename' type. */
17770 }
17771 /* Otherwise it must be a class-key. */
17772 else
17773 {
17777 /* Parse the attributes. */
17779 }
17781 /* Look for the `::' operator. */
17784 /* Look for the nested-name-specifier. */
17785 tree nested_name_specifier;
17787 {
17788 nested_name_specifier
17793 is_declaration);
17796 }
17797 else
17798 /* Even though `typename' is not present, the proposed resolution
17799 to Core Issue 180 says that in `class A<T>::B', `B' should be
17800 considered a type-name, even if `A<T>' is dependent. */
17801 nested_name_specifier
17806 is_declaration);
17807 /* For everything but enumeration types, consider a template-id.
17808 For an enumeration type, consider only a plain identifier. */
17810 {
17812 tree decl;
17814 /* Allow the `template' keyword. */
17816 /* If we didn't see `template', we don't know if there's a
17817 template-id or not. */
17820 /* Parse the template-id. */
17824 tag_type,
17825 is_declaration);
17826 /* If we didn't find a template-id, look for an ordinary
17827 identifier. */
17829 ;
17830 /* We can get here when cp_parser_template_id, called by
17831 cp_parser_class_name with tag_type == none_type, succeeds
17832 and caches a BASELINK. Then, when called again here,
17833 instead of failing and returning an error_mark_node
17834 returns it (see template/typename17.C in C++11).
17835 ??? Could we diagnose this earlier? */
17837 {
17840 }
17841 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17842 in effect, then we must assume that, upon instantiation, the
17843 template will correspond to a class. */
17847 typename_type,
17849 /* If the `typename' keyword is in effect and DECL is not a type
17850 decl, then type is non existent. */
17852 ;
17854 {
17858 /* If the next token is a semicolon, this must be a specialization,
17859 instantiation, or friend declaration. Check the scope while we
17860 still know whether or not we had a nested-name-specifier. */
17865 }
17868 }
17871 {
17876 {
17879 }
17881 /* For a `typename', we needn't call xref_tag. */
17887 /* Template parameter lists apply only if we are not within a
17888 function parameter list. */
17889 bool template_parm_lists_apply
17898 /* Look up a qualified name in the usual way. */
17900 {
17901 tree decl;
17902 tree ambiguous_decls;
17905 tag_type,
17912 /* If the lookup was ambiguous, an error will already have been
17913 issued. */
17917 /* If we are parsing friend declaration, DECL may be a
17918 TEMPLATE_DECL tree node here. However, we need to check
17919 whether this TEMPLATE_DECL results in valid code. Consider
17920 the following example:
17922 namespace N {
17923 template <class T> class C {};
17924 }
17925 class X {
17926 template <class T> friend class N::C; // #1, valid code
17927 };
17928 template <class T> class Y {
17929 friend class N::C; // #2, invalid code
17930 };
17932 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17933 name lookup of `N::C'. We see that friend declaration must
17934 be template for the code to be valid. Note that
17935 processing_template_decl does not work here since it is
17936 always 1 for the above two cases. */
17938 decl = (cp_parser_maybe_treat_template_as_class
17943 {
17945 identifier,
17948 }
17951 {
17955 allow_template);
17959 }
17961 /* Forward declarations of nested types, such as
17963 class C1::C2;
17964 class C1::C2::C3;
17966 are invalid unless all components preceding the final '::'
17967 are complete. If all enclosing types are complete, these
17968 declarations become merely pointless.
17970 Invalid forward declarations of nested types are errors
17971 caught elsewhere in parsing. Those that are pointless arrive
17972 here. */
17979 }
17980 else
17981 {
17982 /* An elaborated-type-specifier sometimes introduces a new type and
17983 sometimes names an existing type. Normally, the rule is that it
17984 introduces a new type only if there is not an existing type of
17985 the same name already in scope. For example, given:
17987 struct S {};
17988 void f() { struct S s; }
17990 the `struct S' in the body of `f' is the same `struct S' as in
17991 the global scope; the existing definition is used. However, if
17992 there were no global declaration, this would introduce a new
17993 local class named `S'.
17995 An exception to this rule applies to the following code:
17997 namespace N { struct S; }
17999 Here, the elaborated-type-specifier names a new type
18000 unconditionally; even if there is already an `S' in the
18001 containing scope this declaration names a new type.
18002 This exception only applies if the elaborated-type-specifier
18003 forms the complete declaration:
18005 [class.name]
18007 A declaration consisting solely of `class-key identifier ;' is
18008 either a redeclaration of the name in the current scope or a
18009 forward declaration of the identifier as a class name. It
18010 introduces the name into the current scope.
18012 We are in this situation precisely when the next token is a `;'.
18014 An exception to the exception is that a `friend' declaration does
18015 *not* name a new type; i.e., given:
18017 struct S { friend struct T; };
18019 `T' is not a new type in the scope of `S'.
18021 Also, `new struct S' or `sizeof (struct S)' never results in the
18022 definition of a new type; a new type can only be declared in a
18023 declaration context. */
18025 tag_scope ts;
18029 /* Friends have special name lookup rules. */
18033 CPP_SEMICOLON))
18034 /* This is a `class-key identifier ;' */
18036 else
18039 template_p =
18040 (template_parm_lists_apply
18043 /* An unqualified name was used to reference this type, so
18044 there were no qualifying templates. */
18053 }
18054 }
18059 /* Allow attributes on forward declarations of classes. */
18061 {
18071 else
18074 }
18077 {
18078 /* Indicate whether this class was declared as a `class' or as a
18079 `struct'. */
18083 }
18085 /* A "<" cannot follow an elaborated type specifier. If that
18086 happens, the user was probably trying to form a template-id. */
18091 }
18093 /* Parse an enum-specifier.
18095 enum-specifier:
18096 enum-head { enumerator-list [opt] }
18097 enum-head { enumerator-list , } [C++0x]
18099 enum-head:
18100 enum-key identifier [opt] enum-base [opt]
18101 enum-key nested-name-specifier identifier enum-base [opt]
18103 enum-key:
18104 enum
18105 enum class [C++0x]
18106 enum struct [C++0x]
18108 enum-base: [C++0x]
18109 : type-specifier-seq
18111 opaque-enum-specifier:
18112 enum-key identifier enum-base [opt] ;
18114 GNU Extensions:
18115 enum-key attributes[opt] identifier [opt] enum-base [opt]
18116 { enumerator-list [opt] }attributes[opt]
18117 enum-key attributes[opt] identifier [opt] enum-base [opt]
18118 { enumerator-list, }attributes[opt] [C++0x]
18120 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18121 if the token stream isn't an enum-specifier after all. */
18123 static tree
18125 {
18126 tree identifier;
18128 tree prev_scope;
18130 tree attributes;
18143 /* Parse tentatively so that we can back up if we don't find a
18144 enum-specifier. */
18147 /* Caller guarantees that the current token is 'enum', an identifier
18148 possibly follows, and the token after that is an opening brace.
18149 If we don't have an identifier, fabricate an anonymous name for
18150 the enumeration being defined. */
18153 /* Parse the "class" or "struct", which indicates a scoped
18154 enumeration type in C++0x. */
18157 {
18161 /* Consume the `struct' or `class' token. */
18165 }
18169 /* Clear the qualification. */
18174 /* Figure out in what scope the declaration is being placed. */
18180 nested_name_specifier
18188 {
18189 tree name;
18193 enum_type,
18198 input_location);
18200 {
18203 {
18204 /* Are template enums allowed in ISO? */
18208 /* ignore a typename reference, for it will be solved by name
18209 in start_enum. */
18211 }
18212 }
18215 else
18216 {
18221 }
18222 }
18223 else
18224 {
18227 else
18228 {
18234 }
18235 }
18238 /* Check for the `:' that denotes a specified underlying type in C++0x.
18239 Note that a ':' could also indicate a bitfield width, however. */
18241 {
18242 cp_decl_specifier_seq type_specifiers;
18244 /* Consume the `:'. */
18247 /* Parse the type-specifier-seq. */
18252 /* At this point this is surely not elaborated type specifier. */
18261 /* If that didn't work, stop. */
18263 {
18269 }
18270 }
18272 /* Look for the `{' but don't consume it yet. */
18274 {
18276 {
18279 {
18282 }
18283 }
18284 /* An opaque-enum-specifier must have a ';' here. */
18287 {
18290 {
18293 }
18294 }
18295 }
18301 {
18303 {
18307 }
18309 {
18311 }
18312 }
18314 /* Issue an error message if type-definitions are forbidden here. */
18317 else
18318 /* Create the new type. We do this before consuming the opening
18319 brace so the enum will be recorded as being on the line of its
18320 tag (or the 'enum' keyword, if there is no tag). */
18324 /* If the next token is not '{' it is an opaque-enum-specifier or an
18325 elaborated-type-specifier. */
18327 {
18331 {
18332 /* The following catches invalid code such as:
18333 enum class S<int>::E { A, B, C }; */
18341 {
18345 nested_name_specifier);
18347 }
18350 {
18352 "%qT for enum declaration does not name a class "
18355 }
18356 /* If that scope does not contain the scope in which the
18357 class was originally declared, the program is invalid. */
18359 nested_name_specifier))
18360 {
18363 "declaration of %qD in namespace %qD which does not "
18366 else
18368 "declaration of %qD in %qD which does not "
18372 }
18373 /* If that scope is the scope where the declaration is being placed
18374 the program is invalid. */
18378 {
18382 }
18383 }
18388 /* Consume the opening brace. */
18389 matching_braces braces;
18396 {
18400 }
18401 else
18402 {
18408 }
18412 /* If the next token is not '}', then there are some enumerators. */
18414 {
18418 }
18419 else
18422 /* Consume the final '}'. */
18428 }
18429 else
18430 {
18431 /* If a ';' follows, then it is an opaque-enum-specifier
18432 and additional restrictions apply. */
18434 {
18441 }
18442 }
18444 /* Look for trailing attributes to apply to this enumeration, and
18445 apply them if appropriate. */
18447 {
18450 trailing_attr,
18452 }
18454 /* Finish up the enumeration. */
18456 {
18461 }
18464 {
18466 {
18469 }
18471 {
18473 }
18474 }
18475 out:
18478 }
18480 /* Parse an enumerator-list. The enumerators all have the indicated
18481 TYPE.
18483 enumerator-list:
18484 enumerator-definition
18485 enumerator-list , enumerator-definition */
18487 static void
18489 {
18491 {
18492 /* Parse an enumerator-definition. */
18495 /* If the next token is not a ',', we've reached the end of
18496 the list. */
18499 /* Otherwise, consume the `,' and keep going. */
18501 /* If the next token is a `}', there is a trailing comma. */
18503 {
18508 }
18509 }
18510 }
18512 /* Parse an enumerator-definition. The enumerator has the indicated
18513 TYPE.
18515 enumerator-definition:
18516 enumerator
18517 enumerator = constant-expression
18519 enumerator:
18520 identifier
18522 GNU Extensions:
18524 enumerator-definition:
18525 enumerator attributes [opt]
18526 enumerator attributes [opt] = constant-expression */
18528 static void
18530 {
18531 tree identifier;
18532 tree value;
18533 location_t loc;
18535 /* Save the input location because we are interested in the location
18536 of the identifier and not the location of the explicit value. */
18539 /* Look for the identifier. */
18544 /* Parse any specified attributes. */
18547 /* If the next token is an '=', then there is an explicit value. */
18549 {
18550 /* Consume the `=' token. */
18552 /* Parse the value. */
18554 }
18555 else
18558 /* If we are processing a template, make sure the initializer of the
18559 enumerator doesn't contain any bare template parameter pack. */
18563 /* Create the enumerator. */
18565 }
18567 /* Parse a namespace-name.
18569 namespace-name:
18570 original-namespace-name
18571 namespace-alias
18573 Returns the NAMESPACE_DECL for the namespace. */
18575 static tree
18577 {
18578 tree identifier;
18579 tree namespace_decl;
18583 /* Get the name of the namespace. */
18588 /* Look up the identifier in the currently active scope. Look only
18589 for namespaces, due to:
18591 [basic.lookup.udir]
18593 When looking up a namespace-name in a using-directive or alias
18594 definition, only namespace names are considered.
18596 And:
18598 [basic.lookup.qual]
18600 During the lookup of a name preceding the :: scope resolution
18601 operator, object, function, and enumerator names are ignored.
18603 (Note that cp_parser_qualifying_entity only calls this
18604 function if the token after the name is the scope resolution
18605 operator.) */
18607 none_type,
18613 /* If it's not a namespace, issue an error. */
18616 {
18618 {
18624 }
18627 }
18630 }
18632 /* Parse a namespace-definition.
18634 namespace-definition:
18635 named-namespace-definition
18636 unnamed-namespace-definition
18638 named-namespace-definition:
18639 original-namespace-definition
18640 extension-namespace-definition
18642 original-namespace-definition:
18643 namespace identifier { namespace-body }
18645 extension-namespace-definition:
18646 namespace original-namespace-name { namespace-body }
18648 unnamed-namespace-definition:
18649 namespace { namespace-body } */
18651 static void
18653 {
18654 tree identifier;
18663 {
18666 }
18668 /* Look for the `namespace' keyword. */
18669 cp_token* token
18672 /* Parse any specified attributes before the identifier. */
18676 {
18680 {
18685 "standard attributes on namespaces must precede "
18688 /* Parse any attributes specified after the identifier. */
18690 }
18697 "nested namespace definitions only available with "
18700 /* Nested namespace names can create new namespaces (unlike
18701 other qualified-ids). */
18704 else
18707 }
18719 /* Start the namespace. */
18726 /* Look for the `{' to validate starting the namespace. */
18727 matching_braces braces;
18729 {
18730 /* Parse the body of the namespace. */
18733 /* Look for the final `}'. */
18735 }
18740 /* Pop the nested namespace definitions. */
18743 }
18745 /* Parse a namespace-body.
18747 namespace-body:
18748 declaration-seq [opt] */
18750 static void
18752 {
18754 }
18756 /* Parse a namespace-alias-definition.
18758 namespace-alias-definition:
18759 namespace identifier = qualified-namespace-specifier ; */
18761 static void
18763 {
18764 tree identifier;
18765 tree namespace_specifier;
18769 /* Look for the `namespace' keyword. */
18771 /* Look for the identifier. */
18775 /* Look for the `=' token. */
18778 {
18780 /* Skip the definition. */
18785 }
18787 /* Look for the qualified-namespace-specifier. */
18788 namespace_specifier
18790 /* Look for the `;' token. */
18793 /* Register the alias in the symbol table. */
18795 }
18797 /* Parse a qualified-namespace-specifier.
18799 qualified-namespace-specifier:
18800 :: [opt] nested-name-specifier [opt] namespace-name
18802 Returns a NAMESPACE_DECL corresponding to the specified
18803 namespace. */
18805 static tree
18807 {
18808 /* Look for the optional `::'. */
18812 /* Look for the optional nested-name-specifier. */
18820 }
18822 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18823 access declaration.
18825 using-declaration:
18826 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18827 using :: unqualified-id ;
18829 access-declaration:
18830 qualified-id ;
18832 */
18834 static bool
18837 {
18841 tree decl;
18842 tree identifier;
18843 tree qscope;
18848 {
18851 }
18852 else
18853 {
18854 /* Look for the `using' keyword. */
18857 again:
18858 /* Peek at the next token. */
18860 /* See if it's `typename'. */
18862 {
18863 /* Remember that we've seen it. */
18865 /* Consume the `typename' token. */
18867 }
18868 }
18870 /* Look for the optional global scope qualification. */
18871 global_scope_p
18876 /* If we saw `typename', or didn't see `::', then there must be a
18877 nested-name-specifier present. */
18879 {
18885 {
18888 }
18889 }
18890 /* Otherwise, we could be in either of the two productions. In that
18891 case, treat the nested-name-specifier as optional. */
18892 else
18904 /* Something has already gone wrong; there's no need to parse
18905 further. Since an error has occurred, the return value of
18906 cp_parser_parse_definitely will be false, as required. */
18910 /* Parse the unqualified-id. */
18918 {
18923 }
18925 {
18930 "pack expansion in using-declaration only available "
18933 }
18935 /* The function we call to handle a using-declaration is different
18936 depending on what scope we are in. */
18938 ;
18941 /* [namespace.udecl]
18943 A using declaration shall not name a template-id. */
18946 else
18947 {
18949 {
18950 /* Create the USING_DECL. */
18957 {
18960 }
18961 else
18962 /* Add it to the list of members in this class. */
18964 }
18965 else
18966 {
18968 identifier,
18975 {
18978 }
18981 else
18983 }
18984 }
18988 {
18992 "comma-separated list in using-declaration only available "
18995 }
18997 /* Look for the final `;'. */
19002 "access declarations are deprecated "
19003 "in favour of using-declarations; "
19007 }
19009 /* Parse an alias-declaration.
19011 alias-declaration:
19012 using identifier attribute-specifier-seq [opt] = type-id */
19014 static tree
19016 {
19018 location_t id_location;
19020 cp_decl_specifier_seq decl_specs;
19024 /* Look for the `using' keyword. */
19025 cp_token *using_token
19047 /* Now we are going to parse the type-id of the declaration. */
19049 /*
19050 [dcl.type]/3 says:
19052 "A type-specifier-seq shall not define a class or enumeration
19053 unless it appears in the type-id of an alias-declaration (7.1.3) that
19054 is not the declaration of a template-declaration."
19056 In other words, if we currently are in an alias template, the
19057 type-id should not define a type.
19059 So let's set parser->type_definition_forbidden_message in that
19060 case; cp_parser_check_type_definition (called by
19061 cp_parser_class_specifier) will then emit an error if a type is
19062 defined in the type-id. */
19064 {
19068 }
19072 /* Restore the error message if need be. */
19078 {
19081 }
19083 /* A typedef-name can also be introduced by an alias-declaration. The
19084 identifier following the using keyword becomes a typedef-name. It has
19085 the same semantics as if it were introduced by the typedef
19086 specifier. In particular, it does not define a new type and it shall
19087 not appear in the type-id. */
19092 {
19095 ds_attribute,
19096 attrs_token);
19097 }
19099 ds_typedef,
19100 using_token);
19102 ds_alias,
19103 using_token);
19109 id_location,
19120 else
19126 // Attach constraints to the alias declaration.
19128 {
19132 }
19139 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19140 added into the symbol table; otherwise, return the TYPE_DECL. */
19144 {
19148 }
19151 }
19153 /* Parse a using-directive.
19155 using-directive:
19156 using namespace :: [opt] nested-name-specifier [opt]
19157 namespace-name ; */
19159 static void
19161 {
19162 tree namespace_decl;
19163 tree attribs;
19165 /* Look for the `using' keyword. */
19167 /* And the `namespace' keyword. */
19169 /* Look for the optional `::' operator. */
19171 /* And the optional nested-name-specifier. */
19177 /* Get the namespace being used. */
19179 /* And any specified attributes. */
19182 /* Update the symbol table. */
19185 else
19188 /* Look for the final `;'. */
19190 }
19192 /* Parse an asm-definition.
19194 asm-definition:
19195 asm ( string-literal ) ;
19197 GNU Extension:
19199 asm-definition:
19200 asm volatile [opt] ( string-literal ) ;
19201 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19202 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19203 : asm-operand-list [opt] ) ;
19204 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19205 : asm-operand-list [opt]
19206 : asm-clobber-list [opt] ) ;
19207 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19208 : asm-clobber-list [opt]
19209 : asm-goto-list ) ; */
19211 static void
19213 {
19214 tree string;
19219 tree asm_stmt;
19227 /* Look for the `asm' keyword. */
19232 {
19235 }
19237 /* See if the next token is `volatile'. */
19240 {
19241 /* Remember that we saw the `volatile' keyword. */
19243 /* Consume the token. */
19245 }
19249 {
19250 /* Remember that we saw the `goto' keyword. */
19252 /* Consume the token. */
19254 }
19255 /* Look for the opening `('. */
19258 /* Look for the string. */
19261 {
19265 }
19267 /* If we're allowing GNU extensions, check for the extended assembly
19268 syntax. Unfortunately, the `:' tokens need not be separated by
19269 a space in C, and so, for compatibility, we tolerate that here
19270 too. Doing that means that we have to treat the `::' operator as
19271 two `:' tokens. */
19276 {
19281 /* The extended syntax was used. */
19284 /* Look for outputs. */
19286 {
19287 /* Consume the `:'. */
19289 /* Parse the output-operands. */
19291 CPP_COLON)
19293 CPP_SCOPE)
19295 CPP_CLOSE_PAREN)
19297 {
19301 }
19302 }
19303 /* If the next token is `::', there are no outputs, and the
19304 next token is the beginning of the inputs. */
19306 /* The inputs are coming next. */
19309 /* Look for inputs. */
19312 {
19313 /* Consume the `:' or `::'. */
19315 /* Parse the output-operands. */
19317 CPP_COLON)
19319 CPP_SCOPE)
19321 CPP_CLOSE_PAREN))
19322 {
19326 }
19327 }
19329 /* The clobbers are coming next. */
19332 /* Look for clobbers. */
19335 {
19337 /* Consume the `:' or `::'. */
19339 /* Parse the clobbers. */
19341 CPP_COLON)
19343 CPP_CLOSE_PAREN))
19345 }
19348 /* The labels are coming next. */
19351 /* Look for labels. */
19354 {
19356 /* Consume the `:' or `::'. */
19358 /* Parse the labels. */
19360 }
19364 }
19368 /* Look for the closing `)'. */
19376 {
19377 /* Create the ASM_EXPR. */
19379 {
19382 /* If the extended syntax was not used, mark the ASM_EXPR. */
19384 {
19390 }
19391 }
19392 else
19394 }
19395 }
19397 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19398 type that comes from the decl-specifier-seq. */
19400 static tree
19402 {
19405 {
19418 }
19421 }
19423 /* Declarators [gram.dcl.decl] */
19425 /* Parse an init-declarator.
19427 init-declarator:
19428 declarator initializer [opt]
19430 GNU Extension:
19432 init-declarator:
19433 declarator asm-specification [opt] attributes [opt] initializer [opt]
19435 function-definition:
19436 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19437 function-body
19438 decl-specifier-seq [opt] declarator function-try-block
19440 GNU Extension:
19442 function-definition:
19443 __extension__ function-definition
19445 TM Extension:
19447 function-definition:
19448 decl-specifier-seq [opt] declarator function-transaction-block
19450 The DECL_SPECIFIERS apply to this declarator. Returns a
19451 representation of the entity declared. If MEMBER_P is TRUE, then
19452 this declarator appears in a class scope. The new DECL created by
19453 this declarator is returned.
19455 The CHECKS are access checks that should be performed once we know
19456 what entity is being declared (and, therefore, what classes have
19457 befriended it).
19459 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19460 for a function-definition here as well. If the declarator is a
19461 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19462 be TRUE upon return. By that point, the function-definition will
19463 have been completely parsed.
19465 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19466 is FALSE.
19468 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19469 parsed declaration if it is an uninitialized single declarator not followed
19470 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19471 if present, will not be consumed. If returned, this declarator will be
19472 created with SD_INITIALIZED but will not call cp_finish_decl.
19474 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19475 and there is an initializer, the pointed location_t is set to the
19476 location of the '=' or `(', or '{' in C++11 token introducing the
19477 initializer. */
19479 static tree
19490 {
19494 tree prefix_attributes;
19496 tree asm_specification;
19497 tree initializer;
19499 tree scope;
19501 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19502 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19503 "(...)". */
19514 /* Gather the attributes that were provided with the
19515 decl-specifiers. */
19518 /* Assume that this is not the declarator for a function
19519 definition. */
19523 /* Default arguments are only permitted for function parameters. */
19527 /* Defer access checks while parsing the declarator; we cannot know
19528 what names are accessible until we know what is being
19529 declared. */
19534 /* Parse the declarator. */
19535 declarator
19540 /* Gather up the deferred checks. */
19545 /* If the DECLARATOR was erroneous, there's no need to go
19546 further. */
19550 /* Check that the number of template-parameter-lists is OK. */
19560 /* Figure out what scope the entity declared by the DECLARATOR is
19561 located in. `grokdeclarator' sometimes changes the scope, so
19562 we compute it now. */
19565 /* Perform any lookups in the declared type which were thought to be
19566 dependent, but are not in the scope of the declarator. */
19567 decl_specifiers->type
19570 /* If we're allowing GNU extensions, look for an
19571 asm-specification. */
19573 {
19574 /* Look for an asm-specification. */
19577 }
19578 else
19581 /* Look for attributes. */
19585 /* Peek at the next token. */
19591 {
19592 /* Handle C++17 deduction guides. */
19596 {
19604 {
19608 }
19609 }
19611 /* Check to see if the token indicates the start of a
19612 function-definition. */
19614 {
19616 {
19617 /* If a function-definition should not appear here, issue an
19618 error message. */
19622 }
19624 location_t func_brace_location
19627 /* Neither attributes nor an asm-specification are allowed
19628 on a function-definition. */
19631 "an asm-specification is not allowed "
19635 "attributes are not allowed "
19637 /* This is a function-definition. */
19640 /* Parse the function definition. */
19643 decl_specifiers,
19644 declarator,
19645 prefix_attributes);
19646 else
19647 decl =
19648 (cp_parser_function_definition_from_specifiers_and_declarator
19652 {
19653 /* This is where the prologue starts... */
19656 }
19659 }
19660 }
19662 {
19663 /* A non-template declaration involving a function parameter list
19664 containing an implicit template parameter will be made into a
19665 template. If the resulting declaration is not going to be an
19666 actual function then finish the template scope here to prevent it.
19667 An error message will be issued once we have a decl to talk about.
19669 FIXME probably we should do type deduction rather than create an
19670 implicit template, but the standard currently doesn't allow it. */
19673 }
19675 /* [dcl.dcl]
19677 Only in function declarations for constructors, destructors, type
19678 conversions, and deduction guides can the decl-specifier-seq be omitted.
19680 We explicitly postpone this check past the point where we handle
19681 function-definitions because we tolerate function-definitions
19682 that are missing their return types in some modes. */
19684 {
19688 }
19690 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19694 {
19705 {
19711 }
19712 }
19713 else
19714 {
19715 /* If the init-declarator isn't initialized and isn't followed by a
19716 `,' or `;', it's not a valid init-declarator. */
19719 {
19722 else
19723 {
19727 }
19728 }
19731 }
19733 /* Because start_decl has side-effects, we should only call it if we
19734 know we're going ahead. By this point, we know that we cannot
19735 possibly be looking at any other construct. */
19738 /* Enter the newly declared entry in the symbol table. If we're
19739 processing a declaration in a class-specifier, we wait until
19740 after processing the initializer. */
19742 {
19750 /* Adjust location of decl if declarator->id_loc is more appropriate:
19751 set, and decl wasn't merged with another decl, in which case its
19752 location would be different from input_location, and more accurate. */
19757 }
19759 /* Enter the SCOPE. That way unqualified names appearing in the
19760 initializer will be looked up in SCOPE. */
19763 /* Perform deferred access control checks, now that we know in which
19764 SCOPE the declared entity resides. */
19766 {
19769 /* If the entity being declared is a function, pretend that we
19770 are in its scope. If it is a `friend', it may have access to
19771 things that would not otherwise be accessible. */
19773 {
19776 }
19778 /* Perform access checks for template parameters. */
19781 /* Perform the access control checks for the declarator and the
19782 decl-specifiers. */
19785 /* Restore the saved value. */
19788 }
19790 /* Parse the initializer. */
19795 {
19797 {
19800 else
19801 {
19802 /* If the declaration was erroneous, we don't really
19803 know what the user intended, so just silently
19804 consume the initializer. */
19811 }
19812 }
19813 else
19814 {
19815 /* We want to record the extra mangling scope for in-class
19816 initializers of class members and initializers of static data
19817 member templates. The former involves deferring
19818 parsing of the initializer until end of class as with default
19819 arguments. So right here we only handle the latter. */
19829 }
19830 }
19832 /* The old parser allows attributes to appear after a parenthesized
19833 initializer. Mark Mitchell proposed removing this functionality
19834 on the GCC mailing lists on 2002-08-13. This parser accepts the
19835 attributes -- but ignores them. Made a permerror in GCC 8. */
19841 {
19844 {
19848 }
19849 }
19851 /* And now complain about a non-function implicit template. */
19856 /* For an in-class declaration, use `grokfield' to create the
19857 declaration. */
19859 {
19861 {
19864 }
19873 }
19875 /* Finish processing the declaration. But, skip member
19876 declarations. */
19878 {
19881 asm_specification,
19882 /* If the initializer is in parentheses, then this is
19883 a direct-initialization, which means that an
19884 `explicit' constructor is OK. Otherwise, an
19885 `explicit' constructor cannot be used. */
19888 }
19891 /* Core issue #226 (C++0x only): A default template-argument
19892 shall not be specified in a friend class template
19893 declaration. */
19902 {
19905 else
19907 }
19914 }
19916 /* Parse a declarator.
19918 declarator:
19919 direct-declarator
19920 ptr-operator declarator
19922 abstract-declarator:
19923 ptr-operator abstract-declarator [opt]
19924 direct-abstract-declarator
19926 GNU Extensions:
19928 declarator:
19929 attributes [opt] direct-declarator
19930 attributes [opt] ptr-operator declarator
19932 abstract-declarator:
19933 attributes [opt] ptr-operator abstract-declarator [opt]
19934 attributes [opt] direct-abstract-declarator
19936 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19937 detect constructors, destructors, deduction guides, or conversion operators.
19938 It is set to -1 if the declarator is a name, and +1 if it is a
19939 function. Otherwise it is set to zero. Usually you just want to
19940 test for >0, but internally the negative value is used.
19942 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19943 a decl-specifier-seq unless it declares a constructor, destructor,
19944 or conversion. It might seem that we could check this condition in
19945 semantic analysis, rather than parsing, but that makes it difficult
19946 to handle something like `f()'. We want to notice that there are
19947 no decl-specifiers, and therefore realize that this is an
19948 expression, not a declaration.)
19950 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19951 the declarator is a direct-declarator of the form "(...)".
19953 MEMBER_P is true iff this declarator is a member-declarator.
19955 FRIEND_P is true iff this declarator is a friend. */
19959 cp_parser_declarator_kind dcl_kind,
19963 {
19966 cp_cv_quals cv_quals;
19967 tree class_type;
19970 /* Assume this is not a constructor, destructor, or type-conversion
19971 operator. */
19978 /* Check for the ptr-operator production. */
19980 /* Parse the ptr-operator. */
19986 /* If that worked, then we have a ptr-operator. */
19988 {
19989 /* If a ptr-operator was found, then this declarator was not
19990 parenthesized. */
19993 /* The dependent declarator is optional if we are parsing an
19994 abstract-declarator. */
19998 /* Parse the dependent declarator. */
20003 friend_p);
20005 /* If we are parsing an abstract-declarator, we must handle the
20006 case where the dependent declarator is absent. */
20011 declarator = cp_parser_make_indirect_declarator
20013 }
20014 /* Everything else is a direct-declarator. */
20015 else
20016 {
20019 CPP_OPEN_PAREN);
20021 ctor_dtor_or_conv_p,
20023 }
20028 }
20030 /* Parse a direct-declarator or direct-abstract-declarator.
20032 direct-declarator:
20033 declarator-id
20034 direct-declarator ( parameter-declaration-clause )
20035 cv-qualifier-seq [opt]
20036 ref-qualifier [opt]
20037 exception-specification [opt]
20038 direct-declarator [ constant-expression [opt] ]
20039 ( declarator )
20041 direct-abstract-declarator:
20042 direct-abstract-declarator [opt]
20043 ( parameter-declaration-clause )
20044 cv-qualifier-seq [opt]
20045 ref-qualifier [opt]
20046 exception-specification [opt]
20047 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20048 ( abstract-declarator )
20050 Returns a representation of the declarator. DCL_KIND is
20051 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20052 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20053 we are parsing a direct-declarator. It is
20054 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20055 of ambiguity we prefer an abstract declarator, as per
20056 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
20057 as for cp_parser_declarator. */
20061 cp_parser_declarator_kind dcl_kind,
20064 {
20075 {
20076 /* Peek at the next token. */
20079 {
20080 /* This is either a parameter-declaration-clause, or a
20081 parenthesized declarator. When we know we are parsing a
20082 named declarator, it must be a parenthesized declarator
20083 if FIRST is true. For instance, `(int)' is a
20084 parameter-declaration-clause, with an omitted
20085 direct-abstract-declarator. But `((*))', is a
20086 parenthesized abstract declarator. Finally, when T is a
20087 template parameter `(T)' is a
20088 parameter-declaration-clause, and not a parenthesized
20089 named declarator.
20091 We first try and parse a parameter-declaration-clause,
20092 and then try a nested declarator (if FIRST is true).
20094 It is not an error for it not to be a
20095 parameter-declaration-clause, even when FIRST is
20096 false. Consider,
20098 int i (int);
20099 int i (3);
20101 The first is the declaration of a function while the
20102 second is the definition of a variable, including its
20103 initializer.
20105 Having seen only the parenthesis, we cannot know which of
20106 these two alternatives should be selected. Even more
20107 complex are examples like:
20109 int i (int (a));
20110 int i (int (3));
20112 The former is a function-declaration; the latter is a
20113 variable initialization.
20115 Thus again, we try a parameter-declaration-clause, and if
20116 that fails, we back out and return. */
20119 {
20120 tree params;
20125 /* In a member-declarator, the only valid interpretation
20126 of a parenthesis is the start of a
20127 parameter-declaration-clause. (It is invalid to
20128 initialize a static data member with a parenthesized
20129 initializer; only the "=" form of initialization is
20130 permitted.) */
20134 /* Consume the `('. */
20135 matching_parens parens;
20138 {
20139 /* If this is going to be an abstract declarator, we're
20140 in a declarator and we can't have default args. */
20143 }
20147 /* Parse the parameter-declaration-clause. */
20150 /* Consume the `)'. */
20153 /* If all went well, parse the cv-qualifier-seq,
20154 ref-qualifier and the exception-specification. */
20156 {
20157 cp_cv_quals cv_quals;
20158 cp_virt_specifiers virt_specifiers;
20159 cp_ref_qualifier ref_qual;
20160 tree exception_specification;
20161 tree late_return;
20162 tree attrs;
20172 /* Parse the cv-qualifier-seq. */
20174 /* Parse the ref-qualifier. */
20176 /* Parse the tx-qualifier. */
20178 /* And the exception-specification. */
20179 exception_specification
20184 /* In here, we handle cases where attribute is used after
20185 the function declaration. For example:
20186 void func (int x) __attribute__((vector(..))); */
20189 late_return = (cp_parser_late_return_type_opt
20193 /* Parse the virt-specifier-seq. */
20196 /* Create the function-declarator. */
20198 params,
20199 cv_quals,
20200 virt_specifiers,
20201 ref_qual,
20202 tx_qual,
20203 exception_specification,
20204 late_return,
20205 requires_clause);
20208 /* Any subsequent parameter lists are to do with
20209 return type, so are not those of the declared
20210 function. */
20212 }
20214 /* Remove the function parms from scope. */
20218 /* Repeat the main loop. */
20220 }
20222 /* If this is the first, we can try a parenthesized
20223 declarator. */
20225 {
20232 /* Consume the `('. */
20233 matching_parens parens;
20235 /* Parse the nested declarator. */
20238 declarator
20244 /* Expect a `)'. */
20252 }
20253 /* Otherwise, we must be done. */
20254 else
20256 }
20260 {
20261 /* Parse an array-declarator. */
20271 /* Consume the `['. */
20273 /* Peek at the next token. */
20275 /* If the next token is `]', then there is no
20276 constant-expression. */
20278 {
20280 bounds
20290 {
20291 /* Normally, the array bound must be an integral constant
20292 expression. However, as an extension, we allow VLAs
20293 in function scopes as long as they aren't part of a
20294 parameter declaration. */
20298 }
20301 {
20302 /* Remember this wasn't a constant-expression. */
20305 }
20306 }
20307 else
20309 /* Look for the closing `]'. */
20311 {
20314 }
20319 }
20321 {
20322 {
20323 tree qualifying_scope;
20324 tree unqualified_name;
20325 tree attrs;
20326 special_function_kind sfk;
20331 /* Parse a declarator-id */
20334 {
20337 /* If we see an ellipsis, we should be looking at a
20338 parameter pack. */
20340 {
20341 /* Consume the `...' */
20345 }
20346 }
20349 unqualified_name
20353 {
20357 {
20358 /* Check whether an error occurred. */
20361 /* We already consumed the ellipsis to mark a
20362 parameter pack, but we have no way to report it,
20363 so abort the tentative parse. We will be exiting
20364 immediately anyway. */
20366 }
20367 else
20373 && (qualifying_scope
20375 {
20378 }
20379 }
20384 {
20389 }
20395 {
20396 /* In the declaration of a member of a template class
20397 outside of the class itself, the SCOPE will sometimes
20398 be a TYPENAME_TYPE. For example, given:
20400 template <typename T>
20401 int S<T>::R::i = 3;
20403 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20404 this context, we must resolve S<T>::R to an ordinary
20405 type, rather than a typename type.
20407 The reason we normally avoid resolving TYPENAME_TYPEs
20408 is that a specialization of `S' might render
20409 `S<T>::R' not a type. However, if `S' is
20410 specialized, then this `i' will not be used, so there
20411 is no harm in resolving the types here. */
20412 tree type;
20414 /* Resolve the TYPENAME_TYPE. */
20417 /* If that failed, the declarator is invalid. */
20419 {
20422 "cannot define member of dependent typedef "
20424 else
20429 }
20431 }
20436 {
20437 tree class_type;
20442 else
20446 {
20450 {
20451 /* We do not attempt to print the declarator
20452 here because we do not have enough
20453 information about its original syntactic
20454 form. */
20458 }
20461 {
20465 "use %<%T::%D%> instead of %<%T::%D%> to "
20467 class_type,
20472 }
20474 }
20477 {
20484 for an unnamed type, even if the type
20485 got a name for linkage purposes. */
20487 /* Handle correctly (c++/19200):
20489 struct S {
20490 struct T{};
20491 friend void S(T);
20492 };
20494 and also:
20496 namespace N {
20497 void S();
20498 }
20500 struct S {
20501 friend void N::S();
20502 }; */
20505 class_type))
20514 }
20515 }
20517 unqualified_name,
20518 sfk);
20525 }
20527 handle_declarator:;
20530 {
20531 /* Any names that appear after the declarator-id for a
20532 member are looked up in the containing scope. */
20534 {
20535 /* But declarations with qualified-ids can't appear in a
20536 function. */
20540 }
20542 }
20546 /* Default args are only allowed on function
20547 declarations. */
20549 else
20553 }
20554 /* We're done. */
20555 else
20557 }
20559 /* For an abstract declarator, we might wind up with nothing at this
20560 point. That's an error; the declarator is not optional. */
20564 {
20565 /* Record overly parenthesized declarator so we can give a
20566 diagnostic about confusing decl/expr disambiguation. */
20568 {
20569 /* If the open and close parens are on different lines, this
20570 is probably a formatting thing, so ignore. */
20575 }
20578 }
20580 /* If we entered a scope, we must exit it now. */
20588 }
20590 /* Parse a ptr-operator.
20592 ptr-operator:
20593 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20594 * cv-qualifier-seq [opt]
20595 &
20596 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20597 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20599 GNU Extension:
20601 ptr-operator:
20602 & cv-qualifier-seq [opt]
20604 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20605 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20606 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20607 filled in with the TYPE containing the member. *CV_QUALS is
20608 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20609 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20610 Note that the tree codes returned by this function have nothing
20611 to do with the types of trees that will be eventually be created
20612 to represent the pointer or reference type being parsed. They are
20613 just constants with suggestive names. */
20614 static enum tree_code
20619 {
20624 /* Assume that it's not a pointer-to-member. */
20626 /* And that there are no cv-qualifiers. */
20629 /* Peek at the next token. */
20632 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20642 {
20643 /* Consume the `*', `&' or `&&'. */
20646 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20647 `&', if we are allowing GNU extensions. (The only qualifier
20648 that can legally appear after `&' is `restrict', but that is
20649 enforced during semantic analysis. */
20657 }
20658 else
20659 {
20660 /* Try the pointer-to-member case. */
20662 /* Look for the optional `::' operator. */
20665 /* Look for the nested-name specifier. */
20672 /* If we found it, and the next token is a `*', then we are
20673 indeed looking at a pointer-to-member operator. */
20676 {
20677 /* Indicate that the `*' operator was used. */
20685 else
20686 {
20687 /* The type of which the member is a member is given by the
20688 current SCOPE. */
20690 /* The next name will not be qualified. */
20694 /* Look for optional c++11 attributes. */
20698 /* Look for the optional cv-qualifier-seq. */
20700 }
20701 }
20702 /* If that didn't work we don't have a ptr-operator. */
20705 }
20708 }
20710 /* Parse an (optional) cv-qualifier-seq.
20712 cv-qualifier-seq:
20713 cv-qualifier cv-qualifier-seq [opt]
20715 cv-qualifier:
20716 const
20717 volatile
20719 GNU Extension:
20721 cv-qualifier:
20722 __restrict__
20724 Returns a bitmask representing the cv-qualifiers. */
20726 static cp_cv_quals
20728 {
20732 {
20734 cp_cv_quals cv_qualifier;
20736 /* Peek at the next token. */
20738 /* See if it's a cv-qualifier. */
20740 {
20756 }
20762 {
20767 }
20768 else
20769 {
20772 }
20773 }
20776 }
20778 /* Parse an (optional) ref-qualifier
20780 ref-qualifier:
20781 &
20782 &&
20784 Returns cp_ref_qualifier representing ref-qualifier. */
20786 static cp_ref_qualifier
20788 {
20791 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20796 {
20801 {
20813 }
20818 {
20821 }
20822 else
20823 {
20826 }
20827 }
20830 }
20832 /* Parse an optional tx-qualifier.
20834 tx-qualifier:
20835 transaction_safe
20836 transaction_safe_dynamic */
20838 static tree
20840 {
20843 {
20848 {
20852 {
20855 {
20858 }
20859 else
20861 }
20862 }
20863 }
20865 }
20867 /* Parse an (optional) virt-specifier-seq.
20869 virt-specifier-seq:
20870 virt-specifier virt-specifier-seq [opt]
20872 virt-specifier:
20873 override
20874 final
20876 Returns a bitmask representing the virt-specifiers. */
20878 static cp_virt_specifiers
20880 {
20884 {
20886 cp_virt_specifiers virt_specifier;
20888 /* Peek at the next token. */
20890 /* See if it's a virt-specifier-qualifier. */
20894 {
20897 }
20899 {
20902 }
20904 {
20906 }
20907 else
20911 {
20916 }
20917 else
20918 {
20921 }
20922 }
20924 }
20926 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20927 is in scope even though it isn't real. */
20929 void
20931 {
20932 tree this_parm;
20935 {
20936 /* We don't clear this between NSDMIs. Is it already what we want? */
20943 }
20946 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20948 current_class_ref
20951 }
20953 /* Return true iff our current scope is a non-static data member
20954 initializer. */
20956 bool
20958 {
20959 /* We recognize NSDMI context by the context-less 'this' pointer set up
20960 by the function above. */
20966 }
20968 /* Parse a late-specified return type, if any. This is not a separate
20969 non-terminal, but part of a function declarator, which looks like
20971 -> trailing-type-specifier-seq abstract-declarator(opt)
20973 Returns the type indicated by the type-id.
20975 In addition to this, parse any queued up #pragma omp declare simd
20976 clauses, and #pragma acc routine clauses.
20978 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20979 function. */
20981 static tree
20984 {
20988 && declarator
20992 && declarator
20995 /* Peek at the next token. */
20997 /* A late-specified return type is indicated by an initial '->'. */
21008 {
21009 /* DR 1207: 'this' is in scope in the trailing return type. */
21011 }
21014 {
21015 /* Consume the ->. */
21019 }
21021 /* Function declarations may be followed by a trailing
21022 requires-clause. */
21026 declarator->attributes
21030 declarator->attributes
21035 {
21038 }
21041 }
21043 /* Parse a declarator-id.
21045 declarator-id:
21046 id-expression
21047 :: [opt] nested-name-specifier [opt] type-name
21049 In the `id-expression' case, the value returned is as for
21050 cp_parser_id_expression if the id-expression was an unqualified-id.
21051 If the id-expression was a qualified-id, then a SCOPE_REF is
21052 returned. The first operand is the scope (either a NAMESPACE_DECL
21053 or TREE_TYPE), but the second is still just a representation of an
21054 unqualified-id. */
21056 static tree
21058 {
21059 tree id;
21060 /* The expression must be an id-expression. Assume that qualified
21061 names are the names of types so that:
21063 template <class T>
21064 int S<T>::R::i = 3;
21066 will work; we must treat `S<T>::R' as the name of a type.
21067 Similarly, assume that qualified names are templates, where
21068 required, so that:
21070 template <class T>
21071 int S<T>::R<T>::i = 3;
21073 will work, too. */
21079 optional_p);
21083 }
21085 /* Parse a type-id.
21087 type-id:
21088 type-specifier-seq abstract-declarator [opt]
21090 Returns the TYPE specified. */
21092 static tree
21095 {
21096 cp_decl_specifier_seq type_specifier_seq;
21099 /* Parse the type-specifier-seq. */
21101 is_trailing_return,
21106 /* A bare template name as a template argument is a template template
21107 argument, not a placeholder, so fail parsing it as a type argument. */
21108 {
21112 }
21116 /* There might or might not be an abstract declarator. */
21118 /* Look for the declarator. */
21119 abstract_declarator
21124 /* Check to see if there really was a declarator. */
21129 /* The concepts TS allows 'auto' as a type-id. */
21131 /* None of the valid uses of 'auto' in C++14 involve the type-id
21132 nonterminal, but it is valid in a trailing-return-type. */
21135 {
21136 /* A type-id with type 'auto' is only ok if the abstract declarator
21137 is a function declarator with a late-specified return type.
21139 A type-id with 'auto' is also valid in a trailing-return-type
21140 in a compound-requirement. */
21147 else
21148 {
21151 {
21153 auto_node);
21155 tmpl);
21156 }
21157 else
21160 }
21161 }
21164 is_template_arg);
21165 }
21167 static tree
21169 {
21171 }
21173 static tree
21175 {
21176 tree r;
21178 parser->type_definition_forbidden_message
21183 {
21186 }
21188 }
21190 static tree
21192 {
21194 }
21196 /* Parse a type-specifier-seq.
21198 type-specifier-seq:
21199 type-specifier type-specifier-seq [opt]
21201 GNU extension:
21203 type-specifier-seq:
21204 attributes type-specifier-seq [opt]
21206 If IS_DECLARATION is true, we are at the start of a "condition" or
21207 exception-declaration, so we might be followed by a declarator-id.
21209 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21210 i.e. we've just seen "->".
21212 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21214 static void
21219 {
21224 /* Clear the TYPE_SPECIFIER_SEQ. */
21227 /* In the context of a trailing return type, enum E { } is an
21228 elaborated-type-specifier followed by a function-body, not an
21229 enum-specifier. */
21233 /* Parse the type-specifiers and attributes. */
21235 {
21236 tree type_specifier;
21239 /* Check for attributes first. */
21241 {
21242 type_specifier_seq->attributes
21246 }
21248 /* record the token of the beginning of the type specifier seq,
21249 for error reporting purposes*/
21253 /* Look for the type-specifier. */
21255 flags,
21256 type_specifier_seq,
21258 NULL,
21261 {
21262 /* If the first type-specifier could not be found, this is not a
21263 type-specifier-seq at all. */
21265 {
21266 /* Set in_declarator_p to avoid skipping to the semicolon. */
21278 }
21279 /* If subsequent type-specifiers could not be found, the
21280 type-specifier-seq is complete. */
21282 }
21285 /* The standard says that a condition can be:
21287 type-specifier-seq declarator = assignment-expression
21289 However, given:
21291 struct S {};
21292 if (int S = ...)
21294 we should treat the "S" as a declarator, not as a
21295 type-specifier. The standard doesn't say that explicitly for
21296 type-specifier-seq, but it does say that for
21297 decl-specifier-seq in an ordinary declaration. Perhaps it
21298 would be clearer just to allow a decl-specifier-seq here, and
21299 then add a semantic restriction that if any decl-specifiers
21300 that are not type-specifiers appear, the program is invalid. */
21303 }
21304 }
21306 /* Return whether the function currently being declared has an associated
21307 template parameter list. */
21309 static bool
21311 {
21324 }
21326 /* Parse a parameter-declaration-clause.
21328 parameter-declaration-clause:
21329 parameter-declaration-list [opt] ... [opt]
21330 parameter-declaration-list , ...
21332 Returns a representation for the parameter declarations. A return
21333 value of NULL indicates a parameter-declaration-clause consisting
21334 only of an ellipsis. */
21336 static tree
21338 {
21339 tree parameters;
21347 && !processing_template_parmlist
21348 && !processing_explicit_instantiation
21349 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21350 actual function or a random abstract declarator. */
21356 /* Peek at the next token. */
21358 /* Check for trivial parameter-declaration-clauses. */
21360 {
21361 /* Consume the `...' token. */
21364 }
21366 /* There are no parameters. */
21367 {
21368 #ifdef SYSTEM_IMPLICIT_EXTERN_C
21373 else
21374 #endif
21376 }
21377 /* Check for `(void)', too, which is a special case. */
21381 {
21382 /* Consume the `void' token. */
21384 /* There are no parameters. */
21386 }
21388 /* Parse the parameter-declaration-list. */
21390 /* If a parse error occurred while parsing the
21391 parameter-declaration-list, then the entire
21392 parameter-declaration-clause is erroneous. */
21396 /* Peek at the next token. */
21398 /* If it's a `,', the clause should terminate with an ellipsis. */
21400 {
21401 /* Consume the `,'. */
21403 /* Expect an ellipsis. */
21404 ellipsis_p
21406 }
21407 /* It might also be `...' if the optional trailing `,' was
21408 omitted. */
21410 {
21411 /* Consume the `...' token. */
21413 /* And remember that we saw it. */
21415 }
21416 else
21419 /* Finish the parameter list. */
21424 }
21426 /* Parse a parameter-declaration-list.
21428 parameter-declaration-list:
21429 parameter-declaration
21430 parameter-declaration-list , parameter-declaration
21432 Returns a representation of the parameter-declaration-list, as for
21433 cp_parser_parameter_declaration_clause. However, the
21434 `void_list_node' is never appended to the list. */
21436 static tree
21438 {
21444 /* The special considerations that apply to a function within an
21445 unbraced linkage specifications do not apply to the parameters
21446 to the function. */
21447 saved_in_unbraced_linkage_specification_p
21451 /* Look for more parameters. */
21453 {
21458 /* Parse the parameter. */
21459 parameter
21464 /* We don't know yet if the enclosing context is deprecated, so wait
21465 and warn in grokparms if appropriate. */
21469 {
21472 PARM,
21477 }
21481 /* If a parse error occurred parsing the parameter declaration,
21482 then the entire parameter-declaration-list is erroneous. */
21484 {
21487 }
21497 {
21501 }
21503 /* Add the new parameter to the list. */
21507 /* Peek at the next token. */
21510 /* These are for Objective-C++ */
21513 /* The parameter-declaration-list is complete. */
21516 {
21519 /* Peek at the next token. */
21521 /* If it's an ellipsis, then the list is complete. */
21524 /* Otherwise, there must be more parameters. Consume the
21525 `,'. */
21527 /* When parsing something like:
21529 int i(float f, double d)
21531 we can tell after seeing the declaration for "f" that we
21532 are not looking at an initialization of a variable "i",
21533 but rather at the declaration of a function "i".
21535 Due to the fact that the parsing of template arguments
21536 (as specified to a template-id) requires backtracking we
21537 cannot use this technique when inside a template argument
21538 list. */
21542 /* However, a parameter-declaration of the form
21543 "float(f)" (which is a valid declaration of a
21544 parameter "f") can also be interpreted as an
21545 expression (the conversion of "f" to "float"). */
21548 }
21549 else
21550 {
21558 }
21559 }
21561 parser->in_unbraced_linkage_specification_p
21564 /* Reset implicit_template_scope if we are about to leave the function
21565 parameter list that introduced it. Note that for out-of-line member
21566 definitions, there will be one or more class scopes before we get to
21567 the template parameter scope. */
21571 {
21575 {
21578 }
21579 }
21582 }
21584 /* Parse a parameter declaration.
21586 parameter-declaration:
21587 decl-specifier-seq ... [opt] declarator
21588 decl-specifier-seq declarator = assignment-expression
21589 decl-specifier-seq ... [opt] abstract-declarator [opt]
21590 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21592 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21593 declares a template parameter. (In that case, a non-nested `>'
21594 token encountered during the parsing of the assignment-expression
21595 is not interpreted as a greater-than operator.)
21597 Returns a representation of the parameter, or NULL if an error
21598 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21599 true iff the declarator is of the form "(p)". */
21605 {
21607 cp_decl_specifier_seq decl_specifiers;
21609 tree default_argument;
21614 /* In a template parameter, `>' is not an operator.
21616 [temp.param]
21618 When parsing a default template-argument for a non-type
21619 template-parameter, the first non-nested `>' is taken as the end
21620 of the template parameter-list rather than a greater-than
21621 operator. */
21623 /* Type definitions may not appear in parameter types. */
21625 parser->type_definition_forbidden_message
21632 /* Parse the declaration-specifiers. */
21635 CP_PARSER_FLAGS_NONE,
21639 /* Complain about missing 'typename' or other invalid type names. */
21644 /* If an error occurred, there's no reason to attempt to parse the
21645 rest of the declaration. */
21647 {
21650 }
21652 /* Peek at the next token. */
21655 /* If the next token is a `)', `,', `=', `>', or `...', then there
21656 is no declarator. However, when variadic templates are enabled,
21657 there may be a declarator following `...'. */
21662 {
21666 }
21667 /* Otherwise, there should be a declarator. */
21668 else
21669 {
21673 /* After seeing a decl-specifier-seq, if the next token is not a
21674 "(", there is no possibility that the code is a valid
21675 expression. Therefore, if parsing tentatively, we commit at
21676 this point. */
21678 /* In an expression context, having seen:
21680 (int((char ...
21682 we cannot be sure whether we are looking at a
21683 function-type (taking a "char" as a parameter) or a cast
21684 of some object of type "char" to "int". */
21690 /* Parse the declarator. */
21693 CP_PARSER_DECLARATOR_EITHER,
21695 parenthesized_p,
21699 /* After the declarator, allow more attributes. */
21700 decl_specifiers.attributes
21704 /* If the declarator is a template parameter pack, remember that and
21705 clear the flag in the declarator itself so we don't get errors
21706 from grokdeclarator. */
21708 {
21711 }
21712 }
21714 /* If the next token is an ellipsis, and we have not seen a declarator
21715 name, and if either the type of the declarator contains parameter
21716 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21717 for, eg, abbreviated integral type names), then we actually have a
21718 parameter pack expansion expression. Otherwise, leave the ellipsis
21719 for a C-style variadic function. */
21722 /* If a function parameter pack was specified and an implicit template
21723 parameter was introduced during cp_parser_parameter_declaration,
21724 change any implicit parameters introduced into packs. */
21728 {
21736 }
21739 {
21750 {
21751 /* Consume the `...'. */
21755 /* Build a pack expansion type */
21760 else
21762 }
21763 }
21765 /* The restriction on defining new types applies only to the type
21766 of the parameter, not to the default argument. */
21769 /* If the next token is `=', then process a default argument. */
21771 {
21774 /* If we are defining a class, then the tokens that make up the
21775 default argument must be saved and processed later. */
21781 // A constrained-type-specifier may declare a type template-parameter.
21783 default_argument
21786 // A constrained-type-specifier may declare a template-template-parameter.
21788 default_argument
21791 /* Outside of a class definition, we can just parse the
21792 assignment-expression. */
21793 else
21794 default_argument
21798 {
21800 "default arguments are only "
21802 }
21804 || template_parameter_pack_p
21807 {
21808 /* Find the name of the parameter pack. */
21815 template_parm_p
21821 else
21823 template_parm_p
21830 }
21831 }
21832 else
21835 /* Generate a location for the parameter, ranging from the start of the
21836 initial token to the end of the final token (using input_location for
21837 the latter, set up by cp_lexer_set_source_position_from_token when
21838 consuming tokens).
21840 If we have a identifier, then use it for the caret location, e.g.
21842 extern int callee (int one, int (*two)(int, int), float three);
21843 ~~~~~~^~~~~~~~~~~~~~
21845 otherwise, reuse the start location for the caret location e.g.:
21847 extern int callee (int one, int (*)(int, int), float three);
21848 ^~~~~~~~~~~~~~~~~
21850 */
21856 input_location);
21859 declarator,
21860 default_argument,
21861 param_loc,
21862 template_parameter_pack_p);
21863 }
21865 /* Parse a default argument and return it.
21867 TEMPLATE_PARM_P is true if this is a default argument for a
21868 non-type template parameter. */
21869 static tree
21871 {
21877 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21878 set correctly. */
21881 /* Local variable names (and the `this' keyword) may not
21882 appear in a default argument. */
21885 /* Parse the assignment-expression. */
21890 /* The "this" pointer is not valid in a default argument. */
21892 {
21897 }
21898 default_argument
21900 /* Restore the "this" pointer. */
21902 {
21905 }
21914 }
21916 /* Parse a function-body.
21918 function-body:
21919 compound_statement */
21921 static void
21923 {
21927 }
21929 /* Parse a ctor-initializer-opt followed by a function-body. Return
21930 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21931 is true we are parsing a function-try-block. */
21933 static void
21936 {
21943 /* Begin the function body. */
21945 /* Parse the optional ctor-initializer. */
21948 /* If we're parsing a constexpr constructor definition, we need
21949 to check that the constructor body is indeed empty. However,
21950 before we get to cp_parser_function_body lot of junk has been
21951 generated, so we can't just check that we have an empty block.
21952 Rather we take a snapshot of the outermost block, and check whether
21953 cp_parser_function_body changed its state. */
21955 {
21959 }
21960 /* Parse the function-body. */
21964 /* Finish the function body. */
21966 }
21968 /* Parse an initializer.
21970 initializer:
21971 = initializer-clause
21972 ( expression-list )
21974 Returns an expression representing the initializer. If no
21975 initializer is present, NULL_TREE is returned.
21977 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21978 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21979 set to TRUE if there is no initializer present. If there is an
21980 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21981 is set to true; otherwise it is set to false. */
21983 static tree
21986 {
21988 tree init;
21990 /* Peek at the next token. */
21993 /* Let our caller know whether or not this initializer was
21994 parenthesized. */
21996 /* Assume that the initializer is constant. */
22000 {
22001 /* Consume the `='. */
22003 /* Parse the initializer-clause. */
22005 }
22007 {
22012 non_constant_p);
22017 }
22019 {
22024 }
22025 else
22026 {
22027 /* Anything else is an error. */
22030 }
22036 }
22038 /* Parse an initializer-clause.
22040 initializer-clause:
22041 assignment-expression
22042 braced-init-list
22044 Returns an expression representing the initializer.
22046 If the `assignment-expression' production is used the value
22047 returned is simply a representation for the expression.
22049 Otherwise, calls cp_parser_braced_list. */
22051 static cp_expr
22053 {
22054 cp_expr initializer;
22056 /* Assume the expression is constant. */
22059 /* If it is not a `{', then we are looking at an
22060 assignment-expression. */
22062 {
22063 initializer
22066 non_constant_p);
22067 }
22068 else
22072 }
22074 /* Parse a brace-enclosed initializer list.
22076 braced-init-list:
22077 { initializer-list , [opt] }
22078 { designated-initializer-list , [opt] }
22079 { }
22081 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22082 the elements of the initializer-list (or NULL, if the last
22083 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22084 NULL_TREE. There is no way to detect whether or not the optional
22085 trailing `,' was provided. NON_CONSTANT_P is as for
22086 cp_parser_initializer. */
22088 static cp_expr
22090 {
22091 tree initializer;
22094 /* Consume the `{' token. */
22095 matching_braces braces;
22097 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22099 /* If it's not a `}', then there is a non-trivial initializer. */
22101 {
22102 /* Parse the initializer list. */
22105 /* A trailing `,' token is allowed. */
22108 }
22109 else
22111 /* Now, there should be a trailing `}'. */
22117 /* Build a location of the form:
22118 { ... }
22119 ^~~~~~~
22120 with caret==start at the open brace, finish at the close brace. */
22124 }
22126 /* Consume tokens up to, and including, the next non-nested closing `]'.
22127 Returns true iff we found a closing `]'. */
22129 static bool
22131 {
22135 {
22139 {
22142 /* If we've run out of tokens, then there is no closing `]'. */
22151 {
22154 }
22159 }
22161 /* Consume the token. */
22163 }
22164 }
22166 /* Return true if we are looking at an array-designator, false otherwise. */
22168 static bool
22170 {
22171 /* Consume the `['. */
22176 /* Skip tokens until the next token is a closing square bracket.
22177 If we find the closing `]', and the next token is a `=', then
22178 we are looking at an array designator. */
22179 bool array_designator_p
22183 /* Roll back the tokens we skipped. */
22187 }
22189 /* Parse an initializer-list.
22191 initializer-list:
22192 initializer-clause ... [opt]
22193 initializer-list , initializer-clause ... [opt]
22195 C++2A Extension:
22197 designated-initializer-list:
22198 designated-initializer-clause
22199 designated-initializer-list , designated-initializer-clause
22201 designated-initializer-clause:
22202 designator brace-or-equal-initializer
22204 designator:
22205 . identifier
22207 GNU Extension:
22209 initializer-list:
22210 designation initializer-clause ...[opt]
22211 initializer-list , designation initializer-clause ...[opt]
22213 designation:
22214 . identifier =
22215 identifier :
22216 [ constant-expression ] =
22218 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22219 for the initializer. If the INDEX of the elt is non-NULL, it is the
22220 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22221 as for cp_parser_initializer. */
22225 {
22230 /* Assume all of the expressions are constant. */
22233 /* Parse the rest of the list. */
22235 {
22237 tree designator;
22238 tree initializer;
22242 /* Handle the C++2A syntax, '. id ='. */
22250 {
22253 "C++ designated initializers only available with "
22255 /* Consume the `.'. */
22257 /* Consume the identifier. */
22260 /* Consume the `='. */
22262 }
22263 /* Also, if the next token is an identifier and the following one is a
22264 colon, we are looking at the GNU designated-initializer
22265 syntax. */
22270 {
22271 /* Warn the user that they are using an extension. */
22274 /* Consume the identifier. */
22276 /* Consume the `:'. */
22278 }
22279 /* Also handle C99 array designators, '[ const ] ='. */
22283 {
22284 /* In C++11, [ could start a lambda-introducer. */
22290 {
22293 }
22294 else
22295 {
22300 }
22305 && (!require_potential_rvalue_constant_expression
22309 /* Warn the user that they are using an extension. */
22312 }
22313 else
22317 {
22320 }
22324 {
22328 }
22332 /* Parse the initializer. */
22335 /* If any clause is non-constant, so is the entire initializer. */
22339 /* If we have an ellipsis, this is an initializer pack
22340 expansion. */
22342 {
22345 /* Consume the `...'. */
22352 /* Turn the initializer into an initializer expansion. */
22354 }
22356 /* Add it to the vector. */
22359 /* If the next token is not a comma, we have reached the end of
22360 the list. */
22364 /* Peek at the next token. */
22366 /* If the next token is a `}', then we're still done. An
22367 initializer-clause can have a trailing `,' after the
22368 initializer-list and before the closing `}'. */
22372 /* Consume the `,' token. */
22374 }
22376 /* The same identifier shall not appear in multiple designators
22377 of a designated-initializer-list. */
22379 {
22384 {
22386 {
22388 "%<.%s%> designator used multiple times in "
22392 }
22393 else
22395 }
22399 }
22402 }
22404 /* Classes [gram.class] */
22406 /* Parse a class-name.
22408 class-name:
22409 identifier
22410 template-id
22412 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22413 to indicate that names looked up in dependent types should be
22414 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22415 keyword has been used to indicate that the name that appears next
22416 is a template. TAG_TYPE indicates the explicit tag given before
22417 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22418 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22419 is the class being defined in a class-head. If ENUM_OK is TRUE,
22420 enum-names are also accepted.
22422 Returns the TYPE_DECL representing the class. */
22424 static tree
22433 {
22434 tree decl;
22435 tree scope;
22440 /* All class-names start with an identifier. */
22443 {
22446 }
22448 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22449 to a template-id, so we save it here. */
22454 /* Any name names a type if we're following the `typename' keyword
22455 in a qualified name where the enclosing scope is type-dependent. */
22458 /* Handle the common case (an identifier, but not a template-id)
22459 efficiently. */
22462 {
22466 /* Look for the identifier. */
22470 /* If the next token isn't an identifier, we are certainly not
22471 looking at a class-name. */
22474 /* If we know this is a type-name, there's no need to look it
22475 up. */
22478 else
22479 {
22480 tree ambiguous_decls;
22481 /* If we already know that this lookup is ambiguous, then
22482 we've already issued an error message; there's no reason
22483 to check again. */
22485 {
22488 }
22489 /* If the next token is a `::', then the name must be a type
22490 name.
22492 [basic.lookup.qual]
22494 During the lookup for a name preceding the :: scope
22495 resolution operator, object, function, and enumerator
22496 names are ignored. */
22499 /* Look up the name. */
22501 tag_type,
22504 check_dependency_p,
22508 {
22512 }
22513 }
22514 }
22515 else
22516 {
22517 /* Try a template-id. */
22519 check_dependency_p,
22520 tag_type,
22521 is_declaration);
22524 }
22528 /* If this is a typename, create a TYPENAME_TYPE. */
22530 {
22535 }
22539 /* Check to see that it is really the name of a class. */
22543 /* Situations like this:
22545 template <typename T> struct A {
22546 typename T::template X<int>::I i;
22547 };
22549 are problematic. Is `T::template X<int>' a class-name? The
22550 standard does not seem to be definitive, but there is no other
22551 valid interpretation of the following `::'. Therefore, those
22552 names are considered class-names. */
22553 {
22557 }
22562 /* In Objective-C 2.0, a classname followed by '.' starts a
22563 dot-syntax expression, and it's not a type-name. */
22575 }
22577 /* Parse a class-specifier.
22579 class-specifier:
22580 class-head { member-specification [opt] }
22582 Returns the TREE_TYPE representing the class. */
22584 static tree
22586 {
22587 tree type;
22601 /* Parse the class-head. */
22604 /* If the class-head was a semantic disaster, skip the entire body
22605 of the class. */
22607 {
22611 }
22613 /* Look for the `{'. */
22614 matching_braces braces;
22616 {
22619 }
22624 /* Issue an error message if type-definitions are forbidden here. */
22626 /* Remember that we are defining one more class. */
22628 /* Inside the class, surrounding template-parameter-lists do not
22629 apply. */
22630 saved_num_template_parameter_lists
22633 /* We are not in a function body. */
22636 /* Or in a loop. */
22639 /* Or in a switch. */
22642 /* We are not immediately inside an extern "lang" block. */
22643 saved_in_unbraced_linkage_specification_p
22647 // Associate constraints with the type.
22651 /* Start the class. */
22653 {
22656 }
22660 /* If the type is erroneous, skip the entire body of the class. */
22662 else
22663 /* Parse the member-specification. */
22666 /* Look for the trailing `}'. */
22668 /* Look for trailing attributes to apply to this class. */
22676 /* We've finished a type definition. Check for the common syntax
22677 error of forgetting a semicolon after the definition. We need to
22678 be careful, as we can't just check for not-a-semicolon and be done
22679 with it; the user might have typed:
22681 class X { } c = ...;
22682 class X { } *p = ...;
22684 and so forth. Instead, enumerate all the possible tokens that
22685 might follow this production; if we don't see one of them, then
22686 complain and silently insert the semicolon. */
22687 {
22692 /* Don't try to parse c++11 attributes here. As per the
22693 grammar, that should be a task for
22694 cp_parser_decl_specifier_seq. */
22698 {
22709 /* While it's legal for type qualifiers and storage class
22710 specifiers to follow type definitions in the grammar, only
22711 compiler testsuites contain code like that. Assume that if
22712 we see such code, then what we're really seeing is a case
22713 like:
22715 class X { }
22716 const <type> var = ...;
22718 or
22720 class Y { }
22721 static <type> func (...) ...
22723 i.e. the qualifier or specifier applies to the next
22724 declaration. To do so, however, we need to look ahead one
22725 more token to see if *that* token is a type specifier.
22727 This code could be improved to handle:
22729 class Z { }
22730 static const <type> var = ...; */
22733 {
22736 /* Handling user-defined types here would be nice, but very
22737 tricky. */
22738 want_semicolon
22741 }
22745 }
22747 /* If we don't have a type, then something is very wrong and we
22748 shouldn't try to do anything clever. Likewise for not seeing the
22749 closing brace. */
22751 {
22752 /* Locate the closing brace. */
22753 cp_token_position prev
22758 /* We want to suggest insertion of a ';' immediately *after* the
22759 closing brace, so, if we can, offset the location by 1 column. */
22766 /* If we successfully offset the location, suggest the fix-it. */
22779 else
22782 /* Unget one token and smash it to look as though we encountered
22783 a semicolon in the input stream. */
22788 }
22789 }
22791 /* If this class is not itself within the scope of another class,
22792 then we need to parse the bodies of all of the queued function
22793 definitions. Note that the queued functions defined in a class
22794 are not always processed immediately following the
22795 class-specifier for that class. Consider:
22797 struct A {
22798 struct B { void f() { sizeof (A); } };
22799 };
22801 If `f' were processed before the processing of `A' were
22802 completed, there would be no way to compute the size of `A'.
22803 Note that the nesting we are interested in here is lexical --
22804 not the semantic nesting given by TYPE_CONTEXT. In particular,
22805 for:
22807 struct A { struct B; };
22808 struct A::B { void f() { } };
22810 there is no need to delay the parsing of `A::B::f'. */
22812 {
22813 tree decl;
22821 {
22822 /* Skip default arguments, NSDMIs, etc, in order to improve
22823 error recovery (c++/71169, c++/71832). */
22828 }
22830 /* In a first pass, parse default arguments to the functions.
22831 Then, in a second pass, parse the bodies of the functions.
22832 This two-phased approach handles cases like:
22834 struct S {
22835 void f() { g(); }
22836 void g(int i = 3);
22837 };
22839 */
22841 {
22843 /* If there are default arguments that have not yet been processed,
22844 take care of them now. */
22846 {
22851 }
22852 /* Make sure that any template parameters are in scope. */
22854 /* Parse the default argument expressions. */
22856 /* Remove any template parameters from the symbol table. */
22858 }
22860 /* Now parse any NSDMIs. */
22864 {
22866 {
22871 }
22874 }
22881 /* Now do some post-NSDMI bookkeeping. */
22887 /* Now parse the body of the functions. */
22889 {
22890 /* OpenMP UDRs need to be parsed before all other functions. */
22897 }
22898 else
22902 }
22903 else
22906 /* Put back any saved access checks. */
22909 /* Restore saved state. */
22913 parser->num_template_parameter_lists
22915 parser->in_unbraced_linkage_specification_p
22919 }
22921 static tree
22923 {
22924 tree ret;
22929 }
22931 /* Parse a class-head.
22933 class-head:
22934 class-key identifier [opt] base-clause [opt]
22935 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22936 class-key nested-name-specifier [opt] template-id
22937 base-clause [opt]
22939 class-virt-specifier:
22940 final
22942 GNU Extensions:
22943 class-key attributes identifier [opt] base-clause [opt]
22944 class-key attributes nested-name-specifier identifier base-clause [opt]
22945 class-key attributes nested-name-specifier [opt] template-id
22946 base-clause [opt]
22948 Upon return BASES is initialized to the list of base classes (or
22949 NULL, if there are none) in the same form returned by
22950 cp_parser_base_clause.
22952 Returns the TYPE of the indicated class. Sets
22953 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22954 involving a nested-name-specifier was used, and FALSE otherwise.
22956 Returns error_mark_node if this is not a class-head.
22958 Returns NULL_TREE if the class-head is syntactically valid, but
22959 semantically invalid in a way that means we should skip the entire
22960 body of the class. */
22962 static tree
22965 {
22966 tree nested_name_specifier;
22970 tree attributes;
22971 tree bases;
22981 /* Assume no nested-name-specifier will be present. */
22983 /* Assume no template parameter lists will be used in defining the
22984 type. */
22988 /* Look for the class-key. */
22995 /* Parse the attributes. */
22998 /* If the next token is `::', that is invalid -- but sometimes
22999 people do try to write:
23001 struct ::S {};
23003 Handle this gracefully by accepting the extra qualifier, and then
23004 issuing an error about it later if this really is a
23005 class-head. If it turns out just to be an elaborated type
23006 specifier, remain silent. */
23012 /* Determine the name of the class. Begin by looking for an
23013 optional nested-name-specifier. */
23015 nested_name_specifier
23021 /* If there was a nested-name-specifier, then there *must* be an
23022 identifier. */
23027 {
23029 /* Although the grammar says `identifier', it really means
23030 `class-name' or `template-name'. You are only allowed to
23031 define a class that has already been declared with this
23032 syntax.
23034 The proposed resolution for Core Issue 180 says that wherever
23035 you see `class T::X' you should treat `X' as a type-name.
23037 It is OK to define an inaccessible class; for example:
23039 class A { class B; };
23040 class A::B {};
23042 We do not know if we will see a class-name, or a
23043 template-name. We look for a class-name first, in case the
23044 class-name is a template-id; if we looked for the
23045 template-name first we would stop after the template-name. */
23052 class_type,
23056 /* If that didn't work, ignore the nested-name-specifier. */
23058 {
23064 }
23065 /* If we could not find a corresponding TYPE, treat this
23066 declaration like an unqualified declaration. */
23069 /* Otherwise, count the number of templates used in TYPE and its
23070 containing scopes. */
23071 else
23073 }
23074 /* Otherwise, the identifier is optional. */
23075 else
23076 {
23077 /* We don't know whether what comes next is a template-id,
23078 an identifier, or nothing at all. */
23080 /* Check for a template-id. */
23085 class_key,
23087 /* If that didn't work, it could still be an identifier. */
23089 {
23091 {
23094 }
23095 else
23097 }
23098 else
23099 {
23102 }
23103 }
23108 {
23110 class_key,
23112 }
23115 /* If it's not a `:' or a `{' then we can't really be looking at a
23116 class-head, since a class-head only appears as part of a
23117 class-specifier. We have to detect this situation before calling
23118 xref_tag, since that has irreversible side-effects. */
23120 {
23124 }
23126 /* At this point, we're going ahead with the class-specifier, even
23127 if some other problem occurs. */
23130 {
23135 }
23136 /* Issue the error about the overly-qualified name now. */
23138 {
23143 }
23145 {
23150 }
23152 {
23153 tree scope;
23156 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23157 keyword template shall not appear at the top level. */
23161 /* Reject typedef-names in class heads. */
23163 {
23166 type);
23169 }
23171 /* Figure out in what scope the declaration is being placed. */
23173 /* If that scope does not contain the scope in which the
23174 class was originally declared, the program is invalid. */
23176 {
23179 "declaration of %qD in namespace %qD which does not "
23182 else
23188 }
23189 /* [dcl.meaning]
23191 A declarator-id shall not be qualified except for the
23192 definition of a ... nested class outside of its class
23193 ... [or] the definition or explicit instantiation of a
23194 class member of a namespace outside of its namespace. */
23196 {
23201 }
23202 }
23203 /* An explicit-specialization must be preceded by "template <>". If
23204 it is not, try to recover gracefully. */
23207 && !processing_template_parmlist
23209 {
23210 /* Build a location of this form:
23211 struct typename <ARGS>
23212 ^~~~~~~~~~~~~~~~~~~~~~
23213 with caret==start at the start token, and
23214 finishing at the end of the type. */
23215 location_t reported_loc
23217 class_head_start_location,
23223 "an explicit specialization must be preceded by"
23226 /* Take the same action that would have been taken by
23227 cp_parser_explicit_specialization. */
23230 }
23231 /* There must be no "return" statements between this point and the
23232 end of this function; set "type "to the correct return value and
23233 use "goto done;" to return. */
23234 /* Make sure that the right number of template parameters were
23235 present. */
23237 template_id_p,
23240 {
23241 /* If something went wrong, there is no point in even trying to
23242 process the class-definition. */
23245 }
23247 /* Look up the type. */
23249 {
23253 {
23257 }
23258 else
23259 {
23263 /* Check the scope while we still know whether or not we had a
23264 nested-name-specifier. */
23267 }
23270 }
23272 {
23273 tree class_type;
23275 /* Given:
23277 template <typename T> struct S { struct T };
23278 template <typename T> struct S<T>::T { };
23280 we will get a TYPENAME_TYPE when processing the definition of
23281 `S::T'. We need to resolve it to the actual type before we
23282 try to define it. */
23284 {
23289 else
23290 {
23293 }
23294 }
23298 {
23301 }
23304 /* Enter the scope indicated by the nested-name-specifier. */
23306 /* Get the canonical version of this type. */
23308 /* Call push_template_decl if it seems like we should be defining a
23309 template either from the template headers or the type we're
23310 defining, so that we diagnose both extra and missing headers. */
23314 {
23317 {
23320 }
23321 }
23325 }
23327 {
23328 /* If the class was unnamed, create a dummy name. */
23332 ? ts_within_enclosing_non_class
23336 }
23338 /* Indicate whether this class was declared as a `class' or as a
23339 `struct'. */
23344 /* If this type was already complete, and we see another definition,
23345 that's an error. */
23347 {
23349 type);
23351 type);
23354 }
23359 {
23360 /* Apply attributes now, before any use of the class as a template
23361 argument in its base list. */
23364 }
23366 /* We will have entered the scope containing the class; the names of
23367 base classes should be looked up in that context. For example:
23369 struct A { struct B {}; struct C; };
23370 struct A::C : B {};
23372 is valid. */
23374 /* Get the list of base-classes, if there is one. */
23376 {
23377 /* PR59482: enter the class scope so that base-specifiers are looked
23378 up correctly. */
23382 /* PR59482: get out of the previously pushed class scope so that the
23383 subsequent pops pop the right thing. */
23386 }
23387 else
23390 /* If we're really defining a class, process the base classes.
23391 If they're invalid, fail. */
23395 done:
23396 /* Leave the scope given by the nested-name-specifier. We will
23397 enter the class scope itself while processing the members. */
23402 {
23405 }
23411 out:
23414 }
23416 /* Parse a class-key.
23418 class-key:
23419 class
23420 struct
23421 union
23423 Returns the kind of class-key specified, or none_type to indicate
23424 error. */
23426 static enum tag_types
23428 {
23432 /* Look for the class-key. */
23437 /* Check to see if the TOKEN is a class-key. */
23442 }
23444 /* Parse a type-parameter-key.
23446 type-parameter-key:
23447 class
23448 typename
23449 */
23451 static void
23453 {
23454 /* Look for the type-parameter-key. */
23458 {
23461 /* typename is not allowed in a template template parameter
23462 by the standard until C++17. */
23464 "ISO C++ forbids typename key in template template parameter;"
23466 }
23467 else
23471 }
23473 /* Parse an (optional) member-specification.
23475 member-specification:
23476 member-declaration member-specification [opt]
23477 access-specifier : member-specification [opt] */
23479 static void
23481 {
23483 {
23487 /* Peek at the next token. */
23489 /* If it's a `}', or EOF then we've seen all the members. */
23495 /* See if this token is a keyword. */
23498 {
23502 /* Consume the access-specifier. */
23504 /* Remember which access-specifier is active. */
23506 /* Look for the `:'. */
23511 /* Accept #pragmas at class scope. */
23513 {
23516 }
23518 /* Otherwise, the next construction must be a
23519 member-declaration. */
23521 }
23522 }
23523 }
23525 /* Parse a member-declaration.
23527 member-declaration:
23528 decl-specifier-seq [opt] member-declarator-list [opt] ;
23529 function-definition ; [opt]
23530 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23531 using-declaration
23532 template-declaration
23533 alias-declaration
23535 member-declarator-list:
23536 member-declarator
23537 member-declarator-list , member-declarator
23539 member-declarator:
23540 declarator pure-specifier [opt]
23541 declarator constant-initializer [opt]
23542 identifier [opt] : constant-expression
23544 GNU Extensions:
23546 member-declaration:
23547 __extension__ member-declaration
23549 member-declarator:
23550 declarator attributes [opt] pure-specifier [opt]
23551 declarator attributes [opt] constant-initializer [opt]
23552 identifier [opt] attributes [opt] : constant-expression
23554 C++0x Extensions:
23556 member-declaration:
23557 static_assert-declaration */
23559 static void
23561 {
23562 cp_decl_specifier_seq decl_specifiers;
23563 tree prefix_attributes;
23564 tree decl;
23573 /* Check for the `__extension__' keyword. */
23575 {
23576 /* Recurse. */
23578 /* Restore the old value of the PEDANTIC flag. */
23582 }
23584 /* Check for a template-declaration. */
23586 {
23587 /* An explicit specialization here is an error condition, and we
23588 expect the specialization handler to detect and report this. */
23592 else
23596 }
23597 /* Check for a template introduction. */
23601 /* Check for a using-declaration. */
23603 {
23605 {
23606 /* Parse the using-declaration. */
23610 }
23611 else
23612 {
23613 tree decl;
23617 /* Note that if we actually see the '=' token after the
23618 identifier, cp_parser_alias_declaration commits the
23619 tentative parse. In that case, we really expect an
23620 alias-declaration. Otherwise, we expect a using
23621 declaration. */
23622 alias_decl_expected =
23628 else
23632 }
23633 }
23635 /* Check for @defs. */
23637 {
23642 {
23647 }
23649 }
23651 /* If the next token is `static_assert' we have a static assertion. */
23653 {
23656 }
23663 /* Parse the decl-specifier-seq. */
23666 CP_PARSER_FLAGS_OPTIONAL,
23669 /* Check for an invalid type-name. */
23673 /* If there is no declarator, then the decl-specifier-seq should
23674 specify a type. */
23676 {
23677 /* If there was no decl-specifier-seq, and the next token is a
23678 `;', then we have something like:
23680 struct S { ; };
23682 [class.mem]
23684 Each member-declaration shall declare at least one member
23685 name of the class. */
23687 {
23690 {
23694 }
23695 }
23696 else
23697 {
23698 tree type;
23700 /* See if this declaration is a friend. */
23702 /* If there were decl-specifiers, check to see if there was
23703 a class-declaration. */
23706 /* Nested classes have already been added to the class, but
23707 a `friend' needs to be explicitly registered. */
23709 {
23710 /* If the `friend' keyword was present, the friend must
23711 be introduced with a class-key. */
23714 "in C++03 a class-key must be used "
23716 /* In this case:
23718 template <typename T> struct A {
23719 friend struct A<T>::B;
23720 };
23722 A<T>::B will be represented by a TYPENAME_TYPE, and
23723 therefore not recognized by check_tag_decl. */
23725 {
23729 }
23732 "friend declaration does not name a class or "
23734 else
23737 }
23738 /* If there is no TYPE, an error message will already have
23739 been issued. */
23741 ;
23742 /* An anonymous aggregate has to be handled specially; such
23743 a declaration really declares a data member (with a
23744 particular type), as opposed to a nested class. */
23746 {
23747 /* C++11 9.5/6. */
23750 "a storage class on an anonymous aggregate "
23753 /* Remove constructors and such from TYPE, now that we
23754 know it is an anonymous aggregate. */
23756 /* And make the corresponding data member. */
23759 /* Add it to the class. */
23761 }
23762 else
23763 cp_parser_check_access_in_redeclaration
23766 }
23767 }
23768 else
23769 {
23772 /* Clear attributes from the decl_specifiers but keep them
23773 around as prefix attributes that apply them to the entity
23774 being declared. */
23778 /* See if these declarations will be friends. */
23781 /* Keep going until we hit the `;' at the end of the
23782 declaration. */
23784 {
23786 tree first_attribute;
23787 tree initializer;
23790 /* Peek at the next token. */
23793 /* The following code wants to know early if it is a bit-field
23794 or some other declaration. Attributes can appear before
23795 the `:' token. Skip over them without consuming any tokens
23796 to peek if they are followed by `:'. */
23801 {
23802 size_t n
23805 }
23807 /* Check for a bitfield declaration. */
23813 {
23814 tree identifier;
23815 tree width;
23820 else
23823 /* Look for attributes that apply to the bitfield. */
23826 /* Consume the `:' token. */
23829 /* Get the width of the bitfield. */
23833 /* In C++2A and as extension for C++11 and above we allow
23834 default member initializers for bit-fields. */
23839 CPP_OPEN_BRACE)))
23840 {
23841 location_t loc
23847 "default member initializers for bit-fields "
23848 "only available with -std=c++2a or "
23853 {
23857 }
23858 }
23859 else
23860 {
23861 /* Look for attributes that apply to the bitfield after
23862 the `:' token and width. This is where GCC used to
23863 parse attributes in the past, pedwarn if there is
23864 a std attribute. */
23867 "ISO C++ allows bit-field attributes only "
23871 }
23875 /* Remember which attributes are prefix attributes and
23876 which are not. */
23878 /* Combine the attributes. */
23881 /* Create the bitfield declaration. */
23884 identifier,
23885 sfk_none)
23889 attributes);
23890 }
23891 else
23892 {
23894 tree asm_specification;
23897 /* Parse the declarator. */
23898 declarator
23903 friend_p);
23905 /* If something went wrong parsing the declarator, make sure
23906 that we at least consume some tokens. */
23908 {
23909 /* Skip to the end of the statement. */
23911 /* If the next token is not a semicolon, that is
23912 probably because we just skipped over the body of
23913 a function. So, we consume a semicolon if
23914 present, but do not issue an error message if it
23915 is not present. */
23917 CPP_SEMICOLON))
23920 }
23923 cp_parser_check_for_definition_in_return_type
23927 /* Look for an asm-specification. */
23929 /* Look for attributes that apply to the declaration. */
23931 /* Remember which attributes are prefix attributes and
23932 which are not. */
23934 /* Combine the attributes. */
23937 /* If it's an `=', then we have a constant-initializer or a
23938 pure-specifier. It is not correct to parse the
23939 initializer before registering the member declaration
23940 since the member declaration should be in scope while
23941 its initializer is processed. However, the rest of the
23942 front end does not yet provide an interface that allows
23943 us to handle this correctly. */
23945 {
23946 /* In [class.mem]:
23948 A pure-specifier shall be used only in the declaration of
23949 a virtual function.
23951 A member-declarator can contain a constant-initializer
23952 only if it declares a static member of integral or
23953 enumeration type.
23955 Therefore, if the DECLARATOR is for a function, we look
23956 for a pure-specifier; otherwise, we look for a
23957 constant-initializer. When we call `grokfield', it will
23958 perform more stringent semantics checks. */
23970 {
23972 /* Don't require a constant rvalue in C++11, since we
23973 might want a reference constant. We'll enforce
23974 constancy later. */
23976 /* Parse the initializer. */
23979 }
23980 else
23981 /* Parse the initializer. */
23983 }
23986 {
23990 else
23992 }
23993 /* Otherwise, there is no initializer. */
23994 else
23997 /* See if we are probably looking at a function
23998 definition. We are certainly not looking at a
23999 member-declarator. Calling `grokfield' has
24000 side-effects, so we must not do it unless we are sure
24001 that we are looking at a member-declarator. */
24004 {
24005 /* The grammar does not allow a pure-specifier to be
24006 used when a member function is defined. (It is
24007 possible that this fact is an oversight in the
24008 standard, since a pure function may be defined
24009 outside of the class-specifier. */
24015 declarator,
24016 attributes);
24019 /* If the member was not a friend, declare it here. */
24022 /* Peek at the next token. */
24024 /* If the next token is a semicolon, consume it. */
24026 {
24027 location_t semicolon_loc
24032 "extra %<;%> after in-class "
24034 }
24036 }
24037 else
24040 /* Create the declaration. */
24045 {
24048 else
24050 }
24051 }
24056 /* Reset PREFIX_ATTRIBUTES. */
24058 {
24063 }
24065 /* If there is any qualification still in effect, clear it
24066 now; we will be starting fresh with the next declarator. */
24070 /* If it's a `,', then there are more declarators. */
24072 {
24075 {
24081 }
24082 }
24083 /* If the next token isn't a `;', then we have a parse error. */
24085 CPP_SEMICOLON))
24086 {
24087 /* The next token might be a ways away from where the
24088 actual semicolon is missing. Find the previous token
24089 and use that for our error position. */
24096 /* Assume that the user meant to provide a semicolon. If
24097 we were to cp_parser_skip_to_end_of_statement, we might
24098 skip to a semicolon inside a member function definition
24099 and issue nonsensical error messages. */
24101 }
24104 {
24105 /* Add DECL to the list of members. */
24107 /* Explicitly include, eg, NSDMIs, for better error
24108 recovery (c++/58650). */
24116 /* Add DECL to the queue of NSDMI to be parsed later. */
24118 }
24122 }
24123 }
24126 out:
24128 }
24130 /* Parse a pure-specifier.
24132 pure-specifier:
24133 = 0
24135 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24136 Otherwise, ERROR_MARK_NODE is returned. */
24138 static tree
24140 {
24143 /* Look for the `=' token. */
24146 /* Look for the `0' token. */
24155 /* Accept = default or = delete in c++0x mode. */
24158 {
24161 }
24163 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24165 {
24170 }
24172 {
24175 }
24178 }
24180 /* Parse a constant-initializer.
24182 constant-initializer:
24183 = constant-expression
24185 Returns a representation of the constant-expression. */
24187 static tree
24189 {
24190 /* Look for the `=' token. */
24194 /* It is invalid to write:
24196 struct S { static const int i = { 7 }; };
24198 */
24200 {
24203 /* Consume the opening brace. */
24204 matching_braces braces;
24206 /* Skip the initializer. */
24208 /* Look for the trailing `}'. */
24212 }
24215 }
24217 /* Derived classes [gram.class.derived] */
24219 /* Parse a base-clause.
24221 base-clause:
24222 : base-specifier-list
24224 base-specifier-list:
24225 base-specifier ... [opt]
24226 base-specifier-list , base-specifier ... [opt]
24228 Returns a TREE_LIST representing the base-classes, in the order in
24229 which they were declared. The representation of each node is as
24230 described by cp_parser_base_specifier.
24232 In the case that no bases are specified, this function will return
24233 NULL_TREE, not ERROR_MARK_NODE. */
24235 static tree
24237 {
24240 /* Look for the `:' that begins the list. */
24243 /* Scan the base-specifier-list. */
24245 {
24247 tree base;
24250 /* Look for the base-specifier. */
24252 /* Look for the (optional) ellipsis. */
24254 {
24255 /* Consume the `...'. */
24259 }
24261 /* Add BASE to the front of the list. */
24263 {
24265 /* Make this a pack expansion type. */
24269 {
24272 }
24273 }
24274 /* Peek at the next token. */
24276 /* If it's not a comma, then the list is complete. */
24279 /* Consume the `,'. */
24281 }
24283 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24284 base class had a qualified name. However, the next name that
24285 appears is certainly not qualified. */
24291 }
24293 /* Parse a base-specifier.
24295 base-specifier:
24296 :: [opt] nested-name-specifier [opt] class-name
24297 virtual access-specifier [opt] :: [opt] nested-name-specifier
24298 [opt] class-name
24299 access-specifier virtual [opt] :: [opt] nested-name-specifier
24300 [opt] class-name
24302 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24303 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24304 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24305 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24307 static tree
24309 {
24317 tree type;
24319 /* Process the optional `virtual' and `access-specifier'. */
24321 {
24322 /* Peek at the next token. */
24324 /* Process `virtual'. */
24326 {
24328 /* If `virtual' appears more than once, issue an error. */
24330 {
24334 }
24338 /* Consume the `virtual' token. */
24346 /* If more than one access specifier appears, issue an
24347 error. */
24350 {
24354 }
24358 /* Consume the access-specifier. */
24366 }
24367 }
24368 /* It is not uncommon to see programs mechanically, erroneously, use
24369 the 'typename' keyword to denote (dependent) qualified types
24370 as base classes. */
24372 {
24377 else
24379 "keyword %<typename%> not allowed in this context "
24382 }
24384 /* Look for the optional `::' operator. */
24386 /* Look for the nested-name-specifier. The simplest way to
24387 implement:
24389 [temp.res]
24391 The keyword `typename' is not permitted in a base-specifier or
24392 mem-initializer; in these contexts a qualified name that
24393 depends on a template-parameter is implicitly assumed to be a
24394 type name.
24396 is to pretend that we have seen the `typename' keyword at this
24397 point. */
24403 /* If the base class is given by a qualified name, assume that names
24404 we see are type names or templates, as appropriate. */
24410 /* DR 950 allows decltype as a base-specifier. */
24412 else
24413 {
24414 /* Otherwise, look for the class-name. */
24416 class_scope_p,
24417 template_p,
24418 typename_type,
24423 }
24429 }
24431 /* Exception handling [gram.exception] */
24433 /* Parse an (optional) noexcept-specification.
24435 noexcept-specification:
24436 noexcept ( constant-expression ) [opt]
24438 If no noexcept-specification is present, returns NULL_TREE.
24439 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24440 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24441 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24442 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24443 in which case a boolean condition is returned instead. */
24445 static tree
24450 {
24454 /* Peek at the next token. */
24457 /* Is it a noexcept-specification? */
24459 {
24460 tree expr;
24464 {
24465 matching_parens parens;
24469 {
24470 /* Types may not be defined in an exception-specification. */
24472 parser->type_definition_forbidden_message
24477 /* Restore the saved message. */
24479 }
24480 else
24481 {
24484 }
24487 }
24488 else
24489 {
24493 }
24495 /* We cannot build a noexcept-spec right away because this will check
24496 that expr is a constexpr. */
24499 else
24501 }
24502 else
24504 }
24506 /* Parse an (optional) exception-specification.
24508 exception-specification:
24509 throw ( type-id-list [opt] )
24511 Returns a TREE_LIST representing the exception-specification. The
24512 TREE_VALUE of each node is a type. */
24514 static tree
24516 {
24518 tree type_id_list;
24521 /* Peek at the next token. */
24524 /* Is it a noexcept-specification? */
24530 /* If it's not `throw', then there's no exception-specification. */
24536 /* Consume the `throw'. */
24539 /* Look for the `('. */
24540 matching_parens parens;
24543 /* Peek at the next token. */
24545 /* If it's not a `)', then there is a type-id-list. */
24547 {
24548 /* Types may not be defined in an exception-specification. */
24550 parser->type_definition_forbidden_message
24552 /* Parse the type-id-list. */
24554 /* Restore the saved message. */
24558 {
24562 }
24565 "dynamic exception specifications are deprecated in "
24567 }
24568 /* In C++17, throw() is equivalent to noexcept (true). throw()
24569 is deprecated in C++11 and above as well, but is still widely used,
24570 so don't warn about it yet. */
24573 else
24576 /* Look for the `)'. */
24580 }
24582 /* Parse an (optional) type-id-list.
24584 type-id-list:
24585 type-id ... [opt]
24586 type-id-list , type-id ... [opt]
24588 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24589 in the order that the types were presented. */
24591 static tree
24593 {
24597 {
24599 tree type;
24603 /* Get the next type-id. */
24605 /* Check for invalid 'auto'. */
24607 {
24611 }
24612 /* Parse the optional ellipsis. */
24614 {
24615 /* Consume the `...'. */
24618 /* Turn the type into a pack expansion expression. */
24620 }
24621 /* Add it to the list. */
24623 /* Peek at the next token. */
24625 /* If it is not a `,', we are done. */
24628 /* Consume the `,'. */
24630 }
24633 }
24635 /* Parse a try-block.
24637 try-block:
24638 try compound-statement handler-seq */
24640 static tree
24642 {
24643 tree try_block;
24657 }
24659 /* Parse a function-try-block.
24661 function-try-block:
24662 try ctor-initializer [opt] function-body handler-seq */
24664 static void
24666 {
24667 tree compound_stmt;
24668 tree try_block;
24670 /* Look for the `try' keyword. */
24673 /* Let the rest of the front end know where we are. */
24675 /* Parse the function-body. */
24676 cp_parser_ctor_initializer_opt_and_function_body
24678 /* We're done with the `try' part. */
24680 /* Parse the handlers. */
24682 /* We're done with the handlers. */
24684 }
24686 /* Parse a handler-seq.
24688 handler-seq:
24689 handler handler-seq [opt] */
24691 static void
24693 {
24695 {
24698 /* Parse the handler. */
24700 /* Peek at the next token. */
24702 /* If it's not `catch' then there are no more handlers. */
24705 }
24706 }
24708 /* Parse a handler.
24710 handler:
24711 catch ( exception-declaration ) compound-statement */
24713 static void
24715 {
24716 tree handler;
24717 tree declaration;
24721 matching_parens parens;
24728 }
24730 /* Parse an exception-declaration.
24732 exception-declaration:
24733 type-specifier-seq declarator
24734 type-specifier-seq abstract-declarator
24735 type-specifier-seq
24736 ...
24738 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24739 ellipsis variant is used. */
24741 static tree
24743 {
24744 cp_decl_specifier_seq type_specifiers;
24748 /* If it's an ellipsis, it's easy to handle. */
24750 {
24751 /* Consume the `...' token. */
24754 }
24756 /* Types may not be defined in exception-declarations. */
24758 parser->type_definition_forbidden_message
24761 /* Parse the type-specifier-seq. */
24765 /* If it's a `)', then there is no declarator. */
24768 else
24775 /* Restore the saved message. */
24782 }
24784 /* Parse a throw-expression.
24786 throw-expression:
24787 throw assignment-expression [opt]
24789 Returns a THROW_EXPR representing the throw-expression. */
24791 static tree
24793 {
24794 tree expression;
24799 /* Figure out whether or not there is an assignment-expression
24800 following the "throw" keyword. */
24808 else
24812 }
24814 /* GNU Extensions */
24816 /* Parse an (optional) asm-specification.
24818 asm-specification:
24819 asm ( string-literal )
24821 If the asm-specification is present, returns a STRING_CST
24822 corresponding to the string-literal. Otherwise, returns
24823 NULL_TREE. */
24825 static tree
24827 {
24829 tree asm_specification;
24831 /* Peek at the next token. */
24833 /* If the next token isn't the `asm' keyword, then there's no
24834 asm-specification. */
24838 /* Consume the `asm' token. */
24840 /* Look for the `('. */
24841 matching_parens parens;
24844 /* Look for the string-literal. */
24847 /* Look for the `)'. */
24851 }
24853 /* Parse an asm-operand-list.
24855 asm-operand-list:
24856 asm-operand
24857 asm-operand-list , asm-operand
24859 asm-operand:
24860 string-literal ( expression )
24861 [ string-literal ] string-literal ( expression )
24863 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24864 each node is the expression. The TREE_PURPOSE is itself a
24865 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24866 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24867 is a STRING_CST for the string literal before the parenthesis. Returns
24868 ERROR_MARK_NODE if any of the operands are invalid. */
24870 static tree
24872 {
24877 {
24878 tree string_literal;
24879 tree expression;
24880 tree name;
24883 {
24884 /* Consume the `[' token. */
24886 /* Read the operand name. */
24891 /* Look for the closing `]'. */
24893 }
24894 else
24896 /* Look for the string-literal. */
24899 /* Look for the `('. */
24900 matching_parens parens;
24902 /* Parse the expression. */
24904 /* Look for the `)'. */
24912 /* Add this operand to the list. */
24914 expression,
24915 asm_operands);
24916 /* If the next token is not a `,', there are no more
24917 operands. */
24920 /* Consume the `,'. */
24922 }
24925 }
24927 /* Parse an asm-clobber-list.
24929 asm-clobber-list:
24930 string-literal
24931 asm-clobber-list , string-literal
24933 Returns a TREE_LIST, indicating the clobbers in the order that they
24934 appeared. The TREE_VALUE of each node is a STRING_CST. */
24936 static tree
24938 {
24942 {
24943 tree string_literal;
24945 /* Look for the string literal. */
24947 /* Add it to the list. */
24949 /* If the next token is not a `,', then the list is
24950 complete. */
24953 /* Consume the `,' token. */
24955 }
24958 }
24960 /* Parse an asm-label-list.
24962 asm-label-list:
24963 identifier
24964 asm-label-list , identifier
24966 Returns a TREE_LIST, indicating the labels in the order that they
24967 appeared. The TREE_VALUE of each node is a label. */
24969 static tree
24971 {
24975 {
24978 /* Look for the identifier. */
24981 {
24984 {
24990 }
24991 }
24992 /* If the next token is not a `,', then the list is
24993 complete. */
24996 /* Consume the `,' token. */
24998 }
25001 }
25003 /* Return TRUE iff the next tokens in the stream are possibly the
25004 beginning of a GNU extension attribute. */
25006 static bool
25008 {
25010 }
25012 /* Return TRUE iff the next tokens in the stream are possibly the
25013 beginning of a standard C++-11 attribute specifier. */
25015 static bool
25017 {
25019 }
25021 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25022 beginning of a standard C++-11 attribute specifier. */
25024 static bool
25026 {
25034 }
25036 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25037 beginning of a GNU extension attribute. */
25039 static bool
25041 {
25045 }
25047 /* Return true iff the next tokens can be the beginning of either a
25048 GNU attribute list, or a standard C++11 attribute sequence. */
25050 static bool
25052 {
25055 }
25057 /* Return true iff the next Nth tokens can be the beginning of either
25058 a GNU attribute list, or a standard C++11 attribute sequence. */
25060 static bool
25062 {
25065 }
25067 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
25068 of GNU attributes, or return NULL. */
25070 static tree
25072 {
25076 }
25078 /* Parse an (optional) series of attributes.
25080 attributes:
25081 attributes attribute
25083 attribute:
25084 __attribute__ (( attribute-list [opt] ))
25086 The return value is as for cp_parser_gnu_attribute_list. */
25088 static tree
25090 {
25097 {
25099 tree attribute_list;
25102 /* Peek at the next token. */
25104 /* If it's not `__attribute__', then we're done. */
25108 /* Consume the `__attribute__' keyword. */
25110 /* Look for the two `(' tokens. */
25111 matching_parens outer_parens;
25113 matching_parens inner_parens;
25116 /* Peek at the next token. */
25119 /* Parse the attribute-list. */
25121 else
25122 /* If the next token is a `)', then there is no attribute
25123 list. */
25126 /* Look for the two `)' tokens. */
25134 /* Add these new attributes to the list. */
25136 }
25139 }
25141 /* Parse a GNU attribute-list.
25143 attribute-list:
25144 attribute
25145 attribute-list , attribute
25147 attribute:
25148 identifier
25149 identifier ( identifier )
25150 identifier ( identifier , expression-list )
25151 identifier ( expression-list )
25153 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25154 to an attribute. The TREE_PURPOSE of each node is the identifier
25155 indicating which attribute is in use. The TREE_VALUE represents
25156 the arguments, if any. */
25158 static tree
25160 {
25166 {
25168 tree identifier;
25169 tree attribute;
25171 /* Look for the identifier. We also allow keywords here; for
25172 example `__attribute__ ((const))' is legal. */
25176 {
25179 /* Consume the token, but save it since we need it for the
25180 SIMD enabled function parsing. */
25183 /* Save away the identifier that indicates which attribute
25184 this is. */
25186 /* For keywords, use the canonical spelling, not the
25187 parsed identifier. */
25194 /* Peek at the next token. */
25196 /* If it's an `(', then parse the attribute arguments. */
25198 {
25202 vec = cp_parser_parenthesized_expression_list
25208 else
25209 {
25212 }
25213 /* Save the arguments away. */
25215 }
25218 {
25219 /* Add this attribute to the list. */
25222 }
25225 }
25226 /* Now, look for more attributes. If the next token isn't a
25227 `,', we're done. */
25231 /* Consume the comma and keep going. */
25233 }
25236 /* We built up the list in reverse order. */
25238 }
25240 /* Parse a standard C++11 attribute.
25242 The returned representation is a TREE_LIST which TREE_PURPOSE is
25243 the scoped name of the attribute, and the TREE_VALUE is its
25244 arguments list.
25246 Note that the scoped name of the attribute is itself a TREE_LIST
25247 which TREE_PURPOSE is the namespace of the attribute, and
25248 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25249 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25250 and which TREE_PURPOSE is directly the attribute name.
25252 Clients of the attribute code should use get_attribute_namespace
25253 and get_attribute_name to get the actual namespace and name of
25254 attributes, regardless of their being GNU or C++11 attributes.
25256 attribute:
25257 attribute-token attribute-argument-clause [opt]
25259 attribute-token:
25260 identifier
25261 attribute-scoped-token
25263 attribute-scoped-token:
25264 attribute-namespace :: identifier
25266 attribute-namespace:
25267 identifier
25269 attribute-argument-clause:
25270 ( balanced-token-seq )
25272 balanced-token-seq:
25273 balanced-token [opt]
25274 balanced-token-seq balanced-token
25276 balanced-token:
25277 ( balanced-token-seq )
25278 [ balanced-token-seq ]
25279 { balanced-token-seq }. */
25281 static tree
25283 {
25290 /* First, parse name of the attribute, a.k.a attribute-token. */
25307 {
25308 /* We are seeing a scoped attribute token. */
25323 else
25324 {
25328 }
25332 NULL_TREE);
25334 }
25337 NULL_TREE);
25338 else
25339 {
25342 NULL_TREE);
25343 /* C++11 noreturn attribute is equivalent to GNU's. */
25346 /* C++14 deprecated attribute is equivalent to GNU's. */
25349 /* C++17 fallthrough attribute is equivalent to GNU's. */
25352 /* Transactional Memory TS optimize_for_synchronized attribute is
25353 equivalent to GNU transaction_callable. */
25357 /* Transactional Memory attributes are GNU attributes. */
25360 }
25362 /* Now parse the optional argument clause of the attribute. */
25367 {
25373 /* A GNU attribute that takes an identifier in parameter. */
25376 vec = cp_parser_parenthesized_expression_list
25382 else
25383 {
25386 }
25390 else
25392 }
25395 }
25397 /* Check that the attribute ATTRIBUTE appears at most once in the
25398 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25399 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25400 isn't implemented yet in GCC. */
25402 static void
25404 {
25406 {
25416 }
25417 }
25419 /* Parse a list of standard C++-11 attributes.
25421 attribute-list:
25422 attribute [opt]
25423 attribute-list , attribute[opt]
25424 attribute ...
25425 attribute-list , attribute ...
25426 */
25428 static tree
25430 {
25435 {
25440 {
25444 }
25447 {
25452 else
25453 {
25458 }
25460 }
25464 }
25467 }
25469 /* Parse a standard C++-11 attribute specifier.
25471 attribute-specifier:
25472 [ [ attribute-using-prefix [opt] attribute-list ] ]
25473 alignment-specifier
25475 attribute-using-prefix:
25476 using attribute-namespace :
25478 alignment-specifier:
25479 alignas ( type-id ... [opt] )
25480 alignas ( alignment-expression ... [opt] ). */
25482 static tree
25484 {
25490 {
25497 {
25508 {
25512 "attribute using prefix only available "
25518 }
25519 else
25521 }
25528 else
25529 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25530 when we are sure that we have actually parsed them. */
25532 }
25533 else
25534 {
25535 tree alignas_expr;
25537 /* Look for an alignment-specifier. */
25548 matching_parens parens;
25556 {
25563 }
25568 /* Handle alignas (pack...). */
25570 {
25573 }
25575 /* Something went wrong, so don't build the attribute. */
25582 /* Build the C++-11 representation of an 'aligned'
25583 attribute. */
25584 attributes =
25587 alignas_expr);
25588 }
25591 }
25593 /* Parse a standard C++-11 attribute-specifier-seq.
25595 attribute-specifier-seq:
25596 attribute-specifier-seq [opt] attribute-specifier
25597 */
25599 static tree
25601 {
25606 {
25615 else
25618 }
25621 }
25623 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25624 return index of the first token after balanced-token, or N on failure. */
25626 static size_t
25628 {
25631 do
25633 {
25636 /* Ran out of tokens. */
25658 }
25661 }
25663 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25664 return index of the first token after the GNU attribute tokens, or N on
25665 failure. */
25667 static size_t
25669 {
25671 {
25683 }
25685 }
25687 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25688 next token), return index of the first token after the standard C++11
25689 attribute tokens, or N on failure. */
25691 static size_t
25693 {
25695 {
25698 {
25705 }
25708 {
25713 }
25714 else
25716 }
25718 }
25720 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25721 as the next token), return index of the first token after the attribute
25722 tokens, or N on failure. */
25724 static size_t
25726 {
25730 }
25732 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25733 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25734 current value of the PEDANTIC flag, regardless of whether or not
25735 the `__extension__' keyword is present. The caller is responsible
25736 for restoring the value of the PEDANTIC flag. */
25738 static bool
25740 {
25741 /* Save the old value of the PEDANTIC flag. */
25745 {
25746 /* Consume the `__extension__' token. */
25748 /* We're not being pedantic while the `__extension__' keyword is
25749 in effect. */
25753 }
25756 }
25758 /* Parse a label declaration.
25760 label-declaration:
25761 __label__ label-declarator-seq ;
25763 label-declarator-seq:
25764 identifier , label-declarator-seq
25765 identifier */
25767 static void
25769 {
25770 /* Look for the `__label__' keyword. */
25774 {
25775 tree identifier;
25777 /* Look for an identifier. */
25779 /* If we failed, stop. */
25782 /* Declare it as a label. */
25784 /* If the next token is a `;', stop. */
25787 /* Look for the `,' separating the label declarations. */
25789 }
25791 /* Look for the final `;'. */
25793 }
25795 // -------------------------------------------------------------------------- //
25796 // Requires Clause
25798 // Parse a requires clause.
25799 //
25800 // requires-clause:
25801 // 'requires' logical-or-expression
25802 //
25803 // The required logical-or-expression must be a constant expression. Note
25804 // that we don't check that the expression is constepxr here. We defer until
25805 // we analyze constraints and then, we only check atomic constraints.
25806 static tree
25808 {
25809 // Parse the requires clause so that it is not automatically folded.
25817 }
25819 // Optionally parse a requires clause:
25820 static tree
25822 {
25825 {
25828 {
25831 /* Parse and discard the requires-clause. */
25834 }
25836 }
25839 }
25842 /*---------------------------------------------------------------------------
25843 Requires expressions
25844 ---------------------------------------------------------------------------*/
25846 /* Parse a requires expression
25848 requirement-expression:
25849 'requires' requirement-parameter-list [opt] requirement-body */
25850 static tree
25852 {
25856 /* A requires-expression shall appear only within a concept
25857 definition or a requires-clause.
25859 TODO: Implement this diagnostic correctly. */
25861 {
25865 }
25868 {
25869 /* Local parameters are delared as variables within the scope
25870 of the expression. They are not visible past the end of
25871 the expression. Expressions within the requires-expression
25872 are unevaluated. */
25873 struct scope_sentinel
25874 {
25876 {
25879 }
25882 {
25885 }
25888 /* Parse the optional parameter list. */
25890 {
25894 }
25895 else
25898 /* Parse the requirement body. */
25902 }
25904 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25905 the parm chain. */
25908 }
25910 /* Parse a parameterized requirement.
25912 requirement-parameter-list:
25913 '(' parameter-declaration-clause ')' */
25914 static tree
25916 {
25917 matching_parens parens;
25927 }
25929 /* Parse the body of a requirement.
25931 requirement-body:
25932 '{' requirement-list '}' */
25933 static tree
25935 {
25936 matching_braces braces;
25946 }
25948 /* Parse a list of requirements.
25950 requirement-list:
25951 requirement
25952 requirement-list ';' requirement[opt] */
25953 static tree
25955 {
25958 {
25965 /* If we see a semi-colon, consume it. */
25969 /* Stop processing at the end of the list. */
25972 }
25974 /* Reverse the order of requirements so they are analyzed in
25975 declaration order. */
25977 }
25979 /* Parse a syntactic requirement or type requirement.
25981 requirement:
25982 simple-requirement
25983 compound-requirement
25984 type-requirement
25985 nested-requirement */
25986 static tree
25988 {
25995 else
25997 }
25999 /* Parse a simple requirement.
26001 simple-requirement:
26002 expression ';' */
26003 static tree
26005 {
26014 }
26016 /* Parse a type requirement
26018 type-requirement
26019 nested-name-specifier [opt] required-type-name ';'
26021 required-type-name:
26022 type-name
26023 'template' [opt] simple-template-id */
26024 static tree
26026 {
26029 // Save the scope before parsing name specifiers.
26040 tree type;
26042 {
26051 }
26052 else
26071 }
26073 /* Parse a compound requirement
26075 compound-requirement:
26076 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
26077 static tree
26079 {
26080 /* Parse an expression enclosed in '{ }'s. */
26081 matching_braces braces;
26092 /* Parse the optional noexcept. */
26095 {
26098 }
26100 /* Parse the optional trailing return type. */
26103 {
26111 }
26114 }
26116 /* Parse a nested requirement. This is the same as a requires clause.
26118 nested-requirement:
26119 requires-clause */
26120 static tree
26122 {
26128 }
26130 /* Support Functions */
26132 /* Return the appropriate prefer_type argument for lookup_name_real based on
26133 tag_type and template_mem_access. */
26137 {
26138 /* DR 141: When looking in the current enclosing context for a template-name
26139 after -> or ., only consider class templates. */
26143 {
26147 }
26148 }
26150 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26151 NAME should have one of the representations used for an
26152 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26153 is returned. If PARSER->SCOPE is a dependent type, then a
26154 SCOPE_REF is returned.
26156 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26157 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26158 was formed. Abstractly, such entities should not be passed to this
26159 function, because they do not need to be looked up, but it is
26160 simpler to check for this special case here, rather than at the
26161 call-sites.
26163 In cases not explicitly covered above, this function returns a
26164 DECL, OVERLOAD, or baselink representing the result of the lookup.
26165 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26166 is returned.
26168 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26169 (e.g., "struct") that was used. In that case bindings that do not
26170 refer to types are ignored.
26172 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26173 ignored.
26175 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26176 are ignored.
26178 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26179 types.
26181 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26182 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26183 NULL_TREE otherwise. */
26185 static cp_expr
26192 location_t name_location)
26193 {
26194 tree decl;
26197 /* Assume that the lookup will be unambiguous. */
26201 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26202 no longer valid. Note that if we are parsing tentatively, and
26203 the parse fails, OBJECT_TYPE will be automatically restored. */
26209 /* A template-id has already been resolved; there is no lookup to
26210 do. */
26214 {
26218 }
26220 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26221 it should already have been checked to make sure that the name
26222 used matches the type being destroyed. */
26224 {
26225 tree type;
26227 /* Figure out to which type this destructor applies. */
26232 else
26234 /* If that's not a class type, there is no destructor. */
26245 }
26247 /* By this point, the NAME should be an ordinary identifier. If
26248 the id-expression was a qualified name, the qualifying scope is
26249 stored in PARSER->SCOPE at this point. */
26252 /* Perform the lookup. */
26254 {
26260 /* If the SCOPE is dependent, the lookup must be deferred until
26261 the template is instantiated -- unless we are explicitly
26262 looking up names in uninstantiated templates. Even then, we
26263 cannot look up the name if the scope is not a class type; it
26264 might, for example, be a template type parameter. */
26269 /* Defer lookup. */
26271 else
26272 {
26275 /* If PARSER->SCOPE is a dependent type, then it must be a
26276 class type, and we must not be checking dependencies;
26277 otherwise, we would have processed this lookup above. So
26278 that PARSER->SCOPE is not considered a dependent base by
26279 lookup_member, we must enter the scope here. */
26283 /* If the PARSER->SCOPE is a template specialization, it
26284 may be instantiated during name lookup. In that case,
26285 errors may be issued. Even if we rollback the current
26286 tentative parse, those errors are valid. */
26291 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26292 lookup result and the nested-name-specifier nominates a class C:
26293 * if the name specified after the nested-name-specifier, when
26294 looked up in C, is the injected-class-name of C (Clause 9), or
26295 * if the name specified after the nested-name-specifier is the
26296 same as the identifier or the simple-template-id's template-
26297 name in the last component of the nested-name-specifier,
26298 the name is instead considered to name the constructor of
26299 class C. [ Note: for example, the constructor is not an
26300 acceptable lookup result in an elaborated-type-specifier so
26301 the constructor would not be used in place of the
26302 injected-class-name. --end note ] Such a constructor name
26303 shall be used only in the declarator-id of a declaration that
26304 names a constructor or in a using-declaration. */
26312 /* If we have a single function from a using decl, pull it out. */
26319 }
26321 /* If the scope is a dependent type and either we deferred lookup or
26322 we did lookup but didn't find the name, rememeber the name. */
26325 {
26327 {
26328 tree type;
26330 /* The resolution to Core Issue 180 says that `struct
26331 A::B' should be considered a type-name, even if `A'
26332 is dependent. */
26337 }
26341 CPP_CLOSE_PAREN)))
26345 else
26348 is_template);
26349 }
26352 }
26354 {
26355 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26356 OBJECT_TYPE is not a class. */
26358 /* If the OBJECT_TYPE is a template specialization, it may
26359 be instantiated during name lookup. In that case, errors
26360 may be issued. Even if we rollback the current tentative
26361 parse, those errors are valid. */
26363 name,
26366 tf_warning_or_error);
26367 else
26371 /* Look it up in the enclosing context. DR 141: When looking for a
26372 template-name after -> or ., only consider class templates. */
26377 /* The object is type-dependent, so we can't look anything up; we used
26378 this to get the DR 141 behavior. */
26382 }
26383 else
26384 {
26390 }
26392 /* If the lookup failed, let our caller know. */
26396 /* Pull out the template from an injected-class-name (or multiple). */
26400 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26402 {
26405 /* The error message we have to print is too complicated for
26406 cp_parser_error, so we incorporate its actions directly. */
26408 {
26410 name);
26412 }
26414 }
26422 /* If we have resolved the name of a member declaration, check to
26423 see if the declaration is accessible. When the name resolves to
26424 set of overloaded functions, accessibility is checked when
26425 overload resolution is done.
26427 During an explicit instantiation, access is not checked at all,
26428 as per [temp.explicit]. */
26435 }
26437 /* Like cp_parser_lookup_name, but for use in the typical case where
26438 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26439 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26441 static tree
26443 {
26445 none_type,
26450 location);
26451 }
26453 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26454 the current context, return the TYPE_DECL. If TAG_NAME_P is
26455 true, the DECL indicates the class being defined in a class-head,
26456 or declared in an elaborated-type-specifier.
26458 Otherwise, return DECL. */
26460 static tree
26462 {
26463 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26464 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26466 struct A {
26467 template <typename T> struct B;
26468 };
26470 template <typename T> struct A::B {};
26472 Similarly, in an elaborated-type-specifier:
26474 namespace N { struct X{}; }
26476 struct A {
26477 template <typename T> friend struct N::X;
26478 };
26480 However, if the DECL refers to a class type, and we are in
26481 the scope of the class, then the name lookup automatically
26482 finds the TYPE_DECL created by build_self_reference rather
26483 than a TEMPLATE_DECL. For example, in:
26485 template <class T> struct S {
26486 S s;
26487 };
26489 there is no need to handle such case. */
26495 }
26497 /* If too many, or too few, template-parameter lists apply to the
26498 declarator, issue an error message. Returns TRUE if all went well,
26499 and FALSE otherwise. */
26501 static bool
26504 location_t declarator_location)
26505 {
26507 {
26509 {
26518 {
26519 /* If the DECLARATOR has the form `X<y>' then it uses one
26520 additional level of template parameters. */
26523 }
26525 return cp_parser_check_template_parameters
26527 declarator);
26528 }
26544 }
26546 }
26548 /* NUM_TEMPLATES were used in the current declaration. If that is
26549 invalid, return FALSE and issue an error messages. Otherwise,
26550 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26551 declarator and we can print more accurate diagnostics. */
26553 static bool
26557 location_t location,
26559 {
26560 /* If there are the same number of template classes and parameter
26561 lists, that's OK. */
26564 /* If there are more, but only one more, and the name ends in an identifier,
26565 then we are declaring a primary template. That's OK too. */
26569 /* If there are more template classes than parameter lists, we have
26570 something like:
26572 template <class T> void S<T>::R<T>::f (); */
26574 {
26584 else
26587 }
26588 /* Otherwise, there are too many template parameter lists. We have
26589 something like:
26591 template <class T> template <class U> void S::f(); */
26594 }
26596 /* Parse an optional `::' token indicating that the following name is
26597 from the global namespace. If so, PARSER->SCOPE is set to the
26598 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26599 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26600 Returns the new value of PARSER->SCOPE, if the `::' token is
26601 present, and NULL_TREE otherwise. */
26603 static tree
26605 {
26608 /* Peek at the next token. */
26610 /* If we're looking at a `::' token then we're starting from the
26611 global namespace, not our current location. */
26613 {
26614 /* Consume the `::' token. */
26616 /* Set the SCOPE so that we know where to start the lookup. */
26622 }
26624 {
26628 }
26631 }
26633 /* Returns TRUE if the upcoming token sequence is the start of a
26634 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26635 declarator is preceded by the `friend' specifier. */
26637 static bool
26639 {
26642 tree nested_name_specifier;
26645 /* The common case is that this is not a constructor declarator, so
26646 try to avoid doing lots of work if at all possible. It's not
26647 valid declare a constructor at function scope. */
26650 /* And only certain tokens can begin a constructor declarator. */
26658 /* Parse tentatively; we are going to roll back all of the tokens
26659 consumed here. */
26661 /* Assume that we are looking at a constructor declarator. */
26664 /* Look for the optional `::' operator. */
26667 /* Look for the nested-name-specifier. */
26668 nested_name_specifier
26679 /* Outside of a class-specifier, there must be a
26680 nested-name-specifier. Except in C++17 mode, where we
26681 might be declaring a guiding declaration. */
26688 /* If we have a class scope, this is easy; DR 147 says that S::S always
26689 names the constructor, and no other qualified name could. */
26692 {
26702 }
26703 /* If we still think that this might be a constructor-declarator,
26704 look for a class-name. */
26706 {
26707 /* If we have:
26709 template <typename T> struct S {
26710 S();
26711 };
26713 we must recognize that the nested `S' names a class. */
26717 tree type_decl;
26721 none_type,
26728 {
26734 none_type,
26739 else
26741 }
26743 /* If there was no class-name, then this is not a constructor.
26744 Otherwise, if we are in a class-specifier and we aren't
26745 handling a friend declaration, check that its type matches
26746 current_class_type (c++/38313). Note: error_mark_node
26747 is left alone for error recovery purposes. */
26749 && (outside_class_specifier_p
26755 /* If we're still considering a constructor, we have to see a `(',
26756 to begin the parameter-declaration-clause, followed by either a
26757 `)', an `...', or a decl-specifier. We need to check for a
26758 type-specifier to avoid being fooled into thinking that:
26760 S (f) (int);
26762 is a constructor. (It is actually a function named `f' that
26763 takes one parameter (of type `int') and returns a value of type
26764 `S'. */
26772 /* A parameter declaration begins with a decl-specifier,
26773 which is either the "attribute" keyword, a storage class
26774 specifier, or (usually) a type-specifier. */
26776 {
26777 tree type;
26781 /* Names appearing in the type-specifier should be looked up
26782 in the scope of the class. */
26786 {
26789 {
26793 {
26796 }
26797 }
26799 }
26801 /* Inside the constructor parameter list, surrounding
26802 template-parameter-lists do not apply. */
26803 saved_num_template_parameter_lists
26807 /* Look for the type-specifier. */
26809 CP_PARSER_FLAGS_NONE,
26815 parser->num_template_parameter_lists
26818 /* Leave the scope of the class. */
26823 }
26824 }
26826 /* We did not really want to consume any tokens. */
26830 }
26832 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26833 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26834 they must be performed once we are in the scope of the function.
26836 Returns the function defined. */
26838 static tree
26839 cp_parser_function_definition_from_specifiers_and_declarator
26842 tree attributes,
26844 {
26845 tree fn;
26848 /* Begin the function-definition. */
26851 /* The things we're about to see are not directly qualified by any
26852 template headers we've seen thus far. */
26855 /* If there were names looked up in the decl-specifier-seq that we
26856 did not check, check them now. We must wait until we are in the
26857 scope of the function to perform the checks, since the function
26858 might be a friend. */
26862 {
26867 }
26870 {
26871 /* Skip the entire function. */
26874 }
26876 {
26877 /* Seen already, skip it. An error message has already been output. */
26881 /* If this is a function from a class, pop the nested class. */
26884 }
26885 else
26886 {
26887 timevar_id_t tv;
26890 else
26896 }
26899 }
26901 /* Parse the part of a function-definition that follows the
26902 declarator. INLINE_P is TRUE iff this function is an inline
26903 function defined within a class-specifier.
26905 Returns the function defined. */
26907 static tree
26910 {
26911 tree fn;
26916 bool fully_implicit_function_template_p
26919 tree implicit_template_parms
26922 cp_binding_level* implicit_template_scope
26928 /* If the next token is `return', then the code may be trying to
26929 make use of the "named return value" extension that G++ used to
26930 support. */
26933 {
26934 /* Consume the `return' keyword. */
26936 /* Look for the identifier that indicates what value is to be
26937 returned. */
26939 /* Issue an error message. */
26942 /* Skip tokens until we reach the start of the function body. */
26944 {
26951 }
26952 }
26953 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26954 anything declared inside `f'. */
26955 saved_in_unbraced_linkage_specification_p
26958 /* Inside the function, surrounding template-parameter-lists do not
26959 apply. */
26960 saved_num_template_parameter_lists
26964 /* If the next token is `try', `__transaction_atomic', or
26965 `__transaction_relaxed`, then we are looking at either function-try-block
26966 or function-transaction-block. Note that all of these include the
26967 function-body. */
26971 RID_TRANSACTION_RELAXED))
26975 else
26976 cp_parser_ctor_initializer_opt_and_function_body
26979 /* Finish the function. */
26981 /* Generate code for it, if necessary. */
26983 /* Restore the saved values. */
26984 parser->in_unbraced_linkage_specification_p
26986 parser->num_template_parameter_lists
26990 parser->fully_implicit_function_template_p
26992 parser->implicit_template_parms
26994 parser->implicit_template_scope
27001 }
27003 /* Parse a template-declaration body (following argument list). */
27005 static void
27007 tree parameter_list,
27009 {
27013 /* We just processed one more parameter list. */
27016 /* Get the deferred access checks from the parameter list. These
27017 will be checked once we know what is being declared, as for a
27018 member template the checks must be performed in the scope of the
27019 class containing the member. */
27022 /* Tentatively parse for a new template parameter list, which can either be
27023 the template keyword or a template introduction. */
27029 else
27030 {
27031 /* There are no access checks when parsing a template, as we do not
27032 know if a specialization will be a friend. */
27036 checks,
27037 member_p,
27042 /* If this is a member template declaration, let the front
27043 end know. */
27045 {
27050 }
27055 }
27056 /* We are done with the current parameter list. */
27061 /* Finish up. */
27064 /* Check the template arguments for a literal operator template. */
27068 {
27072 else
27073 {
27076 {
27082 }
27084 {
27093 }
27094 else
27096 }
27098 {
27101 " Expected non-type template argument pack <char...>"
27103 decl);
27104 else
27107 decl);
27108 }
27109 }
27111 /* Register member declarations. */
27114 /* If DECL is a function template, we must return to parse it later.
27115 (Even though there is no definition, there might be default
27116 arguments that need handling.) */
27120 }
27122 /* Parse a template introduction header for a template-declaration. Returns
27123 false if tentative parse fails. */
27125 static bool
27127 {
27134 /* Look for the optional `::' operator. */
27137 /* Look for the nested-name-specifier. */
27147 /* Look up the concept for which we will be matching
27148 template parameters. */
27158 /* Look for opening brace for introduction. */
27159 matching_braces braces;
27167 /* Build vector of placeholder parameters and grab
27168 matching identifiers. */
27171 /* The introduction-list shall not be empty. */
27174 {
27177 }
27179 /* Look for closing brace for introduction. */
27184 {
27188 }
27190 /* Build and associate the constraint. */
27193 {
27195 member_p);
27197 }
27201 }
27203 /* Parse a normal template-declaration following the template keyword. */
27205 static void
27207 {
27208 tree parameter_list;
27212 /* Look for the `<' token. */
27216 {
27217 /* 14.5.2.2 [temp.mem]
27219 A local class shall not have member templates. */
27224 }
27225 /* [temp]
27227 A template ... shall not have C linkage. */
27229 {
27232 /* Give it C++ linkage to avoid confusing other parts of the
27233 front end. */
27236 }
27237 else
27240 /* We cannot perform access checks on the template parameter
27241 declarations until we know what is being declared, just as we
27242 cannot check the decl-specifier list. */
27245 /* If the next token is `>', then we have an invalid
27246 specialization. Rather than complain about an invalid template
27247 parameter, issue an error message here. */
27249 {
27253 }
27254 else
27255 {
27256 /* Parse the template parameters. */
27258 }
27260 /* Look for the `>'. */
27263 /* Manage template requirements */
27265 {
27270 }
27273 member_p);
27275 /* For the erroneous case of a template with C linkage, we pushed an
27276 implicit C++ linkage scope; exit that scope now. */
27279 }
27281 /* Parse a template-declaration, assuming that the `export' (and
27282 `extern') keywords, if present, has already been scanned. MEMBER_P
27283 is as for cp_parser_template_declaration. */
27285 static bool
27287 {
27289 {
27293 }
27298 }
27300 /* Perform the deferred access checks from a template-parameter-list.
27301 CHECKS is a TREE_LIST of access checks, as returned by
27302 get_deferred_access_checks. */
27304 static void
27305 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27306 {
27310 }
27312 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27313 `function-definition' sequence that follows a template header.
27314 If MEMBER_P is true, this declaration appears in a class scope.
27316 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27317 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27319 static tree
27325 {
27328 cp_decl_specifier_seq decl_specifiers;
27332 /* This function is only used when processing a template
27333 declaration. */
27337 /* Defer access checks until we know what is being declared. */
27340 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27341 alternative. */
27344 CP_PARSER_FLAGS_OPTIONAL,
27350 /* There are no template typedefs. */
27352 {
27356 }
27358 /* Gather up the access checks that occurred the
27359 decl-specifier-seq. */
27362 /* Check for the declaration of a template class. */
27364 {
27367 {
27368 // If this is a declaration, but not a definition, associate
27369 // any constraints with the type declaration. Constraints
27370 // are associated with definitions in cp_parser_class_specifier.
27376 /* In this case:
27378 struct C {
27379 friend template <typename T> struct A<T>::B;
27380 };
27382 A<T>::B will be represented by a TYPENAME_TYPE, and
27383 therefore not recognized by shadow_tag. */
27385 && !decl
27392 else
27395 /* Perform access checks for template parameters. */
27398 /* Give a helpful diagnostic for
27399 template <class T> struct A { } a;
27400 if we aren't already recovering from an error. */
27403 {
27405 "a class template declaration must not declare "
27409 }
27410 }
27411 }
27413 /* Complain about missing 'typename' or other invalid type names. */
27416 {
27417 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27418 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27419 the rest of this declaration. */
27422 }
27424 /* If it's not a template class, try for a template function. If
27425 the next token is a `;', then this declaration does not declare
27426 anything. But, if there were errors in the decl-specifiers, then
27427 the error might well have come from an attempted class-specifier.
27428 In that case, there's no need to warn about a missing declarator. */
27432 {
27435 checks,
27437 member_p,
27438 declares_class_or_enum,
27442 /* 7.1.1-1 [dcl.stc]
27444 A storage-class-specifier shall not be specified in an explicit
27445 specialization... */
27447 && explicit_specialization_p
27449 {
27453 }
27457 }
27459 /* Look for a trailing `;' after the declaration. */
27465 out:
27468 /* Clear any current qualification; whatever comes next is the start
27469 of something new. */
27475 }
27477 /* Parse a cast-expression that is not the operand of a unary "&". */
27479 static cp_expr
27481 {
27484 }
27486 /* Parse a functional cast to TYPE. Returns an expression
27487 representing the cast. */
27489 static cp_expr
27491 {
27493 tree expression_list;
27494 cp_expr cast;
27503 {
27513 /* Create a location of the form:
27514 type_name{i, f}
27515 ^~~~~~~~~~~~~~~
27516 with caret == start at the start of the type name,
27517 finishing at the closing brace. */
27518 location_t finish_loc
27521 finish_loc);
27524 }
27533 else
27534 {
27537 }
27540 tf_warning_or_error);
27541 /* [expr.const]/1: In an integral constant expression "only type
27542 conversions to integral or enumeration type can be used". */
27548 NIC_CONSTRUCTOR))
27551 /* Create a location of the form:
27552 float(i)
27553 ^~~~~~~~
27554 with caret == start at the start of the type name,
27555 finishing at the closing paren. */
27556 location_t finish_loc
27561 }
27563 /* Save the tokens that make up the body of a member function defined
27564 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27565 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27566 specifiers applied to the declaration. Returns the FUNCTION_DECL
27567 for the member function. */
27569 static tree
27573 tree attributes)
27574 {
27577 tree fn;
27580 /* Create the FUNCTION_DECL. */
27584 /* If something went badly wrong, bail out now. */
27586 {
27587 /* If there's a function-body, skip it. */
27592 }
27594 /* Remember it, if there default args to post process. */
27597 /* Save away the tokens that make up the body of the
27598 function. */
27604 RID_TRANSACTION_ATOMIC))
27605 {
27607 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27614 {
27620 }
27621 else
27624 {
27628 }
27629 }
27631 /* Handle function try blocks. */
27633 {
27636 }
27637 /* We can have braced-init-list mem-initializers before the fn body. */
27639 {
27642 {
27643 /* cache_group will stop after an un-nested { } pair, too. */
27647 /* variadic mem-inits have ... after the ')'. */
27650 }
27651 }
27653 /* Handle function try blocks. */
27659 /* Save away the inline definition; we will process it when the
27660 class is complete. */
27664 /* We need to know that this was defined in the class, so that
27665 friend templates are handled correctly. */
27668 /* Add FN to the queue of functions to be parsed later. */
27672 }
27674 /* Save the tokens that make up the in-class initializer for a non-static
27675 data member. Returns a DEFAULT_ARG. */
27677 static tree
27679 {
27681 }
27683 /* Parse a template-argument-list, as well as the trailing ">" (but
27684 not the opening "<"). See cp_parser_template_argument_list for the
27685 return value. */
27687 static tree
27689 {
27690 tree arguments;
27691 tree saved_scope;
27692 tree saved_qualifying_scope;
27693 tree saved_object_scope;
27698 /* [temp.names]
27700 When parsing a template-id, the first non-nested `>' is taken as
27701 the end of the template-argument-list rather than a greater-than
27702 operator. */
27703 saved_greater_than_is_operator_p
27706 /* Parsing the argument list may modify SCOPE, so we save it
27707 here. */
27711 /* We need to evaluate the template arguments, even though this
27712 template-id may be nested within a "sizeof". */
27717 /* Parse the template-argument-list itself. */
27721 else
27723 /* Look for the `>' that ends the template-argument-list. If we find
27724 a '>>' instead, it's probably just a typo. */
27726 {
27728 {
27729 /* In C++0x, a `>>' in a template argument list or cast
27730 expression is considered to be two separate `>'
27731 tokens. So, change the current token to a `>', but don't
27732 consume it: it will be consumed later when the outer
27733 template argument list (or cast expression) is parsed.
27734 Note that this replacement of `>' for `>>' is necessary
27735 even if we are parsing tentatively: in the tentative
27736 case, after calling
27737 cp_parser_enclosed_template_argument_list we will always
27738 throw away all of the template arguments and the first
27739 closing `>', either because the template argument list
27740 was erroneous or because we are replacing those tokens
27741 with a CPP_TEMPLATE_ID token. The second `>' (which will
27742 not have been thrown away) is needed either to close an
27743 outer template argument list or to complete a new-style
27744 cast. */
27747 }
27749 {
27750 /* If we're in a nested template argument list, the '>>' has
27751 to be a typo for '> >'. We emit the error message, but we
27752 continue parsing and we push a '>' as next token, so that
27753 the argument list will be parsed correctly. Note that the
27754 global source location is still on the token before the
27755 '>>', so we need to say explicitly where we want it. */
27763 }
27764 else
27765 {
27766 /* If this is not a nested template argument list, the '>>'
27767 is a typo for '>'. Emit an error message and continue.
27768 Same deal about the token location, but here we can get it
27769 right by consuming the '>>' before issuing the diagnostic. */
27772 "spurious %<>>%>, use %<>%> to terminate "
27774 }
27775 }
27776 else
27778 /* The `>' token might be a greater-than operator again now. */
27779 parser->greater_than_is_operator_p
27781 /* Restore the SAVED_SCOPE. */
27789 }
27791 /* MEMBER_FUNCTION is a member function, or a friend. If default
27792 arguments, or the body of the function have not yet been parsed,
27793 parse them now. */
27795 static void
27797 {
27799 /* If this member is a template, get the underlying
27800 FUNCTION_DECL. */
27804 /* There should not be any class definitions in progress at this
27805 point; the bodies of members are only parsed outside of all class
27806 definitions. */
27808 /* While we're parsing the member functions we might encounter more
27809 classes. We want to handle them right away, but we don't want
27810 them getting mixed up with functions that are currently in the
27811 queue. */
27814 /* Make sure that any template parameters are in scope. */
27817 /* If the body of the function has not yet been parsed, parse it
27818 now. */
27820 {
27821 tree function_scope;
27824 /* The function is no longer pending; we are processing it. */
27829 /* If this is a local class, enter the scope of the containing
27830 function. */
27835 /* Push the body of the function onto the lexer stack. */
27838 /* Let the front end know that we going to be defining this
27839 function. */
27843 /* Don't do access checking if it is a templated function. */
27847 /* #pragma omp declare reduction needs special parsing. */
27849 {
27854 }
27855 else
27856 /* Now, parse the body of the function. */
27863 /* Leave the scope of the containing function. */
27867 }
27869 /* Remove any template parameters from the symbol table. */
27872 /* Restore the queue. */
27875 }
27877 /* If DECL contains any default args, remember it on the unparsed
27878 functions queue. */
27880 static void
27882 {
27883 tree probe;
27886 probe;
27889 {
27893 }
27894 }
27896 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27897 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27898 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27899 from the parameter-type-list. */
27901 static tree
27904 {
27906 tree parsed_arg;
27912 /* Push the saved tokens for the default argument onto the parser's
27913 lexer stack. */
27919 /* Parse the default argument. */
27930 {
27931 /* In a non-template class, check conversions now. In a template,
27932 we'll wait and instantiate these as needed. */
27935 tf_warning_or_error);
27938 else
27940 }
27942 /* If the token stream has not been completely used up, then
27943 there was extra junk after the end of the default
27944 argument. */
27946 {
27949 else
27951 }
27953 /* Revert to the main lexer. */
27957 }
27959 /* FIELD is a non-static data member with an initializer which we saved for
27960 later; parse it now. */
27962 static void
27964 {
27965 tree def;
27972 NULL_TREE);
27978 }
27980 /* FN is a FUNCTION_DECL which may contains a parameter with an
27981 unparsed DEFAULT_ARG. Parse the default args now. This function
27982 assumes that the current scope is the scope in which the default
27983 argument should be processed. */
27985 static void
27987 {
27991 /* While we're parsing the default args, we might (due to the
27992 statement expression extension) encounter more classes. We want
27993 to handle them right away, but we don't want them getting mixed
27994 up with default args that are currently in the queue. */
27997 /* Local variable names (and the `this' keyword) may not appear
27998 in a default argument. */
28009 {
28011 tree parsed_arg;
28013 tree copy;
28020 /* This can happen for a friend declaration for a function
28021 already declared with default arguments. */
28024 parsed_arg
28026 default_arg,
28030 /* Update any instantiations we've already created. */
28034 }
28038 /* Make sure no default arg is missing. */
28041 /* Restore the state of local_variables_forbidden_p. */
28044 /* Restore the queue. */
28046 }
28048 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
28050 sizeof ... ( identifier )
28052 where the 'sizeof' token has already been consumed. */
28054 static tree
28056 {
28057 /* Consume the `...'. */
28061 matching_parens parens;
28065 else
28073 /* The name is not qualified. */
28092 }
28094 /* Parse the operand of `sizeof' (or a similar operator). Returns
28095 either a TYPE or an expression, depending on the form of the
28096 input. The KEYWORD indicates which kind of expression we have
28097 encountered. */
28099 static tree
28101 {
28108 /* If it's a `...', then we are computing the length of a parameter
28109 pack. */
28114 /* Types cannot be defined in a `sizeof' expression. Save away the
28115 old message. */
28117 /* And create the new one. */
28123 /* The restrictions on constant-expressions do not apply inside
28124 sizeof expressions. */
28125 saved_integral_constant_expression_p
28127 saved_non_integral_constant_expression_p
28131 /* Do not actually evaluate the expression. */
28134 /* If it's a `(', then we might be looking at the type-id
28135 construction. */
28137 {
28140 /* We can't be sure yet whether we're looking at a type-id or an
28141 expression. */
28144 matching_parens parens;
28147 /* Note: as a GNU Extension, compound literals are considered
28148 postfix-expressions as they are in C99, so they are valid
28149 arguments to sizeof. See comment in cp_parser_cast_expression
28150 for details. */
28153 else
28154 {
28157 /* Look for the type-id. */
28159 /* Look for the closing `)'. */
28162 }
28164 /* If all went well, then we're done. */
28166 {
28167 cp_decl_specifier_seq decl_specs;
28169 /* Build a trivial decl-specifier-seq. */
28173 /* Call grokdeclarator to figure out what type this is. */
28176 TYPENAME,
28179 }
28180 }
28182 /* If the type-id production did not work out, then we must be
28183 looking at the unary-expression production. */
28187 /* Go back to evaluating expressions. */
28191 /* Free the message we created. */
28193 /* And restore the old one. */
28195 parser->integral_constant_expression_p
28197 parser->non_integral_constant_expression_p
28201 }
28203 /* If the current declaration has no declarator, return true. */
28205 static bool
28207 {
28208 /* If the next token is a `;' or a `,' then there is no
28209 declarator. */
28212 }
28214 /* Update the DECL_SPECS to reflect the storage class indicated by
28215 KEYWORD. */
28217 static void
28222 {
28223 cp_storage_class storage_class;
28226 {
28230 }
28232 {
28235 }
28240 {
28243 }
28246 {
28264 }
28268 /* A storage class specifier cannot be applied alongside a typedef
28269 specifier. If there is a typedef specifier present then set
28270 conflicting_specifiers_p which will trigger an error later
28271 on in grokdeclarator. */
28274 }
28276 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28277 is true, the type is a class or enum definition. */
28279 static void
28281 tree type_spec,
28284 {
28287 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28288 (with, for example, in "typedef int wchar_t;") we remember that
28289 this is what happened. In system headers, we ignore these
28290 declarations so that G++ can work with system headers that are not
28291 C++-safe. */
28293 && !type_definition_p
28303 {
28306 ds_redefined_builtin_type_spec,
28307 token);
28309 {
28313 }
28314 }
28317 else
28318 {
28323 }
28324 }
28326 /* True iff TOKEN is the GNU keyword __thread. */
28328 static bool
28330 {
28333 }
28335 /* Set the location for a declarator specifier and check if it is
28336 duplicated.
28338 DECL_SPECS is the sequence of declarator specifiers onto which to
28339 set the location.
28341 DS is the single declarator specifier to set which location is to
28342 be set onto the existing sequence of declarators.
28344 LOCATION is the location for the declarator specifier to
28345 consider. */
28347 static void
28350 {
28359 {
28363 }
28364 else
28365 {
28367 {
28371 else
28372 {
28375 OPT_Wlong_long,
28377 }
28378 }
28380 {
28384 {
28388 }
28389 else
28390 {
28393 }
28394 }
28395 else
28396 {
28412 "__complex"
28413 };
28417 }
28418 }
28419 }
28421 /* Return true iff the declarator specifier DS is present in the
28422 sequence of declarator specifiers DECL_SPECS. */
28424 bool
28426 cp_decl_spec ds)
28427 {
28434 }
28436 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28437 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28439 static bool
28441 {
28443 }
28445 /* Issue an error message indicating that TOKEN_DESC was expected.
28446 If KEYWORD is true, it indicated this function is called by
28447 cp_parser_require_keword and the required token can only be
28448 a indicated keyword.
28450 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28451 within any error as the location of an "opening" token matching
28452 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28453 RT_CLOSE_PAREN). */
28455 static void
28457 required_token token_desc,
28459 location_t matching_location)
28460 {
28466 {
28535 }
28538 {
28540 {
28618 }
28619 }
28623 }
28626 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28627 issue an error message indicating that TOKEN_DESC was expected.
28629 Returns the token consumed, if the token had the appropriate type.
28630 Otherwise, returns NULL.
28632 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28633 within any error as the location of an "opening" token matching
28634 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28635 RT_CLOSE_PAREN). */
28640 required_token token_desc,
28641 location_t matching_location)
28642 {
28645 else
28646 {
28647 /* Output the MESSAGE -- unless we're parsing tentatively. */
28650 matching_location);
28652 }
28653 }
28655 /* An error message is produced if the next token is not '>'.
28656 All further tokens are skipped until the desired token is
28657 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28659 static void
28661 {
28662 /* Current level of '< ... >'. */
28664 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28667 /* Are we ready, yet? If not, issue error message. */
28671 /* Skip tokens until the desired token is found. */
28673 {
28674 /* Peek at the next token. */
28676 {
28684 /* C++0x views the `>>' operator as two `>' tokens, but
28685 C++98 does not. */
28688 {
28689 /* We've hit a `>>' where the first `>' closes the
28690 template argument list, and the second `>' is
28691 spurious. Just consume the `>>' and stop; we've
28692 already produced at least one error. */
28695 }
28696 /* Fall through for C++0x, so we handle the second `>' in
28697 the `>>'. */
28702 {
28703 /* We've reached the token we want, consume it and stop. */
28706 }
28725 /* The '>' was probably forgotten, don't look further. */
28730 }
28732 /* Consume this token. */
28734 }
28735 }
28737 /* If the next token is the indicated keyword, consume it. Otherwise,
28738 issue an error message indicating that TOKEN_DESC was expected.
28740 Returns the token consumed, if the token had the appropriate type.
28741 Otherwise, returns NULL. */
28746 required_token token_desc)
28747 {
28751 {
28753 UNKNOWN_LOCATION);
28755 }
28758 }
28760 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28761 function-definition. */
28763 static bool
28765 {
28768 /* A ctor-initializer begins with a `:'. */
28770 /* A function-try-block begins with `try'. */
28772 /* A function-transaction-block begins with `__transaction_atomic'
28773 or `__transaction_relaxed'. */
28776 /* The named return value extension begins with `return'. */
28778 }
28780 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28781 definition. */
28783 static bool
28785 {
28792 }
28794 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28795 C++0x) ending a template-argument. */
28797 static bool
28799 {
28807 }
28809 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28810 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28812 static bool
28815 {
28821 /* Check for the sequence `<::' in the original code. It would be lexed as
28822 `[:', where `[' is a digraph, and there is no whitespace before
28823 `:'. */
28825 {
28830 }
28832 }
28834 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28835 or none_type otherwise. */
28837 static enum tag_types
28839 {
28841 {
28851 }
28852 }
28854 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28855 or none_type otherwise or if the token is null. */
28857 static enum tag_types
28859 {
28864 {
28872 }
28873 }
28875 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28877 static void
28879 {
28883 {
28887 type))
28890 }
28891 }
28893 /* Issue an error message if DECL is redeclared with different
28894 access than its original declaration [class.access.spec/3].
28895 This applies to nested classes, nested class templates and
28896 enumerations [class.mem/1]. */
28898 static void
28900 {
28911 }
28913 /* Look for the `template' keyword, as a syntactic disambiguator.
28914 Return TRUE iff it is present, in which case it will be
28915 consumed. */
28917 static bool
28919 {
28921 {
28922 /* In C++98 the `template' keyword can only be used within templates;
28923 outside templates the parser can always figure out what is a
28924 template and what is not. In C++11, per the resolution of DR 468,
28925 `template' is allowed in cases where it is not strictly necessary. */
28928 {
28931 "in C++98 %<template%> (as a disambiguator) is only "
28933 /* If this part of the token stream is rescanned, the same
28934 error message would be generated. So, we purge the token
28935 from the stream. */
28938 }
28939 else
28940 {
28941 /* Consume the `template' keyword. */
28944 }
28945 }
28947 }
28949 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28950 set PARSER->SCOPE, and perform other related actions. */
28952 static void
28954 {
28957 /* Get the stored value. */
28959 /* Set the scope from the stored value. */
28963 }
28965 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28966 encounter the end of a block before what we were looking for. */
28968 static bool
28972 {
28974 {
28977 /* Abort a parenthesized expression if we encounter a semicolon. */
28981 /* If we've reached the end of the file, stop. */
28987 /* We've hit the end of an enclosing block, so there's been some
28988 kind of syntax error. */
28991 /* Consume the token. */
28993 /* See if it starts a new group. */
28995 {
28997 /* In theory this should probably check end == '}', but
28998 cp_parser_save_member_function_body needs it to exit
28999 after either '}' or ')' when called with ')'. */
29002 }
29004 {
29008 }
29013 }
29014 }
29016 /* Like above, for caching a default argument or NSDMI. Both of these are
29017 terminated by a non-nested comma, but it can be unclear whether or not a
29018 comma is nested in a template argument list unless we do more parsing.
29019 In order to handle this ambiguity, when we encounter a ',' after a '<'
29020 we try to parse what follows as a parameter-declaration-list (in the
29021 case of a default argument) or a member-declarator (in the case of an
29022 NSDMI). If that succeeds, then we stop caching. */
29024 static tree
29026 {
29031 tree default_argument;
29033 /* Add tokens until we have processed the entire default
29034 argument. We add the range [first_token, token). */
29037 {
29038 /* For list-initialization, this is straightforward. */
29041 }
29043 {
29046 /* Peek at the next token. */
29048 /* What we do depends on what token we have. */
29050 {
29051 /* In valid code, a default argument must be
29052 immediately followed by a `,' `)', or `...'. */
29055 {
29056 /* If we've seen a '<', we might be in a
29057 template-argument-list. Until Core issue 325 is
29058 resolved, we don't know how this situation ought
29059 to be handled, so try to DTRT. We check whether
29060 what comes after the comma is a valid parameter
29061 declaration list. If it is, then the comma ends
29062 the default argument; otherwise the default
29063 argument continues. */
29067 /* Set ITALP so cp_parser_parameter_declaration_list
29068 doesn't decide to commit to this parse. */
29075 {
29076 /* Parse declarators until we reach a non-comma or
29077 somthing that cannot be an initializer.
29078 Just checking whether we're looking at a single
29079 declarator is insufficient. Consider:
29080 int var = tuple<T,U>::x;
29081 The template parameter 'U' looks exactly like a
29082 declarator. */
29083 do
29084 {
29095 }
29097 /* If we met an '=' or ';' then the original comma
29098 was the end of the NSDMI. Otherwise assume
29099 we're still in the NSDMI. */
29102 }
29103 else
29104 {
29111 }
29118 }
29119 /* FALLTHRU */
29122 /* If we run into a non-nested `;', `}', or `]',
29123 then the code is invalid -- but the default
29124 argument is certainly over. */
29129 /* Handle correctly int n = sizeof ... ( p ); */
29132 /* Update DEPTH, if necessary. */
29147 /* This might be the comparison operator, or it might
29148 start a template argument list. */
29155 /* Fall through for C++0x, which treats the `>>'
29156 operator like two `>' tokens in certain
29157 cases. */
29162 {
29163 /* This might be an operator, or it might close a
29164 template argument list. But if a previous '<'
29165 started a template argument list, this will have
29166 closed it, so we can't be in one anymore. */
29170 }
29173 /* If we run out of tokens, issue an error message. */
29181 /* In these cases, we should look for template-ids.
29182 For example, if the default argument is
29183 `X<int, double>()', we need to do name lookup to
29184 figure out whether or not `X' is a template; if
29185 so, the `,' does not end the default argument.
29187 That is not yet done. */
29192 }
29194 /* If we've reached the end, stop. */
29198 /* Add the token to the token block. */
29200 }
29202 /* Create a DEFAULT_ARG to represent the unparsed default
29203 argument. */
29210 }
29212 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29214 location_t
29216 {
29221 }
29223 /* Begin parsing tentatively. We always save tokens while parsing
29224 tentatively so that if the tentative parsing fails we can restore the
29225 tokens. */
29227 static void
29229 {
29230 /* Enter a new parsing context. */
29232 /* Begin saving tokens. */
29234 /* In order to avoid repetitive access control error messages,
29235 access checks are queued up until we are no longer parsing
29236 tentatively. */
29238 }
29240 /* Commit to the currently active tentative parse. */
29242 static void
29244 {
29248 /* Mark all of the levels as committed. */
29251 {
29258 }
29259 }
29261 /* Commit to the topmost currently active tentative parse.
29263 Note that this function shouldn't be called when there are
29264 irreversible side-effects while in a tentative state. For
29265 example, we shouldn't create a permanent entry in the symbol
29266 table, or issue an error message that might not apply if the
29267 tentative parse is aborted. */
29269 static void
29271 {
29276 {
29284 }
29285 }
29287 /* Abort the currently active tentative parse. All consumed tokens
29288 will be rolled back, and no diagnostics will be issued. */
29290 static void
29292 {
29296 /* Now, pretend that we want to see if the construct was
29297 successfully parsed. */
29299 }
29301 /* Stop parsing tentatively. If a parse error has occurred, restore the
29302 token stream. Otherwise, commit to the tokens we have consumed.
29303 Returns true if no error occurred; false otherwise. */
29305 static bool
29307 {
29311 /* Remember whether or not an error occurred, since we are about to
29312 destroy that information. */
29314 /* Remove the topmost context from the stack. */
29317 /* If no parse errors occurred, commit to the tentative parse. */
29319 {
29320 /* Commit to the tokens read tentatively, unless that was
29321 already done. */
29326 }
29327 /* Otherwise, if errors occurred, roll back our state so that things
29328 are just as they were before we began the tentative parse. */
29329 else
29330 {
29333 }
29334 /* Add the context to the front of the free list. */
29339 }
29341 /* Returns true if we are parsing tentatively and are not committed to
29342 this tentative parse. */
29344 static bool
29346 {
29349 }
29351 /* Returns nonzero iff an error has occurred during the most recent
29352 tentative parse. */
29354 static bool
29356 {
29359 }
29361 /* Returns nonzero if GNU extensions are allowed. */
29363 static bool
29365 {
29367 }
29368 \f
29369 /* Objective-C++ Productions */
29372 /* Parse an Objective-C expression, which feeds into a primary-expression
29373 above.
29375 objc-expression:
29376 objc-message-expression
29377 objc-string-literal
29378 objc-encode-expression
29379 objc-protocol-expression
29380 objc-selector-expression
29382 Returns a tree representation of the expression. */
29384 static cp_expr
29386 {
29387 /* Try to figure out what kind of declaration is present. */
29391 {
29401 {
29413 }
29414 /* FALLTHRU */
29420 }
29423 }
29425 /* Parse an Objective-C message expression.
29427 objc-message-expression:
29428 [ objc-message-receiver objc-message-args ]
29430 Returns a representation of an Objective-C message. */
29432 static tree
29434 {
29446 /* Construct a location e.g.
29447 [self func1:5]
29448 ^~~~~~~~~~~~~~
29449 ranging from the '[' to the ']', with the caret at the start. */
29454 }
29456 /* Parse an objc-message-receiver.
29458 objc-message-receiver:
29459 expression
29460 simple-type-specifier
29462 Returns a representation of the type or expression. */
29464 static tree
29466 {
29467 tree rcv;
29469 /* An Objective-C message receiver may be either (1) a type
29470 or (2) an expression. */
29474 /* If that worked out, fine. */
29481 CP_PARSER_FLAGS_NONE);
29488 }
29490 /* Parse the arguments and selectors comprising an Objective-C message.
29492 objc-message-args:
29493 objc-selector
29494 objc-selector-args
29495 objc-selector-args , objc-comma-args
29497 objc-selector-args:
29498 objc-selector [opt] : assignment-expression
29499 objc-selector-args objc-selector [opt] : assignment-expression
29501 objc-comma-args:
29502 assignment-expression
29503 objc-comma-args , assignment-expression
29505 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29506 selector arguments and TREE_VALUE containing a list of comma
29507 arguments. */
29509 static tree
29511 {
29517 {
29523 /* Detect if we have a unary selector. */
29532 sel_args
29537 }
29539 /* Handle non-selector arguments, if any. */
29541 {
29542 tree arg;
29547 addl_args
29552 }
29555 {
29558 }
29561 }
29563 /* Parse an Objective-C encode expression.
29565 objc-encode-expression:
29566 @encode objc-typename
29568 Returns an encoded representation of the type argument. */
29570 static cp_expr
29572 {
29573 tree type;
29578 matching_parens parens;
29585 {
29589 }
29591 /* This happens if we find @encode(T) (where T is a template
29592 typename or something dependent on a template typename) when
29593 parsing a template. In that case, we can't compile it
29594 immediately, but we rather create an AT_ENCODE_EXPR which will
29595 need to be instantiated when the template is used.
29596 */
29598 {
29602 }
29605 /* Build a location of the form:
29606 @encode(int)
29607 ^~~~~~~~~~~~
29608 with caret==start at the @ token, finishing at the close paren. */
29609 location_t combined_loc
29614 }
29616 /* Parse an Objective-C @defs expression. */
29618 static tree
29620 {
29621 tree name;
29624 matching_parens parens;
29630 }
29632 /* Parse an Objective-C protocol expression.
29634 objc-protocol-expression:
29635 @protocol ( identifier )
29637 Returns a representation of the protocol expression. */
29639 static tree
29641 {
29642 tree proto;
29646 matching_parens parens;
29651 /* Build a location of the form:
29652 @protocol(prot)
29653 ^~~~~~~~~~~~~~~
29654 with caret==start at the @ token, finishing at the close paren. */
29655 location_t combined_loc
29661 }
29663 /* Parse an Objective-C selector expression.
29665 objc-selector-expression:
29666 @selector ( objc-method-signature )
29668 objc-method-signature:
29669 objc-selector
29670 objc-selector-seq
29672 objc-selector-seq:
29673 objc-selector :
29674 objc-selector-seq objc-selector :
29676 Returns a representation of the method selector. */
29678 static tree
29680 {
29687 matching_parens parens;
29693 {
29702 {
29703 /* Detect if we have a unary selector. */
29705 {
29708 }
29709 else
29710 {
29712 }
29713 }
29718 {
29719 sel_seq
29722 sel_seq
29725 }
29726 else
29727 sel_seq
29732 }
29734 finish_selector:
29738 /* Build a location of the form:
29739 @selector(func)
29740 ^~~~~~~~~~~~~~~
29741 with caret==start at the @ token, finishing at the close paren. */
29742 location_t combined_loc
29746 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29749 }
29751 /* Parse a list of identifiers.
29753 objc-identifier-list:
29754 identifier
29755 objc-identifier-list , identifier
29757 Returns a TREE_LIST of identifier nodes. */
29759 static tree
29761 {
29762 tree identifier;
29763 tree list;
29774 {
29781 identifier));
29783 }
29786 }
29788 /* Parse an Objective-C alias declaration.
29790 objc-alias-declaration:
29791 @compatibility_alias identifier identifier ;
29793 This function registers the alias mapping with the Objective-C front end.
29794 It returns nothing. */
29796 static void
29798 {
29806 }
29808 /* Parse an Objective-C class forward-declaration.
29810 objc-class-declaration:
29811 @class objc-identifier-list ;
29813 The function registers the forward declarations with the Objective-C
29814 front end. It returns nothing. */
29816 static void
29818 {
29821 {
29822 tree id;
29832 else
29834 }
29836 }
29838 /* Parse a list of Objective-C protocol references.
29840 objc-protocol-refs-opt:
29841 objc-protocol-refs [opt]
29843 objc-protocol-refs:
29844 < objc-identifier-list >
29846 Returns a TREE_LIST of identifiers, if any. */
29848 static tree
29850 {
29854 {
29858 }
29861 }
29863 /* Parse a Objective-C visibility specification. */
29865 static void
29867 {
29871 {
29886 }
29888 /* Eat '@private'/'@protected'/'@public'. */
29890 }
29892 /* Parse an Objective-C method type. Return 'true' if it is a class
29893 (+) method, and 'false' if it is an instance (-) method. */
29897 {
29900 else
29902 }
29904 /* Parse an Objective-C protocol qualifier. */
29906 static tree
29908 {
29921 {
29926 }
29929 }
29931 /* Parse an Objective-C typename. */
29933 static tree
29935 {
29939 {
29942 matching_parens parens;
29946 /* An ObjC type name may consist of just protocol qualifiers, in which
29947 case the type shall default to 'id'. */
29949 {
29952 /* If the type could not be parsed, an error has already
29953 been produced. For error recovery, behave as if it had
29954 not been specified, which will use the default type
29955 'id'. */
29957 {
29959 /* We need to skip to the closing parenthesis as
29960 cp_parser_type_id() does not seem to do it for
29961 us. */
29966 }
29967 }
29971 }
29974 }
29976 /* Check to see if TYPE refers to an Objective-C selector name. */
29978 static bool
29980 {
29986 }
29988 /* Parse an Objective-C selector. */
29990 static tree
29992 {
29996 {
29999 }
30001 /* C++ operator names are allowed to appear in ObjC selectors. */
30003 {
30016 }
30017 }
30019 /* Parse an Objective-C params list. */
30021 static tree
30023 {
30029 {
30039 /* Detect if we have a unary selector. */
30042 {
30045 }
30049 {
30050 /* Something went quite wrong. There should be a colon
30051 here, but there is not. Stop parsing parameters. */
30053 }
30055 /* New ObjC allows attributes on parameters too. */
30060 params
30063 type_name,
30064 identifier,
30065 parm_attr));
30068 }
30071 {
30074 }
30076 /* We allow tail attributes for the method. */
30078 {
30086 }
30089 {
30092 }
30094 }
30096 /* Parse the non-keyword Objective-C params. */
30098 static tree
30101 {
30107 {
30109 tree parm;
30115 {
30120 }
30122 /* TODO: parse attributes for tail parameters. */
30131 }
30133 /* We allow tail attributes for the method. */
30135 {
30137 {
30142 }
30143 else
30144 /* We have an error, but parse the attributes, so that we can
30145 carry on. */
30151 }
30154 }
30156 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30158 static void
30160 {
30163 /* If the next token is `extern' and the following token is a string
30164 literal, then we have a linkage specification. */
30166 && cp_parser_is_pure_string_literal
30169 /* Handle #pragma, if any. */
30172 /* Allow stray semicolons. */
30175 /* Mark methods as optional or required, when building protocols. */
30177 {
30180 }
30182 {
30185 }
30188 /* Other stray characters must generate errors. */
30190 {
30194 }
30195 /* Finally, try to parse a block-declaration, or a function-definition. */
30196 else
30198 }
30200 /* Parse a method signature. */
30202 static tree
30204 {
30220 }
30222 static bool
30224 {
30225 tree tattr;
30230 /* If the attributes are followed by a method introducer, this is not allowed.
30231 Dump the attributes and flag the situation. */
30236 /* Otherwise, the attributes introduce some interstitial code, possibly so
30237 rewind to allow that check. */
30240 }
30242 /* Parse an Objective-C method prototype list. */
30244 static void
30246 {
30250 {
30252 {
30257 else
30261 {
30265 }
30268 }
30274 OPT_Wattributes,
30276 else
30277 /* Allow for interspersed non-ObjC++ code. */
30281 }
30285 else
30289 }
30291 /* Parse an Objective-C method definition list. */
30293 static void
30295 {
30299 {
30300 tree meth;
30303 {
30309 else
30314 {
30318 }
30320 NULL_TREE);
30322 /* For historical reasons, we accept an optional semicolon. */
30329 {
30336 }
30337 }
30338 /* The following case will be removed once @synthesize is
30339 completely implemented. */
30350 else
30351 /* Allow for interspersed non-ObjC++ code. */
30355 }
30359 else
30363 }
30365 /* Parse Objective-C ivars. */
30367 static void
30369 {
30380 {
30381 cp_decl_specifier_seq declspecs;
30383 tree prefix_attributes;
30391 CP_PARSER_FLAGS_OPTIONAL,
30395 /* auto, register, static, extern, mutable. */
30397 {
30400 }
30402 /* thread_local. */
30404 {
30407 }
30409 /* typedef. */
30411 {
30414 }
30419 /* Keep going until we hit the `;' at the end of the
30420 declaration. */
30422 {
30427 /* Check for a (possibly unnamed) bitfield declaration. */
30435 {
30436 /* Get the name of the bitfield. */
30439 sfk_none);
30441 eat_colon:
30443 /* Get the width of the bitfield. */
30444 width
30446 }
30447 else
30448 {
30449 /* Parse the declarator. */
30450 declarator
30456 }
30458 /* Look for attributes that apply to the ivar. */
30460 /* Remember which attributes are prefix attributes and
30461 which are not. */
30463 /* Combine the attributes. */
30467 /* Create the bitfield declaration. */
30470 else
30475 /* Add the instance variable. */
30479 /* Reset PREFIX_ATTRIBUTES. */
30481 {
30486 }
30491 {
30494 }
30496 }
30500 }
30505 /* Do not consume the RID_AT_END, so it will be read again as terminating
30506 the @interface of @implementation. */
30510 /* For historical reasons, we accept an optional semicolon. */
30513 }
30515 /* Parse an Objective-C protocol declaration. */
30517 static void
30519 {
30525 {
30530 }
30532 /* See if we have a forward declaration or a definition. */
30535 /* Try a forward declaration first. */
30537 {
30539 {
30540 tree id;
30550 else
30552 }
30554 }
30556 /* Ok, we got a full-fledged definition (or at least should). */
30557 else
30558 {
30563 }
30564 }
30566 /* Parse an Objective-C superclass or category. */
30568 static void
30573 {
30579 {
30582 }
30584 {
30585 matching_parens parens;
30588 /* If there is no category name, and this is an @interface, we
30589 have a class extension. */
30591 {
30594 }
30595 else
30599 }
30600 }
30602 /* Parse an Objective-C class interface. */
30604 static void
30606 {
30613 {
30614 /* It's hard to recover because even if valid @interface stuff
30615 is to follow, we can't compile it (or validate it) if we
30616 don't even know which class it refers to. Let's assume this
30617 was a stray '@interface' token in the stream and skip it.
30618 */
30620 }
30625 /* We have either a class or a category on our hands. */
30628 else
30629 {
30631 /* Handle instance variable declarations, if any. */
30634 }
30637 }
30639 /* Parse an Objective-C class implementation. */
30641 static void
30643 {
30650 {
30651 /* It's hard to recover because even if valid @implementation
30652 stuff is to follow, we can't compile it (or validate it) if
30653 we don't even know which class it refers to. Let's assume
30654 this was a stray '@implementation' token in the stream and
30655 skip it.
30656 */
30658 }
30662 /* We have either a class or a category on our hands. */
30665 else
30666 {
30668 /* Handle instance variable declarations, if any. */
30671 }
30674 }
30676 /* Consume the @end token and finish off the implementation. */
30678 static void
30680 {
30683 }
30685 /* Parse an Objective-C declaration. */
30687 static void
30689 {
30690 /* Try to figure out what kind of declaration is present. */
30695 {
30711 }
30714 {
30737 }
30738 }
30740 /* Parse an Objective-C try-catch-finally statement.
30742 objc-try-catch-finally-stmt:
30743 @try compound-statement objc-catch-clause-seq [opt]
30744 objc-finally-clause [opt]
30746 objc-catch-clause-seq:
30747 objc-catch-clause objc-catch-clause-seq [opt]
30749 objc-catch-clause:
30750 @catch ( objc-exception-declaration ) compound-statement
30752 objc-finally-clause:
30753 @finally compound-statement
30755 objc-exception-declaration:
30756 parameter-declaration
30757 '...'
30759 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30761 Returns NULL_TREE.
30763 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30764 for C. Keep them in sync. */
30766 static tree
30768 {
30769 location_t location;
30770 tree stmt;
30775 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30776 node, lest it get absorbed into the surrounding block. */
30782 {
30786 matching_parens parens;
30792 {
30793 /* We have "@catch (...)" (where the '...' are literally
30794 what is in the code). Skip the '...'.
30795 parameter_declaration is set to NULL_TREE, and
30796 objc_being_catch_clauses() knows that that means
30797 '...'. */
30800 }
30801 else
30802 {
30803 /* We have "@catch (NSException *exception)" or something
30804 like that. Parse the parameter declaration. */
30808 else
30813 }
30816 else
30817 {
30818 /* If there was no open parenthesis, we are recovering from
30819 an error, and we are trying to figure out what mistake
30820 the user has made. */
30822 /* If there is an immediate closing parenthesis, the user
30823 probably forgot the opening one (ie, they typed "@catch
30824 NSException *e)". Parse the closing parenthesis and keep
30825 going. */
30829 /* If these is no immediate closing parenthesis, the user
30830 probably doesn't know that parenthesis are required at
30831 all (ie, they typed "@catch NSException *e"). So, just
30832 forget about the closing parenthesis and keep going. */
30833 }
30837 }
30839 {
30842 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30843 node, lest it get absorbed into the surrounding block. */
30847 }
30850 }
30852 /* Parse an Objective-C synchronized statement.
30854 objc-synchronized-stmt:
30855 @synchronized ( expression ) compound-statement
30857 Returns NULL_TREE. */
30859 static tree
30861 {
30862 location_t location;
30869 matching_parens parens;
30874 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30875 node, lest it get absorbed into the surrounding block. */
30880 }
30882 /* Parse an Objective-C throw statement.
30884 objc-throw-stmt:
30885 @throw assignment-expression [opt] ;
30887 Returns a constructed '@throw' statement. */
30889 static tree
30891 {
30903 }
30905 /* Parse an Objective-C statement. */
30907 static tree
30909 {
30910 /* Try to figure out what kind of declaration is present. */
30914 {
30925 }
30928 }
30930 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30931 look ahead to see if an objc keyword follows the attributes. This
30932 is to detect the use of prefix attributes on ObjC @interface and
30933 @protocol. */
30935 static bool
30937 {
30942 {
30945 }
30948 }
30950 /* This routine is a minimal replacement for
30951 c_parser_struct_declaration () used when parsing the list of
30952 types/names or ObjC++ properties. For example, when parsing the
30953 code
30955 @property (readonly) int a, b, c;
30957 this function is responsible for parsing "int a, int b, int c" and
30958 returning the declarations as CHAIN of DECLs.
30960 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30961 similar parsing. */
30962 static tree
30964 {
30966 cp_decl_specifier_seq declspecs;
30968 tree prefix_attributes;
30971 CP_PARSER_FLAGS_NONE,
30978 /* auto, register, static, extern, mutable. */
30980 {
30983 }
30985 /* thread_local. */
30987 {
30990 }
30992 /* typedef. */
30994 {
30997 }
31002 /* Keep going until we hit the `;' at the end of the declaration. */
31004 {
31009 /* Parse the declarator. */
31013 /* Look for attributes that apply to the ivar. */
31015 /* Remember which attributes are prefix attributes and
31016 which are not. */
31018 /* Combine the attributes. */
31028 /* Reset PREFIX_ATTRIBUTES. */
31030 {
31035 }
31042 {
31045 }
31046 else
31048 }
31050 }
31052 /* Parse an Objective-C @property declaration. The syntax is:
31054 objc-property-declaration:
31055 '@property' objc-property-attributes[opt] struct-declaration ;
31057 objc-property-attributes:
31058 '(' objc-property-attribute-list ')'
31060 objc-property-attribute-list:
31061 objc-property-attribute
31062 objc-property-attribute-list, objc-property-attribute
31064 objc-property-attribute
31065 'getter' = identifier
31066 'setter' = identifier
31067 'readonly'
31068 'readwrite'
31069 'assign'
31070 'retain'
31071 'copy'
31072 'nonatomic'
31074 For example:
31075 @property NSString *name;
31076 @property (readonly) id object;
31077 @property (retain, nonatomic, getter=getTheName) id name;
31078 @property int a, b, c;
31080 PS: This function is identical to
31081 c_parser_objc_at_property_declaration for C. Keep them in sync. */
31082 static void
31084 {
31085 /* The following variables hold the attributes of the properties as
31086 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
31087 seen. When we see an attribute, we set them to 'true' (if they
31088 are boolean properties) or to the identifier (if they have an
31089 argument, ie, for getter and setter). Note that here we only
31090 parse the list of attributes, check the syntax and accumulate the
31091 attributes that we find. objc_add_property_declaration() will
31092 then process the information. */
31102 /* 'properties' is the list of properties that we read. Usually a
31103 single one, but maybe more (eg, in "@property int a, b, c;" there
31104 are three). */
31105 tree properties;
31106 location_t loc;
31112 /* Parse the optional attribute list... */
31114 {
31115 /* Eat the '('. */
31116 matching_parens parens;
31120 {
31126 {
31129 }
31133 {
31144 {
31148 else
31153 }
31156 {
31160 }
31162 {
31164 {
31167 }
31168 else
31172 else
31174 }
31175 else
31176 {
31178 {
31181 }
31182 else
31184 }
31190 }
31197 else
31199 }
31201 /* FIXME: "@property (setter, assign);" will generate a spurious
31202 "error: expected ‘)’ before ‘,’ token". This is because
31203 cp_parser_require, unlike the C counterpart, will produce an
31204 error even if we are in error recovery. */
31206 {
31211 }
31212 }
31214 /* ... and the property declaration(s). */
31218 {
31220 /* If the next token is now a `;', consume it. */
31224 }
31228 else
31229 {
31230 /* Comma-separated properties are chained together in
31231 reverse order; add them one by one. */
31240 }
31243 }
31245 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31247 objc-synthesize-declaration:
31248 @synthesize objc-synthesize-identifier-list ;
31250 objc-synthesize-identifier-list:
31251 objc-synthesize-identifier
31252 objc-synthesize-identifier-list, objc-synthesize-identifier
31254 objc-synthesize-identifier
31255 identifier
31256 identifier = identifier
31258 For example:
31259 @synthesize MyProperty;
31260 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31262 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31263 for C. Keep them in sync.
31264 */
31265 static void
31267 {
31269 location_t loc;
31274 {
31278 {
31281 }
31283 {
31287 {
31290 }
31291 }
31292 else
31297 else
31299 }
31302 }
31304 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31306 objc-dynamic-declaration:
31307 @dynamic identifier-list ;
31309 For example:
31310 @dynamic MyProperty;
31311 @dynamic MyProperty, AnotherProperty;
31313 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31314 for C. Keep them in sync.
31315 */
31316 static void
31318 {
31320 location_t loc;
31325 {
31326 tree property;
31329 {
31332 }
31336 else
31338 }
31341 }
31343 \f
31344 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31346 /* Returns name of the next clause.
31347 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31348 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31349 returned and the token is consumed. */
31351 static pragma_omp_clause
31353 {
31369 {
31374 {
31555 }
31556 }
31562 }
31564 /* Validate that a clause of the given type does not already exist. */
31566 static void
31569 {
31570 tree c;
31574 {
31577 }
31578 }
31580 /* OpenMP 2.5:
31581 variable-list:
31582 identifier
31583 variable-list , identifier
31585 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31586 colon). An opening parenthesis will have been consumed by the caller.
31588 If KIND is nonzero, create the appropriate node and install the decl
31589 in OMP_CLAUSE_DECL and add the node to the head of the list.
31591 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31592 return the list created.
31594 COLON can be NULL if only closing parenthesis should end the list,
31595 or pointer to bool which will receive false if the list is terminated
31596 by closing parenthesis or true if the list is terminated by colon. */
31598 static tree
31601 {
31605 {
31608 }
31610 {
31615 && current_class_ptr
31617 {
31623 }
31624 else
31625 {
31636 else
31641 }
31643 ;
31645 {
31647 {
31649 /* The OpenACC cache directive explicitly only allows "array
31650 elements or subarrays". */
31652 {
31656 }
31657 /* FALLTHROUGH. */
31662 {
31663 location_t loc
31668 decl
31672 }
31673 /* FALLTHROUGH. */
31677 {
31685 parser->colon_corrects_to_scope_p
31689 else
31690 {
31691 /* Look for `:'. */
31695 CPP_CLOSE_SQUARE))
31697 }
31698 /* Look for the closing `]'. */
31700 RT_CLOSE_SQUARE))
31704 }
31708 }
31714 }
31715 else
31718 get_comma:
31722 }
31728 {
31732 }
31735 {
31738 /* Try to resync to an unnested comma. Copied from
31739 cp_parser_parenthesized_expression_list. */
31740 skip_comma:
31749 }
31752 }
31754 /* Similarly, but expect leading and trailing parenthesis. This is a very
31755 common case for omp clauses. */
31757 static tree
31759 {
31763 }
31765 /* OpenACC 2.0:
31766 copy ( variable-list )
31767 copyin ( variable-list )
31768 copyout ( variable-list )
31769 create ( variable-list )
31770 delete ( variable-list )
31771 present ( variable-list ) */
31773 static tree
31775 tree list)
31776 {
31779 {
31812 }
31820 }
31822 /* OpenACC 2.0:
31823 deviceptr ( variable-list ) */
31825 static tree
31827 {
31831 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31832 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31833 variable-list must only allow for pointer variables. */
31836 {
31843 }
31846 }
31848 /* OpenACC 2.5:
31849 auto
31850 finalize
31851 independent
31852 nohost
31853 seq */
31855 static tree
31859 {
31864 }
31866 /* OpenACC:
31867 num_gangs ( expression )
31868 num_workers ( expression )
31869 vector_length ( expression ) */
31871 static tree
31874 {
31877 matching_parens parens;
31885 {
31890 }
31898 }
31900 /* OpenACC:
31902 gang [( gang-arg-list )]
31903 worker [( [num:] int-expr )]
31904 vector [( [length:] int-expr )]
31906 where gang-arg is one of:
31908 [num:] int-expr
31909 static: size-expr
31911 and size-expr may be:
31913 *
31914 int-expr
31915 */
31917 static tree
31920 {
31930 {
31931 matching_parens parens;
31934 do
31935 {
31939 /* Gang static argument. */
31942 {
31950 {
31953 }
31955 /* Check for the '*' argument. */
31959 CPP_CLOSE_PAREN)))
31960 {
31965 {
31968 }
31970 }
31971 }
31972 /* Worker num: argument and vector length: arguments. */
31976 {
31979 }
31981 /* Now collect the actual argument. */
31983 {
31986 }
31998 {
32001 }
32003 }
32008 }
32022 cleanup_error:
32025 }
32027 /* OpenACC 2.0:
32028 tile ( size-expr-list ) */
32030 static tree
32032 {
32036 /* Collapse and tile are mutually exclusive. (The spec doesn't say
32037 so, but the spec authors never considered such a case and have
32038 differing opinions on what it might mean, including 'not
32039 allowed'.) */
32042 clause_loc);
32047 do
32048 {
32055 {
32058 }
32059 else
32063 }
32066 /* Consume the trailing ')'. */
32074 }
32076 /* OpenACC 2.0
32077 Parse wait clause or directive parameters. */
32079 static tree
32081 {
32091 {
32096 }
32103 {
32107 {
32110 else
32111 {
32118 }
32119 }
32120 }
32123 }
32125 /* OpenACC:
32126 wait ( int-expr-list ) */
32128 static tree
32130 {
32139 }
32141 /* OpenMP 3.0:
32142 collapse ( constant-expression ) */
32144 static tree
32146 {
32148 location_t loc;
32149 HOST_WIDE_INT n;
32152 matching_parens parens;
32170 {
32173 }
32182 }
32184 /* OpenMP 2.5:
32185 default ( none | shared )
32187 OpenACC:
32188 default ( none | present ) */
32190 static tree
32193 {
32195 tree c;
32197 matching_parens parens;
32201 {
32206 {
32227 }
32230 }
32231 else
32232 {
32233 invalid_kind:
32236 else
32238 }
32255 }
32257 /* OpenMP 3.1:
32258 final ( expression ) */
32260 static tree
32262 {
32265 matching_parens parens;
32284 }
32286 /* OpenMP 2.5:
32287 if ( expression )
32289 OpenMP 4.5:
32290 if ( directive-name-modifier : expression )
32292 directive-name-modifier:
32293 parallel | task | taskloop | target data | target | target update
32294 | target enter data | target exit data */
32296 static tree
32299 {
32303 matching_parens parens;
32308 {
32320 {
32323 {
32336 else
32337 {
32338 location_t loc
32343 }
32346 {
32348 {
32353 }
32355 {
32356 location_t loc
32360 }
32361 }
32362 }
32363 }
32365 {
32367 {
32370 }
32371 else
32372 {
32374 {
32375 location_t loc
32378 }
32380 }
32381 }
32382 }
32394 {
32397 {
32400 {
32410 }
32412 p);
32414 }
32416 {
32419 else
32422 }
32425 {
32429 }
32430 }
32438 }
32440 /* OpenMP 3.1:
32441 mergeable */
32443 static tree
32446 {
32447 tree c;
32450 location);
32455 }
32457 /* OpenMP 2.5:
32458 nowait */
32460 static tree
32463 {
32464 tree c;
32471 }
32473 /* OpenMP 2.5:
32474 num_threads ( expression ) */
32476 static tree
32478 location_t location)
32479 {
32482 matching_parens parens;
32502 }
32504 /* OpenMP 4.5:
32505 num_tasks ( expression ) */
32507 static tree
32509 location_t location)
32510 {
32513 matching_parens parens;
32533 }
32535 /* OpenMP 4.5:
32536 grainsize ( expression ) */
32538 static tree
32540 location_t location)
32541 {
32544 matching_parens parens;
32564 }
32566 /* OpenMP 4.5:
32567 priority ( expression ) */
32569 static tree
32571 location_t location)
32572 {
32575 matching_parens parens;
32595 }
32597 /* OpenMP 4.5:
32598 hint ( expression ) */
32600 static tree
32602 location_t location)
32603 {
32606 matching_parens parens;
32625 }
32627 /* OpenMP 4.5:
32628 defaultmap ( tofrom : scalar ) */
32630 static tree
32632 location_t location)
32633 {
32637 matching_parens parens;
32642 {
32645 }
32649 {
32652 }
32658 {
32661 }
32665 {
32668 }
32674 location);
32680 out_err:
32685 }
32687 /* OpenMP 2.5:
32688 ordered
32690 OpenMP 4.5:
32691 ordered ( constant-expression ) */
32693 static tree
32696 {
32698 HOST_WIDE_INT n;
32704 {
32705 matching_parens parens;
32722 {
32724 "ordered argument needs positive constant integer "
32727 }
32728 }
32734 }
32736 /* OpenMP 2.5:
32737 reduction ( reduction-operator : variable-list )
32739 reduction-operator:
32740 One of: + * - & ^ | && ||
32742 OpenMP 3.1:
32744 reduction-operator:
32745 One of: + * - & ^ | && || min max
32747 OpenMP 4.0:
32749 reduction-operator:
32750 One of: + * - & ^ | && ||
32751 id-expression */
32753 static tree
32755 {
32763 {
32773 }
32777 else
32778 {
32789 {
32819 }
32820 else
32821 {
32823 resync_fail:
32828 }
32829 }
32835 NULL);
32837 {
32840 }
32843 }
32845 /* OpenMP 2.5:
32846 schedule ( schedule-kind )
32847 schedule ( schedule-kind , expression )
32849 schedule-kind:
32850 static | dynamic | guided | runtime | auto
32852 OpenMP 4.5:
32853 schedule ( schedule-modifier : schedule-kind )
32854 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32856 schedule-modifier:
32857 simd
32858 monotonic
32859 nonmonotonic */
32861 static tree
32863 {
32867 matching_parens parens;
32874 {
32883 else
32889 else
32890 {
32893 }
32894 }
32897 {
32902 {
32923 }
32924 }
32929 else
32935 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32937 {
32941 }
32944 {
32959 else
32964 }
32976 invalid_kind:
32978 resync_fail:
32983 }
32985 /* OpenMP 3.0:
32986 untied */
32988 static tree
32991 {
32992 tree c;
32999 }
33001 /* OpenMP 4.0:
33002 inbranch
33003 notinbranch */
33005 static tree
33008 {
33013 }
33015 /* OpenMP 4.0:
33016 parallel
33017 for
33018 sections
33019 taskgroup */
33021 static tree
33025 {
33029 }
33031 /* OpenMP 4.5:
33032 nogroup */
33034 static tree
33037 {
33042 }
33044 /* OpenMP 4.5:
33045 simd
33046 threads */
33048 static tree
33052 {
33057 }
33059 /* OpenMP 4.0:
33060 num_teams ( expression ) */
33062 static tree
33064 location_t location)
33065 {
33068 matching_parens parens;
33088 }
33090 /* OpenMP 4.0:
33091 thread_limit ( expression ) */
33093 static tree
33095 location_t location)
33096 {
33099 matching_parens parens;
33119 }
33121 /* OpenMP 4.0:
33122 aligned ( variable-list )
33123 aligned ( variable-list : constant-expression ) */
33125 static tree
33127 {
33131 matching_parens parens;
33139 {
33149 }
33155 }
33157 /* OpenMP 4.0:
33158 linear ( variable-list )
33159 linear ( variable-list : expression )
33161 OpenMP 4.5:
33162 linear ( modifier ( variable-list ) )
33163 linear ( modifier ( variable-list ) : expression ) */
33165 static tree
33168 {
33173 matching_parens parens;
33178 {
33190 else
33192 }
33197 else
33198 {
33207 }
33210 {
33215 {
33226 {
33229 }
33232 }
33243 }
33246 {
33249 }
33252 }
33254 /* OpenMP 4.0:
33255 safelen ( constant-expression ) */
33257 static tree
33259 location_t location)
33260 {
33263 matching_parens parens;
33282 }
33284 /* OpenMP 4.0:
33285 simdlen ( constant-expression ) */
33287 static tree
33289 location_t location)
33290 {
33293 matching_parens parens;
33312 }
33314 /* OpenMP 4.5:
33315 vec:
33316 identifier [+/- integer]
33317 vec , identifier [+/- integer]
33318 */
33320 static tree
33322 tree list)
33323 {
33327 {
33330 }
33333 {
33340 else
33341 {
33342 t = cp_parser_lookup_name_simple
33347 id_loc);
33348 }
33354 {
33357 }
33361 {
33364 }
33368 {
33371 }
33374 add_to_vector:
33376 {
33380 }
33386 }
33389 {
33395 }
33397 }
33399 /* OpenMP 4.0:
33400 depend ( depend-kind : variable-list )
33402 depend-kind:
33403 in | out | inout
33405 OpenMP 4.5:
33406 depend ( source )
33408 depend ( sink : vec ) */
33410 static tree
33412 {
33416 matching_parens parens;
33421 {
33435 else
33437 }
33438 else
33444 {
33454 }
33461 else
33462 {
33468 }
33471 invalid_kind:
33473 resync_fail:
33478 }
33480 /* OpenMP 4.0:
33481 map ( map-kind : variable-list )
33482 map ( variable-list )
33484 map-kind:
33485 alloc | to | from | tofrom
33487 OpenMP 4.5:
33488 map-kind:
33489 alloc | to | from | tofrom | release | delete
33491 map ( always [,] map-kind: variable-list ) */
33493 static tree
33495 {
33504 {
33509 {
33512 nth++;
33518 {
33523 }
33524 }
33525 }
33529 {
33543 else
33544 {
33550 }
33553 }
33556 {
33560 }
33563 NULL);
33569 }
33571 /* OpenMP 4.0:
33572 device ( expression ) */
33574 static tree
33576 location_t location)
33577 {
33580 matching_parens parens;
33600 }
33602 /* OpenMP 4.0:
33603 dist_schedule ( static )
33604 dist_schedule ( static , expression ) */
33606 static tree
33608 location_t location)
33609 {
33612 matching_parens parens;
33623 {
33634 }
33639 location);
33643 invalid_kind:
33645 resync_fail:
33650 }
33652 /* OpenMP 4.0:
33653 proc_bind ( proc-bind-kind )
33655 proc-bind-kind:
33656 master | close | spread */
33658 static tree
33660 location_t location)
33661 {
33662 tree c;
33669 {
33679 else
33681 }
33682 else
33691 location);
33696 invalid_kind:
33698 resync_fail:
33703 }
33705 /* OpenACC:
33706 async [( int-expr )] */
33708 static tree
33710 {
33717 {
33718 matching_parens parens;
33727 }
33737 }
33739 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33740 is a bitmask in MASK. Return the list of clauses found. */
33742 static tree
33746 {
33751 {
33752 location_t here;
33753 pragma_omp_clause c_kind;
33754 omp_clause_code code;
33765 {
33822 clauses);
33840 OMP_CLAUSE_IF_PRESENT,
33846 OMP_CLAUSE_INDEPENDENT,
33858 clauses);
33864 clauses);
33872 clauses);
33890 clauses);
33902 clauses);
33916 }
33921 {
33922 /* Remove the invalid clause(s) from the list to avoid
33923 confusing the rest of the compiler. */
33926 }
33927 }
33929 saw_error:
33936 }
33938 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33939 is a bitmask in MASK. Return the list of clauses found; the result
33940 of clause default goes in *pdefault. */
33942 static tree
33946 {
33952 {
33953 pragma_omp_clause c_kind;
33964 {
33976 clauses);
33990 clauses);
34010 clauses);
34015 clauses);
34025 clauses);
34059 clauses);
34073 clauses);
34088 OMP_CLAUSE_NOTINBRANCH,
34097 {
34098 clause_not_first:
34102 }
34132 clauses);
34133 else
34143 clauses);
34161 {
34166 }
34209 clauses
34215 clauses
34223 }
34228 {
34229 /* Remove the invalid clause(s) from the list to avoid
34230 confusing the rest of the compiler. */
34233 }
34234 }
34235 saw_error:
34238 {
34241 else
34243 }
34245 }
34247 /* OpenMP 2.5:
34248 structured-block:
34249 statement
34251 In practice, we're also interested in adding the statement to an
34252 outer node. So it is convenient if we work around the fact that
34253 cp_parser_statement calls add_stmt. */
34255 static unsigned
34257 {
34260 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34261 This preserves the "not within loop or switch" style error messages
34262 for nonsense cases like
34263 void foo() {
34264 #pragma omp single
34265 break;
34266 }
34267 */
34272 }
34274 static void
34276 {
34278 }
34280 static tree
34282 {
34290 }
34292 /* OpenMP 2.5:
34293 # pragma omp atomic new-line
34294 expression-stmt
34296 expression-stmt:
34297 x binop= expr | x++ | ++x | x-- | --x
34298 binop:
34299 +, *, -, /, &, ^, |, <<, >>
34301 where x is an lvalue expression with scalar type.
34303 OpenMP 3.1:
34304 # pragma omp atomic new-line
34305 update-stmt
34307 # pragma omp atomic read new-line
34308 read-stmt
34310 # pragma omp atomic write new-line
34311 write-stmt
34313 # pragma omp atomic update new-line
34314 update-stmt
34316 # pragma omp atomic capture new-line
34317 capture-stmt
34319 # pragma omp atomic capture new-line
34320 capture-block
34322 read-stmt:
34323 v = x
34324 write-stmt:
34325 x = expr
34326 update-stmt:
34327 expression-stmt | x = x binop expr
34328 capture-stmt:
34329 v = expression-stmt
34330 capture-block:
34331 { v = x; update-stmt; } | { update-stmt; v = x; }
34333 OpenMP 4.0:
34334 update-stmt:
34335 expression-stmt | x = x binop expr | x = expr binop x
34336 capture-stmt:
34337 v = update-stmt
34338 capture-block:
34339 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34341 where x and v are lvalue expressions with scalar type. */
34343 static void
34345 {
34353 {
34358 {
34364 }
34365 }
34367 {
34379 else
34383 }
34385 {
34391 {
34396 {
34399 }
34400 }
34401 }
34405 {
34415 else
34420 {
34421 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34422 opcode. */
34427 }
34431 {
34434 }
34435 else
34436 {
34442 }
34445 }
34447 restart:
34451 {
34458 /* FALLTHROUGH */
34468 /* FALLTHROUGH */
34483 /* Undo effects of boolean_increment for post {in,de}crement. */
34485 /* FALLTHRU */
34489 {
34490 /* Undo effects of boolean_increment. */
34492 {
34493 /* This is pre or post increment. */
34498 && !structured_block
34502 }
34503 }
34504 /* FALLTHRU */
34507 {
34542 {
34546 }
34549 {
34555 {
34560 }
34562 {
34574 {
34576 {
34581 }
34582 else
34584 }
34588 }
34591 {
34598 }
34602 }
34606 {
34609 {
34617 }
34619 {
34624 }
34659 }
34670 /* FALLTHROUGH */
34675 }
34682 }
34683 stmt_done:
34685 {
34696 }
34698 {
34701 }
34702 done:
34708 saw_error:
34711 {
34715 {
34719 }
34720 }
34721 }
34724 /* OpenMP 2.5:
34725 # pragma omp barrier new-line */
34727 static void
34729 {
34732 }
34734 /* OpenMP 2.5:
34735 # pragma omp critical [(name)] new-line
34736 structured-block
34738 OpenMP 4.5:
34739 # pragma omp critical [(name) [hint(expression)]] new-line
34740 structured-block */
34742 #define OMP_CRITICAL_CLAUSE_MASK \
34743 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34745 static tree
34747 {
34751 {
34752 matching_parens parens;
34766 OMP_CRITICAL_CLAUSE_MASK,
34768 }
34769 else
34774 }
34776 /* OpenMP 2.5:
34777 # pragma omp flush flush-vars[opt] new-line
34779 flush-vars:
34780 ( variable-list ) */
34782 static void
34784 {
34790 }
34792 /* Helper function, to parse omp for increment expression. */
34794 static tree
34796 {
34801 {
34804 }
34807 {
34814 /* Fall through: OpenMP disallows NE_EXPR. */
34818 }
34820 /* If decl is an iterator, preserve LHS and RHS of the relational
34821 expr until finish_omp_for. */
34832 }
34834 /* Helper function, to parse omp for increment expression. */
34836 static tree
34838 {
34842 cp_id_kind idk;
34846 {
34855 }
34864 {
34869 }
34876 {
34880 }
34893 do
34894 {
34901 {
34903 {
34906 else
34908 tf_warning_or_error);
34909 }
34910 else
34913 }
34914 }
34918 {
34924 }
34925 else
34929 }
34931 /* Parse the initialization statement of an OpenMP for loop.
34933 Return true if the resulting construct should have an
34934 OMP_CLAUSE_PRIVATE added to it. */
34936 static tree
34944 {
34950 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34952 init-expr:
34953 var = lb
34954 integer-type var = lb
34955 random-access-iterator-type var = lb
34956 pointer-type var = lb
34957 */
34958 cp_decl_specifier_seq type_specifiers;
34960 /* First, try to parse as an initialized declaration. See
34961 cp_parser_condition, from whence the bulk of this is copied. */
34968 {
34969 /* If parsing a type specifier seq succeeded, then this
34970 MUST be a initialized declaration. */
34975 CP_PARSER_DECLARATOR_NAMED,
34986 else
34987 {
34997 {
34999 CPP_OPEN_PAREN))
35002 else
35003 /* Trigger an error. */
35008 }
35012 {
35020 {
35023 auto_node);
35028 }
35031 asm_specification,
35032 LOOKUP_ONLYCONVERTING);
35035 {
35038 }
35039 else
35040 {
35043 {
35045 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
35047 {
35051 {
35055 }
35057 }
35059 {
35064 }
35065 }
35066 }
35068 }
35069 else
35070 {
35071 /* Consume '='. */
35075 non_class:
35078 else
35081 asm_specification,
35082 LOOKUP_ONLYCONVERTING);
35083 }
35087 }
35088 }
35089 else
35090 {
35091 cp_id_kind idk;
35092 /* If parsing a type specifier sequence failed, then
35093 this MUST be a simple expression. */
35099 && decl
35102 {
35113 {
35118 }
35123 }
35125 && decl
35128 {
35129 tree rhs;
35137 rhs,
35138 tf_warning_or_error));
35141 }
35142 else
35143 {
35148 {
35152 }
35153 }
35154 }
35156 }
35158 /* Parse the restricted form of the for statement allowed by OpenMP. */
35160 static tree
35163 {
35167 location_t loc_first;
35178 {
35181 }
35184 {
35187 }
35190 {
35196 }
35198 {
35201 {
35203 "%<linear%> clause may not be specified together "
35206 }
35207 else
35209 }
35222 {
35225 location_t loc;
35228 {
35232 }
35235 matching_parens parens;
35242 add_private_clause
35248 {
35251 {
35257 }
35258 else
35260 }
35267 {
35272 {
35276 }
35279 {
35280 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35284 {
35287 }
35288 else
35289 {
35292 }
35294 }
35295 else
35296 {
35301 }
35302 }
35305 {
35306 tree c;
35308 {
35317 decl);
35321 decl);
35322 }
35324 {
35329 else
35334 {
35337 /* For linear, signal that we need to fill up
35338 the so far unknown linear step. */
35341 }
35342 }
35343 }
35352 {
35353 /* If decl is an iterator, preserve the operator on decl
35354 until finish_omp_for. */
35356 && ((processing_template_decl
35361 else
35365 }
35377 {
35380 }
35385 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35386 in between the collapsed for loops to be still considered perfectly
35387 nested. Hopefully the final version clarifies this.
35388 For now handle (multiple) {'s and empty statements. */
35391 {
35395 {
35397 bracecount++;
35398 }
35402 else
35403 {
35410 }
35411 }
35414 {
35417 }
35418 }
35423 /* Note that we saved the original contents of this flag when we entered
35424 the structured block, and so we don't need to re-save it here. */
35427 /* Note that the grammar doesn't call for a structured block here,
35428 though the loop as a whole is a structured block. */
35435 else
35440 {
35442 {
35444 nbraces--;
35445 }
35448 else
35449 {
35451 {
35454 }
35459 }
35460 }
35463 {
35467 else
35469 }
35473 }
35475 /* Helper function for OpenMP parsing, split clauses and call
35476 finish_omp_clauses on each of the set of clauses afterwards. */
35478 static void
35481 {
35487 }
35489 /* OpenMP 4.0:
35490 #pragma omp simd simd-clause[optseq] new-line
35491 for-loop */
35493 #define OMP_SIMD_CLAUSE_MASK \
35494 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35498 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35499 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35503 static tree
35507 {
35518 {
35522 OMP_CLAUSE_ORDERED);
35524 {
35526 "%<ordered%> clause with parameter may not be specified "
35529 }
35530 }
35541 }
35543 /* OpenMP 2.5:
35544 #pragma omp for for-clause[optseq] new-line
35545 for-loop
35547 OpenMP 4.0:
35548 #pragma omp for simd for-simd-clause[optseq] new-line
35549 for-loop */
35551 #define OMP_FOR_CLAUSE_MASK \
35552 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35557 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35562 static tree
35566 {
35573 /* parallel for{, simd} disallows nowait clause, but for
35574 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35577 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35582 {
35587 {
35611 }
35612 }
35614 {
35617 }
35619 /* Composite distribute parallel for disallows linear clause. */
35626 {
35629 }
35640 }
35642 /* OpenMP 2.5:
35643 # pragma omp master new-line
35644 structured-block */
35646 static tree
35648 {
35652 }
35654 /* OpenMP 2.5:
35655 # pragma omp ordered new-line
35656 structured-block
35658 OpenMP 4.5:
35659 # pragma omp ordered ordered-clauses new-line
35660 structured-block */
35662 #define OMP_ORDERED_CLAUSE_MASK \
35663 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35666 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35667 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35669 static bool
35672 {
35676 {
35681 {
35683 {
35686 }
35688 {
35690 "%<depend%> clause may only be used in compound "
35694 }
35695 tree clauses
35697 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35701 }
35702 }
35704 tree clauses
35715 }
35717 /* OpenMP 2.5:
35719 section-scope:
35720 { section-sequence }
35722 section-sequence:
35723 section-directive[opt] structured-block
35724 section-sequence section-directive structured-block */
35726 static tree
35728 {
35733 matching_braces braces;
35741 {
35745 }
35748 {
35756 {
35760 }
35762 {
35765 }
35770 }
35781 }
35783 /* OpenMP 2.5:
35784 # pragma omp sections sections-clause[optseq] newline
35785 sections-scope */
35787 #define OMP_SECTIONS_CLAUSE_MASK \
35788 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35790 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35791 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35792 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35794 static tree
35797 {
35809 {
35812 }
35819 }
35821 /* OpenMP 2.5:
35822 # pragma omp parallel parallel-clause[optseq] new-line
35823 structured-block
35824 # pragma omp parallel for parallel-for-clause[optseq] new-line
35825 structured-block
35826 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35827 structured-block
35829 OpenMP 4.0:
35830 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35831 structured-block */
35833 #define OMP_PARALLEL_CLAUSE_MASK \
35834 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35844 static tree
35848 {
35855 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35861 {
35869 if_p);
35873 if_p);
35876 block);
35881 }
35882 /* When combined with distribute, parallel has to be followed by for.
35883 #pragma omp target parallel is allowed though. */
35887 {
35891 }
35893 {
35896 }
35898 {
35902 {
35912 block);
35915 }
35916 }
35921 {
35924 }
35932 }
35934 /* OpenMP 2.5:
35935 # pragma omp single single-clause[optseq] new-line
35936 structured-block */
35938 #define OMP_SINGLE_CLAUSE_MASK \
35939 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35942 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35944 static tree
35946 {
35956 }
35958 /* OpenMP 3.0:
35959 # pragma omp task task-clause[optseq] new-line
35960 structured-block */
35962 #define OMP_TASK_CLAUSE_MASK \
35963 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35974 static tree
35976 {
35987 }
35989 /* OpenMP 3.0:
35990 # pragma omp taskwait new-line */
35992 static void
35994 {
35997 }
35999 /* OpenMP 3.1:
36000 # pragma omp taskyield new-line */
36002 static void
36004 {
36007 }
36009 /* OpenMP 4.0:
36010 # pragma omp taskgroup new-line
36011 structured-block */
36013 static tree
36015 {
36019 if_p));
36020 }
36023 /* OpenMP 2.5:
36024 # pragma omp threadprivate (variable-list) */
36026 static void
36028 {
36029 tree vars;
36035 }
36037 /* OpenMP 4.0:
36038 # pragma omp cancel cancel-clause[optseq] new-line */
36040 #define OMP_CANCEL_CLAUSE_MASK \
36041 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
36045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
36047 static void
36049 {
36053 }
36055 /* OpenMP 4.0:
36056 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
36058 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
36059 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
36064 static void
36067 {
36068 tree clauses;
36072 {
36077 {
36080 }
36081 }
36083 {
36087 }
36090 {
36095 else
36099 }
36102 OMP_CANCELLATION_POINT_CLAUSE_MASK,
36104 pragma_tok);
36106 }
36108 /* OpenMP 4.0:
36109 #pragma omp distribute distribute-clause[optseq] new-line
36110 for-loop */
36112 #define OMP_DISTRIBUTE_CLAUSE_MASK \
36113 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36119 static tree
36123 {
36132 {
36140 else
36143 {
36149 {
36153 else
36156 }
36162 else
36176 }
36177 }
36179 {
36182 }
36187 {
36190 }
36201 }
36203 /* OpenMP 4.0:
36204 # pragma omp teams teams-clause[optseq] new-line
36205 structured-block */
36207 #define OMP_TEAMS_CLAUSE_MASK \
36208 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36210 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36211 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36216 static tree
36220 {
36229 {
36233 {
36258 }
36259 }
36261 {
36264 }
36269 {
36272 }
36281 }
36283 /* OpenMP 4.0:
36284 # pragma omp target data target-data-clause[optseq] new-line
36285 structured-block */
36287 #define OMP_TARGET_DATA_CLAUSE_MASK \
36288 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36293 static tree
36295 {
36296 tree clauses
36301 {
36304 {
36321 "%<#pragma omp target data%> with map-type other "
36322 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36326 }
36328 }
36331 {
36334 "%<#pragma omp target data%> must contain at least "
36337 }
36348 }
36350 /* OpenMP 4.5:
36351 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36352 structured-block */
36354 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36355 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36361 static tree
36364 {
36367 {
36372 {
36375 }
36376 }
36378 {
36382 }
36385 {
36391 }
36393 tree clauses
36398 {
36401 {
36414 "%<#pragma omp target enter data%> with map-type other "
36418 }
36420 }
36423 {
36426 "%<#pragma omp target enter data%> must contain at least "
36429 }
36436 }
36438 /* OpenMP 4.5:
36439 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36440 structured-block */
36442 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36443 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36447 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36449 static tree
36452 {
36455 {
36460 {
36463 }
36464 }
36466 {
36470 }
36473 {
36479 }
36481 tree clauses
36486 {
36489 {
36503 "%<#pragma omp target exit data%> with map-type other "
36504 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36508 }
36510 }
36513 {
36516 "%<#pragma omp target exit data%> must contain at least "
36519 }
36526 }
36528 /* OpenMP 4.0:
36529 # pragma omp target update target-update-clause[optseq] new-line */
36531 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36532 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36539 static bool
36542 {
36544 {
36550 }
36552 tree clauses
36557 {
36559 "%<#pragma omp target update%> must contain at least one "
36562 }
36570 }
36572 /* OpenMP 4.0:
36573 # pragma omp target target-clause[optseq] new-line
36574 structured-block */
36576 #define OMP_TARGET_CLAUSE_MASK \
36577 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36579 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36580 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36581 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36585 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36587 static bool
36590 {
36594 {
36606 {
36614 {
36615 tree stmt;
36617 {
36620 OMP_TARGET_CLAUSE_MASK,
36625 OMP_TARGET_CLAUSE_MASK,
36630 OMP_TARGET_CLAUSE_MASK,
36635 }
36637 }
36642 {
36646 if_p);
36651 if_p);
36656 if_p);
36660 }
36666 {
36667 /* For combined target teams, ensure the num_teams and
36668 thread_limit clause expressions are evaluated on the host,
36669 before entering the target construct. */
36670 tree c;
36676 {
36685 OMP_CLAUSE_FIRSTPRIVATE);
36690 }
36691 }
36701 }
36703 {
36706 }
36708 {
36712 }
36714 {
36718 }
36720 {
36724 }
36726 {
36729 }
36730 }
36732 {
36735 }
36750 check_clauses:
36752 {
36755 {
36769 "%<#pragma omp target%> with map-type other "
36770 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36774 }
36776 }
36778 }
36780 /* OpenACC 2.0:
36781 # pragma acc cache (variable-list) new-line
36782 */
36784 static tree
36786 {
36801 }
36803 /* OpenACC 2.0:
36804 # pragma acc data oacc-data-clause[optseq] new-line
36805 structured-block */
36807 #define OACC_DATA_CLAUSE_MASK \
36808 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
36816 static tree
36818 {
36831 }
36833 /* OpenACC 2.0:
36834 # pragma acc host_data <clauses> new-line
36835 structured-block */
36837 #define OACC_HOST_DATA_CLAUSE_MASK \
36838 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36840 static tree
36842 {
36855 }
36857 /* OpenACC 2.0:
36858 # pragma acc declare oacc-data-clause[optseq] new-line
36859 */
36861 #define OACC_DECLARE_CLAUSE_MASK \
36862 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
36871 static tree
36873 {
36882 {
36886 }
36889 {
36893 {
36897 }
36900 {
36912 {
36914 "%qD must be a global variable in "
36916 decl);
36919 }
36924 {
36928 }
36930 {
36932 "invalid use of %<extern%> variable %qD "
36936 }
36938 {
36940 "invalid use of %<global%> variable %qD "
36944 }
36946 }
36951 {
36956 }
36959 {
36960 tree id;
36964 else
36970 {
36973 {
36976 {
36980 }
36981 }
36982 }
36983 }
36984 }
36997 }
36999 /* OpenACC 2.0:
37000 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
37002 or
37004 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
37006 LOC is the location of the #pragma token.
37007 */
37009 #define OACC_ENTER_DATA_CLAUSE_MASK \
37010 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37016 #define OACC_EXIT_DATA_CLAUSE_MASK \
37017 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
37021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
37022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37024 static tree
37027 {
37036 {
37041 }
37048 else
37053 {
37057 }
37065 }
37067 /* OpenACC 2.0:
37068 # pragma acc loop oacc-loop-clause[optseq] new-line
37069 structured-block */
37071 #define OACC_LOOP_CLAUSE_MASK \
37072 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
37073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
37079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
37080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
37081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
37083 static tree
37086 {
37095 {
37101 }
37110 }
37112 /* OpenACC 2.0:
37113 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37114 structured-block
37116 or
37118 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37119 structured-block
37120 */
37122 #define OACC_KERNELS_CLAUSE_MASK \
37123 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37137 #define OACC_PARALLEL_CLAUSE_MASK \
37138 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37144 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37146 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37155 static tree
37158 {
37159 omp_clause_mask mask;
37162 {
37175 }
37178 {
37182 {
37185 tree clauses;
37187 if_p);
37189 }
37190 }
37199 }
37201 /* OpenACC 2.0:
37202 # pragma acc update oacc-update-clause[optseq] new-line
37203 */
37205 #define OACC_UPDATE_CLAUSE_MASK \
37206 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37210 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
37211 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37213 static tree
37215 {
37222 {
37224 "%<#pragma acc update%> must contain at least one "
37227 }
37235 }
37237 /* OpenACC 2.0:
37238 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37240 LOC is the location of the #pragma token.
37241 */
37243 #define OACC_WAIT_CLAUSE_MASK \
37244 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37246 static tree
37248 {
37262 }
37264 /* OpenMP 4.0:
37265 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37267 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37268 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37275 static void
37278 {
37280 cp_omp_declare_simd_data data;
37282 {
37287 /* It is safe to take the address of a local variable; it will only be
37288 used while this scope is live. */
37290 }
37292 /* Store away all pragma tokens. */
37304 {
37308 {
37321 }
37326 "%<#pragma omp declare simd%> not immediately followed by "
37330 }
37331 }
37333 /* Finalize #pragma omp declare simd clauses after direct declarator has
37334 been parsed, and put that into "omp declare simd" attribute. */
37336 static tree
37338 {
37344 {
37348 }
37353 {
37371 }
37375 }
37378 /* OpenMP 4.0:
37379 # pragma omp declare target new-line
37380 declarations and definitions
37381 # pragma omp end declare target new-line
37383 OpenMP 4.5:
37384 # pragma omp declare target ( extended-list ) new-line
37386 # pragma omp declare target declare-target-clauses[seq] new-line */
37388 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37389 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37392 static void
37394 {
37397 clauses
37401 {
37403 clauses);
37406 }
37407 else
37408 {
37412 }
37415 "%<#pragma omp declare target%> with clauses in between "
37416 "%<#pragma omp declare target%> without clauses and "
37419 {
37425 {
37428 }
37429 else
37432 {
37434 "%qD specified both in declare target %<link%> and %<to%>"
37437 }
37439 {
37446 {
37449 {
37453 }
37454 }
37455 }
37456 }
37457 }
37459 static void
37461 {
37464 {
37467 }
37469 {
37473 {
37476 }
37479 else
37480 {
37484 }
37485 }
37486 else
37487 {
37491 }
37495 "%<#pragma omp end declare target%> without corresponding "
37497 else
37499 }
37501 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37502 expression and optional initializer clause of
37503 #pragma omp declare reduction. We store the expression(s) as
37504 either 3, 6 or 7 special statements inside of the artificial function's
37505 body. The first two statements are DECL_EXPRs for the artificial
37506 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37507 expression that uses those variables.
37508 If there was any INITIALIZER clause, this is followed by further statements,
37509 the fourth and fifth statements are DECL_EXPRs for the artificial
37510 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37511 constructor variant (first token after open paren is not omp_priv),
37512 then the sixth statement is a statement with the function call expression
37513 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37514 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37515 to initialize the OMP_PRIV artificial variable and there is seventh
37516 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37518 static bool
37520 {
37532 tree combiner;
37547 {
37550 }
37553 {
37555 matching_parens parens;
37561 {
37564 }
37580 {
37584 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37588 == CPP_CLOSE_PAREN
37591 {
37595 }
37600 }
37601 else
37602 {
37618 {
37623 }
37625 tree arg;
37638 }
37649 }
37653 UNKNOWN_LOCATION);
37656 }
37658 /* OpenMP 4.0
37659 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37660 initializer-clause[opt] new-line
37662 initializer-clause:
37663 initializer (omp_priv initializer)
37664 initializer (function-name (argument-list)) */
37666 static void
37669 {
37679 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37686 {
37718 }
37730 /* Types may not be defined in declare reduction type list. */
37733 parser->type_definition_forbidden_message
37739 saved_colon_doesnt_start_class_def_p
37744 {
37748 ;
37767 else
37772 else
37774 }
37776 /* Restore the saved message. */
37779 parser->colon_doesnt_start_class_def_p
37784 {
37785 fail:
37788 }
37794 {
37795 tree fntype
37798 NULL_TREE);
37818 {
37823 }
37825 {
37827 {
37836 }
37843 }
37844 else
37845 {
37848 }
37851 else
37854 {
37857 }
37859 {
37862 else
37867 }
37872 else
37873 {
37882 }
37889 }
37893 done:
37894 /* Free any declarators allocated. */
37896 }
37898 /* OpenMP 4.0
37899 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37900 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37901 initializer-clause[opt] new-line
37902 #pragma omp declare target new-line */
37904 static bool
37907 {
37909 {
37914 {
37917 context);
37919 }
37922 {
37925 context);
37927 }
37929 {
37932 }
37934 {
37938 }
37939 }
37944 }
37946 /* OpenMP 4.5:
37947 #pragma omp taskloop taskloop-clause[optseq] new-line
37948 for-loop
37950 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37951 for-loop */
37953 #define OMP_TASKLOOP_CLAUSE_MASK \
37954 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37955 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37969 static tree
37973 {
37982 {
37987 {
38011 }
38012 }
38014 {
38017 }
38022 {
38025 }
38031 if_p);
38037 }
38040 /* OpenACC 2.0:
38041 # pragma acc routine oacc-routine-clause[optseq] new-line
38042 function-definition
38044 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
38045 */
38047 #define OACC_ROUTINE_CLAUSE_MASK \
38048 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
38054 /* Parse the OpenACC routine pragma. This has an optional '( name )'
38055 component, which must resolve to a declared namespace-scope
38056 function. The clauses are either processed directly (for a named
38057 function), or defered until the immediatley following declaration
38058 is parsed. */
38060 static void
38063 {
38065 /* The checking for "another pragma following this one" in the "no optional
38066 '( name )'" case makes sure that we dont re-enter. */
38069 cp_oacc_routine_data data;
38075 /* It is safe to take the address of a local variable; it will only be
38076 used while this scope is live. */
38079 /* Look for optional '( name )'. */
38081 {
38082 matching_parens parens;
38085 /* We parse the name as an id-expression. If it resolves to
38086 anything other than a non-overloaded function at namespace
38087 scope, it's an error. */
38103 {
38107 }
38109 data.clauses
38117 {
38122 }
38124 /* Perhaps we should use the same rule as declarations in different
38125 namespaces? */
38127 {
38132 }
38135 {
38139 }
38143 }
38145 {
38146 /* Store away all pragma tokens. */
38157 /* Emit a helpful diagnostic if there's another pragma following this
38158 one. */
38160 {
38163 /* ..., and then just keep going. */
38165 }
38167 /* We only have to consider the pragma_external case here. */
38172 else
38175 }
38176 }
38178 /* Finalize #pragma acc routine clauses after direct declarator has
38179 been parsed. */
38181 static tree
38183 {
38188 {
38190 "%<#pragma acc routine%> not immediately followed by "
38193 }
38210 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38211 fndecl_seen. */
38214 }
38216 /* Apply any saved OpenACC routine clauses to a just-parsed
38217 declaration. */
38219 static void
38221 {
38223 {
38224 /* Keep going if we're in error reporting mode. */
38230 {
38232 "%<#pragma acc routine%> not immediately followed by"
38236 }
38238 {
38241 }
38244 {
38249 }
38252 {
38260 }
38262 /* Process the routine's dimension clauses. */
38266 /* Add an "omp declare target" attribute. */
38271 /* Don't unset parser->oacc_routine here: we may still need it to
38272 diagnose wrong usage. But, remember that we've used this "#pragma acc
38273 routine". */
38275 }
38276 }
38278 /* Main entry point to OpenMP statement pragmas. */
38280 static void
38282 {
38283 tree stmt;
38288 {
38311 if_p);
38316 if_p);
38333 if_p);
38338 if_p);
38346 if_p);
38355 if_p);
38369 if_p);
38374 if_p);
38378 }
38381 }
38382 \f
38383 /* Transactional Memory parsing routines. */
38385 /* Parse a transaction attribute.
38387 txn-attribute:
38388 attribute
38389 [ [ identifier ] ]
38391 We use this instead of cp_parser_attributes_opt for transactions to avoid
38392 the pedwarn in C++98 mode. */
38394 static tree
38396 {
38411 {
38415 /* For keywords, use the canonical spelling,
38416 not the parsed identifier. */
38420 }
38421 else
38425 error1:
38428 }
38430 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38432 transaction-statement:
38433 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38434 compound-statement
38435 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38436 */
38438 static tree
38440 {
38451 else
38452 {
38456 }
38458 /* Parse a noexcept specification. */
38462 {
38463 /* cancel-and-throw is unimplemented. */
38466 }
38467 else
38470 /* Keep track if we're in the lexical scope of an outer transaction. */
38482 }
38484 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38486 transaction-expression:
38487 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38488 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38489 */
38491 static tree
38493 {
38506 keyword == RID_TRANSACTION_RELAXED
38520 /* Set this early. This might mean that we allow transaction_cancel in
38521 an expression that we find out later actually has to be a constexpr.
38522 However, we expect that cxx_constant_value will be able to deal with
38523 this; also, if the noexcept has no constexpr, then what we parse next
38524 really is a transaction's body. */
38527 /* Parse a noexcept specification. */
38533 {
38534 matching_parens parens;
38541 }
38542 else
38543 {
38544 /* The only expression that is available got parsed for the noexcept
38545 already. noexcept is true then. */
38548 }
38557 }
38559 /* Parse a function-transaction-block.
38561 function-transaction-block:
38562 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38563 function-body
38564 __transaction_atomic txn-attribute[opt] function-try-block
38565 __transaction_relaxed ctor-initializer[opt] function-body
38566 __transaction_relaxed function-try-block
38567 */
38569 static void
38571 {
38586 else
38587 {
38591 }
38599 else
38600 cp_parser_ctor_initializer_opt_and_function_body
38606 }
38608 /* Parse a __transaction_cancel statement.
38610 cancel-statement:
38611 __transaction_cancel txn-attribute[opt] ;
38612 __transaction_cancel txn-attribute[opt] throw-expression ;
38614 ??? Cancel and throw is not yet implemented. */
38616 static tree
38618 {
38624 RT_TRANSACTION_CANCEL);
38631 /* ??? Parse cancel-and-throw here. */
38636 {
38640 }
38642 {
38646 }
38648 {
38651 {
38657 }
38658 }
38660 {
38664 }
38670 }
38671 \f
38672 /* The parser. */
38676 \f
38677 /* Special handling for the first token or line in the file. The first
38678 thing in the file might be #pragma GCC pch_preprocess, which loads a
38679 PCH file, which is a GC collection point. So we need to handle this
38680 first pragma without benefit of an existing lexer structure.
38682 Always returns one token to the caller in *FIRST_TOKEN. This is
38683 either the true first token of the file, or the first token after
38684 the initial pragma. */
38686 static void
38688 {
38697 {
38704 }
38705 else
38708 /* Skip to the end of the pragma. */
38712 /* Now actually load the PCH file. */
38716 /* Read one more token to return to our caller. We have to do this
38717 after reading the PCH file in, since its pointers have to be
38718 live. */
38720 }
38722 /* Parse a pragma GCC ivdep. */
38724 static bool
38726 {
38729 }
38731 /* Parse a pragma GCC unroll. */
38733 static unsigned short
38735 {
38745 {
38747 " assignment-expression that evaluates to a non-negative"
38750 }
38751 else
38752 {
38756 }
38759 }
38761 /* Normal parsing of a pragma token. Here we can (and must) use the
38762 regular lexer. */
38764 static bool
38766 {
38769 tree stmt;
38780 {
38788 {
38798 }
38803 {
38813 }
38818 {
38829 }
38834 {
38845 }
38850 {
38861 }
38881 {
38886 }
38894 {
38899 }
38907 {
38911 }
38917 {
38922 }
38930 {
38935 }
38990 "%<#pragma omp section%> may only be used in "
38995 {
38997 {
39001 }
39007 {
39011 }
39012 else
39018 {
39021 }
39024 }
39027 {
39029 {
39033 }
39034 const unsigned short unroll
39040 {
39044 }
39045 else
39051 {
39054 }
39057 }
39064 bad_stmt:
39067 }
39071 }
39073 /* The interface the pragma parsers have to the lexer. */
39075 enum cpp_ttype
39077 {
39089 else
39090 {
39094 }
39097 }
39099 \f
39100 /* External interface. */
39102 /* Parse one entire translation unit. */
39104 void
39106 {
39119 }
39121 /* Create an identifier for a generic parameter type (a synthesized
39122 template parameter implied by `auto' or a concept identifier). */
39125 static tree
39127 {
39131 }
39133 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39134 (creating a new template parameter list if necessary). Returns the newly
39135 created template type parm. */
39137 static tree
39139 {
39142 /* Before committing to modifying any scope, if we're in an
39143 implicit template scope, and we're trying to synthesize a
39144 constrained parameter, try to find a previous parameter with
39145 the same name. This is the same-type rule for abbreviated
39146 function templates.
39148 NOTE: We can generate implicit parameters when tentatively
39149 parsing a nested name specifier, only to reject that parse
39150 later. However, matching the same template-id as part of a
39151 direct-declarator should generate an identical template
39152 parameter, so this rule will merge them. */
39154 {
39157 {
39159 {
39162 /* Return the TEMPLATE_PARM_INDEX. */
39165 }
39167 }
39168 }
39170 /* We are either continuing a function template that already contains implicit
39171 template parameters, creating a new fully-implicit function template, or
39172 extending an existing explicit function template with implicit template
39173 parameters. */
39181 {
39185 }
39186 else
39187 {
39188 /* Roll back to the existing template parameter scope (in the case of
39189 extending an explicit function template) or introduce a new template
39190 parameter scope ahead of the function parameter scope (or class scope
39191 in the case of out-of-line member definitions). The function scope is
39192 added back after template parameter synthesis below. */
39197 {
39200 }
39202 {
39203 /* If not defining a class, then any class scope is a scope level in
39204 an out-of-line member definition. In this case simply wind back
39205 beyond the first such scope to inject the template parameter list.
39206 Otherwise wind back to the class being defined. The latter can
39207 occur in class member friend declarations such as:
39209 class A {
39210 void foo (auto);
39211 };
39212 class B {
39213 friend void A::foo (auto);
39214 };
39216 The template parameter list synthesized for the friend declaration
39217 must be injected in the scope of 'B'. This can also occur in
39218 erroneous cases such as:
39220 struct A {
39221 struct B {
39222 void foo (auto);
39223 };
39224 void B::foo (auto) {}
39225 };
39227 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39228 but, nevertheless, the template parameter list synthesized for the
39229 declarator should be injected into the scope of 'A' as if the
39230 ill-formed template was specified explicitly. */
39233 {
39236 }
39237 }
39243 {
39244 /* Introduce a new template parameter list for implicit template
39245 parameters. */
39249 parser->implicit_template_scope
39256 }
39257 else
39258 {
39259 /* Synthesize implicit template parameters at the end of the explicit
39260 template parameter list. */
39267 parser->implicit_template_parms
39269 }
39270 }
39272 /* Synthesize a new template parameter and track the current template
39273 parameter chain with implicit_template_parms. */
39277 tree synth_tmpl_parm;
39281 synth_tmpl_parm
39284 synth_tmpl_parm
39286 else
39287 {
39291 }
39293 // Attach the constraint to the parm before processing.
39296 tree new_parm
39298 input_location,
39299 node,
39303 // Chain the new parameter to the list of implicit parameters.
39305 parser->implicit_template_parms
39307 else
39312 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39315 /* If creating a fully implicit function template, start the new implicit
39316 template parameter list with this synthesized type, otherwise grow the
39317 current template parameter list. */
39320 {
39327 }
39328 else
39329 {
39334 }
39336 // If the new parameter was constrained, we need to add that to the
39337 // constraints in the template parameter list.
39339 {
39343 }
39348 }
39350 /* Finish the declaration of a fully implicit function template. Such a
39351 template has no explicit template parameter list so has not been through the
39352 normal template head and tail processing. synthesize_implicit_template_parm
39353 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39354 provided if the declaration is a class member such that its template
39355 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39356 form is returned. Otherwise NULL_TREE is returned. */
39358 static tree
39360 {
39365 {
39369 }
39381 }
39383 /* Like finish_fully_implicit_template, but to be used in error
39384 recovery, rearranging scopes so that we restore the state we had
39385 before synthesize_implicit_template_parm inserted the implement
39386 template parms scope. */
39388 static void
39390 {
39395 {
39404 }
39405 else
39411 }
39413 /* Helper function for diagnostics that have complained about things
39414 being used with 'extern "C"' linkage.
39416 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39418 void
39420 {
39424 }