| blob | 8b1b271b53d17205e547299bdc4074fb590354ef |
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 }
2867 }
2874 {
2875 /* Potentially supply a fix-it hint, suggesting to add the
2876 missing token immediately after the *previous* token.
2877 This may move the primary location within richloc. */
2879 location_t prev_token_loc
2883 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2884 Attempt to consolidate diagnostics by printing it as a
2885 secondary range within the main diagnostic. */
2887 added_matching_location
2889 }
2891 /* Actually emit the error. */
2893 /* Because c_parser_error does not understand
2894 CPP_KEYWORD, keywords are treated like
2895 identifiers. */
2900 {
2901 /* If we weren't able to consolidate matching_location, then
2902 print it as a secondary diagnostic. */
2907 }
2908 }
2910 /* If not parsing tentatively, issue a diagnostic of the form
2911 FILE:LINE: MESSAGE before TOKEN
2912 where TOKEN is the next token in the input stream. MESSAGE
2913 (specified by the caller) is usually of the form "expected
2914 OTHER-TOKEN". */
2916 static void
2918 {
2921 }
2923 /* Issue an error about name-lookup failing. NAME is the
2924 IDENTIFIER_NODE DECL is the result of
2925 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2926 the thing that we hoped to find. */
2928 static void
2930 tree name,
2931 tree decl,
2932 name_lookup_error desired,
2933 location_t location)
2934 {
2935 /* If name lookup completely failed, tell the user that NAME was not
2936 declared. */
2938 {
2951 else
2953 }
2955 {
2957 {
2974 }
2975 }
2977 {
2979 {
2989 name);
2993 }
2994 }
2995 else
2996 {
2998 {
3011 }
3012 }
3013 }
3015 /* If we are parsing tentatively, remember that an error has occurred
3016 during this tentative parse. Returns true if the error was
3017 simulated; false if a message should be issued by the caller. */
3019 static bool
3021 {
3023 {
3026 }
3028 }
3030 /* This function is called when a type is defined. If type
3031 definitions are forbidden at this point, an error message is
3032 issued. */
3034 static bool
3036 {
3037 /* If types are forbidden here, issue a message. */
3039 {
3040 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3041 in the message need to be interpreted. */
3044 }
3046 }
3048 /* This function is called when the DECLARATOR is processed. The TYPE
3049 was a type defined in the decl-specifiers. If it is invalid to
3050 define a type in the decl-specifiers for DECLARATOR, an error is
3051 issued. TYPE_LOCATION is the location of TYPE and is used
3052 for error reporting. */
3054 static void
3057 {
3058 /* [dcl.fct] forbids type definitions in return types.
3059 Unfortunately, it's not easy to know whether or not we are
3060 processing a return type until after the fact. */
3068 {
3073 type);
3074 }
3075 }
3077 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3078 "<" in any valid C++ program. If the next token is indeed "<",
3079 issue a message warning the user about what appears to be an
3080 invalid attempt to form a template-id. LOCATION is the location
3081 of the type-specifier (TYPE) */
3083 static void
3085 tree type,
3087 location_t location)
3088 {
3092 {
3098 {
3101 else
3103 }
3104 else
3106 /* Remember the location of the invalid "<". */
3109 /* Consume the "<". */
3111 /* Parse the template arguments. */
3113 /* Permanently remove the invalid template arguments so that
3114 this error message is not issued again. */
3117 }
3118 }
3120 /* If parsing an integral constant-expression, issue an error message
3121 about the fact that THING appeared and return true. Otherwise,
3122 return false. In either case, set
3123 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3125 static bool
3127 non_integral_constant thing)
3128 {
3131 {
3133 {
3136 {
3139 "ISO C++ forbids using a floating-point literal "
3144 "enumeration type cannot appear in a "
3235 }
3239 }
3240 }
3242 }
3244 /* Emit a diagnostic for an invalid type name. This function commits
3245 to the current active tentative parse, if any. (Otherwise, the
3246 problematic construct might be encountered again later, resulting
3247 in duplicate error messages.) LOCATION is the location of ID. */
3249 static void
3251 location_t location)
3252 {
3255 /* Try to lookup the identifier. */
3262 /* If the lookup was ambiguous, an error will already have
3263 been issued. */
3265 /* If the lookup found a template-name, it means that the user forgot
3266 to specify an argument list. Emit a useful error message. */
3268 {
3271 decl);
3276 }
3280 /* Something like 'unsigned A a;' */
3283 {
3284 /* Issue an error message. */
3285 name_hint hint;
3289 {
3295 }
3296 else
3298 /* If we're in a template class, it's possible that the user was
3299 referring to a type from a base class. For example:
3301 template <typename T> struct A { typedef T X; };
3302 template <typename T> struct B : public A<T> { X x; };
3304 The user should have said "typename A<T>::X". */
3320 {
3321 tree b;
3324 b;
3326 {
3330 {
3331 tree field;
3332 /* Go from a particular instantiation of the
3333 template (which will have an empty TYPE_FIELDs),
3334 to the main version. */
3337 field;
3341 {
3346 }
3349 }
3350 }
3351 }
3352 }
3353 /* Here we diagnose qualified-ids where the scope is actually correct,
3354 but the identifier does not resolve to a valid type name. */
3356 {
3358 {
3367 else
3376 }
3379 {
3380 /* A<T>::A<T>() */
3386 }
3389 {
3392 "need %<typename%> before %<%T::%D::%E%> because "
3396 id,
3399 else
3403 }
3405 {
3417 else
3423 }
3424 else
3426 }
3427 }
3429 /* Check for a common situation where a type-name should be present,
3430 but is not, and issue a sensible error message. Returns true if an
3431 invalid type-name was detected.
3433 The situation handled by this function are variable declarations of the
3434 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3435 Usually, `ID' should name a type, but if we got here it means that it
3436 does not. We try to emit the best possible error message depending on
3437 how exactly the id-expression looks like. */
3439 static bool
3441 {
3442 tree id;
3445 /* Avoid duplicate error about ambiguous lookup. */
3447 {
3451 }
3460 /* If the next token is a (, this is a function with no explicit return
3461 type, i.e. constructor, destructor or conversion op. */
3464 {
3467 }
3471 /* Emit a diagnostic for the invalid type. */
3473 out:
3474 /* If we aren't in the middle of a declarator (i.e. in a
3475 parameter-declaration-clause), skip to the end of the declaration;
3476 there's no point in trying to process it. */
3480 }
3482 /* Consume tokens up to, and including, the next non-nested closing `)'.
3483 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3484 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3485 found an unnested token of that type. */
3487 static int
3490 cpp_ttype or_ttype,
3492 {
3502 {
3505 /* Have we found what we're looking for before the closing paren? */
3511 {
3514 /* If we've run out of tokens, then there is no closing `)'. */
3517 /* This is good for lambda expression capture-lists. */
3527 /* This matches the processing in skip_to_end_of_statement. */
3547 {
3551 }
3556 }
3558 /* Consume the token. */
3560 }
3561 }
3563 /* Consume tokens up to, and including, the next non-nested closing `)'.
3564 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3565 are doing error recovery. Returns -1 if OR_COMMA is true and we
3566 found an unnested token of that type. */
3568 static int
3573 {
3577 }
3579 /* Consume tokens until we reach the end of the current statement.
3580 Normally, that will be just before consuming a `;'. However, if a
3581 non-nested `}' comes first, then we stop before consuming that. */
3583 static void
3585 {
3588 /* Unwind generic function template scope if necessary. */
3593 {
3597 {
3600 /* If we've run out of tokens, stop. */
3604 /* If the next token is a `;', we have reached the end of the
3605 statement. */
3611 /* If this is a non-nested '}', stop before consuming it.
3612 That way, when confronted with something like:
3614 { 3 + }
3616 we stop before consuming the closing '}', even though we
3617 have not yet reached a `;'. */
3621 /* If it is the closing '}' for a block that we have
3622 scanned, stop -- but only after consuming the token.
3623 That way given:
3625 void f g () { ... }
3626 typedef int I;
3628 we will stop after the body of the erroneously declared
3629 function, but before consuming the following `typedef'
3630 declaration. */
3632 {
3635 }
3644 }
3646 /* Consume the token. */
3648 }
3649 }
3651 /* This function is called at the end of a statement or declaration.
3652 If the next token is a semicolon, it is consumed; otherwise, error
3653 recovery is attempted. */
3655 static void
3657 {
3658 /* Look for the trailing `;'. */
3660 {
3661 /* If there is additional (erroneous) input, skip to the end of
3662 the statement. */
3664 /* If the next token is now a `;', consume it. */
3667 }
3668 }
3670 /* Skip tokens until we have consumed an entire block, or until we
3671 have consumed a non-nested `;'. */
3673 static void
3675 {
3678 /* Unwind generic function template scope if necessary. */
3683 {
3687 {
3690 /* If we've run out of tokens, stop. */
3694 /* Stop if this is an unnested ';'. */
3700 /* Stop if this is an unnested '}', or closes the outermost
3701 nesting level. */
3702 nesting_depth--;
3710 /* Nest. */
3711 nesting_depth++;
3716 }
3718 /* Consume the token. */
3720 }
3721 }
3723 /* Skip tokens until a non-nested closing curly brace is the next
3724 token, or there are no more tokens. Return true in the first case,
3725 false otherwise. */
3727 static bool
3729 {
3733 {
3737 {
3740 /* If we've run out of tokens, stop. */
3744 /* If the next token is a non-nested `}', then we have reached
3745 the end of the current block. */
3751 /* If it the next token is a `{', then we are entering a new
3752 block. Consume the entire block. */
3758 }
3760 /* Consume the token. */
3762 }
3763 }
3765 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3766 parameter is the PRAGMA token, allowing us to purge the entire pragma
3767 sequence. */
3769 static void
3771 {
3776 do
3780 /* Ensure that the pragma is not parsed again. */
3782 }
3784 /* Require pragma end of line, resyncing with it as necessary. The
3785 arguments are as for cp_parser_skip_to_pragma_eol. */
3787 static void
3789 {
3793 }
3795 /* This is a simple wrapper around make_typename_type. When the id is
3796 an unresolved identifier node, we can provide a superior diagnostic
3797 using cp_parser_diagnose_invalid_type_name. */
3799 static tree
3801 location_t id_location)
3802 {
3803 tree result;
3805 {
3811 }
3813 }
3815 /* This is a wrapper around the
3816 make_{pointer,ptrmem,reference}_declarator functions that decides
3817 which one to call based on the CODE and CLASS_TYPE arguments. The
3818 CODE argument should be one of the values returned by
3819 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3820 appertain to the pointer or reference. */
3824 cp_cv_quals cv_qualifiers,
3826 tree attributes)
3827 {
3834 else
3844 }
3846 /* Create a new C++ parser. */
3850 {
3855 /* cp_lexer_new_main is called before doing GC allocation because
3856 cp_lexer_new_main might load a PCH file. */
3859 /* Initialize the binops_by_token so that we can get the tree
3860 directly from the token. */
3868 /* For now, we always accept GNU extensions. */
3871 /* The `>' token is a greater-than operator, not the end of a
3872 template-id. */
3877 /* We are not parsing a constant-expression. */
3882 /* Local variable names are not forbidden. */
3885 /* We are not processing an `extern "C"' declaration. */
3888 /* We are not processing a declarator. */
3891 /* We are not processing a template-argument-list. */
3894 /* We are not in an iteration statement. */
3897 /* We are not in a switch statement. */
3900 /* We are not parsing a type-id inside an expression. */
3903 /* Declarations aren't implicitly extern "C". */
3906 /* String literals should be translated to the execution character set. */
3909 /* We are not parsing a function body. */
3912 /* We can correct until told otherwise. */
3915 /* The unparsed function queue is empty. */
3918 /* There are no classes being defined. */
3921 /* No template parameters apply. */
3924 /* Special parsing data structures. */
3928 /* Not declaring an implicit function template. */
3934 /* Allow constrained-type-specifiers. */
3937 /* We haven't yet seen an 'extern "C"'. */
3941 }
3943 /* Create a cp_lexer structure which will emit the tokens in CACHE
3944 and push it onto the parser's lexer stack. This is used for delayed
3945 parsing of in-class method bodies and default arguments, and should
3946 not be confused with tentative parsing. */
3947 static void
3949 {
3954 /* Move the current source position to that of the first token in the
3955 new lexer. */
3957 }
3959 /* Pop the top lexer off the parser stack. This is never used for the
3960 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3961 static void
3963 {
3968 /* Put the current source position back where it was before this
3969 lexer was pushed. */
3971 }
3973 /* Lexical conventions [gram.lex] */
3975 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3976 identifier. */
3978 static cp_expr
3980 {
3983 /* Look for the identifier. */
3985 /* Return the value. */
3988 else
3990 }
3992 /* Parse a sequence of adjacent string constants. Returns a
3993 TREE_STRING representing the combined, nul-terminated string
3994 constant. If TRANSLATE is true, translate the string to the
3995 execution character set. If WIDE_OK is true, a wide string is
3996 invalid here.
3998 C++98 [lex.string] says that if a narrow string literal token is
3999 adjacent to a wide string literal token, the behavior is undefined.
4000 However, C99 6.4.5p4 says that this results in a wide string literal.
4001 We follow C99 here, for consistency with the C front end.
4003 This code is largely lifted from lex_string() in c-lex.c.
4005 FUTURE: ObjC++ will need to handle @-strings here. */
4006 static cp_expr
4009 {
4010 tree value;
4017 tree string_tree;
4023 {
4026 }
4031 {
4035 }
4036 else
4037 {
4040 }
4043 /* Try to avoid the overhead of creating and destroying an obstack
4044 for the common case of just one string. */
4047 {
4055 {
4059 }
4060 else
4064 }
4065 else
4066 {
4071 do
4072 {
4074 count++;
4079 {
4082 {
4085 }
4088 {
4093 }
4095 }
4096 else
4100 {
4104 {
4108 "unsupported non-standard concatenation "
4110 }
4111 }
4119 {
4123 }
4124 else
4125 {
4129 }
4130 }
4133 /* A string literal built by concatenation has its caret=start at
4134 the start of the initial string, and its finish at the finish of
4135 the final string literal. */
4139 }
4142 {
4145 }
4149 {
4154 {
4169 }
4174 {
4179 else
4181 }
4182 }
4183 else
4184 /* cpp_interpret_string has issued an error. */
4191 }
4193 /* Look up a literal operator with the name and the exact arguments. */
4195 static tree
4197 {
4198 tree decl;
4204 {
4210 {
4213 {
4223 }
4226 /* May be this should be sufficient_parms_p instead,
4227 depending on how exactly should user-defined literals
4228 work in presence of default arguments on the literal
4229 operator parameters. */
4232 }
4233 }
4236 }
4238 /* Parse a user-defined char constant. Returns a call to a user-defined
4239 literal operator taking the character as an argument. */
4241 static cp_expr
4243 {
4251 /* Build up a call to the user-defined operator */
4252 /* Lookup the name we got back from the id-expression. */
4257 {
4262 }
4266 }
4268 /* A subroutine of cp_parser_userdef_numeric_literal to
4269 create a char... template parameter pack from a string node. */
4271 static tree
4273 {
4274 tree charvec;
4280 /* Fill in CHARVEC with all of the parameters. */
4285 /* Build the argument packs. */
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;
4310 /* First template parm is character type. */
4313 /* Fill in CHARVEC with all of the parameters. */
4320 /* Build the argument packs. */
4326 }
4328 /* Parse a user-defined numeric constant. returns a call to a user-defined
4329 literal operator. */
4331 static cp_expr
4333 {
4344 /* Look for a literal operator taking the exact type of numeric argument
4345 as the literal value. */
4350 {
4352 tf_warning_or_error);
4355 {
4358 long_long_unsigned_type_node);
4359 }
4360 else
4361 {
4365 long_double_type_node);
4369 }
4373 }
4376 /* If the numeric argument didn't work, look for a raw literal
4377 operator taking a const char* argument consisting of the number
4378 in string format. */
4383 {
4385 tf_warning_or_error);
4388 }
4391 /* If the raw literal didn't work, look for a non-type template
4392 function with parameter pack char.... Call the function with
4393 template parameter characters representing the number. */
4397 {
4401 tf_warning_or_error);
4404 }
4408 /* In C++14 the standard library defines complex number suffixes that
4409 conflict with GNU extensions. Prefer them if <complex> is #included. */
4419 {
4424 {
4425 /* No <complex>, so pedwarn and use GNU semantics. */
4428 }
4429 }
4431 bool complained
4438 {
4440 "(from <complex>) to enable the C++14 user-defined literal "
4445 }
4452 else
4453 {
4454 /* Use the built-in semantics. */
4455 tree type;
4457 {
4460 else
4462 }
4471 }
4474 /* Avoid repeated diagnostics. */
4477 }
4479 /* Parse a user-defined string constant. Returns a call to a user-defined
4480 literal operator taking a character pointer and the length of the string
4481 as arguments. */
4483 static tree
4485 {
4494 /* Build up a call to the user-defined operator. */
4495 /* Lookup the name we got back from the id-expression. */
4502 {
4504 tf_warning_or_error);
4507 }
4510 /* Look for a template function with typename parameter CharT
4511 and parameter pack CharT... Call the function with
4512 template parameter characters representing the string. */
4516 {
4520 tf_warning_or_error);
4523 }
4529 }
4532 /* Basic concepts [gram.basic] */
4534 /* Parse a translation-unit.
4536 translation-unit:
4537 declaration-seq [opt]
4539 Returns TRUE if all went well. */
4541 static bool
4543 {
4544 /* The address of the first non-permanent object on the declarator
4545 obstack. */
4550 /* Create the declarator obstack, if necessary. */
4552 {
4554 /* Create the error declarator. */
4556 /* Create the empty parameter list. */
4558 UNKNOWN_LOCATION);
4559 /* Remember where the base of the declarator obstack lies. */
4561 }
4565 /* If there are no tokens left then all went well. */
4567 {
4568 /* Get rid of the token array; we don't need it any more. */
4572 /* This file might have been a context that's implicitly extern
4573 "C". If so, pop the lang context. (Only relevant for PCH.) */
4575 {
4578 }
4580 /* Finish up. */
4584 }
4585 else
4586 {
4589 }
4591 /* Make sure the declarator obstack was fully cleaned up. */
4595 /* All went well. */
4597 }
4599 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4600 decltype context. */
4604 {
4609 }
4611 /* We're about to parse a collection of statements. If we're currently
4612 parsing tentatively, set up a firewall so that any nested
4613 cp_parser_commit_to_tentative_parse won't affect the current context. */
4615 static cp_token_position
4617 {
4624 }
4626 /* We've finished parsing the collection of statements. Wrap up the
4627 firewall and replace the relevant tokens with the parsed form. */
4629 static void
4631 tree expr)
4632 {
4636 /* Finish the firewall level. */
4638 /* And remember the result of the parse for when we try again. */
4644 }
4646 /* Like the above functions, but let the user modify the tokens. Used by
4647 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4648 later parses, so it makes sense to localize the effects of
4649 cp_parser_commit_to_tentative_parse. */
4651 struct tentative_firewall
4652 {
4657 {
4658 /* If we're currently parsing tentatively, start a committed level as a
4659 firewall and then an inner tentative parse. */
4661 {
4665 }
4666 }
4669 {
4671 {
4672 /* Finish the inner tentative parse and the firewall, propagating any
4673 uncommitted error state to the outer tentative parse. */
4679 }
4680 }
4681 };
4683 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4684 This class is for tracking such a matching pair of symbols.
4685 In particular, it tracks the location of the first token,
4686 so that if the second token is missing, we can highlight the
4687 location of the first token when notifying the user about the
4688 problem. */
4691 class token_pair
4692 {
4694 /* token_pair's ctor. */
4697 /* If the next token is the opening symbol for this pair, consume it and
4698 return true.
4699 Otherwise, issue an error and return false.
4700 In either case, record the location of the opening token. */
4703 {
4707 }
4709 /* Consume the next token from PARSER, recording its location as
4710 that of the opening token within the pair. */
4713 {
4718 }
4720 /* If the next token is the closing symbol for this pair, consume it
4721 and return it.
4722 Otherwise, issue an error, highlighting the location of the
4723 corresponding opening token, and return NULL. */
4726 {
4729 m_open_loc);
4730 }
4733 location_t m_open_loc;
4734 };
4736 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4738 struct matching_paren_traits
4739 {
4744 };
4746 /* "matching_parens" is a token_pair<T> class for tracking matching
4747 pairs of parentheses. */
4751 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4753 struct matching_brace_traits
4754 {
4759 };
4761 /* "matching_braces" is a token_pair<T> class for tracking matching
4762 pairs of braces. */
4767 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4768 enclosing parentheses. */
4770 static cp_expr
4772 {
4775 /* Consume the '('. */
4777 matching_parens parens;
4779 /* Start the statement-expression. */
4781 /* Parse the compound-statement. */
4783 /* Finish up. */
4785 /* Consume the ')'. */
4793 }
4795 /* Expressions [gram.expr] */
4797 /* Parse a fold-operator.
4799 fold-operator:
4800 - * / % ^ & | = < > << >>
4801 = -= *= /= %= ^= &= |= <<= >>=
4802 == != <= >= && || , .* ->*
4804 This returns the tree code corresponding to the matched operator
4805 as an int. When the current token matches a compound assignment
4806 opertor, the resulting tree code is the negative value of the
4807 non-assignment operator. */
4809 static int
4811 {
4813 {
4853 }
4854 }
4856 /* Returns true if CODE indicates a binary expression, which is not allowed in
4857 the LHS of a fold-expression. More codes will need to be added to use this
4858 function in other contexts. */
4860 static bool
4862 {
4864 {
4897 }
4898 }
4900 /* If the next token is a suitable fold operator, consume it and return as
4901 the function above. */
4903 static int
4905 {
4911 }
4913 /* Parse a fold-expression.
4915 fold-expression:
4916 ( ... folding-operator cast-expression)
4917 ( cast-expression folding-operator ... )
4918 ( cast-expression folding operator ... folding-operator cast-expression)
4920 Note that the '(' and ')' are matched in primary expression. */
4922 static cp_expr
4924 {
4925 cp_id_kind pidk;
4927 // Left fold.
4929 {
4933 {
4936 }
4943 }
4948 {
4951 }
4954 {
4957 }
4960 /* The operands of a fold-expression are cast-expressions, so binary or
4961 conditional expressions are not allowed. We check this here to avoid
4962 tentative parsing. */
4974 // Right fold.
4979 {
4982 }
4985 // Binary left or right fold.
4990 }
4992 /* Parse a primary-expression.
4994 primary-expression:
4995 literal
4996 this
4997 ( expression )
4998 id-expression
4999 lambda-expression (C++11)
5001 GNU Extensions:
5003 primary-expression:
5004 ( compound-statement )
5005 __builtin_va_arg ( assignment-expression , type-id )
5006 __builtin_offsetof ( type-id , offsetof-expression )
5008 C++ Extensions:
5009 __has_nothrow_assign ( type-id )
5010 __has_nothrow_constructor ( type-id )
5011 __has_nothrow_copy ( type-id )
5012 __has_trivial_assign ( type-id )
5013 __has_trivial_constructor ( type-id )
5014 __has_trivial_copy ( type-id )
5015 __has_trivial_destructor ( type-id )
5016 __has_virtual_destructor ( type-id )
5017 __is_abstract ( type-id )
5018 __is_base_of ( type-id , type-id )
5019 __is_class ( type-id )
5020 __is_empty ( type-id )
5021 __is_enum ( type-id )
5022 __is_final ( type-id )
5023 __is_literal_type ( type-id )
5024 __is_pod ( type-id )
5025 __is_polymorphic ( type-id )
5026 __is_std_layout ( type-id )
5027 __is_trivial ( type-id )
5028 __is_union ( type-id )
5030 Objective-C++ Extension:
5032 primary-expression:
5033 objc-expression
5035 literal:
5036 __null
5038 ADDRESS_P is true iff this expression was immediately preceded by
5039 "&" and therefore might denote a pointer-to-member. CAST_P is true
5040 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5041 true iff this expression is a template argument.
5043 Returns a representation of the expression. Upon return, *IDK
5044 indicates what kind of id-expression (if any) was present. */
5046 static cp_expr
5053 {
5056 /* Assume the primary expression is not an id-expression. */
5059 /* Peek at the next token. */
5062 {
5063 /* literal:
5064 integer-literal
5065 character-literal
5066 floating-literal
5067 string-literal
5068 boolean-literal
5069 pointer-literal
5070 user-defined-literal */
5082 {
5086 }
5087 /* Floating-point literals are only allowed in an integral
5088 constant expression if they are cast to an integral or
5089 enumeration type. */
5093 {
5094 /* CAST_P will be set even in invalid code like "int(2.7 +
5095 ...)". Therefore, we have to check that the next token
5096 is sure to end the cast. */
5098 {
5103 enumerator-definition. */
5105 /* The curly brace at the end of an enum-specifier. */
5107 /* The end of a statement. */
5109 /* The end of the cast-expression. */
5111 /* The end of an array bound. */
5113 /* The closing ">" in a template-argument-list. */
5116 /* C++0x only: A ">>" treated like two ">" tokens,
5117 in a template-argument-list. */
5122 }
5124 /* If we are within a cast, then the constraint that the
5125 cast is to an integral or enumeration type will be
5126 checked at that point. If we are not within a cast, then
5127 this code is invalid. */
5130 }
5150 /* ??? Should wide strings be allowed when parser->translate_strings_p
5151 is false (i.e. in attributes)? If not, we can kill the third
5152 argument to cp_parser_string_literal. */
5158 /* If we see `( { ' then we are looking at the beginning of
5159 a GNU statement-expression. */
5162 {
5163 /* Statement-expressions are not allowed by the standard. */
5167 /* And they're not allowed outside of a function-body; you
5168 cannot, for example, write:
5170 int i = ({ int j = 3; j + 1; });
5172 at class or namespace scope. */
5175 {
5177 "statement-expressions are not allowed outside "
5183 }
5184 else
5186 }
5187 /* Otherwise it's a normal parenthesized expression. */
5188 {
5189 cp_expr expr;
5194 /* Consume the `('. */
5195 matching_parens parens;
5197 /* Within a parenthesized expression, a `>' token is always
5198 the greater-than operator. */
5199 saved_greater_than_is_operator_p
5204 /* Left fold expression. */
5206 else
5207 /* Parse the parenthesized expression. */
5212 {
5219 }
5220 else
5221 /* Let the front end know that this expression was
5222 enclosed in parentheses. This matters in case, for
5223 example, the expression is of the form `A::B', since
5224 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5225 not. */
5228 /* DR 705: Wrapping an unqualified name in parentheses
5229 suppresses arg-dependent lookup. We want to pass back
5230 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5231 (c++/37862), but none of the others. */
5235 /* The `>' token might be the end of a template-id or
5236 template-parameter-list now. */
5237 parser->greater_than_is_operator_p
5240 /* Consume the `)'. */
5249 }
5252 {
5254 {
5255 /* We might have an Objective-C++ message. */
5258 /* If that works out, we're done ... */
5261 /* ... else, fall though to see if it's a lambda. */
5262 }
5264 /* Don't warn about a failed tentative parse. */
5269 }
5273 /* We have an Objective-C++ string literal. */
5280 {
5281 /* These two are the boolean literals. */
5289 /* The `__null' literal. */
5294 /* The `nullptr' literal. */
5299 /* Recognize the `this' keyword. */
5303 {
5307 }
5308 /* Pointers cannot appear in constant-expressions. */
5313 /* The `operator' keyword can be the beginning of an
5314 id-expression. */
5321 {
5322 non_integral_constant name;
5324 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5325 __func__ are the names of variables -- but they are
5326 treated specially. Therefore, they are handled here,
5327 rather than relying on the generic id-expression logic
5328 below. Grammatically, these names are id-expressions.
5330 Consume the token. */
5334 {
5346 }
5351 /* Look up the name. */
5353 }
5356 {
5357 tree expression;
5358 tree type;
5359 source_location type_location;
5360 location_t start_loc
5362 /* The `__builtin_va_arg' construct is used to handle
5363 `va_arg'. Consume the `__builtin_va_arg' token. */
5365 /* Look for the opening `('. */
5366 matching_parens parens;
5368 /* Now, parse the assignment-expression. */
5370 /* Look for the `,'. */
5373 /* Parse the type-id. */
5374 {
5377 }
5378 /* Look for the closing `)'. */
5379 location_t finish_loc
5382 /* Using `va_arg' in a constant-expression is not
5383 allowed. */
5385 NIC_VA_ARG))
5387 /* Construct a location of the form:
5388 __builtin_va_arg (v, int)
5389 ~~~~~~~~~~~~~~~~~~~~~^~~~
5390 with the caret at the type, ranging from the start of the
5391 "__builtin_va_arg" token to the close paren. */
5392 location_t combined_loc
5395 }
5430 // C++ concepts
5434 /* Objective-C++ expressions. */
5444 {
5449 }
5450 /* FALLTHRU */
5454 }
5456 /* An id-expression can start with either an identifier, a
5457 `::' as the beginning of a qualified-id, or the "operator"
5458 keyword. */
5463 {
5464 id_expression:
5465 cp_expr id_expression;
5466 cp_expr decl;
5472 /* Parse the id-expression. */
5473 id_expression
5490 /* If we have a template-id, then no further lookup is
5491 required. If the template-id was for a template-class, we
5492 will sometimes have a TYPE_DECL at this point. */
5496 /* Look up the name. */
5497 else
5498 {
5499 tree ambiguous_decls;
5501 /* If we already know that this lookup is ambiguous, then
5502 we've already issued an error message; there's no reason
5503 to check again. */
5506 {
5509 }
5512 none_type,
5513 template_p,
5518 /* If the lookup was ambiguous, an error will already have
5519 been issued. */
5523 /* In Objective-C++, we may have an Objective-C 2.0
5524 dot-syntax for classes here. */
5529 {
5530 tree component;
5537 component);
5538 /* Build a location of the form:
5539 expr.component
5540 ~~~~~^~~~~~~~~
5541 with caret at the start of the component name (at
5542 input_location), ranging from the start of the id_expression
5543 to the end of the component name. */
5544 location_t combined_loc
5549 }
5551 /* In Objective-C++, an instance variable (ivar) may be preferred
5552 to whatever cp_parser_lookup_name() found.
5553 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5554 rest of c-family, we have to do a little extra work to preserve
5555 any location information in cp_expr "decl". Given that
5556 objc_lookup_ivar is implemented in "c-family" and "objc", we
5557 have a trip through the pure "tree" type, rather than cp_expr.
5558 Naively copying it back to "decl" would implicitly give the
5559 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5560 store an EXPR_LOCATION. Hence we only update "decl" (and
5561 hence its location_t) if we get back a different tree node. */
5563 id_expression);
5567 /* If name lookup gives us a SCOPE_REF, then the
5568 qualifying scope was dependent. */
5570 {
5571 /* At this point, we do not know if DECL is a valid
5572 integral constant expression. We assume that it is
5573 in fact such an expression, so that code like:
5575 template <int N> struct A {
5576 int a[B<N>::i];
5577 };
5579 is accepted. At template-instantiation time, we
5580 will check that B<N>::i is actually a constant. */
5582 }
5583 /* Check to see if DECL is a local variable in a context
5584 where that is forbidden. */
5587 {
5588 /* It might be that we only found DECL because we are
5589 trying to be generous with pre-ISO scoping rules.
5590 For example, consider:
5592 int i;
5593 void g() {
5594 for (int i = 0; i < 10; ++i) {}
5595 extern void f(int j = i);
5596 }
5598 Here, name look up will originally find the out
5599 of scope `i'. We need to issue a warning message,
5600 but then use the global `i'. */
5603 {
5608 }
5609 }
5610 }
5612 decl = (finish_id_expression
5614 idk,
5619 template_arg_p,
5626 }
5628 /* Anything else is an error. */
5632 }
5633 }
5641 {
5644 }
5646 /* Parse an id-expression.
5648 id-expression:
5649 unqualified-id
5650 qualified-id
5652 qualified-id:
5653 :: [opt] nested-name-specifier template [opt] unqualified-id
5654 :: identifier
5655 :: operator-function-id
5656 :: template-id
5658 Return a representation of the unqualified portion of the
5659 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5660 a `::' or nested-name-specifier.
5662 Often, if the id-expression was a qualified-id, the caller will
5663 want to make a SCOPE_REF to represent the qualified-id. This
5664 function does not do this in order to avoid wastefully creating
5665 SCOPE_REFs when they are not required.
5667 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5668 `template' keyword.
5670 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5671 uninstantiated templates.
5673 If *TEMPLATE_P is non-NULL, it is set to true iff the
5674 `template' keyword is used to explicitly indicate that the entity
5675 named is a template.
5677 If DECLARATOR_P is true, the id-expression is appearing as part of
5678 a declarator, rather than as part of an expression. */
5680 static cp_expr
5687 {
5691 /* Assume the `template' keyword was not used. */
5695 /* Look for the optional `::' operator. */
5696 global_scope_p
5697 = (!template_keyword_p
5702 /* Look for the optional nested-name-specifier. */
5703 nested_name_specifier_p
5706 check_dependency_p,
5708 declarator_p,
5709 template_keyword_p)
5712 /* If there is a nested-name-specifier, then we are looking at
5713 the first qualified-id production. */
5715 {
5716 tree saved_scope;
5717 tree saved_object_scope;
5718 tree saved_qualifying_scope;
5719 cp_expr unqualified_id;
5722 /* See if the next token is the `template' keyword. */
5726 /* Name lookup we do during the processing of the
5727 unqualified-id might obliterate SCOPE. */
5731 /* Process the final unqualified-id. */
5733 check_dependency_p,
5734 declarator_p,
5736 /* Restore the SAVED_SCOPE for our caller. */
5742 }
5743 /* Otherwise, if we are in global scope, then we are looking at one
5744 of the other qualified-id productions. */
5746 {
5748 tree id;
5750 /* Peek at the next token. */
5753 /* If it's an identifier, and the next token is not a "<", then
5754 we can avoid the template-id case. This is an optimization
5755 for this common case. */
5757 && !cp_parser_nth_token_starts_template_argument_list_p
5762 /* Try a template-id. */
5766 none_type,
5767 declarator_p);
5768 /* If that worked, we're done. */
5772 /* Peek at the next token. (Changes in the token buffer may
5773 have invalidated the pointer obtained above.) */
5777 {
5784 /* Fall through. */
5789 }
5790 }
5791 else
5794 declarator_p,
5795 optional_p);
5796 }
5798 /* Parse an unqualified-id.
5800 unqualified-id:
5801 identifier
5802 operator-function-id
5803 conversion-function-id
5804 ~ class-name
5805 template-id
5807 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5808 keyword, in a construct like `A::template ...'.
5810 Returns a representation of unqualified-id. For the `identifier'
5811 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5812 production a BIT_NOT_EXPR is returned; the operand of the
5813 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5814 other productions, see the documentation accompanying the
5815 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5816 names are looked up in uninstantiated templates. If DECLARATOR_P
5817 is true, the unqualified-id is appearing as part of a declarator,
5818 rather than as part of an expression. */
5820 static cp_expr
5826 {
5829 /* Peek at the next token. */
5833 {
5835 {
5836 tree id;
5838 /* We don't know yet whether or not this will be a
5839 template-id. */
5841 /* Try a template-id. */
5843 check_dependency_p,
5844 none_type,
5845 declarator_p);
5846 /* If it worked, we're done. */
5849 /* Otherwise, it's an ordinary identifier. */
5851 }
5855 check_dependency_p,
5856 none_type,
5857 declarator_p);
5860 {
5861 tree type_decl;
5862 tree qualifying_scope;
5863 tree object_scope;
5864 tree scope;
5867 /* Consume the `~' token. */
5869 /* Parse the class-name. The standard, as written, seems to
5870 say that:
5872 template <typename T> struct S { ~S (); };
5873 template <typename T> S<T>::~S() {}
5875 is invalid, since `~' must be followed by a class-name, but
5876 `S<T>' is dependent, and so not known to be a class.
5877 That's not right; we need to look in uninstantiated
5878 templates. A further complication arises from:
5880 template <typename T> void f(T t) {
5881 t.T::~T();
5882 }
5884 Here, it is not possible to look up `T' in the scope of `T'
5885 itself. We must look in both the current scope, and the
5886 scope of the containing complete expression.
5888 Yet another issue is:
5890 struct S {
5891 int S;
5892 ~S();
5893 };
5895 S::~S() {}
5897 The standard does not seem to say that the `S' in `~S'
5898 should refer to the type `S' and not the data member
5899 `S::S'. */
5901 /* DR 244 says that we look up the name after the "~" in the
5902 same scope as we looked up the qualifying name. That idea
5903 isn't fully worked out; it's more complicated than that. */
5908 /* Check for invalid scopes. */
5910 {
5914 }
5916 {
5920 scope);
5925 }
5928 /* If the name is of the form "X::~X" it's OK even if X is a
5929 typedef. */
5938 {
5941 }
5943 /* ~auto means the destructor of whatever the object is. */
5945 {
5948 "%<~auto%> only available with "
5952 }
5954 /* If there was an explicit qualification (S::~T), first look
5955 in the scope given by the qualification (i.e., S).
5957 Note: in the calls to cp_parser_class_name below we pass
5958 typename_type so that lookup finds the injected-class-name
5959 rather than the constructor. */
5963 {
5968 typename_type,
5971 declarator_p);
5974 }
5975 /* In "N::S::~S", look in "N" as well. */
5977 {
5982 type_decl
5986 typename_type,
5989 declarator_p);
5992 }
5993 /* In "p->S::~T", look in the scope given by "*p" as well. */
5995 {
6000 type_decl
6004 typename_type,
6007 declarator_p);
6010 }
6011 /* Look in the surrounding context. */
6013 {
6019 type_decl
6023 typename_type,
6026 declarator_p);
6029 {
6030 /* We couldn't find a type with this name. If we're parsing
6031 tentatively, fail and try something else. */
6033 {
6036 }
6037 /* Otherwise, accept it and check for a match at instantiation
6038 time. */
6043 }
6044 }
6045 /* If an error occurred, assume that the name of the
6046 destructor is the same as the name of the qualifying
6047 class. That allows us to keep parsing after running
6048 into ill-formed destructor names. */
6054 /* Check that destructor name and scope match. */
6056 {
6063 }
6065 /* [class.dtor]
6067 A typedef-name that names a class shall not be used as the
6068 identifier in the declarator for a destructor declaration. */
6075 type_decl);
6078 }
6082 {
6083 cp_expr id;
6085 /* This could be a template-id, so we try that first. */
6087 /* Try a template-id. */
6090 none_type,
6091 declarator_p);
6092 /* If that worked, we're done. */
6095 /* We still don't know whether we're looking at an
6096 operator-function-id or a conversion-function-id. */
6098 /* Try an operator-function-id. */
6100 /* If that didn't work, try a conversion-function-id. */
6105 }
6106 /* Fall through. */
6113 }
6114 }
6116 /* Parse an (optional) nested-name-specifier.
6118 nested-name-specifier: [C++98]
6119 class-or-namespace-name :: nested-name-specifier [opt]
6120 class-or-namespace-name :: template nested-name-specifier [opt]
6122 nested-name-specifier: [C++0x]
6123 type-name ::
6124 namespace-name ::
6125 nested-name-specifier identifier ::
6126 nested-name-specifier template [opt] simple-template-id ::
6128 PARSER->SCOPE should be set appropriately before this function is
6129 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6130 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6131 in name lookups.
6133 Sets PARSER->SCOPE to the class (TYPE) or namespace
6134 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6135 it unchanged if there is no nested-name-specifier. Returns the new
6136 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6138 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6139 part of a declaration and/or decl-specifier. */
6141 static tree
6148 {
6153 /* Remember where the nested-name-specifier starts. */
6155 {
6158 }
6161 {
6162 tree new_scope;
6163 tree old_scope;
6164 tree saved_qualifying_scope;
6166 /* Spot cases that cannot be the beginning of a
6167 nested-name-specifier. */
6170 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6171 the already parsed nested-name-specifier. */
6173 {
6174 /* Grab the nested-name-specifier and continue the loop. */
6176 /* If we originally encountered this nested-name-specifier
6177 with IS_DECLARATION set to false, we will not have
6178 resolved TYPENAME_TYPEs, so we must do so here. */
6181 {
6186 }
6189 }
6191 /* Spot cases that cannot be the beginning of a
6192 nested-name-specifier. On the second and subsequent times
6193 through the loop, we look for the `template' keyword. */
6195 ;
6196 /* A template-id can start a nested-name-specifier. */
6198 ;
6199 /* DR 743: decltype can be used in a nested-name-specifier. */
6201 ;
6202 else
6203 {
6204 /* If the next token is not an identifier, then it is
6205 definitely not a type-name or namespace-name. */
6208 /* If the following token is neither a `<' (to begin a
6209 template-id), nor a `::', then we are not looking at a
6210 nested-name-specifier. */
6216 {
6220 "found %<:%> in nested-name-specifier, "
6223 }
6226 && !cp_parser_nth_token_starts_template_argument_list_p
6229 }
6231 /* The nested-name-specifier is optional, so we parse
6232 tentatively. */
6235 /* Look for the optional `template' keyword, if this isn't the
6236 first time through the loop. */
6240 /* Save the old scope since the name lookup we are about to do
6241 might destroy it. */
6244 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6245 look up names in "X<T>::I" in order to determine that "Y" is
6246 a template. So, if we have a typename at this point, we make
6247 an effort to look through it. */
6249 && !typename_keyword_p
6254 /* Parse the qualifying entity. */
6255 new_scope
6257 typename_keyword_p,
6258 template_keyword_p,
6259 check_dependency_p,
6260 type_p,
6261 is_declaration);
6262 /* Look for the `::' token. */
6265 /* If we found what we wanted, we keep going; otherwise, we're
6266 done. */
6268 {
6271 /* Restore the OLD_SCOPE since it was valid before the
6272 failed attempt at finding the last
6273 class-or-namespace-name. */
6277 /* If the next token is a decltype, and the one after that is a
6278 `::', then the decltype has failed to resolve to a class or
6279 enumeration type. Give this error even when parsing
6280 tentatively since it can't possibly be valid--and we're going
6281 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6282 won't get another chance.*/
6286 {
6293 /* As below. */
6296 }
6300 {
6301 /* If we have a non-type template-id followed by ::, it can't
6302 possibly be valid. */
6307 {
6310 {
6316 }
6317 else
6318 {
6319 /* Variable template. */
6324 }
6331 /* As below. */
6335 }
6336 }
6340 /* If the next token is an identifier, and the one after
6341 that is a `::', then any valid interpretation would have
6342 found a class-or-namespace-name. */
6348 {
6351 {
6353 {
6354 tree decl;
6355 tree ambiguous_decls;
6358 none_type,
6367 decl);
6369 {
6370 // cp_parser_lookup_name has the same diagnostic,
6371 // thus make sure to emit it at most once.
6374 {
6379 }
6381 }
6382 else
6383 {
6385 cp_parser_name_lookup_error
6388 else
6389 cp_parser_name_lookup_error
6392 }
6393 }
6396 /* Treat this as a successful nested-name-specifier
6397 due to:
6399 [basic.lookup.qual]
6401 If the name found is not a class-name (clause
6402 _class_) or namespace-name (_namespace.def_), the
6403 program is ill-formed. */
6405 }
6407 }
6409 }
6410 /* We've found one valid nested-name-specifier. */
6412 /* Name lookup always gives us a DECL. */
6415 /* Uses of "template" must be followed by actual templates. */
6427 new_scope);
6428 /* If it is a class scope, try to complete it; we are about to
6429 be looking up names inside the class. */
6431 /* Since checking types for dependency can be expensive,
6432 avoid doing it if the type is already complete. */
6434 /* Do not try to complete dependent types. */
6436 {
6438 /* If it is a typedef to current class, use the current
6439 class instead, as the typedef won't have any names inside
6440 it yet. */
6444 }
6445 /* Make sure we look in the right scope the next time through
6446 the loop. */
6448 }
6450 /* If parsing tentatively, replace the sequence of tokens that makes
6451 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6452 token. That way, should we re-parse the token stream, we will
6453 not have to repeat the effort required to do the parse, nor will
6454 we issue duplicate error messages. */
6456 {
6460 /* Reset the contents of the START token. */
6462 /* Retrieve any deferred checks. Do not pop this access checks yet
6463 so the memory will not be reclaimed during token replacing below. */
6471 /* Purge all subsequent tokens. */
6473 }
6479 }
6481 /* Parse a nested-name-specifier. See
6482 cp_parser_nested_name_specifier_opt for details. This function
6483 behaves identically, except that it will an issue an error if no
6484 nested-name-specifier is present. */
6486 static tree
6492 {
6493 tree scope;
6495 /* Look for the nested-name-specifier. */
6497 typename_keyword_p,
6498 check_dependency_p,
6499 type_p,
6500 is_declaration);
6501 /* If it was not present, issue an error message. */
6503 {
6506 }
6509 }
6511 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6512 this is either a class-name or a namespace-name (which corresponds
6513 to the class-or-namespace-name production in the grammar). For
6514 C++0x, it can also be a type-name that refers to an enumeration
6515 type or a simple-template-id.
6517 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6518 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6519 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6520 TYPE_P is TRUE iff the next name should be taken as a class-name,
6521 even the same name is declared to be another entity in the same
6522 scope.
6524 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6525 specified by the class-or-namespace-name. If neither is found the
6526 ERROR_MARK_NODE is returned. */
6528 static tree
6535 {
6536 tree saved_scope;
6537 tree saved_qualifying_scope;
6538 tree saved_object_scope;
6539 tree scope;
6543 /* DR 743: decltype can appear in a nested-name-specifier. */
6545 {
6549 {
6552 }
6556 }
6558 /* Before we try to parse the class-name, we must save away the
6559 current PARSER->SCOPE since cp_parser_class_name will destroy
6560 it. */
6564 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6565 there is no need to look for a namespace-name. */
6566 only_class_p = template_keyword_p
6571 typename_keyword_p,
6572 template_keyword_p,
6574 check_dependency_p,
6576 is_declaration,
6579 /* If that didn't work, try for a namespace-name. */
6581 {
6582 /* Restore the saved scope. */
6586 /* If we are not looking at an identifier followed by the scope
6587 resolution operator, then this is not part of a
6588 nested-name-specifier. (Note that this function is only used
6589 to parse the components of a nested-name-specifier.) */
6594 }
6597 }
6599 /* Return true if we are looking at a compound-literal, false otherwise. */
6601 static bool
6603 {
6606 /* Skip tokens until the next token is a closing parenthesis.
6607 If we find the closing `)', and the next token is a `{', then
6608 we are looking at a compound-literal. */
6609 bool compound_literal_p
6614 /* Roll back the tokens we skipped. */
6618 }
6620 /* Return true if EXPR is the integer constant zero or a complex constant
6621 of zero, without any folding, but ignoring location wrappers. */
6623 static bool
6625 {
6628 }
6630 /* Parse a postfix-expression.
6632 postfix-expression:
6633 primary-expression
6634 postfix-expression [ expression ]
6635 postfix-expression ( expression-list [opt] )
6636 simple-type-specifier ( expression-list [opt] )
6637 typename :: [opt] nested-name-specifier identifier
6638 ( expression-list [opt] )
6639 typename :: [opt] nested-name-specifier template [opt] template-id
6640 ( expression-list [opt] )
6641 postfix-expression . template [opt] id-expression
6642 postfix-expression -> template [opt] id-expression
6643 postfix-expression . pseudo-destructor-name
6644 postfix-expression -> pseudo-destructor-name
6645 postfix-expression ++
6646 postfix-expression --
6647 dynamic_cast < type-id > ( expression )
6648 static_cast < type-id > ( expression )
6649 reinterpret_cast < type-id > ( expression )
6650 const_cast < type-id > ( expression )
6651 typeid ( expression )
6652 typeid ( type-id )
6654 GNU Extension:
6656 postfix-expression:
6657 ( type-id ) { initializer-list , [opt] }
6659 This extension is a GNU version of the C99 compound-literal
6660 construct. (The C99 grammar uses `type-name' instead of `type-id',
6661 but they are essentially the same concept.)
6663 If ADDRESS_P is true, the postfix expression is the operand of the
6664 `&' operator. CAST_P is true if this expression is the target of a
6665 cast.
6667 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6668 class member access expressions [expr.ref].
6670 Returns a representation of the expression. */
6672 static cp_expr
6676 {
6678 location_t loc;
6684 /* Peek at the next token. */
6689 /* Some of the productions are determined by keywords. */
6692 {
6697 {
6698 tree type;
6699 cp_expr expression;
6703 /* All of these can be handled in the same way from the point
6704 of view of parsing. Begin by consuming the token
6705 identifying the cast. */
6708 /* New types cannot be defined in the cast. */
6710 parser->type_definition_forbidden_message
6713 /* Look for the opening `<'. */
6715 /* Parse the type to which we are casting. */
6720 /* Look for the closing `>'. */
6722 /* Restore the old message. */
6725 bool saved_greater_than_is_operator_p
6729 /* And the expression which is being cast. */
6730 matching_parens parens;
6734 RT_CLOSE_PAREN);
6738 parser->greater_than_is_operator_p
6741 /* Only type conversions to integral or enumeration types
6742 can be used in constant-expressions. */
6745 {
6748 }
6751 {
6753 postfix_expression
6757 postfix_expression
6761 postfix_expression
6763 tf_warning_or_error);
6766 postfix_expression
6771 }
6773 /* Construct a location e.g. :
6774 reinterpret_cast <int *> (expr)
6775 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6776 ranging from the start of the "*_cast" token to the final closing
6777 paren, with the caret at the start. */
6780 }
6784 {
6785 tree type;
6789 /* Consume the `typeid' token. */
6791 /* Look for the `(' token. */
6792 matching_parens parens;
6794 /* Types cannot be defined in a `typeid' expression. */
6796 parser->type_definition_forbidden_message
6798 /* We can't be sure yet whether we're looking at a type-id or an
6799 expression. */
6801 /* Try a type-id first. */
6806 /* Look for the `)' token. Otherwise, we can't be sure that
6807 we're not looking at an expression: consider `typeid (int
6808 (3))', for example. */
6810 /* If all went well, simply lookup the type-id. */
6813 /* Otherwise, fall back to the expression variant. */
6814 else
6815 {
6816 tree expression;
6818 /* Look for an expression. */
6820 /* Compute its typeid. */
6822 /* Look for the `)' token. */
6824 }
6825 /* Restore the saved message. */
6827 /* `typeid' may not appear in an integral constant expression. */
6831 /* Construct a location e.g. :
6832 typeid (expr)
6833 ^~~~~~~~~~~~~
6834 ranging from the start of the "typeid" token to the final closing
6835 paren, with the caret at the start. */
6837 {
6838 location_t typeid_loc
6842 }
6843 }
6847 {
6848 tree type;
6849 /* The syntax permitted here is the same permitted for an
6850 elaborated-type-specifier. */
6857 }
6863 {
6866 tree p;
6873 {
6876 }
6882 {
6885 postfix_expression
6887 else
6888 {
6892 }
6898 tf_warning_or_error);
6899 else
6900 {
6904 }
6909 postfix_expression
6913 postfix_expression
6916 else
6917 {
6921 }
6926 }
6928 }
6931 {
6932 tree type;
6934 /* If the next thing is a simple-type-specifier, we may be
6935 looking at a functional cast. We could also be looking at
6936 an id-expression. So, we try the functional cast, and if
6937 that doesn't work we fall back to the primary-expression. */
6939 /* Look for the simple-type-specifier. */
6943 CP_PARSER_FLAGS_NONE);
6945 /* Parse the cast itself. */
6947 postfix_expression
6949 /* If that worked, we're done. */
6953 /* If the functional-cast didn't work out, try a
6954 compound-literal. */
6957 {
6962 matching_parens parens;
6965 /* Avoid calling cp_parser_type_id pointlessly, see comment
6966 in cp_parser_cast_expression about c++/29234. */
6969 else
6970 {
6971 /* Parse the type. */
6977 }
6979 /* If things aren't going well, there's no need to
6980 keep going. */
6982 {
6984 /* Parse the brace-enclosed initializer list. */
6987 }
6988 /* If that worked, we're definitely looking at a
6989 compound-literal expression. */
6991 {
6992 /* Warn the user that a compound literal is not
6993 allowed in standard C++. */
6996 /* For simplicity, we disallow compound literals in
6997 constant-expressions. We could
6998 allow compound literals of integer type, whose
6999 initializer was a constant, in constant
7000 expressions. Permitting that usage, as a further
7001 extension, would not change the meaning of any
7002 currently accepted programs. (Of course, as
7003 compound literals are not part of ISO C++, the
7004 standard has nothing to say.) */
7006 NIC_NCC))
7007 {
7010 }
7011 /* Form the representation of the compound-literal. */
7012 postfix_expression
7017 }
7018 }
7020 /* It must be a primary-expression. */
7021 postfix_expression
7024 decltype_p,
7026 }
7028 }
7030 /* Note that we don't need to worry about calling build_cplus_new on a
7031 class-valued CALL_EXPR in decltype when it isn't the end of the
7032 postfix-expression; unary_complex_lvalue will take care of that for
7033 all these cases. */
7035 /* Keep looping until the postfix-expression is complete. */
7037 {
7041 /* It is not a Koenig lookup function call. */
7042 postfix_expression
7045 /* Peek at the next token. */
7049 {
7052 {
7054 "two consecutive %<[%> shall "
7057 }
7058 postfix_expression
7060 postfix_expression,
7062 decltype_p);
7071 /* postfix-expression ( expression-list [opt] ) */
7072 {
7083 is_builtin_constant_p
7086 {
7087 /* The whole point of __builtin_constant_p is to allow
7088 non-constant expressions to appear as arguments. */
7089 saved_integral_constant_expression_p
7091 saved_non_integral_constant_expression_p
7094 }
7095 args = (cp_parser_parenthesized_expression_list
7102 {
7103 parser->integral_constant_expression_p
7105 parser->non_integral_constant_expression_p
7107 }
7110 {
7113 }
7115 /* Function calls are not permitted in
7116 constant-expressions. */
7119 NIC_FUNC_CALL))
7120 {
7124 }
7129 {
7131 {
7133 {
7136 postfix_expression
7138 complain);
7139 }
7140 else
7141 postfix_expression
7143 }
7144 /* We do not perform argument-dependent lookup if
7145 normal lookup finds a non-function, in accordance
7146 with the expected resolution of DR 218. */
7149 {
7153 /* Do not do argument dependent lookup if regular
7154 lookup finds a member function or a block-scope
7155 function declaration. [basic.lookup.argdep]/3 */
7158 {
7161 postfix_expression
7163 complain);
7164 }
7165 }
7166 }
7172 {
7179 }
7182 {
7192 {
7194 postfix_expression
7198 }
7201 {
7202 postfix_expression
7203 = (build_new_method_call
7209 complain));
7210 }
7211 else
7212 postfix_expression
7216 complain);
7217 }
7221 postfix_expression = (build_offset_ref_call_from_tree
7223 complain));
7225 /* A call to a static class member, or a namespace-scope
7226 function. */
7227 postfix_expression
7230 koenig_p,
7231 complain);
7232 else
7233 /* All other function calls. */
7234 postfix_expression
7237 koenig_p,
7238 complain);
7241 {
7243 start_loc,
7244 close_paren_loc);
7246 }
7248 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7252 }
7257 /* postfix-expression . template [opt] id-expression
7258 postfix-expression . pseudo-destructor-name
7259 postfix-expression -> template [opt] id-expression
7260 postfix-expression -> pseudo-destructor-name */
7262 /* Consume the `.' or `->' operator. */
7265 postfix_expression
7267 postfix_expression,
7274 /* postfix-expression ++ */
7275 /* Consume the `++' token. */
7277 /* Generate a representation for the complete expression. */
7278 postfix_expression
7280 POSTINCREMENT_EXPR);
7281 /* Increments may not appear in constant-expressions. */
7289 /* postfix-expression -- */
7290 /* Consume the `--' token. */
7292 /* Generate a representation for the complete expression. */
7293 postfix_expression
7295 POSTDECREMENT_EXPR);
7296 /* Decrements may not appear in constant-expressions. */
7307 return is_member_access
7308 ? postfix_expression
7310 else
7312 }
7313 }
7315 /* We should never get here. */
7318 }
7320 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7321 by cp_parser_builtin_offsetof. We're looking for
7323 postfix-expression [ expression ]
7324 postfix-expression [ braced-init-list ] (C++11)
7326 FOR_OFFSETOF is set if we're being called in that context, which
7327 changes how we deal with integer constant expressions. */
7329 static tree
7331 tree postfix_expression,
7334 {
7339 /* Consume the `[' token. */
7345 /* Parse the index expression. */
7346 /* ??? For offsetof, there is a question of what to allow here. If
7347 offsetof is not being used in an integral constant expression context,
7348 then we *could* get the right answer by computing the value at runtime.
7349 If we are in an integral constant expression context, then we might
7350 could accept any constant expression; hard to say without analysis.
7351 Rather than open the barn door too wide right away, allow only integer
7352 constant expressions here. */
7355 else
7356 {
7358 {
7363 }
7364 else
7366 }
7370 /* Look for the closing `]'. */
7373 /* Build the ARRAY_REF. */
7377 /* When not doing offsetof, array references are not permitted in
7378 constant-expressions. */
7384 }
7386 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7387 dereference of incomplete type, returns true if error_mark_node should
7388 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7389 and *DEPENDENT_P. */
7391 bool
7394 {
7395 /* In a template, be permissive by treating an object expression
7396 of incomplete type as dependent (after a pedwarn). */
7397 diagnostic_t kind = (processing_template_decl
7401 {
7413 /* Don't emit any diagnostic for OVERLOADs. */
7417 /* Avoid clobbering e.g. DECLs. */
7421 }
7433 {
7436 }
7438 }
7440 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7441 by cp_parser_builtin_offsetof. We're looking for
7443 postfix-expression . template [opt] id-expression
7444 postfix-expression . pseudo-destructor-name
7445 postfix-expression -> template [opt] id-expression
7446 postfix-expression -> pseudo-destructor-name
7448 FOR_OFFSETOF is set if we're being called in that context. That sorta
7449 limits what of the above we'll actually accept, but nevermind.
7450 TOKEN_TYPE is the "." or "->" token, which will already have been
7451 removed from the stream. */
7453 static tree
7456 cp_expr postfix_expression,
7458 location_t location)
7459 {
7460 tree name;
7466 /* If this is a `->' operator, dereference the pointer. */
7469 tf_warning_or_error);
7470 /* Check to see whether or not the expression is type-dependent and
7471 not the current instantiation. */
7473 /* The identifier following the `->' or `.' is not qualified. */
7479 /* Enter the scope corresponding to the type of the object
7480 given by the POSTFIX_EXPRESSION. */
7482 {
7484 /* According to the standard, no expression should ever have
7485 reference type. Unfortunately, we do not currently match
7486 the standard in this respect in that our internal representation
7487 of an expression may have reference type even when the standard
7488 says it does not. Therefore, we have to manually obtain the
7489 underlying type here. */
7491 /* The type of the POSTFIX_EXPRESSION must be complete. */
7492 /* Unlike the object expression in other contexts, *this is not
7493 required to be of complete type for purposes of class member
7494 access (5.2.5) outside the member function body. */
7497 && !(processing_template_decl
7498 && current_class_type
7499 && (same_type_ignoring_top_level_qualifiers_p
7501 {
7507 }
7510 {
7511 /* Let the name lookup machinery know that we are processing a
7512 class member access expression. */
7514 /* If something went wrong, we want to be able to discern that case,
7515 as opposed to the case where there was no SCOPE due to the type
7516 of expression being dependent. */
7519 /* If the SCOPE was erroneous, make the various semantic analysis
7520 functions exit quickly -- and without issuing additional error
7521 messages. */
7524 }
7525 }
7528 /* Tell cp_parser_lookup_name that there was an object, even though it's
7529 type-dependent. */
7532 /* Assume this expression is not a pseudo-destructor access. */
7535 /* If the SCOPE is a scalar type, then, if this is a valid program,
7536 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7537 is type dependent, it can be pseudo-destructor-name or something else.
7538 Try to parse it as pseudo-destructor-name first. */
7540 {
7541 tree s;
7542 tree type;
7545 /* Parse the pseudo-destructor-name. */
7554 {
7556 postfix_expression
7559 }
7560 }
7563 {
7564 /* If the SCOPE is not a scalar type, we are looking at an
7565 ordinary class member access expression, rather than a
7566 pseudo-destructor-name. */
7569 /* Parse the id-expression. */
7570 name = (cp_parser_id_expression
7577 /* In general, build a SCOPE_REF if the member name is qualified.
7578 However, if the name was not dependent and has already been
7579 resolved; there is no need to build the SCOPE_REF. For example;
7581 struct X { void f(); };
7582 template <typename T> void f(T* t) { t->X::f(); }
7584 Even though "t" is dependent, "X::f" is not and has been resolved
7585 to a BASELINK; there is no need to include scope information. */
7587 /* But we do need to remember that there was an explicit scope for
7588 virtual function calls. */
7592 /* If the name is a template-id that names a type, we will get a
7593 TYPE_DECL here. That is invalid code. */
7595 {
7598 }
7599 else
7600 {
7602 {
7604 {
7608 }
7609 else
7612 name,
7613 template_p);
7617 }
7619 adjust_result_of_qualified_name_lookup
7621 postfix_expression
7623 template_p,
7624 tf_warning_or_error);
7625 /* Build a location e.g.:
7626 ptr->access_expr
7627 ~~~^~~~~~~~~~~~~
7628 where the caret is at the deref token, ranging from
7629 the start of postfix_expression to the end of the access expr. */
7630 location_t end_loc
7632 location_t combined_loc
7635 }
7636 }
7638 /* We no longer need to look up names in the scope of the object on
7639 the left-hand side of the `.' or `->' operator. */
7642 /* Outside of offsetof, these operators may not appear in
7643 constant-expressions. */
7645 && (cp_parser_non_integral_constant_expression
7650 }
7652 /* Parse a parenthesized expression-list.
7654 expression-list:
7655 assignment-expression
7656 expression-list, assignment-expression
7658 attribute-list:
7659 expression-list
7660 identifier
7661 identifier, expression-list
7663 CAST_P is true if this expression is the target of a cast.
7665 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7666 argument pack.
7668 WRAP_LOCATIONS_P is true if expressions within this list for which
7669 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7670 their source locations.
7672 Returns a vector of trees. Each element is a representation of an
7673 assignment-expression. NULL is returned if the ( and or ) are
7674 missing. An empty, but allocated, vector is returned on no
7675 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7676 if we are parsing an attribute list for an attribute that wants a
7677 plain identifier argument, normal_attr for an attribute that wants
7678 an expression, or non_attr if we aren't parsing an attribute list. If
7679 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7680 not all of the expressions in the list were constant.
7681 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7682 will be written to with the location of the closing parenthesis. If
7683 an error occurs, it may or may not be written to. */
7693 {
7699 /* Assume all the expressions will be constant. */
7703 matching_parens parens;
7709 /* Within a parenthesized expression, a `>' token is always
7710 the greater-than operator. */
7711 saved_greater_than_is_operator_p
7717 /* Consume expressions until there are no more. */
7720 {
7721 /* At the beginning of attribute lists, check to see if the
7722 next token is an identifier. */
7725 {
7728 /* Consume the identifier. */
7730 /* Save the identifier. */
7732 }
7733 else
7734 {
7737 /* Parse the next assignment-expression. */
7739 {
7740 /* A braced-init-list. */
7746 }
7748 {
7749 expr = (cp_parser_constant_expression
7754 }
7755 else
7757 cast_p);
7762 /* If we have an ellipsis, then this is an expression
7763 expansion. */
7766 {
7767 /* Consume the `...'. */
7770 /* Build the argument pack. */
7772 }
7777 /* Add it to the list. We add error_mark_node
7778 expressions to the list, so that we can still tell if
7779 the correct form for a parenthesized expression-list
7780 is found. That gives better errors. */
7785 }
7787 /* After the first item, attribute lists look the same as
7788 expression lists. */
7791 get_comma:;
7792 /* If the next token isn't a `,', then we are done. */
7796 /* Otherwise, consume the `,' and keep going. */
7798 }
7804 {
7807 skip_comma:;
7808 /* We try and resync to an unnested comma, as that will give the
7809 user better diagnostics. */
7817 {
7818 parser->greater_than_is_operator_p
7821 }
7822 }
7824 parser->greater_than_is_operator_p
7831 }
7833 /* Parse a pseudo-destructor-name.
7835 pseudo-destructor-name:
7836 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7837 :: [opt] nested-name-specifier template template-id :: ~ type-name
7838 :: [opt] nested-name-specifier [opt] ~ type-name
7840 If either of the first two productions is used, sets *SCOPE to the
7841 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7842 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7843 or ERROR_MARK_NODE if the parse fails. */
7845 static void
7847 tree object,
7850 {
7853 /* Handle ~auto. */
7857 {
7860 "%<~auto%> only available with "
7867 }
7869 /* Assume that things will not work out. */
7872 /* Look for the optional `::' operator. */
7874 /* Look for the optional nested-name-specifier. */
7875 nested_name_specifier_p
7882 /* Now, if we saw a nested-name-specifier, we might be doing the
7883 second production. */
7886 {
7887 /* Consume the `template' keyword. */
7889 /* Parse the template-id. */
7893 class_type,
7895 /* Look for the `::' token. */
7897 }
7898 /* If the next token is not a `~', then there might be some
7899 additional qualification. */
7901 {
7902 /* At this point, we're looking for "type-name :: ~". The type-name
7903 must not be a class-name, since this is a pseudo-destructor. So,
7904 it must be either an enum-name, or a typedef-name -- both of which
7905 are just identifiers. So, we peek ahead to check that the "::"
7906 and "~" tokens are present; if they are not, then we can avoid
7907 calling type_name. */
7911 {
7914 }
7916 /* Look for the type-name. */
7921 /* Look for the `::' token. */
7923 }
7924 else
7927 /* Look for the `~'. */
7930 /* Once we see the ~, this has to be a pseudo-destructor. */
7934 /* Look for the type-name again. We are not responsible for
7935 checking that it matches the first type-name. */
7937 }
7939 /* Parse a unary-expression.
7941 unary-expression:
7942 postfix-expression
7943 ++ cast-expression
7944 -- cast-expression
7945 unary-operator cast-expression
7946 sizeof unary-expression
7947 sizeof ( type-id )
7948 alignof ( type-id ) [C++0x]
7949 new-expression
7950 delete-expression
7952 GNU Extensions:
7954 unary-expression:
7955 __extension__ cast-expression
7956 __alignof__ unary-expression
7957 __alignof__ ( type-id )
7958 alignof unary-expression [C++0x]
7959 __real__ cast-expression
7960 __imag__ cast-expression
7961 && identifier
7962 sizeof ( type-id ) { initializer-list , [opt] }
7963 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7964 __alignof__ ( type-id ) { initializer-list , [opt] }
7966 ADDRESS_P is true iff the unary-expression is appearing as the
7967 operand of the `&' operator. CAST_P is true if this expression is
7968 the target of a cast.
7970 Returns a representation of the expression. */
7972 static cp_expr
7975 {
7979 /* Peek at the next token. */
7981 /* Some keywords give away the kind of expression. */
7983 {
7987 {
7990 {
7996 /* Consume the token. */
7998 /* Parse the operand. */
8003 else
8004 {
8005 /* ISO C++ defines alignof only with types, not with
8006 expressions. So pedwarn if alignof is used with a non-
8007 type expression. However, __alignof__ is ok. */
8010 "ISO C++ does not allow %<alignof%> "
8014 }
8015 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8016 SIZEOF_EXPR with the original operand. */
8018 {
8020 {
8022 {
8025 error_mark_node));
8027 }
8028 else
8032 }
8033 }
8035 /* Construct a location e.g. :
8036 alignof (expr)
8037 ^~~~~~~~~~~~~~
8038 with start == caret at the start of the "alignof"/"sizeof"
8039 token, with the endpoint at the final closing paren. */
8040 location_t finish_loc
8042 location_t compound_loc
8049 }
8058 {
8059 /* The saved value of the PEDANTIC flag. */
8061 tree expr;
8063 /* Save away the PEDANTIC flag. */
8065 /* Parse the cast-expression. */
8067 /* Restore the PEDANTIC flag. */
8071 }
8075 {
8076 tree expression;
8078 /* Consume the `__real__' or `__imag__' token. */
8080 /* Parse the cast-expression. */
8082 /* Create the complete representation. */
8086 expression,
8087 tf_warning_or_error);
8088 }
8096 {
8097 tree expr;
8106 matching_parens parens;
8110 parser->type_definition_forbidden_message
8113 saved_integral_constant_expression_p
8115 saved_non_integral_constant_expression_p
8119 saved_greater_than_is_operator_p
8131 parser->greater_than_is_operator_p
8134 parser->integral_constant_expression_p
8136 parser->non_integral_constant_expression_p
8141 location_t finish_loc
8145 /* Construct a location of the form:
8146 noexcept (expr)
8147 ^~~~~~~~~~~~~~~
8148 with start == caret, finishing at the close-paren. */
8149 location_t noexcept_loc
8153 noexcept_loc);
8154 }
8158 }
8159 }
8161 /* Look for the `:: new' and `:: delete', which also signal the
8162 beginning of a new-expression, or delete-expression,
8163 respectively. If the next token is `::', then it might be one of
8164 these. */
8166 {
8169 /* See if the token after the `::' is one of the keywords in
8170 which we're interested. */
8172 /* If it's `new', we have a new-expression. */
8175 /* Similarly, for `delete'. */
8178 }
8180 /* Look for a unary operator. */
8182 /* The `++' and `--' operators can be handled similarly, even though
8183 they are not technically unary-operators in the grammar. */
8185 {
8190 /* Handle the GNU address-of-label extension. */
8193 {
8194 tree identifier;
8195 tree expression;
8198 /* Consume the '&&' token. */
8200 /* Look for the identifier. */
8201 location_t finish_loc
8204 /* Construct a location of the form:
8205 &&label
8206 ^~~~~~~
8207 with caret==start at the "&&", finish at the end of the label. */
8208 location_t combined_loc
8210 /* Create an expression representing the address. */
8213 NIC_ADDR_LABEL))
8216 }
8217 }
8219 {
8220 cp_expr cast_expression;
8226 /* Consume the operator token. */
8230 /* Parse the cast-expression. */
8231 cast_expression
8236 pidk);
8238 /* Make a location:
8239 OP_TOKEN CAST_EXPRESSION
8240 ^~~~~~~~~~~~~~~~~~~~~~~~~
8241 with start==caret at the operator token, and
8242 extending to the end of the cast_expression. */
8245 /* Now, build an appropriate representation. */
8247 {
8251 RO_UNARY_STAR,
8252 complain);
8253 /* TODO: build_x_indirect_ref does not always honor the
8254 location, so ensure it is set. */
8260 /* Fall through. */
8263 cast_expression,
8264 complain);
8265 /* TODO: build_x_unary_op does not always honor the location,
8266 so ensure it is set. */
8274 /* Fall through. */
8276 /* Immediately fold negation of a constant, unless the constant is 0
8277 (since -0 == 0) or it would overflow. */
8282 {
8285 cast_expression);
8287 {
8290 }
8291 }
8292 /* Fall through. */
8301 }
8305 non_constant_p))
8309 }
8313 decltype_p,
8314 pidk);
8315 }
8317 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8318 unary-operator, the corresponding tree code is returned. */
8320 static enum tree_code
8322 {
8324 {
8345 }
8346 }
8348 /* Parse a new-expression.
8350 new-expression:
8351 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8352 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8354 Returns a representation of the expression. */
8356 static tree
8358 {
8361 tree type;
8364 tree ret;
8368 /* Look for the optional `::' operator. */
8369 global_scope_p
8373 /* Look for the `new' operator. */
8375 /* There's no easy way to tell a new-placement from the
8376 `( type-id )' construct. */
8378 /* Look for a new-placement. */
8380 /* If that didn't work out, there's no new-placement. */
8382 {
8386 }
8388 /* If the next token is a `(', then we have a parenthesized
8389 type-id. */
8391 {
8395 /* Consume the `('. */
8396 matching_parens parens;
8399 /* Parse the type-id. */
8400 parser->type_definition_forbidden_message
8402 {
8405 }
8408 /* Look for the closing `)'. */
8411 /* There should not be a direct-new-declarator in this production,
8412 but GCC used to allowed this, so we check and emit a sensible error
8413 message for this case. */
8415 {
8421 }
8422 }
8423 /* Otherwise, there must be a new-type-id. */
8424 else
8427 /* If the next token is a `(' or '{', then we have a new-initializer. */
8432 else
8435 /* A new-expression may not appear in an integral constant
8436 expression. */
8439 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8440 of a new-type-id or type-id of a new-expression, the new-expression shall
8441 contain a new-initializer of the form ( assignment-expression )".
8442 Additionally, consistently with the spirit of DR 1467, we want to accept
8443 'new auto { 2 }' too. */
8449 {
8451 "initialization of new-expression for type %<auto%> "
8454 }
8455 else
8456 {
8457 /* Construct a location e.g.:
8458 ptr = new int[100]
8459 ^~~~~~~~~~~~
8460 with caret == start at the start of the "new" token, and the end
8461 at the end of the final token we consumed. */
8466 /* Create a representation of the new-expression. */
8468 tf_warning_or_error);
8470 }
8478 }
8480 /* Parse a new-placement.
8482 new-placement:
8483 ( expression-list )
8485 Returns the same representation as for an expression-list. */
8489 {
8492 /* Parse the expression-list. */
8493 expression_list = (cp_parser_parenthesized_expression_list
8502 }
8504 /* Parse a new-type-id.
8506 new-type-id:
8507 type-specifier-seq new-declarator [opt]
8509 Returns the TYPE allocated. If the new-type-id indicates an array
8510 type, *NELTS is set to the number of elements in the last array
8511 bound; the TYPE will not include the last array bound. */
8513 static tree
8515 {
8516 cp_decl_specifier_seq type_specifier_seq;
8522 /* The type-specifier sequence must not contain type definitions.
8523 (It cannot contain declarations of new types either, but if they
8524 are not definitions we will catch that because they are not
8525 complete.) */
8527 parser->type_definition_forbidden_message
8529 /* Parse the type-specifier-seq. */
8533 /* Restore the old message. */
8539 /* Parse the new-declarator. */
8542 /* Determine the number of elements in the last array dimension, if
8543 any. */
8545 /* Skip down to the last array dimension. */
8550 {
8553 }
8558 {
8561 }
8564 {
8571 else
8573 }
8576 }
8578 /* Parse an (optional) new-declarator.
8580 new-declarator:
8581 ptr-operator new-declarator [opt]
8582 direct-new-declarator
8584 Returns the declarator. */
8588 {
8591 cp_cv_quals cv_quals;
8593 /* We don't know if there's a ptr-operator next, or not. */
8595 /* Look for a ptr-operator. */
8597 /* If that worked, look for more new-declarators. */
8599 {
8602 /* Parse another optional declarator. */
8605 declarator = cp_parser_make_indirect_declarator
8609 }
8611 /* If the next token is a `[', there is a direct-new-declarator. */
8616 }
8618 /* Parse a direct-new-declarator.
8620 direct-new-declarator:
8621 [ expression ]
8622 direct-new-declarator [constant-expression]
8624 */
8628 {
8632 {
8633 tree expression;
8636 /* Look for the opening `['. */
8641 /* The standard requires that the expression have integral
8642 type. DR 74 adds enumeration types. We believe that the
8643 real intent is that these expressions be handled like the
8644 expression in a `switch' condition, which also allows
8645 classes with a single conversion to integral or
8646 enumeration type. */
8648 {
8649 expression
8651 expression,
8654 {
8656 "expression in new-declarator must have integral "
8659 }
8660 }
8662 /* Look for the closing `]'. */
8665 /* Add this bound to the declarator. */
8668 /* If the next token is not a `[', then there are no more
8669 bounds. */
8672 }
8675 }
8677 /* Parse a new-initializer.
8679 new-initializer:
8680 ( expression-list [opt] )
8681 braced-init-list
8683 Returns a representation of the expression-list. */
8687 {
8691 {
8692 tree t;
8699 }
8700 else
8701 expression_list = (cp_parser_parenthesized_expression_list
8707 }
8709 /* Parse a delete-expression.
8711 delete-expression:
8712 :: [opt] delete cast-expression
8713 :: [opt] delete [ ] cast-expression
8715 Returns a representation of the expression. */
8717 static tree
8719 {
8722 tree expression;
8724 /* Look for the optional `::' operator. */
8725 global_scope_p
8729 /* Look for the `delete' keyword. */
8731 /* See if the array syntax is in use. */
8733 {
8734 /* Consume the `[' token. */
8736 /* Look for the `]' token. */
8738 /* Remember that this is the `[]' construct. */
8740 }
8741 else
8744 /* Parse the cast-expression. */
8747 /* A delete-expression may not appear in an integral constant
8748 expression. */
8753 tf_warning_or_error);
8754 }
8756 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8757 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8758 0 otherwise. */
8760 static int
8762 {
8765 {
8807 /* In ((type ()) () the last () isn't a valid cast-expression,
8808 so the whole must be parsed as postfix-expression. */
8813 /* '[' may start a primary-expression in obj-c++ and in C++11,
8814 as a lambda-expression, eg, '(void)[]{}'. */
8821 /* '++' and '--' may or may not start a cast-expression:
8823 struct T { void operator++(int); };
8824 void f() { (T())++; }
8826 vs
8828 int a;
8829 (int)++a; */
8834 }
8835 }
8837 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8838 in the order: const_cast, static_cast, reinterpret_cast.
8840 Don't suggest dynamic_cast.
8842 Return the first legal cast kind found, or NULL otherwise. */
8846 {
8847 tree trial;
8849 /* Reuse the parser logic by attempting to build the various kinds of
8850 cast, with "complain" disabled.
8851 Identify the first such cast that is valid. */
8853 /* Don't attempt to run such logic within template processing. */
8857 /* First try const_cast. */
8862 /* If that fails, try static_cast. */
8867 /* Finally, try reinterpret_cast. */
8872 /* No such cast possible. */
8874 }
8876 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8877 suggesting how to convert a C-style cast of the form:
8879 (DST_TYPE)ORIG_EXPR
8881 to a C++-style cast.
8883 The primary range of RICHLOC is asssumed to be that of the original
8884 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8885 of the parens in the C-style cast. */
8887 static void
8890 tree dst_type)
8891 {
8892 /* This function is non-trivial, so bail out now if the warning isn't
8893 going to be emitted. */
8897 /* Try to find a legal C++ cast, trying them in order:
8898 const_cast, static_cast, reinterpret_cast. */
8903 /* Replace the open paren with "CAST_SUGGESTION<". */
8904 pretty_printer pp;
8908 /* Replace the close paren with "> (". */
8911 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8913 }
8916 /* Parse a cast-expression.
8918 cast-expression:
8919 unary-expression
8920 ( type-id ) cast-expression
8922 ADDRESS_P is true iff the unary-expression is appearing as the
8923 operand of the `&' operator. CAST_P is true if this expression is
8924 the target of a cast.
8926 Returns a representation of the expression. */
8928 static cp_expr
8931 {
8932 /* If it's a `(', then we might be looking at a cast. */
8934 {
8940 /* There's no way to know yet whether or not this is a cast.
8941 For example, `(int (3))' is a unary-expression, while `(int)
8942 3' is a cast. So, we resort to parsing tentatively. */
8944 /* Types may not be defined in a cast. */
8946 parser->type_definition_forbidden_message
8948 /* Consume the `('. */
8949 matching_parens parens;
8954 /* A very tricky bit is that `(struct S) { 3 }' is a
8955 compound-literal (which we permit in C++ as an extension).
8956 But, that construct is not a cast-expression -- it is a
8957 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8958 is legal; if the compound-literal were a cast-expression,
8959 you'd need an extra set of parentheses.) But, if we parse
8960 the type-id, and it happens to be a class-specifier, then we
8961 will commit to the parse at that point, because we cannot
8962 undo the action that is done when creating a new class. So,
8963 then we cannot back up and do a postfix-expression.
8965 Another tricky case is the following (c++/29234):
8967 struct S { void operator () (); };
8969 void foo ()
8970 {
8971 ( S()() );
8972 }
8974 As a type-id we parse the parenthesized S()() as a function
8975 returning a function, groktypename complains and we cannot
8976 back up in this case either.
8978 Therefore, we scan ahead to the closing `)', and check to see
8979 if the tokens after the `)' can start a cast-expression. Otherwise
8980 we are dealing with an unary-expression, a postfix-expression
8981 or something else.
8983 Yet another tricky case, in C++11, is the following (c++/54891):
8985 (void)[]{};
8987 The issue is that usually, besides the case of lambda-expressions,
8988 the parenthesized type-id cannot be followed by '[', and, eg, we
8989 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8990 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8991 we don't commit, we try a cast-expression, then an unary-expression.
8993 Save tokens so that we can put them back. */
8996 /* We may be looking at a cast-expression. */
8999 cast_expression
9002 /* Roll back the tokens we skipped. */
9004 /* If we aren't looking at a cast-expression, simulate an error so
9005 that the call to cp_parser_error_occurred below returns true. */
9008 else
9009 {
9012 /* Look for the type-id. */
9014 /* Look for the closing `)'. */
9019 }
9021 /* Restore the saved message. */
9024 /* At this point this can only be either a cast or a
9025 parenthesized ctor such as `(T ())' that looks like a cast to
9026 function returning T. */
9028 {
9029 /* Only commit if the cast-expression doesn't start with
9030 '++', '--', or '[' in C++11. */
9038 pidk);
9041 {
9042 /* Warn about old-style casts, if so requested. */
9047 {
9053 }
9055 /* Only type conversions to integral or enumeration types
9056 can be used in constant-expressions. */
9059 NIC_CAST))
9062 /* Perform the cast. */
9063 /* Make a location:
9064 (TYPE) EXPR
9065 ^~~~~~~~~~~
9066 with start==caret at the open paren, extending to the
9067 end of "expr". */
9069 open_paren_loc,
9073 }
9074 }
9075 else
9077 }
9079 /* If we get here, then it's not a cast, so it must be a
9080 unary-expression. */
9083 }
9085 /* Parse a binary expression of the general form:
9087 pm-expression:
9088 cast-expression
9089 pm-expression .* cast-expression
9090 pm-expression ->* cast-expression
9092 multiplicative-expression:
9093 pm-expression
9094 multiplicative-expression * pm-expression
9095 multiplicative-expression / pm-expression
9096 multiplicative-expression % pm-expression
9098 additive-expression:
9099 multiplicative-expression
9100 additive-expression + multiplicative-expression
9101 additive-expression - multiplicative-expression
9103 shift-expression:
9104 additive-expression
9105 shift-expression << additive-expression
9106 shift-expression >> additive-expression
9108 relational-expression:
9109 shift-expression
9110 relational-expression < shift-expression
9111 relational-expression > shift-expression
9112 relational-expression <= shift-expression
9113 relational-expression >= shift-expression
9115 GNU Extension:
9117 relational-expression:
9118 relational-expression <? shift-expression
9119 relational-expression >? shift-expression
9121 equality-expression:
9122 relational-expression
9123 equality-expression == relational-expression
9124 equality-expression != relational-expression
9126 and-expression:
9127 equality-expression
9128 and-expression & equality-expression
9130 exclusive-or-expression:
9131 and-expression
9132 exclusive-or-expression ^ and-expression
9134 inclusive-or-expression:
9135 exclusive-or-expression
9136 inclusive-or-expression | exclusive-or-expression
9138 logical-and-expression:
9139 inclusive-or-expression
9140 logical-and-expression && inclusive-or-expression
9142 logical-or-expression:
9143 logical-and-expression
9144 logical-or-expression || logical-and-expression
9146 All these are implemented with a single function like:
9148 binary-expression:
9149 simple-cast-expression
9150 binary-expression <token> binary-expression
9152 CAST_P is true if this expression is the target of a cast.
9154 The binops_by_token map is used to get the tree codes for each <token> type.
9155 binary-expressions are associated according to a precedence table. */
9157 #define TOKEN_PRECEDENCE(token) \
9158 (((token->type == CPP_GREATER \
9159 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9160 && !parser->greater_than_is_operator_p) \
9161 ? PREC_NOT_OPERATOR \
9162 : binops_by_token[token->type].prec)
9164 static cp_expr
9170 {
9171 cp_parser_expression_stack stack;
9173 cp_parser_expression_stack_entry current;
9174 cp_expr rhs;
9178 tree overload;
9180 /* Parse the first expression. */
9191 {
9192 /* Get an operator token. */
9198 {
9200 "%<>>%> operator is treated"
9204 }
9209 /* This is a fold-expression; handle it later. */
9212 /* Popping an entry off the stack means we completed a subexpression:
9213 - either we found a token which is not an operator (`>' where it is not
9214 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9215 will happen repeatedly;
9216 - or, we found an operator which has lower priority. This is the case
9217 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9218 parsing `3 * 4'. */
9220 {
9223 else
9225 }
9227 get_rhs:
9231 /* We used the operator token. */
9234 /* For "false && x" or "true || x", x will never be executed;
9235 disable warnings while evaluating it. */
9237 c_inhibit_evaluation_warnings +=
9240 c_inhibit_evaluation_warnings +=
9243 /* Extract another operand. It may be the RHS of this expression
9244 or the LHS of a new, higher priority expression. */
9249 /* Get another operator token. Look up its precedence to avoid
9250 building a useless (immediately popped) stack entry for common
9251 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9258 {
9259 /* ... and prepare to parse the RHS of the new, higher priority
9260 expression. Since precedence levels on the stack are
9261 monotonically increasing, we do not have to care about
9262 stack overflows. */
9271 pop:
9273 /* If the stack is not empty, we have parsed into LHS the right side
9274 (`4' in the example above) of an expression we had suspended.
9275 We can use the information on the stack to recover the LHS (`3')
9276 from the stack together with the tree code (`MULT_EXPR'), and
9277 the precedence of the higher level subexpression
9278 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9279 which will be used to actually build the additive expression. */
9284 }
9286 /* Undo the disabling of warnings done above. */
9288 c_inhibit_evaluation_warnings -=
9291 c_inhibit_evaluation_warnings -=
9297 /* Avoid warning for !!x == y. */
9302 /* Avoid warning for !b == y where b is boolean. */
9306 /* Avoid warning for !!b == y where b is boolean. */
9319 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9320 ERROR_MARK for everything that is not a binary expression.
9321 This makes warn_about_parentheses miss some warnings that
9322 involve unary operators. For unary expressions we should
9323 pass the correct tree_code unless the unary expression was
9324 surrounded by parentheses.
9325 */
9329 {
9332 else
9333 {
9334 current.lhs
9337 == tcc_comparison
9341 }
9342 }
9343 else
9344 {
9349 /* TODO: build_x_binary_op doesn't always honor the location. */
9351 }
9354 /* If the binary operator required the use of an overloaded operator,
9355 then this expression cannot be an integral constant-expression.
9356 An overloaded operator can be used even if both operands are
9357 otherwise permissible in an integral constant-expression if at
9358 least one of the operands is of enumeration type. */
9362 NIC_OVERLOADED))
9364 }
9367 }
9369 static cp_expr
9374 {
9377 }
9379 /* Parse the `? expression : assignment-expression' part of a
9380 conditional-expression. The LOGICAL_OR_EXPR is the
9381 logical-or-expression that started the conditional-expression.
9382 Returns a representation of the entire conditional-expression.
9384 This routine is used by cp_parser_assignment_expression.
9386 ? expression : assignment-expression
9388 GNU Extensions:
9390 ? : assignment-expression */
9392 static tree
9394 {
9396 cp_expr assignment_expr;
9400 /* Consume the `?' token. */
9405 {
9408 /* Implicit true clause. */
9410 c_inhibit_evaluation_warnings +=
9413 }
9414 else
9415 {
9418 /* Parse the expression. */
9419 c_inhibit_evaluation_warnings +=
9422 c_inhibit_evaluation_warnings +=
9426 }
9428 /* The next token should be a `:'. */
9430 /* Parse the assignment-expression. */
9432 c_inhibit_evaluation_warnings -=
9435 /* Make a location:
9436 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9437 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9438 with the caret at the "?", ranging from the start of
9439 the logical_or_expr to the end of the assignment_expr. */
9444 /* Build the conditional-expression. */
9446 expr,
9447 assignment_expr,
9448 tf_warning_or_error);
9449 }
9451 /* Parse an assignment-expression.
9453 assignment-expression:
9454 conditional-expression
9455 logical-or-expression assignment-operator assignment_expression
9456 throw-expression
9458 CAST_P is true if this expression is the target of a cast.
9459 DECLTYPE_P is true if this expression is the operand of decltype.
9461 Returns a representation for the expression. */
9463 static cp_expr
9466 {
9467 cp_expr expr;
9469 /* If the next token is the `throw' keyword, then we're looking at
9470 a throw-expression. */
9473 /* Otherwise, it must be that we are looking at a
9474 logical-or-expression. */
9475 else
9476 {
9477 /* Parse the binary expressions (logical-or-expression). */
9479 decltype_p,
9481 /* If the next token is a `?' then we're actually looking at a
9482 conditional-expression. */
9485 else
9486 {
9489 /* If it's an assignment-operator, we're using the second
9490 production. */
9491 enum tree_code assignment_operator
9494 {
9497 /* Parse the right-hand side of the assignment. */
9504 /* An assignment may not appear in a
9505 constant-expression. */
9507 NIC_ASSIGNMENT))
9509 /* Build the assignment expression. Its default
9510 location:
9511 LHS = RHS
9512 ~~~~^~~~~
9513 is the location of the '=' token as the
9514 caret, ranging from the start of the lhs to the
9515 end of the rhs. */
9520 assignment_operator,
9521 rhs,
9523 /* TODO: build_x_modify_expr doesn't honor the location,
9524 so we must set it here. */
9526 }
9527 }
9528 }
9531 }
9533 /* Parse an (optional) assignment-operator.
9535 assignment-operator: one of
9536 = *= /= %= += -= >>= <<= &= ^= |=
9538 GNU Extension:
9540 assignment-operator: one of
9541 <?= >?=
9543 If the next token is an assignment operator, the corresponding tree
9544 code is returned, and the token is consumed. For example, for
9545 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9546 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9547 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9548 operator, ERROR_MARK is returned. */
9550 static enum tree_code
9552 {
9556 /* Peek at the next token. */
9560 {
9606 /* Nothing else is an assignment operator. */
9608 }
9610 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9615 /* If it was an assignment operator, consume it. */
9620 }
9622 /* Parse an expression.
9624 expression:
9625 assignment-expression
9626 expression , assignment-expression
9628 CAST_P is true if this expression is the target of a cast.
9629 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9630 except possibly parenthesized or on the RHS of a comma (N3276).
9632 Returns a representation of the expression. */
9634 static cp_expr
9637 {
9642 {
9643 cp_expr assignment_expression;
9645 /* Parse the next assignment-expression. */
9646 assignment_expression
9649 /* We don't create a temporary for a call that is the immediate operand
9650 of decltype or on the RHS of a comma. But when we see a comma, we
9651 need to create a temporary for a call on the LHS. */
9656 assignment_expression
9660 /* If this is the first assignment-expression, we can just
9661 save it away. */
9664 else
9665 {
9666 /* Create a location with caret at the comma, ranging
9667 from the start of the LHS to the end of the RHS. */
9672 assignment_expression,
9675 }
9676 /* If the next token is not a comma, or we're in a fold-expression, then
9677 we are done with the expression. */
9681 /* Consume the `,'. */
9684 /* A comma operator cannot appear in a constant-expression. */
9687 }
9690 }
9692 /* Parse a constant-expression.
9694 constant-expression:
9695 conditional-expression
9697 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9698 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9699 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9700 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9701 only parse a conditional-expression, otherwise parse an
9702 assignment-expression. See below for rationale. */
9704 static cp_expr
9709 {
9713 cp_expr expression;
9715 /* It might seem that we could simply parse the
9716 conditional-expression, and then check to see if it were
9717 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9718 one that the compiler can figure out is constant, possibly after
9719 doing some simplifications or optimizations. The standard has a
9720 precise definition of constant-expression, and we must honor
9721 that, even though it is somewhat more restrictive.
9723 For example:
9725 int i[(2, 3)];
9727 is not a legal declaration, because `(2, 3)' is not a
9728 constant-expression. The `,' operator is forbidden in a
9729 constant-expression. However, GCC's constant-folding machinery
9730 will fold this operation to an INTEGER_CST for `3'. */
9732 /* Save the old settings. */
9734 saved_allow_non_integral_constant_expression_p
9737 /* We are now parsing a constant-expression. */
9739 parser->allow_non_integral_constant_expression_p
9742 /* Although the grammar says "conditional-expression", when not STRICT_P,
9743 we parse an "assignment-expression", which also permits
9744 "throw-expression" and the use of assignment operators. In the case
9745 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9746 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9747 actually essential that we look for an assignment-expression.
9748 For example, cp_parser_initializer_clauses uses this function to
9749 determine whether a particular assignment-expression is in fact
9750 constant. */
9752 {
9753 /* Parse the binary expressions (logical-or-expression). */
9756 /* If the next token is a `?' then we're actually looking at
9757 a conditional-expression; otherwise we're done. */
9760 }
9761 else
9763 /* Restore the old settings. */
9764 parser->integral_constant_expression_p
9766 parser->allow_non_integral_constant_expression_p
9769 {
9770 /* Require an rvalue constant expression here; that's what our
9771 callers expect. Reference constant expressions are handled
9772 separately in e.g. cp_parser_template_argument. */
9781 }
9784 parser->non_integral_constant_expression_p
9788 }
9790 /* Parse __builtin_offsetof.
9792 offsetof-expression:
9793 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9795 offsetof-member-designator:
9796 id-expression
9797 | offsetof-member-designator "." id-expression
9798 | offsetof-member-designator "[" expression "]"
9799 | offsetof-member-designator "->" id-expression */
9801 static cp_expr
9803 {
9805 tree type;
9806 cp_expr expr;
9807 cp_id_kind dummy;
9809 location_t finish_loc;
9811 /* We're about to accept non-integral-constant things, but will
9812 definitely yield an integral constant expression. Save and
9813 restore these values around our local parsing. */
9819 /* Consume the "__builtin_offsetof" token. */
9821 /* Consume the opening `('. */
9822 matching_parens parens;
9824 /* Parse the type-id. */
9827 /* Look for the `,'. */
9831 /* Build the (type *)null that begins the traditional offsetof macro. */
9832 tree object_ptr
9834 tf_warning_or_error);
9836 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9840 {
9843 {
9845 /* offsetof-member-designator "[" expression "]" */
9851 /* offsetof-member-designator "->" identifier */
9854 /* FALLTHRU */
9857 /* offsetof-member-designator "." identifier */
9865 /* Consume the ")" token. */
9871 /* Error. We know the following require will fail, but
9872 that gives the proper error message. */
9877 }
9878 }
9880 success:
9881 /* Make a location of the form:
9882 __builtin_offsetof (struct s, f)
9883 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9884 with caret at the type-id, ranging from the start of the
9885 "_builtin_offsetof" token to the close paren. */
9887 /* The result will be an INTEGER_CST, so we need to explicitly
9888 preserve the location. */
9891 failure:
9897 }
9899 /* Parse a trait expression.
9901 Returns a representation of the expression, the underlying type
9902 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9904 static cp_expr
9906 {
9907 cp_trait_kind kind;
9913 {
10015 }
10017 /* Get location of initial token. */
10020 /* Consume the token. */
10023 matching_parens parens;
10026 {
10029 }
10035 {
10038 {
10041 }
10045 }
10047 {
10049 {
10053 {
10056 }
10060 }
10061 }
10066 /* Construct a location of the form:
10067 __is_trivially_copyable(_Tp)
10068 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10069 with start == caret, finishing at the close-paren. */
10072 /* Complete the trait expression, which may mean either processing
10073 the trait expr now or saving it for template instantiation. */
10075 {
10084 }
10085 }
10087 /* Parse a lambda expression.
10089 lambda-expression:
10090 lambda-introducer lambda-declarator [opt] compound-statement
10092 Returns a representation of the expression. */
10094 static cp_expr
10096 {
10098 tree type;
10106 {
10108 {
10112 }
10114 }
10116 {
10118 {
10121 }
10123 }
10125 /* We may be in the middle of deferred access check. Disable
10126 it now. */
10137 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10140 /* Now that we've started the type, add the capture fields for any
10141 explicit captures. */
10144 {
10145 /* Inside the class, surrounding template-parameter-lists do not apply. */
10146 unsigned int saved_num_template_parameter_lists
10150 bool fully_implicit_function_template_p
10154 bool auto_is_implicit_function_template_parm_p
10165 /* By virtue of defining a local class, a lambda expression has access to
10166 the private variables of enclosing classes. */
10174 {
10179 }
10181 {
10184 }
10186 /* The capture list was built up in reverse order; fix that now. */
10198 parser->fully_implicit_function_template_p
10202 parser->auto_is_implicit_function_template_parm_p
10204 }
10206 /* This field is only used during parsing of the lambda. */
10209 /* This lambda shouldn't have any proxies left at this point. */
10211 /* And now that we're done, push proxies for an enclosing lambda. */
10216 else
10224 }
10226 /* Parse the beginning of a lambda expression.
10228 lambda-introducer:
10229 [ lambda-capture [opt] ]
10231 LAMBDA_EXPR is the current representation of the lambda expression. */
10233 static void
10235 {
10236 /* Need commas after the first capture. */
10239 /* Eat the leading `['. */
10242 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10250 {
10253 }
10256 {
10258 tree capture_id;
10259 tree capture_init_expr;
10263 enum capture_kind_type
10264 {
10265 BY_COPY,
10266 BY_REFERENCE
10267 };
10271 {
10274 }
10278 else
10281 /* Possibly capture `this'. */
10283 {
10294 explicit_init_p);
10296 }
10298 /* Possibly capture `*this'. */
10301 {
10312 explicit_init_p);
10314 }
10316 /* Remember whether we want to capture as a reference or not. */
10318 {
10321 }
10323 /* Get the identifier. */
10328 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10329 delimiters, but I modified this to stop on unnested ']' as well. It
10330 was already changed to stop on unnested '}', so the
10331 "closing_parenthesis" name is no more misleading with my change. */
10332 {
10338 }
10340 /* Find the initializer for this capture. */
10344 {
10346 /* An explicit initializer exists. */
10349 "lambda capture initializers "
10355 {
10358 }
10359 }
10360 else
10361 {
10364 /* Turn the identifier into an id-expression. */
10365 capture_init_expr
10370 {
10373 }
10376 {
10379 capture_init_expr);
10384 }
10387 {
10390 capture_init_expr))
10394 }
10396 capture_init_expr
10397 = finish_id_expression
10399 capture_init_expr,
10413 {
10416 }
10417 }
10421 {
10426 capture_id);
10430 "capture of %qD redundant with by-reference capture "
10432 }
10435 capture_id,
10436 capture_init_expr,
10438 explicit_init_p);
10440 /* If there is any qualification still in effect, clear it
10441 now; we will be starting fresh with the next capture. */
10445 }
10448 }
10450 /* Parse the (optional) middle of a lambda expression.
10452 lambda-declarator:
10453 < template-parameter-list [opt] >
10454 ( parameter-declaration-clause [opt] )
10455 attribute-specifier [opt]
10456 decl-specifier-seq [opt]
10457 exception-specification [opt]
10458 lambda-return-type-clause [opt]
10460 LAMBDA_EXPR is the current representation of the lambda expression. */
10462 static bool
10464 {
10465 /* 5.1.1.4 of the standard says:
10466 If a lambda-expression does not include a lambda-declarator, it is as if
10467 the lambda-declarator were ().
10468 This means an empty parameter list, no attributes, and no exception
10469 specification. */
10476 cp_decl_specifier_seq lambda_specs;
10479 /* The template-parameter-list is optional, but must begin with
10480 an opening angle if present. */
10482 {
10485 "lambda templates are only available with "
10489 "lambda templates are only available with "
10498 /* We just processed one more parameter list. */
10500 }
10502 /* The parameter-declaration-clause is optional (unless
10503 template-parameter-list was given), but must begin with an
10504 opening parenthesis if present. */
10506 {
10507 matching_parens parens;
10512 /* Parse parameters. */
10515 /* Default arguments shall not be specified in the
10516 parameter-declaration-clause of a lambda-declarator. */
10527 /* In the decl-specifier-seq of the lambda-declarator, each
10528 decl-specifier shall either be mutable or constexpr. */
10532 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10535 {
10540 }
10544 /* Parse optional exception specification. */
10547 /* Parse optional trailing return type. */
10549 {
10552 }
10554 /* The function parameters must be in scope all the way until after the
10555 trailing-return-type in case of decltype. */
10557 }
10561 /* Create the function call operator.
10563 Messing with declarators like this is no uglier than building up the
10564 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10565 other code. */
10566 {
10567 cp_decl_specifier_seq return_type_specs;
10569 tree fco;
10576 else
10577 /* Maybe we will deduce the return type later. */
10581 {
10585 else
10588 }
10597 VIRT_SPEC_UNSPECIFIED,
10598 REF_QUAL_NONE,
10599 tx_qual,
10600 exception_spec,
10606 declarator,
10607 attributes);
10609 {
10612 /* Give the object parameter a different name. */
10616 }
10618 {
10622 }
10631 }
10632 }
10634 /* Parse the body of a lambda expression, which is simply
10636 compound-statement
10638 but which requires special handling.
10639 LAMBDA_EXPR is the current representation of the lambda expression. */
10641 static void
10643 {
10650 else
10651 /* Still increment function_depth so that we don't GC in the
10652 middle of an expression. */
10657 /* Clear this in case we're in the middle of a default argument. */
10661 {
10665 matching_braces braces;
10668 {
10671 /* Originally C++11 required us to peek for 'return expr'; and
10672 process it specially here to deduce the return type. N3638
10673 removed the need for that. */
10681 }
10684 }
10691 else
10693 }
10695 /* Statements [gram.stmt.stmt] */
10697 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10699 static void
10701 {
10705 /* A concept is never expanded normally. */
10711 }
10713 /* Parse a statement.
10715 statement:
10716 labeled-statement
10717 expression-statement
10718 compound-statement
10719 selection-statement
10720 iteration-statement
10721 jump-statement
10722 declaration-statement
10723 try-block
10725 C++11:
10727 statement:
10728 labeled-statement
10729 attribute-specifier-seq (opt) expression-statement
10730 attribute-specifier-seq (opt) compound-statement
10731 attribute-specifier-seq (opt) selection-statement
10732 attribute-specifier-seq (opt) iteration-statement
10733 attribute-specifier-seq (opt) jump-statement
10734 declaration-statement
10735 attribute-specifier-seq (opt) try-block
10737 init-statement:
10738 expression-statement
10739 simple-declaration
10741 TM Extension:
10743 statement:
10744 atomic-statement
10746 IN_COMPOUND is true when the statement is nested inside a
10747 cp_parser_compound_statement; this matters for certain pragmas.
10749 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10750 is a (possibly labeled) if statement which is not enclosed in braces
10751 and has an else clause. This is used to implement -Wparentheses.
10753 CHAIN is a vector of if-else-if conditions. */
10755 static void
10759 {
10764 restart:
10767 /* There is no statement yet. */
10773 /* In obj-c++, seeing '[[' might be the either the beginning of
10774 c++11 attributes, or a nested objc-message-expression. So
10775 let's parse the c++11 attributes tentatively. */
10779 {
10782 }
10784 /* Peek at the next token. */
10786 /* Remember the location of the first token in the statement. */
10789 /* If this is a keyword, then that will often determine what kind of
10790 statement we have. */
10792 {
10796 {
10799 /* Looks like a labeled-statement with a case label.
10800 Parse the label, and then use tail recursion to parse
10801 the statement. */
10824 /* Objective-C++ exception-handling constructs. */
10838 /* This must be a namespace alias definition. */
10854 /* It might be a keyword like `int' that can start a
10855 declaration-statement. */
10857 }
10858 }
10860 {
10861 /* If the next token is a `:', then we are looking at a
10862 labeled-statement. */
10865 {
10866 /* Looks like a labeled-statement with an ordinary label.
10867 Parse the label, and then use tail recursion to parse
10868 the statement. */
10873 }
10874 }
10875 /* Anything that starts with a `{' must be a compound-statement. */
10878 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10879 a statement all its own. */
10881 {
10882 /* Only certain OpenMP pragmas are attached to statements, and thus
10883 are considered statements themselves. All others are not. In
10884 the context of a compound, accept the pragma as a "statement" and
10885 return so that we can check for a close brace. Otherwise we
10886 require a real statement and must go back and read one. */
10892 }
10894 {
10897 }
10899 /* Everything else must be a declaration-statement or an
10900 expression-statement. Try for the declaration-statement
10901 first, unless we are looking at a `;', in which case we know that
10902 we have an expression-statement. */
10904 {
10906 {
10908 {
10909 /* Attributes should be parsed as part of the the
10910 declaration, so let's un-parse them. */
10913 }
10916 /* Try to parse the declaration-statement. */
10918 /* If that worked, we're done. */
10921 }
10922 /* All preceding labels have been parsed at this point. */
10926 /* Look for an expression-statement instead. */
10929 /* Handle [[fallthrough]];. */
10931 {
10932 /* The next token after the fallthrough attribute is ';'. */
10934 {
10935 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10937 IFN_FALLTHROUGH,
10940 }
10941 else
10945 }
10946 }
10948 /* Set the line number for the statement. */
10952 /* Allow "[[fallthrough]];", but warn otherwise. */
10955 OPT_Wattributes,
10957 }
10959 /* Append ATTR to attribute list ATTRS. */
10961 static tree
10963 {
10969 }
10971 /* Parse the label for a labeled-statement, i.e.
10973 identifier :
10974 case constant-expression :
10975 default :
10977 GNU Extension:
10978 case constant-expression ... constant-expression : statement
10980 When a label is parsed without errors, the label is added to the
10981 parse tree by the finish_* functions, so this function doesn't
10982 have to return the label. */
10984 static void
10986 {
10991 /* The next token should be an identifier. */
10995 {
10998 }
11000 /* Remember whether this case or a user-defined label is allowed to fall
11001 through to. */
11006 {
11008 {
11012 /* Consume the `case' token. */
11014 /* Parse the constant-expression. */
11021 {
11022 /* Consume the `...' token. */
11028 /* We don't need to emit warnings here, as the common code
11029 will do this for us. */
11030 }
11031 else
11035 {
11039 }
11040 else
11043 expr);
11044 }
11048 /* Consume the `default' token. */
11052 {
11056 }
11057 else
11062 /* Anything else must be an ordinary label. */
11067 }
11069 /* Require the `:' token. */
11072 /* An ordinary label may optionally be followed by attributes.
11073 However, this is only permitted if the attributes are then
11074 followed by a semicolon. This is because, for backward
11075 compatibility, when parsing
11076 lab: __attribute__ ((unused)) int i;
11077 we want the attribute to attach to "i", not "lab". */
11080 {
11081 tree attrs;
11088 ;
11089 else
11091 }
11097 }
11099 /* Parse an expression-statement.
11101 expression-statement:
11102 expression [opt] ;
11104 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11105 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11106 indicates whether this expression-statement is part of an
11107 expression statement. */
11109 static tree
11111 {
11116 /* There might be attribute fallthrough. */
11119 /* If the next token is a ';', then there is no expression
11120 statement. */
11122 {
11126 {
11129 }
11130 }
11132 /* Handle [[fallthrough]];. */
11134 {
11135 /* The next token after the fallthrough attribute is ';'. */
11137 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11140 else
11144 }
11146 /* Allow "[[fallthrough]];", but warn otherwise. */
11151 /* Give a helpful message for "A<T>::type t;" and the like. */
11154 {
11161 {
11162 /* A::A a; */
11167 }
11168 }
11170 /* Consume the final `;'. */
11175 /* This is the final expression statement of a statement
11176 expression. */
11182 }
11184 /* Parse a compound-statement.
11186 compound-statement:
11187 { statement-seq [opt] }
11189 GNU extension:
11191 compound-statement:
11192 { label-declaration-seq [opt] statement-seq [opt] }
11194 label-declaration-seq:
11195 label-declaration
11196 label-declaration-seq label-declaration
11198 Returns a tree representing the statement. */
11200 static tree
11203 {
11204 tree compound_stmt;
11205 matching_braces braces;
11207 /* Consume the `{'. */
11214 /* Begin the compound-statement. */
11216 /* If the next keyword is `__label__' we have a label declaration. */
11219 /* Parse an (optional) statement-seq. */
11221 /* Finish the compound-statement. */
11223 /* Consume the `}'. */
11227 }
11229 /* Parse an (optional) statement-seq.
11231 statement-seq:
11232 statement
11233 statement-seq [opt] statement */
11235 static void
11237 {
11238 /* Scan statements until there aren't any more. */
11240 {
11243 /* If we are looking at a `}', then we have run out of
11244 statements; the same is true if we have reached the end
11245 of file, or have stumbled upon a stray '@end'. */
11252 /* If we are in a compound statement and find 'else' then
11253 something went wrong. */
11255 {
11258 else
11259 {
11262 }
11263 }
11265 /* Parse the statement. */
11267 }
11268 }
11270 /* Return true if we're looking at (init; cond), false otherwise. */
11272 static bool
11274 {
11275 /* Save tokens so that we can put them back. */
11278 /* Look for ';' that is not nested in () or {}. */
11281 CPP_SEMICOLON,
11284 /* Roll back the tokens we skipped. */
11288 }
11290 /* Parse a selection-statement.
11292 selection-statement:
11293 if ( init-statement [opt] condition ) statement
11294 if ( init-statement [opt] condition ) statement else statement
11295 switch ( init-statement [opt] condition ) statement
11297 Returns the new IF_STMT or SWITCH_STMT.
11299 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11300 is a (possibly labeled) if statement which is not enclosed in
11301 braces and has an else clause. This is used to implement
11302 -Wparentheses.
11304 CHAIN is a vector of if-else-if conditions. This is used to implement
11305 -Wduplicated-cond. */
11307 static tree
11310 {
11313 token_indent_info guard_tinfo;
11318 /* Peek at the next token. */
11322 /* See what kind of keyword it is. */
11325 {
11328 {
11329 tree statement;
11330 tree condition;
11335 RID_CONSTEXPR))
11336 {
11342 }
11344 /* Look for the `('. */
11345 matching_parens parens;
11347 {
11350 }
11352 /* Begin the selection-statement. */
11354 {
11357 }
11358 else
11361 /* Parse the optional init-statement. */
11363 {
11364 tree decl;
11367 "init-statement in selection statements only available "
11370 }
11372 /* Parse the condition. */
11374 /* Look for the `)'. */
11380 {
11384 /* Add the condition. */
11391 /* Parse the then-clause. */
11395 /* Outside a template, the non-selected branch of a constexpr
11396 if is a 'discarded statement', i.e. unevaluated. */
11401 {
11404 }
11407 guard_tinfo);
11414 {
11418 }
11420 /* If the next token is `else', parse the else-clause. */
11422 RID_ELSE))
11423 {
11427 {
11430 }
11432 guard_tinfo
11434 /* Consume the `else' keyword. */
11437 {
11439 RID_IF)
11441 {
11442 /* We've got "if (COND) else if (COND2)". Start
11443 the condition chain and add COND as the first
11444 element. */
11448 {
11449 /* Wrap it in a NOP_EXPR so that we can set the
11450 location of the condition. */
11452 condition);
11455 }
11456 }
11458 RID_IF))
11459 {
11460 /* This is if-else without subsequent if. Zap the
11461 condition chain; we would have already warned at
11462 this point. */
11465 }
11466 }
11468 /* Parse the else-clause. */
11474 /* If we are currently parsing a then-clause, then
11475 IF_P will not be NULL. We set it to true to
11476 indicate that this if statement has an else clause.
11477 This may trigger the Wparentheses warning below
11478 when we get back up to the parent if statement. */
11483 {
11487 }
11488 }
11489 else
11490 {
11491 /* This if statement does not have an else clause. If
11492 NESTED_IF is true, then the then-clause has an if
11493 statement which does have an else clause. We warn
11494 about the potential ambiguity. */
11497 "suggest explicit braces to avoid ambiguous"
11500 {
11501 /* We don't need the condition chain anymore. */
11504 }
11505 }
11507 /* Now we're all done with the if-statement. */
11509 }
11510 else
11511 {
11515 /* Add the condition. */
11518 /* Parse the body of the switch-statement. */
11524 guard_tinfo);
11528 /* Now we're all done with the switch-statement. */
11530 }
11533 }
11539 }
11540 }
11542 /* Parse a condition.
11544 condition:
11545 expression
11546 type-specifier-seq declarator = initializer-clause
11547 type-specifier-seq declarator braced-init-list
11549 GNU Extension:
11551 condition:
11552 type-specifier-seq declarator asm-specification [opt]
11553 attributes [opt] = assignment-expression
11555 Returns the expression that should be tested. */
11557 static tree
11559 {
11560 cp_decl_specifier_seq type_specifiers;
11564 /* Try the declaration first. */
11566 /* New types are not allowed in the type-specifier-seq for a
11567 condition. */
11569 parser->type_definition_forbidden_message
11571 /* Parse the type-specifier-seq. */
11573 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11576 /* Restore the saved message. */
11578 /* If all is well, we might be looking at a declaration. */
11580 {
11581 tree decl;
11582 tree asm_specification;
11583 tree attributes;
11587 /* Parse the declarator. */
11593 /* Parse the attributes. */
11595 /* Parse the asm-specification. */
11597 /* If the next token is not an `=' or '{', then we might still be
11598 looking at an expression. For example:
11600 if (A(a).x)
11602 looks like a decl-specifier-seq and a declarator -- but then
11603 there is no `=', so this is an expression. */
11608 /* If we did see an `=' or '{', then we are looking at a declaration
11609 for sure. */
11611 {
11612 tree pushed_scope;
11616 /* Create the declaration. */
11622 /* Parse the initializer. */
11624 {
11628 }
11629 else
11630 {
11631 /* Consume the `='. */
11634 }
11638 /* Process the initializer. */
11641 asm_specification,
11642 flags);
11648 }
11649 }
11650 /* If we didn't even get past the declarator successfully, we are
11651 definitely not looking at a declaration. */
11652 else
11655 /* Otherwise, we are looking at an expression. */
11657 }
11659 /* Parses a for-statement or range-for-statement until the closing ')',
11660 not included. */
11662 static tree
11664 {
11668 /* Begin the for-statement. */
11671 /* Parse the initialization. */
11676 else
11678 }
11680 static tree
11683 {
11684 /* Normal for loop */
11687 tree stmt;
11690 /* The init-statement has already been parsed in
11691 cp_parser_init_statement, so no work is needed here. */
11694 /* If there's a condition, process it. */
11698 {
11702 }
11704 {
11708 }
11710 /* Look for the `;'. */
11713 /* If there's an expression, process it. */
11719 }
11721 /* Tries to parse a range-based for-statement:
11723 range-based-for:
11724 decl-specifier-seq declarator : expression
11726 The decl-specifier-seq declarator and the `:' are already parsed by
11727 cp_parser_init_statement. If processing_template_decl it returns a
11728 newly created RANGE_FOR_STMT; if not, it is converted to a
11729 regular FOR_STMT. */
11731 static tree
11734 {
11741 /* Get the range declaration momentarily out of the way so that
11742 the range expression doesn't clash with it. */
11744 {
11746 {
11748 /* For decomposition declaration get all of the corresponding
11749 declarations out of the way. */
11753 {
11759 {
11765 }
11766 }
11767 }
11769 {
11774 }
11775 }
11778 {
11781 }
11782 else
11785 /* Put the range declaration(s) back into scope. */
11787 {
11791 }
11793 /* If in template, STMT is converted to a normal for-statement
11794 at instantiation. If not, it is done just ahead. */
11796 {
11806 /* do_auto_deduction doesn't mess with template init-lists. */
11809 }
11810 else
11811 {
11815 unroll);
11816 }
11818 }
11820 /* Subroutine of cp_convert_range_for: given the initializer expression,
11821 builds up the range temporary. */
11823 static tree
11825 {
11828 /* Find out the type deduced by the declaration
11829 `auto &&__range = range_expr'. */
11834 /* Create the __range variable. */
11841 }
11843 /* Used by cp_parser_range_for in template context: we aren't going to
11844 do a full conversion yet, but we still need to resolve auto in the
11845 type of the for-range-declaration if present. This is basically
11846 a shortcut version of cp_convert_range_for. */
11848 static void
11850 {
11853 {
11856 iter_type = (cp_parser_perform_range_for_lookup
11859 {
11861 iter_type);
11863 RO_UNARY_STAR,
11864 tf_warning_or_error);
11867 }
11868 }
11869 }
11871 /* Converts a range-based for-statement into a normal
11872 for-statement, as per the definition.
11874 for (RANGE_DECL : RANGE_EXPR)
11875 BLOCK
11877 should be equivalent to:
11879 {
11880 auto &&__range = RANGE_EXPR;
11881 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11882 __begin != __end;
11883 ++__begin)
11884 {
11885 RANGE_DECL = *__begin;
11886 BLOCK
11887 }
11888 }
11890 If RANGE_EXPR is an array:
11891 BEGIN_EXPR = __range
11892 END_EXPR = __range + ARRAY_SIZE(__range)
11893 Else if RANGE_EXPR has a member 'begin' or 'end':
11894 BEGIN_EXPR = __range.begin()
11895 END_EXPR = __range.end()
11896 Else:
11897 BEGIN_EXPR = begin(__range)
11898 END_EXPR = end(__range);
11900 If __range has a member 'begin' but not 'end', or vice versa, we must
11901 still use the second alternative (it will surely fail, however).
11902 When calling begin()/end() in the third alternative we must use
11903 argument dependent lookup, but always considering 'std' as an associated
11904 namespace. */
11906 tree
11910 {
11918 /* If an error happened previously do nothing or else a lot of
11919 unhelpful errors would be issued. */
11921 else
11922 {
11923 tree range_temp;
11927 /* Can't bind a reference to an array of runtime bound. */
11929 else
11930 {
11935 LOOKUP_ONLYCONVERTING);
11937 }
11940 }
11942 /* The new for initialization statement. */
11950 LOOKUP_ONLYCONVERTING);
11961 LOOKUP_ONLYCONVERTING);
11965 /* The new for condition. */
11972 /* The new increment expression. */
11975 tf_warning_or_error);
11981 /* The declaration is initialized with *__begin inside the loop body. */
11984 tf_warning_or_error),
11986 LOOKUP_ONLYCONVERTING);
11991 }
11993 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11994 We need to solve both at the same time because the method used
11995 depends on the existence of members begin or end.
11996 Returns the type deduced for the iterator expression. */
11998 static tree
12000 {
12002 {
12005 }
12008 {
12013 }
12015 {
12016 /* If RANGE is an array, we will use pointer arithmetic. */
12019 range,
12023 }
12024 else
12025 {
12026 /* If it is not an array, we must do a bit of magic. */
12036 tf_warning_or_error);
12039 tf_warning_or_error);
12042 {
12043 /* Use the member functions. */
12046 }
12047 else
12048 {
12049 /* Use global functions with ADL. */
12056 tf_warning_or_error);
12058 tf_warning_or_error);
12060 tf_warning_or_error);
12062 tf_warning_or_error);
12065 }
12067 /* Last common checks. */
12069 {
12070 /* If one of the expressions is an error do no more checks. */
12073 }
12076 /* Can happen, when, eg, in a template context, Koenig lookup
12077 can't resolve begin/end (c++/58503). */
12079 else
12080 {
12082 /* The unqualified type of the __begin and __end temporaries should
12083 be the same, as required by the multiple auto declaration. */
12085 {
12092 /* P0184R0 allows __begin and __end to have different types,
12093 but make sure they are comparable so we can give a better
12095 else
12099 }
12101 }
12102 }
12103 }
12105 /* Helper function for cp_parser_perform_range_for_lookup.
12106 Builds a tree for RANGE.IDENTIFIER(). */
12108 static tree
12110 {
12123 tf_warning_or_error);
12126 }
12128 /* Parse an iteration-statement.
12130 iteration-statement:
12131 while ( condition ) statement
12132 do statement while ( expression ) ;
12133 for ( init-statement condition [opt] ; expression [opt] )
12134 statement
12136 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12138 static tree
12141 {
12144 tree statement;
12146 token_indent_info guard_tinfo;
12148 /* Peek at the next token. */
12155 /* Remember whether or not we are already within an iteration
12156 statement. */
12159 /* See what kind of keyword it is. */
12162 {
12164 {
12165 tree condition;
12167 /* Begin the while-statement. */
12169 /* Look for the `('. */
12170 matching_parens parens;
12172 /* Parse the condition. */
12175 /* Look for the `)'. */
12177 /* Parse the dependent statement. */
12183 /* We're done with the while-statement. */
12185 }
12189 {
12190 tree expression;
12192 /* Begin the do-statement. */
12194 /* Parse the body of the do-statement. */
12201 /* Look for the `while' keyword. */
12203 /* Look for the `('. */
12204 matching_parens parens;
12206 /* Parse the expression. */
12208 /* We're done with the do-statement. */
12210 /* Look for the `)'. */
12212 /* Look for the `;'. */
12214 }
12218 {
12219 /* Look for the `('. */
12220 matching_parens parens;
12225 /* Look for the `)'. */
12228 /* Parse the body of the for-statement. */
12235 /* We're done with the for-statement. */
12237 }
12244 }
12247 }
12249 /* Parse a init-statement or the declarator of a range-based-for.
12250 Returns true if a range-based-for declaration is seen.
12252 init-statement:
12253 expression-statement
12254 simple-declaration */
12256 static bool
12258 {
12259 /* If the next token is a `;', then we have an empty
12260 expression-statement. Grammatically, this is also a
12261 simple-declaration, but an invalid one, because it does not
12262 declare anything. Therefore, if we did not handle this case
12263 specially, we would issue an error message about an invalid
12264 declaration. */
12266 {
12270 /* A colon is used in range-based for. */
12273 /* We're going to speculatively look for a declaration, falling back
12274 to an expression, if necessary. */
12276 /* Parse the declaration. */
12279 decl);
12282 {
12283 /* It is a range-for, consume the ':' */
12287 {
12289 "range-based %<for%> loops only available with "
12292 }
12293 }
12294 else
12295 /* The ';' is not consumed yet because we told
12296 cp_parser_simple_declaration not to. */
12301 /* If the tentative parse failed, then we shall need to look for an
12302 expression-statement. */
12303 }
12304 /* If we are here, it is an expression-statement. */
12307 }
12309 /* Parse a jump-statement.
12311 jump-statement:
12312 break ;
12313 continue ;
12314 return expression [opt] ;
12315 return braced-init-list ;
12316 goto identifier ;
12318 GNU extension:
12320 jump-statement:
12321 goto * expression ;
12323 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12325 static tree
12327 {
12333 /* Peek at the next token. */
12338 /* See what kind of keyword it is. */
12341 {
12345 {
12362 }
12368 {
12372 /* Fall through. */
12382 }
12387 {
12388 tree expr;
12392 {
12396 }
12399 else
12400 /* If the next token is a `;', then there is no
12401 expression. */
12403 /* Build the return-statement. */
12406 else
12408 /* Look for the final `;'. */
12410 }
12416 {
12419 }
12421 /* Create the goto-statement. */
12423 {
12424 /* Issue a warning about this use of a GNU extension. */
12426 /* Consume the '*' token. */
12428 /* Parse the dependent expression. */
12430 }
12431 else
12433 /* Look for the final `;'. */
12440 }
12443 }
12445 /* Parse a declaration-statement.
12447 declaration-statement:
12448 block-declaration */
12450 static void
12452 {
12455 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12458 /* Parse the block-declaration. */
12461 /* Free any declarators allocated. */
12463 }
12465 /* Some dependent statements (like `if (cond) statement'), are
12466 implicitly in their own scope. In other words, if the statement is
12467 a single statement (as opposed to a compound-statement), it is
12468 none-the-less treated as if it were enclosed in braces. Any
12469 declarations appearing in the dependent statement are out of scope
12470 after control passes that point. This function parses a statement,
12471 but ensures that is in its own scope, even if it is not a
12472 compound-statement.
12474 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12475 is a (possibly labeled) if statement which is not enclosed in
12476 braces and has an else clause. This is used to implement
12477 -Wparentheses.
12479 CHAIN is a vector of if-else-if conditions. This is used to implement
12480 -Wduplicated-cond.
12482 Returns the new statement. */
12484 static tree
12488 {
12489 tree statement;
12492 token_indent_info body_tinfo
12498 /* Mark if () ; with a special NOP_EXPR. */
12500 {
12511 }
12512 /* if a compound is opened, we simply parse the statement directly. */
12515 /* If the token is not a `{', then we must take special action. */
12516 else
12517 {
12518 /* Create a compound-statement. */
12520 /* Parse the dependent-statement. */
12523 /* Finish the dummy compound-statement. */
12525 }
12527 token_indent_info next_tinfo
12536 /* Return the statement. */
12538 }
12540 /* For some dependent statements (like `while (cond) statement'), we
12541 have already created a scope. Therefore, even if the dependent
12542 statement is a compound-statement, we do not want to create another
12543 scope. */
12545 static void
12548 {
12549 /* If the token is a `{', then we must take special action. */
12551 {
12552 token_indent_info body_tinfo
12558 token_indent_info next_tinfo
12567 }
12568 else
12569 {
12570 /* Avoid calling cp_parser_compound_statement, so that we
12571 don't create a new scope. Do everything else by hand. */
12572 matching_braces braces;
12574 /* If the next keyword is `__label__' we have a label declaration. */
12577 /* Parse an (optional) statement-seq. */
12580 }
12581 }
12583 /* Declarations [gram.dcl.dcl] */
12585 /* Parse an optional declaration-sequence.
12587 declaration-seq:
12588 declaration
12589 declaration-seq declaration */
12591 static void
12593 {
12595 {
12606 {
12607 /* A declaration consisting of a single semicolon is
12608 invalid. Allow it unless we're being pedantic. */
12613 }
12615 /* If we're entering or exiting a region that's implicitly
12616 extern "C", modify the lang context appropriately. */
12618 {
12621 }
12623 {
12626 }
12629 {
12630 /* A top-level declaration can consist solely of a #pragma.
12631 A nested declaration cannot, so this is done here and not
12632 in cp_parser_declaration. (A #pragma at block scope is
12633 handled in cp_parser_statement.) */
12636 }
12638 /* Parse the declaration itself. */
12640 }
12641 }
12643 /* Parse a declaration.
12645 declaration:
12646 block-declaration
12647 function-definition
12648 template-declaration
12649 explicit-instantiation
12650 explicit-specialization
12651 linkage-specification
12652 namespace-definition
12654 C++17:
12655 deduction-guide
12657 GNU extension:
12659 declaration:
12660 __extension__ declaration */
12662 static void
12664 {
12665 cp_token token1;
12666 cp_token token2;
12671 /* Check for the `__extension__' keyword. */
12673 {
12674 /* Parse the qualified declaration. */
12676 /* Restore the PEDANTIC flag. */
12680 }
12682 /* Try to figure out what kind of declaration is present. */
12687 else
12688 {
12691 }
12693 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12696 /* If the next token is `extern' and the following token is a string
12697 literal, then we have a linkage specification. */
12701 /* If the next token is `template', then we have either a template
12702 declaration, an explicit instantiation, or an explicit
12703 specialization. */
12705 {
12706 /* `template <>' indicates a template specialization. */
12710 /* `template <' indicates a template declaration. */
12713 /* Anything else must be an explicit instantiation. */
12714 else
12716 }
12717 /* If the next token is `export', then we have a template
12718 declaration. */
12721 /* If the next token is `extern', 'static' or 'inline' and the one
12722 after that is `template', we have a GNU extended explicit
12723 instantiation directive. */
12730 /* If the next token is `namespace', check for a named or unnamed
12731 namespace definition. */
12740 /* An unnamed namespace definition. */
12744 /* An inline (associated) namespace definition. */
12748 /* Objective-C++ declaration/definition. */
12755 /* At this point we may have a template declared by a concept
12756 introduction. */
12761 else
12762 /* Try to parse a block-declaration, or a function-definition. */
12765 /* Free any declarators allocated. */
12767 }
12769 /* Parse a block-declaration.
12771 block-declaration:
12772 simple-declaration
12773 asm-definition
12774 namespace-alias-definition
12775 using-declaration
12776 using-directive
12778 GNU Extension:
12780 block-declaration:
12781 __extension__ block-declaration
12783 C++0x Extension:
12785 block-declaration:
12786 static_assert-declaration
12788 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12789 part of a declaration-statement. */
12791 static void
12794 {
12798 /* Check for the `__extension__' keyword. */
12800 {
12801 /* Parse the qualified declaration. */
12803 /* Restore the PEDANTIC flag. */
12807 }
12809 /* Peek at the next token to figure out which kind of declaration is
12810 present. */
12813 /* If the next keyword is `asm', we have an asm-definition. */
12815 {
12819 }
12820 /* If the next keyword is `namespace', we have a
12821 namespace-alias-definition. */
12824 /* If the next keyword is `using', we have a
12825 using-declaration, a using-directive, or an alias-declaration. */
12827 {
12832 /* If the token after `using' is `namespace', then we have a
12833 using-directive. */
12837 /* If the second token after 'using' is '=', then we have an
12838 alias-declaration. */
12844 /* Otherwise, it's a using-declaration. */
12845 else
12848 }
12849 /* If the next keyword is `__label__' we have a misplaced label
12850 declaration. */
12852 {
12856 /* If the next token is now a `;', consume it. */
12859 }
12860 /* If the next token is `static_assert' we have a static assertion. */
12863 /* Anything else must be a simple-declaration. */
12864 else
12867 }
12869 /* Parse a simple-declaration.
12871 simple-declaration:
12872 decl-specifier-seq [opt] init-declarator-list [opt] ;
12873 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12874 brace-or-equal-initializer ;
12876 init-declarator-list:
12877 init-declarator
12878 init-declarator-list , init-declarator
12880 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12881 function-definition as a simple-declaration.
12883 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12884 parsed declaration if it is an uninitialized single declarator not followed
12885 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12886 if present, will not be consumed. */
12888 static void
12892 {
12893 cp_decl_specifier_seq decl_specifiers;
12902 /* Defer access checks until we know what is being declared; the
12903 checks for names appearing in the decl-specifier-seq should be
12904 done as if we were in the scope of the thing being declared. */
12907 /* Parse the decl-specifier-seq. We have to keep track of whether
12908 or not the decl-specifier-seq declares a named class or
12909 enumeration type, since that is the only case in which the
12910 init-declarator-list is allowed to be empty.
12912 [dcl.dcl]
12914 In a simple-declaration, the optional init-declarator-list can be
12915 omitted only when declaring a class or enumeration, that is when
12916 the decl-specifier-seq contains either a class-specifier, an
12917 elaborated-type-specifier, or an enum-specifier. */
12919 CP_PARSER_FLAGS_OPTIONAL,
12922 /* We no longer need to defer access checks. */
12925 /* In a block scope, a valid declaration must always have a
12926 decl-specifier-seq. By not trying to parse declarators, we can
12927 resolve the declaration/expression ambiguity more quickly. */
12930 {
12933 }
12935 /* If the next two tokens are both identifiers, the code is
12936 erroneous. The usual cause of this situation is code like:
12938 T t;
12940 where "T" should name a type -- but does not. */
12943 {
12944 /* If parsing tentatively, we should commit; we really are
12945 looking at a declaration. */
12947 /* Give up. */
12949 }
12951 /* If we have seen at least one decl-specifier, and the next token
12952 is not a parenthesis, then we must be looking at a declaration.
12953 (After "int (" we might be looking at a functional cast.) */
12960 /* Look for C++17 decomposition declaration. */
12968 {
12969 tree decl
12971 maybe_range_for_decl,
12974 /* The next token should be either a `,' or a `;'. */
12976 /* If it's a `;', we are done. */
12980 {
12984 }
12985 /* Anything else is an error. */
12986 else
12987 {
12988 /* If we have already issued an error message we don't need
12989 to issue another one. */
12994 /* Skip tokens until we reach the end of the statement. */
12996 /* If the next token is now a `;', consume it. */
13000 }
13001 }
13002 else
13005 tree last_type;
13007 /* NULL_TREE if both variable and function declaration are allowed,
13008 error_mark_node if function declaration are not allowed and
13009 a FUNCTION_DECL that should be diagnosed if it is followed by
13010 variable declarations. */
13011 tree auto_function_declaration;
13014 auto_specifier_p
13018 /* Keep going until we hit the `;' at the end of the simple
13019 declaration. */
13022 CPP_SEMICOLON))
13023 {
13026 tree decl;
13030 {
13031 /* If we are processing next declarator, comma is expected */
13036 {
13040 }
13041 }
13042 else
13045 /* Parse the init-declarator. */
13048 function_definition_allowed_p,
13050 declares_class_or_enum,
13052 maybe_range_for_decl,
13055 /* If an error occurred while parsing tentatively, exit quickly.
13056 (That usually happens when in the body of a function; each
13057 statement is treated as a declaration-statement until proven
13058 otherwise.) */
13063 {
13064 /* If the init-declarator-list contains more than one
13065 init-declarator, they shall all form declarations of
13066 variables. */
13068 auto_function_declaration
13072 {
13074 "non-variable %qD in declaration with more than one "
13079 }
13080 }
13084 {
13088 {
13089 /* If the list of declarators contains more than one declarator,
13090 the type of each declared variable is determined as described
13091 above. If the type deduced for the template parameter U is not
13092 the same in each deduction, the program is ill-formed. */
13097 }
13098 else
13100 }
13102 /* Handle function definitions specially. */
13104 {
13105 /* If the next token is a `,', then we are probably
13106 processing something like:
13108 void f() {}, *p;
13110 which is erroneous. */
13112 {
13115 "mixing"
13117 }
13118 /* Otherwise, we're done with the list of declarators. */
13119 else
13120 {
13123 }
13124 }
13127 /* The next token should be either a `,' or a `;'. */
13129 /* If it's a `,', there are more declarators to come. */
13132 /* If it's a `;', we are done. */
13136 {
13141 }
13142 /* Anything else is an error. */
13143 else
13144 {
13145 /* If we have already issued an error message we don't need
13146 to issue another one. */
13151 /* Skip tokens until we reach the end of the statement. */
13153 /* If the next token is now a `;', consume it. */
13157 }
13158 /* After the first time around, a function-definition is not
13159 allowed -- even if it was OK at first. For example:
13161 int i, f() {}
13163 is not valid. */
13165 }
13167 /* Issue an error message if no declarators are present, and the
13168 decl-specifier-seq does not itself declare a class or
13169 enumeration: [dcl.dcl]/3. */
13171 {
13173 {
13177 /* Ensure an error is issued anyway when finish_decltype_type,
13178 called via cp_parser_decl_specifier_seq, returns a class or
13179 an enumeration (c++/51786). */
13182 }
13183 /* Perform any deferred access checks. */
13185 }
13187 /* Consume the `;'. */
13188 finish:
13192 {
13198 }
13200 done:
13202 }
13204 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13205 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13206 initializer ; */
13208 static tree
13213 {
13218 /* Parse the identifier-list. */
13222 {
13230 }
13234 {
13240 else
13241 {
13244 }
13245 }
13251 tree pushed_scope;
13258 NULL_TREE);
13265 cp_expr e;
13266 cp_decl_specifier_seq decl_specs;
13271 {
13274 else
13277 tree elt_pushed_scope;
13283 {
13284 /* Ensure we've diagnosed redeclaration if we aren't creating
13285 a new VAR_DECL. */
13288 }
13289 else
13293 }
13296 {
13299 }
13303 {
13311 || (is_direct_init
13314 {
13318 }
13321 {
13326 }
13327 }
13329 {
13331 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13332 the underlying DECL. */
13334 }
13340 {
13343 }
13346 }
13348 /* Parse a decl-specifier-seq.
13350 decl-specifier-seq:
13351 decl-specifier-seq [opt] decl-specifier
13352 decl-specifier attribute-specifier-seq [opt] (C++11)
13354 decl-specifier:
13355 storage-class-specifier
13356 type-specifier
13357 function-specifier
13358 friend
13359 typedef
13361 GNU Extension:
13363 decl-specifier:
13364 attributes
13366 Concepts Extension:
13368 decl-specifier:
13369 concept
13371 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13373 The parser flags FLAGS is used to control type-specifier parsing.
13375 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13376 flags:
13378 1: one of the decl-specifiers is an elaborated-type-specifier
13379 (i.e., a type declaration)
13380 2: one of the decl-specifiers is an enum-specifier or a
13381 class-specifier (i.e., a type definition)
13383 */
13385 static void
13387 cp_parser_flags flags,
13390 {
13394 cp_decl_spec ds;
13396 /* Clear DECL_SPECS. */
13399 /* Assume no class or enumeration type is declared. */
13402 /* Keep reading specifiers until there are no more to read. */
13404 {
13409 /* Peek at the next token. */
13412 /* Save the first token of the decl spec list for error
13413 reporting. */
13416 /* Handle attributes. */
13418 {
13419 /* Parse the attributes. */
13422 /* In a sequence of declaration specifiers, c++11 attributes
13423 appertain to the type that precede them. In that case
13424 [dcl.spec]/1 says:
13426 The attribute-specifier-seq affects the type only for
13427 the declaration it appears in, not other declarations
13428 involving the same type.
13430 But for now let's force the user to position the
13431 attribute either at the beginning of the declaration or
13432 after the declarator-id, which would clearly mean that it
13433 applies to the declarator. */
13435 {
13437 /* The c++11 attribute is at the beginning of the
13438 declaration. It appertains to the entity being
13440 else
13441 {
13443 {
13444 /* This is an attribute following a
13445 class-specifier. */
13450 }
13451 else
13452 {
13453 decl_specs->std_attributes
13457 }
13459 }
13460 }
13462 decl_specs->attributes
13467 }
13468 /* Assume we will find a decl-specifier keyword. */
13470 /* If the next token is an appropriate keyword, we can simply
13471 add it to the list. */
13473 {
13474 /* decl-specifier:
13475 friend
13476 constexpr */
13479 {
13484 }
13485 else
13486 {
13488 /* Consume the token. */
13490 }
13503 /* function-specifier:
13504 inline
13505 virtual
13506 explicit */
13513 /* decl-specifier:
13514 typedef */
13517 /* Consume the token. */
13519 /* A constructor declarator cannot appear in a typedef. */
13521 /* The "typedef" keyword can only occur in a declaration; we
13522 may as well commit at this point. */
13529 /* storage-class-specifier:
13530 auto
13531 register
13532 static
13533 extern
13534 mutable
13536 GNU Extension:
13537 thread */
13540 {
13541 /* Consume the token. */
13544 /* Complain about `auto' as a storage specifier, if
13545 we're complaining about C++0x compatibility. */
13549 "%<auto%> changes meaning in C++11; "
13552 /* Set the storage class anyway. */
13554 token);
13555 }
13556 else
13557 /* C++0x auto type-specifier. */
13565 /* Consume the token. */
13568 token);
13571 /* Consume the token. */
13577 /* We did not yet find a decl-specifier yet. */
13580 }
13597 /* Constructors are a special case. The `S' in `S()' is not a
13598 decl-specifier; it is the beginning of the declarator. */
13599 constructor_p
13600 = (!found_decl_spec
13601 && constructor_possible_p
13602 && (cp_parser_constructor_declarator_p
13605 /* If we don't have a DECL_SPEC yet, then we must be looking at
13606 a type-specifier. */
13608 {
13611 tree type_spec;
13613 type_spec
13615 decl_specs,
13621 /* If this type-specifier referenced a user-defined type
13622 (a typedef, class-name, etc.), then we can't allow any
13623 more such type-specifiers henceforth.
13625 [dcl.spec]
13627 The longest sequence of decl-specifiers that could
13628 possibly be a type name is taken as the
13629 decl-specifier-seq of a declaration. The sequence shall
13630 be self-consistent as described below.
13632 [dcl.type]
13634 As a general rule, at most one type-specifier is allowed
13635 in the complete decl-specifier-seq of a declaration. The
13636 only exceptions are the following:
13638 -- const or volatile can be combined with any other
13639 type-specifier.
13641 -- signed or unsigned can be combined with char, long,
13642 short, or int.
13644 -- ..
13646 Example:
13648 typedef char* Pc;
13649 void g (const int Pc);
13651 Here, Pc is *not* part of the decl-specifier seq; it's
13652 the declarator. Therefore, once we see a type-specifier
13653 (other than a cv-qualifier), we forbid any additional
13654 user-defined types. We *do* still allow things like `int
13655 int' to be considered a decl-specifier-seq, and issue the
13656 error message later. */
13659 /* A constructor declarator cannot follow a type-specifier. */
13661 {
13666 }
13667 }
13669 /* If we still do not have a DECL_SPEC, then there are no more
13670 decl-specifiers. */
13675 /* After we see one decl-specifier, further decl-specifiers are
13676 always optional. */
13678 }
13680 /* Don't allow a friend specifier with a class definition. */
13685 }
13687 /* Parse an (optional) storage-class-specifier.
13689 storage-class-specifier:
13690 auto
13691 register
13692 static
13693 extern
13694 mutable
13696 GNU Extension:
13698 storage-class-specifier:
13699 thread
13701 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13703 static tree
13705 {
13707 {
13711 /* Fall through for C++98. */
13719 /* Consume the token. */
13724 }
13725 }
13727 /* Parse an (optional) function-specifier.
13729 function-specifier:
13730 inline
13731 virtual
13732 explicit
13734 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13735 Updates DECL_SPECS, if it is non-NULL. */
13737 static tree
13740 {
13743 {
13749 /* 14.5.2.3 [temp.mem]
13751 A member function template shall not be virtual. */
13755 else
13765 }
13767 /* Consume the token. */
13769 }
13771 /* Parse a linkage-specification.
13773 linkage-specification:
13774 extern string-literal { declaration-seq [opt] }
13775 extern string-literal declaration */
13777 static void
13779 {
13780 tree linkage;
13782 /* Look for the `extern' keyword. */
13783 cp_token *extern_token
13786 /* Look for the string-literal. */
13790 /* Transform the literal into an identifier. If the literal is a
13791 wide-character string, or contains embedded NULs, then we can't
13792 handle it as the user wants. */
13795 {
13797 /* Assume C++ linkage. */
13799 }
13800 else
13803 /* We're now using the new linkage. */
13806 /* Preserve the location of the the innermost linkage specification,
13807 tracking the locations of nested specifications via a local. */
13808 location_t saved_location
13810 /* Construct a location ranging from the start of the "extern" to
13811 the end of the string-literal, with the caret at the start, e.g.:
13812 extern "C" {
13813 ^~~~~~~~~~
13814 */
13815 parser->innermost_linkage_specification_location
13820 /* If the next token is a `{', then we're using the first
13821 production. */
13823 {
13827 /* Consume the `{' token. */
13828 matching_braces braces;
13830 /* Parse the declarations. */
13832 /* Look for the closing `}'. */
13834 }
13835 /* Otherwise, there's just one declaration. */
13836 else
13837 {
13840 saved_in_unbraced_linkage_specification_p
13844 parser->in_unbraced_linkage_specification_p
13846 }
13848 /* We're done with the linkage-specification. */
13851 /* Restore location of parent linkage specification, if any. */
13853 }
13855 /* Parse a static_assert-declaration.
13857 static_assert-declaration:
13858 static_assert ( constant-expression , string-literal ) ;
13859 static_assert ( constant-expression ) ; (C++17)
13861 If MEMBER_P, this static_assert is a class member. */
13863 static void
13865 {
13866 cp_expr condition;
13867 location_t token_loc;
13868 tree message;
13871 /* Peek at the `static_assert' token so we can keep track of exactly
13872 where the static assertion started. */
13875 /* Look for the `static_assert' keyword. */
13877 RT_STATIC_ASSERT))
13880 /* We know we are in a static assertion; commit to any tentative
13881 parse. */
13885 /* Parse the `(' starting the static assertion condition. */
13886 matching_parens parens;
13889 /* Parse the constant-expression. Allow a non-constant expression
13890 here in order to give better diagnostics in finish_static_assert. */
13891 condition =
13897 {
13900 "static_assert without a message "
13902 /* Eat the ')' */
13907 }
13908 else
13909 {
13910 /* Parse the separating `,'. */
13913 /* Parse the string-literal message. */
13918 /* A `)' completes the static assertion. */
13924 }
13926 /* A semicolon terminates the declaration. */
13929 /* Get the location for the static assertion. Use that of the
13930 condition if available, otherwise, use that of the "static_assert"
13931 token. */
13936 /* Complete the static assertion, which may mean either processing
13937 the static assert now or saving it for template instantiation. */
13939 }
13941 /* Parse the expression in decltype ( expression ). */
13943 static tree
13946 {
13948 tree expr;
13950 /* Since we're going to preserve any side-effects from this parse, set up a
13951 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13952 in the expression. */
13955 /* First, try parsing an id-expression. */
13966 {
13969 cp_id_kind idk;
13973 /* Lookup the name we got back from the id-expression. */
13978 /* A template without args is not a complete id-expression. */
13987 {
13988 /* Complete lookup of the id-expression. */
13989 expr = (finish_id_expression
14002 /* We found an id-expression, but it was something that we
14003 should not have found. This is an error, not something
14004 we can recover from, so note that we found an
14005 id-expression and we'll recover as gracefully as
14006 possible. */
14008 }
14013 /* We have an id-expression. */
14015 }
14018 {
14019 /* Abort the id-expression parse. */
14022 /* Parsing tentatively, again. */
14025 /* Parse a class member access. */
14033 /* We have an id-expression. */
14035 }
14038 /* We have parsed the complete id-expression or member access. */
14040 else
14041 {
14042 /* Abort our attempt to parse an id-expression or member access
14043 expression. */
14046 /* Commit to the tentative_firewall so we get syntax errors. */
14049 /* Parse a full expression. */
14052 }
14055 }
14057 /* Parse a `decltype' type. Returns the type.
14059 simple-type-specifier:
14060 decltype ( expression )
14061 C++14 proposal:
14062 decltype ( auto ) */
14064 static tree
14066 {
14071 {
14072 /* Already parsed. */
14075 }
14077 /* Look for the `decltype' token. */
14081 /* Parse the opening `('. */
14082 matching_parens parens;
14092 /* decltype (auto) */
14094 else
14095 {
14096 /* decltype (expression) */
14098 /* Types cannot be defined in a `decltype' expression. Save away the
14099 old message and set the new one. */
14101 parser->type_definition_forbidden_message
14104 /* The restrictions on constant-expressions do not apply inside
14105 decltype expressions. */
14106 bool saved_integral_constant_expression_p
14108 bool saved_non_integral_constant_expression_p
14112 /* Within a parenthesized expression, a `>' token is always
14113 the greater-than operator. */
14114 bool saved_greater_than_is_operator_p
14118 /* Do not actually evaluate the expression. */
14121 /* Do not warn about problems with the expression. */
14126 /* Go back to evaluating expressions. */
14130 /* The `>' token might be the end of a template-id or
14131 template-parameter-list now. */
14132 parser->greater_than_is_operator_p
14135 /* Restore the old message and the integral constant expression
14136 flags. */
14138 parser->integral_constant_expression_p
14140 parser->non_integral_constant_expression_p
14142 }
14144 /* Parse to the closing `)'. */
14146 {
14151 }
14154 {
14155 /* Build auto. */
14158 }
14159 else
14161 tf_warning_or_error);
14163 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14164 it again. */
14175 }
14177 /* Special member functions [gram.special] */
14179 /* Parse a conversion-function-id.
14181 conversion-function-id:
14182 operator conversion-type-id
14184 Returns an IDENTIFIER_NODE representing the operator. */
14186 static tree
14188 {
14189 tree type;
14190 tree saved_scope;
14191 tree saved_qualifying_scope;
14192 tree saved_object_scope;
14195 /* Look for the `operator' token. */
14198 /* When we parse the conversion-type-id, the current scope will be
14199 reset. However, we need that information in able to look up the
14200 conversion function later, so we save it here. */
14204 /* We must enter the scope of the class so that the names of
14205 entities declared within the class are available in the
14206 conversion-type-id. For example, consider:
14208 struct S {
14209 typedef int I;
14210 operator I();
14211 };
14213 S::operator I() { ... }
14215 In order to see that `I' is a type-name in the definition, we
14216 must be in the scope of `S'. */
14219 /* Parse the conversion-type-id. */
14221 /* Leave the scope of the class, if any. */
14224 /* Restore the saved scope. */
14228 /* If the TYPE is invalid, indicate failure. */
14232 }
14234 /* Parse a conversion-type-id:
14236 conversion-type-id:
14237 type-specifier-seq conversion-declarator [opt]
14239 Returns the TYPE specified. */
14241 static tree
14243 {
14244 tree attributes;
14245 cp_decl_specifier_seq type_specifiers;
14247 tree type_specified;
14250 /* Parse the attributes. */
14254 parser->type_definition_forbidden_message
14257 /* Parse the type-specifiers. */
14264 /* If that didn't work, stop. */
14267 /* Parse the conversion-declarator. */
14275 /* Don't give this error when parsing tentatively. This happens to
14276 work because we always parse this definitively once. */
14279 {
14281 {
14284 }
14288 }
14291 }
14293 /* Parse an (optional) conversion-declarator.
14295 conversion-declarator:
14296 ptr-operator conversion-declarator [opt]
14298 */
14302 {
14305 cp_cv_quals cv_quals;
14307 /* We don't know if there's a ptr-operator next, or not. */
14309 /* Try the ptr-operator. */
14312 /* If it worked, look for more conversion-declarators. */
14314 {
14317 /* Parse another optional declarator. */
14320 declarator = cp_parser_make_indirect_declarator
14324 }
14327 }
14329 /* Parse an (optional) ctor-initializer.
14331 ctor-initializer:
14332 : mem-initializer-list */
14334 static void
14336 {
14337 /* If the next token is not a `:', then there is no
14338 ctor-initializer. */
14340 {
14341 /* Do default initialization of any bases and members. */
14345 }
14347 /* Consume the `:' token. */
14349 /* And the mem-initializer-list. */
14351 }
14353 /* Parse a mem-initializer-list.
14355 mem-initializer-list:
14356 mem-initializer ... [opt]
14357 mem-initializer ... [opt] , mem-initializer-list */
14359 static void
14361 {
14366 /* Let the semantic analysis code know that we are starting the
14367 mem-initializer-list. */
14372 /* Loop through the list. */
14374 {
14375 tree mem_initializer;
14378 /* Parse the mem-initializer. */
14380 /* If the next token is a `...', we're expanding member initializers. */
14386 {
14387 /* Consume the `...'. */
14391 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14392 can be expanded but members cannot. */
14395 {
14400 }
14402 /* Construct the pack expansion type. */
14405 }
14408 {
14412 }
14413 /* Look for a target constructor. */
14417 {
14420 {
14424 }
14426 }
14427 /* Add it to the list, unless it was erroneous. */
14429 {
14432 }
14433 /* If the next token is not a `,', we're done. */
14436 /* Consume the `,' token. */
14438 }
14440 /* Perform semantic analysis. */
14443 }
14445 /* Parse a mem-initializer.
14447 mem-initializer:
14448 mem-initializer-id ( expression-list [opt] )
14449 mem-initializer-id braced-init-list
14451 GNU extension:
14453 mem-initializer:
14454 ( expression-list [opt] )
14456 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14457 class) or FIELD_DECL (for a non-static data member) to initialize;
14458 the TREE_VALUE is the expression-list. An empty initialization
14459 list is represented by void_list_node. */
14461 static tree
14463 {
14464 tree mem_initializer_id;
14465 tree expression_list;
14466 tree member;
14469 /* Find out what is being initialized. */
14471 {
14475 }
14476 else
14477 {
14481 }
14487 {
14494 }
14495 else
14496 {
14506 }
14516 }
14518 /* Parse a mem-initializer-id.
14520 mem-initializer-id:
14521 :: [opt] nested-name-specifier [opt] class-name
14522 decltype-specifier (C++11)
14523 identifier
14525 Returns a TYPE indicating the class to be initialized for the first
14526 production (and the second in C++11). Returns an IDENTIFIER_NODE
14527 indicating the data member to be initialized for the last production. */
14529 static tree
14531 {
14535 tree id;
14539 /* `typename' is not allowed in this context ([temp.res]). */
14541 {
14543 "keyword %<typename%> not allowed in this context (a qualified "
14546 }
14547 /* Look for the optional `::' operator. */
14548 global_scope_p
14552 /* Look for the optional nested-name-specifier. The simplest way to
14553 implement:
14555 [temp.res]
14557 The keyword `typename' is not permitted in a base-specifier or
14558 mem-initializer; in these contexts a qualified name that
14559 depends on a template-parameter is implicitly assumed to be a
14560 type name.
14562 is to assume that we have seen the `typename' keyword at this
14563 point. */
14564 nested_name_specifier_p
14573 /* If there is a `::' operator or a nested-name-specifier, then we
14574 are definitely looking for a class-name. */
14579 typename_type,
14583 /* Otherwise, we could also be looking for an ordinary identifier. */
14586 /* Try a decltype-specifier. */
14588 else
14589 /* Otherwise, try a class-name. */
14593 none_type,
14597 /* If we found one, we're done. */
14600 /* Otherwise, look for an ordinary identifier. */
14602 }
14604 /* Overloading [gram.over] */
14606 /* Parse an operator-function-id.
14608 operator-function-id:
14609 operator operator
14611 Returns an IDENTIFIER_NODE for the operator which is a
14612 human-readable spelling of the identifier, e.g., `operator +'. */
14614 static cp_expr
14616 {
14617 /* Look for the `operator' keyword. */
14620 /* And then the name of the operator itself. */
14622 }
14624 /* Return an identifier node for a user-defined literal operator.
14625 The suffix identifier is chained to the operator name identifier. */
14627 tree
14629 {
14630 tree identifier;
14637 }
14639 /* Parse an operator.
14641 operator:
14642 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14643 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14644 || ++ -- , ->* -> () []
14646 GNU Extensions:
14648 operator:
14649 <? >? <?= >?=
14651 Returns an IDENTIFIER_NODE for the operator which is a
14652 human-readable spelling of the identifier, e.g., `operator +'. */
14654 static cp_expr
14656 {
14661 /* Peek at the next token. */
14666 /* Figure out which operator we have. */
14671 {
14673 {
14674 /* The keyword should be either `new' or `delete'. */
14679 else
14682 /* Consume the `new' or `delete' token. */
14685 /* Peek at the next token. */
14687 /* If it's a `[' token then this is the array variant of the
14688 operator. */
14690 {
14691 /* Consume the `[' token. */
14693 /* Look for the `]' token. */
14698 }
14702 }
14860 {
14861 /* Consume the `('. */
14862 matching_parens parens;
14864 /* Look for the matching `)'. */
14869 }
14872 /* Consume the `['. */
14874 /* Look for the matching `]'. */
14883 /* FALLTHRU */
14892 {
14899 /* Consume the string. */
14905 {
14908 }
14909 else
14910 {
14912 /* Look for the suffix identifier. */
14917 {
14921 }
14922 else
14923 {
14926 }
14927 }
14932 {
14935 }
14938 {
14941 }
14943 {
14946 }
14948 }
14951 /* Anything else is an error. */
14953 }
14955 /* If we have selected an identifier, we need to consume the
14956 operator token. */
14958 {
14962 }
14963 /* Otherwise, no valid operator name was present. */
14964 else
14965 {
14968 }
14971 }
14973 /* Parse a template-declaration.
14975 template-declaration:
14976 export [opt] template < template-parameter-list > declaration
14978 If MEMBER_P is TRUE, this template-declaration occurs within a
14979 class-specifier.
14981 The grammar rule given by the standard isn't correct. What
14982 is really meant is:
14984 template-declaration:
14985 export [opt] template-parameter-list-seq
14986 decl-specifier-seq [opt] init-declarator [opt] ;
14987 export [opt] template-parameter-list-seq
14988 function-definition
14990 template-parameter-list-seq:
14991 template-parameter-list-seq [opt]
14992 template < template-parameter-list >
14994 Concept Extensions:
14996 template-parameter-list-seq:
14997 template < template-parameter-list > requires-clause [opt]
14999 requires-clause:
15000 requires logical-or-expression */
15002 static void
15004 {
15005 /* Check for `export'. */
15007 {
15008 /* Consume the `export' token. */
15010 /* Warn that we do not support `export'. */
15012 }
15015 }
15017 /* Parse a template-parameter-list.
15019 template-parameter-list:
15020 template-parameter
15021 template-parameter-list , template-parameter
15023 Returns a TREE_LIST. Each node represents a template parameter.
15024 The nodes are connected via their TREE_CHAINs. */
15026 static tree
15028 {
15033 /* The loop below parses the template parms. We first need to know
15034 the total number of template parms to be able to compute proper
15035 canonical types of each dependent type. So after the loop, when
15036 we know the total number of template parms,
15037 end_template_parm_list computes the proper canonical types and
15038 fixes up the dependent types accordingly. */
15040 {
15041 tree parameter;
15044 location_t parm_loc;
15046 /* Parse the template-parameter. */
15051 /* Add it to the list. */
15054 parm_loc,
15055 parameter,
15056 is_non_type,
15057 is_parameter_pack);
15058 else
15059 {
15062 }
15064 /* If the next token is not a `,', we're done. */
15067 /* Otherwise, consume the `,' token. */
15069 }
15072 }
15074 /* Parse a introduction-list.
15076 introduction-list:
15077 introduced-parameter
15078 introduction-list , introduced-parameter
15080 introduced-parameter:
15081 ...[opt] identifier
15083 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15084 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15085 WILDCARD_DECL will also have DECL_NAME set and token location in
15086 DECL_SOURCE_LOCATION. */
15088 static tree
15090 {
15094 {
15099 /* Build placeholder. */
15107 /* If the next token is not a `,', we're done. */
15110 /* Otherwise, consume the `,' token. */
15112 }
15114 /* Convert the vec into a TREE_VEC. */
15117 tree parm;
15123 }
15125 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15126 is an abstract declarator. */
15130 {
15135 }
15137 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15138 is an abstract declarator. */
15142 {
15146 else
15148 }
15150 /* Returns true if DECL represents a constrained-parameter. */
15154 {
15159 }
15161 /* Returns true if PARM declares a constrained-parameter. */
15165 {
15167 }
15169 /* Check that the type parameter is only a declarator-id, and that its
15170 type is not cv-qualified. */
15172 bool
15175 {
15180 {
15183 }
15185 /* Don't allow cv-qualified type parameters. */
15188 {
15191 }
15194 }
15196 /* Finish parsing/processing a template type parameter and checking
15197 various restrictions. */
15201 tree id,
15203 {
15206 else
15208 }
15210 static tree
15212 {
15213 /* FIXME: This should probably be copied, and we may need to adjust
15214 the template parameter depths. */
15224 }
15226 /* Finish parsing/processing a template template parameter by borrowing
15227 the template parameter list from the prototype parameter. */
15229 static tree
15231 tree proto,
15232 tree id,
15234 {
15238 }
15240 /* Create a new non-type template parameter from the given PARM
15241 declarator. */
15243 static tree
15246 {
15252 }
15254 /* Build a constrained template parameter based on the PARMDECL
15255 declarator. The type of PARMDECL is the constrained type, which
15256 refers to the prototype template parameter that ultimately
15257 specifies the type of the declared parameter. */
15259 static tree
15264 {
15270 /* A template parameter constrained by a variadic concept shall also
15271 be declared as a template parameter pack. */
15276 /* Build the parameter. Return an error if the declarator was invalid. */
15277 tree parm;
15282 parmdecl);
15283 else
15288 /* Finish the parameter decl and create a node attaching the
15289 default argument and constraint. */
15294 }
15296 /* Returns true if the parsed type actually represents the declaration
15297 of a type template-parameter. */
15301 {
15304 }
15307 /* Returns true if the parsed type actually represents the declaration of
15308 a template template-parameter. */
15310 static bool
15312 {
15315 }
15317 /* Parse a default argument for a type template-parameter.
15318 Note that diagnostics are handled in cp_parser_template_parameter. */
15320 static tree
15322 {
15325 /* Consume the `=' token. */
15330 /* Parse the default-argument. */
15336 {
15340 }
15343 }
15345 /* Parse a default argument for a template template-parameter. */
15347 static tree
15349 {
15354 /* Consume the `='. */
15356 /* Parse the id-expression. */
15358 /* save token before parsing the id-expression, for error
15359 reporting */
15361 tree default_argument
15369 /* If the id-expression was a template-id that refers to
15370 a template-class, we already have the declaration here,
15371 so no further lookup is needed. */
15372 ;
15373 else
15374 /* Look up the name. */
15375 default_argument
15377 none_type,
15383 /* See if the default argument is valid. */
15387 }
15389 /* Parse a template-parameter.
15391 template-parameter:
15392 type-parameter
15393 parameter-declaration
15395 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15396 the parameter. The TREE_PURPOSE is the default value, if any.
15397 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15398 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15399 set to true iff this parameter is a parameter pack. */
15401 static tree
15404 {
15407 tree parm;
15409 /* Assume it is a type parameter or a template parameter. */
15411 /* Assume it not a parameter pack. */
15413 /* Peek at the next token. */
15415 /* If it is `template', we have a type-parameter. */
15418 /* If it is `class' or `typename' we do not know yet whether it is a
15419 type parameter or a non-type parameter. Consider:
15421 template <typename T, typename T::X X> ...
15423 or:
15425 template <class C, class D*> ...
15427 Here, the first parameter is a type parameter, and the second is
15428 a non-type parameter. We can tell by looking at the token after
15429 the identifier -- if it is a `,', `=', or `>' then we have a type
15430 parameter. */
15432 {
15433 /* Peek at the token after `class' or `typename'. */
15435 /* If it's an ellipsis, we have a template type parameter
15436 pack. */
15439 /* If it's an identifier, skip it. */
15442 /* Now, see if the token looks like the end of a template
15443 parameter. */
15448 }
15450 /* Otherwise, it is a non-type parameter or a constrained parameter.
15452 [temp.param]
15454 When parsing a default template-argument for a non-type
15455 template-parameter, the first non-nested `>' is taken as the end
15456 of the template parameter-list rather than a greater-than
15457 operator. */
15458 parameter_declarator
15465 /* If the parameter declaration is marked as a parameter pack, set
15466 *IS_PARAMETER_PACK to notify the caller. */
15471 {
15472 /* Can happen in some cases of erroneous input (c++/34892). */
15474 /* Consume the `...' for better error recovery. */
15476 }
15478 // The parameter may have been constrained.
15481 parameter_declarator,
15482 is_non_type,
15483 is_parameter_pack);
15485 // Now we're sure that the parameter is a non-type parameter.
15496 }
15498 /* Parse a type-parameter.
15500 type-parameter:
15501 class identifier [opt]
15502 class identifier [opt] = type-id
15503 typename identifier [opt]
15504 typename identifier [opt] = type-id
15505 template < template-parameter-list > class identifier [opt]
15506 template < template-parameter-list > class identifier [opt]
15507 = id-expression
15509 GNU Extension (variadic templates):
15511 type-parameter:
15512 class ... identifier [opt]
15513 typename ... identifier [opt]
15515 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15516 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15517 the declaration of the parameter.
15519 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15521 static tree
15523 {
15525 tree parameter;
15527 /* Look for a keyword to tell us what kind of parameter this is. */
15533 {
15536 {
15537 tree identifier;
15538 tree default_argument;
15540 /* If the next token is an ellipsis, we have a template
15541 argument pack. */
15543 {
15544 /* Consume the `...' token. */
15549 }
15551 /* If the next token is an identifier, then it names the
15552 parameter. */
15555 else
15558 /* Create the parameter. */
15561 /* If the next token is an `=', we have a default argument. */
15563 {
15564 default_argument
15567 /* Template parameter packs cannot have default
15568 arguments. */
15570 {
15573 "template parameter pack %qD cannot have a "
15575 else
15577 "template parameter packs cannot have "
15580 }
15583 }
15584 else
15587 /* Create the combined representation of the parameter and the
15588 default argument. */
15590 }
15594 {
15595 tree identifier;
15596 tree default_argument;
15598 /* Look for the `<'. */
15600 /* Parse the template-parameter-list. */
15602 /* Look for the `>'. */
15605 // If template requirements are present, parse them.
15607 {
15612 }
15614 /* Look for the `class' or 'typename' keywords. */
15616 /* If the next token is an ellipsis, we have a template
15617 argument pack. */
15619 {
15620 /* Consume the `...' token. */
15625 }
15626 /* If the next token is an `=', then there is a
15627 default-argument. If the next token is a `>', we are at
15628 the end of the parameter-list. If the next token is a `,',
15629 then we are at the end of this parameter. */
15633 {
15635 /* Treat invalid names as if the parameter were nameless. */
15638 }
15639 else
15642 /* Create the template parameter. */
15644 identifier);
15646 /* If the next token is an `=', then there is a
15647 default-argument. */
15649 {
15650 default_argument
15653 /* Template parameter packs cannot have default
15654 arguments. */
15656 {
15659 "template parameter pack %qD cannot "
15661 identifier);
15662 else
15666 }
15667 }
15668 else
15671 /* Create the combined representation of the parameter and the
15672 default argument. */
15674 }
15680 }
15683 }
15685 /* Parse a template-id.
15687 template-id:
15688 template-name < template-argument-list [opt] >
15690 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15691 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15692 returned. Otherwise, if the template-name names a function, or set
15693 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15694 names a class, returns a TYPE_DECL for the specialization.
15696 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15697 uninstantiated templates. */
15699 static tree
15705 {
15706 tree templ;
15707 tree arguments;
15708 tree template_id;
15713 /* If the next token corresponds to a template-id, there is no need
15714 to reparse it. */
15717 {
15720 }
15722 /* Avoid performing name lookup if there is no possibility of
15723 finding a template-id. */
15726 && !cp_parser_nth_token_starts_template_argument_list_p
15728 {
15731 }
15733 /* Remember where the template-id starts. */
15739 /* Parse the template-name. */
15742 check_dependency_p,
15743 is_declaration,
15744 tag_type,
15747 {
15750 }
15752 /* Since we're going to preserve any side-effects from this parse, set up a
15753 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15754 in the template arguments. */
15757 /* If we find the sequence `[:' after a template-name, it's probably
15758 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15759 parse correctly the argument list. */
15766 {
15768 /* Change `:' into `::'. */
15770 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15771 CPP_LESS. */
15774 /* Parse the arguments. */
15777 {
15778 /* If we couldn't parse an argument list, then we revert our changes
15779 and return simply an error. Maybe this is not a template-id
15780 after all. */
15785 }
15786 /* Otherwise, emit an error about the invalid digraph, but continue
15787 parsing because we got our argument list. */
15790 {
15793 "%<<:%> is an alternate spelling for %<[%>."
15796 {
15798 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15801 }
15802 }
15803 }
15804 else
15805 {
15806 /* Look for the `<' that starts the template-argument-list. */
15808 {
15811 }
15812 /* Parse the arguments. */
15814 }
15816 /* Set the location to be of the form:
15817 template-name < template-argument-list [opt] >
15818 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15819 with caret == start at the start of the template-name,
15820 ranging until the closing '>'. */
15821 location_t finish_loc
15823 location_t combined_loc
15826 /* Check for concepts autos where they don't belong. We could
15827 identify types in some cases of idnetifier TEMPL, looking ahead
15828 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
15829 types. We reject them in functions, but if what we have is an
15830 identifier, even with none_type we can't conclude it's NOT a
15831 type, we have to wait for template substitution. */
15834 /* Build a representation of the specialization. */
15837 TEMPLATE_ID_EXPR,
15841 {
15843 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15844 template (rather than some instantiation thereof) only if
15845 is not nested within some other construct. For example, in
15846 "template <typename T> void f(T) { A<T>::", A<T> is just an
15847 instantiation of A. */
15850 CPP_SCOPE));
15851 template_id
15853 }
15854 /* A template-like identifier may be a partial concept id. */
15860 {
15864 }
15865 else
15866 {
15867 /* If it's not a class-template or a template-template, it should be
15868 a function-template. */
15876 }
15878 /* If parsing tentatively, replace the sequence of tokens that makes
15879 up the template-id with a CPP_TEMPLATE_ID token. That way,
15880 should we re-parse the token stream, we will not have to repeat
15881 the effort required to do the parse, nor will we issue duplicate
15882 error messages about problems during instantiation of the
15883 template. */
15885 /* Don't do this if we had a parse error in a declarator; re-parsing
15886 might succeed if a name changes meaning (60361). */
15890 {
15891 /* Reset the contents of the START_OF_ID token. */
15895 /* We must mark the lookup as kept, so we don't throw it away on
15896 the first parse. */
15900 /* Retrieve any deferred checks. Do not pop this access checks yet
15901 so the memory will not be reclaimed during token replacing below. */
15907 /* Purge all subsequent tokens. */
15910 /* ??? Can we actually assume that, if template_id ==
15911 error_mark_node, we will have issued a diagnostic to the
15912 user, as opposed to simply marking the tentative parse as
15913 failed? */
15916 }
15920 }
15922 /* Parse a template-name.
15924 template-name:
15925 identifier
15927 The standard should actually say:
15929 template-name:
15930 identifier
15931 operator-function-id
15933 A defect report has been filed about this issue.
15935 A conversion-function-id cannot be a template name because they cannot
15936 be part of a template-id. In fact, looking at this code:
15938 a.operator K<int>()
15940 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15941 It is impossible to call a templated conversion-function-id with an
15942 explicit argument list, since the only allowed template parameter is
15943 the type to which it is converting.
15945 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15946 `template' keyword, in a construction like:
15948 T::template f<3>()
15950 In that case `f' is taken to be a template-name, even though there
15951 is no way of knowing for sure.
15953 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15954 name refers to a set of overloaded functions, at least one of which
15955 is a template, or an IDENTIFIER_NODE with the name of the template,
15956 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15957 names are looked up inside uninstantiated templates. */
15959 static tree
15966 {
15967 tree identifier;
15968 tree decl;
15971 /* If the next token is `operator', then we have either an
15972 operator-function-id or a conversion-function-id. */
15974 {
15975 /* We don't know whether we're looking at an
15976 operator-function-id or a conversion-function-id. */
15978 /* Try an operator-function-id. */
15980 /* If that didn't work, try a conversion-function-id. */
15982 {
15985 }
15986 }
15987 /* Look for the identifier. */
15988 else
15991 /* If we didn't find an identifier, we don't have a template-id. */
15995 /* If the name immediately followed the `template' keyword, then it
15996 is a template-name. However, if the next token is not `<', then
15997 we do not treat it as a template-name, since it is not being used
15998 as part of a template-id. This enables us to handle constructs
15999 like:
16001 template <typename T> struct S { S(); };
16002 template <typename T> S<T>::S();
16004 correctly. We would treat `S' as a template -- if it were `S<T>'
16005 -- but we do not if there is no `<'. */
16009 {
16010 /* In a declaration, in a dependent context, we pretend that the
16011 "template" keyword was present in order to improve error
16012 recovery. For example, given:
16014 template <typename T> void f(T::X<int>);
16016 we want to treat "X<int>" as a template-id. */
16018 && !template_keyword_p
16020 && check_dependency_p
16022 /* Do not do this for dtors (or ctors), since they never
16023 need the template keyword before their name. */
16025 {
16028 /* Explain what went wrong. */
16030 identifier);
16033 /* If parsing tentatively, find the location of the "<" token. */
16036 /* Parse the template arguments so that we can issue error
16037 messages about them. */
16040 /* Skip tokens until we find a good place from which to
16041 continue parsing. */
16046 /* If parsing tentatively, permanently remove the
16047 template argument list. That will prevent duplicate
16048 error messages from being issued about the missing
16049 "template" keyword. */
16056 }
16058 /* If the "template" keyword is present, then there is generally
16059 no point in doing name-lookup, so we just return IDENTIFIER.
16060 But, if the qualifying scope is non-dependent then we can
16061 (and must) do name-lookup normally. */
16063 {
16069 {
16070 /* We're optimizing away the call to cp_parser_lookup_name, but
16071 we still need to do this. */
16074 }
16075 }
16076 }
16078 /* Look up the name. */
16080 tag_type,
16083 check_dependency_p,
16089 /* If DECL is a template, then the name was a template-name. */
16091 {
16095 }
16096 else
16097 {
16098 /* The standard does not explicitly indicate whether a name that
16099 names a set of overloaded declarations, some of which are
16100 templates, is a template-name. However, such a name should
16101 be a template-name; otherwise, there is no way to form a
16102 template-id for the overloaded templates. */
16111 {
16112 /* The name does not name a template. */
16115 }
16116 }
16118 /* If DECL is dependent, and refers to a function, then just return
16119 its name; we will look it up again during template instantiation. */
16121 {
16125 }
16128 }
16130 /* Parse a template-argument-list.
16132 template-argument-list:
16133 template-argument ... [opt]
16134 template-argument-list , template-argument ... [opt]
16136 Returns a TREE_VEC containing the arguments. */
16138 static tree
16140 {
16145 tree vec;
16152 /* Even if the template-id appears in an integral
16153 constant-expression, the contents of the argument list do
16154 not. */
16160 /* Parse the arguments. */
16161 do
16162 {
16163 tree argument;
16166 /* Consume the comma. */
16169 /* Parse the template-argument. */
16172 /* If the next token is an ellipsis, we're expanding a template
16173 argument pack. */
16175 {
16177 {
16181 }
16182 /* Consume the `...' token. */
16185 /* Make the argument into a TYPE_PACK_EXPANSION or
16186 EXPR_PACK_EXPANSION. */
16188 }
16191 {
16195 {
16198 }
16199 else
16201 }
16203 }
16219 }
16221 /* Parse a template-argument.
16223 template-argument:
16224 assignment-expression
16225 type-id
16226 id-expression
16228 The representation is that of an assignment-expression, type-id, or
16229 id-expression -- except that the qualified id-expression is
16230 evaluated, so that the value returned is either a DECL or an
16231 OVERLOAD.
16233 Although the standard says "assignment-expression", it forbids
16234 throw-expressions or assignments in the template argument.
16235 Therefore, we use "conditional-expression" instead. */
16237 static tree
16239 {
16240 tree argument;
16246 cp_id_kind idk;
16248 /* There's really no way to know what we're looking at, so we just
16249 try each alternative in order.
16251 [temp.arg]
16253 In a template-argument, an ambiguity between a type-id and an
16254 expression is resolved to a type-id, regardless of the form of
16255 the corresponding template-parameter.
16257 Therefore, we try a type-id first. */
16260 /* If there was no error parsing the type-id but the next token is a
16261 '>>', our behavior depends on which dialect of C++ we're
16262 parsing. In C++98, we probably found a typo for '> >'. But there
16263 are type-id which are also valid expressions. For instance:
16265 struct X { int operator >> (int); };
16266 template <int V> struct Foo {};
16267 Foo<X () >> 5> r;
16269 Here 'X()' is a valid type-id of a function type, but the user just
16270 wanted to write the expression "X() >> 5". Thus, we remember that we
16271 found a valid type-id, but we still try to parse the argument as an
16272 expression to see what happens.
16274 In C++0x, the '>>' will be considered two separate '>'
16275 tokens. */
16279 {
16282 }
16283 else
16284 {
16285 /* If the next token isn't a `,' or a `>', then this argument wasn't
16286 really finished. This means that the argument is not a valid
16287 type-id. */
16290 /* If that worked, we're done. */
16293 }
16294 /* We're still not sure what the argument will be. */
16296 /* Try a template. */
16304 /* If the next token isn't a `,' or a `>', then this argument wasn't
16305 really finished. */
16309 {
16310 /* Figure out what is being referred to. If the id-expression
16311 was for a class template specialization, then we will have a
16312 TYPE_DECL at this point. There is no need to do name lookup
16313 at this point in that case. */
16316 none_type,
16322 /* Handle a constrained-type-specifier for a non-type template
16323 parameter. */
16329 }
16331 {
16335 }
16336 /* It must be a non-type argument. In C++17 any constant-expression is
16337 allowed. */
16341 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16343 -- an integral constant-expression of integral or enumeration
16344 type; or
16346 -- the name of a non-type template-parameter; or
16348 -- the name of an object or function with external linkage...
16350 -- the address of an object or function with external linkage...
16352 -- a pointer to member... */
16353 /* Look for a non-type template parameter. */
16355 {
16367 }
16369 /* If the next token is "&", the argument must be the address of an
16370 object or function with external linkage. */
16373 {
16376 }
16377 /* See if we might have an id-expression. */
16384 {
16387 address_p,
16394 else
16395 {
16396 tree probe;
16399 {
16400 /* Strip the dereference temporarily. */
16403 }
16405 /* If we're in a template, we represent a qualified-id referring
16406 to a static data member as a SCOPE_REF even if the scope isn't
16407 dependent so that we can check access control later. */
16412 {
16413 /* A variable without external linkage might still be a
16414 valid constant-expression, so no error is issued here
16415 if the external-linkage check fails. */
16418 }
16420 /* All overloaded functions are allowed; if the external
16421 linkage test does not pass, an error will be issued
16422 later. */
16423 ;
16427 /* A pointer-to-member. */
16428 ;
16430 ;
16431 else
16435 {
16438 tf_warning_or_error);
16439 else
16442 }
16443 }
16444 }
16445 /* If the argument started with "&", there are no other valid
16446 alternatives at this point. */
16448 {
16451 }
16453 general_expr:
16454 /* If the argument wasn't successfully parsed as a type-id followed
16455 by '>>', the argument can only be a constant expression now.
16456 Otherwise, we try parsing the constant-expression tentatively,
16457 because the argument could really be a type-id. */
16463 else
16464 {
16465 /* With C++17 generalized non-type template arguments we need to handle
16466 lvalue constant expressions, too. */
16469 }
16477 /* We did our best to parse the argument as a non type-id, but that
16478 was the only alternative that matched (albeit with a '>' after
16479 it). We can assume it's just a typo from the user, and a
16480 diagnostic will then be issued. */
16482 }
16484 /* Parse an explicit-instantiation.
16486 explicit-instantiation:
16487 template declaration
16489 Although the standard says `declaration', what it really means is:
16491 explicit-instantiation:
16492 template decl-specifier-seq [opt] declarator [opt] ;
16494 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16495 supposed to be allowed. A defect report has been filed about this
16496 issue.
16498 GNU Extension:
16500 explicit-instantiation:
16501 storage-class-specifier template
16502 decl-specifier-seq [opt] declarator [opt] ;
16503 function-specifier template
16504 decl-specifier-seq [opt] declarator [opt] ; */
16506 static void
16508 {
16510 cp_decl_specifier_seq decl_specifiers;
16515 /* Look for an (optional) storage-class-specifier or
16516 function-specifier. */
16518 {
16519 extension_specifier
16522 extension_specifier
16525 }
16527 /* Look for the `template' keyword. */
16529 /* Let the front end know that we are processing an explicit
16530 instantiation. */
16532 /* [temp.explicit] says that we are supposed to ignore access
16533 control while processing explicit instantiation directives. */
16535 /* Parse a decl-specifier-seq. */
16537 CP_PARSER_FLAGS_OPTIONAL,
16540 /* If there was exactly one decl-specifier, and it declared a class,
16541 and there's no declarator, then we have an explicit type
16542 instantiation. */
16544 {
16545 tree type;
16549 /* Turn access control back on for names used during
16550 template instantiation. */
16555 }
16556 else
16557 {
16559 tree decl;
16561 /* Parse the declarator. */
16562 declarator
16573 {
16576 "explicit instantiation shall not use"
16580 "explicit instantiation shall not use"
16585 /* Turn access control back on for names used during
16586 template instantiation. */
16588 /* Do the explicit instantiation. */
16590 }
16591 else
16592 {
16594 /* Skip the body of the explicit instantiation. */
16596 }
16597 }
16598 /* We're done with the instantiation. */
16604 }
16606 /* Parse an explicit-specialization.
16608 explicit-specialization:
16609 template < > declaration
16611 Although the standard says `declaration', what it really means is:
16613 explicit-specialization:
16614 template <> decl-specifier [opt] init-declarator [opt] ;
16615 template <> function-definition
16616 template <> explicit-specialization
16617 template <> template-declaration */
16619 static void
16621 {
16625 /* Look for the `template' keyword. */
16627 /* Look for the `<'. */
16629 /* Look for the `>'. */
16631 /* We have processed another parameter list. */
16633 /* [temp]
16635 A template ... explicit specialization ... shall not have C
16636 linkage. */
16638 {
16641 /* Give it C++ linkage to avoid confusing other parts of the
16642 front end. */
16645 }
16646 else
16648 /* Let the front end know that we are beginning a specialization. */
16650 {
16653 }
16655 /* If the next keyword is `template', we need to figure out whether
16656 or not we're looking a template-declaration. */
16658 {
16663 else
16665 }
16666 else
16667 /* Parse the dependent declaration. */
16673 /* We're done with the specialization. */
16675 /* For the erroneous case of a template with C linkage, we pushed an
16676 implicit C++ linkage scope; exit that scope now. */
16679 /* We're done with this parameter list. */
16681 }
16683 /* Parse a type-specifier.
16685 type-specifier:
16686 simple-type-specifier
16687 class-specifier
16688 enum-specifier
16689 elaborated-type-specifier
16690 cv-qualifier
16692 GNU Extension:
16694 type-specifier:
16695 __complex__
16697 Returns a representation of the type-specifier. For a
16698 class-specifier, enum-specifier, or elaborated-type-specifier, a
16699 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16701 The parser flags FLAGS is used to control type-specifier parsing.
16703 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16704 in a decl-specifier-seq.
16706 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16707 class-specifier, enum-specifier, or elaborated-type-specifier, then
16708 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16709 if a type is declared; 2 if it is defined. Otherwise, it is set to
16710 zero.
16712 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16713 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16714 is set to FALSE. */
16716 static tree
16718 cp_parser_flags flags,
16723 {
16729 /* Assume this type-specifier does not declare a new type. */
16732 /* And that it does not specify a cv-qualifier. */
16735 /* Peek at the next token. */
16738 /* If we're looking at a keyword, we can use that to guide the
16739 production we choose. */
16742 {
16747 /* Look for the enum-specifier. */
16749 /* If that worked, we're done. */
16751 {
16756 type_spec,
16757 token,
16760 }
16761 else
16764 /* Any of these indicate either a class-specifier, or an
16765 elaborated-type-specifier. */
16772 /* Parse tentatively so that we can back up if we don't find a
16773 class-specifier. */
16775 /* Look for the class-specifier. */
16778 /* If that worked, we're done. */
16780 {
16785 type_spec,
16786 token,
16789 }
16791 /* Fall through. */
16792 elaborated_type_specifier:
16793 /* We're declaring (not defining) a class or enum. */
16797 /* Fall through. */
16799 /* Look for an elaborated-type-specifier. */
16800 type_spec
16801 = (cp_parser_elaborated_type_specifier
16804 is_declaration));
16807 type_spec,
16808 token,
16831 /* The `__complex__' keyword is a GNU extension. */
16837 }
16839 /* Handle simple keywords. */
16841 {
16843 {
16846 }
16848 }
16850 /* If we do not already have a type-specifier, assume we are looking
16851 at a simple-type-specifier. */
16853 decl_specs,
16854 flags);
16856 /* If we didn't find a type-specifier, and a type-specifier was not
16857 optional in this context, issue an error message. */
16859 {
16862 }
16865 }
16867 /* Parse a simple-type-specifier.
16869 simple-type-specifier:
16870 :: [opt] nested-name-specifier [opt] type-name
16871 :: [opt] nested-name-specifier template template-id
16872 char
16873 wchar_t
16874 bool
16875 short
16876 int
16877 long
16878 signed
16879 unsigned
16880 float
16881 double
16882 void
16884 C++11 Extension:
16886 simple-type-specifier:
16887 auto
16888 decltype ( expression )
16889 char16_t
16890 char32_t
16891 __underlying_type ( type-id )
16893 C++17 extension:
16895 nested-name-specifier(opt) template-name
16897 GNU Extension:
16899 simple-type-specifier:
16900 __int128
16901 __typeof__ unary-expression
16902 __typeof__ ( type-id )
16903 __typeof__ ( type-id ) { initializer-list , [opt] }
16905 Concepts Extension:
16907 simple-type-specifier:
16908 constrained-type-specifier
16910 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16911 appropriately updated. */
16913 static tree
16916 cp_parser_flags flags)
16917 {
16922 /* Peek at the next token. */
16925 /* If we're looking at a keyword, things are easy. */
16927 {
16962 {
16965 }
16994 {
16995 /* The 'auto' might be the placeholder return type for a function decl
16996 with trailing return type. */
17005 {
17007 {
17014 }
17017 {
17020 }
17023 }
17027 {
17030 }
17033 {
17036 }
17037 else
17041 {
17044 "use of %<auto%> in lambda parameter declaration "
17045 "only available with "
17047 }
17050 "use of %<auto%> in parameter declaration "
17051 "only available with "
17055 "use of %<auto%> in parameter declaration "
17057 }
17058 else
17063 /* Since DR 743, decltype can either be a simple-type-specifier by
17064 itself or begin a nested-name-specifier. Parsing it will replace
17065 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17066 handling below decide what to do. */
17072 /* Consume the `typeof' token. */
17074 /* Parse the operand to `typeof'. */
17076 /* If it is not already a TYPE, take its type. */
17082 token,
17091 token,
17101 token,
17106 }
17108 /* If token is an already-parsed decltype not followed by ::,
17109 it's a simple-type-specifier. */
17112 {
17115 {
17117 token,
17119 /* Remember that we are handling a decltype in order to
17120 implement the resolution of DR 1510 when the argument
17121 isn't instantiation dependent. */
17123 }
17126 }
17128 /* If the type-specifier was for a built-in type, we're done. */
17130 {
17131 /* Record the type. */
17138 type,
17139 token,
17144 /* Consume the token. */
17150 /* There is no valid C++ program where a non-template type is
17151 followed by a "<". That usually indicates that the user thought
17152 that the type was a template. */
17157 }
17159 /* The type-specifier must be a user-defined type. */
17161 {
17165 /* Don't gobble tokens or issue error messages if this is an
17166 optional type-specifier. */
17172 /* Look for the optional `::' operator. */
17173 global_p
17177 /* Look for the nested-name specifier. */
17178 qualified_p
17185 /* If we have seen a nested-name-specifier, and the next token
17186 is `template', then we are using the template-id production. */
17189 {
17190 /* Look for the template-id. */
17194 none_type,
17196 /* If the template-id did not name a type, we are out of
17197 luck. */
17199 {
17202 }
17203 }
17204 /* Otherwise, look for a type-name. */
17205 else
17207 /* Keep track of all name-lookups performed in class scopes. */
17209 && !global_p
17210 && !qualified_p
17214 /* If it didn't work out, we don't have a TYPE. */
17219 {
17233 {
17235 none_type,
17245 else
17246 {
17251 }
17252 }
17253 else
17259 }
17262 token,
17264 }
17266 /* If we didn't get a type-name, issue an error message. */
17268 {
17271 }
17274 {
17275 /* See if TYPE is an Objective-C type, and if so, parse and
17276 accept any protocol references following it. Do this before
17277 the cp_parser_check_for_invalid_template_id() call, because
17278 Objective-C types can be followed by '<...>' which would
17279 enclose protocol names rather than template arguments, and so
17280 everything is fine. */
17283 {
17287 /* Clobber the "unqualified" type previously entered into
17288 DECL_SPECS with the new, improved protocol-qualified version. */
17293 }
17295 /* There is no valid C++ program where a non-template type is
17296 followed by a "<". That usually indicates that the user
17297 thought that the type was a template. */
17299 none_type,
17301 }
17304 }
17306 /* Parse a type-name.
17308 type-name:
17309 class-name
17310 enum-name
17311 typedef-name
17312 simple-template-id [in c++0x]
17314 enum-name:
17315 identifier
17317 typedef-name:
17318 identifier
17320 Concepts:
17322 type-name:
17323 concept-name
17324 partial-concept-id
17326 concept-name:
17327 identifier
17329 Returns a TYPE_DECL for the type. */
17331 static tree
17333 {
17335 }
17337 /* See above. */
17338 static tree
17340 {
17341 tree type_decl;
17343 /* We can't know yet whether it is a class-name or not. */
17345 /* Try a class-name. */
17347 typename_keyword_p,
17349 none_type,
17353 /* If it's not a class-name, keep looking. */
17355 {
17357 /* It must be a typedef-name or an enum-name. */
17361 /* It is either a simple-template-id representing an
17362 instantiation of an alias template... */
17366 none_type,
17368 /* Note that this must be an instantiation of an alias template
17369 because [temp.names]/6 says:
17371 A template-id that names an alias template specialization
17372 is a type-name.
17374 Whereas [temp.names]/7 says:
17376 A simple-template-id that names a class template
17377 specialization is a class-name.
17379 With concepts, this could also be a partial-concept-id that
17380 declares a non-type template parameter. */
17387 else
17391 /* ... Or a typedef-name or an enum-name. */
17393 }
17396 }
17398 /* Check if DECL and ARGS can form a constrained-type-specifier.
17399 If ARGS is non-null, we try to form a concept check of the
17400 form DECL<?, ARGS> where ? is a wildcard that matches any
17401 kind of template argument. If ARGS is NULL, then we try to
17402 form a concept check of the form DECL<?>. */
17404 static tree
17407 {
17410 /* If we a constrained-type-specifier cannot be deduced. */
17414 /* A constrained type specifier can only be found in an
17415 overload set or as a reference to a template declaration.
17417 FIXME: This might be masking a bug. It's possible that
17418 that the deduction below is causing template specializations
17419 to be formed with the wildcard as an argument. */
17423 /* Try to build a call expression that evaluates the
17424 concept. This can fail if the overload set refers
17425 only to non-templates. */
17431 /* Deduce the checked constraint and the prototype parameter.
17433 FIXME: In certain cases, failure to deduce should be a
17434 diagnosable error. */
17435 tree conc;
17436 tree proto;
17440 /* In template parameter scope, this results in a constrained
17441 parameter. Return a descriptor of that parm. */
17445 /* In a parameter-declaration-clause, constrained-type
17446 specifiers result in invented template parameters. */
17448 {
17451 }
17452 else
17453 {
17454 /* Otherwise, we're in a context where the constrained
17455 type name is deduced and the constraint applies
17456 after deduction. */
17458 }
17461 }
17463 /* If DECL refers to a concept, return a TYPE_DECL representing
17464 the result of using the constrained type specifier in the
17465 current context. DECL refers to a concept if
17467 - it is an overload set containing a function concept taking a single
17468 type argument, or
17470 - it is a variable concept taking a single type argument. */
17472 static tree
17474 {
17480 else
17482 }
17484 /* Check if DECL and ARGS form a partial-concept-id. If so,
17485 assign ID to the resulting constrained placeholder.
17487 Returns true if the partial-concept-id designates a placeholder
17488 and false otherwise. Note that *id is set to NULL_TREE in
17489 this case. */
17491 static tree
17493 {
17495 }
17497 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17498 or a concept-name.
17500 enum-name:
17501 identifier
17503 typedef-name:
17504 identifier
17506 concept-name:
17507 identifier
17509 Returns a TYPE_DECL for the type. */
17511 static tree
17513 {
17514 tree type_decl;
17515 tree identifier;
17522 /* Look up the type-name. */
17527 /* If we found an overload set, then it may refer to a concept-name. */
17533 {
17534 /* See if this is an Objective-C type. */
17539 }
17541 /* Issue an error if we did not find a type-name. */
17543 /* In Objective-C, we have the complication that class names are
17544 normally type names and start declarations (eg, the
17545 "NSObject" in "NSObject *object;"), but can be used in an
17546 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17547 is an expression. So, a classname followed by a dot is not a
17548 valid type-name. */
17551 {
17556 }
17557 /* Remember that the name was used in the definition of the
17558 current class so that we can check later to see if the
17559 meaning would have been different after the class was
17560 entirely defined. */
17566 }
17568 /* Parse an elaborated-type-specifier. Note that the grammar given
17569 here incorporates the resolution to DR68.
17571 elaborated-type-specifier:
17572 class-key :: [opt] nested-name-specifier [opt] identifier
17573 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17574 enum-key :: [opt] nested-name-specifier [opt] identifier
17575 typename :: [opt] nested-name-specifier identifier
17576 typename :: [opt] nested-name-specifier template [opt]
17577 template-id
17579 GNU extension:
17581 elaborated-type-specifier:
17582 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17583 class-key attributes :: [opt] nested-name-specifier [opt]
17584 template [opt] template-id
17585 enum attributes :: [opt] nested-name-specifier [opt] identifier
17587 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17588 declared `friend'. If IS_DECLARATION is TRUE, then this
17589 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17590 something is being declared.
17592 Returns the TYPE specified. */
17594 static tree
17598 {
17600 tree identifier;
17603 tree globalscope;
17606 /* See if we're looking at the `enum' keyword. */
17608 {
17609 /* Consume the `enum' token. */
17611 /* Remember that it's an enumeration type. */
17613 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17614 enums) is used here. */
17618 {
17625 /* Consume the `struct' or `class' and parse it anyway. */
17627 }
17628 /* Parse the attributes. */
17630 }
17631 /* Or, it might be `typename'. */
17633 RID_TYPENAME))
17634 {
17635 /* Consume the `typename' token. */
17637 /* Remember that it's a `typename' type. */
17639 }
17640 /* Otherwise it must be a class-key. */
17641 else
17642 {
17646 /* Parse the attributes. */
17648 }
17650 /* Look for the `::' operator. */
17653 /* Look for the nested-name-specifier. */
17654 tree nested_name_specifier;
17656 {
17657 nested_name_specifier
17662 is_declaration);
17665 }
17666 else
17667 /* Even though `typename' is not present, the proposed resolution
17668 to Core Issue 180 says that in `class A<T>::B', `B' should be
17669 considered a type-name, even if `A<T>' is dependent. */
17670 nested_name_specifier
17675 is_declaration);
17676 /* For everything but enumeration types, consider a template-id.
17677 For an enumeration type, consider only a plain identifier. */
17679 {
17681 tree decl;
17683 /* Allow the `template' keyword. */
17685 /* If we didn't see `template', we don't know if there's a
17686 template-id or not. */
17689 /* Parse the template-id. */
17693 tag_type,
17694 is_declaration);
17695 /* If we didn't find a template-id, look for an ordinary
17696 identifier. */
17698 ;
17699 /* We can get here when cp_parser_template_id, called by
17700 cp_parser_class_name with tag_type == none_type, succeeds
17701 and caches a BASELINK. Then, when called again here,
17702 instead of failing and returning an error_mark_node
17703 returns it (see template/typename17.C in C++11).
17704 ??? Could we diagnose this earlier? */
17706 {
17709 }
17710 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17711 in effect, then we must assume that, upon instantiation, the
17712 template will correspond to a class. */
17716 typename_type,
17718 /* If the `typename' keyword is in effect and DECL is not a type
17719 decl, then type is non existent. */
17721 ;
17723 {
17727 /* If the next token is a semicolon, this must be a specialization,
17728 instantiation, or friend declaration. Check the scope while we
17729 still know whether or not we had a nested-name-specifier. */
17734 }
17737 }
17740 {
17745 {
17748 }
17750 /* For a `typename', we needn't call xref_tag. */
17756 /* Template parameter lists apply only if we are not within a
17757 function parameter list. */
17758 bool template_parm_lists_apply
17767 /* Look up a qualified name in the usual way. */
17769 {
17770 tree decl;
17771 tree ambiguous_decls;
17774 tag_type,
17781 /* If the lookup was ambiguous, an error will already have been
17782 issued. */
17786 /* If we are parsing friend declaration, DECL may be a
17787 TEMPLATE_DECL tree node here. However, we need to check
17788 whether this TEMPLATE_DECL results in valid code. Consider
17789 the following example:
17791 namespace N {
17792 template <class T> class C {};
17793 }
17794 class X {
17795 template <class T> friend class N::C; // #1, valid code
17796 };
17797 template <class T> class Y {
17798 friend class N::C; // #2, invalid code
17799 };
17801 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17802 name lookup of `N::C'. We see that friend declaration must
17803 be template for the code to be valid. Note that
17804 processing_template_decl does not work here since it is
17805 always 1 for the above two cases. */
17807 decl = (cp_parser_maybe_treat_template_as_class
17812 {
17814 identifier,
17817 }
17820 {
17824 allow_template);
17828 }
17830 /* Forward declarations of nested types, such as
17832 class C1::C2;
17833 class C1::C2::C3;
17835 are invalid unless all components preceding the final '::'
17836 are complete. If all enclosing types are complete, these
17837 declarations become merely pointless.
17839 Invalid forward declarations of nested types are errors
17840 caught elsewhere in parsing. Those that are pointless arrive
17841 here. */
17848 }
17849 else
17850 {
17851 /* An elaborated-type-specifier sometimes introduces a new type and
17852 sometimes names an existing type. Normally, the rule is that it
17853 introduces a new type only if there is not an existing type of
17854 the same name already in scope. For example, given:
17856 struct S {};
17857 void f() { struct S s; }
17859 the `struct S' in the body of `f' is the same `struct S' as in
17860 the global scope; the existing definition is used. However, if
17861 there were no global declaration, this would introduce a new
17862 local class named `S'.
17864 An exception to this rule applies to the following code:
17866 namespace N { struct S; }
17868 Here, the elaborated-type-specifier names a new type
17869 unconditionally; even if there is already an `S' in the
17870 containing scope this declaration names a new type.
17871 This exception only applies if the elaborated-type-specifier
17872 forms the complete declaration:
17874 [class.name]
17876 A declaration consisting solely of `class-key identifier ;' is
17877 either a redeclaration of the name in the current scope or a
17878 forward declaration of the identifier as a class name. It
17879 introduces the name into the current scope.
17881 We are in this situation precisely when the next token is a `;'.
17883 An exception to the exception is that a `friend' declaration does
17884 *not* name a new type; i.e., given:
17886 struct S { friend struct T; };
17888 `T' is not a new type in the scope of `S'.
17890 Also, `new struct S' or `sizeof (struct S)' never results in the
17891 definition of a new type; a new type can only be declared in a
17892 declaration context. */
17894 tag_scope ts;
17898 /* Friends have special name lookup rules. */
17902 CPP_SEMICOLON))
17903 /* This is a `class-key identifier ;' */
17905 else
17908 template_p =
17909 (template_parm_lists_apply
17912 /* An unqualified name was used to reference this type, so
17913 there were no qualifying templates. */
17922 }
17923 }
17928 /* Allow attributes on forward declarations of classes. */
17930 {
17940 else
17943 }
17946 {
17947 /* Indicate whether this class was declared as a `class' or as a
17948 `struct'. */
17952 }
17954 /* A "<" cannot follow an elaborated type specifier. If that
17955 happens, the user was probably trying to form a template-id. */
17960 }
17962 /* Parse an enum-specifier.
17964 enum-specifier:
17965 enum-head { enumerator-list [opt] }
17966 enum-head { enumerator-list , } [C++0x]
17968 enum-head:
17969 enum-key identifier [opt] enum-base [opt]
17970 enum-key nested-name-specifier identifier enum-base [opt]
17972 enum-key:
17973 enum
17974 enum class [C++0x]
17975 enum struct [C++0x]
17977 enum-base: [C++0x]
17978 : type-specifier-seq
17980 opaque-enum-specifier:
17981 enum-key identifier enum-base [opt] ;
17983 GNU Extensions:
17984 enum-key attributes[opt] identifier [opt] enum-base [opt]
17985 { enumerator-list [opt] }attributes[opt]
17986 enum-key attributes[opt] identifier [opt] enum-base [opt]
17987 { enumerator-list, }attributes[opt] [C++0x]
17989 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17990 if the token stream isn't an enum-specifier after all. */
17992 static tree
17994 {
17995 tree identifier;
17997 tree prev_scope;
17999 tree attributes;
18012 /* Parse tentatively so that we can back up if we don't find a
18013 enum-specifier. */
18016 /* Caller guarantees that the current token is 'enum', an identifier
18017 possibly follows, and the token after that is an opening brace.
18018 If we don't have an identifier, fabricate an anonymous name for
18019 the enumeration being defined. */
18022 /* Parse the "class" or "struct", which indicates a scoped
18023 enumeration type in C++0x. */
18026 {
18030 /* Consume the `struct' or `class' token. */
18034 }
18038 /* Clear the qualification. */
18043 /* Figure out in what scope the declaration is being placed. */
18049 nested_name_specifier
18057 {
18058 tree name;
18062 enum_type,
18067 input_location);
18069 {
18072 {
18073 /* Are template enums allowed in ISO? */
18077 /* ignore a typename reference, for it will be solved by name
18078 in start_enum. */
18080 }
18081 }
18084 else
18085 {
18090 }
18091 }
18092 else
18093 {
18096 else
18097 {
18103 }
18104 }
18107 /* Check for the `:' that denotes a specified underlying type in C++0x.
18108 Note that a ':' could also indicate a bitfield width, however. */
18110 {
18111 cp_decl_specifier_seq type_specifiers;
18113 /* Consume the `:'. */
18116 /* Parse the type-specifier-seq. */
18121 /* At this point this is surely not elaborated type specifier. */
18130 /* If that didn't work, stop. */
18132 {
18138 }
18139 }
18141 /* Look for the `{' but don't consume it yet. */
18143 {
18145 {
18148 {
18151 }
18152 }
18153 /* An opaque-enum-specifier must have a ';' here. */
18156 {
18159 {
18162 }
18163 }
18164 }
18170 {
18172 {
18176 }
18178 {
18180 }
18181 }
18183 /* Issue an error message if type-definitions are forbidden here. */
18186 else
18187 /* Create the new type. We do this before consuming the opening
18188 brace so the enum will be recorded as being on the line of its
18189 tag (or the 'enum' keyword, if there is no tag). */
18193 /* If the next token is not '{' it is an opaque-enum-specifier or an
18194 elaborated-type-specifier. */
18196 {
18200 {
18201 /* The following catches invalid code such as:
18202 enum class S<int>::E { A, B, C }; */
18210 {
18214 nested_name_specifier);
18216 }
18219 {
18221 "%qT for enum declaration does not name a class "
18224 }
18225 /* If that scope does not contain the scope in which the
18226 class was originally declared, the program is invalid. */
18228 nested_name_specifier))
18229 {
18232 "declaration of %qD in namespace %qD which does not "
18235 else
18237 "declaration of %qD in %qD which does not "
18241 }
18242 /* If that scope is the scope where the declaration is being placed
18243 the program is invalid. */
18247 {
18251 }
18252 }
18257 /* Consume the opening brace. */
18258 matching_braces braces;
18265 {
18269 }
18270 else
18271 {
18277 }
18281 /* If the next token is not '}', then there are some enumerators. */
18283 {
18287 }
18288 else
18291 /* Consume the final '}'. */
18297 }
18298 else
18299 {
18300 /* If a ';' follows, then it is an opaque-enum-specifier
18301 and additional restrictions apply. */
18303 {
18310 }
18311 }
18313 /* Look for trailing attributes to apply to this enumeration, and
18314 apply them if appropriate. */
18316 {
18319 trailing_attr,
18321 }
18323 /* Finish up the enumeration. */
18325 {
18330 }
18333 {
18335 {
18338 }
18340 {
18342 }
18343 }
18344 out:
18347 }
18349 /* Parse an enumerator-list. The enumerators all have the indicated
18350 TYPE.
18352 enumerator-list:
18353 enumerator-definition
18354 enumerator-list , enumerator-definition */
18356 static void
18358 {
18360 {
18361 /* Parse an enumerator-definition. */
18364 /* If the next token is not a ',', we've reached the end of
18365 the list. */
18368 /* Otherwise, consume the `,' and keep going. */
18370 /* If the next token is a `}', there is a trailing comma. */
18372 {
18377 }
18378 }
18379 }
18381 /* Parse an enumerator-definition. The enumerator has the indicated
18382 TYPE.
18384 enumerator-definition:
18385 enumerator
18386 enumerator = constant-expression
18388 enumerator:
18389 identifier
18391 GNU Extensions:
18393 enumerator-definition:
18394 enumerator attributes [opt]
18395 enumerator attributes [opt] = constant-expression */
18397 static void
18399 {
18400 tree identifier;
18401 tree value;
18402 location_t loc;
18404 /* Save the input location because we are interested in the location
18405 of the identifier and not the location of the explicit value. */
18408 /* Look for the identifier. */
18413 /* Parse any specified attributes. */
18416 /* If the next token is an '=', then there is an explicit value. */
18418 {
18419 /* Consume the `=' token. */
18421 /* Parse the value. */
18423 }
18424 else
18427 /* If we are processing a template, make sure the initializer of the
18428 enumerator doesn't contain any bare template parameter pack. */
18432 /* Create the enumerator. */
18434 }
18436 /* Parse a namespace-name.
18438 namespace-name:
18439 original-namespace-name
18440 namespace-alias
18442 Returns the NAMESPACE_DECL for the namespace. */
18444 static tree
18446 {
18447 tree identifier;
18448 tree namespace_decl;
18452 /* Get the name of the namespace. */
18457 /* Look up the identifier in the currently active scope. Look only
18458 for namespaces, due to:
18460 [basic.lookup.udir]
18462 When looking up a namespace-name in a using-directive or alias
18463 definition, only namespace names are considered.
18465 And:
18467 [basic.lookup.qual]
18469 During the lookup of a name preceding the :: scope resolution
18470 operator, object, function, and enumerator names are ignored.
18472 (Note that cp_parser_qualifying_entity only calls this
18473 function if the token after the name is the scope resolution
18474 operator.) */
18476 none_type,
18482 /* If it's not a namespace, issue an error. */
18485 {
18487 {
18493 }
18496 }
18499 }
18501 /* Parse a namespace-definition.
18503 namespace-definition:
18504 named-namespace-definition
18505 unnamed-namespace-definition
18507 named-namespace-definition:
18508 original-namespace-definition
18509 extension-namespace-definition
18511 original-namespace-definition:
18512 namespace identifier { namespace-body }
18514 extension-namespace-definition:
18515 namespace original-namespace-name { namespace-body }
18517 unnamed-namespace-definition:
18518 namespace { namespace-body } */
18520 static void
18522 {
18523 tree identifier;
18532 {
18535 }
18537 /* Look for the `namespace' keyword. */
18538 cp_token* token
18541 /* Parse any specified attributes before the identifier. */
18545 {
18549 {
18552 /* Parse any attributes specified after the identifier. */
18554 }
18561 "nested namespace definitions only available with "
18564 /* Nested namespace names can create new namespaces (unlike
18565 other qualified-ids). */
18568 else
18571 }
18583 /* Start the namespace. */
18590 /* Look for the `{' to validate starting the namespace. */
18591 matching_braces braces;
18593 {
18594 /* Parse the body of the namespace. */
18597 /* Look for the final `}'. */
18599 }
18604 /* Pop the nested namespace definitions. */
18607 }
18609 /* Parse a namespace-body.
18611 namespace-body:
18612 declaration-seq [opt] */
18614 static void
18616 {
18618 }
18620 /* Parse a namespace-alias-definition.
18622 namespace-alias-definition:
18623 namespace identifier = qualified-namespace-specifier ; */
18625 static void
18627 {
18628 tree identifier;
18629 tree namespace_specifier;
18633 /* Look for the `namespace' keyword. */
18635 /* Look for the identifier. */
18639 /* Look for the `=' token. */
18642 {
18644 /* Skip the definition. */
18649 }
18651 /* Look for the qualified-namespace-specifier. */
18652 namespace_specifier
18654 /* Look for the `;' token. */
18657 /* Register the alias in the symbol table. */
18659 }
18661 /* Parse a qualified-namespace-specifier.
18663 qualified-namespace-specifier:
18664 :: [opt] nested-name-specifier [opt] namespace-name
18666 Returns a NAMESPACE_DECL corresponding to the specified
18667 namespace. */
18669 static tree
18671 {
18672 /* Look for the optional `::'. */
18676 /* Look for the optional nested-name-specifier. */
18684 }
18686 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18687 access declaration.
18689 using-declaration:
18690 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18691 using :: unqualified-id ;
18693 access-declaration:
18694 qualified-id ;
18696 */
18698 static bool
18701 {
18705 tree decl;
18706 tree identifier;
18707 tree qscope;
18712 {
18715 }
18716 else
18717 {
18718 /* Look for the `using' keyword. */
18721 again:
18722 /* Peek at the next token. */
18724 /* See if it's `typename'. */
18726 {
18727 /* Remember that we've seen it. */
18729 /* Consume the `typename' token. */
18731 }
18732 }
18734 /* Look for the optional global scope qualification. */
18735 global_scope_p
18740 /* If we saw `typename', or didn't see `::', then there must be a
18741 nested-name-specifier present. */
18743 {
18749 {
18752 }
18753 }
18754 /* Otherwise, we could be in either of the two productions. In that
18755 case, treat the nested-name-specifier as optional. */
18756 else
18768 /* Something has already gone wrong; there's no need to parse
18769 further. Since an error has occurred, the return value of
18770 cp_parser_parse_definitely will be false, as required. */
18774 /* Parse the unqualified-id. */
18782 {
18787 }
18789 {
18794 "pack expansion in using-declaration only available "
18797 }
18799 /* The function we call to handle a using-declaration is different
18800 depending on what scope we are in. */
18802 ;
18805 /* [namespace.udecl]
18807 A using declaration shall not name a template-id. */
18810 else
18811 {
18813 {
18814 /* Create the USING_DECL. */
18821 {
18824 }
18825 else
18826 /* Add it to the list of members in this class. */
18828 }
18829 else
18830 {
18832 identifier,
18839 {
18842 }
18845 else
18847 }
18848 }
18852 {
18856 "comma-separated list in using-declaration only available "
18859 }
18861 /* Look for the final `;'. */
18866 "access declarations are deprecated "
18867 "in favour of using-declarations; "
18871 }
18873 /* Parse an alias-declaration.
18875 alias-declaration:
18876 using identifier attribute-specifier-seq [opt] = type-id */
18878 static tree
18880 {
18882 location_t id_location;
18884 cp_decl_specifier_seq decl_specs;
18888 /* Look for the `using' keyword. */
18889 cp_token *using_token
18911 /* Now we are going to parse the type-id of the declaration. */
18913 /*
18914 [dcl.type]/3 says:
18916 "A type-specifier-seq shall not define a class or enumeration
18917 unless it appears in the type-id of an alias-declaration (7.1.3) that
18918 is not the declaration of a template-declaration."
18920 In other words, if we currently are in an alias template, the
18921 type-id should not define a type.
18923 So let's set parser->type_definition_forbidden_message in that
18924 case; cp_parser_check_type_definition (called by
18925 cp_parser_class_specifier) will then emit an error if a type is
18926 defined in the type-id. */
18928 {
18932 }
18936 /* Restore the error message if need be. */
18942 {
18945 }
18947 /* A typedef-name can also be introduced by an alias-declaration. The
18948 identifier following the using keyword becomes a typedef-name. It has
18949 the same semantics as if it were introduced by the typedef
18950 specifier. In particular, it does not define a new type and it shall
18951 not appear in the type-id. */
18956 {
18959 ds_attribute,
18960 attrs_token);
18961 }
18963 ds_typedef,
18964 using_token);
18966 ds_alias,
18967 using_token);
18973 id_location,
18984 else
18990 // Attach constraints to the alias declaration.
18992 {
18996 }
19003 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19004 added into the symbol table; otherwise, return the TYPE_DECL. */
19008 {
19012 }
19015 }
19017 /* Parse a using-directive.
19019 using-directive:
19020 using namespace :: [opt] nested-name-specifier [opt]
19021 namespace-name ; */
19023 static void
19025 {
19026 tree namespace_decl;
19027 tree attribs;
19029 /* Look for the `using' keyword. */
19031 /* And the `namespace' keyword. */
19033 /* Look for the optional `::' operator. */
19035 /* And the optional nested-name-specifier. */
19041 /* Get the namespace being used. */
19043 /* And any specified attributes. */
19046 /* Update the symbol table. */
19049 else
19052 /* Look for the final `;'. */
19054 }
19056 /* Parse an asm-definition.
19058 asm-definition:
19059 asm ( string-literal ) ;
19061 GNU Extension:
19063 asm-definition:
19064 asm volatile [opt] ( string-literal ) ;
19065 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19066 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19067 : asm-operand-list [opt] ) ;
19068 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19069 : asm-operand-list [opt]
19070 : asm-clobber-list [opt] ) ;
19071 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19072 : asm-clobber-list [opt]
19073 : asm-goto-list ) ; */
19075 static void
19077 {
19078 tree string;
19083 tree asm_stmt;
19091 /* Look for the `asm' keyword. */
19096 {
19099 }
19101 /* See if the next token is `volatile'. */
19104 {
19105 /* Remember that we saw the `volatile' keyword. */
19107 /* Consume the token. */
19109 }
19113 {
19114 /* Remember that we saw the `goto' keyword. */
19116 /* Consume the token. */
19118 }
19119 /* Look for the opening `('. */
19122 /* Look for the string. */
19125 {
19129 }
19131 /* If we're allowing GNU extensions, check for the extended assembly
19132 syntax. Unfortunately, the `:' tokens need not be separated by
19133 a space in C, and so, for compatibility, we tolerate that here
19134 too. Doing that means that we have to treat the `::' operator as
19135 two `:' tokens. */
19140 {
19145 /* The extended syntax was used. */
19148 /* Look for outputs. */
19150 {
19151 /* Consume the `:'. */
19153 /* Parse the output-operands. */
19155 CPP_COLON)
19157 CPP_SCOPE)
19159 CPP_CLOSE_PAREN)
19161 {
19165 }
19166 }
19167 /* If the next token is `::', there are no outputs, and the
19168 next token is the beginning of the inputs. */
19170 /* The inputs are coming next. */
19173 /* Look for inputs. */
19176 {
19177 /* Consume the `:' or `::'. */
19179 /* Parse the output-operands. */
19181 CPP_COLON)
19183 CPP_SCOPE)
19185 CPP_CLOSE_PAREN))
19186 {
19190 }
19191 }
19193 /* The clobbers are coming next. */
19196 /* Look for clobbers. */
19199 {
19201 /* Consume the `:' or `::'. */
19203 /* Parse the clobbers. */
19205 CPP_COLON)
19207 CPP_CLOSE_PAREN))
19209 }
19212 /* The labels are coming next. */
19215 /* Look for labels. */
19218 {
19220 /* Consume the `:' or `::'. */
19222 /* Parse the labels. */
19224 }
19228 }
19232 /* Look for the closing `)'. */
19240 {
19241 /* Create the ASM_EXPR. */
19243 {
19246 /* If the extended syntax was not used, mark the ASM_EXPR. */
19248 {
19254 }
19255 }
19256 else
19258 }
19259 }
19261 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19262 type that comes from the decl-specifier-seq. */
19264 static tree
19266 {
19269 {
19282 }
19285 }
19287 /* Declarators [gram.dcl.decl] */
19289 /* Parse an init-declarator.
19291 init-declarator:
19292 declarator initializer [opt]
19294 GNU Extension:
19296 init-declarator:
19297 declarator asm-specification [opt] attributes [opt] initializer [opt]
19299 function-definition:
19300 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19301 function-body
19302 decl-specifier-seq [opt] declarator function-try-block
19304 GNU Extension:
19306 function-definition:
19307 __extension__ function-definition
19309 TM Extension:
19311 function-definition:
19312 decl-specifier-seq [opt] declarator function-transaction-block
19314 The DECL_SPECIFIERS apply to this declarator. Returns a
19315 representation of the entity declared. If MEMBER_P is TRUE, then
19316 this declarator appears in a class scope. The new DECL created by
19317 this declarator is returned.
19319 The CHECKS are access checks that should be performed once we know
19320 what entity is being declared (and, therefore, what classes have
19321 befriended it).
19323 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19324 for a function-definition here as well. If the declarator is a
19325 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19326 be TRUE upon return. By that point, the function-definition will
19327 have been completely parsed.
19329 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19330 is FALSE.
19332 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19333 parsed declaration if it is an uninitialized single declarator not followed
19334 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19335 if present, will not be consumed. If returned, this declarator will be
19336 created with SD_INITIALIZED but will not call cp_finish_decl.
19338 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19339 and there is an initializer, the pointed location_t is set to the
19340 location of the '=' or `(', or '{' in C++11 token introducing the
19341 initializer. */
19343 static tree
19354 {
19358 tree prefix_attributes;
19360 tree asm_specification;
19361 tree initializer;
19363 tree scope;
19365 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19366 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19367 "(...)". */
19378 /* Gather the attributes that were provided with the
19379 decl-specifiers. */
19382 /* Assume that this is not the declarator for a function
19383 definition. */
19387 /* Default arguments are only permitted for function parameters. */
19391 /* Defer access checks while parsing the declarator; we cannot know
19392 what names are accessible until we know what is being
19393 declared. */
19398 /* Parse the declarator. */
19399 declarator
19404 /* Gather up the deferred checks. */
19409 /* If the DECLARATOR was erroneous, there's no need to go
19410 further. */
19414 /* Check that the number of template-parameter-lists is OK. */
19424 /* Figure out what scope the entity declared by the DECLARATOR is
19425 located in. `grokdeclarator' sometimes changes the scope, so
19426 we compute it now. */
19429 /* Perform any lookups in the declared type which were thought to be
19430 dependent, but are not in the scope of the declarator. */
19431 decl_specifiers->type
19434 /* If we're allowing GNU extensions, look for an
19435 asm-specification. */
19437 {
19438 /* Look for an asm-specification. */
19441 }
19442 else
19445 /* Look for attributes. */
19449 /* Peek at the next token. */
19455 {
19456 /* Handle C++17 deduction guides. */
19460 {
19468 {
19472 }
19473 }
19475 /* Check to see if the token indicates the start of a
19476 function-definition. */
19478 {
19480 {
19481 /* If a function-definition should not appear here, issue an
19482 error message. */
19486 }
19488 location_t func_brace_location
19491 /* Neither attributes nor an asm-specification are allowed
19492 on a function-definition. */
19495 "an asm-specification is not allowed "
19499 "attributes are not allowed "
19501 /* This is a function-definition. */
19504 /* Parse the function definition. */
19507 decl_specifiers,
19508 declarator,
19509 prefix_attributes);
19510 else
19511 decl =
19512 (cp_parser_function_definition_from_specifiers_and_declarator
19516 {
19517 /* This is where the prologue starts... */
19520 }
19523 }
19524 }
19526 {
19527 /* A non-template declaration involving a function parameter list
19528 containing an implicit template parameter will be made into a
19529 template. If the resulting declaration is not going to be an
19530 actual function then finish the template scope here to prevent it.
19531 An error message will be issued once we have a decl to talk about.
19533 FIXME probably we should do type deduction rather than create an
19534 implicit template, but the standard currently doesn't allow it. */
19537 }
19539 /* [dcl.dcl]
19541 Only in function declarations for constructors, destructors, type
19542 conversions, and deduction guides can the decl-specifier-seq be omitted.
19544 We explicitly postpone this check past the point where we handle
19545 function-definitions because we tolerate function-definitions
19546 that are missing their return types in some modes. */
19548 {
19552 }
19554 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19558 {
19569 {
19575 }
19576 }
19577 else
19578 {
19579 /* If the init-declarator isn't initialized and isn't followed by a
19580 `,' or `;', it's not a valid init-declarator. */
19583 {
19586 else
19587 {
19591 }
19592 }
19595 }
19597 /* Because start_decl has side-effects, we should only call it if we
19598 know we're going ahead. By this point, we know that we cannot
19599 possibly be looking at any other construct. */
19602 /* Enter the newly declared entry in the symbol table. If we're
19603 processing a declaration in a class-specifier, we wait until
19604 after processing the initializer. */
19606 {
19614 /* Adjust location of decl if declarator->id_loc is more appropriate:
19615 set, and decl wasn't merged with another decl, in which case its
19616 location would be different from input_location, and more accurate. */
19621 }
19623 /* Enter the SCOPE. That way unqualified names appearing in the
19624 initializer will be looked up in SCOPE. */
19627 /* Perform deferred access control checks, now that we know in which
19628 SCOPE the declared entity resides. */
19630 {
19633 /* If the entity being declared is a function, pretend that we
19634 are in its scope. If it is a `friend', it may have access to
19635 things that would not otherwise be accessible. */
19637 {
19640 }
19642 /* Perform access checks for template parameters. */
19645 /* Perform the access control checks for the declarator and the
19646 decl-specifiers. */
19649 /* Restore the saved value. */
19652 }
19654 /* Parse the initializer. */
19659 {
19661 {
19664 else
19665 {
19666 /* If the declaration was erroneous, we don't really
19667 know what the user intended, so just silently
19668 consume the initializer. */
19675 }
19676 }
19677 else
19678 {
19679 /* We want to record the extra mangling scope for in-class
19680 initializers of class members and initializers of static data
19681 member templates. The former involves deferring
19682 parsing of the initializer until end of class as with default
19683 arguments. So right here we only handle the latter. */
19693 }
19694 }
19696 /* The old parser allows attributes to appear after a parenthesized
19697 initializer. Mark Mitchell proposed removing this functionality
19698 on the GCC mailing lists on 2002-08-13. This parser accepts the
19699 attributes -- but ignores them. Made a permerror in GCC 8. */
19705 {
19708 {
19712 }
19713 }
19715 /* And now complain about a non-function implicit template. */
19720 /* For an in-class declaration, use `grokfield' to create the
19721 declaration. */
19723 {
19725 {
19728 }
19737 }
19739 /* Finish processing the declaration. But, skip member
19740 declarations. */
19742 {
19745 asm_specification,
19746 /* If the initializer is in parentheses, then this is
19747 a direct-initialization, which means that an
19748 `explicit' constructor is OK. Otherwise, an
19749 `explicit' constructor cannot be used. */
19752 }
19755 /* Core issue #226 (C++0x only): A default template-argument
19756 shall not be specified in a friend class template
19757 declaration. */
19766 {
19769 else
19771 }
19778 }
19780 /* Parse a declarator.
19782 declarator:
19783 direct-declarator
19784 ptr-operator declarator
19786 abstract-declarator:
19787 ptr-operator abstract-declarator [opt]
19788 direct-abstract-declarator
19790 GNU Extensions:
19792 declarator:
19793 attributes [opt] direct-declarator
19794 attributes [opt] ptr-operator declarator
19796 abstract-declarator:
19797 attributes [opt] ptr-operator abstract-declarator [opt]
19798 attributes [opt] direct-abstract-declarator
19800 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19801 detect constructors, destructors, deduction guides, or conversion operators.
19802 It is set to -1 if the declarator is a name, and +1 if it is a
19803 function. Otherwise it is set to zero. Usually you just want to
19804 test for >0, but internally the negative value is used.
19806 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19807 a decl-specifier-seq unless it declares a constructor, destructor,
19808 or conversion. It might seem that we could check this condition in
19809 semantic analysis, rather than parsing, but that makes it difficult
19810 to handle something like `f()'. We want to notice that there are
19811 no decl-specifiers, and therefore realize that this is an
19812 expression, not a declaration.)
19814 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19815 the declarator is a direct-declarator of the form "(...)".
19817 MEMBER_P is true iff this declarator is a member-declarator.
19819 FRIEND_P is true iff this declarator is a friend. */
19823 cp_parser_declarator_kind dcl_kind,
19827 {
19830 cp_cv_quals cv_quals;
19831 tree class_type;
19834 /* Assume this is not a constructor, destructor, or type-conversion
19835 operator. */
19842 /* Check for the ptr-operator production. */
19844 /* Parse the ptr-operator. */
19850 /* If that worked, then we have a ptr-operator. */
19852 {
19853 /* If a ptr-operator was found, then this declarator was not
19854 parenthesized. */
19857 /* The dependent declarator is optional if we are parsing an
19858 abstract-declarator. */
19862 /* Parse the dependent declarator. */
19867 friend_p);
19869 /* If we are parsing an abstract-declarator, we must handle the
19870 case where the dependent declarator is absent. */
19875 declarator = cp_parser_make_indirect_declarator
19877 }
19878 /* Everything else is a direct-declarator. */
19879 else
19880 {
19883 CPP_OPEN_PAREN);
19885 ctor_dtor_or_conv_p,
19887 }
19892 }
19894 /* Parse a direct-declarator or direct-abstract-declarator.
19896 direct-declarator:
19897 declarator-id
19898 direct-declarator ( parameter-declaration-clause )
19899 cv-qualifier-seq [opt]
19900 ref-qualifier [opt]
19901 exception-specification [opt]
19902 direct-declarator [ constant-expression [opt] ]
19903 ( declarator )
19905 direct-abstract-declarator:
19906 direct-abstract-declarator [opt]
19907 ( parameter-declaration-clause )
19908 cv-qualifier-seq [opt]
19909 ref-qualifier [opt]
19910 exception-specification [opt]
19911 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19912 ( abstract-declarator )
19914 Returns a representation of the declarator. DCL_KIND is
19915 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19916 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19917 we are parsing a direct-declarator. It is
19918 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19919 of ambiguity we prefer an abstract declarator, as per
19920 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19921 as for cp_parser_declarator. */
19925 cp_parser_declarator_kind dcl_kind,
19928 {
19939 {
19940 /* Peek at the next token. */
19943 {
19944 /* This is either a parameter-declaration-clause, or a
19945 parenthesized declarator. When we know we are parsing a
19946 named declarator, it must be a parenthesized declarator
19947 if FIRST is true. For instance, `(int)' is a
19948 parameter-declaration-clause, with an omitted
19949 direct-abstract-declarator. But `((*))', is a
19950 parenthesized abstract declarator. Finally, when T is a
19951 template parameter `(T)' is a
19952 parameter-declaration-clause, and not a parenthesized
19953 named declarator.
19955 We first try and parse a parameter-declaration-clause,
19956 and then try a nested declarator (if FIRST is true).
19958 It is not an error for it not to be a
19959 parameter-declaration-clause, even when FIRST is
19960 false. Consider,
19962 int i (int);
19963 int i (3);
19965 The first is the declaration of a function while the
19966 second is the definition of a variable, including its
19967 initializer.
19969 Having seen only the parenthesis, we cannot know which of
19970 these two alternatives should be selected. Even more
19971 complex are examples like:
19973 int i (int (a));
19974 int i (int (3));
19976 The former is a function-declaration; the latter is a
19977 variable initialization.
19979 Thus again, we try a parameter-declaration-clause, and if
19980 that fails, we back out and return. */
19983 {
19984 tree params;
19989 /* In a member-declarator, the only valid interpretation
19990 of a parenthesis is the start of a
19991 parameter-declaration-clause. (It is invalid to
19992 initialize a static data member with a parenthesized
19993 initializer; only the "=" form of initialization is
19994 permitted.) */
19998 /* Consume the `('. */
19999 matching_parens parens;
20002 {
20003 /* If this is going to be an abstract declarator, we're
20004 in a declarator and we can't have default args. */
20007 }
20011 /* Parse the parameter-declaration-clause. */
20014 /* Consume the `)'. */
20017 /* If all went well, parse the cv-qualifier-seq,
20018 ref-qualifier and the exception-specification. */
20020 {
20021 cp_cv_quals cv_quals;
20022 cp_virt_specifiers virt_specifiers;
20023 cp_ref_qualifier ref_qual;
20024 tree exception_specification;
20025 tree late_return;
20026 tree attrs;
20036 /* Parse the cv-qualifier-seq. */
20038 /* Parse the ref-qualifier. */
20040 /* Parse the tx-qualifier. */
20042 /* And the exception-specification. */
20043 exception_specification
20048 /* In here, we handle cases where attribute is used after
20049 the function declaration. For example:
20050 void func (int x) __attribute__((vector(..))); */
20053 late_return = (cp_parser_late_return_type_opt
20057 /* Parse the virt-specifier-seq. */
20060 /* Create the function-declarator. */
20062 params,
20063 cv_quals,
20064 virt_specifiers,
20065 ref_qual,
20066 tx_qual,
20067 exception_specification,
20068 late_return,
20069 requires_clause);
20072 /* Any subsequent parameter lists are to do with
20073 return type, so are not those of the declared
20074 function. */
20076 }
20078 /* Remove the function parms from scope. */
20082 /* Repeat the main loop. */
20084 }
20086 /* If this is the first, we can try a parenthesized
20087 declarator. */
20089 {
20096 /* Consume the `('. */
20097 matching_parens parens;
20099 /* Parse the nested declarator. */
20102 declarator
20108 /* Expect a `)'. */
20116 }
20117 /* Otherwise, we must be done. */
20118 else
20120 }
20124 {
20125 /* Parse an array-declarator. */
20135 /* Consume the `['. */
20137 /* Peek at the next token. */
20139 /* If the next token is `]', then there is no
20140 constant-expression. */
20142 {
20144 bounds
20154 {
20155 /* Normally, the array bound must be an integral constant
20156 expression. However, as an extension, we allow VLAs
20157 in function scopes as long as they aren't part of a
20158 parameter declaration. */
20162 }
20165 {
20166 /* Remember this wasn't a constant-expression. */
20169 }
20170 }
20171 else
20173 /* Look for the closing `]'. */
20175 {
20178 }
20183 }
20185 {
20186 {
20187 tree qualifying_scope;
20188 tree unqualified_name;
20189 tree attrs;
20190 special_function_kind sfk;
20195 /* Parse a declarator-id */
20198 {
20201 /* If we see an ellipsis, we should be looking at a
20202 parameter pack. */
20204 {
20205 /* Consume the `...' */
20209 }
20210 }
20213 unqualified_name
20217 {
20221 {
20222 /* Check whether an error occurred. */
20225 /* We already consumed the ellipsis to mark a
20226 parameter pack, but we have no way to report it,
20227 so abort the tentative parse. We will be exiting
20228 immediately anyway. */
20230 }
20231 else
20237 && (qualifying_scope
20239 {
20242 }
20243 }
20248 {
20253 }
20259 {
20260 /* In the declaration of a member of a template class
20261 outside of the class itself, the SCOPE will sometimes
20262 be a TYPENAME_TYPE. For example, given:
20264 template <typename T>
20265 int S<T>::R::i = 3;
20267 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20268 this context, we must resolve S<T>::R to an ordinary
20269 type, rather than a typename type.
20271 The reason we normally avoid resolving TYPENAME_TYPEs
20272 is that a specialization of `S' might render
20273 `S<T>::R' not a type. However, if `S' is
20274 specialized, then this `i' will not be used, so there
20275 is no harm in resolving the types here. */
20276 tree type;
20278 /* Resolve the TYPENAME_TYPE. */
20281 /* If that failed, the declarator is invalid. */
20283 {
20286 "cannot define member of dependent typedef "
20288 else
20293 }
20295 }
20300 {
20301 tree class_type;
20306 else
20310 {
20314 {
20315 /* We do not attempt to print the declarator
20316 here because we do not have enough
20317 information about its original syntactic
20318 form. */
20322 }
20325 {
20329 "use %<%T::%D%> instead of %<%T::%D%> to "
20331 class_type,
20336 }
20338 }
20341 {
20348 for an unnamed type, even if the type
20349 got a name for linkage purposes. */
20351 /* Handle correctly (c++/19200):
20353 struct S {
20354 struct T{};
20355 friend void S(T);
20356 };
20358 and also:
20360 namespace N {
20361 void S();
20362 }
20364 struct S {
20365 friend void N::S();
20366 }; */
20369 class_type))
20378 }
20379 }
20381 unqualified_name,
20382 sfk);
20389 }
20391 handle_declarator:;
20394 {
20395 /* Any names that appear after the declarator-id for a
20396 member are looked up in the containing scope. */
20398 {
20399 /* But declarations with qualified-ids can't appear in a
20400 function. */
20404 }
20406 }
20410 /* Default args are only allowed on function
20411 declarations. */
20413 else
20417 }
20418 /* We're done. */
20419 else
20421 }
20423 /* For an abstract declarator, we might wind up with nothing at this
20424 point. That's an error; the declarator is not optional. */
20428 {
20429 /* Record overly parenthesized declarator so we can give a
20430 diagnostic about confusing decl/expr disambiguation. */
20432 {
20433 /* If the open and close parens are on different lines, this
20434 is probably a formatting thing, so ignore. */
20439 }
20442 }
20444 /* If we entered a scope, we must exit it now. */
20452 }
20454 /* Parse a ptr-operator.
20456 ptr-operator:
20457 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20458 * cv-qualifier-seq [opt]
20459 &
20460 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20461 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20463 GNU Extension:
20465 ptr-operator:
20466 & cv-qualifier-seq [opt]
20468 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20469 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20470 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20471 filled in with the TYPE containing the member. *CV_QUALS is
20472 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20473 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20474 Note that the tree codes returned by this function have nothing
20475 to do with the types of trees that will be eventually be created
20476 to represent the pointer or reference type being parsed. They are
20477 just constants with suggestive names. */
20478 static enum tree_code
20483 {
20488 /* Assume that it's not a pointer-to-member. */
20490 /* And that there are no cv-qualifiers. */
20493 /* Peek at the next token. */
20496 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20506 {
20507 /* Consume the `*', `&' or `&&'. */
20510 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20511 `&', if we are allowing GNU extensions. (The only qualifier
20512 that can legally appear after `&' is `restrict', but that is
20513 enforced during semantic analysis. */
20521 }
20522 else
20523 {
20524 /* Try the pointer-to-member case. */
20526 /* Look for the optional `::' operator. */
20529 /* Look for the nested-name specifier. */
20536 /* If we found it, and the next token is a `*', then we are
20537 indeed looking at a pointer-to-member operator. */
20540 {
20541 /* Indicate that the `*' operator was used. */
20549 else
20550 {
20551 /* The type of which the member is a member is given by the
20552 current SCOPE. */
20554 /* The next name will not be qualified. */
20558 /* Look for optional c++11 attributes. */
20562 /* Look for the optional cv-qualifier-seq. */
20564 }
20565 }
20566 /* If that didn't work we don't have a ptr-operator. */
20569 }
20572 }
20574 /* Parse an (optional) cv-qualifier-seq.
20576 cv-qualifier-seq:
20577 cv-qualifier cv-qualifier-seq [opt]
20579 cv-qualifier:
20580 const
20581 volatile
20583 GNU Extension:
20585 cv-qualifier:
20586 __restrict__
20588 Returns a bitmask representing the cv-qualifiers. */
20590 static cp_cv_quals
20592 {
20596 {
20598 cp_cv_quals cv_qualifier;
20600 /* Peek at the next token. */
20602 /* See if it's a cv-qualifier. */
20604 {
20620 }
20626 {
20631 }
20632 else
20633 {
20636 }
20637 }
20640 }
20642 /* Parse an (optional) ref-qualifier
20644 ref-qualifier:
20645 &
20646 &&
20648 Returns cp_ref_qualifier representing ref-qualifier. */
20650 static cp_ref_qualifier
20652 {
20655 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20660 {
20665 {
20677 }
20682 {
20685 }
20686 else
20687 {
20690 }
20691 }
20694 }
20696 /* Parse an optional tx-qualifier.
20698 tx-qualifier:
20699 transaction_safe
20700 transaction_safe_dynamic */
20702 static tree
20704 {
20707 {
20712 {
20716 {
20719 {
20722 }
20723 else
20725 }
20726 }
20727 }
20729 }
20731 /* Parse an (optional) virt-specifier-seq.
20733 virt-specifier-seq:
20734 virt-specifier virt-specifier-seq [opt]
20736 virt-specifier:
20737 override
20738 final
20740 Returns a bitmask representing the virt-specifiers. */
20742 static cp_virt_specifiers
20744 {
20748 {
20750 cp_virt_specifiers virt_specifier;
20752 /* Peek at the next token. */
20754 /* See if it's a virt-specifier-qualifier. */
20758 {
20761 }
20763 {
20766 }
20768 {
20770 }
20771 else
20775 {
20780 }
20781 else
20782 {
20785 }
20786 }
20788 }
20790 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20791 is in scope even though it isn't real. */
20793 void
20795 {
20796 tree this_parm;
20799 {
20800 /* We don't clear this between NSDMIs. Is it already what we want? */
20807 }
20810 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20812 current_class_ref
20815 }
20817 /* Return true iff our current scope is a non-static data member
20818 initializer. */
20820 bool
20822 {
20823 /* We recognize NSDMI context by the context-less 'this' pointer set up
20824 by the function above. */
20830 }
20832 /* Parse a late-specified return type, if any. This is not a separate
20833 non-terminal, but part of a function declarator, which looks like
20835 -> trailing-type-specifier-seq abstract-declarator(opt)
20837 Returns the type indicated by the type-id.
20839 In addition to this, parse any queued up #pragma omp declare simd
20840 clauses, and #pragma acc routine clauses.
20842 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20843 function. */
20845 static tree
20848 {
20852 && declarator
20856 && declarator
20859 /* Peek at the next token. */
20861 /* A late-specified return type is indicated by an initial '->'. */
20872 {
20873 /* DR 1207: 'this' is in scope in the trailing return type. */
20875 }
20878 {
20879 /* Consume the ->. */
20883 }
20885 /* Function declarations may be followed by a trailing
20886 requires-clause. */
20890 declarator->attributes
20894 declarator->attributes
20899 {
20902 }
20905 }
20907 /* Parse a declarator-id.
20909 declarator-id:
20910 id-expression
20911 :: [opt] nested-name-specifier [opt] type-name
20913 In the `id-expression' case, the value returned is as for
20914 cp_parser_id_expression if the id-expression was an unqualified-id.
20915 If the id-expression was a qualified-id, then a SCOPE_REF is
20916 returned. The first operand is the scope (either a NAMESPACE_DECL
20917 or TREE_TYPE), but the second is still just a representation of an
20918 unqualified-id. */
20920 static tree
20922 {
20923 tree id;
20924 /* The expression must be an id-expression. Assume that qualified
20925 names are the names of types so that:
20927 template <class T>
20928 int S<T>::R::i = 3;
20930 will work; we must treat `S<T>::R' as the name of a type.
20931 Similarly, assume that qualified names are templates, where
20932 required, so that:
20934 template <class T>
20935 int S<T>::R<T>::i = 3;
20937 will work, too. */
20943 optional_p);
20947 }
20949 /* Parse a type-id.
20951 type-id:
20952 type-specifier-seq abstract-declarator [opt]
20954 Returns the TYPE specified. */
20956 static tree
20959 {
20960 cp_decl_specifier_seq type_specifier_seq;
20963 /* Parse the type-specifier-seq. */
20965 is_trailing_return,
20970 /* A bare template name as a template argument is a template template
20971 argument, not a placeholder, so fail parsing it as a type argument. */
20972 {
20976 }
20980 /* There might or might not be an abstract declarator. */
20982 /* Look for the declarator. */
20983 abstract_declarator
20988 /* Check to see if there really was a declarator. */
20993 /* The concepts TS allows 'auto' as a type-id. */
20995 /* None of the valid uses of 'auto' in C++14 involve the type-id
20996 nonterminal, but it is valid in a trailing-return-type. */
20999 {
21000 /* A type-id with type 'auto' is only ok if the abstract declarator
21001 is a function declarator with a late-specified return type.
21003 A type-id with 'auto' is also valid in a trailing-return-type
21004 in a compound-requirement. */
21011 else
21012 {
21015 {
21017 auto_node);
21019 tmpl);
21020 }
21021 else
21024 }
21025 }
21028 is_template_arg);
21029 }
21031 static tree
21033 {
21035 }
21037 static tree
21039 {
21040 tree r;
21042 parser->type_definition_forbidden_message
21047 {
21050 }
21052 }
21054 static tree
21056 {
21058 }
21060 /* Parse a type-specifier-seq.
21062 type-specifier-seq:
21063 type-specifier type-specifier-seq [opt]
21065 GNU extension:
21067 type-specifier-seq:
21068 attributes type-specifier-seq [opt]
21070 If IS_DECLARATION is true, we are at the start of a "condition" or
21071 exception-declaration, so we might be followed by a declarator-id.
21073 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21074 i.e. we've just seen "->".
21076 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21078 static void
21083 {
21088 /* Clear the TYPE_SPECIFIER_SEQ. */
21091 /* In the context of a trailing return type, enum E { } is an
21092 elaborated-type-specifier followed by a function-body, not an
21093 enum-specifier. */
21097 /* Parse the type-specifiers and attributes. */
21099 {
21100 tree type_specifier;
21103 /* Check for attributes first. */
21105 {
21106 type_specifier_seq->attributes
21110 }
21112 /* record the token of the beginning of the type specifier seq,
21113 for error reporting purposes*/
21117 /* Look for the type-specifier. */
21119 flags,
21120 type_specifier_seq,
21122 NULL,
21125 {
21126 /* If the first type-specifier could not be found, this is not a
21127 type-specifier-seq at all. */
21129 {
21130 /* Set in_declarator_p to avoid skipping to the semicolon. */
21142 }
21143 /* If subsequent type-specifiers could not be found, the
21144 type-specifier-seq is complete. */
21146 }
21149 /* The standard says that a condition can be:
21151 type-specifier-seq declarator = assignment-expression
21153 However, given:
21155 struct S {};
21156 if (int S = ...)
21158 we should treat the "S" as a declarator, not as a
21159 type-specifier. The standard doesn't say that explicitly for
21160 type-specifier-seq, but it does say that for
21161 decl-specifier-seq in an ordinary declaration. Perhaps it
21162 would be clearer just to allow a decl-specifier-seq here, and
21163 then add a semantic restriction that if any decl-specifiers
21164 that are not type-specifiers appear, the program is invalid. */
21167 }
21168 }
21170 /* Return whether the function currently being declared has an associated
21171 template parameter list. */
21173 static bool
21175 {
21188 }
21190 /* Parse a parameter-declaration-clause.
21192 parameter-declaration-clause:
21193 parameter-declaration-list [opt] ... [opt]
21194 parameter-declaration-list , ...
21196 Returns a representation for the parameter declarations. A return
21197 value of NULL indicates a parameter-declaration-clause consisting
21198 only of an ellipsis. */
21200 static tree
21202 {
21203 tree parameters;
21212 && !processing_template_parmlist
21213 && !processing_explicit_instantiation
21214 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21215 actual function or a random abstract declarator. */
21221 /* Peek at the next token. */
21223 /* Check for trivial parameter-declaration-clauses. */
21225 {
21226 /* Consume the `...' token. */
21229 }
21231 /* There are no parameters. */
21232 {
21233 #ifndef NO_IMPLICIT_EXTERN_C
21238 else
21239 #endif
21241 }
21242 /* Check for `(void)', too, which is a special case. */
21246 {
21247 /* Consume the `void' token. */
21249 /* There are no parameters. */
21251 }
21253 /* Parse the parameter-declaration-list. */
21255 /* If a parse error occurred while parsing the
21256 parameter-declaration-list, then the entire
21257 parameter-declaration-clause is erroneous. */
21261 /* Peek at the next token. */
21263 /* If it's a `,', the clause should terminate with an ellipsis. */
21265 {
21266 /* Consume the `,'. */
21268 /* Expect an ellipsis. */
21269 ellipsis_p
21271 }
21272 /* It might also be `...' if the optional trailing `,' was
21273 omitted. */
21275 {
21276 /* Consume the `...' token. */
21278 /* And remember that we saw it. */
21280 }
21281 else
21284 /* Finish the parameter list. */
21289 }
21291 /* Parse a parameter-declaration-list.
21293 parameter-declaration-list:
21294 parameter-declaration
21295 parameter-declaration-list , parameter-declaration
21297 Returns a representation of the parameter-declaration-list, as for
21298 cp_parser_parameter_declaration_clause. However, the
21299 `void_list_node' is never appended to the list. Upon return,
21300 *IS_ERROR will be true iff an error occurred. */
21302 static tree
21304 {
21310 /* Assume all will go well. */
21312 /* The special considerations that apply to a function within an
21313 unbraced linkage specifications do not apply to the parameters
21314 to the function. */
21315 saved_in_unbraced_linkage_specification_p
21319 /* Look for more parameters. */
21321 {
21326 /* Parse the parameter. */
21327 parameter
21332 /* We don't know yet if the enclosing context is deprecated, so wait
21333 and warn in grokparms if appropriate. */
21337 {
21340 PARM,
21345 }
21349 /* If a parse error occurred parsing the parameter declaration,
21350 then the entire parameter-declaration-list is erroneous. */
21352 {
21356 }
21366 {
21370 }
21372 /* Add the new parameter to the list. */
21376 /* Peek at the next token. */
21379 /* These are for Objective-C++ */
21382 /* The parameter-declaration-list is complete. */
21385 {
21388 /* Peek at the next token. */
21390 /* If it's an ellipsis, then the list is complete. */
21393 /* Otherwise, there must be more parameters. Consume the
21394 `,'. */
21396 /* When parsing something like:
21398 int i(float f, double d)
21400 we can tell after seeing the declaration for "f" that we
21401 are not looking at an initialization of a variable "i",
21402 but rather at the declaration of a function "i".
21404 Due to the fact that the parsing of template arguments
21405 (as specified to a template-id) requires backtracking we
21406 cannot use this technique when inside a template argument
21407 list. */
21411 /* However, a parameter-declaration of the form
21412 "float(f)" (which is a valid declaration of a
21413 parameter "f") can also be interpreted as an
21414 expression (the conversion of "f" to "float"). */
21417 }
21418 else
21419 {
21427 }
21428 }
21430 parser->in_unbraced_linkage_specification_p
21433 /* Reset implicit_template_scope if we are about to leave the function
21434 parameter list that introduced it. Note that for out-of-line member
21435 definitions, there will be one or more class scopes before we get to
21436 the template parameter scope. */
21440 {
21444 {
21447 }
21448 }
21451 }
21453 /* Parse a parameter declaration.
21455 parameter-declaration:
21456 decl-specifier-seq ... [opt] declarator
21457 decl-specifier-seq declarator = assignment-expression
21458 decl-specifier-seq ... [opt] abstract-declarator [opt]
21459 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21461 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21462 declares a template parameter. (In that case, a non-nested `>'
21463 token encountered during the parsing of the assignment-expression
21464 is not interpreted as a greater-than operator.)
21466 Returns a representation of the parameter, or NULL if an error
21467 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21468 true iff the declarator is of the form "(p)". */
21474 {
21476 cp_decl_specifier_seq decl_specifiers;
21478 tree default_argument;
21483 /* In a template parameter, `>' is not an operator.
21485 [temp.param]
21487 When parsing a default template-argument for a non-type
21488 template-parameter, the first non-nested `>' is taken as the end
21489 of the template parameter-list rather than a greater-than
21490 operator. */
21492 /* Type definitions may not appear in parameter types. */
21494 parser->type_definition_forbidden_message
21501 /* Parse the declaration-specifiers. */
21504 CP_PARSER_FLAGS_NONE,
21508 /* Complain about missing 'typename' or other invalid type names. */
21513 /* If an error occurred, there's no reason to attempt to parse the
21514 rest of the declaration. */
21516 {
21519 }
21521 /* Peek at the next token. */
21524 /* If the next token is a `)', `,', `=', `>', or `...', then there
21525 is no declarator. However, when variadic templates are enabled,
21526 there may be a declarator following `...'. */
21531 {
21535 }
21536 /* Otherwise, there should be a declarator. */
21537 else
21538 {
21542 /* After seeing a decl-specifier-seq, if the next token is not a
21543 "(", there is no possibility that the code is a valid
21544 expression. Therefore, if parsing tentatively, we commit at
21545 this point. */
21547 /* In an expression context, having seen:
21549 (int((char ...
21551 we cannot be sure whether we are looking at a
21552 function-type (taking a "char" as a parameter) or a cast
21553 of some object of type "char" to "int". */
21559 /* Parse the declarator. */
21562 CP_PARSER_DECLARATOR_EITHER,
21564 parenthesized_p,
21568 /* After the declarator, allow more attributes. */
21569 decl_specifiers.attributes
21573 /* If the declarator is a template parameter pack, remember that and
21574 clear the flag in the declarator itself so we don't get errors
21575 from grokdeclarator. */
21577 {
21580 }
21581 }
21583 /* If the next token is an ellipsis, and we have not seen a declarator
21584 name, and if either the type of the declarator contains parameter
21585 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21586 for, eg, abbreviated integral type names), then we actually have a
21587 parameter pack expansion expression. Otherwise, leave the ellipsis
21588 for a C-style variadic function. */
21591 /* If a function parameter pack was specified and an implicit template
21592 parameter was introduced during cp_parser_parameter_declaration,
21593 change any implicit parameters introduced into packs. */
21597 {
21605 }
21608 {
21619 {
21620 /* Consume the `...'. */
21624 /* Build a pack expansion type */
21629 else
21631 }
21632 }
21634 /* The restriction on defining new types applies only to the type
21635 of the parameter, not to the default argument. */
21638 /* If the next token is `=', then process a default argument. */
21640 {
21643 /* If we are defining a class, then the tokens that make up the
21644 default argument must be saved and processed later. */
21650 // A constrained-type-specifier may declare a type template-parameter.
21652 default_argument
21655 // A constrained-type-specifier may declare a template-template-parameter.
21657 default_argument
21660 /* Outside of a class definition, we can just parse the
21661 assignment-expression. */
21662 else
21663 default_argument
21667 {
21669 "default arguments are only "
21671 }
21673 || template_parameter_pack_p
21676 {
21677 /* Find the name of the parameter pack. */
21684 template_parm_p
21690 else
21692 template_parm_p
21699 }
21700 }
21701 else
21704 /* Generate a location for the parameter, ranging from the start of the
21705 initial token to the end of the final token (using input_location for
21706 the latter, set up by cp_lexer_set_source_position_from_token when
21707 consuming tokens).
21709 If we have a identifier, then use it for the caret location, e.g.
21711 extern int callee (int one, int (*two)(int, int), float three);
21712 ~~~~~~^~~~~~~~~~~~~~
21714 otherwise, reuse the start location for the caret location e.g.:
21716 extern int callee (int one, int (*)(int, int), float three);
21717 ^~~~~~~~~~~~~~~~~
21719 */
21725 input_location);
21728 declarator,
21729 default_argument,
21730 param_loc,
21731 template_parameter_pack_p);
21732 }
21734 /* Parse a default argument and return it.
21736 TEMPLATE_PARM_P is true if this is a default argument for a
21737 non-type template parameter. */
21738 static tree
21740 {
21746 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21747 set correctly. */
21750 /* Local variable names (and the `this' keyword) may not
21751 appear in a default argument. */
21754 /* Parse the assignment-expression. */
21759 /* The "this" pointer is not valid in a default argument. */
21761 {
21766 }
21767 default_argument
21769 /* Restore the "this" pointer. */
21771 {
21774 }
21783 }
21785 /* Parse a function-body.
21787 function-body:
21788 compound_statement */
21790 static void
21792 {
21796 }
21798 /* Parse a ctor-initializer-opt followed by a function-body. Return
21799 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21800 is true we are parsing a function-try-block. */
21802 static void
21805 {
21812 /* Begin the function body. */
21814 /* Parse the optional ctor-initializer. */
21817 /* If we're parsing a constexpr constructor definition, we need
21818 to check that the constructor body is indeed empty. However,
21819 before we get to cp_parser_function_body lot of junk has been
21820 generated, so we can't just check that we have an empty block.
21821 Rather we take a snapshot of the outermost block, and check whether
21822 cp_parser_function_body changed its state. */
21824 {
21828 }
21829 /* Parse the function-body. */
21833 /* Finish the function body. */
21835 }
21837 /* Parse an initializer.
21839 initializer:
21840 = initializer-clause
21841 ( expression-list )
21843 Returns an expression representing the initializer. If no
21844 initializer is present, NULL_TREE is returned.
21846 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21847 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21848 set to TRUE if there is no initializer present. If there is an
21849 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21850 is set to true; otherwise it is set to false. */
21852 static tree
21855 {
21857 tree init;
21859 /* Peek at the next token. */
21862 /* Let our caller know whether or not this initializer was
21863 parenthesized. */
21865 /* Assume that the initializer is constant. */
21869 {
21870 /* Consume the `='. */
21872 /* Parse the initializer-clause. */
21874 }
21876 {
21881 non_constant_p);
21886 }
21888 {
21893 }
21894 else
21895 {
21896 /* Anything else is an error. */
21899 }
21905 }
21907 /* Parse an initializer-clause.
21909 initializer-clause:
21910 assignment-expression
21911 braced-init-list
21913 Returns an expression representing the initializer.
21915 If the `assignment-expression' production is used the value
21916 returned is simply a representation for the expression.
21918 Otherwise, calls cp_parser_braced_list. */
21920 static cp_expr
21922 {
21923 cp_expr initializer;
21925 /* Assume the expression is constant. */
21928 /* If it is not a `{', then we are looking at an
21929 assignment-expression. */
21931 {
21932 initializer
21935 non_constant_p);
21936 }
21937 else
21941 }
21943 /* Parse a brace-enclosed initializer list.
21945 braced-init-list:
21946 { initializer-list , [opt] }
21947 { designated-initializer-list , [opt] }
21948 { }
21950 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21951 the elements of the initializer-list (or NULL, if the last
21952 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21953 NULL_TREE. There is no way to detect whether or not the optional
21954 trailing `,' was provided. NON_CONSTANT_P is as for
21955 cp_parser_initializer. */
21957 static cp_expr
21959 {
21960 tree initializer;
21963 /* Consume the `{' token. */
21964 matching_braces braces;
21966 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21968 /* If it's not a `}', then there is a non-trivial initializer. */
21970 {
21971 /* Parse the initializer list. */
21974 /* A trailing `,' token is allowed. */
21977 }
21978 else
21980 /* Now, there should be a trailing `}'. */
21986 /* Build a location of the form:
21987 { ... }
21988 ^~~~~~~
21989 with caret==start at the open brace, finish at the close brace. */
21993 }
21995 /* Consume tokens up to, and including, the next non-nested closing `]'.
21996 Returns true iff we found a closing `]'. */
21998 static bool
22000 {
22004 {
22008 {
22011 /* If we've run out of tokens, then there is no closing `]'. */
22020 {
22023 }
22028 }
22030 /* Consume the token. */
22032 }
22033 }
22035 /* Return true if we are looking at an array-designator, false otherwise. */
22037 static bool
22039 {
22040 /* Consume the `['. */
22045 /* Skip tokens until the next token is a closing square bracket.
22046 If we find the closing `]', and the next token is a `=', then
22047 we are looking at an array designator. */
22048 bool array_designator_p
22052 /* Roll back the tokens we skipped. */
22056 }
22058 /* Parse an initializer-list.
22060 initializer-list:
22061 initializer-clause ... [opt]
22062 initializer-list , initializer-clause ... [opt]
22064 C++2A Extension:
22066 designated-initializer-list:
22067 designated-initializer-clause
22068 designated-initializer-list , designated-initializer-clause
22070 designated-initializer-clause:
22071 designator brace-or-equal-initializer
22073 designator:
22074 . identifier
22076 GNU Extension:
22078 initializer-list:
22079 designation initializer-clause ...[opt]
22080 initializer-list , designation initializer-clause ...[opt]
22082 designation:
22083 . identifier =
22084 identifier :
22085 [ constant-expression ] =
22087 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22088 for the initializer. If the INDEX of the elt is non-NULL, it is the
22089 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22090 as for cp_parser_initializer. */
22094 {
22099 /* Assume all of the expressions are constant. */
22102 /* Parse the rest of the list. */
22104 {
22106 tree designator;
22107 tree initializer;
22111 /* Handle the C++2A syntax, '. id ='. */
22119 {
22122 "C++ designated initializers only available with "
22124 /* Consume the `.'. */
22126 /* Consume the identifier. */
22129 /* Consume the `='. */
22131 }
22132 /* Also, if the next token is an identifier and the following one is a
22133 colon, we are looking at the GNU designated-initializer
22134 syntax. */
22139 {
22140 /* Warn the user that they are using an extension. */
22143 /* Consume the identifier. */
22145 /* Consume the `:'. */
22147 }
22148 /* Also handle C99 array designators, '[ const ] ='. */
22152 {
22153 /* In C++11, [ could start a lambda-introducer. */
22159 {
22162 }
22163 else
22164 {
22169 }
22174 && (!require_potential_rvalue_constant_expression
22178 /* Warn the user that they are using an extension. */
22181 }
22182 else
22186 {
22189 }
22193 {
22197 }
22201 /* Parse the initializer. */
22204 /* If any clause is non-constant, so is the entire initializer. */
22208 /* If we have an ellipsis, this is an initializer pack
22209 expansion. */
22211 {
22214 /* Consume the `...'. */
22221 /* Turn the initializer into an initializer expansion. */
22223 }
22225 /* Add it to the vector. */
22228 /* If the next token is not a comma, we have reached the end of
22229 the list. */
22233 /* Peek at the next token. */
22235 /* If the next token is a `}', then we're still done. An
22236 initializer-clause can have a trailing `,' after the
22237 initializer-list and before the closing `}'. */
22241 /* Consume the `,' token. */
22243 }
22245 /* The same identifier shall not appear in multiple designators
22246 of a designated-initializer-list. */
22248 {
22253 {
22255 {
22257 "%<.%s%> designator used multiple times in "
22261 }
22262 else
22264 }
22268 }
22271 }
22273 /* Classes [gram.class] */
22275 /* Parse a class-name.
22277 class-name:
22278 identifier
22279 template-id
22281 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22282 to indicate that names looked up in dependent types should be
22283 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22284 keyword has been used to indicate that the name that appears next
22285 is a template. TAG_TYPE indicates the explicit tag given before
22286 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22287 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22288 is the class being defined in a class-head. If ENUM_OK is TRUE,
22289 enum-names are also accepted.
22291 Returns the TYPE_DECL representing the class. */
22293 static tree
22302 {
22303 tree decl;
22304 tree scope;
22309 /* All class-names start with an identifier. */
22312 {
22315 }
22317 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22318 to a template-id, so we save it here. */
22323 /* Any name names a type if we're following the `typename' keyword
22324 in a qualified name where the enclosing scope is type-dependent. */
22327 /* Handle the common case (an identifier, but not a template-id)
22328 efficiently. */
22331 {
22335 /* Look for the identifier. */
22339 /* If the next token isn't an identifier, we are certainly not
22340 looking at a class-name. */
22343 /* If we know this is a type-name, there's no need to look it
22344 up. */
22347 else
22348 {
22349 tree ambiguous_decls;
22350 /* If we already know that this lookup is ambiguous, then
22351 we've already issued an error message; there's no reason
22352 to check again. */
22354 {
22357 }
22358 /* If the next token is a `::', then the name must be a type
22359 name.
22361 [basic.lookup.qual]
22363 During the lookup for a name preceding the :: scope
22364 resolution operator, object, function, and enumerator
22365 names are ignored. */
22368 /* Look up the name. */
22370 tag_type,
22373 check_dependency_p,
22377 {
22381 }
22382 }
22383 }
22384 else
22385 {
22386 /* Try a template-id. */
22388 check_dependency_p,
22389 tag_type,
22390 is_declaration);
22393 }
22397 /* If this is a typename, create a TYPENAME_TYPE. */
22399 {
22404 }
22408 /* Check to see that it is really the name of a class. */
22412 /* Situations like this:
22414 template <typename T> struct A {
22415 typename T::template X<int>::I i;
22416 };
22418 are problematic. Is `T::template X<int>' a class-name? The
22419 standard does not seem to be definitive, but there is no other
22420 valid interpretation of the following `::'. Therefore, those
22421 names are considered class-names. */
22422 {
22426 }
22431 /* In Objective-C 2.0, a classname followed by '.' starts a
22432 dot-syntax expression, and it's not a type-name. */
22444 }
22446 /* Parse a class-specifier.
22448 class-specifier:
22449 class-head { member-specification [opt] }
22451 Returns the TREE_TYPE representing the class. */
22453 static tree
22455 {
22456 tree type;
22470 /* Parse the class-head. */
22473 /* If the class-head was a semantic disaster, skip the entire body
22474 of the class. */
22476 {
22480 }
22482 /* Look for the `{'. */
22483 matching_braces braces;
22485 {
22488 }
22493 /* Issue an error message if type-definitions are forbidden here. */
22495 /* Remember that we are defining one more class. */
22497 /* Inside the class, surrounding template-parameter-lists do not
22498 apply. */
22499 saved_num_template_parameter_lists
22502 /* We are not in a function body. */
22505 /* Or in a loop. */
22508 /* Or in a switch. */
22511 /* We are not immediately inside an extern "lang" block. */
22512 saved_in_unbraced_linkage_specification_p
22516 // Associate constraints with the type.
22520 /* Start the class. */
22522 {
22525 }
22529 /* If the type is erroneous, skip the entire body of the class. */
22531 else
22532 /* Parse the member-specification. */
22535 /* Look for the trailing `}'. */
22537 /* Look for trailing attributes to apply to this class. */
22545 /* We've finished a type definition. Check for the common syntax
22546 error of forgetting a semicolon after the definition. We need to
22547 be careful, as we can't just check for not-a-semicolon and be done
22548 with it; the user might have typed:
22550 class X { } c = ...;
22551 class X { } *p = ...;
22553 and so forth. Instead, enumerate all the possible tokens that
22554 might follow this production; if we don't see one of them, then
22555 complain and silently insert the semicolon. */
22556 {
22561 /* Don't try to parse c++11 attributes here. As per the
22562 grammar, that should be a task for
22563 cp_parser_decl_specifier_seq. */
22567 {
22578 /* While it's legal for type qualifiers and storage class
22579 specifiers to follow type definitions in the grammar, only
22580 compiler testsuites contain code like that. Assume that if
22581 we see such code, then what we're really seeing is a case
22582 like:
22584 class X { }
22585 const <type> var = ...;
22587 or
22589 class Y { }
22590 static <type> func (...) ...
22592 i.e. the qualifier or specifier applies to the next
22593 declaration. To do so, however, we need to look ahead one
22594 more token to see if *that* token is a type specifier.
22596 This code could be improved to handle:
22598 class Z { }
22599 static const <type> var = ...; */
22602 {
22605 /* Handling user-defined types here would be nice, but very
22606 tricky. */
22607 want_semicolon
22610 }
22614 }
22616 /* If we don't have a type, then something is very wrong and we
22617 shouldn't try to do anything clever. Likewise for not seeing the
22618 closing brace. */
22620 {
22621 /* Locate the closing brace. */
22622 cp_token_position prev
22627 /* We want to suggest insertion of a ';' immediately *after* the
22628 closing brace, so, if we can, offset the location by 1 column. */
22635 /* If we successfully offset the location, suggest the fix-it. */
22648 else
22651 /* Unget one token and smash it to look as though we encountered
22652 a semicolon in the input stream. */
22657 }
22658 }
22660 /* If this class is not itself within the scope of another class,
22661 then we need to parse the bodies of all of the queued function
22662 definitions. Note that the queued functions defined in a class
22663 are not always processed immediately following the
22664 class-specifier for that class. Consider:
22666 struct A {
22667 struct B { void f() { sizeof (A); } };
22668 };
22670 If `f' were processed before the processing of `A' were
22671 completed, there would be no way to compute the size of `A'.
22672 Note that the nesting we are interested in here is lexical --
22673 not the semantic nesting given by TYPE_CONTEXT. In particular,
22674 for:
22676 struct A { struct B; };
22677 struct A::B { void f() { } };
22679 there is no need to delay the parsing of `A::B::f'. */
22681 {
22682 tree decl;
22690 {
22691 /* Skip default arguments, NSDMIs, etc, in order to improve
22692 error recovery (c++/71169, c++/71832). */
22697 }
22699 /* In a first pass, parse default arguments to the functions.
22700 Then, in a second pass, parse the bodies of the functions.
22701 This two-phased approach handles cases like:
22703 struct S {
22704 void f() { g(); }
22705 void g(int i = 3);
22706 };
22708 */
22710 {
22712 /* If there are default arguments that have not yet been processed,
22713 take care of them now. */
22715 {
22720 }
22721 /* Make sure that any template parameters are in scope. */
22723 /* Parse the default argument expressions. */
22725 /* Remove any template parameters from the symbol table. */
22727 }
22729 /* Now parse any NSDMIs. */
22733 {
22735 {
22740 }
22743 }
22750 /* Now do some post-NSDMI bookkeeping. */
22756 /* Now parse the body of the functions. */
22758 {
22759 /* OpenMP UDRs need to be parsed before all other functions. */
22766 }
22767 else
22771 }
22772 else
22775 /* Put back any saved access checks. */
22778 /* Restore saved state. */
22782 parser->num_template_parameter_lists
22784 parser->in_unbraced_linkage_specification_p
22788 }
22790 static tree
22792 {
22793 tree ret;
22798 }
22800 /* Parse a class-head.
22802 class-head:
22803 class-key identifier [opt] base-clause [opt]
22804 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22805 class-key nested-name-specifier [opt] template-id
22806 base-clause [opt]
22808 class-virt-specifier:
22809 final
22811 GNU Extensions:
22812 class-key attributes identifier [opt] base-clause [opt]
22813 class-key attributes nested-name-specifier identifier base-clause [opt]
22814 class-key attributes nested-name-specifier [opt] template-id
22815 base-clause [opt]
22817 Upon return BASES is initialized to the list of base classes (or
22818 NULL, if there are none) in the same form returned by
22819 cp_parser_base_clause.
22821 Returns the TYPE of the indicated class. Sets
22822 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22823 involving a nested-name-specifier was used, and FALSE otherwise.
22825 Returns error_mark_node if this is not a class-head.
22827 Returns NULL_TREE if the class-head is syntactically valid, but
22828 semantically invalid in a way that means we should skip the entire
22829 body of the class. */
22831 static tree
22834 {
22835 tree nested_name_specifier;
22839 tree attributes;
22840 tree bases;
22850 /* Assume no nested-name-specifier will be present. */
22852 /* Assume no template parameter lists will be used in defining the
22853 type. */
22857 /* Look for the class-key. */
22864 /* Parse the attributes. */
22867 /* If the next token is `::', that is invalid -- but sometimes
22868 people do try to write:
22870 struct ::S {};
22872 Handle this gracefully by accepting the extra qualifier, and then
22873 issuing an error about it later if this really is a
22874 class-head. If it turns out just to be an elaborated type
22875 specifier, remain silent. */
22881 /* Determine the name of the class. Begin by looking for an
22882 optional nested-name-specifier. */
22884 nested_name_specifier
22890 /* If there was a nested-name-specifier, then there *must* be an
22891 identifier. */
22896 {
22898 /* Although the grammar says `identifier', it really means
22899 `class-name' or `template-name'. You are only allowed to
22900 define a class that has already been declared with this
22901 syntax.
22903 The proposed resolution for Core Issue 180 says that wherever
22904 you see `class T::X' you should treat `X' as a type-name.
22906 It is OK to define an inaccessible class; for example:
22908 class A { class B; };
22909 class A::B {};
22911 We do not know if we will see a class-name, or a
22912 template-name. We look for a class-name first, in case the
22913 class-name is a template-id; if we looked for the
22914 template-name first we would stop after the template-name. */
22921 class_type,
22925 /* If that didn't work, ignore the nested-name-specifier. */
22927 {
22933 }
22934 /* If we could not find a corresponding TYPE, treat this
22935 declaration like an unqualified declaration. */
22938 /* Otherwise, count the number of templates used in TYPE and its
22939 containing scopes. */
22940 else
22941 {
22942 tree scope;
22954 }
22955 }
22956 /* Otherwise, the identifier is optional. */
22957 else
22958 {
22959 /* We don't know whether what comes next is a template-id,
22960 an identifier, or nothing at all. */
22962 /* Check for a template-id. */
22967 class_key,
22969 /* If that didn't work, it could still be an identifier. */
22971 {
22973 {
22976 }
22977 else
22979 }
22980 else
22981 {
22984 }
22985 }
22990 {
22992 class_key,
22994 }
22997 /* If it's not a `:' or a `{' then we can't really be looking at a
22998 class-head, since a class-head only appears as part of a
22999 class-specifier. We have to detect this situation before calling
23000 xref_tag, since that has irreversible side-effects. */
23002 {
23006 }
23008 /* At this point, we're going ahead with the class-specifier, even
23009 if some other problem occurs. */
23012 {
23017 }
23018 /* Issue the error about the overly-qualified name now. */
23020 {
23025 }
23027 {
23032 }
23034 {
23035 tree scope;
23038 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23039 keyword template shall not appear at the top level. */
23043 /* Reject typedef-names in class heads. */
23045 {
23048 type);
23051 }
23053 /* Figure out in what scope the declaration is being placed. */
23055 /* If that scope does not contain the scope in which the
23056 class was originally declared, the program is invalid. */
23058 {
23061 "declaration of %qD in namespace %qD which does not "
23064 else
23070 }
23071 /* [dcl.meaning]
23073 A declarator-id shall not be qualified except for the
23074 definition of a ... nested class outside of its class
23075 ... [or] the definition or explicit instantiation of a
23076 class member of a namespace outside of its namespace. */
23078 {
23083 }
23084 }
23085 /* An explicit-specialization must be preceded by "template <>". If
23086 it is not, try to recover gracefully. */
23089 && !processing_template_parmlist
23091 {
23092 /* Build a location of this form:
23093 struct typename <ARGS>
23094 ^~~~~~~~~~~~~~~~~~~~~~
23095 with caret==start at the start token, and
23096 finishing at the end of the type. */
23097 location_t reported_loc
23099 class_head_start_location,
23105 "an explicit specialization must be preceded by"
23108 /* Take the same action that would have been taken by
23109 cp_parser_explicit_specialization. */
23112 }
23113 /* There must be no "return" statements between this point and the
23114 end of this function; set "type "to the correct return value and
23115 use "goto done;" to return. */
23116 /* Make sure that the right number of template parameters were
23117 present. */
23119 template_id_p,
23122 {
23123 /* If something went wrong, there is no point in even trying to
23124 process the class-definition. */
23127 }
23129 /* Look up the type. */
23131 {
23135 {
23139 }
23140 else
23141 {
23145 /* Check the scope while we still know whether or not we had a
23146 nested-name-specifier. */
23149 }
23152 }
23154 {
23155 tree class_type;
23157 /* Given:
23159 template <typename T> struct S { struct T };
23160 template <typename T> struct S<T>::T { };
23162 we will get a TYPENAME_TYPE when processing the definition of
23163 `S::T'. We need to resolve it to the actual type before we
23164 try to define it. */
23166 {
23171 else
23172 {
23175 }
23176 }
23180 {
23183 }
23186 /* Enter the scope indicated by the nested-name-specifier. */
23188 /* Get the canonical version of this type. */
23190 /* Call push_template_decl if it seems like we should be defining a
23191 template either from the template headers or the type we're
23192 defining, so that we diagnose both extra and missing headers. */
23196 {
23199 {
23202 }
23203 }
23207 }
23209 {
23210 /* If the class was unnamed, create a dummy name. */
23214 ? ts_within_enclosing_non_class
23218 }
23220 /* Indicate whether this class was declared as a `class' or as a
23221 `struct'. */
23226 /* If this type was already complete, and we see another definition,
23227 that's an error. */
23229 {
23231 type);
23233 type);
23236 }
23241 {
23242 /* Apply attributes now, before any use of the class as a template
23243 argument in its base list. */
23246 }
23248 /* We will have entered the scope containing the class; the names of
23249 base classes should be looked up in that context. For example:
23251 struct A { struct B {}; struct C; };
23252 struct A::C : B {};
23254 is valid. */
23256 /* Get the list of base-classes, if there is one. */
23258 {
23259 /* PR59482: enter the class scope so that base-specifiers are looked
23260 up correctly. */
23264 /* PR59482: get out of the previously pushed class scope so that the
23265 subsequent pops pop the right thing. */
23268 }
23269 else
23272 /* If we're really defining a class, process the base classes.
23273 If they're invalid, fail. */
23277 done:
23278 /* Leave the scope given by the nested-name-specifier. We will
23279 enter the class scope itself while processing the members. */
23284 {
23287 }
23293 out:
23296 }
23298 /* Parse a class-key.
23300 class-key:
23301 class
23302 struct
23303 union
23305 Returns the kind of class-key specified, or none_type to indicate
23306 error. */
23308 static enum tag_types
23310 {
23314 /* Look for the class-key. */
23319 /* Check to see if the TOKEN is a class-key. */
23324 }
23326 /* Parse a type-parameter-key.
23328 type-parameter-key:
23329 class
23330 typename
23331 */
23333 static void
23335 {
23336 /* Look for the type-parameter-key. */
23340 {
23343 /* typename is not allowed in a template template parameter
23344 by the standard until C++17. */
23346 "ISO C++ forbids typename key in template template parameter;"
23348 }
23349 else
23353 }
23355 /* Parse an (optional) member-specification.
23357 member-specification:
23358 member-declaration member-specification [opt]
23359 access-specifier : member-specification [opt] */
23361 static void
23363 {
23365 {
23369 /* Peek at the next token. */
23371 /* If it's a `}', or EOF then we've seen all the members. */
23377 /* See if this token is a keyword. */
23380 {
23384 /* Consume the access-specifier. */
23386 /* Remember which access-specifier is active. */
23388 /* Look for the `:'. */
23393 /* Accept #pragmas at class scope. */
23395 {
23398 }
23400 /* Otherwise, the next construction must be a
23401 member-declaration. */
23403 }
23404 }
23405 }
23407 /* Parse a member-declaration.
23409 member-declaration:
23410 decl-specifier-seq [opt] member-declarator-list [opt] ;
23411 function-definition ; [opt]
23412 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23413 using-declaration
23414 template-declaration
23415 alias-declaration
23417 member-declarator-list:
23418 member-declarator
23419 member-declarator-list , member-declarator
23421 member-declarator:
23422 declarator pure-specifier [opt]
23423 declarator constant-initializer [opt]
23424 identifier [opt] : constant-expression
23426 GNU Extensions:
23428 member-declaration:
23429 __extension__ member-declaration
23431 member-declarator:
23432 declarator attributes [opt] pure-specifier [opt]
23433 declarator attributes [opt] constant-initializer [opt]
23434 identifier [opt] attributes [opt] : constant-expression
23436 C++0x Extensions:
23438 member-declaration:
23439 static_assert-declaration */
23441 static void
23443 {
23444 cp_decl_specifier_seq decl_specifiers;
23445 tree prefix_attributes;
23446 tree decl;
23455 /* Check for the `__extension__' keyword. */
23457 {
23458 /* Recurse. */
23460 /* Restore the old value of the PEDANTIC flag. */
23464 }
23466 /* Check for a template-declaration. */
23468 {
23469 /* An explicit specialization here is an error condition, and we
23470 expect the specialization handler to detect and report this. */
23474 else
23478 }
23479 /* Check for a template introduction. */
23483 /* Check for a using-declaration. */
23485 {
23487 {
23488 /* Parse the using-declaration. */
23492 }
23493 else
23494 {
23495 tree decl;
23499 /* Note that if we actually see the '=' token after the
23500 identifier, cp_parser_alias_declaration commits the
23501 tentative parse. In that case, we really expect an
23502 alias-declaration. Otherwise, we expect a using
23503 declaration. */
23504 alias_decl_expected =
23510 else
23514 }
23515 }
23517 /* Check for @defs. */
23519 {
23524 {
23529 }
23531 }
23533 /* If the next token is `static_assert' we have a static assertion. */
23535 {
23538 }
23545 /* Parse the decl-specifier-seq. */
23548 CP_PARSER_FLAGS_OPTIONAL,
23551 /* Check for an invalid type-name. */
23555 /* If there is no declarator, then the decl-specifier-seq should
23556 specify a type. */
23558 {
23559 /* If there was no decl-specifier-seq, and the next token is a
23560 `;', then we have something like:
23562 struct S { ; };
23564 [class.mem]
23566 Each member-declaration shall declare at least one member
23567 name of the class. */
23569 {
23572 {
23576 }
23577 }
23578 else
23579 {
23580 tree type;
23582 /* See if this declaration is a friend. */
23584 /* If there were decl-specifiers, check to see if there was
23585 a class-declaration. */
23588 /* Nested classes have already been added to the class, but
23589 a `friend' needs to be explicitly registered. */
23591 {
23592 /* If the `friend' keyword was present, the friend must
23593 be introduced with a class-key. */
23596 "in C++03 a class-key must be used "
23598 /* In this case:
23600 template <typename T> struct A {
23601 friend struct A<T>::B;
23602 };
23604 A<T>::B will be represented by a TYPENAME_TYPE, and
23605 therefore not recognized by check_tag_decl. */
23607 {
23611 }
23614 "friend declaration does not name a class or "
23616 else
23619 }
23620 /* If there is no TYPE, an error message will already have
23621 been issued. */
23623 ;
23624 /* An anonymous aggregate has to be handled specially; such
23625 a declaration really declares a data member (with a
23626 particular type), as opposed to a nested class. */
23628 {
23629 /* C++11 9.5/6. */
23632 "a storage class on an anonymous aggregate "
23635 /* Remove constructors and such from TYPE, now that we
23636 know it is an anonymous aggregate. */
23638 /* And make the corresponding data member. */
23641 /* Add it to the class. */
23643 }
23644 else
23645 cp_parser_check_access_in_redeclaration
23648 }
23649 }
23650 else
23651 {
23654 /* Clear attributes from the decl_specifiers but keep them
23655 around as prefix attributes that apply them to the entity
23656 being declared. */
23660 /* See if these declarations will be friends. */
23663 /* Keep going until we hit the `;' at the end of the
23664 declaration. */
23666 {
23668 tree first_attribute;
23669 tree initializer;
23672 /* Peek at the next token. */
23675 /* The following code wants to know early if it is a bit-field
23676 or some other declaration. Attributes can appear before
23677 the `:' token. Skip over them without consuming any tokens
23678 to peek if they are followed by `:'. */
23683 {
23684 size_t n
23687 }
23689 /* Check for a bitfield declaration. */
23695 {
23696 tree identifier;
23697 tree width;
23702 else
23705 /* Look for attributes that apply to the bitfield. */
23708 /* Consume the `:' token. */
23711 /* Get the width of the bitfield. */
23715 /* In C++2A and as extension for C++11 and above we allow
23716 default member initializers for bit-fields. */
23721 CPP_OPEN_BRACE)))
23722 {
23723 location_t loc
23729 "default member initializers for bit-fields "
23730 "only available with -std=c++2a or "
23735 {
23739 }
23740 }
23741 else
23742 {
23743 /* Look for attributes that apply to the bitfield after
23744 the `:' token and width. This is where GCC used to
23745 parse attributes in the past, pedwarn if there is
23746 a std attribute. */
23749 "ISO C++ allows bit-field attributes only "
23753 }
23757 /* Remember which attributes are prefix attributes and
23758 which are not. */
23760 /* Combine the attributes. */
23763 /* Create the bitfield declaration. */
23766 identifier,
23767 sfk_none)
23771 attributes);
23772 }
23773 else
23774 {
23776 tree asm_specification;
23779 /* Parse the declarator. */
23780 declarator
23785 friend_p);
23787 /* If something went wrong parsing the declarator, make sure
23788 that we at least consume some tokens. */
23790 {
23791 /* Skip to the end of the statement. */
23793 /* If the next token is not a semicolon, that is
23794 probably because we just skipped over the body of
23795 a function. So, we consume a semicolon if
23796 present, but do not issue an error message if it
23797 is not present. */
23799 CPP_SEMICOLON))
23802 }
23805 cp_parser_check_for_definition_in_return_type
23809 /* Look for an asm-specification. */
23811 /* Look for attributes that apply to the declaration. */
23813 /* Remember which attributes are prefix attributes and
23814 which are not. */
23816 /* Combine the attributes. */
23819 /* If it's an `=', then we have a constant-initializer or a
23820 pure-specifier. It is not correct to parse the
23821 initializer before registering the member declaration
23822 since the member declaration should be in scope while
23823 its initializer is processed. However, the rest of the
23824 front end does not yet provide an interface that allows
23825 us to handle this correctly. */
23827 {
23828 /* In [class.mem]:
23830 A pure-specifier shall be used only in the declaration of
23831 a virtual function.
23833 A member-declarator can contain a constant-initializer
23834 only if it declares a static member of integral or
23835 enumeration type.
23837 Therefore, if the DECLARATOR is for a function, we look
23838 for a pure-specifier; otherwise, we look for a
23839 constant-initializer. When we call `grokfield', it will
23840 perform more stringent semantics checks. */
23852 {
23854 /* Don't require a constant rvalue in C++11, since we
23855 might want a reference constant. We'll enforce
23856 constancy later. */
23858 /* Parse the initializer. */
23861 }
23862 else
23863 /* Parse the initializer. */
23865 }
23868 {
23872 else
23874 }
23875 /* Otherwise, there is no initializer. */
23876 else
23879 /* See if we are probably looking at a function
23880 definition. We are certainly not looking at a
23881 member-declarator. Calling `grokfield' has
23882 side-effects, so we must not do it unless we are sure
23883 that we are looking at a member-declarator. */
23886 {
23887 /* The grammar does not allow a pure-specifier to be
23888 used when a member function is defined. (It is
23889 possible that this fact is an oversight in the
23890 standard, since a pure function may be defined
23891 outside of the class-specifier. */
23897 declarator,
23898 attributes);
23901 /* If the member was not a friend, declare it here. */
23904 /* Peek at the next token. */
23906 /* If the next token is a semicolon, consume it. */
23908 {
23909 location_t semicolon_loc
23914 "extra %<;%> after in-class "
23916 }
23918 }
23919 else
23922 /* Create the declaration. */
23927 {
23930 else
23932 }
23933 }
23938 /* Reset PREFIX_ATTRIBUTES. */
23940 {
23945 }
23947 /* If there is any qualification still in effect, clear it
23948 now; we will be starting fresh with the next declarator. */
23952 /* If it's a `,', then there are more declarators. */
23954 {
23957 {
23963 }
23964 }
23965 /* If the next token isn't a `;', then we have a parse error. */
23967 CPP_SEMICOLON))
23968 {
23969 /* The next token might be a ways away from where the
23970 actual semicolon is missing. Find the previous token
23971 and use that for our error position. */
23978 /* Assume that the user meant to provide a semicolon. If
23979 we were to cp_parser_skip_to_end_of_statement, we might
23980 skip to a semicolon inside a member function definition
23981 and issue nonsensical error messages. */
23983 }
23986 {
23987 /* Add DECL to the list of members. */
23989 /* Explicitly include, eg, NSDMIs, for better error
23990 recovery (c++/58650). */
23998 /* Add DECL to the queue of NSDMI to be parsed later. */
24000 }
24004 }
24005 }
24008 out:
24010 }
24012 /* Parse a pure-specifier.
24014 pure-specifier:
24015 = 0
24017 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24018 Otherwise, ERROR_MARK_NODE is returned. */
24020 static tree
24022 {
24025 /* Look for the `=' token. */
24028 /* Look for the `0' token. */
24037 /* Accept = default or = delete in c++0x mode. */
24040 {
24043 }
24045 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24047 {
24052 }
24054 {
24057 }
24060 }
24062 /* Parse a constant-initializer.
24064 constant-initializer:
24065 = constant-expression
24067 Returns a representation of the constant-expression. */
24069 static tree
24071 {
24072 /* Look for the `=' token. */
24076 /* It is invalid to write:
24078 struct S { static const int i = { 7 }; };
24080 */
24082 {
24085 /* Consume the opening brace. */
24086 matching_braces braces;
24088 /* Skip the initializer. */
24090 /* Look for the trailing `}'. */
24094 }
24097 }
24099 /* Derived classes [gram.class.derived] */
24101 /* Parse a base-clause.
24103 base-clause:
24104 : base-specifier-list
24106 base-specifier-list:
24107 base-specifier ... [opt]
24108 base-specifier-list , base-specifier ... [opt]
24110 Returns a TREE_LIST representing the base-classes, in the order in
24111 which they were declared. The representation of each node is as
24112 described by cp_parser_base_specifier.
24114 In the case that no bases are specified, this function will return
24115 NULL_TREE, not ERROR_MARK_NODE. */
24117 static tree
24119 {
24122 /* Look for the `:' that begins the list. */
24125 /* Scan the base-specifier-list. */
24127 {
24129 tree base;
24132 /* Look for the base-specifier. */
24134 /* Look for the (optional) ellipsis. */
24136 {
24137 /* Consume the `...'. */
24141 }
24143 /* Add BASE to the front of the list. */
24145 {
24147 /* Make this a pack expansion type. */
24151 {
24154 }
24155 }
24156 /* Peek at the next token. */
24158 /* If it's not a comma, then the list is complete. */
24161 /* Consume the `,'. */
24163 }
24165 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24166 base class had a qualified name. However, the next name that
24167 appears is certainly not qualified. */
24173 }
24175 /* Parse a base-specifier.
24177 base-specifier:
24178 :: [opt] nested-name-specifier [opt] class-name
24179 virtual access-specifier [opt] :: [opt] nested-name-specifier
24180 [opt] class-name
24181 access-specifier virtual [opt] :: [opt] nested-name-specifier
24182 [opt] class-name
24184 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24185 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24186 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24187 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24189 static tree
24191 {
24199 tree type;
24201 /* Process the optional `virtual' and `access-specifier'. */
24203 {
24204 /* Peek at the next token. */
24206 /* Process `virtual'. */
24208 {
24210 /* If `virtual' appears more than once, issue an error. */
24212 {
24216 }
24220 /* Consume the `virtual' token. */
24228 /* If more than one access specifier appears, issue an
24229 error. */
24232 {
24236 }
24240 /* Consume the access-specifier. */
24248 }
24249 }
24250 /* It is not uncommon to see programs mechanically, erroneously, use
24251 the 'typename' keyword to denote (dependent) qualified types
24252 as base classes. */
24254 {
24259 else
24261 "keyword %<typename%> not allowed in this context "
24264 }
24266 /* Look for the optional `::' operator. */
24268 /* Look for the nested-name-specifier. The simplest way to
24269 implement:
24271 [temp.res]
24273 The keyword `typename' is not permitted in a base-specifier or
24274 mem-initializer; in these contexts a qualified name that
24275 depends on a template-parameter is implicitly assumed to be a
24276 type name.
24278 is to pretend that we have seen the `typename' keyword at this
24279 point. */
24285 /* If the base class is given by a qualified name, assume that names
24286 we see are type names or templates, as appropriate. */
24292 /* DR 950 allows decltype as a base-specifier. */
24294 else
24295 {
24296 /* Otherwise, look for the class-name. */
24298 class_scope_p,
24299 template_p,
24300 typename_type,
24305 }
24311 }
24313 /* Exception handling [gram.exception] */
24315 /* Parse an (optional) noexcept-specification.
24317 noexcept-specification:
24318 noexcept ( constant-expression ) [opt]
24320 If no noexcept-specification is present, returns NULL_TREE.
24321 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24322 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24323 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24324 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24325 in which case a boolean condition is returned instead. */
24327 static tree
24332 {
24336 /* Peek at the next token. */
24339 /* Is it a noexcept-specification? */
24341 {
24342 tree expr;
24346 {
24347 matching_parens parens;
24351 {
24352 /* Types may not be defined in an exception-specification. */
24354 parser->type_definition_forbidden_message
24359 /* Restore the saved message. */
24361 }
24362 else
24363 {
24366 }
24369 }
24370 else
24371 {
24375 }
24377 /* We cannot build a noexcept-spec right away because this will check
24378 that expr is a constexpr. */
24381 else
24383 }
24384 else
24386 }
24388 /* Parse an (optional) exception-specification.
24390 exception-specification:
24391 throw ( type-id-list [opt] )
24393 Returns a TREE_LIST representing the exception-specification. The
24394 TREE_VALUE of each node is a type. */
24396 static tree
24398 {
24400 tree type_id_list;
24403 /* Peek at the next token. */
24406 /* Is it a noexcept-specification? */
24412 /* If it's not `throw', then there's no exception-specification. */
24418 /* Consume the `throw'. */
24421 /* Look for the `('. */
24422 matching_parens parens;
24425 /* Peek at the next token. */
24427 /* If it's not a `)', then there is a type-id-list. */
24429 {
24430 /* Types may not be defined in an exception-specification. */
24432 parser->type_definition_forbidden_message
24434 /* Parse the type-id-list. */
24436 /* Restore the saved message. */
24440 {
24444 }
24447 "dynamic exception specifications are deprecated in "
24449 }
24450 /* In C++17, throw() is equivalent to noexcept (true). throw()
24451 is deprecated in C++11 and above as well, but is still widely used,
24452 so don't warn about it yet. */
24455 else
24458 /* Look for the `)'. */
24462 }
24464 /* Parse an (optional) type-id-list.
24466 type-id-list:
24467 type-id ... [opt]
24468 type-id-list , type-id ... [opt]
24470 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24471 in the order that the types were presented. */
24473 static tree
24475 {
24479 {
24481 tree type;
24485 /* Get the next type-id. */
24487 /* Check for invalid 'auto'. */
24489 {
24493 }
24494 /* Parse the optional ellipsis. */
24496 {
24497 /* Consume the `...'. */
24500 /* Turn the type into a pack expansion expression. */
24502 }
24503 /* Add it to the list. */
24505 /* Peek at the next token. */
24507 /* If it is not a `,', we are done. */
24510 /* Consume the `,'. */
24512 }
24515 }
24517 /* Parse a try-block.
24519 try-block:
24520 try compound-statement handler-seq */
24522 static tree
24524 {
24525 tree try_block;
24539 }
24541 /* Parse a function-try-block.
24543 function-try-block:
24544 try ctor-initializer [opt] function-body handler-seq */
24546 static void
24548 {
24549 tree compound_stmt;
24550 tree try_block;
24552 /* Look for the `try' keyword. */
24555 /* Let the rest of the front end know where we are. */
24557 /* Parse the function-body. */
24558 cp_parser_ctor_initializer_opt_and_function_body
24560 /* We're done with the `try' part. */
24562 /* Parse the handlers. */
24564 /* We're done with the handlers. */
24566 }
24568 /* Parse a handler-seq.
24570 handler-seq:
24571 handler handler-seq [opt] */
24573 static void
24575 {
24577 {
24580 /* Parse the handler. */
24582 /* Peek at the next token. */
24584 /* If it's not `catch' then there are no more handlers. */
24587 }
24588 }
24590 /* Parse a handler.
24592 handler:
24593 catch ( exception-declaration ) compound-statement */
24595 static void
24597 {
24598 tree handler;
24599 tree declaration;
24603 matching_parens parens;
24610 }
24612 /* Parse an exception-declaration.
24614 exception-declaration:
24615 type-specifier-seq declarator
24616 type-specifier-seq abstract-declarator
24617 type-specifier-seq
24618 ...
24620 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24621 ellipsis variant is used. */
24623 static tree
24625 {
24626 cp_decl_specifier_seq type_specifiers;
24630 /* If it's an ellipsis, it's easy to handle. */
24632 {
24633 /* Consume the `...' token. */
24636 }
24638 /* Types may not be defined in exception-declarations. */
24640 parser->type_definition_forbidden_message
24643 /* Parse the type-specifier-seq. */
24647 /* If it's a `)', then there is no declarator. */
24650 else
24657 /* Restore the saved message. */
24664 }
24666 /* Parse a throw-expression.
24668 throw-expression:
24669 throw assignment-expression [opt]
24671 Returns a THROW_EXPR representing the throw-expression. */
24673 static tree
24675 {
24676 tree expression;
24681 /* Figure out whether or not there is an assignment-expression
24682 following the "throw" keyword. */
24690 else
24694 }
24696 /* GNU Extensions */
24698 /* Parse an (optional) asm-specification.
24700 asm-specification:
24701 asm ( string-literal )
24703 If the asm-specification is present, returns a STRING_CST
24704 corresponding to the string-literal. Otherwise, returns
24705 NULL_TREE. */
24707 static tree
24709 {
24711 tree asm_specification;
24713 /* Peek at the next token. */
24715 /* If the next token isn't the `asm' keyword, then there's no
24716 asm-specification. */
24720 /* Consume the `asm' token. */
24722 /* Look for the `('. */
24723 matching_parens parens;
24726 /* Look for the string-literal. */
24729 /* Look for the `)'. */
24733 }
24735 /* Parse an asm-operand-list.
24737 asm-operand-list:
24738 asm-operand
24739 asm-operand-list , asm-operand
24741 asm-operand:
24742 string-literal ( expression )
24743 [ string-literal ] string-literal ( expression )
24745 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24746 each node is the expression. The TREE_PURPOSE is itself a
24747 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24748 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24749 is a STRING_CST for the string literal before the parenthesis. Returns
24750 ERROR_MARK_NODE if any of the operands are invalid. */
24752 static tree
24754 {
24759 {
24760 tree string_literal;
24761 tree expression;
24762 tree name;
24765 {
24766 /* Consume the `[' token. */
24768 /* Read the operand name. */
24773 /* Look for the closing `]'. */
24775 }
24776 else
24778 /* Look for the string-literal. */
24781 /* Look for the `('. */
24782 matching_parens parens;
24784 /* Parse the expression. */
24786 /* Look for the `)'. */
24794 /* Add this operand to the list. */
24796 expression,
24797 asm_operands);
24798 /* If the next token is not a `,', there are no more
24799 operands. */
24802 /* Consume the `,'. */
24804 }
24807 }
24809 /* Parse an asm-clobber-list.
24811 asm-clobber-list:
24812 string-literal
24813 asm-clobber-list , string-literal
24815 Returns a TREE_LIST, indicating the clobbers in the order that they
24816 appeared. The TREE_VALUE of each node is a STRING_CST. */
24818 static tree
24820 {
24824 {
24825 tree string_literal;
24827 /* Look for the string literal. */
24829 /* Add it to the list. */
24831 /* If the next token is not a `,', then the list is
24832 complete. */
24835 /* Consume the `,' token. */
24837 }
24840 }
24842 /* Parse an asm-label-list.
24844 asm-label-list:
24845 identifier
24846 asm-label-list , identifier
24848 Returns a TREE_LIST, indicating the labels in the order that they
24849 appeared. The TREE_VALUE of each node is a label. */
24851 static tree
24853 {
24857 {
24860 /* Look for the identifier. */
24863 {
24866 {
24872 }
24873 }
24874 /* If the next token is not a `,', then the list is
24875 complete. */
24878 /* Consume the `,' token. */
24880 }
24883 }
24885 /* Return TRUE iff the next tokens in the stream are possibly the
24886 beginning of a GNU extension attribute. */
24888 static bool
24890 {
24892 }
24894 /* Return TRUE iff the next tokens in the stream are possibly the
24895 beginning of a standard C++-11 attribute specifier. */
24897 static bool
24899 {
24901 }
24903 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24904 beginning of a standard C++-11 attribute specifier. */
24906 static bool
24908 {
24916 }
24918 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24919 beginning of a GNU extension attribute. */
24921 static bool
24923 {
24927 }
24929 /* Return true iff the next tokens can be the beginning of either a
24930 GNU attribute list, or a standard C++11 attribute sequence. */
24932 static bool
24934 {
24937 }
24939 /* Return true iff the next Nth tokens can be the beginning of either
24940 a GNU attribute list, or a standard C++11 attribute sequence. */
24942 static bool
24944 {
24947 }
24949 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24950 of GNU attributes, or return NULL. */
24952 static tree
24954 {
24958 }
24960 /* Parse an (optional) series of attributes.
24962 attributes:
24963 attributes attribute
24965 attribute:
24966 __attribute__ (( attribute-list [opt] ))
24968 The return value is as for cp_parser_gnu_attribute_list. */
24970 static tree
24972 {
24979 {
24981 tree attribute_list;
24984 /* Peek at the next token. */
24986 /* If it's not `__attribute__', then we're done. */
24990 /* Consume the `__attribute__' keyword. */
24992 /* Look for the two `(' tokens. */
24993 matching_parens outer_parens;
24995 matching_parens inner_parens;
24998 /* Peek at the next token. */
25001 /* Parse the attribute-list. */
25003 else
25004 /* If the next token is a `)', then there is no attribute
25005 list. */
25008 /* Look for the two `)' tokens. */
25016 /* Add these new attributes to the list. */
25018 }
25021 }
25023 /* Parse a GNU attribute-list.
25025 attribute-list:
25026 attribute
25027 attribute-list , attribute
25029 attribute:
25030 identifier
25031 identifier ( identifier )
25032 identifier ( identifier , expression-list )
25033 identifier ( expression-list )
25035 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25036 to an attribute. The TREE_PURPOSE of each node is the identifier
25037 indicating which attribute is in use. The TREE_VALUE represents
25038 the arguments, if any. */
25040 static tree
25042 {
25048 {
25050 tree identifier;
25051 tree attribute;
25053 /* Look for the identifier. We also allow keywords here; for
25054 example `__attribute__ ((const))' is legal. */
25058 {
25061 /* Consume the token, but save it since we need it for the
25062 SIMD enabled function parsing. */
25065 /* Save away the identifier that indicates which attribute
25066 this is. */
25068 /* For keywords, use the canonical spelling, not the
25069 parsed identifier. */
25076 /* Peek at the next token. */
25078 /* If it's an `(', then parse the attribute arguments. */
25080 {
25084 vec = cp_parser_parenthesized_expression_list
25090 else
25091 {
25094 }
25095 /* Save the arguments away. */
25097 }
25100 {
25101 /* Add this attribute to the list. */
25104 }
25107 }
25108 /* Now, look for more attributes. If the next token isn't a
25109 `,', we're done. */
25113 /* Consume the comma and keep going. */
25115 }
25118 /* We built up the list in reverse order. */
25120 }
25122 /* Parse a standard C++11 attribute.
25124 The returned representation is a TREE_LIST which TREE_PURPOSE is
25125 the scoped name of the attribute, and the TREE_VALUE is its
25126 arguments list.
25128 Note that the scoped name of the attribute is itself a TREE_LIST
25129 which TREE_PURPOSE is the namespace of the attribute, and
25130 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25131 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25132 and which TREE_PURPOSE is directly the attribute name.
25134 Clients of the attribute code should use get_attribute_namespace
25135 and get_attribute_name to get the actual namespace and name of
25136 attributes, regardless of their being GNU or C++11 attributes.
25138 attribute:
25139 attribute-token attribute-argument-clause [opt]
25141 attribute-token:
25142 identifier
25143 attribute-scoped-token
25145 attribute-scoped-token:
25146 attribute-namespace :: identifier
25148 attribute-namespace:
25149 identifier
25151 attribute-argument-clause:
25152 ( balanced-token-seq )
25154 balanced-token-seq:
25155 balanced-token [opt]
25156 balanced-token-seq balanced-token
25158 balanced-token:
25159 ( balanced-token-seq )
25160 [ balanced-token-seq ]
25161 { balanced-token-seq }. */
25163 static tree
25165 {
25172 /* First, parse name of the attribute, a.k.a attribute-token. */
25189 {
25190 /* We are seeing a scoped attribute token. */
25205 else
25206 {
25210 }
25214 NULL_TREE);
25216 }
25219 NULL_TREE);
25220 else
25221 {
25224 NULL_TREE);
25225 /* C++11 noreturn attribute is equivalent to GNU's. */
25228 /* C++14 deprecated attribute is equivalent to GNU's. */
25231 /* C++17 fallthrough attribute is equivalent to GNU's. */
25234 /* Transactional Memory TS optimize_for_synchronized attribute is
25235 equivalent to GNU transaction_callable. */
25239 /* Transactional Memory attributes are GNU attributes. */
25242 }
25244 /* Now parse the optional argument clause of the attribute. */
25249 {
25255 /* A GNU attribute that takes an identifier in parameter. */
25258 vec = cp_parser_parenthesized_expression_list
25264 else
25265 {
25268 }
25272 else
25274 }
25277 }
25279 /* Check that the attribute ATTRIBUTE appears at most once in the
25280 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25281 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25282 isn't implemented yet in GCC. */
25284 static void
25286 {
25288 {
25298 }
25299 }
25301 /* Parse a list of standard C++-11 attributes.
25303 attribute-list:
25304 attribute [opt]
25305 attribute-list , attribute[opt]
25306 attribute ...
25307 attribute-list , attribute ...
25308 */
25310 static tree
25312 {
25317 {
25322 {
25326 }
25329 {
25334 else
25335 {
25340 }
25342 }
25346 }
25349 }
25351 /* Parse a standard C++-11 attribute specifier.
25353 attribute-specifier:
25354 [ [ attribute-using-prefix [opt] attribute-list ] ]
25355 alignment-specifier
25357 attribute-using-prefix:
25358 using attribute-namespace :
25360 alignment-specifier:
25361 alignas ( type-id ... [opt] )
25362 alignas ( alignment-expression ... [opt] ). */
25364 static tree
25366 {
25372 {
25379 {
25390 {
25394 "attribute using prefix only available "
25400 }
25401 else
25403 }
25410 else
25411 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25412 when we are sure that we have actually parsed them. */
25414 }
25415 else
25416 {
25417 tree alignas_expr;
25419 /* Look for an alignment-specifier. */
25430 matching_parens parens;
25438 {
25445 }
25450 /* Handle alignas (pack...). */
25452 {
25455 }
25457 /* Something went wrong, so don't build the attribute. */
25464 /* Build the C++-11 representation of an 'aligned'
25465 attribute. */
25466 attributes =
25469 alignas_expr);
25470 }
25473 }
25475 /* Parse a standard C++-11 attribute-specifier-seq.
25477 attribute-specifier-seq:
25478 attribute-specifier-seq [opt] attribute-specifier
25479 */
25481 static tree
25483 {
25488 {
25497 else
25500 }
25503 }
25505 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25506 return index of the first token after balanced-token, or N on failure. */
25508 static size_t
25510 {
25513 do
25515 {
25518 /* Ran out of tokens. */
25540 }
25543 }
25545 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25546 return index of the first token after the GNU attribute tokens, or N on
25547 failure. */
25549 static size_t
25551 {
25553 {
25565 }
25567 }
25569 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25570 next token), return index of the first token after the standard C++11
25571 attribute tokens, or N on failure. */
25573 static size_t
25575 {
25577 {
25580 {
25587 }
25590 {
25595 }
25596 else
25598 }
25600 }
25602 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25603 as the next token), return index of the first token after the attribute
25604 tokens, or N on failure. */
25606 static size_t
25608 {
25612 }
25614 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25615 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25616 current value of the PEDANTIC flag, regardless of whether or not
25617 the `__extension__' keyword is present. The caller is responsible
25618 for restoring the value of the PEDANTIC flag. */
25620 static bool
25622 {
25623 /* Save the old value of the PEDANTIC flag. */
25627 {
25628 /* Consume the `__extension__' token. */
25630 /* We're not being pedantic while the `__extension__' keyword is
25631 in effect. */
25635 }
25638 }
25640 /* Parse a label declaration.
25642 label-declaration:
25643 __label__ label-declarator-seq ;
25645 label-declarator-seq:
25646 identifier , label-declarator-seq
25647 identifier */
25649 static void
25651 {
25652 /* Look for the `__label__' keyword. */
25656 {
25657 tree identifier;
25659 /* Look for an identifier. */
25661 /* If we failed, stop. */
25664 /* Declare it as a label. */
25666 /* If the next token is a `;', stop. */
25669 /* Look for the `,' separating the label declarations. */
25671 }
25673 /* Look for the final `;'. */
25675 }
25677 // -------------------------------------------------------------------------- //
25678 // Requires Clause
25680 // Parse a requires clause.
25681 //
25682 // requires-clause:
25683 // 'requires' logical-or-expression
25684 //
25685 // The required logical-or-expression must be a constant expression. Note
25686 // that we don't check that the expression is constepxr here. We defer until
25687 // we analyze constraints and then, we only check atomic constraints.
25688 static tree
25690 {
25691 // Parse the requires clause so that it is not automatically folded.
25699 }
25701 // Optionally parse a requires clause:
25702 static tree
25704 {
25707 {
25710 {
25713 /* Parse and discard the requires-clause. */
25716 }
25718 }
25721 }
25724 /*---------------------------------------------------------------------------
25725 Requires expressions
25726 ---------------------------------------------------------------------------*/
25728 /* Parse a requires expression
25730 requirement-expression:
25731 'requires' requirement-parameter-list [opt] requirement-body */
25732 static tree
25734 {
25738 /* A requires-expression shall appear only within a concept
25739 definition or a requires-clause.
25741 TODO: Implement this diagnostic correctly. */
25743 {
25747 }
25750 {
25751 /* Local parameters are delared as variables within the scope
25752 of the expression. They are not visible past the end of
25753 the expression. Expressions within the requires-expression
25754 are unevaluated. */
25755 struct scope_sentinel
25756 {
25758 {
25761 }
25764 {
25767 }
25770 /* Parse the optional parameter list. */
25772 {
25776 }
25777 else
25780 /* Parse the requirement body. */
25784 }
25786 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25787 the parm chain. */
25790 }
25792 /* Parse a parameterized requirement.
25794 requirement-parameter-list:
25795 '(' parameter-declaration-clause ')' */
25796 static tree
25798 {
25799 matching_parens parens;
25809 }
25811 /* Parse the body of a requirement.
25813 requirement-body:
25814 '{' requirement-list '}' */
25815 static tree
25817 {
25818 matching_braces braces;
25828 }
25830 /* Parse a list of requirements.
25832 requirement-list:
25833 requirement
25834 requirement-list ';' requirement[opt] */
25835 static tree
25837 {
25840 {
25847 /* If we see a semi-colon, consume it. */
25851 /* Stop processing at the end of the list. */
25854 }
25856 /* Reverse the order of requirements so they are analyzed in
25857 declaration order. */
25859 }
25861 /* Parse a syntactic requirement or type requirement.
25863 requirement:
25864 simple-requirement
25865 compound-requirement
25866 type-requirement
25867 nested-requirement */
25868 static tree
25870 {
25877 else
25879 }
25881 /* Parse a simple requirement.
25883 simple-requirement:
25884 expression ';' */
25885 static tree
25887 {
25896 }
25898 /* Parse a type requirement
25900 type-requirement
25901 nested-name-specifier [opt] required-type-name ';'
25903 required-type-name:
25904 type-name
25905 'template' [opt] simple-template-id */
25906 static tree
25908 {
25911 // Save the scope before parsing name specifiers.
25922 tree type;
25924 {
25933 }
25934 else
25953 }
25955 /* Parse a compound requirement
25957 compound-requirement:
25958 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25959 static tree
25961 {
25962 /* Parse an expression enclosed in '{ }'s. */
25963 matching_braces braces;
25974 /* Parse the optional noexcept. */
25977 {
25980 }
25982 /* Parse the optional trailing return type. */
25985 {
25993 }
25996 }
25998 /* Parse a nested requirement. This is the same as a requires clause.
26000 nested-requirement:
26001 requires-clause */
26002 static tree
26004 {
26010 }
26012 /* Support Functions */
26014 /* Return the appropriate prefer_type argument for lookup_name_real based on
26015 tag_type and template_mem_access. */
26019 {
26020 /* DR 141: When looking in the current enclosing context for a template-name
26021 after -> or ., only consider class templates. */
26025 {
26029 }
26030 }
26032 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26033 NAME should have one of the representations used for an
26034 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26035 is returned. If PARSER->SCOPE is a dependent type, then a
26036 SCOPE_REF is returned.
26038 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26039 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26040 was formed. Abstractly, such entities should not be passed to this
26041 function, because they do not need to be looked up, but it is
26042 simpler to check for this special case here, rather than at the
26043 call-sites.
26045 In cases not explicitly covered above, this function returns a
26046 DECL, OVERLOAD, or baselink representing the result of the lookup.
26047 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26048 is returned.
26050 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26051 (e.g., "struct") that was used. In that case bindings that do not
26052 refer to types are ignored.
26054 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26055 ignored.
26057 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26058 are ignored.
26060 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26061 types.
26063 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26064 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26065 NULL_TREE otherwise. */
26067 static cp_expr
26074 location_t name_location)
26075 {
26076 tree decl;
26079 /* Assume that the lookup will be unambiguous. */
26083 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26084 no longer valid. Note that if we are parsing tentatively, and
26085 the parse fails, OBJECT_TYPE will be automatically restored. */
26091 /* A template-id has already been resolved; there is no lookup to
26092 do. */
26096 {
26100 }
26102 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26103 it should already have been checked to make sure that the name
26104 used matches the type being destroyed. */
26106 {
26107 tree type;
26109 /* Figure out to which type this destructor applies. */
26114 else
26116 /* If that's not a class type, there is no destructor. */
26127 }
26129 /* By this point, the NAME should be an ordinary identifier. If
26130 the id-expression was a qualified name, the qualifying scope is
26131 stored in PARSER->SCOPE at this point. */
26134 /* Perform the lookup. */
26136 {
26142 /* If the SCOPE is dependent, the lookup must be deferred until
26143 the template is instantiated -- unless we are explicitly
26144 looking up names in uninstantiated templates. Even then, we
26145 cannot look up the name if the scope is not a class type; it
26146 might, for example, be a template type parameter. */
26151 /* Defer lookup. */
26153 else
26154 {
26157 /* If PARSER->SCOPE is a dependent type, then it must be a
26158 class type, and we must not be checking dependencies;
26159 otherwise, we would have processed this lookup above. So
26160 that PARSER->SCOPE is not considered a dependent base by
26161 lookup_member, we must enter the scope here. */
26165 /* If the PARSER->SCOPE is a template specialization, it
26166 may be instantiated during name lookup. In that case,
26167 errors may be issued. Even if we rollback the current
26168 tentative parse, those errors are valid. */
26173 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26174 lookup result and the nested-name-specifier nominates a class C:
26175 * if the name specified after the nested-name-specifier, when
26176 looked up in C, is the injected-class-name of C (Clause 9), or
26177 * if the name specified after the nested-name-specifier is the
26178 same as the identifier or the simple-template-id's template-
26179 name in the last component of the nested-name-specifier,
26180 the name is instead considered to name the constructor of
26181 class C. [ Note: for example, the constructor is not an
26182 acceptable lookup result in an elaborated-type-specifier so
26183 the constructor would not be used in place of the
26184 injected-class-name. --end note ] Such a constructor name
26185 shall be used only in the declarator-id of a declaration that
26186 names a constructor or in a using-declaration. */
26194 /* If we have a single function from a using decl, pull it out. */
26201 }
26203 /* If the scope is a dependent type and either we deferred lookup or
26204 we did lookup but didn't find the name, rememeber the name. */
26207 {
26209 {
26210 tree type;
26212 /* The resolution to Core Issue 180 says that `struct
26213 A::B' should be considered a type-name, even if `A'
26214 is dependent. */
26219 }
26223 CPP_CLOSE_PAREN)))
26227 else
26230 is_template);
26231 }
26234 }
26236 {
26237 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26238 OBJECT_TYPE is not a class. */
26240 /* If the OBJECT_TYPE is a template specialization, it may
26241 be instantiated during name lookup. In that case, errors
26242 may be issued. Even if we rollback the current tentative
26243 parse, those errors are valid. */
26245 name,
26248 tf_warning_or_error);
26249 else
26253 /* Look it up in the enclosing context. DR 141: When looking for a
26254 template-name after -> or ., only consider class templates. */
26259 /* The object is type-dependent, so we can't look anything up; we used
26260 this to get the DR 141 behavior. */
26264 }
26265 else
26266 {
26272 }
26274 /* If the lookup failed, let our caller know. */
26278 /* Pull out the template from an injected-class-name (or multiple). */
26282 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26284 {
26287 /* The error message we have to print is too complicated for
26288 cp_parser_error, so we incorporate its actions directly. */
26290 {
26292 name);
26294 }
26296 }
26304 /* If we have resolved the name of a member declaration, check to
26305 see if the declaration is accessible. When the name resolves to
26306 set of overloaded functions, accessibility is checked when
26307 overload resolution is done.
26309 During an explicit instantiation, access is not checked at all,
26310 as per [temp.explicit]. */
26317 }
26319 /* Like cp_parser_lookup_name, but for use in the typical case where
26320 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26321 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26323 static tree
26325 {
26327 none_type,
26332 location);
26333 }
26335 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26336 the current context, return the TYPE_DECL. If TAG_NAME_P is
26337 true, the DECL indicates the class being defined in a class-head,
26338 or declared in an elaborated-type-specifier.
26340 Otherwise, return DECL. */
26342 static tree
26344 {
26345 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26346 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26348 struct A {
26349 template <typename T> struct B;
26350 };
26352 template <typename T> struct A::B {};
26354 Similarly, in an elaborated-type-specifier:
26356 namespace N { struct X{}; }
26358 struct A {
26359 template <typename T> friend struct N::X;
26360 };
26362 However, if the DECL refers to a class type, and we are in
26363 the scope of the class, then the name lookup automatically
26364 finds the TYPE_DECL created by build_self_reference rather
26365 than a TEMPLATE_DECL. For example, in:
26367 template <class T> struct S {
26368 S s;
26369 };
26371 there is no need to handle such case. */
26377 }
26379 /* If too many, or too few, template-parameter lists apply to the
26380 declarator, issue an error message. Returns TRUE if all went well,
26381 and FALSE otherwise. */
26383 static bool
26386 location_t declarator_location)
26387 {
26389 {
26391 {
26400 {
26401 /* If the DECLARATOR has the form `X<y>' then it uses one
26402 additional level of template parameters. */
26405 }
26407 return cp_parser_check_template_parameters
26409 declarator);
26410 }
26426 }
26428 }
26430 /* NUM_TEMPLATES were used in the current declaration. If that is
26431 invalid, return FALSE and issue an error messages. Otherwise,
26432 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26433 declarator and we can print more accurate diagnostics. */
26435 static bool
26439 location_t location,
26441 {
26442 /* If there are the same number of template classes and parameter
26443 lists, that's OK. */
26446 /* If there are more, but only one more, and the name ends in an identifier,
26447 then we are declaring a primary template. That's OK too. */
26451 /* If there are more template classes than parameter lists, we have
26452 something like:
26454 template <class T> void S<T>::R<T>::f (); */
26456 {
26466 else
26469 }
26470 /* Otherwise, there are too many template parameter lists. We have
26471 something like:
26473 template <class T> template <class U> void S::f(); */
26476 }
26478 /* Parse an optional `::' token indicating that the following name is
26479 from the global namespace. If so, PARSER->SCOPE is set to the
26480 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26481 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26482 Returns the new value of PARSER->SCOPE, if the `::' token is
26483 present, and NULL_TREE otherwise. */
26485 static tree
26487 {
26490 /* Peek at the next token. */
26492 /* If we're looking at a `::' token then we're starting from the
26493 global namespace, not our current location. */
26495 {
26496 /* Consume the `::' token. */
26498 /* Set the SCOPE so that we know where to start the lookup. */
26504 }
26506 {
26510 }
26513 }
26515 /* Returns TRUE if the upcoming token sequence is the start of a
26516 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26517 declarator is preceded by the `friend' specifier. */
26519 static bool
26521 {
26524 tree nested_name_specifier;
26527 /* The common case is that this is not a constructor declarator, so
26528 try to avoid doing lots of work if at all possible. It's not
26529 valid declare a constructor at function scope. */
26532 /* And only certain tokens can begin a constructor declarator. */
26540 /* Parse tentatively; we are going to roll back all of the tokens
26541 consumed here. */
26543 /* Assume that we are looking at a constructor declarator. */
26546 /* Look for the optional `::' operator. */
26549 /* Look for the nested-name-specifier. */
26550 nested_name_specifier
26561 /* Outside of a class-specifier, there must be a
26562 nested-name-specifier. Except in C++17 mode, where we
26563 might be declaring a guiding declaration. */
26570 /* If we have a class scope, this is easy; DR 147 says that S::S always
26571 names the constructor, and no other qualified name could. */
26574 {
26584 }
26585 /* If we still think that this might be a constructor-declarator,
26586 look for a class-name. */
26588 {
26589 /* If we have:
26591 template <typename T> struct S {
26592 S();
26593 };
26595 we must recognize that the nested `S' names a class. */
26599 tree type_decl;
26603 none_type,
26610 {
26616 none_type,
26621 else
26623 }
26625 /* If there was no class-name, then this is not a constructor.
26626 Otherwise, if we are in a class-specifier and we aren't
26627 handling a friend declaration, check that its type matches
26628 current_class_type (c++/38313). Note: error_mark_node
26629 is left alone for error recovery purposes. */
26631 && (outside_class_specifier_p
26637 /* If we're still considering a constructor, we have to see a `(',
26638 to begin the parameter-declaration-clause, followed by either a
26639 `)', an `...', or a decl-specifier. We need to check for a
26640 type-specifier to avoid being fooled into thinking that:
26642 S (f) (int);
26644 is a constructor. (It is actually a function named `f' that
26645 takes one parameter (of type `int') and returns a value of type
26646 `S'. */
26654 /* A parameter declaration begins with a decl-specifier,
26655 which is either the "attribute" keyword, a storage class
26656 specifier, or (usually) a type-specifier. */
26658 {
26659 tree type;
26663 /* Names appearing in the type-specifier should be looked up
26664 in the scope of the class. */
26668 {
26671 {
26675 {
26678 }
26679 }
26681 }
26683 /* Inside the constructor parameter list, surrounding
26684 template-parameter-lists do not apply. */
26685 saved_num_template_parameter_lists
26689 /* Look for the type-specifier. */
26691 CP_PARSER_FLAGS_NONE,
26697 parser->num_template_parameter_lists
26700 /* Leave the scope of the class. */
26705 }
26706 }
26708 /* We did not really want to consume any tokens. */
26712 }
26714 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26715 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26716 they must be performed once we are in the scope of the function.
26718 Returns the function defined. */
26720 static tree
26721 cp_parser_function_definition_from_specifiers_and_declarator
26724 tree attributes,
26726 {
26727 tree fn;
26730 /* Begin the function-definition. */
26733 /* The things we're about to see are not directly qualified by any
26734 template headers we've seen thus far. */
26737 /* If there were names looked up in the decl-specifier-seq that we
26738 did not check, check them now. We must wait until we are in the
26739 scope of the function to perform the checks, since the function
26740 might be a friend. */
26744 {
26749 }
26752 {
26753 /* Skip the entire function. */
26756 }
26758 {
26759 /* Seen already, skip it. An error message has already been output. */
26763 /* If this is a function from a class, pop the nested class. */
26766 }
26767 else
26768 {
26769 timevar_id_t tv;
26772 else
26778 }
26781 }
26783 /* Parse the part of a function-definition that follows the
26784 declarator. INLINE_P is TRUE iff this function is an inline
26785 function defined within a class-specifier.
26787 Returns the function defined. */
26789 static tree
26792 {
26793 tree fn;
26798 bool fully_implicit_function_template_p
26801 tree implicit_template_parms
26804 cp_binding_level* implicit_template_scope
26810 /* If the next token is `return', then the code may be trying to
26811 make use of the "named return value" extension that G++ used to
26812 support. */
26815 {
26816 /* Consume the `return' keyword. */
26818 /* Look for the identifier that indicates what value is to be
26819 returned. */
26821 /* Issue an error message. */
26824 /* Skip tokens until we reach the start of the function body. */
26826 {
26833 }
26834 }
26835 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26836 anything declared inside `f'. */
26837 saved_in_unbraced_linkage_specification_p
26840 /* Inside the function, surrounding template-parameter-lists do not
26841 apply. */
26842 saved_num_template_parameter_lists
26846 /* If the next token is `try', `__transaction_atomic', or
26847 `__transaction_relaxed`, then we are looking at either function-try-block
26848 or function-transaction-block. Note that all of these include the
26849 function-body. */
26853 RID_TRANSACTION_RELAXED))
26857 else
26858 cp_parser_ctor_initializer_opt_and_function_body
26861 /* Finish the function. */
26863 /* Generate code for it, if necessary. */
26865 /* Restore the saved values. */
26866 parser->in_unbraced_linkage_specification_p
26868 parser->num_template_parameter_lists
26872 parser->fully_implicit_function_template_p
26874 parser->implicit_template_parms
26876 parser->implicit_template_scope
26883 }
26885 /* Parse a template-declaration body (following argument list). */
26887 static void
26889 tree parameter_list,
26891 {
26895 /* We just processed one more parameter list. */
26898 /* Get the deferred access checks from the parameter list. These
26899 will be checked once we know what is being declared, as for a
26900 member template the checks must be performed in the scope of the
26901 class containing the member. */
26904 /* Tentatively parse for a new template parameter list, which can either be
26905 the template keyword or a template introduction. */
26911 else
26912 {
26913 /* There are no access checks when parsing a template, as we do not
26914 know if a specialization will be a friend. */
26918 checks,
26919 member_p,
26924 /* If this is a member template declaration, let the front
26925 end know. */
26927 {
26932 }
26937 }
26938 /* We are done with the current parameter list. */
26943 /* Finish up. */
26946 /* Check the template arguments for a literal operator template. */
26950 {
26954 else
26955 {
26958 {
26964 }
26966 {
26975 }
26976 else
26978 }
26980 {
26983 " Expected non-type template argument pack <char...>"
26985 decl);
26986 else
26989 decl);
26990 }
26991 }
26993 /* Register member declarations. */
26996 /* If DECL is a function template, we must return to parse it later.
26997 (Even though there is no definition, there might be default
26998 arguments that need handling.) */
27002 }
27004 /* Parse a template introduction header for a template-declaration. Returns
27005 false if tentative parse fails. */
27007 static bool
27009 {
27016 /* Look for the optional `::' operator. */
27019 /* Look for the nested-name-specifier. */
27029 /* Look up the concept for which we will be matching
27030 template parameters. */
27040 /* Look for opening brace for introduction. */
27041 matching_braces braces;
27049 /* Build vector of placeholder parameters and grab
27050 matching identifiers. */
27053 /* The introduction-list shall not be empty. */
27056 {
27059 }
27061 /* Look for closing brace for introduction. */
27066 {
27070 }
27072 /* Build and associate the constraint. */
27075 {
27077 member_p);
27079 }
27083 }
27085 /* Parse a normal template-declaration following the template keyword. */
27087 static void
27089 {
27090 tree parameter_list;
27094 /* Look for the `<' token. */
27098 {
27099 /* 14.5.2.2 [temp.mem]
27101 A local class shall not have member templates. */
27106 }
27107 /* [temp]
27109 A template ... shall not have C linkage. */
27111 {
27114 /* Give it C++ linkage to avoid confusing other parts of the
27115 front end. */
27118 }
27119 else
27122 /* We cannot perform access checks on the template parameter
27123 declarations until we know what is being declared, just as we
27124 cannot check the decl-specifier list. */
27127 /* If the next token is `>', then we have an invalid
27128 specialization. Rather than complain about an invalid template
27129 parameter, issue an error message here. */
27131 {
27135 }
27136 else
27137 {
27138 /* Parse the template parameters. */
27140 }
27142 /* Look for the `>'. */
27145 /* Manage template requirements */
27147 {
27152 }
27155 member_p);
27157 /* For the erroneous case of a template with C linkage, we pushed an
27158 implicit C++ linkage scope; exit that scope now. */
27161 }
27163 /* Parse a template-declaration, assuming that the `export' (and
27164 `extern') keywords, if present, has already been scanned. MEMBER_P
27165 is as for cp_parser_template_declaration. */
27167 static bool
27169 {
27171 {
27175 }
27180 }
27182 /* Perform the deferred access checks from a template-parameter-list.
27183 CHECKS is a TREE_LIST of access checks, as returned by
27184 get_deferred_access_checks. */
27186 static void
27187 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27188 {
27192 }
27194 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27195 `function-definition' sequence that follows a template header.
27196 If MEMBER_P is true, this declaration appears in a class scope.
27198 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27199 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27201 static tree
27207 {
27210 cp_decl_specifier_seq decl_specifiers;
27214 /* This function is only used when processing a template
27215 declaration. */
27219 /* Defer access checks until we know what is being declared. */
27222 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27223 alternative. */
27226 CP_PARSER_FLAGS_OPTIONAL,
27232 /* There are no template typedefs. */
27234 {
27238 }
27240 /* Gather up the access checks that occurred the
27241 decl-specifier-seq. */
27244 /* Check for the declaration of a template class. */
27246 {
27249 {
27250 // If this is a declaration, but not a definition, associate
27251 // any constraints with the type declaration. Constraints
27252 // are associated with definitions in cp_parser_class_specifier.
27258 /* In this case:
27260 struct C {
27261 friend template <typename T> struct A<T>::B;
27262 };
27264 A<T>::B will be represented by a TYPENAME_TYPE, and
27265 therefore not recognized by shadow_tag. */
27267 && !decl
27274 else
27277 /* Perform access checks for template parameters. */
27280 /* Give a helpful diagnostic for
27281 template <class T> struct A { } a;
27282 if we aren't already recovering from an error. */
27285 {
27287 "a class template declaration must not declare "
27291 }
27292 }
27293 }
27295 /* Complain about missing 'typename' or other invalid type names. */
27298 {
27299 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27300 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27301 the rest of this declaration. */
27304 }
27306 /* If it's not a template class, try for a template function. If
27307 the next token is a `;', then this declaration does not declare
27308 anything. But, if there were errors in the decl-specifiers, then
27309 the error might well have come from an attempted class-specifier.
27310 In that case, there's no need to warn about a missing declarator. */
27314 {
27317 checks,
27319 member_p,
27320 declares_class_or_enum,
27324 /* 7.1.1-1 [dcl.stc]
27326 A storage-class-specifier shall not be specified in an explicit
27327 specialization... */
27329 && explicit_specialization_p
27331 {
27335 }
27339 }
27341 /* Look for a trailing `;' after the declaration. */
27347 out:
27350 /* Clear any current qualification; whatever comes next is the start
27351 of something new. */
27357 }
27359 /* Parse a cast-expression that is not the operand of a unary "&". */
27361 static cp_expr
27363 {
27366 }
27368 /* Parse a functional cast to TYPE. Returns an expression
27369 representing the cast. */
27371 static cp_expr
27373 {
27375 tree expression_list;
27376 cp_expr cast;
27385 {
27395 /* Create a location of the form:
27396 type_name{i, f}
27397 ^~~~~~~~~~~~~~~
27398 with caret == start at the start of the type name,
27399 finishing at the closing brace. */
27400 location_t finish_loc
27403 finish_loc);
27406 }
27415 else
27416 {
27419 }
27422 tf_warning_or_error);
27423 /* [expr.const]/1: In an integral constant expression "only type
27424 conversions to integral or enumeration type can be used". */
27430 NIC_CONSTRUCTOR))
27433 /* Create a location of the form:
27434 float(i)
27435 ^~~~~~~~
27436 with caret == start at the start of the type name,
27437 finishing at the closing paren. */
27438 location_t finish_loc
27443 }
27445 /* Save the tokens that make up the body of a member function defined
27446 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27447 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27448 specifiers applied to the declaration. Returns the FUNCTION_DECL
27449 for the member function. */
27451 static tree
27455 tree attributes)
27456 {
27459 tree fn;
27462 /* Create the FUNCTION_DECL. */
27466 /* If something went badly wrong, bail out now. */
27468 {
27469 /* If there's a function-body, skip it. */
27474 }
27476 /* Remember it, if there default args to post process. */
27479 /* Save away the tokens that make up the body of the
27480 function. */
27486 RID_TRANSACTION_ATOMIC))
27487 {
27489 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27496 {
27502 }
27503 else
27506 {
27510 }
27511 }
27513 /* Handle function try blocks. */
27515 {
27518 }
27519 /* We can have braced-init-list mem-initializers before the fn body. */
27521 {
27524 {
27525 /* cache_group will stop after an un-nested { } pair, too. */
27529 /* variadic mem-inits have ... after the ')'. */
27532 }
27533 }
27535 /* Handle function try blocks. */
27541 /* Save away the inline definition; we will process it when the
27542 class is complete. */
27546 /* We need to know that this was defined in the class, so that
27547 friend templates are handled correctly. */
27550 /* Add FN to the queue of functions to be parsed later. */
27554 }
27556 /* Save the tokens that make up the in-class initializer for a non-static
27557 data member. Returns a DEFAULT_ARG. */
27559 static tree
27561 {
27563 }
27565 /* Parse a template-argument-list, as well as the trailing ">" (but
27566 not the opening "<"). See cp_parser_template_argument_list for the
27567 return value. */
27569 static tree
27571 {
27572 tree arguments;
27573 tree saved_scope;
27574 tree saved_qualifying_scope;
27575 tree saved_object_scope;
27580 /* [temp.names]
27582 When parsing a template-id, the first non-nested `>' is taken as
27583 the end of the template-argument-list rather than a greater-than
27584 operator. */
27585 saved_greater_than_is_operator_p
27588 /* Parsing the argument list may modify SCOPE, so we save it
27589 here. */
27593 /* We need to evaluate the template arguments, even though this
27594 template-id may be nested within a "sizeof". */
27599 /* Parse the template-argument-list itself. */
27603 else
27605 /* Look for the `>' that ends the template-argument-list. If we find
27606 a '>>' instead, it's probably just a typo. */
27608 {
27610 {
27611 /* In C++0x, a `>>' in a template argument list or cast
27612 expression is considered to be two separate `>'
27613 tokens. So, change the current token to a `>', but don't
27614 consume it: it will be consumed later when the outer
27615 template argument list (or cast expression) is parsed.
27616 Note that this replacement of `>' for `>>' is necessary
27617 even if we are parsing tentatively: in the tentative
27618 case, after calling
27619 cp_parser_enclosed_template_argument_list we will always
27620 throw away all of the template arguments and the first
27621 closing `>', either because the template argument list
27622 was erroneous or because we are replacing those tokens
27623 with a CPP_TEMPLATE_ID token. The second `>' (which will
27624 not have been thrown away) is needed either to close an
27625 outer template argument list or to complete a new-style
27626 cast. */
27629 }
27631 {
27632 /* If we're in a nested template argument list, the '>>' has
27633 to be a typo for '> >'. We emit the error message, but we
27634 continue parsing and we push a '>' as next token, so that
27635 the argument list will be parsed correctly. Note that the
27636 global source location is still on the token before the
27637 '>>', so we need to say explicitly where we want it. */
27645 }
27646 else
27647 {
27648 /* If this is not a nested template argument list, the '>>'
27649 is a typo for '>'. Emit an error message and continue.
27650 Same deal about the token location, but here we can get it
27651 right by consuming the '>>' before issuing the diagnostic. */
27654 "spurious %<>>%>, use %<>%> to terminate "
27656 }
27657 }
27658 else
27660 /* The `>' token might be a greater-than operator again now. */
27661 parser->greater_than_is_operator_p
27663 /* Restore the SAVED_SCOPE. */
27671 }
27673 /* MEMBER_FUNCTION is a member function, or a friend. If default
27674 arguments, or the body of the function have not yet been parsed,
27675 parse them now. */
27677 static void
27679 {
27681 /* If this member is a template, get the underlying
27682 FUNCTION_DECL. */
27686 /* There should not be any class definitions in progress at this
27687 point; the bodies of members are only parsed outside of all class
27688 definitions. */
27690 /* While we're parsing the member functions we might encounter more
27691 classes. We want to handle them right away, but we don't want
27692 them getting mixed up with functions that are currently in the
27693 queue. */
27696 /* Make sure that any template parameters are in scope. */
27699 /* If the body of the function has not yet been parsed, parse it
27700 now. */
27702 {
27703 tree function_scope;
27706 /* The function is no longer pending; we are processing it. */
27711 /* If this is a local class, enter the scope of the containing
27712 function. */
27717 /* Push the body of the function onto the lexer stack. */
27720 /* Let the front end know that we going to be defining this
27721 function. */
27725 /* Don't do access checking if it is a templated function. */
27729 /* #pragma omp declare reduction needs special parsing. */
27731 {
27736 }
27737 else
27738 /* Now, parse the body of the function. */
27745 /* Leave the scope of the containing function. */
27749 }
27751 /* Remove any template parameters from the symbol table. */
27754 /* Restore the queue. */
27757 }
27759 /* If DECL contains any default args, remember it on the unparsed
27760 functions queue. */
27762 static void
27764 {
27765 tree probe;
27768 probe;
27771 {
27775 }
27776 }
27778 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27779 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27780 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27781 from the parameter-type-list. */
27783 static tree
27786 {
27788 tree parsed_arg;
27794 /* Push the saved tokens for the default argument onto the parser's
27795 lexer stack. */
27801 /* Parse the default argument. */
27812 {
27813 /* In a non-template class, check conversions now. In a template,
27814 we'll wait and instantiate these as needed. */
27817 tf_warning_or_error);
27820 else
27822 }
27824 /* If the token stream has not been completely used up, then
27825 there was extra junk after the end of the default
27826 argument. */
27828 {
27831 else
27833 }
27835 /* Revert to the main lexer. */
27839 }
27841 /* FIELD is a non-static data member with an initializer which we saved for
27842 later; parse it now. */
27844 static void
27846 {
27847 tree def;
27854 NULL_TREE);
27860 }
27862 /* FN is a FUNCTION_DECL which may contains a parameter with an
27863 unparsed DEFAULT_ARG. Parse the default args now. This function
27864 assumes that the current scope is the scope in which the default
27865 argument should be processed. */
27867 static void
27869 {
27873 /* While we're parsing the default args, we might (due to the
27874 statement expression extension) encounter more classes. We want
27875 to handle them right away, but we don't want them getting mixed
27876 up with default args that are currently in the queue. */
27879 /* Local variable names (and the `this' keyword) may not appear
27880 in a default argument. */
27891 {
27893 tree parsed_arg;
27895 tree copy;
27902 /* This can happen for a friend declaration for a function
27903 already declared with default arguments. */
27906 parsed_arg
27908 default_arg,
27912 /* Update any instantiations we've already created. */
27916 }
27920 /* Make sure no default arg is missing. */
27923 /* Restore the state of local_variables_forbidden_p. */
27926 /* Restore the queue. */
27928 }
27930 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27932 sizeof ... ( identifier )
27934 where the 'sizeof' token has already been consumed. */
27936 static tree
27938 {
27939 /* Consume the `...'. */
27943 matching_parens parens;
27947 else
27955 /* The name is not qualified. */
27974 }
27976 /* Parse the operand of `sizeof' (or a similar operator). Returns
27977 either a TYPE or an expression, depending on the form of the
27978 input. The KEYWORD indicates which kind of expression we have
27979 encountered. */
27981 static tree
27983 {
27990 /* If it's a `...', then we are computing the length of a parameter
27991 pack. */
27996 /* Types cannot be defined in a `sizeof' expression. Save away the
27997 old message. */
27999 /* And create the new one. */
28005 /* The restrictions on constant-expressions do not apply inside
28006 sizeof expressions. */
28007 saved_integral_constant_expression_p
28009 saved_non_integral_constant_expression_p
28013 /* Do not actually evaluate the expression. */
28016 /* If it's a `(', then we might be looking at the type-id
28017 construction. */
28019 {
28022 /* We can't be sure yet whether we're looking at a type-id or an
28023 expression. */
28026 matching_parens parens;
28029 /* Note: as a GNU Extension, compound literals are considered
28030 postfix-expressions as they are in C99, so they are valid
28031 arguments to sizeof. See comment in cp_parser_cast_expression
28032 for details. */
28035 else
28036 {
28039 /* Look for the type-id. */
28041 /* Look for the closing `)'. */
28044 }
28046 /* If all went well, then we're done. */
28048 {
28049 cp_decl_specifier_seq decl_specs;
28051 /* Build a trivial decl-specifier-seq. */
28055 /* Call grokdeclarator to figure out what type this is. */
28058 TYPENAME,
28061 }
28062 }
28064 /* If the type-id production did not work out, then we must be
28065 looking at the unary-expression production. */
28069 /* Go back to evaluating expressions. */
28073 /* Free the message we created. */
28075 /* And restore the old one. */
28077 parser->integral_constant_expression_p
28079 parser->non_integral_constant_expression_p
28083 }
28085 /* If the current declaration has no declarator, return true. */
28087 static bool
28089 {
28090 /* If the next token is a `;' or a `,' then there is no
28091 declarator. */
28094 }
28096 /* Update the DECL_SPECS to reflect the storage class indicated by
28097 KEYWORD. */
28099 static void
28104 {
28105 cp_storage_class storage_class;
28108 {
28112 }
28114 {
28117 }
28122 {
28125 }
28128 {
28146 }
28150 /* A storage class specifier cannot be applied alongside a typedef
28151 specifier. If there is a typedef specifier present then set
28152 conflicting_specifiers_p which will trigger an error later
28153 on in grokdeclarator. */
28156 }
28158 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28159 is true, the type is a class or enum definition. */
28161 static void
28163 tree type_spec,
28166 {
28169 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28170 (with, for example, in "typedef int wchar_t;") we remember that
28171 this is what happened. In system headers, we ignore these
28172 declarations so that G++ can work with system headers that are not
28173 C++-safe. */
28175 && !type_definition_p
28185 {
28188 ds_redefined_builtin_type_spec,
28189 token);
28191 {
28195 }
28196 }
28199 else
28200 {
28205 }
28206 }
28208 /* True iff TOKEN is the GNU keyword __thread. */
28210 static bool
28212 {
28215 }
28217 /* Set the location for a declarator specifier and check if it is
28218 duplicated.
28220 DECL_SPECS is the sequence of declarator specifiers onto which to
28221 set the location.
28223 DS is the single declarator specifier to set which location is to
28224 be set onto the existing sequence of declarators.
28226 LOCATION is the location for the declarator specifier to
28227 consider. */
28229 static void
28232 {
28241 {
28245 }
28246 else
28247 {
28249 {
28253 else
28254 {
28257 OPT_Wlong_long,
28259 }
28260 }
28262 {
28267 else
28268 {
28272 }
28273 }
28274 else
28275 {
28291 "__complex"
28292 };
28296 }
28297 }
28298 }
28300 /* Return true iff the declarator specifier DS is present in the
28301 sequence of declarator specifiers DECL_SPECS. */
28303 bool
28305 cp_decl_spec ds)
28306 {
28313 }
28315 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28316 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28318 static bool
28320 {
28322 }
28324 /* Issue an error message indicating that TOKEN_DESC was expected.
28325 If KEYWORD is true, it indicated this function is called by
28326 cp_parser_require_keword and the required token can only be
28327 a indicated keyword.
28329 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28330 within any error as the location of an "opening" token matching
28331 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28332 RT_CLOSE_PAREN). */
28334 static void
28336 required_token token_desc,
28338 location_t matching_location)
28339 {
28345 {
28414 }
28417 {
28419 {
28497 }
28498 }
28502 }
28505 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28506 issue an error message indicating that TOKEN_DESC was expected.
28508 Returns the token consumed, if the token had the appropriate type.
28509 Otherwise, returns NULL.
28511 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28512 within any error as the location of an "opening" token matching
28513 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28514 RT_CLOSE_PAREN). */
28519 required_token token_desc,
28520 location_t matching_location)
28521 {
28524 else
28525 {
28526 /* Output the MESSAGE -- unless we're parsing tentatively. */
28529 matching_location);
28531 }
28532 }
28534 /* An error message is produced if the next token is not '>'.
28535 All further tokens are skipped until the desired token is
28536 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28538 static void
28540 {
28541 /* Current level of '< ... >'. */
28543 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28546 /* Are we ready, yet? If not, issue error message. */
28550 /* Skip tokens until the desired token is found. */
28552 {
28553 /* Peek at the next token. */
28555 {
28563 /* C++0x views the `>>' operator as two `>' tokens, but
28564 C++98 does not. */
28567 {
28568 /* We've hit a `>>' where the first `>' closes the
28569 template argument list, and the second `>' is
28570 spurious. Just consume the `>>' and stop; we've
28571 already produced at least one error. */
28574 }
28575 /* Fall through for C++0x, so we handle the second `>' in
28576 the `>>'. */
28581 {
28582 /* We've reached the token we want, consume it and stop. */
28585 }
28604 /* The '>' was probably forgotten, don't look further. */
28609 }
28611 /* Consume this token. */
28613 }
28614 }
28616 /* If the next token is the indicated keyword, consume it. Otherwise,
28617 issue an error message indicating that TOKEN_DESC was expected.
28619 Returns the token consumed, if the token had the appropriate type.
28620 Otherwise, returns NULL. */
28625 required_token token_desc)
28626 {
28630 {
28632 UNKNOWN_LOCATION);
28634 }
28637 }
28639 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28640 function-definition. */
28642 static bool
28644 {
28647 /* A ctor-initializer begins with a `:'. */
28649 /* A function-try-block begins with `try'. */
28651 /* A function-transaction-block begins with `__transaction_atomic'
28652 or `__transaction_relaxed'. */
28655 /* The named return value extension begins with `return'. */
28657 }
28659 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28660 definition. */
28662 static bool
28664 {
28671 }
28673 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28674 C++0x) ending a template-argument. */
28676 static bool
28678 {
28686 }
28688 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28689 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28691 static bool
28694 {
28700 /* Check for the sequence `<::' in the original code. It would be lexed as
28701 `[:', where `[' is a digraph, and there is no whitespace before
28702 `:'. */
28704 {
28709 }
28711 }
28713 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28714 or none_type otherwise. */
28716 static enum tag_types
28718 {
28720 {
28730 }
28731 }
28733 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28734 or none_type otherwise or if the token is null. */
28736 static enum tag_types
28738 {
28743 {
28751 }
28752 }
28754 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28756 static void
28758 {
28762 {
28766 type))
28769 }
28770 }
28772 /* Issue an error message if DECL is redeclared with different
28773 access than its original declaration [class.access.spec/3].
28774 This applies to nested classes, nested class templates and
28775 enumerations [class.mem/1]. */
28777 static void
28779 {
28790 }
28792 /* Look for the `template' keyword, as a syntactic disambiguator.
28793 Return TRUE iff it is present, in which case it will be
28794 consumed. */
28796 static bool
28798 {
28800 {
28801 /* In C++98 the `template' keyword can only be used within templates;
28802 outside templates the parser can always figure out what is a
28803 template and what is not. In C++11, per the resolution of DR 468,
28804 `template' is allowed in cases where it is not strictly necessary. */
28807 {
28810 "in C++98 %<template%> (as a disambiguator) is only "
28812 /* If this part of the token stream is rescanned, the same
28813 error message would be generated. So, we purge the token
28814 from the stream. */
28817 }
28818 else
28819 {
28820 /* Consume the `template' keyword. */
28823 }
28824 }
28826 }
28828 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28829 set PARSER->SCOPE, and perform other related actions. */
28831 static void
28833 {
28836 /* Get the stored value. */
28838 /* Set the scope from the stored value. */
28842 }
28844 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28845 encounter the end of a block before what we were looking for. */
28847 static bool
28851 {
28853 {
28856 /* Abort a parenthesized expression if we encounter a semicolon. */
28860 /* If we've reached the end of the file, stop. */
28866 /* We've hit the end of an enclosing block, so there's been some
28867 kind of syntax error. */
28870 /* Consume the token. */
28872 /* See if it starts a new group. */
28874 {
28876 /* In theory this should probably check end == '}', but
28877 cp_parser_save_member_function_body needs it to exit
28878 after either '}' or ')' when called with ')'. */
28881 }
28883 {
28887 }
28892 }
28893 }
28895 /* Like above, for caching a default argument or NSDMI. Both of these are
28896 terminated by a non-nested comma, but it can be unclear whether or not a
28897 comma is nested in a template argument list unless we do more parsing.
28898 In order to handle this ambiguity, when we encounter a ',' after a '<'
28899 we try to parse what follows as a parameter-declaration-list (in the
28900 case of a default argument) or a member-declarator (in the case of an
28901 NSDMI). If that succeeds, then we stop caching. */
28903 static tree
28905 {
28910 tree default_argument;
28912 /* Add tokens until we have processed the entire default
28913 argument. We add the range [first_token, token). */
28916 {
28917 /* For list-initialization, this is straightforward. */
28920 }
28922 {
28925 /* Peek at the next token. */
28927 /* What we do depends on what token we have. */
28929 {
28930 /* In valid code, a default argument must be
28931 immediately followed by a `,' `)', or `...'. */
28934 {
28935 /* If we've seen a '<', we might be in a
28936 template-argument-list. Until Core issue 325 is
28937 resolved, we don't know how this situation ought
28938 to be handled, so try to DTRT. We check whether
28939 what comes after the comma is a valid parameter
28940 declaration list. If it is, then the comma ends
28941 the default argument; otherwise the default
28942 argument continues. */
28946 /* Set ITALP so cp_parser_parameter_declaration_list
28947 doesn't decide to commit to this parse. */
28954 {
28955 /* Parse declarators until we reach a non-comma or
28956 somthing that cannot be an initializer.
28957 Just checking whether we're looking at a single
28958 declarator is insufficient. Consider:
28959 int var = tuple<T,U>::x;
28960 The template parameter 'U' looks exactly like a
28961 declarator. */
28962 do
28963 {
28974 }
28976 /* If we met an '=' or ';' then the original comma
28977 was the end of the NSDMI. Otherwise assume
28978 we're still in the NSDMI. */
28981 }
28982 else
28983 {
28988 }
28995 }
28996 /* FALLTHRU */
28999 /* If we run into a non-nested `;', `}', or `]',
29000 then the code is invalid -- but the default
29001 argument is certainly over. */
29006 /* Handle correctly int n = sizeof ... ( p ); */
29009 /* Update DEPTH, if necessary. */
29024 /* This might be the comparison operator, or it might
29025 start a template argument list. */
29032 /* Fall through for C++0x, which treats the `>>'
29033 operator like two `>' tokens in certain
29034 cases. */
29039 {
29040 /* This might be an operator, or it might close a
29041 template argument list. But if a previous '<'
29042 started a template argument list, this will have
29043 closed it, so we can't be in one anymore. */
29047 }
29050 /* If we run out of tokens, issue an error message. */
29058 /* In these cases, we should look for template-ids.
29059 For example, if the default argument is
29060 `X<int, double>()', we need to do name lookup to
29061 figure out whether or not `X' is a template; if
29062 so, the `,' does not end the default argument.
29064 That is not yet done. */
29069 }
29071 /* If we've reached the end, stop. */
29075 /* Add the token to the token block. */
29077 }
29079 /* Create a DEFAULT_ARG to represent the unparsed default
29080 argument. */
29087 }
29089 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29091 location_t
29093 {
29098 }
29100 /* Begin parsing tentatively. We always save tokens while parsing
29101 tentatively so that if the tentative parsing fails we can restore the
29102 tokens. */
29104 static void
29106 {
29107 /* Enter a new parsing context. */
29109 /* Begin saving tokens. */
29111 /* In order to avoid repetitive access control error messages,
29112 access checks are queued up until we are no longer parsing
29113 tentatively. */
29115 }
29117 /* Commit to the currently active tentative parse. */
29119 static void
29121 {
29125 /* Mark all of the levels as committed. */
29128 {
29135 }
29136 }
29138 /* Commit to the topmost currently active tentative parse.
29140 Note that this function shouldn't be called when there are
29141 irreversible side-effects while in a tentative state. For
29142 example, we shouldn't create a permanent entry in the symbol
29143 table, or issue an error message that might not apply if the
29144 tentative parse is aborted. */
29146 static void
29148 {
29153 {
29161 }
29162 }
29164 /* Abort the currently active tentative parse. All consumed tokens
29165 will be rolled back, and no diagnostics will be issued. */
29167 static void
29169 {
29173 /* Now, pretend that we want to see if the construct was
29174 successfully parsed. */
29176 }
29178 /* Stop parsing tentatively. If a parse error has occurred, restore the
29179 token stream. Otherwise, commit to the tokens we have consumed.
29180 Returns true if no error occurred; false otherwise. */
29182 static bool
29184 {
29188 /* Remember whether or not an error occurred, since we are about to
29189 destroy that information. */
29191 /* Remove the topmost context from the stack. */
29194 /* If no parse errors occurred, commit to the tentative parse. */
29196 {
29197 /* Commit to the tokens read tentatively, unless that was
29198 already done. */
29203 }
29204 /* Otherwise, if errors occurred, roll back our state so that things
29205 are just as they were before we began the tentative parse. */
29206 else
29207 {
29210 }
29211 /* Add the context to the front of the free list. */
29216 }
29218 /* Returns true if we are parsing tentatively and are not committed to
29219 this tentative parse. */
29221 static bool
29223 {
29226 }
29228 /* Returns nonzero iff an error has occurred during the most recent
29229 tentative parse. */
29231 static bool
29233 {
29236 }
29238 /* Returns nonzero if GNU extensions are allowed. */
29240 static bool
29242 {
29244 }
29245 \f
29246 /* Objective-C++ Productions */
29249 /* Parse an Objective-C expression, which feeds into a primary-expression
29250 above.
29252 objc-expression:
29253 objc-message-expression
29254 objc-string-literal
29255 objc-encode-expression
29256 objc-protocol-expression
29257 objc-selector-expression
29259 Returns a tree representation of the expression. */
29261 static cp_expr
29263 {
29264 /* Try to figure out what kind of declaration is present. */
29268 {
29278 {
29290 }
29291 /* FALLTHRU */
29297 }
29300 }
29302 /* Parse an Objective-C message expression.
29304 objc-message-expression:
29305 [ objc-message-receiver objc-message-args ]
29307 Returns a representation of an Objective-C message. */
29309 static tree
29311 {
29323 /* Construct a location e.g.
29324 [self func1:5]
29325 ^~~~~~~~~~~~~~
29326 ranging from the '[' to the ']', with the caret at the start. */
29331 }
29333 /* Parse an objc-message-receiver.
29335 objc-message-receiver:
29336 expression
29337 simple-type-specifier
29339 Returns a representation of the type or expression. */
29341 static tree
29343 {
29344 tree rcv;
29346 /* An Objective-C message receiver may be either (1) a type
29347 or (2) an expression. */
29351 /* If that worked out, fine. */
29358 CP_PARSER_FLAGS_NONE);
29365 }
29367 /* Parse the arguments and selectors comprising an Objective-C message.
29369 objc-message-args:
29370 objc-selector
29371 objc-selector-args
29372 objc-selector-args , objc-comma-args
29374 objc-selector-args:
29375 objc-selector [opt] : assignment-expression
29376 objc-selector-args objc-selector [opt] : assignment-expression
29378 objc-comma-args:
29379 assignment-expression
29380 objc-comma-args , assignment-expression
29382 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29383 selector arguments and TREE_VALUE containing a list of comma
29384 arguments. */
29386 static tree
29388 {
29394 {
29400 /* Detect if we have a unary selector. */
29409 sel_args
29414 }
29416 /* Handle non-selector arguments, if any. */
29418 {
29419 tree arg;
29424 addl_args
29429 }
29432 {
29435 }
29438 }
29440 /* Parse an Objective-C encode expression.
29442 objc-encode-expression:
29443 @encode objc-typename
29445 Returns an encoded representation of the type argument. */
29447 static cp_expr
29449 {
29450 tree type;
29455 matching_parens parens;
29462 {
29466 }
29468 /* This happens if we find @encode(T) (where T is a template
29469 typename or something dependent on a template typename) when
29470 parsing a template. In that case, we can't compile it
29471 immediately, but we rather create an AT_ENCODE_EXPR which will
29472 need to be instantiated when the template is used.
29473 */
29475 {
29479 }
29482 /* Build a location of the form:
29483 @encode(int)
29484 ^~~~~~~~~~~~
29485 with caret==start at the @ token, finishing at the close paren. */
29486 location_t combined_loc
29491 }
29493 /* Parse an Objective-C @defs expression. */
29495 static tree
29497 {
29498 tree name;
29501 matching_parens parens;
29507 }
29509 /* Parse an Objective-C protocol expression.
29511 objc-protocol-expression:
29512 @protocol ( identifier )
29514 Returns a representation of the protocol expression. */
29516 static tree
29518 {
29519 tree proto;
29523 matching_parens parens;
29528 /* Build a location of the form:
29529 @protocol(prot)
29530 ^~~~~~~~~~~~~~~
29531 with caret==start at the @ token, finishing at the close paren. */
29532 location_t combined_loc
29538 }
29540 /* Parse an Objective-C selector expression.
29542 objc-selector-expression:
29543 @selector ( objc-method-signature )
29545 objc-method-signature:
29546 objc-selector
29547 objc-selector-seq
29549 objc-selector-seq:
29550 objc-selector :
29551 objc-selector-seq objc-selector :
29553 Returns a representation of the method selector. */
29555 static tree
29557 {
29564 matching_parens parens;
29570 {
29579 {
29580 /* Detect if we have a unary selector. */
29582 {
29585 }
29586 else
29587 {
29589 }
29590 }
29595 {
29596 sel_seq
29599 sel_seq
29602 }
29603 else
29604 sel_seq
29609 }
29611 finish_selector:
29615 /* Build a location of the form:
29616 @selector(func)
29617 ^~~~~~~~~~~~~~~
29618 with caret==start at the @ token, finishing at the close paren. */
29619 location_t combined_loc
29623 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29626 }
29628 /* Parse a list of identifiers.
29630 objc-identifier-list:
29631 identifier
29632 objc-identifier-list , identifier
29634 Returns a TREE_LIST of identifier nodes. */
29636 static tree
29638 {
29639 tree identifier;
29640 tree list;
29651 {
29658 identifier));
29660 }
29663 }
29665 /* Parse an Objective-C alias declaration.
29667 objc-alias-declaration:
29668 @compatibility_alias identifier identifier ;
29670 This function registers the alias mapping with the Objective-C front end.
29671 It returns nothing. */
29673 static void
29675 {
29683 }
29685 /* Parse an Objective-C class forward-declaration.
29687 objc-class-declaration:
29688 @class objc-identifier-list ;
29690 The function registers the forward declarations with the Objective-C
29691 front end. It returns nothing. */
29693 static void
29695 {
29698 {
29699 tree id;
29709 else
29711 }
29713 }
29715 /* Parse a list of Objective-C protocol references.
29717 objc-protocol-refs-opt:
29718 objc-protocol-refs [opt]
29720 objc-protocol-refs:
29721 < objc-identifier-list >
29723 Returns a TREE_LIST of identifiers, if any. */
29725 static tree
29727 {
29731 {
29735 }
29738 }
29740 /* Parse a Objective-C visibility specification. */
29742 static void
29744 {
29748 {
29763 }
29765 /* Eat '@private'/'@protected'/'@public'. */
29767 }
29769 /* Parse an Objective-C method type. Return 'true' if it is a class
29770 (+) method, and 'false' if it is an instance (-) method. */
29774 {
29777 else
29779 }
29781 /* Parse an Objective-C protocol qualifier. */
29783 static tree
29785 {
29798 {
29803 }
29806 }
29808 /* Parse an Objective-C typename. */
29810 static tree
29812 {
29816 {
29819 matching_parens parens;
29823 /* An ObjC type name may consist of just protocol qualifiers, in which
29824 case the type shall default to 'id'. */
29826 {
29829 /* If the type could not be parsed, an error has already
29830 been produced. For error recovery, behave as if it had
29831 not been specified, which will use the default type
29832 'id'. */
29834 {
29836 /* We need to skip to the closing parenthesis as
29837 cp_parser_type_id() does not seem to do it for
29838 us. */
29843 }
29844 }
29848 }
29851 }
29853 /* Check to see if TYPE refers to an Objective-C selector name. */
29855 static bool
29857 {
29863 }
29865 /* Parse an Objective-C selector. */
29867 static tree
29869 {
29873 {
29876 }
29878 /* C++ operator names are allowed to appear in ObjC selectors. */
29880 {
29893 }
29894 }
29896 /* Parse an Objective-C params list. */
29898 static tree
29900 {
29906 {
29916 /* Detect if we have a unary selector. */
29919 {
29922 }
29926 {
29927 /* Something went quite wrong. There should be a colon
29928 here, but there is not. Stop parsing parameters. */
29930 }
29932 /* New ObjC allows attributes on parameters too. */
29937 params
29940 type_name,
29941 identifier,
29942 parm_attr));
29945 }
29948 {
29951 }
29953 /* We allow tail attributes for the method. */
29955 {
29963 }
29966 {
29969 }
29971 }
29973 /* Parse the non-keyword Objective-C params. */
29975 static tree
29978 {
29984 {
29986 tree parm;
29992 {
29997 }
29999 /* TODO: parse attributes for tail parameters. */
30008 }
30010 /* We allow tail attributes for the method. */
30012 {
30014 {
30019 }
30020 else
30021 /* We have an error, but parse the attributes, so that we can
30022 carry on. */
30028 }
30031 }
30033 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30035 static void
30037 {
30040 /* If the next token is `extern' and the following token is a string
30041 literal, then we have a linkage specification. */
30043 && cp_parser_is_pure_string_literal
30046 /* Handle #pragma, if any. */
30049 /* Allow stray semicolons. */
30052 /* Mark methods as optional or required, when building protocols. */
30054 {
30057 }
30059 {
30062 }
30065 /* Other stray characters must generate errors. */
30067 {
30071 }
30072 /* Finally, try to parse a block-declaration, or a function-definition. */
30073 else
30075 }
30077 /* Parse a method signature. */
30079 static tree
30081 {
30097 }
30099 static bool
30101 {
30102 tree tattr;
30107 /* If the attributes are followed by a method introducer, this is not allowed.
30108 Dump the attributes and flag the situation. */
30113 /* Otherwise, the attributes introduce some interstitial code, possibly so
30114 rewind to allow that check. */
30117 }
30119 /* Parse an Objective-C method prototype list. */
30121 static void
30123 {
30127 {
30129 {
30134 else
30138 {
30142 }
30145 }
30151 OPT_Wattributes,
30153 else
30154 /* Allow for interspersed non-ObjC++ code. */
30158 }
30162 else
30166 }
30168 /* Parse an Objective-C method definition list. */
30170 static void
30172 {
30176 {
30177 tree meth;
30180 {
30186 else
30191 {
30195 }
30197 NULL_TREE);
30199 /* For historical reasons, we accept an optional semicolon. */
30206 {
30213 }
30214 }
30215 /* The following case will be removed once @synthesize is
30216 completely implemented. */
30227 else
30228 /* Allow for interspersed non-ObjC++ code. */
30232 }
30236 else
30240 }
30242 /* Parse Objective-C ivars. */
30244 static void
30246 {
30257 {
30258 cp_decl_specifier_seq declspecs;
30260 tree prefix_attributes;
30268 CP_PARSER_FLAGS_OPTIONAL,
30272 /* auto, register, static, extern, mutable. */
30274 {
30277 }
30279 /* thread_local. */
30281 {
30284 }
30286 /* typedef. */
30288 {
30291 }
30296 /* Keep going until we hit the `;' at the end of the
30297 declaration. */
30299 {
30304 /* Check for a (possibly unnamed) bitfield declaration. */
30312 {
30313 /* Get the name of the bitfield. */
30316 sfk_none);
30318 eat_colon:
30320 /* Get the width of the bitfield. */
30321 width
30323 }
30324 else
30325 {
30326 /* Parse the declarator. */
30327 declarator
30333 }
30335 /* Look for attributes that apply to the ivar. */
30337 /* Remember which attributes are prefix attributes and
30338 which are not. */
30340 /* Combine the attributes. */
30344 /* Create the bitfield declaration. */
30347 else
30352 /* Add the instance variable. */
30356 /* Reset PREFIX_ATTRIBUTES. */
30358 {
30363 }
30368 {
30371 }
30373 }
30377 }
30382 /* Do not consume the RID_AT_END, so it will be read again as terminating
30383 the @interface of @implementation. */
30387 /* For historical reasons, we accept an optional semicolon. */
30390 }
30392 /* Parse an Objective-C protocol declaration. */
30394 static void
30396 {
30402 {
30407 }
30409 /* See if we have a forward declaration or a definition. */
30412 /* Try a forward declaration first. */
30414 {
30416 {
30417 tree id;
30427 else
30429 }
30431 }
30433 /* Ok, we got a full-fledged definition (or at least should). */
30434 else
30435 {
30440 }
30441 }
30443 /* Parse an Objective-C superclass or category. */
30445 static void
30450 {
30456 {
30459 }
30461 {
30462 matching_parens parens;
30465 /* If there is no category name, and this is an @interface, we
30466 have a class extension. */
30468 {
30471 }
30472 else
30476 }
30477 }
30479 /* Parse an Objective-C class interface. */
30481 static void
30483 {
30490 {
30491 /* It's hard to recover because even if valid @interface stuff
30492 is to follow, we can't compile it (or validate it) if we
30493 don't even know which class it refers to. Let's assume this
30494 was a stray '@interface' token in the stream and skip it.
30495 */
30497 }
30502 /* We have either a class or a category on our hands. */
30505 else
30506 {
30508 /* Handle instance variable declarations, if any. */
30511 }
30514 }
30516 /* Parse an Objective-C class implementation. */
30518 static void
30520 {
30527 {
30528 /* It's hard to recover because even if valid @implementation
30529 stuff is to follow, we can't compile it (or validate it) if
30530 we don't even know which class it refers to. Let's assume
30531 this was a stray '@implementation' token in the stream and
30532 skip it.
30533 */
30535 }
30539 /* We have either a class or a category on our hands. */
30542 else
30543 {
30545 /* Handle instance variable declarations, if any. */
30548 }
30551 }
30553 /* Consume the @end token and finish off the implementation. */
30555 static void
30557 {
30560 }
30562 /* Parse an Objective-C declaration. */
30564 static void
30566 {
30567 /* Try to figure out what kind of declaration is present. */
30572 {
30588 }
30591 {
30614 }
30615 }
30617 /* Parse an Objective-C try-catch-finally statement.
30619 objc-try-catch-finally-stmt:
30620 @try compound-statement objc-catch-clause-seq [opt]
30621 objc-finally-clause [opt]
30623 objc-catch-clause-seq:
30624 objc-catch-clause objc-catch-clause-seq [opt]
30626 objc-catch-clause:
30627 @catch ( objc-exception-declaration ) compound-statement
30629 objc-finally-clause:
30630 @finally compound-statement
30632 objc-exception-declaration:
30633 parameter-declaration
30634 '...'
30636 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30638 Returns NULL_TREE.
30640 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30641 for C. Keep them in sync. */
30643 static tree
30645 {
30646 location_t location;
30647 tree stmt;
30652 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30653 node, lest it get absorbed into the surrounding block. */
30659 {
30663 matching_parens parens;
30669 {
30670 /* We have "@catch (...)" (where the '...' are literally
30671 what is in the code). Skip the '...'.
30672 parameter_declaration is set to NULL_TREE, and
30673 objc_being_catch_clauses() knows that that means
30674 '...'. */
30677 }
30678 else
30679 {
30680 /* We have "@catch (NSException *exception)" or something
30681 like that. Parse the parameter declaration. */
30685 else
30690 }
30693 else
30694 {
30695 /* If there was no open parenthesis, we are recovering from
30696 an error, and we are trying to figure out what mistake
30697 the user has made. */
30699 /* If there is an immediate closing parenthesis, the user
30700 probably forgot the opening one (ie, they typed "@catch
30701 NSException *e)". Parse the closing parenthesis and keep
30702 going. */
30706 /* If these is no immediate closing parenthesis, the user
30707 probably doesn't know that parenthesis are required at
30708 all (ie, they typed "@catch NSException *e"). So, just
30709 forget about the closing parenthesis and keep going. */
30710 }
30714 }
30716 {
30719 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30720 node, lest it get absorbed into the surrounding block. */
30724 }
30727 }
30729 /* Parse an Objective-C synchronized statement.
30731 objc-synchronized-stmt:
30732 @synchronized ( expression ) compound-statement
30734 Returns NULL_TREE. */
30736 static tree
30738 {
30739 location_t location;
30746 matching_parens parens;
30751 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30752 node, lest it get absorbed into the surrounding block. */
30757 }
30759 /* Parse an Objective-C throw statement.
30761 objc-throw-stmt:
30762 @throw assignment-expression [opt] ;
30764 Returns a constructed '@throw' statement. */
30766 static tree
30768 {
30780 }
30782 /* Parse an Objective-C statement. */
30784 static tree
30786 {
30787 /* Try to figure out what kind of declaration is present. */
30791 {
30802 }
30805 }
30807 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30808 look ahead to see if an objc keyword follows the attributes. This
30809 is to detect the use of prefix attributes on ObjC @interface and
30810 @protocol. */
30812 static bool
30814 {
30819 {
30822 }
30825 }
30827 /* This routine is a minimal replacement for
30828 c_parser_struct_declaration () used when parsing the list of
30829 types/names or ObjC++ properties. For example, when parsing the
30830 code
30832 @property (readonly) int a, b, c;
30834 this function is responsible for parsing "int a, int b, int c" and
30835 returning the declarations as CHAIN of DECLs.
30837 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30838 similar parsing. */
30839 static tree
30841 {
30843 cp_decl_specifier_seq declspecs;
30845 tree prefix_attributes;
30848 CP_PARSER_FLAGS_NONE,
30855 /* auto, register, static, extern, mutable. */
30857 {
30860 }
30862 /* thread_local. */
30864 {
30867 }
30869 /* typedef. */
30871 {
30874 }
30879 /* Keep going until we hit the `;' at the end of the declaration. */
30881 {
30886 /* Parse the declarator. */
30890 /* Look for attributes that apply to the ivar. */
30892 /* Remember which attributes are prefix attributes and
30893 which are not. */
30895 /* Combine the attributes. */
30905 /* Reset PREFIX_ATTRIBUTES. */
30907 {
30912 }
30919 {
30922 }
30923 else
30925 }
30927 }
30929 /* Parse an Objective-C @property declaration. The syntax is:
30931 objc-property-declaration:
30932 '@property' objc-property-attributes[opt] struct-declaration ;
30934 objc-property-attributes:
30935 '(' objc-property-attribute-list ')'
30937 objc-property-attribute-list:
30938 objc-property-attribute
30939 objc-property-attribute-list, objc-property-attribute
30941 objc-property-attribute
30942 'getter' = identifier
30943 'setter' = identifier
30944 'readonly'
30945 'readwrite'
30946 'assign'
30947 'retain'
30948 'copy'
30949 'nonatomic'
30951 For example:
30952 @property NSString *name;
30953 @property (readonly) id object;
30954 @property (retain, nonatomic, getter=getTheName) id name;
30955 @property int a, b, c;
30957 PS: This function is identical to
30958 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30959 static void
30961 {
30962 /* The following variables hold the attributes of the properties as
30963 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30964 seen. When we see an attribute, we set them to 'true' (if they
30965 are boolean properties) or to the identifier (if they have an
30966 argument, ie, for getter and setter). Note that here we only
30967 parse the list of attributes, check the syntax and accumulate the
30968 attributes that we find. objc_add_property_declaration() will
30969 then process the information. */
30979 /* 'properties' is the list of properties that we read. Usually a
30980 single one, but maybe more (eg, in "@property int a, b, c;" there
30981 are three). */
30982 tree properties;
30983 location_t loc;
30989 /* Parse the optional attribute list... */
30991 {
30992 /* Eat the '('. */
30993 matching_parens parens;
30997 {
31003 {
31006 }
31010 {
31021 {
31025 else
31030 }
31033 {
31037 }
31039 {
31041 {
31044 }
31045 else
31049 else
31051 }
31052 else
31053 {
31055 {
31058 }
31059 else
31061 }
31067 }
31074 else
31076 }
31078 /* FIXME: "@property (setter, assign);" will generate a spurious
31079 "error: expected ‘)’ before ‘,’ token". This is because
31080 cp_parser_require, unlike the C counterpart, will produce an
31081 error even if we are in error recovery. */
31083 {
31088 }
31089 }
31091 /* ... and the property declaration(s). */
31095 {
31097 /* If the next token is now a `;', consume it. */
31101 }
31105 else
31106 {
31107 /* Comma-separated properties are chained together in
31108 reverse order; add them one by one. */
31117 }
31120 }
31122 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31124 objc-synthesize-declaration:
31125 @synthesize objc-synthesize-identifier-list ;
31127 objc-synthesize-identifier-list:
31128 objc-synthesize-identifier
31129 objc-synthesize-identifier-list, objc-synthesize-identifier
31131 objc-synthesize-identifier
31132 identifier
31133 identifier = identifier
31135 For example:
31136 @synthesize MyProperty;
31137 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31139 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31140 for C. Keep them in sync.
31141 */
31142 static void
31144 {
31146 location_t loc;
31151 {
31155 {
31158 }
31160 {
31164 {
31167 }
31168 }
31169 else
31174 else
31176 }
31179 }
31181 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31183 objc-dynamic-declaration:
31184 @dynamic identifier-list ;
31186 For example:
31187 @dynamic MyProperty;
31188 @dynamic MyProperty, AnotherProperty;
31190 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31191 for C. Keep them in sync.
31192 */
31193 static void
31195 {
31197 location_t loc;
31202 {
31203 tree property;
31206 {
31209 }
31213 else
31215 }
31218 }
31220 \f
31221 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31223 /* Returns name of the next clause.
31224 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31225 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31226 returned and the token is consumed. */
31228 static pragma_omp_clause
31230 {
31246 {
31251 {
31428 }
31429 }
31435 }
31437 /* Validate that a clause of the given type does not already exist. */
31439 static void
31442 {
31443 tree c;
31447 {
31450 }
31451 }
31453 /* OpenMP 2.5:
31454 variable-list:
31455 identifier
31456 variable-list , identifier
31458 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31459 colon). An opening parenthesis will have been consumed by the caller.
31461 If KIND is nonzero, create the appropriate node and install the decl
31462 in OMP_CLAUSE_DECL and add the node to the head of the list.
31464 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31465 return the list created.
31467 COLON can be NULL if only closing parenthesis should end the list,
31468 or pointer to bool which will receive false if the list is terminated
31469 by closing parenthesis or true if the list is terminated by colon. */
31471 static tree
31474 {
31478 {
31481 }
31483 {
31488 && current_class_ptr
31490 {
31496 }
31497 else
31498 {
31509 else
31514 }
31516 ;
31518 {
31520 {
31522 /* The OpenACC cache directive explicitly only allows "array
31523 elements or subarrays". */
31525 {
31529 }
31530 /* FALLTHROUGH. */
31535 {
31536 location_t loc
31541 decl
31545 }
31546 /* FALLTHROUGH. */
31550 {
31558 parser->colon_corrects_to_scope_p
31562 else
31563 {
31564 /* Look for `:'. */
31568 CPP_CLOSE_SQUARE))
31570 }
31571 /* Look for the closing `]'. */
31573 RT_CLOSE_SQUARE))
31577 }
31581 }
31587 }
31588 else
31591 get_comma:
31595 }
31601 {
31605 }
31608 {
31611 /* Try to resync to an unnested comma. Copied from
31612 cp_parser_parenthesized_expression_list. */
31613 skip_comma:
31622 }
31625 }
31627 /* Similarly, but expect leading and trailing parenthesis. This is a very
31628 common case for omp clauses. */
31630 static tree
31632 {
31636 }
31638 /* OpenACC 2.0:
31639 copy ( variable-list )
31640 copyin ( variable-list )
31641 copyout ( variable-list )
31642 create ( variable-list )
31643 delete ( variable-list )
31644 present ( variable-list )
31645 present_or_copy ( variable-list )
31646 pcopy ( variable-list )
31647 present_or_copyin ( variable-list )
31648 pcopyin ( variable-list )
31649 present_or_copyout ( variable-list )
31650 pcopyout ( variable-list )
31651 present_or_create ( variable-list )
31652 pcreate ( variable-list ) */
31654 static tree
31656 tree list)
31657 {
31660 {
31706 }
31714 }
31716 /* OpenACC 2.0:
31717 deviceptr ( variable-list ) */
31719 static tree
31721 {
31725 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31726 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31727 variable-list must only allow for pointer variables. */
31730 {
31737 }
31740 }
31742 /* OpenACC 2.0:
31743 auto
31744 independent
31745 nohost
31746 seq */
31748 static tree
31752 {
31757 }
31759 /* OpenACC:
31760 num_gangs ( expression )
31761 num_workers ( expression )
31762 vector_length ( expression ) */
31764 static tree
31767 {
31770 matching_parens parens;
31778 {
31783 }
31791 }
31793 /* OpenACC:
31795 gang [( gang-arg-list )]
31796 worker [( [num:] int-expr )]
31797 vector [( [length:] int-expr )]
31799 where gang-arg is one of:
31801 [num:] int-expr
31802 static: size-expr
31804 and size-expr may be:
31806 *
31807 int-expr
31808 */
31810 static tree
31813 {
31823 {
31824 matching_parens parens;
31827 do
31828 {
31832 /* Gang static argument. */
31835 {
31843 {
31846 }
31848 /* Check for the '*' argument. */
31852 CPP_CLOSE_PAREN)))
31853 {
31858 {
31861 }
31863 }
31864 }
31865 /* Worker num: argument and vector length: arguments. */
31869 {
31872 }
31874 /* Now collect the actual argument. */
31876 {
31879 }
31891 {
31894 }
31896 }
31901 }
31915 cleanup_error:
31918 }
31920 /* OpenACC 2.0:
31921 tile ( size-expr-list ) */
31923 static tree
31925 {
31929 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31930 so, but the spec authors never considered such a case and have
31931 differing opinions on what it might mean, including 'not
31932 allowed'.) */
31935 clause_loc);
31940 do
31941 {
31948 {
31951 }
31952 else
31956 }
31959 /* Consume the trailing ')'. */
31967 }
31969 /* OpenACC 2.0
31970 Parse wait clause or directive parameters. */
31972 static tree
31974 {
31984 {
31989 }
31996 {
32000 {
32003 else
32004 {
32011 }
32012 }
32013 }
32016 }
32018 /* OpenACC:
32019 wait ( int-expr-list ) */
32021 static tree
32023 {
32032 }
32034 /* OpenMP 3.0:
32035 collapse ( constant-expression ) */
32037 static tree
32039 {
32041 location_t loc;
32042 HOST_WIDE_INT n;
32045 matching_parens parens;
32063 {
32066 }
32075 }
32077 /* OpenMP 2.5:
32078 default ( none | shared )
32080 OpenACC:
32081 default ( none | present ) */
32083 static tree
32086 {
32088 tree c;
32090 matching_parens parens;
32094 {
32099 {
32120 }
32123 }
32124 else
32125 {
32126 invalid_kind:
32129 else
32131 }
32148 }
32150 /* OpenMP 3.1:
32151 final ( expression ) */
32153 static tree
32155 {
32158 matching_parens parens;
32177 }
32179 /* OpenMP 2.5:
32180 if ( expression )
32182 OpenMP 4.5:
32183 if ( directive-name-modifier : expression )
32185 directive-name-modifier:
32186 parallel | task | taskloop | target data | target | target update
32187 | target enter data | target exit data */
32189 static tree
32192 {
32196 matching_parens parens;
32201 {
32213 {
32216 {
32229 else
32230 {
32231 location_t loc
32236 }
32239 {
32241 {
32246 }
32248 {
32249 location_t loc
32253 }
32254 }
32255 }
32256 }
32258 {
32260 {
32263 }
32264 else
32265 {
32267 {
32268 location_t loc
32271 }
32273 }
32274 }
32275 }
32287 {
32290 {
32293 {
32303 }
32305 p);
32307 }
32309 {
32312 else
32315 }
32318 {
32322 }
32323 }
32331 }
32333 /* OpenMP 3.1:
32334 mergeable */
32336 static tree
32339 {
32340 tree c;
32343 location);
32348 }
32350 /* OpenMP 2.5:
32351 nowait */
32353 static tree
32356 {
32357 tree c;
32364 }
32366 /* OpenMP 2.5:
32367 num_threads ( expression ) */
32369 static tree
32371 location_t location)
32372 {
32375 matching_parens parens;
32395 }
32397 /* OpenMP 4.5:
32398 num_tasks ( expression ) */
32400 static tree
32402 location_t location)
32403 {
32406 matching_parens parens;
32426 }
32428 /* OpenMP 4.5:
32429 grainsize ( expression ) */
32431 static tree
32433 location_t location)
32434 {
32437 matching_parens parens;
32457 }
32459 /* OpenMP 4.5:
32460 priority ( expression ) */
32462 static tree
32464 location_t location)
32465 {
32468 matching_parens parens;
32488 }
32490 /* OpenMP 4.5:
32491 hint ( expression ) */
32493 static tree
32495 location_t location)
32496 {
32499 matching_parens parens;
32518 }
32520 /* OpenMP 4.5:
32521 defaultmap ( tofrom : scalar ) */
32523 static tree
32525 location_t location)
32526 {
32530 matching_parens parens;
32535 {
32538 }
32542 {
32545 }
32551 {
32554 }
32558 {
32561 }
32567 location);
32573 out_err:
32578 }
32580 /* OpenMP 2.5:
32581 ordered
32583 OpenMP 4.5:
32584 ordered ( constant-expression ) */
32586 static tree
32589 {
32591 HOST_WIDE_INT n;
32597 {
32598 matching_parens parens;
32615 {
32617 "ordered argument needs positive constant integer "
32620 }
32621 }
32627 }
32629 /* OpenMP 2.5:
32630 reduction ( reduction-operator : variable-list )
32632 reduction-operator:
32633 One of: + * - & ^ | && ||
32635 OpenMP 3.1:
32637 reduction-operator:
32638 One of: + * - & ^ | && || min max
32640 OpenMP 4.0:
32642 reduction-operator:
32643 One of: + * - & ^ | && ||
32644 id-expression */
32646 static tree
32648 {
32656 {
32666 }
32670 else
32671 {
32682 {
32712 }
32713 else
32714 {
32716 resync_fail:
32721 }
32722 }
32728 NULL);
32730 {
32733 }
32736 }
32738 /* OpenMP 2.5:
32739 schedule ( schedule-kind )
32740 schedule ( schedule-kind , expression )
32742 schedule-kind:
32743 static | dynamic | guided | runtime | auto
32745 OpenMP 4.5:
32746 schedule ( schedule-modifier : schedule-kind )
32747 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32749 schedule-modifier:
32750 simd
32751 monotonic
32752 nonmonotonic */
32754 static tree
32756 {
32760 matching_parens parens;
32767 {
32776 else
32782 else
32783 {
32786 }
32787 }
32790 {
32795 {
32816 }
32817 }
32822 else
32828 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32830 {
32834 }
32837 {
32852 else
32857 }
32869 invalid_kind:
32871 resync_fail:
32876 }
32878 /* OpenMP 3.0:
32879 untied */
32881 static tree
32884 {
32885 tree c;
32892 }
32894 /* OpenMP 4.0:
32895 inbranch
32896 notinbranch */
32898 static tree
32901 {
32906 }
32908 /* OpenMP 4.0:
32909 parallel
32910 for
32911 sections
32912 taskgroup */
32914 static tree
32918 {
32922 }
32924 /* OpenMP 4.5:
32925 nogroup */
32927 static tree
32930 {
32935 }
32937 /* OpenMP 4.5:
32938 simd
32939 threads */
32941 static tree
32945 {
32950 }
32952 /* OpenMP 4.0:
32953 num_teams ( expression ) */
32955 static tree
32957 location_t location)
32958 {
32961 matching_parens parens;
32981 }
32983 /* OpenMP 4.0:
32984 thread_limit ( expression ) */
32986 static tree
32988 location_t location)
32989 {
32992 matching_parens parens;
33012 }
33014 /* OpenMP 4.0:
33015 aligned ( variable-list )
33016 aligned ( variable-list : constant-expression ) */
33018 static tree
33020 {
33024 matching_parens parens;
33032 {
33042 }
33048 }
33050 /* OpenMP 4.0:
33051 linear ( variable-list )
33052 linear ( variable-list : expression )
33054 OpenMP 4.5:
33055 linear ( modifier ( variable-list ) )
33056 linear ( modifier ( variable-list ) : expression ) */
33058 static tree
33061 {
33066 matching_parens parens;
33071 {
33083 else
33085 }
33090 else
33091 {
33100 }
33103 {
33108 {
33119 {
33122 }
33125 }
33136 }
33139 {
33142 }
33145 }
33147 /* OpenMP 4.0:
33148 safelen ( constant-expression ) */
33150 static tree
33152 location_t location)
33153 {
33156 matching_parens parens;
33175 }
33177 /* OpenMP 4.0:
33178 simdlen ( constant-expression ) */
33180 static tree
33182 location_t location)
33183 {
33186 matching_parens parens;
33205 }
33207 /* OpenMP 4.5:
33208 vec:
33209 identifier [+/- integer]
33210 vec , identifier [+/- integer]
33211 */
33213 static tree
33215 tree list)
33216 {
33220 {
33223 }
33226 {
33233 else
33234 {
33235 t = cp_parser_lookup_name_simple
33240 id_loc);
33241 }
33247 {
33250 }
33254 {
33257 }
33261 {
33264 }
33267 add_to_vector:
33269 {
33273 }
33279 }
33282 {
33288 }
33290 }
33292 /* OpenMP 4.0:
33293 depend ( depend-kind : variable-list )
33295 depend-kind:
33296 in | out | inout
33298 OpenMP 4.5:
33299 depend ( source )
33301 depend ( sink : vec ) */
33303 static tree
33305 {
33309 matching_parens parens;
33314 {
33328 else
33330 }
33331 else
33337 {
33347 }
33354 else
33355 {
33361 }
33364 invalid_kind:
33366 resync_fail:
33371 }
33373 /* OpenMP 4.0:
33374 map ( map-kind : variable-list )
33375 map ( variable-list )
33377 map-kind:
33378 alloc | to | from | tofrom
33380 OpenMP 4.5:
33381 map-kind:
33382 alloc | to | from | tofrom | release | delete
33384 map ( always [,] map-kind: variable-list ) */
33386 static tree
33388 {
33397 {
33402 {
33405 nth++;
33411 {
33416 }
33417 }
33418 }
33422 {
33436 else
33437 {
33443 }
33446 }
33449 {
33453 }
33456 NULL);
33462 }
33464 /* OpenMP 4.0:
33465 device ( expression ) */
33467 static tree
33469 location_t location)
33470 {
33473 matching_parens parens;
33493 }
33495 /* OpenMP 4.0:
33496 dist_schedule ( static )
33497 dist_schedule ( static , expression ) */
33499 static tree
33501 location_t location)
33502 {
33505 matching_parens parens;
33516 {
33527 }
33532 location);
33536 invalid_kind:
33538 resync_fail:
33543 }
33545 /* OpenMP 4.0:
33546 proc_bind ( proc-bind-kind )
33548 proc-bind-kind:
33549 master | close | spread */
33551 static tree
33553 location_t location)
33554 {
33555 tree c;
33562 {
33572 else
33574 }
33575 else
33584 location);
33589 invalid_kind:
33591 resync_fail:
33596 }
33598 /* OpenACC:
33599 async [( int-expr )] */
33601 static tree
33603 {
33610 {
33611 matching_parens parens;
33620 }
33630 }
33632 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33633 is a bitmask in MASK. Return the list of clauses found. */
33635 static tree
33639 {
33644 {
33645 location_t here;
33646 pragma_omp_clause c_kind;
33647 omp_clause_code code;
33658 {
33710 clauses);
33728 OMP_CLAUSE_INDEPENDENT,
33740 clauses);
33746 clauses);
33770 clauses);
33792 clauses);
33804 clauses);
33818 }
33823 {
33824 /* Remove the invalid clause(s) from the list to avoid
33825 confusing the rest of the compiler. */
33828 }
33829 }
33831 saw_error:
33838 }
33840 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33841 is a bitmask in MASK. Return the list of clauses found; the result
33842 of clause default goes in *pdefault. */
33844 static tree
33848 {
33854 {
33855 pragma_omp_clause c_kind;
33866 {
33878 clauses);
33892 clauses);
33912 clauses);
33917 clauses);
33927 clauses);
33961 clauses);
33975 clauses);
33990 OMP_CLAUSE_NOTINBRANCH,
33999 {
34000 clause_not_first:
34004 }
34034 clauses);
34035 else
34045 clauses);
34063 {
34068 }
34111 clauses
34117 clauses
34125 }
34130 {
34131 /* Remove the invalid clause(s) from the list to avoid
34132 confusing the rest of the compiler. */
34135 }
34136 }
34137 saw_error:
34140 {
34143 else
34145 }
34147 }
34149 /* OpenMP 2.5:
34150 structured-block:
34151 statement
34153 In practice, we're also interested in adding the statement to an
34154 outer node. So it is convenient if we work around the fact that
34155 cp_parser_statement calls add_stmt. */
34157 static unsigned
34159 {
34162 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34163 This preserves the "not within loop or switch" style error messages
34164 for nonsense cases like
34165 void foo() {
34166 #pragma omp single
34167 break;
34168 }
34169 */
34174 }
34176 static void
34178 {
34180 }
34182 static tree
34184 {
34192 }
34194 /* OpenMP 2.5:
34195 # pragma omp atomic new-line
34196 expression-stmt
34198 expression-stmt:
34199 x binop= expr | x++ | ++x | x-- | --x
34200 binop:
34201 +, *, -, /, &, ^, |, <<, >>
34203 where x is an lvalue expression with scalar type.
34205 OpenMP 3.1:
34206 # pragma omp atomic new-line
34207 update-stmt
34209 # pragma omp atomic read new-line
34210 read-stmt
34212 # pragma omp atomic write new-line
34213 write-stmt
34215 # pragma omp atomic update new-line
34216 update-stmt
34218 # pragma omp atomic capture new-line
34219 capture-stmt
34221 # pragma omp atomic capture new-line
34222 capture-block
34224 read-stmt:
34225 v = x
34226 write-stmt:
34227 x = expr
34228 update-stmt:
34229 expression-stmt | x = x binop expr
34230 capture-stmt:
34231 v = expression-stmt
34232 capture-block:
34233 { v = x; update-stmt; } | { update-stmt; v = x; }
34235 OpenMP 4.0:
34236 update-stmt:
34237 expression-stmt | x = x binop expr | x = expr binop x
34238 capture-stmt:
34239 v = update-stmt
34240 capture-block:
34241 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34243 where x and v are lvalue expressions with scalar type. */
34245 static void
34247 {
34255 {
34260 {
34266 }
34267 }
34269 {
34281 else
34285 }
34287 {
34293 {
34298 {
34301 }
34302 }
34303 }
34307 {
34317 else
34322 {
34323 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34324 opcode. */
34329 }
34333 {
34336 }
34337 else
34338 {
34344 }
34347 }
34349 restart:
34353 {
34360 /* FALLTHROUGH */
34370 /* FALLTHROUGH */
34385 /* Undo effects of boolean_increment for post {in,de}crement. */
34387 /* FALLTHRU */
34391 {
34392 /* Undo effects of boolean_increment. */
34394 {
34395 /* This is pre or post increment. */
34400 && !structured_block
34404 }
34405 }
34406 /* FALLTHRU */
34409 {
34444 {
34448 }
34451 {
34457 {
34462 }
34464 {
34476 {
34478 {
34483 }
34484 else
34486 }
34490 }
34493 {
34500 }
34504 }
34508 {
34511 {
34519 }
34521 {
34526 }
34561 }
34572 /* FALLTHROUGH */
34577 }
34584 }
34585 stmt_done:
34587 {
34598 }
34600 {
34603 }
34604 done:
34610 saw_error:
34613 {
34617 {
34621 }
34622 }
34623 }
34626 /* OpenMP 2.5:
34627 # pragma omp barrier new-line */
34629 static void
34631 {
34634 }
34636 /* OpenMP 2.5:
34637 # pragma omp critical [(name)] new-line
34638 structured-block
34640 OpenMP 4.5:
34641 # pragma omp critical [(name) [hint(expression)]] new-line
34642 structured-block */
34644 #define OMP_CRITICAL_CLAUSE_MASK \
34645 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34647 static tree
34649 {
34653 {
34654 matching_parens parens;
34668 OMP_CRITICAL_CLAUSE_MASK,
34670 }
34671 else
34676 }
34678 /* OpenMP 2.5:
34679 # pragma omp flush flush-vars[opt] new-line
34681 flush-vars:
34682 ( variable-list ) */
34684 static void
34686 {
34692 }
34694 /* Helper function, to parse omp for increment expression. */
34696 static tree
34698 {
34703 {
34706 }
34709 {
34716 /* Fall through: OpenMP disallows NE_EXPR. */
34720 }
34722 /* If decl is an iterator, preserve LHS and RHS of the relational
34723 expr until finish_omp_for. */
34734 }
34736 /* Helper function, to parse omp for increment expression. */
34738 static tree
34740 {
34744 cp_id_kind idk;
34748 {
34757 }
34766 {
34771 }
34778 {
34782 }
34795 do
34796 {
34803 {
34805 {
34808 else
34810 tf_warning_or_error);
34811 }
34812 else
34815 }
34816 }
34820 {
34826 }
34827 else
34831 }
34833 /* Parse the initialization statement of an OpenMP for loop.
34835 Return true if the resulting construct should have an
34836 OMP_CLAUSE_PRIVATE added to it. */
34838 static tree
34846 {
34852 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34854 init-expr:
34855 var = lb
34856 integer-type var = lb
34857 random-access-iterator-type var = lb
34858 pointer-type var = lb
34859 */
34860 cp_decl_specifier_seq type_specifiers;
34862 /* First, try to parse as an initialized declaration. See
34863 cp_parser_condition, from whence the bulk of this is copied. */
34870 {
34871 /* If parsing a type specifier seq succeeded, then this
34872 MUST be a initialized declaration. */
34877 CP_PARSER_DECLARATOR_NAMED,
34888 else
34889 {
34899 {
34901 CPP_OPEN_PAREN))
34904 else
34905 /* Trigger an error. */
34910 }
34914 {
34922 {
34925 auto_node);
34930 }
34933 asm_specification,
34934 LOOKUP_ONLYCONVERTING);
34937 {
34940 }
34941 else
34942 {
34945 {
34947 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34949 {
34953 {
34957 }
34959 }
34961 {
34966 }
34967 }
34968 }
34970 }
34971 else
34972 {
34973 /* Consume '='. */
34977 non_class:
34980 else
34983 asm_specification,
34984 LOOKUP_ONLYCONVERTING);
34985 }
34989 }
34990 }
34991 else
34992 {
34993 cp_id_kind idk;
34994 /* If parsing a type specifier sequence failed, then
34995 this MUST be a simple expression. */
35001 && decl
35004 {
35015 {
35020 }
35025 }
35027 && decl
35030 {
35031 tree rhs;
35039 rhs,
35040 tf_warning_or_error));
35043 }
35044 else
35045 {
35050 {
35054 }
35055 }
35056 }
35058 }
35060 /* Parse the restricted form of the for statement allowed by OpenMP. */
35062 static tree
35065 {
35069 location_t loc_first;
35080 {
35083 }
35086 {
35089 }
35092 {
35098 }
35100 {
35103 {
35105 "%<linear%> clause may not be specified together "
35108 }
35109 else
35111 }
35124 {
35127 location_t loc;
35130 {
35134 }
35137 matching_parens parens;
35144 add_private_clause
35150 {
35153 {
35159 }
35160 else
35162 }
35169 {
35174 {
35178 }
35181 {
35182 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35186 {
35189 }
35190 else
35191 {
35194 }
35196 }
35197 else
35198 {
35203 }
35204 }
35207 {
35208 tree c;
35210 {
35219 decl);
35223 decl);
35224 }
35226 {
35231 else
35236 {
35239 /* For linear, signal that we need to fill up
35240 the so far unknown linear step. */
35243 }
35244 }
35245 }
35254 {
35255 /* If decl is an iterator, preserve the operator on decl
35256 until finish_omp_for. */
35258 && ((processing_template_decl
35263 else
35267 }
35279 {
35282 }
35287 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35288 in between the collapsed for loops to be still considered perfectly
35289 nested. Hopefully the final version clarifies this.
35290 For now handle (multiple) {'s and empty statements. */
35293 {
35297 {
35299 bracecount++;
35300 }
35304 else
35305 {
35312 }
35313 }
35316 {
35319 }
35320 }
35325 /* Note that we saved the original contents of this flag when we entered
35326 the structured block, and so we don't need to re-save it here. */
35329 /* Note that the grammar doesn't call for a structured block here,
35330 though the loop as a whole is a structured block. */
35337 else
35342 {
35344 {
35346 nbraces--;
35347 }
35350 else
35351 {
35353 {
35356 }
35361 }
35362 }
35365 {
35369 else
35371 }
35375 }
35377 /* Helper function for OpenMP parsing, split clauses and call
35378 finish_omp_clauses on each of the set of clauses afterwards. */
35380 static void
35383 {
35389 }
35391 /* OpenMP 4.0:
35392 #pragma omp simd simd-clause[optseq] new-line
35393 for-loop */
35395 #define OMP_SIMD_CLAUSE_MASK \
35396 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35400 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35405 static tree
35409 {
35420 {
35424 OMP_CLAUSE_ORDERED);
35426 {
35428 "%<ordered%> clause with parameter may not be specified "
35431 }
35432 }
35443 }
35445 /* OpenMP 2.5:
35446 #pragma omp for for-clause[optseq] new-line
35447 for-loop
35449 OpenMP 4.0:
35450 #pragma omp for simd for-simd-clause[optseq] new-line
35451 for-loop */
35453 #define OMP_FOR_CLAUSE_MASK \
35454 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35464 static tree
35468 {
35475 /* parallel for{, simd} disallows nowait clause, but for
35476 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35479 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35484 {
35489 {
35513 }
35514 }
35516 {
35519 }
35521 /* Composite distribute parallel for disallows linear clause. */
35528 {
35531 }
35542 }
35544 /* OpenMP 2.5:
35545 # pragma omp master new-line
35546 structured-block */
35548 static tree
35550 {
35554 }
35556 /* OpenMP 2.5:
35557 # pragma omp ordered new-line
35558 structured-block
35560 OpenMP 4.5:
35561 # pragma omp ordered ordered-clauses new-line
35562 structured-block */
35564 #define OMP_ORDERED_CLAUSE_MASK \
35565 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35568 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35569 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35571 static bool
35574 {
35578 {
35583 {
35585 {
35588 }
35590 {
35592 "%<depend%> clause may only be used in compound "
35596 }
35597 tree clauses
35599 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35603 }
35604 }
35606 tree clauses
35617 }
35619 /* OpenMP 2.5:
35621 section-scope:
35622 { section-sequence }
35624 section-sequence:
35625 section-directive[opt] structured-block
35626 section-sequence section-directive structured-block */
35628 static tree
35630 {
35635 matching_braces braces;
35643 {
35647 }
35650 {
35658 {
35662 }
35664 {
35667 }
35672 }
35683 }
35685 /* OpenMP 2.5:
35686 # pragma omp sections sections-clause[optseq] newline
35687 sections-scope */
35689 #define OMP_SECTIONS_CLAUSE_MASK \
35690 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35691 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35696 static tree
35699 {
35711 {
35714 }
35721 }
35723 /* OpenMP 2.5:
35724 # pragma omp parallel parallel-clause[optseq] new-line
35725 structured-block
35726 # pragma omp parallel for parallel-for-clause[optseq] new-line
35727 structured-block
35728 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35729 structured-block
35731 OpenMP 4.0:
35732 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35733 structured-block */
35735 #define OMP_PARALLEL_CLAUSE_MASK \
35736 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35737 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35738 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35740 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35741 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35742 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35743 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35746 static tree
35750 {
35757 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35763 {
35771 if_p);
35775 if_p);
35778 block);
35783 }
35784 /* When combined with distribute, parallel has to be followed by for.
35785 #pragma omp target parallel is allowed though. */
35789 {
35793 }
35795 {
35798 }
35800 {
35804 {
35814 block);
35817 }
35818 }
35823 {
35826 }
35834 }
35836 /* OpenMP 2.5:
35837 # pragma omp single single-clause[optseq] new-line
35838 structured-block */
35840 #define OMP_SINGLE_CLAUSE_MASK \
35841 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35846 static tree
35848 {
35858 }
35860 /* OpenMP 3.0:
35861 # pragma omp task task-clause[optseq] new-line
35862 structured-block */
35864 #define OMP_TASK_CLAUSE_MASK \
35865 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35876 static tree
35878 {
35889 }
35891 /* OpenMP 3.0:
35892 # pragma omp taskwait new-line */
35894 static void
35896 {
35899 }
35901 /* OpenMP 3.1:
35902 # pragma omp taskyield new-line */
35904 static void
35906 {
35909 }
35911 /* OpenMP 4.0:
35912 # pragma omp taskgroup new-line
35913 structured-block */
35915 static tree
35917 {
35921 if_p));
35922 }
35925 /* OpenMP 2.5:
35926 # pragma omp threadprivate (variable-list) */
35928 static void
35930 {
35931 tree vars;
35937 }
35939 /* OpenMP 4.0:
35940 # pragma omp cancel cancel-clause[optseq] new-line */
35942 #define OMP_CANCEL_CLAUSE_MASK \
35943 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35945 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35946 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35947 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35949 static void
35951 {
35955 }
35957 /* OpenMP 4.0:
35958 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35960 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35961 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35966 static void
35969 {
35970 tree clauses;
35974 {
35979 {
35982 }
35983 }
35985 {
35989 }
35992 {
35997 else
36001 }
36004 OMP_CANCELLATION_POINT_CLAUSE_MASK,
36006 pragma_tok);
36008 }
36010 /* OpenMP 4.0:
36011 #pragma omp distribute distribute-clause[optseq] new-line
36012 for-loop */
36014 #define OMP_DISTRIBUTE_CLAUSE_MASK \
36015 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36021 static tree
36025 {
36034 {
36042 else
36045 {
36051 {
36055 else
36058 }
36064 else
36078 }
36079 }
36081 {
36084 }
36089 {
36092 }
36103 }
36105 /* OpenMP 4.0:
36106 # pragma omp teams teams-clause[optseq] new-line
36107 structured-block */
36109 #define OMP_TEAMS_CLAUSE_MASK \
36110 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36111 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36112 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36113 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36116 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36118 static tree
36122 {
36131 {
36135 {
36160 }
36161 }
36163 {
36166 }
36171 {
36174 }
36183 }
36185 /* OpenMP 4.0:
36186 # pragma omp target data target-data-clause[optseq] new-line
36187 structured-block */
36189 #define OMP_TARGET_DATA_CLAUSE_MASK \
36190 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36192 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36193 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36195 static tree
36197 {
36198 tree clauses
36203 {
36206 {
36223 "%<#pragma omp target data%> with map-type other "
36224 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36228 }
36230 }
36233 {
36236 "%<#pragma omp target data%> must contain at least "
36239 }
36250 }
36252 /* OpenMP 4.5:
36253 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36254 structured-block */
36256 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36257 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36263 static tree
36266 {
36269 {
36274 {
36277 }
36278 }
36280 {
36284 }
36287 {
36293 }
36295 tree clauses
36300 {
36303 {
36316 "%<#pragma omp target enter data%> with map-type other "
36320 }
36322 }
36325 {
36328 "%<#pragma omp target enter data%> must contain at least "
36331 }
36338 }
36340 /* OpenMP 4.5:
36341 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36342 structured-block */
36344 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36345 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36351 static tree
36354 {
36357 {
36362 {
36365 }
36366 }
36368 {
36372 }
36375 {
36381 }
36383 tree clauses
36388 {
36391 {
36405 "%<#pragma omp target exit data%> with map-type other "
36406 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36410 }
36412 }
36415 {
36418 "%<#pragma omp target exit data%> must contain at least "
36421 }
36428 }
36430 /* OpenMP 4.0:
36431 # pragma omp target update target-update-clause[optseq] new-line */
36433 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36434 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36435 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36441 static bool
36444 {
36446 {
36452 }
36454 tree clauses
36459 {
36461 "%<#pragma omp target update%> must contain at least one "
36464 }
36472 }
36474 /* OpenMP 4.0:
36475 # pragma omp target target-clause[optseq] new-line
36476 structured-block */
36478 #define OMP_TARGET_CLAUSE_MASK \
36479 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36485 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36489 static bool
36492 {
36496 {
36508 {
36516 {
36517 tree stmt;
36519 {
36522 OMP_TARGET_CLAUSE_MASK,
36527 OMP_TARGET_CLAUSE_MASK,
36532 OMP_TARGET_CLAUSE_MASK,
36537 }
36539 }
36544 {
36548 if_p);
36553 if_p);
36558 if_p);
36562 }
36568 {
36569 /* For combined target teams, ensure the num_teams and
36570 thread_limit clause expressions are evaluated on the host,
36571 before entering the target construct. */
36572 tree c;
36578 {
36587 OMP_CLAUSE_FIRSTPRIVATE);
36592 }
36593 }
36603 }
36605 {
36608 }
36610 {
36614 }
36616 {
36620 }
36622 {
36626 }
36628 {
36631 }
36632 }
36634 {
36637 }
36652 check_clauses:
36654 {
36657 {
36671 "%<#pragma omp target%> with map-type other "
36672 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36676 }
36678 }
36680 }
36682 /* OpenACC 2.0:
36683 # pragma acc cache (variable-list) new-line
36684 */
36686 static tree
36688 {
36703 }
36705 /* OpenACC 2.0:
36706 # pragma acc data oacc-data-clause[optseq] new-line
36707 structured-block */
36709 #define OACC_DATA_CLAUSE_MASK \
36710 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36711 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36722 static tree
36724 {
36737 }
36739 /* OpenACC 2.0:
36740 # pragma acc host_data <clauses> new-line
36741 structured-block */
36743 #define OACC_HOST_DATA_CLAUSE_MASK \
36744 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36746 static tree
36748 {
36761 }
36763 /* OpenACC 2.0:
36764 # pragma acc declare oacc-data-clause[optseq] new-line
36765 */
36767 #define OACC_DECLARE_CLAUSE_MASK \
36768 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36781 static tree
36783 {
36792 {
36796 }
36799 {
36803 {
36807 }
36810 {
36822 {
36824 "%qD must be a global variable in "
36826 decl);
36829 }
36834 {
36838 }
36840 {
36842 "invalid use of %<extern%> variable %qD "
36846 }
36848 {
36850 "invalid use of %<global%> variable %qD "
36854 }
36856 }
36861 {
36866 }
36869 {
36870 tree id;
36874 else
36880 {
36883 {
36886 {
36890 }
36891 }
36892 }
36893 }
36894 }
36907 }
36909 /* OpenACC 2.0:
36910 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36912 or
36914 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36916 LOC is the location of the #pragma token.
36917 */
36919 #define OACC_ENTER_DATA_CLAUSE_MASK \
36920 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36923 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36924 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36928 #define OACC_EXIT_DATA_CLAUSE_MASK \
36929 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36930 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36931 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36932 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36933 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36935 static tree
36938 {
36947 {
36952 }
36959 else
36964 {
36968 }
36976 }
36978 /* OpenACC 2.0:
36979 # pragma acc loop oacc-loop-clause[optseq] new-line
36980 structured-block */
36982 #define OACC_LOOP_CLAUSE_MASK \
36983 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36984 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36985 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36986 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36987 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36988 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36989 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36990 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36991 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36992 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36994 static tree
36997 {
37006 {
37012 }
37021 }
37023 /* OpenACC 2.0:
37024 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37025 structured-block
37027 or
37029 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37030 structured-block
37031 */
37033 #define OACC_KERNELS_CLAUSE_MASK \
37034 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37052 #define OACC_PARALLEL_CLAUSE_MASK \
37053 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37062 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37074 static tree
37077 {
37078 omp_clause_mask mask;
37081 {
37094 }
37097 {
37101 {
37104 tree clauses;
37106 if_p);
37108 }
37109 }
37118 }
37120 /* OpenACC 2.0:
37121 # pragma acc update oacc-update-clause[optseq] new-line
37122 */
37124 #define OACC_UPDATE_CLAUSE_MASK \
37125 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
37130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37132 static tree
37134 {
37141 {
37143 "%<#pragma acc update%> must contain at least one "
37146 }
37154 }
37156 /* OpenACC 2.0:
37157 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37159 LOC is the location of the #pragma token.
37160 */
37162 #define OACC_WAIT_CLAUSE_MASK \
37163 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37165 static tree
37167 {
37181 }
37183 /* OpenMP 4.0:
37184 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37186 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37187 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37188 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37192 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37194 static void
37197 {
37199 cp_omp_declare_simd_data data;
37201 {
37206 /* It is safe to take the address of a local variable; it will only be
37207 used while this scope is live. */
37209 }
37211 /* Store away all pragma tokens. */
37223 {
37227 {
37240 }
37245 "%<#pragma omp declare simd%> not immediately followed by "
37249 }
37250 }
37252 /* Finalize #pragma omp declare simd clauses after direct declarator has
37253 been parsed, and put that into "omp declare simd" attribute. */
37255 static tree
37257 {
37263 {
37267 }
37272 {
37290 }
37294 }
37297 /* OpenMP 4.0:
37298 # pragma omp declare target new-line
37299 declarations and definitions
37300 # pragma omp end declare target new-line
37302 OpenMP 4.5:
37303 # pragma omp declare target ( extended-list ) new-line
37305 # pragma omp declare target declare-target-clauses[seq] new-line */
37307 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37308 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37311 static void
37313 {
37316 clauses
37320 {
37322 clauses);
37325 }
37326 else
37327 {
37331 }
37334 "%<#pragma omp declare target%> with clauses in between "
37335 "%<#pragma omp declare target%> without clauses and "
37338 {
37344 {
37347 }
37348 else
37351 {
37353 "%qD specified both in declare target %<link%> and %<to%>"
37356 }
37358 {
37365 {
37368 {
37372 }
37373 }
37374 }
37375 }
37376 }
37378 static void
37380 {
37383 {
37386 }
37388 {
37392 {
37395 }
37398 else
37399 {
37403 }
37404 }
37405 else
37406 {
37410 }
37414 "%<#pragma omp end declare target%> without corresponding "
37416 else
37418 }
37420 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37421 expression and optional initializer clause of
37422 #pragma omp declare reduction. We store the expression(s) as
37423 either 3, 6 or 7 special statements inside of the artificial function's
37424 body. The first two statements are DECL_EXPRs for the artificial
37425 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37426 expression that uses those variables.
37427 If there was any INITIALIZER clause, this is followed by further statements,
37428 the fourth and fifth statements are DECL_EXPRs for the artificial
37429 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37430 constructor variant (first token after open paren is not omp_priv),
37431 then the sixth statement is a statement with the function call expression
37432 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37433 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37434 to initialize the OMP_PRIV artificial variable and there is seventh
37435 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37437 static bool
37439 {
37451 tree combiner;
37466 {
37469 }
37472 {
37474 matching_parens parens;
37480 {
37483 }
37499 {
37503 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37507 == CPP_CLOSE_PAREN
37510 {
37514 }
37519 }
37520 else
37521 {
37537 {
37542 }
37544 tree arg;
37557 }
37568 }
37572 UNKNOWN_LOCATION);
37575 }
37577 /* OpenMP 4.0
37578 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37579 initializer-clause[opt] new-line
37581 initializer-clause:
37582 initializer (omp_priv initializer)
37583 initializer (function-name (argument-list)) */
37585 static void
37588 {
37598 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37605 {
37637 }
37649 /* Types may not be defined in declare reduction type list. */
37652 parser->type_definition_forbidden_message
37658 saved_colon_doesnt_start_class_def_p
37663 {
37667 ;
37686 else
37691 else
37693 }
37695 /* Restore the saved message. */
37698 parser->colon_doesnt_start_class_def_p
37703 {
37704 fail:
37707 }
37713 {
37714 tree fntype
37717 NULL_TREE);
37737 {
37742 }
37744 {
37746 {
37755 }
37762 }
37763 else
37764 {
37767 }
37770 else
37773 {
37776 }
37778 {
37781 else
37786 }
37791 else
37792 {
37801 }
37808 }
37812 done:
37813 /* Free any declarators allocated. */
37815 }
37817 /* OpenMP 4.0
37818 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37819 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37820 initializer-clause[opt] new-line
37821 #pragma omp declare target new-line */
37823 static bool
37826 {
37828 {
37833 {
37836 context);
37838 }
37841 {
37844 context);
37846 }
37848 {
37851 }
37853 {
37857 }
37858 }
37863 }
37865 /* OpenMP 4.5:
37866 #pragma omp taskloop taskloop-clause[optseq] new-line
37867 for-loop
37869 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37870 for-loop */
37872 #define OMP_TASKLOOP_CLAUSE_MASK \
37873 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37875 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37888 static tree
37892 {
37901 {
37906 {
37930 }
37931 }
37933 {
37936 }
37941 {
37944 }
37950 if_p);
37956 }
37959 /* OpenACC 2.0:
37960 # pragma acc routine oacc-routine-clause[optseq] new-line
37961 function-definition
37963 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37964 */
37966 #define OACC_ROUTINE_CLAUSE_MASK \
37967 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37973 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37974 component, which must resolve to a declared namespace-scope
37975 function. The clauses are either processed directly (for a named
37976 function), or defered until the immediatley following declaration
37977 is parsed. */
37979 static void
37982 {
37984 /* The checking for "another pragma following this one" in the "no optional
37985 '( name )'" case makes sure that we dont re-enter. */
37988 cp_oacc_routine_data data;
37994 /* It is safe to take the address of a local variable; it will only be
37995 used while this scope is live. */
37998 /* Look for optional '( name )'. */
38000 {
38001 matching_parens parens;
38004 /* We parse the name as an id-expression. If it resolves to
38005 anything other than a non-overloaded function at namespace
38006 scope, it's an error. */
38022 {
38026 }
38028 data.clauses
38036 {
38041 }
38043 /* Perhaps we should use the same rule as declarations in different
38044 namespaces? */
38046 {
38051 }
38054 {
38058 }
38062 }
38064 {
38065 /* Store away all pragma tokens. */
38076 /* Emit a helpful diagnostic if there's another pragma following this
38077 one. */
38079 {
38082 /* ..., and then just keep going. */
38084 }
38086 /* We only have to consider the pragma_external case here. */
38091 else
38094 }
38095 }
38097 /* Finalize #pragma acc routine clauses after direct declarator has
38098 been parsed. */
38100 static tree
38102 {
38107 {
38109 "%<#pragma acc routine%> not immediately followed by "
38112 }
38129 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38130 fndecl_seen. */
38133 }
38135 /* Apply any saved OpenACC routine clauses to a just-parsed
38136 declaration. */
38138 static void
38140 {
38142 {
38143 /* Keep going if we're in error reporting mode. */
38149 {
38151 "%<#pragma acc routine%> not immediately followed by"
38155 }
38157 {
38160 }
38163 {
38168 }
38171 {
38179 }
38181 /* Process the routine's dimension clauses. */
38185 /* Add an "omp declare target" attribute. */
38190 /* Don't unset parser->oacc_routine here: we may still need it to
38191 diagnose wrong usage. But, remember that we've used this "#pragma acc
38192 routine". */
38194 }
38195 }
38197 /* Main entry point to OpenMP statement pragmas. */
38199 static void
38201 {
38202 tree stmt;
38207 {
38230 if_p);
38235 if_p);
38252 if_p);
38257 if_p);
38265 if_p);
38274 if_p);
38288 if_p);
38293 if_p);
38297 }
38300 }
38301 \f
38302 /* Transactional Memory parsing routines. */
38304 /* Parse a transaction attribute.
38306 txn-attribute:
38307 attribute
38308 [ [ identifier ] ]
38310 We use this instead of cp_parser_attributes_opt for transactions to avoid
38311 the pedwarn in C++98 mode. */
38313 static tree
38315 {
38330 {
38334 /* For keywords, use the canonical spelling,
38335 not the parsed identifier. */
38339 }
38340 else
38344 error1:
38347 }
38349 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38351 transaction-statement:
38352 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38353 compound-statement
38354 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38355 */
38357 static tree
38359 {
38370 else
38371 {
38375 }
38377 /* Parse a noexcept specification. */
38381 {
38382 /* cancel-and-throw is unimplemented. */
38385 }
38386 else
38389 /* Keep track if we're in the lexical scope of an outer transaction. */
38401 }
38403 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38405 transaction-expression:
38406 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38407 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38408 */
38410 static tree
38412 {
38425 keyword == RID_TRANSACTION_RELAXED
38439 /* Set this early. This might mean that we allow transaction_cancel in
38440 an expression that we find out later actually has to be a constexpr.
38441 However, we expect that cxx_constant_value will be able to deal with
38442 this; also, if the noexcept has no constexpr, then what we parse next
38443 really is a transaction's body. */
38446 /* Parse a noexcept specification. */
38452 {
38453 matching_parens parens;
38460 }
38461 else
38462 {
38463 /* The only expression that is available got parsed for the noexcept
38464 already. noexcept is true then. */
38467 }
38476 }
38478 /* Parse a function-transaction-block.
38480 function-transaction-block:
38481 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38482 function-body
38483 __transaction_atomic txn-attribute[opt] function-try-block
38484 __transaction_relaxed ctor-initializer[opt] function-body
38485 __transaction_relaxed function-try-block
38486 */
38488 static void
38490 {
38505 else
38506 {
38510 }
38518 else
38519 cp_parser_ctor_initializer_opt_and_function_body
38525 }
38527 /* Parse a __transaction_cancel statement.
38529 cancel-statement:
38530 __transaction_cancel txn-attribute[opt] ;
38531 __transaction_cancel txn-attribute[opt] throw-expression ;
38533 ??? Cancel and throw is not yet implemented. */
38535 static tree
38537 {
38543 RT_TRANSACTION_CANCEL);
38550 /* ??? Parse cancel-and-throw here. */
38555 {
38559 }
38561 {
38565 }
38567 {
38570 {
38576 }
38577 }
38579 {
38583 }
38589 }
38590 \f
38591 /* The parser. */
38595 \f
38596 /* Special handling for the first token or line in the file. The first
38597 thing in the file might be #pragma GCC pch_preprocess, which loads a
38598 PCH file, which is a GC collection point. So we need to handle this
38599 first pragma without benefit of an existing lexer structure.
38601 Always returns one token to the caller in *FIRST_TOKEN. This is
38602 either the true first token of the file, or the first token after
38603 the initial pragma. */
38605 static void
38607 {
38616 {
38623 }
38624 else
38627 /* Skip to the end of the pragma. */
38631 /* Now actually load the PCH file. */
38635 /* Read one more token to return to our caller. We have to do this
38636 after reading the PCH file in, since its pointers have to be
38637 live. */
38639 }
38641 /* Parse a pragma GCC ivdep. */
38643 static bool
38645 {
38648 }
38650 /* Parse a pragma GCC unroll. */
38652 static unsigned short
38654 {
38664 {
38666 " assignment-expression that evaluates to a non-negative"
38669 }
38670 else
38671 {
38675 }
38678 }
38680 /* Normal parsing of a pragma token. Here we can (and must) use the
38681 regular lexer. */
38683 static bool
38685 {
38688 tree stmt;
38699 {
38707 {
38717 }
38722 {
38732 }
38737 {
38748 }
38753 {
38764 }
38769 {
38780 }
38800 {
38805 }
38813 {
38818 }
38826 {
38830 }
38836 {
38841 }
38849 {
38854 }
38909 "%<#pragma omp section%> may only be used in "
38914 {
38916 {
38920 }
38926 {
38930 }
38931 else
38937 {
38940 }
38943 }
38946 {
38948 {
38952 }
38953 const unsigned short unroll
38959 {
38963 }
38964 else
38970 {
38973 }
38976 }
38983 bad_stmt:
38986 }
38990 }
38992 /* The interface the pragma parsers have to the lexer. */
38994 enum cpp_ttype
38996 {
39008 else
39009 {
39013 }
39016 }
39018 \f
39019 /* External interface. */
39021 /* Parse one entire translation unit. */
39023 void
39025 {
39038 }
39040 /* Create an identifier for a generic parameter type (a synthesized
39041 template parameter implied by `auto' or a concept identifier). */
39044 static tree
39046 {
39050 }
39052 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39053 (creating a new template parameter list if necessary). Returns the newly
39054 created template type parm. */
39056 static tree
39058 {
39061 /* Before committing to modifying any scope, if we're in an
39062 implicit template scope, and we're trying to synthesize a
39063 constrained parameter, try to find a previous parameter with
39064 the same name. This is the same-type rule for abbreviated
39065 function templates.
39067 NOTE: We can generate implicit parameters when tentatively
39068 parsing a nested name specifier, only to reject that parse
39069 later. However, matching the same template-id as part of a
39070 direct-declarator should generate an identical template
39071 parameter, so this rule will merge them. */
39073 {
39076 {
39078 {
39081 /* Return the TEMPLATE_PARM_INDEX. */
39084 }
39086 }
39087 }
39089 /* We are either continuing a function template that already contains implicit
39090 template parameters, creating a new fully-implicit function template, or
39091 extending an existing explicit function template with implicit template
39092 parameters. */
39100 {
39104 }
39105 else
39106 {
39107 /* Roll back to the existing template parameter scope (in the case of
39108 extending an explicit function template) or introduce a new template
39109 parameter scope ahead of the function parameter scope (or class scope
39110 in the case of out-of-line member definitions). The function scope is
39111 added back after template parameter synthesis below. */
39116 {
39119 }
39121 {
39122 /* If not defining a class, then any class scope is a scope level in
39123 an out-of-line member definition. In this case simply wind back
39124 beyond the first such scope to inject the template parameter list.
39125 Otherwise wind back to the class being defined. The latter can
39126 occur in class member friend declarations such as:
39128 class A {
39129 void foo (auto);
39130 };
39131 class B {
39132 friend void A::foo (auto);
39133 };
39135 The template parameter list synthesized for the friend declaration
39136 must be injected in the scope of 'B'. This can also occur in
39137 erroneous cases such as:
39139 struct A {
39140 struct B {
39141 void foo (auto);
39142 };
39143 void B::foo (auto) {}
39144 };
39146 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39147 but, nevertheless, the template parameter list synthesized for the
39148 declarator should be injected into the scope of 'A' as if the
39149 ill-formed template was specified explicitly. */
39152 {
39155 }
39156 }
39162 {
39163 /* Introduce a new template parameter list for implicit template
39164 parameters. */
39168 parser->implicit_template_scope
39175 }
39176 else
39177 {
39178 /* Synthesize implicit template parameters at the end of the explicit
39179 template parameter list. */
39186 parser->implicit_template_parms
39188 }
39189 }
39191 /* Synthesize a new template parameter and track the current template
39192 parameter chain with implicit_template_parms. */
39196 tree synth_tmpl_parm;
39200 synth_tmpl_parm
39203 synth_tmpl_parm
39205 else
39206 {
39210 }
39212 // Attach the constraint to the parm before processing.
39215 tree new_parm
39217 input_location,
39218 node,
39222 // Chain the new parameter to the list of implicit parameters.
39224 parser->implicit_template_parms
39226 else
39231 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39234 /* If creating a fully implicit function template, start the new implicit
39235 template parameter list with this synthesized type, otherwise grow the
39236 current template parameter list. */
39239 {
39246 }
39247 else
39248 {
39253 }
39255 // If the new parameter was constrained, we need to add that to the
39256 // constraints in the template parameter list.
39258 {
39262 }
39267 }
39269 /* Finish the declaration of a fully implicit function template. Such a
39270 template has no explicit template parameter list so has not been through the
39271 normal template head and tail processing. synthesize_implicit_template_parm
39272 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39273 provided if the declaration is a class member such that its template
39274 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39275 form is returned. Otherwise NULL_TREE is returned. */
39277 static tree
39279 {
39284 {
39288 }
39300 }
39302 /* Like finish_fully_implicit_template, but to be used in error
39303 recovery, rearranging scopes so that we restore the state we had
39304 before synthesize_implicit_template_parm inserted the implement
39305 template parms scope. */
39307 static void
39309 {
39314 {
39323 }
39324 else
39330 }
39332 /* Helper function for diagnostics that have complained about things
39333 being used with 'extern "C"' linkage.
39335 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39337 void
39339 {
39343 }