| blob | d8ce28a6d61a11b0a9a711218587ffd302ce7cca |
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 {
7998 /* Consume the token. */
8000 /* Parse the operand. */
8006 else
8007 {
8008 /* ISO C++ defines alignof only with types, not with
8009 expressions. So pedwarn if alignof is used with a non-
8010 type expression. However, __alignof__ is ok. */
8013 "ISO C++ does not allow %<alignof%> "
8017 }
8018 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8019 SIZEOF_EXPR with the original operand. */
8021 {
8023 {
8025 {
8028 error_mark_node));
8030 }
8031 else
8035 }
8036 }
8038 /* Construct a location e.g. :
8039 alignof (expr)
8040 ^~~~~~~~~~~~~~
8041 with start == caret at the start of the "alignof"/"sizeof"
8042 token, with the endpoint at the final closing paren. */
8043 location_t finish_loc
8045 location_t compound_loc
8052 }
8061 {
8062 /* The saved value of the PEDANTIC flag. */
8064 tree expr;
8066 /* Save away the PEDANTIC flag. */
8068 /* Parse the cast-expression. */
8070 /* Restore the PEDANTIC flag. */
8074 }
8078 {
8079 tree expression;
8081 /* Consume the `__real__' or `__imag__' token. */
8083 /* Parse the cast-expression. */
8085 /* Create the complete representation. */
8089 expression,
8090 tf_warning_or_error);
8091 }
8099 {
8100 tree expr;
8109 matching_parens parens;
8113 parser->type_definition_forbidden_message
8116 saved_integral_constant_expression_p
8118 saved_non_integral_constant_expression_p
8122 saved_greater_than_is_operator_p
8134 parser->greater_than_is_operator_p
8137 parser->integral_constant_expression_p
8139 parser->non_integral_constant_expression_p
8144 location_t finish_loc
8148 /* Construct a location of the form:
8149 noexcept (expr)
8150 ^~~~~~~~~~~~~~~
8151 with start == caret, finishing at the close-paren. */
8152 location_t noexcept_loc
8156 noexcept_loc);
8157 }
8161 }
8162 }
8164 /* Look for the `:: new' and `:: delete', which also signal the
8165 beginning of a new-expression, or delete-expression,
8166 respectively. If the next token is `::', then it might be one of
8167 these. */
8169 {
8172 /* See if the token after the `::' is one of the keywords in
8173 which we're interested. */
8175 /* If it's `new', we have a new-expression. */
8178 /* Similarly, for `delete'. */
8181 }
8183 /* Look for a unary operator. */
8185 /* The `++' and `--' operators can be handled similarly, even though
8186 they are not technically unary-operators in the grammar. */
8188 {
8193 /* Handle the GNU address-of-label extension. */
8196 {
8197 tree identifier;
8198 tree expression;
8201 /* Consume the '&&' token. */
8203 /* Look for the identifier. */
8204 location_t finish_loc
8207 /* Construct a location of the form:
8208 &&label
8209 ^~~~~~~
8210 with caret==start at the "&&", finish at the end of the label. */
8211 location_t combined_loc
8213 /* Create an expression representing the address. */
8216 NIC_ADDR_LABEL))
8219 }
8220 }
8222 {
8223 cp_expr cast_expression;
8229 /* Consume the operator token. */
8233 /* Parse the cast-expression. */
8234 cast_expression
8239 pidk);
8241 /* Make a location:
8242 OP_TOKEN CAST_EXPRESSION
8243 ^~~~~~~~~~~~~~~~~~~~~~~~~
8244 with start==caret at the operator token, and
8245 extending to the end of the cast_expression. */
8248 /* Now, build an appropriate representation. */
8250 {
8254 RO_UNARY_STAR,
8255 complain);
8256 /* TODO: build_x_indirect_ref does not always honor the
8257 location, so ensure it is set. */
8263 /* Fall through. */
8266 cast_expression,
8267 complain);
8268 /* TODO: build_x_unary_op does not always honor the location,
8269 so ensure it is set. */
8277 /* Fall through. */
8279 /* Immediately fold negation of a constant, unless the constant is 0
8280 (since -0 == 0) or it would overflow. */
8285 {
8288 cast_expression);
8290 {
8293 }
8294 }
8295 /* Fall through. */
8304 }
8308 non_constant_p))
8312 }
8316 decltype_p,
8317 pidk);
8318 }
8320 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8321 unary-operator, the corresponding tree code is returned. */
8323 static enum tree_code
8325 {
8327 {
8348 }
8349 }
8351 /* Parse a new-expression.
8353 new-expression:
8354 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8355 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8357 Returns a representation of the expression. */
8359 static tree
8361 {
8364 tree type;
8367 tree ret;
8371 /* Look for the optional `::' operator. */
8372 global_scope_p
8376 /* Look for the `new' operator. */
8378 /* There's no easy way to tell a new-placement from the
8379 `( type-id )' construct. */
8381 /* Look for a new-placement. */
8383 /* If that didn't work out, there's no new-placement. */
8385 {
8389 }
8391 /* If the next token is a `(', then we have a parenthesized
8392 type-id. */
8394 {
8398 /* Consume the `('. */
8399 matching_parens parens;
8402 /* Parse the type-id. */
8403 parser->type_definition_forbidden_message
8405 {
8408 }
8411 /* Look for the closing `)'. */
8414 /* There should not be a direct-new-declarator in this production,
8415 but GCC used to allowed this, so we check and emit a sensible error
8416 message for this case. */
8418 {
8424 }
8425 }
8426 /* Otherwise, there must be a new-type-id. */
8427 else
8430 /* If the next token is a `(' or '{', then we have a new-initializer. */
8435 else
8438 /* A new-expression may not appear in an integral constant
8439 expression. */
8442 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8443 of a new-type-id or type-id of a new-expression, the new-expression shall
8444 contain a new-initializer of the form ( assignment-expression )".
8445 Additionally, consistently with the spirit of DR 1467, we want to accept
8446 'new auto { 2 }' too. */
8452 {
8454 "initialization of new-expression for type %<auto%> "
8457 }
8458 else
8459 {
8460 /* Construct a location e.g.:
8461 ptr = new int[100]
8462 ^~~~~~~~~~~~
8463 with caret == start at the start of the "new" token, and the end
8464 at the end of the final token we consumed. */
8469 /* Create a representation of the new-expression. */
8471 tf_warning_or_error);
8473 }
8481 }
8483 /* Parse a new-placement.
8485 new-placement:
8486 ( expression-list )
8488 Returns the same representation as for an expression-list. */
8492 {
8495 /* Parse the expression-list. */
8496 expression_list = (cp_parser_parenthesized_expression_list
8505 }
8507 /* Parse a new-type-id.
8509 new-type-id:
8510 type-specifier-seq new-declarator [opt]
8512 Returns the TYPE allocated. If the new-type-id indicates an array
8513 type, *NELTS is set to the number of elements in the last array
8514 bound; the TYPE will not include the last array bound. */
8516 static tree
8518 {
8519 cp_decl_specifier_seq type_specifier_seq;
8525 /* The type-specifier sequence must not contain type definitions.
8526 (It cannot contain declarations of new types either, but if they
8527 are not definitions we will catch that because they are not
8528 complete.) */
8530 parser->type_definition_forbidden_message
8532 /* Parse the type-specifier-seq. */
8536 /* Restore the old message. */
8542 /* Parse the new-declarator. */
8545 /* Determine the number of elements in the last array dimension, if
8546 any. */
8548 /* Skip down to the last array dimension. */
8553 {
8556 }
8561 {
8564 }
8567 {
8574 else
8576 }
8579 }
8581 /* Parse an (optional) new-declarator.
8583 new-declarator:
8584 ptr-operator new-declarator [opt]
8585 direct-new-declarator
8587 Returns the declarator. */
8591 {
8594 cp_cv_quals cv_quals;
8596 /* We don't know if there's a ptr-operator next, or not. */
8598 /* Look for a ptr-operator. */
8600 /* If that worked, look for more new-declarators. */
8602 {
8605 /* Parse another optional declarator. */
8608 declarator = cp_parser_make_indirect_declarator
8612 }
8614 /* If the next token is a `[', there is a direct-new-declarator. */
8619 }
8621 /* Parse a direct-new-declarator.
8623 direct-new-declarator:
8624 [ expression ]
8625 direct-new-declarator [constant-expression]
8627 */
8631 {
8635 {
8636 tree expression;
8639 /* Look for the opening `['. */
8644 /* The standard requires that the expression have integral
8645 type. DR 74 adds enumeration types. We believe that the
8646 real intent is that these expressions be handled like the
8647 expression in a `switch' condition, which also allows
8648 classes with a single conversion to integral or
8649 enumeration type. */
8651 {
8652 expression
8654 expression,
8657 {
8659 "expression in new-declarator must have integral "
8662 }
8663 }
8665 /* Look for the closing `]'. */
8668 /* Add this bound to the declarator. */
8671 /* If the next token is not a `[', then there are no more
8672 bounds. */
8675 }
8678 }
8680 /* Parse a new-initializer.
8682 new-initializer:
8683 ( expression-list [opt] )
8684 braced-init-list
8686 Returns a representation of the expression-list. */
8690 {
8694 {
8695 tree t;
8702 }
8703 else
8704 expression_list = (cp_parser_parenthesized_expression_list
8710 }
8712 /* Parse a delete-expression.
8714 delete-expression:
8715 :: [opt] delete cast-expression
8716 :: [opt] delete [ ] cast-expression
8718 Returns a representation of the expression. */
8720 static tree
8722 {
8725 tree expression;
8727 /* Look for the optional `::' operator. */
8728 global_scope_p
8732 /* Look for the `delete' keyword. */
8734 /* See if the array syntax is in use. */
8736 {
8737 /* Consume the `[' token. */
8739 /* Look for the `]' token. */
8741 /* Remember that this is the `[]' construct. */
8743 }
8744 else
8747 /* Parse the cast-expression. */
8750 /* A delete-expression may not appear in an integral constant
8751 expression. */
8756 tf_warning_or_error);
8757 }
8759 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8760 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8761 0 otherwise. */
8763 static int
8765 {
8768 {
8810 /* In ((type ()) () the last () isn't a valid cast-expression,
8811 so the whole must be parsed as postfix-expression. */
8816 /* '[' may start a primary-expression in obj-c++ and in C++11,
8817 as a lambda-expression, eg, '(void)[]{}'. */
8824 /* '++' and '--' may or may not start a cast-expression:
8826 struct T { void operator++(int); };
8827 void f() { (T())++; }
8829 vs
8831 int a;
8832 (int)++a; */
8837 }
8838 }
8840 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8841 in the order: const_cast, static_cast, reinterpret_cast.
8843 Don't suggest dynamic_cast.
8845 Return the first legal cast kind found, or NULL otherwise. */
8849 {
8850 tree trial;
8852 /* Reuse the parser logic by attempting to build the various kinds of
8853 cast, with "complain" disabled.
8854 Identify the first such cast that is valid. */
8856 /* Don't attempt to run such logic within template processing. */
8860 /* First try const_cast. */
8865 /* If that fails, try static_cast. */
8870 /* Finally, try reinterpret_cast. */
8875 /* No such cast possible. */
8877 }
8879 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8880 suggesting how to convert a C-style cast of the form:
8882 (DST_TYPE)ORIG_EXPR
8884 to a C++-style cast.
8886 The primary range of RICHLOC is asssumed to be that of the original
8887 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8888 of the parens in the C-style cast. */
8890 static void
8893 tree dst_type)
8894 {
8895 /* This function is non-trivial, so bail out now if the warning isn't
8896 going to be emitted. */
8900 /* Try to find a legal C++ cast, trying them in order:
8901 const_cast, static_cast, reinterpret_cast. */
8906 /* Replace the open paren with "CAST_SUGGESTION<". */
8907 pretty_printer pp;
8911 /* Replace the close paren with "> (". */
8914 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8916 }
8919 /* Parse a cast-expression.
8921 cast-expression:
8922 unary-expression
8923 ( type-id ) cast-expression
8925 ADDRESS_P is true iff the unary-expression is appearing as the
8926 operand of the `&' operator. CAST_P is true if this expression is
8927 the target of a cast.
8929 Returns a representation of the expression. */
8931 static cp_expr
8934 {
8935 /* If it's a `(', then we might be looking at a cast. */
8937 {
8943 /* There's no way to know yet whether or not this is a cast.
8944 For example, `(int (3))' is a unary-expression, while `(int)
8945 3' is a cast. So, we resort to parsing tentatively. */
8947 /* Types may not be defined in a cast. */
8949 parser->type_definition_forbidden_message
8951 /* Consume the `('. */
8952 matching_parens parens;
8957 /* A very tricky bit is that `(struct S) { 3 }' is a
8958 compound-literal (which we permit in C++ as an extension).
8959 But, that construct is not a cast-expression -- it is a
8960 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8961 is legal; if the compound-literal were a cast-expression,
8962 you'd need an extra set of parentheses.) But, if we parse
8963 the type-id, and it happens to be a class-specifier, then we
8964 will commit to the parse at that point, because we cannot
8965 undo the action that is done when creating a new class. So,
8966 then we cannot back up and do a postfix-expression.
8968 Another tricky case is the following (c++/29234):
8970 struct S { void operator () (); };
8972 void foo ()
8973 {
8974 ( S()() );
8975 }
8977 As a type-id we parse the parenthesized S()() as a function
8978 returning a function, groktypename complains and we cannot
8979 back up in this case either.
8981 Therefore, we scan ahead to the closing `)', and check to see
8982 if the tokens after the `)' can start a cast-expression. Otherwise
8983 we are dealing with an unary-expression, a postfix-expression
8984 or something else.
8986 Yet another tricky case, in C++11, is the following (c++/54891):
8988 (void)[]{};
8990 The issue is that usually, besides the case of lambda-expressions,
8991 the parenthesized type-id cannot be followed by '[', and, eg, we
8992 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8993 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8994 we don't commit, we try a cast-expression, then an unary-expression.
8996 Save tokens so that we can put them back. */
8999 /* We may be looking at a cast-expression. */
9002 cast_expression
9005 /* Roll back the tokens we skipped. */
9007 /* If we aren't looking at a cast-expression, simulate an error so
9008 that the call to cp_parser_error_occurred below returns true. */
9011 else
9012 {
9015 /* Look for the type-id. */
9017 /* Look for the closing `)'. */
9022 }
9024 /* Restore the saved message. */
9027 /* At this point this can only be either a cast or a
9028 parenthesized ctor such as `(T ())' that looks like a cast to
9029 function returning T. */
9031 {
9032 /* Only commit if the cast-expression doesn't start with
9033 '++', '--', or '[' in C++11. */
9041 pidk);
9044 {
9045 /* Warn about old-style casts, if so requested. */
9050 {
9056 }
9058 /* Only type conversions to integral or enumeration types
9059 can be used in constant-expressions. */
9062 NIC_CAST))
9065 /* Perform the cast. */
9066 /* Make a location:
9067 (TYPE) EXPR
9068 ^~~~~~~~~~~
9069 with start==caret at the open paren, extending to the
9070 end of "expr". */
9072 open_paren_loc,
9076 }
9077 }
9078 else
9080 }
9082 /* If we get here, then it's not a cast, so it must be a
9083 unary-expression. */
9086 }
9088 /* Parse a binary expression of the general form:
9090 pm-expression:
9091 cast-expression
9092 pm-expression .* cast-expression
9093 pm-expression ->* cast-expression
9095 multiplicative-expression:
9096 pm-expression
9097 multiplicative-expression * pm-expression
9098 multiplicative-expression / pm-expression
9099 multiplicative-expression % pm-expression
9101 additive-expression:
9102 multiplicative-expression
9103 additive-expression + multiplicative-expression
9104 additive-expression - multiplicative-expression
9106 shift-expression:
9107 additive-expression
9108 shift-expression << additive-expression
9109 shift-expression >> additive-expression
9111 relational-expression:
9112 shift-expression
9113 relational-expression < shift-expression
9114 relational-expression > shift-expression
9115 relational-expression <= shift-expression
9116 relational-expression >= shift-expression
9118 GNU Extension:
9120 relational-expression:
9121 relational-expression <? shift-expression
9122 relational-expression >? shift-expression
9124 equality-expression:
9125 relational-expression
9126 equality-expression == relational-expression
9127 equality-expression != relational-expression
9129 and-expression:
9130 equality-expression
9131 and-expression & equality-expression
9133 exclusive-or-expression:
9134 and-expression
9135 exclusive-or-expression ^ and-expression
9137 inclusive-or-expression:
9138 exclusive-or-expression
9139 inclusive-or-expression | exclusive-or-expression
9141 logical-and-expression:
9142 inclusive-or-expression
9143 logical-and-expression && inclusive-or-expression
9145 logical-or-expression:
9146 logical-and-expression
9147 logical-or-expression || logical-and-expression
9149 All these are implemented with a single function like:
9151 binary-expression:
9152 simple-cast-expression
9153 binary-expression <token> binary-expression
9155 CAST_P is true if this expression is the target of a cast.
9157 The binops_by_token map is used to get the tree codes for each <token> type.
9158 binary-expressions are associated according to a precedence table. */
9160 #define TOKEN_PRECEDENCE(token) \
9161 (((token->type == CPP_GREATER \
9162 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9163 && !parser->greater_than_is_operator_p) \
9164 ? PREC_NOT_OPERATOR \
9165 : binops_by_token[token->type].prec)
9167 static cp_expr
9173 {
9174 cp_parser_expression_stack stack;
9176 cp_parser_expression_stack_entry current;
9177 cp_expr rhs;
9181 tree overload;
9183 /* Parse the first expression. */
9194 {
9195 /* Get an operator token. */
9201 {
9203 "%<>>%> operator is treated"
9207 }
9212 /* This is a fold-expression; handle it later. */
9215 /* Popping an entry off the stack means we completed a subexpression:
9216 - either we found a token which is not an operator (`>' where it is not
9217 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9218 will happen repeatedly;
9219 - or, we found an operator which has lower priority. This is the case
9220 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9221 parsing `3 * 4'. */
9223 {
9226 else
9228 }
9230 get_rhs:
9234 /* We used the operator token. */
9237 /* For "false && x" or "true || x", x will never be executed;
9238 disable warnings while evaluating it. */
9240 c_inhibit_evaluation_warnings +=
9243 c_inhibit_evaluation_warnings +=
9246 /* Extract another operand. It may be the RHS of this expression
9247 or the LHS of a new, higher priority expression. */
9252 /* Get another operator token. Look up its precedence to avoid
9253 building a useless (immediately popped) stack entry for common
9254 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9261 {
9262 /* ... and prepare to parse the RHS of the new, higher priority
9263 expression. Since precedence levels on the stack are
9264 monotonically increasing, we do not have to care about
9265 stack overflows. */
9274 pop:
9276 /* If the stack is not empty, we have parsed into LHS the right side
9277 (`4' in the example above) of an expression we had suspended.
9278 We can use the information on the stack to recover the LHS (`3')
9279 from the stack together with the tree code (`MULT_EXPR'), and
9280 the precedence of the higher level subexpression
9281 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9282 which will be used to actually build the additive expression. */
9287 }
9289 /* Undo the disabling of warnings done above. */
9291 c_inhibit_evaluation_warnings -=
9294 c_inhibit_evaluation_warnings -=
9300 /* Avoid warning for !!x == y. */
9305 /* Avoid warning for !b == y where b is boolean. */
9309 /* Avoid warning for !!b == y where b is boolean. */
9322 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9323 ERROR_MARK for everything that is not a binary expression.
9324 This makes warn_about_parentheses miss some warnings that
9325 involve unary operators. For unary expressions we should
9326 pass the correct tree_code unless the unary expression was
9327 surrounded by parentheses.
9328 */
9332 {
9335 else
9336 {
9337 current.lhs
9340 == tcc_comparison
9344 }
9345 }
9346 else
9347 {
9352 /* TODO: build_x_binary_op doesn't always honor the location. */
9354 }
9357 /* If the binary operator required the use of an overloaded operator,
9358 then this expression cannot be an integral constant-expression.
9359 An overloaded operator can be used even if both operands are
9360 otherwise permissible in an integral constant-expression if at
9361 least one of the operands is of enumeration type. */
9365 NIC_OVERLOADED))
9367 }
9370 }
9372 static cp_expr
9377 {
9380 }
9382 /* Parse the `? expression : assignment-expression' part of a
9383 conditional-expression. The LOGICAL_OR_EXPR is the
9384 logical-or-expression that started the conditional-expression.
9385 Returns a representation of the entire conditional-expression.
9387 This routine is used by cp_parser_assignment_expression.
9389 ? expression : assignment-expression
9391 GNU Extensions:
9393 ? : assignment-expression */
9395 static tree
9397 {
9399 cp_expr assignment_expr;
9403 /* Consume the `?' token. */
9408 {
9411 /* Implicit true clause. */
9413 c_inhibit_evaluation_warnings +=
9416 }
9417 else
9418 {
9421 /* Parse the expression. */
9422 c_inhibit_evaluation_warnings +=
9425 c_inhibit_evaluation_warnings +=
9429 }
9431 /* The next token should be a `:'. */
9433 /* Parse the assignment-expression. */
9435 c_inhibit_evaluation_warnings -=
9438 /* Make a location:
9439 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9440 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9441 with the caret at the "?", ranging from the start of
9442 the logical_or_expr to the end of the assignment_expr. */
9447 /* Build the conditional-expression. */
9449 expr,
9450 assignment_expr,
9451 tf_warning_or_error);
9452 }
9454 /* Parse an assignment-expression.
9456 assignment-expression:
9457 conditional-expression
9458 logical-or-expression assignment-operator assignment_expression
9459 throw-expression
9461 CAST_P is true if this expression is the target of a cast.
9462 DECLTYPE_P is true if this expression is the operand of decltype.
9464 Returns a representation for the expression. */
9466 static cp_expr
9469 {
9470 cp_expr expr;
9472 /* If the next token is the `throw' keyword, then we're looking at
9473 a throw-expression. */
9476 /* Otherwise, it must be that we are looking at a
9477 logical-or-expression. */
9478 else
9479 {
9480 /* Parse the binary expressions (logical-or-expression). */
9482 decltype_p,
9484 /* If the next token is a `?' then we're actually looking at a
9485 conditional-expression. */
9488 else
9489 {
9492 /* If it's an assignment-operator, we're using the second
9493 production. */
9494 enum tree_code assignment_operator
9497 {
9500 /* Parse the right-hand side of the assignment. */
9507 /* An assignment may not appear in a
9508 constant-expression. */
9510 NIC_ASSIGNMENT))
9512 /* Build the assignment expression. Its default
9513 location:
9514 LHS = RHS
9515 ~~~~^~~~~
9516 is the location of the '=' token as the
9517 caret, ranging from the start of the lhs to the
9518 end of the rhs. */
9523 assignment_operator,
9524 rhs,
9526 /* TODO: build_x_modify_expr doesn't honor the location,
9527 so we must set it here. */
9529 }
9530 }
9531 }
9534 }
9536 /* Parse an (optional) assignment-operator.
9538 assignment-operator: one of
9539 = *= /= %= += -= >>= <<= &= ^= |=
9541 GNU Extension:
9543 assignment-operator: one of
9544 <?= >?=
9546 If the next token is an assignment operator, the corresponding tree
9547 code is returned, and the token is consumed. For example, for
9548 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9549 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9550 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9551 operator, ERROR_MARK is returned. */
9553 static enum tree_code
9555 {
9559 /* Peek at the next token. */
9563 {
9609 /* Nothing else is an assignment operator. */
9611 }
9613 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9618 /* If it was an assignment operator, consume it. */
9623 }
9625 /* Parse an expression.
9627 expression:
9628 assignment-expression
9629 expression , assignment-expression
9631 CAST_P is true if this expression is the target of a cast.
9632 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9633 except possibly parenthesized or on the RHS of a comma (N3276).
9635 Returns a representation of the expression. */
9637 static cp_expr
9640 {
9645 {
9646 cp_expr assignment_expression;
9648 /* Parse the next assignment-expression. */
9649 assignment_expression
9652 /* We don't create a temporary for a call that is the immediate operand
9653 of decltype or on the RHS of a comma. But when we see a comma, we
9654 need to create a temporary for a call on the LHS. */
9659 assignment_expression
9663 /* If this is the first assignment-expression, we can just
9664 save it away. */
9667 else
9668 {
9669 /* Create a location with caret at the comma, ranging
9670 from the start of the LHS to the end of the RHS. */
9675 assignment_expression,
9678 }
9679 /* If the next token is not a comma, or we're in a fold-expression, then
9680 we are done with the expression. */
9684 /* Consume the `,'. */
9687 /* A comma operator cannot appear in a constant-expression. */
9690 }
9693 }
9695 /* Parse a constant-expression.
9697 constant-expression:
9698 conditional-expression
9700 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9701 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9702 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9703 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9704 only parse a conditional-expression, otherwise parse an
9705 assignment-expression. See below for rationale. */
9707 static cp_expr
9712 {
9716 cp_expr expression;
9718 /* It might seem that we could simply parse the
9719 conditional-expression, and then check to see if it were
9720 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9721 one that the compiler can figure out is constant, possibly after
9722 doing some simplifications or optimizations. The standard has a
9723 precise definition of constant-expression, and we must honor
9724 that, even though it is somewhat more restrictive.
9726 For example:
9728 int i[(2, 3)];
9730 is not a legal declaration, because `(2, 3)' is not a
9731 constant-expression. The `,' operator is forbidden in a
9732 constant-expression. However, GCC's constant-folding machinery
9733 will fold this operation to an INTEGER_CST for `3'. */
9735 /* Save the old settings. */
9737 saved_allow_non_integral_constant_expression_p
9740 /* We are now parsing a constant-expression. */
9742 parser->allow_non_integral_constant_expression_p
9745 /* Although the grammar says "conditional-expression", when not STRICT_P,
9746 we parse an "assignment-expression", which also permits
9747 "throw-expression" and the use of assignment operators. In the case
9748 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9749 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9750 actually essential that we look for an assignment-expression.
9751 For example, cp_parser_initializer_clauses uses this function to
9752 determine whether a particular assignment-expression is in fact
9753 constant. */
9755 {
9756 /* Parse the binary expressions (logical-or-expression). */
9759 /* If the next token is a `?' then we're actually looking at
9760 a conditional-expression; otherwise we're done. */
9763 }
9764 else
9766 /* Restore the old settings. */
9767 parser->integral_constant_expression_p
9769 parser->allow_non_integral_constant_expression_p
9772 {
9773 /* Require an rvalue constant expression here; that's what our
9774 callers expect. Reference constant expressions are handled
9775 separately in e.g. cp_parser_template_argument. */
9784 }
9787 parser->non_integral_constant_expression_p
9791 }
9793 /* Parse __builtin_offsetof.
9795 offsetof-expression:
9796 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9798 offsetof-member-designator:
9799 id-expression
9800 | offsetof-member-designator "." id-expression
9801 | offsetof-member-designator "[" expression "]"
9802 | offsetof-member-designator "->" id-expression */
9804 static cp_expr
9806 {
9808 tree type;
9809 cp_expr expr;
9810 cp_id_kind dummy;
9812 location_t finish_loc;
9814 /* We're about to accept non-integral-constant things, but will
9815 definitely yield an integral constant expression. Save and
9816 restore these values around our local parsing. */
9822 /* Consume the "__builtin_offsetof" token. */
9824 /* Consume the opening `('. */
9825 matching_parens parens;
9827 /* Parse the type-id. */
9829 {
9831 parser->type_definition_forbidden_message
9835 }
9836 /* Look for the `,'. */
9840 /* Build the (type *)null that begins the traditional offsetof macro. */
9841 tree object_ptr
9843 tf_warning_or_error);
9845 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9849 {
9852 {
9854 /* offsetof-member-designator "[" expression "]" */
9860 /* offsetof-member-designator "->" identifier */
9863 /* FALLTHRU */
9866 /* offsetof-member-designator "." identifier */
9874 /* Consume the ")" token. */
9880 /* Error. We know the following require will fail, but
9881 that gives the proper error message. */
9886 }
9887 }
9889 success:
9890 /* Make a location of the form:
9891 __builtin_offsetof (struct s, f)
9892 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9893 with caret at the type-id, ranging from the start of the
9894 "_builtin_offsetof" token to the close paren. */
9896 /* The result will be an INTEGER_CST, so we need to explicitly
9897 preserve the location. */
9900 failure:
9906 }
9908 /* Parse a trait expression.
9910 Returns a representation of the expression, the underlying type
9911 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9913 static cp_expr
9915 {
9916 cp_trait_kind kind;
9922 {
10024 }
10026 /* Get location of initial token. */
10029 /* Consume the token. */
10032 matching_parens parens;
10035 {
10038 }
10044 {
10047 {
10050 }
10054 }
10056 {
10058 {
10062 {
10065 }
10069 }
10070 }
10075 /* Construct a location of the form:
10076 __is_trivially_copyable(_Tp)
10077 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10078 with start == caret, finishing at the close-paren. */
10081 /* Complete the trait expression, which may mean either processing
10082 the trait expr now or saving it for template instantiation. */
10084 {
10093 }
10094 }
10096 /* Parse a lambda expression.
10098 lambda-expression:
10099 lambda-introducer lambda-declarator [opt] compound-statement
10101 Returns a representation of the expression. */
10103 static cp_expr
10105 {
10107 tree type;
10115 {
10117 {
10121 }
10123 }
10125 {
10127 {
10130 }
10132 }
10134 /* We may be in the middle of deferred access check. Disable
10135 it now. */
10146 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10149 /* Now that we've started the type, add the capture fields for any
10150 explicit captures. */
10153 {
10154 /* Inside the class, surrounding template-parameter-lists do not apply. */
10155 unsigned int saved_num_template_parameter_lists
10159 bool fully_implicit_function_template_p
10163 bool auto_is_implicit_function_template_parm_p
10174 /* By virtue of defining a local class, a lambda expression has access to
10175 the private variables of enclosing classes. */
10183 {
10188 }
10190 {
10193 }
10195 /* The capture list was built up in reverse order; fix that now. */
10207 parser->fully_implicit_function_template_p
10211 parser->auto_is_implicit_function_template_parm_p
10213 }
10215 /* This field is only used during parsing of the lambda. */
10218 /* This lambda shouldn't have any proxies left at this point. */
10220 /* And now that we're done, push proxies for an enclosing lambda. */
10225 else
10233 }
10235 /* Parse the beginning of a lambda expression.
10237 lambda-introducer:
10238 [ lambda-capture [opt] ]
10240 LAMBDA_EXPR is the current representation of the lambda expression. */
10242 static void
10244 {
10245 /* Need commas after the first capture. */
10248 /* Eat the leading `['. */
10251 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10259 {
10262 }
10265 {
10267 tree capture_id;
10268 tree capture_init_expr;
10272 enum capture_kind_type
10273 {
10274 BY_COPY,
10275 BY_REFERENCE
10276 };
10280 {
10283 }
10287 else
10290 /* Possibly capture `this'. */
10292 {
10303 explicit_init_p);
10305 }
10307 /* Possibly capture `*this'. */
10310 {
10321 explicit_init_p);
10323 }
10325 /* Remember whether we want to capture as a reference or not. */
10327 {
10330 }
10332 /* Get the identifier. */
10337 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10338 delimiters, but I modified this to stop on unnested ']' as well. It
10339 was already changed to stop on unnested '}', so the
10340 "closing_parenthesis" name is no more misleading with my change. */
10341 {
10347 }
10349 /* Find the initializer for this capture. */
10353 {
10355 /* An explicit initializer exists. */
10358 "lambda capture initializers "
10364 {
10367 }
10368 }
10369 else
10370 {
10373 /* Turn the identifier into an id-expression. */
10374 capture_init_expr
10379 {
10382 }
10385 {
10388 capture_init_expr);
10393 }
10396 {
10399 capture_init_expr))
10403 }
10405 capture_init_expr
10406 = finish_id_expression
10408 capture_init_expr,
10422 {
10425 }
10426 }
10430 {
10435 capture_id);
10439 "capture of %qD redundant with by-reference capture "
10441 }
10444 capture_id,
10445 capture_init_expr,
10447 explicit_init_p);
10449 /* If there is any qualification still in effect, clear it
10450 now; we will be starting fresh with the next capture. */
10454 }
10457 }
10459 /* Parse the (optional) middle of a lambda expression.
10461 lambda-declarator:
10462 < template-parameter-list [opt] >
10463 ( parameter-declaration-clause [opt] )
10464 attribute-specifier [opt]
10465 decl-specifier-seq [opt]
10466 exception-specification [opt]
10467 lambda-return-type-clause [opt]
10469 LAMBDA_EXPR is the current representation of the lambda expression. */
10471 static bool
10473 {
10474 /* 5.1.1.4 of the standard says:
10475 If a lambda-expression does not include a lambda-declarator, it is as if
10476 the lambda-declarator were ().
10477 This means an empty parameter list, no attributes, and no exception
10478 specification. */
10485 cp_decl_specifier_seq lambda_specs;
10488 /* The template-parameter-list is optional, but must begin with
10489 an opening angle if present. */
10491 {
10494 "lambda templates are only available with "
10498 "lambda templates are only available with "
10507 /* We just processed one more parameter list. */
10509 }
10511 /* The parameter-declaration-clause is optional (unless
10512 template-parameter-list was given), but must begin with an
10513 opening parenthesis if present. */
10515 {
10516 matching_parens parens;
10521 /* Parse parameters. */
10524 /* Default arguments shall not be specified in the
10525 parameter-declaration-clause of a lambda-declarator. */
10536 /* In the decl-specifier-seq of the lambda-declarator, each
10537 decl-specifier shall either be mutable or constexpr. */
10541 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10544 {
10549 }
10553 /* Parse optional exception specification. */
10556 /* Parse optional trailing return type. */
10558 {
10561 }
10563 /* The function parameters must be in scope all the way until after the
10564 trailing-return-type in case of decltype. */
10566 }
10570 /* Create the function call operator.
10572 Messing with declarators like this is no uglier than building up the
10573 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10574 other code. */
10575 {
10576 cp_decl_specifier_seq return_type_specs;
10578 tree fco;
10585 else
10586 /* Maybe we will deduce the return type later. */
10590 {
10594 else
10597 }
10606 VIRT_SPEC_UNSPECIFIED,
10607 REF_QUAL_NONE,
10608 tx_qual,
10609 exception_spec,
10615 declarator,
10616 attributes);
10618 {
10621 /* Give the object parameter a different name. */
10625 }
10627 {
10631 }
10640 }
10641 }
10643 /* Parse the body of a lambda expression, which is simply
10645 compound-statement
10647 but which requires special handling.
10648 LAMBDA_EXPR is the current representation of the lambda expression. */
10650 static void
10652 {
10659 else
10660 /* Still increment function_depth so that we don't GC in the
10661 middle of an expression. */
10666 /* Clear this in case we're in the middle of a default argument. */
10670 {
10674 matching_braces braces;
10677 {
10680 /* Originally C++11 required us to peek for 'return expr'; and
10681 process it specially here to deduce the return type. N3638
10682 removed the need for that. */
10690 }
10693 }
10700 else
10702 }
10704 /* Statements [gram.stmt.stmt] */
10706 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10708 static void
10710 {
10714 /* A concept is never expanded normally. */
10720 }
10722 /* Parse a statement.
10724 statement:
10725 labeled-statement
10726 expression-statement
10727 compound-statement
10728 selection-statement
10729 iteration-statement
10730 jump-statement
10731 declaration-statement
10732 try-block
10734 C++11:
10736 statement:
10737 labeled-statement
10738 attribute-specifier-seq (opt) expression-statement
10739 attribute-specifier-seq (opt) compound-statement
10740 attribute-specifier-seq (opt) selection-statement
10741 attribute-specifier-seq (opt) iteration-statement
10742 attribute-specifier-seq (opt) jump-statement
10743 declaration-statement
10744 attribute-specifier-seq (opt) try-block
10746 init-statement:
10747 expression-statement
10748 simple-declaration
10750 TM Extension:
10752 statement:
10753 atomic-statement
10755 IN_COMPOUND is true when the statement is nested inside a
10756 cp_parser_compound_statement; this matters for certain pragmas.
10758 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10759 is a (possibly labeled) if statement which is not enclosed in braces
10760 and has an else clause. This is used to implement -Wparentheses.
10762 CHAIN is a vector of if-else-if conditions. */
10764 static void
10768 {
10773 restart:
10776 /* There is no statement yet. */
10782 /* In obj-c++, seeing '[[' might be the either the beginning of
10783 c++11 attributes, or a nested objc-message-expression. So
10784 let's parse the c++11 attributes tentatively. */
10788 {
10791 }
10793 /* Peek at the next token. */
10795 /* Remember the location of the first token in the statement. */
10798 /* If this is a keyword, then that will often determine what kind of
10799 statement we have. */
10801 {
10805 {
10808 /* Looks like a labeled-statement with a case label.
10809 Parse the label, and then use tail recursion to parse
10810 the statement. */
10833 /* Objective-C++ exception-handling constructs. */
10847 /* This must be a namespace alias definition. */
10863 /* It might be a keyword like `int' that can start a
10864 declaration-statement. */
10866 }
10867 }
10869 {
10870 /* If the next token is a `:', then we are looking at a
10871 labeled-statement. */
10874 {
10875 /* Looks like a labeled-statement with an ordinary label.
10876 Parse the label, and then use tail recursion to parse
10877 the statement. */
10882 }
10883 }
10884 /* Anything that starts with a `{' must be a compound-statement. */
10887 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10888 a statement all its own. */
10890 {
10891 /* Only certain OpenMP pragmas are attached to statements, and thus
10892 are considered statements themselves. All others are not. In
10893 the context of a compound, accept the pragma as a "statement" and
10894 return so that we can check for a close brace. Otherwise we
10895 require a real statement and must go back and read one. */
10901 }
10903 {
10906 }
10908 /* Everything else must be a declaration-statement or an
10909 expression-statement. Try for the declaration-statement
10910 first, unless we are looking at a `;', in which case we know that
10911 we have an expression-statement. */
10913 {
10915 {
10917 {
10918 /* Attributes should be parsed as part of the the
10919 declaration, so let's un-parse them. */
10922 }
10925 /* Try to parse the declaration-statement. */
10927 /* If that worked, we're done. */
10930 }
10931 /* All preceding labels have been parsed at this point. */
10935 /* Look for an expression-statement instead. */
10938 /* Handle [[fallthrough]];. */
10940 {
10941 /* The next token after the fallthrough attribute is ';'. */
10943 {
10944 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10946 IFN_FALLTHROUGH,
10949 }
10950 else
10954 }
10955 }
10957 /* Set the line number for the statement. */
10961 /* Allow "[[fallthrough]];", but warn otherwise. */
10964 OPT_Wattributes,
10966 }
10968 /* Append ATTR to attribute list ATTRS. */
10970 static tree
10972 {
10978 }
10980 /* Parse the label for a labeled-statement, i.e.
10982 identifier :
10983 case constant-expression :
10984 default :
10986 GNU Extension:
10987 case constant-expression ... constant-expression : statement
10989 When a label is parsed without errors, the label is added to the
10990 parse tree by the finish_* functions, so this function doesn't
10991 have to return the label. */
10993 static void
10995 {
11000 /* The next token should be an identifier. */
11004 {
11007 }
11009 /* Remember whether this case or a user-defined label is allowed to fall
11010 through to. */
11015 {
11017 {
11021 /* Consume the `case' token. */
11023 /* Parse the constant-expression. */
11030 {
11031 /* Consume the `...' token. */
11037 /* We don't need to emit warnings here, as the common code
11038 will do this for us. */
11039 }
11040 else
11044 {
11048 }
11049 else
11052 expr);
11053 }
11057 /* Consume the `default' token. */
11061 {
11065 }
11066 else
11071 /* Anything else must be an ordinary label. */
11076 }
11078 /* Require the `:' token. */
11081 /* An ordinary label may optionally be followed by attributes.
11082 However, this is only permitted if the attributes are then
11083 followed by a semicolon. This is because, for backward
11084 compatibility, when parsing
11085 lab: __attribute__ ((unused)) int i;
11086 we want the attribute to attach to "i", not "lab". */
11089 {
11090 tree attrs;
11097 ;
11098 else
11100 }
11106 }
11108 /* Parse an expression-statement.
11110 expression-statement:
11111 expression [opt] ;
11113 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11114 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11115 indicates whether this expression-statement is part of an
11116 expression statement. */
11118 static tree
11120 {
11125 /* There might be attribute fallthrough. */
11128 /* If the next token is a ';', then there is no expression
11129 statement. */
11131 {
11135 {
11138 }
11139 }
11141 /* Handle [[fallthrough]];. */
11143 {
11144 /* The next token after the fallthrough attribute is ';'. */
11146 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11149 else
11153 }
11155 /* Allow "[[fallthrough]];", but warn otherwise. */
11160 /* Give a helpful message for "A<T>::type t;" and the like. */
11163 {
11170 {
11171 /* A::A a; */
11176 }
11177 }
11179 /* Consume the final `;'. */
11184 /* This is the final expression statement of a statement
11185 expression. */
11191 }
11193 /* Parse a compound-statement.
11195 compound-statement:
11196 { statement-seq [opt] }
11198 GNU extension:
11200 compound-statement:
11201 { label-declaration-seq [opt] statement-seq [opt] }
11203 label-declaration-seq:
11204 label-declaration
11205 label-declaration-seq label-declaration
11207 Returns a tree representing the statement. */
11209 static tree
11212 {
11213 tree compound_stmt;
11214 matching_braces braces;
11216 /* Consume the `{'. */
11223 /* Begin the compound-statement. */
11225 /* If the next keyword is `__label__' we have a label declaration. */
11228 /* Parse an (optional) statement-seq. */
11230 /* Finish the compound-statement. */
11232 /* Consume the `}'. */
11236 }
11238 /* Parse an (optional) statement-seq.
11240 statement-seq:
11241 statement
11242 statement-seq [opt] statement */
11244 static void
11246 {
11247 /* Scan statements until there aren't any more. */
11249 {
11252 /* If we are looking at a `}', then we have run out of
11253 statements; the same is true if we have reached the end
11254 of file, or have stumbled upon a stray '@end'. */
11261 /* If we are in a compound statement and find 'else' then
11262 something went wrong. */
11264 {
11267 else
11268 {
11271 }
11272 }
11274 /* Parse the statement. */
11276 }
11277 }
11279 /* Return true if we're looking at (init; cond), false otherwise. */
11281 static bool
11283 {
11284 /* Save tokens so that we can put them back. */
11287 /* Look for ';' that is not nested in () or {}. */
11290 CPP_SEMICOLON,
11293 /* Roll back the tokens we skipped. */
11297 }
11299 /* Parse a selection-statement.
11301 selection-statement:
11302 if ( init-statement [opt] condition ) statement
11303 if ( init-statement [opt] condition ) statement else statement
11304 switch ( init-statement [opt] condition ) statement
11306 Returns the new IF_STMT or SWITCH_STMT.
11308 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11309 is a (possibly labeled) if statement which is not enclosed in
11310 braces and has an else clause. This is used to implement
11311 -Wparentheses.
11313 CHAIN is a vector of if-else-if conditions. This is used to implement
11314 -Wduplicated-cond. */
11316 static tree
11319 {
11322 token_indent_info guard_tinfo;
11327 /* Peek at the next token. */
11331 /* See what kind of keyword it is. */
11334 {
11337 {
11338 tree statement;
11339 tree condition;
11344 RID_CONSTEXPR))
11345 {
11351 }
11353 /* Look for the `('. */
11354 matching_parens parens;
11356 {
11359 }
11361 /* Begin the selection-statement. */
11363 {
11366 }
11367 else
11370 /* Parse the optional init-statement. */
11372 {
11373 tree decl;
11376 "init-statement in selection statements only available "
11379 }
11381 /* Parse the condition. */
11383 /* Look for the `)'. */
11389 {
11393 /* Add the condition. */
11400 /* Parse the then-clause. */
11404 /* Outside a template, the non-selected branch of a constexpr
11405 if is a 'discarded statement', i.e. unevaluated. */
11410 {
11413 }
11416 guard_tinfo);
11423 {
11427 }
11429 /* If the next token is `else', parse the else-clause. */
11431 RID_ELSE))
11432 {
11436 {
11439 }
11441 guard_tinfo
11443 /* Consume the `else' keyword. */
11446 {
11448 RID_IF)
11450 {
11451 /* We've got "if (COND) else if (COND2)". Start
11452 the condition chain and add COND as the first
11453 element. */
11457 {
11458 /* Wrap it in a NOP_EXPR so that we can set the
11459 location of the condition. */
11461 condition);
11464 }
11465 }
11467 RID_IF))
11468 {
11469 /* This is if-else without subsequent if. Zap the
11470 condition chain; we would have already warned at
11471 this point. */
11474 }
11475 }
11477 /* Parse the else-clause. */
11483 /* If we are currently parsing a then-clause, then
11484 IF_P will not be NULL. We set it to true to
11485 indicate that this if statement has an else clause.
11486 This may trigger the Wparentheses warning below
11487 when we get back up to the parent if statement. */
11492 {
11496 }
11497 }
11498 else
11499 {
11500 /* This if statement does not have an else clause. If
11501 NESTED_IF is true, then the then-clause has an if
11502 statement which does have an else clause. We warn
11503 about the potential ambiguity. */
11506 "suggest explicit braces to avoid ambiguous"
11509 {
11510 /* We don't need the condition chain anymore. */
11513 }
11514 }
11516 /* Now we're all done with the if-statement. */
11518 }
11519 else
11520 {
11524 /* Add the condition. */
11527 /* Parse the body of the switch-statement. */
11533 guard_tinfo);
11537 /* Now we're all done with the switch-statement. */
11539 }
11542 }
11548 }
11549 }
11551 /* Parse a condition.
11553 condition:
11554 expression
11555 type-specifier-seq declarator = initializer-clause
11556 type-specifier-seq declarator braced-init-list
11558 GNU Extension:
11560 condition:
11561 type-specifier-seq declarator asm-specification [opt]
11562 attributes [opt] = assignment-expression
11564 Returns the expression that should be tested. */
11566 static tree
11568 {
11569 cp_decl_specifier_seq type_specifiers;
11573 /* Try the declaration first. */
11575 /* New types are not allowed in the type-specifier-seq for a
11576 condition. */
11578 parser->type_definition_forbidden_message
11580 /* Parse the type-specifier-seq. */
11582 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11585 /* Restore the saved message. */
11587 /* If all is well, we might be looking at a declaration. */
11589 {
11590 tree decl;
11591 tree asm_specification;
11592 tree attributes;
11596 /* Parse the declarator. */
11602 /* Parse the attributes. */
11604 /* Parse the asm-specification. */
11606 /* If the next token is not an `=' or '{', then we might still be
11607 looking at an expression. For example:
11609 if (A(a).x)
11611 looks like a decl-specifier-seq and a declarator -- but then
11612 there is no `=', so this is an expression. */
11617 /* If we did see an `=' or '{', then we are looking at a declaration
11618 for sure. */
11620 {
11621 tree pushed_scope;
11625 /* Create the declaration. */
11631 /* Parse the initializer. */
11633 {
11637 }
11638 else
11639 {
11640 /* Consume the `='. */
11643 }
11647 /* Process the initializer. */
11650 asm_specification,
11651 flags);
11657 }
11658 }
11659 /* If we didn't even get past the declarator successfully, we are
11660 definitely not looking at a declaration. */
11661 else
11664 /* Otherwise, we are looking at an expression. */
11666 }
11668 /* Parses a for-statement or range-for-statement until the closing ')',
11669 not included. */
11671 static tree
11673 {
11677 /* Begin the for-statement. */
11680 /* Parse the initialization. */
11685 else
11687 }
11689 static tree
11692 {
11693 /* Normal for loop */
11696 tree stmt;
11699 /* The init-statement has already been parsed in
11700 cp_parser_init_statement, so no work is needed here. */
11703 /* If there's a condition, process it. */
11707 {
11711 }
11713 {
11717 }
11719 /* Look for the `;'. */
11722 /* If there's an expression, process it. */
11728 }
11730 /* Tries to parse a range-based for-statement:
11732 range-based-for:
11733 decl-specifier-seq declarator : expression
11735 The decl-specifier-seq declarator and the `:' are already parsed by
11736 cp_parser_init_statement. If processing_template_decl it returns a
11737 newly created RANGE_FOR_STMT; if not, it is converted to a
11738 regular FOR_STMT. */
11740 static tree
11743 {
11750 /* Get the range declaration momentarily out of the way so that
11751 the range expression doesn't clash with it. */
11753 {
11755 {
11757 /* For decomposition declaration get all of the corresponding
11758 declarations out of the way. */
11762 {
11768 {
11774 }
11775 }
11776 }
11778 {
11783 }
11784 }
11787 {
11790 }
11791 else
11794 /* Put the range declaration(s) back into scope. */
11796 {
11800 }
11802 /* If in template, STMT is converted to a normal for-statement
11803 at instantiation. If not, it is done just ahead. */
11805 {
11815 /* do_auto_deduction doesn't mess with template init-lists. */
11818 }
11819 else
11820 {
11824 unroll);
11825 }
11827 }
11829 /* Subroutine of cp_convert_range_for: given the initializer expression,
11830 builds up the range temporary. */
11832 static tree
11834 {
11837 /* Find out the type deduced by the declaration
11838 `auto &&__range = range_expr'. */
11843 /* Create the __range variable. */
11850 }
11852 /* Used by cp_parser_range_for in template context: we aren't going to
11853 do a full conversion yet, but we still need to resolve auto in the
11854 type of the for-range-declaration if present. This is basically
11855 a shortcut version of cp_convert_range_for. */
11857 static void
11859 {
11862 {
11865 iter_type = (cp_parser_perform_range_for_lookup
11868 {
11870 iter_type);
11872 RO_UNARY_STAR,
11873 tf_warning_or_error);
11876 }
11877 }
11878 }
11880 /* Converts a range-based for-statement into a normal
11881 for-statement, as per the definition.
11883 for (RANGE_DECL : RANGE_EXPR)
11884 BLOCK
11886 should be equivalent to:
11888 {
11889 auto &&__range = RANGE_EXPR;
11890 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11891 __begin != __end;
11892 ++__begin)
11893 {
11894 RANGE_DECL = *__begin;
11895 BLOCK
11896 }
11897 }
11899 If RANGE_EXPR is an array:
11900 BEGIN_EXPR = __range
11901 END_EXPR = __range + ARRAY_SIZE(__range)
11902 Else if RANGE_EXPR has a member 'begin' or 'end':
11903 BEGIN_EXPR = __range.begin()
11904 END_EXPR = __range.end()
11905 Else:
11906 BEGIN_EXPR = begin(__range)
11907 END_EXPR = end(__range);
11909 If __range has a member 'begin' but not 'end', or vice versa, we must
11910 still use the second alternative (it will surely fail, however).
11911 When calling begin()/end() in the third alternative we must use
11912 argument dependent lookup, but always considering 'std' as an associated
11913 namespace. */
11915 tree
11919 {
11927 /* If an error happened previously do nothing or else a lot of
11928 unhelpful errors would be issued. */
11930 else
11931 {
11932 tree range_temp;
11936 /* Can't bind a reference to an array of runtime bound. */
11938 else
11939 {
11944 LOOKUP_ONLYCONVERTING);
11946 }
11949 }
11951 /* The new for initialization statement. */
11959 LOOKUP_ONLYCONVERTING);
11970 LOOKUP_ONLYCONVERTING);
11974 /* The new for condition. */
11981 /* The new increment expression. */
11984 tf_warning_or_error);
11990 /* The declaration is initialized with *__begin inside the loop body. */
11993 tf_warning_or_error),
11995 LOOKUP_ONLYCONVERTING);
12000 }
12002 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12003 We need to solve both at the same time because the method used
12004 depends on the existence of members begin or end.
12005 Returns the type deduced for the iterator expression. */
12007 static tree
12009 {
12011 {
12014 }
12017 {
12022 }
12024 {
12025 /* If RANGE is an array, we will use pointer arithmetic. */
12028 range,
12032 }
12033 else
12034 {
12035 /* If it is not an array, we must do a bit of magic. */
12045 tf_warning_or_error);
12048 tf_warning_or_error);
12051 {
12052 /* Use the member functions. */
12055 }
12056 else
12057 {
12058 /* Use global functions with ADL. */
12065 tf_warning_or_error);
12067 tf_warning_or_error);
12069 tf_warning_or_error);
12071 tf_warning_or_error);
12074 }
12076 /* Last common checks. */
12078 {
12079 /* If one of the expressions is an error do no more checks. */
12082 }
12085 /* Can happen, when, eg, in a template context, Koenig lookup
12086 can't resolve begin/end (c++/58503). */
12088 else
12089 {
12091 /* The unqualified type of the __begin and __end temporaries should
12092 be the same, as required by the multiple auto declaration. */
12094 {
12101 /* P0184R0 allows __begin and __end to have different types,
12102 but make sure they are comparable so we can give a better
12104 else
12108 }
12110 }
12111 }
12112 }
12114 /* Helper function for cp_parser_perform_range_for_lookup.
12115 Builds a tree for RANGE.IDENTIFIER(). */
12117 static tree
12119 {
12132 tf_warning_or_error);
12135 }
12137 /* Parse an iteration-statement.
12139 iteration-statement:
12140 while ( condition ) statement
12141 do statement while ( expression ) ;
12142 for ( init-statement condition [opt] ; expression [opt] )
12143 statement
12145 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12147 static tree
12150 {
12153 tree statement;
12155 token_indent_info guard_tinfo;
12157 /* Peek at the next token. */
12164 /* Remember whether or not we are already within an iteration
12165 statement. */
12168 /* See what kind of keyword it is. */
12171 {
12173 {
12174 tree condition;
12176 /* Begin the while-statement. */
12178 /* Look for the `('. */
12179 matching_parens parens;
12181 /* Parse the condition. */
12184 /* Look for the `)'. */
12186 /* Parse the dependent statement. */
12192 /* We're done with the while-statement. */
12194 }
12198 {
12199 tree expression;
12201 /* Begin the do-statement. */
12203 /* Parse the body of the do-statement. */
12210 /* Look for the `while' keyword. */
12212 /* Look for the `('. */
12213 matching_parens parens;
12215 /* Parse the expression. */
12217 /* We're done with the do-statement. */
12219 /* Look for the `)'. */
12221 /* Look for the `;'. */
12223 }
12227 {
12228 /* Look for the `('. */
12229 matching_parens parens;
12234 /* Look for the `)'. */
12237 /* Parse the body of the for-statement. */
12244 /* We're done with the for-statement. */
12246 }
12253 }
12256 }
12258 /* Parse a init-statement or the declarator of a range-based-for.
12259 Returns true if a range-based-for declaration is seen.
12261 init-statement:
12262 expression-statement
12263 simple-declaration */
12265 static bool
12267 {
12268 /* If the next token is a `;', then we have an empty
12269 expression-statement. Grammatically, this is also a
12270 simple-declaration, but an invalid one, because it does not
12271 declare anything. Therefore, if we did not handle this case
12272 specially, we would issue an error message about an invalid
12273 declaration. */
12275 {
12279 /* A colon is used in range-based for. */
12282 /* We're going to speculatively look for a declaration, falling back
12283 to an expression, if necessary. */
12285 /* Parse the declaration. */
12288 decl);
12291 {
12292 /* It is a range-for, consume the ':' */
12296 {
12298 "range-based %<for%> loops only available with "
12301 }
12302 }
12303 else
12304 /* The ';' is not consumed yet because we told
12305 cp_parser_simple_declaration not to. */
12310 /* If the tentative parse failed, then we shall need to look for an
12311 expression-statement. */
12312 }
12313 /* If we are here, it is an expression-statement. */
12316 }
12318 /* Parse a jump-statement.
12320 jump-statement:
12321 break ;
12322 continue ;
12323 return expression [opt] ;
12324 return braced-init-list ;
12325 goto identifier ;
12327 GNU extension:
12329 jump-statement:
12330 goto * expression ;
12332 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12334 static tree
12336 {
12342 /* Peek at the next token. */
12347 /* See what kind of keyword it is. */
12350 {
12354 {
12371 }
12377 {
12381 /* Fall through. */
12391 }
12396 {
12397 tree expr;
12401 {
12405 }
12408 else
12409 /* If the next token is a `;', then there is no
12410 expression. */
12412 /* Build the return-statement. */
12415 else
12417 /* Look for the final `;'. */
12419 }
12425 {
12428 }
12430 /* Create the goto-statement. */
12432 {
12433 /* Issue a warning about this use of a GNU extension. */
12435 /* Consume the '*' token. */
12437 /* Parse the dependent expression. */
12439 }
12440 else
12442 /* Look for the final `;'. */
12449 }
12452 }
12454 /* Parse a declaration-statement.
12456 declaration-statement:
12457 block-declaration */
12459 static void
12461 {
12464 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12467 /* Parse the block-declaration. */
12470 /* Free any declarators allocated. */
12472 }
12474 /* Some dependent statements (like `if (cond) statement'), are
12475 implicitly in their own scope. In other words, if the statement is
12476 a single statement (as opposed to a compound-statement), it is
12477 none-the-less treated as if it were enclosed in braces. Any
12478 declarations appearing in the dependent statement are out of scope
12479 after control passes that point. This function parses a statement,
12480 but ensures that is in its own scope, even if it is not a
12481 compound-statement.
12483 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12484 is a (possibly labeled) if statement which is not enclosed in
12485 braces and has an else clause. This is used to implement
12486 -Wparentheses.
12488 CHAIN is a vector of if-else-if conditions. This is used to implement
12489 -Wduplicated-cond.
12491 Returns the new statement. */
12493 static tree
12497 {
12498 tree statement;
12501 token_indent_info body_tinfo
12507 /* Mark if () ; with a special NOP_EXPR. */
12509 {
12520 }
12521 /* if a compound is opened, we simply parse the statement directly. */
12524 /* If the token is not a `{', then we must take special action. */
12525 else
12526 {
12527 /* Create a compound-statement. */
12529 /* Parse the dependent-statement. */
12532 /* Finish the dummy compound-statement. */
12534 }
12536 token_indent_info next_tinfo
12545 /* Return the statement. */
12547 }
12549 /* For some dependent statements (like `while (cond) statement'), we
12550 have already created a scope. Therefore, even if the dependent
12551 statement is a compound-statement, we do not want to create another
12552 scope. */
12554 static void
12557 {
12558 /* If the token is a `{', then we must take special action. */
12560 {
12561 token_indent_info body_tinfo
12567 token_indent_info next_tinfo
12576 }
12577 else
12578 {
12579 /* Avoid calling cp_parser_compound_statement, so that we
12580 don't create a new scope. Do everything else by hand. */
12581 matching_braces braces;
12583 /* If the next keyword is `__label__' we have a label declaration. */
12586 /* Parse an (optional) statement-seq. */
12589 }
12590 }
12592 /* Declarations [gram.dcl.dcl] */
12594 /* Parse an optional declaration-sequence.
12596 declaration-seq:
12597 declaration
12598 declaration-seq declaration */
12600 static void
12602 {
12604 {
12615 {
12616 /* A declaration consisting of a single semicolon is
12617 invalid. Allow it unless we're being pedantic. */
12622 }
12624 /* If we're entering or exiting a region that's implicitly
12625 extern "C", modify the lang context appropriately. */
12627 {
12630 }
12632 {
12635 }
12638 {
12639 /* A top-level declaration can consist solely of a #pragma.
12640 A nested declaration cannot, so this is done here and not
12641 in cp_parser_declaration. (A #pragma at block scope is
12642 handled in cp_parser_statement.) */
12645 }
12647 /* Parse the declaration itself. */
12649 }
12650 }
12652 /* Parse a declaration.
12654 declaration:
12655 block-declaration
12656 function-definition
12657 template-declaration
12658 explicit-instantiation
12659 explicit-specialization
12660 linkage-specification
12661 namespace-definition
12663 C++17:
12664 deduction-guide
12666 GNU extension:
12668 declaration:
12669 __extension__ declaration */
12671 static void
12673 {
12674 cp_token token1;
12675 cp_token token2;
12680 /* Check for the `__extension__' keyword. */
12682 {
12683 /* Parse the qualified declaration. */
12685 /* Restore the PEDANTIC flag. */
12689 }
12691 /* Try to figure out what kind of declaration is present. */
12696 else
12697 {
12700 }
12702 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12705 /* If the next token is `extern' and the following token is a string
12706 literal, then we have a linkage specification. */
12710 /* If the next token is `template', then we have either a template
12711 declaration, an explicit instantiation, or an explicit
12712 specialization. */
12714 {
12715 /* `template <>' indicates a template specialization. */
12719 /* `template <' indicates a template declaration. */
12722 /* Anything else must be an explicit instantiation. */
12723 else
12725 }
12726 /* If the next token is `export', then we have a template
12727 declaration. */
12730 /* If the next token is `extern', 'static' or 'inline' and the one
12731 after that is `template', we have a GNU extended explicit
12732 instantiation directive. */
12739 /* If the next token is `namespace', check for a named or unnamed
12740 namespace definition. */
12749 /* An unnamed namespace definition. */
12753 /* An inline (associated) namespace definition. */
12757 /* Objective-C++ declaration/definition. */
12764 /* At this point we may have a template declared by a concept
12765 introduction. */
12770 else
12771 /* Try to parse a block-declaration, or a function-definition. */
12774 /* Free any declarators allocated. */
12776 }
12778 /* Parse a block-declaration.
12780 block-declaration:
12781 simple-declaration
12782 asm-definition
12783 namespace-alias-definition
12784 using-declaration
12785 using-directive
12787 GNU Extension:
12789 block-declaration:
12790 __extension__ block-declaration
12792 C++0x Extension:
12794 block-declaration:
12795 static_assert-declaration
12797 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12798 part of a declaration-statement. */
12800 static void
12803 {
12807 /* Check for the `__extension__' keyword. */
12809 {
12810 /* Parse the qualified declaration. */
12812 /* Restore the PEDANTIC flag. */
12816 }
12818 /* Peek at the next token to figure out which kind of declaration is
12819 present. */
12822 /* If the next keyword is `asm', we have an asm-definition. */
12824 {
12828 }
12829 /* If the next keyword is `namespace', we have a
12830 namespace-alias-definition. */
12833 /* If the next keyword is `using', we have a
12834 using-declaration, a using-directive, or an alias-declaration. */
12836 {
12841 /* If the token after `using' is `namespace', then we have a
12842 using-directive. */
12846 /* If the second token after 'using' is '=', then we have an
12847 alias-declaration. */
12853 /* Otherwise, it's a using-declaration. */
12854 else
12857 }
12858 /* If the next keyword is `__label__' we have a misplaced label
12859 declaration. */
12861 {
12865 /* If the next token is now a `;', consume it. */
12868 }
12869 /* If the next token is `static_assert' we have a static assertion. */
12872 /* Anything else must be a simple-declaration. */
12873 else
12876 }
12878 /* Parse a simple-declaration.
12880 simple-declaration:
12881 decl-specifier-seq [opt] init-declarator-list [opt] ;
12882 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12883 brace-or-equal-initializer ;
12885 init-declarator-list:
12886 init-declarator
12887 init-declarator-list , init-declarator
12889 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12890 function-definition as a simple-declaration.
12892 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12893 parsed declaration if it is an uninitialized single declarator not followed
12894 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12895 if present, will not be consumed. */
12897 static void
12901 {
12902 cp_decl_specifier_seq decl_specifiers;
12911 /* Defer access checks until we know what is being declared; the
12912 checks for names appearing in the decl-specifier-seq should be
12913 done as if we were in the scope of the thing being declared. */
12916 /* Parse the decl-specifier-seq. We have to keep track of whether
12917 or not the decl-specifier-seq declares a named class or
12918 enumeration type, since that is the only case in which the
12919 init-declarator-list is allowed to be empty.
12921 [dcl.dcl]
12923 In a simple-declaration, the optional init-declarator-list can be
12924 omitted only when declaring a class or enumeration, that is when
12925 the decl-specifier-seq contains either a class-specifier, an
12926 elaborated-type-specifier, or an enum-specifier. */
12928 CP_PARSER_FLAGS_OPTIONAL,
12931 /* We no longer need to defer access checks. */
12934 /* In a block scope, a valid declaration must always have a
12935 decl-specifier-seq. By not trying to parse declarators, we can
12936 resolve the declaration/expression ambiguity more quickly. */
12939 {
12942 }
12944 /* If the next two tokens are both identifiers, the code is
12945 erroneous. The usual cause of this situation is code like:
12947 T t;
12949 where "T" should name a type -- but does not. */
12952 {
12953 /* If parsing tentatively, we should commit; we really are
12954 looking at a declaration. */
12956 /* Give up. */
12958 }
12960 /* If we have seen at least one decl-specifier, and the next token
12961 is not a parenthesis, then we must be looking at a declaration.
12962 (After "int (" we might be looking at a functional cast.) */
12969 /* Look for C++17 decomposition declaration. */
12977 {
12978 tree decl
12980 maybe_range_for_decl,
12983 /* The next token should be either a `,' or a `;'. */
12985 /* If it's a `;', we are done. */
12989 {
12993 }
12994 /* Anything else is an error. */
12995 else
12996 {
12997 /* If we have already issued an error message we don't need
12998 to issue another one. */
13003 /* Skip tokens until we reach the end of the statement. */
13005 /* If the next token is now a `;', consume it. */
13009 }
13010 }
13011 else
13014 tree last_type;
13016 /* NULL_TREE if both variable and function declaration are allowed,
13017 error_mark_node if function declaration are not allowed and
13018 a FUNCTION_DECL that should be diagnosed if it is followed by
13019 variable declarations. */
13020 tree auto_function_declaration;
13023 auto_specifier_p
13027 /* Keep going until we hit the `;' at the end of the simple
13028 declaration. */
13031 CPP_SEMICOLON))
13032 {
13035 tree decl;
13039 {
13040 /* If we are processing next declarator, comma is expected */
13045 {
13049 }
13050 }
13051 else
13054 /* Parse the init-declarator. */
13057 function_definition_allowed_p,
13059 declares_class_or_enum,
13061 maybe_range_for_decl,
13064 /* If an error occurred while parsing tentatively, exit quickly.
13065 (That usually happens when in the body of a function; each
13066 statement is treated as a declaration-statement until proven
13067 otherwise.) */
13072 {
13073 /* If the init-declarator-list contains more than one
13074 init-declarator, they shall all form declarations of
13075 variables. */
13077 auto_function_declaration
13081 {
13083 "non-variable %qD in declaration with more than one "
13088 }
13089 }
13093 {
13097 {
13098 /* If the list of declarators contains more than one declarator,
13099 the type of each declared variable is determined as described
13100 above. If the type deduced for the template parameter U is not
13101 the same in each deduction, the program is ill-formed. */
13106 }
13107 else
13109 }
13111 /* Handle function definitions specially. */
13113 {
13114 /* If the next token is a `,', then we are probably
13115 processing something like:
13117 void f() {}, *p;
13119 which is erroneous. */
13121 {
13124 "mixing"
13126 }
13127 /* Otherwise, we're done with the list of declarators. */
13128 else
13129 {
13132 }
13133 }
13136 /* The next token should be either a `,' or a `;'. */
13138 /* If it's a `,', there are more declarators to come. */
13141 /* If it's a `;', we are done. */
13145 {
13150 }
13151 /* Anything else is an error. */
13152 else
13153 {
13154 /* If we have already issued an error message we don't need
13155 to issue another one. */
13160 /* Skip tokens until we reach the end of the statement. */
13162 /* If the next token is now a `;', consume it. */
13166 }
13167 /* After the first time around, a function-definition is not
13168 allowed -- even if it was OK at first. For example:
13170 int i, f() {}
13172 is not valid. */
13174 }
13176 /* Issue an error message if no declarators are present, and the
13177 decl-specifier-seq does not itself declare a class or
13178 enumeration: [dcl.dcl]/3. */
13180 {
13182 {
13186 /* Ensure an error is issued anyway when finish_decltype_type,
13187 called via cp_parser_decl_specifier_seq, returns a class or
13188 an enumeration (c++/51786). */
13191 }
13192 /* Perform any deferred access checks. */
13194 }
13196 /* Consume the `;'. */
13197 finish:
13201 {
13207 }
13209 done:
13211 }
13213 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13214 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13215 initializer ; */
13217 static tree
13222 {
13227 /* Parse the identifier-list. */
13231 {
13239 }
13243 {
13249 else
13250 {
13253 }
13254 }
13260 tree pushed_scope;
13267 NULL_TREE);
13274 cp_expr e;
13275 cp_decl_specifier_seq decl_specs;
13280 {
13283 else
13286 tree elt_pushed_scope;
13292 {
13293 /* Ensure we've diagnosed redeclaration if we aren't creating
13294 a new VAR_DECL. */
13297 }
13298 else
13302 }
13305 {
13308 }
13312 {
13320 || (is_direct_init
13323 {
13327 }
13330 {
13335 }
13336 }
13338 {
13340 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13341 the underlying DECL. */
13343 }
13349 {
13352 }
13355 }
13357 /* Parse a decl-specifier-seq.
13359 decl-specifier-seq:
13360 decl-specifier-seq [opt] decl-specifier
13361 decl-specifier attribute-specifier-seq [opt] (C++11)
13363 decl-specifier:
13364 storage-class-specifier
13365 type-specifier
13366 function-specifier
13367 friend
13368 typedef
13370 GNU Extension:
13372 decl-specifier:
13373 attributes
13375 Concepts Extension:
13377 decl-specifier:
13378 concept
13380 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13382 The parser flags FLAGS is used to control type-specifier parsing.
13384 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13385 flags:
13387 1: one of the decl-specifiers is an elaborated-type-specifier
13388 (i.e., a type declaration)
13389 2: one of the decl-specifiers is an enum-specifier or a
13390 class-specifier (i.e., a type definition)
13392 */
13394 static void
13396 cp_parser_flags flags,
13399 {
13403 cp_decl_spec ds;
13405 /* Clear DECL_SPECS. */
13408 /* Assume no class or enumeration type is declared. */
13411 /* Keep reading specifiers until there are no more to read. */
13413 {
13418 /* Peek at the next token. */
13421 /* Save the first token of the decl spec list for error
13422 reporting. */
13425 /* Handle attributes. */
13427 {
13428 /* Parse the attributes. */
13431 /* In a sequence of declaration specifiers, c++11 attributes
13432 appertain to the type that precede them. In that case
13433 [dcl.spec]/1 says:
13435 The attribute-specifier-seq affects the type only for
13436 the declaration it appears in, not other declarations
13437 involving the same type.
13439 But for now let's force the user to position the
13440 attribute either at the beginning of the declaration or
13441 after the declarator-id, which would clearly mean that it
13442 applies to the declarator. */
13444 {
13446 /* The c++11 attribute is at the beginning of the
13447 declaration. It appertains to the entity being
13449 else
13450 {
13452 {
13453 /* This is an attribute following a
13454 class-specifier. */
13459 }
13460 else
13461 {
13462 decl_specs->std_attributes
13466 }
13468 }
13469 }
13471 decl_specs->attributes
13476 }
13477 /* Assume we will find a decl-specifier keyword. */
13479 /* If the next token is an appropriate keyword, we can simply
13480 add it to the list. */
13482 {
13483 /* decl-specifier:
13484 friend
13485 constexpr */
13488 {
13493 }
13494 else
13495 {
13497 /* Consume the token. */
13499 }
13512 /* function-specifier:
13513 inline
13514 virtual
13515 explicit */
13522 /* decl-specifier:
13523 typedef */
13526 /* Consume the token. */
13528 /* A constructor declarator cannot appear in a typedef. */
13530 /* The "typedef" keyword can only occur in a declaration; we
13531 may as well commit at this point. */
13538 /* storage-class-specifier:
13539 auto
13540 register
13541 static
13542 extern
13543 mutable
13545 GNU Extension:
13546 thread */
13549 {
13550 /* Consume the token. */
13553 /* Complain about `auto' as a storage specifier, if
13554 we're complaining about C++0x compatibility. */
13558 "%<auto%> changes meaning in C++11; "
13561 /* Set the storage class anyway. */
13563 token);
13564 }
13565 else
13566 /* C++0x auto type-specifier. */
13574 /* Consume the token. */
13577 token);
13580 /* Consume the token. */
13586 /* We did not yet find a decl-specifier yet. */
13589 }
13606 /* Constructors are a special case. The `S' in `S()' is not a
13607 decl-specifier; it is the beginning of the declarator. */
13608 constructor_p
13609 = (!found_decl_spec
13610 && constructor_possible_p
13611 && (cp_parser_constructor_declarator_p
13614 /* If we don't have a DECL_SPEC yet, then we must be looking at
13615 a type-specifier. */
13617 {
13620 tree type_spec;
13622 type_spec
13624 decl_specs,
13630 /* If this type-specifier referenced a user-defined type
13631 (a typedef, class-name, etc.), then we can't allow any
13632 more such type-specifiers henceforth.
13634 [dcl.spec]
13636 The longest sequence of decl-specifiers that could
13637 possibly be a type name is taken as the
13638 decl-specifier-seq of a declaration. The sequence shall
13639 be self-consistent as described below.
13641 [dcl.type]
13643 As a general rule, at most one type-specifier is allowed
13644 in the complete decl-specifier-seq of a declaration. The
13645 only exceptions are the following:
13647 -- const or volatile can be combined with any other
13648 type-specifier.
13650 -- signed or unsigned can be combined with char, long,
13651 short, or int.
13653 -- ..
13655 Example:
13657 typedef char* Pc;
13658 void g (const int Pc);
13660 Here, Pc is *not* part of the decl-specifier seq; it's
13661 the declarator. Therefore, once we see a type-specifier
13662 (other than a cv-qualifier), we forbid any additional
13663 user-defined types. We *do* still allow things like `int
13664 int' to be considered a decl-specifier-seq, and issue the
13665 error message later. */
13668 /* A constructor declarator cannot follow a type-specifier. */
13670 {
13675 }
13676 }
13678 /* If we still do not have a DECL_SPEC, then there are no more
13679 decl-specifiers. */
13684 /* After we see one decl-specifier, further decl-specifiers are
13685 always optional. */
13687 }
13689 /* Don't allow a friend specifier with a class definition. */
13694 }
13696 /* Parse an (optional) storage-class-specifier.
13698 storage-class-specifier:
13699 auto
13700 register
13701 static
13702 extern
13703 mutable
13705 GNU Extension:
13707 storage-class-specifier:
13708 thread
13710 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13712 static tree
13714 {
13716 {
13720 /* Fall through for C++98. */
13728 /* Consume the token. */
13733 }
13734 }
13736 /* Parse an (optional) function-specifier.
13738 function-specifier:
13739 inline
13740 virtual
13741 explicit
13743 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13744 Updates DECL_SPECS, if it is non-NULL. */
13746 static tree
13749 {
13752 {
13758 /* 14.5.2.3 [temp.mem]
13760 A member function template shall not be virtual. */
13764 else
13774 }
13776 /* Consume the token. */
13778 }
13780 /* Parse a linkage-specification.
13782 linkage-specification:
13783 extern string-literal { declaration-seq [opt] }
13784 extern string-literal declaration */
13786 static void
13788 {
13789 tree linkage;
13791 /* Look for the `extern' keyword. */
13792 cp_token *extern_token
13795 /* Look for the string-literal. */
13799 /* Transform the literal into an identifier. If the literal is a
13800 wide-character string, or contains embedded NULs, then we can't
13801 handle it as the user wants. */
13804 {
13806 /* Assume C++ linkage. */
13808 }
13809 else
13812 /* We're now using the new linkage. */
13815 /* Preserve the location of the the innermost linkage specification,
13816 tracking the locations of nested specifications via a local. */
13817 location_t saved_location
13819 /* Construct a location ranging from the start of the "extern" to
13820 the end of the string-literal, with the caret at the start, e.g.:
13821 extern "C" {
13822 ^~~~~~~~~~
13823 */
13824 parser->innermost_linkage_specification_location
13829 /* If the next token is a `{', then we're using the first
13830 production. */
13832 {
13836 /* Consume the `{' token. */
13837 matching_braces braces;
13839 /* Parse the declarations. */
13841 /* Look for the closing `}'. */
13843 }
13844 /* Otherwise, there's just one declaration. */
13845 else
13846 {
13849 saved_in_unbraced_linkage_specification_p
13853 parser->in_unbraced_linkage_specification_p
13855 }
13857 /* We're done with the linkage-specification. */
13860 /* Restore location of parent linkage specification, if any. */
13862 }
13864 /* Parse a static_assert-declaration.
13866 static_assert-declaration:
13867 static_assert ( constant-expression , string-literal ) ;
13868 static_assert ( constant-expression ) ; (C++17)
13870 If MEMBER_P, this static_assert is a class member. */
13872 static void
13874 {
13875 cp_expr condition;
13876 location_t token_loc;
13877 tree message;
13880 /* Peek at the `static_assert' token so we can keep track of exactly
13881 where the static assertion started. */
13884 /* Look for the `static_assert' keyword. */
13886 RT_STATIC_ASSERT))
13889 /* We know we are in a static assertion; commit to any tentative
13890 parse. */
13894 /* Parse the `(' starting the static assertion condition. */
13895 matching_parens parens;
13898 /* Parse the constant-expression. Allow a non-constant expression
13899 here in order to give better diagnostics in finish_static_assert. */
13900 condition =
13906 {
13909 "static_assert without a message "
13911 /* Eat the ')' */
13916 }
13917 else
13918 {
13919 /* Parse the separating `,'. */
13922 /* Parse the string-literal message. */
13927 /* A `)' completes the static assertion. */
13933 }
13935 /* A semicolon terminates the declaration. */
13938 /* Get the location for the static assertion. Use that of the
13939 condition if available, otherwise, use that of the "static_assert"
13940 token. */
13945 /* Complete the static assertion, which may mean either processing
13946 the static assert now or saving it for template instantiation. */
13948 }
13950 /* Parse the expression in decltype ( expression ). */
13952 static tree
13955 {
13957 tree expr;
13959 /* Since we're going to preserve any side-effects from this parse, set up a
13960 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13961 in the expression. */
13964 /* First, try parsing an id-expression. */
13975 {
13978 cp_id_kind idk;
13982 /* Lookup the name we got back from the id-expression. */
13987 /* A template without args is not a complete id-expression. */
13996 {
13997 /* Complete lookup of the id-expression. */
13998 expr = (finish_id_expression
14011 /* We found an id-expression, but it was something that we
14012 should not have found. This is an error, not something
14013 we can recover from, so note that we found an
14014 id-expression and we'll recover as gracefully as
14015 possible. */
14017 }
14022 /* We have an id-expression. */
14024 }
14027 {
14028 /* Abort the id-expression parse. */
14031 /* Parsing tentatively, again. */
14034 /* Parse a class member access. */
14042 /* We have an id-expression. */
14044 }
14047 /* We have parsed the complete id-expression or member access. */
14049 else
14050 {
14051 /* Abort our attempt to parse an id-expression or member access
14052 expression. */
14055 /* Commit to the tentative_firewall so we get syntax errors. */
14058 /* Parse a full expression. */
14061 }
14064 }
14066 /* Parse a `decltype' type. Returns the type.
14068 simple-type-specifier:
14069 decltype ( expression )
14070 C++14 proposal:
14071 decltype ( auto ) */
14073 static tree
14075 {
14080 {
14081 /* Already parsed. */
14084 }
14086 /* Look for the `decltype' token. */
14090 /* Parse the opening `('. */
14091 matching_parens parens;
14101 /* decltype (auto) */
14103 else
14104 {
14105 /* decltype (expression) */
14107 /* Types cannot be defined in a `decltype' expression. Save away the
14108 old message and set the new one. */
14110 parser->type_definition_forbidden_message
14113 /* The restrictions on constant-expressions do not apply inside
14114 decltype expressions. */
14115 bool saved_integral_constant_expression_p
14117 bool saved_non_integral_constant_expression_p
14121 /* Within a parenthesized expression, a `>' token is always
14122 the greater-than operator. */
14123 bool saved_greater_than_is_operator_p
14127 /* Do not actually evaluate the expression. */
14130 /* Do not warn about problems with the expression. */
14135 /* Go back to evaluating expressions. */
14139 /* The `>' token might be the end of a template-id or
14140 template-parameter-list now. */
14141 parser->greater_than_is_operator_p
14144 /* Restore the old message and the integral constant expression
14145 flags. */
14147 parser->integral_constant_expression_p
14149 parser->non_integral_constant_expression_p
14151 }
14153 /* Parse to the closing `)'. */
14155 {
14160 }
14163 {
14164 /* Build auto. */
14167 }
14168 else
14170 tf_warning_or_error);
14172 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14173 it again. */
14184 }
14186 /* Special member functions [gram.special] */
14188 /* Parse a conversion-function-id.
14190 conversion-function-id:
14191 operator conversion-type-id
14193 Returns an IDENTIFIER_NODE representing the operator. */
14195 static tree
14197 {
14198 tree type;
14199 tree saved_scope;
14200 tree saved_qualifying_scope;
14201 tree saved_object_scope;
14204 /* Look for the `operator' token. */
14207 /* When we parse the conversion-type-id, the current scope will be
14208 reset. However, we need that information in able to look up the
14209 conversion function later, so we save it here. */
14213 /* We must enter the scope of the class so that the names of
14214 entities declared within the class are available in the
14215 conversion-type-id. For example, consider:
14217 struct S {
14218 typedef int I;
14219 operator I();
14220 };
14222 S::operator I() { ... }
14224 In order to see that `I' is a type-name in the definition, we
14225 must be in the scope of `S'. */
14228 /* Parse the conversion-type-id. */
14230 /* Leave the scope of the class, if any. */
14233 /* Restore the saved scope. */
14237 /* If the TYPE is invalid, indicate failure. */
14241 }
14243 /* Parse a conversion-type-id:
14245 conversion-type-id:
14246 type-specifier-seq conversion-declarator [opt]
14248 Returns the TYPE specified. */
14250 static tree
14252 {
14253 tree attributes;
14254 cp_decl_specifier_seq type_specifiers;
14256 tree type_specified;
14259 /* Parse the attributes. */
14263 parser->type_definition_forbidden_message
14266 /* Parse the type-specifiers. */
14273 /* If that didn't work, stop. */
14276 /* Parse the conversion-declarator. */
14284 /* Don't give this error when parsing tentatively. This happens to
14285 work because we always parse this definitively once. */
14288 {
14290 {
14293 }
14297 }
14300 }
14302 /* Parse an (optional) conversion-declarator.
14304 conversion-declarator:
14305 ptr-operator conversion-declarator [opt]
14307 */
14311 {
14314 cp_cv_quals cv_quals;
14316 /* We don't know if there's a ptr-operator next, or not. */
14318 /* Try the ptr-operator. */
14321 /* If it worked, look for more conversion-declarators. */
14323 {
14326 /* Parse another optional declarator. */
14329 declarator = cp_parser_make_indirect_declarator
14333 }
14336 }
14338 /* Parse an (optional) ctor-initializer.
14340 ctor-initializer:
14341 : mem-initializer-list */
14343 static void
14345 {
14346 /* If the next token is not a `:', then there is no
14347 ctor-initializer. */
14349 {
14350 /* Do default initialization of any bases and members. */
14354 }
14356 /* Consume the `:' token. */
14358 /* And the mem-initializer-list. */
14360 }
14362 /* Parse a mem-initializer-list.
14364 mem-initializer-list:
14365 mem-initializer ... [opt]
14366 mem-initializer ... [opt] , mem-initializer-list */
14368 static void
14370 {
14375 /* Let the semantic analysis code know that we are starting the
14376 mem-initializer-list. */
14381 /* Loop through the list. */
14383 {
14384 tree mem_initializer;
14387 /* Parse the mem-initializer. */
14389 /* If the next token is a `...', we're expanding member initializers. */
14395 {
14396 /* Consume the `...'. */
14400 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14401 can be expanded but members cannot. */
14404 {
14409 }
14411 /* Construct the pack expansion type. */
14414 }
14417 {
14421 }
14422 /* Look for a target constructor. */
14426 {
14429 {
14433 }
14435 }
14436 /* Add it to the list, unless it was erroneous. */
14438 {
14441 }
14442 /* If the next token is not a `,', we're done. */
14445 /* Consume the `,' token. */
14447 }
14449 /* Perform semantic analysis. */
14452 }
14454 /* Parse a mem-initializer.
14456 mem-initializer:
14457 mem-initializer-id ( expression-list [opt] )
14458 mem-initializer-id braced-init-list
14460 GNU extension:
14462 mem-initializer:
14463 ( expression-list [opt] )
14465 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14466 class) or FIELD_DECL (for a non-static data member) to initialize;
14467 the TREE_VALUE is the expression-list. An empty initialization
14468 list is represented by void_list_node. */
14470 static tree
14472 {
14473 tree mem_initializer_id;
14474 tree expression_list;
14475 tree member;
14478 /* Find out what is being initialized. */
14480 {
14484 }
14485 else
14486 {
14490 }
14496 {
14503 }
14504 else
14505 {
14515 }
14525 }
14527 /* Parse a mem-initializer-id.
14529 mem-initializer-id:
14530 :: [opt] nested-name-specifier [opt] class-name
14531 decltype-specifier (C++11)
14532 identifier
14534 Returns a TYPE indicating the class to be initialized for the first
14535 production (and the second in C++11). Returns an IDENTIFIER_NODE
14536 indicating the data member to be initialized for the last production. */
14538 static tree
14540 {
14544 tree id;
14548 /* `typename' is not allowed in this context ([temp.res]). */
14550 {
14552 "keyword %<typename%> not allowed in this context (a qualified "
14555 }
14556 /* Look for the optional `::' operator. */
14557 global_scope_p
14561 /* Look for the optional nested-name-specifier. The simplest way to
14562 implement:
14564 [temp.res]
14566 The keyword `typename' is not permitted in a base-specifier or
14567 mem-initializer; in these contexts a qualified name that
14568 depends on a template-parameter is implicitly assumed to be a
14569 type name.
14571 is to assume that we have seen the `typename' keyword at this
14572 point. */
14573 nested_name_specifier_p
14582 /* If there is a `::' operator or a nested-name-specifier, then we
14583 are definitely looking for a class-name. */
14588 typename_type,
14592 /* Otherwise, we could also be looking for an ordinary identifier. */
14595 /* Try a decltype-specifier. */
14597 else
14598 /* Otherwise, try a class-name. */
14602 none_type,
14606 /* If we found one, we're done. */
14609 /* Otherwise, look for an ordinary identifier. */
14611 }
14613 /* Overloading [gram.over] */
14615 /* Parse an operator-function-id.
14617 operator-function-id:
14618 operator operator
14620 Returns an IDENTIFIER_NODE for the operator which is a
14621 human-readable spelling of the identifier, e.g., `operator +'. */
14623 static cp_expr
14625 {
14626 /* Look for the `operator' keyword. */
14629 /* And then the name of the operator itself. */
14631 }
14633 /* Return an identifier node for a user-defined literal operator.
14634 The suffix identifier is chained to the operator name identifier. */
14636 tree
14638 {
14639 tree identifier;
14646 }
14648 /* Parse an operator.
14650 operator:
14651 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14652 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14653 || ++ -- , ->* -> () []
14655 GNU Extensions:
14657 operator:
14658 <? >? <?= >?=
14660 Returns an IDENTIFIER_NODE for the operator which is a
14661 human-readable spelling of the identifier, e.g., `operator +'. */
14663 static cp_expr
14665 {
14670 /* Peek at the next token. */
14675 /* Figure out which operator we have. */
14680 {
14682 {
14683 /* The keyword should be either `new' or `delete'. */
14688 else
14691 /* Consume the `new' or `delete' token. */
14694 /* Peek at the next token. */
14696 /* If it's a `[' token then this is the array variant of the
14697 operator. */
14699 {
14700 /* Consume the `[' token. */
14702 /* Look for the `]' token. */
14707 }
14711 }
14869 {
14870 /* Consume the `('. */
14871 matching_parens parens;
14873 /* Look for the matching `)'. */
14878 }
14881 /* Consume the `['. */
14883 /* Look for the matching `]'. */
14892 /* FALLTHRU */
14901 {
14908 /* Consume the string. */
14914 {
14917 }
14918 else
14919 {
14921 /* Look for the suffix identifier. */
14926 {
14930 }
14931 else
14932 {
14935 }
14936 }
14941 {
14944 }
14947 {
14950 }
14952 {
14955 }
14957 }
14960 /* Anything else is an error. */
14962 }
14964 /* If we have selected an identifier, we need to consume the
14965 operator token. */
14967 {
14971 }
14972 /* Otherwise, no valid operator name was present. */
14973 else
14974 {
14977 }
14980 }
14982 /* Parse a template-declaration.
14984 template-declaration:
14985 export [opt] template < template-parameter-list > declaration
14987 If MEMBER_P is TRUE, this template-declaration occurs within a
14988 class-specifier.
14990 The grammar rule given by the standard isn't correct. What
14991 is really meant is:
14993 template-declaration:
14994 export [opt] template-parameter-list-seq
14995 decl-specifier-seq [opt] init-declarator [opt] ;
14996 export [opt] template-parameter-list-seq
14997 function-definition
14999 template-parameter-list-seq:
15000 template-parameter-list-seq [opt]
15001 template < template-parameter-list >
15003 Concept Extensions:
15005 template-parameter-list-seq:
15006 template < template-parameter-list > requires-clause [opt]
15008 requires-clause:
15009 requires logical-or-expression */
15011 static void
15013 {
15014 /* Check for `export'. */
15016 {
15017 /* Consume the `export' token. */
15019 /* Warn that we do not support `export'. */
15021 }
15024 }
15026 /* Parse a template-parameter-list.
15028 template-parameter-list:
15029 template-parameter
15030 template-parameter-list , template-parameter
15032 Returns a TREE_LIST. Each node represents a template parameter.
15033 The nodes are connected via their TREE_CHAINs. */
15035 static tree
15037 {
15042 /* The loop below parses the template parms. We first need to know
15043 the total number of template parms to be able to compute proper
15044 canonical types of each dependent type. So after the loop, when
15045 we know the total number of template parms,
15046 end_template_parm_list computes the proper canonical types and
15047 fixes up the dependent types accordingly. */
15049 {
15050 tree parameter;
15053 location_t parm_loc;
15055 /* Parse the template-parameter. */
15060 /* Add it to the list. */
15063 parm_loc,
15064 parameter,
15065 is_non_type,
15066 is_parameter_pack);
15067 else
15068 {
15071 }
15073 /* If the next token is not a `,', we're done. */
15076 /* Otherwise, consume the `,' token. */
15078 }
15081 }
15083 /* Parse a introduction-list.
15085 introduction-list:
15086 introduced-parameter
15087 introduction-list , introduced-parameter
15089 introduced-parameter:
15090 ...[opt] identifier
15092 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15093 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15094 WILDCARD_DECL will also have DECL_NAME set and token location in
15095 DECL_SOURCE_LOCATION. */
15097 static tree
15099 {
15103 {
15108 /* Build placeholder. */
15116 /* If the next token is not a `,', we're done. */
15119 /* Otherwise, consume the `,' token. */
15121 }
15123 /* Convert the vec into a TREE_VEC. */
15126 tree parm;
15132 }
15134 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15135 is an abstract declarator. */
15139 {
15144 }
15146 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15147 is an abstract declarator. */
15151 {
15155 else
15157 }
15159 /* Returns true if DECL represents a constrained-parameter. */
15163 {
15168 }
15170 /* Returns true if PARM declares a constrained-parameter. */
15174 {
15176 }
15178 /* Check that the type parameter is only a declarator-id, and that its
15179 type is not cv-qualified. */
15181 bool
15184 {
15189 {
15192 }
15194 /* Don't allow cv-qualified type parameters. */
15197 {
15200 }
15203 }
15205 /* Finish parsing/processing a template type parameter and checking
15206 various restrictions. */
15210 tree id,
15212 {
15215 else
15217 }
15219 static tree
15221 {
15222 /* FIXME: This should probably be copied, and we may need to adjust
15223 the template parameter depths. */
15233 }
15235 /* Finish parsing/processing a template template parameter by borrowing
15236 the template parameter list from the prototype parameter. */
15238 static tree
15240 tree proto,
15241 tree id,
15243 {
15247 }
15249 /* Create a new non-type template parameter from the given PARM
15250 declarator. */
15252 static tree
15255 {
15261 }
15263 /* Build a constrained template parameter based on the PARMDECL
15264 declarator. The type of PARMDECL is the constrained type, which
15265 refers to the prototype template parameter that ultimately
15266 specifies the type of the declared parameter. */
15268 static tree
15273 {
15279 /* A template parameter constrained by a variadic concept shall also
15280 be declared as a template parameter pack. */
15285 /* Build the parameter. Return an error if the declarator was invalid. */
15286 tree parm;
15291 parmdecl);
15292 else
15297 /* Finish the parameter decl and create a node attaching the
15298 default argument and constraint. */
15303 }
15305 /* Returns true if the parsed type actually represents the declaration
15306 of a type template-parameter. */
15310 {
15313 }
15316 /* Returns true if the parsed type actually represents the declaration of
15317 a template template-parameter. */
15319 static bool
15321 {
15324 }
15326 /* Parse a default argument for a type template-parameter.
15327 Note that diagnostics are handled in cp_parser_template_parameter. */
15329 static tree
15331 {
15334 /* Consume the `=' token. */
15339 /* Parse the default-argument. */
15345 {
15349 }
15352 }
15354 /* Parse a default argument for a template template-parameter. */
15356 static tree
15358 {
15363 /* Consume the `='. */
15365 /* Parse the id-expression. */
15367 /* save token before parsing the id-expression, for error
15368 reporting */
15370 tree default_argument
15378 /* If the id-expression was a template-id that refers to
15379 a template-class, we already have the declaration here,
15380 so no further lookup is needed. */
15381 ;
15382 else
15383 /* Look up the name. */
15384 default_argument
15386 none_type,
15392 /* See if the default argument is valid. */
15396 }
15398 /* Parse a template-parameter.
15400 template-parameter:
15401 type-parameter
15402 parameter-declaration
15404 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15405 the parameter. The TREE_PURPOSE is the default value, if any.
15406 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15407 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15408 set to true iff this parameter is a parameter pack. */
15410 static tree
15413 {
15416 tree parm;
15418 /* Assume it is a type parameter or a template parameter. */
15420 /* Assume it not a parameter pack. */
15422 /* Peek at the next token. */
15424 /* If it is `template', we have a type-parameter. */
15427 /* If it is `class' or `typename' we do not know yet whether it is a
15428 type parameter or a non-type parameter. Consider:
15430 template <typename T, typename T::X X> ...
15432 or:
15434 template <class C, class D*> ...
15436 Here, the first parameter is a type parameter, and the second is
15437 a non-type parameter. We can tell by looking at the token after
15438 the identifier -- if it is a `,', `=', or `>' then we have a type
15439 parameter. */
15441 {
15442 /* Peek at the token after `class' or `typename'. */
15444 /* If it's an ellipsis, we have a template type parameter
15445 pack. */
15448 /* If it's an identifier, skip it. */
15451 /* Now, see if the token looks like the end of a template
15452 parameter. */
15457 }
15459 /* Otherwise, it is a non-type parameter or a constrained parameter.
15461 [temp.param]
15463 When parsing a default template-argument for a non-type
15464 template-parameter, the first non-nested `>' is taken as the end
15465 of the template parameter-list rather than a greater-than
15466 operator. */
15467 parameter_declarator
15474 /* If the parameter declaration is marked as a parameter pack, set
15475 *IS_PARAMETER_PACK to notify the caller. */
15480 {
15481 /* Can happen in some cases of erroneous input (c++/34892). */
15483 /* Consume the `...' for better error recovery. */
15485 }
15487 // The parameter may have been constrained.
15490 parameter_declarator,
15491 is_non_type,
15492 is_parameter_pack);
15494 // Now we're sure that the parameter is a non-type parameter.
15505 }
15507 /* Parse a type-parameter.
15509 type-parameter:
15510 class identifier [opt]
15511 class identifier [opt] = type-id
15512 typename identifier [opt]
15513 typename identifier [opt] = type-id
15514 template < template-parameter-list > class identifier [opt]
15515 template < template-parameter-list > class identifier [opt]
15516 = id-expression
15518 GNU Extension (variadic templates):
15520 type-parameter:
15521 class ... identifier [opt]
15522 typename ... identifier [opt]
15524 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15525 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15526 the declaration of the parameter.
15528 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15530 static tree
15532 {
15534 tree parameter;
15536 /* Look for a keyword to tell us what kind of parameter this is. */
15542 {
15545 {
15546 tree identifier;
15547 tree default_argument;
15549 /* If the next token is an ellipsis, we have a template
15550 argument pack. */
15552 {
15553 /* Consume the `...' token. */
15558 }
15560 /* If the next token is an identifier, then it names the
15561 parameter. */
15564 else
15567 /* Create the parameter. */
15570 /* If the next token is an `=', we have a default argument. */
15572 {
15573 default_argument
15576 /* Template parameter packs cannot have default
15577 arguments. */
15579 {
15582 "template parameter pack %qD cannot have a "
15584 else
15586 "template parameter packs cannot have "
15589 }
15592 }
15593 else
15596 /* Create the combined representation of the parameter and the
15597 default argument. */
15599 }
15603 {
15604 tree identifier;
15605 tree default_argument;
15607 /* Look for the `<'. */
15609 /* Parse the template-parameter-list. */
15611 /* Look for the `>'. */
15614 // If template requirements are present, parse them.
15616 {
15621 }
15623 /* Look for the `class' or 'typename' keywords. */
15625 /* If the next token is an ellipsis, we have a template
15626 argument pack. */
15628 {
15629 /* Consume the `...' token. */
15634 }
15635 /* If the next token is an `=', then there is a
15636 default-argument. If the next token is a `>', we are at
15637 the end of the parameter-list. If the next token is a `,',
15638 then we are at the end of this parameter. */
15642 {
15644 /* Treat invalid names as if the parameter were nameless. */
15647 }
15648 else
15651 /* Create the template parameter. */
15653 identifier);
15655 /* If the next token is an `=', then there is a
15656 default-argument. */
15658 {
15659 default_argument
15662 /* Template parameter packs cannot have default
15663 arguments. */
15665 {
15668 "template parameter pack %qD cannot "
15670 identifier);
15671 else
15675 }
15676 }
15677 else
15680 /* Create the combined representation of the parameter and the
15681 default argument. */
15683 }
15689 }
15692 }
15694 /* Parse a template-id.
15696 template-id:
15697 template-name < template-argument-list [opt] >
15699 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15700 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15701 returned. Otherwise, if the template-name names a function, or set
15702 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15703 names a class, returns a TYPE_DECL for the specialization.
15705 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15706 uninstantiated templates. */
15708 static tree
15714 {
15715 tree templ;
15716 tree arguments;
15717 tree template_id;
15722 /* If the next token corresponds to a template-id, there is no need
15723 to reparse it. */
15726 {
15729 }
15731 /* Avoid performing name lookup if there is no possibility of
15732 finding a template-id. */
15735 && !cp_parser_nth_token_starts_template_argument_list_p
15737 {
15740 }
15742 /* Remember where the template-id starts. */
15748 /* Parse the template-name. */
15751 check_dependency_p,
15752 is_declaration,
15753 tag_type,
15756 {
15759 }
15761 /* Since we're going to preserve any side-effects from this parse, set up a
15762 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15763 in the template arguments. */
15766 /* If we find the sequence `[:' after a template-name, it's probably
15767 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15768 parse correctly the argument list. */
15775 {
15777 /* Change `:' into `::'. */
15779 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15780 CPP_LESS. */
15783 /* Parse the arguments. */
15786 {
15787 /* If we couldn't parse an argument list, then we revert our changes
15788 and return simply an error. Maybe this is not a template-id
15789 after all. */
15794 }
15795 /* Otherwise, emit an error about the invalid digraph, but continue
15796 parsing because we got our argument list. */
15799 {
15802 "%<<:%> is an alternate spelling for %<[%>."
15805 {
15807 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15810 }
15811 }
15812 }
15813 else
15814 {
15815 /* Look for the `<' that starts the template-argument-list. */
15817 {
15820 }
15821 /* Parse the arguments. */
15823 }
15825 /* Set the location to be of the form:
15826 template-name < template-argument-list [opt] >
15827 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15828 with caret == start at the start of the template-name,
15829 ranging until the closing '>'. */
15830 location_t finish_loc
15832 location_t combined_loc
15835 /* Check for concepts autos where they don't belong. We could
15836 identify types in some cases of idnetifier TEMPL, looking ahead
15837 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
15838 types. We reject them in functions, but if what we have is an
15839 identifier, even with none_type we can't conclude it's NOT a
15840 type, we have to wait for template substitution. */
15843 /* Build a representation of the specialization. */
15846 TEMPLATE_ID_EXPR,
15850 {
15852 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15853 template (rather than some instantiation thereof) only if
15854 is not nested within some other construct. For example, in
15855 "template <typename T> void f(T) { A<T>::", A<T> is just an
15856 instantiation of A. */
15859 CPP_SCOPE));
15860 template_id
15862 }
15863 /* A template-like identifier may be a partial concept id. */
15869 {
15873 }
15874 else
15875 {
15876 /* If it's not a class-template or a template-template, it should be
15877 a function-template. */
15885 }
15887 /* If parsing tentatively, replace the sequence of tokens that makes
15888 up the template-id with a CPP_TEMPLATE_ID token. That way,
15889 should we re-parse the token stream, we will not have to repeat
15890 the effort required to do the parse, nor will we issue duplicate
15891 error messages about problems during instantiation of the
15892 template. */
15894 /* Don't do this if we had a parse error in a declarator; re-parsing
15895 might succeed if a name changes meaning (60361). */
15899 {
15900 /* Reset the contents of the START_OF_ID token. */
15904 /* We must mark the lookup as kept, so we don't throw it away on
15905 the first parse. */
15909 /* Retrieve any deferred checks. Do not pop this access checks yet
15910 so the memory will not be reclaimed during token replacing below. */
15916 /* Purge all subsequent tokens. */
15919 /* ??? Can we actually assume that, if template_id ==
15920 error_mark_node, we will have issued a diagnostic to the
15921 user, as opposed to simply marking the tentative parse as
15922 failed? */
15925 }
15929 }
15931 /* Parse a template-name.
15933 template-name:
15934 identifier
15936 The standard should actually say:
15938 template-name:
15939 identifier
15940 operator-function-id
15942 A defect report has been filed about this issue.
15944 A conversion-function-id cannot be a template name because they cannot
15945 be part of a template-id. In fact, looking at this code:
15947 a.operator K<int>()
15949 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15950 It is impossible to call a templated conversion-function-id with an
15951 explicit argument list, since the only allowed template parameter is
15952 the type to which it is converting.
15954 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15955 `template' keyword, in a construction like:
15957 T::template f<3>()
15959 In that case `f' is taken to be a template-name, even though there
15960 is no way of knowing for sure.
15962 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15963 name refers to a set of overloaded functions, at least one of which
15964 is a template, or an IDENTIFIER_NODE with the name of the template,
15965 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15966 names are looked up inside uninstantiated templates. */
15968 static tree
15975 {
15976 tree identifier;
15977 tree decl;
15980 /* If the next token is `operator', then we have either an
15981 operator-function-id or a conversion-function-id. */
15983 {
15984 /* We don't know whether we're looking at an
15985 operator-function-id or a conversion-function-id. */
15987 /* Try an operator-function-id. */
15989 /* If that didn't work, try a conversion-function-id. */
15991 {
15994 }
15995 }
15996 /* Look for the identifier. */
15997 else
16000 /* If we didn't find an identifier, we don't have a template-id. */
16004 /* If the name immediately followed the `template' keyword, then it
16005 is a template-name. However, if the next token is not `<', then
16006 we do not treat it as a template-name, since it is not being used
16007 as part of a template-id. This enables us to handle constructs
16008 like:
16010 template <typename T> struct S { S(); };
16011 template <typename T> S<T>::S();
16013 correctly. We would treat `S' as a template -- if it were `S<T>'
16014 -- but we do not if there is no `<'. */
16018 {
16019 /* In a declaration, in a dependent context, we pretend that the
16020 "template" keyword was present in order to improve error
16021 recovery. For example, given:
16023 template <typename T> void f(T::X<int>);
16025 we want to treat "X<int>" as a template-id. */
16027 && !template_keyword_p
16029 && check_dependency_p
16031 /* Do not do this for dtors (or ctors), since they never
16032 need the template keyword before their name. */
16034 {
16037 /* Explain what went wrong. */
16039 identifier);
16042 /* If parsing tentatively, find the location of the "<" token. */
16045 /* Parse the template arguments so that we can issue error
16046 messages about them. */
16049 /* Skip tokens until we find a good place from which to
16050 continue parsing. */
16055 /* If parsing tentatively, permanently remove the
16056 template argument list. That will prevent duplicate
16057 error messages from being issued about the missing
16058 "template" keyword. */
16065 }
16067 /* If the "template" keyword is present, then there is generally
16068 no point in doing name-lookup, so we just return IDENTIFIER.
16069 But, if the qualifying scope is non-dependent then we can
16070 (and must) do name-lookup normally. */
16072 {
16078 {
16079 /* We're optimizing away the call to cp_parser_lookup_name, but
16080 we still need to do this. */
16083 }
16084 }
16085 }
16087 /* Look up the name. */
16089 tag_type,
16092 check_dependency_p,
16098 /* If DECL is a template, then the name was a template-name. */
16100 {
16104 }
16105 else
16106 {
16107 /* The standard does not explicitly indicate whether a name that
16108 names a set of overloaded declarations, some of which are
16109 templates, is a template-name. However, such a name should
16110 be a template-name; otherwise, there is no way to form a
16111 template-id for the overloaded templates. */
16120 {
16121 /* The name does not name a template. */
16124 }
16125 }
16127 /* If DECL is dependent, and refers to a function, then just return
16128 its name; we will look it up again during template instantiation. */
16130 {
16134 }
16137 }
16139 /* Parse a template-argument-list.
16141 template-argument-list:
16142 template-argument ... [opt]
16143 template-argument-list , template-argument ... [opt]
16145 Returns a TREE_VEC containing the arguments. */
16147 static tree
16149 {
16154 tree vec;
16161 /* Even if the template-id appears in an integral
16162 constant-expression, the contents of the argument list do
16163 not. */
16169 /* Parse the arguments. */
16170 do
16171 {
16172 tree argument;
16175 /* Consume the comma. */
16178 /* Parse the template-argument. */
16181 /* If the next token is an ellipsis, we're expanding a template
16182 argument pack. */
16184 {
16186 {
16190 }
16191 /* Consume the `...' token. */
16194 /* Make the argument into a TYPE_PACK_EXPANSION or
16195 EXPR_PACK_EXPANSION. */
16197 }
16200 {
16204 {
16207 }
16208 else
16210 }
16212 }
16228 }
16230 /* Parse a template-argument.
16232 template-argument:
16233 assignment-expression
16234 type-id
16235 id-expression
16237 The representation is that of an assignment-expression, type-id, or
16238 id-expression -- except that the qualified id-expression is
16239 evaluated, so that the value returned is either a DECL or an
16240 OVERLOAD.
16242 Although the standard says "assignment-expression", it forbids
16243 throw-expressions or assignments in the template argument.
16244 Therefore, we use "conditional-expression" instead. */
16246 static tree
16248 {
16249 tree argument;
16255 cp_id_kind idk;
16257 /* There's really no way to know what we're looking at, so we just
16258 try each alternative in order.
16260 [temp.arg]
16262 In a template-argument, an ambiguity between a type-id and an
16263 expression is resolved to a type-id, regardless of the form of
16264 the corresponding template-parameter.
16266 Therefore, we try a type-id first. */
16269 /* If there was no error parsing the type-id but the next token is a
16270 '>>', our behavior depends on which dialect of C++ we're
16271 parsing. In C++98, we probably found a typo for '> >'. But there
16272 are type-id which are also valid expressions. For instance:
16274 struct X { int operator >> (int); };
16275 template <int V> struct Foo {};
16276 Foo<X () >> 5> r;
16278 Here 'X()' is a valid type-id of a function type, but the user just
16279 wanted to write the expression "X() >> 5". Thus, we remember that we
16280 found a valid type-id, but we still try to parse the argument as an
16281 expression to see what happens.
16283 In C++0x, the '>>' will be considered two separate '>'
16284 tokens. */
16288 {
16291 }
16292 else
16293 {
16294 /* If the next token isn't a `,' or a `>', then this argument wasn't
16295 really finished. This means that the argument is not a valid
16296 type-id. */
16299 /* If that worked, we're done. */
16302 }
16303 /* We're still not sure what the argument will be. */
16305 /* Try a template. */
16313 /* If the next token isn't a `,' or a `>', then this argument wasn't
16314 really finished. */
16318 {
16319 /* Figure out what is being referred to. If the id-expression
16320 was for a class template specialization, then we will have a
16321 TYPE_DECL at this point. There is no need to do name lookup
16322 at this point in that case. */
16325 none_type,
16331 /* Handle a constrained-type-specifier for a non-type template
16332 parameter. */
16338 }
16340 {
16344 }
16345 /* It must be a non-type argument. In C++17 any constant-expression is
16346 allowed. */
16350 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16352 -- an integral constant-expression of integral or enumeration
16353 type; or
16355 -- the name of a non-type template-parameter; or
16357 -- the name of an object or function with external linkage...
16359 -- the address of an object or function with external linkage...
16361 -- a pointer to member... */
16362 /* Look for a non-type template parameter. */
16364 {
16376 }
16378 /* If the next token is "&", the argument must be the address of an
16379 object or function with external linkage. */
16382 {
16385 }
16386 /* See if we might have an id-expression. */
16393 {
16396 address_p,
16403 else
16404 {
16405 tree probe;
16408 {
16409 /* Strip the dereference temporarily. */
16412 }
16414 /* If we're in a template, we represent a qualified-id referring
16415 to a static data member as a SCOPE_REF even if the scope isn't
16416 dependent so that we can check access control later. */
16421 {
16422 /* A variable without external linkage might still be a
16423 valid constant-expression, so no error is issued here
16424 if the external-linkage check fails. */
16427 }
16429 /* All overloaded functions are allowed; if the external
16430 linkage test does not pass, an error will be issued
16431 later. */
16432 ;
16436 /* A pointer-to-member. */
16437 ;
16439 ;
16440 else
16444 {
16447 tf_warning_or_error);
16448 else
16451 }
16452 }
16453 }
16454 /* If the argument started with "&", there are no other valid
16455 alternatives at this point. */
16457 {
16460 }
16462 general_expr:
16463 /* If the argument wasn't successfully parsed as a type-id followed
16464 by '>>', the argument can only be a constant expression now.
16465 Otherwise, we try parsing the constant-expression tentatively,
16466 because the argument could really be a type-id. */
16472 else
16473 {
16474 /* With C++17 generalized non-type template arguments we need to handle
16475 lvalue constant expressions, too. */
16478 }
16486 /* We did our best to parse the argument as a non type-id, but that
16487 was the only alternative that matched (albeit with a '>' after
16488 it). We can assume it's just a typo from the user, and a
16489 diagnostic will then be issued. */
16491 }
16493 /* Parse an explicit-instantiation.
16495 explicit-instantiation:
16496 template declaration
16498 Although the standard says `declaration', what it really means is:
16500 explicit-instantiation:
16501 template decl-specifier-seq [opt] declarator [opt] ;
16503 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16504 supposed to be allowed. A defect report has been filed about this
16505 issue.
16507 GNU Extension:
16509 explicit-instantiation:
16510 storage-class-specifier template
16511 decl-specifier-seq [opt] declarator [opt] ;
16512 function-specifier template
16513 decl-specifier-seq [opt] declarator [opt] ; */
16515 static void
16517 {
16519 cp_decl_specifier_seq decl_specifiers;
16524 /* Look for an (optional) storage-class-specifier or
16525 function-specifier. */
16527 {
16528 extension_specifier
16531 extension_specifier
16534 }
16536 /* Look for the `template' keyword. */
16538 /* Let the front end know that we are processing an explicit
16539 instantiation. */
16541 /* [temp.explicit] says that we are supposed to ignore access
16542 control while processing explicit instantiation directives. */
16544 /* Parse a decl-specifier-seq. */
16546 CP_PARSER_FLAGS_OPTIONAL,
16549 /* If there was exactly one decl-specifier, and it declared a class,
16550 and there's no declarator, then we have an explicit type
16551 instantiation. */
16553 {
16554 tree type;
16558 /* Turn access control back on for names used during
16559 template instantiation. */
16564 }
16565 else
16566 {
16568 tree decl;
16570 /* Parse the declarator. */
16571 declarator
16582 {
16585 "explicit instantiation shall not use"
16589 "explicit instantiation shall not use"
16594 /* Turn access control back on for names used during
16595 template instantiation. */
16597 /* Do the explicit instantiation. */
16599 }
16600 else
16601 {
16603 /* Skip the body of the explicit instantiation. */
16605 }
16606 }
16607 /* We're done with the instantiation. */
16613 }
16615 /* Parse an explicit-specialization.
16617 explicit-specialization:
16618 template < > declaration
16620 Although the standard says `declaration', what it really means is:
16622 explicit-specialization:
16623 template <> decl-specifier [opt] init-declarator [opt] ;
16624 template <> function-definition
16625 template <> explicit-specialization
16626 template <> template-declaration */
16628 static void
16630 {
16634 /* Look for the `template' keyword. */
16636 /* Look for the `<'. */
16638 /* Look for the `>'. */
16640 /* We have processed another parameter list. */
16642 /* [temp]
16644 A template ... explicit specialization ... shall not have C
16645 linkage. */
16647 {
16650 /* Give it C++ linkage to avoid confusing other parts of the
16651 front end. */
16654 }
16655 else
16657 /* Let the front end know that we are beginning a specialization. */
16659 {
16662 }
16664 /* If the next keyword is `template', we need to figure out whether
16665 or not we're looking a template-declaration. */
16667 {
16672 else
16674 }
16675 else
16676 /* Parse the dependent declaration. */
16682 /* We're done with the specialization. */
16684 /* For the erroneous case of a template with C linkage, we pushed an
16685 implicit C++ linkage scope; exit that scope now. */
16688 /* We're done with this parameter list. */
16690 }
16692 /* Parse a type-specifier.
16694 type-specifier:
16695 simple-type-specifier
16696 class-specifier
16697 enum-specifier
16698 elaborated-type-specifier
16699 cv-qualifier
16701 GNU Extension:
16703 type-specifier:
16704 __complex__
16706 Returns a representation of the type-specifier. For a
16707 class-specifier, enum-specifier, or elaborated-type-specifier, a
16708 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16710 The parser flags FLAGS is used to control type-specifier parsing.
16712 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16713 in a decl-specifier-seq.
16715 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16716 class-specifier, enum-specifier, or elaborated-type-specifier, then
16717 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16718 if a type is declared; 2 if it is defined. Otherwise, it is set to
16719 zero.
16721 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16722 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16723 is set to FALSE. */
16725 static tree
16727 cp_parser_flags flags,
16732 {
16738 /* Assume this type-specifier does not declare a new type. */
16741 /* And that it does not specify a cv-qualifier. */
16744 /* Peek at the next token. */
16747 /* If we're looking at a keyword, we can use that to guide the
16748 production we choose. */
16751 {
16756 /* Look for the enum-specifier. */
16758 /* If that worked, we're done. */
16760 {
16765 type_spec,
16766 token,
16769 }
16770 else
16773 /* Any of these indicate either a class-specifier, or an
16774 elaborated-type-specifier. */
16781 /* Parse tentatively so that we can back up if we don't find a
16782 class-specifier. */
16784 /* Look for the class-specifier. */
16787 /* If that worked, we're done. */
16789 {
16794 type_spec,
16795 token,
16798 }
16800 /* Fall through. */
16801 elaborated_type_specifier:
16802 /* We're declaring (not defining) a class or enum. */
16806 /* Fall through. */
16808 /* Look for an elaborated-type-specifier. */
16809 type_spec
16810 = (cp_parser_elaborated_type_specifier
16813 is_declaration));
16816 type_spec,
16817 token,
16840 /* The `__complex__' keyword is a GNU extension. */
16846 }
16848 /* Handle simple keywords. */
16850 {
16852 {
16855 }
16857 }
16859 /* If we do not already have a type-specifier, assume we are looking
16860 at a simple-type-specifier. */
16862 decl_specs,
16863 flags);
16865 /* If we didn't find a type-specifier, and a type-specifier was not
16866 optional in this context, issue an error message. */
16868 {
16871 }
16874 }
16876 /* Parse a simple-type-specifier.
16878 simple-type-specifier:
16879 :: [opt] nested-name-specifier [opt] type-name
16880 :: [opt] nested-name-specifier template template-id
16881 char
16882 wchar_t
16883 bool
16884 short
16885 int
16886 long
16887 signed
16888 unsigned
16889 float
16890 double
16891 void
16893 C++11 Extension:
16895 simple-type-specifier:
16896 auto
16897 decltype ( expression )
16898 char16_t
16899 char32_t
16900 __underlying_type ( type-id )
16902 C++17 extension:
16904 nested-name-specifier(opt) template-name
16906 GNU Extension:
16908 simple-type-specifier:
16909 __int128
16910 __typeof__ unary-expression
16911 __typeof__ ( type-id )
16912 __typeof__ ( type-id ) { initializer-list , [opt] }
16914 Concepts Extension:
16916 simple-type-specifier:
16917 constrained-type-specifier
16919 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16920 appropriately updated. */
16922 static tree
16925 cp_parser_flags flags)
16926 {
16931 /* Peek at the next token. */
16934 /* If we're looking at a keyword, things are easy. */
16936 {
16971 {
16974 }
17003 {
17004 /* The 'auto' might be the placeholder return type for a function decl
17005 with trailing return type. */
17014 {
17016 {
17023 }
17026 {
17029 }
17032 }
17036 {
17039 }
17042 {
17045 }
17046 else
17050 {
17053 "use of %<auto%> in lambda parameter declaration "
17054 "only available with "
17056 }
17059 "use of %<auto%> in parameter declaration "
17060 "only available with "
17064 "use of %<auto%> in parameter declaration "
17066 }
17067 else
17072 /* Since DR 743, decltype can either be a simple-type-specifier by
17073 itself or begin a nested-name-specifier. Parsing it will replace
17074 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17075 handling below decide what to do. */
17081 /* Consume the `typeof' token. */
17083 /* Parse the operand to `typeof'. */
17085 /* If it is not already a TYPE, take its type. */
17091 token,
17100 token,
17110 token,
17115 }
17117 /* If token is an already-parsed decltype not followed by ::,
17118 it's a simple-type-specifier. */
17121 {
17124 {
17126 token,
17128 /* Remember that we are handling a decltype in order to
17129 implement the resolution of DR 1510 when the argument
17130 isn't instantiation dependent. */
17132 }
17135 }
17137 /* If the type-specifier was for a built-in type, we're done. */
17139 {
17140 /* Record the type. */
17147 type,
17148 token,
17153 /* Consume the token. */
17159 /* There is no valid C++ program where a non-template type is
17160 followed by a "<". That usually indicates that the user thought
17161 that the type was a template. */
17166 }
17168 /* The type-specifier must be a user-defined type. */
17170 {
17174 /* Don't gobble tokens or issue error messages if this is an
17175 optional type-specifier. */
17181 /* Look for the optional `::' operator. */
17182 global_p
17186 /* Look for the nested-name specifier. */
17187 qualified_p
17194 /* If we have seen a nested-name-specifier, and the next token
17195 is `template', then we are using the template-id production. */
17198 {
17199 /* Look for the template-id. */
17203 none_type,
17205 /* If the template-id did not name a type, we are out of
17206 luck. */
17208 {
17211 }
17212 }
17213 /* Otherwise, look for a type-name. */
17214 else
17216 /* Keep track of all name-lookups performed in class scopes. */
17218 && !global_p
17219 && !qualified_p
17223 /* If it didn't work out, we don't have a TYPE. */
17228 {
17242 {
17244 none_type,
17254 else
17255 {
17260 }
17261 }
17262 else
17268 }
17271 token,
17273 }
17275 /* If we didn't get a type-name, issue an error message. */
17277 {
17280 }
17283 {
17284 /* See if TYPE is an Objective-C type, and if so, parse and
17285 accept any protocol references following it. Do this before
17286 the cp_parser_check_for_invalid_template_id() call, because
17287 Objective-C types can be followed by '<...>' which would
17288 enclose protocol names rather than template arguments, and so
17289 everything is fine. */
17292 {
17296 /* Clobber the "unqualified" type previously entered into
17297 DECL_SPECS with the new, improved protocol-qualified version. */
17302 }
17304 /* There is no valid C++ program where a non-template type is
17305 followed by a "<". That usually indicates that the user
17306 thought that the type was a template. */
17308 none_type,
17310 }
17313 }
17315 /* Parse a type-name.
17317 type-name:
17318 class-name
17319 enum-name
17320 typedef-name
17321 simple-template-id [in c++0x]
17323 enum-name:
17324 identifier
17326 typedef-name:
17327 identifier
17329 Concepts:
17331 type-name:
17332 concept-name
17333 partial-concept-id
17335 concept-name:
17336 identifier
17338 Returns a TYPE_DECL for the type. */
17340 static tree
17342 {
17344 }
17346 /* See above. */
17347 static tree
17349 {
17350 tree type_decl;
17352 /* We can't know yet whether it is a class-name or not. */
17354 /* Try a class-name. */
17356 typename_keyword_p,
17358 none_type,
17362 /* If it's not a class-name, keep looking. */
17364 {
17366 /* It must be a typedef-name or an enum-name. */
17370 /* It is either a simple-template-id representing an
17371 instantiation of an alias template... */
17375 none_type,
17377 /* Note that this must be an instantiation of an alias template
17378 because [temp.names]/6 says:
17380 A template-id that names an alias template specialization
17381 is a type-name.
17383 Whereas [temp.names]/7 says:
17385 A simple-template-id that names a class template
17386 specialization is a class-name.
17388 With concepts, this could also be a partial-concept-id that
17389 declares a non-type template parameter. */
17396 else
17400 /* ... Or a typedef-name or an enum-name. */
17402 }
17405 }
17407 /* Check if DECL and ARGS can form a constrained-type-specifier.
17408 If ARGS is non-null, we try to form a concept check of the
17409 form DECL<?, ARGS> where ? is a wildcard that matches any
17410 kind of template argument. If ARGS is NULL, then we try to
17411 form a concept check of the form DECL<?>. */
17413 static tree
17416 {
17419 /* If we a constrained-type-specifier cannot be deduced. */
17423 /* A constrained type specifier can only be found in an
17424 overload set or as a reference to a template declaration.
17426 FIXME: This might be masking a bug. It's possible that
17427 that the deduction below is causing template specializations
17428 to be formed with the wildcard as an argument. */
17432 /* Try to build a call expression that evaluates the
17433 concept. This can fail if the overload set refers
17434 only to non-templates. */
17440 /* Deduce the checked constraint and the prototype parameter.
17442 FIXME: In certain cases, failure to deduce should be a
17443 diagnosable error. */
17444 tree conc;
17445 tree proto;
17449 /* In template parameter scope, this results in a constrained
17450 parameter. Return a descriptor of that parm. */
17454 /* In a parameter-declaration-clause, constrained-type
17455 specifiers result in invented template parameters. */
17457 {
17460 }
17461 else
17462 {
17463 /* Otherwise, we're in a context where the constrained
17464 type name is deduced and the constraint applies
17465 after deduction. */
17467 }
17470 }
17472 /* If DECL refers to a concept, return a TYPE_DECL representing
17473 the result of using the constrained type specifier in the
17474 current context. DECL refers to a concept if
17476 - it is an overload set containing a function concept taking a single
17477 type argument, or
17479 - it is a variable concept taking a single type argument. */
17481 static tree
17483 {
17489 else
17491 }
17493 /* Check if DECL and ARGS form a partial-concept-id. If so,
17494 assign ID to the resulting constrained placeholder.
17496 Returns true if the partial-concept-id designates a placeholder
17497 and false otherwise. Note that *id is set to NULL_TREE in
17498 this case. */
17500 static tree
17502 {
17504 }
17506 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17507 or a concept-name.
17509 enum-name:
17510 identifier
17512 typedef-name:
17513 identifier
17515 concept-name:
17516 identifier
17518 Returns a TYPE_DECL for the type. */
17520 static tree
17522 {
17523 tree type_decl;
17524 tree identifier;
17531 /* Look up the type-name. */
17536 /* If we found an overload set, then it may refer to a concept-name. */
17542 {
17543 /* See if this is an Objective-C type. */
17548 }
17550 /* Issue an error if we did not find a type-name. */
17552 /* In Objective-C, we have the complication that class names are
17553 normally type names and start declarations (eg, the
17554 "NSObject" in "NSObject *object;"), but can be used in an
17555 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17556 is an expression. So, a classname followed by a dot is not a
17557 valid type-name. */
17560 {
17565 }
17566 /* Remember that the name was used in the definition of the
17567 current class so that we can check later to see if the
17568 meaning would have been different after the class was
17569 entirely defined. */
17575 }
17577 /* Parse an elaborated-type-specifier. Note that the grammar given
17578 here incorporates the resolution to DR68.
17580 elaborated-type-specifier:
17581 class-key :: [opt] nested-name-specifier [opt] identifier
17582 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17583 enum-key :: [opt] nested-name-specifier [opt] identifier
17584 typename :: [opt] nested-name-specifier identifier
17585 typename :: [opt] nested-name-specifier template [opt]
17586 template-id
17588 GNU extension:
17590 elaborated-type-specifier:
17591 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17592 class-key attributes :: [opt] nested-name-specifier [opt]
17593 template [opt] template-id
17594 enum attributes :: [opt] nested-name-specifier [opt] identifier
17596 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17597 declared `friend'. If IS_DECLARATION is TRUE, then this
17598 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17599 something is being declared.
17601 Returns the TYPE specified. */
17603 static tree
17607 {
17609 tree identifier;
17612 tree globalscope;
17615 /* See if we're looking at the `enum' keyword. */
17617 {
17618 /* Consume the `enum' token. */
17620 /* Remember that it's an enumeration type. */
17622 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17623 enums) is used here. */
17627 {
17634 /* Consume the `struct' or `class' and parse it anyway. */
17636 }
17637 /* Parse the attributes. */
17639 }
17640 /* Or, it might be `typename'. */
17642 RID_TYPENAME))
17643 {
17644 /* Consume the `typename' token. */
17646 /* Remember that it's a `typename' type. */
17648 }
17649 /* Otherwise it must be a class-key. */
17650 else
17651 {
17655 /* Parse the attributes. */
17657 }
17659 /* Look for the `::' operator. */
17662 /* Look for the nested-name-specifier. */
17663 tree nested_name_specifier;
17665 {
17666 nested_name_specifier
17671 is_declaration);
17674 }
17675 else
17676 /* Even though `typename' is not present, the proposed resolution
17677 to Core Issue 180 says that in `class A<T>::B', `B' should be
17678 considered a type-name, even if `A<T>' is dependent. */
17679 nested_name_specifier
17684 is_declaration);
17685 /* For everything but enumeration types, consider a template-id.
17686 For an enumeration type, consider only a plain identifier. */
17688 {
17690 tree decl;
17692 /* Allow the `template' keyword. */
17694 /* If we didn't see `template', we don't know if there's a
17695 template-id or not. */
17698 /* Parse the template-id. */
17702 tag_type,
17703 is_declaration);
17704 /* If we didn't find a template-id, look for an ordinary
17705 identifier. */
17707 ;
17708 /* We can get here when cp_parser_template_id, called by
17709 cp_parser_class_name with tag_type == none_type, succeeds
17710 and caches a BASELINK. Then, when called again here,
17711 instead of failing and returning an error_mark_node
17712 returns it (see template/typename17.C in C++11).
17713 ??? Could we diagnose this earlier? */
17715 {
17718 }
17719 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17720 in effect, then we must assume that, upon instantiation, the
17721 template will correspond to a class. */
17725 typename_type,
17727 /* If the `typename' keyword is in effect and DECL is not a type
17728 decl, then type is non existent. */
17730 ;
17732 {
17736 /* If the next token is a semicolon, this must be a specialization,
17737 instantiation, or friend declaration. Check the scope while we
17738 still know whether or not we had a nested-name-specifier. */
17743 }
17746 }
17749 {
17754 {
17757 }
17759 /* For a `typename', we needn't call xref_tag. */
17765 /* Template parameter lists apply only if we are not within a
17766 function parameter list. */
17767 bool template_parm_lists_apply
17776 /* Look up a qualified name in the usual way. */
17778 {
17779 tree decl;
17780 tree ambiguous_decls;
17783 tag_type,
17790 /* If the lookup was ambiguous, an error will already have been
17791 issued. */
17795 /* If we are parsing friend declaration, DECL may be a
17796 TEMPLATE_DECL tree node here. However, we need to check
17797 whether this TEMPLATE_DECL results in valid code. Consider
17798 the following example:
17800 namespace N {
17801 template <class T> class C {};
17802 }
17803 class X {
17804 template <class T> friend class N::C; // #1, valid code
17805 };
17806 template <class T> class Y {
17807 friend class N::C; // #2, invalid code
17808 };
17810 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17811 name lookup of `N::C'. We see that friend declaration must
17812 be template for the code to be valid. Note that
17813 processing_template_decl does not work here since it is
17814 always 1 for the above two cases. */
17816 decl = (cp_parser_maybe_treat_template_as_class
17821 {
17823 identifier,
17826 }
17829 {
17833 allow_template);
17837 }
17839 /* Forward declarations of nested types, such as
17841 class C1::C2;
17842 class C1::C2::C3;
17844 are invalid unless all components preceding the final '::'
17845 are complete. If all enclosing types are complete, these
17846 declarations become merely pointless.
17848 Invalid forward declarations of nested types are errors
17849 caught elsewhere in parsing. Those that are pointless arrive
17850 here. */
17857 }
17858 else
17859 {
17860 /* An elaborated-type-specifier sometimes introduces a new type and
17861 sometimes names an existing type. Normally, the rule is that it
17862 introduces a new type only if there is not an existing type of
17863 the same name already in scope. For example, given:
17865 struct S {};
17866 void f() { struct S s; }
17868 the `struct S' in the body of `f' is the same `struct S' as in
17869 the global scope; the existing definition is used. However, if
17870 there were no global declaration, this would introduce a new
17871 local class named `S'.
17873 An exception to this rule applies to the following code:
17875 namespace N { struct S; }
17877 Here, the elaborated-type-specifier names a new type
17878 unconditionally; even if there is already an `S' in the
17879 containing scope this declaration names a new type.
17880 This exception only applies if the elaborated-type-specifier
17881 forms the complete declaration:
17883 [class.name]
17885 A declaration consisting solely of `class-key identifier ;' is
17886 either a redeclaration of the name in the current scope or a
17887 forward declaration of the identifier as a class name. It
17888 introduces the name into the current scope.
17890 We are in this situation precisely when the next token is a `;'.
17892 An exception to the exception is that a `friend' declaration does
17893 *not* name a new type; i.e., given:
17895 struct S { friend struct T; };
17897 `T' is not a new type in the scope of `S'.
17899 Also, `new struct S' or `sizeof (struct S)' never results in the
17900 definition of a new type; a new type can only be declared in a
17901 declaration context. */
17903 tag_scope ts;
17907 /* Friends have special name lookup rules. */
17911 CPP_SEMICOLON))
17912 /* This is a `class-key identifier ;' */
17914 else
17917 template_p =
17918 (template_parm_lists_apply
17921 /* An unqualified name was used to reference this type, so
17922 there were no qualifying templates. */
17931 }
17932 }
17937 /* Allow attributes on forward declarations of classes. */
17939 {
17949 else
17952 }
17955 {
17956 /* Indicate whether this class was declared as a `class' or as a
17957 `struct'. */
17961 }
17963 /* A "<" cannot follow an elaborated type specifier. If that
17964 happens, the user was probably trying to form a template-id. */
17969 }
17971 /* Parse an enum-specifier.
17973 enum-specifier:
17974 enum-head { enumerator-list [opt] }
17975 enum-head { enumerator-list , } [C++0x]
17977 enum-head:
17978 enum-key identifier [opt] enum-base [opt]
17979 enum-key nested-name-specifier identifier enum-base [opt]
17981 enum-key:
17982 enum
17983 enum class [C++0x]
17984 enum struct [C++0x]
17986 enum-base: [C++0x]
17987 : type-specifier-seq
17989 opaque-enum-specifier:
17990 enum-key identifier enum-base [opt] ;
17992 GNU Extensions:
17993 enum-key attributes[opt] identifier [opt] enum-base [opt]
17994 { enumerator-list [opt] }attributes[opt]
17995 enum-key attributes[opt] identifier [opt] enum-base [opt]
17996 { enumerator-list, }attributes[opt] [C++0x]
17998 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17999 if the token stream isn't an enum-specifier after all. */
18001 static tree
18003 {
18004 tree identifier;
18006 tree prev_scope;
18008 tree attributes;
18021 /* Parse tentatively so that we can back up if we don't find a
18022 enum-specifier. */
18025 /* Caller guarantees that the current token is 'enum', an identifier
18026 possibly follows, and the token after that is an opening brace.
18027 If we don't have an identifier, fabricate an anonymous name for
18028 the enumeration being defined. */
18031 /* Parse the "class" or "struct", which indicates a scoped
18032 enumeration type in C++0x. */
18035 {
18039 /* Consume the `struct' or `class' token. */
18043 }
18047 /* Clear the qualification. */
18052 /* Figure out in what scope the declaration is being placed. */
18058 nested_name_specifier
18066 {
18067 tree name;
18071 enum_type,
18076 input_location);
18078 {
18081 {
18082 /* Are template enums allowed in ISO? */
18086 /* ignore a typename reference, for it will be solved by name
18087 in start_enum. */
18089 }
18090 }
18093 else
18094 {
18099 }
18100 }
18101 else
18102 {
18105 else
18106 {
18112 }
18113 }
18116 /* Check for the `:' that denotes a specified underlying type in C++0x.
18117 Note that a ':' could also indicate a bitfield width, however. */
18119 {
18120 cp_decl_specifier_seq type_specifiers;
18122 /* Consume the `:'. */
18125 /* Parse the type-specifier-seq. */
18130 /* At this point this is surely not elaborated type specifier. */
18139 /* If that didn't work, stop. */
18141 {
18147 }
18148 }
18150 /* Look for the `{' but don't consume it yet. */
18152 {
18154 {
18157 {
18160 }
18161 }
18162 /* An opaque-enum-specifier must have a ';' here. */
18165 {
18168 {
18171 }
18172 }
18173 }
18179 {
18181 {
18185 }
18187 {
18189 }
18190 }
18192 /* Issue an error message if type-definitions are forbidden here. */
18195 else
18196 /* Create the new type. We do this before consuming the opening
18197 brace so the enum will be recorded as being on the line of its
18198 tag (or the 'enum' keyword, if there is no tag). */
18202 /* If the next token is not '{' it is an opaque-enum-specifier or an
18203 elaborated-type-specifier. */
18205 {
18209 {
18210 /* The following catches invalid code such as:
18211 enum class S<int>::E { A, B, C }; */
18219 {
18223 nested_name_specifier);
18225 }
18228 {
18230 "%qT for enum declaration does not name a class "
18233 }
18234 /* If that scope does not contain the scope in which the
18235 class was originally declared, the program is invalid. */
18237 nested_name_specifier))
18238 {
18241 "declaration of %qD in namespace %qD which does not "
18244 else
18246 "declaration of %qD in %qD which does not "
18250 }
18251 /* If that scope is the scope where the declaration is being placed
18252 the program is invalid. */
18256 {
18260 }
18261 }
18266 /* Consume the opening brace. */
18267 matching_braces braces;
18274 {
18278 }
18279 else
18280 {
18286 }
18290 /* If the next token is not '}', then there are some enumerators. */
18292 {
18296 }
18297 else
18300 /* Consume the final '}'. */
18306 }
18307 else
18308 {
18309 /* If a ';' follows, then it is an opaque-enum-specifier
18310 and additional restrictions apply. */
18312 {
18319 }
18320 }
18322 /* Look for trailing attributes to apply to this enumeration, and
18323 apply them if appropriate. */
18325 {
18328 trailing_attr,
18330 }
18332 /* Finish up the enumeration. */
18334 {
18339 }
18342 {
18344 {
18347 }
18349 {
18351 }
18352 }
18353 out:
18356 }
18358 /* Parse an enumerator-list. The enumerators all have the indicated
18359 TYPE.
18361 enumerator-list:
18362 enumerator-definition
18363 enumerator-list , enumerator-definition */
18365 static void
18367 {
18369 {
18370 /* Parse an enumerator-definition. */
18373 /* If the next token is not a ',', we've reached the end of
18374 the list. */
18377 /* Otherwise, consume the `,' and keep going. */
18379 /* If the next token is a `}', there is a trailing comma. */
18381 {
18386 }
18387 }
18388 }
18390 /* Parse an enumerator-definition. The enumerator has the indicated
18391 TYPE.
18393 enumerator-definition:
18394 enumerator
18395 enumerator = constant-expression
18397 enumerator:
18398 identifier
18400 GNU Extensions:
18402 enumerator-definition:
18403 enumerator attributes [opt]
18404 enumerator attributes [opt] = constant-expression */
18406 static void
18408 {
18409 tree identifier;
18410 tree value;
18411 location_t loc;
18413 /* Save the input location because we are interested in the location
18414 of the identifier and not the location of the explicit value. */
18417 /* Look for the identifier. */
18422 /* Parse any specified attributes. */
18425 /* If the next token is an '=', then there is an explicit value. */
18427 {
18428 /* Consume the `=' token. */
18430 /* Parse the value. */
18432 }
18433 else
18436 /* If we are processing a template, make sure the initializer of the
18437 enumerator doesn't contain any bare template parameter pack. */
18441 /* Create the enumerator. */
18443 }
18445 /* Parse a namespace-name.
18447 namespace-name:
18448 original-namespace-name
18449 namespace-alias
18451 Returns the NAMESPACE_DECL for the namespace. */
18453 static tree
18455 {
18456 tree identifier;
18457 tree namespace_decl;
18461 /* Get the name of the namespace. */
18466 /* Look up the identifier in the currently active scope. Look only
18467 for namespaces, due to:
18469 [basic.lookup.udir]
18471 When looking up a namespace-name in a using-directive or alias
18472 definition, only namespace names are considered.
18474 And:
18476 [basic.lookup.qual]
18478 During the lookup of a name preceding the :: scope resolution
18479 operator, object, function, and enumerator names are ignored.
18481 (Note that cp_parser_qualifying_entity only calls this
18482 function if the token after the name is the scope resolution
18483 operator.) */
18485 none_type,
18491 /* If it's not a namespace, issue an error. */
18494 {
18496 {
18502 }
18505 }
18508 }
18510 /* Parse a namespace-definition.
18512 namespace-definition:
18513 named-namespace-definition
18514 unnamed-namespace-definition
18516 named-namespace-definition:
18517 original-namespace-definition
18518 extension-namespace-definition
18520 original-namespace-definition:
18521 namespace identifier { namespace-body }
18523 extension-namespace-definition:
18524 namespace original-namespace-name { namespace-body }
18526 unnamed-namespace-definition:
18527 namespace { namespace-body } */
18529 static void
18531 {
18532 tree identifier;
18541 {
18544 }
18546 /* Look for the `namespace' keyword. */
18547 cp_token* token
18550 /* Parse any specified attributes before the identifier. */
18554 {
18558 {
18561 /* Parse any attributes specified after the identifier. */
18563 }
18570 "nested namespace definitions only available with "
18573 /* Nested namespace names can create new namespaces (unlike
18574 other qualified-ids). */
18577 else
18580 }
18592 /* Start the namespace. */
18599 /* Look for the `{' to validate starting the namespace. */
18600 matching_braces braces;
18602 {
18603 /* Parse the body of the namespace. */
18606 /* Look for the final `}'. */
18608 }
18613 /* Pop the nested namespace definitions. */
18616 }
18618 /* Parse a namespace-body.
18620 namespace-body:
18621 declaration-seq [opt] */
18623 static void
18625 {
18627 }
18629 /* Parse a namespace-alias-definition.
18631 namespace-alias-definition:
18632 namespace identifier = qualified-namespace-specifier ; */
18634 static void
18636 {
18637 tree identifier;
18638 tree namespace_specifier;
18642 /* Look for the `namespace' keyword. */
18644 /* Look for the identifier. */
18648 /* Look for the `=' token. */
18651 {
18653 /* Skip the definition. */
18658 }
18660 /* Look for the qualified-namespace-specifier. */
18661 namespace_specifier
18663 /* Look for the `;' token. */
18666 /* Register the alias in the symbol table. */
18668 }
18670 /* Parse a qualified-namespace-specifier.
18672 qualified-namespace-specifier:
18673 :: [opt] nested-name-specifier [opt] namespace-name
18675 Returns a NAMESPACE_DECL corresponding to the specified
18676 namespace. */
18678 static tree
18680 {
18681 /* Look for the optional `::'. */
18685 /* Look for the optional nested-name-specifier. */
18693 }
18695 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18696 access declaration.
18698 using-declaration:
18699 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18700 using :: unqualified-id ;
18702 access-declaration:
18703 qualified-id ;
18705 */
18707 static bool
18710 {
18714 tree decl;
18715 tree identifier;
18716 tree qscope;
18721 {
18724 }
18725 else
18726 {
18727 /* Look for the `using' keyword. */
18730 again:
18731 /* Peek at the next token. */
18733 /* See if it's `typename'. */
18735 {
18736 /* Remember that we've seen it. */
18738 /* Consume the `typename' token. */
18740 }
18741 }
18743 /* Look for the optional global scope qualification. */
18744 global_scope_p
18749 /* If we saw `typename', or didn't see `::', then there must be a
18750 nested-name-specifier present. */
18752 {
18758 {
18761 }
18762 }
18763 /* Otherwise, we could be in either of the two productions. In that
18764 case, treat the nested-name-specifier as optional. */
18765 else
18777 /* Something has already gone wrong; there's no need to parse
18778 further. Since an error has occurred, the return value of
18779 cp_parser_parse_definitely will be false, as required. */
18783 /* Parse the unqualified-id. */
18791 {
18796 }
18798 {
18803 "pack expansion in using-declaration only available "
18806 }
18808 /* The function we call to handle a using-declaration is different
18809 depending on what scope we are in. */
18811 ;
18814 /* [namespace.udecl]
18816 A using declaration shall not name a template-id. */
18819 else
18820 {
18822 {
18823 /* Create the USING_DECL. */
18830 {
18833 }
18834 else
18835 /* Add it to the list of members in this class. */
18837 }
18838 else
18839 {
18841 identifier,
18848 {
18851 }
18854 else
18856 }
18857 }
18861 {
18865 "comma-separated list in using-declaration only available "
18868 }
18870 /* Look for the final `;'. */
18875 "access declarations are deprecated "
18876 "in favour of using-declarations; "
18880 }
18882 /* Parse an alias-declaration.
18884 alias-declaration:
18885 using identifier attribute-specifier-seq [opt] = type-id */
18887 static tree
18889 {
18891 location_t id_location;
18893 cp_decl_specifier_seq decl_specs;
18897 /* Look for the `using' keyword. */
18898 cp_token *using_token
18920 /* Now we are going to parse the type-id of the declaration. */
18922 /*
18923 [dcl.type]/3 says:
18925 "A type-specifier-seq shall not define a class or enumeration
18926 unless it appears in the type-id of an alias-declaration (7.1.3) that
18927 is not the declaration of a template-declaration."
18929 In other words, if we currently are in an alias template, the
18930 type-id should not define a type.
18932 So let's set parser->type_definition_forbidden_message in that
18933 case; cp_parser_check_type_definition (called by
18934 cp_parser_class_specifier) will then emit an error if a type is
18935 defined in the type-id. */
18937 {
18941 }
18945 /* Restore the error message if need be. */
18951 {
18954 }
18956 /* A typedef-name can also be introduced by an alias-declaration. The
18957 identifier following the using keyword becomes a typedef-name. It has
18958 the same semantics as if it were introduced by the typedef
18959 specifier. In particular, it does not define a new type and it shall
18960 not appear in the type-id. */
18965 {
18968 ds_attribute,
18969 attrs_token);
18970 }
18972 ds_typedef,
18973 using_token);
18975 ds_alias,
18976 using_token);
18982 id_location,
18993 else
18999 // Attach constraints to the alias declaration.
19001 {
19005 }
19012 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19013 added into the symbol table; otherwise, return the TYPE_DECL. */
19017 {
19021 }
19024 }
19026 /* Parse a using-directive.
19028 using-directive:
19029 using namespace :: [opt] nested-name-specifier [opt]
19030 namespace-name ; */
19032 static void
19034 {
19035 tree namespace_decl;
19036 tree attribs;
19038 /* Look for the `using' keyword. */
19040 /* And the `namespace' keyword. */
19042 /* Look for the optional `::' operator. */
19044 /* And the optional nested-name-specifier. */
19050 /* Get the namespace being used. */
19052 /* And any specified attributes. */
19055 /* Update the symbol table. */
19058 else
19061 /* Look for the final `;'. */
19063 }
19065 /* Parse an asm-definition.
19067 asm-definition:
19068 asm ( string-literal ) ;
19070 GNU Extension:
19072 asm-definition:
19073 asm volatile [opt] ( string-literal ) ;
19074 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19075 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19076 : asm-operand-list [opt] ) ;
19077 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19078 : asm-operand-list [opt]
19079 : asm-clobber-list [opt] ) ;
19080 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19081 : asm-clobber-list [opt]
19082 : asm-goto-list ) ; */
19084 static void
19086 {
19087 tree string;
19092 tree asm_stmt;
19100 /* Look for the `asm' keyword. */
19105 {
19108 }
19110 /* See if the next token is `volatile'. */
19113 {
19114 /* Remember that we saw the `volatile' keyword. */
19116 /* Consume the token. */
19118 }
19122 {
19123 /* Remember that we saw the `goto' keyword. */
19125 /* Consume the token. */
19127 }
19128 /* Look for the opening `('. */
19131 /* Look for the string. */
19134 {
19138 }
19140 /* If we're allowing GNU extensions, check for the extended assembly
19141 syntax. Unfortunately, the `:' tokens need not be separated by
19142 a space in C, and so, for compatibility, we tolerate that here
19143 too. Doing that means that we have to treat the `::' operator as
19144 two `:' tokens. */
19149 {
19154 /* The extended syntax was used. */
19157 /* Look for outputs. */
19159 {
19160 /* Consume the `:'. */
19162 /* Parse the output-operands. */
19164 CPP_COLON)
19166 CPP_SCOPE)
19168 CPP_CLOSE_PAREN)
19170 {
19174 }
19175 }
19176 /* If the next token is `::', there are no outputs, and the
19177 next token is the beginning of the inputs. */
19179 /* The inputs are coming next. */
19182 /* Look for inputs. */
19185 {
19186 /* Consume the `:' or `::'. */
19188 /* Parse the output-operands. */
19190 CPP_COLON)
19192 CPP_SCOPE)
19194 CPP_CLOSE_PAREN))
19195 {
19199 }
19200 }
19202 /* The clobbers are coming next. */
19205 /* Look for clobbers. */
19208 {
19210 /* Consume the `:' or `::'. */
19212 /* Parse the clobbers. */
19214 CPP_COLON)
19216 CPP_CLOSE_PAREN))
19218 }
19221 /* The labels are coming next. */
19224 /* Look for labels. */
19227 {
19229 /* Consume the `:' or `::'. */
19231 /* Parse the labels. */
19233 }
19237 }
19241 /* Look for the closing `)'. */
19249 {
19250 /* Create the ASM_EXPR. */
19252 {
19255 /* If the extended syntax was not used, mark the ASM_EXPR. */
19257 {
19263 }
19264 }
19265 else
19267 }
19268 }
19270 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19271 type that comes from the decl-specifier-seq. */
19273 static tree
19275 {
19278 {
19291 }
19294 }
19296 /* Declarators [gram.dcl.decl] */
19298 /* Parse an init-declarator.
19300 init-declarator:
19301 declarator initializer [opt]
19303 GNU Extension:
19305 init-declarator:
19306 declarator asm-specification [opt] attributes [opt] initializer [opt]
19308 function-definition:
19309 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19310 function-body
19311 decl-specifier-seq [opt] declarator function-try-block
19313 GNU Extension:
19315 function-definition:
19316 __extension__ function-definition
19318 TM Extension:
19320 function-definition:
19321 decl-specifier-seq [opt] declarator function-transaction-block
19323 The DECL_SPECIFIERS apply to this declarator. Returns a
19324 representation of the entity declared. If MEMBER_P is TRUE, then
19325 this declarator appears in a class scope. The new DECL created by
19326 this declarator is returned.
19328 The CHECKS are access checks that should be performed once we know
19329 what entity is being declared (and, therefore, what classes have
19330 befriended it).
19332 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19333 for a function-definition here as well. If the declarator is a
19334 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19335 be TRUE upon return. By that point, the function-definition will
19336 have been completely parsed.
19338 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19339 is FALSE.
19341 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19342 parsed declaration if it is an uninitialized single declarator not followed
19343 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19344 if present, will not be consumed. If returned, this declarator will be
19345 created with SD_INITIALIZED but will not call cp_finish_decl.
19347 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19348 and there is an initializer, the pointed location_t is set to the
19349 location of the '=' or `(', or '{' in C++11 token introducing the
19350 initializer. */
19352 static tree
19363 {
19367 tree prefix_attributes;
19369 tree asm_specification;
19370 tree initializer;
19372 tree scope;
19374 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19375 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19376 "(...)". */
19387 /* Gather the attributes that were provided with the
19388 decl-specifiers. */
19391 /* Assume that this is not the declarator for a function
19392 definition. */
19396 /* Default arguments are only permitted for function parameters. */
19400 /* Defer access checks while parsing the declarator; we cannot know
19401 what names are accessible until we know what is being
19402 declared. */
19407 /* Parse the declarator. */
19408 declarator
19413 /* Gather up the deferred checks. */
19418 /* If the DECLARATOR was erroneous, there's no need to go
19419 further. */
19423 /* Check that the number of template-parameter-lists is OK. */
19433 /* Figure out what scope the entity declared by the DECLARATOR is
19434 located in. `grokdeclarator' sometimes changes the scope, so
19435 we compute it now. */
19438 /* Perform any lookups in the declared type which were thought to be
19439 dependent, but are not in the scope of the declarator. */
19440 decl_specifiers->type
19443 /* If we're allowing GNU extensions, look for an
19444 asm-specification. */
19446 {
19447 /* Look for an asm-specification. */
19450 }
19451 else
19454 /* Look for attributes. */
19458 /* Peek at the next token. */
19464 {
19465 /* Handle C++17 deduction guides. */
19469 {
19477 {
19481 }
19482 }
19484 /* Check to see if the token indicates the start of a
19485 function-definition. */
19487 {
19489 {
19490 /* If a function-definition should not appear here, issue an
19491 error message. */
19495 }
19497 location_t func_brace_location
19500 /* Neither attributes nor an asm-specification are allowed
19501 on a function-definition. */
19504 "an asm-specification is not allowed "
19508 "attributes are not allowed "
19510 /* This is a function-definition. */
19513 /* Parse the function definition. */
19516 decl_specifiers,
19517 declarator,
19518 prefix_attributes);
19519 else
19520 decl =
19521 (cp_parser_function_definition_from_specifiers_and_declarator
19525 {
19526 /* This is where the prologue starts... */
19529 }
19532 }
19533 }
19535 {
19536 /* A non-template declaration involving a function parameter list
19537 containing an implicit template parameter will be made into a
19538 template. If the resulting declaration is not going to be an
19539 actual function then finish the template scope here to prevent it.
19540 An error message will be issued once we have a decl to talk about.
19542 FIXME probably we should do type deduction rather than create an
19543 implicit template, but the standard currently doesn't allow it. */
19546 }
19548 /* [dcl.dcl]
19550 Only in function declarations for constructors, destructors, type
19551 conversions, and deduction guides can the decl-specifier-seq be omitted.
19553 We explicitly postpone this check past the point where we handle
19554 function-definitions because we tolerate function-definitions
19555 that are missing their return types in some modes. */
19557 {
19561 }
19563 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19567 {
19578 {
19584 }
19585 }
19586 else
19587 {
19588 /* If the init-declarator isn't initialized and isn't followed by a
19589 `,' or `;', it's not a valid init-declarator. */
19592 {
19595 else
19596 {
19600 }
19601 }
19604 }
19606 /* Because start_decl has side-effects, we should only call it if we
19607 know we're going ahead. By this point, we know that we cannot
19608 possibly be looking at any other construct. */
19611 /* Enter the newly declared entry in the symbol table. If we're
19612 processing a declaration in a class-specifier, we wait until
19613 after processing the initializer. */
19615 {
19623 /* Adjust location of decl if declarator->id_loc is more appropriate:
19624 set, and decl wasn't merged with another decl, in which case its
19625 location would be different from input_location, and more accurate. */
19630 }
19632 /* Enter the SCOPE. That way unqualified names appearing in the
19633 initializer will be looked up in SCOPE. */
19636 /* Perform deferred access control checks, now that we know in which
19637 SCOPE the declared entity resides. */
19639 {
19642 /* If the entity being declared is a function, pretend that we
19643 are in its scope. If it is a `friend', it may have access to
19644 things that would not otherwise be accessible. */
19646 {
19649 }
19651 /* Perform access checks for template parameters. */
19654 /* Perform the access control checks for the declarator and the
19655 decl-specifiers. */
19658 /* Restore the saved value. */
19661 }
19663 /* Parse the initializer. */
19668 {
19670 {
19673 else
19674 {
19675 /* If the declaration was erroneous, we don't really
19676 know what the user intended, so just silently
19677 consume the initializer. */
19684 }
19685 }
19686 else
19687 {
19688 /* We want to record the extra mangling scope for in-class
19689 initializers of class members and initializers of static data
19690 member templates. The former involves deferring
19691 parsing of the initializer until end of class as with default
19692 arguments. So right here we only handle the latter. */
19702 }
19703 }
19705 /* The old parser allows attributes to appear after a parenthesized
19706 initializer. Mark Mitchell proposed removing this functionality
19707 on the GCC mailing lists on 2002-08-13. This parser accepts the
19708 attributes -- but ignores them. Made a permerror in GCC 8. */
19714 {
19717 {
19721 }
19722 }
19724 /* And now complain about a non-function implicit template. */
19729 /* For an in-class declaration, use `grokfield' to create the
19730 declaration. */
19732 {
19734 {
19737 }
19746 }
19748 /* Finish processing the declaration. But, skip member
19749 declarations. */
19751 {
19754 asm_specification,
19755 /* If the initializer is in parentheses, then this is
19756 a direct-initialization, which means that an
19757 `explicit' constructor is OK. Otherwise, an
19758 `explicit' constructor cannot be used. */
19761 }
19764 /* Core issue #226 (C++0x only): A default template-argument
19765 shall not be specified in a friend class template
19766 declaration. */
19775 {
19778 else
19780 }
19787 }
19789 /* Parse a declarator.
19791 declarator:
19792 direct-declarator
19793 ptr-operator declarator
19795 abstract-declarator:
19796 ptr-operator abstract-declarator [opt]
19797 direct-abstract-declarator
19799 GNU Extensions:
19801 declarator:
19802 attributes [opt] direct-declarator
19803 attributes [opt] ptr-operator declarator
19805 abstract-declarator:
19806 attributes [opt] ptr-operator abstract-declarator [opt]
19807 attributes [opt] direct-abstract-declarator
19809 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19810 detect constructors, destructors, deduction guides, or conversion operators.
19811 It is set to -1 if the declarator is a name, and +1 if it is a
19812 function. Otherwise it is set to zero. Usually you just want to
19813 test for >0, but internally the negative value is used.
19815 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19816 a decl-specifier-seq unless it declares a constructor, destructor,
19817 or conversion. It might seem that we could check this condition in
19818 semantic analysis, rather than parsing, but that makes it difficult
19819 to handle something like `f()'. We want to notice that there are
19820 no decl-specifiers, and therefore realize that this is an
19821 expression, not a declaration.)
19823 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19824 the declarator is a direct-declarator of the form "(...)".
19826 MEMBER_P is true iff this declarator is a member-declarator.
19828 FRIEND_P is true iff this declarator is a friend. */
19832 cp_parser_declarator_kind dcl_kind,
19836 {
19839 cp_cv_quals cv_quals;
19840 tree class_type;
19843 /* Assume this is not a constructor, destructor, or type-conversion
19844 operator. */
19851 /* Check for the ptr-operator production. */
19853 /* Parse the ptr-operator. */
19859 /* If that worked, then we have a ptr-operator. */
19861 {
19862 /* If a ptr-operator was found, then this declarator was not
19863 parenthesized. */
19866 /* The dependent declarator is optional if we are parsing an
19867 abstract-declarator. */
19871 /* Parse the dependent declarator. */
19876 friend_p);
19878 /* If we are parsing an abstract-declarator, we must handle the
19879 case where the dependent declarator is absent. */
19884 declarator = cp_parser_make_indirect_declarator
19886 }
19887 /* Everything else is a direct-declarator. */
19888 else
19889 {
19892 CPP_OPEN_PAREN);
19894 ctor_dtor_or_conv_p,
19896 }
19901 }
19903 /* Parse a direct-declarator or direct-abstract-declarator.
19905 direct-declarator:
19906 declarator-id
19907 direct-declarator ( parameter-declaration-clause )
19908 cv-qualifier-seq [opt]
19909 ref-qualifier [opt]
19910 exception-specification [opt]
19911 direct-declarator [ constant-expression [opt] ]
19912 ( declarator )
19914 direct-abstract-declarator:
19915 direct-abstract-declarator [opt]
19916 ( parameter-declaration-clause )
19917 cv-qualifier-seq [opt]
19918 ref-qualifier [opt]
19919 exception-specification [opt]
19920 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19921 ( abstract-declarator )
19923 Returns a representation of the declarator. DCL_KIND is
19924 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19925 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19926 we are parsing a direct-declarator. It is
19927 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19928 of ambiguity we prefer an abstract declarator, as per
19929 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19930 as for cp_parser_declarator. */
19934 cp_parser_declarator_kind dcl_kind,
19937 {
19948 {
19949 /* Peek at the next token. */
19952 {
19953 /* This is either a parameter-declaration-clause, or a
19954 parenthesized declarator. When we know we are parsing a
19955 named declarator, it must be a parenthesized declarator
19956 if FIRST is true. For instance, `(int)' is a
19957 parameter-declaration-clause, with an omitted
19958 direct-abstract-declarator. But `((*))', is a
19959 parenthesized abstract declarator. Finally, when T is a
19960 template parameter `(T)' is a
19961 parameter-declaration-clause, and not a parenthesized
19962 named declarator.
19964 We first try and parse a parameter-declaration-clause,
19965 and then try a nested declarator (if FIRST is true).
19967 It is not an error for it not to be a
19968 parameter-declaration-clause, even when FIRST is
19969 false. Consider,
19971 int i (int);
19972 int i (3);
19974 The first is the declaration of a function while the
19975 second is the definition of a variable, including its
19976 initializer.
19978 Having seen only the parenthesis, we cannot know which of
19979 these two alternatives should be selected. Even more
19980 complex are examples like:
19982 int i (int (a));
19983 int i (int (3));
19985 The former is a function-declaration; the latter is a
19986 variable initialization.
19988 Thus again, we try a parameter-declaration-clause, and if
19989 that fails, we back out and return. */
19992 {
19993 tree params;
19998 /* In a member-declarator, the only valid interpretation
19999 of a parenthesis is the start of a
20000 parameter-declaration-clause. (It is invalid to
20001 initialize a static data member with a parenthesized
20002 initializer; only the "=" form of initialization is
20003 permitted.) */
20007 /* Consume the `('. */
20008 matching_parens parens;
20011 {
20012 /* If this is going to be an abstract declarator, we're
20013 in a declarator and we can't have default args. */
20016 }
20020 /* Parse the parameter-declaration-clause. */
20023 /* Consume the `)'. */
20026 /* If all went well, parse the cv-qualifier-seq,
20027 ref-qualifier and the exception-specification. */
20029 {
20030 cp_cv_quals cv_quals;
20031 cp_virt_specifiers virt_specifiers;
20032 cp_ref_qualifier ref_qual;
20033 tree exception_specification;
20034 tree late_return;
20035 tree attrs;
20045 /* Parse the cv-qualifier-seq. */
20047 /* Parse the ref-qualifier. */
20049 /* Parse the tx-qualifier. */
20051 /* And the exception-specification. */
20052 exception_specification
20057 /* In here, we handle cases where attribute is used after
20058 the function declaration. For example:
20059 void func (int x) __attribute__((vector(..))); */
20062 late_return = (cp_parser_late_return_type_opt
20066 /* Parse the virt-specifier-seq. */
20069 /* Create the function-declarator. */
20071 params,
20072 cv_quals,
20073 virt_specifiers,
20074 ref_qual,
20075 tx_qual,
20076 exception_specification,
20077 late_return,
20078 requires_clause);
20081 /* Any subsequent parameter lists are to do with
20082 return type, so are not those of the declared
20083 function. */
20085 }
20087 /* Remove the function parms from scope. */
20091 /* Repeat the main loop. */
20093 }
20095 /* If this is the first, we can try a parenthesized
20096 declarator. */
20098 {
20105 /* Consume the `('. */
20106 matching_parens parens;
20108 /* Parse the nested declarator. */
20111 declarator
20117 /* Expect a `)'. */
20125 }
20126 /* Otherwise, we must be done. */
20127 else
20129 }
20133 {
20134 /* Parse an array-declarator. */
20144 /* Consume the `['. */
20146 /* Peek at the next token. */
20148 /* If the next token is `]', then there is no
20149 constant-expression. */
20151 {
20153 bounds
20163 {
20164 /* Normally, the array bound must be an integral constant
20165 expression. However, as an extension, we allow VLAs
20166 in function scopes as long as they aren't part of a
20167 parameter declaration. */
20171 }
20174 {
20175 /* Remember this wasn't a constant-expression. */
20178 }
20179 }
20180 else
20182 /* Look for the closing `]'. */
20184 {
20187 }
20192 }
20194 {
20195 {
20196 tree qualifying_scope;
20197 tree unqualified_name;
20198 tree attrs;
20199 special_function_kind sfk;
20204 /* Parse a declarator-id */
20207 {
20210 /* If we see an ellipsis, we should be looking at a
20211 parameter pack. */
20213 {
20214 /* Consume the `...' */
20218 }
20219 }
20222 unqualified_name
20226 {
20230 {
20231 /* Check whether an error occurred. */
20234 /* We already consumed the ellipsis to mark a
20235 parameter pack, but we have no way to report it,
20236 so abort the tentative parse. We will be exiting
20237 immediately anyway. */
20239 }
20240 else
20246 && (qualifying_scope
20248 {
20251 }
20252 }
20257 {
20262 }
20268 {
20269 /* In the declaration of a member of a template class
20270 outside of the class itself, the SCOPE will sometimes
20271 be a TYPENAME_TYPE. For example, given:
20273 template <typename T>
20274 int S<T>::R::i = 3;
20276 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20277 this context, we must resolve S<T>::R to an ordinary
20278 type, rather than a typename type.
20280 The reason we normally avoid resolving TYPENAME_TYPEs
20281 is that a specialization of `S' might render
20282 `S<T>::R' not a type. However, if `S' is
20283 specialized, then this `i' will not be used, so there
20284 is no harm in resolving the types here. */
20285 tree type;
20287 /* Resolve the TYPENAME_TYPE. */
20290 /* If that failed, the declarator is invalid. */
20292 {
20295 "cannot define member of dependent typedef "
20297 else
20302 }
20304 }
20309 {
20310 tree class_type;
20315 else
20319 {
20323 {
20324 /* We do not attempt to print the declarator
20325 here because we do not have enough
20326 information about its original syntactic
20327 form. */
20331 }
20334 {
20338 "use %<%T::%D%> instead of %<%T::%D%> to "
20340 class_type,
20345 }
20347 }
20350 {
20357 for an unnamed type, even if the type
20358 got a name for linkage purposes. */
20360 /* Handle correctly (c++/19200):
20362 struct S {
20363 struct T{};
20364 friend void S(T);
20365 };
20367 and also:
20369 namespace N {
20370 void S();
20371 }
20373 struct S {
20374 friend void N::S();
20375 }; */
20378 class_type))
20387 }
20388 }
20390 unqualified_name,
20391 sfk);
20398 }
20400 handle_declarator:;
20403 {
20404 /* Any names that appear after the declarator-id for a
20405 member are looked up in the containing scope. */
20407 {
20408 /* But declarations with qualified-ids can't appear in a
20409 function. */
20413 }
20415 }
20419 /* Default args are only allowed on function
20420 declarations. */
20422 else
20426 }
20427 /* We're done. */
20428 else
20430 }
20432 /* For an abstract declarator, we might wind up with nothing at this
20433 point. That's an error; the declarator is not optional. */
20437 {
20438 /* Record overly parenthesized declarator so we can give a
20439 diagnostic about confusing decl/expr disambiguation. */
20441 {
20442 /* If the open and close parens are on different lines, this
20443 is probably a formatting thing, so ignore. */
20448 }
20451 }
20453 /* If we entered a scope, we must exit it now. */
20461 }
20463 /* Parse a ptr-operator.
20465 ptr-operator:
20466 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20467 * cv-qualifier-seq [opt]
20468 &
20469 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20470 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20472 GNU Extension:
20474 ptr-operator:
20475 & cv-qualifier-seq [opt]
20477 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20478 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20479 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20480 filled in with the TYPE containing the member. *CV_QUALS is
20481 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20482 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20483 Note that the tree codes returned by this function have nothing
20484 to do with the types of trees that will be eventually be created
20485 to represent the pointer or reference type being parsed. They are
20486 just constants with suggestive names. */
20487 static enum tree_code
20492 {
20497 /* Assume that it's not a pointer-to-member. */
20499 /* And that there are no cv-qualifiers. */
20502 /* Peek at the next token. */
20505 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20515 {
20516 /* Consume the `*', `&' or `&&'. */
20519 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20520 `&', if we are allowing GNU extensions. (The only qualifier
20521 that can legally appear after `&' is `restrict', but that is
20522 enforced during semantic analysis. */
20530 }
20531 else
20532 {
20533 /* Try the pointer-to-member case. */
20535 /* Look for the optional `::' operator. */
20538 /* Look for the nested-name specifier. */
20545 /* If we found it, and the next token is a `*', then we are
20546 indeed looking at a pointer-to-member operator. */
20549 {
20550 /* Indicate that the `*' operator was used. */
20558 else
20559 {
20560 /* The type of which the member is a member is given by the
20561 current SCOPE. */
20563 /* The next name will not be qualified. */
20567 /* Look for optional c++11 attributes. */
20571 /* Look for the optional cv-qualifier-seq. */
20573 }
20574 }
20575 /* If that didn't work we don't have a ptr-operator. */
20578 }
20581 }
20583 /* Parse an (optional) cv-qualifier-seq.
20585 cv-qualifier-seq:
20586 cv-qualifier cv-qualifier-seq [opt]
20588 cv-qualifier:
20589 const
20590 volatile
20592 GNU Extension:
20594 cv-qualifier:
20595 __restrict__
20597 Returns a bitmask representing the cv-qualifiers. */
20599 static cp_cv_quals
20601 {
20605 {
20607 cp_cv_quals cv_qualifier;
20609 /* Peek at the next token. */
20611 /* See if it's a cv-qualifier. */
20613 {
20629 }
20635 {
20640 }
20641 else
20642 {
20645 }
20646 }
20649 }
20651 /* Parse an (optional) ref-qualifier
20653 ref-qualifier:
20654 &
20655 &&
20657 Returns cp_ref_qualifier representing ref-qualifier. */
20659 static cp_ref_qualifier
20661 {
20664 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20669 {
20674 {
20686 }
20691 {
20694 }
20695 else
20696 {
20699 }
20700 }
20703 }
20705 /* Parse an optional tx-qualifier.
20707 tx-qualifier:
20708 transaction_safe
20709 transaction_safe_dynamic */
20711 static tree
20713 {
20716 {
20721 {
20725 {
20728 {
20731 }
20732 else
20734 }
20735 }
20736 }
20738 }
20740 /* Parse an (optional) virt-specifier-seq.
20742 virt-specifier-seq:
20743 virt-specifier virt-specifier-seq [opt]
20745 virt-specifier:
20746 override
20747 final
20749 Returns a bitmask representing the virt-specifiers. */
20751 static cp_virt_specifiers
20753 {
20757 {
20759 cp_virt_specifiers virt_specifier;
20761 /* Peek at the next token. */
20763 /* See if it's a virt-specifier-qualifier. */
20767 {
20770 }
20772 {
20775 }
20777 {
20779 }
20780 else
20784 {
20789 }
20790 else
20791 {
20794 }
20795 }
20797 }
20799 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20800 is in scope even though it isn't real. */
20802 void
20804 {
20805 tree this_parm;
20808 {
20809 /* We don't clear this between NSDMIs. Is it already what we want? */
20816 }
20819 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20821 current_class_ref
20824 }
20826 /* Return true iff our current scope is a non-static data member
20827 initializer. */
20829 bool
20831 {
20832 /* We recognize NSDMI context by the context-less 'this' pointer set up
20833 by the function above. */
20839 }
20841 /* Parse a late-specified return type, if any. This is not a separate
20842 non-terminal, but part of a function declarator, which looks like
20844 -> trailing-type-specifier-seq abstract-declarator(opt)
20846 Returns the type indicated by the type-id.
20848 In addition to this, parse any queued up #pragma omp declare simd
20849 clauses, and #pragma acc routine clauses.
20851 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20852 function. */
20854 static tree
20857 {
20861 && declarator
20865 && declarator
20868 /* Peek at the next token. */
20870 /* A late-specified return type is indicated by an initial '->'. */
20881 {
20882 /* DR 1207: 'this' is in scope in the trailing return type. */
20884 }
20887 {
20888 /* Consume the ->. */
20892 }
20894 /* Function declarations may be followed by a trailing
20895 requires-clause. */
20899 declarator->attributes
20903 declarator->attributes
20908 {
20911 }
20914 }
20916 /* Parse a declarator-id.
20918 declarator-id:
20919 id-expression
20920 :: [opt] nested-name-specifier [opt] type-name
20922 In the `id-expression' case, the value returned is as for
20923 cp_parser_id_expression if the id-expression was an unqualified-id.
20924 If the id-expression was a qualified-id, then a SCOPE_REF is
20925 returned. The first operand is the scope (either a NAMESPACE_DECL
20926 or TREE_TYPE), but the second is still just a representation of an
20927 unqualified-id. */
20929 static tree
20931 {
20932 tree id;
20933 /* The expression must be an id-expression. Assume that qualified
20934 names are the names of types so that:
20936 template <class T>
20937 int S<T>::R::i = 3;
20939 will work; we must treat `S<T>::R' as the name of a type.
20940 Similarly, assume that qualified names are templates, where
20941 required, so that:
20943 template <class T>
20944 int S<T>::R<T>::i = 3;
20946 will work, too. */
20952 optional_p);
20956 }
20958 /* Parse a type-id.
20960 type-id:
20961 type-specifier-seq abstract-declarator [opt]
20963 Returns the TYPE specified. */
20965 static tree
20968 {
20969 cp_decl_specifier_seq type_specifier_seq;
20972 /* Parse the type-specifier-seq. */
20974 is_trailing_return,
20979 /* A bare template name as a template argument is a template template
20980 argument, not a placeholder, so fail parsing it as a type argument. */
20981 {
20985 }
20989 /* There might or might not be an abstract declarator. */
20991 /* Look for the declarator. */
20992 abstract_declarator
20997 /* Check to see if there really was a declarator. */
21002 /* The concepts TS allows 'auto' as a type-id. */
21004 /* None of the valid uses of 'auto' in C++14 involve the type-id
21005 nonterminal, but it is valid in a trailing-return-type. */
21008 {
21009 /* A type-id with type 'auto' is only ok if the abstract declarator
21010 is a function declarator with a late-specified return type.
21012 A type-id with 'auto' is also valid in a trailing-return-type
21013 in a compound-requirement. */
21020 else
21021 {
21024 {
21026 auto_node);
21028 tmpl);
21029 }
21030 else
21033 }
21034 }
21037 is_template_arg);
21038 }
21040 static tree
21042 {
21044 }
21046 static tree
21048 {
21049 tree r;
21051 parser->type_definition_forbidden_message
21056 {
21059 }
21061 }
21063 static tree
21065 {
21067 }
21069 /* Parse a type-specifier-seq.
21071 type-specifier-seq:
21072 type-specifier type-specifier-seq [opt]
21074 GNU extension:
21076 type-specifier-seq:
21077 attributes type-specifier-seq [opt]
21079 If IS_DECLARATION is true, we are at the start of a "condition" or
21080 exception-declaration, so we might be followed by a declarator-id.
21082 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21083 i.e. we've just seen "->".
21085 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21087 static void
21092 {
21097 /* Clear the TYPE_SPECIFIER_SEQ. */
21100 /* In the context of a trailing return type, enum E { } is an
21101 elaborated-type-specifier followed by a function-body, not an
21102 enum-specifier. */
21106 /* Parse the type-specifiers and attributes. */
21108 {
21109 tree type_specifier;
21112 /* Check for attributes first. */
21114 {
21115 type_specifier_seq->attributes
21119 }
21121 /* record the token of the beginning of the type specifier seq,
21122 for error reporting purposes*/
21126 /* Look for the type-specifier. */
21128 flags,
21129 type_specifier_seq,
21131 NULL,
21134 {
21135 /* If the first type-specifier could not be found, this is not a
21136 type-specifier-seq at all. */
21138 {
21139 /* Set in_declarator_p to avoid skipping to the semicolon. */
21151 }
21152 /* If subsequent type-specifiers could not be found, the
21153 type-specifier-seq is complete. */
21155 }
21158 /* The standard says that a condition can be:
21160 type-specifier-seq declarator = assignment-expression
21162 However, given:
21164 struct S {};
21165 if (int S = ...)
21167 we should treat the "S" as a declarator, not as a
21168 type-specifier. The standard doesn't say that explicitly for
21169 type-specifier-seq, but it does say that for
21170 decl-specifier-seq in an ordinary declaration. Perhaps it
21171 would be clearer just to allow a decl-specifier-seq here, and
21172 then add a semantic restriction that if any decl-specifiers
21173 that are not type-specifiers appear, the program is invalid. */
21176 }
21177 }
21179 /* Return whether the function currently being declared has an associated
21180 template parameter list. */
21182 static bool
21184 {
21197 }
21199 /* Parse a parameter-declaration-clause.
21201 parameter-declaration-clause:
21202 parameter-declaration-list [opt] ... [opt]
21203 parameter-declaration-list , ...
21205 Returns a representation for the parameter declarations. A return
21206 value of NULL indicates a parameter-declaration-clause consisting
21207 only of an ellipsis. */
21209 static tree
21211 {
21212 tree parameters;
21221 && !processing_template_parmlist
21222 && !processing_explicit_instantiation
21223 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21224 actual function or a random abstract declarator. */
21230 /* Peek at the next token. */
21232 /* Check for trivial parameter-declaration-clauses. */
21234 {
21235 /* Consume the `...' token. */
21238 }
21240 /* There are no parameters. */
21241 {
21242 #ifndef NO_IMPLICIT_EXTERN_C
21247 else
21248 #endif
21250 }
21251 /* Check for `(void)', too, which is a special case. */
21255 {
21256 /* Consume the `void' token. */
21258 /* There are no parameters. */
21260 }
21262 /* Parse the parameter-declaration-list. */
21264 /* If a parse error occurred while parsing the
21265 parameter-declaration-list, then the entire
21266 parameter-declaration-clause is erroneous. */
21270 /* Peek at the next token. */
21272 /* If it's a `,', the clause should terminate with an ellipsis. */
21274 {
21275 /* Consume the `,'. */
21277 /* Expect an ellipsis. */
21278 ellipsis_p
21280 }
21281 /* It might also be `...' if the optional trailing `,' was
21282 omitted. */
21284 {
21285 /* Consume the `...' token. */
21287 /* And remember that we saw it. */
21289 }
21290 else
21293 /* Finish the parameter list. */
21298 }
21300 /* Parse a parameter-declaration-list.
21302 parameter-declaration-list:
21303 parameter-declaration
21304 parameter-declaration-list , parameter-declaration
21306 Returns a representation of the parameter-declaration-list, as for
21307 cp_parser_parameter_declaration_clause. However, the
21308 `void_list_node' is never appended to the list. Upon return,
21309 *IS_ERROR will be true iff an error occurred. */
21311 static tree
21313 {
21319 /* Assume all will go well. */
21321 /* The special considerations that apply to a function within an
21322 unbraced linkage specifications do not apply to the parameters
21323 to the function. */
21324 saved_in_unbraced_linkage_specification_p
21328 /* Look for more parameters. */
21330 {
21335 /* Parse the parameter. */
21336 parameter
21341 /* We don't know yet if the enclosing context is deprecated, so wait
21342 and warn in grokparms if appropriate. */
21346 {
21349 PARM,
21354 }
21358 /* If a parse error occurred parsing the parameter declaration,
21359 then the entire parameter-declaration-list is erroneous. */
21361 {
21365 }
21375 {
21379 }
21381 /* Add the new parameter to the list. */
21385 /* Peek at the next token. */
21388 /* These are for Objective-C++ */
21391 /* The parameter-declaration-list is complete. */
21394 {
21397 /* Peek at the next token. */
21399 /* If it's an ellipsis, then the list is complete. */
21402 /* Otherwise, there must be more parameters. Consume the
21403 `,'. */
21405 /* When parsing something like:
21407 int i(float f, double d)
21409 we can tell after seeing the declaration for "f" that we
21410 are not looking at an initialization of a variable "i",
21411 but rather at the declaration of a function "i".
21413 Due to the fact that the parsing of template arguments
21414 (as specified to a template-id) requires backtracking we
21415 cannot use this technique when inside a template argument
21416 list. */
21420 /* However, a parameter-declaration of the form
21421 "float(f)" (which is a valid declaration of a
21422 parameter "f") can also be interpreted as an
21423 expression (the conversion of "f" to "float"). */
21426 }
21427 else
21428 {
21436 }
21437 }
21439 parser->in_unbraced_linkage_specification_p
21442 /* Reset implicit_template_scope if we are about to leave the function
21443 parameter list that introduced it. Note that for out-of-line member
21444 definitions, there will be one or more class scopes before we get to
21445 the template parameter scope. */
21449 {
21453 {
21456 }
21457 }
21460 }
21462 /* Parse a parameter declaration.
21464 parameter-declaration:
21465 decl-specifier-seq ... [opt] declarator
21466 decl-specifier-seq declarator = assignment-expression
21467 decl-specifier-seq ... [opt] abstract-declarator [opt]
21468 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21470 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21471 declares a template parameter. (In that case, a non-nested `>'
21472 token encountered during the parsing of the assignment-expression
21473 is not interpreted as a greater-than operator.)
21475 Returns a representation of the parameter, or NULL if an error
21476 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21477 true iff the declarator is of the form "(p)". */
21483 {
21485 cp_decl_specifier_seq decl_specifiers;
21487 tree default_argument;
21492 /* In a template parameter, `>' is not an operator.
21494 [temp.param]
21496 When parsing a default template-argument for a non-type
21497 template-parameter, the first non-nested `>' is taken as the end
21498 of the template parameter-list rather than a greater-than
21499 operator. */
21501 /* Type definitions may not appear in parameter types. */
21503 parser->type_definition_forbidden_message
21510 /* Parse the declaration-specifiers. */
21513 CP_PARSER_FLAGS_NONE,
21517 /* Complain about missing 'typename' or other invalid type names. */
21522 /* If an error occurred, there's no reason to attempt to parse the
21523 rest of the declaration. */
21525 {
21528 }
21530 /* Peek at the next token. */
21533 /* If the next token is a `)', `,', `=', `>', or `...', then there
21534 is no declarator. However, when variadic templates are enabled,
21535 there may be a declarator following `...'. */
21540 {
21544 }
21545 /* Otherwise, there should be a declarator. */
21546 else
21547 {
21551 /* After seeing a decl-specifier-seq, if the next token is not a
21552 "(", there is no possibility that the code is a valid
21553 expression. Therefore, if parsing tentatively, we commit at
21554 this point. */
21556 /* In an expression context, having seen:
21558 (int((char ...
21560 we cannot be sure whether we are looking at a
21561 function-type (taking a "char" as a parameter) or a cast
21562 of some object of type "char" to "int". */
21568 /* Parse the declarator. */
21571 CP_PARSER_DECLARATOR_EITHER,
21573 parenthesized_p,
21577 /* After the declarator, allow more attributes. */
21578 decl_specifiers.attributes
21582 /* If the declarator is a template parameter pack, remember that and
21583 clear the flag in the declarator itself so we don't get errors
21584 from grokdeclarator. */
21586 {
21589 }
21590 }
21592 /* If the next token is an ellipsis, and we have not seen a declarator
21593 name, and if either the type of the declarator contains parameter
21594 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21595 for, eg, abbreviated integral type names), then we actually have a
21596 parameter pack expansion expression. Otherwise, leave the ellipsis
21597 for a C-style variadic function. */
21600 /* If a function parameter pack was specified and an implicit template
21601 parameter was introduced during cp_parser_parameter_declaration,
21602 change any implicit parameters introduced into packs. */
21606 {
21614 }
21617 {
21628 {
21629 /* Consume the `...'. */
21633 /* Build a pack expansion type */
21638 else
21640 }
21641 }
21643 /* The restriction on defining new types applies only to the type
21644 of the parameter, not to the default argument. */
21647 /* If the next token is `=', then process a default argument. */
21649 {
21652 /* If we are defining a class, then the tokens that make up the
21653 default argument must be saved and processed later. */
21659 // A constrained-type-specifier may declare a type template-parameter.
21661 default_argument
21664 // A constrained-type-specifier may declare a template-template-parameter.
21666 default_argument
21669 /* Outside of a class definition, we can just parse the
21670 assignment-expression. */
21671 else
21672 default_argument
21676 {
21678 "default arguments are only "
21680 }
21682 || template_parameter_pack_p
21685 {
21686 /* Find the name of the parameter pack. */
21693 template_parm_p
21699 else
21701 template_parm_p
21708 }
21709 }
21710 else
21713 /* Generate a location for the parameter, ranging from the start of the
21714 initial token to the end of the final token (using input_location for
21715 the latter, set up by cp_lexer_set_source_position_from_token when
21716 consuming tokens).
21718 If we have a identifier, then use it for the caret location, e.g.
21720 extern int callee (int one, int (*two)(int, int), float three);
21721 ~~~~~~^~~~~~~~~~~~~~
21723 otherwise, reuse the start location for the caret location e.g.:
21725 extern int callee (int one, int (*)(int, int), float three);
21726 ^~~~~~~~~~~~~~~~~
21728 */
21734 input_location);
21737 declarator,
21738 default_argument,
21739 param_loc,
21740 template_parameter_pack_p);
21741 }
21743 /* Parse a default argument and return it.
21745 TEMPLATE_PARM_P is true if this is a default argument for a
21746 non-type template parameter. */
21747 static tree
21749 {
21755 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21756 set correctly. */
21759 /* Local variable names (and the `this' keyword) may not
21760 appear in a default argument. */
21763 /* Parse the assignment-expression. */
21768 /* The "this" pointer is not valid in a default argument. */
21770 {
21775 }
21776 default_argument
21778 /* Restore the "this" pointer. */
21780 {
21783 }
21792 }
21794 /* Parse a function-body.
21796 function-body:
21797 compound_statement */
21799 static void
21801 {
21805 }
21807 /* Parse a ctor-initializer-opt followed by a function-body. Return
21808 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21809 is true we are parsing a function-try-block. */
21811 static void
21814 {
21821 /* Begin the function body. */
21823 /* Parse the optional ctor-initializer. */
21826 /* If we're parsing a constexpr constructor definition, we need
21827 to check that the constructor body is indeed empty. However,
21828 before we get to cp_parser_function_body lot of junk has been
21829 generated, so we can't just check that we have an empty block.
21830 Rather we take a snapshot of the outermost block, and check whether
21831 cp_parser_function_body changed its state. */
21833 {
21837 }
21838 /* Parse the function-body. */
21842 /* Finish the function body. */
21844 }
21846 /* Parse an initializer.
21848 initializer:
21849 = initializer-clause
21850 ( expression-list )
21852 Returns an expression representing the initializer. If no
21853 initializer is present, NULL_TREE is returned.
21855 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21856 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21857 set to TRUE if there is no initializer present. If there is an
21858 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21859 is set to true; otherwise it is set to false. */
21861 static tree
21864 {
21866 tree init;
21868 /* Peek at the next token. */
21871 /* Let our caller know whether or not this initializer was
21872 parenthesized. */
21874 /* Assume that the initializer is constant. */
21878 {
21879 /* Consume the `='. */
21881 /* Parse the initializer-clause. */
21883 }
21885 {
21890 non_constant_p);
21895 }
21897 {
21902 }
21903 else
21904 {
21905 /* Anything else is an error. */
21908 }
21914 }
21916 /* Parse an initializer-clause.
21918 initializer-clause:
21919 assignment-expression
21920 braced-init-list
21922 Returns an expression representing the initializer.
21924 If the `assignment-expression' production is used the value
21925 returned is simply a representation for the expression.
21927 Otherwise, calls cp_parser_braced_list. */
21929 static cp_expr
21931 {
21932 cp_expr initializer;
21934 /* Assume the expression is constant. */
21937 /* If it is not a `{', then we are looking at an
21938 assignment-expression. */
21940 {
21941 initializer
21944 non_constant_p);
21945 }
21946 else
21950 }
21952 /* Parse a brace-enclosed initializer list.
21954 braced-init-list:
21955 { initializer-list , [opt] }
21956 { designated-initializer-list , [opt] }
21957 { }
21959 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21960 the elements of the initializer-list (or NULL, if the last
21961 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21962 NULL_TREE. There is no way to detect whether or not the optional
21963 trailing `,' was provided. NON_CONSTANT_P is as for
21964 cp_parser_initializer. */
21966 static cp_expr
21968 {
21969 tree initializer;
21972 /* Consume the `{' token. */
21973 matching_braces braces;
21975 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21977 /* If it's not a `}', then there is a non-trivial initializer. */
21979 {
21980 /* Parse the initializer list. */
21983 /* A trailing `,' token is allowed. */
21986 }
21987 else
21989 /* Now, there should be a trailing `}'. */
21995 /* Build a location of the form:
21996 { ... }
21997 ^~~~~~~
21998 with caret==start at the open brace, finish at the close brace. */
22002 }
22004 /* Consume tokens up to, and including, the next non-nested closing `]'.
22005 Returns true iff we found a closing `]'. */
22007 static bool
22009 {
22013 {
22017 {
22020 /* If we've run out of tokens, then there is no closing `]'. */
22029 {
22032 }
22037 }
22039 /* Consume the token. */
22041 }
22042 }
22044 /* Return true if we are looking at an array-designator, false otherwise. */
22046 static bool
22048 {
22049 /* Consume the `['. */
22054 /* Skip tokens until the next token is a closing square bracket.
22055 If we find the closing `]', and the next token is a `=', then
22056 we are looking at an array designator. */
22057 bool array_designator_p
22061 /* Roll back the tokens we skipped. */
22065 }
22067 /* Parse an initializer-list.
22069 initializer-list:
22070 initializer-clause ... [opt]
22071 initializer-list , initializer-clause ... [opt]
22073 C++2A Extension:
22075 designated-initializer-list:
22076 designated-initializer-clause
22077 designated-initializer-list , designated-initializer-clause
22079 designated-initializer-clause:
22080 designator brace-or-equal-initializer
22082 designator:
22083 . identifier
22085 GNU Extension:
22087 initializer-list:
22088 designation initializer-clause ...[opt]
22089 initializer-list , designation initializer-clause ...[opt]
22091 designation:
22092 . identifier =
22093 identifier :
22094 [ constant-expression ] =
22096 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22097 for the initializer. If the INDEX of the elt is non-NULL, it is the
22098 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22099 as for cp_parser_initializer. */
22103 {
22108 /* Assume all of the expressions are constant. */
22111 /* Parse the rest of the list. */
22113 {
22115 tree designator;
22116 tree initializer;
22120 /* Handle the C++2A syntax, '. id ='. */
22128 {
22131 "C++ designated initializers only available with "
22133 /* Consume the `.'. */
22135 /* Consume the identifier. */
22138 /* Consume the `='. */
22140 }
22141 /* Also, if the next token is an identifier and the following one is a
22142 colon, we are looking at the GNU designated-initializer
22143 syntax. */
22148 {
22149 /* Warn the user that they are using an extension. */
22152 /* Consume the identifier. */
22154 /* Consume the `:'. */
22156 }
22157 /* Also handle C99 array designators, '[ const ] ='. */
22161 {
22162 /* In C++11, [ could start a lambda-introducer. */
22168 {
22171 }
22172 else
22173 {
22178 }
22183 && (!require_potential_rvalue_constant_expression
22187 /* Warn the user that they are using an extension. */
22190 }
22191 else
22195 {
22198 }
22202 {
22206 }
22210 /* Parse the initializer. */
22213 /* If any clause is non-constant, so is the entire initializer. */
22217 /* If we have an ellipsis, this is an initializer pack
22218 expansion. */
22220 {
22223 /* Consume the `...'. */
22230 /* Turn the initializer into an initializer expansion. */
22232 }
22234 /* Add it to the vector. */
22237 /* If the next token is not a comma, we have reached the end of
22238 the list. */
22242 /* Peek at the next token. */
22244 /* If the next token is a `}', then we're still done. An
22245 initializer-clause can have a trailing `,' after the
22246 initializer-list and before the closing `}'. */
22250 /* Consume the `,' token. */
22252 }
22254 /* The same identifier shall not appear in multiple designators
22255 of a designated-initializer-list. */
22257 {
22262 {
22264 {
22266 "%<.%s%> designator used multiple times in "
22270 }
22271 else
22273 }
22277 }
22280 }
22282 /* Classes [gram.class] */
22284 /* Parse a class-name.
22286 class-name:
22287 identifier
22288 template-id
22290 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22291 to indicate that names looked up in dependent types should be
22292 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22293 keyword has been used to indicate that the name that appears next
22294 is a template. TAG_TYPE indicates the explicit tag given before
22295 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22296 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22297 is the class being defined in a class-head. If ENUM_OK is TRUE,
22298 enum-names are also accepted.
22300 Returns the TYPE_DECL representing the class. */
22302 static tree
22311 {
22312 tree decl;
22313 tree scope;
22318 /* All class-names start with an identifier. */
22321 {
22324 }
22326 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22327 to a template-id, so we save it here. */
22332 /* Any name names a type if we're following the `typename' keyword
22333 in a qualified name where the enclosing scope is type-dependent. */
22336 /* Handle the common case (an identifier, but not a template-id)
22337 efficiently. */
22340 {
22344 /* Look for the identifier. */
22348 /* If the next token isn't an identifier, we are certainly not
22349 looking at a class-name. */
22352 /* If we know this is a type-name, there's no need to look it
22353 up. */
22356 else
22357 {
22358 tree ambiguous_decls;
22359 /* If we already know that this lookup is ambiguous, then
22360 we've already issued an error message; there's no reason
22361 to check again. */
22363 {
22366 }
22367 /* If the next token is a `::', then the name must be a type
22368 name.
22370 [basic.lookup.qual]
22372 During the lookup for a name preceding the :: scope
22373 resolution operator, object, function, and enumerator
22374 names are ignored. */
22377 /* Look up the name. */
22379 tag_type,
22382 check_dependency_p,
22386 {
22390 }
22391 }
22392 }
22393 else
22394 {
22395 /* Try a template-id. */
22397 check_dependency_p,
22398 tag_type,
22399 is_declaration);
22402 }
22406 /* If this is a typename, create a TYPENAME_TYPE. */
22408 {
22413 }
22417 /* Check to see that it is really the name of a class. */
22421 /* Situations like this:
22423 template <typename T> struct A {
22424 typename T::template X<int>::I i;
22425 };
22427 are problematic. Is `T::template X<int>' a class-name? The
22428 standard does not seem to be definitive, but there is no other
22429 valid interpretation of the following `::'. Therefore, those
22430 names are considered class-names. */
22431 {
22435 }
22440 /* In Objective-C 2.0, a classname followed by '.' starts a
22441 dot-syntax expression, and it's not a type-name. */
22453 }
22455 /* Parse a class-specifier.
22457 class-specifier:
22458 class-head { member-specification [opt] }
22460 Returns the TREE_TYPE representing the class. */
22462 static tree
22464 {
22465 tree type;
22479 /* Parse the class-head. */
22482 /* If the class-head was a semantic disaster, skip the entire body
22483 of the class. */
22485 {
22489 }
22491 /* Look for the `{'. */
22492 matching_braces braces;
22494 {
22497 }
22502 /* Issue an error message if type-definitions are forbidden here. */
22504 /* Remember that we are defining one more class. */
22506 /* Inside the class, surrounding template-parameter-lists do not
22507 apply. */
22508 saved_num_template_parameter_lists
22511 /* We are not in a function body. */
22514 /* Or in a loop. */
22517 /* Or in a switch. */
22520 /* We are not immediately inside an extern "lang" block. */
22521 saved_in_unbraced_linkage_specification_p
22525 // Associate constraints with the type.
22529 /* Start the class. */
22531 {
22534 }
22538 /* If the type is erroneous, skip the entire body of the class. */
22540 else
22541 /* Parse the member-specification. */
22544 /* Look for the trailing `}'. */
22546 /* Look for trailing attributes to apply to this class. */
22554 /* We've finished a type definition. Check for the common syntax
22555 error of forgetting a semicolon after the definition. We need to
22556 be careful, as we can't just check for not-a-semicolon and be done
22557 with it; the user might have typed:
22559 class X { } c = ...;
22560 class X { } *p = ...;
22562 and so forth. Instead, enumerate all the possible tokens that
22563 might follow this production; if we don't see one of them, then
22564 complain and silently insert the semicolon. */
22565 {
22570 /* Don't try to parse c++11 attributes here. As per the
22571 grammar, that should be a task for
22572 cp_parser_decl_specifier_seq. */
22576 {
22587 /* While it's legal for type qualifiers and storage class
22588 specifiers to follow type definitions in the grammar, only
22589 compiler testsuites contain code like that. Assume that if
22590 we see such code, then what we're really seeing is a case
22591 like:
22593 class X { }
22594 const <type> var = ...;
22596 or
22598 class Y { }
22599 static <type> func (...) ...
22601 i.e. the qualifier or specifier applies to the next
22602 declaration. To do so, however, we need to look ahead one
22603 more token to see if *that* token is a type specifier.
22605 This code could be improved to handle:
22607 class Z { }
22608 static const <type> var = ...; */
22611 {
22614 /* Handling user-defined types here would be nice, but very
22615 tricky. */
22616 want_semicolon
22619 }
22623 }
22625 /* If we don't have a type, then something is very wrong and we
22626 shouldn't try to do anything clever. Likewise for not seeing the
22627 closing brace. */
22629 {
22630 /* Locate the closing brace. */
22631 cp_token_position prev
22636 /* We want to suggest insertion of a ';' immediately *after* the
22637 closing brace, so, if we can, offset the location by 1 column. */
22644 /* If we successfully offset the location, suggest the fix-it. */
22657 else
22660 /* Unget one token and smash it to look as though we encountered
22661 a semicolon in the input stream. */
22666 }
22667 }
22669 /* If this class is not itself within the scope of another class,
22670 then we need to parse the bodies of all of the queued function
22671 definitions. Note that the queued functions defined in a class
22672 are not always processed immediately following the
22673 class-specifier for that class. Consider:
22675 struct A {
22676 struct B { void f() { sizeof (A); } };
22677 };
22679 If `f' were processed before the processing of `A' were
22680 completed, there would be no way to compute the size of `A'.
22681 Note that the nesting we are interested in here is lexical --
22682 not the semantic nesting given by TYPE_CONTEXT. In particular,
22683 for:
22685 struct A { struct B; };
22686 struct A::B { void f() { } };
22688 there is no need to delay the parsing of `A::B::f'. */
22690 {
22691 tree decl;
22699 {
22700 /* Skip default arguments, NSDMIs, etc, in order to improve
22701 error recovery (c++/71169, c++/71832). */
22706 }
22708 /* In a first pass, parse default arguments to the functions.
22709 Then, in a second pass, parse the bodies of the functions.
22710 This two-phased approach handles cases like:
22712 struct S {
22713 void f() { g(); }
22714 void g(int i = 3);
22715 };
22717 */
22719 {
22721 /* If there are default arguments that have not yet been processed,
22722 take care of them now. */
22724 {
22729 }
22730 /* Make sure that any template parameters are in scope. */
22732 /* Parse the default argument expressions. */
22734 /* Remove any template parameters from the symbol table. */
22736 }
22738 /* Now parse any NSDMIs. */
22742 {
22744 {
22749 }
22752 }
22759 /* Now do some post-NSDMI bookkeeping. */
22765 /* Now parse the body of the functions. */
22767 {
22768 /* OpenMP UDRs need to be parsed before all other functions. */
22775 }
22776 else
22780 }
22781 else
22784 /* Put back any saved access checks. */
22787 /* Restore saved state. */
22791 parser->num_template_parameter_lists
22793 parser->in_unbraced_linkage_specification_p
22797 }
22799 static tree
22801 {
22802 tree ret;
22807 }
22809 /* Parse a class-head.
22811 class-head:
22812 class-key identifier [opt] base-clause [opt]
22813 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22814 class-key nested-name-specifier [opt] template-id
22815 base-clause [opt]
22817 class-virt-specifier:
22818 final
22820 GNU Extensions:
22821 class-key attributes identifier [opt] base-clause [opt]
22822 class-key attributes nested-name-specifier identifier base-clause [opt]
22823 class-key attributes nested-name-specifier [opt] template-id
22824 base-clause [opt]
22826 Upon return BASES is initialized to the list of base classes (or
22827 NULL, if there are none) in the same form returned by
22828 cp_parser_base_clause.
22830 Returns the TYPE of the indicated class. Sets
22831 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22832 involving a nested-name-specifier was used, and FALSE otherwise.
22834 Returns error_mark_node if this is not a class-head.
22836 Returns NULL_TREE if the class-head is syntactically valid, but
22837 semantically invalid in a way that means we should skip the entire
22838 body of the class. */
22840 static tree
22843 {
22844 tree nested_name_specifier;
22848 tree attributes;
22849 tree bases;
22859 /* Assume no nested-name-specifier will be present. */
22861 /* Assume no template parameter lists will be used in defining the
22862 type. */
22866 /* Look for the class-key. */
22873 /* Parse the attributes. */
22876 /* If the next token is `::', that is invalid -- but sometimes
22877 people do try to write:
22879 struct ::S {};
22881 Handle this gracefully by accepting the extra qualifier, and then
22882 issuing an error about it later if this really is a
22883 class-head. If it turns out just to be an elaborated type
22884 specifier, remain silent. */
22890 /* Determine the name of the class. Begin by looking for an
22891 optional nested-name-specifier. */
22893 nested_name_specifier
22899 /* If there was a nested-name-specifier, then there *must* be an
22900 identifier. */
22905 {
22907 /* Although the grammar says `identifier', it really means
22908 `class-name' or `template-name'. You are only allowed to
22909 define a class that has already been declared with this
22910 syntax.
22912 The proposed resolution for Core Issue 180 says that wherever
22913 you see `class T::X' you should treat `X' as a type-name.
22915 It is OK to define an inaccessible class; for example:
22917 class A { class B; };
22918 class A::B {};
22920 We do not know if we will see a class-name, or a
22921 template-name. We look for a class-name first, in case the
22922 class-name is a template-id; if we looked for the
22923 template-name first we would stop after the template-name. */
22930 class_type,
22934 /* If that didn't work, ignore the nested-name-specifier. */
22936 {
22942 }
22943 /* If we could not find a corresponding TYPE, treat this
22944 declaration like an unqualified declaration. */
22947 /* Otherwise, count the number of templates used in TYPE and its
22948 containing scopes. */
22949 else
22950 {
22951 tree scope;
22963 }
22964 }
22965 /* Otherwise, the identifier is optional. */
22966 else
22967 {
22968 /* We don't know whether what comes next is a template-id,
22969 an identifier, or nothing at all. */
22971 /* Check for a template-id. */
22976 class_key,
22978 /* If that didn't work, it could still be an identifier. */
22980 {
22982 {
22985 }
22986 else
22988 }
22989 else
22990 {
22993 }
22994 }
22999 {
23001 class_key,
23003 }
23006 /* If it's not a `:' or a `{' then we can't really be looking at a
23007 class-head, since a class-head only appears as part of a
23008 class-specifier. We have to detect this situation before calling
23009 xref_tag, since that has irreversible side-effects. */
23011 {
23015 }
23017 /* At this point, we're going ahead with the class-specifier, even
23018 if some other problem occurs. */
23021 {
23026 }
23027 /* Issue the error about the overly-qualified name now. */
23029 {
23034 }
23036 {
23041 }
23043 {
23044 tree scope;
23047 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23048 keyword template shall not appear at the top level. */
23052 /* Reject typedef-names in class heads. */
23054 {
23057 type);
23060 }
23062 /* Figure out in what scope the declaration is being placed. */
23064 /* If that scope does not contain the scope in which the
23065 class was originally declared, the program is invalid. */
23067 {
23070 "declaration of %qD in namespace %qD which does not "
23073 else
23079 }
23080 /* [dcl.meaning]
23082 A declarator-id shall not be qualified except for the
23083 definition of a ... nested class outside of its class
23084 ... [or] the definition or explicit instantiation of a
23085 class member of a namespace outside of its namespace. */
23087 {
23092 }
23093 }
23094 /* An explicit-specialization must be preceded by "template <>". If
23095 it is not, try to recover gracefully. */
23098 && !processing_template_parmlist
23100 {
23101 /* Build a location of this form:
23102 struct typename <ARGS>
23103 ^~~~~~~~~~~~~~~~~~~~~~
23104 with caret==start at the start token, and
23105 finishing at the end of the type. */
23106 location_t reported_loc
23108 class_head_start_location,
23114 "an explicit specialization must be preceded by"
23117 /* Take the same action that would have been taken by
23118 cp_parser_explicit_specialization. */
23121 }
23122 /* There must be no "return" statements between this point and the
23123 end of this function; set "type "to the correct return value and
23124 use "goto done;" to return. */
23125 /* Make sure that the right number of template parameters were
23126 present. */
23128 template_id_p,
23131 {
23132 /* If something went wrong, there is no point in even trying to
23133 process the class-definition. */
23136 }
23138 /* Look up the type. */
23140 {
23144 {
23148 }
23149 else
23150 {
23154 /* Check the scope while we still know whether or not we had a
23155 nested-name-specifier. */
23158 }
23161 }
23163 {
23164 tree class_type;
23166 /* Given:
23168 template <typename T> struct S { struct T };
23169 template <typename T> struct S<T>::T { };
23171 we will get a TYPENAME_TYPE when processing the definition of
23172 `S::T'. We need to resolve it to the actual type before we
23173 try to define it. */
23175 {
23180 else
23181 {
23184 }
23185 }
23189 {
23192 }
23195 /* Enter the scope indicated by the nested-name-specifier. */
23197 /* Get the canonical version of this type. */
23199 /* Call push_template_decl if it seems like we should be defining a
23200 template either from the template headers or the type we're
23201 defining, so that we diagnose both extra and missing headers. */
23205 {
23208 {
23211 }
23212 }
23216 }
23218 {
23219 /* If the class was unnamed, create a dummy name. */
23223 ? ts_within_enclosing_non_class
23227 }
23229 /* Indicate whether this class was declared as a `class' or as a
23230 `struct'. */
23235 /* If this type was already complete, and we see another definition,
23236 that's an error. */
23238 {
23240 type);
23242 type);
23245 }
23250 {
23251 /* Apply attributes now, before any use of the class as a template
23252 argument in its base list. */
23255 }
23257 /* We will have entered the scope containing the class; the names of
23258 base classes should be looked up in that context. For example:
23260 struct A { struct B {}; struct C; };
23261 struct A::C : B {};
23263 is valid. */
23265 /* Get the list of base-classes, if there is one. */
23267 {
23268 /* PR59482: enter the class scope so that base-specifiers are looked
23269 up correctly. */
23273 /* PR59482: get out of the previously pushed class scope so that the
23274 subsequent pops pop the right thing. */
23277 }
23278 else
23281 /* If we're really defining a class, process the base classes.
23282 If they're invalid, fail. */
23286 done:
23287 /* Leave the scope given by the nested-name-specifier. We will
23288 enter the class scope itself while processing the members. */
23293 {
23296 }
23302 out:
23305 }
23307 /* Parse a class-key.
23309 class-key:
23310 class
23311 struct
23312 union
23314 Returns the kind of class-key specified, or none_type to indicate
23315 error. */
23317 static enum tag_types
23319 {
23323 /* Look for the class-key. */
23328 /* Check to see if the TOKEN is a class-key. */
23333 }
23335 /* Parse a type-parameter-key.
23337 type-parameter-key:
23338 class
23339 typename
23340 */
23342 static void
23344 {
23345 /* Look for the type-parameter-key. */
23349 {
23352 /* typename is not allowed in a template template parameter
23353 by the standard until C++17. */
23355 "ISO C++ forbids typename key in template template parameter;"
23357 }
23358 else
23362 }
23364 /* Parse an (optional) member-specification.
23366 member-specification:
23367 member-declaration member-specification [opt]
23368 access-specifier : member-specification [opt] */
23370 static void
23372 {
23374 {
23378 /* Peek at the next token. */
23380 /* If it's a `}', or EOF then we've seen all the members. */
23386 /* See if this token is a keyword. */
23389 {
23393 /* Consume the access-specifier. */
23395 /* Remember which access-specifier is active. */
23397 /* Look for the `:'. */
23402 /* Accept #pragmas at class scope. */
23404 {
23407 }
23409 /* Otherwise, the next construction must be a
23410 member-declaration. */
23412 }
23413 }
23414 }
23416 /* Parse a member-declaration.
23418 member-declaration:
23419 decl-specifier-seq [opt] member-declarator-list [opt] ;
23420 function-definition ; [opt]
23421 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23422 using-declaration
23423 template-declaration
23424 alias-declaration
23426 member-declarator-list:
23427 member-declarator
23428 member-declarator-list , member-declarator
23430 member-declarator:
23431 declarator pure-specifier [opt]
23432 declarator constant-initializer [opt]
23433 identifier [opt] : constant-expression
23435 GNU Extensions:
23437 member-declaration:
23438 __extension__ member-declaration
23440 member-declarator:
23441 declarator attributes [opt] pure-specifier [opt]
23442 declarator attributes [opt] constant-initializer [opt]
23443 identifier [opt] attributes [opt] : constant-expression
23445 C++0x Extensions:
23447 member-declaration:
23448 static_assert-declaration */
23450 static void
23452 {
23453 cp_decl_specifier_seq decl_specifiers;
23454 tree prefix_attributes;
23455 tree decl;
23464 /* Check for the `__extension__' keyword. */
23466 {
23467 /* Recurse. */
23469 /* Restore the old value of the PEDANTIC flag. */
23473 }
23475 /* Check for a template-declaration. */
23477 {
23478 /* An explicit specialization here is an error condition, and we
23479 expect the specialization handler to detect and report this. */
23483 else
23487 }
23488 /* Check for a template introduction. */
23492 /* Check for a using-declaration. */
23494 {
23496 {
23497 /* Parse the using-declaration. */
23501 }
23502 else
23503 {
23504 tree decl;
23508 /* Note that if we actually see the '=' token after the
23509 identifier, cp_parser_alias_declaration commits the
23510 tentative parse. In that case, we really expect an
23511 alias-declaration. Otherwise, we expect a using
23512 declaration. */
23513 alias_decl_expected =
23519 else
23523 }
23524 }
23526 /* Check for @defs. */
23528 {
23533 {
23538 }
23540 }
23542 /* If the next token is `static_assert' we have a static assertion. */
23544 {
23547 }
23554 /* Parse the decl-specifier-seq. */
23557 CP_PARSER_FLAGS_OPTIONAL,
23560 /* Check for an invalid type-name. */
23564 /* If there is no declarator, then the decl-specifier-seq should
23565 specify a type. */
23567 {
23568 /* If there was no decl-specifier-seq, and the next token is a
23569 `;', then we have something like:
23571 struct S { ; };
23573 [class.mem]
23575 Each member-declaration shall declare at least one member
23576 name of the class. */
23578 {
23581 {
23585 }
23586 }
23587 else
23588 {
23589 tree type;
23591 /* See if this declaration is a friend. */
23593 /* If there were decl-specifiers, check to see if there was
23594 a class-declaration. */
23597 /* Nested classes have already been added to the class, but
23598 a `friend' needs to be explicitly registered. */
23600 {
23601 /* If the `friend' keyword was present, the friend must
23602 be introduced with a class-key. */
23605 "in C++03 a class-key must be used "
23607 /* In this case:
23609 template <typename T> struct A {
23610 friend struct A<T>::B;
23611 };
23613 A<T>::B will be represented by a TYPENAME_TYPE, and
23614 therefore not recognized by check_tag_decl. */
23616 {
23620 }
23623 "friend declaration does not name a class or "
23625 else
23628 }
23629 /* If there is no TYPE, an error message will already have
23630 been issued. */
23632 ;
23633 /* An anonymous aggregate has to be handled specially; such
23634 a declaration really declares a data member (with a
23635 particular type), as opposed to a nested class. */
23637 {
23638 /* C++11 9.5/6. */
23641 "a storage class on an anonymous aggregate "
23644 /* Remove constructors and such from TYPE, now that we
23645 know it is an anonymous aggregate. */
23647 /* And make the corresponding data member. */
23650 /* Add it to the class. */
23652 }
23653 else
23654 cp_parser_check_access_in_redeclaration
23657 }
23658 }
23659 else
23660 {
23663 /* Clear attributes from the decl_specifiers but keep them
23664 around as prefix attributes that apply them to the entity
23665 being declared. */
23669 /* See if these declarations will be friends. */
23672 /* Keep going until we hit the `;' at the end of the
23673 declaration. */
23675 {
23677 tree first_attribute;
23678 tree initializer;
23681 /* Peek at the next token. */
23684 /* The following code wants to know early if it is a bit-field
23685 or some other declaration. Attributes can appear before
23686 the `:' token. Skip over them without consuming any tokens
23687 to peek if they are followed by `:'. */
23692 {
23693 size_t n
23696 }
23698 /* Check for a bitfield declaration. */
23704 {
23705 tree identifier;
23706 tree width;
23711 else
23714 /* Look for attributes that apply to the bitfield. */
23717 /* Consume the `:' token. */
23720 /* Get the width of the bitfield. */
23724 /* In C++2A and as extension for C++11 and above we allow
23725 default member initializers for bit-fields. */
23730 CPP_OPEN_BRACE)))
23731 {
23732 location_t loc
23738 "default member initializers for bit-fields "
23739 "only available with -std=c++2a or "
23744 {
23748 }
23749 }
23750 else
23751 {
23752 /* Look for attributes that apply to the bitfield after
23753 the `:' token and width. This is where GCC used to
23754 parse attributes in the past, pedwarn if there is
23755 a std attribute. */
23758 "ISO C++ allows bit-field attributes only "
23762 }
23766 /* Remember which attributes are prefix attributes and
23767 which are not. */
23769 /* Combine the attributes. */
23772 /* Create the bitfield declaration. */
23775 identifier,
23776 sfk_none)
23780 attributes);
23781 }
23782 else
23783 {
23785 tree asm_specification;
23788 /* Parse the declarator. */
23789 declarator
23794 friend_p);
23796 /* If something went wrong parsing the declarator, make sure
23797 that we at least consume some tokens. */
23799 {
23800 /* Skip to the end of the statement. */
23802 /* If the next token is not a semicolon, that is
23803 probably because we just skipped over the body of
23804 a function. So, we consume a semicolon if
23805 present, but do not issue an error message if it
23806 is not present. */
23808 CPP_SEMICOLON))
23811 }
23814 cp_parser_check_for_definition_in_return_type
23818 /* Look for an asm-specification. */
23820 /* Look for attributes that apply to the declaration. */
23822 /* Remember which attributes are prefix attributes and
23823 which are not. */
23825 /* Combine the attributes. */
23828 /* If it's an `=', then we have a constant-initializer or a
23829 pure-specifier. It is not correct to parse the
23830 initializer before registering the member declaration
23831 since the member declaration should be in scope while
23832 its initializer is processed. However, the rest of the
23833 front end does not yet provide an interface that allows
23834 us to handle this correctly. */
23836 {
23837 /* In [class.mem]:
23839 A pure-specifier shall be used only in the declaration of
23840 a virtual function.
23842 A member-declarator can contain a constant-initializer
23843 only if it declares a static member of integral or
23844 enumeration type.
23846 Therefore, if the DECLARATOR is for a function, we look
23847 for a pure-specifier; otherwise, we look for a
23848 constant-initializer. When we call `grokfield', it will
23849 perform more stringent semantics checks. */
23861 {
23863 /* Don't require a constant rvalue in C++11, since we
23864 might want a reference constant. We'll enforce
23865 constancy later. */
23867 /* Parse the initializer. */
23870 }
23871 else
23872 /* Parse the initializer. */
23874 }
23877 {
23881 else
23883 }
23884 /* Otherwise, there is no initializer. */
23885 else
23888 /* See if we are probably looking at a function
23889 definition. We are certainly not looking at a
23890 member-declarator. Calling `grokfield' has
23891 side-effects, so we must not do it unless we are sure
23892 that we are looking at a member-declarator. */
23895 {
23896 /* The grammar does not allow a pure-specifier to be
23897 used when a member function is defined. (It is
23898 possible that this fact is an oversight in the
23899 standard, since a pure function may be defined
23900 outside of the class-specifier. */
23906 declarator,
23907 attributes);
23910 /* If the member was not a friend, declare it here. */
23913 /* Peek at the next token. */
23915 /* If the next token is a semicolon, consume it. */
23917 {
23918 location_t semicolon_loc
23923 "extra %<;%> after in-class "
23925 }
23927 }
23928 else
23931 /* Create the declaration. */
23936 {
23939 else
23941 }
23942 }
23947 /* Reset PREFIX_ATTRIBUTES. */
23949 {
23954 }
23956 /* If there is any qualification still in effect, clear it
23957 now; we will be starting fresh with the next declarator. */
23961 /* If it's a `,', then there are more declarators. */
23963 {
23966 {
23972 }
23973 }
23974 /* If the next token isn't a `;', then we have a parse error. */
23976 CPP_SEMICOLON))
23977 {
23978 /* The next token might be a ways away from where the
23979 actual semicolon is missing. Find the previous token
23980 and use that for our error position. */
23987 /* Assume that the user meant to provide a semicolon. If
23988 we were to cp_parser_skip_to_end_of_statement, we might
23989 skip to a semicolon inside a member function definition
23990 and issue nonsensical error messages. */
23992 }
23995 {
23996 /* Add DECL to the list of members. */
23998 /* Explicitly include, eg, NSDMIs, for better error
23999 recovery (c++/58650). */
24007 /* Add DECL to the queue of NSDMI to be parsed later. */
24009 }
24013 }
24014 }
24017 out:
24019 }
24021 /* Parse a pure-specifier.
24023 pure-specifier:
24024 = 0
24026 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24027 Otherwise, ERROR_MARK_NODE is returned. */
24029 static tree
24031 {
24034 /* Look for the `=' token. */
24037 /* Look for the `0' token. */
24046 /* Accept = default or = delete in c++0x mode. */
24049 {
24052 }
24054 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24056 {
24061 }
24063 {
24066 }
24069 }
24071 /* Parse a constant-initializer.
24073 constant-initializer:
24074 = constant-expression
24076 Returns a representation of the constant-expression. */
24078 static tree
24080 {
24081 /* Look for the `=' token. */
24085 /* It is invalid to write:
24087 struct S { static const int i = { 7 }; };
24089 */
24091 {
24094 /* Consume the opening brace. */
24095 matching_braces braces;
24097 /* Skip the initializer. */
24099 /* Look for the trailing `}'. */
24103 }
24106 }
24108 /* Derived classes [gram.class.derived] */
24110 /* Parse a base-clause.
24112 base-clause:
24113 : base-specifier-list
24115 base-specifier-list:
24116 base-specifier ... [opt]
24117 base-specifier-list , base-specifier ... [opt]
24119 Returns a TREE_LIST representing the base-classes, in the order in
24120 which they were declared. The representation of each node is as
24121 described by cp_parser_base_specifier.
24123 In the case that no bases are specified, this function will return
24124 NULL_TREE, not ERROR_MARK_NODE. */
24126 static tree
24128 {
24131 /* Look for the `:' that begins the list. */
24134 /* Scan the base-specifier-list. */
24136 {
24138 tree base;
24141 /* Look for the base-specifier. */
24143 /* Look for the (optional) ellipsis. */
24145 {
24146 /* Consume the `...'. */
24150 }
24152 /* Add BASE to the front of the list. */
24154 {
24156 /* Make this a pack expansion type. */
24160 {
24163 }
24164 }
24165 /* Peek at the next token. */
24167 /* If it's not a comma, then the list is complete. */
24170 /* Consume the `,'. */
24172 }
24174 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24175 base class had a qualified name. However, the next name that
24176 appears is certainly not qualified. */
24182 }
24184 /* Parse a base-specifier.
24186 base-specifier:
24187 :: [opt] nested-name-specifier [opt] class-name
24188 virtual access-specifier [opt] :: [opt] nested-name-specifier
24189 [opt] class-name
24190 access-specifier virtual [opt] :: [opt] nested-name-specifier
24191 [opt] class-name
24193 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24194 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24195 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24196 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24198 static tree
24200 {
24208 tree type;
24210 /* Process the optional `virtual' and `access-specifier'. */
24212 {
24213 /* Peek at the next token. */
24215 /* Process `virtual'. */
24217 {
24219 /* If `virtual' appears more than once, issue an error. */
24221 {
24225 }
24229 /* Consume the `virtual' token. */
24237 /* If more than one access specifier appears, issue an
24238 error. */
24241 {
24245 }
24249 /* Consume the access-specifier. */
24257 }
24258 }
24259 /* It is not uncommon to see programs mechanically, erroneously, use
24260 the 'typename' keyword to denote (dependent) qualified types
24261 as base classes. */
24263 {
24268 else
24270 "keyword %<typename%> not allowed in this context "
24273 }
24275 /* Look for the optional `::' operator. */
24277 /* Look for the nested-name-specifier. The simplest way to
24278 implement:
24280 [temp.res]
24282 The keyword `typename' is not permitted in a base-specifier or
24283 mem-initializer; in these contexts a qualified name that
24284 depends on a template-parameter is implicitly assumed to be a
24285 type name.
24287 is to pretend that we have seen the `typename' keyword at this
24288 point. */
24294 /* If the base class is given by a qualified name, assume that names
24295 we see are type names or templates, as appropriate. */
24301 /* DR 950 allows decltype as a base-specifier. */
24303 else
24304 {
24305 /* Otherwise, look for the class-name. */
24307 class_scope_p,
24308 template_p,
24309 typename_type,
24314 }
24320 }
24322 /* Exception handling [gram.exception] */
24324 /* Parse an (optional) noexcept-specification.
24326 noexcept-specification:
24327 noexcept ( constant-expression ) [opt]
24329 If no noexcept-specification is present, returns NULL_TREE.
24330 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24331 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24332 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24333 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24334 in which case a boolean condition is returned instead. */
24336 static tree
24341 {
24345 /* Peek at the next token. */
24348 /* Is it a noexcept-specification? */
24350 {
24351 tree expr;
24355 {
24356 matching_parens parens;
24360 {
24361 /* Types may not be defined in an exception-specification. */
24363 parser->type_definition_forbidden_message
24368 /* Restore the saved message. */
24370 }
24371 else
24372 {
24375 }
24378 }
24379 else
24380 {
24384 }
24386 /* We cannot build a noexcept-spec right away because this will check
24387 that expr is a constexpr. */
24390 else
24392 }
24393 else
24395 }
24397 /* Parse an (optional) exception-specification.
24399 exception-specification:
24400 throw ( type-id-list [opt] )
24402 Returns a TREE_LIST representing the exception-specification. The
24403 TREE_VALUE of each node is a type. */
24405 static tree
24407 {
24409 tree type_id_list;
24412 /* Peek at the next token. */
24415 /* Is it a noexcept-specification? */
24421 /* If it's not `throw', then there's no exception-specification. */
24427 /* Consume the `throw'. */
24430 /* Look for the `('. */
24431 matching_parens parens;
24434 /* Peek at the next token. */
24436 /* If it's not a `)', then there is a type-id-list. */
24438 {
24439 /* Types may not be defined in an exception-specification. */
24441 parser->type_definition_forbidden_message
24443 /* Parse the type-id-list. */
24445 /* Restore the saved message. */
24449 {
24453 }
24456 "dynamic exception specifications are deprecated in "
24458 }
24459 /* In C++17, throw() is equivalent to noexcept (true). throw()
24460 is deprecated in C++11 and above as well, but is still widely used,
24461 so don't warn about it yet. */
24464 else
24467 /* Look for the `)'. */
24471 }
24473 /* Parse an (optional) type-id-list.
24475 type-id-list:
24476 type-id ... [opt]
24477 type-id-list , type-id ... [opt]
24479 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24480 in the order that the types were presented. */
24482 static tree
24484 {
24488 {
24490 tree type;
24494 /* Get the next type-id. */
24496 /* Check for invalid 'auto'. */
24498 {
24502 }
24503 /* Parse the optional ellipsis. */
24505 {
24506 /* Consume the `...'. */
24509 /* Turn the type into a pack expansion expression. */
24511 }
24512 /* Add it to the list. */
24514 /* Peek at the next token. */
24516 /* If it is not a `,', we are done. */
24519 /* Consume the `,'. */
24521 }
24524 }
24526 /* Parse a try-block.
24528 try-block:
24529 try compound-statement handler-seq */
24531 static tree
24533 {
24534 tree try_block;
24548 }
24550 /* Parse a function-try-block.
24552 function-try-block:
24553 try ctor-initializer [opt] function-body handler-seq */
24555 static void
24557 {
24558 tree compound_stmt;
24559 tree try_block;
24561 /* Look for the `try' keyword. */
24564 /* Let the rest of the front end know where we are. */
24566 /* Parse the function-body. */
24567 cp_parser_ctor_initializer_opt_and_function_body
24569 /* We're done with the `try' part. */
24571 /* Parse the handlers. */
24573 /* We're done with the handlers. */
24575 }
24577 /* Parse a handler-seq.
24579 handler-seq:
24580 handler handler-seq [opt] */
24582 static void
24584 {
24586 {
24589 /* Parse the handler. */
24591 /* Peek at the next token. */
24593 /* If it's not `catch' then there are no more handlers. */
24596 }
24597 }
24599 /* Parse a handler.
24601 handler:
24602 catch ( exception-declaration ) compound-statement */
24604 static void
24606 {
24607 tree handler;
24608 tree declaration;
24612 matching_parens parens;
24619 }
24621 /* Parse an exception-declaration.
24623 exception-declaration:
24624 type-specifier-seq declarator
24625 type-specifier-seq abstract-declarator
24626 type-specifier-seq
24627 ...
24629 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24630 ellipsis variant is used. */
24632 static tree
24634 {
24635 cp_decl_specifier_seq type_specifiers;
24639 /* If it's an ellipsis, it's easy to handle. */
24641 {
24642 /* Consume the `...' token. */
24645 }
24647 /* Types may not be defined in exception-declarations. */
24649 parser->type_definition_forbidden_message
24652 /* Parse the type-specifier-seq. */
24656 /* If it's a `)', then there is no declarator. */
24659 else
24666 /* Restore the saved message. */
24673 }
24675 /* Parse a throw-expression.
24677 throw-expression:
24678 throw assignment-expression [opt]
24680 Returns a THROW_EXPR representing the throw-expression. */
24682 static tree
24684 {
24685 tree expression;
24690 /* Figure out whether or not there is an assignment-expression
24691 following the "throw" keyword. */
24699 else
24703 }
24705 /* GNU Extensions */
24707 /* Parse an (optional) asm-specification.
24709 asm-specification:
24710 asm ( string-literal )
24712 If the asm-specification is present, returns a STRING_CST
24713 corresponding to the string-literal. Otherwise, returns
24714 NULL_TREE. */
24716 static tree
24718 {
24720 tree asm_specification;
24722 /* Peek at the next token. */
24724 /* If the next token isn't the `asm' keyword, then there's no
24725 asm-specification. */
24729 /* Consume the `asm' token. */
24731 /* Look for the `('. */
24732 matching_parens parens;
24735 /* Look for the string-literal. */
24738 /* Look for the `)'. */
24742 }
24744 /* Parse an asm-operand-list.
24746 asm-operand-list:
24747 asm-operand
24748 asm-operand-list , asm-operand
24750 asm-operand:
24751 string-literal ( expression )
24752 [ string-literal ] string-literal ( expression )
24754 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24755 each node is the expression. The TREE_PURPOSE is itself a
24756 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24757 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24758 is a STRING_CST for the string literal before the parenthesis. Returns
24759 ERROR_MARK_NODE if any of the operands are invalid. */
24761 static tree
24763 {
24768 {
24769 tree string_literal;
24770 tree expression;
24771 tree name;
24774 {
24775 /* Consume the `[' token. */
24777 /* Read the operand name. */
24782 /* Look for the closing `]'. */
24784 }
24785 else
24787 /* Look for the string-literal. */
24790 /* Look for the `('. */
24791 matching_parens parens;
24793 /* Parse the expression. */
24795 /* Look for the `)'. */
24803 /* Add this operand to the list. */
24805 expression,
24806 asm_operands);
24807 /* If the next token is not a `,', there are no more
24808 operands. */
24811 /* Consume the `,'. */
24813 }
24816 }
24818 /* Parse an asm-clobber-list.
24820 asm-clobber-list:
24821 string-literal
24822 asm-clobber-list , string-literal
24824 Returns a TREE_LIST, indicating the clobbers in the order that they
24825 appeared. The TREE_VALUE of each node is a STRING_CST. */
24827 static tree
24829 {
24833 {
24834 tree string_literal;
24836 /* Look for the string literal. */
24838 /* Add it to the list. */
24840 /* If the next token is not a `,', then the list is
24841 complete. */
24844 /* Consume the `,' token. */
24846 }
24849 }
24851 /* Parse an asm-label-list.
24853 asm-label-list:
24854 identifier
24855 asm-label-list , identifier
24857 Returns a TREE_LIST, indicating the labels in the order that they
24858 appeared. The TREE_VALUE of each node is a label. */
24860 static tree
24862 {
24866 {
24869 /* Look for the identifier. */
24872 {
24875 {
24881 }
24882 }
24883 /* If the next token is not a `,', then the list is
24884 complete. */
24887 /* Consume the `,' token. */
24889 }
24892 }
24894 /* Return TRUE iff the next tokens in the stream are possibly the
24895 beginning of a GNU extension attribute. */
24897 static bool
24899 {
24901 }
24903 /* Return TRUE iff the next tokens in the stream are possibly the
24904 beginning of a standard C++-11 attribute specifier. */
24906 static bool
24908 {
24910 }
24912 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24913 beginning of a standard C++-11 attribute specifier. */
24915 static bool
24917 {
24925 }
24927 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24928 beginning of a GNU extension attribute. */
24930 static bool
24932 {
24936 }
24938 /* Return true iff the next tokens can be the beginning of either a
24939 GNU attribute list, or a standard C++11 attribute sequence. */
24941 static bool
24943 {
24946 }
24948 /* Return true iff the next Nth tokens can be the beginning of either
24949 a GNU attribute list, or a standard C++11 attribute sequence. */
24951 static bool
24953 {
24956 }
24958 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24959 of GNU attributes, or return NULL. */
24961 static tree
24963 {
24967 }
24969 /* Parse an (optional) series of attributes.
24971 attributes:
24972 attributes attribute
24974 attribute:
24975 __attribute__ (( attribute-list [opt] ))
24977 The return value is as for cp_parser_gnu_attribute_list. */
24979 static tree
24981 {
24988 {
24990 tree attribute_list;
24993 /* Peek at the next token. */
24995 /* If it's not `__attribute__', then we're done. */
24999 /* Consume the `__attribute__' keyword. */
25001 /* Look for the two `(' tokens. */
25002 matching_parens outer_parens;
25004 matching_parens inner_parens;
25007 /* Peek at the next token. */
25010 /* Parse the attribute-list. */
25012 else
25013 /* If the next token is a `)', then there is no attribute
25014 list. */
25017 /* Look for the two `)' tokens. */
25025 /* Add these new attributes to the list. */
25027 }
25030 }
25032 /* Parse a GNU attribute-list.
25034 attribute-list:
25035 attribute
25036 attribute-list , attribute
25038 attribute:
25039 identifier
25040 identifier ( identifier )
25041 identifier ( identifier , expression-list )
25042 identifier ( expression-list )
25044 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25045 to an attribute. The TREE_PURPOSE of each node is the identifier
25046 indicating which attribute is in use. The TREE_VALUE represents
25047 the arguments, if any. */
25049 static tree
25051 {
25057 {
25059 tree identifier;
25060 tree attribute;
25062 /* Look for the identifier. We also allow keywords here; for
25063 example `__attribute__ ((const))' is legal. */
25067 {
25070 /* Consume the token, but save it since we need it for the
25071 SIMD enabled function parsing. */
25074 /* Save away the identifier that indicates which attribute
25075 this is. */
25077 /* For keywords, use the canonical spelling, not the
25078 parsed identifier. */
25085 /* Peek at the next token. */
25087 /* If it's an `(', then parse the attribute arguments. */
25089 {
25093 vec = cp_parser_parenthesized_expression_list
25099 else
25100 {
25103 }
25104 /* Save the arguments away. */
25106 }
25109 {
25110 /* Add this attribute to the list. */
25113 }
25116 }
25117 /* Now, look for more attributes. If the next token isn't a
25118 `,', we're done. */
25122 /* Consume the comma and keep going. */
25124 }
25127 /* We built up the list in reverse order. */
25129 }
25131 /* Parse a standard C++11 attribute.
25133 The returned representation is a TREE_LIST which TREE_PURPOSE is
25134 the scoped name of the attribute, and the TREE_VALUE is its
25135 arguments list.
25137 Note that the scoped name of the attribute is itself a TREE_LIST
25138 which TREE_PURPOSE is the namespace of the attribute, and
25139 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25140 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25141 and which TREE_PURPOSE is directly the attribute name.
25143 Clients of the attribute code should use get_attribute_namespace
25144 and get_attribute_name to get the actual namespace and name of
25145 attributes, regardless of their being GNU or C++11 attributes.
25147 attribute:
25148 attribute-token attribute-argument-clause [opt]
25150 attribute-token:
25151 identifier
25152 attribute-scoped-token
25154 attribute-scoped-token:
25155 attribute-namespace :: identifier
25157 attribute-namespace:
25158 identifier
25160 attribute-argument-clause:
25161 ( balanced-token-seq )
25163 balanced-token-seq:
25164 balanced-token [opt]
25165 balanced-token-seq balanced-token
25167 balanced-token:
25168 ( balanced-token-seq )
25169 [ balanced-token-seq ]
25170 { balanced-token-seq }. */
25172 static tree
25174 {
25181 /* First, parse name of the attribute, a.k.a attribute-token. */
25198 {
25199 /* We are seeing a scoped attribute token. */
25214 else
25215 {
25219 }
25223 NULL_TREE);
25225 }
25228 NULL_TREE);
25229 else
25230 {
25233 NULL_TREE);
25234 /* C++11 noreturn attribute is equivalent to GNU's. */
25237 /* C++14 deprecated attribute is equivalent to GNU's. */
25240 /* C++17 fallthrough attribute is equivalent to GNU's. */
25243 /* Transactional Memory TS optimize_for_synchronized attribute is
25244 equivalent to GNU transaction_callable. */
25248 /* Transactional Memory attributes are GNU attributes. */
25251 }
25253 /* Now parse the optional argument clause of the attribute. */
25258 {
25264 /* A GNU attribute that takes an identifier in parameter. */
25267 vec = cp_parser_parenthesized_expression_list
25273 else
25274 {
25277 }
25281 else
25283 }
25286 }
25288 /* Check that the attribute ATTRIBUTE appears at most once in the
25289 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25290 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25291 isn't implemented yet in GCC. */
25293 static void
25295 {
25297 {
25307 }
25308 }
25310 /* Parse a list of standard C++-11 attributes.
25312 attribute-list:
25313 attribute [opt]
25314 attribute-list , attribute[opt]
25315 attribute ...
25316 attribute-list , attribute ...
25317 */
25319 static tree
25321 {
25326 {
25331 {
25335 }
25338 {
25343 else
25344 {
25349 }
25351 }
25355 }
25358 }
25360 /* Parse a standard C++-11 attribute specifier.
25362 attribute-specifier:
25363 [ [ attribute-using-prefix [opt] attribute-list ] ]
25364 alignment-specifier
25366 attribute-using-prefix:
25367 using attribute-namespace :
25369 alignment-specifier:
25370 alignas ( type-id ... [opt] )
25371 alignas ( alignment-expression ... [opt] ). */
25373 static tree
25375 {
25381 {
25388 {
25399 {
25403 "attribute using prefix only available "
25409 }
25410 else
25412 }
25419 else
25420 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25421 when we are sure that we have actually parsed them. */
25423 }
25424 else
25425 {
25426 tree alignas_expr;
25428 /* Look for an alignment-specifier. */
25439 matching_parens parens;
25447 {
25454 }
25459 /* Handle alignas (pack...). */
25461 {
25464 }
25466 /* Something went wrong, so don't build the attribute. */
25473 /* Build the C++-11 representation of an 'aligned'
25474 attribute. */
25475 attributes =
25478 alignas_expr);
25479 }
25482 }
25484 /* Parse a standard C++-11 attribute-specifier-seq.
25486 attribute-specifier-seq:
25487 attribute-specifier-seq [opt] attribute-specifier
25488 */
25490 static tree
25492 {
25497 {
25506 else
25509 }
25512 }
25514 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25515 return index of the first token after balanced-token, or N on failure. */
25517 static size_t
25519 {
25522 do
25524 {
25527 /* Ran out of tokens. */
25549 }
25552 }
25554 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25555 return index of the first token after the GNU attribute tokens, or N on
25556 failure. */
25558 static size_t
25560 {
25562 {
25574 }
25576 }
25578 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25579 next token), return index of the first token after the standard C++11
25580 attribute tokens, or N on failure. */
25582 static size_t
25584 {
25586 {
25589 {
25596 }
25599 {
25604 }
25605 else
25607 }
25609 }
25611 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25612 as the next token), return index of the first token after the attribute
25613 tokens, or N on failure. */
25615 static size_t
25617 {
25621 }
25623 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25624 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25625 current value of the PEDANTIC flag, regardless of whether or not
25626 the `__extension__' keyword is present. The caller is responsible
25627 for restoring the value of the PEDANTIC flag. */
25629 static bool
25631 {
25632 /* Save the old value of the PEDANTIC flag. */
25636 {
25637 /* Consume the `__extension__' token. */
25639 /* We're not being pedantic while the `__extension__' keyword is
25640 in effect. */
25644 }
25647 }
25649 /* Parse a label declaration.
25651 label-declaration:
25652 __label__ label-declarator-seq ;
25654 label-declarator-seq:
25655 identifier , label-declarator-seq
25656 identifier */
25658 static void
25660 {
25661 /* Look for the `__label__' keyword. */
25665 {
25666 tree identifier;
25668 /* Look for an identifier. */
25670 /* If we failed, stop. */
25673 /* Declare it as a label. */
25675 /* If the next token is a `;', stop. */
25678 /* Look for the `,' separating the label declarations. */
25680 }
25682 /* Look for the final `;'. */
25684 }
25686 // -------------------------------------------------------------------------- //
25687 // Requires Clause
25689 // Parse a requires clause.
25690 //
25691 // requires-clause:
25692 // 'requires' logical-or-expression
25693 //
25694 // The required logical-or-expression must be a constant expression. Note
25695 // that we don't check that the expression is constepxr here. We defer until
25696 // we analyze constraints and then, we only check atomic constraints.
25697 static tree
25699 {
25700 // Parse the requires clause so that it is not automatically folded.
25708 }
25710 // Optionally parse a requires clause:
25711 static tree
25713 {
25716 {
25719 {
25722 /* Parse and discard the requires-clause. */
25725 }
25727 }
25730 }
25733 /*---------------------------------------------------------------------------
25734 Requires expressions
25735 ---------------------------------------------------------------------------*/
25737 /* Parse a requires expression
25739 requirement-expression:
25740 'requires' requirement-parameter-list [opt] requirement-body */
25741 static tree
25743 {
25747 /* A requires-expression shall appear only within a concept
25748 definition or a requires-clause.
25750 TODO: Implement this diagnostic correctly. */
25752 {
25756 }
25759 {
25760 /* Local parameters are delared as variables within the scope
25761 of the expression. They are not visible past the end of
25762 the expression. Expressions within the requires-expression
25763 are unevaluated. */
25764 struct scope_sentinel
25765 {
25767 {
25770 }
25773 {
25776 }
25779 /* Parse the optional parameter list. */
25781 {
25785 }
25786 else
25789 /* Parse the requirement body. */
25793 }
25795 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25796 the parm chain. */
25799 }
25801 /* Parse a parameterized requirement.
25803 requirement-parameter-list:
25804 '(' parameter-declaration-clause ')' */
25805 static tree
25807 {
25808 matching_parens parens;
25818 }
25820 /* Parse the body of a requirement.
25822 requirement-body:
25823 '{' requirement-list '}' */
25824 static tree
25826 {
25827 matching_braces braces;
25837 }
25839 /* Parse a list of requirements.
25841 requirement-list:
25842 requirement
25843 requirement-list ';' requirement[opt] */
25844 static tree
25846 {
25849 {
25856 /* If we see a semi-colon, consume it. */
25860 /* Stop processing at the end of the list. */
25863 }
25865 /* Reverse the order of requirements so they are analyzed in
25866 declaration order. */
25868 }
25870 /* Parse a syntactic requirement or type requirement.
25872 requirement:
25873 simple-requirement
25874 compound-requirement
25875 type-requirement
25876 nested-requirement */
25877 static tree
25879 {
25886 else
25888 }
25890 /* Parse a simple requirement.
25892 simple-requirement:
25893 expression ';' */
25894 static tree
25896 {
25905 }
25907 /* Parse a type requirement
25909 type-requirement
25910 nested-name-specifier [opt] required-type-name ';'
25912 required-type-name:
25913 type-name
25914 'template' [opt] simple-template-id */
25915 static tree
25917 {
25920 // Save the scope before parsing name specifiers.
25931 tree type;
25933 {
25942 }
25943 else
25962 }
25964 /* Parse a compound requirement
25966 compound-requirement:
25967 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25968 static tree
25970 {
25971 /* Parse an expression enclosed in '{ }'s. */
25972 matching_braces braces;
25983 /* Parse the optional noexcept. */
25986 {
25989 }
25991 /* Parse the optional trailing return type. */
25994 {
26002 }
26005 }
26007 /* Parse a nested requirement. This is the same as a requires clause.
26009 nested-requirement:
26010 requires-clause */
26011 static tree
26013 {
26019 }
26021 /* Support Functions */
26023 /* Return the appropriate prefer_type argument for lookup_name_real based on
26024 tag_type and template_mem_access. */
26028 {
26029 /* DR 141: When looking in the current enclosing context for a template-name
26030 after -> or ., only consider class templates. */
26034 {
26038 }
26039 }
26041 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26042 NAME should have one of the representations used for an
26043 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26044 is returned. If PARSER->SCOPE is a dependent type, then a
26045 SCOPE_REF is returned.
26047 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26048 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26049 was formed. Abstractly, such entities should not be passed to this
26050 function, because they do not need to be looked up, but it is
26051 simpler to check for this special case here, rather than at the
26052 call-sites.
26054 In cases not explicitly covered above, this function returns a
26055 DECL, OVERLOAD, or baselink representing the result of the lookup.
26056 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26057 is returned.
26059 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26060 (e.g., "struct") that was used. In that case bindings that do not
26061 refer to types are ignored.
26063 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26064 ignored.
26066 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26067 are ignored.
26069 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26070 types.
26072 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26073 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26074 NULL_TREE otherwise. */
26076 static cp_expr
26083 location_t name_location)
26084 {
26085 tree decl;
26088 /* Assume that the lookup will be unambiguous. */
26092 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26093 no longer valid. Note that if we are parsing tentatively, and
26094 the parse fails, OBJECT_TYPE will be automatically restored. */
26100 /* A template-id has already been resolved; there is no lookup to
26101 do. */
26105 {
26109 }
26111 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26112 it should already have been checked to make sure that the name
26113 used matches the type being destroyed. */
26115 {
26116 tree type;
26118 /* Figure out to which type this destructor applies. */
26123 else
26125 /* If that's not a class type, there is no destructor. */
26136 }
26138 /* By this point, the NAME should be an ordinary identifier. If
26139 the id-expression was a qualified name, the qualifying scope is
26140 stored in PARSER->SCOPE at this point. */
26143 /* Perform the lookup. */
26145 {
26151 /* If the SCOPE is dependent, the lookup must be deferred until
26152 the template is instantiated -- unless we are explicitly
26153 looking up names in uninstantiated templates. Even then, we
26154 cannot look up the name if the scope is not a class type; it
26155 might, for example, be a template type parameter. */
26160 /* Defer lookup. */
26162 else
26163 {
26166 /* If PARSER->SCOPE is a dependent type, then it must be a
26167 class type, and we must not be checking dependencies;
26168 otherwise, we would have processed this lookup above. So
26169 that PARSER->SCOPE is not considered a dependent base by
26170 lookup_member, we must enter the scope here. */
26174 /* If the PARSER->SCOPE is a template specialization, it
26175 may be instantiated during name lookup. In that case,
26176 errors may be issued. Even if we rollback the current
26177 tentative parse, those errors are valid. */
26182 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26183 lookup result and the nested-name-specifier nominates a class C:
26184 * if the name specified after the nested-name-specifier, when
26185 looked up in C, is the injected-class-name of C (Clause 9), or
26186 * if the name specified after the nested-name-specifier is the
26187 same as the identifier or the simple-template-id's template-
26188 name in the last component of the nested-name-specifier,
26189 the name is instead considered to name the constructor of
26190 class C. [ Note: for example, the constructor is not an
26191 acceptable lookup result in an elaborated-type-specifier so
26192 the constructor would not be used in place of the
26193 injected-class-name. --end note ] Such a constructor name
26194 shall be used only in the declarator-id of a declaration that
26195 names a constructor or in a using-declaration. */
26203 /* If we have a single function from a using decl, pull it out. */
26210 }
26212 /* If the scope is a dependent type and either we deferred lookup or
26213 we did lookup but didn't find the name, rememeber the name. */
26216 {
26218 {
26219 tree type;
26221 /* The resolution to Core Issue 180 says that `struct
26222 A::B' should be considered a type-name, even if `A'
26223 is dependent. */
26228 }
26232 CPP_CLOSE_PAREN)))
26236 else
26239 is_template);
26240 }
26243 }
26245 {
26246 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26247 OBJECT_TYPE is not a class. */
26249 /* If the OBJECT_TYPE is a template specialization, it may
26250 be instantiated during name lookup. In that case, errors
26251 may be issued. Even if we rollback the current tentative
26252 parse, those errors are valid. */
26254 name,
26257 tf_warning_or_error);
26258 else
26262 /* Look it up in the enclosing context. DR 141: When looking for a
26263 template-name after -> or ., only consider class templates. */
26268 /* The object is type-dependent, so we can't look anything up; we used
26269 this to get the DR 141 behavior. */
26273 }
26274 else
26275 {
26281 }
26283 /* If the lookup failed, let our caller know. */
26287 /* Pull out the template from an injected-class-name (or multiple). */
26291 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26293 {
26296 /* The error message we have to print is too complicated for
26297 cp_parser_error, so we incorporate its actions directly. */
26299 {
26301 name);
26303 }
26305 }
26313 /* If we have resolved the name of a member declaration, check to
26314 see if the declaration is accessible. When the name resolves to
26315 set of overloaded functions, accessibility is checked when
26316 overload resolution is done.
26318 During an explicit instantiation, access is not checked at all,
26319 as per [temp.explicit]. */
26326 }
26328 /* Like cp_parser_lookup_name, but for use in the typical case where
26329 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26330 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26332 static tree
26334 {
26336 none_type,
26341 location);
26342 }
26344 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26345 the current context, return the TYPE_DECL. If TAG_NAME_P is
26346 true, the DECL indicates the class being defined in a class-head,
26347 or declared in an elaborated-type-specifier.
26349 Otherwise, return DECL. */
26351 static tree
26353 {
26354 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26355 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26357 struct A {
26358 template <typename T> struct B;
26359 };
26361 template <typename T> struct A::B {};
26363 Similarly, in an elaborated-type-specifier:
26365 namespace N { struct X{}; }
26367 struct A {
26368 template <typename T> friend struct N::X;
26369 };
26371 However, if the DECL refers to a class type, and we are in
26372 the scope of the class, then the name lookup automatically
26373 finds the TYPE_DECL created by build_self_reference rather
26374 than a TEMPLATE_DECL. For example, in:
26376 template <class T> struct S {
26377 S s;
26378 };
26380 there is no need to handle such case. */
26386 }
26388 /* If too many, or too few, template-parameter lists apply to the
26389 declarator, issue an error message. Returns TRUE if all went well,
26390 and FALSE otherwise. */
26392 static bool
26395 location_t declarator_location)
26396 {
26398 {
26400 {
26409 {
26410 /* If the DECLARATOR has the form `X<y>' then it uses one
26411 additional level of template parameters. */
26414 }
26416 return cp_parser_check_template_parameters
26418 declarator);
26419 }
26435 }
26437 }
26439 /* NUM_TEMPLATES were used in the current declaration. If that is
26440 invalid, return FALSE and issue an error messages. Otherwise,
26441 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26442 declarator and we can print more accurate diagnostics. */
26444 static bool
26448 location_t location,
26450 {
26451 /* If there are the same number of template classes and parameter
26452 lists, that's OK. */
26455 /* If there are more, but only one more, and the name ends in an identifier,
26456 then we are declaring a primary template. That's OK too. */
26460 /* If there are more template classes than parameter lists, we have
26461 something like:
26463 template <class T> void S<T>::R<T>::f (); */
26465 {
26475 else
26478 }
26479 /* Otherwise, there are too many template parameter lists. We have
26480 something like:
26482 template <class T> template <class U> void S::f(); */
26485 }
26487 /* Parse an optional `::' token indicating that the following name is
26488 from the global namespace. If so, PARSER->SCOPE is set to the
26489 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26490 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26491 Returns the new value of PARSER->SCOPE, if the `::' token is
26492 present, and NULL_TREE otherwise. */
26494 static tree
26496 {
26499 /* Peek at the next token. */
26501 /* If we're looking at a `::' token then we're starting from the
26502 global namespace, not our current location. */
26504 {
26505 /* Consume the `::' token. */
26507 /* Set the SCOPE so that we know where to start the lookup. */
26513 }
26515 {
26519 }
26522 }
26524 /* Returns TRUE if the upcoming token sequence is the start of a
26525 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26526 declarator is preceded by the `friend' specifier. */
26528 static bool
26530 {
26533 tree nested_name_specifier;
26536 /* The common case is that this is not a constructor declarator, so
26537 try to avoid doing lots of work if at all possible. It's not
26538 valid declare a constructor at function scope. */
26541 /* And only certain tokens can begin a constructor declarator. */
26549 /* Parse tentatively; we are going to roll back all of the tokens
26550 consumed here. */
26552 /* Assume that we are looking at a constructor declarator. */
26555 /* Look for the optional `::' operator. */
26558 /* Look for the nested-name-specifier. */
26559 nested_name_specifier
26570 /* Outside of a class-specifier, there must be a
26571 nested-name-specifier. Except in C++17 mode, where we
26572 might be declaring a guiding declaration. */
26579 /* If we have a class scope, this is easy; DR 147 says that S::S always
26580 names the constructor, and no other qualified name could. */
26583 {
26593 }
26594 /* If we still think that this might be a constructor-declarator,
26595 look for a class-name. */
26597 {
26598 /* If we have:
26600 template <typename T> struct S {
26601 S();
26602 };
26604 we must recognize that the nested `S' names a class. */
26608 tree type_decl;
26612 none_type,
26619 {
26625 none_type,
26630 else
26632 }
26634 /* If there was no class-name, then this is not a constructor.
26635 Otherwise, if we are in a class-specifier and we aren't
26636 handling a friend declaration, check that its type matches
26637 current_class_type (c++/38313). Note: error_mark_node
26638 is left alone for error recovery purposes. */
26640 && (outside_class_specifier_p
26646 /* If we're still considering a constructor, we have to see a `(',
26647 to begin the parameter-declaration-clause, followed by either a
26648 `)', an `...', or a decl-specifier. We need to check for a
26649 type-specifier to avoid being fooled into thinking that:
26651 S (f) (int);
26653 is a constructor. (It is actually a function named `f' that
26654 takes one parameter (of type `int') and returns a value of type
26655 `S'. */
26663 /* A parameter declaration begins with a decl-specifier,
26664 which is either the "attribute" keyword, a storage class
26665 specifier, or (usually) a type-specifier. */
26667 {
26668 tree type;
26672 /* Names appearing in the type-specifier should be looked up
26673 in the scope of the class. */
26677 {
26680 {
26684 {
26687 }
26688 }
26690 }
26692 /* Inside the constructor parameter list, surrounding
26693 template-parameter-lists do not apply. */
26694 saved_num_template_parameter_lists
26698 /* Look for the type-specifier. */
26700 CP_PARSER_FLAGS_NONE,
26706 parser->num_template_parameter_lists
26709 /* Leave the scope of the class. */
26714 }
26715 }
26717 /* We did not really want to consume any tokens. */
26721 }
26723 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26724 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26725 they must be performed once we are in the scope of the function.
26727 Returns the function defined. */
26729 static tree
26730 cp_parser_function_definition_from_specifiers_and_declarator
26733 tree attributes,
26735 {
26736 tree fn;
26739 /* Begin the function-definition. */
26742 /* The things we're about to see are not directly qualified by any
26743 template headers we've seen thus far. */
26746 /* If there were names looked up in the decl-specifier-seq that we
26747 did not check, check them now. We must wait until we are in the
26748 scope of the function to perform the checks, since the function
26749 might be a friend. */
26753 {
26758 }
26761 {
26762 /* Skip the entire function. */
26765 }
26767 {
26768 /* Seen already, skip it. An error message has already been output. */
26772 /* If this is a function from a class, pop the nested class. */
26775 }
26776 else
26777 {
26778 timevar_id_t tv;
26781 else
26787 }
26790 }
26792 /* Parse the part of a function-definition that follows the
26793 declarator. INLINE_P is TRUE iff this function is an inline
26794 function defined within a class-specifier.
26796 Returns the function defined. */
26798 static tree
26801 {
26802 tree fn;
26807 bool fully_implicit_function_template_p
26810 tree implicit_template_parms
26813 cp_binding_level* implicit_template_scope
26819 /* If the next token is `return', then the code may be trying to
26820 make use of the "named return value" extension that G++ used to
26821 support. */
26824 {
26825 /* Consume the `return' keyword. */
26827 /* Look for the identifier that indicates what value is to be
26828 returned. */
26830 /* Issue an error message. */
26833 /* Skip tokens until we reach the start of the function body. */
26835 {
26842 }
26843 }
26844 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26845 anything declared inside `f'. */
26846 saved_in_unbraced_linkage_specification_p
26849 /* Inside the function, surrounding template-parameter-lists do not
26850 apply. */
26851 saved_num_template_parameter_lists
26855 /* If the next token is `try', `__transaction_atomic', or
26856 `__transaction_relaxed`, then we are looking at either function-try-block
26857 or function-transaction-block. Note that all of these include the
26858 function-body. */
26862 RID_TRANSACTION_RELAXED))
26866 else
26867 cp_parser_ctor_initializer_opt_and_function_body
26870 /* Finish the function. */
26872 /* Generate code for it, if necessary. */
26874 /* Restore the saved values. */
26875 parser->in_unbraced_linkage_specification_p
26877 parser->num_template_parameter_lists
26881 parser->fully_implicit_function_template_p
26883 parser->implicit_template_parms
26885 parser->implicit_template_scope
26892 }
26894 /* Parse a template-declaration body (following argument list). */
26896 static void
26898 tree parameter_list,
26900 {
26904 /* We just processed one more parameter list. */
26907 /* Get the deferred access checks from the parameter list. These
26908 will be checked once we know what is being declared, as for a
26909 member template the checks must be performed in the scope of the
26910 class containing the member. */
26913 /* Tentatively parse for a new template parameter list, which can either be
26914 the template keyword or a template introduction. */
26920 else
26921 {
26922 /* There are no access checks when parsing a template, as we do not
26923 know if a specialization will be a friend. */
26927 checks,
26928 member_p,
26933 /* If this is a member template declaration, let the front
26934 end know. */
26936 {
26941 }
26946 }
26947 /* We are done with the current parameter list. */
26952 /* Finish up. */
26955 /* Check the template arguments for a literal operator template. */
26959 {
26963 else
26964 {
26967 {
26973 }
26975 {
26984 }
26985 else
26987 }
26989 {
26992 " Expected non-type template argument pack <char...>"
26994 decl);
26995 else
26998 decl);
26999 }
27000 }
27002 /* Register member declarations. */
27005 /* If DECL is a function template, we must return to parse it later.
27006 (Even though there is no definition, there might be default
27007 arguments that need handling.) */
27011 }
27013 /* Parse a template introduction header for a template-declaration. Returns
27014 false if tentative parse fails. */
27016 static bool
27018 {
27025 /* Look for the optional `::' operator. */
27028 /* Look for the nested-name-specifier. */
27038 /* Look up the concept for which we will be matching
27039 template parameters. */
27049 /* Look for opening brace for introduction. */
27050 matching_braces braces;
27058 /* Build vector of placeholder parameters and grab
27059 matching identifiers. */
27062 /* The introduction-list shall not be empty. */
27065 {
27068 }
27070 /* Look for closing brace for introduction. */
27075 {
27079 }
27081 /* Build and associate the constraint. */
27084 {
27086 member_p);
27088 }
27092 }
27094 /* Parse a normal template-declaration following the template keyword. */
27096 static void
27098 {
27099 tree parameter_list;
27103 /* Look for the `<' token. */
27107 {
27108 /* 14.5.2.2 [temp.mem]
27110 A local class shall not have member templates. */
27115 }
27116 /* [temp]
27118 A template ... shall not have C linkage. */
27120 {
27123 /* Give it C++ linkage to avoid confusing other parts of the
27124 front end. */
27127 }
27128 else
27131 /* We cannot perform access checks on the template parameter
27132 declarations until we know what is being declared, just as we
27133 cannot check the decl-specifier list. */
27136 /* If the next token is `>', then we have an invalid
27137 specialization. Rather than complain about an invalid template
27138 parameter, issue an error message here. */
27140 {
27144 }
27145 else
27146 {
27147 /* Parse the template parameters. */
27149 }
27151 /* Look for the `>'. */
27154 /* Manage template requirements */
27156 {
27161 }
27164 member_p);
27166 /* For the erroneous case of a template with C linkage, we pushed an
27167 implicit C++ linkage scope; exit that scope now. */
27170 }
27172 /* Parse a template-declaration, assuming that the `export' (and
27173 `extern') keywords, if present, has already been scanned. MEMBER_P
27174 is as for cp_parser_template_declaration. */
27176 static bool
27178 {
27180 {
27184 }
27189 }
27191 /* Perform the deferred access checks from a template-parameter-list.
27192 CHECKS is a TREE_LIST of access checks, as returned by
27193 get_deferred_access_checks. */
27195 static void
27196 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27197 {
27201 }
27203 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27204 `function-definition' sequence that follows a template header.
27205 If MEMBER_P is true, this declaration appears in a class scope.
27207 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27208 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27210 static tree
27216 {
27219 cp_decl_specifier_seq decl_specifiers;
27223 /* This function is only used when processing a template
27224 declaration. */
27228 /* Defer access checks until we know what is being declared. */
27231 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27232 alternative. */
27235 CP_PARSER_FLAGS_OPTIONAL,
27241 /* There are no template typedefs. */
27243 {
27247 }
27249 /* Gather up the access checks that occurred the
27250 decl-specifier-seq. */
27253 /* Check for the declaration of a template class. */
27255 {
27258 {
27259 // If this is a declaration, but not a definition, associate
27260 // any constraints with the type declaration. Constraints
27261 // are associated with definitions in cp_parser_class_specifier.
27267 /* In this case:
27269 struct C {
27270 friend template <typename T> struct A<T>::B;
27271 };
27273 A<T>::B will be represented by a TYPENAME_TYPE, and
27274 therefore not recognized by shadow_tag. */
27276 && !decl
27283 else
27286 /* Perform access checks for template parameters. */
27289 /* Give a helpful diagnostic for
27290 template <class T> struct A { } a;
27291 if we aren't already recovering from an error. */
27294 {
27296 "a class template declaration must not declare "
27300 }
27301 }
27302 }
27304 /* Complain about missing 'typename' or other invalid type names. */
27307 {
27308 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27309 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27310 the rest of this declaration. */
27313 }
27315 /* If it's not a template class, try for a template function. If
27316 the next token is a `;', then this declaration does not declare
27317 anything. But, if there were errors in the decl-specifiers, then
27318 the error might well have come from an attempted class-specifier.
27319 In that case, there's no need to warn about a missing declarator. */
27323 {
27326 checks,
27328 member_p,
27329 declares_class_or_enum,
27333 /* 7.1.1-1 [dcl.stc]
27335 A storage-class-specifier shall not be specified in an explicit
27336 specialization... */
27338 && explicit_specialization_p
27340 {
27344 }
27348 }
27350 /* Look for a trailing `;' after the declaration. */
27356 out:
27359 /* Clear any current qualification; whatever comes next is the start
27360 of something new. */
27366 }
27368 /* Parse a cast-expression that is not the operand of a unary "&". */
27370 static cp_expr
27372 {
27375 }
27377 /* Parse a functional cast to TYPE. Returns an expression
27378 representing the cast. */
27380 static cp_expr
27382 {
27384 tree expression_list;
27385 cp_expr cast;
27394 {
27404 /* Create a location of the form:
27405 type_name{i, f}
27406 ^~~~~~~~~~~~~~~
27407 with caret == start at the start of the type name,
27408 finishing at the closing brace. */
27409 location_t finish_loc
27412 finish_loc);
27415 }
27424 else
27425 {
27428 }
27431 tf_warning_or_error);
27432 /* [expr.const]/1: In an integral constant expression "only type
27433 conversions to integral or enumeration type can be used". */
27439 NIC_CONSTRUCTOR))
27442 /* Create a location of the form:
27443 float(i)
27444 ^~~~~~~~
27445 with caret == start at the start of the type name,
27446 finishing at the closing paren. */
27447 location_t finish_loc
27452 }
27454 /* Save the tokens that make up the body of a member function defined
27455 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27456 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27457 specifiers applied to the declaration. Returns the FUNCTION_DECL
27458 for the member function. */
27460 static tree
27464 tree attributes)
27465 {
27468 tree fn;
27471 /* Create the FUNCTION_DECL. */
27475 /* If something went badly wrong, bail out now. */
27477 {
27478 /* If there's a function-body, skip it. */
27483 }
27485 /* Remember it, if there default args to post process. */
27488 /* Save away the tokens that make up the body of the
27489 function. */
27495 RID_TRANSACTION_ATOMIC))
27496 {
27498 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27505 {
27511 }
27512 else
27515 {
27519 }
27520 }
27522 /* Handle function try blocks. */
27524 {
27527 }
27528 /* We can have braced-init-list mem-initializers before the fn body. */
27530 {
27533 {
27534 /* cache_group will stop after an un-nested { } pair, too. */
27538 /* variadic mem-inits have ... after the ')'. */
27541 }
27542 }
27544 /* Handle function try blocks. */
27550 /* Save away the inline definition; we will process it when the
27551 class is complete. */
27555 /* We need to know that this was defined in the class, so that
27556 friend templates are handled correctly. */
27559 /* Add FN to the queue of functions to be parsed later. */
27563 }
27565 /* Save the tokens that make up the in-class initializer for a non-static
27566 data member. Returns a DEFAULT_ARG. */
27568 static tree
27570 {
27572 }
27574 /* Parse a template-argument-list, as well as the trailing ">" (but
27575 not the opening "<"). See cp_parser_template_argument_list for the
27576 return value. */
27578 static tree
27580 {
27581 tree arguments;
27582 tree saved_scope;
27583 tree saved_qualifying_scope;
27584 tree saved_object_scope;
27589 /* [temp.names]
27591 When parsing a template-id, the first non-nested `>' is taken as
27592 the end of the template-argument-list rather than a greater-than
27593 operator. */
27594 saved_greater_than_is_operator_p
27597 /* Parsing the argument list may modify SCOPE, so we save it
27598 here. */
27602 /* We need to evaluate the template arguments, even though this
27603 template-id may be nested within a "sizeof". */
27608 /* Parse the template-argument-list itself. */
27612 else
27614 /* Look for the `>' that ends the template-argument-list. If we find
27615 a '>>' instead, it's probably just a typo. */
27617 {
27619 {
27620 /* In C++0x, a `>>' in a template argument list or cast
27621 expression is considered to be two separate `>'
27622 tokens. So, change the current token to a `>', but don't
27623 consume it: it will be consumed later when the outer
27624 template argument list (or cast expression) is parsed.
27625 Note that this replacement of `>' for `>>' is necessary
27626 even if we are parsing tentatively: in the tentative
27627 case, after calling
27628 cp_parser_enclosed_template_argument_list we will always
27629 throw away all of the template arguments and the first
27630 closing `>', either because the template argument list
27631 was erroneous or because we are replacing those tokens
27632 with a CPP_TEMPLATE_ID token. The second `>' (which will
27633 not have been thrown away) is needed either to close an
27634 outer template argument list or to complete a new-style
27635 cast. */
27638 }
27640 {
27641 /* If we're in a nested template argument list, the '>>' has
27642 to be a typo for '> >'. We emit the error message, but we
27643 continue parsing and we push a '>' as next token, so that
27644 the argument list will be parsed correctly. Note that the
27645 global source location is still on the token before the
27646 '>>', so we need to say explicitly where we want it. */
27654 }
27655 else
27656 {
27657 /* If this is not a nested template argument list, the '>>'
27658 is a typo for '>'. Emit an error message and continue.
27659 Same deal about the token location, but here we can get it
27660 right by consuming the '>>' before issuing the diagnostic. */
27663 "spurious %<>>%>, use %<>%> to terminate "
27665 }
27666 }
27667 else
27669 /* The `>' token might be a greater-than operator again now. */
27670 parser->greater_than_is_operator_p
27672 /* Restore the SAVED_SCOPE. */
27680 }
27682 /* MEMBER_FUNCTION is a member function, or a friend. If default
27683 arguments, or the body of the function have not yet been parsed,
27684 parse them now. */
27686 static void
27688 {
27690 /* If this member is a template, get the underlying
27691 FUNCTION_DECL. */
27695 /* There should not be any class definitions in progress at this
27696 point; the bodies of members are only parsed outside of all class
27697 definitions. */
27699 /* While we're parsing the member functions we might encounter more
27700 classes. We want to handle them right away, but we don't want
27701 them getting mixed up with functions that are currently in the
27702 queue. */
27705 /* Make sure that any template parameters are in scope. */
27708 /* If the body of the function has not yet been parsed, parse it
27709 now. */
27711 {
27712 tree function_scope;
27715 /* The function is no longer pending; we are processing it. */
27720 /* If this is a local class, enter the scope of the containing
27721 function. */
27726 /* Push the body of the function onto the lexer stack. */
27729 /* Let the front end know that we going to be defining this
27730 function. */
27734 /* Don't do access checking if it is a templated function. */
27738 /* #pragma omp declare reduction needs special parsing. */
27740 {
27745 }
27746 else
27747 /* Now, parse the body of the function. */
27754 /* Leave the scope of the containing function. */
27758 }
27760 /* Remove any template parameters from the symbol table. */
27763 /* Restore the queue. */
27766 }
27768 /* If DECL contains any default args, remember it on the unparsed
27769 functions queue. */
27771 static void
27773 {
27774 tree probe;
27777 probe;
27780 {
27784 }
27785 }
27787 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27788 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27789 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27790 from the parameter-type-list. */
27792 static tree
27795 {
27797 tree parsed_arg;
27803 /* Push the saved tokens for the default argument onto the parser's
27804 lexer stack. */
27810 /* Parse the default argument. */
27821 {
27822 /* In a non-template class, check conversions now. In a template,
27823 we'll wait and instantiate these as needed. */
27826 tf_warning_or_error);
27829 else
27831 }
27833 /* If the token stream has not been completely used up, then
27834 there was extra junk after the end of the default
27835 argument. */
27837 {
27840 else
27842 }
27844 /* Revert to the main lexer. */
27848 }
27850 /* FIELD is a non-static data member with an initializer which we saved for
27851 later; parse it now. */
27853 static void
27855 {
27856 tree def;
27863 NULL_TREE);
27869 }
27871 /* FN is a FUNCTION_DECL which may contains a parameter with an
27872 unparsed DEFAULT_ARG. Parse the default args now. This function
27873 assumes that the current scope is the scope in which the default
27874 argument should be processed. */
27876 static void
27878 {
27882 /* While we're parsing the default args, we might (due to the
27883 statement expression extension) encounter more classes. We want
27884 to handle them right away, but we don't want them getting mixed
27885 up with default args that are currently in the queue. */
27888 /* Local variable names (and the `this' keyword) may not appear
27889 in a default argument. */
27900 {
27902 tree parsed_arg;
27904 tree copy;
27911 /* This can happen for a friend declaration for a function
27912 already declared with default arguments. */
27915 parsed_arg
27917 default_arg,
27921 /* Update any instantiations we've already created. */
27925 }
27929 /* Make sure no default arg is missing. */
27932 /* Restore the state of local_variables_forbidden_p. */
27935 /* Restore the queue. */
27937 }
27939 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27941 sizeof ... ( identifier )
27943 where the 'sizeof' token has already been consumed. */
27945 static tree
27947 {
27948 /* Consume the `...'. */
27952 matching_parens parens;
27956 else
27964 /* The name is not qualified. */
27983 }
27985 /* Parse the operand of `sizeof' (or a similar operator). Returns
27986 either a TYPE or an expression, depending on the form of the
27987 input. The KEYWORD indicates which kind of expression we have
27988 encountered. */
27990 static tree
27992 {
27999 /* If it's a `...', then we are computing the length of a parameter
28000 pack. */
28005 /* Types cannot be defined in a `sizeof' expression. Save away the
28006 old message. */
28008 /* And create the new one. */
28014 /* The restrictions on constant-expressions do not apply inside
28015 sizeof expressions. */
28016 saved_integral_constant_expression_p
28018 saved_non_integral_constant_expression_p
28022 /* Do not actually evaluate the expression. */
28025 /* If it's a `(', then we might be looking at the type-id
28026 construction. */
28028 {
28031 /* We can't be sure yet whether we're looking at a type-id or an
28032 expression. */
28035 matching_parens parens;
28038 /* Note: as a GNU Extension, compound literals are considered
28039 postfix-expressions as they are in C99, so they are valid
28040 arguments to sizeof. See comment in cp_parser_cast_expression
28041 for details. */
28044 else
28045 {
28048 /* Look for the type-id. */
28050 /* Look for the closing `)'. */
28053 }
28055 /* If all went well, then we're done. */
28057 {
28058 cp_decl_specifier_seq decl_specs;
28060 /* Build a trivial decl-specifier-seq. */
28064 /* Call grokdeclarator to figure out what type this is. */
28067 TYPENAME,
28070 }
28071 }
28073 /* If the type-id production did not work out, then we must be
28074 looking at the unary-expression production. */
28078 /* Go back to evaluating expressions. */
28082 /* Free the message we created. */
28084 /* And restore the old one. */
28086 parser->integral_constant_expression_p
28088 parser->non_integral_constant_expression_p
28092 }
28094 /* If the current declaration has no declarator, return true. */
28096 static bool
28098 {
28099 /* If the next token is a `;' or a `,' then there is no
28100 declarator. */
28103 }
28105 /* Update the DECL_SPECS to reflect the storage class indicated by
28106 KEYWORD. */
28108 static void
28113 {
28114 cp_storage_class storage_class;
28117 {
28121 }
28123 {
28126 }
28131 {
28134 }
28137 {
28155 }
28159 /* A storage class specifier cannot be applied alongside a typedef
28160 specifier. If there is a typedef specifier present then set
28161 conflicting_specifiers_p which will trigger an error later
28162 on in grokdeclarator. */
28165 }
28167 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28168 is true, the type is a class or enum definition. */
28170 static void
28172 tree type_spec,
28175 {
28178 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28179 (with, for example, in "typedef int wchar_t;") we remember that
28180 this is what happened. In system headers, we ignore these
28181 declarations so that G++ can work with system headers that are not
28182 C++-safe. */
28184 && !type_definition_p
28194 {
28197 ds_redefined_builtin_type_spec,
28198 token);
28200 {
28204 }
28205 }
28208 else
28209 {
28214 }
28215 }
28217 /* True iff TOKEN is the GNU keyword __thread. */
28219 static bool
28221 {
28224 }
28226 /* Set the location for a declarator specifier and check if it is
28227 duplicated.
28229 DECL_SPECS is the sequence of declarator specifiers onto which to
28230 set the location.
28232 DS is the single declarator specifier to set which location is to
28233 be set onto the existing sequence of declarators.
28235 LOCATION is the location for the declarator specifier to
28236 consider. */
28238 static void
28241 {
28250 {
28254 }
28255 else
28256 {
28258 {
28262 else
28263 {
28266 OPT_Wlong_long,
28268 }
28269 }
28271 {
28276 else
28277 {
28281 }
28282 }
28283 else
28284 {
28300 "__complex"
28301 };
28305 }
28306 }
28307 }
28309 /* Return true iff the declarator specifier DS is present in the
28310 sequence of declarator specifiers DECL_SPECS. */
28312 bool
28314 cp_decl_spec ds)
28315 {
28322 }
28324 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28325 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28327 static bool
28329 {
28331 }
28333 /* Issue an error message indicating that TOKEN_DESC was expected.
28334 If KEYWORD is true, it indicated this function is called by
28335 cp_parser_require_keword and the required token can only be
28336 a indicated keyword.
28338 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28339 within any error as the location of an "opening" token matching
28340 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28341 RT_CLOSE_PAREN). */
28343 static void
28345 required_token token_desc,
28347 location_t matching_location)
28348 {
28354 {
28423 }
28426 {
28428 {
28506 }
28507 }
28511 }
28514 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28515 issue an error message indicating that TOKEN_DESC was expected.
28517 Returns the token consumed, if the token had the appropriate type.
28518 Otherwise, returns NULL.
28520 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28521 within any error as the location of an "opening" token matching
28522 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28523 RT_CLOSE_PAREN). */
28528 required_token token_desc,
28529 location_t matching_location)
28530 {
28533 else
28534 {
28535 /* Output the MESSAGE -- unless we're parsing tentatively. */
28538 matching_location);
28540 }
28541 }
28543 /* An error message is produced if the next token is not '>'.
28544 All further tokens are skipped until the desired token is
28545 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28547 static void
28549 {
28550 /* Current level of '< ... >'. */
28552 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28555 /* Are we ready, yet? If not, issue error message. */
28559 /* Skip tokens until the desired token is found. */
28561 {
28562 /* Peek at the next token. */
28564 {
28572 /* C++0x views the `>>' operator as two `>' tokens, but
28573 C++98 does not. */
28576 {
28577 /* We've hit a `>>' where the first `>' closes the
28578 template argument list, and the second `>' is
28579 spurious. Just consume the `>>' and stop; we've
28580 already produced at least one error. */
28583 }
28584 /* Fall through for C++0x, so we handle the second `>' in
28585 the `>>'. */
28590 {
28591 /* We've reached the token we want, consume it and stop. */
28594 }
28613 /* The '>' was probably forgotten, don't look further. */
28618 }
28620 /* Consume this token. */
28622 }
28623 }
28625 /* If the next token is the indicated keyword, consume it. Otherwise,
28626 issue an error message indicating that TOKEN_DESC was expected.
28628 Returns the token consumed, if the token had the appropriate type.
28629 Otherwise, returns NULL. */
28634 required_token token_desc)
28635 {
28639 {
28641 UNKNOWN_LOCATION);
28643 }
28646 }
28648 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28649 function-definition. */
28651 static bool
28653 {
28656 /* A ctor-initializer begins with a `:'. */
28658 /* A function-try-block begins with `try'. */
28660 /* A function-transaction-block begins with `__transaction_atomic'
28661 or `__transaction_relaxed'. */
28664 /* The named return value extension begins with `return'. */
28666 }
28668 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28669 definition. */
28671 static bool
28673 {
28680 }
28682 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28683 C++0x) ending a template-argument. */
28685 static bool
28687 {
28695 }
28697 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28698 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28700 static bool
28703 {
28709 /* Check for the sequence `<::' in the original code. It would be lexed as
28710 `[:', where `[' is a digraph, and there is no whitespace before
28711 `:'. */
28713 {
28718 }
28720 }
28722 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28723 or none_type otherwise. */
28725 static enum tag_types
28727 {
28729 {
28739 }
28740 }
28742 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28743 or none_type otherwise or if the token is null. */
28745 static enum tag_types
28747 {
28752 {
28760 }
28761 }
28763 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28765 static void
28767 {
28771 {
28775 type))
28778 }
28779 }
28781 /* Issue an error message if DECL is redeclared with different
28782 access than its original declaration [class.access.spec/3].
28783 This applies to nested classes, nested class templates and
28784 enumerations [class.mem/1]. */
28786 static void
28788 {
28799 }
28801 /* Look for the `template' keyword, as a syntactic disambiguator.
28802 Return TRUE iff it is present, in which case it will be
28803 consumed. */
28805 static bool
28807 {
28809 {
28810 /* In C++98 the `template' keyword can only be used within templates;
28811 outside templates the parser can always figure out what is a
28812 template and what is not. In C++11, per the resolution of DR 468,
28813 `template' is allowed in cases where it is not strictly necessary. */
28816 {
28819 "in C++98 %<template%> (as a disambiguator) is only "
28821 /* If this part of the token stream is rescanned, the same
28822 error message would be generated. So, we purge the token
28823 from the stream. */
28826 }
28827 else
28828 {
28829 /* Consume the `template' keyword. */
28832 }
28833 }
28835 }
28837 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28838 set PARSER->SCOPE, and perform other related actions. */
28840 static void
28842 {
28845 /* Get the stored value. */
28847 /* Set the scope from the stored value. */
28851 }
28853 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28854 encounter the end of a block before what we were looking for. */
28856 static bool
28860 {
28862 {
28865 /* Abort a parenthesized expression if we encounter a semicolon. */
28869 /* If we've reached the end of the file, stop. */
28875 /* We've hit the end of an enclosing block, so there's been some
28876 kind of syntax error. */
28879 /* Consume the token. */
28881 /* See if it starts a new group. */
28883 {
28885 /* In theory this should probably check end == '}', but
28886 cp_parser_save_member_function_body needs it to exit
28887 after either '}' or ')' when called with ')'. */
28890 }
28892 {
28896 }
28901 }
28902 }
28904 /* Like above, for caching a default argument or NSDMI. Both of these are
28905 terminated by a non-nested comma, but it can be unclear whether or not a
28906 comma is nested in a template argument list unless we do more parsing.
28907 In order to handle this ambiguity, when we encounter a ',' after a '<'
28908 we try to parse what follows as a parameter-declaration-list (in the
28909 case of a default argument) or a member-declarator (in the case of an
28910 NSDMI). If that succeeds, then we stop caching. */
28912 static tree
28914 {
28919 tree default_argument;
28921 /* Add tokens until we have processed the entire default
28922 argument. We add the range [first_token, token). */
28925 {
28926 /* For list-initialization, this is straightforward. */
28929 }
28931 {
28934 /* Peek at the next token. */
28936 /* What we do depends on what token we have. */
28938 {
28939 /* In valid code, a default argument must be
28940 immediately followed by a `,' `)', or `...'. */
28943 {
28944 /* If we've seen a '<', we might be in a
28945 template-argument-list. Until Core issue 325 is
28946 resolved, we don't know how this situation ought
28947 to be handled, so try to DTRT. We check whether
28948 what comes after the comma is a valid parameter
28949 declaration list. If it is, then the comma ends
28950 the default argument; otherwise the default
28951 argument continues. */
28955 /* Set ITALP so cp_parser_parameter_declaration_list
28956 doesn't decide to commit to this parse. */
28963 {
28964 /* Parse declarators until we reach a non-comma or
28965 somthing that cannot be an initializer.
28966 Just checking whether we're looking at a single
28967 declarator is insufficient. Consider:
28968 int var = tuple<T,U>::x;
28969 The template parameter 'U' looks exactly like a
28970 declarator. */
28971 do
28972 {
28983 }
28985 /* If we met an '=' or ';' then the original comma
28986 was the end of the NSDMI. Otherwise assume
28987 we're still in the NSDMI. */
28990 }
28991 else
28992 {
28997 }
29004 }
29005 /* FALLTHRU */
29008 /* If we run into a non-nested `;', `}', or `]',
29009 then the code is invalid -- but the default
29010 argument is certainly over. */
29015 /* Handle correctly int n = sizeof ... ( p ); */
29018 /* Update DEPTH, if necessary. */
29033 /* This might be the comparison operator, or it might
29034 start a template argument list. */
29041 /* Fall through for C++0x, which treats the `>>'
29042 operator like two `>' tokens in certain
29043 cases. */
29048 {
29049 /* This might be an operator, or it might close a
29050 template argument list. But if a previous '<'
29051 started a template argument list, this will have
29052 closed it, so we can't be in one anymore. */
29056 }
29059 /* If we run out of tokens, issue an error message. */
29067 /* In these cases, we should look for template-ids.
29068 For example, if the default argument is
29069 `X<int, double>()', we need to do name lookup to
29070 figure out whether or not `X' is a template; if
29071 so, the `,' does not end the default argument.
29073 That is not yet done. */
29078 }
29080 /* If we've reached the end, stop. */
29084 /* Add the token to the token block. */
29086 }
29088 /* Create a DEFAULT_ARG to represent the unparsed default
29089 argument. */
29096 }
29098 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29100 location_t
29102 {
29107 }
29109 /* Begin parsing tentatively. We always save tokens while parsing
29110 tentatively so that if the tentative parsing fails we can restore the
29111 tokens. */
29113 static void
29115 {
29116 /* Enter a new parsing context. */
29118 /* Begin saving tokens. */
29120 /* In order to avoid repetitive access control error messages,
29121 access checks are queued up until we are no longer parsing
29122 tentatively. */
29124 }
29126 /* Commit to the currently active tentative parse. */
29128 static void
29130 {
29134 /* Mark all of the levels as committed. */
29137 {
29144 }
29145 }
29147 /* Commit to the topmost currently active tentative parse.
29149 Note that this function shouldn't be called when there are
29150 irreversible side-effects while in a tentative state. For
29151 example, we shouldn't create a permanent entry in the symbol
29152 table, or issue an error message that might not apply if the
29153 tentative parse is aborted. */
29155 static void
29157 {
29162 {
29170 }
29171 }
29173 /* Abort the currently active tentative parse. All consumed tokens
29174 will be rolled back, and no diagnostics will be issued. */
29176 static void
29178 {
29182 /* Now, pretend that we want to see if the construct was
29183 successfully parsed. */
29185 }
29187 /* Stop parsing tentatively. If a parse error has occurred, restore the
29188 token stream. Otherwise, commit to the tokens we have consumed.
29189 Returns true if no error occurred; false otherwise. */
29191 static bool
29193 {
29197 /* Remember whether or not an error occurred, since we are about to
29198 destroy that information. */
29200 /* Remove the topmost context from the stack. */
29203 /* If no parse errors occurred, commit to the tentative parse. */
29205 {
29206 /* Commit to the tokens read tentatively, unless that was
29207 already done. */
29212 }
29213 /* Otherwise, if errors occurred, roll back our state so that things
29214 are just as they were before we began the tentative parse. */
29215 else
29216 {
29219 }
29220 /* Add the context to the front of the free list. */
29225 }
29227 /* Returns true if we are parsing tentatively and are not committed to
29228 this tentative parse. */
29230 static bool
29232 {
29235 }
29237 /* Returns nonzero iff an error has occurred during the most recent
29238 tentative parse. */
29240 static bool
29242 {
29245 }
29247 /* Returns nonzero if GNU extensions are allowed. */
29249 static bool
29251 {
29253 }
29254 \f
29255 /* Objective-C++ Productions */
29258 /* Parse an Objective-C expression, which feeds into a primary-expression
29259 above.
29261 objc-expression:
29262 objc-message-expression
29263 objc-string-literal
29264 objc-encode-expression
29265 objc-protocol-expression
29266 objc-selector-expression
29268 Returns a tree representation of the expression. */
29270 static cp_expr
29272 {
29273 /* Try to figure out what kind of declaration is present. */
29277 {
29287 {
29299 }
29300 /* FALLTHRU */
29306 }
29309 }
29311 /* Parse an Objective-C message expression.
29313 objc-message-expression:
29314 [ objc-message-receiver objc-message-args ]
29316 Returns a representation of an Objective-C message. */
29318 static tree
29320 {
29332 /* Construct a location e.g.
29333 [self func1:5]
29334 ^~~~~~~~~~~~~~
29335 ranging from the '[' to the ']', with the caret at the start. */
29340 }
29342 /* Parse an objc-message-receiver.
29344 objc-message-receiver:
29345 expression
29346 simple-type-specifier
29348 Returns a representation of the type or expression. */
29350 static tree
29352 {
29353 tree rcv;
29355 /* An Objective-C message receiver may be either (1) a type
29356 or (2) an expression. */
29360 /* If that worked out, fine. */
29367 CP_PARSER_FLAGS_NONE);
29374 }
29376 /* Parse the arguments and selectors comprising an Objective-C message.
29378 objc-message-args:
29379 objc-selector
29380 objc-selector-args
29381 objc-selector-args , objc-comma-args
29383 objc-selector-args:
29384 objc-selector [opt] : assignment-expression
29385 objc-selector-args objc-selector [opt] : assignment-expression
29387 objc-comma-args:
29388 assignment-expression
29389 objc-comma-args , assignment-expression
29391 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29392 selector arguments and TREE_VALUE containing a list of comma
29393 arguments. */
29395 static tree
29397 {
29403 {
29409 /* Detect if we have a unary selector. */
29418 sel_args
29423 }
29425 /* Handle non-selector arguments, if any. */
29427 {
29428 tree arg;
29433 addl_args
29438 }
29441 {
29444 }
29447 }
29449 /* Parse an Objective-C encode expression.
29451 objc-encode-expression:
29452 @encode objc-typename
29454 Returns an encoded representation of the type argument. */
29456 static cp_expr
29458 {
29459 tree type;
29464 matching_parens parens;
29471 {
29475 }
29477 /* This happens if we find @encode(T) (where T is a template
29478 typename or something dependent on a template typename) when
29479 parsing a template. In that case, we can't compile it
29480 immediately, but we rather create an AT_ENCODE_EXPR which will
29481 need to be instantiated when the template is used.
29482 */
29484 {
29488 }
29491 /* Build a location of the form:
29492 @encode(int)
29493 ^~~~~~~~~~~~
29494 with caret==start at the @ token, finishing at the close paren. */
29495 location_t combined_loc
29500 }
29502 /* Parse an Objective-C @defs expression. */
29504 static tree
29506 {
29507 tree name;
29510 matching_parens parens;
29516 }
29518 /* Parse an Objective-C protocol expression.
29520 objc-protocol-expression:
29521 @protocol ( identifier )
29523 Returns a representation of the protocol expression. */
29525 static tree
29527 {
29528 tree proto;
29532 matching_parens parens;
29537 /* Build a location of the form:
29538 @protocol(prot)
29539 ^~~~~~~~~~~~~~~
29540 with caret==start at the @ token, finishing at the close paren. */
29541 location_t combined_loc
29547 }
29549 /* Parse an Objective-C selector expression.
29551 objc-selector-expression:
29552 @selector ( objc-method-signature )
29554 objc-method-signature:
29555 objc-selector
29556 objc-selector-seq
29558 objc-selector-seq:
29559 objc-selector :
29560 objc-selector-seq objc-selector :
29562 Returns a representation of the method selector. */
29564 static tree
29566 {
29573 matching_parens parens;
29579 {
29588 {
29589 /* Detect if we have a unary selector. */
29591 {
29594 }
29595 else
29596 {
29598 }
29599 }
29604 {
29605 sel_seq
29608 sel_seq
29611 }
29612 else
29613 sel_seq
29618 }
29620 finish_selector:
29624 /* Build a location of the form:
29625 @selector(func)
29626 ^~~~~~~~~~~~~~~
29627 with caret==start at the @ token, finishing at the close paren. */
29628 location_t combined_loc
29632 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29635 }
29637 /* Parse a list of identifiers.
29639 objc-identifier-list:
29640 identifier
29641 objc-identifier-list , identifier
29643 Returns a TREE_LIST of identifier nodes. */
29645 static tree
29647 {
29648 tree identifier;
29649 tree list;
29660 {
29667 identifier));
29669 }
29672 }
29674 /* Parse an Objective-C alias declaration.
29676 objc-alias-declaration:
29677 @compatibility_alias identifier identifier ;
29679 This function registers the alias mapping with the Objective-C front end.
29680 It returns nothing. */
29682 static void
29684 {
29692 }
29694 /* Parse an Objective-C class forward-declaration.
29696 objc-class-declaration:
29697 @class objc-identifier-list ;
29699 The function registers the forward declarations with the Objective-C
29700 front end. It returns nothing. */
29702 static void
29704 {
29707 {
29708 tree id;
29718 else
29720 }
29722 }
29724 /* Parse a list of Objective-C protocol references.
29726 objc-protocol-refs-opt:
29727 objc-protocol-refs [opt]
29729 objc-protocol-refs:
29730 < objc-identifier-list >
29732 Returns a TREE_LIST of identifiers, if any. */
29734 static tree
29736 {
29740 {
29744 }
29747 }
29749 /* Parse a Objective-C visibility specification. */
29751 static void
29753 {
29757 {
29772 }
29774 /* Eat '@private'/'@protected'/'@public'. */
29776 }
29778 /* Parse an Objective-C method type. Return 'true' if it is a class
29779 (+) method, and 'false' if it is an instance (-) method. */
29783 {
29786 else
29788 }
29790 /* Parse an Objective-C protocol qualifier. */
29792 static tree
29794 {
29807 {
29812 }
29815 }
29817 /* Parse an Objective-C typename. */
29819 static tree
29821 {
29825 {
29828 matching_parens parens;
29832 /* An ObjC type name may consist of just protocol qualifiers, in which
29833 case the type shall default to 'id'. */
29835 {
29838 /* If the type could not be parsed, an error has already
29839 been produced. For error recovery, behave as if it had
29840 not been specified, which will use the default type
29841 'id'. */
29843 {
29845 /* We need to skip to the closing parenthesis as
29846 cp_parser_type_id() does not seem to do it for
29847 us. */
29852 }
29853 }
29857 }
29860 }
29862 /* Check to see if TYPE refers to an Objective-C selector name. */
29864 static bool
29866 {
29872 }
29874 /* Parse an Objective-C selector. */
29876 static tree
29878 {
29882 {
29885 }
29887 /* C++ operator names are allowed to appear in ObjC selectors. */
29889 {
29902 }
29903 }
29905 /* Parse an Objective-C params list. */
29907 static tree
29909 {
29915 {
29925 /* Detect if we have a unary selector. */
29928 {
29931 }
29935 {
29936 /* Something went quite wrong. There should be a colon
29937 here, but there is not. Stop parsing parameters. */
29939 }
29941 /* New ObjC allows attributes on parameters too. */
29946 params
29949 type_name,
29950 identifier,
29951 parm_attr));
29954 }
29957 {
29960 }
29962 /* We allow tail attributes for the method. */
29964 {
29972 }
29975 {
29978 }
29980 }
29982 /* Parse the non-keyword Objective-C params. */
29984 static tree
29987 {
29993 {
29995 tree parm;
30001 {
30006 }
30008 /* TODO: parse attributes for tail parameters. */
30017 }
30019 /* We allow tail attributes for the method. */
30021 {
30023 {
30028 }
30029 else
30030 /* We have an error, but parse the attributes, so that we can
30031 carry on. */
30037 }
30040 }
30042 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30044 static void
30046 {
30049 /* If the next token is `extern' and the following token is a string
30050 literal, then we have a linkage specification. */
30052 && cp_parser_is_pure_string_literal
30055 /* Handle #pragma, if any. */
30058 /* Allow stray semicolons. */
30061 /* Mark methods as optional or required, when building protocols. */
30063 {
30066 }
30068 {
30071 }
30074 /* Other stray characters must generate errors. */
30076 {
30080 }
30081 /* Finally, try to parse a block-declaration, or a function-definition. */
30082 else
30084 }
30086 /* Parse a method signature. */
30088 static tree
30090 {
30106 }
30108 static bool
30110 {
30111 tree tattr;
30116 /* If the attributes are followed by a method introducer, this is not allowed.
30117 Dump the attributes and flag the situation. */
30122 /* Otherwise, the attributes introduce some interstitial code, possibly so
30123 rewind to allow that check. */
30126 }
30128 /* Parse an Objective-C method prototype list. */
30130 static void
30132 {
30136 {
30138 {
30143 else
30147 {
30151 }
30154 }
30160 OPT_Wattributes,
30162 else
30163 /* Allow for interspersed non-ObjC++ code. */
30167 }
30171 else
30175 }
30177 /* Parse an Objective-C method definition list. */
30179 static void
30181 {
30185 {
30186 tree meth;
30189 {
30195 else
30200 {
30204 }
30206 NULL_TREE);
30208 /* For historical reasons, we accept an optional semicolon. */
30215 {
30222 }
30223 }
30224 /* The following case will be removed once @synthesize is
30225 completely implemented. */
30236 else
30237 /* Allow for interspersed non-ObjC++ code. */
30241 }
30245 else
30249 }
30251 /* Parse Objective-C ivars. */
30253 static void
30255 {
30266 {
30267 cp_decl_specifier_seq declspecs;
30269 tree prefix_attributes;
30277 CP_PARSER_FLAGS_OPTIONAL,
30281 /* auto, register, static, extern, mutable. */
30283 {
30286 }
30288 /* thread_local. */
30290 {
30293 }
30295 /* typedef. */
30297 {
30300 }
30305 /* Keep going until we hit the `;' at the end of the
30306 declaration. */
30308 {
30313 /* Check for a (possibly unnamed) bitfield declaration. */
30321 {
30322 /* Get the name of the bitfield. */
30325 sfk_none);
30327 eat_colon:
30329 /* Get the width of the bitfield. */
30330 width
30332 }
30333 else
30334 {
30335 /* Parse the declarator. */
30336 declarator
30342 }
30344 /* Look for attributes that apply to the ivar. */
30346 /* Remember which attributes are prefix attributes and
30347 which are not. */
30349 /* Combine the attributes. */
30353 /* Create the bitfield declaration. */
30356 else
30361 /* Add the instance variable. */
30365 /* Reset PREFIX_ATTRIBUTES. */
30367 {
30372 }
30377 {
30380 }
30382 }
30386 }
30391 /* Do not consume the RID_AT_END, so it will be read again as terminating
30392 the @interface of @implementation. */
30396 /* For historical reasons, we accept an optional semicolon. */
30399 }
30401 /* Parse an Objective-C protocol declaration. */
30403 static void
30405 {
30411 {
30416 }
30418 /* See if we have a forward declaration or a definition. */
30421 /* Try a forward declaration first. */
30423 {
30425 {
30426 tree id;
30436 else
30438 }
30440 }
30442 /* Ok, we got a full-fledged definition (or at least should). */
30443 else
30444 {
30449 }
30450 }
30452 /* Parse an Objective-C superclass or category. */
30454 static void
30459 {
30465 {
30468 }
30470 {
30471 matching_parens parens;
30474 /* If there is no category name, and this is an @interface, we
30475 have a class extension. */
30477 {
30480 }
30481 else
30485 }
30486 }
30488 /* Parse an Objective-C class interface. */
30490 static void
30492 {
30499 {
30500 /* It's hard to recover because even if valid @interface stuff
30501 is to follow, we can't compile it (or validate it) if we
30502 don't even know which class it refers to. Let's assume this
30503 was a stray '@interface' token in the stream and skip it.
30504 */
30506 }
30511 /* We have either a class or a category on our hands. */
30514 else
30515 {
30517 /* Handle instance variable declarations, if any. */
30520 }
30523 }
30525 /* Parse an Objective-C class implementation. */
30527 static void
30529 {
30536 {
30537 /* It's hard to recover because even if valid @implementation
30538 stuff is to follow, we can't compile it (or validate it) if
30539 we don't even know which class it refers to. Let's assume
30540 this was a stray '@implementation' token in the stream and
30541 skip it.
30542 */
30544 }
30548 /* We have either a class or a category on our hands. */
30551 else
30552 {
30554 /* Handle instance variable declarations, if any. */
30557 }
30560 }
30562 /* Consume the @end token and finish off the implementation. */
30564 static void
30566 {
30569 }
30571 /* Parse an Objective-C declaration. */
30573 static void
30575 {
30576 /* Try to figure out what kind of declaration is present. */
30581 {
30597 }
30600 {
30623 }
30624 }
30626 /* Parse an Objective-C try-catch-finally statement.
30628 objc-try-catch-finally-stmt:
30629 @try compound-statement objc-catch-clause-seq [opt]
30630 objc-finally-clause [opt]
30632 objc-catch-clause-seq:
30633 objc-catch-clause objc-catch-clause-seq [opt]
30635 objc-catch-clause:
30636 @catch ( objc-exception-declaration ) compound-statement
30638 objc-finally-clause:
30639 @finally compound-statement
30641 objc-exception-declaration:
30642 parameter-declaration
30643 '...'
30645 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30647 Returns NULL_TREE.
30649 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30650 for C. Keep them in sync. */
30652 static tree
30654 {
30655 location_t location;
30656 tree stmt;
30661 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30662 node, lest it get absorbed into the surrounding block. */
30668 {
30672 matching_parens parens;
30678 {
30679 /* We have "@catch (...)" (where the '...' are literally
30680 what is in the code). Skip the '...'.
30681 parameter_declaration is set to NULL_TREE, and
30682 objc_being_catch_clauses() knows that that means
30683 '...'. */
30686 }
30687 else
30688 {
30689 /* We have "@catch (NSException *exception)" or something
30690 like that. Parse the parameter declaration. */
30694 else
30699 }
30702 else
30703 {
30704 /* If there was no open parenthesis, we are recovering from
30705 an error, and we are trying to figure out what mistake
30706 the user has made. */
30708 /* If there is an immediate closing parenthesis, the user
30709 probably forgot the opening one (ie, they typed "@catch
30710 NSException *e)". Parse the closing parenthesis and keep
30711 going. */
30715 /* If these is no immediate closing parenthesis, the user
30716 probably doesn't know that parenthesis are required at
30717 all (ie, they typed "@catch NSException *e"). So, just
30718 forget about the closing parenthesis and keep going. */
30719 }
30723 }
30725 {
30728 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30729 node, lest it get absorbed into the surrounding block. */
30733 }
30736 }
30738 /* Parse an Objective-C synchronized statement.
30740 objc-synchronized-stmt:
30741 @synchronized ( expression ) compound-statement
30743 Returns NULL_TREE. */
30745 static tree
30747 {
30748 location_t location;
30755 matching_parens parens;
30760 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30761 node, lest it get absorbed into the surrounding block. */
30766 }
30768 /* Parse an Objective-C throw statement.
30770 objc-throw-stmt:
30771 @throw assignment-expression [opt] ;
30773 Returns a constructed '@throw' statement. */
30775 static tree
30777 {
30789 }
30791 /* Parse an Objective-C statement. */
30793 static tree
30795 {
30796 /* Try to figure out what kind of declaration is present. */
30800 {
30811 }
30814 }
30816 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30817 look ahead to see if an objc keyword follows the attributes. This
30818 is to detect the use of prefix attributes on ObjC @interface and
30819 @protocol. */
30821 static bool
30823 {
30828 {
30831 }
30834 }
30836 /* This routine is a minimal replacement for
30837 c_parser_struct_declaration () used when parsing the list of
30838 types/names or ObjC++ properties. For example, when parsing the
30839 code
30841 @property (readonly) int a, b, c;
30843 this function is responsible for parsing "int a, int b, int c" and
30844 returning the declarations as CHAIN of DECLs.
30846 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30847 similar parsing. */
30848 static tree
30850 {
30852 cp_decl_specifier_seq declspecs;
30854 tree prefix_attributes;
30857 CP_PARSER_FLAGS_NONE,
30864 /* auto, register, static, extern, mutable. */
30866 {
30869 }
30871 /* thread_local. */
30873 {
30876 }
30878 /* typedef. */
30880 {
30883 }
30888 /* Keep going until we hit the `;' at the end of the declaration. */
30890 {
30895 /* Parse the declarator. */
30899 /* Look for attributes that apply to the ivar. */
30901 /* Remember which attributes are prefix attributes and
30902 which are not. */
30904 /* Combine the attributes. */
30914 /* Reset PREFIX_ATTRIBUTES. */
30916 {
30921 }
30928 {
30931 }
30932 else
30934 }
30936 }
30938 /* Parse an Objective-C @property declaration. The syntax is:
30940 objc-property-declaration:
30941 '@property' objc-property-attributes[opt] struct-declaration ;
30943 objc-property-attributes:
30944 '(' objc-property-attribute-list ')'
30946 objc-property-attribute-list:
30947 objc-property-attribute
30948 objc-property-attribute-list, objc-property-attribute
30950 objc-property-attribute
30951 'getter' = identifier
30952 'setter' = identifier
30953 'readonly'
30954 'readwrite'
30955 'assign'
30956 'retain'
30957 'copy'
30958 'nonatomic'
30960 For example:
30961 @property NSString *name;
30962 @property (readonly) id object;
30963 @property (retain, nonatomic, getter=getTheName) id name;
30964 @property int a, b, c;
30966 PS: This function is identical to
30967 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30968 static void
30970 {
30971 /* The following variables hold the attributes of the properties as
30972 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30973 seen. When we see an attribute, we set them to 'true' (if they
30974 are boolean properties) or to the identifier (if they have an
30975 argument, ie, for getter and setter). Note that here we only
30976 parse the list of attributes, check the syntax and accumulate the
30977 attributes that we find. objc_add_property_declaration() will
30978 then process the information. */
30988 /* 'properties' is the list of properties that we read. Usually a
30989 single one, but maybe more (eg, in "@property int a, b, c;" there
30990 are three). */
30991 tree properties;
30992 location_t loc;
30998 /* Parse the optional attribute list... */
31000 {
31001 /* Eat the '('. */
31002 matching_parens parens;
31006 {
31012 {
31015 }
31019 {
31030 {
31034 else
31039 }
31042 {
31046 }
31048 {
31050 {
31053 }
31054 else
31058 else
31060 }
31061 else
31062 {
31064 {
31067 }
31068 else
31070 }
31076 }
31083 else
31085 }
31087 /* FIXME: "@property (setter, assign);" will generate a spurious
31088 "error: expected ‘)’ before ‘,’ token". This is because
31089 cp_parser_require, unlike the C counterpart, will produce an
31090 error even if we are in error recovery. */
31092 {
31097 }
31098 }
31100 /* ... and the property declaration(s). */
31104 {
31106 /* If the next token is now a `;', consume it. */
31110 }
31114 else
31115 {
31116 /* Comma-separated properties are chained together in
31117 reverse order; add them one by one. */
31126 }
31129 }
31131 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31133 objc-synthesize-declaration:
31134 @synthesize objc-synthesize-identifier-list ;
31136 objc-synthesize-identifier-list:
31137 objc-synthesize-identifier
31138 objc-synthesize-identifier-list, objc-synthesize-identifier
31140 objc-synthesize-identifier
31141 identifier
31142 identifier = identifier
31144 For example:
31145 @synthesize MyProperty;
31146 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31148 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31149 for C. Keep them in sync.
31150 */
31151 static void
31153 {
31155 location_t loc;
31160 {
31164 {
31167 }
31169 {
31173 {
31176 }
31177 }
31178 else
31183 else
31185 }
31188 }
31190 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31192 objc-dynamic-declaration:
31193 @dynamic identifier-list ;
31195 For example:
31196 @dynamic MyProperty;
31197 @dynamic MyProperty, AnotherProperty;
31199 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31200 for C. Keep them in sync.
31201 */
31202 static void
31204 {
31206 location_t loc;
31211 {
31212 tree property;
31215 {
31218 }
31222 else
31224 }
31227 }
31229 \f
31230 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31232 /* Returns name of the next clause.
31233 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31234 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31235 returned and the token is consumed. */
31237 static pragma_omp_clause
31239 {
31255 {
31260 {
31437 }
31438 }
31444 }
31446 /* Validate that a clause of the given type does not already exist. */
31448 static void
31451 {
31452 tree c;
31456 {
31459 }
31460 }
31462 /* OpenMP 2.5:
31463 variable-list:
31464 identifier
31465 variable-list , identifier
31467 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31468 colon). An opening parenthesis will have been consumed by the caller.
31470 If KIND is nonzero, create the appropriate node and install the decl
31471 in OMP_CLAUSE_DECL and add the node to the head of the list.
31473 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31474 return the list created.
31476 COLON can be NULL if only closing parenthesis should end the list,
31477 or pointer to bool which will receive false if the list is terminated
31478 by closing parenthesis or true if the list is terminated by colon. */
31480 static tree
31483 {
31487 {
31490 }
31492 {
31497 && current_class_ptr
31499 {
31505 }
31506 else
31507 {
31518 else
31523 }
31525 ;
31527 {
31529 {
31531 /* The OpenACC cache directive explicitly only allows "array
31532 elements or subarrays". */
31534 {
31538 }
31539 /* FALLTHROUGH. */
31544 {
31545 location_t loc
31550 decl
31554 }
31555 /* FALLTHROUGH. */
31559 {
31567 parser->colon_corrects_to_scope_p
31571 else
31572 {
31573 /* Look for `:'. */
31577 CPP_CLOSE_SQUARE))
31579 }
31580 /* Look for the closing `]'. */
31582 RT_CLOSE_SQUARE))
31586 }
31590 }
31596 }
31597 else
31600 get_comma:
31604 }
31610 {
31614 }
31617 {
31620 /* Try to resync to an unnested comma. Copied from
31621 cp_parser_parenthesized_expression_list. */
31622 skip_comma:
31631 }
31634 }
31636 /* Similarly, but expect leading and trailing parenthesis. This is a very
31637 common case for omp clauses. */
31639 static tree
31641 {
31645 }
31647 /* OpenACC 2.0:
31648 copy ( variable-list )
31649 copyin ( variable-list )
31650 copyout ( variable-list )
31651 create ( variable-list )
31652 delete ( variable-list )
31653 present ( variable-list )
31654 present_or_copy ( variable-list )
31655 pcopy ( variable-list )
31656 present_or_copyin ( variable-list )
31657 pcopyin ( variable-list )
31658 present_or_copyout ( variable-list )
31659 pcopyout ( variable-list )
31660 present_or_create ( variable-list )
31661 pcreate ( variable-list ) */
31663 static tree
31665 tree list)
31666 {
31669 {
31715 }
31723 }
31725 /* OpenACC 2.0:
31726 deviceptr ( variable-list ) */
31728 static tree
31730 {
31734 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31735 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31736 variable-list must only allow for pointer variables. */
31739 {
31746 }
31749 }
31751 /* OpenACC 2.0:
31752 auto
31753 independent
31754 nohost
31755 seq */
31757 static tree
31761 {
31766 }
31768 /* OpenACC:
31769 num_gangs ( expression )
31770 num_workers ( expression )
31771 vector_length ( expression ) */
31773 static tree
31776 {
31779 matching_parens parens;
31787 {
31792 }
31800 }
31802 /* OpenACC:
31804 gang [( gang-arg-list )]
31805 worker [( [num:] int-expr )]
31806 vector [( [length:] int-expr )]
31808 where gang-arg is one of:
31810 [num:] int-expr
31811 static: size-expr
31813 and size-expr may be:
31815 *
31816 int-expr
31817 */
31819 static tree
31822 {
31832 {
31833 matching_parens parens;
31836 do
31837 {
31841 /* Gang static argument. */
31844 {
31852 {
31855 }
31857 /* Check for the '*' argument. */
31861 CPP_CLOSE_PAREN)))
31862 {
31867 {
31870 }
31872 }
31873 }
31874 /* Worker num: argument and vector length: arguments. */
31878 {
31881 }
31883 /* Now collect the actual argument. */
31885 {
31888 }
31900 {
31903 }
31905 }
31910 }
31924 cleanup_error:
31927 }
31929 /* OpenACC 2.0:
31930 tile ( size-expr-list ) */
31932 static tree
31934 {
31938 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31939 so, but the spec authors never considered such a case and have
31940 differing opinions on what it might mean, including 'not
31941 allowed'.) */
31944 clause_loc);
31949 do
31950 {
31957 {
31960 }
31961 else
31965 }
31968 /* Consume the trailing ')'. */
31976 }
31978 /* OpenACC 2.0
31979 Parse wait clause or directive parameters. */
31981 static tree
31983 {
31993 {
31998 }
32005 {
32009 {
32012 else
32013 {
32020 }
32021 }
32022 }
32025 }
32027 /* OpenACC:
32028 wait ( int-expr-list ) */
32030 static tree
32032 {
32041 }
32043 /* OpenMP 3.0:
32044 collapse ( constant-expression ) */
32046 static tree
32048 {
32050 location_t loc;
32051 HOST_WIDE_INT n;
32054 matching_parens parens;
32072 {
32075 }
32084 }
32086 /* OpenMP 2.5:
32087 default ( none | shared )
32089 OpenACC:
32090 default ( none | present ) */
32092 static tree
32095 {
32097 tree c;
32099 matching_parens parens;
32103 {
32108 {
32129 }
32132 }
32133 else
32134 {
32135 invalid_kind:
32138 else
32140 }
32157 }
32159 /* OpenMP 3.1:
32160 final ( expression ) */
32162 static tree
32164 {
32167 matching_parens parens;
32186 }
32188 /* OpenMP 2.5:
32189 if ( expression )
32191 OpenMP 4.5:
32192 if ( directive-name-modifier : expression )
32194 directive-name-modifier:
32195 parallel | task | taskloop | target data | target | target update
32196 | target enter data | target exit data */
32198 static tree
32201 {
32205 matching_parens parens;
32210 {
32222 {
32225 {
32238 else
32239 {
32240 location_t loc
32245 }
32248 {
32250 {
32255 }
32257 {
32258 location_t loc
32262 }
32263 }
32264 }
32265 }
32267 {
32269 {
32272 }
32273 else
32274 {
32276 {
32277 location_t loc
32280 }
32282 }
32283 }
32284 }
32296 {
32299 {
32302 {
32312 }
32314 p);
32316 }
32318 {
32321 else
32324 }
32327 {
32331 }
32332 }
32340 }
32342 /* OpenMP 3.1:
32343 mergeable */
32345 static tree
32348 {
32349 tree c;
32352 location);
32357 }
32359 /* OpenMP 2.5:
32360 nowait */
32362 static tree
32365 {
32366 tree c;
32373 }
32375 /* OpenMP 2.5:
32376 num_threads ( expression ) */
32378 static tree
32380 location_t location)
32381 {
32384 matching_parens parens;
32404 }
32406 /* OpenMP 4.5:
32407 num_tasks ( expression ) */
32409 static tree
32411 location_t location)
32412 {
32415 matching_parens parens;
32435 }
32437 /* OpenMP 4.5:
32438 grainsize ( expression ) */
32440 static tree
32442 location_t location)
32443 {
32446 matching_parens parens;
32466 }
32468 /* OpenMP 4.5:
32469 priority ( expression ) */
32471 static tree
32473 location_t location)
32474 {
32477 matching_parens parens;
32497 }
32499 /* OpenMP 4.5:
32500 hint ( expression ) */
32502 static tree
32504 location_t location)
32505 {
32508 matching_parens parens;
32527 }
32529 /* OpenMP 4.5:
32530 defaultmap ( tofrom : scalar ) */
32532 static tree
32534 location_t location)
32535 {
32539 matching_parens parens;
32544 {
32547 }
32551 {
32554 }
32560 {
32563 }
32567 {
32570 }
32576 location);
32582 out_err:
32587 }
32589 /* OpenMP 2.5:
32590 ordered
32592 OpenMP 4.5:
32593 ordered ( constant-expression ) */
32595 static tree
32598 {
32600 HOST_WIDE_INT n;
32606 {
32607 matching_parens parens;
32624 {
32626 "ordered argument needs positive constant integer "
32629 }
32630 }
32636 }
32638 /* OpenMP 2.5:
32639 reduction ( reduction-operator : variable-list )
32641 reduction-operator:
32642 One of: + * - & ^ | && ||
32644 OpenMP 3.1:
32646 reduction-operator:
32647 One of: + * - & ^ | && || min max
32649 OpenMP 4.0:
32651 reduction-operator:
32652 One of: + * - & ^ | && ||
32653 id-expression */
32655 static tree
32657 {
32665 {
32675 }
32679 else
32680 {
32691 {
32721 }
32722 else
32723 {
32725 resync_fail:
32730 }
32731 }
32737 NULL);
32739 {
32742 }
32745 }
32747 /* OpenMP 2.5:
32748 schedule ( schedule-kind )
32749 schedule ( schedule-kind , expression )
32751 schedule-kind:
32752 static | dynamic | guided | runtime | auto
32754 OpenMP 4.5:
32755 schedule ( schedule-modifier : schedule-kind )
32756 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32758 schedule-modifier:
32759 simd
32760 monotonic
32761 nonmonotonic */
32763 static tree
32765 {
32769 matching_parens parens;
32776 {
32785 else
32791 else
32792 {
32795 }
32796 }
32799 {
32804 {
32825 }
32826 }
32831 else
32837 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32839 {
32843 }
32846 {
32861 else
32866 }
32878 invalid_kind:
32880 resync_fail:
32885 }
32887 /* OpenMP 3.0:
32888 untied */
32890 static tree
32893 {
32894 tree c;
32901 }
32903 /* OpenMP 4.0:
32904 inbranch
32905 notinbranch */
32907 static tree
32910 {
32915 }
32917 /* OpenMP 4.0:
32918 parallel
32919 for
32920 sections
32921 taskgroup */
32923 static tree
32927 {
32931 }
32933 /* OpenMP 4.5:
32934 nogroup */
32936 static tree
32939 {
32944 }
32946 /* OpenMP 4.5:
32947 simd
32948 threads */
32950 static tree
32954 {
32959 }
32961 /* OpenMP 4.0:
32962 num_teams ( expression ) */
32964 static tree
32966 location_t location)
32967 {
32970 matching_parens parens;
32990 }
32992 /* OpenMP 4.0:
32993 thread_limit ( expression ) */
32995 static tree
32997 location_t location)
32998 {
33001 matching_parens parens;
33021 }
33023 /* OpenMP 4.0:
33024 aligned ( variable-list )
33025 aligned ( variable-list : constant-expression ) */
33027 static tree
33029 {
33033 matching_parens parens;
33041 {
33051 }
33057 }
33059 /* OpenMP 4.0:
33060 linear ( variable-list )
33061 linear ( variable-list : expression )
33063 OpenMP 4.5:
33064 linear ( modifier ( variable-list ) )
33065 linear ( modifier ( variable-list ) : expression ) */
33067 static tree
33070 {
33075 matching_parens parens;
33080 {
33092 else
33094 }
33099 else
33100 {
33109 }
33112 {
33117 {
33128 {
33131 }
33134 }
33145 }
33148 {
33151 }
33154 }
33156 /* OpenMP 4.0:
33157 safelen ( constant-expression ) */
33159 static tree
33161 location_t location)
33162 {
33165 matching_parens parens;
33184 }
33186 /* OpenMP 4.0:
33187 simdlen ( constant-expression ) */
33189 static tree
33191 location_t location)
33192 {
33195 matching_parens parens;
33214 }
33216 /* OpenMP 4.5:
33217 vec:
33218 identifier [+/- integer]
33219 vec , identifier [+/- integer]
33220 */
33222 static tree
33224 tree list)
33225 {
33229 {
33232 }
33235 {
33242 else
33243 {
33244 t = cp_parser_lookup_name_simple
33249 id_loc);
33250 }
33256 {
33259 }
33263 {
33266 }
33270 {
33273 }
33276 add_to_vector:
33278 {
33282 }
33288 }
33291 {
33297 }
33299 }
33301 /* OpenMP 4.0:
33302 depend ( depend-kind : variable-list )
33304 depend-kind:
33305 in | out | inout
33307 OpenMP 4.5:
33308 depend ( source )
33310 depend ( sink : vec ) */
33312 static tree
33314 {
33318 matching_parens parens;
33323 {
33337 else
33339 }
33340 else
33346 {
33356 }
33363 else
33364 {
33370 }
33373 invalid_kind:
33375 resync_fail:
33380 }
33382 /* OpenMP 4.0:
33383 map ( map-kind : variable-list )
33384 map ( variable-list )
33386 map-kind:
33387 alloc | to | from | tofrom
33389 OpenMP 4.5:
33390 map-kind:
33391 alloc | to | from | tofrom | release | delete
33393 map ( always [,] map-kind: variable-list ) */
33395 static tree
33397 {
33406 {
33411 {
33414 nth++;
33420 {
33425 }
33426 }
33427 }
33431 {
33445 else
33446 {
33452 }
33455 }
33458 {
33462 }
33465 NULL);
33471 }
33473 /* OpenMP 4.0:
33474 device ( expression ) */
33476 static tree
33478 location_t location)
33479 {
33482 matching_parens parens;
33502 }
33504 /* OpenMP 4.0:
33505 dist_schedule ( static )
33506 dist_schedule ( static , expression ) */
33508 static tree
33510 location_t location)
33511 {
33514 matching_parens parens;
33525 {
33536 }
33541 location);
33545 invalid_kind:
33547 resync_fail:
33552 }
33554 /* OpenMP 4.0:
33555 proc_bind ( proc-bind-kind )
33557 proc-bind-kind:
33558 master | close | spread */
33560 static tree
33562 location_t location)
33563 {
33564 tree c;
33571 {
33581 else
33583 }
33584 else
33593 location);
33598 invalid_kind:
33600 resync_fail:
33605 }
33607 /* OpenACC:
33608 async [( int-expr )] */
33610 static tree
33612 {
33619 {
33620 matching_parens parens;
33629 }
33639 }
33641 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33642 is a bitmask in MASK. Return the list of clauses found. */
33644 static tree
33648 {
33653 {
33654 location_t here;
33655 pragma_omp_clause c_kind;
33656 omp_clause_code code;
33667 {
33719 clauses);
33737 OMP_CLAUSE_INDEPENDENT,
33749 clauses);
33755 clauses);
33779 clauses);
33801 clauses);
33813 clauses);
33827 }
33832 {
33833 /* Remove the invalid clause(s) from the list to avoid
33834 confusing the rest of the compiler. */
33837 }
33838 }
33840 saw_error:
33847 }
33849 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33850 is a bitmask in MASK. Return the list of clauses found; the result
33851 of clause default goes in *pdefault. */
33853 static tree
33857 {
33863 {
33864 pragma_omp_clause c_kind;
33875 {
33887 clauses);
33901 clauses);
33921 clauses);
33926 clauses);
33936 clauses);
33970 clauses);
33984 clauses);
33999 OMP_CLAUSE_NOTINBRANCH,
34008 {
34009 clause_not_first:
34013 }
34043 clauses);
34044 else
34054 clauses);
34072 {
34077 }
34120 clauses
34126 clauses
34134 }
34139 {
34140 /* Remove the invalid clause(s) from the list to avoid
34141 confusing the rest of the compiler. */
34144 }
34145 }
34146 saw_error:
34149 {
34152 else
34154 }
34156 }
34158 /* OpenMP 2.5:
34159 structured-block:
34160 statement
34162 In practice, we're also interested in adding the statement to an
34163 outer node. So it is convenient if we work around the fact that
34164 cp_parser_statement calls add_stmt. */
34166 static unsigned
34168 {
34171 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34172 This preserves the "not within loop or switch" style error messages
34173 for nonsense cases like
34174 void foo() {
34175 #pragma omp single
34176 break;
34177 }
34178 */
34183 }
34185 static void
34187 {
34189 }
34191 static tree
34193 {
34201 }
34203 /* OpenMP 2.5:
34204 # pragma omp atomic new-line
34205 expression-stmt
34207 expression-stmt:
34208 x binop= expr | x++ | ++x | x-- | --x
34209 binop:
34210 +, *, -, /, &, ^, |, <<, >>
34212 where x is an lvalue expression with scalar type.
34214 OpenMP 3.1:
34215 # pragma omp atomic new-line
34216 update-stmt
34218 # pragma omp atomic read new-line
34219 read-stmt
34221 # pragma omp atomic write new-line
34222 write-stmt
34224 # pragma omp atomic update new-line
34225 update-stmt
34227 # pragma omp atomic capture new-line
34228 capture-stmt
34230 # pragma omp atomic capture new-line
34231 capture-block
34233 read-stmt:
34234 v = x
34235 write-stmt:
34236 x = expr
34237 update-stmt:
34238 expression-stmt | x = x binop expr
34239 capture-stmt:
34240 v = expression-stmt
34241 capture-block:
34242 { v = x; update-stmt; } | { update-stmt; v = x; }
34244 OpenMP 4.0:
34245 update-stmt:
34246 expression-stmt | x = x binop expr | x = expr binop x
34247 capture-stmt:
34248 v = update-stmt
34249 capture-block:
34250 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34252 where x and v are lvalue expressions with scalar type. */
34254 static void
34256 {
34264 {
34269 {
34275 }
34276 }
34278 {
34290 else
34294 }
34296 {
34302 {
34307 {
34310 }
34311 }
34312 }
34316 {
34326 else
34331 {
34332 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34333 opcode. */
34338 }
34342 {
34345 }
34346 else
34347 {
34353 }
34356 }
34358 restart:
34362 {
34369 /* FALLTHROUGH */
34379 /* FALLTHROUGH */
34394 /* Undo effects of boolean_increment for post {in,de}crement. */
34396 /* FALLTHRU */
34400 {
34401 /* Undo effects of boolean_increment. */
34403 {
34404 /* This is pre or post increment. */
34409 && !structured_block
34413 }
34414 }
34415 /* FALLTHRU */
34418 {
34453 {
34457 }
34460 {
34466 {
34471 }
34473 {
34485 {
34487 {
34492 }
34493 else
34495 }
34499 }
34502 {
34509 }
34513 }
34517 {
34520 {
34528 }
34530 {
34535 }
34570 }
34581 /* FALLTHROUGH */
34586 }
34593 }
34594 stmt_done:
34596 {
34607 }
34609 {
34612 }
34613 done:
34619 saw_error:
34622 {
34626 {
34630 }
34631 }
34632 }
34635 /* OpenMP 2.5:
34636 # pragma omp barrier new-line */
34638 static void
34640 {
34643 }
34645 /* OpenMP 2.5:
34646 # pragma omp critical [(name)] new-line
34647 structured-block
34649 OpenMP 4.5:
34650 # pragma omp critical [(name) [hint(expression)]] new-line
34651 structured-block */
34653 #define OMP_CRITICAL_CLAUSE_MASK \
34654 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34656 static tree
34658 {
34662 {
34663 matching_parens parens;
34677 OMP_CRITICAL_CLAUSE_MASK,
34679 }
34680 else
34685 }
34687 /* OpenMP 2.5:
34688 # pragma omp flush flush-vars[opt] new-line
34690 flush-vars:
34691 ( variable-list ) */
34693 static void
34695 {
34701 }
34703 /* Helper function, to parse omp for increment expression. */
34705 static tree
34707 {
34712 {
34715 }
34718 {
34725 /* Fall through: OpenMP disallows NE_EXPR. */
34729 }
34731 /* If decl is an iterator, preserve LHS and RHS of the relational
34732 expr until finish_omp_for. */
34743 }
34745 /* Helper function, to parse omp for increment expression. */
34747 static tree
34749 {
34753 cp_id_kind idk;
34757 {
34766 }
34775 {
34780 }
34787 {
34791 }
34804 do
34805 {
34812 {
34814 {
34817 else
34819 tf_warning_or_error);
34820 }
34821 else
34824 }
34825 }
34829 {
34835 }
34836 else
34840 }
34842 /* Parse the initialization statement of an OpenMP for loop.
34844 Return true if the resulting construct should have an
34845 OMP_CLAUSE_PRIVATE added to it. */
34847 static tree
34855 {
34861 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34863 init-expr:
34864 var = lb
34865 integer-type var = lb
34866 random-access-iterator-type var = lb
34867 pointer-type var = lb
34868 */
34869 cp_decl_specifier_seq type_specifiers;
34871 /* First, try to parse as an initialized declaration. See
34872 cp_parser_condition, from whence the bulk of this is copied. */
34879 {
34880 /* If parsing a type specifier seq succeeded, then this
34881 MUST be a initialized declaration. */
34886 CP_PARSER_DECLARATOR_NAMED,
34897 else
34898 {
34908 {
34910 CPP_OPEN_PAREN))
34913 else
34914 /* Trigger an error. */
34919 }
34923 {
34931 {
34934 auto_node);
34939 }
34942 asm_specification,
34943 LOOKUP_ONLYCONVERTING);
34946 {
34949 }
34950 else
34951 {
34954 {
34956 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34958 {
34962 {
34966 }
34968 }
34970 {
34975 }
34976 }
34977 }
34979 }
34980 else
34981 {
34982 /* Consume '='. */
34986 non_class:
34989 else
34992 asm_specification,
34993 LOOKUP_ONLYCONVERTING);
34994 }
34998 }
34999 }
35000 else
35001 {
35002 cp_id_kind idk;
35003 /* If parsing a type specifier sequence failed, then
35004 this MUST be a simple expression. */
35010 && decl
35013 {
35024 {
35029 }
35034 }
35036 && decl
35039 {
35040 tree rhs;
35048 rhs,
35049 tf_warning_or_error));
35052 }
35053 else
35054 {
35059 {
35063 }
35064 }
35065 }
35067 }
35069 /* Parse the restricted form of the for statement allowed by OpenMP. */
35071 static tree
35074 {
35078 location_t loc_first;
35089 {
35092 }
35095 {
35098 }
35101 {
35107 }
35109 {
35112 {
35114 "%<linear%> clause may not be specified together "
35117 }
35118 else
35120 }
35133 {
35136 location_t loc;
35139 {
35143 }
35146 matching_parens parens;
35153 add_private_clause
35159 {
35162 {
35168 }
35169 else
35171 }
35178 {
35183 {
35187 }
35190 {
35191 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35195 {
35198 }
35199 else
35200 {
35203 }
35205 }
35206 else
35207 {
35212 }
35213 }
35216 {
35217 tree c;
35219 {
35228 decl);
35232 decl);
35233 }
35235 {
35240 else
35245 {
35248 /* For linear, signal that we need to fill up
35249 the so far unknown linear step. */
35252 }
35253 }
35254 }
35263 {
35264 /* If decl is an iterator, preserve the operator on decl
35265 until finish_omp_for. */
35267 && ((processing_template_decl
35272 else
35276 }
35288 {
35291 }
35296 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35297 in between the collapsed for loops to be still considered perfectly
35298 nested. Hopefully the final version clarifies this.
35299 For now handle (multiple) {'s and empty statements. */
35302 {
35306 {
35308 bracecount++;
35309 }
35313 else
35314 {
35321 }
35322 }
35325 {
35328 }
35329 }
35334 /* Note that we saved the original contents of this flag when we entered
35335 the structured block, and so we don't need to re-save it here. */
35338 /* Note that the grammar doesn't call for a structured block here,
35339 though the loop as a whole is a structured block. */
35346 else
35351 {
35353 {
35355 nbraces--;
35356 }
35359 else
35360 {
35362 {
35365 }
35370 }
35371 }
35374 {
35378 else
35380 }
35384 }
35386 /* Helper function for OpenMP parsing, split clauses and call
35387 finish_omp_clauses on each of the set of clauses afterwards. */
35389 static void
35392 {
35398 }
35400 /* OpenMP 4.0:
35401 #pragma omp simd simd-clause[optseq] new-line
35402 for-loop */
35404 #define OMP_SIMD_CLAUSE_MASK \
35405 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35408 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35409 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35414 static tree
35418 {
35429 {
35433 OMP_CLAUSE_ORDERED);
35435 {
35437 "%<ordered%> clause with parameter may not be specified "
35440 }
35441 }
35452 }
35454 /* OpenMP 2.5:
35455 #pragma omp for for-clause[optseq] new-line
35456 for-loop
35458 OpenMP 4.0:
35459 #pragma omp for simd for-simd-clause[optseq] new-line
35460 for-loop */
35462 #define OMP_FOR_CLAUSE_MASK \
35463 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35471 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35473 static tree
35477 {
35484 /* parallel for{, simd} disallows nowait clause, but for
35485 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35488 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35493 {
35498 {
35522 }
35523 }
35525 {
35528 }
35530 /* Composite distribute parallel for disallows linear clause. */
35537 {
35540 }
35551 }
35553 /* OpenMP 2.5:
35554 # pragma omp master new-line
35555 structured-block */
35557 static tree
35559 {
35563 }
35565 /* OpenMP 2.5:
35566 # pragma omp ordered new-line
35567 structured-block
35569 OpenMP 4.5:
35570 # pragma omp ordered ordered-clauses new-line
35571 structured-block */
35573 #define OMP_ORDERED_CLAUSE_MASK \
35574 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35575 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35577 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35578 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35580 static bool
35583 {
35587 {
35592 {
35594 {
35597 }
35599 {
35601 "%<depend%> clause may only be used in compound "
35605 }
35606 tree clauses
35608 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35612 }
35613 }
35615 tree clauses
35626 }
35628 /* OpenMP 2.5:
35630 section-scope:
35631 { section-sequence }
35633 section-sequence:
35634 section-directive[opt] structured-block
35635 section-sequence section-directive structured-block */
35637 static tree
35639 {
35644 matching_braces braces;
35652 {
35656 }
35659 {
35667 {
35671 }
35673 {
35676 }
35681 }
35692 }
35694 /* OpenMP 2.5:
35695 # pragma omp sections sections-clause[optseq] newline
35696 sections-scope */
35698 #define OMP_SECTIONS_CLAUSE_MASK \
35699 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35705 static tree
35708 {
35720 {
35723 }
35730 }
35732 /* OpenMP 2.5:
35733 # pragma omp parallel parallel-clause[optseq] new-line
35734 structured-block
35735 # pragma omp parallel for parallel-for-clause[optseq] new-line
35736 structured-block
35737 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35738 structured-block
35740 OpenMP 4.0:
35741 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35742 structured-block */
35744 #define OMP_PARALLEL_CLAUSE_MASK \
35745 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35755 static tree
35759 {
35766 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35772 {
35780 if_p);
35784 if_p);
35787 block);
35792 }
35793 /* When combined with distribute, parallel has to be followed by for.
35794 #pragma omp target parallel is allowed though. */
35798 {
35802 }
35804 {
35807 }
35809 {
35813 {
35823 block);
35826 }
35827 }
35832 {
35835 }
35843 }
35845 /* OpenMP 2.5:
35846 # pragma omp single single-clause[optseq] new-line
35847 structured-block */
35849 #define OMP_SINGLE_CLAUSE_MASK \
35850 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35855 static tree
35857 {
35867 }
35869 /* OpenMP 3.0:
35870 # pragma omp task task-clause[optseq] new-line
35871 structured-block */
35873 #define OMP_TASK_CLAUSE_MASK \
35874 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35875 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35885 static tree
35887 {
35898 }
35900 /* OpenMP 3.0:
35901 # pragma omp taskwait new-line */
35903 static void
35905 {
35908 }
35910 /* OpenMP 3.1:
35911 # pragma omp taskyield new-line */
35913 static void
35915 {
35918 }
35920 /* OpenMP 4.0:
35921 # pragma omp taskgroup new-line
35922 structured-block */
35924 static tree
35926 {
35930 if_p));
35931 }
35934 /* OpenMP 2.5:
35935 # pragma omp threadprivate (variable-list) */
35937 static void
35939 {
35940 tree vars;
35946 }
35948 /* OpenMP 4.0:
35949 # pragma omp cancel cancel-clause[optseq] new-line */
35951 #define OMP_CANCEL_CLAUSE_MASK \
35952 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35953 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35954 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35955 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35958 static void
35960 {
35964 }
35966 /* OpenMP 4.0:
35967 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35969 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35970 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35975 static void
35978 {
35979 tree clauses;
35983 {
35988 {
35991 }
35992 }
35994 {
35998 }
36001 {
36006 else
36010 }
36013 OMP_CANCELLATION_POINT_CLAUSE_MASK,
36015 pragma_tok);
36017 }
36019 /* OpenMP 4.0:
36020 #pragma omp distribute distribute-clause[optseq] new-line
36021 for-loop */
36023 #define OMP_DISTRIBUTE_CLAUSE_MASK \
36024 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36030 static tree
36034 {
36043 {
36051 else
36054 {
36060 {
36064 else
36067 }
36073 else
36087 }
36088 }
36090 {
36093 }
36098 {
36101 }
36112 }
36114 /* OpenMP 4.0:
36115 # pragma omp teams teams-clause[optseq] new-line
36116 structured-block */
36118 #define OMP_TEAMS_CLAUSE_MASK \
36119 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36127 static tree
36131 {
36140 {
36144 {
36169 }
36170 }
36172 {
36175 }
36180 {
36183 }
36192 }
36194 /* OpenMP 4.0:
36195 # pragma omp target data target-data-clause[optseq] new-line
36196 structured-block */
36198 #define OMP_TARGET_DATA_CLAUSE_MASK \
36199 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36200 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36201 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36202 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36204 static tree
36206 {
36207 tree clauses
36212 {
36215 {
36232 "%<#pragma omp target data%> with map-type other "
36233 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36237 }
36239 }
36242 {
36245 "%<#pragma omp target data%> must contain at least "
36248 }
36259 }
36261 /* OpenMP 4.5:
36262 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36263 structured-block */
36265 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36266 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36272 static tree
36275 {
36278 {
36283 {
36286 }
36287 }
36289 {
36293 }
36296 {
36302 }
36304 tree clauses
36309 {
36312 {
36325 "%<#pragma omp target enter data%> with map-type other "
36329 }
36331 }
36334 {
36337 "%<#pragma omp target enter data%> must contain at least "
36340 }
36347 }
36349 /* OpenMP 4.5:
36350 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36351 structured-block */
36353 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36354 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36360 static tree
36363 {
36366 {
36371 {
36374 }
36375 }
36377 {
36381 }
36384 {
36390 }
36392 tree clauses
36397 {
36400 {
36414 "%<#pragma omp target exit data%> with map-type other "
36415 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36419 }
36421 }
36424 {
36427 "%<#pragma omp target exit data%> must contain at least "
36430 }
36437 }
36439 /* OpenMP 4.0:
36440 # pragma omp target update target-update-clause[optseq] new-line */
36442 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36443 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36446 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36447 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36450 static bool
36453 {
36455 {
36461 }
36463 tree clauses
36468 {
36470 "%<#pragma omp target update%> must contain at least one "
36473 }
36481 }
36483 /* OpenMP 4.0:
36484 # pragma omp target target-clause[optseq] new-line
36485 structured-block */
36487 #define OMP_TARGET_CLAUSE_MASK \
36488 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36498 static bool
36501 {
36505 {
36517 {
36525 {
36526 tree stmt;
36528 {
36531 OMP_TARGET_CLAUSE_MASK,
36536 OMP_TARGET_CLAUSE_MASK,
36541 OMP_TARGET_CLAUSE_MASK,
36546 }
36548 }
36553 {
36557 if_p);
36562 if_p);
36567 if_p);
36571 }
36577 {
36578 /* For combined target teams, ensure the num_teams and
36579 thread_limit clause expressions are evaluated on the host,
36580 before entering the target construct. */
36581 tree c;
36587 {
36596 OMP_CLAUSE_FIRSTPRIVATE);
36601 }
36602 }
36612 }
36614 {
36617 }
36619 {
36623 }
36625 {
36629 }
36631 {
36635 }
36637 {
36640 }
36641 }
36643 {
36646 }
36661 check_clauses:
36663 {
36666 {
36680 "%<#pragma omp target%> with map-type other "
36681 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36685 }
36687 }
36689 }
36691 /* OpenACC 2.0:
36692 # pragma acc cache (variable-list) new-line
36693 */
36695 static tree
36697 {
36712 }
36714 /* OpenACC 2.0:
36715 # pragma acc data oacc-data-clause[optseq] new-line
36716 structured-block */
36718 #define OACC_DATA_CLAUSE_MASK \
36719 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36725 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36726 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36727 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36728 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36729 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36731 static tree
36733 {
36746 }
36748 /* OpenACC 2.0:
36749 # pragma acc host_data <clauses> new-line
36750 structured-block */
36752 #define OACC_HOST_DATA_CLAUSE_MASK \
36753 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36755 static tree
36757 {
36770 }
36772 /* OpenACC 2.0:
36773 # pragma acc declare oacc-data-clause[optseq] new-line
36774 */
36776 #define OACC_DECLARE_CLAUSE_MASK \
36777 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36790 static tree
36792 {
36801 {
36805 }
36808 {
36812 {
36816 }
36819 {
36831 {
36833 "%qD must be a global variable in "
36835 decl);
36838 }
36843 {
36847 }
36849 {
36851 "invalid use of %<extern%> variable %qD "
36855 }
36857 {
36859 "invalid use of %<global%> variable %qD "
36863 }
36865 }
36870 {
36875 }
36878 {
36879 tree id;
36883 else
36889 {
36892 {
36895 {
36899 }
36900 }
36901 }
36902 }
36903 }
36916 }
36918 /* OpenACC 2.0:
36919 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36921 or
36923 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36925 LOC is the location of the #pragma token.
36926 */
36928 #define OACC_ENTER_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_COPYIN) \
36932 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36933 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36934 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36935 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36937 #define OACC_EXIT_DATA_CLAUSE_MASK \
36938 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36939 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36942 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36944 static tree
36947 {
36956 {
36961 }
36968 else
36973 {
36977 }
36985 }
36987 /* OpenACC 2.0:
36988 # pragma acc loop oacc-loop-clause[optseq] new-line
36989 structured-block */
36991 #define OACC_LOOP_CLAUSE_MASK \
36992 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36996 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36997 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36998 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36999 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
37000 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
37001 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
37003 static tree
37006 {
37015 {
37021 }
37030 }
37032 /* OpenACC 2.0:
37033 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37034 structured-block
37036 or
37038 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37039 structured-block
37040 */
37042 #define OACC_KERNELS_CLAUSE_MASK \
37043 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37061 #define OACC_PARALLEL_CLAUSE_MASK \
37062 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37063 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37064 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37083 static tree
37086 {
37087 omp_clause_mask mask;
37090 {
37103 }
37106 {
37110 {
37113 tree clauses;
37115 if_p);
37117 }
37118 }
37127 }
37129 /* OpenACC 2.0:
37130 # pragma acc update oacc-update-clause[optseq] new-line
37131 */
37133 #define OACC_UPDATE_CLAUSE_MASK \
37134 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
37139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37141 static tree
37143 {
37150 {
37152 "%<#pragma acc update%> must contain at least one "
37155 }
37163 }
37165 /* OpenACC 2.0:
37166 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37168 LOC is the location of the #pragma token.
37169 */
37171 #define OACC_WAIT_CLAUSE_MASK \
37172 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37174 static tree
37176 {
37190 }
37192 /* OpenMP 4.0:
37193 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37195 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37196 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37197 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37198 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37199 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37200 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37201 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37203 static void
37206 {
37208 cp_omp_declare_simd_data data;
37210 {
37215 /* It is safe to take the address of a local variable; it will only be
37216 used while this scope is live. */
37218 }
37220 /* Store away all pragma tokens. */
37232 {
37236 {
37249 }
37254 "%<#pragma omp declare simd%> not immediately followed by "
37258 }
37259 }
37261 /* Finalize #pragma omp declare simd clauses after direct declarator has
37262 been parsed, and put that into "omp declare simd" attribute. */
37264 static tree
37266 {
37272 {
37276 }
37281 {
37299 }
37303 }
37306 /* OpenMP 4.0:
37307 # pragma omp declare target new-line
37308 declarations and definitions
37309 # pragma omp end declare target new-line
37311 OpenMP 4.5:
37312 # pragma omp declare target ( extended-list ) new-line
37314 # pragma omp declare target declare-target-clauses[seq] new-line */
37316 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37317 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37320 static void
37322 {
37325 clauses
37329 {
37331 clauses);
37334 }
37335 else
37336 {
37340 }
37343 "%<#pragma omp declare target%> with clauses in between "
37344 "%<#pragma omp declare target%> without clauses and "
37347 {
37353 {
37356 }
37357 else
37360 {
37362 "%qD specified both in declare target %<link%> and %<to%>"
37365 }
37367 {
37374 {
37377 {
37381 }
37382 }
37383 }
37384 }
37385 }
37387 static void
37389 {
37392 {
37395 }
37397 {
37401 {
37404 }
37407 else
37408 {
37412 }
37413 }
37414 else
37415 {
37419 }
37423 "%<#pragma omp end declare target%> without corresponding "
37425 else
37427 }
37429 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37430 expression and optional initializer clause of
37431 #pragma omp declare reduction. We store the expression(s) as
37432 either 3, 6 or 7 special statements inside of the artificial function's
37433 body. The first two statements are DECL_EXPRs for the artificial
37434 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37435 expression that uses those variables.
37436 If there was any INITIALIZER clause, this is followed by further statements,
37437 the fourth and fifth statements are DECL_EXPRs for the artificial
37438 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37439 constructor variant (first token after open paren is not omp_priv),
37440 then the sixth statement is a statement with the function call expression
37441 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37442 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37443 to initialize the OMP_PRIV artificial variable and there is seventh
37444 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37446 static bool
37448 {
37460 tree combiner;
37475 {
37478 }
37481 {
37483 matching_parens parens;
37489 {
37492 }
37508 {
37512 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37516 == CPP_CLOSE_PAREN
37519 {
37523 }
37528 }
37529 else
37530 {
37546 {
37551 }
37553 tree arg;
37566 }
37577 }
37581 UNKNOWN_LOCATION);
37584 }
37586 /* OpenMP 4.0
37587 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37588 initializer-clause[opt] new-line
37590 initializer-clause:
37591 initializer (omp_priv initializer)
37592 initializer (function-name (argument-list)) */
37594 static void
37597 {
37607 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37614 {
37646 }
37658 /* Types may not be defined in declare reduction type list. */
37661 parser->type_definition_forbidden_message
37667 saved_colon_doesnt_start_class_def_p
37672 {
37676 ;
37695 else
37700 else
37702 }
37704 /* Restore the saved message. */
37707 parser->colon_doesnt_start_class_def_p
37712 {
37713 fail:
37716 }
37722 {
37723 tree fntype
37726 NULL_TREE);
37746 {
37751 }
37753 {
37755 {
37764 }
37771 }
37772 else
37773 {
37776 }
37779 else
37782 {
37785 }
37787 {
37790 else
37795 }
37800 else
37801 {
37810 }
37817 }
37821 done:
37822 /* Free any declarators allocated. */
37824 }
37826 /* OpenMP 4.0
37827 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37828 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37829 initializer-clause[opt] new-line
37830 #pragma omp declare target new-line */
37832 static bool
37835 {
37837 {
37842 {
37845 context);
37847 }
37850 {
37853 context);
37855 }
37857 {
37860 }
37862 {
37866 }
37867 }
37872 }
37874 /* OpenMP 4.5:
37875 #pragma omp taskloop taskloop-clause[optseq] new-line
37876 for-loop
37878 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37879 for-loop */
37881 #define OMP_TASKLOOP_CLAUSE_MASK \
37882 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37887 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37897 static tree
37901 {
37910 {
37915 {
37939 }
37940 }
37942 {
37945 }
37950 {
37953 }
37959 if_p);
37965 }
37968 /* OpenACC 2.0:
37969 # pragma acc routine oacc-routine-clause[optseq] new-line
37970 function-definition
37972 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37973 */
37975 #define OACC_ROUTINE_CLAUSE_MASK \
37976 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37978 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37979 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37982 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37983 component, which must resolve to a declared namespace-scope
37984 function. The clauses are either processed directly (for a named
37985 function), or defered until the immediatley following declaration
37986 is parsed. */
37988 static void
37991 {
37993 /* The checking for "another pragma following this one" in the "no optional
37994 '( name )'" case makes sure that we dont re-enter. */
37997 cp_oacc_routine_data data;
38003 /* It is safe to take the address of a local variable; it will only be
38004 used while this scope is live. */
38007 /* Look for optional '( name )'. */
38009 {
38010 matching_parens parens;
38013 /* We parse the name as an id-expression. If it resolves to
38014 anything other than a non-overloaded function at namespace
38015 scope, it's an error. */
38031 {
38035 }
38037 data.clauses
38045 {
38050 }
38052 /* Perhaps we should use the same rule as declarations in different
38053 namespaces? */
38055 {
38060 }
38063 {
38067 }
38071 }
38073 {
38074 /* Store away all pragma tokens. */
38085 /* Emit a helpful diagnostic if there's another pragma following this
38086 one. */
38088 {
38091 /* ..., and then just keep going. */
38093 }
38095 /* We only have to consider the pragma_external case here. */
38100 else
38103 }
38104 }
38106 /* Finalize #pragma acc routine clauses after direct declarator has
38107 been parsed. */
38109 static tree
38111 {
38116 {
38118 "%<#pragma acc routine%> not immediately followed by "
38121 }
38138 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38139 fndecl_seen. */
38142 }
38144 /* Apply any saved OpenACC routine clauses to a just-parsed
38145 declaration. */
38147 static void
38149 {
38151 {
38152 /* Keep going if we're in error reporting mode. */
38158 {
38160 "%<#pragma acc routine%> not immediately followed by"
38164 }
38166 {
38169 }
38172 {
38177 }
38180 {
38188 }
38190 /* Process the routine's dimension clauses. */
38194 /* Add an "omp declare target" attribute. */
38199 /* Don't unset parser->oacc_routine here: we may still need it to
38200 diagnose wrong usage. But, remember that we've used this "#pragma acc
38201 routine". */
38203 }
38204 }
38206 /* Main entry point to OpenMP statement pragmas. */
38208 static void
38210 {
38211 tree stmt;
38216 {
38239 if_p);
38244 if_p);
38261 if_p);
38266 if_p);
38274 if_p);
38283 if_p);
38297 if_p);
38302 if_p);
38306 }
38309 }
38310 \f
38311 /* Transactional Memory parsing routines. */
38313 /* Parse a transaction attribute.
38315 txn-attribute:
38316 attribute
38317 [ [ identifier ] ]
38319 We use this instead of cp_parser_attributes_opt for transactions to avoid
38320 the pedwarn in C++98 mode. */
38322 static tree
38324 {
38339 {
38343 /* For keywords, use the canonical spelling,
38344 not the parsed identifier. */
38348 }
38349 else
38353 error1:
38356 }
38358 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38360 transaction-statement:
38361 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38362 compound-statement
38363 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38364 */
38366 static tree
38368 {
38379 else
38380 {
38384 }
38386 /* Parse a noexcept specification. */
38390 {
38391 /* cancel-and-throw is unimplemented. */
38394 }
38395 else
38398 /* Keep track if we're in the lexical scope of an outer transaction. */
38410 }
38412 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38414 transaction-expression:
38415 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38416 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38417 */
38419 static tree
38421 {
38434 keyword == RID_TRANSACTION_RELAXED
38448 /* Set this early. This might mean that we allow transaction_cancel in
38449 an expression that we find out later actually has to be a constexpr.
38450 However, we expect that cxx_constant_value will be able to deal with
38451 this; also, if the noexcept has no constexpr, then what we parse next
38452 really is a transaction's body. */
38455 /* Parse a noexcept specification. */
38461 {
38462 matching_parens parens;
38469 }
38470 else
38471 {
38472 /* The only expression that is available got parsed for the noexcept
38473 already. noexcept is true then. */
38476 }
38485 }
38487 /* Parse a function-transaction-block.
38489 function-transaction-block:
38490 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38491 function-body
38492 __transaction_atomic txn-attribute[opt] function-try-block
38493 __transaction_relaxed ctor-initializer[opt] function-body
38494 __transaction_relaxed function-try-block
38495 */
38497 static void
38499 {
38514 else
38515 {
38519 }
38527 else
38528 cp_parser_ctor_initializer_opt_and_function_body
38534 }
38536 /* Parse a __transaction_cancel statement.
38538 cancel-statement:
38539 __transaction_cancel txn-attribute[opt] ;
38540 __transaction_cancel txn-attribute[opt] throw-expression ;
38542 ??? Cancel and throw is not yet implemented. */
38544 static tree
38546 {
38552 RT_TRANSACTION_CANCEL);
38559 /* ??? Parse cancel-and-throw here. */
38564 {
38568 }
38570 {
38574 }
38576 {
38579 {
38585 }
38586 }
38588 {
38592 }
38598 }
38599 \f
38600 /* The parser. */
38604 \f
38605 /* Special handling for the first token or line in the file. The first
38606 thing in the file might be #pragma GCC pch_preprocess, which loads a
38607 PCH file, which is a GC collection point. So we need to handle this
38608 first pragma without benefit of an existing lexer structure.
38610 Always returns one token to the caller in *FIRST_TOKEN. This is
38611 either the true first token of the file, or the first token after
38612 the initial pragma. */
38614 static void
38616 {
38625 {
38632 }
38633 else
38636 /* Skip to the end of the pragma. */
38640 /* Now actually load the PCH file. */
38644 /* Read one more token to return to our caller. We have to do this
38645 after reading the PCH file in, since its pointers have to be
38646 live. */
38648 }
38650 /* Parse a pragma GCC ivdep. */
38652 static bool
38654 {
38657 }
38659 /* Parse a pragma GCC unroll. */
38661 static unsigned short
38663 {
38673 {
38675 " assignment-expression that evaluates to a non-negative"
38678 }
38679 else
38680 {
38684 }
38687 }
38689 /* Normal parsing of a pragma token. Here we can (and must) use the
38690 regular lexer. */
38692 static bool
38694 {
38697 tree stmt;
38708 {
38716 {
38726 }
38731 {
38741 }
38746 {
38757 }
38762 {
38773 }
38778 {
38789 }
38809 {
38814 }
38822 {
38827 }
38835 {
38839 }
38845 {
38850 }
38858 {
38863 }
38918 "%<#pragma omp section%> may only be used in "
38923 {
38925 {
38929 }
38935 {
38939 }
38940 else
38946 {
38949 }
38952 }
38955 {
38957 {
38961 }
38962 const unsigned short unroll
38968 {
38972 }
38973 else
38979 {
38982 }
38985 }
38992 bad_stmt:
38995 }
38999 }
39001 /* The interface the pragma parsers have to the lexer. */
39003 enum cpp_ttype
39005 {
39017 else
39018 {
39022 }
39025 }
39027 \f
39028 /* External interface. */
39030 /* Parse one entire translation unit. */
39032 void
39034 {
39047 }
39049 /* Create an identifier for a generic parameter type (a synthesized
39050 template parameter implied by `auto' or a concept identifier). */
39053 static tree
39055 {
39059 }
39061 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39062 (creating a new template parameter list if necessary). Returns the newly
39063 created template type parm. */
39065 static tree
39067 {
39070 /* Before committing to modifying any scope, if we're in an
39071 implicit template scope, and we're trying to synthesize a
39072 constrained parameter, try to find a previous parameter with
39073 the same name. This is the same-type rule for abbreviated
39074 function templates.
39076 NOTE: We can generate implicit parameters when tentatively
39077 parsing a nested name specifier, only to reject that parse
39078 later. However, matching the same template-id as part of a
39079 direct-declarator should generate an identical template
39080 parameter, so this rule will merge them. */
39082 {
39085 {
39087 {
39090 /* Return the TEMPLATE_PARM_INDEX. */
39093 }
39095 }
39096 }
39098 /* We are either continuing a function template that already contains implicit
39099 template parameters, creating a new fully-implicit function template, or
39100 extending an existing explicit function template with implicit template
39101 parameters. */
39109 {
39113 }
39114 else
39115 {
39116 /* Roll back to the existing template parameter scope (in the case of
39117 extending an explicit function template) or introduce a new template
39118 parameter scope ahead of the function parameter scope (or class scope
39119 in the case of out-of-line member definitions). The function scope is
39120 added back after template parameter synthesis below. */
39125 {
39128 }
39130 {
39131 /* If not defining a class, then any class scope is a scope level in
39132 an out-of-line member definition. In this case simply wind back
39133 beyond the first such scope to inject the template parameter list.
39134 Otherwise wind back to the class being defined. The latter can
39135 occur in class member friend declarations such as:
39137 class A {
39138 void foo (auto);
39139 };
39140 class B {
39141 friend void A::foo (auto);
39142 };
39144 The template parameter list synthesized for the friend declaration
39145 must be injected in the scope of 'B'. This can also occur in
39146 erroneous cases such as:
39148 struct A {
39149 struct B {
39150 void foo (auto);
39151 };
39152 void B::foo (auto) {}
39153 };
39155 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39156 but, nevertheless, the template parameter list synthesized for the
39157 declarator should be injected into the scope of 'A' as if the
39158 ill-formed template was specified explicitly. */
39161 {
39164 }
39165 }
39171 {
39172 /* Introduce a new template parameter list for implicit template
39173 parameters. */
39177 parser->implicit_template_scope
39184 }
39185 else
39186 {
39187 /* Synthesize implicit template parameters at the end of the explicit
39188 template parameter list. */
39195 parser->implicit_template_parms
39197 }
39198 }
39200 /* Synthesize a new template parameter and track the current template
39201 parameter chain with implicit_template_parms. */
39205 tree synth_tmpl_parm;
39209 synth_tmpl_parm
39212 synth_tmpl_parm
39214 else
39215 {
39219 }
39221 // Attach the constraint to the parm before processing.
39224 tree new_parm
39226 input_location,
39227 node,
39231 // Chain the new parameter to the list of implicit parameters.
39233 parser->implicit_template_parms
39235 else
39240 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39243 /* If creating a fully implicit function template, start the new implicit
39244 template parameter list with this synthesized type, otherwise grow the
39245 current template parameter list. */
39248 {
39255 }
39256 else
39257 {
39262 }
39264 // If the new parameter was constrained, we need to add that to the
39265 // constraints in the template parameter list.
39267 {
39271 }
39276 }
39278 /* Finish the declaration of a fully implicit function template. Such a
39279 template has no explicit template parameter list so has not been through the
39280 normal template head and tail processing. synthesize_implicit_template_parm
39281 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39282 provided if the declaration is a class member such that its template
39283 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39284 form is returned. Otherwise NULL_TREE is returned. */
39286 static tree
39288 {
39293 {
39297 }
39309 }
39311 /* Like finish_fully_implicit_template, but to be used in error
39312 recovery, rearranging scopes so that we restore the state we had
39313 before synthesize_implicit_template_parm inserted the implement
39314 template parms scope. */
39316 static void
39318 {
39323 {
39332 }
39333 else
39339 }
39341 /* Helper function for diagnostics that have complained about things
39342 being used with 'extern "C"' linkage.
39344 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39346 void
39348 {
39352 }