| blob | 03aea2f11507fb74254f79211c5168f1a0eb6d0c |
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 {
3503 {
3506 /* Have we found what we're looking for before the closing paren? */
3512 {
3515 /* If we've run out of tokens, then there is no closing `)'. */
3518 /* This is good for lambda expression capture-lists. */
3528 /* This matches the processing in skip_to_end_of_statement. */
3548 {
3552 }
3562 condop_depth--;
3567 }
3569 /* Consume the token. */
3571 }
3572 }
3574 /* Consume tokens up to, and including, the next non-nested closing `)'.
3575 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3576 are doing error recovery. Returns -1 if OR_COMMA is true and we
3577 found an unnested token of that type. */
3579 static int
3584 {
3588 }
3590 /* Consume tokens until we reach the end of the current statement.
3591 Normally, that will be just before consuming a `;'. However, if a
3592 non-nested `}' comes first, then we stop before consuming that. */
3594 static void
3596 {
3599 /* Unwind generic function template scope if necessary. */
3604 {
3608 {
3611 /* If we've run out of tokens, stop. */
3615 /* If the next token is a `;', we have reached the end of the
3616 statement. */
3622 /* If this is a non-nested '}', stop before consuming it.
3623 That way, when confronted with something like:
3625 { 3 + }
3627 we stop before consuming the closing '}', even though we
3628 have not yet reached a `;'. */
3632 /* If it is the closing '}' for a block that we have
3633 scanned, stop -- but only after consuming the token.
3634 That way given:
3636 void f g () { ... }
3637 typedef int I;
3639 we will stop after the body of the erroneously declared
3640 function, but before consuming the following `typedef'
3641 declaration. */
3643 {
3646 }
3655 }
3657 /* Consume the token. */
3659 }
3660 }
3662 /* This function is called at the end of a statement or declaration.
3663 If the next token is a semicolon, it is consumed; otherwise, error
3664 recovery is attempted. */
3666 static void
3668 {
3669 /* Look for the trailing `;'. */
3671 {
3672 /* If there is additional (erroneous) input, skip to the end of
3673 the statement. */
3675 /* If the next token is now a `;', consume it. */
3678 }
3679 }
3681 /* Skip tokens until we have consumed an entire block, or until we
3682 have consumed a non-nested `;'. */
3684 static void
3686 {
3689 /* Unwind generic function template scope if necessary. */
3694 {
3698 {
3701 /* If we've run out of tokens, stop. */
3705 /* Stop if this is an unnested ';'. */
3711 /* Stop if this is an unnested '}', or closes the outermost
3712 nesting level. */
3713 nesting_depth--;
3721 /* Nest. */
3722 nesting_depth++;
3727 }
3729 /* Consume the token. */
3731 }
3732 }
3734 /* Skip tokens until a non-nested closing curly brace is the next
3735 token, or there are no more tokens. Return true in the first case,
3736 false otherwise. */
3738 static bool
3740 {
3744 {
3748 {
3751 /* If we've run out of tokens, stop. */
3755 /* If the next token is a non-nested `}', then we have reached
3756 the end of the current block. */
3762 /* If it the next token is a `{', then we are entering a new
3763 block. Consume the entire block. */
3769 }
3771 /* Consume the token. */
3773 }
3774 }
3776 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3777 parameter is the PRAGMA token, allowing us to purge the entire pragma
3778 sequence. */
3780 static void
3782 {
3787 do
3791 /* Ensure that the pragma is not parsed again. */
3793 }
3795 /* Require pragma end of line, resyncing with it as necessary. The
3796 arguments are as for cp_parser_skip_to_pragma_eol. */
3798 static void
3800 {
3804 }
3806 /* This is a simple wrapper around make_typename_type. When the id is
3807 an unresolved identifier node, we can provide a superior diagnostic
3808 using cp_parser_diagnose_invalid_type_name. */
3810 static tree
3812 location_t id_location)
3813 {
3814 tree result;
3816 {
3822 }
3824 }
3826 /* This is a wrapper around the
3827 make_{pointer,ptrmem,reference}_declarator functions that decides
3828 which one to call based on the CODE and CLASS_TYPE arguments. The
3829 CODE argument should be one of the values returned by
3830 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3831 appertain to the pointer or reference. */
3835 cp_cv_quals cv_qualifiers,
3837 tree attributes)
3838 {
3845 else
3855 }
3857 /* Create a new C++ parser. */
3861 {
3866 /* cp_lexer_new_main is called before doing GC allocation because
3867 cp_lexer_new_main might load a PCH file. */
3870 /* Initialize the binops_by_token so that we can get the tree
3871 directly from the token. */
3879 /* For now, we always accept GNU extensions. */
3882 /* The `>' token is a greater-than operator, not the end of a
3883 template-id. */
3888 /* We are not parsing a constant-expression. */
3893 /* Local variable names are not forbidden. */
3896 /* We are not processing an `extern "C"' declaration. */
3899 /* We are not processing a declarator. */
3902 /* We are not processing a template-argument-list. */
3905 /* We are not in an iteration statement. */
3908 /* We are not in a switch statement. */
3911 /* We are not parsing a type-id inside an expression. */
3914 /* Declarations aren't implicitly extern "C". */
3917 /* String literals should be translated to the execution character set. */
3920 /* We are not parsing a function body. */
3923 /* We can correct until told otherwise. */
3926 /* The unparsed function queue is empty. */
3929 /* There are no classes being defined. */
3932 /* No template parameters apply. */
3935 /* Special parsing data structures. */
3939 /* Not declaring an implicit function template. */
3945 /* Allow constrained-type-specifiers. */
3948 /* We haven't yet seen an 'extern "C"'. */
3952 }
3954 /* Create a cp_lexer structure which will emit the tokens in CACHE
3955 and push it onto the parser's lexer stack. This is used for delayed
3956 parsing of in-class method bodies and default arguments, and should
3957 not be confused with tentative parsing. */
3958 static void
3960 {
3965 /* Move the current source position to that of the first token in the
3966 new lexer. */
3968 }
3970 /* Pop the top lexer off the parser stack. This is never used for the
3971 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3972 static void
3974 {
3979 /* Put the current source position back where it was before this
3980 lexer was pushed. */
3982 }
3984 /* Lexical conventions [gram.lex] */
3986 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3987 identifier. */
3989 static cp_expr
3991 {
3994 /* Look for the identifier. */
3996 /* Return the value. */
3999 else
4001 }
4003 /* Parse a sequence of adjacent string constants. Returns a
4004 TREE_STRING representing the combined, nul-terminated string
4005 constant. If TRANSLATE is true, translate the string to the
4006 execution character set. If WIDE_OK is true, a wide string is
4007 invalid here.
4009 C++98 [lex.string] says that if a narrow string literal token is
4010 adjacent to a wide string literal token, the behavior is undefined.
4011 However, C99 6.4.5p4 says that this results in a wide string literal.
4012 We follow C99 here, for consistency with the C front end.
4014 This code is largely lifted from lex_string() in c-lex.c.
4016 FUTURE: ObjC++ will need to handle @-strings here. */
4017 static cp_expr
4020 {
4021 tree value;
4028 tree string_tree;
4034 {
4037 }
4042 {
4046 }
4047 else
4048 {
4051 }
4054 /* Try to avoid the overhead of creating and destroying an obstack
4055 for the common case of just one string. */
4058 {
4066 {
4070 }
4071 else
4075 }
4076 else
4077 {
4082 do
4083 {
4085 count++;
4090 {
4093 {
4096 }
4099 {
4104 }
4106 }
4107 else
4111 {
4115 {
4119 "unsupported non-standard concatenation "
4121 }
4122 }
4130 {
4134 }
4135 else
4136 {
4140 }
4141 }
4144 /* A string literal built by concatenation has its caret=start at
4145 the start of the initial string, and its finish at the finish of
4146 the final string literal. */
4150 }
4153 {
4156 }
4160 {
4165 {
4180 }
4185 {
4190 else
4192 }
4193 }
4194 else
4195 /* cpp_interpret_string has issued an error. */
4202 }
4204 /* Look up a literal operator with the name and the exact arguments. */
4206 static tree
4208 {
4209 tree decl;
4215 {
4221 {
4224 {
4234 }
4237 /* May be this should be sufficient_parms_p instead,
4238 depending on how exactly should user-defined literals
4239 work in presence of default arguments on the literal
4240 operator parameters. */
4243 }
4244 }
4247 }
4249 /* Parse a user-defined char constant. Returns a call to a user-defined
4250 literal operator taking the character as an argument. */
4252 static cp_expr
4254 {
4262 /* Build up a call to the user-defined operator */
4263 /* Lookup the name we got back from the id-expression. */
4268 {
4273 }
4277 }
4279 /* A subroutine of cp_parser_userdef_numeric_literal to
4280 create a char... template parameter pack from a string node. */
4282 static tree
4284 {
4285 tree charvec;
4291 /* Fill in CHARVEC with all of the parameters. */
4296 /* Build the argument packs. */
4302 }
4304 /* A subroutine of cp_parser_userdef_numeric_literal to
4305 create a char... template parameter pack from a string node. */
4307 static tree
4309 {
4310 tree charvec;
4321 /* First template parm is character type. */
4324 /* Fill in CHARVEC with all of the parameters. */
4331 /* Build the argument packs. */
4337 }
4339 /* Parse a user-defined numeric constant. returns a call to a user-defined
4340 literal operator. */
4342 static cp_expr
4344 {
4355 /* Look for a literal operator taking the exact type of numeric argument
4356 as the literal value. */
4361 {
4363 tf_warning_or_error);
4366 {
4369 long_long_unsigned_type_node);
4370 }
4371 else
4372 {
4376 long_double_type_node);
4380 }
4384 }
4387 /* If the numeric argument didn't work, look for a raw literal
4388 operator taking a const char* argument consisting of the number
4389 in string format. */
4394 {
4396 tf_warning_or_error);
4399 }
4402 /* If the raw literal didn't work, look for a non-type template
4403 function with parameter pack char.... Call the function with
4404 template parameter characters representing the number. */
4408 {
4412 tf_warning_or_error);
4415 }
4419 /* In C++14 the standard library defines complex number suffixes that
4420 conflict with GNU extensions. Prefer them if <complex> is #included. */
4430 {
4435 {
4436 /* No <complex>, so pedwarn and use GNU semantics. */
4439 }
4440 }
4442 bool complained
4449 {
4451 "(from <complex>) to enable the C++14 user-defined literal "
4456 }
4463 else
4464 {
4465 /* Use the built-in semantics. */
4466 tree type;
4468 {
4471 else
4473 }
4482 }
4485 /* Avoid repeated diagnostics. */
4488 }
4490 /* Parse a user-defined string constant. Returns a call to a user-defined
4491 literal operator taking a character pointer and the length of the string
4492 as arguments. */
4494 static tree
4496 {
4505 /* Build up a call to the user-defined operator. */
4506 /* Lookup the name we got back from the id-expression. */
4513 {
4515 tf_warning_or_error);
4518 }
4521 /* Look for a template function with typename parameter CharT
4522 and parameter pack CharT... Call the function with
4523 template parameter characters representing the string. */
4527 {
4531 tf_warning_or_error);
4534 }
4540 }
4543 /* Basic concepts [gram.basic] */
4545 /* Parse a translation-unit.
4547 translation-unit:
4548 declaration-seq [opt]
4550 Returns TRUE if all went well. */
4552 static bool
4554 {
4555 /* The address of the first non-permanent object on the declarator
4556 obstack. */
4561 /* Create the declarator obstack, if necessary. */
4563 {
4565 /* Create the error declarator. */
4567 /* Create the empty parameter list. */
4569 UNKNOWN_LOCATION);
4570 /* Remember where the base of the declarator obstack lies. */
4572 }
4576 /* If there are no tokens left then all went well. */
4578 {
4579 /* Get rid of the token array; we don't need it any more. */
4583 /* This file might have been a context that's implicitly extern
4584 "C". If so, pop the lang context. (Only relevant for PCH.) */
4586 {
4589 }
4591 /* Finish up. */
4595 }
4596 else
4597 {
4600 }
4602 /* Make sure the declarator obstack was fully cleaned up. */
4606 /* All went well. */
4608 }
4610 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4611 decltype context. */
4615 {
4620 }
4622 /* We're about to parse a collection of statements. If we're currently
4623 parsing tentatively, set up a firewall so that any nested
4624 cp_parser_commit_to_tentative_parse won't affect the current context. */
4626 static cp_token_position
4628 {
4635 }
4637 /* We've finished parsing the collection of statements. Wrap up the
4638 firewall and replace the relevant tokens with the parsed form. */
4640 static void
4642 tree expr)
4643 {
4647 /* Finish the firewall level. */
4649 /* And remember the result of the parse for when we try again. */
4655 }
4657 /* Like the above functions, but let the user modify the tokens. Used by
4658 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4659 later parses, so it makes sense to localize the effects of
4660 cp_parser_commit_to_tentative_parse. */
4662 struct tentative_firewall
4663 {
4668 {
4669 /* If we're currently parsing tentatively, start a committed level as a
4670 firewall and then an inner tentative parse. */
4672 {
4676 }
4677 }
4680 {
4682 {
4683 /* Finish the inner tentative parse and the firewall, propagating any
4684 uncommitted error state to the outer tentative parse. */
4690 }
4691 }
4692 };
4694 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4695 This class is for tracking such a matching pair of symbols.
4696 In particular, it tracks the location of the first token,
4697 so that if the second token is missing, we can highlight the
4698 location of the first token when notifying the user about the
4699 problem. */
4702 class token_pair
4703 {
4705 /* token_pair's ctor. */
4708 /* If the next token is the opening symbol for this pair, consume it and
4709 return true.
4710 Otherwise, issue an error and return false.
4711 In either case, record the location of the opening token. */
4714 {
4718 }
4720 /* Consume the next token from PARSER, recording its location as
4721 that of the opening token within the pair. */
4724 {
4729 }
4731 /* If the next token is the closing symbol for this pair, consume it
4732 and return it.
4733 Otherwise, issue an error, highlighting the location of the
4734 corresponding opening token, and return NULL. */
4737 {
4740 m_open_loc);
4741 }
4744 location_t m_open_loc;
4745 };
4747 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4749 struct matching_paren_traits
4750 {
4755 };
4757 /* "matching_parens" is a token_pair<T> class for tracking matching
4758 pairs of parentheses. */
4762 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4764 struct matching_brace_traits
4765 {
4770 };
4772 /* "matching_braces" is a token_pair<T> class for tracking matching
4773 pairs of braces. */
4778 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4779 enclosing parentheses. */
4781 static cp_expr
4783 {
4786 /* Consume the '('. */
4788 matching_parens parens;
4790 /* Start the statement-expression. */
4792 /* Parse the compound-statement. */
4794 /* Finish up. */
4796 /* Consume the ')'. */
4804 }
4806 /* Expressions [gram.expr] */
4808 /* Parse a fold-operator.
4810 fold-operator:
4811 - * / % ^ & | = < > << >>
4812 = -= *= /= %= ^= &= |= <<= >>=
4813 == != <= >= && || , .* ->*
4815 This returns the tree code corresponding to the matched operator
4816 as an int. When the current token matches a compound assignment
4817 opertor, the resulting tree code is the negative value of the
4818 non-assignment operator. */
4820 static int
4822 {
4824 {
4864 }
4865 }
4867 /* Returns true if CODE indicates a binary expression, which is not allowed in
4868 the LHS of a fold-expression. More codes will need to be added to use this
4869 function in other contexts. */
4871 static bool
4873 {
4875 {
4908 }
4909 }
4911 /* If the next token is a suitable fold operator, consume it and return as
4912 the function above. */
4914 static int
4916 {
4922 }
4924 /* Parse a fold-expression.
4926 fold-expression:
4927 ( ... folding-operator cast-expression)
4928 ( cast-expression folding-operator ... )
4929 ( cast-expression folding operator ... folding-operator cast-expression)
4931 Note that the '(' and ')' are matched in primary expression. */
4933 static cp_expr
4935 {
4936 cp_id_kind pidk;
4938 // Left fold.
4940 {
4944 {
4947 }
4954 }
4959 {
4962 }
4965 {
4968 }
4971 /* The operands of a fold-expression are cast-expressions, so binary or
4972 conditional expressions are not allowed. We check this here to avoid
4973 tentative parsing. */
4985 // Right fold.
4990 {
4993 }
4996 // Binary left or right fold.
5001 }
5003 /* Parse a primary-expression.
5005 primary-expression:
5006 literal
5007 this
5008 ( expression )
5009 id-expression
5010 lambda-expression (C++11)
5012 GNU Extensions:
5014 primary-expression:
5015 ( compound-statement )
5016 __builtin_va_arg ( assignment-expression , type-id )
5017 __builtin_offsetof ( type-id , offsetof-expression )
5019 C++ Extensions:
5020 __has_nothrow_assign ( type-id )
5021 __has_nothrow_constructor ( type-id )
5022 __has_nothrow_copy ( type-id )
5023 __has_trivial_assign ( type-id )
5024 __has_trivial_constructor ( type-id )
5025 __has_trivial_copy ( type-id )
5026 __has_trivial_destructor ( type-id )
5027 __has_virtual_destructor ( type-id )
5028 __is_abstract ( type-id )
5029 __is_base_of ( type-id , type-id )
5030 __is_class ( type-id )
5031 __is_empty ( type-id )
5032 __is_enum ( type-id )
5033 __is_final ( type-id )
5034 __is_literal_type ( type-id )
5035 __is_pod ( type-id )
5036 __is_polymorphic ( type-id )
5037 __is_std_layout ( type-id )
5038 __is_trivial ( type-id )
5039 __is_union ( type-id )
5041 Objective-C++ Extension:
5043 primary-expression:
5044 objc-expression
5046 literal:
5047 __null
5049 ADDRESS_P is true iff this expression was immediately preceded by
5050 "&" and therefore might denote a pointer-to-member. CAST_P is true
5051 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5052 true iff this expression is a template argument.
5054 Returns a representation of the expression. Upon return, *IDK
5055 indicates what kind of id-expression (if any) was present. */
5057 static cp_expr
5064 {
5067 /* Assume the primary expression is not an id-expression. */
5070 /* Peek at the next token. */
5073 {
5074 /* literal:
5075 integer-literal
5076 character-literal
5077 floating-literal
5078 string-literal
5079 boolean-literal
5080 pointer-literal
5081 user-defined-literal */
5093 {
5097 }
5098 /* Floating-point literals are only allowed in an integral
5099 constant expression if they are cast to an integral or
5100 enumeration type. */
5104 {
5105 /* CAST_P will be set even in invalid code like "int(2.7 +
5106 ...)". Therefore, we have to check that the next token
5107 is sure to end the cast. */
5109 {
5114 enumerator-definition. */
5116 /* The curly brace at the end of an enum-specifier. */
5118 /* The end of a statement. */
5120 /* The end of the cast-expression. */
5122 /* The end of an array bound. */
5124 /* The closing ">" in a template-argument-list. */
5127 /* C++0x only: A ">>" treated like two ">" tokens,
5128 in a template-argument-list. */
5133 }
5135 /* If we are within a cast, then the constraint that the
5136 cast is to an integral or enumeration type will be
5137 checked at that point. If we are not within a cast, then
5138 this code is invalid. */
5141 }
5161 /* ??? Should wide strings be allowed when parser->translate_strings_p
5162 is false (i.e. in attributes)? If not, we can kill the third
5163 argument to cp_parser_string_literal. */
5169 /* If we see `( { ' then we are looking at the beginning of
5170 a GNU statement-expression. */
5173 {
5174 /* Statement-expressions are not allowed by the standard. */
5178 /* And they're not allowed outside of a function-body; you
5179 cannot, for example, write:
5181 int i = ({ int j = 3; j + 1; });
5183 at class or namespace scope. */
5186 {
5188 "statement-expressions are not allowed outside "
5194 }
5195 else
5197 }
5198 /* Otherwise it's a normal parenthesized expression. */
5199 {
5200 cp_expr expr;
5205 /* Consume the `('. */
5206 matching_parens parens;
5208 /* Within a parenthesized expression, a `>' token is always
5209 the greater-than operator. */
5210 saved_greater_than_is_operator_p
5215 /* Left fold expression. */
5217 else
5218 /* Parse the parenthesized expression. */
5223 {
5230 }
5231 else
5232 /* Let the front end know that this expression was
5233 enclosed in parentheses. This matters in case, for
5234 example, the expression is of the form `A::B', since
5235 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5236 not. */
5239 /* DR 705: Wrapping an unqualified name in parentheses
5240 suppresses arg-dependent lookup. We want to pass back
5241 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5242 (c++/37862), but none of the others. */
5246 /* The `>' token might be the end of a template-id or
5247 template-parameter-list now. */
5248 parser->greater_than_is_operator_p
5251 /* Consume the `)'. */
5260 }
5263 {
5265 {
5266 /* We might have an Objective-C++ message. */
5269 /* If that works out, we're done ... */
5272 /* ... else, fall though to see if it's a lambda. */
5273 }
5275 /* Don't warn about a failed tentative parse. */
5280 }
5284 /* We have an Objective-C++ string literal. */
5291 {
5292 /* These two are the boolean literals. */
5300 /* The `__null' literal. */
5305 /* The `nullptr' literal. */
5310 /* Recognize the `this' keyword. */
5314 {
5318 }
5319 /* Pointers cannot appear in constant-expressions. */
5324 /* The `operator' keyword can be the beginning of an
5325 id-expression. */
5332 {
5333 non_integral_constant name;
5335 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5336 __func__ are the names of variables -- but they are
5337 treated specially. Therefore, they are handled here,
5338 rather than relying on the generic id-expression logic
5339 below. Grammatically, these names are id-expressions.
5341 Consume the token. */
5345 {
5357 }
5362 /* Look up the name. */
5364 }
5367 {
5368 tree expression;
5369 tree type;
5370 source_location type_location;
5371 location_t start_loc
5373 /* The `__builtin_va_arg' construct is used to handle
5374 `va_arg'. Consume the `__builtin_va_arg' token. */
5376 /* Look for the opening `('. */
5377 matching_parens parens;
5379 /* Now, parse the assignment-expression. */
5381 /* Look for the `,'. */
5384 /* Parse the type-id. */
5385 {
5388 }
5389 /* Look for the closing `)'. */
5390 location_t finish_loc
5393 /* Using `va_arg' in a constant-expression is not
5394 allowed. */
5396 NIC_VA_ARG))
5398 /* Construct a location of the form:
5399 __builtin_va_arg (v, int)
5400 ~~~~~~~~~~~~~~~~~~~~~^~~~
5401 with the caret at the type, ranging from the start of the
5402 "__builtin_va_arg" token to the close paren. */
5403 location_t combined_loc
5406 }
5441 // C++ concepts
5445 /* Objective-C++ expressions. */
5455 {
5460 }
5461 /* FALLTHRU */
5465 }
5467 /* An id-expression can start with either an identifier, a
5468 `::' as the beginning of a qualified-id, or the "operator"
5469 keyword. */
5474 {
5475 id_expression:
5476 cp_expr id_expression;
5477 cp_expr decl;
5483 /* Parse the id-expression. */
5484 id_expression
5501 /* If we have a template-id, then no further lookup is
5502 required. If the template-id was for a template-class, we
5503 will sometimes have a TYPE_DECL at this point. */
5507 /* Look up the name. */
5508 else
5509 {
5510 tree ambiguous_decls;
5512 /* If we already know that this lookup is ambiguous, then
5513 we've already issued an error message; there's no reason
5514 to check again. */
5517 {
5520 }
5523 none_type,
5524 template_p,
5529 /* If the lookup was ambiguous, an error will already have
5530 been issued. */
5534 /* In Objective-C++, we may have an Objective-C 2.0
5535 dot-syntax for classes here. */
5540 {
5541 tree component;
5548 component);
5549 /* Build a location of the form:
5550 expr.component
5551 ~~~~~^~~~~~~~~
5552 with caret at the start of the component name (at
5553 input_location), ranging from the start of the id_expression
5554 to the end of the component name. */
5555 location_t combined_loc
5560 }
5562 /* In Objective-C++, an instance variable (ivar) may be preferred
5563 to whatever cp_parser_lookup_name() found.
5564 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5565 rest of c-family, we have to do a little extra work to preserve
5566 any location information in cp_expr "decl". Given that
5567 objc_lookup_ivar is implemented in "c-family" and "objc", we
5568 have a trip through the pure "tree" type, rather than cp_expr.
5569 Naively copying it back to "decl" would implicitly give the
5570 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5571 store an EXPR_LOCATION. Hence we only update "decl" (and
5572 hence its location_t) if we get back a different tree node. */
5574 id_expression);
5578 /* If name lookup gives us a SCOPE_REF, then the
5579 qualifying scope was dependent. */
5581 {
5582 /* At this point, we do not know if DECL is a valid
5583 integral constant expression. We assume that it is
5584 in fact such an expression, so that code like:
5586 template <int N> struct A {
5587 int a[B<N>::i];
5588 };
5590 is accepted. At template-instantiation time, we
5591 will check that B<N>::i is actually a constant. */
5593 }
5594 /* Check to see if DECL is a local variable in a context
5595 where that is forbidden. */
5598 {
5603 }
5604 }
5606 decl = (finish_id_expression
5608 idk,
5613 template_arg_p,
5620 }
5622 /* Anything else is an error. */
5626 }
5627 }
5635 {
5638 }
5640 /* Parse an id-expression.
5642 id-expression:
5643 unqualified-id
5644 qualified-id
5646 qualified-id:
5647 :: [opt] nested-name-specifier template [opt] unqualified-id
5648 :: identifier
5649 :: operator-function-id
5650 :: template-id
5652 Return a representation of the unqualified portion of the
5653 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5654 a `::' or nested-name-specifier.
5656 Often, if the id-expression was a qualified-id, the caller will
5657 want to make a SCOPE_REF to represent the qualified-id. This
5658 function does not do this in order to avoid wastefully creating
5659 SCOPE_REFs when they are not required.
5661 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5662 `template' keyword.
5664 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5665 uninstantiated templates.
5667 If *TEMPLATE_P is non-NULL, it is set to true iff the
5668 `template' keyword is used to explicitly indicate that the entity
5669 named is a template.
5671 If DECLARATOR_P is true, the id-expression is appearing as part of
5672 a declarator, rather than as part of an expression. */
5674 static cp_expr
5681 {
5685 /* Assume the `template' keyword was not used. */
5689 /* Look for the optional `::' operator. */
5690 global_scope_p
5691 = (!template_keyword_p
5696 /* Look for the optional nested-name-specifier. */
5697 nested_name_specifier_p
5700 check_dependency_p,
5702 declarator_p,
5703 template_keyword_p)
5706 /* If there is a nested-name-specifier, then we are looking at
5707 the first qualified-id production. */
5709 {
5710 tree saved_scope;
5711 tree saved_object_scope;
5712 tree saved_qualifying_scope;
5713 cp_expr unqualified_id;
5716 /* See if the next token is the `template' keyword. */
5720 /* Name lookup we do during the processing of the
5721 unqualified-id might obliterate SCOPE. */
5725 /* Process the final unqualified-id. */
5727 check_dependency_p,
5728 declarator_p,
5730 /* Restore the SAVED_SCOPE for our caller. */
5736 }
5737 /* Otherwise, if we are in global scope, then we are looking at one
5738 of the other qualified-id productions. */
5740 {
5742 tree id;
5744 /* Peek at the next token. */
5747 /* If it's an identifier, and the next token is not a "<", then
5748 we can avoid the template-id case. This is an optimization
5749 for this common case. */
5751 && !cp_parser_nth_token_starts_template_argument_list_p
5756 /* Try a template-id. */
5760 none_type,
5761 declarator_p);
5762 /* If that worked, we're done. */
5766 /* Peek at the next token. (Changes in the token buffer may
5767 have invalidated the pointer obtained above.) */
5771 {
5778 /* Fall through. */
5783 }
5784 }
5785 else
5788 declarator_p,
5789 optional_p);
5790 }
5792 /* Parse an unqualified-id.
5794 unqualified-id:
5795 identifier
5796 operator-function-id
5797 conversion-function-id
5798 ~ class-name
5799 template-id
5801 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5802 keyword, in a construct like `A::template ...'.
5804 Returns a representation of unqualified-id. For the `identifier'
5805 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5806 production a BIT_NOT_EXPR is returned; the operand of the
5807 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5808 other productions, see the documentation accompanying the
5809 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5810 names are looked up in uninstantiated templates. If DECLARATOR_P
5811 is true, the unqualified-id is appearing as part of a declarator,
5812 rather than as part of an expression. */
5814 static cp_expr
5820 {
5823 /* Peek at the next token. */
5827 {
5829 {
5830 tree id;
5832 /* We don't know yet whether or not this will be a
5833 template-id. */
5835 /* Try a template-id. */
5837 check_dependency_p,
5838 none_type,
5839 declarator_p);
5840 /* If it worked, we're done. */
5843 /* Otherwise, it's an ordinary identifier. */
5845 }
5849 check_dependency_p,
5850 none_type,
5851 declarator_p);
5854 {
5855 tree type_decl;
5856 tree qualifying_scope;
5857 tree object_scope;
5858 tree scope;
5861 /* Consume the `~' token. */
5863 /* Parse the class-name. The standard, as written, seems to
5864 say that:
5866 template <typename T> struct S { ~S (); };
5867 template <typename T> S<T>::~S() {}
5869 is invalid, since `~' must be followed by a class-name, but
5870 `S<T>' is dependent, and so not known to be a class.
5871 That's not right; we need to look in uninstantiated
5872 templates. A further complication arises from:
5874 template <typename T> void f(T t) {
5875 t.T::~T();
5876 }
5878 Here, it is not possible to look up `T' in the scope of `T'
5879 itself. We must look in both the current scope, and the
5880 scope of the containing complete expression.
5882 Yet another issue is:
5884 struct S {
5885 int S;
5886 ~S();
5887 };
5889 S::~S() {}
5891 The standard does not seem to say that the `S' in `~S'
5892 should refer to the type `S' and not the data member
5893 `S::S'. */
5895 /* DR 244 says that we look up the name after the "~" in the
5896 same scope as we looked up the qualifying name. That idea
5897 isn't fully worked out; it's more complicated than that. */
5902 /* Check for invalid scopes. */
5904 {
5908 }
5910 {
5914 scope);
5919 }
5922 /* If the name is of the form "X::~X" it's OK even if X is a
5923 typedef. */
5932 {
5935 }
5937 /* ~auto means the destructor of whatever the object is. */
5939 {
5942 "%<~auto%> only available with "
5946 }
5948 /* If there was an explicit qualification (S::~T), first look
5949 in the scope given by the qualification (i.e., S).
5951 Note: in the calls to cp_parser_class_name below we pass
5952 typename_type so that lookup finds the injected-class-name
5953 rather than the constructor. */
5957 {
5962 typename_type,
5965 declarator_p);
5968 }
5969 /* In "N::S::~S", look in "N" as well. */
5971 {
5976 type_decl
5980 typename_type,
5983 declarator_p);
5986 }
5987 /* In "p->S::~T", look in the scope given by "*p" as well. */
5989 {
5994 type_decl
5998 typename_type,
6001 declarator_p);
6004 }
6005 /* Look in the surrounding context. */
6007 {
6013 type_decl
6017 typename_type,
6020 declarator_p);
6023 {
6024 /* We couldn't find a type with this name. If we're parsing
6025 tentatively, fail and try something else. */
6027 {
6030 }
6031 /* Otherwise, accept it and check for a match at instantiation
6032 time. */
6037 }
6038 }
6039 /* If an error occurred, assume that the name of the
6040 destructor is the same as the name of the qualifying
6041 class. That allows us to keep parsing after running
6042 into ill-formed destructor names. */
6048 /* Check that destructor name and scope match. */
6050 {
6057 }
6059 /* [class.dtor]
6061 A typedef-name that names a class shall not be used as the
6062 identifier in the declarator for a destructor declaration. */
6069 type_decl);
6072 }
6076 {
6077 cp_expr id;
6079 /* This could be a template-id, so we try that first. */
6081 /* Try a template-id. */
6084 none_type,
6085 declarator_p);
6086 /* If that worked, we're done. */
6089 /* We still don't know whether we're looking at an
6090 operator-function-id or a conversion-function-id. */
6092 /* Try an operator-function-id. */
6094 /* If that didn't work, try a conversion-function-id. */
6099 }
6100 /* Fall through. */
6107 }
6108 }
6110 /* Parse an (optional) nested-name-specifier.
6112 nested-name-specifier: [C++98]
6113 class-or-namespace-name :: nested-name-specifier [opt]
6114 class-or-namespace-name :: template nested-name-specifier [opt]
6116 nested-name-specifier: [C++0x]
6117 type-name ::
6118 namespace-name ::
6119 nested-name-specifier identifier ::
6120 nested-name-specifier template [opt] simple-template-id ::
6122 PARSER->SCOPE should be set appropriately before this function is
6123 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6124 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6125 in name lookups.
6127 Sets PARSER->SCOPE to the class (TYPE) or namespace
6128 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6129 it unchanged if there is no nested-name-specifier. Returns the new
6130 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6132 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6133 part of a declaration and/or decl-specifier. */
6135 static tree
6142 {
6147 /* Remember where the nested-name-specifier starts. */
6149 {
6152 }
6155 {
6156 tree new_scope;
6157 tree old_scope;
6158 tree saved_qualifying_scope;
6160 /* Spot cases that cannot be the beginning of a
6161 nested-name-specifier. */
6164 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6165 the already parsed nested-name-specifier. */
6167 {
6168 /* Grab the nested-name-specifier and continue the loop. */
6170 /* If we originally encountered this nested-name-specifier
6171 with IS_DECLARATION set to false, we will not have
6172 resolved TYPENAME_TYPEs, so we must do so here. */
6175 {
6180 }
6183 }
6185 /* Spot cases that cannot be the beginning of a
6186 nested-name-specifier. On the second and subsequent times
6187 through the loop, we look for the `template' keyword. */
6189 ;
6190 /* A template-id can start a nested-name-specifier. */
6192 ;
6193 /* DR 743: decltype can be used in a nested-name-specifier. */
6195 ;
6196 else
6197 {
6198 /* If the next token is not an identifier, then it is
6199 definitely not a type-name or namespace-name. */
6202 /* If the following token is neither a `<' (to begin a
6203 template-id), nor a `::', then we are not looking at a
6204 nested-name-specifier. */
6210 {
6214 "found %<:%> in nested-name-specifier, "
6217 }
6220 && !cp_parser_nth_token_starts_template_argument_list_p
6223 }
6225 /* The nested-name-specifier is optional, so we parse
6226 tentatively. */
6229 /* Look for the optional `template' keyword, if this isn't the
6230 first time through the loop. */
6234 /* Save the old scope since the name lookup we are about to do
6235 might destroy it. */
6238 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6239 look up names in "X<T>::I" in order to determine that "Y" is
6240 a template. So, if we have a typename at this point, we make
6241 an effort to look through it. */
6243 && !typename_keyword_p
6248 /* Parse the qualifying entity. */
6249 new_scope
6251 typename_keyword_p,
6252 template_keyword_p,
6253 check_dependency_p,
6254 type_p,
6255 is_declaration);
6256 /* Look for the `::' token. */
6259 /* If we found what we wanted, we keep going; otherwise, we're
6260 done. */
6262 {
6265 /* Restore the OLD_SCOPE since it was valid before the
6266 failed attempt at finding the last
6267 class-or-namespace-name. */
6271 /* If the next token is a decltype, and the one after that is a
6272 `::', then the decltype has failed to resolve to a class or
6273 enumeration type. Give this error even when parsing
6274 tentatively since it can't possibly be valid--and we're going
6275 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6276 won't get another chance.*/
6280 {
6287 /* As below. */
6290 }
6294 {
6295 /* If we have a non-type template-id followed by ::, it can't
6296 possibly be valid. */
6301 {
6304 {
6310 }
6311 else
6312 {
6313 /* Variable template. */
6318 }
6325 /* As below. */
6329 }
6330 }
6334 /* If the next token is an identifier, and the one after
6335 that is a `::', then any valid interpretation would have
6336 found a class-or-namespace-name. */
6342 {
6345 {
6347 {
6348 tree decl;
6349 tree ambiguous_decls;
6352 none_type,
6361 decl);
6363 {
6364 // cp_parser_lookup_name has the same diagnostic,
6365 // thus make sure to emit it at most once.
6368 {
6373 }
6375 }
6376 else
6377 {
6379 cp_parser_name_lookup_error
6382 else
6383 cp_parser_name_lookup_error
6386 }
6387 }
6390 /* Treat this as a successful nested-name-specifier
6391 due to:
6393 [basic.lookup.qual]
6395 If the name found is not a class-name (clause
6396 _class_) or namespace-name (_namespace.def_), the
6397 program is ill-formed. */
6399 }
6401 }
6403 }
6404 /* We've found one valid nested-name-specifier. */
6406 /* Name lookup always gives us a DECL. */
6409 /* Uses of "template" must be followed by actual templates. */
6421 new_scope);
6422 /* If it is a class scope, try to complete it; we are about to
6423 be looking up names inside the class. */
6425 /* Since checking types for dependency can be expensive,
6426 avoid doing it if the type is already complete. */
6428 /* Do not try to complete dependent types. */
6430 {
6432 /* If it is a typedef to current class, use the current
6433 class instead, as the typedef won't have any names inside
6434 it yet. */
6438 }
6439 /* Make sure we look in the right scope the next time through
6440 the loop. */
6442 }
6444 /* If parsing tentatively, replace the sequence of tokens that makes
6445 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6446 token. That way, should we re-parse the token stream, we will
6447 not have to repeat the effort required to do the parse, nor will
6448 we issue duplicate error messages. */
6450 {
6454 /* Reset the contents of the START token. */
6456 /* Retrieve any deferred checks. Do not pop this access checks yet
6457 so the memory will not be reclaimed during token replacing below. */
6465 /* Purge all subsequent tokens. */
6467 }
6473 }
6475 /* Parse a nested-name-specifier. See
6476 cp_parser_nested_name_specifier_opt for details. This function
6477 behaves identically, except that it will an issue an error if no
6478 nested-name-specifier is present. */
6480 static tree
6486 {
6487 tree scope;
6489 /* Look for the nested-name-specifier. */
6491 typename_keyword_p,
6492 check_dependency_p,
6493 type_p,
6494 is_declaration);
6495 /* If it was not present, issue an error message. */
6497 {
6500 }
6503 }
6505 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6506 this is either a class-name or a namespace-name (which corresponds
6507 to the class-or-namespace-name production in the grammar). For
6508 C++0x, it can also be a type-name that refers to an enumeration
6509 type or a simple-template-id.
6511 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6512 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6513 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6514 TYPE_P is TRUE iff the next name should be taken as a class-name,
6515 even the same name is declared to be another entity in the same
6516 scope.
6518 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6519 specified by the class-or-namespace-name. If neither is found the
6520 ERROR_MARK_NODE is returned. */
6522 static tree
6529 {
6530 tree saved_scope;
6531 tree saved_qualifying_scope;
6532 tree saved_object_scope;
6533 tree scope;
6537 /* DR 743: decltype can appear in a nested-name-specifier. */
6539 {
6543 {
6546 }
6550 }
6552 /* Before we try to parse the class-name, we must save away the
6553 current PARSER->SCOPE since cp_parser_class_name will destroy
6554 it. */
6558 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6559 there is no need to look for a namespace-name. */
6560 only_class_p = template_keyword_p
6565 typename_keyword_p,
6566 template_keyword_p,
6568 check_dependency_p,
6570 is_declaration,
6573 /* If that didn't work, try for a namespace-name. */
6575 {
6576 /* Restore the saved scope. */
6580 /* If we are not looking at an identifier followed by the scope
6581 resolution operator, then this is not part of a
6582 nested-name-specifier. (Note that this function is only used
6583 to parse the components of a nested-name-specifier.) */
6588 }
6591 }
6593 /* Return true if we are looking at a compound-literal, false otherwise. */
6595 static bool
6597 {
6600 /* Skip tokens until the next token is a closing parenthesis.
6601 If we find the closing `)', and the next token is a `{', then
6602 we are looking at a compound-literal. */
6603 bool compound_literal_p
6608 /* Roll back the tokens we skipped. */
6612 }
6614 /* Return true if EXPR is the integer constant zero or a complex constant
6615 of zero, without any folding, but ignoring location wrappers. */
6617 bool
6619 {
6622 }
6624 /* Parse a postfix-expression.
6626 postfix-expression:
6627 primary-expression
6628 postfix-expression [ expression ]
6629 postfix-expression ( expression-list [opt] )
6630 simple-type-specifier ( expression-list [opt] )
6631 typename :: [opt] nested-name-specifier identifier
6632 ( expression-list [opt] )
6633 typename :: [opt] nested-name-specifier template [opt] template-id
6634 ( expression-list [opt] )
6635 postfix-expression . template [opt] id-expression
6636 postfix-expression -> template [opt] id-expression
6637 postfix-expression . pseudo-destructor-name
6638 postfix-expression -> pseudo-destructor-name
6639 postfix-expression ++
6640 postfix-expression --
6641 dynamic_cast < type-id > ( expression )
6642 static_cast < type-id > ( expression )
6643 reinterpret_cast < type-id > ( expression )
6644 const_cast < type-id > ( expression )
6645 typeid ( expression )
6646 typeid ( type-id )
6648 GNU Extension:
6650 postfix-expression:
6651 ( type-id ) { initializer-list , [opt] }
6653 This extension is a GNU version of the C99 compound-literal
6654 construct. (The C99 grammar uses `type-name' instead of `type-id',
6655 but they are essentially the same concept.)
6657 If ADDRESS_P is true, the postfix expression is the operand of the
6658 `&' operator. CAST_P is true if this expression is the target of a
6659 cast.
6661 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6662 class member access expressions [expr.ref].
6664 Returns a representation of the expression. */
6666 static cp_expr
6670 {
6672 location_t loc;
6678 /* Peek at the next token. */
6683 /* Some of the productions are determined by keywords. */
6686 {
6691 {
6692 tree type;
6693 cp_expr expression;
6697 /* All of these can be handled in the same way from the point
6698 of view of parsing. Begin by consuming the token
6699 identifying the cast. */
6702 /* New types cannot be defined in the cast. */
6704 parser->type_definition_forbidden_message
6707 /* Look for the opening `<'. */
6709 /* Parse the type to which we are casting. */
6714 /* Look for the closing `>'. */
6716 /* Restore the old message. */
6719 bool saved_greater_than_is_operator_p
6723 /* And the expression which is being cast. */
6724 matching_parens parens;
6728 RT_CLOSE_PAREN);
6732 parser->greater_than_is_operator_p
6735 /* Only type conversions to integral or enumeration types
6736 can be used in constant-expressions. */
6739 {
6742 }
6745 {
6747 postfix_expression
6751 postfix_expression
6755 postfix_expression
6757 tf_warning_or_error);
6760 postfix_expression
6765 }
6767 /* Construct a location e.g. :
6768 reinterpret_cast <int *> (expr)
6769 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6770 ranging from the start of the "*_cast" token to the final closing
6771 paren, with the caret at the start. */
6774 }
6778 {
6779 tree type;
6783 /* Consume the `typeid' token. */
6785 /* Look for the `(' token. */
6786 matching_parens parens;
6788 /* Types cannot be defined in a `typeid' expression. */
6790 parser->type_definition_forbidden_message
6792 /* We can't be sure yet whether we're looking at a type-id or an
6793 expression. */
6795 /* Try a type-id first. */
6800 /* Look for the `)' token. Otherwise, we can't be sure that
6801 we're not looking at an expression: consider `typeid (int
6802 (3))', for example. */
6804 /* If all went well, simply lookup the type-id. */
6807 /* Otherwise, fall back to the expression variant. */
6808 else
6809 {
6810 tree expression;
6812 /* Look for an expression. */
6814 /* Compute its typeid. */
6816 /* Look for the `)' token. */
6818 }
6819 /* Restore the saved message. */
6821 /* `typeid' may not appear in an integral constant expression. */
6825 /* Construct a location e.g. :
6826 typeid (expr)
6827 ^~~~~~~~~~~~~
6828 ranging from the start of the "typeid" token to the final closing
6829 paren, with the caret at the start. */
6831 {
6832 location_t typeid_loc
6836 }
6837 }
6841 {
6842 tree type;
6843 /* The syntax permitted here is the same permitted for an
6844 elaborated-type-specifier. */
6851 }
6857 {
6860 tree p;
6867 {
6870 }
6876 {
6879 postfix_expression
6881 else
6882 {
6886 }
6892 tf_warning_or_error);
6893 else
6894 {
6898 }
6903 postfix_expression
6907 postfix_expression
6910 else
6911 {
6915 }
6920 }
6922 }
6925 {
6926 tree type;
6928 /* If the next thing is a simple-type-specifier, we may be
6929 looking at a functional cast. We could also be looking at
6930 an id-expression. So, we try the functional cast, and if
6931 that doesn't work we fall back to the primary-expression. */
6933 /* Look for the simple-type-specifier. */
6937 CP_PARSER_FLAGS_NONE);
6939 /* Parse the cast itself. */
6941 postfix_expression
6943 /* If that worked, we're done. */
6947 /* If the functional-cast didn't work out, try a
6948 compound-literal. */
6951 {
6956 matching_parens parens;
6959 /* Avoid calling cp_parser_type_id pointlessly, see comment
6960 in cp_parser_cast_expression about c++/29234. */
6963 else
6964 {
6965 /* Parse the type. */
6971 }
6973 /* If things aren't going well, there's no need to
6974 keep going. */
6976 {
6978 /* Parse the brace-enclosed initializer list. */
6981 }
6982 /* If that worked, we're definitely looking at a
6983 compound-literal expression. */
6985 {
6986 /* Warn the user that a compound literal is not
6987 allowed in standard C++. */
6990 /* For simplicity, we disallow compound literals in
6991 constant-expressions. We could
6992 allow compound literals of integer type, whose
6993 initializer was a constant, in constant
6994 expressions. Permitting that usage, as a further
6995 extension, would not change the meaning of any
6996 currently accepted programs. (Of course, as
6997 compound literals are not part of ISO C++, the
6998 standard has nothing to say.) */
7000 NIC_NCC))
7001 {
7004 }
7005 /* Form the representation of the compound-literal. */
7006 postfix_expression
7011 }
7012 }
7014 /* It must be a primary-expression. */
7015 postfix_expression
7018 decltype_p,
7020 }
7022 }
7024 /* Note that we don't need to worry about calling build_cplus_new on a
7025 class-valued CALL_EXPR in decltype when it isn't the end of the
7026 postfix-expression; unary_complex_lvalue will take care of that for
7027 all these cases. */
7029 /* Keep looping until the postfix-expression is complete. */
7031 {
7035 /* It is not a Koenig lookup function call. */
7036 postfix_expression
7039 /* Peek at the next token. */
7043 {
7046 {
7048 "two consecutive %<[%> shall "
7051 }
7052 postfix_expression
7054 postfix_expression,
7056 decltype_p);
7065 /* postfix-expression ( expression-list [opt] ) */
7066 {
7077 is_builtin_constant_p
7080 {
7081 /* The whole point of __builtin_constant_p is to allow
7082 non-constant expressions to appear as arguments. */
7083 saved_integral_constant_expression_p
7085 saved_non_integral_constant_expression_p
7088 }
7089 args = (cp_parser_parenthesized_expression_list
7096 {
7097 parser->integral_constant_expression_p
7099 parser->non_integral_constant_expression_p
7101 }
7104 {
7107 }
7109 /* Function calls are not permitted in
7110 constant-expressions. */
7113 NIC_FUNC_CALL))
7114 {
7118 }
7123 {
7125 {
7127 {
7130 postfix_expression
7132 complain);
7133 }
7134 else
7135 postfix_expression
7137 }
7138 /* We do not perform argument-dependent lookup if
7139 normal lookup finds a non-function, in accordance
7140 with the expected resolution of DR 218. */
7143 {
7147 /* Do not do argument dependent lookup if regular
7148 lookup finds a member function or a block-scope
7149 function declaration. [basic.lookup.argdep]/3 */
7152 {
7155 postfix_expression
7157 complain);
7158 }
7159 }
7160 }
7163 {
7173 {
7175 postfix_expression
7179 }
7182 {
7183 postfix_expression
7184 = (build_new_method_call
7190 complain));
7191 }
7192 else
7193 postfix_expression
7197 complain);
7198 }
7202 postfix_expression = (build_offset_ref_call_from_tree
7204 complain));
7206 /* A call to a static class member, or a namespace-scope
7207 function. */
7208 postfix_expression
7211 koenig_p,
7212 complain);
7213 else
7214 /* All other function calls. */
7215 postfix_expression
7218 koenig_p,
7219 complain);
7222 {
7224 start_loc,
7225 close_paren_loc);
7227 }
7229 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7233 }
7238 /* postfix-expression . template [opt] id-expression
7239 postfix-expression . pseudo-destructor-name
7240 postfix-expression -> template [opt] id-expression
7241 postfix-expression -> pseudo-destructor-name */
7243 /* Consume the `.' or `->' operator. */
7246 postfix_expression
7248 postfix_expression,
7255 /* postfix-expression ++ */
7256 /* Consume the `++' token. */
7258 /* Generate a representation for the complete expression. */
7259 postfix_expression
7261 POSTINCREMENT_EXPR);
7262 /* Increments may not appear in constant-expressions. */
7270 /* postfix-expression -- */
7271 /* Consume the `--' token. */
7273 /* Generate a representation for the complete expression. */
7274 postfix_expression
7276 POSTDECREMENT_EXPR);
7277 /* Decrements may not appear in constant-expressions. */
7288 return is_member_access
7289 ? postfix_expression
7291 else
7293 }
7294 }
7296 /* We should never get here. */
7299 }
7301 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7302 by cp_parser_builtin_offsetof. We're looking for
7304 postfix-expression [ expression ]
7305 postfix-expression [ braced-init-list ] (C++11)
7307 FOR_OFFSETOF is set if we're being called in that context, which
7308 changes how we deal with integer constant expressions. */
7310 static tree
7312 tree postfix_expression,
7315 {
7320 /* Consume the `[' token. */
7326 /* Parse the index expression. */
7327 /* ??? For offsetof, there is a question of what to allow here. If
7328 offsetof is not being used in an integral constant expression context,
7329 then we *could* get the right answer by computing the value at runtime.
7330 If we are in an integral constant expression context, then we might
7331 could accept any constant expression; hard to say without analysis.
7332 Rather than open the barn door too wide right away, allow only integer
7333 constant expressions here. */
7336 else
7337 {
7339 {
7344 }
7345 else
7347 }
7351 /* Look for the closing `]'. */
7354 /* Build the ARRAY_REF. */
7358 /* When not doing offsetof, array references are not permitted in
7359 constant-expressions. */
7365 }
7367 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7368 dereference of incomplete type, returns true if error_mark_node should
7369 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7370 and *DEPENDENT_P. */
7372 bool
7375 {
7376 /* In a template, be permissive by treating an object expression
7377 of incomplete type as dependent (after a pedwarn). */
7378 diagnostic_t kind = (processing_template_decl
7382 {
7394 /* Don't emit any diagnostic for OVERLOADs. */
7398 /* Avoid clobbering e.g. DECLs. */
7402 }
7414 {
7417 }
7419 }
7421 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7422 by cp_parser_builtin_offsetof. We're looking for
7424 postfix-expression . template [opt] id-expression
7425 postfix-expression . pseudo-destructor-name
7426 postfix-expression -> template [opt] id-expression
7427 postfix-expression -> pseudo-destructor-name
7429 FOR_OFFSETOF is set if we're being called in that context. That sorta
7430 limits what of the above we'll actually accept, but nevermind.
7431 TOKEN_TYPE is the "." or "->" token, which will already have been
7432 removed from the stream. */
7434 static tree
7437 cp_expr postfix_expression,
7439 location_t location)
7440 {
7441 tree name;
7447 /* If this is a `->' operator, dereference the pointer. */
7450 tf_warning_or_error);
7451 /* Check to see whether or not the expression is type-dependent and
7452 not the current instantiation. */
7454 /* The identifier following the `->' or `.' is not qualified. */
7460 /* Enter the scope corresponding to the type of the object
7461 given by the POSTFIX_EXPRESSION. */
7463 {
7465 /* According to the standard, no expression should ever have
7466 reference type. Unfortunately, we do not currently match
7467 the standard in this respect in that our internal representation
7468 of an expression may have reference type even when the standard
7469 says it does not. Therefore, we have to manually obtain the
7470 underlying type here. */
7472 /* The type of the POSTFIX_EXPRESSION must be complete. */
7473 /* Unlike the object expression in other contexts, *this is not
7474 required to be of complete type for purposes of class member
7475 access (5.2.5) outside the member function body. */
7479 {
7485 }
7488 {
7489 /* Let the name lookup machinery know that we are processing a
7490 class member access expression. */
7492 /* If something went wrong, we want to be able to discern that case,
7493 as opposed to the case where there was no SCOPE due to the type
7494 of expression being dependent. */
7497 /* If the SCOPE was erroneous, make the various semantic analysis
7498 functions exit quickly -- and without issuing additional error
7499 messages. */
7502 }
7503 }
7506 /* Tell cp_parser_lookup_name that there was an object, even though it's
7507 type-dependent. */
7510 /* Assume this expression is not a pseudo-destructor access. */
7513 /* If the SCOPE is a scalar type, then, if this is a valid program,
7514 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7515 is type dependent, it can be pseudo-destructor-name or something else.
7516 Try to parse it as pseudo-destructor-name first. */
7518 {
7519 tree s;
7520 tree type;
7523 /* Parse the pseudo-destructor-name. */
7532 {
7534 postfix_expression
7537 }
7538 }
7541 {
7542 /* If the SCOPE is not a scalar type, we are looking at an
7543 ordinary class member access expression, rather than a
7544 pseudo-destructor-name. */
7547 /* Parse the id-expression. */
7548 name = (cp_parser_id_expression
7555 /* In general, build a SCOPE_REF if the member name is qualified.
7556 However, if the name was not dependent and has already been
7557 resolved; there is no need to build the SCOPE_REF. For example;
7559 struct X { void f(); };
7560 template <typename T> void f(T* t) { t->X::f(); }
7562 Even though "t" is dependent, "X::f" is not and has been resolved
7563 to a BASELINK; there is no need to include scope information. */
7565 /* But we do need to remember that there was an explicit scope for
7566 virtual function calls. */
7570 /* If the name is a template-id that names a type, we will get a
7571 TYPE_DECL here. That is invalid code. */
7573 {
7576 }
7577 else
7578 {
7580 {
7582 {
7586 }
7587 else
7590 name,
7591 template_p);
7595 }
7597 adjust_result_of_qualified_name_lookup
7599 postfix_expression
7601 template_p,
7602 tf_warning_or_error);
7603 /* Build a location e.g.:
7604 ptr->access_expr
7605 ~~~^~~~~~~~~~~~~
7606 where the caret is at the deref token, ranging from
7607 the start of postfix_expression to the end of the access expr. */
7608 location_t end_loc
7610 location_t combined_loc
7613 }
7614 }
7616 /* We no longer need to look up names in the scope of the object on
7617 the left-hand side of the `.' or `->' operator. */
7620 /* Outside of offsetof, these operators may not appear in
7621 constant-expressions. */
7623 && (cp_parser_non_integral_constant_expression
7628 }
7630 /* Parse a parenthesized expression-list.
7632 expression-list:
7633 assignment-expression
7634 expression-list, assignment-expression
7636 attribute-list:
7637 expression-list
7638 identifier
7639 identifier, expression-list
7641 CAST_P is true if this expression is the target of a cast.
7643 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7644 argument pack.
7646 WRAP_LOCATIONS_P is true if expressions within this list for which
7647 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7648 their source locations.
7650 Returns a vector of trees. Each element is a representation of an
7651 assignment-expression. NULL is returned if the ( and or ) are
7652 missing. An empty, but allocated, vector is returned on no
7653 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7654 if we are parsing an attribute list for an attribute that wants a
7655 plain identifier argument, normal_attr for an attribute that wants
7656 an expression, or non_attr if we aren't parsing an attribute list. If
7657 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7658 not all of the expressions in the list were constant.
7659 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7660 will be written to with the location of the closing parenthesis. If
7661 an error occurs, it may or may not be written to. */
7671 {
7677 /* Assume all the expressions will be constant. */
7681 matching_parens parens;
7687 /* Within a parenthesized expression, a `>' token is always
7688 the greater-than operator. */
7689 saved_greater_than_is_operator_p
7695 /* Consume expressions until there are no more. */
7698 {
7699 /* At the beginning of attribute lists, check to see if the
7700 next token is an identifier. */
7703 {
7706 /* Consume the identifier. */
7708 /* Save the identifier. */
7710 }
7711 else
7712 {
7715 /* Parse the next assignment-expression. */
7717 {
7718 /* A braced-init-list. */
7724 }
7726 {
7727 expr = (cp_parser_constant_expression
7732 }
7733 else
7735 cast_p);
7740 /* If we have an ellipsis, then this is an expression
7741 expansion. */
7744 {
7745 /* Consume the `...'. */
7748 /* Build the argument pack. */
7750 }
7755 /* Add it to the list. We add error_mark_node
7756 expressions to the list, so that we can still tell if
7757 the correct form for a parenthesized expression-list
7758 is found. That gives better errors. */
7763 }
7765 /* After the first item, attribute lists look the same as
7766 expression lists. */
7769 get_comma:;
7770 /* If the next token isn't a `,', then we are done. */
7774 /* Otherwise, consume the `,' and keep going. */
7776 }
7782 {
7785 skip_comma:;
7786 /* We try and resync to an unnested comma, as that will give the
7787 user better diagnostics. */
7795 {
7796 parser->greater_than_is_operator_p
7799 }
7800 }
7802 parser->greater_than_is_operator_p
7809 }
7811 /* Parse a pseudo-destructor-name.
7813 pseudo-destructor-name:
7814 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7815 :: [opt] nested-name-specifier template template-id :: ~ type-name
7816 :: [opt] nested-name-specifier [opt] ~ type-name
7818 If either of the first two productions is used, sets *SCOPE to the
7819 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7820 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7821 or ERROR_MARK_NODE if the parse fails. */
7823 static void
7825 tree object,
7828 {
7831 /* Handle ~auto. */
7835 {
7838 "%<~auto%> only available with "
7845 }
7847 /* Assume that things will not work out. */
7850 /* Look for the optional `::' operator. */
7852 /* Look for the optional nested-name-specifier. */
7853 nested_name_specifier_p
7860 /* Now, if we saw a nested-name-specifier, we might be doing the
7861 second production. */
7864 {
7865 /* Consume the `template' keyword. */
7867 /* Parse the template-id. */
7871 class_type,
7873 /* Look for the `::' token. */
7875 }
7876 /* If the next token is not a `~', then there might be some
7877 additional qualification. */
7879 {
7880 /* At this point, we're looking for "type-name :: ~". The type-name
7881 must not be a class-name, since this is a pseudo-destructor. So,
7882 it must be either an enum-name, or a typedef-name -- both of which
7883 are just identifiers. So, we peek ahead to check that the "::"
7884 and "~" tokens are present; if they are not, then we can avoid
7885 calling type_name. */
7889 {
7892 }
7894 /* Look for the type-name. */
7899 /* Look for the `::' token. */
7901 }
7902 else
7905 /* Look for the `~'. */
7908 /* Once we see the ~, this has to be a pseudo-destructor. */
7912 /* Look for the type-name again. We are not responsible for
7913 checking that it matches the first type-name. */
7915 }
7917 /* Parse a unary-expression.
7919 unary-expression:
7920 postfix-expression
7921 ++ cast-expression
7922 -- cast-expression
7923 unary-operator cast-expression
7924 sizeof unary-expression
7925 sizeof ( type-id )
7926 alignof ( type-id ) [C++0x]
7927 new-expression
7928 delete-expression
7930 GNU Extensions:
7932 unary-expression:
7933 __extension__ cast-expression
7934 __alignof__ unary-expression
7935 __alignof__ ( type-id )
7936 alignof unary-expression [C++0x]
7937 __real__ cast-expression
7938 __imag__ cast-expression
7939 && identifier
7940 sizeof ( type-id ) { initializer-list , [opt] }
7941 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7942 __alignof__ ( type-id ) { initializer-list , [opt] }
7944 ADDRESS_P is true iff the unary-expression is appearing as the
7945 operand of the `&' operator. CAST_P is true if this expression is
7946 the target of a cast.
7948 Returns a representation of the expression. */
7950 static cp_expr
7953 {
7957 /* Peek at the next token. */
7959 /* Some keywords give away the kind of expression. */
7961 {
7965 {
7968 {
7976 /* Consume the token. */
7978 /* Parse the operand. */
7984 else
7985 {
7986 /* ISO C++ defines alignof only with types, not with
7987 expressions. So pedwarn if alignof is used with a non-
7988 type expression. However, __alignof__ is ok. */
7991 "ISO C++ does not allow %<alignof%> "
7995 }
7996 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7997 SIZEOF_EXPR with the original operand. */
7999 {
8001 {
8003 {
8006 error_mark_node));
8008 }
8009 else
8013 }
8014 }
8016 /* Construct a location e.g. :
8017 alignof (expr)
8018 ^~~~~~~~~~~~~~
8019 with start == caret at the start of the "alignof"/"sizeof"
8020 token, with the endpoint at the final closing paren. */
8021 location_t finish_loc
8023 location_t compound_loc
8030 }
8039 {
8040 /* The saved value of the PEDANTIC flag. */
8042 tree expr;
8044 /* Save away the PEDANTIC flag. */
8046 /* Parse the cast-expression. */
8048 /* Restore the PEDANTIC flag. */
8052 }
8056 {
8057 tree expression;
8059 /* Consume the `__real__' or `__imag__' token. */
8061 /* Parse the cast-expression. */
8063 /* Create the complete representation. */
8067 expression,
8068 tf_warning_or_error);
8069 }
8077 {
8078 tree expr;
8087 matching_parens parens;
8091 parser->type_definition_forbidden_message
8094 saved_integral_constant_expression_p
8096 saved_non_integral_constant_expression_p
8100 saved_greater_than_is_operator_p
8112 parser->greater_than_is_operator_p
8115 parser->integral_constant_expression_p
8117 parser->non_integral_constant_expression_p
8122 location_t finish_loc
8126 /* Construct a location of the form:
8127 noexcept (expr)
8128 ^~~~~~~~~~~~~~~
8129 with start == caret, finishing at the close-paren. */
8130 location_t noexcept_loc
8134 noexcept_loc);
8135 }
8139 }
8140 }
8142 /* Look for the `:: new' and `:: delete', which also signal the
8143 beginning of a new-expression, or delete-expression,
8144 respectively. If the next token is `::', then it might be one of
8145 these. */
8147 {
8150 /* See if the token after the `::' is one of the keywords in
8151 which we're interested. */
8153 /* If it's `new', we have a new-expression. */
8156 /* Similarly, for `delete'. */
8159 }
8161 /* Look for a unary operator. */
8163 /* The `++' and `--' operators can be handled similarly, even though
8164 they are not technically unary-operators in the grammar. */
8166 {
8171 /* Handle the GNU address-of-label extension. */
8174 {
8175 tree identifier;
8176 tree expression;
8179 /* Consume the '&&' token. */
8181 /* Look for the identifier. */
8182 location_t finish_loc
8185 /* Construct a location of the form:
8186 &&label
8187 ^~~~~~~
8188 with caret==start at the "&&", finish at the end of the label. */
8189 location_t combined_loc
8191 /* Create an expression representing the address. */
8194 NIC_ADDR_LABEL))
8197 }
8198 }
8200 {
8201 cp_expr cast_expression;
8207 /* Consume the operator token. */
8211 /* Parse the cast-expression. */
8212 cast_expression
8217 pidk);
8219 /* Make a location:
8220 OP_TOKEN CAST_EXPRESSION
8221 ^~~~~~~~~~~~~~~~~~~~~~~~~
8222 with start==caret at the operator token, and
8223 extending to the end of the cast_expression. */
8226 /* Now, build an appropriate representation. */
8228 {
8232 RO_UNARY_STAR,
8233 complain);
8234 /* TODO: build_x_indirect_ref does not always honor the
8235 location, so ensure it is set. */
8241 /* Fall through. */
8244 cast_expression,
8245 complain);
8246 /* TODO: build_x_unary_op does not always honor the location,
8247 so ensure it is set. */
8255 /* Fall through. */
8257 /* Immediately fold negation of a constant, unless the constant is 0
8258 (since -0 == 0) or it would overflow. */
8263 {
8266 cast_expression);
8268 {
8271 }
8272 }
8273 /* Fall through. */
8282 }
8286 non_constant_p))
8290 }
8294 decltype_p,
8295 pidk);
8296 }
8298 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8299 unary-operator, the corresponding tree code is returned. */
8301 static enum tree_code
8303 {
8305 {
8326 }
8327 }
8329 /* Parse a new-expression.
8331 new-expression:
8332 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8333 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8335 Returns a representation of the expression. */
8337 static tree
8339 {
8342 tree type;
8345 tree ret;
8349 /* Look for the optional `::' operator. */
8350 global_scope_p
8354 /* Look for the `new' operator. */
8356 /* There's no easy way to tell a new-placement from the
8357 `( type-id )' construct. */
8359 /* Look for a new-placement. */
8361 /* If that didn't work out, there's no new-placement. */
8363 {
8367 }
8369 /* If the next token is a `(', then we have a parenthesized
8370 type-id. */
8372 {
8376 /* Consume the `('. */
8377 matching_parens parens;
8380 /* Parse the type-id. */
8381 parser->type_definition_forbidden_message
8383 {
8386 }
8389 /* Look for the closing `)'. */
8392 /* There should not be a direct-new-declarator in this production,
8393 but GCC used to allowed this, so we check and emit a sensible error
8394 message for this case. */
8396 {
8402 }
8403 }
8404 /* Otherwise, there must be a new-type-id. */
8405 else
8408 /* If the next token is a `(' or '{', then we have a new-initializer. */
8413 else
8416 /* A new-expression may not appear in an integral constant
8417 expression. */
8420 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8421 of a new-type-id or type-id of a new-expression, the new-expression shall
8422 contain a new-initializer of the form ( assignment-expression )".
8423 Additionally, consistently with the spirit of DR 1467, we want to accept
8424 'new auto { 2 }' too. */
8430 {
8432 "initialization of new-expression for type %<auto%> "
8435 }
8436 else
8437 {
8438 /* Construct a location e.g.:
8439 ptr = new int[100]
8440 ^~~~~~~~~~~~
8441 with caret == start at the start of the "new" token, and the end
8442 at the end of the final token we consumed. */
8447 /* Create a representation of the new-expression. */
8449 tf_warning_or_error);
8451 }
8459 }
8461 /* Parse a new-placement.
8463 new-placement:
8464 ( expression-list )
8466 Returns the same representation as for an expression-list. */
8470 {
8473 /* Parse the expression-list. */
8474 expression_list = (cp_parser_parenthesized_expression_list
8483 }
8485 /* Parse a new-type-id.
8487 new-type-id:
8488 type-specifier-seq new-declarator [opt]
8490 Returns the TYPE allocated. If the new-type-id indicates an array
8491 type, *NELTS is set to the number of elements in the last array
8492 bound; the TYPE will not include the last array bound. */
8494 static tree
8496 {
8497 cp_decl_specifier_seq type_specifier_seq;
8503 /* The type-specifier sequence must not contain type definitions.
8504 (It cannot contain declarations of new types either, but if they
8505 are not definitions we will catch that because they are not
8506 complete.) */
8508 parser->type_definition_forbidden_message
8510 /* Parse the type-specifier-seq. */
8514 /* Restore the old message. */
8520 /* Parse the new-declarator. */
8523 /* Determine the number of elements in the last array dimension, if
8524 any. */
8526 /* Skip down to the last array dimension. */
8531 {
8534 }
8539 {
8542 }
8545 {
8552 else
8554 }
8557 }
8559 /* Parse an (optional) new-declarator.
8561 new-declarator:
8562 ptr-operator new-declarator [opt]
8563 direct-new-declarator
8565 Returns the declarator. */
8569 {
8572 cp_cv_quals cv_quals;
8574 /* We don't know if there's a ptr-operator next, or not. */
8576 /* Look for a ptr-operator. */
8578 /* If that worked, look for more new-declarators. */
8580 {
8583 /* Parse another optional declarator. */
8586 declarator = cp_parser_make_indirect_declarator
8590 }
8592 /* If the next token is a `[', there is a direct-new-declarator. */
8597 }
8599 /* Parse a direct-new-declarator.
8601 direct-new-declarator:
8602 [ expression ]
8603 direct-new-declarator [constant-expression]
8605 */
8609 {
8613 {
8614 tree expression;
8617 /* Look for the opening `['. */
8622 /* The standard requires that the expression have integral
8623 type. DR 74 adds enumeration types. We believe that the
8624 real intent is that these expressions be handled like the
8625 expression in a `switch' condition, which also allows
8626 classes with a single conversion to integral or
8627 enumeration type. */
8629 {
8630 expression
8632 expression,
8635 {
8637 "expression in new-declarator must have integral "
8640 }
8641 }
8643 /* Look for the closing `]'. */
8646 /* Add this bound to the declarator. */
8649 /* If the next token is not a `[', then there are no more
8650 bounds. */
8653 }
8656 }
8658 /* Parse a new-initializer.
8660 new-initializer:
8661 ( expression-list [opt] )
8662 braced-init-list
8664 Returns a representation of the expression-list. */
8668 {
8672 {
8673 tree t;
8680 }
8681 else
8682 expression_list = (cp_parser_parenthesized_expression_list
8688 }
8690 /* Parse a delete-expression.
8692 delete-expression:
8693 :: [opt] delete cast-expression
8694 :: [opt] delete [ ] cast-expression
8696 Returns a representation of the expression. */
8698 static tree
8700 {
8703 tree expression;
8705 /* Look for the optional `::' operator. */
8706 global_scope_p
8710 /* Look for the `delete' keyword. */
8712 /* See if the array syntax is in use. */
8714 {
8715 /* Consume the `[' token. */
8717 /* Look for the `]' token. */
8719 /* Remember that this is the `[]' construct. */
8721 }
8722 else
8725 /* Parse the cast-expression. */
8728 /* A delete-expression may not appear in an integral constant
8729 expression. */
8734 tf_warning_or_error);
8735 }
8737 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8738 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8739 0 otherwise. */
8741 static int
8743 {
8746 {
8788 /* In ((type ()) () the last () isn't a valid cast-expression,
8789 so the whole must be parsed as postfix-expression. */
8794 /* '[' may start a primary-expression in obj-c++ and in C++11,
8795 as a lambda-expression, eg, '(void)[]{}'. */
8802 /* '++' and '--' may or may not start a cast-expression:
8804 struct T { void operator++(int); };
8805 void f() { (T())++; }
8807 vs
8809 int a;
8810 (int)++a; */
8815 }
8816 }
8818 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8819 in the order: const_cast, static_cast, reinterpret_cast.
8821 Don't suggest dynamic_cast.
8823 Return the first legal cast kind found, or NULL otherwise. */
8827 {
8828 tree trial;
8830 /* Reuse the parser logic by attempting to build the various kinds of
8831 cast, with "complain" disabled.
8832 Identify the first such cast that is valid. */
8834 /* Don't attempt to run such logic within template processing. */
8838 /* First try const_cast. */
8843 /* If that fails, try static_cast. */
8848 /* Finally, try reinterpret_cast. */
8853 /* No such cast possible. */
8855 }
8857 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8858 suggesting how to convert a C-style cast of the form:
8860 (DST_TYPE)ORIG_EXPR
8862 to a C++-style cast.
8864 The primary range of RICHLOC is asssumed to be that of the original
8865 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8866 of the parens in the C-style cast. */
8868 static void
8871 tree dst_type)
8872 {
8873 /* This function is non-trivial, so bail out now if the warning isn't
8874 going to be emitted. */
8878 /* Try to find a legal C++ cast, trying them in order:
8879 const_cast, static_cast, reinterpret_cast. */
8884 /* Replace the open paren with "CAST_SUGGESTION<". */
8885 pretty_printer pp;
8889 /* Replace the close paren with "> (". */
8892 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8894 }
8897 /* Parse a cast-expression.
8899 cast-expression:
8900 unary-expression
8901 ( type-id ) cast-expression
8903 ADDRESS_P is true iff the unary-expression is appearing as the
8904 operand of the `&' operator. CAST_P is true if this expression is
8905 the target of a cast.
8907 Returns a representation of the expression. */
8909 static cp_expr
8912 {
8913 /* If it's a `(', then we might be looking at a cast. */
8915 {
8921 /* There's no way to know yet whether or not this is a cast.
8922 For example, `(int (3))' is a unary-expression, while `(int)
8923 3' is a cast. So, we resort to parsing tentatively. */
8925 /* Types may not be defined in a cast. */
8927 parser->type_definition_forbidden_message
8929 /* Consume the `('. */
8930 matching_parens parens;
8935 /* A very tricky bit is that `(struct S) { 3 }' is a
8936 compound-literal (which we permit in C++ as an extension).
8937 But, that construct is not a cast-expression -- it is a
8938 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8939 is legal; if the compound-literal were a cast-expression,
8940 you'd need an extra set of parentheses.) But, if we parse
8941 the type-id, and it happens to be a class-specifier, then we
8942 will commit to the parse at that point, because we cannot
8943 undo the action that is done when creating a new class. So,
8944 then we cannot back up and do a postfix-expression.
8946 Another tricky case is the following (c++/29234):
8948 struct S { void operator () (); };
8950 void foo ()
8951 {
8952 ( S()() );
8953 }
8955 As a type-id we parse the parenthesized S()() as a function
8956 returning a function, groktypename complains and we cannot
8957 back up in this case either.
8959 Therefore, we scan ahead to the closing `)', and check to see
8960 if the tokens after the `)' can start a cast-expression. Otherwise
8961 we are dealing with an unary-expression, a postfix-expression
8962 or something else.
8964 Yet another tricky case, in C++11, is the following (c++/54891):
8966 (void)[]{};
8968 The issue is that usually, besides the case of lambda-expressions,
8969 the parenthesized type-id cannot be followed by '[', and, eg, we
8970 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8971 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8972 we don't commit, we try a cast-expression, then an unary-expression.
8974 Save tokens so that we can put them back. */
8977 /* We may be looking at a cast-expression. */
8980 cast_expression
8983 /* Roll back the tokens we skipped. */
8985 /* If we aren't looking at a cast-expression, simulate an error so
8986 that the call to cp_parser_error_occurred below returns true. */
8989 else
8990 {
8993 /* Look for the type-id. */
8995 /* Look for the closing `)'. */
9000 }
9002 /* Restore the saved message. */
9005 /* At this point this can only be either a cast or a
9006 parenthesized ctor such as `(T ())' that looks like a cast to
9007 function returning T. */
9009 {
9010 /* Only commit if the cast-expression doesn't start with
9011 '++', '--', or '[' in C++11. */
9019 pidk);
9022 {
9023 /* Warn about old-style casts, if so requested. */
9028 {
9034 }
9036 /* Only type conversions to integral or enumeration types
9037 can be used in constant-expressions. */
9040 NIC_CAST))
9043 /* Perform the cast. */
9044 /* Make a location:
9045 (TYPE) EXPR
9046 ^~~~~~~~~~~
9047 with start==caret at the open paren, extending to the
9048 end of "expr". */
9050 open_paren_loc,
9054 }
9055 }
9056 else
9058 }
9060 /* If we get here, then it's not a cast, so it must be a
9061 unary-expression. */
9064 }
9066 /* Parse a binary expression of the general form:
9068 pm-expression:
9069 cast-expression
9070 pm-expression .* cast-expression
9071 pm-expression ->* cast-expression
9073 multiplicative-expression:
9074 pm-expression
9075 multiplicative-expression * pm-expression
9076 multiplicative-expression / pm-expression
9077 multiplicative-expression % pm-expression
9079 additive-expression:
9080 multiplicative-expression
9081 additive-expression + multiplicative-expression
9082 additive-expression - multiplicative-expression
9084 shift-expression:
9085 additive-expression
9086 shift-expression << additive-expression
9087 shift-expression >> additive-expression
9089 relational-expression:
9090 shift-expression
9091 relational-expression < shift-expression
9092 relational-expression > shift-expression
9093 relational-expression <= shift-expression
9094 relational-expression >= shift-expression
9096 GNU Extension:
9098 relational-expression:
9099 relational-expression <? shift-expression
9100 relational-expression >? shift-expression
9102 equality-expression:
9103 relational-expression
9104 equality-expression == relational-expression
9105 equality-expression != relational-expression
9107 and-expression:
9108 equality-expression
9109 and-expression & equality-expression
9111 exclusive-or-expression:
9112 and-expression
9113 exclusive-or-expression ^ and-expression
9115 inclusive-or-expression:
9116 exclusive-or-expression
9117 inclusive-or-expression | exclusive-or-expression
9119 logical-and-expression:
9120 inclusive-or-expression
9121 logical-and-expression && inclusive-or-expression
9123 logical-or-expression:
9124 logical-and-expression
9125 logical-or-expression || logical-and-expression
9127 All these are implemented with a single function like:
9129 binary-expression:
9130 simple-cast-expression
9131 binary-expression <token> binary-expression
9133 CAST_P is true if this expression is the target of a cast.
9135 The binops_by_token map is used to get the tree codes for each <token> type.
9136 binary-expressions are associated according to a precedence table. */
9138 #define TOKEN_PRECEDENCE(token) \
9139 (((token->type == CPP_GREATER \
9140 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9141 && !parser->greater_than_is_operator_p) \
9142 ? PREC_NOT_OPERATOR \
9143 : binops_by_token[token->type].prec)
9145 static cp_expr
9151 {
9152 cp_parser_expression_stack stack;
9154 cp_parser_expression_stack_entry current;
9155 cp_expr rhs;
9159 tree overload;
9161 /* Parse the first expression. */
9172 {
9173 /* Get an operator token. */
9179 {
9181 "%<>>%> operator is treated"
9185 }
9190 /* This is a fold-expression; handle it later. */
9193 /* Popping an entry off the stack means we completed a subexpression:
9194 - either we found a token which is not an operator (`>' where it is not
9195 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9196 will happen repeatedly;
9197 - or, we found an operator which has lower priority. This is the case
9198 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9199 parsing `3 * 4'. */
9201 {
9204 else
9206 }
9208 get_rhs:
9212 /* We used the operator token. */
9215 /* For "false && x" or "true || x", x will never be executed;
9216 disable warnings while evaluating it. */
9218 c_inhibit_evaluation_warnings +=
9221 c_inhibit_evaluation_warnings +=
9224 /* Extract another operand. It may be the RHS of this expression
9225 or the LHS of a new, higher priority expression. */
9230 /* Get another operator token. Look up its precedence to avoid
9231 building a useless (immediately popped) stack entry for common
9232 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9239 {
9240 /* ... and prepare to parse the RHS of the new, higher priority
9241 expression. Since precedence levels on the stack are
9242 monotonically increasing, we do not have to care about
9243 stack overflows. */
9252 pop:
9254 /* If the stack is not empty, we have parsed into LHS the right side
9255 (`4' in the example above) of an expression we had suspended.
9256 We can use the information on the stack to recover the LHS (`3')
9257 from the stack together with the tree code (`MULT_EXPR'), and
9258 the precedence of the higher level subexpression
9259 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9260 which will be used to actually build the additive expression. */
9265 }
9267 /* Undo the disabling of warnings done above. */
9269 c_inhibit_evaluation_warnings -=
9272 c_inhibit_evaluation_warnings -=
9278 /* Avoid warning for !!x == y. */
9283 /* Avoid warning for !b == y where b is boolean. */
9287 /* Avoid warning for !!b == y where b is boolean. */
9300 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9301 ERROR_MARK for everything that is not a binary expression.
9302 This makes warn_about_parentheses miss some warnings that
9303 involve unary operators. For unary expressions we should
9304 pass the correct tree_code unless the unary expression was
9305 surrounded by parentheses.
9306 */
9310 {
9313 else
9314 {
9315 current.lhs
9318 == tcc_comparison
9322 }
9323 }
9324 else
9325 {
9330 /* TODO: build_x_binary_op doesn't always honor the location. */
9332 }
9335 /* If the binary operator required the use of an overloaded operator,
9336 then this expression cannot be an integral constant-expression.
9337 An overloaded operator can be used even if both operands are
9338 otherwise permissible in an integral constant-expression if at
9339 least one of the operands is of enumeration type. */
9343 NIC_OVERLOADED))
9345 }
9348 }
9350 static cp_expr
9355 {
9358 }
9360 /* Parse the `? expression : assignment-expression' part of a
9361 conditional-expression. The LOGICAL_OR_EXPR is the
9362 logical-or-expression that started the conditional-expression.
9363 Returns a representation of the entire conditional-expression.
9365 This routine is used by cp_parser_assignment_expression.
9367 ? expression : assignment-expression
9369 GNU Extensions:
9371 ? : assignment-expression */
9373 static tree
9375 {
9377 cp_expr assignment_expr;
9381 /* Consume the `?' token. */
9386 {
9389 /* Implicit true clause. */
9391 c_inhibit_evaluation_warnings +=
9394 }
9395 else
9396 {
9399 /* Parse the expression. */
9400 c_inhibit_evaluation_warnings +=
9403 c_inhibit_evaluation_warnings +=
9407 }
9409 /* The next token should be a `:'. */
9411 /* Parse the assignment-expression. */
9413 c_inhibit_evaluation_warnings -=
9416 /* Make a location:
9417 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9418 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9419 with the caret at the "?", ranging from the start of
9420 the logical_or_expr to the end of the assignment_expr. */
9425 /* Build the conditional-expression. */
9427 expr,
9428 assignment_expr,
9429 tf_warning_or_error);
9430 }
9432 /* Parse an assignment-expression.
9434 assignment-expression:
9435 conditional-expression
9436 logical-or-expression assignment-operator assignment_expression
9437 throw-expression
9439 CAST_P is true if this expression is the target of a cast.
9440 DECLTYPE_P is true if this expression is the operand of decltype.
9442 Returns a representation for the expression. */
9444 static cp_expr
9447 {
9448 cp_expr expr;
9450 /* If the next token is the `throw' keyword, then we're looking at
9451 a throw-expression. */
9454 /* Otherwise, it must be that we are looking at a
9455 logical-or-expression. */
9456 else
9457 {
9458 /* Parse the binary expressions (logical-or-expression). */
9460 decltype_p,
9462 /* If the next token is a `?' then we're actually looking at a
9463 conditional-expression. */
9466 else
9467 {
9470 /* If it's an assignment-operator, we're using the second
9471 production. */
9472 enum tree_code assignment_operator
9475 {
9478 /* Parse the right-hand side of the assignment. */
9485 /* An assignment may not appear in a
9486 constant-expression. */
9488 NIC_ASSIGNMENT))
9490 /* Build the assignment expression. Its default
9491 location:
9492 LHS = RHS
9493 ~~~~^~~~~
9494 is the location of the '=' token as the
9495 caret, ranging from the start of the lhs to the
9496 end of the rhs. */
9501 assignment_operator,
9502 rhs,
9504 /* TODO: build_x_modify_expr doesn't honor the location,
9505 so we must set it here. */
9507 }
9508 }
9509 }
9512 }
9514 /* Parse an (optional) assignment-operator.
9516 assignment-operator: one of
9517 = *= /= %= += -= >>= <<= &= ^= |=
9519 GNU Extension:
9521 assignment-operator: one of
9522 <?= >?=
9524 If the next token is an assignment operator, the corresponding tree
9525 code is returned, and the token is consumed. For example, for
9526 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9527 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9528 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9529 operator, ERROR_MARK is returned. */
9531 static enum tree_code
9533 {
9537 /* Peek at the next token. */
9541 {
9587 /* Nothing else is an assignment operator. */
9589 }
9591 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9596 /* If it was an assignment operator, consume it. */
9601 }
9603 /* Parse an expression.
9605 expression:
9606 assignment-expression
9607 expression , assignment-expression
9609 CAST_P is true if this expression is the target of a cast.
9610 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9611 except possibly parenthesized or on the RHS of a comma (N3276).
9613 Returns a representation of the expression. */
9615 static cp_expr
9618 {
9623 {
9624 cp_expr assignment_expression;
9626 /* Parse the next assignment-expression. */
9627 assignment_expression
9630 /* We don't create a temporary for a call that is the immediate operand
9631 of decltype or on the RHS of a comma. But when we see a comma, we
9632 need to create a temporary for a call on the LHS. */
9637 assignment_expression
9641 /* If this is the first assignment-expression, we can just
9642 save it away. */
9645 else
9646 {
9647 /* Create a location with caret at the comma, ranging
9648 from the start of the LHS to the end of the RHS. */
9653 assignment_expression,
9656 }
9657 /* If the next token is not a comma, or we're in a fold-expression, then
9658 we are done with the expression. */
9662 /* Consume the `,'. */
9665 /* A comma operator cannot appear in a constant-expression. */
9668 }
9671 }
9673 /* Parse a constant-expression.
9675 constant-expression:
9676 conditional-expression
9678 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9679 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9680 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9681 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9682 only parse a conditional-expression, otherwise parse an
9683 assignment-expression. See below for rationale. */
9685 static cp_expr
9690 {
9694 cp_expr expression;
9696 /* It might seem that we could simply parse the
9697 conditional-expression, and then check to see if it were
9698 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9699 one that the compiler can figure out is constant, possibly after
9700 doing some simplifications or optimizations. The standard has a
9701 precise definition of constant-expression, and we must honor
9702 that, even though it is somewhat more restrictive.
9704 For example:
9706 int i[(2, 3)];
9708 is not a legal declaration, because `(2, 3)' is not a
9709 constant-expression. The `,' operator is forbidden in a
9710 constant-expression. However, GCC's constant-folding machinery
9711 will fold this operation to an INTEGER_CST for `3'. */
9713 /* Save the old settings. */
9715 saved_allow_non_integral_constant_expression_p
9718 /* We are now parsing a constant-expression. */
9720 parser->allow_non_integral_constant_expression_p
9723 /* Although the grammar says "conditional-expression", when not STRICT_P,
9724 we parse an "assignment-expression", which also permits
9725 "throw-expression" and the use of assignment operators. In the case
9726 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9727 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9728 actually essential that we look for an assignment-expression.
9729 For example, cp_parser_initializer_clauses uses this function to
9730 determine whether a particular assignment-expression is in fact
9731 constant. */
9733 {
9734 /* Parse the binary expressions (logical-or-expression). */
9737 /* If the next token is a `?' then we're actually looking at
9738 a conditional-expression; otherwise we're done. */
9741 }
9742 else
9744 /* Restore the old settings. */
9745 parser->integral_constant_expression_p
9747 parser->allow_non_integral_constant_expression_p
9750 {
9751 /* Require an rvalue constant expression here; that's what our
9752 callers expect. Reference constant expressions are handled
9753 separately in e.g. cp_parser_template_argument. */
9762 }
9765 parser->non_integral_constant_expression_p
9769 }
9771 /* Parse __builtin_offsetof.
9773 offsetof-expression:
9774 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9776 offsetof-member-designator:
9777 id-expression
9778 | offsetof-member-designator "." id-expression
9779 | offsetof-member-designator "[" expression "]"
9780 | offsetof-member-designator "->" id-expression */
9782 static cp_expr
9784 {
9786 tree type;
9787 cp_expr expr;
9788 cp_id_kind dummy;
9790 location_t finish_loc;
9792 /* We're about to accept non-integral-constant things, but will
9793 definitely yield an integral constant expression. Save and
9794 restore these values around our local parsing. */
9800 /* Consume the "__builtin_offsetof" token. */
9802 /* Consume the opening `('. */
9803 matching_parens parens;
9805 /* Parse the type-id. */
9807 {
9809 parser->type_definition_forbidden_message
9813 }
9814 /* Look for the `,'. */
9818 /* Build the (type *)null that begins the traditional offsetof macro. */
9819 tree object_ptr
9821 tf_warning_or_error);
9823 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9827 {
9830 {
9832 /* offsetof-member-designator "[" expression "]" */
9838 /* offsetof-member-designator "->" identifier */
9841 /* FALLTHRU */
9844 /* offsetof-member-designator "." identifier */
9852 /* Consume the ")" token. */
9858 /* Error. We know the following require will fail, but
9859 that gives the proper error message. */
9864 }
9865 }
9867 success:
9868 /* Make a location of the form:
9869 __builtin_offsetof (struct s, f)
9870 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9871 with caret at the type-id, ranging from the start of the
9872 "_builtin_offsetof" token to the close paren. */
9874 /* The result will be an INTEGER_CST, so we need to explicitly
9875 preserve the location. */
9878 failure:
9884 }
9886 /* Parse a trait expression.
9888 Returns a representation of the expression, the underlying type
9889 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9891 static cp_expr
9893 {
9894 cp_trait_kind kind;
9900 {
10002 }
10004 /* Get location of initial token. */
10007 /* Consume the token. */
10010 matching_parens parens;
10013 {
10016 }
10022 {
10025 {
10028 }
10032 }
10034 {
10036 {
10040 {
10043 }
10047 }
10048 }
10053 /* Construct a location of the form:
10054 __is_trivially_copyable(_Tp)
10055 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10056 with start == caret, finishing at the close-paren. */
10059 /* Complete the trait expression, which may mean either processing
10060 the trait expr now or saving it for template instantiation. */
10062 {
10071 }
10072 }
10074 /* Parse a lambda expression.
10076 lambda-expression:
10077 lambda-introducer lambda-declarator [opt] compound-statement
10079 Returns a representation of the expression. */
10081 static cp_expr
10083 {
10085 tree type;
10093 {
10095 {
10099 }
10101 }
10103 {
10105 {
10108 }
10110 }
10112 /* We may be in the middle of deferred access check. Disable
10113 it now. */
10124 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10127 /* Now that we've started the type, add the capture fields for any
10128 explicit captures. */
10131 {
10132 /* Inside the class, surrounding template-parameter-lists do not apply. */
10133 unsigned int saved_num_template_parameter_lists
10137 bool fully_implicit_function_template_p
10141 bool auto_is_implicit_function_template_parm_p
10152 /* By virtue of defining a local class, a lambda expression has access to
10153 the private variables of enclosing classes. */
10161 {
10166 }
10168 {
10171 }
10173 /* The capture list was built up in reverse order; fix that now. */
10185 parser->fully_implicit_function_template_p
10189 parser->auto_is_implicit_function_template_parm_p
10191 }
10193 /* This field is only used during parsing of the lambda. */
10196 /* This lambda shouldn't have any proxies left at this point. */
10198 /* And now that we're done, push proxies for an enclosing lambda. */
10203 else
10211 }
10213 /* Parse the beginning of a lambda expression.
10215 lambda-introducer:
10216 [ lambda-capture [opt] ]
10218 LAMBDA_EXPR is the current representation of the lambda expression. */
10220 static void
10222 {
10223 /* Need commas after the first capture. */
10226 /* Eat the leading `['. */
10229 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10237 {
10240 }
10243 {
10245 tree capture_id;
10246 tree capture_init_expr;
10250 enum capture_kind_type
10251 {
10252 BY_COPY,
10253 BY_REFERENCE
10254 };
10258 {
10261 }
10265 else
10268 /* Possibly capture `this'. */
10270 {
10281 explicit_init_p);
10283 }
10285 /* Possibly capture `*this'. */
10288 {
10299 explicit_init_p);
10301 }
10303 /* Remember whether we want to capture as a reference or not. */
10305 {
10308 }
10310 /* Get the identifier. */
10315 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10316 delimiters, but I modified this to stop on unnested ']' as well. It
10317 was already changed to stop on unnested '}', so the
10318 "closing_parenthesis" name is no more misleading with my change. */
10319 {
10325 }
10327 /* Find the initializer for this capture. */
10331 {
10333 /* An explicit initializer exists. */
10336 "lambda capture initializers "
10342 {
10345 }
10346 }
10347 else
10348 {
10351 /* Turn the identifier into an id-expression. */
10352 capture_init_expr
10357 {
10360 }
10363 {
10366 capture_init_expr);
10371 }
10374 {
10377 capture_init_expr))
10381 }
10383 capture_init_expr
10384 = finish_id_expression
10386 capture_init_expr,
10400 {
10403 }
10404 }
10408 {
10413 capture_id);
10417 "capture of %qD redundant with by-reference capture "
10419 }
10422 capture_id,
10423 capture_init_expr,
10425 explicit_init_p);
10427 /* If there is any qualification still in effect, clear it
10428 now; we will be starting fresh with the next capture. */
10432 }
10435 }
10437 /* Parse the (optional) middle of a lambda expression.
10439 lambda-declarator:
10440 < template-parameter-list [opt] >
10441 ( parameter-declaration-clause [opt] )
10442 attribute-specifier [opt]
10443 decl-specifier-seq [opt]
10444 exception-specification [opt]
10445 lambda-return-type-clause [opt]
10447 LAMBDA_EXPR is the current representation of the lambda expression. */
10449 static bool
10451 {
10452 /* 5.1.1.4 of the standard says:
10453 If a lambda-expression does not include a lambda-declarator, it is as if
10454 the lambda-declarator were ().
10455 This means an empty parameter list, no attributes, and no exception
10456 specification. */
10463 cp_decl_specifier_seq lambda_specs;
10466 /* The template-parameter-list is optional, but must begin with
10467 an opening angle if present. */
10469 {
10472 "lambda templates are only available with "
10476 "lambda templates are only available with "
10485 /* We just processed one more parameter list. */
10487 }
10489 /* The parameter-declaration-clause is optional (unless
10490 template-parameter-list was given), but must begin with an
10491 opening parenthesis if present. */
10493 {
10494 matching_parens parens;
10499 /* Parse parameters. */
10502 /* Default arguments shall not be specified in the
10503 parameter-declaration-clause of a lambda-declarator. */
10514 /* In the decl-specifier-seq of the lambda-declarator, each
10515 decl-specifier shall either be mutable or constexpr. */
10519 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10522 {
10527 }
10531 /* Parse optional exception specification. */
10534 /* Parse optional trailing return type. */
10536 {
10539 }
10541 /* The function parameters must be in scope all the way until after the
10542 trailing-return-type in case of decltype. */
10544 }
10548 /* Create the function call operator.
10550 Messing with declarators like this is no uglier than building up the
10551 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10552 other code. */
10553 {
10554 cp_decl_specifier_seq return_type_specs;
10556 tree fco;
10564 {
10568 else
10571 }
10580 VIRT_SPEC_UNSPECIFIED,
10581 REF_QUAL_NONE,
10582 tx_qual,
10583 exception_spec,
10591 declarator,
10592 attributes);
10594 {
10597 /* Give the object parameter a different name. */
10599 }
10601 {
10605 }
10614 }
10615 }
10617 /* Parse the body of a lambda expression, which is simply
10619 compound-statement
10621 but which requires special handling.
10622 LAMBDA_EXPR is the current representation of the lambda expression. */
10624 static void
10626 {
10633 else
10634 /* Still increment function_depth so that we don't GC in the
10635 middle of an expression. */
10640 /* Clear this in case we're in the middle of a default argument. */
10644 {
10648 matching_braces braces;
10651 {
10654 /* Originally C++11 required us to peek for 'return expr'; and
10655 process it specially here to deduce the return type. N3638
10656 removed the need for that. */
10664 }
10667 }
10674 else
10676 }
10678 /* Statements [gram.stmt.stmt] */
10680 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10682 static void
10684 {
10688 /* A concept is never expanded normally. */
10694 }
10696 /* Parse a statement.
10698 statement:
10699 labeled-statement
10700 expression-statement
10701 compound-statement
10702 selection-statement
10703 iteration-statement
10704 jump-statement
10705 declaration-statement
10706 try-block
10708 C++11:
10710 statement:
10711 labeled-statement
10712 attribute-specifier-seq (opt) expression-statement
10713 attribute-specifier-seq (opt) compound-statement
10714 attribute-specifier-seq (opt) selection-statement
10715 attribute-specifier-seq (opt) iteration-statement
10716 attribute-specifier-seq (opt) jump-statement
10717 declaration-statement
10718 attribute-specifier-seq (opt) try-block
10720 init-statement:
10721 expression-statement
10722 simple-declaration
10724 TM Extension:
10726 statement:
10727 atomic-statement
10729 IN_COMPOUND is true when the statement is nested inside a
10730 cp_parser_compound_statement; this matters for certain pragmas.
10732 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10733 is a (possibly labeled) if statement which is not enclosed in braces
10734 and has an else clause. This is used to implement -Wparentheses.
10736 CHAIN is a vector of if-else-if conditions. */
10738 static void
10742 {
10747 restart:
10750 /* There is no statement yet. */
10756 /* In obj-c++, seeing '[[' might be the either the beginning of
10757 c++11 attributes, or a nested objc-message-expression. So
10758 let's parse the c++11 attributes tentatively. */
10762 {
10765 }
10767 /* Peek at the next token. */
10769 /* Remember the location of the first token in the statement. */
10772 /* If this is a keyword, then that will often determine what kind of
10773 statement we have. */
10775 {
10779 {
10782 /* Looks like a labeled-statement with a case label.
10783 Parse the label, and then use tail recursion to parse
10784 the statement. */
10807 /* Objective-C++ exception-handling constructs. */
10821 /* This must be a namespace alias definition. */
10837 /* It might be a keyword like `int' that can start a
10838 declaration-statement. */
10840 }
10841 }
10843 {
10844 /* If the next token is a `:', then we are looking at a
10845 labeled-statement. */
10848 {
10849 /* Looks like a labeled-statement with an ordinary label.
10850 Parse the label, and then use tail recursion to parse
10851 the statement. */
10856 }
10857 }
10858 /* Anything that starts with a `{' must be a compound-statement. */
10861 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10862 a statement all its own. */
10864 {
10865 /* Only certain OpenMP pragmas are attached to statements, and thus
10866 are considered statements themselves. All others are not. In
10867 the context of a compound, accept the pragma as a "statement" and
10868 return so that we can check for a close brace. Otherwise we
10869 require a real statement and must go back and read one. */
10875 }
10877 {
10880 }
10882 /* Everything else must be a declaration-statement or an
10883 expression-statement. Try for the declaration-statement
10884 first, unless we are looking at a `;', in which case we know that
10885 we have an expression-statement. */
10887 {
10889 {
10891 {
10892 /* Attributes should be parsed as part of the the
10893 declaration, so let's un-parse them. */
10896 }
10899 /* Try to parse the declaration-statement. */
10901 /* If that worked, we're done. */
10904 }
10905 /* All preceding labels have been parsed at this point. */
10909 /* Look for an expression-statement instead. */
10912 /* Handle [[fallthrough]];. */
10914 {
10915 /* The next token after the fallthrough attribute is ';'. */
10917 {
10918 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10920 IFN_FALLTHROUGH,
10923 }
10924 else
10928 }
10929 }
10931 /* Set the line number for the statement. */
10935 /* Allow "[[fallthrough]];", but warn otherwise. */
10938 OPT_Wattributes,
10940 }
10942 /* Append ATTR to attribute list ATTRS. */
10944 static tree
10946 {
10952 }
10954 /* Parse the label for a labeled-statement, i.e.
10956 identifier :
10957 case constant-expression :
10958 default :
10960 GNU Extension:
10961 case constant-expression ... constant-expression : statement
10963 When a label is parsed without errors, the label is added to the
10964 parse tree by the finish_* functions, so this function doesn't
10965 have to return the label. */
10967 static void
10969 {
10974 /* The next token should be an identifier. */
10978 {
10981 }
10983 /* Remember whether this case or a user-defined label is allowed to fall
10984 through to. */
10989 {
10991 {
10995 /* Consume the `case' token. */
10997 /* Parse the constant-expression. */
11004 {
11005 /* Consume the `...' token. */
11011 /* We don't need to emit warnings here, as the common code
11012 will do this for us. */
11013 }
11014 else
11018 {
11022 }
11023 else
11026 expr);
11027 }
11031 /* Consume the `default' token. */
11035 {
11039 }
11040 else
11045 /* Anything else must be an ordinary label. */
11050 }
11052 /* Require the `:' token. */
11055 /* An ordinary label may optionally be followed by attributes.
11056 However, this is only permitted if the attributes are then
11057 followed by a semicolon. This is because, for backward
11058 compatibility, when parsing
11059 lab: __attribute__ ((unused)) int i;
11060 we want the attribute to attach to "i", not "lab". */
11063 {
11064 tree attrs;
11071 ;
11072 else
11074 }
11080 }
11082 /* Parse an expression-statement.
11084 expression-statement:
11085 expression [opt] ;
11087 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11088 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11089 indicates whether this expression-statement is part of an
11090 expression statement. */
11092 static tree
11094 {
11099 /* There might be attribute fallthrough. */
11102 /* If the next token is a ';', then there is no expression
11103 statement. */
11105 {
11109 {
11112 }
11113 }
11115 /* Handle [[fallthrough]];. */
11117 {
11118 /* The next token after the fallthrough attribute is ';'. */
11120 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11123 else
11127 }
11129 /* Allow "[[fallthrough]];", but warn otherwise. */
11134 /* Give a helpful message for "A<T>::type t;" and the like. */
11137 {
11144 {
11145 /* A::A a; */
11150 }
11151 }
11153 /* Consume the final `;'. */
11158 /* This is the final expression statement of a statement
11159 expression. */
11165 }
11167 /* Parse a compound-statement.
11169 compound-statement:
11170 { statement-seq [opt] }
11172 GNU extension:
11174 compound-statement:
11175 { label-declaration-seq [opt] statement-seq [opt] }
11177 label-declaration-seq:
11178 label-declaration
11179 label-declaration-seq label-declaration
11181 Returns a tree representing the statement. */
11183 static tree
11186 {
11187 tree compound_stmt;
11188 matching_braces braces;
11190 /* Consume the `{'. */
11197 /* Begin the compound-statement. */
11199 /* If the next keyword is `__label__' we have a label declaration. */
11202 /* Parse an (optional) statement-seq. */
11204 /* Finish the compound-statement. */
11206 /* Consume the `}'. */
11210 }
11212 /* Parse an (optional) statement-seq.
11214 statement-seq:
11215 statement
11216 statement-seq [opt] statement */
11218 static void
11220 {
11221 /* Scan statements until there aren't any more. */
11223 {
11226 /* If we are looking at a `}', then we have run out of
11227 statements; the same is true if we have reached the end
11228 of file, or have stumbled upon a stray '@end'. */
11235 /* If we are in a compound statement and find 'else' then
11236 something went wrong. */
11238 {
11241 else
11242 {
11245 }
11246 }
11248 /* Parse the statement. */
11250 }
11251 }
11253 /* Return true if this is the C++20 version of range-based-for with
11254 init-statement. */
11256 static bool
11258 {
11261 /* Save tokens so that we can put them back. */
11264 /* There has to be an unnested ; followed by an unnested :. */
11267 CPP_SEMICOLON,
11271 /* We found the semicolon, eat it now. */
11274 /* Now look for ':' that is not nested in () or {}. */
11277 CPP_COLON,
11280 out:
11281 /* Roll back the tokens we skipped. */
11285 }
11287 /* Return true if we're looking at (init; cond), false otherwise. */
11289 static bool
11291 {
11292 /* Save tokens so that we can put them back. */
11295 /* Look for ';' that is not nested in () or {}. */
11298 CPP_SEMICOLON,
11301 /* Roll back the tokens we skipped. */
11305 }
11307 /* Parse a selection-statement.
11309 selection-statement:
11310 if ( init-statement [opt] condition ) statement
11311 if ( init-statement [opt] condition ) statement else statement
11312 switch ( init-statement [opt] condition ) statement
11314 Returns the new IF_STMT or SWITCH_STMT.
11316 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11317 is a (possibly labeled) if statement which is not enclosed in
11318 braces and has an else clause. This is used to implement
11319 -Wparentheses.
11321 CHAIN is a vector of if-else-if conditions. This is used to implement
11322 -Wduplicated-cond. */
11324 static tree
11327 {
11330 token_indent_info guard_tinfo;
11335 /* Peek at the next token. */
11339 /* See what kind of keyword it is. */
11342 {
11345 {
11346 tree statement;
11347 tree condition;
11352 RID_CONSTEXPR))
11353 {
11359 }
11361 /* Look for the `('. */
11362 matching_parens parens;
11364 {
11367 }
11369 /* Begin the selection-statement. */
11371 {
11374 }
11375 else
11378 /* Parse the optional init-statement. */
11380 {
11381 tree decl;
11384 "init-statement in selection statements only available "
11387 }
11389 /* Parse the condition. */
11391 /* Look for the `)'. */
11397 {
11401 /* Add the condition. */
11408 /* Parse the then-clause. */
11412 /* Outside a template, the non-selected branch of a constexpr
11413 if is a 'discarded statement', i.e. unevaluated. */
11418 {
11421 }
11424 guard_tinfo);
11431 {
11435 }
11437 /* If the next token is `else', parse the else-clause. */
11439 RID_ELSE))
11440 {
11444 {
11447 }
11449 guard_tinfo
11451 /* Consume the `else' keyword. */
11454 {
11456 RID_IF)
11458 {
11459 /* We've got "if (COND) else if (COND2)". Start
11460 the condition chain and add COND as the first
11461 element. */
11465 {
11466 /* Wrap it in a NOP_EXPR so that we can set the
11467 location of the condition. */
11469 condition);
11472 }
11473 }
11475 RID_IF))
11476 {
11477 /* This is if-else without subsequent if. Zap the
11478 condition chain; we would have already warned at
11479 this point. */
11482 }
11483 }
11485 /* Parse the else-clause. */
11491 /* If we are currently parsing a then-clause, then
11492 IF_P will not be NULL. We set it to true to
11493 indicate that this if statement has an else clause.
11494 This may trigger the Wparentheses warning below
11495 when we get back up to the parent if statement. */
11500 {
11504 }
11505 }
11506 else
11507 {
11508 /* This if statement does not have an else clause. If
11509 NESTED_IF is true, then the then-clause has an if
11510 statement which does have an else clause. We warn
11511 about the potential ambiguity. */
11514 "suggest explicit braces to avoid ambiguous"
11517 {
11518 /* We don't need the condition chain anymore. */
11521 }
11522 }
11524 /* Now we're all done with the if-statement. */
11526 }
11527 else
11528 {
11532 /* Add the condition. */
11535 /* Parse the body of the switch-statement. */
11541 guard_tinfo);
11545 /* Now we're all done with the switch-statement. */
11547 }
11550 }
11556 }
11557 }
11559 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11560 If we have seen at least one decl-specifier, and the next token
11561 is not a parenthesis, then we must be looking at a declaration.
11562 (After "int (" we might be looking at a functional cast.) */
11564 static void
11567 {
11573 }
11575 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
11576 The declarator shall not specify a function or an array. Returns
11577 TRUE if the declarator is valid, FALSE otherwise. */
11579 static bool
11582 location_t loc)
11583 {
11587 {
11592 else
11600 }
11601 else
11603 }
11605 /* Parse a condition.
11607 condition:
11608 expression
11609 type-specifier-seq declarator = initializer-clause
11610 type-specifier-seq declarator braced-init-list
11612 GNU Extension:
11614 condition:
11615 type-specifier-seq declarator asm-specification [opt]
11616 attributes [opt] = assignment-expression
11618 Returns the expression that should be tested. */
11620 static tree
11622 {
11623 cp_decl_specifier_seq type_specifiers;
11627 /* Try the declaration first. */
11629 /* New types are not allowed in the type-specifier-seq for a
11630 condition. */
11632 parser->type_definition_forbidden_message
11634 /* Parse the type-specifier-seq. */
11636 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11639 /* Restore the saved message. */
11645 /* If all is well, we might be looking at a declaration. */
11647 {
11648 tree decl;
11649 tree asm_specification;
11650 tree attributes;
11655 /* Parse the declarator. */
11661 /* Parse the attributes. */
11663 /* Parse the asm-specification. */
11665 /* If the next token is not an `=' or '{', then we might still be
11666 looking at an expression. For example:
11668 if (A(a).x)
11670 looks like a decl-specifier-seq and a declarator -- but then
11671 there is no `=', so this is an expression. */
11676 /* If we did see an `=' or '{', then we are looking at a declaration
11677 for sure. */
11679 {
11680 tree pushed_scope;
11687 /* Create the declaration. */
11693 /* Parse the initializer. */
11695 {
11699 }
11701 {
11702 /* Consume the `='. */
11706 }
11707 else
11708 {
11711 }
11715 /* Process the initializer. */
11718 asm_specification,
11719 flags);
11725 }
11726 }
11727 /* If we didn't even get past the declarator successfully, we are
11728 definitely not looking at a declaration. */
11729 else
11732 /* Otherwise, we are looking at an expression. */
11734 }
11736 /* Parses a for-statement or range-for-statement until the closing ')',
11737 not included. */
11739 static tree
11741 {
11745 /* Begin the for-statement. */
11748 /* Parse the initialization. */
11753 else
11755 }
11757 static tree
11760 {
11761 /* Normal for loop */
11764 tree stmt;
11767 /* The init-statement has already been parsed in
11768 cp_parser_init_statement, so no work is needed here. */
11771 /* If there's a condition, process it. */
11775 {
11779 }
11781 {
11785 }
11787 /* Look for the `;'. */
11790 /* If there's an expression, process it. */
11796 }
11798 /* Tries to parse a range-based for-statement:
11800 range-based-for:
11801 decl-specifier-seq declarator : expression
11803 The decl-specifier-seq declarator and the `:' are already parsed by
11804 cp_parser_init_statement. If processing_template_decl it returns a
11805 newly created RANGE_FOR_STMT; if not, it is converted to a
11806 regular FOR_STMT. */
11808 static tree
11811 {
11818 /* Get the range declaration momentarily out of the way so that
11819 the range expression doesn't clash with it. */
11821 {
11823 {
11825 /* For decomposition declaration get all of the corresponding
11826 declarations out of the way. */
11830 {
11836 {
11842 }
11843 }
11844 }
11846 {
11851 }
11852 }
11855 {
11858 }
11859 else
11862 /* Put the range declaration(s) back into scope. */
11864 {
11868 }
11870 /* If in template, STMT is converted to a normal for-statement
11871 at instantiation. If not, it is done just ahead. */
11873 {
11883 /* do_auto_deduction doesn't mess with template init-lists. */
11886 }
11887 else
11888 {
11892 unroll);
11893 }
11895 }
11897 /* Subroutine of cp_convert_range_for: given the initializer expression,
11898 builds up the range temporary. */
11900 static tree
11902 {
11905 /* Find out the type deduced by the declaration
11906 `auto &&__range = range_expr'. */
11911 /* Create the __range variable. */
11918 }
11920 /* Used by cp_parser_range_for in template context: we aren't going to
11921 do a full conversion yet, but we still need to resolve auto in the
11922 type of the for-range-declaration if present. This is basically
11923 a shortcut version of cp_convert_range_for. */
11925 static void
11927 {
11930 {
11933 iter_type = (cp_parser_perform_range_for_lookup
11936 {
11938 iter_type);
11940 RO_UNARY_STAR,
11941 tf_warning_or_error);
11944 }
11945 }
11946 }
11948 /* Converts a range-based for-statement into a normal
11949 for-statement, as per the definition.
11951 for (RANGE_DECL : RANGE_EXPR)
11952 BLOCK
11954 should be equivalent to:
11956 {
11957 auto &&__range = RANGE_EXPR;
11958 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11959 __begin != __end;
11960 ++__begin)
11961 {
11962 RANGE_DECL = *__begin;
11963 BLOCK
11964 }
11965 }
11967 If RANGE_EXPR is an array:
11968 BEGIN_EXPR = __range
11969 END_EXPR = __range + ARRAY_SIZE(__range)
11970 Else if RANGE_EXPR has a member 'begin' or 'end':
11971 BEGIN_EXPR = __range.begin()
11972 END_EXPR = __range.end()
11973 Else:
11974 BEGIN_EXPR = begin(__range)
11975 END_EXPR = end(__range);
11977 If __range has a member 'begin' but not 'end', or vice versa, we must
11978 still use the second alternative (it will surely fail, however).
11979 When calling begin()/end() in the third alternative we must use
11980 argument dependent lookup, but always considering 'std' as an associated
11981 namespace. */
11983 tree
11987 {
11995 /* If an error happened previously do nothing or else a lot of
11996 unhelpful errors would be issued. */
11998 else
11999 {
12000 tree range_temp;
12004 /* Can't bind a reference to an array of runtime bound. */
12006 else
12007 {
12012 LOOKUP_ONLYCONVERTING);
12014 }
12017 }
12019 /* The new for initialization statement. */
12027 LOOKUP_ONLYCONVERTING);
12038 LOOKUP_ONLYCONVERTING);
12042 /* The new for condition. */
12049 /* The new increment expression. */
12052 tf_warning_or_error);
12058 /* The declaration is initialized with *__begin inside the loop body. */
12061 tf_warning_or_error),
12063 LOOKUP_ONLYCONVERTING);
12068 }
12070 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12071 We need to solve both at the same time because the method used
12072 depends on the existence of members begin or end.
12073 Returns the type deduced for the iterator expression. */
12075 static tree
12077 {
12079 {
12082 }
12085 {
12090 }
12092 {
12093 /* If RANGE is an array, we will use pointer arithmetic. */
12096 range,
12100 }
12101 else
12102 {
12103 /* If it is not an array, we must do a bit of magic. */
12113 tf_warning_or_error);
12116 tf_warning_or_error);
12119 {
12120 /* Use the member functions. */
12123 }
12124 else
12125 {
12126 /* Use global functions with ADL. */
12133 tf_warning_or_error);
12135 tf_warning_or_error);
12137 tf_warning_or_error);
12139 tf_warning_or_error);
12142 }
12144 /* Last common checks. */
12146 {
12147 /* If one of the expressions is an error do no more checks. */
12150 }
12153 /* Can happen, when, eg, in a template context, Koenig lookup
12154 can't resolve begin/end (c++/58503). */
12156 else
12157 {
12159 /* The unqualified type of the __begin and __end temporaries should
12160 be the same, as required by the multiple auto declaration. */
12162 {
12169 /* P0184R0 allows __begin and __end to have different types,
12170 but make sure they are comparable so we can give a better
12172 else
12176 }
12178 }
12179 }
12180 }
12182 /* Helper function for cp_parser_perform_range_for_lookup.
12183 Builds a tree for RANGE.IDENTIFIER(). */
12185 static tree
12187 {
12200 tf_warning_or_error);
12203 }
12205 /* Parse an iteration-statement.
12207 iteration-statement:
12208 while ( condition ) statement
12209 do statement while ( expression ) ;
12210 for ( init-statement condition [opt] ; expression [opt] )
12211 statement
12213 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12215 static tree
12218 {
12221 tree statement;
12223 token_indent_info guard_tinfo;
12225 /* Peek at the next token. */
12232 /* Remember whether or not we are already within an iteration
12233 statement. */
12236 /* See what kind of keyword it is. */
12239 {
12241 {
12242 tree condition;
12244 /* Begin the while-statement. */
12246 /* Look for the `('. */
12247 matching_parens parens;
12249 /* Parse the condition. */
12252 /* Look for the `)'. */
12254 /* Parse the dependent statement. */
12260 /* We're done with the while-statement. */
12262 }
12266 {
12267 tree expression;
12269 /* Begin the do-statement. */
12271 /* Parse the body of the do-statement. */
12278 /* Look for the `while' keyword. */
12280 /* Look for the `('. */
12281 matching_parens parens;
12283 /* Parse the expression. */
12285 /* We're done with the do-statement. */
12287 /* Look for the `)'. */
12289 /* Look for the `;'. */
12291 }
12295 {
12296 /* Look for the `('. */
12297 matching_parens parens;
12302 /* Look for the `)'. */
12305 /* Parse the body of the for-statement. */
12312 /* We're done with the for-statement. */
12314 }
12321 }
12324 }
12326 /* Parse a init-statement or the declarator of a range-based-for.
12327 Returns true if a range-based-for declaration is seen.
12329 init-statement:
12330 expression-statement
12331 simple-declaration */
12333 static bool
12335 {
12336 /* If the next token is a `;', then we have an empty
12337 expression-statement. Grammatically, this is also a
12338 simple-declaration, but an invalid one, because it does not
12339 declare anything. Therefore, if we did not handle this case
12340 specially, we would issue an error message about an invalid
12341 declaration. */
12343 {
12347 /* Try to parse the init-statement. */
12349 {
12350 tree dummy;
12352 /* Parse the declaration. */
12358 /* That didn't work, try to parse it as an expression-statement. */
12362 {
12364 "range-based %<for%> loops with initializer only "
12367 }
12368 }
12370 /* A colon is used in range-based for. */
12373 /* We're going to speculatively look for a declaration, falling back
12374 to an expression, if necessary. */
12376 /* Parse the declaration. */
12379 decl);
12382 {
12383 /* It is a range-for, consume the ':'. */
12387 {
12389 "range-based %<for%> loops only available with "
12392 }
12393 }
12394 else
12395 /* The ';' is not consumed yet because we told
12396 cp_parser_simple_declaration not to. */
12401 /* If the tentative parse failed, then we shall need to look for an
12402 expression-statement. */
12403 }
12404 /* If we are here, it is an expression-statement. */
12407 }
12409 /* Parse a jump-statement.
12411 jump-statement:
12412 break ;
12413 continue ;
12414 return expression [opt] ;
12415 return braced-init-list ;
12416 goto identifier ;
12418 GNU extension:
12420 jump-statement:
12421 goto * expression ;
12423 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12425 static tree
12427 {
12433 /* Peek at the next token. */
12438 /* See what kind of keyword it is. */
12441 {
12445 {
12462 }
12468 {
12472 /* Fall through. */
12482 }
12487 {
12488 tree expr;
12492 {
12496 }
12499 else
12500 /* If the next token is a `;', then there is no
12501 expression. */
12503 /* Build the return-statement. */
12506 else
12508 /* Look for the final `;'. */
12510 }
12516 {
12519 }
12521 /* Create the goto-statement. */
12523 {
12524 /* Issue a warning about this use of a GNU extension. */
12526 /* Consume the '*' token. */
12528 /* Parse the dependent expression. */
12530 }
12531 else
12533 /* Look for the final `;'. */
12540 }
12543 }
12545 /* Parse a declaration-statement.
12547 declaration-statement:
12548 block-declaration */
12550 static void
12552 {
12555 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12558 /* Parse the block-declaration. */
12561 /* Free any declarators allocated. */
12563 }
12565 /* Some dependent statements (like `if (cond) statement'), are
12566 implicitly in their own scope. In other words, if the statement is
12567 a single statement (as opposed to a compound-statement), it is
12568 none-the-less treated as if it were enclosed in braces. Any
12569 declarations appearing in the dependent statement are out of scope
12570 after control passes that point. This function parses a statement,
12571 but ensures that is in its own scope, even if it is not a
12572 compound-statement.
12574 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12575 is a (possibly labeled) if statement which is not enclosed in
12576 braces and has an else clause. This is used to implement
12577 -Wparentheses.
12579 CHAIN is a vector of if-else-if conditions. This is used to implement
12580 -Wduplicated-cond.
12582 Returns the new statement. */
12584 static tree
12588 {
12589 tree statement;
12592 token_indent_info body_tinfo
12598 /* Mark if () ; with a special NOP_EXPR. */
12600 {
12611 }
12612 /* if a compound is opened, we simply parse the statement directly. */
12615 /* If the token is not a `{', then we must take special action. */
12616 else
12617 {
12618 /* Create a compound-statement. */
12620 /* Parse the dependent-statement. */
12623 /* Finish the dummy compound-statement. */
12625 }
12627 token_indent_info next_tinfo
12636 /* Return the statement. */
12638 }
12640 /* For some dependent statements (like `while (cond) statement'), we
12641 have already created a scope. Therefore, even if the dependent
12642 statement is a compound-statement, we do not want to create another
12643 scope. */
12645 static void
12648 {
12649 /* If the token is a `{', then we must take special action. */
12651 {
12652 token_indent_info body_tinfo
12658 token_indent_info next_tinfo
12667 }
12668 else
12669 {
12670 /* Avoid calling cp_parser_compound_statement, so that we
12671 don't create a new scope. Do everything else by hand. */
12672 matching_braces braces;
12674 /* If the next keyword is `__label__' we have a label declaration. */
12677 /* Parse an (optional) statement-seq. */
12680 }
12681 }
12683 /* Declarations [gram.dcl.dcl] */
12685 /* Parse an optional declaration-sequence.
12687 declaration-seq:
12688 declaration
12689 declaration-seq declaration */
12691 static void
12693 {
12695 {
12706 {
12707 /* A declaration consisting of a single semicolon is
12708 invalid. Allow it unless we're being pedantic. */
12713 }
12715 /* If we're entering or exiting a region that's implicitly
12716 extern "C", modify the lang context appropriately. */
12718 {
12721 }
12723 {
12726 }
12729 {
12730 /* A top-level declaration can consist solely of a #pragma.
12731 A nested declaration cannot, so this is done here and not
12732 in cp_parser_declaration. (A #pragma at block scope is
12733 handled in cp_parser_statement.) */
12736 }
12738 /* Parse the declaration itself. */
12740 }
12741 }
12743 /* Parse a declaration.
12745 declaration:
12746 block-declaration
12747 function-definition
12748 template-declaration
12749 explicit-instantiation
12750 explicit-specialization
12751 linkage-specification
12752 namespace-definition
12754 C++17:
12755 deduction-guide
12757 GNU extension:
12759 declaration:
12760 __extension__ declaration */
12762 static void
12764 {
12765 cp_token token1;
12766 cp_token token2;
12771 /* Check for the `__extension__' keyword. */
12773 {
12774 /* Parse the qualified declaration. */
12776 /* Restore the PEDANTIC flag. */
12780 }
12782 /* Try to figure out what kind of declaration is present. */
12787 else
12788 {
12791 }
12793 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12796 /* If the next token is `extern' and the following token is a string
12797 literal, then we have a linkage specification. */
12801 /* If the next token is `template', then we have either a template
12802 declaration, an explicit instantiation, or an explicit
12803 specialization. */
12805 {
12806 /* `template <>' indicates a template specialization. */
12810 /* `template <' indicates a template declaration. */
12813 /* Anything else must be an explicit instantiation. */
12814 else
12816 }
12817 /* If the next token is `export', then we have a template
12818 declaration. */
12821 /* If the next token is `extern', 'static' or 'inline' and the one
12822 after that is `template', we have a GNU extended explicit
12823 instantiation directive. */
12830 /* If the next token is `namespace', check for a named or unnamed
12831 namespace definition. */
12840 /* An unnamed namespace definition. */
12844 /* An inline (associated) namespace definition. */
12848 /* Objective-C++ declaration/definition. */
12855 /* At this point we may have a template declared by a concept
12856 introduction. */
12861 else
12862 /* Try to parse a block-declaration, or a function-definition. */
12865 /* Free any declarators allocated. */
12867 }
12869 /* Parse a block-declaration.
12871 block-declaration:
12872 simple-declaration
12873 asm-definition
12874 namespace-alias-definition
12875 using-declaration
12876 using-directive
12878 GNU Extension:
12880 block-declaration:
12881 __extension__ block-declaration
12883 C++0x Extension:
12885 block-declaration:
12886 static_assert-declaration
12888 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12889 part of a declaration-statement. */
12891 static void
12894 {
12898 /* Check for the `__extension__' keyword. */
12900 {
12901 /* Parse the qualified declaration. */
12903 /* Restore the PEDANTIC flag. */
12907 }
12909 /* Peek at the next token to figure out which kind of declaration is
12910 present. */
12913 /* If the next keyword is `asm', we have an asm-definition. */
12915 {
12919 }
12920 /* If the next keyword is `namespace', we have a
12921 namespace-alias-definition. */
12924 /* If the next keyword is `using', we have a
12925 using-declaration, a using-directive, or an alias-declaration. */
12927 {
12932 /* If the token after `using' is `namespace', then we have a
12933 using-directive. */
12937 /* If the second token after 'using' is '=', then we have an
12938 alias-declaration. */
12944 /* Otherwise, it's a using-declaration. */
12945 else
12948 }
12949 /* If the next keyword is `__label__' we have a misplaced label
12950 declaration. */
12952 {
12956 /* If the next token is now a `;', consume it. */
12959 }
12960 /* If the next token is `static_assert' we have a static assertion. */
12963 /* Anything else must be a simple-declaration. */
12964 else
12967 }
12969 /* Parse a simple-declaration.
12971 simple-declaration:
12972 decl-specifier-seq [opt] init-declarator-list [opt] ;
12973 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12974 brace-or-equal-initializer ;
12976 init-declarator-list:
12977 init-declarator
12978 init-declarator-list , init-declarator
12980 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12981 function-definition as a simple-declaration.
12983 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12984 parsed declaration if it is an uninitialized single declarator not followed
12985 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12986 if present, will not be consumed. */
12988 static void
12992 {
12993 cp_decl_specifier_seq decl_specifiers;
13002 /* Defer access checks until we know what is being declared; the
13003 checks for names appearing in the decl-specifier-seq should be
13004 done as if we were in the scope of the thing being declared. */
13007 /* Parse the decl-specifier-seq. We have to keep track of whether
13008 or not the decl-specifier-seq declares a named class or
13009 enumeration type, since that is the only case in which the
13010 init-declarator-list is allowed to be empty.
13012 [dcl.dcl]
13014 In a simple-declaration, the optional init-declarator-list can be
13015 omitted only when declaring a class or enumeration, that is when
13016 the decl-specifier-seq contains either a class-specifier, an
13017 elaborated-type-specifier, or an enum-specifier. */
13019 CP_PARSER_FLAGS_OPTIONAL,
13022 /* We no longer need to defer access checks. */
13025 /* In a block scope, a valid declaration must always have a
13026 decl-specifier-seq. By not trying to parse declarators, we can
13027 resolve the declaration/expression ambiguity more quickly. */
13030 {
13033 }
13035 /* If the next two tokens are both identifiers, the code is
13036 erroneous. The usual cause of this situation is code like:
13038 T t;
13040 where "T" should name a type -- but does not. */
13043 {
13044 /* If parsing tentatively, we should commit; we really are
13045 looking at a declaration. */
13047 /* Give up. */
13049 }
13054 /* Look for C++17 decomposition declaration. */
13062 {
13063 tree decl
13065 maybe_range_for_decl,
13068 /* The next token should be either a `,' or a `;'. */
13070 /* If it's a `;', we are done. */
13074 {
13078 }
13079 /* Anything else is an error. */
13080 else
13081 {
13082 /* If we have already issued an error message we don't need
13083 to issue another one. */
13088 /* Skip tokens until we reach the end of the statement. */
13090 /* If the next token is now a `;', consume it. */
13094 }
13095 }
13096 else
13099 tree last_type;
13101 /* NULL_TREE if both variable and function declaration are allowed,
13102 error_mark_node if function declaration are not allowed and
13103 a FUNCTION_DECL that should be diagnosed if it is followed by
13104 variable declarations. */
13105 tree auto_function_declaration;
13108 auto_specifier_p
13112 /* Keep going until we hit the `;' at the end of the simple
13113 declaration. */
13116 CPP_SEMICOLON))
13117 {
13120 tree decl;
13124 {
13125 /* If we are processing next declarator, comma is expected */
13130 {
13134 }
13135 }
13136 else
13139 /* Parse the init-declarator. */
13142 function_definition_allowed_p,
13144 declares_class_or_enum,
13146 maybe_range_for_decl,
13149 /* If an error occurred while parsing tentatively, exit quickly.
13150 (That usually happens when in the body of a function; each
13151 statement is treated as a declaration-statement until proven
13152 otherwise.) */
13157 {
13158 /* If the init-declarator-list contains more than one
13159 init-declarator, they shall all form declarations of
13160 variables. */
13162 auto_function_declaration
13166 {
13168 "non-variable %qD in declaration with more than one "
13173 }
13174 }
13178 {
13182 {
13183 /* If the list of declarators contains more than one declarator,
13184 the type of each declared variable is determined as described
13185 above. If the type deduced for the template parameter U is not
13186 the same in each deduction, the program is ill-formed. */
13191 }
13192 else
13194 }
13196 /* Handle function definitions specially. */
13198 {
13199 /* If the next token is a `,', then we are probably
13200 processing something like:
13202 void f() {}, *p;
13204 which is erroneous. */
13206 {
13209 "mixing"
13211 }
13212 /* Otherwise, we're done with the list of declarators. */
13213 else
13214 {
13217 }
13218 }
13221 /* The next token should be either a `,' or a `;'. */
13223 /* If it's a `,', there are more declarators to come. */
13226 /* If it's a `;', we are done. */
13230 {
13235 }
13236 /* Anything else is an error. */
13237 else
13238 {
13239 /* If we have already issued an error message we don't need
13240 to issue another one. */
13245 /* Skip tokens until we reach the end of the statement. */
13247 /* If the next token is now a `;', consume it. */
13251 }
13252 /* After the first time around, a function-definition is not
13253 allowed -- even if it was OK at first. For example:
13255 int i, f() {}
13257 is not valid. */
13259 }
13261 /* Issue an error message if no declarators are present, and the
13262 decl-specifier-seq does not itself declare a class or
13263 enumeration: [dcl.dcl]/3. */
13265 {
13267 {
13271 /* Ensure an error is issued anyway when finish_decltype_type,
13272 called via cp_parser_decl_specifier_seq, returns a class or
13273 an enumeration (c++/51786). */
13276 }
13277 /* Perform any deferred access checks. */
13279 }
13281 /* Consume the `;'. */
13282 finish:
13286 {
13292 }
13294 done:
13296 }
13298 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13299 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13300 initializer ; */
13302 static tree
13307 {
13312 /* Parse the identifier-list. */
13316 {
13324 }
13328 {
13334 else
13335 {
13338 }
13339 }
13345 tree pushed_scope;
13352 NULL_TREE);
13359 cp_expr e;
13360 cp_decl_specifier_seq decl_specs;
13365 {
13368 else
13371 tree elt_pushed_scope;
13377 {
13378 /* Ensure we've diagnosed redeclaration if we aren't creating
13379 a new VAR_DECL. */
13382 }
13383 else
13387 }
13390 {
13393 }
13397 {
13405 || (is_direct_init
13408 {
13412 }
13415 {
13420 }
13421 }
13423 {
13425 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13426 the underlying DECL. */
13428 }
13434 {
13437 }
13440 }
13442 /* Parse a decl-specifier-seq.
13444 decl-specifier-seq:
13445 decl-specifier-seq [opt] decl-specifier
13446 decl-specifier attribute-specifier-seq [opt] (C++11)
13448 decl-specifier:
13449 storage-class-specifier
13450 type-specifier
13451 function-specifier
13452 friend
13453 typedef
13455 GNU Extension:
13457 decl-specifier:
13458 attributes
13460 Concepts Extension:
13462 decl-specifier:
13463 concept
13465 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13467 The parser flags FLAGS is used to control type-specifier parsing.
13469 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13470 flags:
13472 1: one of the decl-specifiers is an elaborated-type-specifier
13473 (i.e., a type declaration)
13474 2: one of the decl-specifiers is an enum-specifier or a
13475 class-specifier (i.e., a type definition)
13477 */
13479 static void
13481 cp_parser_flags flags,
13484 {
13488 cp_decl_spec ds;
13490 /* Clear DECL_SPECS. */
13493 /* Assume no class or enumeration type is declared. */
13496 /* Keep reading specifiers until there are no more to read. */
13498 {
13503 /* Peek at the next token. */
13506 /* Save the first token of the decl spec list for error
13507 reporting. */
13510 /* Handle attributes. */
13512 {
13513 /* Parse the attributes. */
13516 /* In a sequence of declaration specifiers, c++11 attributes
13517 appertain to the type that precede them. In that case
13518 [dcl.spec]/1 says:
13520 The attribute-specifier-seq affects the type only for
13521 the declaration it appears in, not other declarations
13522 involving the same type.
13524 But for now let's force the user to position the
13525 attribute either at the beginning of the declaration or
13526 after the declarator-id, which would clearly mean that it
13527 applies to the declarator. */
13529 {
13531 /* The c++11 attribute is at the beginning of the
13532 declaration. It appertains to the entity being
13534 else
13535 {
13537 {
13538 /* This is an attribute following a
13539 class-specifier. */
13544 }
13545 else
13546 {
13547 decl_specs->std_attributes
13551 }
13553 }
13554 }
13556 decl_specs->attributes
13561 }
13562 /* Assume we will find a decl-specifier keyword. */
13564 /* If the next token is an appropriate keyword, we can simply
13565 add it to the list. */
13567 {
13568 /* decl-specifier:
13569 friend
13570 constexpr */
13573 {
13578 }
13579 else
13580 {
13582 /* Consume the token. */
13584 }
13597 /* function-specifier:
13598 inline
13599 virtual
13600 explicit */
13607 /* decl-specifier:
13608 typedef */
13611 /* Consume the token. */
13613 /* A constructor declarator cannot appear in a typedef. */
13615 /* The "typedef" keyword can only occur in a declaration; we
13616 may as well commit at this point. */
13623 /* storage-class-specifier:
13624 auto
13625 register
13626 static
13627 extern
13628 mutable
13630 GNU Extension:
13631 thread */
13634 {
13635 /* Consume the token. */
13638 /* Complain about `auto' as a storage specifier, if
13639 we're complaining about C++0x compatibility. */
13643 "%<auto%> changes meaning in C++11; "
13646 /* Set the storage class anyway. */
13648 token);
13649 }
13650 else
13651 /* C++0x auto type-specifier. */
13659 /* Consume the token. */
13662 token);
13665 /* Consume the token. */
13671 /* We did not yet find a decl-specifier yet. */
13674 }
13691 /* Constructors are a special case. The `S' in `S()' is not a
13692 decl-specifier; it is the beginning of the declarator. */
13693 constructor_p
13694 = (!found_decl_spec
13695 && constructor_possible_p
13696 && (cp_parser_constructor_declarator_p
13699 /* If we don't have a DECL_SPEC yet, then we must be looking at
13700 a type-specifier. */
13702 {
13705 tree type_spec;
13707 type_spec
13709 decl_specs,
13715 /* If this type-specifier referenced a user-defined type
13716 (a typedef, class-name, etc.), then we can't allow any
13717 more such type-specifiers henceforth.
13719 [dcl.spec]
13721 The longest sequence of decl-specifiers that could
13722 possibly be a type name is taken as the
13723 decl-specifier-seq of a declaration. The sequence shall
13724 be self-consistent as described below.
13726 [dcl.type]
13728 As a general rule, at most one type-specifier is allowed
13729 in the complete decl-specifier-seq of a declaration. The
13730 only exceptions are the following:
13732 -- const or volatile can be combined with any other
13733 type-specifier.
13735 -- signed or unsigned can be combined with char, long,
13736 short, or int.
13738 -- ..
13740 Example:
13742 typedef char* Pc;
13743 void g (const int Pc);
13745 Here, Pc is *not* part of the decl-specifier seq; it's
13746 the declarator. Therefore, once we see a type-specifier
13747 (other than a cv-qualifier), we forbid any additional
13748 user-defined types. We *do* still allow things like `int
13749 int' to be considered a decl-specifier-seq, and issue the
13750 error message later. */
13753 /* A constructor declarator cannot follow a type-specifier. */
13755 {
13760 }
13761 }
13763 /* If we still do not have a DECL_SPEC, then there are no more
13764 decl-specifiers. */
13769 /* After we see one decl-specifier, further decl-specifiers are
13770 always optional. */
13772 }
13774 /* Don't allow a friend specifier with a class definition. */
13779 }
13781 /* Parse an (optional) storage-class-specifier.
13783 storage-class-specifier:
13784 auto
13785 register
13786 static
13787 extern
13788 mutable
13790 GNU Extension:
13792 storage-class-specifier:
13793 thread
13795 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13797 static tree
13799 {
13801 {
13805 /* Fall through for C++98. */
13813 /* Consume the token. */
13818 }
13819 }
13821 /* Parse an (optional) function-specifier.
13823 function-specifier:
13824 inline
13825 virtual
13826 explicit
13828 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13829 Updates DECL_SPECS, if it is non-NULL. */
13831 static tree
13834 {
13837 {
13843 /* 14.5.2.3 [temp.mem]
13845 A member function template shall not be virtual. */
13849 else
13859 }
13861 /* Consume the token. */
13863 }
13865 /* Parse a linkage-specification.
13867 linkage-specification:
13868 extern string-literal { declaration-seq [opt] }
13869 extern string-literal declaration */
13871 static void
13873 {
13874 tree linkage;
13876 /* Look for the `extern' keyword. */
13877 cp_token *extern_token
13880 /* Look for the string-literal. */
13884 /* Transform the literal into an identifier. If the literal is a
13885 wide-character string, or contains embedded NULs, then we can't
13886 handle it as the user wants. */
13889 {
13891 /* Assume C++ linkage. */
13893 }
13894 else
13897 /* We're now using the new linkage. */
13900 /* Preserve the location of the the innermost linkage specification,
13901 tracking the locations of nested specifications via a local. */
13902 location_t saved_location
13904 /* Construct a location ranging from the start of the "extern" to
13905 the end of the string-literal, with the caret at the start, e.g.:
13906 extern "C" {
13907 ^~~~~~~~~~
13908 */
13909 parser->innermost_linkage_specification_location
13914 /* If the next token is a `{', then we're using the first
13915 production. */
13917 {
13921 /* Consume the `{' token. */
13922 matching_braces braces;
13924 /* Parse the declarations. */
13926 /* Look for the closing `}'. */
13928 }
13929 /* Otherwise, there's just one declaration. */
13930 else
13931 {
13934 saved_in_unbraced_linkage_specification_p
13938 parser->in_unbraced_linkage_specification_p
13940 }
13942 /* We're done with the linkage-specification. */
13945 /* Restore location of parent linkage specification, if any. */
13947 }
13949 /* Parse a static_assert-declaration.
13951 static_assert-declaration:
13952 static_assert ( constant-expression , string-literal ) ;
13953 static_assert ( constant-expression ) ; (C++17)
13955 If MEMBER_P, this static_assert is a class member. */
13957 static void
13959 {
13960 cp_expr condition;
13961 location_t token_loc;
13962 tree message;
13965 /* Peek at the `static_assert' token so we can keep track of exactly
13966 where the static assertion started. */
13969 /* Look for the `static_assert' keyword. */
13971 RT_STATIC_ASSERT))
13974 /* We know we are in a static assertion; commit to any tentative
13975 parse. */
13979 /* Parse the `(' starting the static assertion condition. */
13980 matching_parens parens;
13983 /* Parse the constant-expression. Allow a non-constant expression
13984 here in order to give better diagnostics in finish_static_assert. */
13985 condition =
13991 {
13994 "static_assert without a message "
13996 /* Eat the ')' */
14001 }
14002 else
14003 {
14004 /* Parse the separating `,'. */
14007 /* Parse the string-literal message. */
14012 /* A `)' completes the static assertion. */
14018 }
14020 /* A semicolon terminates the declaration. */
14023 /* Get the location for the static assertion. Use that of the
14024 condition if available, otherwise, use that of the "static_assert"
14025 token. */
14030 /* Complete the static assertion, which may mean either processing
14031 the static assert now or saving it for template instantiation. */
14033 }
14035 /* Parse the expression in decltype ( expression ). */
14037 static tree
14040 {
14042 tree expr;
14044 /* Since we're going to preserve any side-effects from this parse, set up a
14045 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14046 in the expression. */
14049 /* First, try parsing an id-expression. */
14060 {
14063 cp_id_kind idk;
14067 /* Lookup the name we got back from the id-expression. */
14072 /* A template without args is not a complete id-expression. */
14081 {
14082 /* Complete lookup of the id-expression. */
14083 expr = (finish_id_expression
14096 /* We found an id-expression, but it was something that we
14097 should not have found. This is an error, not something
14098 we can recover from, so note that we found an
14099 id-expression and we'll recover as gracefully as
14100 possible. */
14102 }
14107 /* We have an id-expression. */
14109 }
14112 {
14113 /* Abort the id-expression parse. */
14116 /* Parsing tentatively, again. */
14119 /* Parse a class member access. */
14127 /* We have an id-expression. */
14129 }
14132 /* We have parsed the complete id-expression or member access. */
14134 else
14135 {
14136 /* Abort our attempt to parse an id-expression or member access
14137 expression. */
14140 /* Commit to the tentative_firewall so we get syntax errors. */
14143 /* Parse a full expression. */
14146 }
14149 }
14151 /* Parse a `decltype' type. Returns the type.
14153 simple-type-specifier:
14154 decltype ( expression )
14155 C++14 proposal:
14156 decltype ( auto ) */
14158 static tree
14160 {
14165 {
14166 /* Already parsed. */
14169 }
14171 /* Look for the `decltype' token. */
14175 /* Parse the opening `('. */
14176 matching_parens parens;
14186 /* decltype (auto) */
14188 else
14189 {
14190 /* decltype (expression) */
14192 /* Types cannot be defined in a `decltype' expression. Save away the
14193 old message and set the new one. */
14195 parser->type_definition_forbidden_message
14198 /* The restrictions on constant-expressions do not apply inside
14199 decltype expressions. */
14200 bool saved_integral_constant_expression_p
14202 bool saved_non_integral_constant_expression_p
14206 /* Within a parenthesized expression, a `>' token is always
14207 the greater-than operator. */
14208 bool saved_greater_than_is_operator_p
14212 /* Do not actually evaluate the expression. */
14215 /* Do not warn about problems with the expression. */
14220 /* Go back to evaluating expressions. */
14224 /* The `>' token might be the end of a template-id or
14225 template-parameter-list now. */
14226 parser->greater_than_is_operator_p
14229 /* Restore the old message and the integral constant expression
14230 flags. */
14232 parser->integral_constant_expression_p
14234 parser->non_integral_constant_expression_p
14236 }
14238 /* Parse to the closing `)'. */
14240 {
14245 }
14248 {
14249 /* Build auto. */
14252 }
14253 else
14255 tf_warning_or_error);
14257 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14258 it again. */
14269 }
14271 /* Special member functions [gram.special] */
14273 /* Parse a conversion-function-id.
14275 conversion-function-id:
14276 operator conversion-type-id
14278 Returns an IDENTIFIER_NODE representing the operator. */
14280 static tree
14282 {
14283 tree type;
14284 tree saved_scope;
14285 tree saved_qualifying_scope;
14286 tree saved_object_scope;
14289 /* Look for the `operator' token. */
14292 /* When we parse the conversion-type-id, the current scope will be
14293 reset. However, we need that information in able to look up the
14294 conversion function later, so we save it here. */
14298 /* We must enter the scope of the class so that the names of
14299 entities declared within the class are available in the
14300 conversion-type-id. For example, consider:
14302 struct S {
14303 typedef int I;
14304 operator I();
14305 };
14307 S::operator I() { ... }
14309 In order to see that `I' is a type-name in the definition, we
14310 must be in the scope of `S'. */
14313 /* Parse the conversion-type-id. */
14315 /* Leave the scope of the class, if any. */
14318 /* Restore the saved scope. */
14322 /* If the TYPE is invalid, indicate failure. */
14326 }
14328 /* Parse a conversion-type-id:
14330 conversion-type-id:
14331 type-specifier-seq conversion-declarator [opt]
14333 Returns the TYPE specified. */
14335 static tree
14337 {
14338 tree attributes;
14339 cp_decl_specifier_seq type_specifiers;
14341 tree type_specified;
14344 /* Parse the attributes. */
14348 parser->type_definition_forbidden_message
14351 /* Parse the type-specifiers. */
14358 /* If that didn't work, stop. */
14361 /* Parse the conversion-declarator. */
14369 /* Don't give this error when parsing tentatively. This happens to
14370 work because we always parse this definitively once. */
14373 {
14375 {
14378 }
14382 }
14385 }
14387 /* Parse an (optional) conversion-declarator.
14389 conversion-declarator:
14390 ptr-operator conversion-declarator [opt]
14392 */
14396 {
14399 cp_cv_quals cv_quals;
14401 /* We don't know if there's a ptr-operator next, or not. */
14403 /* Try the ptr-operator. */
14406 /* If it worked, look for more conversion-declarators. */
14408 {
14411 /* Parse another optional declarator. */
14414 declarator = cp_parser_make_indirect_declarator
14418 }
14421 }
14423 /* Parse an (optional) ctor-initializer.
14425 ctor-initializer:
14426 : mem-initializer-list */
14428 static void
14430 {
14431 /* If the next token is not a `:', then there is no
14432 ctor-initializer. */
14434 {
14435 /* Do default initialization of any bases and members. */
14439 }
14441 /* Consume the `:' token. */
14443 /* And the mem-initializer-list. */
14445 }
14447 /* Parse a mem-initializer-list.
14449 mem-initializer-list:
14450 mem-initializer ... [opt]
14451 mem-initializer ... [opt] , mem-initializer-list */
14453 static void
14455 {
14460 /* Let the semantic analysis code know that we are starting the
14461 mem-initializer-list. */
14466 /* Loop through the list. */
14468 {
14469 tree mem_initializer;
14472 /* Parse the mem-initializer. */
14474 /* If the next token is a `...', we're expanding member initializers. */
14480 {
14481 /* Consume the `...'. */
14485 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14486 can be expanded but members cannot. */
14489 {
14494 }
14496 /* Construct the pack expansion type. */
14499 }
14502 {
14506 }
14507 /* Look for a target constructor. */
14511 {
14514 {
14518 }
14520 }
14521 /* Add it to the list, unless it was erroneous. */
14523 {
14526 }
14527 /* If the next token is not a `,', we're done. */
14530 /* Consume the `,' token. */
14532 }
14534 /* Perform semantic analysis. */
14537 }
14539 /* Parse a mem-initializer.
14541 mem-initializer:
14542 mem-initializer-id ( expression-list [opt] )
14543 mem-initializer-id braced-init-list
14545 GNU extension:
14547 mem-initializer:
14548 ( expression-list [opt] )
14550 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14551 class) or FIELD_DECL (for a non-static data member) to initialize;
14552 the TREE_VALUE is the expression-list. An empty initialization
14553 list is represented by void_list_node. */
14555 static tree
14557 {
14558 tree mem_initializer_id;
14559 tree expression_list;
14560 tree member;
14563 /* Find out what is being initialized. */
14565 {
14569 }
14570 else
14571 {
14575 }
14581 {
14588 }
14589 else
14590 {
14600 }
14610 }
14612 /* Parse a mem-initializer-id.
14614 mem-initializer-id:
14615 :: [opt] nested-name-specifier [opt] class-name
14616 decltype-specifier (C++11)
14617 identifier
14619 Returns a TYPE indicating the class to be initialized for the first
14620 production (and the second in C++11). Returns an IDENTIFIER_NODE
14621 indicating the data member to be initialized for the last production. */
14623 static tree
14625 {
14629 tree id;
14633 /* `typename' is not allowed in this context ([temp.res]). */
14635 {
14637 "keyword %<typename%> not allowed in this context (a qualified "
14640 }
14641 /* Look for the optional `::' operator. */
14642 global_scope_p
14646 /* Look for the optional nested-name-specifier. The simplest way to
14647 implement:
14649 [temp.res]
14651 The keyword `typename' is not permitted in a base-specifier or
14652 mem-initializer; in these contexts a qualified name that
14653 depends on a template-parameter is implicitly assumed to be a
14654 type name.
14656 is to assume that we have seen the `typename' keyword at this
14657 point. */
14658 nested_name_specifier_p
14667 /* If there is a `::' operator or a nested-name-specifier, then we
14668 are definitely looking for a class-name. */
14673 typename_type,
14677 /* Otherwise, we could also be looking for an ordinary identifier. */
14680 /* Try a decltype-specifier. */
14682 else
14683 /* Otherwise, try a class-name. */
14687 none_type,
14691 /* If we found one, we're done. */
14694 /* Otherwise, look for an ordinary identifier. */
14696 }
14698 /* Overloading [gram.over] */
14700 /* Parse an operator-function-id.
14702 operator-function-id:
14703 operator operator
14705 Returns an IDENTIFIER_NODE for the operator which is a
14706 human-readable spelling of the identifier, e.g., `operator +'. */
14708 static cp_expr
14710 {
14711 /* Look for the `operator' keyword. */
14714 /* And then the name of the operator itself. */
14716 }
14718 /* Return an identifier node for a user-defined literal operator.
14719 The suffix identifier is chained to the operator name identifier. */
14721 tree
14723 {
14724 tree identifier;
14731 }
14733 /* Parse an operator.
14735 operator:
14736 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14737 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14738 || ++ -- , ->* -> () []
14740 GNU Extensions:
14742 operator:
14743 <? >? <?= >?=
14745 Returns an IDENTIFIER_NODE for the operator which is a
14746 human-readable spelling of the identifier, e.g., `operator +'. */
14748 static cp_expr
14750 {
14755 /* Peek at the next token. */
14760 /* Figure out which operator we have. */
14765 {
14767 {
14768 /* The keyword should be either `new' or `delete'. */
14773 else
14776 /* Consume the `new' or `delete' token. */
14779 /* Peek at the next token. */
14781 /* If it's a `[' token then this is the array variant of the
14782 operator. */
14784 {
14785 /* Consume the `[' token. */
14787 /* Look for the `]' token. */
14792 }
14796 }
14954 {
14955 /* Consume the `('. */
14956 matching_parens parens;
14958 /* Look for the matching `)'. */
14963 }
14966 /* Consume the `['. */
14968 /* Look for the matching `]'. */
14977 /* FALLTHRU */
14986 {
14993 /* Consume the string. */
14999 {
15002 }
15003 else
15004 {
15006 /* Look for the suffix identifier. */
15011 {
15015 }
15016 else
15017 {
15020 }
15021 }
15026 {
15029 }
15032 {
15035 }
15037 {
15040 }
15042 }
15045 /* Anything else is an error. */
15047 }
15049 /* If we have selected an identifier, we need to consume the
15050 operator token. */
15052 {
15056 }
15057 /* Otherwise, no valid operator name was present. */
15058 else
15059 {
15062 }
15065 }
15067 /* Parse a template-declaration.
15069 template-declaration:
15070 export [opt] template < template-parameter-list > declaration
15072 If MEMBER_P is TRUE, this template-declaration occurs within a
15073 class-specifier.
15075 The grammar rule given by the standard isn't correct. What
15076 is really meant is:
15078 template-declaration:
15079 export [opt] template-parameter-list-seq
15080 decl-specifier-seq [opt] init-declarator [opt] ;
15081 export [opt] template-parameter-list-seq
15082 function-definition
15084 template-parameter-list-seq:
15085 template-parameter-list-seq [opt]
15086 template < template-parameter-list >
15088 Concept Extensions:
15090 template-parameter-list-seq:
15091 template < template-parameter-list > requires-clause [opt]
15093 requires-clause:
15094 requires logical-or-expression */
15096 static void
15098 {
15099 /* Check for `export'. */
15101 {
15102 /* Consume the `export' token. */
15104 /* Warn that we do not support `export'. */
15106 }
15109 }
15111 /* Parse a template-parameter-list.
15113 template-parameter-list:
15114 template-parameter
15115 template-parameter-list , template-parameter
15117 Returns a TREE_LIST. Each node represents a template parameter.
15118 The nodes are connected via their TREE_CHAINs. */
15120 static tree
15122 {
15127 /* The loop below parses the template parms. We first need to know
15128 the total number of template parms to be able to compute proper
15129 canonical types of each dependent type. So after the loop, when
15130 we know the total number of template parms,
15131 end_template_parm_list computes the proper canonical types and
15132 fixes up the dependent types accordingly. */
15134 {
15135 tree parameter;
15138 location_t parm_loc;
15140 /* Parse the template-parameter. */
15145 /* Add it to the list. */
15148 parm_loc,
15149 parameter,
15150 is_non_type,
15151 is_parameter_pack);
15152 else
15153 {
15156 }
15158 /* If the next token is not a `,', we're done. */
15161 /* Otherwise, consume the `,' token. */
15163 }
15166 }
15168 /* Parse a introduction-list.
15170 introduction-list:
15171 introduced-parameter
15172 introduction-list , introduced-parameter
15174 introduced-parameter:
15175 ...[opt] identifier
15177 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15178 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15179 WILDCARD_DECL will also have DECL_NAME set and token location in
15180 DECL_SOURCE_LOCATION. */
15182 static tree
15184 {
15188 {
15193 /* Build placeholder. */
15201 /* If the next token is not a `,', we're done. */
15204 /* Otherwise, consume the `,' token. */
15206 }
15208 /* Convert the vec into a TREE_VEC. */
15211 tree parm;
15217 }
15219 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15220 is an abstract declarator. */
15224 {
15229 }
15231 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15232 is an abstract declarator. */
15236 {
15240 else
15242 }
15244 /* Returns true if DECL represents a constrained-parameter. */
15248 {
15253 }
15255 /* Returns true if PARM declares a constrained-parameter. */
15259 {
15261 }
15263 /* Check that the type parameter is only a declarator-id, and that its
15264 type is not cv-qualified. */
15266 bool
15269 {
15274 {
15277 }
15279 /* Don't allow cv-qualified type parameters. */
15282 {
15285 }
15288 }
15290 /* Finish parsing/processing a template type parameter and checking
15291 various restrictions. */
15295 tree id,
15297 {
15300 else
15302 }
15304 static tree
15306 {
15307 /* FIXME: This should probably be copied, and we may need to adjust
15308 the template parameter depths. */
15318 }
15320 /* Finish parsing/processing a template template parameter by borrowing
15321 the template parameter list from the prototype parameter. */
15323 static tree
15325 tree proto,
15326 tree id,
15328 {
15332 }
15334 /* Create a new non-type template parameter from the given PARM
15335 declarator. */
15337 static tree
15340 {
15346 }
15348 /* Build a constrained template parameter based on the PARMDECL
15349 declarator. The type of PARMDECL is the constrained type, which
15350 refers to the prototype template parameter that ultimately
15351 specifies the type of the declared parameter. */
15353 static tree
15358 {
15364 /* A template parameter constrained by a variadic concept shall also
15365 be declared as a template parameter pack. */
15370 /* Build the parameter. Return an error if the declarator was invalid. */
15371 tree parm;
15376 parmdecl);
15377 else
15382 /* Finish the parameter decl and create a node attaching the
15383 default argument and constraint. */
15388 }
15390 /* Returns true if the parsed type actually represents the declaration
15391 of a type template-parameter. */
15395 {
15398 }
15401 /* Returns true if the parsed type actually represents the declaration of
15402 a template template-parameter. */
15404 static bool
15406 {
15409 }
15411 /* Parse a default argument for a type template-parameter.
15412 Note that diagnostics are handled in cp_parser_template_parameter. */
15414 static tree
15416 {
15419 /* Consume the `=' token. */
15424 /* Parse the default-argument. */
15430 {
15434 }
15437 }
15439 /* Parse a default argument for a template template-parameter. */
15441 static tree
15443 {
15448 /* Consume the `='. */
15450 /* Parse the id-expression. */
15452 /* save token before parsing the id-expression, for error
15453 reporting */
15455 tree default_argument
15463 /* If the id-expression was a template-id that refers to
15464 a template-class, we already have the declaration here,
15465 so no further lookup is needed. */
15466 ;
15467 else
15468 /* Look up the name. */
15469 default_argument
15471 none_type,
15477 /* See if the default argument is valid. */
15481 }
15483 /* Parse a template-parameter.
15485 template-parameter:
15486 type-parameter
15487 parameter-declaration
15489 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15490 the parameter. The TREE_PURPOSE is the default value, if any.
15491 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15492 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15493 set to true iff this parameter is a parameter pack. */
15495 static tree
15498 {
15501 tree parm;
15503 /* Assume it is a type parameter or a template parameter. */
15505 /* Assume it not a parameter pack. */
15507 /* Peek at the next token. */
15509 /* If it is `template', we have a type-parameter. */
15512 /* If it is `class' or `typename' we do not know yet whether it is a
15513 type parameter or a non-type parameter. Consider:
15515 template <typename T, typename T::X X> ...
15517 or:
15519 template <class C, class D*> ...
15521 Here, the first parameter is a type parameter, and the second is
15522 a non-type parameter. We can tell by looking at the token after
15523 the identifier -- if it is a `,', `=', or `>' then we have a type
15524 parameter. */
15526 {
15527 /* Peek at the token after `class' or `typename'. */
15529 /* If it's an ellipsis, we have a template type parameter
15530 pack. */
15533 /* If it's an identifier, skip it. */
15536 /* Now, see if the token looks like the end of a template
15537 parameter. */
15542 }
15544 /* Otherwise, it is a non-type parameter or a constrained parameter.
15546 [temp.param]
15548 When parsing a default template-argument for a non-type
15549 template-parameter, the first non-nested `>' is taken as the end
15550 of the template parameter-list rather than a greater-than
15551 operator. */
15552 parameter_declarator
15559 /* If the parameter declaration is marked as a parameter pack, set
15560 *IS_PARAMETER_PACK to notify the caller. */
15565 {
15566 /* Can happen in some cases of erroneous input (c++/34892). */
15568 /* Consume the `...' for better error recovery. */
15570 }
15572 // The parameter may have been constrained.
15575 parameter_declarator,
15576 is_non_type,
15577 is_parameter_pack);
15579 // Now we're sure that the parameter is a non-type parameter.
15590 }
15592 /* Parse a type-parameter.
15594 type-parameter:
15595 class identifier [opt]
15596 class identifier [opt] = type-id
15597 typename identifier [opt]
15598 typename identifier [opt] = type-id
15599 template < template-parameter-list > class identifier [opt]
15600 template < template-parameter-list > class identifier [opt]
15601 = id-expression
15603 GNU Extension (variadic templates):
15605 type-parameter:
15606 class ... identifier [opt]
15607 typename ... identifier [opt]
15609 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15610 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15611 the declaration of the parameter.
15613 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15615 static tree
15617 {
15619 tree parameter;
15621 /* Look for a keyword to tell us what kind of parameter this is. */
15627 {
15630 {
15631 tree identifier;
15632 tree default_argument;
15634 /* If the next token is an ellipsis, we have a template
15635 argument pack. */
15637 {
15638 /* Consume the `...' token. */
15643 }
15645 /* If the next token is an identifier, then it names the
15646 parameter. */
15649 else
15652 /* Create the parameter. */
15655 /* If the next token is an `=', we have a default argument. */
15657 {
15658 default_argument
15661 /* Template parameter packs cannot have default
15662 arguments. */
15664 {
15667 "template parameter pack %qD cannot have a "
15669 else
15671 "template parameter packs cannot have "
15674 }
15677 }
15678 else
15681 /* Create the combined representation of the parameter and the
15682 default argument. */
15684 }
15688 {
15689 tree identifier;
15690 tree default_argument;
15692 /* Look for the `<'. */
15694 /* Parse the template-parameter-list. */
15696 /* Look for the `>'. */
15699 // If template requirements are present, parse them.
15701 {
15706 }
15708 /* Look for the `class' or 'typename' keywords. */
15710 /* If the next token is an ellipsis, we have a template
15711 argument pack. */
15713 {
15714 /* Consume the `...' token. */
15719 }
15720 /* If the next token is an `=', then there is a
15721 default-argument. If the next token is a `>', we are at
15722 the end of the parameter-list. If the next token is a `,',
15723 then we are at the end of this parameter. */
15727 {
15729 /* Treat invalid names as if the parameter were nameless. */
15732 }
15733 else
15736 /* Create the template parameter. */
15738 identifier);
15740 /* If the next token is an `=', then there is a
15741 default-argument. */
15743 {
15744 default_argument
15747 /* Template parameter packs cannot have default
15748 arguments. */
15750 {
15753 "template parameter pack %qD cannot "
15755 identifier);
15756 else
15760 }
15761 }
15762 else
15765 /* Create the combined representation of the parameter and the
15766 default argument. */
15768 }
15774 }
15777 }
15779 /* Parse a template-id.
15781 template-id:
15782 template-name < template-argument-list [opt] >
15784 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15785 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15786 returned. Otherwise, if the template-name names a function, or set
15787 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15788 names a class, returns a TYPE_DECL for the specialization.
15790 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15791 uninstantiated templates. */
15793 static tree
15799 {
15800 tree templ;
15801 tree arguments;
15802 tree template_id;
15807 /* If the next token corresponds to a template-id, there is no need
15808 to reparse it. */
15811 {
15814 }
15816 /* Avoid performing name lookup if there is no possibility of
15817 finding a template-id. */
15820 && !cp_parser_nth_token_starts_template_argument_list_p
15822 {
15825 }
15827 /* Remember where the template-id starts. */
15833 /* Parse the template-name. */
15836 check_dependency_p,
15837 is_declaration,
15838 tag_type,
15841 {
15844 }
15846 /* Since we're going to preserve any side-effects from this parse, set up a
15847 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15848 in the template arguments. */
15851 /* If we find the sequence `[:' after a template-name, it's probably
15852 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15853 parse correctly the argument list. */
15860 {
15862 /* Change `:' into `::'. */
15864 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15865 CPP_LESS. */
15868 /* Parse the arguments. */
15871 {
15872 /* If we couldn't parse an argument list, then we revert our changes
15873 and return simply an error. Maybe this is not a template-id
15874 after all. */
15879 }
15880 /* Otherwise, emit an error about the invalid digraph, but continue
15881 parsing because we got our argument list. */
15884 {
15887 "%<<:%> is an alternate spelling for %<[%>."
15890 {
15892 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15895 }
15896 }
15897 }
15898 else
15899 {
15900 /* Look for the `<' that starts the template-argument-list. */
15902 {
15905 }
15906 /* Parse the arguments. */
15908 }
15910 /* Set the location to be of the form:
15911 template-name < template-argument-list [opt] >
15912 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15913 with caret == start at the start of the template-name,
15914 ranging until the closing '>'. */
15915 location_t finish_loc
15917 location_t combined_loc
15920 /* Check for concepts autos where they don't belong. We could
15921 identify types in some cases of idnetifier TEMPL, looking ahead
15922 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
15923 types. We reject them in functions, but if what we have is an
15924 identifier, even with none_type we can't conclude it's NOT a
15925 type, we have to wait for template substitution. */
15928 /* Build a representation of the specialization. */
15931 TEMPLATE_ID_EXPR,
15935 {
15937 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15938 template (rather than some instantiation thereof) only if
15939 is not nested within some other construct. For example, in
15940 "template <typename T> void f(T) { A<T>::", A<T> is just an
15941 instantiation of A. */
15944 CPP_SCOPE));
15945 template_id
15947 }
15948 /* A template-like identifier may be a partial concept id. */
15954 {
15958 }
15959 else
15960 {
15961 /* If it's not a class-template or a template-template, it should be
15962 a function-template. */
15970 }
15972 /* If parsing tentatively, replace the sequence of tokens that makes
15973 up the template-id with a CPP_TEMPLATE_ID token. That way,
15974 should we re-parse the token stream, we will not have to repeat
15975 the effort required to do the parse, nor will we issue duplicate
15976 error messages about problems during instantiation of the
15977 template. */
15979 /* Don't do this if we had a parse error in a declarator; re-parsing
15980 might succeed if a name changes meaning (60361). */
15984 {
15985 /* Reset the contents of the START_OF_ID token. */
15989 /* We must mark the lookup as kept, so we don't throw it away on
15990 the first parse. */
15994 /* Retrieve any deferred checks. Do not pop this access checks yet
15995 so the memory will not be reclaimed during token replacing below. */
16001 /* Purge all subsequent tokens. */
16004 /* ??? Can we actually assume that, if template_id ==
16005 error_mark_node, we will have issued a diagnostic to the
16006 user, as opposed to simply marking the tentative parse as
16007 failed? */
16010 }
16014 }
16016 /* Parse a template-name.
16018 template-name:
16019 identifier
16021 The standard should actually say:
16023 template-name:
16024 identifier
16025 operator-function-id
16027 A defect report has been filed about this issue.
16029 A conversion-function-id cannot be a template name because they cannot
16030 be part of a template-id. In fact, looking at this code:
16032 a.operator K<int>()
16034 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16035 It is impossible to call a templated conversion-function-id with an
16036 explicit argument list, since the only allowed template parameter is
16037 the type to which it is converting.
16039 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16040 `template' keyword, in a construction like:
16042 T::template f<3>()
16044 In that case `f' is taken to be a template-name, even though there
16045 is no way of knowing for sure.
16047 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16048 name refers to a set of overloaded functions, at least one of which
16049 is a template, or an IDENTIFIER_NODE with the name of the template,
16050 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16051 names are looked up inside uninstantiated templates. */
16053 static tree
16060 {
16061 tree identifier;
16062 tree decl;
16065 /* If the next token is `operator', then we have either an
16066 operator-function-id or a conversion-function-id. */
16068 {
16069 /* We don't know whether we're looking at an
16070 operator-function-id or a conversion-function-id. */
16072 /* Try an operator-function-id. */
16074 /* If that didn't work, try a conversion-function-id. */
16076 {
16079 }
16080 }
16081 /* Look for the identifier. */
16082 else
16085 /* If we didn't find an identifier, we don't have a template-id. */
16089 /* If the name immediately followed the `template' keyword, then it
16090 is a template-name. However, if the next token is not `<', then
16091 we do not treat it as a template-name, since it is not being used
16092 as part of a template-id. This enables us to handle constructs
16093 like:
16095 template <typename T> struct S { S(); };
16096 template <typename T> S<T>::S();
16098 correctly. We would treat `S' as a template -- if it were `S<T>'
16099 -- but we do not if there is no `<'. */
16103 {
16104 /* In a declaration, in a dependent context, we pretend that the
16105 "template" keyword was present in order to improve error
16106 recovery. For example, given:
16108 template <typename T> void f(T::X<int>);
16110 we want to treat "X<int>" as a template-id. */
16112 && !template_keyword_p
16114 && check_dependency_p
16116 /* Do not do this for dtors (or ctors), since they never
16117 need the template keyword before their name. */
16119 {
16122 /* Explain what went wrong. */
16124 identifier);
16127 /* If parsing tentatively, find the location of the "<" token. */
16130 /* Parse the template arguments so that we can issue error
16131 messages about them. */
16134 /* Skip tokens until we find a good place from which to
16135 continue parsing. */
16140 /* If parsing tentatively, permanently remove the
16141 template argument list. That will prevent duplicate
16142 error messages from being issued about the missing
16143 "template" keyword. */
16150 }
16152 /* If the "template" keyword is present, then there is generally
16153 no point in doing name-lookup, so we just return IDENTIFIER.
16154 But, if the qualifying scope is non-dependent then we can
16155 (and must) do name-lookup normally. */
16157 {
16163 {
16164 /* We're optimizing away the call to cp_parser_lookup_name, but
16165 we still need to do this. */
16168 }
16169 }
16170 }
16172 /* Look up the name. */
16174 tag_type,
16177 check_dependency_p,
16183 /* If DECL is a template, then the name was a template-name. */
16185 {
16189 }
16190 else
16191 {
16192 /* The standard does not explicitly indicate whether a name that
16193 names a set of overloaded declarations, some of which are
16194 templates, is a template-name. However, such a name should
16195 be a template-name; otherwise, there is no way to form a
16196 template-id for the overloaded templates. */
16205 {
16206 /* The name does not name a template. */
16209 }
16210 }
16212 /* If DECL is dependent, and refers to a function, then just return
16213 its name; we will look it up again during template instantiation. */
16215 {
16219 }
16222 }
16224 /* Parse a template-argument-list.
16226 template-argument-list:
16227 template-argument ... [opt]
16228 template-argument-list , template-argument ... [opt]
16230 Returns a TREE_VEC containing the arguments. */
16232 static tree
16234 {
16239 tree vec;
16246 /* Even if the template-id appears in an integral
16247 constant-expression, the contents of the argument list do
16248 not. */
16254 /* Parse the arguments. */
16255 do
16256 {
16257 tree argument;
16260 /* Consume the comma. */
16263 /* Parse the template-argument. */
16266 /* If the next token is an ellipsis, we're expanding a template
16267 argument pack. */
16269 {
16271 {
16275 }
16276 /* Consume the `...' token. */
16279 /* Make the argument into a TYPE_PACK_EXPANSION or
16280 EXPR_PACK_EXPANSION. */
16282 }
16285 {
16289 {
16292 }
16293 else
16295 }
16297 }
16313 }
16315 /* Parse a template-argument.
16317 template-argument:
16318 assignment-expression
16319 type-id
16320 id-expression
16322 The representation is that of an assignment-expression, type-id, or
16323 id-expression -- except that the qualified id-expression is
16324 evaluated, so that the value returned is either a DECL or an
16325 OVERLOAD.
16327 Although the standard says "assignment-expression", it forbids
16328 throw-expressions or assignments in the template argument.
16329 Therefore, we use "conditional-expression" instead. */
16331 static tree
16333 {
16334 tree argument;
16340 cp_id_kind idk;
16342 /* There's really no way to know what we're looking at, so we just
16343 try each alternative in order.
16345 [temp.arg]
16347 In a template-argument, an ambiguity between a type-id and an
16348 expression is resolved to a type-id, regardless of the form of
16349 the corresponding template-parameter.
16351 Therefore, we try a type-id first. */
16354 /* If there was no error parsing the type-id but the next token is a
16355 '>>', our behavior depends on which dialect of C++ we're
16356 parsing. In C++98, we probably found a typo for '> >'. But there
16357 are type-id which are also valid expressions. For instance:
16359 struct X { int operator >> (int); };
16360 template <int V> struct Foo {};
16361 Foo<X () >> 5> r;
16363 Here 'X()' is a valid type-id of a function type, but the user just
16364 wanted to write the expression "X() >> 5". Thus, we remember that we
16365 found a valid type-id, but we still try to parse the argument as an
16366 expression to see what happens.
16368 In C++0x, the '>>' will be considered two separate '>'
16369 tokens. */
16373 {
16376 }
16377 else
16378 {
16379 /* If the next token isn't a `,' or a `>', then this argument wasn't
16380 really finished. This means that the argument is not a valid
16381 type-id. */
16384 /* If that worked, we're done. */
16387 }
16388 /* We're still not sure what the argument will be. */
16390 /* Try a template. */
16398 /* If the next token isn't a `,' or a `>', then this argument wasn't
16399 really finished. */
16403 {
16404 /* Figure out what is being referred to. If the id-expression
16405 was for a class template specialization, then we will have a
16406 TYPE_DECL at this point. There is no need to do name lookup
16407 at this point in that case. */
16410 none_type,
16416 /* Handle a constrained-type-specifier for a non-type template
16417 parameter. */
16423 }
16425 {
16429 }
16430 /* It must be a non-type argument. In C++17 any constant-expression is
16431 allowed. */
16435 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16437 -- an integral constant-expression of integral or enumeration
16438 type; or
16440 -- the name of a non-type template-parameter; or
16442 -- the name of an object or function with external linkage...
16444 -- the address of an object or function with external linkage...
16446 -- a pointer to member... */
16447 /* Look for a non-type template parameter. */
16449 {
16461 }
16463 /* If the next token is "&", the argument must be the address of an
16464 object or function with external linkage. */
16467 {
16470 }
16471 /* See if we might have an id-expression. */
16478 {
16481 address_p,
16488 else
16489 {
16490 tree probe;
16493 {
16494 /* Strip the dereference temporarily. */
16497 }
16499 /* If we're in a template, we represent a qualified-id referring
16500 to a static data member as a SCOPE_REF even if the scope isn't
16501 dependent so that we can check access control later. */
16506 {
16507 /* A variable without external linkage might still be a
16508 valid constant-expression, so no error is issued here
16509 if the external-linkage check fails. */
16512 }
16514 /* All overloaded functions are allowed; if the external
16515 linkage test does not pass, an error will be issued
16516 later. */
16517 ;
16521 /* A pointer-to-member. */
16522 ;
16524 ;
16525 else
16529 {
16532 tf_warning_or_error);
16533 else
16536 }
16537 }
16538 }
16539 /* If the argument started with "&", there are no other valid
16540 alternatives at this point. */
16542 {
16545 }
16547 general_expr:
16548 /* If the argument wasn't successfully parsed as a type-id followed
16549 by '>>', the argument can only be a constant expression now.
16550 Otherwise, we try parsing the constant-expression tentatively,
16551 because the argument could really be a type-id. */
16557 else
16558 {
16559 /* With C++17 generalized non-type template arguments we need to handle
16560 lvalue constant expressions, too. */
16563 }
16571 /* We did our best to parse the argument as a non type-id, but that
16572 was the only alternative that matched (albeit with a '>' after
16573 it). We can assume it's just a typo from the user, and a
16574 diagnostic will then be issued. */
16576 }
16578 /* Parse an explicit-instantiation.
16580 explicit-instantiation:
16581 template declaration
16583 Although the standard says `declaration', what it really means is:
16585 explicit-instantiation:
16586 template decl-specifier-seq [opt] declarator [opt] ;
16588 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16589 supposed to be allowed. A defect report has been filed about this
16590 issue.
16592 GNU Extension:
16594 explicit-instantiation:
16595 storage-class-specifier template
16596 decl-specifier-seq [opt] declarator [opt] ;
16597 function-specifier template
16598 decl-specifier-seq [opt] declarator [opt] ; */
16600 static void
16602 {
16604 cp_decl_specifier_seq decl_specifiers;
16609 /* Look for an (optional) storage-class-specifier or
16610 function-specifier. */
16612 {
16613 extension_specifier
16616 extension_specifier
16619 }
16621 /* Look for the `template' keyword. */
16623 /* Let the front end know that we are processing an explicit
16624 instantiation. */
16626 /* [temp.explicit] says that we are supposed to ignore access
16627 control while processing explicit instantiation directives. */
16629 /* Parse a decl-specifier-seq. */
16631 CP_PARSER_FLAGS_OPTIONAL,
16634 /* If there was exactly one decl-specifier, and it declared a class,
16635 and there's no declarator, then we have an explicit type
16636 instantiation. */
16638 {
16639 tree type;
16643 /* Turn access control back on for names used during
16644 template instantiation. */
16649 }
16650 else
16651 {
16653 tree decl;
16655 /* Parse the declarator. */
16656 declarator
16667 {
16670 "explicit instantiation shall not use"
16674 "explicit instantiation shall not use"
16679 /* Turn access control back on for names used during
16680 template instantiation. */
16682 /* Do the explicit instantiation. */
16684 }
16685 else
16686 {
16688 /* Skip the body of the explicit instantiation. */
16690 }
16691 }
16692 /* We're done with the instantiation. */
16698 }
16700 /* Parse an explicit-specialization.
16702 explicit-specialization:
16703 template < > declaration
16705 Although the standard says `declaration', what it really means is:
16707 explicit-specialization:
16708 template <> decl-specifier [opt] init-declarator [opt] ;
16709 template <> function-definition
16710 template <> explicit-specialization
16711 template <> template-declaration */
16713 static void
16715 {
16719 /* Look for the `template' keyword. */
16721 /* Look for the `<'. */
16723 /* Look for the `>'. */
16725 /* We have processed another parameter list. */
16727 /* [temp]
16729 A template ... explicit specialization ... shall not have C
16730 linkage. */
16732 {
16735 /* Give it C++ linkage to avoid confusing other parts of the
16736 front end. */
16739 }
16740 else
16742 /* Let the front end know that we are beginning a specialization. */
16744 {
16747 }
16749 /* If the next keyword is `template', we need to figure out whether
16750 or not we're looking a template-declaration. */
16752 {
16757 else
16759 }
16760 else
16761 /* Parse the dependent declaration. */
16767 /* We're done with the specialization. */
16769 /* For the erroneous case of a template with C linkage, we pushed an
16770 implicit C++ linkage scope; exit that scope now. */
16773 /* We're done with this parameter list. */
16775 }
16777 /* Parse a type-specifier.
16779 type-specifier:
16780 simple-type-specifier
16781 class-specifier
16782 enum-specifier
16783 elaborated-type-specifier
16784 cv-qualifier
16786 GNU Extension:
16788 type-specifier:
16789 __complex__
16791 Returns a representation of the type-specifier. For a
16792 class-specifier, enum-specifier, or elaborated-type-specifier, a
16793 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16795 The parser flags FLAGS is used to control type-specifier parsing.
16797 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16798 in a decl-specifier-seq.
16800 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16801 class-specifier, enum-specifier, or elaborated-type-specifier, then
16802 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16803 if a type is declared; 2 if it is defined. Otherwise, it is set to
16804 zero.
16806 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16807 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16808 is set to FALSE. */
16810 static tree
16812 cp_parser_flags flags,
16817 {
16823 /* Assume this type-specifier does not declare a new type. */
16826 /* And that it does not specify a cv-qualifier. */
16829 /* Peek at the next token. */
16832 /* If we're looking at a keyword, we can use that to guide the
16833 production we choose. */
16836 {
16841 /* Look for the enum-specifier. */
16843 /* If that worked, we're done. */
16845 {
16850 type_spec,
16851 token,
16854 }
16855 else
16858 /* Any of these indicate either a class-specifier, or an
16859 elaborated-type-specifier. */
16866 /* Parse tentatively so that we can back up if we don't find a
16867 class-specifier. */
16869 /* Look for the class-specifier. */
16872 /* If that worked, we're done. */
16874 {
16879 type_spec,
16880 token,
16883 }
16885 /* Fall through. */
16886 elaborated_type_specifier:
16887 /* We're declaring (not defining) a class or enum. */
16891 /* Fall through. */
16893 /* Look for an elaborated-type-specifier. */
16894 type_spec
16895 = (cp_parser_elaborated_type_specifier
16898 is_declaration));
16901 type_spec,
16902 token,
16925 /* The `__complex__' keyword is a GNU extension. */
16931 }
16933 /* Handle simple keywords. */
16935 {
16937 {
16940 }
16942 }
16944 /* If we do not already have a type-specifier, assume we are looking
16945 at a simple-type-specifier. */
16947 decl_specs,
16948 flags);
16950 /* If we didn't find a type-specifier, and a type-specifier was not
16951 optional in this context, issue an error message. */
16953 {
16956 }
16959 }
16961 /* Parse a simple-type-specifier.
16963 simple-type-specifier:
16964 :: [opt] nested-name-specifier [opt] type-name
16965 :: [opt] nested-name-specifier template template-id
16966 char
16967 wchar_t
16968 bool
16969 short
16970 int
16971 long
16972 signed
16973 unsigned
16974 float
16975 double
16976 void
16978 C++11 Extension:
16980 simple-type-specifier:
16981 auto
16982 decltype ( expression )
16983 char16_t
16984 char32_t
16985 __underlying_type ( type-id )
16987 C++17 extension:
16989 nested-name-specifier(opt) template-name
16991 GNU Extension:
16993 simple-type-specifier:
16994 __int128
16995 __typeof__ unary-expression
16996 __typeof__ ( type-id )
16997 __typeof__ ( type-id ) { initializer-list , [opt] }
16999 Concepts Extension:
17001 simple-type-specifier:
17002 constrained-type-specifier
17004 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17005 appropriately updated. */
17007 static tree
17010 cp_parser_flags flags)
17011 {
17016 /* Peek at the next token. */
17019 /* If we're looking at a keyword, things are easy. */
17021 {
17056 {
17059 }
17088 {
17089 /* The 'auto' might be the placeholder return type for a function decl
17090 with trailing return type. */
17099 {
17101 {
17108 }
17111 {
17114 }
17117 }
17121 {
17124 }
17127 {
17130 }
17131 else
17135 {
17138 "use of %<auto%> in lambda parameter declaration "
17139 "only available with "
17141 }
17144 "use of %<auto%> in parameter declaration "
17145 "only available with "
17149 "use of %<auto%> in parameter declaration "
17151 }
17152 else
17157 /* Since DR 743, decltype can either be a simple-type-specifier by
17158 itself or begin a nested-name-specifier. Parsing it will replace
17159 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17160 handling below decide what to do. */
17166 /* Consume the `typeof' token. */
17168 /* Parse the operand to `typeof'. */
17170 /* If it is not already a TYPE, take its type. */
17176 token,
17185 token,
17195 token,
17200 }
17202 /* If token is an already-parsed decltype not followed by ::,
17203 it's a simple-type-specifier. */
17206 {
17209 {
17211 token,
17213 /* Remember that we are handling a decltype in order to
17214 implement the resolution of DR 1510 when the argument
17215 isn't instantiation dependent. */
17217 }
17220 }
17222 /* If the type-specifier was for a built-in type, we're done. */
17224 {
17225 /* Record the type. */
17232 type,
17233 token,
17238 /* Consume the token. */
17244 /* There is no valid C++ program where a non-template type is
17245 followed by a "<". That usually indicates that the user thought
17246 that the type was a template. */
17251 }
17253 /* The type-specifier must be a user-defined type. */
17255 {
17259 /* Don't gobble tokens or issue error messages if this is an
17260 optional type-specifier. */
17266 /* Look for the optional `::' operator. */
17267 global_p
17271 /* Look for the nested-name specifier. */
17272 qualified_p
17279 /* If we have seen a nested-name-specifier, and the next token
17280 is `template', then we are using the template-id production. */
17283 {
17284 /* Look for the template-id. */
17288 none_type,
17290 /* If the template-id did not name a type, we are out of
17291 luck. */
17293 {
17296 }
17297 }
17298 /* Otherwise, look for a type-name. */
17299 else
17301 /* Keep track of all name-lookups performed in class scopes. */
17303 && !global_p
17304 && !qualified_p
17308 /* If it didn't work out, we don't have a TYPE. */
17313 {
17327 {
17329 none_type,
17339 else
17340 {
17345 }
17346 }
17347 else
17353 }
17356 token,
17358 }
17360 /* If we didn't get a type-name, issue an error message. */
17362 {
17365 }
17368 {
17369 /* See if TYPE is an Objective-C type, and if so, parse and
17370 accept any protocol references following it. Do this before
17371 the cp_parser_check_for_invalid_template_id() call, because
17372 Objective-C types can be followed by '<...>' which would
17373 enclose protocol names rather than template arguments, and so
17374 everything is fine. */
17377 {
17381 /* Clobber the "unqualified" type previously entered into
17382 DECL_SPECS with the new, improved protocol-qualified version. */
17387 }
17389 /* There is no valid C++ program where a non-template type is
17390 followed by a "<". That usually indicates that the user
17391 thought that the type was a template. */
17393 none_type,
17395 }
17398 }
17400 /* Parse a type-name.
17402 type-name:
17403 class-name
17404 enum-name
17405 typedef-name
17406 simple-template-id [in c++0x]
17408 enum-name:
17409 identifier
17411 typedef-name:
17412 identifier
17414 Concepts:
17416 type-name:
17417 concept-name
17418 partial-concept-id
17420 concept-name:
17421 identifier
17423 Returns a TYPE_DECL for the type. */
17425 static tree
17427 {
17429 }
17431 /* See above. */
17432 static tree
17434 {
17435 tree type_decl;
17437 /* We can't know yet whether it is a class-name or not. */
17439 /* Try a class-name. */
17441 typename_keyword_p,
17443 none_type,
17447 /* If it's not a class-name, keep looking. */
17449 {
17451 /* It must be a typedef-name or an enum-name. */
17455 /* It is either a simple-template-id representing an
17456 instantiation of an alias template... */
17460 none_type,
17462 /* Note that this must be an instantiation of an alias template
17463 because [temp.names]/6 says:
17465 A template-id that names an alias template specialization
17466 is a type-name.
17468 Whereas [temp.names]/7 says:
17470 A simple-template-id that names a class template
17471 specialization is a class-name.
17473 With concepts, this could also be a partial-concept-id that
17474 declares a non-type template parameter. */
17481 else
17485 /* ... Or a typedef-name or an enum-name. */
17487 }
17490 }
17492 /* Check if DECL and ARGS can form a constrained-type-specifier.
17493 If ARGS is non-null, we try to form a concept check of the
17494 form DECL<?, ARGS> where ? is a wildcard that matches any
17495 kind of template argument. If ARGS is NULL, then we try to
17496 form a concept check of the form DECL<?>. */
17498 static tree
17501 {
17504 /* If we a constrained-type-specifier cannot be deduced. */
17508 /* A constrained type specifier can only be found in an
17509 overload set or as a reference to a template declaration.
17511 FIXME: This might be masking a bug. It's possible that
17512 that the deduction below is causing template specializations
17513 to be formed with the wildcard as an argument. */
17517 /* Try to build a call expression that evaluates the
17518 concept. This can fail if the overload set refers
17519 only to non-templates. */
17525 /* Deduce the checked constraint and the prototype parameter.
17527 FIXME: In certain cases, failure to deduce should be a
17528 diagnosable error. */
17529 tree conc;
17530 tree proto;
17534 /* In template parameter scope, this results in a constrained
17535 parameter. Return a descriptor of that parm. */
17539 /* In a parameter-declaration-clause, constrained-type
17540 specifiers result in invented template parameters. */
17542 {
17545 }
17546 else
17547 {
17548 /* Otherwise, we're in a context where the constrained
17549 type name is deduced and the constraint applies
17550 after deduction. */
17552 }
17555 }
17557 /* If DECL refers to a concept, return a TYPE_DECL representing
17558 the result of using the constrained type specifier in the
17559 current context. DECL refers to a concept if
17561 - it is an overload set containing a function concept taking a single
17562 type argument, or
17564 - it is a variable concept taking a single type argument. */
17566 static tree
17568 {
17574 else
17576 }
17578 /* Check if DECL and ARGS form a partial-concept-id. If so,
17579 assign ID to the resulting constrained placeholder.
17581 Returns true if the partial-concept-id designates a placeholder
17582 and false otherwise. Note that *id is set to NULL_TREE in
17583 this case. */
17585 static tree
17587 {
17589 }
17591 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17592 or a concept-name.
17594 enum-name:
17595 identifier
17597 typedef-name:
17598 identifier
17600 concept-name:
17601 identifier
17603 Returns a TYPE_DECL for the type. */
17605 static tree
17607 {
17608 tree type_decl;
17609 tree identifier;
17616 /* Look up the type-name. */
17621 /* If we found an overload set, then it may refer to a concept-name. */
17627 {
17628 /* See if this is an Objective-C type. */
17633 }
17635 /* Issue an error if we did not find a type-name. */
17637 /* In Objective-C, we have the complication that class names are
17638 normally type names and start declarations (eg, the
17639 "NSObject" in "NSObject *object;"), but can be used in an
17640 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17641 is an expression. So, a classname followed by a dot is not a
17642 valid type-name. */
17645 {
17650 }
17651 /* Remember that the name was used in the definition of the
17652 current class so that we can check later to see if the
17653 meaning would have been different after the class was
17654 entirely defined. */
17660 }
17662 /* Parse an elaborated-type-specifier. Note that the grammar given
17663 here incorporates the resolution to DR68.
17665 elaborated-type-specifier:
17666 class-key :: [opt] nested-name-specifier [opt] identifier
17667 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17668 enum-key :: [opt] nested-name-specifier [opt] identifier
17669 typename :: [opt] nested-name-specifier identifier
17670 typename :: [opt] nested-name-specifier template [opt]
17671 template-id
17673 GNU extension:
17675 elaborated-type-specifier:
17676 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17677 class-key attributes :: [opt] nested-name-specifier [opt]
17678 template [opt] template-id
17679 enum attributes :: [opt] nested-name-specifier [opt] identifier
17681 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17682 declared `friend'. If IS_DECLARATION is TRUE, then this
17683 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17684 something is being declared.
17686 Returns the TYPE specified. */
17688 static tree
17692 {
17694 tree identifier;
17697 tree globalscope;
17700 /* See if we're looking at the `enum' keyword. */
17702 {
17703 /* Consume the `enum' token. */
17705 /* Remember that it's an enumeration type. */
17707 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17708 enums) is used here. */
17712 {
17719 /* Consume the `struct' or `class' and parse it anyway. */
17721 }
17722 /* Parse the attributes. */
17724 }
17725 /* Or, it might be `typename'. */
17727 RID_TYPENAME))
17728 {
17729 /* Consume the `typename' token. */
17731 /* Remember that it's a `typename' type. */
17733 }
17734 /* Otherwise it must be a class-key. */
17735 else
17736 {
17740 /* Parse the attributes. */
17742 }
17744 /* Look for the `::' operator. */
17747 /* Look for the nested-name-specifier. */
17748 tree nested_name_specifier;
17750 {
17751 nested_name_specifier
17756 is_declaration);
17759 }
17760 else
17761 /* Even though `typename' is not present, the proposed resolution
17762 to Core Issue 180 says that in `class A<T>::B', `B' should be
17763 considered a type-name, even if `A<T>' is dependent. */
17764 nested_name_specifier
17769 is_declaration);
17770 /* For everything but enumeration types, consider a template-id.
17771 For an enumeration type, consider only a plain identifier. */
17773 {
17775 tree decl;
17777 /* Allow the `template' keyword. */
17779 /* If we didn't see `template', we don't know if there's a
17780 template-id or not. */
17783 /* Parse the template-id. */
17787 tag_type,
17788 is_declaration);
17789 /* If we didn't find a template-id, look for an ordinary
17790 identifier. */
17792 ;
17793 /* We can get here when cp_parser_template_id, called by
17794 cp_parser_class_name with tag_type == none_type, succeeds
17795 and caches a BASELINK. Then, when called again here,
17796 instead of failing and returning an error_mark_node
17797 returns it (see template/typename17.C in C++11).
17798 ??? Could we diagnose this earlier? */
17800 {
17803 }
17804 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17805 in effect, then we must assume that, upon instantiation, the
17806 template will correspond to a class. */
17810 typename_type,
17812 /* If the `typename' keyword is in effect and DECL is not a type
17813 decl, then type is non existent. */
17815 ;
17817 {
17821 /* If the next token is a semicolon, this must be a specialization,
17822 instantiation, or friend declaration. Check the scope while we
17823 still know whether or not we had a nested-name-specifier. */
17828 }
17831 }
17834 {
17839 {
17842 }
17844 /* For a `typename', we needn't call xref_tag. */
17850 /* Template parameter lists apply only if we are not within a
17851 function parameter list. */
17852 bool template_parm_lists_apply
17861 /* Look up a qualified name in the usual way. */
17863 {
17864 tree decl;
17865 tree ambiguous_decls;
17868 tag_type,
17875 /* If the lookup was ambiguous, an error will already have been
17876 issued. */
17880 /* If we are parsing friend declaration, DECL may be a
17881 TEMPLATE_DECL tree node here. However, we need to check
17882 whether this TEMPLATE_DECL results in valid code. Consider
17883 the following example:
17885 namespace N {
17886 template <class T> class C {};
17887 }
17888 class X {
17889 template <class T> friend class N::C; // #1, valid code
17890 };
17891 template <class T> class Y {
17892 friend class N::C; // #2, invalid code
17893 };
17895 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17896 name lookup of `N::C'. We see that friend declaration must
17897 be template for the code to be valid. Note that
17898 processing_template_decl does not work here since it is
17899 always 1 for the above two cases. */
17901 decl = (cp_parser_maybe_treat_template_as_class
17906 {
17908 identifier,
17911 }
17914 {
17918 allow_template);
17922 }
17924 /* Forward declarations of nested types, such as
17926 class C1::C2;
17927 class C1::C2::C3;
17929 are invalid unless all components preceding the final '::'
17930 are complete. If all enclosing types are complete, these
17931 declarations become merely pointless.
17933 Invalid forward declarations of nested types are errors
17934 caught elsewhere in parsing. Those that are pointless arrive
17935 here. */
17942 }
17943 else
17944 {
17945 /* An elaborated-type-specifier sometimes introduces a new type and
17946 sometimes names an existing type. Normally, the rule is that it
17947 introduces a new type only if there is not an existing type of
17948 the same name already in scope. For example, given:
17950 struct S {};
17951 void f() { struct S s; }
17953 the `struct S' in the body of `f' is the same `struct S' as in
17954 the global scope; the existing definition is used. However, if
17955 there were no global declaration, this would introduce a new
17956 local class named `S'.
17958 An exception to this rule applies to the following code:
17960 namespace N { struct S; }
17962 Here, the elaborated-type-specifier names a new type
17963 unconditionally; even if there is already an `S' in the
17964 containing scope this declaration names a new type.
17965 This exception only applies if the elaborated-type-specifier
17966 forms the complete declaration:
17968 [class.name]
17970 A declaration consisting solely of `class-key identifier ;' is
17971 either a redeclaration of the name in the current scope or a
17972 forward declaration of the identifier as a class name. It
17973 introduces the name into the current scope.
17975 We are in this situation precisely when the next token is a `;'.
17977 An exception to the exception is that a `friend' declaration does
17978 *not* name a new type; i.e., given:
17980 struct S { friend struct T; };
17982 `T' is not a new type in the scope of `S'.
17984 Also, `new struct S' or `sizeof (struct S)' never results in the
17985 definition of a new type; a new type can only be declared in a
17986 declaration context. */
17988 tag_scope ts;
17992 /* Friends have special name lookup rules. */
17996 CPP_SEMICOLON))
17997 /* This is a `class-key identifier ;' */
17999 else
18002 template_p =
18003 (template_parm_lists_apply
18006 /* An unqualified name was used to reference this type, so
18007 there were no qualifying templates. */
18016 }
18017 }
18022 /* Allow attributes on forward declarations of classes. */
18024 {
18034 else
18037 }
18040 {
18041 /* Indicate whether this class was declared as a `class' or as a
18042 `struct'. */
18046 }
18048 /* A "<" cannot follow an elaborated type specifier. If that
18049 happens, the user was probably trying to form a template-id. */
18054 }
18056 /* Parse an enum-specifier.
18058 enum-specifier:
18059 enum-head { enumerator-list [opt] }
18060 enum-head { enumerator-list , } [C++0x]
18062 enum-head:
18063 enum-key identifier [opt] enum-base [opt]
18064 enum-key nested-name-specifier identifier enum-base [opt]
18066 enum-key:
18067 enum
18068 enum class [C++0x]
18069 enum struct [C++0x]
18071 enum-base: [C++0x]
18072 : type-specifier-seq
18074 opaque-enum-specifier:
18075 enum-key identifier enum-base [opt] ;
18077 GNU Extensions:
18078 enum-key attributes[opt] identifier [opt] enum-base [opt]
18079 { enumerator-list [opt] }attributes[opt]
18080 enum-key attributes[opt] identifier [opt] enum-base [opt]
18081 { enumerator-list, }attributes[opt] [C++0x]
18083 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18084 if the token stream isn't an enum-specifier after all. */
18086 static tree
18088 {
18089 tree identifier;
18091 tree prev_scope;
18093 tree attributes;
18106 /* Parse tentatively so that we can back up if we don't find a
18107 enum-specifier. */
18110 /* Caller guarantees that the current token is 'enum', an identifier
18111 possibly follows, and the token after that is an opening brace.
18112 If we don't have an identifier, fabricate an anonymous name for
18113 the enumeration being defined. */
18116 /* Parse the "class" or "struct", which indicates a scoped
18117 enumeration type in C++0x. */
18120 {
18124 /* Consume the `struct' or `class' token. */
18128 }
18132 /* Clear the qualification. */
18137 /* Figure out in what scope the declaration is being placed. */
18143 nested_name_specifier
18151 {
18152 tree name;
18156 enum_type,
18161 input_location);
18163 {
18166 {
18167 /* Are template enums allowed in ISO? */
18171 /* ignore a typename reference, for it will be solved by name
18172 in start_enum. */
18174 }
18175 }
18178 else
18179 {
18184 }
18185 }
18186 else
18187 {
18190 else
18191 {
18197 }
18198 }
18201 /* Check for the `:' that denotes a specified underlying type in C++0x.
18202 Note that a ':' could also indicate a bitfield width, however. */
18204 {
18205 cp_decl_specifier_seq type_specifiers;
18207 /* Consume the `:'. */
18210 /* Parse the type-specifier-seq. */
18215 /* At this point this is surely not elaborated type specifier. */
18224 /* If that didn't work, stop. */
18226 {
18232 }
18233 }
18235 /* Look for the `{' but don't consume it yet. */
18237 {
18239 {
18242 {
18245 }
18246 }
18247 /* An opaque-enum-specifier must have a ';' here. */
18250 {
18253 {
18256 }
18257 }
18258 }
18264 {
18266 {
18270 }
18272 {
18274 }
18275 }
18277 /* Issue an error message if type-definitions are forbidden here. */
18280 else
18281 /* Create the new type. We do this before consuming the opening
18282 brace so the enum will be recorded as being on the line of its
18283 tag (or the 'enum' keyword, if there is no tag). */
18287 /* If the next token is not '{' it is an opaque-enum-specifier or an
18288 elaborated-type-specifier. */
18290 {
18294 {
18295 /* The following catches invalid code such as:
18296 enum class S<int>::E { A, B, C }; */
18304 {
18308 nested_name_specifier);
18310 }
18313 {
18315 "%qT for enum declaration does not name a class "
18318 }
18319 /* If that scope does not contain the scope in which the
18320 class was originally declared, the program is invalid. */
18322 nested_name_specifier))
18323 {
18326 "declaration of %qD in namespace %qD which does not "
18329 else
18331 "declaration of %qD in %qD which does not "
18335 }
18336 /* If that scope is the scope where the declaration is being placed
18337 the program is invalid. */
18341 {
18345 }
18346 }
18351 /* Consume the opening brace. */
18352 matching_braces braces;
18359 {
18363 }
18364 else
18365 {
18371 }
18375 /* If the next token is not '}', then there are some enumerators. */
18377 {
18381 }
18382 else
18385 /* Consume the final '}'. */
18391 }
18392 else
18393 {
18394 /* If a ';' follows, then it is an opaque-enum-specifier
18395 and additional restrictions apply. */
18397 {
18404 }
18405 }
18407 /* Look for trailing attributes to apply to this enumeration, and
18408 apply them if appropriate. */
18410 {
18413 trailing_attr,
18415 }
18417 /* Finish up the enumeration. */
18419 {
18424 }
18427 {
18429 {
18432 }
18434 {
18436 }
18437 }
18438 out:
18441 }
18443 /* Parse an enumerator-list. The enumerators all have the indicated
18444 TYPE.
18446 enumerator-list:
18447 enumerator-definition
18448 enumerator-list , enumerator-definition */
18450 static void
18452 {
18454 {
18455 /* Parse an enumerator-definition. */
18458 /* If the next token is not a ',', we've reached the end of
18459 the list. */
18462 /* Otherwise, consume the `,' and keep going. */
18464 /* If the next token is a `}', there is a trailing comma. */
18466 {
18471 }
18472 }
18473 }
18475 /* Parse an enumerator-definition. The enumerator has the indicated
18476 TYPE.
18478 enumerator-definition:
18479 enumerator
18480 enumerator = constant-expression
18482 enumerator:
18483 identifier
18485 GNU Extensions:
18487 enumerator-definition:
18488 enumerator attributes [opt]
18489 enumerator attributes [opt] = constant-expression */
18491 static void
18493 {
18494 tree identifier;
18495 tree value;
18496 location_t loc;
18498 /* Save the input location because we are interested in the location
18499 of the identifier and not the location of the explicit value. */
18502 /* Look for the identifier. */
18507 /* Parse any specified attributes. */
18510 /* If the next token is an '=', then there is an explicit value. */
18512 {
18513 /* Consume the `=' token. */
18515 /* Parse the value. */
18517 }
18518 else
18521 /* If we are processing a template, make sure the initializer of the
18522 enumerator doesn't contain any bare template parameter pack. */
18526 /* Create the enumerator. */
18528 }
18530 /* Parse a namespace-name.
18532 namespace-name:
18533 original-namespace-name
18534 namespace-alias
18536 Returns the NAMESPACE_DECL for the namespace. */
18538 static tree
18540 {
18541 tree identifier;
18542 tree namespace_decl;
18546 /* Get the name of the namespace. */
18551 /* Look up the identifier in the currently active scope. Look only
18552 for namespaces, due to:
18554 [basic.lookup.udir]
18556 When looking up a namespace-name in a using-directive or alias
18557 definition, only namespace names are considered.
18559 And:
18561 [basic.lookup.qual]
18563 During the lookup of a name preceding the :: scope resolution
18564 operator, object, function, and enumerator names are ignored.
18566 (Note that cp_parser_qualifying_entity only calls this
18567 function if the token after the name is the scope resolution
18568 operator.) */
18570 none_type,
18576 /* If it's not a namespace, issue an error. */
18579 {
18581 {
18587 }
18590 }
18593 }
18595 /* Parse a namespace-definition.
18597 namespace-definition:
18598 named-namespace-definition
18599 unnamed-namespace-definition
18601 named-namespace-definition:
18602 original-namespace-definition
18603 extension-namespace-definition
18605 original-namespace-definition:
18606 namespace identifier { namespace-body }
18608 extension-namespace-definition:
18609 namespace original-namespace-name { namespace-body }
18611 unnamed-namespace-definition:
18612 namespace { namespace-body } */
18614 static void
18616 {
18617 tree identifier;
18626 {
18629 }
18631 /* Look for the `namespace' keyword. */
18632 cp_token* token
18635 /* Parse any specified attributes before the identifier. */
18639 {
18643 {
18648 "standard attributes on namespaces must precede "
18651 /* Parse any attributes specified after the identifier. */
18653 }
18660 "nested namespace definitions only available with "
18663 /* Nested namespace names can create new namespaces (unlike
18664 other qualified-ids). */
18667 else
18670 }
18682 /* Start the namespace. */
18689 /* Look for the `{' to validate starting the namespace. */
18690 matching_braces braces;
18692 {
18693 /* Parse the body of the namespace. */
18696 /* Look for the final `}'. */
18698 }
18703 /* Pop the nested namespace definitions. */
18706 }
18708 /* Parse a namespace-body.
18710 namespace-body:
18711 declaration-seq [opt] */
18713 static void
18715 {
18717 }
18719 /* Parse a namespace-alias-definition.
18721 namespace-alias-definition:
18722 namespace identifier = qualified-namespace-specifier ; */
18724 static void
18726 {
18727 tree identifier;
18728 tree namespace_specifier;
18732 /* Look for the `namespace' keyword. */
18734 /* Look for the identifier. */
18738 /* Look for the `=' token. */
18741 {
18743 /* Skip the definition. */
18748 }
18750 /* Look for the qualified-namespace-specifier. */
18751 namespace_specifier
18753 /* Look for the `;' token. */
18756 /* Register the alias in the symbol table. */
18758 }
18760 /* Parse a qualified-namespace-specifier.
18762 qualified-namespace-specifier:
18763 :: [opt] nested-name-specifier [opt] namespace-name
18765 Returns a NAMESPACE_DECL corresponding to the specified
18766 namespace. */
18768 static tree
18770 {
18771 /* Look for the optional `::'. */
18775 /* Look for the optional nested-name-specifier. */
18783 }
18785 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18786 access declaration.
18788 using-declaration:
18789 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18790 using :: unqualified-id ;
18792 access-declaration:
18793 qualified-id ;
18795 */
18797 static bool
18800 {
18804 tree decl;
18805 tree identifier;
18806 tree qscope;
18811 {
18814 }
18815 else
18816 {
18817 /* Look for the `using' keyword. */
18820 again:
18821 /* Peek at the next token. */
18823 /* See if it's `typename'. */
18825 {
18826 /* Remember that we've seen it. */
18828 /* Consume the `typename' token. */
18830 }
18831 }
18833 /* Look for the optional global scope qualification. */
18834 global_scope_p
18839 /* If we saw `typename', or didn't see `::', then there must be a
18840 nested-name-specifier present. */
18842 {
18848 {
18851 }
18852 }
18853 /* Otherwise, we could be in either of the two productions. In that
18854 case, treat the nested-name-specifier as optional. */
18855 else
18867 /* Something has already gone wrong; there's no need to parse
18868 further. Since an error has occurred, the return value of
18869 cp_parser_parse_definitely will be false, as required. */
18873 /* Parse the unqualified-id. */
18881 {
18886 }
18888 {
18893 "pack expansion in using-declaration only available "
18896 }
18898 /* The function we call to handle a using-declaration is different
18899 depending on what scope we are in. */
18901 ;
18904 /* [namespace.udecl]
18906 A using declaration shall not name a template-id. */
18909 else
18910 {
18912 {
18913 /* Create the USING_DECL. */
18920 {
18923 }
18924 else
18925 /* Add it to the list of members in this class. */
18927 }
18928 else
18929 {
18931 identifier,
18938 {
18941 }
18944 else
18946 }
18947 }
18951 {
18955 "comma-separated list in using-declaration only available "
18958 }
18960 /* Look for the final `;'. */
18965 "access declarations are deprecated "
18966 "in favour of using-declarations; "
18970 }
18972 /* Parse an alias-declaration.
18974 alias-declaration:
18975 using identifier attribute-specifier-seq [opt] = type-id */
18977 static tree
18979 {
18981 location_t id_location;
18983 cp_decl_specifier_seq decl_specs;
18987 /* Look for the `using' keyword. */
18988 cp_token *using_token
19010 /* Now we are going to parse the type-id of the declaration. */
19012 /*
19013 [dcl.type]/3 says:
19015 "A type-specifier-seq shall not define a class or enumeration
19016 unless it appears in the type-id of an alias-declaration (7.1.3) that
19017 is not the declaration of a template-declaration."
19019 In other words, if we currently are in an alias template, the
19020 type-id should not define a type.
19022 So let's set parser->type_definition_forbidden_message in that
19023 case; cp_parser_check_type_definition (called by
19024 cp_parser_class_specifier) will then emit an error if a type is
19025 defined in the type-id. */
19027 {
19031 }
19035 /* Restore the error message if need be. */
19041 {
19044 }
19046 /* A typedef-name can also be introduced by an alias-declaration. The
19047 identifier following the using keyword becomes a typedef-name. It has
19048 the same semantics as if it were introduced by the typedef
19049 specifier. In particular, it does not define a new type and it shall
19050 not appear in the type-id. */
19055 {
19058 ds_attribute,
19059 attrs_token);
19060 }
19062 ds_typedef,
19063 using_token);
19065 ds_alias,
19066 using_token);
19072 id_location,
19083 else
19089 // Attach constraints to the alias declaration.
19091 {
19095 }
19102 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19103 added into the symbol table; otherwise, return the TYPE_DECL. */
19107 {
19111 }
19114 }
19116 /* Parse a using-directive.
19118 using-directive:
19119 using namespace :: [opt] nested-name-specifier [opt]
19120 namespace-name ; */
19122 static void
19124 {
19125 tree namespace_decl;
19126 tree attribs;
19128 /* Look for the `using' keyword. */
19130 /* And the `namespace' keyword. */
19132 /* Look for the optional `::' operator. */
19134 /* And the optional nested-name-specifier. */
19140 /* Get the namespace being used. */
19142 /* And any specified attributes. */
19145 /* Update the symbol table. */
19148 else
19151 /* Look for the final `;'. */
19153 }
19155 /* Parse an asm-definition.
19157 asm-definition:
19158 asm ( string-literal ) ;
19160 GNU Extension:
19162 asm-definition:
19163 asm volatile [opt] ( string-literal ) ;
19164 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19165 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19166 : asm-operand-list [opt] ) ;
19167 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19168 : asm-operand-list [opt]
19169 : asm-clobber-list [opt] ) ;
19170 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19171 : asm-clobber-list [opt]
19172 : asm-goto-list ) ; */
19174 static void
19176 {
19177 tree string;
19182 tree asm_stmt;
19190 /* Look for the `asm' keyword. */
19195 {
19198 }
19200 /* See if the next token is `volatile'. */
19203 {
19204 /* Remember that we saw the `volatile' keyword. */
19206 /* Consume the token. */
19208 }
19212 {
19213 /* Remember that we saw the `goto' keyword. */
19215 /* Consume the token. */
19217 }
19218 /* Look for the opening `('. */
19221 /* Look for the string. */
19224 {
19228 }
19230 /* If we're allowing GNU extensions, check for the extended assembly
19231 syntax. Unfortunately, the `:' tokens need not be separated by
19232 a space in C, and so, for compatibility, we tolerate that here
19233 too. Doing that means that we have to treat the `::' operator as
19234 two `:' tokens. */
19239 {
19244 /* The extended syntax was used. */
19247 /* Look for outputs. */
19249 {
19250 /* Consume the `:'. */
19252 /* Parse the output-operands. */
19254 CPP_COLON)
19256 CPP_SCOPE)
19258 CPP_CLOSE_PAREN)
19260 {
19264 }
19265 }
19266 /* If the next token is `::', there are no outputs, and the
19267 next token is the beginning of the inputs. */
19269 /* The inputs are coming next. */
19272 /* Look for inputs. */
19275 {
19276 /* Consume the `:' or `::'. */
19278 /* Parse the output-operands. */
19280 CPP_COLON)
19282 CPP_SCOPE)
19284 CPP_CLOSE_PAREN))
19285 {
19289 }
19290 }
19292 /* The clobbers are coming next. */
19295 /* Look for clobbers. */
19298 {
19300 /* Consume the `:' or `::'. */
19302 /* Parse the clobbers. */
19304 CPP_COLON)
19306 CPP_CLOSE_PAREN))
19308 }
19311 /* The labels are coming next. */
19314 /* Look for labels. */
19317 {
19319 /* Consume the `:' or `::'. */
19321 /* Parse the labels. */
19323 }
19327 }
19331 /* Look for the closing `)'. */
19339 {
19340 /* Create the ASM_EXPR. */
19342 {
19345 /* If the extended syntax was not used, mark the ASM_EXPR. */
19347 {
19353 }
19354 }
19355 else
19357 }
19358 }
19360 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19361 type that comes from the decl-specifier-seq. */
19363 static tree
19365 {
19368 {
19381 }
19384 }
19386 /* Declarators [gram.dcl.decl] */
19388 /* Parse an init-declarator.
19390 init-declarator:
19391 declarator initializer [opt]
19393 GNU Extension:
19395 init-declarator:
19396 declarator asm-specification [opt] attributes [opt] initializer [opt]
19398 function-definition:
19399 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19400 function-body
19401 decl-specifier-seq [opt] declarator function-try-block
19403 GNU Extension:
19405 function-definition:
19406 __extension__ function-definition
19408 TM Extension:
19410 function-definition:
19411 decl-specifier-seq [opt] declarator function-transaction-block
19413 The DECL_SPECIFIERS apply to this declarator. Returns a
19414 representation of the entity declared. If MEMBER_P is TRUE, then
19415 this declarator appears in a class scope. The new DECL created by
19416 this declarator is returned.
19418 The CHECKS are access checks that should be performed once we know
19419 what entity is being declared (and, therefore, what classes have
19420 befriended it).
19422 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19423 for a function-definition here as well. If the declarator is a
19424 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19425 be TRUE upon return. By that point, the function-definition will
19426 have been completely parsed.
19428 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19429 is FALSE.
19431 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19432 parsed declaration if it is an uninitialized single declarator not followed
19433 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19434 if present, will not be consumed. If returned, this declarator will be
19435 created with SD_INITIALIZED but will not call cp_finish_decl.
19437 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19438 and there is an initializer, the pointed location_t is set to the
19439 location of the '=' or `(', or '{' in C++11 token introducing the
19440 initializer. */
19442 static tree
19453 {
19457 tree prefix_attributes;
19459 tree asm_specification;
19460 tree initializer;
19462 tree scope;
19464 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19465 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19466 "(...)". */
19477 /* Gather the attributes that were provided with the
19478 decl-specifiers. */
19481 /* Assume that this is not the declarator for a function
19482 definition. */
19486 /* Default arguments are only permitted for function parameters. */
19490 /* Defer access checks while parsing the declarator; we cannot know
19491 what names are accessible until we know what is being
19492 declared. */
19497 /* Parse the declarator. */
19498 declarator
19503 /* Gather up the deferred checks. */
19508 /* If the DECLARATOR was erroneous, there's no need to go
19509 further. */
19513 /* Check that the number of template-parameter-lists is OK. */
19523 /* Figure out what scope the entity declared by the DECLARATOR is
19524 located in. `grokdeclarator' sometimes changes the scope, so
19525 we compute it now. */
19528 /* Perform any lookups in the declared type which were thought to be
19529 dependent, but are not in the scope of the declarator. */
19530 decl_specifiers->type
19533 /* If we're allowing GNU extensions, look for an
19534 asm-specification. */
19536 {
19537 /* Look for an asm-specification. */
19540 }
19541 else
19544 /* Look for attributes. */
19548 /* Peek at the next token. */
19554 {
19555 /* Handle C++17 deduction guides. */
19559 {
19567 {
19571 }
19572 }
19574 /* Check to see if the token indicates the start of a
19575 function-definition. */
19577 {
19579 {
19580 /* If a function-definition should not appear here, issue an
19581 error message. */
19585 }
19587 location_t func_brace_location
19590 /* Neither attributes nor an asm-specification are allowed
19591 on a function-definition. */
19594 "an asm-specification is not allowed "
19598 "attributes are not allowed "
19600 /* This is a function-definition. */
19603 /* Parse the function definition. */
19606 decl_specifiers,
19607 declarator,
19608 prefix_attributes);
19609 else
19610 decl =
19611 (cp_parser_function_definition_from_specifiers_and_declarator
19615 {
19616 /* This is where the prologue starts... */
19619 }
19622 }
19623 }
19625 {
19626 /* A non-template declaration involving a function parameter list
19627 containing an implicit template parameter will be made into a
19628 template. If the resulting declaration is not going to be an
19629 actual function then finish the template scope here to prevent it.
19630 An error message will be issued once we have a decl to talk about.
19632 FIXME probably we should do type deduction rather than create an
19633 implicit template, but the standard currently doesn't allow it. */
19636 }
19638 /* [dcl.dcl]
19640 Only in function declarations for constructors, destructors, type
19641 conversions, and deduction guides can the decl-specifier-seq be omitted.
19643 We explicitly postpone this check past the point where we handle
19644 function-definitions because we tolerate function-definitions
19645 that are missing their return types in some modes. */
19647 {
19651 }
19653 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19657 {
19668 {
19674 }
19675 }
19676 else
19677 {
19678 /* If the init-declarator isn't initialized and isn't followed by a
19679 `,' or `;', it's not a valid init-declarator. */
19682 {
19685 else
19686 {
19690 }
19691 }
19694 }
19696 /* Because start_decl has side-effects, we should only call it if we
19697 know we're going ahead. By this point, we know that we cannot
19698 possibly be looking at any other construct. */
19701 /* Enter the newly declared entry in the symbol table. If we're
19702 processing a declaration in a class-specifier, we wait until
19703 after processing the initializer. */
19705 {
19713 /* Adjust location of decl if declarator->id_loc is more appropriate:
19714 set, and decl wasn't merged with another decl, in which case its
19715 location would be different from input_location, and more accurate. */
19720 }
19722 /* Enter the SCOPE. That way unqualified names appearing in the
19723 initializer will be looked up in SCOPE. */
19726 /* Perform deferred access control checks, now that we know in which
19727 SCOPE the declared entity resides. */
19729 {
19732 /* If the entity being declared is a function, pretend that we
19733 are in its scope. If it is a `friend', it may have access to
19734 things that would not otherwise be accessible. */
19736 {
19739 }
19741 /* Perform access checks for template parameters. */
19744 /* Perform the access control checks for the declarator and the
19745 decl-specifiers. */
19748 /* Restore the saved value. */
19751 }
19753 /* Parse the initializer. */
19758 {
19760 {
19763 else
19764 {
19765 /* If the declaration was erroneous, we don't really
19766 know what the user intended, so just silently
19767 consume the initializer. */
19774 }
19775 }
19776 else
19777 {
19778 /* We want to record the extra mangling scope for in-class
19779 initializers of class members and initializers of static data
19780 member templates. The former involves deferring
19781 parsing of the initializer until end of class as with default
19782 arguments. So right here we only handle the latter. */
19792 }
19793 }
19795 /* The old parser allows attributes to appear after a parenthesized
19796 initializer. Mark Mitchell proposed removing this functionality
19797 on the GCC mailing lists on 2002-08-13. This parser accepts the
19798 attributes -- but ignores them. Made a permerror in GCC 8. */
19804 {
19807 {
19811 }
19812 }
19814 /* And now complain about a non-function implicit template. */
19819 /* For an in-class declaration, use `grokfield' to create the
19820 declaration. */
19822 {
19824 {
19827 }
19836 }
19838 /* Finish processing the declaration. But, skip member
19839 declarations. */
19841 {
19844 asm_specification,
19845 /* If the initializer is in parentheses, then this is
19846 a direct-initialization, which means that an
19847 `explicit' constructor is OK. Otherwise, an
19848 `explicit' constructor cannot be used. */
19851 }
19854 /* Core issue #226 (C++0x only): A default template-argument
19855 shall not be specified in a friend class template
19856 declaration. */
19865 {
19868 else
19870 }
19877 }
19879 /* Parse a declarator.
19881 declarator:
19882 direct-declarator
19883 ptr-operator declarator
19885 abstract-declarator:
19886 ptr-operator abstract-declarator [opt]
19887 direct-abstract-declarator
19889 GNU Extensions:
19891 declarator:
19892 attributes [opt] direct-declarator
19893 attributes [opt] ptr-operator declarator
19895 abstract-declarator:
19896 attributes [opt] ptr-operator abstract-declarator [opt]
19897 attributes [opt] direct-abstract-declarator
19899 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19900 detect constructors, destructors, deduction guides, or conversion operators.
19901 It is set to -1 if the declarator is a name, and +1 if it is a
19902 function. Otherwise it is set to zero. Usually you just want to
19903 test for >0, but internally the negative value is used.
19905 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19906 a decl-specifier-seq unless it declares a constructor, destructor,
19907 or conversion. It might seem that we could check this condition in
19908 semantic analysis, rather than parsing, but that makes it difficult
19909 to handle something like `f()'. We want to notice that there are
19910 no decl-specifiers, and therefore realize that this is an
19911 expression, not a declaration.)
19913 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19914 the declarator is a direct-declarator of the form "(...)".
19916 MEMBER_P is true iff this declarator is a member-declarator.
19918 FRIEND_P is true iff this declarator is a friend. */
19922 cp_parser_declarator_kind dcl_kind,
19926 {
19929 cp_cv_quals cv_quals;
19930 tree class_type;
19933 /* Assume this is not a constructor, destructor, or type-conversion
19934 operator. */
19941 /* Check for the ptr-operator production. */
19943 /* Parse the ptr-operator. */
19949 /* If that worked, then we have a ptr-operator. */
19951 {
19952 /* If a ptr-operator was found, then this declarator was not
19953 parenthesized. */
19956 /* The dependent declarator is optional if we are parsing an
19957 abstract-declarator. */
19961 /* Parse the dependent declarator. */
19966 friend_p);
19968 /* If we are parsing an abstract-declarator, we must handle the
19969 case where the dependent declarator is absent. */
19974 declarator = cp_parser_make_indirect_declarator
19976 }
19977 /* Everything else is a direct-declarator. */
19978 else
19979 {
19982 CPP_OPEN_PAREN);
19984 ctor_dtor_or_conv_p,
19986 }
19991 }
19993 /* Parse a direct-declarator or direct-abstract-declarator.
19995 direct-declarator:
19996 declarator-id
19997 direct-declarator ( parameter-declaration-clause )
19998 cv-qualifier-seq [opt]
19999 ref-qualifier [opt]
20000 exception-specification [opt]
20001 direct-declarator [ constant-expression [opt] ]
20002 ( declarator )
20004 direct-abstract-declarator:
20005 direct-abstract-declarator [opt]
20006 ( parameter-declaration-clause )
20007 cv-qualifier-seq [opt]
20008 ref-qualifier [opt]
20009 exception-specification [opt]
20010 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20011 ( abstract-declarator )
20013 Returns a representation of the declarator. DCL_KIND is
20014 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20015 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20016 we are parsing a direct-declarator. It is
20017 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20018 of ambiguity we prefer an abstract declarator, as per
20019 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
20020 as for cp_parser_declarator. */
20024 cp_parser_declarator_kind dcl_kind,
20027 {
20038 {
20039 /* Peek at the next token. */
20042 {
20043 /* This is either a parameter-declaration-clause, or a
20044 parenthesized declarator. When we know we are parsing a
20045 named declarator, it must be a parenthesized declarator
20046 if FIRST is true. For instance, `(int)' is a
20047 parameter-declaration-clause, with an omitted
20048 direct-abstract-declarator. But `((*))', is a
20049 parenthesized abstract declarator. Finally, when T is a
20050 template parameter `(T)' is a
20051 parameter-declaration-clause, and not a parenthesized
20052 named declarator.
20054 We first try and parse a parameter-declaration-clause,
20055 and then try a nested declarator (if FIRST is true).
20057 It is not an error for it not to be a
20058 parameter-declaration-clause, even when FIRST is
20059 false. Consider,
20061 int i (int);
20062 int i (3);
20064 The first is the declaration of a function while the
20065 second is the definition of a variable, including its
20066 initializer.
20068 Having seen only the parenthesis, we cannot know which of
20069 these two alternatives should be selected. Even more
20070 complex are examples like:
20072 int i (int (a));
20073 int i (int (3));
20075 The former is a function-declaration; the latter is a
20076 variable initialization.
20078 Thus again, we try a parameter-declaration-clause, and if
20079 that fails, we back out and return. */
20082 {
20083 tree params;
20088 /* In a member-declarator, the only valid interpretation
20089 of a parenthesis is the start of a
20090 parameter-declaration-clause. (It is invalid to
20091 initialize a static data member with a parenthesized
20092 initializer; only the "=" form of initialization is
20093 permitted.) */
20097 /* Consume the `('. */
20098 matching_parens parens;
20101 {
20102 /* If this is going to be an abstract declarator, we're
20103 in a declarator and we can't have default args. */
20106 }
20110 /* Parse the parameter-declaration-clause. */
20113 /* Consume the `)'. */
20116 /* If all went well, parse the cv-qualifier-seq,
20117 ref-qualifier and the exception-specification. */
20119 {
20120 cp_cv_quals cv_quals;
20121 cp_virt_specifiers virt_specifiers;
20122 cp_ref_qualifier ref_qual;
20123 tree exception_specification;
20124 tree late_return;
20125 tree attrs;
20135 /* Parse the cv-qualifier-seq. */
20137 /* Parse the ref-qualifier. */
20139 /* Parse the tx-qualifier. */
20141 /* And the exception-specification. */
20142 exception_specification
20147 /* In here, we handle cases where attribute is used after
20148 the function declaration. For example:
20149 void func (int x) __attribute__((vector(..))); */
20152 late_return = (cp_parser_late_return_type_opt
20156 /* Parse the virt-specifier-seq. */
20159 /* Create the function-declarator. */
20161 params,
20162 cv_quals,
20163 virt_specifiers,
20164 ref_qual,
20165 tx_qual,
20166 exception_specification,
20167 late_return,
20168 requires_clause);
20171 /* Any subsequent parameter lists are to do with
20172 return type, so are not those of the declared
20173 function. */
20175 }
20177 /* Remove the function parms from scope. */
20181 /* Repeat the main loop. */
20183 }
20185 /* If this is the first, we can try a parenthesized
20186 declarator. */
20188 {
20195 /* Consume the `('. */
20196 matching_parens parens;
20198 /* Parse the nested declarator. */
20201 declarator
20207 /* Expect a `)'. */
20215 }
20216 /* Otherwise, we must be done. */
20217 else
20219 }
20223 {
20224 /* Parse an array-declarator. */
20234 /* Consume the `['. */
20236 /* Peek at the next token. */
20238 /* If the next token is `]', then there is no
20239 constant-expression. */
20241 {
20243 bounds
20253 {
20254 /* Normally, the array bound must be an integral constant
20255 expression. However, as an extension, we allow VLAs
20256 in function scopes as long as they aren't part of a
20257 parameter declaration. */
20261 }
20264 {
20265 /* Remember this wasn't a constant-expression. */
20268 }
20269 }
20270 else
20272 /* Look for the closing `]'. */
20274 {
20277 }
20282 }
20284 {
20285 {
20286 tree qualifying_scope;
20287 tree unqualified_name;
20288 tree attrs;
20289 special_function_kind sfk;
20294 /* Parse a declarator-id */
20297 {
20300 /* If we see an ellipsis, we should be looking at a
20301 parameter pack. */
20303 {
20304 /* Consume the `...' */
20308 }
20309 }
20312 unqualified_name
20316 {
20320 {
20321 /* Check whether an error occurred. */
20324 /* We already consumed the ellipsis to mark a
20325 parameter pack, but we have no way to report it,
20326 so abort the tentative parse. We will be exiting
20327 immediately anyway. */
20329 }
20330 else
20336 && (qualifying_scope
20338 {
20341 }
20342 }
20347 {
20352 }
20358 {
20359 /* In the declaration of a member of a template class
20360 outside of the class itself, the SCOPE will sometimes
20361 be a TYPENAME_TYPE. For example, given:
20363 template <typename T>
20364 int S<T>::R::i = 3;
20366 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20367 this context, we must resolve S<T>::R to an ordinary
20368 type, rather than a typename type.
20370 The reason we normally avoid resolving TYPENAME_TYPEs
20371 is that a specialization of `S' might render
20372 `S<T>::R' not a type. However, if `S' is
20373 specialized, then this `i' will not be used, so there
20374 is no harm in resolving the types here. */
20375 tree type;
20377 /* Resolve the TYPENAME_TYPE. */
20380 /* If that failed, the declarator is invalid. */
20382 {
20385 "cannot define member of dependent typedef "
20387 else
20392 }
20394 }
20399 {
20400 tree class_type;
20405 else
20409 {
20413 {
20414 /* We do not attempt to print the declarator
20415 here because we do not have enough
20416 information about its original syntactic
20417 form. */
20421 }
20424 {
20428 "use %<%T::%D%> instead of %<%T::%D%> to "
20430 class_type,
20435 }
20437 }
20440 {
20447 for an unnamed type, even if the type
20448 got a name for linkage purposes. */
20450 /* Handle correctly (c++/19200):
20452 struct S {
20453 struct T{};
20454 friend void S(T);
20455 };
20457 and also:
20459 namespace N {
20460 void S();
20461 }
20463 struct S {
20464 friend void N::S();
20465 }; */
20468 class_type))
20477 }
20478 }
20480 unqualified_name,
20481 sfk);
20488 }
20490 handle_declarator:;
20493 {
20494 /* Any names that appear after the declarator-id for a
20495 member are looked up in the containing scope. */
20497 {
20498 /* But declarations with qualified-ids can't appear in a
20499 function. */
20503 }
20505 }
20509 /* Default args are only allowed on function
20510 declarations. */
20512 else
20516 }
20517 /* We're done. */
20518 else
20520 }
20522 /* For an abstract declarator, we might wind up with nothing at this
20523 point. That's an error; the declarator is not optional. */
20527 {
20528 /* Record overly parenthesized declarator so we can give a
20529 diagnostic about confusing decl/expr disambiguation. */
20531 {
20532 /* If the open and close parens are on different lines, this
20533 is probably a formatting thing, so ignore. */
20538 }
20541 }
20543 /* If we entered a scope, we must exit it now. */
20551 }
20553 /* Parse a ptr-operator.
20555 ptr-operator:
20556 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20557 * cv-qualifier-seq [opt]
20558 &
20559 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20560 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20562 GNU Extension:
20564 ptr-operator:
20565 & cv-qualifier-seq [opt]
20567 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20568 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20569 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20570 filled in with the TYPE containing the member. *CV_QUALS is
20571 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20572 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20573 Note that the tree codes returned by this function have nothing
20574 to do with the types of trees that will be eventually be created
20575 to represent the pointer or reference type being parsed. They are
20576 just constants with suggestive names. */
20577 static enum tree_code
20582 {
20587 /* Assume that it's not a pointer-to-member. */
20589 /* And that there are no cv-qualifiers. */
20592 /* Peek at the next token. */
20595 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20605 {
20606 /* Consume the `*', `&' or `&&'. */
20609 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20610 `&', if we are allowing GNU extensions. (The only qualifier
20611 that can legally appear after `&' is `restrict', but that is
20612 enforced during semantic analysis. */
20620 }
20621 else
20622 {
20623 /* Try the pointer-to-member case. */
20625 /* Look for the optional `::' operator. */
20628 /* Look for the nested-name specifier. */
20635 /* If we found it, and the next token is a `*', then we are
20636 indeed looking at a pointer-to-member operator. */
20639 {
20640 /* Indicate that the `*' operator was used. */
20648 else
20649 {
20650 /* The type of which the member is a member is given by the
20651 current SCOPE. */
20653 /* The next name will not be qualified. */
20657 /* Look for optional c++11 attributes. */
20661 /* Look for the optional cv-qualifier-seq. */
20663 }
20664 }
20665 /* If that didn't work we don't have a ptr-operator. */
20668 }
20671 }
20673 /* Parse an (optional) cv-qualifier-seq.
20675 cv-qualifier-seq:
20676 cv-qualifier cv-qualifier-seq [opt]
20678 cv-qualifier:
20679 const
20680 volatile
20682 GNU Extension:
20684 cv-qualifier:
20685 __restrict__
20687 Returns a bitmask representing the cv-qualifiers. */
20689 static cp_cv_quals
20691 {
20695 {
20697 cp_cv_quals cv_qualifier;
20699 /* Peek at the next token. */
20701 /* See if it's a cv-qualifier. */
20703 {
20719 }
20725 {
20730 }
20731 else
20732 {
20735 }
20736 }
20739 }
20741 /* Parse an (optional) ref-qualifier
20743 ref-qualifier:
20744 &
20745 &&
20747 Returns cp_ref_qualifier representing ref-qualifier. */
20749 static cp_ref_qualifier
20751 {
20754 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20759 {
20764 {
20776 }
20781 {
20784 }
20785 else
20786 {
20789 }
20790 }
20793 }
20795 /* Parse an optional tx-qualifier.
20797 tx-qualifier:
20798 transaction_safe
20799 transaction_safe_dynamic */
20801 static tree
20803 {
20806 {
20811 {
20815 {
20818 {
20821 }
20822 else
20824 }
20825 }
20826 }
20828 }
20830 /* Parse an (optional) virt-specifier-seq.
20832 virt-specifier-seq:
20833 virt-specifier virt-specifier-seq [opt]
20835 virt-specifier:
20836 override
20837 final
20839 Returns a bitmask representing the virt-specifiers. */
20841 static cp_virt_specifiers
20843 {
20847 {
20849 cp_virt_specifiers virt_specifier;
20851 /* Peek at the next token. */
20853 /* See if it's a virt-specifier-qualifier. */
20857 {
20860 }
20862 {
20865 }
20867 {
20869 }
20870 else
20874 {
20879 }
20880 else
20881 {
20884 }
20885 }
20887 }
20889 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20890 is in scope even though it isn't real. */
20892 void
20894 {
20895 tree this_parm;
20898 {
20899 /* We don't clear this between NSDMIs. Is it already what we want? */
20906 }
20909 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20911 current_class_ref
20914 }
20916 /* Return true iff our current scope is a non-static data member
20917 initializer. */
20919 bool
20921 {
20922 /* We recognize NSDMI context by the context-less 'this' pointer set up
20923 by the function above. */
20929 }
20931 /* Parse a late-specified return type, if any. This is not a separate
20932 non-terminal, but part of a function declarator, which looks like
20934 -> trailing-type-specifier-seq abstract-declarator(opt)
20936 Returns the type indicated by the type-id.
20938 In addition to this, parse any queued up #pragma omp declare simd
20939 clauses, and #pragma acc routine clauses.
20941 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20942 function. */
20944 static tree
20947 {
20951 && declarator
20955 && declarator
20958 /* Peek at the next token. */
20960 /* A late-specified return type is indicated by an initial '->'. */
20971 {
20972 /* DR 1207: 'this' is in scope in the trailing return type. */
20974 }
20977 {
20978 /* Consume the ->. */
20982 }
20984 /* Function declarations may be followed by a trailing
20985 requires-clause. */
20989 declarator->attributes
20993 declarator->attributes
20998 {
21001 }
21004 }
21006 /* Parse a declarator-id.
21008 declarator-id:
21009 id-expression
21010 :: [opt] nested-name-specifier [opt] type-name
21012 In the `id-expression' case, the value returned is as for
21013 cp_parser_id_expression if the id-expression was an unqualified-id.
21014 If the id-expression was a qualified-id, then a SCOPE_REF is
21015 returned. The first operand is the scope (either a NAMESPACE_DECL
21016 or TREE_TYPE), but the second is still just a representation of an
21017 unqualified-id. */
21019 static tree
21021 {
21022 tree id;
21023 /* The expression must be an id-expression. Assume that qualified
21024 names are the names of types so that:
21026 template <class T>
21027 int S<T>::R::i = 3;
21029 will work; we must treat `S<T>::R' as the name of a type.
21030 Similarly, assume that qualified names are templates, where
21031 required, so that:
21033 template <class T>
21034 int S<T>::R<T>::i = 3;
21036 will work, too. */
21042 optional_p);
21046 }
21048 /* Parse a type-id.
21050 type-id:
21051 type-specifier-seq abstract-declarator [opt]
21053 Returns the TYPE specified. */
21055 static tree
21058 {
21059 cp_decl_specifier_seq type_specifier_seq;
21062 /* Parse the type-specifier-seq. */
21064 is_trailing_return,
21069 /* A bare template name as a template argument is a template template
21070 argument, not a placeholder, so fail parsing it as a type argument. */
21071 {
21075 }
21079 /* There might or might not be an abstract declarator. */
21081 /* Look for the declarator. */
21082 abstract_declarator
21087 /* Check to see if there really was a declarator. */
21092 /* The concepts TS allows 'auto' as a type-id. */
21094 /* None of the valid uses of 'auto' in C++14 involve the type-id
21095 nonterminal, but it is valid in a trailing-return-type. */
21098 {
21099 /* A type-id with type 'auto' is only ok if the abstract declarator
21100 is a function declarator with a late-specified return type.
21102 A type-id with 'auto' is also valid in a trailing-return-type
21103 in a compound-requirement. */
21110 else
21111 {
21114 {
21116 auto_node);
21118 tmpl);
21119 }
21120 else
21123 }
21124 }
21127 is_template_arg);
21128 }
21130 static tree
21132 {
21134 }
21136 static tree
21138 {
21139 tree r;
21141 parser->type_definition_forbidden_message
21146 {
21149 }
21151 }
21153 static tree
21155 {
21157 }
21159 /* Parse a type-specifier-seq.
21161 type-specifier-seq:
21162 type-specifier type-specifier-seq [opt]
21164 GNU extension:
21166 type-specifier-seq:
21167 attributes type-specifier-seq [opt]
21169 If IS_DECLARATION is true, we are at the start of a "condition" or
21170 exception-declaration, so we might be followed by a declarator-id.
21172 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21173 i.e. we've just seen "->".
21175 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21177 static void
21182 {
21187 /* Clear the TYPE_SPECIFIER_SEQ. */
21190 /* In the context of a trailing return type, enum E { } is an
21191 elaborated-type-specifier followed by a function-body, not an
21192 enum-specifier. */
21196 /* Parse the type-specifiers and attributes. */
21198 {
21199 tree type_specifier;
21202 /* Check for attributes first. */
21204 {
21205 type_specifier_seq->attributes
21209 }
21211 /* record the token of the beginning of the type specifier seq,
21212 for error reporting purposes*/
21216 /* Look for the type-specifier. */
21218 flags,
21219 type_specifier_seq,
21221 NULL,
21224 {
21225 /* If the first type-specifier could not be found, this is not a
21226 type-specifier-seq at all. */
21228 {
21229 /* Set in_declarator_p to avoid skipping to the semicolon. */
21241 }
21242 /* If subsequent type-specifiers could not be found, the
21243 type-specifier-seq is complete. */
21245 }
21248 /* The standard says that a condition can be:
21250 type-specifier-seq declarator = assignment-expression
21252 However, given:
21254 struct S {};
21255 if (int S = ...)
21257 we should treat the "S" as a declarator, not as a
21258 type-specifier. The standard doesn't say that explicitly for
21259 type-specifier-seq, but it does say that for
21260 decl-specifier-seq in an ordinary declaration. Perhaps it
21261 would be clearer just to allow a decl-specifier-seq here, and
21262 then add a semantic restriction that if any decl-specifiers
21263 that are not type-specifiers appear, the program is invalid. */
21266 }
21267 }
21269 /* Return whether the function currently being declared has an associated
21270 template parameter list. */
21272 static bool
21274 {
21287 }
21289 /* Parse a parameter-declaration-clause.
21291 parameter-declaration-clause:
21292 parameter-declaration-list [opt] ... [opt]
21293 parameter-declaration-list , ...
21295 Returns a representation for the parameter declarations. A return
21296 value of NULL indicates a parameter-declaration-clause consisting
21297 only of an ellipsis. */
21299 static tree
21301 {
21302 tree parameters;
21310 && !processing_template_parmlist
21311 && !processing_explicit_instantiation
21312 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21313 actual function or a random abstract declarator. */
21319 /* Peek at the next token. */
21321 /* Check for trivial parameter-declaration-clauses. */
21323 {
21324 /* Consume the `...' token. */
21327 }
21329 /* There are no parameters. */
21330 {
21331 #ifndef NO_IMPLICIT_EXTERN_C
21336 else
21337 #endif
21339 }
21340 /* Check for `(void)', too, which is a special case. */
21344 {
21345 /* Consume the `void' token. */
21347 /* There are no parameters. */
21349 }
21351 /* Parse the parameter-declaration-list. */
21353 /* If a parse error occurred while parsing the
21354 parameter-declaration-list, then the entire
21355 parameter-declaration-clause is erroneous. */
21359 /* Peek at the next token. */
21361 /* If it's a `,', the clause should terminate with an ellipsis. */
21363 {
21364 /* Consume the `,'. */
21366 /* Expect an ellipsis. */
21367 ellipsis_p
21369 }
21370 /* It might also be `...' if the optional trailing `,' was
21371 omitted. */
21373 {
21374 /* Consume the `...' token. */
21376 /* And remember that we saw it. */
21378 }
21379 else
21382 /* Finish the parameter list. */
21387 }
21389 /* Parse a parameter-declaration-list.
21391 parameter-declaration-list:
21392 parameter-declaration
21393 parameter-declaration-list , parameter-declaration
21395 Returns a representation of the parameter-declaration-list, as for
21396 cp_parser_parameter_declaration_clause. However, the
21397 `void_list_node' is never appended to the list. */
21399 static tree
21401 {
21407 /* The special considerations that apply to a function within an
21408 unbraced linkage specifications do not apply to the parameters
21409 to the function. */
21410 saved_in_unbraced_linkage_specification_p
21414 /* Look for more parameters. */
21416 {
21421 /* Parse the parameter. */
21422 parameter
21427 /* We don't know yet if the enclosing context is deprecated, so wait
21428 and warn in grokparms if appropriate. */
21432 {
21435 PARM,
21440 }
21444 /* If a parse error occurred parsing the parameter declaration,
21445 then the entire parameter-declaration-list is erroneous. */
21447 {
21450 }
21460 {
21464 }
21466 /* Add the new parameter to the list. */
21470 /* Peek at the next token. */
21473 /* These are for Objective-C++ */
21476 /* The parameter-declaration-list is complete. */
21479 {
21482 /* Peek at the next token. */
21484 /* If it's an ellipsis, then the list is complete. */
21487 /* Otherwise, there must be more parameters. Consume the
21488 `,'. */
21490 /* When parsing something like:
21492 int i(float f, double d)
21494 we can tell after seeing the declaration for "f" that we
21495 are not looking at an initialization of a variable "i",
21496 but rather at the declaration of a function "i".
21498 Due to the fact that the parsing of template arguments
21499 (as specified to a template-id) requires backtracking we
21500 cannot use this technique when inside a template argument
21501 list. */
21505 /* However, a parameter-declaration of the form
21506 "float(f)" (which is a valid declaration of a
21507 parameter "f") can also be interpreted as an
21508 expression (the conversion of "f" to "float"). */
21511 }
21512 else
21513 {
21521 }
21522 }
21524 parser->in_unbraced_linkage_specification_p
21527 /* Reset implicit_template_scope if we are about to leave the function
21528 parameter list that introduced it. Note that for out-of-line member
21529 definitions, there will be one or more class scopes before we get to
21530 the template parameter scope. */
21534 {
21538 {
21541 }
21542 }
21545 }
21547 /* Parse a parameter declaration.
21549 parameter-declaration:
21550 decl-specifier-seq ... [opt] declarator
21551 decl-specifier-seq declarator = assignment-expression
21552 decl-specifier-seq ... [opt] abstract-declarator [opt]
21553 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21555 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21556 declares a template parameter. (In that case, a non-nested `>'
21557 token encountered during the parsing of the assignment-expression
21558 is not interpreted as a greater-than operator.)
21560 Returns a representation of the parameter, or NULL if an error
21561 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21562 true iff the declarator is of the form "(p)". */
21568 {
21570 cp_decl_specifier_seq decl_specifiers;
21572 tree default_argument;
21577 /* In a template parameter, `>' is not an operator.
21579 [temp.param]
21581 When parsing a default template-argument for a non-type
21582 template-parameter, the first non-nested `>' is taken as the end
21583 of the template parameter-list rather than a greater-than
21584 operator. */
21586 /* Type definitions may not appear in parameter types. */
21588 parser->type_definition_forbidden_message
21595 /* Parse the declaration-specifiers. */
21598 CP_PARSER_FLAGS_NONE,
21602 /* Complain about missing 'typename' or other invalid type names. */
21607 /* If an error occurred, there's no reason to attempt to parse the
21608 rest of the declaration. */
21610 {
21613 }
21615 /* Peek at the next token. */
21618 /* If the next token is a `)', `,', `=', `>', or `...', then there
21619 is no declarator. However, when variadic templates are enabled,
21620 there may be a declarator following `...'. */
21625 {
21629 }
21630 /* Otherwise, there should be a declarator. */
21631 else
21632 {
21636 /* After seeing a decl-specifier-seq, if the next token is not a
21637 "(", there is no possibility that the code is a valid
21638 expression. Therefore, if parsing tentatively, we commit at
21639 this point. */
21641 /* In an expression context, having seen:
21643 (int((char ...
21645 we cannot be sure whether we are looking at a
21646 function-type (taking a "char" as a parameter) or a cast
21647 of some object of type "char" to "int". */
21653 /* Parse the declarator. */
21656 CP_PARSER_DECLARATOR_EITHER,
21658 parenthesized_p,
21662 /* After the declarator, allow more attributes. */
21663 decl_specifiers.attributes
21667 /* If the declarator is a template parameter pack, remember that and
21668 clear the flag in the declarator itself so we don't get errors
21669 from grokdeclarator. */
21671 {
21674 }
21675 }
21677 /* If the next token is an ellipsis, and we have not seen a declarator
21678 name, and if either the type of the declarator contains parameter
21679 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21680 for, eg, abbreviated integral type names), then we actually have a
21681 parameter pack expansion expression. Otherwise, leave the ellipsis
21682 for a C-style variadic function. */
21685 /* If a function parameter pack was specified and an implicit template
21686 parameter was introduced during cp_parser_parameter_declaration,
21687 change any implicit parameters introduced into packs. */
21691 {
21699 }
21702 {
21713 {
21714 /* Consume the `...'. */
21718 /* Build a pack expansion type */
21723 else
21725 }
21726 }
21728 /* The restriction on defining new types applies only to the type
21729 of the parameter, not to the default argument. */
21732 /* If the next token is `=', then process a default argument. */
21734 {
21737 /* If we are defining a class, then the tokens that make up the
21738 default argument must be saved and processed later. */
21744 // A constrained-type-specifier may declare a type template-parameter.
21746 default_argument
21749 // A constrained-type-specifier may declare a template-template-parameter.
21751 default_argument
21754 /* Outside of a class definition, we can just parse the
21755 assignment-expression. */
21756 else
21757 default_argument
21761 {
21763 "default arguments are only "
21765 }
21767 || template_parameter_pack_p
21770 {
21771 /* Find the name of the parameter pack. */
21778 template_parm_p
21784 else
21786 template_parm_p
21793 }
21794 }
21795 else
21798 /* Generate a location for the parameter, ranging from the start of the
21799 initial token to the end of the final token (using input_location for
21800 the latter, set up by cp_lexer_set_source_position_from_token when
21801 consuming tokens).
21803 If we have a identifier, then use it for the caret location, e.g.
21805 extern int callee (int one, int (*two)(int, int), float three);
21806 ~~~~~~^~~~~~~~~~~~~~
21808 otherwise, reuse the start location for the caret location e.g.:
21810 extern int callee (int one, int (*)(int, int), float three);
21811 ^~~~~~~~~~~~~~~~~
21813 */
21819 input_location);
21822 declarator,
21823 default_argument,
21824 param_loc,
21825 template_parameter_pack_p);
21826 }
21828 /* Parse a default argument and return it.
21830 TEMPLATE_PARM_P is true if this is a default argument for a
21831 non-type template parameter. */
21832 static tree
21834 {
21840 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21841 set correctly. */
21844 /* Local variable names (and the `this' keyword) may not
21845 appear in a default argument. */
21848 /* Parse the assignment-expression. */
21853 /* The "this" pointer is not valid in a default argument. */
21855 {
21860 }
21861 default_argument
21863 /* Restore the "this" pointer. */
21865 {
21868 }
21877 }
21879 /* Parse a function-body.
21881 function-body:
21882 compound_statement */
21884 static void
21886 {
21890 }
21892 /* Parse a ctor-initializer-opt followed by a function-body. Return
21893 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21894 is true we are parsing a function-try-block. */
21896 static void
21899 {
21906 /* Begin the function body. */
21908 /* Parse the optional ctor-initializer. */
21911 /* If we're parsing a constexpr constructor definition, we need
21912 to check that the constructor body is indeed empty. However,
21913 before we get to cp_parser_function_body lot of junk has been
21914 generated, so we can't just check that we have an empty block.
21915 Rather we take a snapshot of the outermost block, and check whether
21916 cp_parser_function_body changed its state. */
21918 {
21922 }
21923 /* Parse the function-body. */
21927 /* Finish the function body. */
21929 }
21931 /* Parse an initializer.
21933 initializer:
21934 = initializer-clause
21935 ( expression-list )
21937 Returns an expression representing the initializer. If no
21938 initializer is present, NULL_TREE is returned.
21940 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21941 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21942 set to TRUE if there is no initializer present. If there is an
21943 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21944 is set to true; otherwise it is set to false. */
21946 static tree
21949 {
21951 tree init;
21953 /* Peek at the next token. */
21956 /* Let our caller know whether or not this initializer was
21957 parenthesized. */
21959 /* Assume that the initializer is constant. */
21963 {
21964 /* Consume the `='. */
21966 /* Parse the initializer-clause. */
21968 }
21970 {
21975 non_constant_p);
21980 }
21982 {
21987 }
21988 else
21989 {
21990 /* Anything else is an error. */
21993 }
21999 }
22001 /* Parse an initializer-clause.
22003 initializer-clause:
22004 assignment-expression
22005 braced-init-list
22007 Returns an expression representing the initializer.
22009 If the `assignment-expression' production is used the value
22010 returned is simply a representation for the expression.
22012 Otherwise, calls cp_parser_braced_list. */
22014 static cp_expr
22016 {
22017 cp_expr initializer;
22019 /* Assume the expression is constant. */
22022 /* If it is not a `{', then we are looking at an
22023 assignment-expression. */
22025 {
22026 initializer
22029 non_constant_p);
22030 }
22031 else
22035 }
22037 /* Parse a brace-enclosed initializer list.
22039 braced-init-list:
22040 { initializer-list , [opt] }
22041 { designated-initializer-list , [opt] }
22042 { }
22044 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22045 the elements of the initializer-list (or NULL, if the last
22046 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22047 NULL_TREE. There is no way to detect whether or not the optional
22048 trailing `,' was provided. NON_CONSTANT_P is as for
22049 cp_parser_initializer. */
22051 static cp_expr
22053 {
22054 tree initializer;
22057 /* Consume the `{' token. */
22058 matching_braces braces;
22060 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22062 /* If it's not a `}', then there is a non-trivial initializer. */
22064 {
22065 /* Parse the initializer list. */
22068 /* A trailing `,' token is allowed. */
22071 }
22072 else
22074 /* Now, there should be a trailing `}'. */
22080 /* Build a location of the form:
22081 { ... }
22082 ^~~~~~~
22083 with caret==start at the open brace, finish at the close brace. */
22087 }
22089 /* Consume tokens up to, and including, the next non-nested closing `]'.
22090 Returns true iff we found a closing `]'. */
22092 static bool
22094 {
22098 {
22102 {
22105 /* If we've run out of tokens, then there is no closing `]'. */
22114 {
22117 }
22122 }
22124 /* Consume the token. */
22126 }
22127 }
22129 /* Return true if we are looking at an array-designator, false otherwise. */
22131 static bool
22133 {
22134 /* Consume the `['. */
22139 /* Skip tokens until the next token is a closing square bracket.
22140 If we find the closing `]', and the next token is a `=', then
22141 we are looking at an array designator. */
22142 bool array_designator_p
22146 /* Roll back the tokens we skipped. */
22150 }
22152 /* Parse an initializer-list.
22154 initializer-list:
22155 initializer-clause ... [opt]
22156 initializer-list , initializer-clause ... [opt]
22158 C++2A Extension:
22160 designated-initializer-list:
22161 designated-initializer-clause
22162 designated-initializer-list , designated-initializer-clause
22164 designated-initializer-clause:
22165 designator brace-or-equal-initializer
22167 designator:
22168 . identifier
22170 GNU Extension:
22172 initializer-list:
22173 designation initializer-clause ...[opt]
22174 initializer-list , designation initializer-clause ...[opt]
22176 designation:
22177 . identifier =
22178 identifier :
22179 [ constant-expression ] =
22181 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22182 for the initializer. If the INDEX of the elt is non-NULL, it is the
22183 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22184 as for cp_parser_initializer. */
22188 {
22193 /* Assume all of the expressions are constant. */
22196 /* Parse the rest of the list. */
22198 {
22200 tree designator;
22201 tree initializer;
22205 /* Handle the C++2A syntax, '. id ='. */
22213 {
22216 "C++ designated initializers only available with "
22218 /* Consume the `.'. */
22220 /* Consume the identifier. */
22223 /* Consume the `='. */
22225 }
22226 /* Also, if the next token is an identifier and the following one is a
22227 colon, we are looking at the GNU designated-initializer
22228 syntax. */
22233 {
22234 /* Warn the user that they are using an extension. */
22237 /* Consume the identifier. */
22239 /* Consume the `:'. */
22241 }
22242 /* Also handle C99 array designators, '[ const ] ='. */
22246 {
22247 /* In C++11, [ could start a lambda-introducer. */
22253 {
22256 }
22257 else
22258 {
22263 }
22268 && (!require_potential_rvalue_constant_expression
22272 /* Warn the user that they are using an extension. */
22275 }
22276 else
22280 {
22283 }
22287 {
22291 }
22295 /* Parse the initializer. */
22298 /* If any clause is non-constant, so is the entire initializer. */
22302 /* If we have an ellipsis, this is an initializer pack
22303 expansion. */
22305 {
22308 /* Consume the `...'. */
22315 /* Turn the initializer into an initializer expansion. */
22317 }
22319 /* Add it to the vector. */
22322 /* If the next token is not a comma, we have reached the end of
22323 the list. */
22327 /* Peek at the next token. */
22329 /* If the next token is a `}', then we're still done. An
22330 initializer-clause can have a trailing `,' after the
22331 initializer-list and before the closing `}'. */
22335 /* Consume the `,' token. */
22337 }
22339 /* The same identifier shall not appear in multiple designators
22340 of a designated-initializer-list. */
22342 {
22347 {
22349 {
22351 "%<.%s%> designator used multiple times in "
22355 }
22356 else
22358 }
22362 }
22365 }
22367 /* Classes [gram.class] */
22369 /* Parse a class-name.
22371 class-name:
22372 identifier
22373 template-id
22375 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22376 to indicate that names looked up in dependent types should be
22377 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22378 keyword has been used to indicate that the name that appears next
22379 is a template. TAG_TYPE indicates the explicit tag given before
22380 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22381 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22382 is the class being defined in a class-head. If ENUM_OK is TRUE,
22383 enum-names are also accepted.
22385 Returns the TYPE_DECL representing the class. */
22387 static tree
22396 {
22397 tree decl;
22398 tree scope;
22403 /* All class-names start with an identifier. */
22406 {
22409 }
22411 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22412 to a template-id, so we save it here. */
22417 /* Any name names a type if we're following the `typename' keyword
22418 in a qualified name where the enclosing scope is type-dependent. */
22421 /* Handle the common case (an identifier, but not a template-id)
22422 efficiently. */
22425 {
22429 /* Look for the identifier. */
22433 /* If the next token isn't an identifier, we are certainly not
22434 looking at a class-name. */
22437 /* If we know this is a type-name, there's no need to look it
22438 up. */
22441 else
22442 {
22443 tree ambiguous_decls;
22444 /* If we already know that this lookup is ambiguous, then
22445 we've already issued an error message; there's no reason
22446 to check again. */
22448 {
22451 }
22452 /* If the next token is a `::', then the name must be a type
22453 name.
22455 [basic.lookup.qual]
22457 During the lookup for a name preceding the :: scope
22458 resolution operator, object, function, and enumerator
22459 names are ignored. */
22462 /* Look up the name. */
22464 tag_type,
22467 check_dependency_p,
22471 {
22475 }
22476 }
22477 }
22478 else
22479 {
22480 /* Try a template-id. */
22482 check_dependency_p,
22483 tag_type,
22484 is_declaration);
22487 }
22491 /* If this is a typename, create a TYPENAME_TYPE. */
22493 {
22498 }
22502 /* Check to see that it is really the name of a class. */
22506 /* Situations like this:
22508 template <typename T> struct A {
22509 typename T::template X<int>::I i;
22510 };
22512 are problematic. Is `T::template X<int>' a class-name? The
22513 standard does not seem to be definitive, but there is no other
22514 valid interpretation of the following `::'. Therefore, those
22515 names are considered class-names. */
22516 {
22520 }
22525 /* In Objective-C 2.0, a classname followed by '.' starts a
22526 dot-syntax expression, and it's not a type-name. */
22538 }
22540 /* Parse a class-specifier.
22542 class-specifier:
22543 class-head { member-specification [opt] }
22545 Returns the TREE_TYPE representing the class. */
22547 static tree
22549 {
22550 tree type;
22564 /* Parse the class-head. */
22567 /* If the class-head was a semantic disaster, skip the entire body
22568 of the class. */
22570 {
22574 }
22576 /* Look for the `{'. */
22577 matching_braces braces;
22579 {
22582 }
22587 /* Issue an error message if type-definitions are forbidden here. */
22589 /* Remember that we are defining one more class. */
22591 /* Inside the class, surrounding template-parameter-lists do not
22592 apply. */
22593 saved_num_template_parameter_lists
22596 /* We are not in a function body. */
22599 /* Or in a loop. */
22602 /* Or in a switch. */
22605 /* We are not immediately inside an extern "lang" block. */
22606 saved_in_unbraced_linkage_specification_p
22610 // Associate constraints with the type.
22614 /* Start the class. */
22616 {
22619 }
22623 /* If the type is erroneous, skip the entire body of the class. */
22625 else
22626 /* Parse the member-specification. */
22629 /* Look for the trailing `}'. */
22631 /* Look for trailing attributes to apply to this class. */
22639 /* We've finished a type definition. Check for the common syntax
22640 error of forgetting a semicolon after the definition. We need to
22641 be careful, as we can't just check for not-a-semicolon and be done
22642 with it; the user might have typed:
22644 class X { } c = ...;
22645 class X { } *p = ...;
22647 and so forth. Instead, enumerate all the possible tokens that
22648 might follow this production; if we don't see one of them, then
22649 complain and silently insert the semicolon. */
22650 {
22655 /* Don't try to parse c++11 attributes here. As per the
22656 grammar, that should be a task for
22657 cp_parser_decl_specifier_seq. */
22661 {
22672 /* While it's legal for type qualifiers and storage class
22673 specifiers to follow type definitions in the grammar, only
22674 compiler testsuites contain code like that. Assume that if
22675 we see such code, then what we're really seeing is a case
22676 like:
22678 class X { }
22679 const <type> var = ...;
22681 or
22683 class Y { }
22684 static <type> func (...) ...
22686 i.e. the qualifier or specifier applies to the next
22687 declaration. To do so, however, we need to look ahead one
22688 more token to see if *that* token is a type specifier.
22690 This code could be improved to handle:
22692 class Z { }
22693 static const <type> var = ...; */
22696 {
22699 /* Handling user-defined types here would be nice, but very
22700 tricky. */
22701 want_semicolon
22704 }
22708 }
22710 /* If we don't have a type, then something is very wrong and we
22711 shouldn't try to do anything clever. Likewise for not seeing the
22712 closing brace. */
22714 {
22715 /* Locate the closing brace. */
22716 cp_token_position prev
22721 /* We want to suggest insertion of a ';' immediately *after* the
22722 closing brace, so, if we can, offset the location by 1 column. */
22729 /* If we successfully offset the location, suggest the fix-it. */
22742 else
22745 /* Unget one token and smash it to look as though we encountered
22746 a semicolon in the input stream. */
22751 }
22752 }
22754 /* If this class is not itself within the scope of another class,
22755 then we need to parse the bodies of all of the queued function
22756 definitions. Note that the queued functions defined in a class
22757 are not always processed immediately following the
22758 class-specifier for that class. Consider:
22760 struct A {
22761 struct B { void f() { sizeof (A); } };
22762 };
22764 If `f' were processed before the processing of `A' were
22765 completed, there would be no way to compute the size of `A'.
22766 Note that the nesting we are interested in here is lexical --
22767 not the semantic nesting given by TYPE_CONTEXT. In particular,
22768 for:
22770 struct A { struct B; };
22771 struct A::B { void f() { } };
22773 there is no need to delay the parsing of `A::B::f'. */
22775 {
22776 tree decl;
22784 {
22785 /* Skip default arguments, NSDMIs, etc, in order to improve
22786 error recovery (c++/71169, c++/71832). */
22791 }
22793 /* In a first pass, parse default arguments to the functions.
22794 Then, in a second pass, parse the bodies of the functions.
22795 This two-phased approach handles cases like:
22797 struct S {
22798 void f() { g(); }
22799 void g(int i = 3);
22800 };
22802 */
22804 {
22806 /* If there are default arguments that have not yet been processed,
22807 take care of them now. */
22809 {
22814 }
22815 /* Make sure that any template parameters are in scope. */
22817 /* Parse the default argument expressions. */
22819 /* Remove any template parameters from the symbol table. */
22821 }
22823 /* Now parse any NSDMIs. */
22827 {
22829 {
22834 }
22837 }
22844 /* Now do some post-NSDMI bookkeeping. */
22850 /* Now parse the body of the functions. */
22852 {
22853 /* OpenMP UDRs need to be parsed before all other functions. */
22860 }
22861 else
22865 }
22866 else
22869 /* Put back any saved access checks. */
22872 /* Restore saved state. */
22876 parser->num_template_parameter_lists
22878 parser->in_unbraced_linkage_specification_p
22882 }
22884 static tree
22886 {
22887 tree ret;
22892 }
22894 /* Parse a class-head.
22896 class-head:
22897 class-key identifier [opt] base-clause [opt]
22898 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22899 class-key nested-name-specifier [opt] template-id
22900 base-clause [opt]
22902 class-virt-specifier:
22903 final
22905 GNU Extensions:
22906 class-key attributes identifier [opt] base-clause [opt]
22907 class-key attributes nested-name-specifier identifier base-clause [opt]
22908 class-key attributes nested-name-specifier [opt] template-id
22909 base-clause [opt]
22911 Upon return BASES is initialized to the list of base classes (or
22912 NULL, if there are none) in the same form returned by
22913 cp_parser_base_clause.
22915 Returns the TYPE of the indicated class. Sets
22916 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22917 involving a nested-name-specifier was used, and FALSE otherwise.
22919 Returns error_mark_node if this is not a class-head.
22921 Returns NULL_TREE if the class-head is syntactically valid, but
22922 semantically invalid in a way that means we should skip the entire
22923 body of the class. */
22925 static tree
22928 {
22929 tree nested_name_specifier;
22933 tree attributes;
22934 tree bases;
22944 /* Assume no nested-name-specifier will be present. */
22946 /* Assume no template parameter lists will be used in defining the
22947 type. */
22951 /* Look for the class-key. */
22958 /* Parse the attributes. */
22961 /* If the next token is `::', that is invalid -- but sometimes
22962 people do try to write:
22964 struct ::S {};
22966 Handle this gracefully by accepting the extra qualifier, and then
22967 issuing an error about it later if this really is a
22968 class-head. If it turns out just to be an elaborated type
22969 specifier, remain silent. */
22975 /* Determine the name of the class. Begin by looking for an
22976 optional nested-name-specifier. */
22978 nested_name_specifier
22984 /* If there was a nested-name-specifier, then there *must* be an
22985 identifier. */
22990 {
22992 /* Although the grammar says `identifier', it really means
22993 `class-name' or `template-name'. You are only allowed to
22994 define a class that has already been declared with this
22995 syntax.
22997 The proposed resolution for Core Issue 180 says that wherever
22998 you see `class T::X' you should treat `X' as a type-name.
23000 It is OK to define an inaccessible class; for example:
23002 class A { class B; };
23003 class A::B {};
23005 We do not know if we will see a class-name, or a
23006 template-name. We look for a class-name first, in case the
23007 class-name is a template-id; if we looked for the
23008 template-name first we would stop after the template-name. */
23015 class_type,
23019 /* If that didn't work, ignore the nested-name-specifier. */
23021 {
23027 }
23028 /* If we could not find a corresponding TYPE, treat this
23029 declaration like an unqualified declaration. */
23032 /* Otherwise, count the number of templates used in TYPE and its
23033 containing scopes. */
23034 else
23036 }
23037 /* Otherwise, the identifier is optional. */
23038 else
23039 {
23040 /* We don't know whether what comes next is a template-id,
23041 an identifier, or nothing at all. */
23043 /* Check for a template-id. */
23048 class_key,
23050 /* If that didn't work, it could still be an identifier. */
23052 {
23054 {
23057 }
23058 else
23060 }
23061 else
23062 {
23065 }
23066 }
23071 {
23073 class_key,
23075 }
23078 /* If it's not a `:' or a `{' then we can't really be looking at a
23079 class-head, since a class-head only appears as part of a
23080 class-specifier. We have to detect this situation before calling
23081 xref_tag, since that has irreversible side-effects. */
23083 {
23087 }
23089 /* At this point, we're going ahead with the class-specifier, even
23090 if some other problem occurs. */
23093 {
23098 }
23099 /* Issue the error about the overly-qualified name now. */
23101 {
23106 }
23108 {
23113 }
23115 {
23116 tree scope;
23119 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23120 keyword template shall not appear at the top level. */
23124 /* Reject typedef-names in class heads. */
23126 {
23129 type);
23132 }
23134 /* Figure out in what scope the declaration is being placed. */
23136 /* If that scope does not contain the scope in which the
23137 class was originally declared, the program is invalid. */
23139 {
23142 "declaration of %qD in namespace %qD which does not "
23145 else
23151 }
23152 /* [dcl.meaning]
23154 A declarator-id shall not be qualified except for the
23155 definition of a ... nested class outside of its class
23156 ... [or] the definition or explicit instantiation of a
23157 class member of a namespace outside of its namespace. */
23159 {
23164 }
23165 }
23166 /* An explicit-specialization must be preceded by "template <>". If
23167 it is not, try to recover gracefully. */
23170 && !processing_template_parmlist
23172 {
23173 /* Build a location of this form:
23174 struct typename <ARGS>
23175 ^~~~~~~~~~~~~~~~~~~~~~
23176 with caret==start at the start token, and
23177 finishing at the end of the type. */
23178 location_t reported_loc
23180 class_head_start_location,
23186 "an explicit specialization must be preceded by"
23189 /* Take the same action that would have been taken by
23190 cp_parser_explicit_specialization. */
23193 }
23194 /* There must be no "return" statements between this point and the
23195 end of this function; set "type "to the correct return value and
23196 use "goto done;" to return. */
23197 /* Make sure that the right number of template parameters were
23198 present. */
23200 template_id_p,
23203 {
23204 /* If something went wrong, there is no point in even trying to
23205 process the class-definition. */
23208 }
23210 /* Look up the type. */
23212 {
23216 {
23220 }
23221 else
23222 {
23226 /* Check the scope while we still know whether or not we had a
23227 nested-name-specifier. */
23230 }
23233 }
23235 {
23236 tree class_type;
23238 /* Given:
23240 template <typename T> struct S { struct T };
23241 template <typename T> struct S<T>::T { };
23243 we will get a TYPENAME_TYPE when processing the definition of
23244 `S::T'. We need to resolve it to the actual type before we
23245 try to define it. */
23247 {
23252 else
23253 {
23256 }
23257 }
23261 {
23264 }
23267 /* Enter the scope indicated by the nested-name-specifier. */
23269 /* Get the canonical version of this type. */
23271 /* Call push_template_decl if it seems like we should be defining a
23272 template either from the template headers or the type we're
23273 defining, so that we diagnose both extra and missing headers. */
23277 {
23280 {
23283 }
23284 }
23288 }
23290 {
23291 /* If the class was unnamed, create a dummy name. */
23295 ? ts_within_enclosing_non_class
23299 }
23301 /* Indicate whether this class was declared as a `class' or as a
23302 `struct'. */
23307 /* If this type was already complete, and we see another definition,
23308 that's an error. */
23310 {
23312 type);
23314 type);
23317 }
23322 {
23323 /* Apply attributes now, before any use of the class as a template
23324 argument in its base list. */
23327 }
23329 /* We will have entered the scope containing the class; the names of
23330 base classes should be looked up in that context. For example:
23332 struct A { struct B {}; struct C; };
23333 struct A::C : B {};
23335 is valid. */
23337 /* Get the list of base-classes, if there is one. */
23339 {
23340 /* PR59482: enter the class scope so that base-specifiers are looked
23341 up correctly. */
23345 /* PR59482: get out of the previously pushed class scope so that the
23346 subsequent pops pop the right thing. */
23349 }
23350 else
23353 /* If we're really defining a class, process the base classes.
23354 If they're invalid, fail. */
23358 done:
23359 /* Leave the scope given by the nested-name-specifier. We will
23360 enter the class scope itself while processing the members. */
23365 {
23368 }
23374 out:
23377 }
23379 /* Parse a class-key.
23381 class-key:
23382 class
23383 struct
23384 union
23386 Returns the kind of class-key specified, or none_type to indicate
23387 error. */
23389 static enum tag_types
23391 {
23395 /* Look for the class-key. */
23400 /* Check to see if the TOKEN is a class-key. */
23405 }
23407 /* Parse a type-parameter-key.
23409 type-parameter-key:
23410 class
23411 typename
23412 */
23414 static void
23416 {
23417 /* Look for the type-parameter-key. */
23421 {
23424 /* typename is not allowed in a template template parameter
23425 by the standard until C++17. */
23427 "ISO C++ forbids typename key in template template parameter;"
23429 }
23430 else
23434 }
23436 /* Parse an (optional) member-specification.
23438 member-specification:
23439 member-declaration member-specification [opt]
23440 access-specifier : member-specification [opt] */
23442 static void
23444 {
23446 {
23450 /* Peek at the next token. */
23452 /* If it's a `}', or EOF then we've seen all the members. */
23458 /* See if this token is a keyword. */
23461 {
23465 /* Consume the access-specifier. */
23467 /* Remember which access-specifier is active. */
23469 /* Look for the `:'. */
23474 /* Accept #pragmas at class scope. */
23476 {
23479 }
23481 /* Otherwise, the next construction must be a
23482 member-declaration. */
23484 }
23485 }
23486 }
23488 /* Parse a member-declaration.
23490 member-declaration:
23491 decl-specifier-seq [opt] member-declarator-list [opt] ;
23492 function-definition ; [opt]
23493 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23494 using-declaration
23495 template-declaration
23496 alias-declaration
23498 member-declarator-list:
23499 member-declarator
23500 member-declarator-list , member-declarator
23502 member-declarator:
23503 declarator pure-specifier [opt]
23504 declarator constant-initializer [opt]
23505 identifier [opt] : constant-expression
23507 GNU Extensions:
23509 member-declaration:
23510 __extension__ member-declaration
23512 member-declarator:
23513 declarator attributes [opt] pure-specifier [opt]
23514 declarator attributes [opt] constant-initializer [opt]
23515 identifier [opt] attributes [opt] : constant-expression
23517 C++0x Extensions:
23519 member-declaration:
23520 static_assert-declaration */
23522 static void
23524 {
23525 cp_decl_specifier_seq decl_specifiers;
23526 tree prefix_attributes;
23527 tree decl;
23536 /* Check for the `__extension__' keyword. */
23538 {
23539 /* Recurse. */
23541 /* Restore the old value of the PEDANTIC flag. */
23545 }
23547 /* Check for a template-declaration. */
23549 {
23550 /* An explicit specialization here is an error condition, and we
23551 expect the specialization handler to detect and report this. */
23555 else
23559 }
23560 /* Check for a template introduction. */
23564 /* Check for a using-declaration. */
23566 {
23568 {
23569 /* Parse the using-declaration. */
23573 }
23574 else
23575 {
23576 tree decl;
23580 /* Note that if we actually see the '=' token after the
23581 identifier, cp_parser_alias_declaration commits the
23582 tentative parse. In that case, we really expect an
23583 alias-declaration. Otherwise, we expect a using
23584 declaration. */
23585 alias_decl_expected =
23591 else
23595 }
23596 }
23598 /* Check for @defs. */
23600 {
23605 {
23610 }
23612 }
23614 /* If the next token is `static_assert' we have a static assertion. */
23616 {
23619 }
23626 /* Parse the decl-specifier-seq. */
23629 CP_PARSER_FLAGS_OPTIONAL,
23632 /* Check for an invalid type-name. */
23636 /* If there is no declarator, then the decl-specifier-seq should
23637 specify a type. */
23639 {
23640 /* If there was no decl-specifier-seq, and the next token is a
23641 `;', then we have something like:
23643 struct S { ; };
23645 [class.mem]
23647 Each member-declaration shall declare at least one member
23648 name of the class. */
23650 {
23653 {
23657 }
23658 }
23659 else
23660 {
23661 tree type;
23663 /* See if this declaration is a friend. */
23665 /* If there were decl-specifiers, check to see if there was
23666 a class-declaration. */
23669 /* Nested classes have already been added to the class, but
23670 a `friend' needs to be explicitly registered. */
23672 {
23673 /* If the `friend' keyword was present, the friend must
23674 be introduced with a class-key. */
23677 "in C++03 a class-key must be used "
23679 /* In this case:
23681 template <typename T> struct A {
23682 friend struct A<T>::B;
23683 };
23685 A<T>::B will be represented by a TYPENAME_TYPE, and
23686 therefore not recognized by check_tag_decl. */
23688 {
23692 }
23695 "friend declaration does not name a class or "
23697 else
23700 }
23701 /* If there is no TYPE, an error message will already have
23702 been issued. */
23704 ;
23705 /* An anonymous aggregate has to be handled specially; such
23706 a declaration really declares a data member (with a
23707 particular type), as opposed to a nested class. */
23709 {
23710 /* C++11 9.5/6. */
23713 "a storage class on an anonymous aggregate "
23716 /* Remove constructors and such from TYPE, now that we
23717 know it is an anonymous aggregate. */
23719 /* And make the corresponding data member. */
23722 /* Add it to the class. */
23724 }
23725 else
23726 cp_parser_check_access_in_redeclaration
23729 }
23730 }
23731 else
23732 {
23735 /* Clear attributes from the decl_specifiers but keep them
23736 around as prefix attributes that apply them to the entity
23737 being declared. */
23741 /* See if these declarations will be friends. */
23744 /* Keep going until we hit the `;' at the end of the
23745 declaration. */
23747 {
23749 tree first_attribute;
23750 tree initializer;
23753 /* Peek at the next token. */
23756 /* The following code wants to know early if it is a bit-field
23757 or some other declaration. Attributes can appear before
23758 the `:' token. Skip over them without consuming any tokens
23759 to peek if they are followed by `:'. */
23764 {
23765 size_t n
23768 }
23770 /* Check for a bitfield declaration. */
23776 {
23777 tree identifier;
23778 tree width;
23783 else
23786 /* Look for attributes that apply to the bitfield. */
23789 /* Consume the `:' token. */
23792 /* Get the width of the bitfield. */
23796 /* In C++2A and as extension for C++11 and above we allow
23797 default member initializers for bit-fields. */
23802 CPP_OPEN_BRACE)))
23803 {
23804 location_t loc
23810 "default member initializers for bit-fields "
23811 "only available with -std=c++2a or "
23816 {
23820 }
23821 }
23822 else
23823 {
23824 /* Look for attributes that apply to the bitfield after
23825 the `:' token and width. This is where GCC used to
23826 parse attributes in the past, pedwarn if there is
23827 a std attribute. */
23830 "ISO C++ allows bit-field attributes only "
23834 }
23838 /* Remember which attributes are prefix attributes and
23839 which are not. */
23841 /* Combine the attributes. */
23844 /* Create the bitfield declaration. */
23847 identifier,
23848 sfk_none)
23852 attributes);
23853 }
23854 else
23855 {
23857 tree asm_specification;
23860 /* Parse the declarator. */
23861 declarator
23866 friend_p);
23868 /* If something went wrong parsing the declarator, make sure
23869 that we at least consume some tokens. */
23871 {
23872 /* Skip to the end of the statement. */
23874 /* If the next token is not a semicolon, that is
23875 probably because we just skipped over the body of
23876 a function. So, we consume a semicolon if
23877 present, but do not issue an error message if it
23878 is not present. */
23880 CPP_SEMICOLON))
23883 }
23886 cp_parser_check_for_definition_in_return_type
23890 /* Look for an asm-specification. */
23892 /* Look for attributes that apply to the declaration. */
23894 /* Remember which attributes are prefix attributes and
23895 which are not. */
23897 /* Combine the attributes. */
23900 /* If it's an `=', then we have a constant-initializer or a
23901 pure-specifier. It is not correct to parse the
23902 initializer before registering the member declaration
23903 since the member declaration should be in scope while
23904 its initializer is processed. However, the rest of the
23905 front end does not yet provide an interface that allows
23906 us to handle this correctly. */
23908 {
23909 /* In [class.mem]:
23911 A pure-specifier shall be used only in the declaration of
23912 a virtual function.
23914 A member-declarator can contain a constant-initializer
23915 only if it declares a static member of integral or
23916 enumeration type.
23918 Therefore, if the DECLARATOR is for a function, we look
23919 for a pure-specifier; otherwise, we look for a
23920 constant-initializer. When we call `grokfield', it will
23921 perform more stringent semantics checks. */
23933 {
23935 /* Don't require a constant rvalue in C++11, since we
23936 might want a reference constant. We'll enforce
23937 constancy later. */
23939 /* Parse the initializer. */
23942 }
23943 else
23944 /* Parse the initializer. */
23946 }
23949 {
23953 else
23955 }
23956 /* Otherwise, there is no initializer. */
23957 else
23960 /* See if we are probably looking at a function
23961 definition. We are certainly not looking at a
23962 member-declarator. Calling `grokfield' has
23963 side-effects, so we must not do it unless we are sure
23964 that we are looking at a member-declarator. */
23967 {
23968 /* The grammar does not allow a pure-specifier to be
23969 used when a member function is defined. (It is
23970 possible that this fact is an oversight in the
23971 standard, since a pure function may be defined
23972 outside of the class-specifier. */
23978 declarator,
23979 attributes);
23982 /* If the member was not a friend, declare it here. */
23985 /* Peek at the next token. */
23987 /* If the next token is a semicolon, consume it. */
23989 {
23990 location_t semicolon_loc
23995 "extra %<;%> after in-class "
23997 }
23999 }
24000 else
24003 /* Create the declaration. */
24008 {
24011 else
24013 }
24014 }
24019 /* Reset PREFIX_ATTRIBUTES. */
24021 {
24026 }
24028 /* If there is any qualification still in effect, clear it
24029 now; we will be starting fresh with the next declarator. */
24033 /* If it's a `,', then there are more declarators. */
24035 {
24038 {
24044 }
24045 }
24046 /* If the next token isn't a `;', then we have a parse error. */
24048 CPP_SEMICOLON))
24049 {
24050 /* The next token might be a ways away from where the
24051 actual semicolon is missing. Find the previous token
24052 and use that for our error position. */
24059 /* Assume that the user meant to provide a semicolon. If
24060 we were to cp_parser_skip_to_end_of_statement, we might
24061 skip to a semicolon inside a member function definition
24062 and issue nonsensical error messages. */
24064 }
24067 {
24068 /* Add DECL to the list of members. */
24070 /* Explicitly include, eg, NSDMIs, for better error
24071 recovery (c++/58650). */
24079 /* Add DECL to the queue of NSDMI to be parsed later. */
24081 }
24085 }
24086 }
24089 out:
24091 }
24093 /* Parse a pure-specifier.
24095 pure-specifier:
24096 = 0
24098 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24099 Otherwise, ERROR_MARK_NODE is returned. */
24101 static tree
24103 {
24106 /* Look for the `=' token. */
24109 /* Look for the `0' token. */
24118 /* Accept = default or = delete in c++0x mode. */
24121 {
24124 }
24126 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24128 {
24133 }
24135 {
24138 }
24141 }
24143 /* Parse a constant-initializer.
24145 constant-initializer:
24146 = constant-expression
24148 Returns a representation of the constant-expression. */
24150 static tree
24152 {
24153 /* Look for the `=' token. */
24157 /* It is invalid to write:
24159 struct S { static const int i = { 7 }; };
24161 */
24163 {
24166 /* Consume the opening brace. */
24167 matching_braces braces;
24169 /* Skip the initializer. */
24171 /* Look for the trailing `}'. */
24175 }
24178 }
24180 /* Derived classes [gram.class.derived] */
24182 /* Parse a base-clause.
24184 base-clause:
24185 : base-specifier-list
24187 base-specifier-list:
24188 base-specifier ... [opt]
24189 base-specifier-list , base-specifier ... [opt]
24191 Returns a TREE_LIST representing the base-classes, in the order in
24192 which they were declared. The representation of each node is as
24193 described by cp_parser_base_specifier.
24195 In the case that no bases are specified, this function will return
24196 NULL_TREE, not ERROR_MARK_NODE. */
24198 static tree
24200 {
24203 /* Look for the `:' that begins the list. */
24206 /* Scan the base-specifier-list. */
24208 {
24210 tree base;
24213 /* Look for the base-specifier. */
24215 /* Look for the (optional) ellipsis. */
24217 {
24218 /* Consume the `...'. */
24222 }
24224 /* Add BASE to the front of the list. */
24226 {
24228 /* Make this a pack expansion type. */
24232 {
24235 }
24236 }
24237 /* Peek at the next token. */
24239 /* If it's not a comma, then the list is complete. */
24242 /* Consume the `,'. */
24244 }
24246 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24247 base class had a qualified name. However, the next name that
24248 appears is certainly not qualified. */
24254 }
24256 /* Parse a base-specifier.
24258 base-specifier:
24259 :: [opt] nested-name-specifier [opt] class-name
24260 virtual access-specifier [opt] :: [opt] nested-name-specifier
24261 [opt] class-name
24262 access-specifier virtual [opt] :: [opt] nested-name-specifier
24263 [opt] class-name
24265 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24266 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24267 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24268 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24270 static tree
24272 {
24280 tree type;
24282 /* Process the optional `virtual' and `access-specifier'. */
24284 {
24285 /* Peek at the next token. */
24287 /* Process `virtual'. */
24289 {
24291 /* If `virtual' appears more than once, issue an error. */
24293 {
24297 }
24301 /* Consume the `virtual' token. */
24309 /* If more than one access specifier appears, issue an
24310 error. */
24313 {
24317 }
24321 /* Consume the access-specifier. */
24329 }
24330 }
24331 /* It is not uncommon to see programs mechanically, erroneously, use
24332 the 'typename' keyword to denote (dependent) qualified types
24333 as base classes. */
24335 {
24340 else
24342 "keyword %<typename%> not allowed in this context "
24345 }
24347 /* Look for the optional `::' operator. */
24349 /* Look for the nested-name-specifier. The simplest way to
24350 implement:
24352 [temp.res]
24354 The keyword `typename' is not permitted in a base-specifier or
24355 mem-initializer; in these contexts a qualified name that
24356 depends on a template-parameter is implicitly assumed to be a
24357 type name.
24359 is to pretend that we have seen the `typename' keyword at this
24360 point. */
24366 /* If the base class is given by a qualified name, assume that names
24367 we see are type names or templates, as appropriate. */
24373 /* DR 950 allows decltype as a base-specifier. */
24375 else
24376 {
24377 /* Otherwise, look for the class-name. */
24379 class_scope_p,
24380 template_p,
24381 typename_type,
24386 }
24392 }
24394 /* Exception handling [gram.exception] */
24396 /* Parse an (optional) noexcept-specification.
24398 noexcept-specification:
24399 noexcept ( constant-expression ) [opt]
24401 If no noexcept-specification is present, returns NULL_TREE.
24402 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24403 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24404 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24405 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24406 in which case a boolean condition is returned instead. */
24408 static tree
24413 {
24417 /* Peek at the next token. */
24420 /* Is it a noexcept-specification? */
24422 {
24423 tree expr;
24427 {
24428 matching_parens parens;
24432 {
24433 /* Types may not be defined in an exception-specification. */
24435 parser->type_definition_forbidden_message
24440 /* Restore the saved message. */
24442 }
24443 else
24444 {
24447 }
24450 }
24451 else
24452 {
24456 }
24458 /* We cannot build a noexcept-spec right away because this will check
24459 that expr is a constexpr. */
24462 else
24464 }
24465 else
24467 }
24469 /* Parse an (optional) exception-specification.
24471 exception-specification:
24472 throw ( type-id-list [opt] )
24474 Returns a TREE_LIST representing the exception-specification. The
24475 TREE_VALUE of each node is a type. */
24477 static tree
24479 {
24481 tree type_id_list;
24484 /* Peek at the next token. */
24487 /* Is it a noexcept-specification? */
24493 /* If it's not `throw', then there's no exception-specification. */
24499 /* Consume the `throw'. */
24502 /* Look for the `('. */
24503 matching_parens parens;
24506 /* Peek at the next token. */
24508 /* If it's not a `)', then there is a type-id-list. */
24510 {
24511 /* Types may not be defined in an exception-specification. */
24513 parser->type_definition_forbidden_message
24515 /* Parse the type-id-list. */
24517 /* Restore the saved message. */
24521 {
24525 }
24528 "dynamic exception specifications are deprecated in "
24530 }
24531 /* In C++17, throw() is equivalent to noexcept (true). throw()
24532 is deprecated in C++11 and above as well, but is still widely used,
24533 so don't warn about it yet. */
24536 else
24539 /* Look for the `)'. */
24543 }
24545 /* Parse an (optional) type-id-list.
24547 type-id-list:
24548 type-id ... [opt]
24549 type-id-list , type-id ... [opt]
24551 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24552 in the order that the types were presented. */
24554 static tree
24556 {
24560 {
24562 tree type;
24566 /* Get the next type-id. */
24568 /* Check for invalid 'auto'. */
24570 {
24574 }
24575 /* Parse the optional ellipsis. */
24577 {
24578 /* Consume the `...'. */
24581 /* Turn the type into a pack expansion expression. */
24583 }
24584 /* Add it to the list. */
24586 /* Peek at the next token. */
24588 /* If it is not a `,', we are done. */
24591 /* Consume the `,'. */
24593 }
24596 }
24598 /* Parse a try-block.
24600 try-block:
24601 try compound-statement handler-seq */
24603 static tree
24605 {
24606 tree try_block;
24620 }
24622 /* Parse a function-try-block.
24624 function-try-block:
24625 try ctor-initializer [opt] function-body handler-seq */
24627 static void
24629 {
24630 tree compound_stmt;
24631 tree try_block;
24633 /* Look for the `try' keyword. */
24636 /* Let the rest of the front end know where we are. */
24638 /* Parse the function-body. */
24639 cp_parser_ctor_initializer_opt_and_function_body
24641 /* We're done with the `try' part. */
24643 /* Parse the handlers. */
24645 /* We're done with the handlers. */
24647 }
24649 /* Parse a handler-seq.
24651 handler-seq:
24652 handler handler-seq [opt] */
24654 static void
24656 {
24658 {
24661 /* Parse the handler. */
24663 /* Peek at the next token. */
24665 /* If it's not `catch' then there are no more handlers. */
24668 }
24669 }
24671 /* Parse a handler.
24673 handler:
24674 catch ( exception-declaration ) compound-statement */
24676 static void
24678 {
24679 tree handler;
24680 tree declaration;
24684 matching_parens parens;
24691 }
24693 /* Parse an exception-declaration.
24695 exception-declaration:
24696 type-specifier-seq declarator
24697 type-specifier-seq abstract-declarator
24698 type-specifier-seq
24699 ...
24701 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24702 ellipsis variant is used. */
24704 static tree
24706 {
24707 cp_decl_specifier_seq type_specifiers;
24711 /* If it's an ellipsis, it's easy to handle. */
24713 {
24714 /* Consume the `...' token. */
24717 }
24719 /* Types may not be defined in exception-declarations. */
24721 parser->type_definition_forbidden_message
24724 /* Parse the type-specifier-seq. */
24728 /* If it's a `)', then there is no declarator. */
24731 else
24738 /* Restore the saved message. */
24745 }
24747 /* Parse a throw-expression.
24749 throw-expression:
24750 throw assignment-expression [opt]
24752 Returns a THROW_EXPR representing the throw-expression. */
24754 static tree
24756 {
24757 tree expression;
24762 /* Figure out whether or not there is an assignment-expression
24763 following the "throw" keyword. */
24771 else
24775 }
24777 /* GNU Extensions */
24779 /* Parse an (optional) asm-specification.
24781 asm-specification:
24782 asm ( string-literal )
24784 If the asm-specification is present, returns a STRING_CST
24785 corresponding to the string-literal. Otherwise, returns
24786 NULL_TREE. */
24788 static tree
24790 {
24792 tree asm_specification;
24794 /* Peek at the next token. */
24796 /* If the next token isn't the `asm' keyword, then there's no
24797 asm-specification. */
24801 /* Consume the `asm' token. */
24803 /* Look for the `('. */
24804 matching_parens parens;
24807 /* Look for the string-literal. */
24810 /* Look for the `)'. */
24814 }
24816 /* Parse an asm-operand-list.
24818 asm-operand-list:
24819 asm-operand
24820 asm-operand-list , asm-operand
24822 asm-operand:
24823 string-literal ( expression )
24824 [ string-literal ] string-literal ( expression )
24826 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24827 each node is the expression. The TREE_PURPOSE is itself a
24828 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24829 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24830 is a STRING_CST for the string literal before the parenthesis. Returns
24831 ERROR_MARK_NODE if any of the operands are invalid. */
24833 static tree
24835 {
24840 {
24841 tree string_literal;
24842 tree expression;
24843 tree name;
24846 {
24847 /* Consume the `[' token. */
24849 /* Read the operand name. */
24854 /* Look for the closing `]'. */
24856 }
24857 else
24859 /* Look for the string-literal. */
24862 /* Look for the `('. */
24863 matching_parens parens;
24865 /* Parse the expression. */
24867 /* Look for the `)'. */
24875 /* Add this operand to the list. */
24877 expression,
24878 asm_operands);
24879 /* If the next token is not a `,', there are no more
24880 operands. */
24883 /* Consume the `,'. */
24885 }
24888 }
24890 /* Parse an asm-clobber-list.
24892 asm-clobber-list:
24893 string-literal
24894 asm-clobber-list , string-literal
24896 Returns a TREE_LIST, indicating the clobbers in the order that they
24897 appeared. The TREE_VALUE of each node is a STRING_CST. */
24899 static tree
24901 {
24905 {
24906 tree string_literal;
24908 /* Look for the string literal. */
24910 /* Add it to the list. */
24912 /* If the next token is not a `,', then the list is
24913 complete. */
24916 /* Consume the `,' token. */
24918 }
24921 }
24923 /* Parse an asm-label-list.
24925 asm-label-list:
24926 identifier
24927 asm-label-list , identifier
24929 Returns a TREE_LIST, indicating the labels in the order that they
24930 appeared. The TREE_VALUE of each node is a label. */
24932 static tree
24934 {
24938 {
24941 /* Look for the identifier. */
24944 {
24947 {
24953 }
24954 }
24955 /* If the next token is not a `,', then the list is
24956 complete. */
24959 /* Consume the `,' token. */
24961 }
24964 }
24966 /* Return TRUE iff the next tokens in the stream are possibly the
24967 beginning of a GNU extension attribute. */
24969 static bool
24971 {
24973 }
24975 /* Return TRUE iff the next tokens in the stream are possibly the
24976 beginning of a standard C++-11 attribute specifier. */
24978 static bool
24980 {
24982 }
24984 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24985 beginning of a standard C++-11 attribute specifier. */
24987 static bool
24989 {
24997 }
24999 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25000 beginning of a GNU extension attribute. */
25002 static bool
25004 {
25008 }
25010 /* Return true iff the next tokens can be the beginning of either a
25011 GNU attribute list, or a standard C++11 attribute sequence. */
25013 static bool
25015 {
25018 }
25020 /* Return true iff the next Nth tokens can be the beginning of either
25021 a GNU attribute list, or a standard C++11 attribute sequence. */
25023 static bool
25025 {
25028 }
25030 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
25031 of GNU attributes, or return NULL. */
25033 static tree
25035 {
25039 }
25041 /* Parse an (optional) series of attributes.
25043 attributes:
25044 attributes attribute
25046 attribute:
25047 __attribute__ (( attribute-list [opt] ))
25049 The return value is as for cp_parser_gnu_attribute_list. */
25051 static tree
25053 {
25060 {
25062 tree attribute_list;
25065 /* Peek at the next token. */
25067 /* If it's not `__attribute__', then we're done. */
25071 /* Consume the `__attribute__' keyword. */
25073 /* Look for the two `(' tokens. */
25074 matching_parens outer_parens;
25076 matching_parens inner_parens;
25079 /* Peek at the next token. */
25082 /* Parse the attribute-list. */
25084 else
25085 /* If the next token is a `)', then there is no attribute
25086 list. */
25089 /* Look for the two `)' tokens. */
25097 /* Add these new attributes to the list. */
25099 }
25102 }
25104 /* Parse a GNU attribute-list.
25106 attribute-list:
25107 attribute
25108 attribute-list , attribute
25110 attribute:
25111 identifier
25112 identifier ( identifier )
25113 identifier ( identifier , expression-list )
25114 identifier ( expression-list )
25116 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25117 to an attribute. The TREE_PURPOSE of each node is the identifier
25118 indicating which attribute is in use. The TREE_VALUE represents
25119 the arguments, if any. */
25121 static tree
25123 {
25129 {
25131 tree identifier;
25132 tree attribute;
25134 /* Look for the identifier. We also allow keywords here; for
25135 example `__attribute__ ((const))' is legal. */
25139 {
25142 /* Consume the token, but save it since we need it for the
25143 SIMD enabled function parsing. */
25146 /* Save away the identifier that indicates which attribute
25147 this is. */
25149 /* For keywords, use the canonical spelling, not the
25150 parsed identifier. */
25157 /* Peek at the next token. */
25159 /* If it's an `(', then parse the attribute arguments. */
25161 {
25165 vec = cp_parser_parenthesized_expression_list
25171 else
25172 {
25175 }
25176 /* Save the arguments away. */
25178 }
25181 {
25182 /* Add this attribute to the list. */
25185 }
25188 }
25189 /* Now, look for more attributes. If the next token isn't a
25190 `,', we're done. */
25194 /* Consume the comma and keep going. */
25196 }
25199 /* We built up the list in reverse order. */
25201 }
25203 /* Parse a standard C++11 attribute.
25205 The returned representation is a TREE_LIST which TREE_PURPOSE is
25206 the scoped name of the attribute, and the TREE_VALUE is its
25207 arguments list.
25209 Note that the scoped name of the attribute is itself a TREE_LIST
25210 which TREE_PURPOSE is the namespace of the attribute, and
25211 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25212 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25213 and which TREE_PURPOSE is directly the attribute name.
25215 Clients of the attribute code should use get_attribute_namespace
25216 and get_attribute_name to get the actual namespace and name of
25217 attributes, regardless of their being GNU or C++11 attributes.
25219 attribute:
25220 attribute-token attribute-argument-clause [opt]
25222 attribute-token:
25223 identifier
25224 attribute-scoped-token
25226 attribute-scoped-token:
25227 attribute-namespace :: identifier
25229 attribute-namespace:
25230 identifier
25232 attribute-argument-clause:
25233 ( balanced-token-seq )
25235 balanced-token-seq:
25236 balanced-token [opt]
25237 balanced-token-seq balanced-token
25239 balanced-token:
25240 ( balanced-token-seq )
25241 [ balanced-token-seq ]
25242 { balanced-token-seq }. */
25244 static tree
25246 {
25253 /* First, parse name of the attribute, a.k.a attribute-token. */
25270 {
25271 /* We are seeing a scoped attribute token. */
25286 else
25287 {
25291 }
25295 NULL_TREE);
25297 }
25300 NULL_TREE);
25301 else
25302 {
25305 NULL_TREE);
25306 /* C++11 noreturn attribute is equivalent to GNU's. */
25309 /* C++14 deprecated attribute is equivalent to GNU's. */
25312 /* C++17 fallthrough attribute is equivalent to GNU's. */
25315 /* Transactional Memory TS optimize_for_synchronized attribute is
25316 equivalent to GNU transaction_callable. */
25320 /* Transactional Memory attributes are GNU attributes. */
25323 }
25325 /* Now parse the optional argument clause of the attribute. */
25330 {
25336 /* A GNU attribute that takes an identifier in parameter. */
25339 vec = cp_parser_parenthesized_expression_list
25345 else
25346 {
25349 }
25353 else
25355 }
25358 }
25360 /* Check that the attribute ATTRIBUTE appears at most once in the
25361 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25362 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25363 isn't implemented yet in GCC. */
25365 static void
25367 {
25369 {
25379 }
25380 }
25382 /* Parse a list of standard C++-11 attributes.
25384 attribute-list:
25385 attribute [opt]
25386 attribute-list , attribute[opt]
25387 attribute ...
25388 attribute-list , attribute ...
25389 */
25391 static tree
25393 {
25398 {
25403 {
25407 }
25410 {
25415 else
25416 {
25421 }
25423 }
25427 }
25430 }
25432 /* Parse a standard C++-11 attribute specifier.
25434 attribute-specifier:
25435 [ [ attribute-using-prefix [opt] attribute-list ] ]
25436 alignment-specifier
25438 attribute-using-prefix:
25439 using attribute-namespace :
25441 alignment-specifier:
25442 alignas ( type-id ... [opt] )
25443 alignas ( alignment-expression ... [opt] ). */
25445 static tree
25447 {
25453 {
25460 {
25471 {
25475 "attribute using prefix only available "
25481 }
25482 else
25484 }
25491 else
25492 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25493 when we are sure that we have actually parsed them. */
25495 }
25496 else
25497 {
25498 tree alignas_expr;
25500 /* Look for an alignment-specifier. */
25511 matching_parens parens;
25519 {
25526 }
25531 /* Handle alignas (pack...). */
25533 {
25536 }
25538 /* Something went wrong, so don't build the attribute. */
25545 /* Build the C++-11 representation of an 'aligned'
25546 attribute. */
25547 attributes =
25550 alignas_expr);
25551 }
25554 }
25556 /* Parse a standard C++-11 attribute-specifier-seq.
25558 attribute-specifier-seq:
25559 attribute-specifier-seq [opt] attribute-specifier
25560 */
25562 static tree
25564 {
25569 {
25578 else
25581 }
25584 }
25586 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25587 return index of the first token after balanced-token, or N on failure. */
25589 static size_t
25591 {
25594 do
25596 {
25599 /* Ran out of tokens. */
25621 }
25624 }
25626 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25627 return index of the first token after the GNU attribute tokens, or N on
25628 failure. */
25630 static size_t
25632 {
25634 {
25646 }
25648 }
25650 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25651 next token), return index of the first token after the standard C++11
25652 attribute tokens, or N on failure. */
25654 static size_t
25656 {
25658 {
25661 {
25668 }
25671 {
25676 }
25677 else
25679 }
25681 }
25683 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25684 as the next token), return index of the first token after the attribute
25685 tokens, or N on failure. */
25687 static size_t
25689 {
25693 }
25695 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25696 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25697 current value of the PEDANTIC flag, regardless of whether or not
25698 the `__extension__' keyword is present. The caller is responsible
25699 for restoring the value of the PEDANTIC flag. */
25701 static bool
25703 {
25704 /* Save the old value of the PEDANTIC flag. */
25708 {
25709 /* Consume the `__extension__' token. */
25711 /* We're not being pedantic while the `__extension__' keyword is
25712 in effect. */
25716 }
25719 }
25721 /* Parse a label declaration.
25723 label-declaration:
25724 __label__ label-declarator-seq ;
25726 label-declarator-seq:
25727 identifier , label-declarator-seq
25728 identifier */
25730 static void
25732 {
25733 /* Look for the `__label__' keyword. */
25737 {
25738 tree identifier;
25740 /* Look for an identifier. */
25742 /* If we failed, stop. */
25745 /* Declare it as a label. */
25747 /* If the next token is a `;', stop. */
25750 /* Look for the `,' separating the label declarations. */
25752 }
25754 /* Look for the final `;'. */
25756 }
25758 // -------------------------------------------------------------------------- //
25759 // Requires Clause
25761 // Parse a requires clause.
25762 //
25763 // requires-clause:
25764 // 'requires' logical-or-expression
25765 //
25766 // The required logical-or-expression must be a constant expression. Note
25767 // that we don't check that the expression is constepxr here. We defer until
25768 // we analyze constraints and then, we only check atomic constraints.
25769 static tree
25771 {
25772 // Parse the requires clause so that it is not automatically folded.
25780 }
25782 // Optionally parse a requires clause:
25783 static tree
25785 {
25788 {
25791 {
25794 /* Parse and discard the requires-clause. */
25797 }
25799 }
25802 }
25805 /*---------------------------------------------------------------------------
25806 Requires expressions
25807 ---------------------------------------------------------------------------*/
25809 /* Parse a requires expression
25811 requirement-expression:
25812 'requires' requirement-parameter-list [opt] requirement-body */
25813 static tree
25815 {
25819 /* A requires-expression shall appear only within a concept
25820 definition or a requires-clause.
25822 TODO: Implement this diagnostic correctly. */
25824 {
25828 }
25831 {
25832 /* Local parameters are delared as variables within the scope
25833 of the expression. They are not visible past the end of
25834 the expression. Expressions within the requires-expression
25835 are unevaluated. */
25836 struct scope_sentinel
25837 {
25839 {
25842 }
25845 {
25848 }
25851 /* Parse the optional parameter list. */
25853 {
25857 }
25858 else
25861 /* Parse the requirement body. */
25865 }
25867 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25868 the parm chain. */
25871 }
25873 /* Parse a parameterized requirement.
25875 requirement-parameter-list:
25876 '(' parameter-declaration-clause ')' */
25877 static tree
25879 {
25880 matching_parens parens;
25890 }
25892 /* Parse the body of a requirement.
25894 requirement-body:
25895 '{' requirement-list '}' */
25896 static tree
25898 {
25899 matching_braces braces;
25909 }
25911 /* Parse a list of requirements.
25913 requirement-list:
25914 requirement
25915 requirement-list ';' requirement[opt] */
25916 static tree
25918 {
25921 {
25928 /* If we see a semi-colon, consume it. */
25932 /* Stop processing at the end of the list. */
25935 }
25937 /* Reverse the order of requirements so they are analyzed in
25938 declaration order. */
25940 }
25942 /* Parse a syntactic requirement or type requirement.
25944 requirement:
25945 simple-requirement
25946 compound-requirement
25947 type-requirement
25948 nested-requirement */
25949 static tree
25951 {
25958 else
25960 }
25962 /* Parse a simple requirement.
25964 simple-requirement:
25965 expression ';' */
25966 static tree
25968 {
25977 }
25979 /* Parse a type requirement
25981 type-requirement
25982 nested-name-specifier [opt] required-type-name ';'
25984 required-type-name:
25985 type-name
25986 'template' [opt] simple-template-id */
25987 static tree
25989 {
25992 // Save the scope before parsing name specifiers.
26003 tree type;
26005 {
26014 }
26015 else
26034 }
26036 /* Parse a compound requirement
26038 compound-requirement:
26039 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
26040 static tree
26042 {
26043 /* Parse an expression enclosed in '{ }'s. */
26044 matching_braces braces;
26055 /* Parse the optional noexcept. */
26058 {
26061 }
26063 /* Parse the optional trailing return type. */
26066 {
26074 }
26077 }
26079 /* Parse a nested requirement. This is the same as a requires clause.
26081 nested-requirement:
26082 requires-clause */
26083 static tree
26085 {
26091 }
26093 /* Support Functions */
26095 /* Return the appropriate prefer_type argument for lookup_name_real based on
26096 tag_type and template_mem_access. */
26100 {
26101 /* DR 141: When looking in the current enclosing context for a template-name
26102 after -> or ., only consider class templates. */
26106 {
26110 }
26111 }
26113 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26114 NAME should have one of the representations used for an
26115 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26116 is returned. If PARSER->SCOPE is a dependent type, then a
26117 SCOPE_REF is returned.
26119 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26120 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26121 was formed. Abstractly, such entities should not be passed to this
26122 function, because they do not need to be looked up, but it is
26123 simpler to check for this special case here, rather than at the
26124 call-sites.
26126 In cases not explicitly covered above, this function returns a
26127 DECL, OVERLOAD, or baselink representing the result of the lookup.
26128 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26129 is returned.
26131 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26132 (e.g., "struct") that was used. In that case bindings that do not
26133 refer to types are ignored.
26135 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26136 ignored.
26138 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26139 are ignored.
26141 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26142 types.
26144 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26145 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26146 NULL_TREE otherwise. */
26148 static cp_expr
26155 location_t name_location)
26156 {
26157 tree decl;
26160 /* Assume that the lookup will be unambiguous. */
26164 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26165 no longer valid. Note that if we are parsing tentatively, and
26166 the parse fails, OBJECT_TYPE will be automatically restored. */
26172 /* A template-id has already been resolved; there is no lookup to
26173 do. */
26177 {
26181 }
26183 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26184 it should already have been checked to make sure that the name
26185 used matches the type being destroyed. */
26187 {
26188 tree type;
26190 /* Figure out to which type this destructor applies. */
26195 else
26197 /* If that's not a class type, there is no destructor. */
26208 }
26210 /* By this point, the NAME should be an ordinary identifier. If
26211 the id-expression was a qualified name, the qualifying scope is
26212 stored in PARSER->SCOPE at this point. */
26215 /* Perform the lookup. */
26217 {
26223 /* If the SCOPE is dependent, the lookup must be deferred until
26224 the template is instantiated -- unless we are explicitly
26225 looking up names in uninstantiated templates. Even then, we
26226 cannot look up the name if the scope is not a class type; it
26227 might, for example, be a template type parameter. */
26232 /* Defer lookup. */
26234 else
26235 {
26238 /* If PARSER->SCOPE is a dependent type, then it must be a
26239 class type, and we must not be checking dependencies;
26240 otherwise, we would have processed this lookup above. So
26241 that PARSER->SCOPE is not considered a dependent base by
26242 lookup_member, we must enter the scope here. */
26246 /* If the PARSER->SCOPE is a template specialization, it
26247 may be instantiated during name lookup. In that case,
26248 errors may be issued. Even if we rollback the current
26249 tentative parse, those errors are valid. */
26254 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26255 lookup result and the nested-name-specifier nominates a class C:
26256 * if the name specified after the nested-name-specifier, when
26257 looked up in C, is the injected-class-name of C (Clause 9), or
26258 * if the name specified after the nested-name-specifier is the
26259 same as the identifier or the simple-template-id's template-
26260 name in the last component of the nested-name-specifier,
26261 the name is instead considered to name the constructor of
26262 class C. [ Note: for example, the constructor is not an
26263 acceptable lookup result in an elaborated-type-specifier so
26264 the constructor would not be used in place of the
26265 injected-class-name. --end note ] Such a constructor name
26266 shall be used only in the declarator-id of a declaration that
26267 names a constructor or in a using-declaration. */
26275 /* If we have a single function from a using decl, pull it out. */
26282 }
26284 /* If the scope is a dependent type and either we deferred lookup or
26285 we did lookup but didn't find the name, rememeber the name. */
26288 {
26290 {
26291 tree type;
26293 /* The resolution to Core Issue 180 says that `struct
26294 A::B' should be considered a type-name, even if `A'
26295 is dependent. */
26300 }
26304 CPP_CLOSE_PAREN)))
26308 else
26311 is_template);
26312 }
26315 }
26317 {
26318 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26319 OBJECT_TYPE is not a class. */
26321 /* If the OBJECT_TYPE is a template specialization, it may
26322 be instantiated during name lookup. In that case, errors
26323 may be issued. Even if we rollback the current tentative
26324 parse, those errors are valid. */
26326 name,
26329 tf_warning_or_error);
26330 else
26334 /* Look it up in the enclosing context. DR 141: When looking for a
26335 template-name after -> or ., only consider class templates. */
26340 /* The object is type-dependent, so we can't look anything up; we used
26341 this to get the DR 141 behavior. */
26345 }
26346 else
26347 {
26353 }
26355 /* If the lookup failed, let our caller know. */
26359 /* Pull out the template from an injected-class-name (or multiple). */
26363 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26365 {
26368 /* The error message we have to print is too complicated for
26369 cp_parser_error, so we incorporate its actions directly. */
26371 {
26373 name);
26375 }
26377 }
26385 /* If we have resolved the name of a member declaration, check to
26386 see if the declaration is accessible. When the name resolves to
26387 set of overloaded functions, accessibility is checked when
26388 overload resolution is done.
26390 During an explicit instantiation, access is not checked at all,
26391 as per [temp.explicit]. */
26398 }
26400 /* Like cp_parser_lookup_name, but for use in the typical case where
26401 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26402 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26404 static tree
26406 {
26408 none_type,
26413 location);
26414 }
26416 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26417 the current context, return the TYPE_DECL. If TAG_NAME_P is
26418 true, the DECL indicates the class being defined in a class-head,
26419 or declared in an elaborated-type-specifier.
26421 Otherwise, return DECL. */
26423 static tree
26425 {
26426 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26427 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26429 struct A {
26430 template <typename T> struct B;
26431 };
26433 template <typename T> struct A::B {};
26435 Similarly, in an elaborated-type-specifier:
26437 namespace N { struct X{}; }
26439 struct A {
26440 template <typename T> friend struct N::X;
26441 };
26443 However, if the DECL refers to a class type, and we are in
26444 the scope of the class, then the name lookup automatically
26445 finds the TYPE_DECL created by build_self_reference rather
26446 than a TEMPLATE_DECL. For example, in:
26448 template <class T> struct S {
26449 S s;
26450 };
26452 there is no need to handle such case. */
26458 }
26460 /* If too many, or too few, template-parameter lists apply to the
26461 declarator, issue an error message. Returns TRUE if all went well,
26462 and FALSE otherwise. */
26464 static bool
26467 location_t declarator_location)
26468 {
26470 {
26472 {
26481 {
26482 /* If the DECLARATOR has the form `X<y>' then it uses one
26483 additional level of template parameters. */
26486 }
26488 return cp_parser_check_template_parameters
26490 declarator);
26491 }
26507 }
26509 }
26511 /* NUM_TEMPLATES were used in the current declaration. If that is
26512 invalid, return FALSE and issue an error messages. Otherwise,
26513 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26514 declarator and we can print more accurate diagnostics. */
26516 static bool
26520 location_t location,
26522 {
26523 /* If there are the same number of template classes and parameter
26524 lists, that's OK. */
26527 /* If there are more, but only one more, and the name ends in an identifier,
26528 then we are declaring a primary template. That's OK too. */
26532 /* If there are more template classes than parameter lists, we have
26533 something like:
26535 template <class T> void S<T>::R<T>::f (); */
26537 {
26547 else
26550 }
26551 /* Otherwise, there are too many template parameter lists. We have
26552 something like:
26554 template <class T> template <class U> void S::f(); */
26557 }
26559 /* Parse an optional `::' token indicating that the following name is
26560 from the global namespace. If so, PARSER->SCOPE is set to the
26561 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26562 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26563 Returns the new value of PARSER->SCOPE, if the `::' token is
26564 present, and NULL_TREE otherwise. */
26566 static tree
26568 {
26571 /* Peek at the next token. */
26573 /* If we're looking at a `::' token then we're starting from the
26574 global namespace, not our current location. */
26576 {
26577 /* Consume the `::' token. */
26579 /* Set the SCOPE so that we know where to start the lookup. */
26585 }
26587 {
26591 }
26594 }
26596 /* Returns TRUE if the upcoming token sequence is the start of a
26597 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26598 declarator is preceded by the `friend' specifier. */
26600 static bool
26602 {
26605 tree nested_name_specifier;
26608 /* The common case is that this is not a constructor declarator, so
26609 try to avoid doing lots of work if at all possible. It's not
26610 valid declare a constructor at function scope. */
26613 /* And only certain tokens can begin a constructor declarator. */
26621 /* Parse tentatively; we are going to roll back all of the tokens
26622 consumed here. */
26624 /* Assume that we are looking at a constructor declarator. */
26627 /* Look for the optional `::' operator. */
26630 /* Look for the nested-name-specifier. */
26631 nested_name_specifier
26642 /* Outside of a class-specifier, there must be a
26643 nested-name-specifier. Except in C++17 mode, where we
26644 might be declaring a guiding declaration. */
26651 /* If we have a class scope, this is easy; DR 147 says that S::S always
26652 names the constructor, and no other qualified name could. */
26655 {
26665 }
26666 /* If we still think that this might be a constructor-declarator,
26667 look for a class-name. */
26669 {
26670 /* If we have:
26672 template <typename T> struct S {
26673 S();
26674 };
26676 we must recognize that the nested `S' names a class. */
26680 tree type_decl;
26684 none_type,
26691 {
26697 none_type,
26702 else
26704 }
26706 /* If there was no class-name, then this is not a constructor.
26707 Otherwise, if we are in a class-specifier and we aren't
26708 handling a friend declaration, check that its type matches
26709 current_class_type (c++/38313). Note: error_mark_node
26710 is left alone for error recovery purposes. */
26712 && (outside_class_specifier_p
26718 /* If we're still considering a constructor, we have to see a `(',
26719 to begin the parameter-declaration-clause, followed by either a
26720 `)', an `...', or a decl-specifier. We need to check for a
26721 type-specifier to avoid being fooled into thinking that:
26723 S (f) (int);
26725 is a constructor. (It is actually a function named `f' that
26726 takes one parameter (of type `int') and returns a value of type
26727 `S'. */
26735 /* A parameter declaration begins with a decl-specifier,
26736 which is either the "attribute" keyword, a storage class
26737 specifier, or (usually) a type-specifier. */
26739 {
26740 tree type;
26744 /* Names appearing in the type-specifier should be looked up
26745 in the scope of the class. */
26749 {
26752 {
26756 {
26759 }
26760 }
26762 }
26764 /* Inside the constructor parameter list, surrounding
26765 template-parameter-lists do not apply. */
26766 saved_num_template_parameter_lists
26770 /* Look for the type-specifier. */
26772 CP_PARSER_FLAGS_NONE,
26778 parser->num_template_parameter_lists
26781 /* Leave the scope of the class. */
26786 }
26787 }
26789 /* We did not really want to consume any tokens. */
26793 }
26795 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26796 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26797 they must be performed once we are in the scope of the function.
26799 Returns the function defined. */
26801 static tree
26802 cp_parser_function_definition_from_specifiers_and_declarator
26805 tree attributes,
26807 {
26808 tree fn;
26811 /* Begin the function-definition. */
26814 /* The things we're about to see are not directly qualified by any
26815 template headers we've seen thus far. */
26818 /* If there were names looked up in the decl-specifier-seq that we
26819 did not check, check them now. We must wait until we are in the
26820 scope of the function to perform the checks, since the function
26821 might be a friend. */
26825 {
26830 }
26833 {
26834 /* Skip the entire function. */
26837 }
26839 {
26840 /* Seen already, skip it. An error message has already been output. */
26844 /* If this is a function from a class, pop the nested class. */
26847 }
26848 else
26849 {
26850 timevar_id_t tv;
26853 else
26859 }
26862 }
26864 /* Parse the part of a function-definition that follows the
26865 declarator. INLINE_P is TRUE iff this function is an inline
26866 function defined within a class-specifier.
26868 Returns the function defined. */
26870 static tree
26873 {
26874 tree fn;
26879 bool fully_implicit_function_template_p
26882 tree implicit_template_parms
26885 cp_binding_level* implicit_template_scope
26891 /* If the next token is `return', then the code may be trying to
26892 make use of the "named return value" extension that G++ used to
26893 support. */
26896 {
26897 /* Consume the `return' keyword. */
26899 /* Look for the identifier that indicates what value is to be
26900 returned. */
26902 /* Issue an error message. */
26905 /* Skip tokens until we reach the start of the function body. */
26907 {
26914 }
26915 }
26916 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26917 anything declared inside `f'. */
26918 saved_in_unbraced_linkage_specification_p
26921 /* Inside the function, surrounding template-parameter-lists do not
26922 apply. */
26923 saved_num_template_parameter_lists
26927 /* If the next token is `try', `__transaction_atomic', or
26928 `__transaction_relaxed`, then we are looking at either function-try-block
26929 or function-transaction-block. Note that all of these include the
26930 function-body. */
26934 RID_TRANSACTION_RELAXED))
26938 else
26939 cp_parser_ctor_initializer_opt_and_function_body
26942 /* Finish the function. */
26944 /* Generate code for it, if necessary. */
26946 /* Restore the saved values. */
26947 parser->in_unbraced_linkage_specification_p
26949 parser->num_template_parameter_lists
26953 parser->fully_implicit_function_template_p
26955 parser->implicit_template_parms
26957 parser->implicit_template_scope
26964 }
26966 /* Parse a template-declaration body (following argument list). */
26968 static void
26970 tree parameter_list,
26972 {
26976 /* We just processed one more parameter list. */
26979 /* Get the deferred access checks from the parameter list. These
26980 will be checked once we know what is being declared, as for a
26981 member template the checks must be performed in the scope of the
26982 class containing the member. */
26985 /* Tentatively parse for a new template parameter list, which can either be
26986 the template keyword or a template introduction. */
26992 else
26993 {
26994 /* There are no access checks when parsing a template, as we do not
26995 know if a specialization will be a friend. */
26999 checks,
27000 member_p,
27005 /* If this is a member template declaration, let the front
27006 end know. */
27008 {
27013 }
27018 }
27019 /* We are done with the current parameter list. */
27024 /* Finish up. */
27027 /* Check the template arguments for a literal operator template. */
27031 {
27035 else
27036 {
27039 {
27045 }
27047 {
27056 }
27057 else
27059 }
27061 {
27064 " Expected non-type template argument pack <char...>"
27066 decl);
27067 else
27070 decl);
27071 }
27072 }
27074 /* Register member declarations. */
27077 /* If DECL is a function template, we must return to parse it later.
27078 (Even though there is no definition, there might be default
27079 arguments that need handling.) */
27083 }
27085 /* Parse a template introduction header for a template-declaration. Returns
27086 false if tentative parse fails. */
27088 static bool
27090 {
27097 /* Look for the optional `::' operator. */
27100 /* Look for the nested-name-specifier. */
27110 /* Look up the concept for which we will be matching
27111 template parameters. */
27121 /* Look for opening brace for introduction. */
27122 matching_braces braces;
27130 /* Build vector of placeholder parameters and grab
27131 matching identifiers. */
27134 /* The introduction-list shall not be empty. */
27137 {
27140 }
27142 /* Look for closing brace for introduction. */
27147 {
27151 }
27153 /* Build and associate the constraint. */
27156 {
27158 member_p);
27160 }
27164 }
27166 /* Parse a normal template-declaration following the template keyword. */
27168 static void
27170 {
27171 tree parameter_list;
27175 /* Look for the `<' token. */
27179 {
27180 /* 14.5.2.2 [temp.mem]
27182 A local class shall not have member templates. */
27187 }
27188 /* [temp]
27190 A template ... shall not have C linkage. */
27192 {
27195 /* Give it C++ linkage to avoid confusing other parts of the
27196 front end. */
27199 }
27200 else
27203 /* We cannot perform access checks on the template parameter
27204 declarations until we know what is being declared, just as we
27205 cannot check the decl-specifier list. */
27208 /* If the next token is `>', then we have an invalid
27209 specialization. Rather than complain about an invalid template
27210 parameter, issue an error message here. */
27212 {
27216 }
27217 else
27218 {
27219 /* Parse the template parameters. */
27221 }
27223 /* Look for the `>'. */
27226 /* Manage template requirements */
27228 {
27233 }
27236 member_p);
27238 /* For the erroneous case of a template with C linkage, we pushed an
27239 implicit C++ linkage scope; exit that scope now. */
27242 }
27244 /* Parse a template-declaration, assuming that the `export' (and
27245 `extern') keywords, if present, has already been scanned. MEMBER_P
27246 is as for cp_parser_template_declaration. */
27248 static bool
27250 {
27252 {
27256 }
27261 }
27263 /* Perform the deferred access checks from a template-parameter-list.
27264 CHECKS is a TREE_LIST of access checks, as returned by
27265 get_deferred_access_checks. */
27267 static void
27268 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27269 {
27273 }
27275 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27276 `function-definition' sequence that follows a template header.
27277 If MEMBER_P is true, this declaration appears in a class scope.
27279 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27280 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27282 static tree
27288 {
27291 cp_decl_specifier_seq decl_specifiers;
27295 /* This function is only used when processing a template
27296 declaration. */
27300 /* Defer access checks until we know what is being declared. */
27303 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27304 alternative. */
27307 CP_PARSER_FLAGS_OPTIONAL,
27313 /* There are no template typedefs. */
27315 {
27319 }
27321 /* Gather up the access checks that occurred the
27322 decl-specifier-seq. */
27325 /* Check for the declaration of a template class. */
27327 {
27330 {
27331 // If this is a declaration, but not a definition, associate
27332 // any constraints with the type declaration. Constraints
27333 // are associated with definitions in cp_parser_class_specifier.
27339 /* In this case:
27341 struct C {
27342 friend template <typename T> struct A<T>::B;
27343 };
27345 A<T>::B will be represented by a TYPENAME_TYPE, and
27346 therefore not recognized by shadow_tag. */
27348 && !decl
27355 else
27358 /* Perform access checks for template parameters. */
27361 /* Give a helpful diagnostic for
27362 template <class T> struct A { } a;
27363 if we aren't already recovering from an error. */
27366 {
27368 "a class template declaration must not declare "
27372 }
27373 }
27374 }
27376 /* Complain about missing 'typename' or other invalid type names. */
27379 {
27380 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27381 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27382 the rest of this declaration. */
27385 }
27387 /* If it's not a template class, try for a template function. If
27388 the next token is a `;', then this declaration does not declare
27389 anything. But, if there were errors in the decl-specifiers, then
27390 the error might well have come from an attempted class-specifier.
27391 In that case, there's no need to warn about a missing declarator. */
27395 {
27398 checks,
27400 member_p,
27401 declares_class_or_enum,
27405 /* 7.1.1-1 [dcl.stc]
27407 A storage-class-specifier shall not be specified in an explicit
27408 specialization... */
27410 && explicit_specialization_p
27412 {
27416 }
27420 }
27422 /* Look for a trailing `;' after the declaration. */
27428 out:
27431 /* Clear any current qualification; whatever comes next is the start
27432 of something new. */
27438 }
27440 /* Parse a cast-expression that is not the operand of a unary "&". */
27442 static cp_expr
27444 {
27447 }
27449 /* Parse a functional cast to TYPE. Returns an expression
27450 representing the cast. */
27452 static cp_expr
27454 {
27456 tree expression_list;
27457 cp_expr cast;
27466 {
27476 /* Create a location of the form:
27477 type_name{i, f}
27478 ^~~~~~~~~~~~~~~
27479 with caret == start at the start of the type name,
27480 finishing at the closing brace. */
27481 location_t finish_loc
27484 finish_loc);
27487 }
27496 else
27497 {
27500 }
27503 tf_warning_or_error);
27504 /* [expr.const]/1: In an integral constant expression "only type
27505 conversions to integral or enumeration type can be used". */
27511 NIC_CONSTRUCTOR))
27514 /* Create a location of the form:
27515 float(i)
27516 ^~~~~~~~
27517 with caret == start at the start of the type name,
27518 finishing at the closing paren. */
27519 location_t finish_loc
27524 }
27526 /* Save the tokens that make up the body of a member function defined
27527 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27528 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27529 specifiers applied to the declaration. Returns the FUNCTION_DECL
27530 for the member function. */
27532 static tree
27536 tree attributes)
27537 {
27540 tree fn;
27543 /* Create the FUNCTION_DECL. */
27547 /* If something went badly wrong, bail out now. */
27549 {
27550 /* If there's a function-body, skip it. */
27555 }
27557 /* Remember it, if there default args to post process. */
27560 /* Save away the tokens that make up the body of the
27561 function. */
27567 RID_TRANSACTION_ATOMIC))
27568 {
27570 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27577 {
27583 }
27584 else
27587 {
27591 }
27592 }
27594 /* Handle function try blocks. */
27596 {
27599 }
27600 /* We can have braced-init-list mem-initializers before the fn body. */
27602 {
27605 {
27606 /* cache_group will stop after an un-nested { } pair, too. */
27610 /* variadic mem-inits have ... after the ')'. */
27613 }
27614 }
27616 /* Handle function try blocks. */
27622 /* Save away the inline definition; we will process it when the
27623 class is complete. */
27627 /* We need to know that this was defined in the class, so that
27628 friend templates are handled correctly. */
27631 /* Add FN to the queue of functions to be parsed later. */
27635 }
27637 /* Save the tokens that make up the in-class initializer for a non-static
27638 data member. Returns a DEFAULT_ARG. */
27640 static tree
27642 {
27644 }
27646 /* Parse a template-argument-list, as well as the trailing ">" (but
27647 not the opening "<"). See cp_parser_template_argument_list for the
27648 return value. */
27650 static tree
27652 {
27653 tree arguments;
27654 tree saved_scope;
27655 tree saved_qualifying_scope;
27656 tree saved_object_scope;
27661 /* [temp.names]
27663 When parsing a template-id, the first non-nested `>' is taken as
27664 the end of the template-argument-list rather than a greater-than
27665 operator. */
27666 saved_greater_than_is_operator_p
27669 /* Parsing the argument list may modify SCOPE, so we save it
27670 here. */
27674 /* We need to evaluate the template arguments, even though this
27675 template-id may be nested within a "sizeof". */
27680 /* Parse the template-argument-list itself. */
27684 else
27686 /* Look for the `>' that ends the template-argument-list. If we find
27687 a '>>' instead, it's probably just a typo. */
27689 {
27691 {
27692 /* In C++0x, a `>>' in a template argument list or cast
27693 expression is considered to be two separate `>'
27694 tokens. So, change the current token to a `>', but don't
27695 consume it: it will be consumed later when the outer
27696 template argument list (or cast expression) is parsed.
27697 Note that this replacement of `>' for `>>' is necessary
27698 even if we are parsing tentatively: in the tentative
27699 case, after calling
27700 cp_parser_enclosed_template_argument_list we will always
27701 throw away all of the template arguments and the first
27702 closing `>', either because the template argument list
27703 was erroneous or because we are replacing those tokens
27704 with a CPP_TEMPLATE_ID token. The second `>' (which will
27705 not have been thrown away) is needed either to close an
27706 outer template argument list or to complete a new-style
27707 cast. */
27710 }
27712 {
27713 /* If we're in a nested template argument list, the '>>' has
27714 to be a typo for '> >'. We emit the error message, but we
27715 continue parsing and we push a '>' as next token, so that
27716 the argument list will be parsed correctly. Note that the
27717 global source location is still on the token before the
27718 '>>', so we need to say explicitly where we want it. */
27726 }
27727 else
27728 {
27729 /* If this is not a nested template argument list, the '>>'
27730 is a typo for '>'. Emit an error message and continue.
27731 Same deal about the token location, but here we can get it
27732 right by consuming the '>>' before issuing the diagnostic. */
27735 "spurious %<>>%>, use %<>%> to terminate "
27737 }
27738 }
27739 else
27741 /* The `>' token might be a greater-than operator again now. */
27742 parser->greater_than_is_operator_p
27744 /* Restore the SAVED_SCOPE. */
27752 }
27754 /* MEMBER_FUNCTION is a member function, or a friend. If default
27755 arguments, or the body of the function have not yet been parsed,
27756 parse them now. */
27758 static void
27760 {
27762 /* If this member is a template, get the underlying
27763 FUNCTION_DECL. */
27767 /* There should not be any class definitions in progress at this
27768 point; the bodies of members are only parsed outside of all class
27769 definitions. */
27771 /* While we're parsing the member functions we might encounter more
27772 classes. We want to handle them right away, but we don't want
27773 them getting mixed up with functions that are currently in the
27774 queue. */
27777 /* Make sure that any template parameters are in scope. */
27780 /* If the body of the function has not yet been parsed, parse it
27781 now. */
27783 {
27784 tree function_scope;
27787 /* The function is no longer pending; we are processing it. */
27792 /* If this is a local class, enter the scope of the containing
27793 function. */
27798 /* Push the body of the function onto the lexer stack. */
27801 /* Let the front end know that we going to be defining this
27802 function. */
27806 /* Don't do access checking if it is a templated function. */
27810 /* #pragma omp declare reduction needs special parsing. */
27812 {
27817 }
27818 else
27819 /* Now, parse the body of the function. */
27826 /* Leave the scope of the containing function. */
27830 }
27832 /* Remove any template parameters from the symbol table. */
27835 /* Restore the queue. */
27838 }
27840 /* If DECL contains any default args, remember it on the unparsed
27841 functions queue. */
27843 static void
27845 {
27846 tree probe;
27849 probe;
27852 {
27856 }
27857 }
27859 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27860 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27861 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27862 from the parameter-type-list. */
27864 static tree
27867 {
27869 tree parsed_arg;
27875 /* Push the saved tokens for the default argument onto the parser's
27876 lexer stack. */
27882 /* Parse the default argument. */
27893 {
27894 /* In a non-template class, check conversions now. In a template,
27895 we'll wait and instantiate these as needed. */
27898 tf_warning_or_error);
27901 else
27903 }
27905 /* If the token stream has not been completely used up, then
27906 there was extra junk after the end of the default
27907 argument. */
27909 {
27912 else
27914 }
27916 /* Revert to the main lexer. */
27920 }
27922 /* FIELD is a non-static data member with an initializer which we saved for
27923 later; parse it now. */
27925 static void
27927 {
27928 tree def;
27935 NULL_TREE);
27941 }
27943 /* FN is a FUNCTION_DECL which may contains a parameter with an
27944 unparsed DEFAULT_ARG. Parse the default args now. This function
27945 assumes that the current scope is the scope in which the default
27946 argument should be processed. */
27948 static void
27950 {
27954 /* While we're parsing the default args, we might (due to the
27955 statement expression extension) encounter more classes. We want
27956 to handle them right away, but we don't want them getting mixed
27957 up with default args that are currently in the queue. */
27960 /* Local variable names (and the `this' keyword) may not appear
27961 in a default argument. */
27972 {
27974 tree parsed_arg;
27976 tree copy;
27983 /* This can happen for a friend declaration for a function
27984 already declared with default arguments. */
27987 parsed_arg
27989 default_arg,
27993 /* Update any instantiations we've already created. */
27997 }
28001 /* Make sure no default arg is missing. */
28004 /* Restore the state of local_variables_forbidden_p. */
28007 /* Restore the queue. */
28009 }
28011 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
28013 sizeof ... ( identifier )
28015 where the 'sizeof' token has already been consumed. */
28017 static tree
28019 {
28020 /* Consume the `...'. */
28024 matching_parens parens;
28028 else
28036 /* The name is not qualified. */
28055 }
28057 /* Parse the operand of `sizeof' (or a similar operator). Returns
28058 either a TYPE or an expression, depending on the form of the
28059 input. The KEYWORD indicates which kind of expression we have
28060 encountered. */
28062 static tree
28064 {
28071 /* If it's a `...', then we are computing the length of a parameter
28072 pack. */
28077 /* Types cannot be defined in a `sizeof' expression. Save away the
28078 old message. */
28080 /* And create the new one. */
28086 /* The restrictions on constant-expressions do not apply inside
28087 sizeof expressions. */
28088 saved_integral_constant_expression_p
28090 saved_non_integral_constant_expression_p
28094 /* Do not actually evaluate the expression. */
28097 /* If it's a `(', then we might be looking at the type-id
28098 construction. */
28100 {
28103 /* We can't be sure yet whether we're looking at a type-id or an
28104 expression. */
28107 matching_parens parens;
28110 /* Note: as a GNU Extension, compound literals are considered
28111 postfix-expressions as they are in C99, so they are valid
28112 arguments to sizeof. See comment in cp_parser_cast_expression
28113 for details. */
28116 else
28117 {
28120 /* Look for the type-id. */
28122 /* Look for the closing `)'. */
28125 }
28127 /* If all went well, then we're done. */
28129 {
28130 cp_decl_specifier_seq decl_specs;
28132 /* Build a trivial decl-specifier-seq. */
28136 /* Call grokdeclarator to figure out what type this is. */
28139 TYPENAME,
28142 }
28143 }
28145 /* If the type-id production did not work out, then we must be
28146 looking at the unary-expression production. */
28150 /* Go back to evaluating expressions. */
28154 /* Free the message we created. */
28156 /* And restore the old one. */
28158 parser->integral_constant_expression_p
28160 parser->non_integral_constant_expression_p
28164 }
28166 /* If the current declaration has no declarator, return true. */
28168 static bool
28170 {
28171 /* If the next token is a `;' or a `,' then there is no
28172 declarator. */
28175 }
28177 /* Update the DECL_SPECS to reflect the storage class indicated by
28178 KEYWORD. */
28180 static void
28185 {
28186 cp_storage_class storage_class;
28189 {
28193 }
28195 {
28198 }
28203 {
28206 }
28209 {
28227 }
28231 /* A storage class specifier cannot be applied alongside a typedef
28232 specifier. If there is a typedef specifier present then set
28233 conflicting_specifiers_p which will trigger an error later
28234 on in grokdeclarator. */
28237 }
28239 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28240 is true, the type is a class or enum definition. */
28242 static void
28244 tree type_spec,
28247 {
28250 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28251 (with, for example, in "typedef int wchar_t;") we remember that
28252 this is what happened. In system headers, we ignore these
28253 declarations so that G++ can work with system headers that are not
28254 C++-safe. */
28256 && !type_definition_p
28266 {
28269 ds_redefined_builtin_type_spec,
28270 token);
28272 {
28276 }
28277 }
28280 else
28281 {
28286 }
28287 }
28289 /* True iff TOKEN is the GNU keyword __thread. */
28291 static bool
28293 {
28296 }
28298 /* Set the location for a declarator specifier and check if it is
28299 duplicated.
28301 DECL_SPECS is the sequence of declarator specifiers onto which to
28302 set the location.
28304 DS is the single declarator specifier to set which location is to
28305 be set onto the existing sequence of declarators.
28307 LOCATION is the location for the declarator specifier to
28308 consider. */
28310 static void
28313 {
28322 {
28326 }
28327 else
28328 {
28330 {
28334 else
28335 {
28338 OPT_Wlong_long,
28340 }
28341 }
28343 {
28348 else
28349 {
28353 }
28354 }
28355 else
28356 {
28372 "__complex"
28373 };
28377 }
28378 }
28379 }
28381 /* Return true iff the declarator specifier DS is present in the
28382 sequence of declarator specifiers DECL_SPECS. */
28384 bool
28386 cp_decl_spec ds)
28387 {
28394 }
28396 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28397 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28399 static bool
28401 {
28403 }
28405 /* Issue an error message indicating that TOKEN_DESC was expected.
28406 If KEYWORD is true, it indicated this function is called by
28407 cp_parser_require_keword and the required token can only be
28408 a indicated keyword.
28410 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28411 within any error as the location of an "opening" token matching
28412 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28413 RT_CLOSE_PAREN). */
28415 static void
28417 required_token token_desc,
28419 location_t matching_location)
28420 {
28426 {
28495 }
28498 {
28500 {
28578 }
28579 }
28583 }
28586 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28587 issue an error message indicating that TOKEN_DESC was expected.
28589 Returns the token consumed, if the token had the appropriate type.
28590 Otherwise, returns NULL.
28592 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28593 within any error as the location of an "opening" token matching
28594 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28595 RT_CLOSE_PAREN). */
28600 required_token token_desc,
28601 location_t matching_location)
28602 {
28605 else
28606 {
28607 /* Output the MESSAGE -- unless we're parsing tentatively. */
28610 matching_location);
28612 }
28613 }
28615 /* An error message is produced if the next token is not '>'.
28616 All further tokens are skipped until the desired token is
28617 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28619 static void
28621 {
28622 /* Current level of '< ... >'. */
28624 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28627 /* Are we ready, yet? If not, issue error message. */
28631 /* Skip tokens until the desired token is found. */
28633 {
28634 /* Peek at the next token. */
28636 {
28644 /* C++0x views the `>>' operator as two `>' tokens, but
28645 C++98 does not. */
28648 {
28649 /* We've hit a `>>' where the first `>' closes the
28650 template argument list, and the second `>' is
28651 spurious. Just consume the `>>' and stop; we've
28652 already produced at least one error. */
28655 }
28656 /* Fall through for C++0x, so we handle the second `>' in
28657 the `>>'. */
28662 {
28663 /* We've reached the token we want, consume it and stop. */
28666 }
28685 /* The '>' was probably forgotten, don't look further. */
28690 }
28692 /* Consume this token. */
28694 }
28695 }
28697 /* If the next token is the indicated keyword, consume it. Otherwise,
28698 issue an error message indicating that TOKEN_DESC was expected.
28700 Returns the token consumed, if the token had the appropriate type.
28701 Otherwise, returns NULL. */
28706 required_token token_desc)
28707 {
28711 {
28713 UNKNOWN_LOCATION);
28715 }
28718 }
28720 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28721 function-definition. */
28723 static bool
28725 {
28728 /* A ctor-initializer begins with a `:'. */
28730 /* A function-try-block begins with `try'. */
28732 /* A function-transaction-block begins with `__transaction_atomic'
28733 or `__transaction_relaxed'. */
28736 /* The named return value extension begins with `return'. */
28738 }
28740 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28741 definition. */
28743 static bool
28745 {
28752 }
28754 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28755 C++0x) ending a template-argument. */
28757 static bool
28759 {
28767 }
28769 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28770 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28772 static bool
28775 {
28781 /* Check for the sequence `<::' in the original code. It would be lexed as
28782 `[:', where `[' is a digraph, and there is no whitespace before
28783 `:'. */
28785 {
28790 }
28792 }
28794 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28795 or none_type otherwise. */
28797 static enum tag_types
28799 {
28801 {
28811 }
28812 }
28814 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28815 or none_type otherwise or if the token is null. */
28817 static enum tag_types
28819 {
28824 {
28832 }
28833 }
28835 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28837 static void
28839 {
28843 {
28847 type))
28850 }
28851 }
28853 /* Issue an error message if DECL is redeclared with different
28854 access than its original declaration [class.access.spec/3].
28855 This applies to nested classes, nested class templates and
28856 enumerations [class.mem/1]. */
28858 static void
28860 {
28871 }
28873 /* Look for the `template' keyword, as a syntactic disambiguator.
28874 Return TRUE iff it is present, in which case it will be
28875 consumed. */
28877 static bool
28879 {
28881 {
28882 /* In C++98 the `template' keyword can only be used within templates;
28883 outside templates the parser can always figure out what is a
28884 template and what is not. In C++11, per the resolution of DR 468,
28885 `template' is allowed in cases where it is not strictly necessary. */
28888 {
28891 "in C++98 %<template%> (as a disambiguator) is only "
28893 /* If this part of the token stream is rescanned, the same
28894 error message would be generated. So, we purge the token
28895 from the stream. */
28898 }
28899 else
28900 {
28901 /* Consume the `template' keyword. */
28904 }
28905 }
28907 }
28909 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28910 set PARSER->SCOPE, and perform other related actions. */
28912 static void
28914 {
28917 /* Get the stored value. */
28919 /* Set the scope from the stored value. */
28923 }
28925 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28926 encounter the end of a block before what we were looking for. */
28928 static bool
28932 {
28934 {
28937 /* Abort a parenthesized expression if we encounter a semicolon. */
28941 /* If we've reached the end of the file, stop. */
28947 /* We've hit the end of an enclosing block, so there's been some
28948 kind of syntax error. */
28951 /* Consume the token. */
28953 /* See if it starts a new group. */
28955 {
28957 /* In theory this should probably check end == '}', but
28958 cp_parser_save_member_function_body needs it to exit
28959 after either '}' or ')' when called with ')'. */
28962 }
28964 {
28968 }
28973 }
28974 }
28976 /* Like above, for caching a default argument or NSDMI. Both of these are
28977 terminated by a non-nested comma, but it can be unclear whether or not a
28978 comma is nested in a template argument list unless we do more parsing.
28979 In order to handle this ambiguity, when we encounter a ',' after a '<'
28980 we try to parse what follows as a parameter-declaration-list (in the
28981 case of a default argument) or a member-declarator (in the case of an
28982 NSDMI). If that succeeds, then we stop caching. */
28984 static tree
28986 {
28991 tree default_argument;
28993 /* Add tokens until we have processed the entire default
28994 argument. We add the range [first_token, token). */
28997 {
28998 /* For list-initialization, this is straightforward. */
29001 }
29003 {
29006 /* Peek at the next token. */
29008 /* What we do depends on what token we have. */
29010 {
29011 /* In valid code, a default argument must be
29012 immediately followed by a `,' `)', or `...'. */
29015 {
29016 /* If we've seen a '<', we might be in a
29017 template-argument-list. Until Core issue 325 is
29018 resolved, we don't know how this situation ought
29019 to be handled, so try to DTRT. We check whether
29020 what comes after the comma is a valid parameter
29021 declaration list. If it is, then the comma ends
29022 the default argument; otherwise the default
29023 argument continues. */
29027 /* Set ITALP so cp_parser_parameter_declaration_list
29028 doesn't decide to commit to this parse. */
29035 {
29036 /* Parse declarators until we reach a non-comma or
29037 somthing that cannot be an initializer.
29038 Just checking whether we're looking at a single
29039 declarator is insufficient. Consider:
29040 int var = tuple<T,U>::x;
29041 The template parameter 'U' looks exactly like a
29042 declarator. */
29043 do
29044 {
29055 }
29057 /* If we met an '=' or ';' then the original comma
29058 was the end of the NSDMI. Otherwise assume
29059 we're still in the NSDMI. */
29062 }
29063 else
29064 {
29071 }
29078 }
29079 /* FALLTHRU */
29082 /* If we run into a non-nested `;', `}', or `]',
29083 then the code is invalid -- but the default
29084 argument is certainly over. */
29089 /* Handle correctly int n = sizeof ... ( p ); */
29092 /* Update DEPTH, if necessary. */
29107 /* This might be the comparison operator, or it might
29108 start a template argument list. */
29115 /* Fall through for C++0x, which treats the `>>'
29116 operator like two `>' tokens in certain
29117 cases. */
29122 {
29123 /* This might be an operator, or it might close a
29124 template argument list. But if a previous '<'
29125 started a template argument list, this will have
29126 closed it, so we can't be in one anymore. */
29130 }
29133 /* If we run out of tokens, issue an error message. */
29141 /* In these cases, we should look for template-ids.
29142 For example, if the default argument is
29143 `X<int, double>()', we need to do name lookup to
29144 figure out whether or not `X' is a template; if
29145 so, the `,' does not end the default argument.
29147 That is not yet done. */
29152 }
29154 /* If we've reached the end, stop. */
29158 /* Add the token to the token block. */
29160 }
29162 /* Create a DEFAULT_ARG to represent the unparsed default
29163 argument. */
29170 }
29172 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29174 location_t
29176 {
29181 }
29183 /* Begin parsing tentatively. We always save tokens while parsing
29184 tentatively so that if the tentative parsing fails we can restore the
29185 tokens. */
29187 static void
29189 {
29190 /* Enter a new parsing context. */
29192 /* Begin saving tokens. */
29194 /* In order to avoid repetitive access control error messages,
29195 access checks are queued up until we are no longer parsing
29196 tentatively. */
29198 }
29200 /* Commit to the currently active tentative parse. */
29202 static void
29204 {
29208 /* Mark all of the levels as committed. */
29211 {
29218 }
29219 }
29221 /* Commit to the topmost currently active tentative parse.
29223 Note that this function shouldn't be called when there are
29224 irreversible side-effects while in a tentative state. For
29225 example, we shouldn't create a permanent entry in the symbol
29226 table, or issue an error message that might not apply if the
29227 tentative parse is aborted. */
29229 static void
29231 {
29236 {
29244 }
29245 }
29247 /* Abort the currently active tentative parse. All consumed tokens
29248 will be rolled back, and no diagnostics will be issued. */
29250 static void
29252 {
29256 /* Now, pretend that we want to see if the construct was
29257 successfully parsed. */
29259 }
29261 /* Stop parsing tentatively. If a parse error has occurred, restore the
29262 token stream. Otherwise, commit to the tokens we have consumed.
29263 Returns true if no error occurred; false otherwise. */
29265 static bool
29267 {
29271 /* Remember whether or not an error occurred, since we are about to
29272 destroy that information. */
29274 /* Remove the topmost context from the stack. */
29277 /* If no parse errors occurred, commit to the tentative parse. */
29279 {
29280 /* Commit to the tokens read tentatively, unless that was
29281 already done. */
29286 }
29287 /* Otherwise, if errors occurred, roll back our state so that things
29288 are just as they were before we began the tentative parse. */
29289 else
29290 {
29293 }
29294 /* Add the context to the front of the free list. */
29299 }
29301 /* Returns true if we are parsing tentatively and are not committed to
29302 this tentative parse. */
29304 static bool
29306 {
29309 }
29311 /* Returns nonzero iff an error has occurred during the most recent
29312 tentative parse. */
29314 static bool
29316 {
29319 }
29321 /* Returns nonzero if GNU extensions are allowed. */
29323 static bool
29325 {
29327 }
29328 \f
29329 /* Objective-C++ Productions */
29332 /* Parse an Objective-C expression, which feeds into a primary-expression
29333 above.
29335 objc-expression:
29336 objc-message-expression
29337 objc-string-literal
29338 objc-encode-expression
29339 objc-protocol-expression
29340 objc-selector-expression
29342 Returns a tree representation of the expression. */
29344 static cp_expr
29346 {
29347 /* Try to figure out what kind of declaration is present. */
29351 {
29361 {
29373 }
29374 /* FALLTHRU */
29380 }
29383 }
29385 /* Parse an Objective-C message expression.
29387 objc-message-expression:
29388 [ objc-message-receiver objc-message-args ]
29390 Returns a representation of an Objective-C message. */
29392 static tree
29394 {
29406 /* Construct a location e.g.
29407 [self func1:5]
29408 ^~~~~~~~~~~~~~
29409 ranging from the '[' to the ']', with the caret at the start. */
29414 }
29416 /* Parse an objc-message-receiver.
29418 objc-message-receiver:
29419 expression
29420 simple-type-specifier
29422 Returns a representation of the type or expression. */
29424 static tree
29426 {
29427 tree rcv;
29429 /* An Objective-C message receiver may be either (1) a type
29430 or (2) an expression. */
29434 /* If that worked out, fine. */
29441 CP_PARSER_FLAGS_NONE);
29448 }
29450 /* Parse the arguments and selectors comprising an Objective-C message.
29452 objc-message-args:
29453 objc-selector
29454 objc-selector-args
29455 objc-selector-args , objc-comma-args
29457 objc-selector-args:
29458 objc-selector [opt] : assignment-expression
29459 objc-selector-args objc-selector [opt] : assignment-expression
29461 objc-comma-args:
29462 assignment-expression
29463 objc-comma-args , assignment-expression
29465 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29466 selector arguments and TREE_VALUE containing a list of comma
29467 arguments. */
29469 static tree
29471 {
29477 {
29483 /* Detect if we have a unary selector. */
29492 sel_args
29497 }
29499 /* Handle non-selector arguments, if any. */
29501 {
29502 tree arg;
29507 addl_args
29512 }
29515 {
29518 }
29521 }
29523 /* Parse an Objective-C encode expression.
29525 objc-encode-expression:
29526 @encode objc-typename
29528 Returns an encoded representation of the type argument. */
29530 static cp_expr
29532 {
29533 tree type;
29538 matching_parens parens;
29545 {
29549 }
29551 /* This happens if we find @encode(T) (where T is a template
29552 typename or something dependent on a template typename) when
29553 parsing a template. In that case, we can't compile it
29554 immediately, but we rather create an AT_ENCODE_EXPR which will
29555 need to be instantiated when the template is used.
29556 */
29558 {
29562 }
29565 /* Build a location of the form:
29566 @encode(int)
29567 ^~~~~~~~~~~~
29568 with caret==start at the @ token, finishing at the close paren. */
29569 location_t combined_loc
29574 }
29576 /* Parse an Objective-C @defs expression. */
29578 static tree
29580 {
29581 tree name;
29584 matching_parens parens;
29590 }
29592 /* Parse an Objective-C protocol expression.
29594 objc-protocol-expression:
29595 @protocol ( identifier )
29597 Returns a representation of the protocol expression. */
29599 static tree
29601 {
29602 tree proto;
29606 matching_parens parens;
29611 /* Build a location of the form:
29612 @protocol(prot)
29613 ^~~~~~~~~~~~~~~
29614 with caret==start at the @ token, finishing at the close paren. */
29615 location_t combined_loc
29621 }
29623 /* Parse an Objective-C selector expression.
29625 objc-selector-expression:
29626 @selector ( objc-method-signature )
29628 objc-method-signature:
29629 objc-selector
29630 objc-selector-seq
29632 objc-selector-seq:
29633 objc-selector :
29634 objc-selector-seq objc-selector :
29636 Returns a representation of the method selector. */
29638 static tree
29640 {
29647 matching_parens parens;
29653 {
29662 {
29663 /* Detect if we have a unary selector. */
29665 {
29668 }
29669 else
29670 {
29672 }
29673 }
29678 {
29679 sel_seq
29682 sel_seq
29685 }
29686 else
29687 sel_seq
29692 }
29694 finish_selector:
29698 /* Build a location of the form:
29699 @selector(func)
29700 ^~~~~~~~~~~~~~~
29701 with caret==start at the @ token, finishing at the close paren. */
29702 location_t combined_loc
29706 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29709 }
29711 /* Parse a list of identifiers.
29713 objc-identifier-list:
29714 identifier
29715 objc-identifier-list , identifier
29717 Returns a TREE_LIST of identifier nodes. */
29719 static tree
29721 {
29722 tree identifier;
29723 tree list;
29734 {
29741 identifier));
29743 }
29746 }
29748 /* Parse an Objective-C alias declaration.
29750 objc-alias-declaration:
29751 @compatibility_alias identifier identifier ;
29753 This function registers the alias mapping with the Objective-C front end.
29754 It returns nothing. */
29756 static void
29758 {
29766 }
29768 /* Parse an Objective-C class forward-declaration.
29770 objc-class-declaration:
29771 @class objc-identifier-list ;
29773 The function registers the forward declarations with the Objective-C
29774 front end. It returns nothing. */
29776 static void
29778 {
29781 {
29782 tree id;
29792 else
29794 }
29796 }
29798 /* Parse a list of Objective-C protocol references.
29800 objc-protocol-refs-opt:
29801 objc-protocol-refs [opt]
29803 objc-protocol-refs:
29804 < objc-identifier-list >
29806 Returns a TREE_LIST of identifiers, if any. */
29808 static tree
29810 {
29814 {
29818 }
29821 }
29823 /* Parse a Objective-C visibility specification. */
29825 static void
29827 {
29831 {
29846 }
29848 /* Eat '@private'/'@protected'/'@public'. */
29850 }
29852 /* Parse an Objective-C method type. Return 'true' if it is a class
29853 (+) method, and 'false' if it is an instance (-) method. */
29857 {
29860 else
29862 }
29864 /* Parse an Objective-C protocol qualifier. */
29866 static tree
29868 {
29881 {
29886 }
29889 }
29891 /* Parse an Objective-C typename. */
29893 static tree
29895 {
29899 {
29902 matching_parens parens;
29906 /* An ObjC type name may consist of just protocol qualifiers, in which
29907 case the type shall default to 'id'. */
29909 {
29912 /* If the type could not be parsed, an error has already
29913 been produced. For error recovery, behave as if it had
29914 not been specified, which will use the default type
29915 'id'. */
29917 {
29919 /* We need to skip to the closing parenthesis as
29920 cp_parser_type_id() does not seem to do it for
29921 us. */
29926 }
29927 }
29931 }
29934 }
29936 /* Check to see if TYPE refers to an Objective-C selector name. */
29938 static bool
29940 {
29946 }
29948 /* Parse an Objective-C selector. */
29950 static tree
29952 {
29956 {
29959 }
29961 /* C++ operator names are allowed to appear in ObjC selectors. */
29963 {
29976 }
29977 }
29979 /* Parse an Objective-C params list. */
29981 static tree
29983 {
29989 {
29999 /* Detect if we have a unary selector. */
30002 {
30005 }
30009 {
30010 /* Something went quite wrong. There should be a colon
30011 here, but there is not. Stop parsing parameters. */
30013 }
30015 /* New ObjC allows attributes on parameters too. */
30020 params
30023 type_name,
30024 identifier,
30025 parm_attr));
30028 }
30031 {
30034 }
30036 /* We allow tail attributes for the method. */
30038 {
30046 }
30049 {
30052 }
30054 }
30056 /* Parse the non-keyword Objective-C params. */
30058 static tree
30061 {
30067 {
30069 tree parm;
30075 {
30080 }
30082 /* TODO: parse attributes for tail parameters. */
30091 }
30093 /* We allow tail attributes for the method. */
30095 {
30097 {
30102 }
30103 else
30104 /* We have an error, but parse the attributes, so that we can
30105 carry on. */
30111 }
30114 }
30116 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30118 static void
30120 {
30123 /* If the next token is `extern' and the following token is a string
30124 literal, then we have a linkage specification. */
30126 && cp_parser_is_pure_string_literal
30129 /* Handle #pragma, if any. */
30132 /* Allow stray semicolons. */
30135 /* Mark methods as optional or required, when building protocols. */
30137 {
30140 }
30142 {
30145 }
30148 /* Other stray characters must generate errors. */
30150 {
30154 }
30155 /* Finally, try to parse a block-declaration, or a function-definition. */
30156 else
30158 }
30160 /* Parse a method signature. */
30162 static tree
30164 {
30180 }
30182 static bool
30184 {
30185 tree tattr;
30190 /* If the attributes are followed by a method introducer, this is not allowed.
30191 Dump the attributes and flag the situation. */
30196 /* Otherwise, the attributes introduce some interstitial code, possibly so
30197 rewind to allow that check. */
30200 }
30202 /* Parse an Objective-C method prototype list. */
30204 static void
30206 {
30210 {
30212 {
30217 else
30221 {
30225 }
30228 }
30234 OPT_Wattributes,
30236 else
30237 /* Allow for interspersed non-ObjC++ code. */
30241 }
30245 else
30249 }
30251 /* Parse an Objective-C method definition list. */
30253 static void
30255 {
30259 {
30260 tree meth;
30263 {
30269 else
30274 {
30278 }
30280 NULL_TREE);
30282 /* For historical reasons, we accept an optional semicolon. */
30289 {
30296 }
30297 }
30298 /* The following case will be removed once @synthesize is
30299 completely implemented. */
30310 else
30311 /* Allow for interspersed non-ObjC++ code. */
30315 }
30319 else
30323 }
30325 /* Parse Objective-C ivars. */
30327 static void
30329 {
30340 {
30341 cp_decl_specifier_seq declspecs;
30343 tree prefix_attributes;
30351 CP_PARSER_FLAGS_OPTIONAL,
30355 /* auto, register, static, extern, mutable. */
30357 {
30360 }
30362 /* thread_local. */
30364 {
30367 }
30369 /* typedef. */
30371 {
30374 }
30379 /* Keep going until we hit the `;' at the end of the
30380 declaration. */
30382 {
30387 /* Check for a (possibly unnamed) bitfield declaration. */
30395 {
30396 /* Get the name of the bitfield. */
30399 sfk_none);
30401 eat_colon:
30403 /* Get the width of the bitfield. */
30404 width
30406 }
30407 else
30408 {
30409 /* Parse the declarator. */
30410 declarator
30416 }
30418 /* Look for attributes that apply to the ivar. */
30420 /* Remember which attributes are prefix attributes and
30421 which are not. */
30423 /* Combine the attributes. */
30427 /* Create the bitfield declaration. */
30430 else
30435 /* Add the instance variable. */
30439 /* Reset PREFIX_ATTRIBUTES. */
30441 {
30446 }
30451 {
30454 }
30456 }
30460 }
30465 /* Do not consume the RID_AT_END, so it will be read again as terminating
30466 the @interface of @implementation. */
30470 /* For historical reasons, we accept an optional semicolon. */
30473 }
30475 /* Parse an Objective-C protocol declaration. */
30477 static void
30479 {
30485 {
30490 }
30492 /* See if we have a forward declaration or a definition. */
30495 /* Try a forward declaration first. */
30497 {
30499 {
30500 tree id;
30510 else
30512 }
30514 }
30516 /* Ok, we got a full-fledged definition (or at least should). */
30517 else
30518 {
30523 }
30524 }
30526 /* Parse an Objective-C superclass or category. */
30528 static void
30533 {
30539 {
30542 }
30544 {
30545 matching_parens parens;
30548 /* If there is no category name, and this is an @interface, we
30549 have a class extension. */
30551 {
30554 }
30555 else
30559 }
30560 }
30562 /* Parse an Objective-C class interface. */
30564 static void
30566 {
30573 {
30574 /* It's hard to recover because even if valid @interface stuff
30575 is to follow, we can't compile it (or validate it) if we
30576 don't even know which class it refers to. Let's assume this
30577 was a stray '@interface' token in the stream and skip it.
30578 */
30580 }
30585 /* We have either a class or a category on our hands. */
30588 else
30589 {
30591 /* Handle instance variable declarations, if any. */
30594 }
30597 }
30599 /* Parse an Objective-C class implementation. */
30601 static void
30603 {
30610 {
30611 /* It's hard to recover because even if valid @implementation
30612 stuff is to follow, we can't compile it (or validate it) if
30613 we don't even know which class it refers to. Let's assume
30614 this was a stray '@implementation' token in the stream and
30615 skip it.
30616 */
30618 }
30622 /* We have either a class or a category on our hands. */
30625 else
30626 {
30628 /* Handle instance variable declarations, if any. */
30631 }
30634 }
30636 /* Consume the @end token and finish off the implementation. */
30638 static void
30640 {
30643 }
30645 /* Parse an Objective-C declaration. */
30647 static void
30649 {
30650 /* Try to figure out what kind of declaration is present. */
30655 {
30671 }
30674 {
30697 }
30698 }
30700 /* Parse an Objective-C try-catch-finally statement.
30702 objc-try-catch-finally-stmt:
30703 @try compound-statement objc-catch-clause-seq [opt]
30704 objc-finally-clause [opt]
30706 objc-catch-clause-seq:
30707 objc-catch-clause objc-catch-clause-seq [opt]
30709 objc-catch-clause:
30710 @catch ( objc-exception-declaration ) compound-statement
30712 objc-finally-clause:
30713 @finally compound-statement
30715 objc-exception-declaration:
30716 parameter-declaration
30717 '...'
30719 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30721 Returns NULL_TREE.
30723 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30724 for C. Keep them in sync. */
30726 static tree
30728 {
30729 location_t location;
30730 tree stmt;
30735 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30736 node, lest it get absorbed into the surrounding block. */
30742 {
30746 matching_parens parens;
30752 {
30753 /* We have "@catch (...)" (where the '...' are literally
30754 what is in the code). Skip the '...'.
30755 parameter_declaration is set to NULL_TREE, and
30756 objc_being_catch_clauses() knows that that means
30757 '...'. */
30760 }
30761 else
30762 {
30763 /* We have "@catch (NSException *exception)" or something
30764 like that. Parse the parameter declaration. */
30768 else
30773 }
30776 else
30777 {
30778 /* If there was no open parenthesis, we are recovering from
30779 an error, and we are trying to figure out what mistake
30780 the user has made. */
30782 /* If there is an immediate closing parenthesis, the user
30783 probably forgot the opening one (ie, they typed "@catch
30784 NSException *e)". Parse the closing parenthesis and keep
30785 going. */
30789 /* If these is no immediate closing parenthesis, the user
30790 probably doesn't know that parenthesis are required at
30791 all (ie, they typed "@catch NSException *e"). So, just
30792 forget about the closing parenthesis and keep going. */
30793 }
30797 }
30799 {
30802 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30803 node, lest it get absorbed into the surrounding block. */
30807 }
30810 }
30812 /* Parse an Objective-C synchronized statement.
30814 objc-synchronized-stmt:
30815 @synchronized ( expression ) compound-statement
30817 Returns NULL_TREE. */
30819 static tree
30821 {
30822 location_t location;
30829 matching_parens parens;
30834 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30835 node, lest it get absorbed into the surrounding block. */
30840 }
30842 /* Parse an Objective-C throw statement.
30844 objc-throw-stmt:
30845 @throw assignment-expression [opt] ;
30847 Returns a constructed '@throw' statement. */
30849 static tree
30851 {
30863 }
30865 /* Parse an Objective-C statement. */
30867 static tree
30869 {
30870 /* Try to figure out what kind of declaration is present. */
30874 {
30885 }
30888 }
30890 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30891 look ahead to see if an objc keyword follows the attributes. This
30892 is to detect the use of prefix attributes on ObjC @interface and
30893 @protocol. */
30895 static bool
30897 {
30902 {
30905 }
30908 }
30910 /* This routine is a minimal replacement for
30911 c_parser_struct_declaration () used when parsing the list of
30912 types/names or ObjC++ properties. For example, when parsing the
30913 code
30915 @property (readonly) int a, b, c;
30917 this function is responsible for parsing "int a, int b, int c" and
30918 returning the declarations as CHAIN of DECLs.
30920 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30921 similar parsing. */
30922 static tree
30924 {
30926 cp_decl_specifier_seq declspecs;
30928 tree prefix_attributes;
30931 CP_PARSER_FLAGS_NONE,
30938 /* auto, register, static, extern, mutable. */
30940 {
30943 }
30945 /* thread_local. */
30947 {
30950 }
30952 /* typedef. */
30954 {
30957 }
30962 /* Keep going until we hit the `;' at the end of the declaration. */
30964 {
30969 /* Parse the declarator. */
30973 /* Look for attributes that apply to the ivar. */
30975 /* Remember which attributes are prefix attributes and
30976 which are not. */
30978 /* Combine the attributes. */
30988 /* Reset PREFIX_ATTRIBUTES. */
30990 {
30995 }
31002 {
31005 }
31006 else
31008 }
31010 }
31012 /* Parse an Objective-C @property declaration. The syntax is:
31014 objc-property-declaration:
31015 '@property' objc-property-attributes[opt] struct-declaration ;
31017 objc-property-attributes:
31018 '(' objc-property-attribute-list ')'
31020 objc-property-attribute-list:
31021 objc-property-attribute
31022 objc-property-attribute-list, objc-property-attribute
31024 objc-property-attribute
31025 'getter' = identifier
31026 'setter' = identifier
31027 'readonly'
31028 'readwrite'
31029 'assign'
31030 'retain'
31031 'copy'
31032 'nonatomic'
31034 For example:
31035 @property NSString *name;
31036 @property (readonly) id object;
31037 @property (retain, nonatomic, getter=getTheName) id name;
31038 @property int a, b, c;
31040 PS: This function is identical to
31041 c_parser_objc_at_property_declaration for C. Keep them in sync. */
31042 static void
31044 {
31045 /* The following variables hold the attributes of the properties as
31046 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
31047 seen. When we see an attribute, we set them to 'true' (if they
31048 are boolean properties) or to the identifier (if they have an
31049 argument, ie, for getter and setter). Note that here we only
31050 parse the list of attributes, check the syntax and accumulate the
31051 attributes that we find. objc_add_property_declaration() will
31052 then process the information. */
31062 /* 'properties' is the list of properties that we read. Usually a
31063 single one, but maybe more (eg, in "@property int a, b, c;" there
31064 are three). */
31065 tree properties;
31066 location_t loc;
31072 /* Parse the optional attribute list... */
31074 {
31075 /* Eat the '('. */
31076 matching_parens parens;
31080 {
31086 {
31089 }
31093 {
31104 {
31108 else
31113 }
31116 {
31120 }
31122 {
31124 {
31127 }
31128 else
31132 else
31134 }
31135 else
31136 {
31138 {
31141 }
31142 else
31144 }
31150 }
31157 else
31159 }
31161 /* FIXME: "@property (setter, assign);" will generate a spurious
31162 "error: expected ‘)’ before ‘,’ token". This is because
31163 cp_parser_require, unlike the C counterpart, will produce an
31164 error even if we are in error recovery. */
31166 {
31171 }
31172 }
31174 /* ... and the property declaration(s). */
31178 {
31180 /* If the next token is now a `;', consume it. */
31184 }
31188 else
31189 {
31190 /* Comma-separated properties are chained together in
31191 reverse order; add them one by one. */
31200 }
31203 }
31205 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31207 objc-synthesize-declaration:
31208 @synthesize objc-synthesize-identifier-list ;
31210 objc-synthesize-identifier-list:
31211 objc-synthesize-identifier
31212 objc-synthesize-identifier-list, objc-synthesize-identifier
31214 objc-synthesize-identifier
31215 identifier
31216 identifier = identifier
31218 For example:
31219 @synthesize MyProperty;
31220 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31222 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31223 for C. Keep them in sync.
31224 */
31225 static void
31227 {
31229 location_t loc;
31234 {
31238 {
31241 }
31243 {
31247 {
31250 }
31251 }
31252 else
31257 else
31259 }
31262 }
31264 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31266 objc-dynamic-declaration:
31267 @dynamic identifier-list ;
31269 For example:
31270 @dynamic MyProperty;
31271 @dynamic MyProperty, AnotherProperty;
31273 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31274 for C. Keep them in sync.
31275 */
31276 static void
31278 {
31280 location_t loc;
31285 {
31286 tree property;
31289 {
31292 }
31296 else
31298 }
31301 }
31303 \f
31304 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31306 /* Returns name of the next clause.
31307 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31308 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31309 returned and the token is consumed. */
31311 static pragma_omp_clause
31313 {
31329 {
31334 {
31511 }
31512 }
31518 }
31520 /* Validate that a clause of the given type does not already exist. */
31522 static void
31525 {
31526 tree c;
31530 {
31533 }
31534 }
31536 /* OpenMP 2.5:
31537 variable-list:
31538 identifier
31539 variable-list , identifier
31541 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31542 colon). An opening parenthesis will have been consumed by the caller.
31544 If KIND is nonzero, create the appropriate node and install the decl
31545 in OMP_CLAUSE_DECL and add the node to the head of the list.
31547 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31548 return the list created.
31550 COLON can be NULL if only closing parenthesis should end the list,
31551 or pointer to bool which will receive false if the list is terminated
31552 by closing parenthesis or true if the list is terminated by colon. */
31554 static tree
31557 {
31561 {
31564 }
31566 {
31571 && current_class_ptr
31573 {
31579 }
31580 else
31581 {
31592 else
31597 }
31599 ;
31601 {
31603 {
31605 /* The OpenACC cache directive explicitly only allows "array
31606 elements or subarrays". */
31608 {
31612 }
31613 /* FALLTHROUGH. */
31618 {
31619 location_t loc
31624 decl
31628 }
31629 /* FALLTHROUGH. */
31633 {
31641 parser->colon_corrects_to_scope_p
31645 else
31646 {
31647 /* Look for `:'. */
31651 CPP_CLOSE_SQUARE))
31653 }
31654 /* Look for the closing `]'. */
31656 RT_CLOSE_SQUARE))
31660 }
31664 }
31670 }
31671 else
31674 get_comma:
31678 }
31684 {
31688 }
31691 {
31694 /* Try to resync to an unnested comma. Copied from
31695 cp_parser_parenthesized_expression_list. */
31696 skip_comma:
31705 }
31708 }
31710 /* Similarly, but expect leading and trailing parenthesis. This is a very
31711 common case for omp clauses. */
31713 static tree
31715 {
31719 }
31721 /* OpenACC 2.0:
31722 copy ( variable-list )
31723 copyin ( variable-list )
31724 copyout ( variable-list )
31725 create ( variable-list )
31726 delete ( variable-list )
31727 present ( variable-list )
31728 present_or_copy ( variable-list )
31729 pcopy ( variable-list )
31730 present_or_copyin ( variable-list )
31731 pcopyin ( variable-list )
31732 present_or_copyout ( variable-list )
31733 pcopyout ( variable-list )
31734 present_or_create ( variable-list )
31735 pcreate ( variable-list ) */
31737 static tree
31739 tree list)
31740 {
31743 {
31789 }
31797 }
31799 /* OpenACC 2.0:
31800 deviceptr ( variable-list ) */
31802 static tree
31804 {
31808 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31809 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31810 variable-list must only allow for pointer variables. */
31813 {
31820 }
31823 }
31825 /* OpenACC 2.0:
31826 auto
31827 independent
31828 nohost
31829 seq */
31831 static tree
31835 {
31840 }
31842 /* OpenACC:
31843 num_gangs ( expression )
31844 num_workers ( expression )
31845 vector_length ( expression ) */
31847 static tree
31850 {
31853 matching_parens parens;
31861 {
31866 }
31874 }
31876 /* OpenACC:
31878 gang [( gang-arg-list )]
31879 worker [( [num:] int-expr )]
31880 vector [( [length:] int-expr )]
31882 where gang-arg is one of:
31884 [num:] int-expr
31885 static: size-expr
31887 and size-expr may be:
31889 *
31890 int-expr
31891 */
31893 static tree
31896 {
31906 {
31907 matching_parens parens;
31910 do
31911 {
31915 /* Gang static argument. */
31918 {
31926 {
31929 }
31931 /* Check for the '*' argument. */
31935 CPP_CLOSE_PAREN)))
31936 {
31941 {
31944 }
31946 }
31947 }
31948 /* Worker num: argument and vector length: arguments. */
31952 {
31955 }
31957 /* Now collect the actual argument. */
31959 {
31962 }
31974 {
31977 }
31979 }
31984 }
31998 cleanup_error:
32001 }
32003 /* OpenACC 2.0:
32004 tile ( size-expr-list ) */
32006 static tree
32008 {
32012 /* Collapse and tile are mutually exclusive. (The spec doesn't say
32013 so, but the spec authors never considered such a case and have
32014 differing opinions on what it might mean, including 'not
32015 allowed'.) */
32018 clause_loc);
32023 do
32024 {
32031 {
32034 }
32035 else
32039 }
32042 /* Consume the trailing ')'. */
32050 }
32052 /* OpenACC 2.0
32053 Parse wait clause or directive parameters. */
32055 static tree
32057 {
32067 {
32072 }
32079 {
32083 {
32086 else
32087 {
32094 }
32095 }
32096 }
32099 }
32101 /* OpenACC:
32102 wait ( int-expr-list ) */
32104 static tree
32106 {
32115 }
32117 /* OpenMP 3.0:
32118 collapse ( constant-expression ) */
32120 static tree
32122 {
32124 location_t loc;
32125 HOST_WIDE_INT n;
32128 matching_parens parens;
32146 {
32149 }
32158 }
32160 /* OpenMP 2.5:
32161 default ( none | shared )
32163 OpenACC:
32164 default ( none | present ) */
32166 static tree
32169 {
32171 tree c;
32173 matching_parens parens;
32177 {
32182 {
32203 }
32206 }
32207 else
32208 {
32209 invalid_kind:
32212 else
32214 }
32231 }
32233 /* OpenMP 3.1:
32234 final ( expression ) */
32236 static tree
32238 {
32241 matching_parens parens;
32260 }
32262 /* OpenMP 2.5:
32263 if ( expression )
32265 OpenMP 4.5:
32266 if ( directive-name-modifier : expression )
32268 directive-name-modifier:
32269 parallel | task | taskloop | target data | target | target update
32270 | target enter data | target exit data */
32272 static tree
32275 {
32279 matching_parens parens;
32284 {
32296 {
32299 {
32312 else
32313 {
32314 location_t loc
32319 }
32322 {
32324 {
32329 }
32331 {
32332 location_t loc
32336 }
32337 }
32338 }
32339 }
32341 {
32343 {
32346 }
32347 else
32348 {
32350 {
32351 location_t loc
32354 }
32356 }
32357 }
32358 }
32370 {
32373 {
32376 {
32386 }
32388 p);
32390 }
32392 {
32395 else
32398 }
32401 {
32405 }
32406 }
32414 }
32416 /* OpenMP 3.1:
32417 mergeable */
32419 static tree
32422 {
32423 tree c;
32426 location);
32431 }
32433 /* OpenMP 2.5:
32434 nowait */
32436 static tree
32439 {
32440 tree c;
32447 }
32449 /* OpenMP 2.5:
32450 num_threads ( expression ) */
32452 static tree
32454 location_t location)
32455 {
32458 matching_parens parens;
32478 }
32480 /* OpenMP 4.5:
32481 num_tasks ( expression ) */
32483 static tree
32485 location_t location)
32486 {
32489 matching_parens parens;
32509 }
32511 /* OpenMP 4.5:
32512 grainsize ( expression ) */
32514 static tree
32516 location_t location)
32517 {
32520 matching_parens parens;
32540 }
32542 /* OpenMP 4.5:
32543 priority ( expression ) */
32545 static tree
32547 location_t location)
32548 {
32551 matching_parens parens;
32571 }
32573 /* OpenMP 4.5:
32574 hint ( expression ) */
32576 static tree
32578 location_t location)
32579 {
32582 matching_parens parens;
32601 }
32603 /* OpenMP 4.5:
32604 defaultmap ( tofrom : scalar ) */
32606 static tree
32608 location_t location)
32609 {
32613 matching_parens parens;
32618 {
32621 }
32625 {
32628 }
32634 {
32637 }
32641 {
32644 }
32650 location);
32656 out_err:
32661 }
32663 /* OpenMP 2.5:
32664 ordered
32666 OpenMP 4.5:
32667 ordered ( constant-expression ) */
32669 static tree
32672 {
32674 HOST_WIDE_INT n;
32680 {
32681 matching_parens parens;
32698 {
32700 "ordered argument needs positive constant integer "
32703 }
32704 }
32710 }
32712 /* OpenMP 2.5:
32713 reduction ( reduction-operator : variable-list )
32715 reduction-operator:
32716 One of: + * - & ^ | && ||
32718 OpenMP 3.1:
32720 reduction-operator:
32721 One of: + * - & ^ | && || min max
32723 OpenMP 4.0:
32725 reduction-operator:
32726 One of: + * - & ^ | && ||
32727 id-expression */
32729 static tree
32731 {
32739 {
32749 }
32753 else
32754 {
32765 {
32795 }
32796 else
32797 {
32799 resync_fail:
32804 }
32805 }
32811 NULL);
32813 {
32816 }
32819 }
32821 /* OpenMP 2.5:
32822 schedule ( schedule-kind )
32823 schedule ( schedule-kind , expression )
32825 schedule-kind:
32826 static | dynamic | guided | runtime | auto
32828 OpenMP 4.5:
32829 schedule ( schedule-modifier : schedule-kind )
32830 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32832 schedule-modifier:
32833 simd
32834 monotonic
32835 nonmonotonic */
32837 static tree
32839 {
32843 matching_parens parens;
32850 {
32859 else
32865 else
32866 {
32869 }
32870 }
32873 {
32878 {
32899 }
32900 }
32905 else
32911 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32913 {
32917 }
32920 {
32935 else
32940 }
32952 invalid_kind:
32954 resync_fail:
32959 }
32961 /* OpenMP 3.0:
32962 untied */
32964 static tree
32967 {
32968 tree c;
32975 }
32977 /* OpenMP 4.0:
32978 inbranch
32979 notinbranch */
32981 static tree
32984 {
32989 }
32991 /* OpenMP 4.0:
32992 parallel
32993 for
32994 sections
32995 taskgroup */
32997 static tree
33001 {
33005 }
33007 /* OpenMP 4.5:
33008 nogroup */
33010 static tree
33013 {
33018 }
33020 /* OpenMP 4.5:
33021 simd
33022 threads */
33024 static tree
33028 {
33033 }
33035 /* OpenMP 4.0:
33036 num_teams ( expression ) */
33038 static tree
33040 location_t location)
33041 {
33044 matching_parens parens;
33064 }
33066 /* OpenMP 4.0:
33067 thread_limit ( expression ) */
33069 static tree
33071 location_t location)
33072 {
33075 matching_parens parens;
33095 }
33097 /* OpenMP 4.0:
33098 aligned ( variable-list )
33099 aligned ( variable-list : constant-expression ) */
33101 static tree
33103 {
33107 matching_parens parens;
33115 {
33125 }
33131 }
33133 /* OpenMP 4.0:
33134 linear ( variable-list )
33135 linear ( variable-list : expression )
33137 OpenMP 4.5:
33138 linear ( modifier ( variable-list ) )
33139 linear ( modifier ( variable-list ) : expression ) */
33141 static tree
33144 {
33149 matching_parens parens;
33154 {
33166 else
33168 }
33173 else
33174 {
33183 }
33186 {
33191 {
33202 {
33205 }
33208 }
33219 }
33222 {
33225 }
33228 }
33230 /* OpenMP 4.0:
33231 safelen ( constant-expression ) */
33233 static tree
33235 location_t location)
33236 {
33239 matching_parens parens;
33258 }
33260 /* OpenMP 4.0:
33261 simdlen ( constant-expression ) */
33263 static tree
33265 location_t location)
33266 {
33269 matching_parens parens;
33288 }
33290 /* OpenMP 4.5:
33291 vec:
33292 identifier [+/- integer]
33293 vec , identifier [+/- integer]
33294 */
33296 static tree
33298 tree list)
33299 {
33303 {
33306 }
33309 {
33316 else
33317 {
33318 t = cp_parser_lookup_name_simple
33323 id_loc);
33324 }
33330 {
33333 }
33337 {
33340 }
33344 {
33347 }
33350 add_to_vector:
33352 {
33356 }
33362 }
33365 {
33371 }
33373 }
33375 /* OpenMP 4.0:
33376 depend ( depend-kind : variable-list )
33378 depend-kind:
33379 in | out | inout
33381 OpenMP 4.5:
33382 depend ( source )
33384 depend ( sink : vec ) */
33386 static tree
33388 {
33392 matching_parens parens;
33397 {
33411 else
33413 }
33414 else
33420 {
33430 }
33437 else
33438 {
33444 }
33447 invalid_kind:
33449 resync_fail:
33454 }
33456 /* OpenMP 4.0:
33457 map ( map-kind : variable-list )
33458 map ( variable-list )
33460 map-kind:
33461 alloc | to | from | tofrom
33463 OpenMP 4.5:
33464 map-kind:
33465 alloc | to | from | tofrom | release | delete
33467 map ( always [,] map-kind: variable-list ) */
33469 static tree
33471 {
33480 {
33485 {
33488 nth++;
33494 {
33499 }
33500 }
33501 }
33505 {
33519 else
33520 {
33526 }
33529 }
33532 {
33536 }
33539 NULL);
33545 }
33547 /* OpenMP 4.0:
33548 device ( expression ) */
33550 static tree
33552 location_t location)
33553 {
33556 matching_parens parens;
33576 }
33578 /* OpenMP 4.0:
33579 dist_schedule ( static )
33580 dist_schedule ( static , expression ) */
33582 static tree
33584 location_t location)
33585 {
33588 matching_parens parens;
33599 {
33610 }
33615 location);
33619 invalid_kind:
33621 resync_fail:
33626 }
33628 /* OpenMP 4.0:
33629 proc_bind ( proc-bind-kind )
33631 proc-bind-kind:
33632 master | close | spread */
33634 static tree
33636 location_t location)
33637 {
33638 tree c;
33645 {
33655 else
33657 }
33658 else
33667 location);
33672 invalid_kind:
33674 resync_fail:
33679 }
33681 /* OpenACC:
33682 async [( int-expr )] */
33684 static tree
33686 {
33693 {
33694 matching_parens parens;
33703 }
33713 }
33715 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33716 is a bitmask in MASK. Return the list of clauses found. */
33718 static tree
33722 {
33727 {
33728 location_t here;
33729 pragma_omp_clause c_kind;
33730 omp_clause_code code;
33741 {
33793 clauses);
33811 OMP_CLAUSE_INDEPENDENT,
33823 clauses);
33829 clauses);
33853 clauses);
33875 clauses);
33887 clauses);
33901 }
33906 {
33907 /* Remove the invalid clause(s) from the list to avoid
33908 confusing the rest of the compiler. */
33911 }
33912 }
33914 saw_error:
33921 }
33923 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33924 is a bitmask in MASK. Return the list of clauses found; the result
33925 of clause default goes in *pdefault. */
33927 static tree
33931 {
33937 {
33938 pragma_omp_clause c_kind;
33949 {
33961 clauses);
33975 clauses);
33995 clauses);
34000 clauses);
34010 clauses);
34044 clauses);
34058 clauses);
34073 OMP_CLAUSE_NOTINBRANCH,
34082 {
34083 clause_not_first:
34087 }
34117 clauses);
34118 else
34128 clauses);
34146 {
34151 }
34194 clauses
34200 clauses
34208 }
34213 {
34214 /* Remove the invalid clause(s) from the list to avoid
34215 confusing the rest of the compiler. */
34218 }
34219 }
34220 saw_error:
34223 {
34226 else
34228 }
34230 }
34232 /* OpenMP 2.5:
34233 structured-block:
34234 statement
34236 In practice, we're also interested in adding the statement to an
34237 outer node. So it is convenient if we work around the fact that
34238 cp_parser_statement calls add_stmt. */
34240 static unsigned
34242 {
34245 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34246 This preserves the "not within loop or switch" style error messages
34247 for nonsense cases like
34248 void foo() {
34249 #pragma omp single
34250 break;
34251 }
34252 */
34257 }
34259 static void
34261 {
34263 }
34265 static tree
34267 {
34275 }
34277 /* OpenMP 2.5:
34278 # pragma omp atomic new-line
34279 expression-stmt
34281 expression-stmt:
34282 x binop= expr | x++ | ++x | x-- | --x
34283 binop:
34284 +, *, -, /, &, ^, |, <<, >>
34286 where x is an lvalue expression with scalar type.
34288 OpenMP 3.1:
34289 # pragma omp atomic new-line
34290 update-stmt
34292 # pragma omp atomic read new-line
34293 read-stmt
34295 # pragma omp atomic write new-line
34296 write-stmt
34298 # pragma omp atomic update new-line
34299 update-stmt
34301 # pragma omp atomic capture new-line
34302 capture-stmt
34304 # pragma omp atomic capture new-line
34305 capture-block
34307 read-stmt:
34308 v = x
34309 write-stmt:
34310 x = expr
34311 update-stmt:
34312 expression-stmt | x = x binop expr
34313 capture-stmt:
34314 v = expression-stmt
34315 capture-block:
34316 { v = x; update-stmt; } | { update-stmt; v = x; }
34318 OpenMP 4.0:
34319 update-stmt:
34320 expression-stmt | x = x binop expr | x = expr binop x
34321 capture-stmt:
34322 v = update-stmt
34323 capture-block:
34324 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34326 where x and v are lvalue expressions with scalar type. */
34328 static void
34330 {
34338 {
34343 {
34349 }
34350 }
34352 {
34364 else
34368 }
34370 {
34376 {
34381 {
34384 }
34385 }
34386 }
34390 {
34400 else
34405 {
34406 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34407 opcode. */
34412 }
34416 {
34419 }
34420 else
34421 {
34427 }
34430 }
34432 restart:
34436 {
34443 /* FALLTHROUGH */
34453 /* FALLTHROUGH */
34468 /* Undo effects of boolean_increment for post {in,de}crement. */
34470 /* FALLTHRU */
34474 {
34475 /* Undo effects of boolean_increment. */
34477 {
34478 /* This is pre or post increment. */
34483 && !structured_block
34487 }
34488 }
34489 /* FALLTHRU */
34492 {
34527 {
34531 }
34534 {
34540 {
34545 }
34547 {
34559 {
34561 {
34566 }
34567 else
34569 }
34573 }
34576 {
34583 }
34587 }
34591 {
34594 {
34602 }
34604 {
34609 }
34644 }
34655 /* FALLTHROUGH */
34660 }
34667 }
34668 stmt_done:
34670 {
34681 }
34683 {
34686 }
34687 done:
34693 saw_error:
34696 {
34700 {
34704 }
34705 }
34706 }
34709 /* OpenMP 2.5:
34710 # pragma omp barrier new-line */
34712 static void
34714 {
34717 }
34719 /* OpenMP 2.5:
34720 # pragma omp critical [(name)] new-line
34721 structured-block
34723 OpenMP 4.5:
34724 # pragma omp critical [(name) [hint(expression)]] new-line
34725 structured-block */
34727 #define OMP_CRITICAL_CLAUSE_MASK \
34728 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34730 static tree
34732 {
34736 {
34737 matching_parens parens;
34751 OMP_CRITICAL_CLAUSE_MASK,
34753 }
34754 else
34759 }
34761 /* OpenMP 2.5:
34762 # pragma omp flush flush-vars[opt] new-line
34764 flush-vars:
34765 ( variable-list ) */
34767 static void
34769 {
34775 }
34777 /* Helper function, to parse omp for increment expression. */
34779 static tree
34781 {
34786 {
34789 }
34792 {
34799 /* Fall through: OpenMP disallows NE_EXPR. */
34803 }
34805 /* If decl is an iterator, preserve LHS and RHS of the relational
34806 expr until finish_omp_for. */
34817 }
34819 /* Helper function, to parse omp for increment expression. */
34821 static tree
34823 {
34827 cp_id_kind idk;
34831 {
34840 }
34849 {
34854 }
34861 {
34865 }
34878 do
34879 {
34886 {
34888 {
34891 else
34893 tf_warning_or_error);
34894 }
34895 else
34898 }
34899 }
34903 {
34909 }
34910 else
34914 }
34916 /* Parse the initialization statement of an OpenMP for loop.
34918 Return true if the resulting construct should have an
34919 OMP_CLAUSE_PRIVATE added to it. */
34921 static tree
34929 {
34935 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34937 init-expr:
34938 var = lb
34939 integer-type var = lb
34940 random-access-iterator-type var = lb
34941 pointer-type var = lb
34942 */
34943 cp_decl_specifier_seq type_specifiers;
34945 /* First, try to parse as an initialized declaration. See
34946 cp_parser_condition, from whence the bulk of this is copied. */
34953 {
34954 /* If parsing a type specifier seq succeeded, then this
34955 MUST be a initialized declaration. */
34960 CP_PARSER_DECLARATOR_NAMED,
34971 else
34972 {
34982 {
34984 CPP_OPEN_PAREN))
34987 else
34988 /* Trigger an error. */
34993 }
34997 {
35005 {
35008 auto_node);
35013 }
35016 asm_specification,
35017 LOOKUP_ONLYCONVERTING);
35020 {
35023 }
35024 else
35025 {
35028 {
35030 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
35032 {
35036 {
35040 }
35042 }
35044 {
35049 }
35050 }
35051 }
35053 }
35054 else
35055 {
35056 /* Consume '='. */
35060 non_class:
35063 else
35066 asm_specification,
35067 LOOKUP_ONLYCONVERTING);
35068 }
35072 }
35073 }
35074 else
35075 {
35076 cp_id_kind idk;
35077 /* If parsing a type specifier sequence failed, then
35078 this MUST be a simple expression. */
35084 && decl
35087 {
35098 {
35103 }
35108 }
35110 && decl
35113 {
35114 tree rhs;
35122 rhs,
35123 tf_warning_or_error));
35126 }
35127 else
35128 {
35133 {
35137 }
35138 }
35139 }
35141 }
35143 /* Parse the restricted form of the for statement allowed by OpenMP. */
35145 static tree
35148 {
35152 location_t loc_first;
35163 {
35166 }
35169 {
35172 }
35175 {
35181 }
35183 {
35186 {
35188 "%<linear%> clause may not be specified together "
35191 }
35192 else
35194 }
35207 {
35210 location_t loc;
35213 {
35217 }
35220 matching_parens parens;
35227 add_private_clause
35233 {
35236 {
35242 }
35243 else
35245 }
35252 {
35257 {
35261 }
35264 {
35265 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35269 {
35272 }
35273 else
35274 {
35277 }
35279 }
35280 else
35281 {
35286 }
35287 }
35290 {
35291 tree c;
35293 {
35302 decl);
35306 decl);
35307 }
35309 {
35314 else
35319 {
35322 /* For linear, signal that we need to fill up
35323 the so far unknown linear step. */
35326 }
35327 }
35328 }
35337 {
35338 /* If decl is an iterator, preserve the operator on decl
35339 until finish_omp_for. */
35341 && ((processing_template_decl
35346 else
35350 }
35362 {
35365 }
35370 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35371 in between the collapsed for loops to be still considered perfectly
35372 nested. Hopefully the final version clarifies this.
35373 For now handle (multiple) {'s and empty statements. */
35376 {
35380 {
35382 bracecount++;
35383 }
35387 else
35388 {
35395 }
35396 }
35399 {
35402 }
35403 }
35408 /* Note that we saved the original contents of this flag when we entered
35409 the structured block, and so we don't need to re-save it here. */
35412 /* Note that the grammar doesn't call for a structured block here,
35413 though the loop as a whole is a structured block. */
35420 else
35425 {
35427 {
35429 nbraces--;
35430 }
35433 else
35434 {
35436 {
35439 }
35444 }
35445 }
35448 {
35452 else
35454 }
35458 }
35460 /* Helper function for OpenMP parsing, split clauses and call
35461 finish_omp_clauses on each of the set of clauses afterwards. */
35463 static void
35466 {
35472 }
35474 /* OpenMP 4.0:
35475 #pragma omp simd simd-clause[optseq] new-line
35476 for-loop */
35478 #define OMP_SIMD_CLAUSE_MASK \
35479 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35485 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35488 static tree
35492 {
35503 {
35507 OMP_CLAUSE_ORDERED);
35509 {
35511 "%<ordered%> clause with parameter may not be specified "
35514 }
35515 }
35526 }
35528 /* OpenMP 2.5:
35529 #pragma omp for for-clause[optseq] new-line
35530 for-loop
35532 OpenMP 4.0:
35533 #pragma omp for simd for-simd-clause[optseq] new-line
35534 for-loop */
35536 #define OMP_FOR_CLAUSE_MASK \
35537 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35538 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35539 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35540 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35541 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35542 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35543 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35544 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35545 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35547 static tree
35551 {
35558 /* parallel for{, simd} disallows nowait clause, but for
35559 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35562 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35567 {
35572 {
35596 }
35597 }
35599 {
35602 }
35604 /* Composite distribute parallel for disallows linear clause. */
35611 {
35614 }
35625 }
35627 /* OpenMP 2.5:
35628 # pragma omp master new-line
35629 structured-block */
35631 static tree
35633 {
35637 }
35639 /* OpenMP 2.5:
35640 # pragma omp ordered new-line
35641 structured-block
35643 OpenMP 4.5:
35644 # pragma omp ordered ordered-clauses new-line
35645 structured-block */
35647 #define OMP_ORDERED_CLAUSE_MASK \
35648 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35651 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35652 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35654 static bool
35657 {
35661 {
35666 {
35668 {
35671 }
35673 {
35675 "%<depend%> clause may only be used in compound "
35679 }
35680 tree clauses
35682 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35686 }
35687 }
35689 tree clauses
35700 }
35702 /* OpenMP 2.5:
35704 section-scope:
35705 { section-sequence }
35707 section-sequence:
35708 section-directive[opt] structured-block
35709 section-sequence section-directive structured-block */
35711 static tree
35713 {
35718 matching_braces braces;
35726 {
35730 }
35733 {
35741 {
35745 }
35747 {
35750 }
35755 }
35766 }
35768 /* OpenMP 2.5:
35769 # pragma omp sections sections-clause[optseq] newline
35770 sections-scope */
35772 #define OMP_SECTIONS_CLAUSE_MASK \
35773 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35776 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35777 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35779 static tree
35782 {
35794 {
35797 }
35804 }
35806 /* OpenMP 2.5:
35807 # pragma omp parallel parallel-clause[optseq] new-line
35808 structured-block
35809 # pragma omp parallel for parallel-for-clause[optseq] new-line
35810 structured-block
35811 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35812 structured-block
35814 OpenMP 4.0:
35815 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35816 structured-block */
35818 #define OMP_PARALLEL_CLAUSE_MASK \
35819 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35829 static tree
35833 {
35840 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35846 {
35854 if_p);
35858 if_p);
35861 block);
35866 }
35867 /* When combined with distribute, parallel has to be followed by for.
35868 #pragma omp target parallel is allowed though. */
35872 {
35876 }
35878 {
35881 }
35883 {
35887 {
35897 block);
35900 }
35901 }
35906 {
35909 }
35917 }
35919 /* OpenMP 2.5:
35920 # pragma omp single single-clause[optseq] new-line
35921 structured-block */
35923 #define OMP_SINGLE_CLAUSE_MASK \
35924 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35927 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35929 static tree
35931 {
35941 }
35943 /* OpenMP 3.0:
35944 # pragma omp task task-clause[optseq] new-line
35945 structured-block */
35947 #define OMP_TASK_CLAUSE_MASK \
35948 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35949 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35950 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35951 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35952 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35953 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35954 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35955 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35959 static tree
35961 {
35972 }
35974 /* OpenMP 3.0:
35975 # pragma omp taskwait new-line */
35977 static void
35979 {
35982 }
35984 /* OpenMP 3.1:
35985 # pragma omp taskyield new-line */
35987 static void
35989 {
35992 }
35994 /* OpenMP 4.0:
35995 # pragma omp taskgroup new-line
35996 structured-block */
35998 static tree
36000 {
36004 if_p));
36005 }
36008 /* OpenMP 2.5:
36009 # pragma omp threadprivate (variable-list) */
36011 static void
36013 {
36014 tree vars;
36020 }
36022 /* OpenMP 4.0:
36023 # pragma omp cancel cancel-clause[optseq] new-line */
36025 #define OMP_CANCEL_CLAUSE_MASK \
36026 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
36030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
36032 static void
36034 {
36038 }
36040 /* OpenMP 4.0:
36041 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
36043 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
36044 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
36049 static void
36052 {
36053 tree clauses;
36057 {
36062 {
36065 }
36066 }
36068 {
36072 }
36075 {
36080 else
36084 }
36087 OMP_CANCELLATION_POINT_CLAUSE_MASK,
36089 pragma_tok);
36091 }
36093 /* OpenMP 4.0:
36094 #pragma omp distribute distribute-clause[optseq] new-line
36095 for-loop */
36097 #define OMP_DISTRIBUTE_CLAUSE_MASK \
36098 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36099 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36100 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36104 static tree
36108 {
36117 {
36125 else
36128 {
36134 {
36138 else
36141 }
36147 else
36161 }
36162 }
36164 {
36167 }
36172 {
36175 }
36186 }
36188 /* OpenMP 4.0:
36189 # pragma omp teams teams-clause[optseq] new-line
36190 structured-block */
36192 #define OMP_TEAMS_CLAUSE_MASK \
36193 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36194 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36195 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36196 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36197 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36198 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36199 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36201 static tree
36205 {
36214 {
36218 {
36243 }
36244 }
36246 {
36249 }
36254 {
36257 }
36266 }
36268 /* OpenMP 4.0:
36269 # pragma omp target data target-data-clause[optseq] new-line
36270 structured-block */
36272 #define OMP_TARGET_DATA_CLAUSE_MASK \
36273 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36276 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36278 static tree
36280 {
36281 tree clauses
36286 {
36289 {
36306 "%<#pragma omp target data%> with map-type other "
36307 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36311 }
36313 }
36316 {
36319 "%<#pragma omp target data%> must contain at least "
36322 }
36333 }
36335 /* OpenMP 4.5:
36336 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36337 structured-block */
36339 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36340 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36346 static tree
36349 {
36352 {
36357 {
36360 }
36361 }
36363 {
36367 }
36370 {
36376 }
36378 tree clauses
36383 {
36386 {
36399 "%<#pragma omp target enter data%> with map-type other "
36403 }
36405 }
36408 {
36411 "%<#pragma omp target enter data%> must contain at least "
36414 }
36421 }
36423 /* OpenMP 4.5:
36424 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36425 structured-block */
36427 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36428 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36431 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36432 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36434 static tree
36437 {
36440 {
36445 {
36448 }
36449 }
36451 {
36455 }
36458 {
36464 }
36466 tree clauses
36471 {
36474 {
36488 "%<#pragma omp target exit data%> with map-type other "
36489 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36493 }
36495 }
36498 {
36501 "%<#pragma omp target exit data%> must contain at least "
36504 }
36511 }
36513 /* OpenMP 4.0:
36514 # pragma omp target update target-update-clause[optseq] new-line */
36516 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36517 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36520 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36524 static bool
36527 {
36529 {
36535 }
36537 tree clauses
36542 {
36544 "%<#pragma omp target update%> must contain at least one "
36547 }
36555 }
36557 /* OpenMP 4.0:
36558 # pragma omp target target-clause[optseq] new-line
36559 structured-block */
36561 #define OMP_TARGET_CLAUSE_MASK \
36562 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36563 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36564 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36565 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36566 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36567 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36568 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36569 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36570 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36572 static bool
36575 {
36579 {
36591 {
36599 {
36600 tree stmt;
36602 {
36605 OMP_TARGET_CLAUSE_MASK,
36610 OMP_TARGET_CLAUSE_MASK,
36615 OMP_TARGET_CLAUSE_MASK,
36620 }
36622 }
36627 {
36631 if_p);
36636 if_p);
36641 if_p);
36645 }
36651 {
36652 /* For combined target teams, ensure the num_teams and
36653 thread_limit clause expressions are evaluated on the host,
36654 before entering the target construct. */
36655 tree c;
36661 {
36670 OMP_CLAUSE_FIRSTPRIVATE);
36675 }
36676 }
36686 }
36688 {
36691 }
36693 {
36697 }
36699 {
36703 }
36705 {
36709 }
36711 {
36714 }
36715 }
36717 {
36720 }
36735 check_clauses:
36737 {
36740 {
36754 "%<#pragma omp target%> with map-type other "
36755 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36759 }
36761 }
36763 }
36765 /* OpenACC 2.0:
36766 # pragma acc cache (variable-list) new-line
36767 */
36769 static tree
36771 {
36786 }
36788 /* OpenACC 2.0:
36789 # pragma acc data oacc-data-clause[optseq] new-line
36790 structured-block */
36792 #define OACC_DATA_CLAUSE_MASK \
36793 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36805 static tree
36807 {
36820 }
36822 /* OpenACC 2.0:
36823 # pragma acc host_data <clauses> new-line
36824 structured-block */
36826 #define OACC_HOST_DATA_CLAUSE_MASK \
36827 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36829 static tree
36831 {
36844 }
36846 /* OpenACC 2.0:
36847 # pragma acc declare oacc-data-clause[optseq] new-line
36848 */
36850 #define OACC_DECLARE_CLAUSE_MASK \
36851 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36864 static tree
36866 {
36875 {
36879 }
36882 {
36886 {
36890 }
36893 {
36905 {
36907 "%qD must be a global variable in "
36909 decl);
36912 }
36917 {
36921 }
36923 {
36925 "invalid use of %<extern%> variable %qD "
36929 }
36931 {
36933 "invalid use of %<global%> variable %qD "
36937 }
36939 }
36944 {
36949 }
36952 {
36953 tree id;
36957 else
36963 {
36966 {
36969 {
36973 }
36974 }
36975 }
36976 }
36977 }
36990 }
36992 /* OpenACC 2.0:
36993 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36995 or
36997 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36999 LOC is the location of the #pragma token.
37000 */
37002 #define OACC_ENTER_DATA_CLAUSE_MASK \
37003 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37004 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37008 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37009 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37011 #define OACC_EXIT_DATA_CLAUSE_MASK \
37012 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
37016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37018 static tree
37021 {
37030 {
37035 }
37042 else
37047 {
37051 }
37059 }
37061 /* OpenACC 2.0:
37062 # pragma acc loop oacc-loop-clause[optseq] new-line
37063 structured-block */
37065 #define OACC_LOOP_CLAUSE_MASK \
37066 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
37067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
37073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
37074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
37075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
37077 static tree
37080 {
37089 {
37095 }
37104 }
37106 /* OpenACC 2.0:
37107 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37108 structured-block
37110 or
37112 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37113 structured-block
37114 */
37116 #define OACC_KERNELS_CLAUSE_MASK \
37117 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37135 #define OACC_PARALLEL_CLAUSE_MASK \
37136 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37140 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37144 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37145 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37146 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37148 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37152 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37153 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37154 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37155 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37157 static tree
37160 {
37161 omp_clause_mask mask;
37164 {
37177 }
37180 {
37184 {
37187 tree clauses;
37189 if_p);
37191 }
37192 }
37201 }
37203 /* OpenACC 2.0:
37204 # pragma acc update oacc-update-clause[optseq] new-line
37205 */
37207 #define OACC_UPDATE_CLAUSE_MASK \
37208 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37210 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37211 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
37213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37215 static tree
37217 {
37224 {
37226 "%<#pragma acc update%> must contain at least one "
37229 }
37237 }
37239 /* OpenACC 2.0:
37240 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37242 LOC is the location of the #pragma token.
37243 */
37245 #define OACC_WAIT_CLAUSE_MASK \
37246 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37248 static tree
37250 {
37264 }
37266 /* OpenMP 4.0:
37267 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37269 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37270 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37277 static void
37280 {
37282 cp_omp_declare_simd_data data;
37284 {
37289 /* It is safe to take the address of a local variable; it will only be
37290 used while this scope is live. */
37292 }
37294 /* Store away all pragma tokens. */
37306 {
37310 {
37323 }
37328 "%<#pragma omp declare simd%> not immediately followed by "
37332 }
37333 }
37335 /* Finalize #pragma omp declare simd clauses after direct declarator has
37336 been parsed, and put that into "omp declare simd" attribute. */
37338 static tree
37340 {
37346 {
37350 }
37355 {
37373 }
37377 }
37380 /* OpenMP 4.0:
37381 # pragma omp declare target new-line
37382 declarations and definitions
37383 # pragma omp end declare target new-line
37385 OpenMP 4.5:
37386 # pragma omp declare target ( extended-list ) new-line
37388 # pragma omp declare target declare-target-clauses[seq] new-line */
37390 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37391 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37394 static void
37396 {
37399 clauses
37403 {
37405 clauses);
37408 }
37409 else
37410 {
37414 }
37417 "%<#pragma omp declare target%> with clauses in between "
37418 "%<#pragma omp declare target%> without clauses and "
37421 {
37427 {
37430 }
37431 else
37434 {
37436 "%qD specified both in declare target %<link%> and %<to%>"
37439 }
37441 {
37448 {
37451 {
37455 }
37456 }
37457 }
37458 }
37459 }
37461 static void
37463 {
37466 {
37469 }
37471 {
37475 {
37478 }
37481 else
37482 {
37486 }
37487 }
37488 else
37489 {
37493 }
37497 "%<#pragma omp end declare target%> without corresponding "
37499 else
37501 }
37503 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37504 expression and optional initializer clause of
37505 #pragma omp declare reduction. We store the expression(s) as
37506 either 3, 6 or 7 special statements inside of the artificial function's
37507 body. The first two statements are DECL_EXPRs for the artificial
37508 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37509 expression that uses those variables.
37510 If there was any INITIALIZER clause, this is followed by further statements,
37511 the fourth and fifth statements are DECL_EXPRs for the artificial
37512 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37513 constructor variant (first token after open paren is not omp_priv),
37514 then the sixth statement is a statement with the function call expression
37515 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37516 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37517 to initialize the OMP_PRIV artificial variable and there is seventh
37518 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37520 static bool
37522 {
37534 tree combiner;
37549 {
37552 }
37555 {
37557 matching_parens parens;
37563 {
37566 }
37582 {
37586 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37590 == CPP_CLOSE_PAREN
37593 {
37597 }
37602 }
37603 else
37604 {
37620 {
37625 }
37627 tree arg;
37640 }
37651 }
37655 UNKNOWN_LOCATION);
37658 }
37660 /* OpenMP 4.0
37661 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37662 initializer-clause[opt] new-line
37664 initializer-clause:
37665 initializer (omp_priv initializer)
37666 initializer (function-name (argument-list)) */
37668 static void
37671 {
37681 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37688 {
37720 }
37732 /* Types may not be defined in declare reduction type list. */
37735 parser->type_definition_forbidden_message
37741 saved_colon_doesnt_start_class_def_p
37746 {
37750 ;
37769 else
37774 else
37776 }
37778 /* Restore the saved message. */
37781 parser->colon_doesnt_start_class_def_p
37786 {
37787 fail:
37790 }
37796 {
37797 tree fntype
37800 NULL_TREE);
37820 {
37825 }
37827 {
37829 {
37838 }
37845 }
37846 else
37847 {
37850 }
37853 else
37856 {
37859 }
37861 {
37864 else
37869 }
37874 else
37875 {
37884 }
37891 }
37895 done:
37896 /* Free any declarators allocated. */
37898 }
37900 /* OpenMP 4.0
37901 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37902 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37903 initializer-clause[opt] new-line
37904 #pragma omp declare target new-line */
37906 static bool
37909 {
37911 {
37916 {
37919 context);
37921 }
37924 {
37927 context);
37929 }
37931 {
37934 }
37936 {
37940 }
37941 }
37946 }
37948 /* OpenMP 4.5:
37949 #pragma omp taskloop taskloop-clause[optseq] new-line
37950 for-loop
37952 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37953 for-loop */
37955 #define OMP_TASKLOOP_CLAUSE_MASK \
37956 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37971 static tree
37975 {
37984 {
37989 {
38013 }
38014 }
38016 {
38019 }
38024 {
38027 }
38033 if_p);
38039 }
38042 /* OpenACC 2.0:
38043 # pragma acc routine oacc-routine-clause[optseq] new-line
38044 function-definition
38046 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
38047 */
38049 #define OACC_ROUTINE_CLAUSE_MASK \
38050 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
38056 /* Parse the OpenACC routine pragma. This has an optional '( name )'
38057 component, which must resolve to a declared namespace-scope
38058 function. The clauses are either processed directly (for a named
38059 function), or defered until the immediatley following declaration
38060 is parsed. */
38062 static void
38065 {
38067 /* The checking for "another pragma following this one" in the "no optional
38068 '( name )'" case makes sure that we dont re-enter. */
38071 cp_oacc_routine_data data;
38077 /* It is safe to take the address of a local variable; it will only be
38078 used while this scope is live. */
38081 /* Look for optional '( name )'. */
38083 {
38084 matching_parens parens;
38087 /* We parse the name as an id-expression. If it resolves to
38088 anything other than a non-overloaded function at namespace
38089 scope, it's an error. */
38105 {
38109 }
38111 data.clauses
38119 {
38124 }
38126 /* Perhaps we should use the same rule as declarations in different
38127 namespaces? */
38129 {
38134 }
38137 {
38141 }
38145 }
38147 {
38148 /* Store away all pragma tokens. */
38159 /* Emit a helpful diagnostic if there's another pragma following this
38160 one. */
38162 {
38165 /* ..., and then just keep going. */
38167 }
38169 /* We only have to consider the pragma_external case here. */
38174 else
38177 }
38178 }
38180 /* Finalize #pragma acc routine clauses after direct declarator has
38181 been parsed. */
38183 static tree
38185 {
38190 {
38192 "%<#pragma acc routine%> not immediately followed by "
38195 }
38212 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38213 fndecl_seen. */
38216 }
38218 /* Apply any saved OpenACC routine clauses to a just-parsed
38219 declaration. */
38221 static void
38223 {
38225 {
38226 /* Keep going if we're in error reporting mode. */
38232 {
38234 "%<#pragma acc routine%> not immediately followed by"
38238 }
38240 {
38243 }
38246 {
38251 }
38254 {
38262 }
38264 /* Process the routine's dimension clauses. */
38268 /* Add an "omp declare target" attribute. */
38273 /* Don't unset parser->oacc_routine here: we may still need it to
38274 diagnose wrong usage. But, remember that we've used this "#pragma acc
38275 routine". */
38277 }
38278 }
38280 /* Main entry point to OpenMP statement pragmas. */
38282 static void
38284 {
38285 tree stmt;
38290 {
38313 if_p);
38318 if_p);
38335 if_p);
38340 if_p);
38348 if_p);
38357 if_p);
38371 if_p);
38376 if_p);
38380 }
38383 }
38384 \f
38385 /* Transactional Memory parsing routines. */
38387 /* Parse a transaction attribute.
38389 txn-attribute:
38390 attribute
38391 [ [ identifier ] ]
38393 We use this instead of cp_parser_attributes_opt for transactions to avoid
38394 the pedwarn in C++98 mode. */
38396 static tree
38398 {
38413 {
38417 /* For keywords, use the canonical spelling,
38418 not the parsed identifier. */
38422 }
38423 else
38427 error1:
38430 }
38432 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38434 transaction-statement:
38435 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38436 compound-statement
38437 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38438 */
38440 static tree
38442 {
38453 else
38454 {
38458 }
38460 /* Parse a noexcept specification. */
38464 {
38465 /* cancel-and-throw is unimplemented. */
38468 }
38469 else
38472 /* Keep track if we're in the lexical scope of an outer transaction. */
38484 }
38486 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38488 transaction-expression:
38489 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38490 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38491 */
38493 static tree
38495 {
38508 keyword == RID_TRANSACTION_RELAXED
38522 /* Set this early. This might mean that we allow transaction_cancel in
38523 an expression that we find out later actually has to be a constexpr.
38524 However, we expect that cxx_constant_value will be able to deal with
38525 this; also, if the noexcept has no constexpr, then what we parse next
38526 really is a transaction's body. */
38529 /* Parse a noexcept specification. */
38535 {
38536 matching_parens parens;
38543 }
38544 else
38545 {
38546 /* The only expression that is available got parsed for the noexcept
38547 already. noexcept is true then. */
38550 }
38559 }
38561 /* Parse a function-transaction-block.
38563 function-transaction-block:
38564 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38565 function-body
38566 __transaction_atomic txn-attribute[opt] function-try-block
38567 __transaction_relaxed ctor-initializer[opt] function-body
38568 __transaction_relaxed function-try-block
38569 */
38571 static void
38573 {
38588 else
38589 {
38593 }
38601 else
38602 cp_parser_ctor_initializer_opt_and_function_body
38608 }
38610 /* Parse a __transaction_cancel statement.
38612 cancel-statement:
38613 __transaction_cancel txn-attribute[opt] ;
38614 __transaction_cancel txn-attribute[opt] throw-expression ;
38616 ??? Cancel and throw is not yet implemented. */
38618 static tree
38620 {
38626 RT_TRANSACTION_CANCEL);
38633 /* ??? Parse cancel-and-throw here. */
38638 {
38642 }
38644 {
38648 }
38650 {
38653 {
38659 }
38660 }
38662 {
38666 }
38672 }
38673 \f
38674 /* The parser. */
38678 \f
38679 /* Special handling for the first token or line in the file. The first
38680 thing in the file might be #pragma GCC pch_preprocess, which loads a
38681 PCH file, which is a GC collection point. So we need to handle this
38682 first pragma without benefit of an existing lexer structure.
38684 Always returns one token to the caller in *FIRST_TOKEN. This is
38685 either the true first token of the file, or the first token after
38686 the initial pragma. */
38688 static void
38690 {
38699 {
38706 }
38707 else
38710 /* Skip to the end of the pragma. */
38714 /* Now actually load the PCH file. */
38718 /* Read one more token to return to our caller. We have to do this
38719 after reading the PCH file in, since its pointers have to be
38720 live. */
38722 }
38724 /* Parse a pragma GCC ivdep. */
38726 static bool
38728 {
38731 }
38733 /* Parse a pragma GCC unroll. */
38735 static unsigned short
38737 {
38747 {
38749 " assignment-expression that evaluates to a non-negative"
38752 }
38753 else
38754 {
38758 }
38761 }
38763 /* Normal parsing of a pragma token. Here we can (and must) use the
38764 regular lexer. */
38766 static bool
38768 {
38771 tree stmt;
38782 {
38790 {
38800 }
38805 {
38815 }
38820 {
38831 }
38836 {
38847 }
38852 {
38863 }
38883 {
38888 }
38896 {
38901 }
38909 {
38913 }
38919 {
38924 }
38932 {
38937 }
38992 "%<#pragma omp section%> may only be used in "
38997 {
38999 {
39003 }
39009 {
39013 }
39014 else
39020 {
39023 }
39026 }
39029 {
39031 {
39035 }
39036 const unsigned short unroll
39042 {
39046 }
39047 else
39053 {
39056 }
39059 }
39066 bad_stmt:
39069 }
39073 }
39075 /* The interface the pragma parsers have to the lexer. */
39077 enum cpp_ttype
39079 {
39091 else
39092 {
39096 }
39099 }
39101 \f
39102 /* External interface. */
39104 /* Parse one entire translation unit. */
39106 void
39108 {
39121 }
39123 /* Create an identifier for a generic parameter type (a synthesized
39124 template parameter implied by `auto' or a concept identifier). */
39127 static tree
39129 {
39133 }
39135 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39136 (creating a new template parameter list if necessary). Returns the newly
39137 created template type parm. */
39139 static tree
39141 {
39144 /* Before committing to modifying any scope, if we're in an
39145 implicit template scope, and we're trying to synthesize a
39146 constrained parameter, try to find a previous parameter with
39147 the same name. This is the same-type rule for abbreviated
39148 function templates.
39150 NOTE: We can generate implicit parameters when tentatively
39151 parsing a nested name specifier, only to reject that parse
39152 later. However, matching the same template-id as part of a
39153 direct-declarator should generate an identical template
39154 parameter, so this rule will merge them. */
39156 {
39159 {
39161 {
39164 /* Return the TEMPLATE_PARM_INDEX. */
39167 }
39169 }
39170 }
39172 /* We are either continuing a function template that already contains implicit
39173 template parameters, creating a new fully-implicit function template, or
39174 extending an existing explicit function template with implicit template
39175 parameters. */
39183 {
39187 }
39188 else
39189 {
39190 /* Roll back to the existing template parameter scope (in the case of
39191 extending an explicit function template) or introduce a new template
39192 parameter scope ahead of the function parameter scope (or class scope
39193 in the case of out-of-line member definitions). The function scope is
39194 added back after template parameter synthesis below. */
39199 {
39202 }
39204 {
39205 /* If not defining a class, then any class scope is a scope level in
39206 an out-of-line member definition. In this case simply wind back
39207 beyond the first such scope to inject the template parameter list.
39208 Otherwise wind back to the class being defined. The latter can
39209 occur in class member friend declarations such as:
39211 class A {
39212 void foo (auto);
39213 };
39214 class B {
39215 friend void A::foo (auto);
39216 };
39218 The template parameter list synthesized for the friend declaration
39219 must be injected in the scope of 'B'. This can also occur in
39220 erroneous cases such as:
39222 struct A {
39223 struct B {
39224 void foo (auto);
39225 };
39226 void B::foo (auto) {}
39227 };
39229 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39230 but, nevertheless, the template parameter list synthesized for the
39231 declarator should be injected into the scope of 'A' as if the
39232 ill-formed template was specified explicitly. */
39235 {
39238 }
39239 }
39245 {
39246 /* Introduce a new template parameter list for implicit template
39247 parameters. */
39251 parser->implicit_template_scope
39258 }
39259 else
39260 {
39261 /* Synthesize implicit template parameters at the end of the explicit
39262 template parameter list. */
39269 parser->implicit_template_parms
39271 }
39272 }
39274 /* Synthesize a new template parameter and track the current template
39275 parameter chain with implicit_template_parms. */
39279 tree synth_tmpl_parm;
39283 synth_tmpl_parm
39286 synth_tmpl_parm
39288 else
39289 {
39293 }
39295 // Attach the constraint to the parm before processing.
39298 tree new_parm
39300 input_location,
39301 node,
39305 // Chain the new parameter to the list of implicit parameters.
39307 parser->implicit_template_parms
39309 else
39314 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39317 /* If creating a fully implicit function template, start the new implicit
39318 template parameter list with this synthesized type, otherwise grow the
39319 current template parameter list. */
39322 {
39329 }
39330 else
39331 {
39336 }
39338 // If the new parameter was constrained, we need to add that to the
39339 // constraints in the template parameter list.
39341 {
39345 }
39350 }
39352 /* Finish the declaration of a fully implicit function template. Such a
39353 template has no explicit template parameter list so has not been through the
39354 normal template head and tail processing. synthesize_implicit_template_parm
39355 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39356 provided if the declaration is a class member such that its template
39357 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39358 form is returned. Otherwise NULL_TREE is returned. */
39360 static tree
39362 {
39367 {
39371 }
39383 }
39385 /* Like finish_fully_implicit_template, but to be used in error
39386 recovery, rearranging scopes so that we restore the state we had
39387 before synthesize_implicit_template_parm inserted the implement
39388 template parms scope. */
39390 static void
39392 {
39397 {
39406 }
39407 else
39413 }
39415 /* Helper function for diagnostics that have complained about things
39416 being used with 'extern "C"' linkage.
39418 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39420 void
39422 {
39426 }