| blob | 366a0d894602db5f74ed89cf2e94938eb88fed57 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2018 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 #define INCLUDE_UNIQUE_PTR
48 \f
49 /* The lexer. */
51 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
52 and c-lex.c) and the C++ parser. */
55 {
57 };
59 /* The various kinds of non integral constant we encounter. */
61 NIC_NONE,
62 /* floating-point literal */
63 NIC_FLOAT,
64 /* %<this%> */
65 NIC_THIS,
66 /* %<__FUNCTION__%> */
67 NIC_FUNC_NAME,
68 /* %<__PRETTY_FUNCTION__%> */
69 NIC_PRETTY_FUNC,
70 /* %<__func__%> */
71 NIC_C99_FUNC,
72 /* "%<va_arg%> */
73 NIC_VA_ARG,
74 /* a cast */
75 NIC_CAST,
76 /* %<typeid%> operator */
77 NIC_TYPEID,
78 /* non-constant compound literals */
79 NIC_NCC,
80 /* a function call */
81 NIC_FUNC_CALL,
82 /* an increment */
83 NIC_INC,
84 /* an decrement */
85 NIC_DEC,
86 /* an array reference */
87 NIC_ARRAY_REF,
88 /* %<->%> */
89 NIC_ARROW,
90 /* %<.%> */
91 NIC_POINT,
92 /* the address of a label */
93 NIC_ADDR_LABEL,
94 /* %<*%> */
95 NIC_STAR,
96 /* %<&%> */
97 NIC_ADDR,
98 /* %<++%> */
99 NIC_PREINCREMENT,
100 /* %<--%> */
101 NIC_PREDECREMENT,
102 /* %<new%> */
103 NIC_NEW,
104 /* %<delete%> */
105 NIC_DEL,
106 /* calls to overloaded operators */
107 NIC_OVERLOADED,
108 /* an assignment */
109 NIC_ASSIGNMENT,
110 /* a comma operator */
111 NIC_COMMA,
112 /* a call to a constructor */
113 NIC_CONSTRUCTOR,
114 /* a transaction expression */
115 NIC_TRANSACTION
116 };
118 /* The various kinds of errors about name-lookup failing. */
120 /* NULL */
121 NLE_NULL,
122 /* is not a type */
123 NLE_TYPE,
124 /* is not a class or namespace */
125 NLE_CXX98,
126 /* is not a class, namespace, or enumeration */
127 NLE_NOT_CXX98
128 };
130 /* The various kinds of required token */
132 RT_NONE,
154 /* The type is CPP_KEYWORD */
183 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 };
186 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
187 reverting it on destruction. */
189 class type_id_in_expr_sentinel
190 {
200 };
202 /* Prototypes. */
208 static void cp_lexer_destroy
210 static int cp_lexer_saving_tokens
214 static void cp_lexer_get_preprocessor_token
222 static bool cp_lexer_next_token_is_not
224 static bool cp_lexer_next_token_is_keyword
228 static void cp_lexer_purge_token
230 static void cp_lexer_purge_tokens_after
232 static void cp_lexer_save_tokens
234 static void cp_lexer_commit_tokens
236 static void cp_lexer_rollback_tokens
238 static void cp_lexer_print_token
242 static void cp_lexer_start_debugging
244 static void cp_lexer_stop_debugging
250 static void cp_parser_initial_pragma
253 static bool cp_parser_omp_declare_reduction_exprs
255 static void cp_finalize_oacc_routine
258 /* Manifest constants. */
259 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
260 #define CP_SAVED_TOKEN_STACK 5
262 /* Variables. */
264 /* The stream to which debugging output should be written. */
267 /* Nonzero if we are parsing an unevaluated operand: an operand to
268 sizeof, typeof, or alignof. */
271 /* Dump up to NUM tokens in BUFFER to FILE starting with token
272 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
273 first token in BUFFER. If NUM is 0, dump all the tokens. If
274 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
275 highlighted by surrounding it in [[ ]]. */
277 static void
281 {
298 {
301 }
306 {
313 nprinted++;
323 {
333 }
334 }
337 {
340 }
343 }
346 /* Dump all tokens in BUFFER to stderr. */
348 void
350 {
352 }
354 DEBUG_FUNCTION void
356 {
358 }
360 DEBUG_FUNCTION void
362 {
365 else
367 }
370 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
371 description for T. */
373 static void
375 {
377 {
380 }
381 }
384 /* Dump parser context C to FILE. */
386 static void
388 {
393 }
396 /* Print the stack of parsing contexts to FILE starting with FIRST. */
398 static void
400 {
406 {
409 }
410 }
413 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
415 static void
417 {
420 }
423 /* Print an unparsed function entry UF to FILE. */
425 static void
427 {
430 tree fn;
435 i++)
436 {
442 }
447 {
450 }
456 {
459 }
461 }
464 /* Print the stack of unparsed member functions S to FILE. */
466 static void
469 {
475 {
478 }
479 }
482 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
483 the given PARSER. If FILE is NULL, the output is printed on stderr. */
485 static void
487 {
499 next_token);
500 }
503 /* Dump debugging information for the given PARSER. If FILE is NULL,
504 the output is printed on stderr. */
506 void
508 {
511 expanded_location eloc;
587 }
589 DEBUG_FUNCTION void
591 {
593 }
595 DEBUG_FUNCTION void
597 {
600 else
602 }
604 /* Allocate memory for a new lexer object and return it. */
608 {
613 /* Allocate the memory. */
616 /* Initially we are not debugging. */
621 /* Create the buffer. */
625 }
628 /* Create a new main C++ lexer, the lexer that gets tokens from the
629 preprocessor. */
633 {
635 cp_token token;
637 /* It's possible that parsing the first pragma will load a PCH file,
638 which is a GC collection point. So we have to do that before
639 allocating any memory. */
644 /* Put the first token in the buffer. */
647 /* Get the remaining tokens from the preprocessor. */
649 {
652 }
661 /* Subsequent preprocessor diagnostics should use compiler
662 diagnostic functions to get the compiler source location. */
667 }
669 /* Create a new lexer whose token stream is primed with the tokens in
670 CACHE. When these tokens are exhausted, no new tokens will be read. */
674 {
679 /* We do not own the buffer. */
686 /* Initially we are not debugging. */
691 }
693 /* Frees all resources associated with LEXER. */
695 static void
697 {
701 }
703 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
704 be used. The point of this flag is to help the compiler to fold away calls
705 to cp_lexer_debugging_p within this source file at compile time, when the
706 lexer is not being debugged. */
708 #define LEXER_DEBUGGING_ENABLED_P false
710 /* Returns nonzero if debugging information should be output. */
714 {
719 }
724 {
728 }
732 {
734 }
738 {
740 }
744 {
747 else
749 }
753 {
756 /* Skip past purged tokens. */
758 {
760 tp--;
761 }
764 }
766 /* nonzero if we are presently saving tokens. */
770 {
772 }
774 /* Store the next token from the preprocessor in *TOKEN. Return true
775 if we reach EOF. If LEXER is NULL, assume we are handling an
776 initial #pragma pch_preprocess, and thus want the lexer to return
777 processed strings. */
779 static void
781 {
784 /* Get a new token from the preprocessor. */
785 token->type
792 /* On some systems, some header files are surrounded by an
793 implicit extern "C" block. Set a flag in the token if it
794 comes from such a header. */
799 /* Check to see if this token is a keyword. */
801 {
803 {
804 /* Mark this token as a keyword. */
806 /* Record which keyword. */
808 }
809 else
810 {
814 {
815 /* Warn about the C++0x keyword (but still treat it as
816 an identifier). */
821 /* Clear out the C_RID_CODE so we don't warn about this
822 particular identifier-turned-keyword again. */
824 }
827 }
828 }
830 {
831 /* This only happens in Objective-C++; it must be a keyword. */
834 {
835 /* Replace 'class' with '@class', 'private' with '@private',
836 etc. This prevents confusion with the C++ keyword
837 'class', and makes the tokens consistent with other
838 Objective-C 'AT' keywords. For example '@class' is
839 reported as RID_AT_CLASS which is consistent with
840 '@synchronized', which is reported as
841 RID_AT_SYNCHRONIZED.
842 */
852 }
853 }
854 }
856 /* Update the globals input_location and the input file stack from TOKEN. */
859 {
861 {
863 }
864 }
866 /* Update the globals input_location and the input file stack from LEXER. */
869 {
872 }
874 /* Return a pointer to the next token in the token stream, but do not
875 consume it. */
879 {
881 {
885 }
887 }
889 /* Return true if the next token has the indicated TYPE. */
893 {
895 }
897 /* Return true if the next token does not have the indicated TYPE. */
901 {
903 }
905 /* Return true if the next token is the indicated KEYWORD. */
909 {
911 }
915 {
917 }
921 {
923 }
925 /* Return true if the next token is not the indicated KEYWORD. */
929 {
931 }
933 /* Return true if KEYWORD can start a decl-specifier. */
935 bool
937 {
939 {
940 /* auto specifier: storage-class-specifier in C++,
941 simple-type-specifier in C++0x. */
943 /* Storage classes. */
949 /* Elaborated type specifiers. */
955 /* Simple type specifiers. */
969 /* GNU extensions. */
972 /* C++0x extensions. */
984 }
985 }
987 /* Return true if the next token is a keyword for a decl-specifier. */
989 static bool
991 {
996 }
998 /* Returns TRUE iff the token T begins a decltype type. */
1000 static bool
1002 {
1005 }
1007 /* Returns TRUE iff the next token begins a decltype type. */
1009 static bool
1011 {
1014 }
1016 /* Called when processing a token with tree_check_value; perform or defer the
1017 associated checks and return the value. */
1019 static tree
1021 {
1022 /* Perform any access checks that were deferred. */
1027 {
1033 }
1034 /* Return the stored value. */
1036 }
1038 /* Return a pointer to the Nth token in the token stream. If N is 1,
1039 then this is precisely equivalent to cp_lexer_peek_token (except
1040 that it is not inline). One would like to disallow that case, but
1041 there is one case (cp_parser_nth_token_starts_template_id) where
1042 the caller passes a variable for N and it might be 1. */
1046 {
1049 /* N is 1-based, not zero-based. */
1060 {
1063 {
1066 }
1070 }
1073 {
1076 }
1079 }
1081 /* Return the next token, and advance the lexer's next_token pointer
1082 to point to the next non-purged token. */
1086 {
1092 do
1093 {
1096 {
1099 }
1101 }
1106 /* Provide debugging output. */
1108 {
1112 }
1115 }
1117 /* Permanently remove the next token from the token stream, and
1118 advance the next_token pointer to refer to the next non-purged
1119 token. */
1121 static void
1123 {
1132 do
1133 {
1134 tok++;
1136 {
1139 }
1140 }
1143 }
1145 /* Permanently remove all tokens after TOK, up to, but not
1146 including, the token that will be returned next by
1147 cp_lexer_peek_token. */
1149 static void
1151 {
1160 {
1165 }
1166 }
1168 /* Begin saving tokens. All tokens consumed after this point will be
1169 preserved. */
1171 static void
1173 {
1174 /* Provide debugging output. */
1179 }
1181 /* Commit to the portion of the token stream most recently saved. */
1183 static void
1185 {
1186 /* Provide debugging output. */
1191 }
1193 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1194 to the token stream. Stop saving tokens. */
1196 static void
1198 {
1199 /* Provide debugging output. */
1204 }
1206 /* RAII wrapper around the above functions, with sanity checking. Creating
1207 a variable saves tokens, which are committed when the variable is
1208 destroyed unless they are explicitly rolled back by calling the rollback
1209 member function. */
1211 struct saved_token_sentinel
1212 {
1217 {
1220 }
1222 {
1225 }
1227 {
1231 }
1232 };
1234 /* Print a representation of the TOKEN on the STREAM. */
1236 static void
1238 {
1239 /* We don't use cpp_type2name here because the parser defines
1240 a few tokens of its own. */
1242 /* cpplib-defined token types */
1243 #define OP(e, s) #e,
1244 #define TK(e, s) #e,
1245 TTYPE_TABLE
1246 #undef OP
1247 #undef TK
1248 /* C++ parser token types - see "Manifest constants", above. */
1252 };
1254 /* For some tokens, print the associated data. */
1256 {
1258 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1259 For example, `struct' is mapped to an INTEGER_CST. */
1262 /* fall through */
1280 /* If we have a name for the token, print it out. Otherwise, we
1281 simply give the numeric code. */
1284 else
1287 }
1288 }
1290 DEBUG_FUNCTION void
1292 {
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 else
1304 }
1307 /* Start emitting debugging information. */
1309 static void
1311 {
1318 }
1320 /* Stop emitting debugging information. */
1322 static void
1324 {
1331 }
1333 /* Create a new cp_token_cache, representing a range of tokens. */
1337 {
1342 }
1344 /* Diagnose if #pragma omp declare simd isn't followed immediately
1345 by function declaration or definition. */
1349 {
1351 {
1355 }
1356 }
1358 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1359 and put that into "omp declare simd" attribute. */
1363 {
1365 {
1367 {
1370 }
1372 {
1375 }
1376 }
1377 }
1379 /* Diagnose if #pragma acc routine isn't followed immediately by function
1380 declaration or definition. */
1384 {
1386 {
1388 "%<#pragma acc routine%> not immediately followed by "
1391 }
1392 }
1393 \f
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1398 static void
1400 {
1402 }
1404 /* Declarators. */
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1412 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1422 /* An erroneous declarator. */
1425 /* The obstack on which declarators and related data structures are
1426 allocated. */
1429 /* Alloc BYTES from the declarator memory pool. */
1433 {
1435 }
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1442 {
1455 }
1457 /* Make a declarator for a generalized identifier. If
1458 QUALIFYING_SCOPE is non-NULL, the identifier is
1459 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1460 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1461 is, if any. */
1465 special_function_kind sfk)
1466 {
1469 /* It is valid to write:
1471 class C { void f(); };
1472 typedef C D;
1473 void D::f();
1475 The standard is not clear about whether `typedef const C D' is
1476 legal; as of 2002-09-15 the committee is considering that
1477 question. EDG 3.0 allows that syntax. Therefore, we do as
1478 well. */
1492 }
1494 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1495 of modifiers such as const or volatile to apply to the pointer
1496 type, represented as identifiers. ATTRIBUTES represent the attributes that
1497 appertain to the pointer or reference. */
1499 cp_declarator *
1501 tree attributes)
1502 {
1510 {
1514 }
1515 else
1521 }
1523 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1524 represent the attributes that appertain to the pointer or
1525 reference. */
1527 cp_declarator *
1530 {
1538 {
1542 }
1543 else
1549 }
1551 /* Like make_pointer_declarator -- but for a pointer to a non-static
1552 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1553 appertain to the pointer or reference. */
1555 cp_declarator *
1558 tree attributes)
1559 {
1568 {
1571 }
1572 else
1578 }
1580 /* Make a declarator for the function given by TARGET, with the
1581 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1582 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1583 indicates what exceptions can be thrown. */
1585 cp_declarator *
1587 tree parms,
1588 cp_cv_quals cv_qualifiers,
1589 cp_virt_specifiers virt_specifiers,
1590 cp_ref_qualifier ref_qualifier,
1591 tree tx_qualifier,
1592 tree exception_specification,
1593 tree late_return_type,
1594 tree requires_clause)
1595 {
1609 {
1613 }
1614 else
1618 }
1620 /* Make a declarator for an array of BOUNDS elements, each of which is
1621 defined by ELEMENT. */
1623 cp_declarator *
1625 {
1632 {
1636 }
1637 else
1641 }
1643 /* Determine whether the declarator we've seen so far can be a
1644 parameter pack, when followed by an ellipsis. */
1645 static bool
1647 {
1649 /* We already saw an ellipsis. */
1652 /* Search for a declarator name, or any other declarator that goes
1653 after the point where the ellipsis could appear in a parameter
1654 pack. If we find any of these, then this declarator can not be
1655 made into a parameter pack. */
1658 {
1660 {
1673 }
1674 }
1677 }
1681 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1682 DECLARATOR and DEFAULT_ARGUMENT. */
1684 cp_parameter_declarator *
1687 tree default_argument,
1688 location_t loc,
1690 {
1698 else
1706 }
1708 /* Returns true iff DECLARATOR is a declaration for a function. */
1710 static bool
1712 {
1714 {
1723 }
1725 }
1727 /* The parser. */
1729 /* Overview
1730 --------
1732 A cp_parser parses the token stream as specified by the C++
1733 grammar. Its job is purely parsing, not semantic analysis. For
1734 example, the parser breaks the token stream into declarators,
1735 expressions, statements, and other similar syntactic constructs.
1736 It does not check that the types of the expressions on either side
1737 of an assignment-statement are compatible, or that a function is
1738 not declared with a parameter of type `void'.
1740 The parser invokes routines elsewhere in the compiler to perform
1741 semantic analysis and to build up the abstract syntax tree for the
1742 code processed.
1744 The parser (and the template instantiation code, which is, in a
1745 way, a close relative of parsing) are the only parts of the
1746 compiler that should be calling push_scope and pop_scope, or
1747 related functions. The parser (and template instantiation code)
1748 keeps track of what scope is presently active; everything else
1749 should simply honor that. (The code that generates static
1750 initializers may also need to set the scope, in order to check
1751 access control correctly when emitting the initializers.)
1753 Methodology
1754 -----------
1756 The parser is of the standard recursive-descent variety. Upcoming
1757 tokens in the token stream are examined in order to determine which
1758 production to use when parsing a non-terminal. Some C++ constructs
1759 require arbitrary look ahead to disambiguate. For example, it is
1760 impossible, in the general case, to tell whether a statement is an
1761 expression or declaration without scanning the entire statement.
1762 Therefore, the parser is capable of "parsing tentatively." When the
1763 parser is not sure what construct comes next, it enters this mode.
1764 Then, while we attempt to parse the construct, the parser queues up
1765 error messages, rather than issuing them immediately, and saves the
1766 tokens it consumes. If the construct is parsed successfully, the
1767 parser "commits", i.e., it issues any queued error messages and
1768 the tokens that were being preserved are permanently discarded.
1769 If, however, the construct is not parsed successfully, the parser
1770 rolls back its state completely so that it can resume parsing using
1771 a different alternative.
1773 Future Improvements
1774 -------------------
1776 The performance of the parser could probably be improved substantially.
1777 We could often eliminate the need to parse tentatively by looking ahead
1778 a little bit. In some places, this approach might not entirely eliminate
1779 the need to parse tentatively, but it might still speed up the average
1780 case. */
1782 /* Flags that are passed to some parsing functions. These values can
1783 be bitwise-ored together. */
1785 enum
1786 {
1787 /* No flags. */
1789 /* The construct is optional. If it is not present, then no error
1790 should be issued. */
1792 /* When parsing a type-specifier, treat user-defined type-names
1793 as non-type identifiers. */
1795 /* When parsing a type-specifier, do not try to parse a class-specifier
1796 or enum-specifier. */
1798 /* When parsing a decl-specifier-seq, only allow type-specifier or
1799 constexpr. */
1801 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1803 };
1805 /* This type is used for parameters and variables which hold
1806 combinations of the above flags. */
1809 /* The different kinds of declarators we want to parse. */
1811 enum cp_parser_declarator_kind
1812 {
1813 /* We want an abstract declarator. */
1814 CP_PARSER_DECLARATOR_ABSTRACT,
1815 /* We want a named declarator. */
1816 CP_PARSER_DECLARATOR_NAMED,
1817 /* We don't mind, but the name must be an unqualified-id. */
1818 CP_PARSER_DECLARATOR_EITHER
1819 };
1821 /* The precedence values used to parse binary expressions. The minimum value
1822 of PREC must be 1, because zero is reserved to quickly discriminate
1823 binary operators from other tokens. */
1825 enum cp_parser_prec
1826 {
1827 PREC_NOT_OPERATOR,
1828 PREC_LOGICAL_OR_EXPRESSION,
1829 PREC_LOGICAL_AND_EXPRESSION,
1830 PREC_INCLUSIVE_OR_EXPRESSION,
1831 PREC_EXCLUSIVE_OR_EXPRESSION,
1832 PREC_AND_EXPRESSION,
1833 PREC_EQUALITY_EXPRESSION,
1834 PREC_RELATIONAL_EXPRESSION,
1835 PREC_SHIFT_EXPRESSION,
1836 PREC_ADDITIVE_EXPRESSION,
1837 PREC_MULTIPLICATIVE_EXPRESSION,
1838 PREC_PM_EXPRESSION,
1839 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1840 };
1842 /* A mapping from a token type to a corresponding tree node type, with a
1843 precedence value. */
1845 struct cp_parser_binary_operations_map_node
1846 {
1847 /* The token type. */
1849 /* The corresponding tree code. */
1851 /* The precedence of this operator. */
1853 };
1855 struct cp_parser_expression_stack_entry
1856 {
1857 /* Left hand side of the binary operation we are currently
1858 parsing. */
1859 cp_expr lhs;
1860 /* Original tree code for left hand side, if it was a binary
1861 expression itself (used for -Wparentheses). */
1863 /* Tree code for the binary operation we are parsing. */
1865 /* Precedence of the binary operation we are parsing. */
1867 /* Location of the binary operation we are parsing. */
1868 location_t loc;
1869 };
1871 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1872 entries because precedence levels on the stack are monotonically
1873 increasing. */
1877 /* Prototypes. */
1879 /* Constructors and destructors. */
1884 /* Class variables. */
1888 /* The operator-precedence table used by cp_parser_binary_expression.
1889 Transformed into an associative array (binops_by_token) by
1890 cp_parser_new. */
1923 };
1925 /* The same as binops, but initialized by cp_parser_new so that
1926 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1927 for speed. */
1930 /* Constructors and destructors. */
1932 /* Construct a new context. The context below this one on the stack
1933 is given by NEXT. */
1937 {
1940 /* Allocate the storage. */
1942 {
1943 /* Pull the first entry from the free list. */
1947 }
1948 else
1951 /* No errors have occurred yet in this context. */
1953 /* If this is not the bottommost context, copy information that we
1954 need from the previous context. */
1956 {
1957 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1958 expression, then we are parsing one in this context, too. */
1960 /* Thread the stack. */
1962 }
1965 }
1967 /* Managing the unparsed function queues. */
1969 #define unparsed_funs_with_default_args \
1970 parser->unparsed_queues->last ().funs_with_default_args
1971 #define unparsed_funs_with_definitions \
1972 parser->unparsed_queues->last ().funs_with_definitions
1973 #define unparsed_nsdmis \
1974 parser->unparsed_queues->last ().nsdmis
1975 #define unparsed_classes \
1976 parser->unparsed_queues->last ().classes
1978 static void
1980 {
1983 }
1985 static void
1987 {
1990 }
1992 /* Prototypes. */
1994 /* Constructors and destructors. */
1999 /* Routines to parse various constructs.
2001 Those that return `tree' will return the error_mark_node (rather
2002 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2003 Sometimes, they will return an ordinary node if error-recovery was
2004 attempted, even though a parse error occurred. So, to check
2005 whether or not a parse error occurred, you should always use
2006 cp_parser_error_occurred. If the construct is optional (indicated
2007 either by an `_opt' in the name of the function that does the
2008 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2009 the construct is not present. */
2011 /* Lexical conventions [gram.lex] */
2013 static cp_expr cp_parser_identifier
2015 static cp_expr cp_parser_string_literal
2017 static cp_expr cp_parser_userdef_char_literal
2019 static tree cp_parser_userdef_string_literal
2021 static cp_expr cp_parser_userdef_numeric_literal
2024 /* Basic concepts [gram.basic] */
2026 static bool cp_parser_translation_unit
2029 /* Expressions [gram.expr] */
2031 static cp_expr cp_parser_primary_expression
2033 static cp_expr cp_parser_id_expression
2035 static cp_expr cp_parser_unqualified_id
2037 static tree cp_parser_nested_name_specifier_opt
2039 static tree cp_parser_nested_name_specifier
2041 static tree cp_parser_qualifying_entity
2043 static cp_expr cp_parser_postfix_expression
2045 static tree cp_parser_postfix_open_square_expression
2047 static tree cp_parser_postfix_dot_deref_expression
2052 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2054 static void cp_parser_pseudo_destructor_name
2056 static cp_expr cp_parser_unary_expression
2058 static enum tree_code cp_parser_unary_operator
2060 static tree cp_parser_new_expression
2064 static tree cp_parser_new_type_id
2072 static tree cp_parser_delete_expression
2074 static cp_expr cp_parser_cast_expression
2076 static cp_expr cp_parser_binary_expression
2078 static tree cp_parser_question_colon_clause
2080 static cp_expr cp_parser_assignment_expression
2082 static enum tree_code cp_parser_assignment_operator_opt
2084 static cp_expr cp_parser_expression
2086 static cp_expr cp_parser_constant_expression
2088 static cp_expr cp_parser_builtin_offsetof
2090 static cp_expr cp_parser_lambda_expression
2092 static void cp_parser_lambda_introducer
2094 static bool cp_parser_lambda_declarator_opt
2096 static void cp_parser_lambda_body
2099 /* Statements [gram.stmt.stmt] */
2101 static void cp_parser_statement
2103 static void cp_parser_label_for_labeled_statement
2105 static tree cp_parser_expression_statement
2107 static tree cp_parser_compound_statement
2109 static void cp_parser_statement_seq_opt
2111 static tree cp_parser_selection_statement
2113 static tree cp_parser_condition
2115 static tree cp_parser_iteration_statement
2117 static bool cp_parser_init_statement
2119 static tree cp_parser_for
2121 static tree cp_parser_c_for
2123 static tree cp_parser_range_for
2125 static void do_range_for_auto_deduction
2127 static tree cp_parser_perform_range_for_lookup
2129 static tree cp_parser_range_for_member_function
2131 static tree cp_parser_jump_statement
2133 static void cp_parser_declaration_statement
2136 static tree cp_parser_implicitly_scoped_statement
2138 static void cp_parser_already_scoped_statement
2141 /* Declarations [gram.dcl.dcl] */
2143 static void cp_parser_declaration_seq_opt
2145 static void cp_parser_declaration
2147 static void cp_parser_block_declaration
2149 static void cp_parser_simple_declaration
2151 static void cp_parser_decl_specifier_seq
2153 static tree cp_parser_storage_class_specifier_opt
2155 static tree cp_parser_function_specifier_opt
2157 static tree cp_parser_type_specifier
2160 static tree cp_parser_simple_type_specifier
2162 static tree cp_parser_type_name
2164 static tree cp_parser_type_name
2166 static tree cp_parser_nonclass_name
2168 static tree cp_parser_elaborated_type_specifier
2170 static tree cp_parser_enum_specifier
2172 static void cp_parser_enumerator_list
2174 static void cp_parser_enumerator_definition
2176 static tree cp_parser_namespace_name
2178 static void cp_parser_namespace_definition
2180 static void cp_parser_namespace_body
2182 static tree cp_parser_qualified_namespace_specifier
2184 static void cp_parser_namespace_alias_definition
2186 static bool cp_parser_using_declaration
2188 static void cp_parser_using_directive
2190 static tree cp_parser_alias_declaration
2192 static void cp_parser_asm_definition
2194 static void cp_parser_linkage_specification
2196 static void cp_parser_static_assert
2198 static tree cp_parser_decltype
2200 static tree cp_parser_decomposition_declaration
2203 /* Declarators [gram.dcl.decl] */
2205 static tree cp_parser_init_declarator
2212 static enum tree_code cp_parser_ptr_operator
2214 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2216 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2218 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2220 static tree cp_parser_tx_qualifier_opt
2222 static tree cp_parser_late_return_type_opt
2224 static tree cp_parser_declarator_id
2226 static tree cp_parser_type_id
2228 static tree cp_parser_template_type_arg
2231 static tree cp_parser_type_id_1
2233 static void cp_parser_type_specifier_seq
2235 static tree cp_parser_parameter_declaration_clause
2237 static tree cp_parser_parameter_declaration_list
2241 static tree cp_parser_default_argument
2243 static void cp_parser_function_body
2245 static tree cp_parser_initializer
2247 static cp_expr cp_parser_initializer_clause
2249 static cp_expr cp_parser_braced_list
2254 static void cp_parser_ctor_initializer_opt_and_function_body
2257 static tree cp_parser_late_parsing_omp_declare_simd
2260 static tree cp_parser_late_parsing_oacc_routine
2263 static tree synthesize_implicit_template_parm
2265 static tree finish_fully_implicit_template
2267 static void abort_fully_implicit_template
2270 /* Classes [gram.class] */
2272 static tree cp_parser_class_name
2274 static tree cp_parser_class_specifier
2276 static tree cp_parser_class_head
2278 static enum tag_types cp_parser_class_key
2280 static void cp_parser_type_parameter_key
2282 static void cp_parser_member_specification_opt
2284 static void cp_parser_member_declaration
2286 static tree cp_parser_pure_specifier
2288 static tree cp_parser_constant_initializer
2291 /* Derived classes [gram.class.derived] */
2293 static tree cp_parser_base_clause
2295 static tree cp_parser_base_specifier
2298 /* Special member functions [gram.special] */
2300 static tree cp_parser_conversion_function_id
2302 static tree cp_parser_conversion_type_id
2306 static void cp_parser_ctor_initializer_opt
2308 static void cp_parser_mem_initializer_list
2310 static tree cp_parser_mem_initializer
2312 static tree cp_parser_mem_initializer_id
2315 /* Overloading [gram.over] */
2317 static cp_expr cp_parser_operator_function_id
2319 static cp_expr cp_parser_operator
2322 /* Templates [gram.temp] */
2324 static void cp_parser_template_declaration
2326 static tree cp_parser_template_parameter_list
2328 static tree cp_parser_template_parameter
2330 static tree cp_parser_type_parameter
2332 static tree cp_parser_template_id
2334 static tree cp_parser_template_name
2336 static tree cp_parser_template_argument_list
2338 static tree cp_parser_template_argument
2340 static void cp_parser_explicit_instantiation
2342 static void cp_parser_explicit_specialization
2345 /* Exception handling [gram.exception] */
2347 static tree cp_parser_try_block
2349 static void cp_parser_function_try_block
2351 static void cp_parser_handler_seq
2353 static void cp_parser_handler
2355 static tree cp_parser_exception_declaration
2357 static tree cp_parser_throw_expression
2359 static tree cp_parser_exception_specification_opt
2361 static tree cp_parser_type_id_list
2364 /* GNU Extensions */
2366 static tree cp_parser_asm_specification_opt
2368 static tree cp_parser_asm_operand_list
2370 static tree cp_parser_asm_clobber_list
2372 static tree cp_parser_asm_label_list
2374 static bool cp_next_tokens_can_be_attribute_p
2376 static bool cp_next_tokens_can_be_gnu_attribute_p
2378 static bool cp_next_tokens_can_be_std_attribute_p
2380 static bool cp_nth_tokens_can_be_std_attribute_p
2382 static bool cp_nth_tokens_can_be_gnu_attribute_p
2384 static bool cp_nth_tokens_can_be_attribute_p
2386 static tree cp_parser_attributes_opt
2388 static tree cp_parser_gnu_attributes_opt
2390 static tree cp_parser_gnu_attribute_list
2392 static tree cp_parser_std_attribute
2394 static tree cp_parser_std_attribute_spec
2396 static tree cp_parser_std_attribute_spec_seq
2398 static size_t cp_parser_skip_attributes_opt
2400 static bool cp_parser_extension_opt
2402 static void cp_parser_label_declaration
2405 /* Concept Extensions */
2407 static tree cp_parser_requires_clause
2409 static tree cp_parser_requires_clause_opt
2411 static tree cp_parser_requires_expression
2413 static tree cp_parser_requirement_parameter_list
2415 static tree cp_parser_requirement_body
2417 static tree cp_parser_requirement_list
2419 static tree cp_parser_requirement
2421 static tree cp_parser_simple_requirement
2423 static tree cp_parser_compound_requirement
2425 static tree cp_parser_type_requirement
2427 static tree cp_parser_nested_requirement
2430 /* Transactional Memory Extensions */
2432 static tree cp_parser_transaction
2434 static tree cp_parser_transaction_expression
2436 static void cp_parser_function_transaction
2438 static tree cp_parser_transaction_cancel
2442 pragma_external,
2443 pragma_member,
2444 pragma_objc_icode,
2445 pragma_stmt,
2446 pragma_compound
2447 };
2448 static bool cp_parser_pragma
2451 /* Objective-C++ Productions */
2453 static tree cp_parser_objc_message_receiver
2455 static tree cp_parser_objc_message_args
2457 static tree cp_parser_objc_message_expression
2459 static cp_expr cp_parser_objc_encode_expression
2461 static tree cp_parser_objc_defs_expression
2463 static tree cp_parser_objc_protocol_expression
2465 static tree cp_parser_objc_selector_expression
2467 static cp_expr cp_parser_objc_expression
2469 static bool cp_parser_objc_selector_p
2471 static tree cp_parser_objc_selector
2473 static tree cp_parser_objc_protocol_refs_opt
2475 static void cp_parser_objc_declaration
2477 static tree cp_parser_objc_statement
2479 static bool cp_parser_objc_valid_prefix_attributes
2481 static void cp_parser_objc_at_property_declaration
2483 static void cp_parser_objc_at_synthesize_declaration
2485 static void cp_parser_objc_at_dynamic_declaration
2487 static tree cp_parser_objc_struct_declaration
2490 /* Utility Routines */
2492 static cp_expr cp_parser_lookup_name
2494 static tree cp_parser_lookup_name_simple
2496 static tree cp_parser_maybe_treat_template_as_class
2498 static bool cp_parser_check_declarator_template_parameters
2500 static bool cp_parser_check_template_parameters
2502 static cp_expr cp_parser_simple_cast_expression
2504 static tree cp_parser_global_scope_opt
2506 static bool cp_parser_constructor_declarator_p
2508 static tree cp_parser_function_definition_from_specifiers_and_declarator
2510 static tree cp_parser_function_definition_after_declarator
2512 static bool cp_parser_template_declaration_after_export
2514 static void cp_parser_perform_template_parameter_access_checks
2516 static tree cp_parser_single_declaration
2518 static cp_expr cp_parser_functional_cast
2520 static tree cp_parser_save_member_function_body
2522 static tree cp_parser_save_nsdmi
2524 static tree cp_parser_enclosed_template_argument_list
2526 static void cp_parser_save_default_args
2528 static void cp_parser_late_parsing_for_member
2530 static tree cp_parser_late_parse_one_default_arg
2532 static void cp_parser_late_parsing_nsdmi
2534 static void cp_parser_late_parsing_default_args
2536 static tree cp_parser_sizeof_operand
2538 static cp_expr cp_parser_trait_expr
2540 static bool cp_parser_declares_only_class_p
2542 static void cp_parser_set_storage_class
2544 static void cp_parser_set_decl_spec_type
2546 static void set_and_check_decl_spec_loc
2549 static bool cp_parser_friend_p
2551 static void cp_parser_required_error
2557 static bool cp_parser_token_starts_function_definition_p
2559 static bool cp_parser_next_token_starts_class_definition_p
2561 static bool cp_parser_next_token_ends_template_argument_p
2563 static bool cp_parser_nth_token_starts_template_argument_list_p
2565 static enum tag_types cp_parser_token_is_class_key
2567 static enum tag_types cp_parser_token_is_type_parameter_key
2569 static void cp_parser_check_class_key
2571 static void cp_parser_check_access_in_redeclaration
2573 static bool cp_parser_optional_template_keyword
2575 static void cp_parser_pre_parsed_nested_name_specifier
2577 static bool cp_parser_cache_group
2579 static tree cp_parser_cache_defarg
2581 static void cp_parser_parse_tentatively
2583 static void cp_parser_commit_to_tentative_parse
2585 static void cp_parser_commit_to_topmost_tentative_parse
2587 static void cp_parser_abort_tentative_parse
2589 static bool cp_parser_parse_definitely
2593 static bool cp_parser_uncommitted_to_tentative_parse_p
2595 static void cp_parser_error
2597 static void cp_parser_name_lookup_error
2599 static bool cp_parser_simulate_error
2601 static bool cp_parser_check_type_definition
2603 static void cp_parser_check_for_definition_in_return_type
2605 static void cp_parser_check_for_invalid_template_id
2607 static bool cp_parser_non_integral_constant_expression
2609 static void cp_parser_diagnose_invalid_type_name
2611 static bool cp_parser_parse_and_diagnose_invalid_type_name
2613 static int cp_parser_skip_to_closing_parenthesis
2615 static void cp_parser_skip_to_end_of_statement
2617 static void cp_parser_consume_semicolon_at_end_of_statement
2619 static void cp_parser_skip_to_end_of_block_or_statement
2621 static bool cp_parser_skip_to_closing_brace
2623 static void cp_parser_skip_to_end_of_template_parameter_list
2625 static void cp_parser_skip_to_pragma_eol
2627 static bool cp_parser_error_occurred
2629 static bool cp_parser_allow_gnu_extensions_p
2631 static bool cp_parser_is_pure_string_literal
2633 static bool cp_parser_is_string_literal
2635 static bool cp_parser_is_keyword
2637 static tree cp_parser_make_typename_type
2641 static bool cp_parser_compound_literal_p
2643 static bool cp_parser_array_designator_p
2645 static bool cp_parser_init_statement_p
2647 static bool cp_parser_skip_to_closing_square_bracket
2650 /* Concept-related syntactic transformations */
2655 // -------------------------------------------------------------------------- //
2656 // Unevaluated Operand Guard
2657 //
2658 // Implementation of an RAII helper for unevaluated operand parsing.
2660 {
2663 }
2666 {
2669 }
2671 // -------------------------------------------------------------------------- //
2672 // Tentative Parsing
2674 /* Returns nonzero if we are parsing tentatively. */
2678 {
2680 }
2682 /* Returns nonzero if TOKEN is a string literal. */
2684 static bool
2686 {
2692 }
2694 /* Returns nonzero if TOKEN is a string literal
2695 of a user-defined string literal. */
2697 static bool
2699 {
2706 }
2708 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2710 static bool
2712 {
2714 }
2716 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2717 PRAGMA_NONE. */
2719 static enum pragma_kind
2721 {
2724 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2726 }
2728 /* Helper function for cp_parser_error.
2729 Having peeked a token of kind TOK1_KIND that might signify
2730 a conflict marker, peek successor tokens to determine
2731 if we actually do have a conflict marker.
2732 Specifically, we consider a run of 7 '<', '=' or '>' characters
2733 at the start of a line as a conflict marker.
2734 These come through the lexer as three pairs and a single,
2735 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2736 If it returns true, *OUT_LOC is written to with the location/range
2737 of the marker. */
2739 static bool
2742 {
2753 /* It must be at the start of the line. */
2758 /* We have a conflict marker. Construct a location of the form:
2759 <<<<<<<
2760 ^~~~~~~
2761 with start == caret, finishing at the end of the marker. */
2766 }
2768 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2769 RT_CLOSE_PAREN. */
2773 {
2775 {
2783 }
2784 }
2786 /* Attempt to convert TOKEN_DESC from a required_token to an
2787 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2789 static enum cpp_ttype
2791 {
2793 {
2814 /* Use CPP_EOF as a "no completions possible" code. */
2816 }
2817 }
2820 /* Subroutine of cp_parser_error and cp_parser_required_error.
2822 Issue a diagnostic of the form
2823 FILE:LINE: MESSAGE before TOKEN
2824 where TOKEN is the next token in the input stream. MESSAGE
2825 (specified by the caller) is usually of the form "expected
2826 OTHER-TOKEN".
2828 This bypasses the check for tentative passing, and potentially
2829 adds material needed by cp_parser_required_error.
2831 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2832 suggesting insertion of the missing token.
2834 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2835 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2836 location. */
2838 static void
2840 required_token missing_token_desc,
2841 location_t matching_location)
2842 {
2844 /* This diagnostic makes more sense if it is tagged to the line
2845 of the token we just peeked at. */
2849 {
2854 }
2856 /* If this is actually a conflict marker, report it as such. */
2860 {
2861 location_t loc;
2863 {
2866 /* Consume tokens until the end of the source line. */
2868 {
2878 }
2880 }
2881 }
2888 {
2889 /* Potentially supply a fix-it hint, suggesting to add the
2890 missing token immediately after the *previous* token.
2891 This may move the primary location within richloc. */
2893 location_t prev_token_loc
2897 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2898 Attempt to consolidate diagnostics by printing it as a
2899 secondary range within the main diagnostic. */
2901 added_matching_location
2903 }
2905 /* Actually emit the error. */
2907 /* Because c_parser_error does not understand
2908 CPP_KEYWORD, keywords are treated like
2909 identifiers. */
2914 {
2915 /* If we weren't able to consolidate matching_location, then
2916 print it as a secondary diagnostic. */
2921 }
2922 }
2924 /* If not parsing tentatively, issue a diagnostic of the form
2925 FILE:LINE: MESSAGE before TOKEN
2926 where TOKEN is the next token in the input stream. MESSAGE
2927 (specified by the caller) is usually of the form "expected
2928 OTHER-TOKEN". */
2930 static void
2932 {
2935 }
2937 /* Issue an error about name-lookup failing. NAME is the
2938 IDENTIFIER_NODE DECL is the result of
2939 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2940 the thing that we hoped to find. */
2942 static void
2944 tree name,
2945 tree decl,
2946 name_lookup_error desired,
2947 location_t location)
2948 {
2949 /* If name lookup completely failed, tell the user that NAME was not
2950 declared. */
2952 {
2965 else
2967 }
2969 {
2971 {
2988 }
2989 }
2991 {
2993 {
3003 name);
3007 }
3008 }
3009 else
3010 {
3012 {
3025 }
3026 }
3027 }
3029 /* If we are parsing tentatively, remember that an error has occurred
3030 during this tentative parse. Returns true if the error was
3031 simulated; false if a message should be issued by the caller. */
3033 static bool
3035 {
3037 {
3040 }
3042 }
3044 /* This function is called when a type is defined. If type
3045 definitions are forbidden at this point, an error message is
3046 issued. */
3048 static bool
3050 {
3051 /* If types are forbidden here, issue a message. */
3053 {
3054 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3055 in the message need to be interpreted. */
3058 }
3060 }
3062 /* This function is called when the DECLARATOR is processed. The TYPE
3063 was a type defined in the decl-specifiers. If it is invalid to
3064 define a type in the decl-specifiers for DECLARATOR, an error is
3065 issued. TYPE_LOCATION is the location of TYPE and is used
3066 for error reporting. */
3068 static void
3071 {
3072 /* [dcl.fct] forbids type definitions in return types.
3073 Unfortunately, it's not easy to know whether or not we are
3074 processing a return type until after the fact. */
3082 {
3087 type);
3088 }
3089 }
3091 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3092 "<" in any valid C++ program. If the next token is indeed "<",
3093 issue a message warning the user about what appears to be an
3094 invalid attempt to form a template-id. LOCATION is the location
3095 of the type-specifier (TYPE) */
3097 static void
3099 tree type,
3101 location_t location)
3102 {
3106 {
3112 {
3115 else
3117 }
3118 else
3120 /* Remember the location of the invalid "<". */
3123 /* Consume the "<". */
3125 /* Parse the template arguments. */
3127 /* Permanently remove the invalid template arguments so that
3128 this error message is not issued again. */
3131 }
3132 }
3134 /* If parsing an integral constant-expression, issue an error message
3135 about the fact that THING appeared and return true. Otherwise,
3136 return false. In either case, set
3137 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3139 static bool
3141 non_integral_constant thing)
3142 {
3145 {
3147 {
3150 {
3153 "ISO C++ forbids using a floating-point literal "
3158 "enumeration type cannot appear in a "
3249 }
3253 }
3254 }
3256 }
3258 /* Emit a diagnostic for an invalid type name. This function commits
3259 to the current active tentative parse, if any. (Otherwise, the
3260 problematic construct might be encountered again later, resulting
3261 in duplicate error messages.) LOCATION is the location of ID. */
3263 static void
3265 location_t location)
3266 {
3269 /* Try to lookup the identifier. */
3276 /* If the lookup was ambiguous, an error will already have
3277 been issued. */
3279 /* If the lookup found a template-name, it means that the user forgot
3280 to specify an argument list. Emit a useful error message. */
3282 {
3285 decl);
3290 }
3294 /* Something like 'unsigned A a;' */
3297 {
3298 /* Issue an error message. */
3299 name_hint hint;
3303 {
3309 }
3310 else
3312 /* If we're in a template class, it's possible that the user was
3313 referring to a type from a base class. For example:
3315 template <typename T> struct A { typedef T X; };
3316 template <typename T> struct B : public A<T> { X x; };
3318 The user should have said "typename A<T>::X". */
3334 {
3335 tree b;
3338 b;
3340 {
3344 {
3345 tree field;
3346 /* Go from a particular instantiation of the
3347 template (which will have an empty TYPE_FIELDs),
3348 to the main version. */
3351 field;
3355 {
3360 }
3363 }
3364 }
3365 }
3366 }
3367 /* Here we diagnose qualified-ids where the scope is actually correct,
3368 but the identifier does not resolve to a valid type name. */
3370 {
3372 {
3381 else
3390 }
3393 {
3394 /* A<T>::A<T>() */
3400 }
3403 {
3406 "need %<typename%> before %<%T::%D::%E%> because "
3410 id,
3413 else
3417 }
3419 {
3431 else
3437 }
3438 else
3440 }
3441 }
3443 /* Check for a common situation where a type-name should be present,
3444 but is not, and issue a sensible error message. Returns true if an
3445 invalid type-name was detected.
3447 The situation handled by this function are variable declarations of the
3448 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3449 Usually, `ID' should name a type, but if we got here it means that it
3450 does not. We try to emit the best possible error message depending on
3451 how exactly the id-expression looks like. */
3453 static bool
3455 {
3456 tree id;
3459 /* Avoid duplicate error about ambiguous lookup. */
3461 {
3465 }
3474 /* If the next token is a (, this is a function with no explicit return
3475 type, i.e. constructor, destructor or conversion op. */
3478 {
3481 }
3485 /* Emit a diagnostic for the invalid type. */
3487 out:
3488 /* If we aren't in the middle of a declarator (i.e. in a
3489 parameter-declaration-clause), skip to the end of the declaration;
3490 there's no point in trying to process it. */
3494 }
3496 /* Consume tokens up to, and including, the next non-nested closing `)'.
3497 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3498 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3499 found an unnested token of that type. */
3501 static int
3504 cpp_ttype or_ttype,
3506 {
3517 {
3520 /* Have we found what we're looking for before the closing paren? */
3526 {
3529 /* If we've run out of tokens, then there is no closing `)'. */
3532 /* This is good for lambda expression capture-lists. */
3542 /* This matches the processing in skip_to_end_of_statement. */
3562 {
3566 }
3576 condop_depth--;
3581 }
3583 /* Consume the token. */
3585 }
3586 }
3588 /* Consume tokens up to, and including, the next non-nested closing `)'.
3589 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3590 are doing error recovery. Returns -1 if OR_COMMA is true and we
3591 found an unnested token of that type. */
3593 static int
3598 {
3602 }
3604 /* Consume tokens until we reach the end of the current statement.
3605 Normally, that will be just before consuming a `;'. However, if a
3606 non-nested `}' comes first, then we stop before consuming that. */
3608 static void
3610 {
3613 /* Unwind generic function template scope if necessary. */
3618 {
3622 {
3625 /* If we've run out of tokens, stop. */
3629 /* If the next token is a `;', we have reached the end of the
3630 statement. */
3636 /* If this is a non-nested '}', stop before consuming it.
3637 That way, when confronted with something like:
3639 { 3 + }
3641 we stop before consuming the closing '}', even though we
3642 have not yet reached a `;'. */
3646 /* If it is the closing '}' for a block that we have
3647 scanned, stop -- but only after consuming the token.
3648 That way given:
3650 void f g () { ... }
3651 typedef int I;
3653 we will stop after the body of the erroneously declared
3654 function, but before consuming the following `typedef'
3655 declaration. */
3657 {
3660 }
3669 }
3671 /* Consume the token. */
3673 }
3674 }
3676 /* This function is called at the end of a statement or declaration.
3677 If the next token is a semicolon, it is consumed; otherwise, error
3678 recovery is attempted. */
3680 static void
3682 {
3683 /* Look for the trailing `;'. */
3685 {
3686 /* If there is additional (erroneous) input, skip to the end of
3687 the statement. */
3689 /* If the next token is now a `;', consume it. */
3692 }
3693 }
3695 /* Skip tokens until we have consumed an entire block, or until we
3696 have consumed a non-nested `;'. */
3698 static void
3700 {
3703 /* Unwind generic function template scope if necessary. */
3708 {
3712 {
3715 /* If we've run out of tokens, stop. */
3719 /* Stop if this is an unnested ';'. */
3725 /* Stop if this is an unnested '}', or closes the outermost
3726 nesting level. */
3727 nesting_depth--;
3735 /* Nest. */
3736 nesting_depth++;
3741 }
3743 /* Consume the token. */
3745 }
3746 }
3748 /* Skip tokens until a non-nested closing curly brace is the next
3749 token, or there are no more tokens. Return true in the first case,
3750 false otherwise. */
3752 static bool
3754 {
3758 {
3762 {
3765 /* If we've run out of tokens, stop. */
3769 /* If the next token is a non-nested `}', then we have reached
3770 the end of the current block. */
3776 /* If it the next token is a `{', then we are entering a new
3777 block. Consume the entire block. */
3783 }
3785 /* Consume the token. */
3787 }
3788 }
3790 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3791 parameter is the PRAGMA token, allowing us to purge the entire pragma
3792 sequence. */
3794 static void
3796 {
3801 do
3805 /* Ensure that the pragma is not parsed again. */
3807 }
3809 /* Require pragma end of line, resyncing with it as necessary. The
3810 arguments are as for cp_parser_skip_to_pragma_eol. */
3812 static void
3814 {
3818 }
3820 /* This is a simple wrapper around make_typename_type. When the id is
3821 an unresolved identifier node, we can provide a superior diagnostic
3822 using cp_parser_diagnose_invalid_type_name. */
3824 static tree
3826 location_t id_location)
3827 {
3828 tree result;
3830 {
3836 }
3838 }
3840 /* This is a wrapper around the
3841 make_{pointer,ptrmem,reference}_declarator functions that decides
3842 which one to call based on the CODE and CLASS_TYPE arguments. The
3843 CODE argument should be one of the values returned by
3844 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3845 appertain to the pointer or reference. */
3849 cp_cv_quals cv_qualifiers,
3851 tree attributes)
3852 {
3859 else
3869 }
3871 /* Create a new C++ parser. */
3875 {
3880 /* cp_lexer_new_main is called before doing GC allocation because
3881 cp_lexer_new_main might load a PCH file. */
3884 /* Initialize the binops_by_token so that we can get the tree
3885 directly from the token. */
3893 /* For now, we always accept GNU extensions. */
3896 /* The `>' token is a greater-than operator, not the end of a
3897 template-id. */
3902 /* We are not parsing a constant-expression. */
3907 /* Local variable names are not forbidden. */
3910 /* We are not processing an `extern "C"' declaration. */
3913 /* We are not processing a declarator. */
3916 /* We are not processing a template-argument-list. */
3919 /* We are not in an iteration statement. */
3922 /* We are not in a switch statement. */
3925 /* We are not parsing a type-id inside an expression. */
3928 /* Declarations aren't implicitly extern "C". */
3931 /* String literals should be translated to the execution character set. */
3934 /* We are not parsing a function body. */
3937 /* We can correct until told otherwise. */
3940 /* The unparsed function queue is empty. */
3943 /* There are no classes being defined. */
3946 /* No template parameters apply. */
3949 /* Special parsing data structures. */
3953 /* Not declaring an implicit function template. */
3959 /* Allow constrained-type-specifiers. */
3962 /* We haven't yet seen an 'extern "C"'. */
3966 }
3968 /* Create a cp_lexer structure which will emit the tokens in CACHE
3969 and push it onto the parser's lexer stack. This is used for delayed
3970 parsing of in-class method bodies and default arguments, and should
3971 not be confused with tentative parsing. */
3972 static void
3974 {
3979 /* Move the current source position to that of the first token in the
3980 new lexer. */
3982 }
3984 /* Pop the top lexer off the parser stack. This is never used for the
3985 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3986 static void
3988 {
3993 /* Put the current source position back where it was before this
3994 lexer was pushed. */
3996 }
3998 /* Lexical conventions [gram.lex] */
4000 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
4001 identifier. */
4003 static cp_expr
4005 {
4008 /* Look for the identifier. */
4010 /* Return the value. */
4013 else
4015 }
4017 /* Parse a sequence of adjacent string constants. Returns a
4018 TREE_STRING representing the combined, nul-terminated string
4019 constant. If TRANSLATE is true, translate the string to the
4020 execution character set. If WIDE_OK is true, a wide string is
4021 invalid here.
4023 C++98 [lex.string] says that if a narrow string literal token is
4024 adjacent to a wide string literal token, the behavior is undefined.
4025 However, C99 6.4.5p4 says that this results in a wide string literal.
4026 We follow C99 here, for consistency with the C front end.
4028 This code is largely lifted from lex_string() in c-lex.c.
4030 FUTURE: ObjC++ will need to handle @-strings here. */
4031 static cp_expr
4034 {
4035 tree value;
4042 tree string_tree;
4048 {
4051 }
4056 {
4060 }
4061 else
4062 {
4065 }
4068 /* Try to avoid the overhead of creating and destroying an obstack
4069 for the common case of just one string. */
4072 {
4080 {
4084 }
4085 else
4089 }
4090 else
4091 {
4096 do
4097 {
4099 count++;
4104 {
4107 {
4110 }
4113 {
4118 }
4120 }
4121 else
4125 {
4129 {
4133 "unsupported non-standard concatenation "
4135 }
4136 }
4144 {
4148 }
4149 else
4150 {
4154 }
4155 }
4158 /* A string literal built by concatenation has its caret=start at
4159 the start of the initial string, and its finish at the finish of
4160 the final string literal. */
4164 }
4167 {
4170 }
4174 {
4179 {
4194 }
4199 {
4204 else
4206 }
4207 }
4208 else
4209 /* cpp_interpret_string has issued an error. */
4216 }
4218 /* Look up a literal operator with the name and the exact arguments. */
4220 static tree
4222 {
4223 tree decl;
4229 {
4235 {
4238 {
4248 }
4251 /* May be this should be sufficient_parms_p instead,
4252 depending on how exactly should user-defined literals
4253 work in presence of default arguments on the literal
4254 operator parameters. */
4257 }
4258 }
4261 }
4263 /* Parse a user-defined char constant. Returns a call to a user-defined
4264 literal operator taking the character as an argument. */
4266 static cp_expr
4268 {
4276 /* Build up a call to the user-defined operator */
4277 /* Lookup the name we got back from the id-expression. */
4282 {
4287 }
4291 }
4293 /* A subroutine of cp_parser_userdef_numeric_literal to
4294 create a char... template parameter pack from a string node. */
4296 static tree
4298 {
4299 tree charvec;
4305 /* Fill in CHARVEC with all of the parameters. */
4308 {
4317 }
4319 /* Build the argument packs. */
4325 }
4327 /* A subroutine of cp_parser_userdef_numeric_literal to
4328 create a char... template parameter pack from a string node. */
4330 static tree
4332 {
4333 tree charvec;
4344 /* First template parm is character type. */
4347 /* Fill in CHARVEC with all of the parameters. */
4354 /* Build the argument packs. */
4360 }
4362 /* Parse a user-defined numeric constant. returns a call to a user-defined
4363 literal operator. */
4365 static cp_expr
4367 {
4378 /* Look for a literal operator taking the exact type of numeric argument
4379 as the literal value. */
4384 {
4386 tf_warning_or_error);
4389 {
4392 long_long_unsigned_type_node);
4393 }
4394 else
4395 {
4399 long_double_type_node);
4403 }
4407 }
4410 /* If the numeric argument didn't work, look for a raw literal
4411 operator taking a const char* argument consisting of the number
4412 in string format. */
4417 {
4419 tf_warning_or_error);
4422 }
4425 /* If the raw literal didn't work, look for a non-type template
4426 function with parameter pack char.... Call the function with
4427 template parameter characters representing the number. */
4431 {
4434 {
4436 num_string);
4438 }
4441 tf_warning_or_error);
4444 }
4448 /* In C++14 the standard library defines complex number suffixes that
4449 conflict with GNU extensions. Prefer them if <complex> is #included. */
4459 {
4464 {
4465 /* No <complex>, so pedwarn and use GNU semantics. */
4468 }
4469 }
4471 bool complained
4478 {
4480 "(from <complex>) to enable the C++14 user-defined literal "
4485 }
4492 else
4493 {
4494 /* Use the built-in semantics. */
4495 tree type;
4497 {
4500 else
4502 }
4511 }
4514 /* Avoid repeated diagnostics. */
4517 }
4519 /* Parse a user-defined string constant. Returns a call to a user-defined
4520 literal operator taking a character pointer and the length of the string
4521 as arguments. */
4523 static tree
4525 {
4534 /* Build up a call to the user-defined operator. */
4535 /* Lookup the name we got back from the id-expression. */
4542 {
4544 tf_warning_or_error);
4547 }
4550 /* Look for a template function with typename parameter CharT
4551 and parameter pack CharT... Call the function with
4552 template parameter characters representing the string. */
4556 {
4560 tf_warning_or_error);
4563 }
4569 }
4572 /* Basic concepts [gram.basic] */
4574 /* Parse a translation-unit.
4576 translation-unit:
4577 declaration-seq [opt]
4579 Returns TRUE if all went well. */
4581 static bool
4583 {
4584 /* The address of the first non-permanent object on the declarator
4585 obstack. */
4590 /* Create the declarator obstack, if necessary. */
4592 {
4594 /* Create the error declarator. */
4596 /* Create the empty parameter list. */
4598 UNKNOWN_LOCATION);
4599 /* Remember where the base of the declarator obstack lies. */
4601 }
4605 /* If there are no tokens left then all went well. */
4607 {
4608 /* Get rid of the token array; we don't need it any more. */
4612 /* This file might have been a context that's implicitly extern
4613 "C". If so, pop the lang context. (Only relevant for PCH.) */
4615 {
4618 }
4620 /* Finish up. */
4624 }
4625 else
4626 {
4629 }
4631 /* Make sure the declarator obstack was fully cleaned up. */
4635 /* All went well. */
4637 }
4639 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4640 decltype context. */
4644 {
4649 }
4651 /* We're about to parse a collection of statements. If we're currently
4652 parsing tentatively, set up a firewall so that any nested
4653 cp_parser_commit_to_tentative_parse won't affect the current context. */
4655 static cp_token_position
4657 {
4664 }
4666 /* We've finished parsing the collection of statements. Wrap up the
4667 firewall and replace the relevant tokens with the parsed form. */
4669 static void
4671 tree expr)
4672 {
4676 /* Finish the firewall level. */
4678 /* And remember the result of the parse for when we try again. */
4684 }
4686 /* Like the above functions, but let the user modify the tokens. Used by
4687 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4688 later parses, so it makes sense to localize the effects of
4689 cp_parser_commit_to_tentative_parse. */
4691 struct tentative_firewall
4692 {
4697 {
4698 /* If we're currently parsing tentatively, start a committed level as a
4699 firewall and then an inner tentative parse. */
4701 {
4705 }
4706 }
4709 {
4711 {
4712 /* Finish the inner tentative parse and the firewall, propagating any
4713 uncommitted error state to the outer tentative parse. */
4719 }
4720 }
4721 };
4723 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4724 This class is for tracking such a matching pair of symbols.
4725 In particular, it tracks the location of the first token,
4726 so that if the second token is missing, we can highlight the
4727 location of the first token when notifying the user about the
4728 problem. */
4731 class token_pair
4732 {
4734 /* token_pair's ctor. */
4737 /* If the next token is the opening symbol for this pair, consume it and
4738 return true.
4739 Otherwise, issue an error and return false.
4740 In either case, record the location of the opening token. */
4743 {
4747 }
4749 /* Consume the next token from PARSER, recording its location as
4750 that of the opening token within the pair. */
4753 {
4758 }
4760 /* If the next token is the closing symbol for this pair, consume it
4761 and return it.
4762 Otherwise, issue an error, highlighting the location of the
4763 corresponding opening token, and return NULL. */
4766 {
4769 m_open_loc);
4770 }
4773 location_t m_open_loc;
4774 };
4776 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4778 struct matching_paren_traits
4779 {
4784 };
4786 /* "matching_parens" is a token_pair<T> class for tracking matching
4787 pairs of parentheses. */
4791 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4793 struct matching_brace_traits
4794 {
4799 };
4801 /* "matching_braces" is a token_pair<T> class for tracking matching
4802 pairs of braces. */
4807 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4808 enclosing parentheses. */
4810 static cp_expr
4812 {
4815 /* Consume the '('. */
4817 matching_parens parens;
4819 /* Start the statement-expression. */
4821 /* Parse the compound-statement. */
4823 /* Finish up. */
4825 /* Consume the ')'. */
4833 }
4835 /* Expressions [gram.expr] */
4837 /* Parse a fold-operator.
4839 fold-operator:
4840 - * / % ^ & | = < > << >>
4841 = -= *= /= %= ^= &= |= <<= >>=
4842 == != <= >= && || , .* ->*
4844 This returns the tree code corresponding to the matched operator
4845 as an int. When the current token matches a compound assignment
4846 opertor, the resulting tree code is the negative value of the
4847 non-assignment operator. */
4849 static int
4851 {
4853 {
4893 }
4894 }
4896 /* Returns true if CODE indicates a binary expression, which is not allowed in
4897 the LHS of a fold-expression. More codes will need to be added to use this
4898 function in other contexts. */
4900 static bool
4902 {
4904 {
4937 }
4938 }
4940 /* If the next token is a suitable fold operator, consume it and return as
4941 the function above. */
4943 static int
4945 {
4951 }
4953 /* Parse a fold-expression.
4955 fold-expression:
4956 ( ... folding-operator cast-expression)
4957 ( cast-expression folding-operator ... )
4958 ( cast-expression folding operator ... folding-operator cast-expression)
4960 Note that the '(' and ')' are matched in primary expression. */
4962 static cp_expr
4964 {
4965 cp_id_kind pidk;
4967 // Left fold.
4969 {
4973 {
4976 }
4983 }
4988 {
4991 }
4994 {
4997 }
5000 /* The operands of a fold-expression are cast-expressions, so binary or
5001 conditional expressions are not allowed. We check this here to avoid
5002 tentative parsing. */
5014 // Right fold.
5019 {
5022 }
5025 // Binary left or right fold.
5030 }
5032 /* Parse a primary-expression.
5034 primary-expression:
5035 literal
5036 this
5037 ( expression )
5038 id-expression
5039 lambda-expression (C++11)
5041 GNU Extensions:
5043 primary-expression:
5044 ( compound-statement )
5045 __builtin_va_arg ( assignment-expression , type-id )
5046 __builtin_offsetof ( type-id , offsetof-expression )
5048 C++ Extensions:
5049 __has_nothrow_assign ( type-id )
5050 __has_nothrow_constructor ( type-id )
5051 __has_nothrow_copy ( type-id )
5052 __has_trivial_assign ( type-id )
5053 __has_trivial_constructor ( type-id )
5054 __has_trivial_copy ( type-id )
5055 __has_trivial_destructor ( type-id )
5056 __has_virtual_destructor ( type-id )
5057 __is_abstract ( type-id )
5058 __is_base_of ( type-id , type-id )
5059 __is_class ( type-id )
5060 __is_empty ( type-id )
5061 __is_enum ( type-id )
5062 __is_final ( type-id )
5063 __is_literal_type ( type-id )
5064 __is_pod ( type-id )
5065 __is_polymorphic ( type-id )
5066 __is_std_layout ( type-id )
5067 __is_trivial ( type-id )
5068 __is_union ( type-id )
5070 Objective-C++ Extension:
5072 primary-expression:
5073 objc-expression
5075 literal:
5076 __null
5078 ADDRESS_P is true iff this expression was immediately preceded by
5079 "&" and therefore might denote a pointer-to-member. CAST_P is true
5080 iff this expression is the target of a cast. TEMPLATE_ARG_P is
5081 true iff this expression is a template argument.
5083 Returns a representation of the expression. Upon return, *IDK
5084 indicates what kind of id-expression (if any) was present. */
5086 static cp_expr
5093 {
5096 /* Assume the primary expression is not an id-expression. */
5099 /* Peek at the next token. */
5102 {
5103 /* literal:
5104 integer-literal
5105 character-literal
5106 floating-literal
5107 string-literal
5108 boolean-literal
5109 pointer-literal
5110 user-defined-literal */
5122 {
5126 }
5127 /* Floating-point literals are only allowed in an integral
5128 constant expression if they are cast to an integral or
5129 enumeration type. */
5133 {
5134 /* CAST_P will be set even in invalid code like "int(2.7 +
5135 ...)". Therefore, we have to check that the next token
5136 is sure to end the cast. */
5138 {
5143 enumerator-definition. */
5145 /* The curly brace at the end of an enum-specifier. */
5147 /* The end of a statement. */
5149 /* The end of the cast-expression. */
5151 /* The end of an array bound. */
5153 /* The closing ">" in a template-argument-list. */
5156 /* C++0x only: A ">>" treated like two ">" tokens,
5157 in a template-argument-list. */
5162 }
5164 /* If we are within a cast, then the constraint that the
5165 cast is to an integral or enumeration type will be
5166 checked at that point. If we are not within a cast, then
5167 this code is invalid. */
5170 }
5190 /* ??? Should wide strings be allowed when parser->translate_strings_p
5191 is false (i.e. in attributes)? If not, we can kill the third
5192 argument to cp_parser_string_literal. */
5198 /* If we see `( { ' then we are looking at the beginning of
5199 a GNU statement-expression. */
5202 {
5203 /* Statement-expressions are not allowed by the standard. */
5207 /* And they're not allowed outside of a function-body; you
5208 cannot, for example, write:
5210 int i = ({ int j = 3; j + 1; });
5212 at class or namespace scope. */
5215 {
5217 "statement-expressions are not allowed outside "
5223 }
5224 else
5226 }
5227 /* Otherwise it's a normal parenthesized expression. */
5228 {
5229 cp_expr expr;
5234 /* Consume the `('. */
5235 matching_parens parens;
5237 /* Within a parenthesized expression, a `>' token is always
5238 the greater-than operator. */
5239 saved_greater_than_is_operator_p
5244 /* Left fold expression. */
5246 else
5247 /* Parse the parenthesized expression. */
5252 {
5259 }
5260 else
5261 /* Let the front end know that this expression was
5262 enclosed in parentheses. This matters in case, for
5263 example, the expression is of the form `A::B', since
5264 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5265 not. */
5268 /* DR 705: Wrapping an unqualified name in parentheses
5269 suppresses arg-dependent lookup. We want to pass back
5270 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5271 (c++/37862), but none of the others. */
5275 /* The `>' token might be the end of a template-id or
5276 template-parameter-list now. */
5277 parser->greater_than_is_operator_p
5280 /* Consume the `)'. */
5289 }
5292 {
5294 {
5295 /* We might have an Objective-C++ message. */
5298 /* If that works out, we're done ... */
5301 /* ... else, fall though to see if it's a lambda. */
5302 }
5304 /* Don't warn about a failed tentative parse. */
5309 }
5313 /* We have an Objective-C++ string literal. */
5320 {
5321 /* These two are the boolean literals. */
5329 /* The `__null' literal. */
5334 /* The `nullptr' literal. */
5339 /* Recognize the `this' keyword. */
5343 {
5347 }
5348 /* Pointers cannot appear in constant-expressions. */
5353 /* The `operator' keyword can be the beginning of an
5354 id-expression. */
5361 {
5362 non_integral_constant name;
5364 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5365 __func__ are the names of variables -- but they are
5366 treated specially. Therefore, they are handled here,
5367 rather than relying on the generic id-expression logic
5368 below. Grammatically, these names are id-expressions.
5370 Consume the token. */
5374 {
5386 }
5391 /* Look up the name. */
5393 }
5396 {
5397 tree expression;
5398 tree type;
5399 source_location type_location;
5400 location_t start_loc
5402 /* The `__builtin_va_arg' construct is used to handle
5403 `va_arg'. Consume the `__builtin_va_arg' token. */
5405 /* Look for the opening `('. */
5406 matching_parens parens;
5408 /* Now, parse the assignment-expression. */
5410 /* Look for the `,'. */
5413 /* Parse the type-id. */
5414 {
5417 }
5418 /* Look for the closing `)'. */
5419 location_t finish_loc
5422 /* Using `va_arg' in a constant-expression is not
5423 allowed. */
5425 NIC_VA_ARG))
5427 /* Construct a location of the form:
5428 __builtin_va_arg (v, int)
5429 ~~~~~~~~~~~~~~~~~~~~~^~~~
5430 with the caret at the type, ranging from the start of the
5431 "__builtin_va_arg" token to the close paren. */
5432 location_t combined_loc
5435 }
5470 // C++ concepts
5474 /* Objective-C++ expressions. */
5484 {
5489 }
5490 /* FALLTHRU */
5494 }
5496 /* An id-expression can start with either an identifier, a
5497 `::' as the beginning of a qualified-id, or the "operator"
5498 keyword. */
5503 {
5504 id_expression:
5505 cp_expr id_expression;
5506 cp_expr decl;
5512 /* Parse the id-expression. */
5513 id_expression
5530 /* If we have a template-id, then no further lookup is
5531 required. If the template-id was for a template-class, we
5532 will sometimes have a TYPE_DECL at this point. */
5536 /* Look up the name. */
5537 else
5538 {
5539 tree ambiguous_decls;
5541 /* If we already know that this lookup is ambiguous, then
5542 we've already issued an error message; there's no reason
5543 to check again. */
5546 {
5549 }
5552 none_type,
5553 template_p,
5558 /* If the lookup was ambiguous, an error will already have
5559 been issued. */
5563 /* In Objective-C++, we may have an Objective-C 2.0
5564 dot-syntax for classes here. */
5569 {
5570 tree component;
5577 component);
5578 /* Build a location of the form:
5579 expr.component
5580 ~~~~~^~~~~~~~~
5581 with caret at the start of the component name (at
5582 input_location), ranging from the start of the id_expression
5583 to the end of the component name. */
5584 location_t combined_loc
5589 }
5591 /* In Objective-C++, an instance variable (ivar) may be preferred
5592 to whatever cp_parser_lookup_name() found.
5593 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5594 rest of c-family, we have to do a little extra work to preserve
5595 any location information in cp_expr "decl". Given that
5596 objc_lookup_ivar is implemented in "c-family" and "objc", we
5597 have a trip through the pure "tree" type, rather than cp_expr.
5598 Naively copying it back to "decl" would implicitly give the
5599 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5600 store an EXPR_LOCATION. Hence we only update "decl" (and
5601 hence its location_t) if we get back a different tree node. */
5603 id_expression);
5607 /* If name lookup gives us a SCOPE_REF, then the
5608 qualifying scope was dependent. */
5610 {
5611 /* At this point, we do not know if DECL is a valid
5612 integral constant expression. We assume that it is
5613 in fact such an expression, so that code like:
5615 template <int N> struct A {
5616 int a[B<N>::i];
5617 };
5619 is accepted. At template-instantiation time, we
5620 will check that B<N>::i is actually a constant. */
5622 }
5623 /* Check to see if DECL is a local variable in a context
5624 where that is forbidden. */
5627 {
5632 }
5633 }
5637 /* It's too difficult to mark ths in all the places where
5638 we know for sure we need to keep the lookup, so do it
5639 now. The cost is extra GC to recycle the lookups
5640 resolved at parse time. */
5643 decl = (finish_id_expression
5645 idk,
5650 template_arg_p,
5657 }
5659 /* Anything else is an error. */
5663 }
5664 }
5672 {
5675 }
5677 /* Parse an id-expression.
5679 id-expression:
5680 unqualified-id
5681 qualified-id
5683 qualified-id:
5684 :: [opt] nested-name-specifier template [opt] unqualified-id
5685 :: identifier
5686 :: operator-function-id
5687 :: template-id
5689 Return a representation of the unqualified portion of the
5690 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5691 a `::' or nested-name-specifier.
5693 Often, if the id-expression was a qualified-id, the caller will
5694 want to make a SCOPE_REF to represent the qualified-id. This
5695 function does not do this in order to avoid wastefully creating
5696 SCOPE_REFs when they are not required.
5698 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5699 `template' keyword.
5701 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5702 uninstantiated templates.
5704 If *TEMPLATE_P is non-NULL, it is set to true iff the
5705 `template' keyword is used to explicitly indicate that the entity
5706 named is a template.
5708 If DECLARATOR_P is true, the id-expression is appearing as part of
5709 a declarator, rather than as part of an expression. */
5711 static cp_expr
5718 {
5722 /* Assume the `template' keyword was not used. */
5726 /* Look for the optional `::' operator. */
5727 global_scope_p
5728 = (!template_keyword_p
5733 /* Look for the optional nested-name-specifier. */
5734 nested_name_specifier_p
5737 check_dependency_p,
5739 declarator_p,
5740 template_keyword_p)
5743 /* If there is a nested-name-specifier, then we are looking at
5744 the first qualified-id production. */
5746 {
5747 tree saved_scope;
5748 tree saved_object_scope;
5749 tree saved_qualifying_scope;
5750 cp_expr unqualified_id;
5753 /* See if the next token is the `template' keyword. */
5757 /* Name lookup we do during the processing of the
5758 unqualified-id might obliterate SCOPE. */
5762 /* Process the final unqualified-id. */
5764 check_dependency_p,
5765 declarator_p,
5767 /* Restore the SAVED_SCOPE for our caller. */
5773 }
5774 /* Otherwise, if we are in global scope, then we are looking at one
5775 of the other qualified-id productions. */
5777 {
5779 tree id;
5781 /* Peek at the next token. */
5784 /* If it's an identifier, and the next token is not a "<", then
5785 we can avoid the template-id case. This is an optimization
5786 for this common case. */
5788 && !cp_parser_nth_token_starts_template_argument_list_p
5793 /* Try a template-id. */
5797 none_type,
5798 declarator_p);
5799 /* If that worked, we're done. */
5803 /* Peek at the next token. (Changes in the token buffer may
5804 have invalidated the pointer obtained above.) */
5808 {
5815 /* Fall through. */
5820 }
5821 }
5822 else
5825 declarator_p,
5826 optional_p);
5827 }
5829 /* Parse an unqualified-id.
5831 unqualified-id:
5832 identifier
5833 operator-function-id
5834 conversion-function-id
5835 ~ class-name
5836 template-id
5838 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5839 keyword, in a construct like `A::template ...'.
5841 Returns a representation of unqualified-id. For the `identifier'
5842 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5843 production a BIT_NOT_EXPR is returned; the operand of the
5844 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5845 other productions, see the documentation accompanying the
5846 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5847 names are looked up in uninstantiated templates. If DECLARATOR_P
5848 is true, the unqualified-id is appearing as part of a declarator,
5849 rather than as part of an expression. */
5851 static cp_expr
5857 {
5860 /* Peek at the next token. */
5864 {
5866 {
5867 tree id;
5869 /* We don't know yet whether or not this will be a
5870 template-id. */
5872 /* Try a template-id. */
5874 check_dependency_p,
5875 none_type,
5876 declarator_p);
5877 /* If it worked, we're done. */
5880 /* Otherwise, it's an ordinary identifier. */
5882 }
5886 check_dependency_p,
5887 none_type,
5888 declarator_p);
5891 {
5892 tree type_decl;
5893 tree qualifying_scope;
5894 tree object_scope;
5895 tree scope;
5898 /* Consume the `~' token. */
5900 /* Parse the class-name. The standard, as written, seems to
5901 say that:
5903 template <typename T> struct S { ~S (); };
5904 template <typename T> S<T>::~S() {}
5906 is invalid, since `~' must be followed by a class-name, but
5907 `S<T>' is dependent, and so not known to be a class.
5908 That's not right; we need to look in uninstantiated
5909 templates. A further complication arises from:
5911 template <typename T> void f(T t) {
5912 t.T::~T();
5913 }
5915 Here, it is not possible to look up `T' in the scope of `T'
5916 itself. We must look in both the current scope, and the
5917 scope of the containing complete expression.
5919 Yet another issue is:
5921 struct S {
5922 int S;
5923 ~S();
5924 };
5926 S::~S() {}
5928 The standard does not seem to say that the `S' in `~S'
5929 should refer to the type `S' and not the data member
5930 `S::S'. */
5932 /* DR 244 says that we look up the name after the "~" in the
5933 same scope as we looked up the qualifying name. That idea
5934 isn't fully worked out; it's more complicated than that. */
5939 /* Check for invalid scopes. */
5941 {
5945 }
5947 {
5951 scope);
5956 }
5959 /* If the name is of the form "X::~X" it's OK even if X is a
5960 typedef. */
5969 {
5972 }
5974 /* ~auto means the destructor of whatever the object is. */
5976 {
5979 "%<~auto%> only available with "
5983 }
5985 /* If there was an explicit qualification (S::~T), first look
5986 in the scope given by the qualification (i.e., S).
5988 Note: in the calls to cp_parser_class_name below we pass
5989 typename_type so that lookup finds the injected-class-name
5990 rather than the constructor. */
5994 {
5999 typename_type,
6002 declarator_p);
6005 }
6006 /* In "N::S::~S", look in "N" as well. */
6008 {
6013 type_decl
6017 typename_type,
6020 declarator_p);
6023 }
6024 /* In "p->S::~T", look in the scope given by "*p" as well. */
6026 {
6031 type_decl
6035 typename_type,
6038 declarator_p);
6041 }
6042 /* Look in the surrounding context. */
6044 {
6050 type_decl
6054 typename_type,
6057 declarator_p);
6060 {
6061 /* We couldn't find a type with this name. If we're parsing
6062 tentatively, fail and try something else. */
6064 {
6067 }
6068 /* Otherwise, accept it and check for a match at instantiation
6069 time. */
6074 }
6075 }
6076 /* If an error occurred, assume that the name of the
6077 destructor is the same as the name of the qualifying
6078 class. That allows us to keep parsing after running
6079 into ill-formed destructor names. */
6085 /* Check that destructor name and scope match. */
6087 {
6094 }
6096 /* [class.dtor]
6098 A typedef-name that names a class shall not be used as the
6099 identifier in the declarator for a destructor declaration. */
6106 type_decl);
6109 }
6113 {
6114 cp_expr id;
6116 /* This could be a template-id, so we try that first. */
6118 /* Try a template-id. */
6121 none_type,
6122 declarator_p);
6123 /* If that worked, we're done. */
6126 /* We still don't know whether we're looking at an
6127 operator-function-id or a conversion-function-id. */
6129 /* Try an operator-function-id. */
6131 /* If that didn't work, try a conversion-function-id. */
6136 }
6137 /* Fall through. */
6144 }
6145 }
6147 /* Parse an (optional) nested-name-specifier.
6149 nested-name-specifier: [C++98]
6150 class-or-namespace-name :: nested-name-specifier [opt]
6151 class-or-namespace-name :: template nested-name-specifier [opt]
6153 nested-name-specifier: [C++0x]
6154 type-name ::
6155 namespace-name ::
6156 nested-name-specifier identifier ::
6157 nested-name-specifier template [opt] simple-template-id ::
6159 PARSER->SCOPE should be set appropriately before this function is
6160 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6161 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6162 in name lookups.
6164 Sets PARSER->SCOPE to the class (TYPE) or namespace
6165 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6166 it unchanged if there is no nested-name-specifier. Returns the new
6167 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6169 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6170 part of a declaration and/or decl-specifier. */
6172 static tree
6179 {
6184 /* Remember where the nested-name-specifier starts. */
6186 {
6189 }
6192 {
6193 tree new_scope;
6194 tree old_scope;
6195 tree saved_qualifying_scope;
6197 /* Spot cases that cannot be the beginning of a
6198 nested-name-specifier. */
6201 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6202 the already parsed nested-name-specifier. */
6204 {
6205 /* Grab the nested-name-specifier and continue the loop. */
6207 /* If we originally encountered this nested-name-specifier
6208 with IS_DECLARATION set to false, we will not have
6209 resolved TYPENAME_TYPEs, so we must do so here. */
6212 {
6217 }
6220 }
6222 /* Spot cases that cannot be the beginning of a
6223 nested-name-specifier. On the second and subsequent times
6224 through the loop, we look for the `template' keyword. */
6226 ;
6227 /* A template-id can start a nested-name-specifier. */
6229 ;
6230 /* DR 743: decltype can be used in a nested-name-specifier. */
6232 ;
6233 else
6234 {
6235 /* If the next token is not an identifier, then it is
6236 definitely not a type-name or namespace-name. */
6239 /* If the following token is neither a `<' (to begin a
6240 template-id), nor a `::', then we are not looking at a
6241 nested-name-specifier. */
6247 {
6251 "found %<:%> in nested-name-specifier, "
6254 }
6257 && !cp_parser_nth_token_starts_template_argument_list_p
6260 }
6262 /* The nested-name-specifier is optional, so we parse
6263 tentatively. */
6266 /* Look for the optional `template' keyword, if this isn't the
6267 first time through the loop. */
6271 /* Save the old scope since the name lookup we are about to do
6272 might destroy it. */
6275 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6276 look up names in "X<T>::I" in order to determine that "Y" is
6277 a template. So, if we have a typename at this point, we make
6278 an effort to look through it. */
6280 && !typename_keyword_p
6285 /* Parse the qualifying entity. */
6286 new_scope
6288 typename_keyword_p,
6289 template_keyword_p,
6290 check_dependency_p,
6291 type_p,
6292 is_declaration);
6293 /* Look for the `::' token. */
6296 /* If we found what we wanted, we keep going; otherwise, we're
6297 done. */
6299 {
6302 /* Restore the OLD_SCOPE since it was valid before the
6303 failed attempt at finding the last
6304 class-or-namespace-name. */
6308 /* If the next token is a decltype, and the one after that is a
6309 `::', then the decltype has failed to resolve to a class or
6310 enumeration type. Give this error even when parsing
6311 tentatively since it can't possibly be valid--and we're going
6312 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6313 won't get another chance.*/
6317 {
6324 /* As below. */
6327 }
6331 {
6332 /* If we have a non-type template-id followed by ::, it can't
6333 possibly be valid. */
6338 {
6341 {
6347 }
6348 else
6349 {
6350 /* Variable template. */
6355 }
6362 /* As below. */
6366 }
6367 }
6371 /* If the next token is an identifier, and the one after
6372 that is a `::', then any valid interpretation would have
6373 found a class-or-namespace-name. */
6379 {
6382 {
6384 {
6385 tree decl;
6386 tree ambiguous_decls;
6389 none_type,
6398 decl);
6400 {
6401 // cp_parser_lookup_name has the same diagnostic,
6402 // thus make sure to emit it at most once.
6405 {
6410 }
6412 }
6413 else
6414 {
6416 cp_parser_name_lookup_error
6419 else
6420 cp_parser_name_lookup_error
6423 }
6424 }
6427 /* Treat this as a successful nested-name-specifier
6428 due to:
6430 [basic.lookup.qual]
6432 If the name found is not a class-name (clause
6433 _class_) or namespace-name (_namespace.def_), the
6434 program is ill-formed. */
6436 }
6438 }
6440 }
6441 /* We've found one valid nested-name-specifier. */
6443 /* Name lookup always gives us a DECL. */
6446 /* Uses of "template" must be followed by actual templates. */
6458 new_scope);
6459 /* If it is a class scope, try to complete it; we are about to
6460 be looking up names inside the class. */
6462 /* Since checking types for dependency can be expensive,
6463 avoid doing it if the type is already complete. */
6465 /* Do not try to complete dependent types. */
6467 {
6469 /* If it is a typedef to current class, use the current
6470 class instead, as the typedef won't have any names inside
6471 it yet. */
6475 }
6476 /* Make sure we look in the right scope the next time through
6477 the loop. */
6479 }
6481 /* If parsing tentatively, replace the sequence of tokens that makes
6482 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6483 token. That way, should we re-parse the token stream, we will
6484 not have to repeat the effort required to do the parse, nor will
6485 we issue duplicate error messages. */
6487 {
6491 /* Reset the contents of the START token. */
6493 /* Retrieve any deferred checks. Do not pop this access checks yet
6494 so the memory will not be reclaimed during token replacing below. */
6502 /* Purge all subsequent tokens. */
6504 }
6510 }
6512 /* Parse a nested-name-specifier. See
6513 cp_parser_nested_name_specifier_opt for details. This function
6514 behaves identically, except that it will an issue an error if no
6515 nested-name-specifier is present. */
6517 static tree
6523 {
6524 tree scope;
6526 /* Look for the nested-name-specifier. */
6528 typename_keyword_p,
6529 check_dependency_p,
6530 type_p,
6531 is_declaration);
6532 /* If it was not present, issue an error message. */
6534 {
6537 }
6540 }
6542 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6543 this is either a class-name or a namespace-name (which corresponds
6544 to the class-or-namespace-name production in the grammar). For
6545 C++0x, it can also be a type-name that refers to an enumeration
6546 type or a simple-template-id.
6548 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6549 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6550 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6551 TYPE_P is TRUE iff the next name should be taken as a class-name,
6552 even the same name is declared to be another entity in the same
6553 scope.
6555 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6556 specified by the class-or-namespace-name. If neither is found the
6557 ERROR_MARK_NODE is returned. */
6559 static tree
6566 {
6567 tree saved_scope;
6568 tree saved_qualifying_scope;
6569 tree saved_object_scope;
6570 tree scope;
6574 /* DR 743: decltype can appear in a nested-name-specifier. */
6576 {
6580 {
6583 }
6587 }
6589 /* Before we try to parse the class-name, we must save away the
6590 current PARSER->SCOPE since cp_parser_class_name will destroy
6591 it. */
6595 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6596 there is no need to look for a namespace-name. */
6597 only_class_p = template_keyword_p
6602 typename_keyword_p,
6603 template_keyword_p,
6605 check_dependency_p,
6607 is_declaration,
6610 /* If that didn't work, try for a namespace-name. */
6612 {
6613 /* Restore the saved scope. */
6617 /* If we are not looking at an identifier followed by the scope
6618 resolution operator, then this is not part of a
6619 nested-name-specifier. (Note that this function is only used
6620 to parse the components of a nested-name-specifier.) */
6625 }
6628 }
6630 /* Return true if we are looking at a compound-literal, false otherwise. */
6632 static bool
6634 {
6637 /* Skip tokens until the next token is a closing parenthesis.
6638 If we find the closing `)', and the next token is a `{', then
6639 we are looking at a compound-literal. */
6640 bool compound_literal_p
6645 /* Roll back the tokens we skipped. */
6649 }
6651 /* Return true if EXPR is the integer constant zero or a complex constant
6652 of zero, without any folding, but ignoring location wrappers. */
6654 bool
6656 {
6659 }
6661 /* Parse a postfix-expression.
6663 postfix-expression:
6664 primary-expression
6665 postfix-expression [ expression ]
6666 postfix-expression ( expression-list [opt] )
6667 simple-type-specifier ( expression-list [opt] )
6668 typename :: [opt] nested-name-specifier identifier
6669 ( expression-list [opt] )
6670 typename :: [opt] nested-name-specifier template [opt] template-id
6671 ( expression-list [opt] )
6672 postfix-expression . template [opt] id-expression
6673 postfix-expression -> template [opt] id-expression
6674 postfix-expression . pseudo-destructor-name
6675 postfix-expression -> pseudo-destructor-name
6676 postfix-expression ++
6677 postfix-expression --
6678 dynamic_cast < type-id > ( expression )
6679 static_cast < type-id > ( expression )
6680 reinterpret_cast < type-id > ( expression )
6681 const_cast < type-id > ( expression )
6682 typeid ( expression )
6683 typeid ( type-id )
6685 GNU Extension:
6687 postfix-expression:
6688 ( type-id ) { initializer-list , [opt] }
6690 This extension is a GNU version of the C99 compound-literal
6691 construct. (The C99 grammar uses `type-name' instead of `type-id',
6692 but they are essentially the same concept.)
6694 If ADDRESS_P is true, the postfix expression is the operand of the
6695 `&' operator. CAST_P is true if this expression is the target of a
6696 cast.
6698 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6699 class member access expressions [expr.ref].
6701 Returns a representation of the expression. */
6703 static cp_expr
6707 {
6709 location_t loc;
6715 /* Peek at the next token. */
6720 /* Some of the productions are determined by keywords. */
6723 {
6728 {
6729 tree type;
6730 cp_expr expression;
6734 /* All of these can be handled in the same way from the point
6735 of view of parsing. Begin by consuming the token
6736 identifying the cast. */
6739 /* New types cannot be defined in the cast. */
6741 parser->type_definition_forbidden_message
6744 /* Look for the opening `<'. */
6746 /* Parse the type to which we are casting. */
6751 /* Look for the closing `>'. */
6753 /* Restore the old message. */
6756 bool saved_greater_than_is_operator_p
6760 /* And the expression which is being cast. */
6761 matching_parens parens;
6765 RT_CLOSE_PAREN);
6769 parser->greater_than_is_operator_p
6772 /* Only type conversions to integral or enumeration types
6773 can be used in constant-expressions. */
6776 {
6779 }
6782 {
6784 postfix_expression
6788 postfix_expression
6792 postfix_expression
6794 tf_warning_or_error);
6797 postfix_expression
6802 }
6804 /* Construct a location e.g. :
6805 reinterpret_cast <int *> (expr)
6806 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6807 ranging from the start of the "*_cast" token to the final closing
6808 paren, with the caret at the start. */
6811 }
6815 {
6816 tree type;
6820 /* Consume the `typeid' token. */
6822 /* Look for the `(' token. */
6823 matching_parens parens;
6825 /* Types cannot be defined in a `typeid' expression. */
6827 parser->type_definition_forbidden_message
6829 /* We can't be sure yet whether we're looking at a type-id or an
6830 expression. */
6832 /* Try a type-id first. */
6837 /* Look for the `)' token. Otherwise, we can't be sure that
6838 we're not looking at an expression: consider `typeid (int
6839 (3))', for example. */
6841 /* If all went well, simply lookup the type-id. */
6844 /* Otherwise, fall back to the expression variant. */
6845 else
6846 {
6847 tree expression;
6849 /* Look for an expression. */
6851 /* Compute its typeid. */
6853 /* Look for the `)' token. */
6855 }
6856 /* Restore the saved message. */
6858 /* `typeid' may not appear in an integral constant expression. */
6862 /* Construct a location e.g. :
6863 typeid (expr)
6864 ^~~~~~~~~~~~~
6865 ranging from the start of the "typeid" token to the final closing
6866 paren, with the caret at the start. */
6868 {
6869 location_t typeid_loc
6873 }
6874 }
6878 {
6879 tree type;
6880 /* The syntax permitted here is the same permitted for an
6881 elaborated-type-specifier. */
6888 }
6894 {
6897 tree p;
6904 {
6907 }
6913 {
6916 postfix_expression
6918 else
6919 {
6923 }
6929 tf_warning_or_error);
6930 else
6931 {
6935 }
6940 postfix_expression
6944 postfix_expression
6947 else
6948 {
6952 }
6957 }
6959 }
6962 {
6963 tree type;
6965 /* If the next thing is a simple-type-specifier, we may be
6966 looking at a functional cast. We could also be looking at
6967 an id-expression. So, we try the functional cast, and if
6968 that doesn't work we fall back to the primary-expression. */
6970 /* Look for the simple-type-specifier. */
6974 CP_PARSER_FLAGS_NONE);
6976 /* Parse the cast itself. */
6978 postfix_expression
6980 /* If that worked, we're done. */
6984 /* If the functional-cast didn't work out, try a
6985 compound-literal. */
6988 {
6993 matching_parens parens;
6996 /* Avoid calling cp_parser_type_id pointlessly, see comment
6997 in cp_parser_cast_expression about c++/29234. */
7000 else
7001 {
7002 /* Parse the type. */
7008 }
7010 /* If things aren't going well, there's no need to
7011 keep going. */
7013 {
7015 /* Parse the brace-enclosed initializer list. */
7018 }
7019 /* If that worked, we're definitely looking at a
7020 compound-literal expression. */
7022 {
7023 /* Warn the user that a compound literal is not
7024 allowed in standard C++. */
7027 /* For simplicity, we disallow compound literals in
7028 constant-expressions. We could
7029 allow compound literals of integer type, whose
7030 initializer was a constant, in constant
7031 expressions. Permitting that usage, as a further
7032 extension, would not change the meaning of any
7033 currently accepted programs. (Of course, as
7034 compound literals are not part of ISO C++, the
7035 standard has nothing to say.) */
7037 NIC_NCC))
7038 {
7041 }
7042 /* Form the representation of the compound-literal. */
7043 postfix_expression
7048 }
7049 }
7051 /* It must be a primary-expression. */
7052 postfix_expression
7055 decltype_p,
7057 }
7059 }
7061 /* Note that we don't need to worry about calling build_cplus_new on a
7062 class-valued CALL_EXPR in decltype when it isn't the end of the
7063 postfix-expression; unary_complex_lvalue will take care of that for
7064 all these cases. */
7066 /* Keep looping until the postfix-expression is complete. */
7068 {
7072 /* It is not a Koenig lookup function call. */
7073 postfix_expression
7076 /* Peek at the next token. */
7080 {
7083 {
7085 "two consecutive %<[%> shall "
7088 }
7089 postfix_expression
7091 postfix_expression,
7093 decltype_p);
7102 /* postfix-expression ( expression-list [opt] ) */
7103 {
7114 is_builtin_constant_p
7117 {
7118 /* The whole point of __builtin_constant_p is to allow
7119 non-constant expressions to appear as arguments. */
7120 saved_integral_constant_expression_p
7122 saved_non_integral_constant_expression_p
7125 }
7126 args = (cp_parser_parenthesized_expression_list
7133 {
7134 parser->integral_constant_expression_p
7136 parser->non_integral_constant_expression_p
7138 }
7141 {
7144 }
7146 /* Function calls are not permitted in
7147 constant-expressions. */
7150 NIC_FUNC_CALL))
7151 {
7155 }
7160 {
7162 {
7164 {
7167 postfix_expression
7169 complain);
7170 }
7171 else
7172 postfix_expression
7174 }
7175 /* We do not perform argument-dependent lookup if
7176 normal lookup finds a non-function, in accordance
7177 with the expected resolution of DR 218. */
7180 {
7184 /* Do not do argument dependent lookup if regular
7185 lookup finds a member function or a block-scope
7186 function declaration. [basic.lookup.argdep]/3 */
7189 {
7192 postfix_expression
7194 complain);
7195 }
7196 }
7197 }
7200 {
7210 {
7212 postfix_expression
7216 }
7219 {
7220 postfix_expression
7221 = (build_new_method_call
7227 complain));
7228 }
7229 else
7230 postfix_expression
7234 complain);
7235 }
7239 postfix_expression = (build_offset_ref_call_from_tree
7241 complain));
7243 /* A call to a static class member, or a namespace-scope
7244 function. */
7245 postfix_expression
7248 koenig_p,
7249 complain);
7250 else
7251 /* All other function calls. */
7252 postfix_expression
7255 koenig_p,
7256 complain);
7259 {
7261 start_loc,
7262 close_paren_loc);
7264 }
7266 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7270 }
7275 /* postfix-expression . template [opt] id-expression
7276 postfix-expression . pseudo-destructor-name
7277 postfix-expression -> template [opt] id-expression
7278 postfix-expression -> pseudo-destructor-name */
7280 /* Consume the `.' or `->' operator. */
7283 postfix_expression
7285 postfix_expression,
7292 /* postfix-expression ++ */
7293 /* Consume the `++' token. */
7295 /* Generate a representation for the complete expression. */
7296 postfix_expression
7298 POSTINCREMENT_EXPR);
7299 /* Increments may not appear in constant-expressions. */
7307 /* postfix-expression -- */
7308 /* Consume the `--' token. */
7310 /* Generate a representation for the complete expression. */
7311 postfix_expression
7313 POSTDECREMENT_EXPR);
7314 /* Decrements may not appear in constant-expressions. */
7325 return is_member_access
7326 ? postfix_expression
7328 else
7330 }
7331 }
7333 /* We should never get here. */
7336 }
7338 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7339 by cp_parser_builtin_offsetof. We're looking for
7341 postfix-expression [ expression ]
7342 postfix-expression [ braced-init-list ] (C++11)
7344 FOR_OFFSETOF is set if we're being called in that context, which
7345 changes how we deal with integer constant expressions. */
7347 static tree
7349 tree postfix_expression,
7352 {
7357 /* Consume the `[' token. */
7363 /* Parse the index expression. */
7364 /* ??? For offsetof, there is a question of what to allow here. If
7365 offsetof is not being used in an integral constant expression context,
7366 then we *could* get the right answer by computing the value at runtime.
7367 If we are in an integral constant expression context, then we might
7368 could accept any constant expression; hard to say without analysis.
7369 Rather than open the barn door too wide right away, allow only integer
7370 constant expressions here. */
7373 else
7374 {
7376 {
7381 }
7382 else
7384 }
7388 /* Look for the closing `]'. */
7391 /* Build the ARRAY_REF. */
7395 /* When not doing offsetof, array references are not permitted in
7396 constant-expressions. */
7402 }
7404 /* A subroutine of cp_parser_postfix_dot_deref_expression. Handle dot
7405 dereference of incomplete type, returns true if error_mark_node should
7406 be returned from caller, otherwise adjusts *SCOPE, *POSTFIX_EXPRESSION
7407 and *DEPENDENT_P. */
7409 bool
7412 {
7413 /* In a template, be permissive by treating an object expression
7414 of incomplete type as dependent (after a pedwarn). */
7415 diagnostic_t kind = (processing_template_decl
7419 {
7431 /* Don't emit any diagnostic for OVERLOADs. */
7435 /* Avoid clobbering e.g. DECLs. */
7439 }
7451 {
7454 }
7456 }
7458 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7459 by cp_parser_builtin_offsetof. We're looking for
7461 postfix-expression . template [opt] id-expression
7462 postfix-expression . pseudo-destructor-name
7463 postfix-expression -> template [opt] id-expression
7464 postfix-expression -> pseudo-destructor-name
7466 FOR_OFFSETOF is set if we're being called in that context. That sorta
7467 limits what of the above we'll actually accept, but nevermind.
7468 TOKEN_TYPE is the "." or "->" token, which will already have been
7469 removed from the stream. */
7471 static tree
7474 cp_expr postfix_expression,
7476 location_t location)
7477 {
7478 tree name;
7484 /* If this is a `->' operator, dereference the pointer. */
7487 tf_warning_or_error);
7488 /* Check to see whether or not the expression is type-dependent and
7489 not the current instantiation. */
7491 /* The identifier following the `->' or `.' is not qualified. */
7497 /* Enter the scope corresponding to the type of the object
7498 given by the POSTFIX_EXPRESSION. */
7500 {
7502 /* According to the standard, no expression should ever have
7503 reference type. Unfortunately, we do not currently match
7504 the standard in this respect in that our internal representation
7505 of an expression may have reference type even when the standard
7506 says it does not. Therefore, we have to manually obtain the
7507 underlying type here. */
7509 /* The type of the POSTFIX_EXPRESSION must be complete. */
7510 /* Unlike the object expression in other contexts, *this is not
7511 required to be of complete type for purposes of class member
7512 access (5.2.5) outside the member function body. */
7516 {
7522 }
7525 {
7526 /* Let the name lookup machinery know that we are processing a
7527 class member access expression. */
7529 /* If something went wrong, we want to be able to discern that case,
7530 as opposed to the case where there was no SCOPE due to the type
7531 of expression being dependent. */
7534 /* If the SCOPE was erroneous, make the various semantic analysis
7535 functions exit quickly -- and without issuing additional error
7536 messages. */
7539 }
7540 }
7543 /* Tell cp_parser_lookup_name that there was an object, even though it's
7544 type-dependent. */
7547 /* Assume this expression is not a pseudo-destructor access. */
7550 /* If the SCOPE is a scalar type, then, if this is a valid program,
7551 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7552 is type dependent, it can be pseudo-destructor-name or something else.
7553 Try to parse it as pseudo-destructor-name first. */
7555 {
7556 tree s;
7557 tree type;
7560 /* Parse the pseudo-destructor-name. */
7569 {
7571 postfix_expression
7574 }
7575 }
7578 {
7579 /* If the SCOPE is not a scalar type, we are looking at an
7580 ordinary class member access expression, rather than a
7581 pseudo-destructor-name. */
7584 /* Parse the id-expression. */
7585 name = (cp_parser_id_expression
7592 /* In general, build a SCOPE_REF if the member name is qualified.
7593 However, if the name was not dependent and has already been
7594 resolved; there is no need to build the SCOPE_REF. For example;
7596 struct X { void f(); };
7597 template <typename T> void f(T* t) { t->X::f(); }
7599 Even though "t" is dependent, "X::f" is not and has been resolved
7600 to a BASELINK; there is no need to include scope information. */
7602 /* But we do need to remember that there was an explicit scope for
7603 virtual function calls. */
7607 /* If the name is a template-id that names a type, we will get a
7608 TYPE_DECL here. That is invalid code. */
7610 {
7613 }
7614 else
7615 {
7617 {
7619 {
7623 }
7624 else
7627 name,
7628 template_p);
7632 }
7634 adjust_result_of_qualified_name_lookup
7636 postfix_expression
7638 template_p,
7639 tf_warning_or_error);
7640 /* Build a location e.g.:
7641 ptr->access_expr
7642 ~~~^~~~~~~~~~~~~
7643 where the caret is at the deref token, ranging from
7644 the start of postfix_expression to the end of the access expr. */
7645 location_t end_loc
7647 location_t combined_loc
7650 }
7651 }
7653 /* We no longer need to look up names in the scope of the object on
7654 the left-hand side of the `.' or `->' operator. */
7657 /* Outside of offsetof, these operators may not appear in
7658 constant-expressions. */
7660 && (cp_parser_non_integral_constant_expression
7665 }
7667 /* Parse a parenthesized expression-list.
7669 expression-list:
7670 assignment-expression
7671 expression-list, assignment-expression
7673 attribute-list:
7674 expression-list
7675 identifier
7676 identifier, expression-list
7678 CAST_P is true if this expression is the target of a cast.
7680 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7681 argument pack.
7683 WRAP_LOCATIONS_P is true if expressions within this list for which
7684 CAN_HAVE_LOCATION_P is false should be wrapped with nodes expressing
7685 their source locations.
7687 Returns a vector of trees. Each element is a representation of an
7688 assignment-expression. NULL is returned if the ( and or ) are
7689 missing. An empty, but allocated, vector is returned on no
7690 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7691 if we are parsing an attribute list for an attribute that wants a
7692 plain identifier argument, normal_attr for an attribute that wants
7693 an expression, or non_attr if we aren't parsing an attribute list. If
7694 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7695 not all of the expressions in the list were constant.
7696 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7697 will be written to with the location of the closing parenthesis. If
7698 an error occurs, it may or may not be written to. */
7708 {
7714 /* Assume all the expressions will be constant. */
7718 matching_parens parens;
7724 /* Within a parenthesized expression, a `>' token is always
7725 the greater-than operator. */
7726 saved_greater_than_is_operator_p
7732 /* Consume expressions until there are no more. */
7735 {
7736 /* At the beginning of attribute lists, check to see if the
7737 next token is an identifier. */
7740 {
7743 /* Consume the identifier. */
7745 /* Save the identifier. */
7747 }
7748 else
7749 {
7752 /* Parse the next assignment-expression. */
7754 {
7755 /* A braced-init-list. */
7761 }
7763 {
7764 expr = (cp_parser_constant_expression
7769 }
7770 else
7772 cast_p);
7777 /* If we have an ellipsis, then this is an expression
7778 expansion. */
7781 {
7782 /* Consume the `...'. */
7785 /* Build the argument pack. */
7787 }
7792 /* Add it to the list. We add error_mark_node
7793 expressions to the list, so that we can still tell if
7794 the correct form for a parenthesized expression-list
7795 is found. That gives better errors. */
7800 }
7802 /* After the first item, attribute lists look the same as
7803 expression lists. */
7806 get_comma:;
7807 /* If the next token isn't a `,', then we are done. */
7811 /* Otherwise, consume the `,' and keep going. */
7813 }
7819 {
7822 skip_comma:;
7823 /* We try and resync to an unnested comma, as that will give the
7824 user better diagnostics. */
7832 {
7833 parser->greater_than_is_operator_p
7836 }
7837 }
7839 parser->greater_than_is_operator_p
7846 }
7848 /* Parse a pseudo-destructor-name.
7850 pseudo-destructor-name:
7851 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7852 :: [opt] nested-name-specifier template template-id :: ~ type-name
7853 :: [opt] nested-name-specifier [opt] ~ type-name
7855 If either of the first two productions is used, sets *SCOPE to the
7856 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7857 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7858 or ERROR_MARK_NODE if the parse fails. */
7860 static void
7862 tree object,
7865 {
7868 /* Handle ~auto. */
7872 {
7875 "%<~auto%> only available with "
7882 }
7884 /* Assume that things will not work out. */
7887 /* Look for the optional `::' operator. */
7889 /* Look for the optional nested-name-specifier. */
7890 nested_name_specifier_p
7897 /* Now, if we saw a nested-name-specifier, we might be doing the
7898 second production. */
7901 {
7902 /* Consume the `template' keyword. */
7904 /* Parse the template-id. */
7908 class_type,
7910 /* Look for the `::' token. */
7912 }
7913 /* If the next token is not a `~', then there might be some
7914 additional qualification. */
7916 {
7917 /* At this point, we're looking for "type-name :: ~". The type-name
7918 must not be a class-name, since this is a pseudo-destructor. So,
7919 it must be either an enum-name, or a typedef-name -- both of which
7920 are just identifiers. So, we peek ahead to check that the "::"
7921 and "~" tokens are present; if they are not, then we can avoid
7922 calling type_name. */
7926 {
7929 }
7931 /* Look for the type-name. */
7936 /* Look for the `::' token. */
7938 }
7939 else
7942 /* Look for the `~'. */
7945 /* Once we see the ~, this has to be a pseudo-destructor. */
7949 /* Look for the type-name again. We are not responsible for
7950 checking that it matches the first type-name. */
7952 }
7954 /* Parse a unary-expression.
7956 unary-expression:
7957 postfix-expression
7958 ++ cast-expression
7959 -- cast-expression
7960 unary-operator cast-expression
7961 sizeof unary-expression
7962 sizeof ( type-id )
7963 alignof ( type-id ) [C++0x]
7964 new-expression
7965 delete-expression
7967 GNU Extensions:
7969 unary-expression:
7970 __extension__ cast-expression
7971 __alignof__ unary-expression
7972 __alignof__ ( type-id )
7973 alignof unary-expression [C++0x]
7974 __real__ cast-expression
7975 __imag__ cast-expression
7976 && identifier
7977 sizeof ( type-id ) { initializer-list , [opt] }
7978 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7979 __alignof__ ( type-id ) { initializer-list , [opt] }
7981 ADDRESS_P is true iff the unary-expression is appearing as the
7982 operand of the `&' operator. CAST_P is true if this expression is
7983 the target of a cast.
7985 Returns a representation of the expression. */
7987 static cp_expr
7990 {
7994 /* Peek at the next token. */
7996 /* Some keywords give away the kind of expression. */
7998 {
8002 {
8005 {
8013 /* Consume the token. */
8015 /* Parse the operand. */
8021 else
8022 {
8023 /* ISO C++ defines alignof only with types, not with
8024 expressions. So pedwarn if alignof is used with a non-
8025 type expression. However, __alignof__ is ok. */
8028 "ISO C++ does not allow %<alignof%> "
8032 }
8033 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8034 SIZEOF_EXPR with the original operand. */
8036 {
8038 {
8040 {
8043 error_mark_node));
8045 }
8046 else
8050 }
8051 }
8053 /* Construct a location e.g. :
8054 alignof (expr)
8055 ^~~~~~~~~~~~~~
8056 with start == caret at the start of the "alignof"/"sizeof"
8057 token, with the endpoint at the final closing paren. */
8058 location_t finish_loc
8060 location_t compound_loc
8067 }
8076 {
8077 /* The saved value of the PEDANTIC flag. */
8079 tree expr;
8081 /* Save away the PEDANTIC flag. */
8083 /* Parse the cast-expression. */
8085 /* Restore the PEDANTIC flag. */
8089 }
8093 {
8094 tree expression;
8096 /* Consume the `__real__' or `__imag__' token. */
8098 /* Parse the cast-expression. */
8100 /* Create the complete representation. */
8104 expression,
8105 tf_warning_or_error);
8106 }
8114 {
8115 tree expr;
8124 matching_parens parens;
8128 parser->type_definition_forbidden_message
8131 saved_integral_constant_expression_p
8133 saved_non_integral_constant_expression_p
8137 saved_greater_than_is_operator_p
8149 parser->greater_than_is_operator_p
8152 parser->integral_constant_expression_p
8154 parser->non_integral_constant_expression_p
8159 location_t finish_loc
8163 /* Construct a location of the form:
8164 noexcept (expr)
8165 ^~~~~~~~~~~~~~~
8166 with start == caret, finishing at the close-paren. */
8167 location_t noexcept_loc
8171 noexcept_loc);
8172 }
8176 }
8177 }
8179 /* Look for the `:: new' and `:: delete', which also signal the
8180 beginning of a new-expression, or delete-expression,
8181 respectively. If the next token is `::', then it might be one of
8182 these. */
8184 {
8187 /* See if the token after the `::' is one of the keywords in
8188 which we're interested. */
8190 /* If it's `new', we have a new-expression. */
8193 /* Similarly, for `delete'. */
8196 }
8198 /* Look for a unary operator. */
8200 /* The `++' and `--' operators can be handled similarly, even though
8201 they are not technically unary-operators in the grammar. */
8203 {
8208 /* Handle the GNU address-of-label extension. */
8211 {
8212 tree identifier;
8213 tree expression;
8216 /* Consume the '&&' token. */
8218 /* Look for the identifier. */
8219 location_t finish_loc
8222 /* Construct a location of the form:
8223 &&label
8224 ^~~~~~~
8225 with caret==start at the "&&", finish at the end of the label. */
8226 location_t combined_loc
8228 /* Create an expression representing the address. */
8231 NIC_ADDR_LABEL))
8234 }
8235 }
8237 {
8238 cp_expr cast_expression;
8244 /* Consume the operator token. */
8248 /* Parse the cast-expression. */
8249 cast_expression
8254 pidk);
8256 /* Make a location:
8257 OP_TOKEN CAST_EXPRESSION
8258 ^~~~~~~~~~~~~~~~~~~~~~~~~
8259 with start==caret at the operator token, and
8260 extending to the end of the cast_expression. */
8263 /* Now, build an appropriate representation. */
8265 {
8269 RO_UNARY_STAR,
8270 complain);
8271 /* TODO: build_x_indirect_ref does not always honor the
8272 location, so ensure it is set. */
8278 /* Fall through. */
8281 cast_expression,
8282 complain);
8283 /* TODO: build_x_unary_op does not always honor the location,
8284 so ensure it is set. */
8292 /* Fall through. */
8294 /* Immediately fold negation of a constant, unless the constant is 0
8295 (since -0 == 0) or it would overflow. */
8300 {
8303 cast_expression);
8305 {
8308 }
8309 }
8310 /* Fall through. */
8319 }
8323 non_constant_p))
8327 }
8331 decltype_p,
8332 pidk);
8333 }
8335 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8336 unary-operator, the corresponding tree code is returned. */
8338 static enum tree_code
8340 {
8342 {
8363 }
8364 }
8366 /* Parse a new-expression.
8368 new-expression:
8369 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8370 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8372 Returns a representation of the expression. */
8374 static tree
8376 {
8379 tree type;
8382 tree ret;
8386 /* Look for the optional `::' operator. */
8387 global_scope_p
8391 /* Look for the `new' operator. */
8393 /* There's no easy way to tell a new-placement from the
8394 `( type-id )' construct. */
8396 /* Look for a new-placement. */
8398 /* If that didn't work out, there's no new-placement. */
8400 {
8404 }
8406 /* If the next token is a `(', then we have a parenthesized
8407 type-id. */
8409 {
8413 /* Consume the `('. */
8414 matching_parens parens;
8417 /* Parse the type-id. */
8418 parser->type_definition_forbidden_message
8420 {
8423 }
8426 /* Look for the closing `)'. */
8429 /* There should not be a direct-new-declarator in this production,
8430 but GCC used to allowed this, so we check and emit a sensible error
8431 message for this case. */
8433 {
8439 }
8440 }
8441 /* Otherwise, there must be a new-type-id. */
8442 else
8445 /* If the next token is a `(' or '{', then we have a new-initializer. */
8450 else
8453 /* A new-expression may not appear in an integral constant
8454 expression. */
8457 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8458 of a new-type-id or type-id of a new-expression, the new-expression shall
8459 contain a new-initializer of the form ( assignment-expression )".
8460 Additionally, consistently with the spirit of DR 1467, we want to accept
8461 'new auto { 2 }' too. */
8467 {
8469 "initialization of new-expression for type %<auto%> "
8472 }
8473 else
8474 {
8475 /* Construct a location e.g.:
8476 ptr = new int[100]
8477 ^~~~~~~~~~~~
8478 with caret == start at the start of the "new" token, and the end
8479 at the end of the final token we consumed. */
8484 /* Create a representation of the new-expression. */
8486 tf_warning_or_error);
8488 }
8496 }
8498 /* Parse a new-placement.
8500 new-placement:
8501 ( expression-list )
8503 Returns the same representation as for an expression-list. */
8507 {
8510 /* Parse the expression-list. */
8511 expression_list = (cp_parser_parenthesized_expression_list
8520 }
8522 /* Parse a new-type-id.
8524 new-type-id:
8525 type-specifier-seq new-declarator [opt]
8527 Returns the TYPE allocated. If the new-type-id indicates an array
8528 type, *NELTS is set to the number of elements in the last array
8529 bound; the TYPE will not include the last array bound. */
8531 static tree
8533 {
8534 cp_decl_specifier_seq type_specifier_seq;
8540 /* The type-specifier sequence must not contain type definitions.
8541 (It cannot contain declarations of new types either, but if they
8542 are not definitions we will catch that because they are not
8543 complete.) */
8545 parser->type_definition_forbidden_message
8547 /* Parse the type-specifier-seq. */
8551 /* Restore the old message. */
8557 /* Parse the new-declarator. */
8560 /* Determine the number of elements in the last array dimension, if
8561 any. */
8563 /* Skip down to the last array dimension. */
8568 {
8571 }
8576 {
8579 }
8582 {
8589 else
8591 }
8594 }
8596 /* Parse an (optional) new-declarator.
8598 new-declarator:
8599 ptr-operator new-declarator [opt]
8600 direct-new-declarator
8602 Returns the declarator. */
8606 {
8609 cp_cv_quals cv_quals;
8611 /* We don't know if there's a ptr-operator next, or not. */
8613 /* Look for a ptr-operator. */
8615 /* If that worked, look for more new-declarators. */
8617 {
8620 /* Parse another optional declarator. */
8623 declarator = cp_parser_make_indirect_declarator
8627 }
8629 /* If the next token is a `[', there is a direct-new-declarator. */
8634 }
8636 /* Parse a direct-new-declarator.
8638 direct-new-declarator:
8639 [ expression ]
8640 direct-new-declarator [constant-expression]
8642 */
8646 {
8650 {
8651 tree expression;
8654 /* Look for the opening `['. */
8659 /* The standard requires that the expression have integral
8660 type. DR 74 adds enumeration types. We believe that the
8661 real intent is that these expressions be handled like the
8662 expression in a `switch' condition, which also allows
8663 classes with a single conversion to integral or
8664 enumeration type. */
8666 {
8667 expression
8669 expression,
8672 {
8674 "expression in new-declarator must have integral "
8677 }
8678 }
8680 /* Look for the closing `]'. */
8683 /* Add this bound to the declarator. */
8686 /* If the next token is not a `[', then there are no more
8687 bounds. */
8690 }
8693 }
8695 /* Parse a new-initializer.
8697 new-initializer:
8698 ( expression-list [opt] )
8699 braced-init-list
8701 Returns a representation of the expression-list. */
8705 {
8709 {
8710 tree t;
8717 }
8718 else
8719 expression_list = (cp_parser_parenthesized_expression_list
8725 }
8727 /* Parse a delete-expression.
8729 delete-expression:
8730 :: [opt] delete cast-expression
8731 :: [opt] delete [ ] cast-expression
8733 Returns a representation of the expression. */
8735 static tree
8737 {
8740 tree expression;
8742 /* Look for the optional `::' operator. */
8743 global_scope_p
8747 /* Look for the `delete' keyword. */
8749 /* See if the array syntax is in use. */
8751 {
8752 /* Consume the `[' token. */
8754 /* Look for the `]' token. */
8756 /* Remember that this is the `[]' construct. */
8758 }
8759 else
8762 /* Parse the cast-expression. */
8765 /* A delete-expression may not appear in an integral constant
8766 expression. */
8771 tf_warning_or_error);
8772 }
8774 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8775 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8776 0 otherwise. */
8778 static int
8780 {
8783 {
8825 /* In ((type ()) () the last () isn't a valid cast-expression,
8826 so the whole must be parsed as postfix-expression. */
8831 /* '[' may start a primary-expression in obj-c++ and in C++11,
8832 as a lambda-expression, eg, '(void)[]{}'. */
8839 /* '++' and '--' may or may not start a cast-expression:
8841 struct T { void operator++(int); };
8842 void f() { (T())++; }
8844 vs
8846 int a;
8847 (int)++a; */
8852 }
8853 }
8855 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8856 in the order: const_cast, static_cast, reinterpret_cast.
8858 Don't suggest dynamic_cast.
8860 Return the first legal cast kind found, or NULL otherwise. */
8864 {
8865 tree trial;
8867 /* Reuse the parser logic by attempting to build the various kinds of
8868 cast, with "complain" disabled.
8869 Identify the first such cast that is valid. */
8871 /* Don't attempt to run such logic within template processing. */
8875 /* First try const_cast. */
8880 /* If that fails, try static_cast. */
8885 /* Finally, try reinterpret_cast. */
8890 /* No such cast possible. */
8892 }
8894 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8895 suggesting how to convert a C-style cast of the form:
8897 (DST_TYPE)ORIG_EXPR
8899 to a C++-style cast.
8901 The primary range of RICHLOC is asssumed to be that of the original
8902 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8903 of the parens in the C-style cast. */
8905 static void
8908 tree dst_type)
8909 {
8910 /* This function is non-trivial, so bail out now if the warning isn't
8911 going to be emitted. */
8915 /* Try to find a legal C++ cast, trying them in order:
8916 const_cast, static_cast, reinterpret_cast. */
8921 /* Replace the open paren with "CAST_SUGGESTION<". */
8922 pretty_printer pp;
8926 /* Replace the close paren with "> (". */
8929 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8931 }
8934 /* Parse a cast-expression.
8936 cast-expression:
8937 unary-expression
8938 ( type-id ) cast-expression
8940 ADDRESS_P is true iff the unary-expression is appearing as the
8941 operand of the `&' operator. CAST_P is true if this expression is
8942 the target of a cast.
8944 Returns a representation of the expression. */
8946 static cp_expr
8949 {
8950 /* If it's a `(', then we might be looking at a cast. */
8952 {
8958 /* There's no way to know yet whether or not this is a cast.
8959 For example, `(int (3))' is a unary-expression, while `(int)
8960 3' is a cast. So, we resort to parsing tentatively. */
8962 /* Types may not be defined in a cast. */
8964 parser->type_definition_forbidden_message
8966 /* Consume the `('. */
8967 matching_parens parens;
8972 /* A very tricky bit is that `(struct S) { 3 }' is a
8973 compound-literal (which we permit in C++ as an extension).
8974 But, that construct is not a cast-expression -- it is a
8975 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8976 is legal; if the compound-literal were a cast-expression,
8977 you'd need an extra set of parentheses.) But, if we parse
8978 the type-id, and it happens to be a class-specifier, then we
8979 will commit to the parse at that point, because we cannot
8980 undo the action that is done when creating a new class. So,
8981 then we cannot back up and do a postfix-expression.
8983 Another tricky case is the following (c++/29234):
8985 struct S { void operator () (); };
8987 void foo ()
8988 {
8989 ( S()() );
8990 }
8992 As a type-id we parse the parenthesized S()() as a function
8993 returning a function, groktypename complains and we cannot
8994 back up in this case either.
8996 Therefore, we scan ahead to the closing `)', and check to see
8997 if the tokens after the `)' can start a cast-expression. Otherwise
8998 we are dealing with an unary-expression, a postfix-expression
8999 or something else.
9001 Yet another tricky case, in C++11, is the following (c++/54891):
9003 (void)[]{};
9005 The issue is that usually, besides the case of lambda-expressions,
9006 the parenthesized type-id cannot be followed by '[', and, eg, we
9007 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9008 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9009 we don't commit, we try a cast-expression, then an unary-expression.
9011 Save tokens so that we can put them back. */
9014 /* We may be looking at a cast-expression. */
9017 cast_expression
9020 /* Roll back the tokens we skipped. */
9022 /* If we aren't looking at a cast-expression, simulate an error so
9023 that the call to cp_parser_error_occurred below returns true. */
9026 else
9027 {
9030 /* Look for the type-id. */
9032 /* Look for the closing `)'. */
9037 }
9039 /* Restore the saved message. */
9042 /* At this point this can only be either a cast or a
9043 parenthesized ctor such as `(T ())' that looks like a cast to
9044 function returning T. */
9046 {
9047 /* Only commit if the cast-expression doesn't start with
9048 '++', '--', or '[' in C++11. */
9056 pidk);
9059 {
9060 /* Warn about old-style casts, if so requested. */
9065 {
9071 }
9073 /* Only type conversions to integral or enumeration types
9074 can be used in constant-expressions. */
9077 NIC_CAST))
9080 /* Perform the cast. */
9081 /* Make a location:
9082 (TYPE) EXPR
9083 ^~~~~~~~~~~
9084 with start==caret at the open paren, extending to the
9085 end of "expr". */
9087 open_paren_loc,
9091 }
9092 }
9093 else
9095 }
9097 /* If we get here, then it's not a cast, so it must be a
9098 unary-expression. */
9101 }
9103 /* Parse a binary expression of the general form:
9105 pm-expression:
9106 cast-expression
9107 pm-expression .* cast-expression
9108 pm-expression ->* cast-expression
9110 multiplicative-expression:
9111 pm-expression
9112 multiplicative-expression * pm-expression
9113 multiplicative-expression / pm-expression
9114 multiplicative-expression % pm-expression
9116 additive-expression:
9117 multiplicative-expression
9118 additive-expression + multiplicative-expression
9119 additive-expression - multiplicative-expression
9121 shift-expression:
9122 additive-expression
9123 shift-expression << additive-expression
9124 shift-expression >> additive-expression
9126 relational-expression:
9127 shift-expression
9128 relational-expression < shift-expression
9129 relational-expression > shift-expression
9130 relational-expression <= shift-expression
9131 relational-expression >= shift-expression
9133 GNU Extension:
9135 relational-expression:
9136 relational-expression <? shift-expression
9137 relational-expression >? shift-expression
9139 equality-expression:
9140 relational-expression
9141 equality-expression == relational-expression
9142 equality-expression != relational-expression
9144 and-expression:
9145 equality-expression
9146 and-expression & equality-expression
9148 exclusive-or-expression:
9149 and-expression
9150 exclusive-or-expression ^ and-expression
9152 inclusive-or-expression:
9153 exclusive-or-expression
9154 inclusive-or-expression | exclusive-or-expression
9156 logical-and-expression:
9157 inclusive-or-expression
9158 logical-and-expression && inclusive-or-expression
9160 logical-or-expression:
9161 logical-and-expression
9162 logical-or-expression || logical-and-expression
9164 All these are implemented with a single function like:
9166 binary-expression:
9167 simple-cast-expression
9168 binary-expression <token> binary-expression
9170 CAST_P is true if this expression is the target of a cast.
9172 The binops_by_token map is used to get the tree codes for each <token> type.
9173 binary-expressions are associated according to a precedence table. */
9175 #define TOKEN_PRECEDENCE(token) \
9176 (((token->type == CPP_GREATER \
9177 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9178 && !parser->greater_than_is_operator_p) \
9179 ? PREC_NOT_OPERATOR \
9180 : binops_by_token[token->type].prec)
9182 static cp_expr
9188 {
9189 cp_parser_expression_stack stack;
9191 cp_parser_expression_stack_entry current;
9192 cp_expr rhs;
9196 tree overload;
9198 /* Parse the first expression. */
9209 {
9210 /* Get an operator token. */
9216 {
9218 "%<>>%> operator is treated"
9222 }
9227 /* This is a fold-expression; handle it later. */
9230 /* Popping an entry off the stack means we completed a subexpression:
9231 - either we found a token which is not an operator (`>' where it is not
9232 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9233 will happen repeatedly;
9234 - or, we found an operator which has lower priority. This is the case
9235 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9236 parsing `3 * 4'. */
9238 {
9241 else
9243 }
9245 get_rhs:
9249 /* We used the operator token. */
9252 /* For "false && x" or "true || x", x will never be executed;
9253 disable warnings while evaluating it. */
9255 c_inhibit_evaluation_warnings +=
9258 c_inhibit_evaluation_warnings +=
9261 /* Extract another operand. It may be the RHS of this expression
9262 or the LHS of a new, higher priority expression. */
9267 /* Get another operator token. Look up its precedence to avoid
9268 building a useless (immediately popped) stack entry for common
9269 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9276 {
9277 /* ... and prepare to parse the RHS of the new, higher priority
9278 expression. Since precedence levels on the stack are
9279 monotonically increasing, we do not have to care about
9280 stack overflows. */
9289 pop:
9291 /* If the stack is not empty, we have parsed into LHS the right side
9292 (`4' in the example above) of an expression we had suspended.
9293 We can use the information on the stack to recover the LHS (`3')
9294 from the stack together with the tree code (`MULT_EXPR'), and
9295 the precedence of the higher level subexpression
9296 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9297 which will be used to actually build the additive expression. */
9302 }
9304 /* Undo the disabling of warnings done above. */
9306 c_inhibit_evaluation_warnings -=
9309 c_inhibit_evaluation_warnings -=
9315 /* Avoid warning for !!x == y. */
9320 /* Avoid warning for !b == y where b is boolean. */
9324 /* Avoid warning for !!b == y where b is boolean. */
9337 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9338 ERROR_MARK for everything that is not a binary expression.
9339 This makes warn_about_parentheses miss some warnings that
9340 involve unary operators. For unary expressions we should
9341 pass the correct tree_code unless the unary expression was
9342 surrounded by parentheses.
9343 */
9347 {
9350 else
9351 {
9352 current.lhs
9355 == tcc_comparison
9359 }
9360 }
9361 else
9362 {
9367 /* TODO: build_x_binary_op doesn't always honor the location. */
9369 }
9372 /* If the binary operator required the use of an overloaded operator,
9373 then this expression cannot be an integral constant-expression.
9374 An overloaded operator can be used even if both operands are
9375 otherwise permissible in an integral constant-expression if at
9376 least one of the operands is of enumeration type. */
9380 NIC_OVERLOADED))
9382 }
9385 }
9387 static cp_expr
9392 {
9395 }
9397 /* Parse the `? expression : assignment-expression' part of a
9398 conditional-expression. The LOGICAL_OR_EXPR is the
9399 logical-or-expression that started the conditional-expression.
9400 Returns a representation of the entire conditional-expression.
9402 This routine is used by cp_parser_assignment_expression.
9404 ? expression : assignment-expression
9406 GNU Extensions:
9408 ? : assignment-expression */
9410 static tree
9412 {
9414 cp_expr assignment_expr;
9418 /* Consume the `?' token. */
9423 {
9426 /* Implicit true clause. */
9428 c_inhibit_evaluation_warnings +=
9431 }
9432 else
9433 {
9436 /* Parse the expression. */
9437 c_inhibit_evaluation_warnings +=
9440 c_inhibit_evaluation_warnings +=
9444 }
9446 /* The next token should be a `:'. */
9448 /* Parse the assignment-expression. */
9450 c_inhibit_evaluation_warnings -=
9453 /* Make a location:
9454 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9455 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9456 with the caret at the "?", ranging from the start of
9457 the logical_or_expr to the end of the assignment_expr. */
9462 /* Build the conditional-expression. */
9464 expr,
9465 assignment_expr,
9466 tf_warning_or_error);
9467 }
9469 /* Parse an assignment-expression.
9471 assignment-expression:
9472 conditional-expression
9473 logical-or-expression assignment-operator assignment_expression
9474 throw-expression
9476 CAST_P is true if this expression is the target of a cast.
9477 DECLTYPE_P is true if this expression is the operand of decltype.
9479 Returns a representation for the expression. */
9481 static cp_expr
9484 {
9485 cp_expr expr;
9487 /* If the next token is the `throw' keyword, then we're looking at
9488 a throw-expression. */
9491 /* Otherwise, it must be that we are looking at a
9492 logical-or-expression. */
9493 else
9494 {
9495 /* Parse the binary expressions (logical-or-expression). */
9497 decltype_p,
9499 /* If the next token is a `?' then we're actually looking at a
9500 conditional-expression. */
9503 else
9504 {
9507 /* If it's an assignment-operator, we're using the second
9508 production. */
9509 enum tree_code assignment_operator
9512 {
9515 /* Parse the right-hand side of the assignment. */
9522 /* An assignment may not appear in a
9523 constant-expression. */
9525 NIC_ASSIGNMENT))
9527 /* Build the assignment expression. Its default
9528 location:
9529 LHS = RHS
9530 ~~~~^~~~~
9531 is the location of the '=' token as the
9532 caret, ranging from the start of the lhs to the
9533 end of the rhs. */
9538 assignment_operator,
9539 rhs,
9541 /* TODO: build_x_modify_expr doesn't honor the location,
9542 so we must set it here. */
9544 }
9545 }
9546 }
9549 }
9551 /* Parse an (optional) assignment-operator.
9553 assignment-operator: one of
9554 = *= /= %= += -= >>= <<= &= ^= |=
9556 GNU Extension:
9558 assignment-operator: one of
9559 <?= >?=
9561 If the next token is an assignment operator, the corresponding tree
9562 code is returned, and the token is consumed. For example, for
9563 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9564 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9565 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9566 operator, ERROR_MARK is returned. */
9568 static enum tree_code
9570 {
9574 /* Peek at the next token. */
9578 {
9624 /* Nothing else is an assignment operator. */
9626 }
9628 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9633 /* If it was an assignment operator, consume it. */
9638 }
9640 /* Parse an expression.
9642 expression:
9643 assignment-expression
9644 expression , assignment-expression
9646 CAST_P is true if this expression is the target of a cast.
9647 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9648 except possibly parenthesized or on the RHS of a comma (N3276).
9650 Returns a representation of the expression. */
9652 static cp_expr
9655 {
9660 {
9661 cp_expr assignment_expression;
9663 /* Parse the next assignment-expression. */
9664 assignment_expression
9667 /* We don't create a temporary for a call that is the immediate operand
9668 of decltype or on the RHS of a comma. But when we see a comma, we
9669 need to create a temporary for a call on the LHS. */
9674 assignment_expression
9678 /* If this is the first assignment-expression, we can just
9679 save it away. */
9682 else
9683 {
9684 /* Create a location with caret at the comma, ranging
9685 from the start of the LHS to the end of the RHS. */
9690 assignment_expression,
9693 }
9694 /* If the next token is not a comma, or we're in a fold-expression, then
9695 we are done with the expression. */
9699 /* Consume the `,'. */
9702 /* A comma operator cannot appear in a constant-expression. */
9705 }
9708 }
9710 /* Parse a constant-expression.
9712 constant-expression:
9713 conditional-expression
9715 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9716 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9717 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9718 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9719 only parse a conditional-expression, otherwise parse an
9720 assignment-expression. See below for rationale. */
9722 static cp_expr
9727 {
9731 cp_expr expression;
9733 /* It might seem that we could simply parse the
9734 conditional-expression, and then check to see if it were
9735 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9736 one that the compiler can figure out is constant, possibly after
9737 doing some simplifications or optimizations. The standard has a
9738 precise definition of constant-expression, and we must honor
9739 that, even though it is somewhat more restrictive.
9741 For example:
9743 int i[(2, 3)];
9745 is not a legal declaration, because `(2, 3)' is not a
9746 constant-expression. The `,' operator is forbidden in a
9747 constant-expression. However, GCC's constant-folding machinery
9748 will fold this operation to an INTEGER_CST for `3'. */
9750 /* Save the old settings. */
9752 saved_allow_non_integral_constant_expression_p
9755 /* We are now parsing a constant-expression. */
9757 parser->allow_non_integral_constant_expression_p
9760 /* Although the grammar says "conditional-expression", when not STRICT_P,
9761 we parse an "assignment-expression", which also permits
9762 "throw-expression" and the use of assignment operators. In the case
9763 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9764 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9765 actually essential that we look for an assignment-expression.
9766 For example, cp_parser_initializer_clauses uses this function to
9767 determine whether a particular assignment-expression is in fact
9768 constant. */
9770 {
9771 /* Parse the binary expressions (logical-or-expression). */
9774 /* If the next token is a `?' then we're actually looking at
9775 a conditional-expression; otherwise we're done. */
9778 }
9779 else
9781 /* Restore the old settings. */
9782 parser->integral_constant_expression_p
9784 parser->allow_non_integral_constant_expression_p
9787 {
9788 /* Require an rvalue constant expression here; that's what our
9789 callers expect. Reference constant expressions are handled
9790 separately in e.g. cp_parser_template_argument. */
9799 }
9802 parser->non_integral_constant_expression_p
9806 }
9808 /* Parse __builtin_offsetof.
9810 offsetof-expression:
9811 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9813 offsetof-member-designator:
9814 id-expression
9815 | offsetof-member-designator "." id-expression
9816 | offsetof-member-designator "[" expression "]"
9817 | offsetof-member-designator "->" id-expression */
9819 static cp_expr
9821 {
9823 tree type;
9824 cp_expr expr;
9825 cp_id_kind dummy;
9827 location_t finish_loc;
9829 /* We're about to accept non-integral-constant things, but will
9830 definitely yield an integral constant expression. Save and
9831 restore these values around our local parsing. */
9837 /* Consume the "__builtin_offsetof" token. */
9839 /* Consume the opening `('. */
9840 matching_parens parens;
9842 /* Parse the type-id. */
9844 {
9846 parser->type_definition_forbidden_message
9850 }
9851 /* Look for the `,'. */
9855 /* Build the (type *)null that begins the traditional offsetof macro. */
9856 tree object_ptr
9858 tf_warning_or_error);
9860 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9864 {
9867 {
9869 /* offsetof-member-designator "[" expression "]" */
9875 /* offsetof-member-designator "->" identifier */
9878 /* FALLTHRU */
9881 /* offsetof-member-designator "." identifier */
9889 /* Consume the ")" token. */
9895 /* Error. We know the following require will fail, but
9896 that gives the proper error message. */
9901 }
9902 }
9904 success:
9905 /* Make a location of the form:
9906 __builtin_offsetof (struct s, f)
9907 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9908 with caret at the type-id, ranging from the start of the
9909 "_builtin_offsetof" token to the close paren. */
9911 /* The result will be an INTEGER_CST, so we need to explicitly
9912 preserve the location. */
9915 failure:
9921 }
9923 /* Parse a trait expression.
9925 Returns a representation of the expression, the underlying type
9926 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9928 static cp_expr
9930 {
9931 cp_trait_kind kind;
9937 {
10039 }
10041 /* Get location of initial token. */
10044 /* Consume the token. */
10047 matching_parens parens;
10050 {
10053 }
10059 {
10062 {
10065 }
10069 }
10071 {
10073 {
10077 {
10080 }
10084 }
10085 }
10090 /* Construct a location of the form:
10091 __is_trivially_copyable(_Tp)
10092 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
10093 with start == caret, finishing at the close-paren. */
10096 /* Complete the trait expression, which may mean either processing
10097 the trait expr now or saving it for template instantiation. */
10099 {
10108 }
10109 }
10111 /* Parse a lambda expression.
10113 lambda-expression:
10114 lambda-introducer lambda-declarator [opt] compound-statement
10116 Returns a representation of the expression. */
10118 static cp_expr
10120 {
10122 tree type;
10130 {
10132 {
10136 }
10138 }
10140 {
10142 {
10145 }
10147 }
10149 /* We may be in the middle of deferred access check. Disable
10150 it now. */
10161 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10164 /* Now that we've started the type, add the capture fields for any
10165 explicit captures. */
10168 {
10169 /* Inside the class, surrounding template-parameter-lists do not apply. */
10170 unsigned int saved_num_template_parameter_lists
10174 bool fully_implicit_function_template_p
10178 bool auto_is_implicit_function_template_parm_p
10189 /* By virtue of defining a local class, a lambda expression has access to
10190 the private variables of enclosing classes. */
10198 {
10203 }
10205 {
10208 }
10210 /* The capture list was built up in reverse order; fix that now. */
10222 parser->fully_implicit_function_template_p
10226 parser->auto_is_implicit_function_template_parm_p
10228 }
10230 /* This field is only used during parsing of the lambda. */
10233 /* This lambda shouldn't have any proxies left at this point. */
10235 /* And now that we're done, push proxies for an enclosing lambda. */
10238 /* Update the lambda expression to a range. */
10246 else
10254 }
10256 /* Parse the beginning of a lambda expression.
10258 lambda-introducer:
10259 [ lambda-capture [opt] ]
10261 LAMBDA_EXPR is the current representation of the lambda expression. */
10263 static void
10265 {
10266 /* Need commas after the first capture. */
10269 /* Eat the leading `['. */
10272 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10280 {
10283 }
10286 {
10288 tree capture_id;
10289 tree capture_init_expr;
10293 enum capture_kind_type
10294 {
10295 BY_COPY,
10296 BY_REFERENCE
10297 };
10301 {
10304 }
10308 else
10311 /* Possibly capture `this'. */
10313 {
10324 explicit_init_p);
10326 }
10328 /* Possibly capture `*this'. */
10331 {
10342 explicit_init_p);
10344 }
10346 /* Remember whether we want to capture as a reference or not. */
10348 {
10351 }
10353 /* Get the identifier. */
10358 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10359 delimiters, but I modified this to stop on unnested ']' as well. It
10360 was already changed to stop on unnested '}', so the
10361 "closing_parenthesis" name is no more misleading with my change. */
10362 {
10368 }
10370 /* Find the initializer for this capture. */
10374 {
10376 /* An explicit initializer exists. */
10379 "lambda capture initializers "
10385 {
10388 }
10389 }
10390 else
10391 {
10394 /* Turn the identifier into an id-expression. */
10395 capture_init_expr
10400 {
10403 }
10406 {
10409 capture_init_expr);
10414 }
10417 {
10420 capture_init_expr))
10424 }
10426 capture_init_expr
10427 = finish_id_expression
10429 capture_init_expr,
10443 {
10446 }
10447 }
10451 {
10456 capture_id);
10460 "capture of %qD redundant with by-reference capture "
10462 }
10465 capture_id,
10466 capture_init_expr,
10468 explicit_init_p);
10470 /* If there is any qualification still in effect, clear it
10471 now; we will be starting fresh with the next capture. */
10475 }
10478 }
10480 /* Parse the (optional) middle of a lambda expression.
10482 lambda-declarator:
10483 < template-parameter-list [opt] >
10484 ( parameter-declaration-clause [opt] )
10485 attribute-specifier [opt]
10486 decl-specifier-seq [opt]
10487 exception-specification [opt]
10488 lambda-return-type-clause [opt]
10490 LAMBDA_EXPR is the current representation of the lambda expression. */
10492 static bool
10494 {
10495 /* 5.1.1.4 of the standard says:
10496 If a lambda-expression does not include a lambda-declarator, it is as if
10497 the lambda-declarator were ().
10498 This means an empty parameter list, no attributes, and no exception
10499 specification. */
10506 cp_decl_specifier_seq lambda_specs;
10509 /* The template-parameter-list is optional, but must begin with
10510 an opening angle if present. */
10512 {
10515 "lambda templates are only available with "
10519 "lambda templates are only available with "
10528 /* We just processed one more parameter list. */
10530 }
10532 /* The parameter-declaration-clause is optional (unless
10533 template-parameter-list was given), but must begin with an
10534 opening parenthesis if present. */
10536 {
10537 matching_parens parens;
10542 /* Parse parameters. */
10545 /* Default arguments shall not be specified in the
10546 parameter-declaration-clause of a lambda-declarator. */
10557 /* In the decl-specifier-seq of the lambda-declarator, each
10558 decl-specifier shall either be mutable or constexpr. */
10562 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10565 {
10570 }
10574 /* Parse optional exception specification. */
10577 /* Parse optional trailing return type. */
10579 {
10582 }
10584 /* The function parameters must be in scope all the way until after the
10585 trailing-return-type in case of decltype. */
10587 }
10591 /* Create the function call operator.
10593 Messing with declarators like this is no uglier than building up the
10594 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10595 other code. */
10596 {
10597 cp_decl_specifier_seq return_type_specs;
10599 tree fco;
10607 {
10611 else
10614 }
10623 VIRT_SPEC_UNSPECIFIED,
10624 REF_QUAL_NONE,
10625 tx_qual,
10626 exception_spec,
10634 declarator,
10635 attributes);
10637 {
10640 /* Give the object parameter a different name. */
10642 }
10644 {
10648 }
10657 }
10658 }
10660 /* Parse the body of a lambda expression, which is simply
10662 compound-statement
10664 but which requires special handling.
10665 LAMBDA_EXPR is the current representation of the lambda expression. */
10667 static void
10669 {
10676 else
10677 /* Still increment function_depth so that we don't GC in the
10678 middle of an expression. */
10683 /* Clear this in case we're in the middle of a default argument. */
10687 {
10691 matching_braces braces;
10694 {
10697 /* Originally C++11 required us to peek for 'return expr'; and
10698 process it specially here to deduce the return type. N3638
10699 removed the need for that. */
10707 }
10710 }
10717 else
10719 }
10721 /* Statements [gram.stmt.stmt] */
10723 /* Build and add a DEBUG_BEGIN_STMT statement with location LOC. */
10725 static void
10727 {
10731 /* A concept is never expanded normally. */
10737 }
10739 /* Parse a statement.
10741 statement:
10742 labeled-statement
10743 expression-statement
10744 compound-statement
10745 selection-statement
10746 iteration-statement
10747 jump-statement
10748 declaration-statement
10749 try-block
10751 C++11:
10753 statement:
10754 labeled-statement
10755 attribute-specifier-seq (opt) expression-statement
10756 attribute-specifier-seq (opt) compound-statement
10757 attribute-specifier-seq (opt) selection-statement
10758 attribute-specifier-seq (opt) iteration-statement
10759 attribute-specifier-seq (opt) jump-statement
10760 declaration-statement
10761 attribute-specifier-seq (opt) try-block
10763 init-statement:
10764 expression-statement
10765 simple-declaration
10767 TM Extension:
10769 statement:
10770 atomic-statement
10772 IN_COMPOUND is true when the statement is nested inside a
10773 cp_parser_compound_statement; this matters for certain pragmas.
10775 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10776 is a (possibly labeled) if statement which is not enclosed in braces
10777 and has an else clause. This is used to implement -Wparentheses.
10779 CHAIN is a vector of if-else-if conditions. */
10781 static void
10785 {
10790 restart:
10793 /* There is no statement yet. */
10799 /* In obj-c++, seeing '[[' might be the either the beginning of
10800 c++11 attributes, or a nested objc-message-expression. So
10801 let's parse the c++11 attributes tentatively. */
10805 {
10808 }
10810 /* Peek at the next token. */
10812 /* Remember the location of the first token in the statement. */
10815 /* If this is a keyword, then that will often determine what kind of
10816 statement we have. */
10818 {
10822 {
10825 /* Looks like a labeled-statement with a case label.
10826 Parse the label, and then use tail recursion to parse
10827 the statement. */
10850 /* Objective-C++ exception-handling constructs. */
10864 /* This must be a namespace alias definition. */
10880 /* It might be a keyword like `int' that can start a
10881 declaration-statement. */
10883 }
10884 }
10886 {
10887 /* If the next token is a `:', then we are looking at a
10888 labeled-statement. */
10891 {
10892 /* Looks like a labeled-statement with an ordinary label.
10893 Parse the label, and then use tail recursion to parse
10894 the statement. */
10899 }
10900 }
10901 /* Anything that starts with a `{' must be a compound-statement. */
10904 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10905 a statement all its own. */
10907 {
10908 /* Only certain OpenMP pragmas are attached to statements, and thus
10909 are considered statements themselves. All others are not. In
10910 the context of a compound, accept the pragma as a "statement" and
10911 return so that we can check for a close brace. Otherwise we
10912 require a real statement and must go back and read one. */
10918 }
10920 {
10923 }
10925 /* Everything else must be a declaration-statement or an
10926 expression-statement. Try for the declaration-statement
10927 first, unless we are looking at a `;', in which case we know that
10928 we have an expression-statement. */
10930 {
10932 {
10934 {
10935 /* Attributes should be parsed as part of the the
10936 declaration, so let's un-parse them. */
10939 }
10942 /* Try to parse the declaration-statement. */
10944 /* If that worked, we're done. */
10947 }
10948 /* All preceding labels have been parsed at this point. */
10952 /* Look for an expression-statement instead. */
10955 /* Handle [[fallthrough]];. */
10957 {
10958 /* The next token after the fallthrough attribute is ';'. */
10960 {
10961 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10963 IFN_FALLTHROUGH,
10966 }
10967 else
10971 }
10972 }
10974 /* Set the line number for the statement. */
10978 /* Allow "[[fallthrough]];", but warn otherwise. */
10981 OPT_Wattributes,
10983 }
10985 /* Append ATTR to attribute list ATTRS. */
10987 static tree
10989 {
10995 }
10997 /* Parse the label for a labeled-statement, i.e.
10999 identifier :
11000 case constant-expression :
11001 default :
11003 GNU Extension:
11004 case constant-expression ... constant-expression : statement
11006 When a label is parsed without errors, the label is added to the
11007 parse tree by the finish_* functions, so this function doesn't
11008 have to return the label. */
11010 static void
11012 {
11017 /* The next token should be an identifier. */
11021 {
11024 }
11026 /* Remember whether this case or a user-defined label is allowed to fall
11027 through to. */
11032 {
11034 {
11038 /* Consume the `case' token. */
11040 /* Parse the constant-expression. */
11047 {
11048 /* Consume the `...' token. */
11054 /* We don't need to emit warnings here, as the common code
11055 will do this for us. */
11056 }
11057 else
11061 {
11065 }
11066 else
11069 expr);
11070 }
11074 /* Consume the `default' token. */
11078 {
11082 }
11083 else
11088 /* Anything else must be an ordinary label. */
11093 }
11095 /* Require the `:' token. */
11098 /* An ordinary label may optionally be followed by attributes.
11099 However, this is only permitted if the attributes are then
11100 followed by a semicolon. This is because, for backward
11101 compatibility, when parsing
11102 lab: __attribute__ ((unused)) int i;
11103 we want the attribute to attach to "i", not "lab". */
11106 {
11107 tree attrs;
11114 ;
11115 else
11117 }
11123 }
11125 /* Parse an expression-statement.
11127 expression-statement:
11128 expression [opt] ;
11130 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11131 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11132 indicates whether this expression-statement is part of an
11133 expression statement. */
11135 static tree
11137 {
11142 /* There might be attribute fallthrough. */
11145 /* If the next token is a ';', then there is no expression
11146 statement. */
11148 {
11152 {
11155 }
11156 }
11158 /* Handle [[fallthrough]];. */
11160 {
11161 /* The next token after the fallthrough attribute is ';'. */
11163 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11166 else
11170 }
11172 /* Allow "[[fallthrough]];", but warn otherwise. */
11177 /* Give a helpful message for "A<T>::type t;" and the like. */
11180 {
11187 {
11188 /* A::A a; */
11193 }
11194 }
11196 /* Consume the final `;'. */
11201 /* This is the final expression statement of a statement
11202 expression. */
11208 }
11210 /* Parse a compound-statement.
11212 compound-statement:
11213 { statement-seq [opt] }
11215 GNU extension:
11217 compound-statement:
11218 { label-declaration-seq [opt] statement-seq [opt] }
11220 label-declaration-seq:
11221 label-declaration
11222 label-declaration-seq label-declaration
11224 Returns a tree representing the statement. */
11226 static tree
11229 {
11230 tree compound_stmt;
11231 matching_braces braces;
11233 /* Consume the `{'. */
11240 /* Begin the compound-statement. */
11242 /* If the next keyword is `__label__' we have a label declaration. */
11245 /* Parse an (optional) statement-seq. */
11247 /* Finish the compound-statement. */
11249 /* Consume the `}'. */
11253 }
11255 /* Parse an (optional) statement-seq.
11257 statement-seq:
11258 statement
11259 statement-seq [opt] statement */
11261 static void
11263 {
11264 /* Scan statements until there aren't any more. */
11266 {
11269 /* If we are looking at a `}', then we have run out of
11270 statements; the same is true if we have reached the end
11271 of file, or have stumbled upon a stray '@end'. */
11278 /* If we are in a compound statement and find 'else' then
11279 something went wrong. */
11281 {
11284 else
11285 {
11288 }
11289 }
11291 /* Parse the statement. */
11293 }
11294 }
11296 /* Return true if this is the C++20 version of range-based-for with
11297 init-statement. */
11299 static bool
11301 {
11304 /* Save tokens so that we can put them back. */
11307 /* There has to be an unnested ; followed by an unnested :. */
11310 CPP_SEMICOLON,
11314 /* We found the semicolon, eat it now. */
11317 /* Now look for ':' that is not nested in () or {}. */
11320 CPP_COLON,
11323 out:
11324 /* Roll back the tokens we skipped. */
11328 }
11330 /* Return true if we're looking at (init; cond), false otherwise. */
11332 static bool
11334 {
11335 /* Save tokens so that we can put them back. */
11338 /* Look for ';' that is not nested in () or {}. */
11341 CPP_SEMICOLON,
11344 /* Roll back the tokens we skipped. */
11348 }
11350 /* Parse a selection-statement.
11352 selection-statement:
11353 if ( init-statement [opt] condition ) statement
11354 if ( init-statement [opt] condition ) statement else statement
11355 switch ( init-statement [opt] condition ) statement
11357 Returns the new IF_STMT or SWITCH_STMT.
11359 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11360 is a (possibly labeled) if statement which is not enclosed in
11361 braces and has an else clause. This is used to implement
11362 -Wparentheses.
11364 CHAIN is a vector of if-else-if conditions. This is used to implement
11365 -Wduplicated-cond. */
11367 static tree
11370 {
11373 token_indent_info guard_tinfo;
11378 /* Peek at the next token. */
11382 /* See what kind of keyword it is. */
11385 {
11388 {
11389 tree statement;
11390 tree condition;
11395 RID_CONSTEXPR))
11396 {
11402 }
11404 /* Look for the `('. */
11405 matching_parens parens;
11407 {
11410 }
11412 /* Begin the selection-statement. */
11414 {
11417 }
11418 else
11421 /* Parse the optional init-statement. */
11423 {
11424 tree decl;
11427 "init-statement in selection statements only available "
11430 }
11432 /* Parse the condition. */
11434 /* Look for the `)'. */
11440 {
11444 /* Add the condition. */
11451 /* Parse the then-clause. */
11455 /* Outside a template, the non-selected branch of a constexpr
11456 if is a 'discarded statement', i.e. unevaluated. */
11461 {
11464 }
11467 guard_tinfo);
11474 {
11478 }
11480 /* If the next token is `else', parse the else-clause. */
11482 RID_ELSE))
11483 {
11487 {
11490 }
11492 guard_tinfo
11494 /* Consume the `else' keyword. */
11497 {
11499 RID_IF)
11501 {
11502 /* We've got "if (COND) else if (COND2)". Start
11503 the condition chain and add COND as the first
11504 element. */
11508 {
11509 /* Wrap it in a NOP_EXPR so that we can set the
11510 location of the condition. */
11512 condition);
11515 }
11516 }
11518 RID_IF))
11519 {
11520 /* This is if-else without subsequent if. Zap the
11521 condition chain; we would have already warned at
11522 this point. */
11525 }
11526 }
11528 /* Parse the else-clause. */
11534 /* If we are currently parsing a then-clause, then
11535 IF_P will not be NULL. We set it to true to
11536 indicate that this if statement has an else clause.
11537 This may trigger the Wparentheses warning below
11538 when we get back up to the parent if statement. */
11543 {
11547 }
11548 }
11549 else
11550 {
11551 /* This if statement does not have an else clause. If
11552 NESTED_IF is true, then the then-clause has an if
11553 statement which does have an else clause. We warn
11554 about the potential ambiguity. */
11557 "suggest explicit braces to avoid ambiguous"
11560 {
11561 /* We don't need the condition chain anymore. */
11564 }
11565 }
11567 /* Now we're all done with the if-statement. */
11569 }
11570 else
11571 {
11575 /* Add the condition. */
11578 /* Parse the body of the switch-statement. */
11584 guard_tinfo);
11588 /* Now we're all done with the switch-statement. */
11590 }
11593 }
11599 }
11600 }
11602 /* Helper function for cp_parser_condition and cp_parser_simple_declaration.
11603 If we have seen at least one decl-specifier, and the next token
11604 is not a parenthesis, then we must be looking at a declaration.
11605 (After "int (" we might be looking at a functional cast.) */
11607 static void
11610 {
11616 }
11618 /* Helper function for cp_parser_condition. Enforces [stmt.stmt]/2:
11619 The declarator shall not specify a function or an array. Returns
11620 TRUE if the declarator is valid, FALSE otherwise. */
11622 static bool
11625 location_t loc)
11626 {
11630 {
11635 else
11643 }
11644 else
11646 }
11648 /* Parse a condition.
11650 condition:
11651 expression
11652 type-specifier-seq declarator = initializer-clause
11653 type-specifier-seq declarator braced-init-list
11655 GNU Extension:
11657 condition:
11658 type-specifier-seq declarator asm-specification [opt]
11659 attributes [opt] = assignment-expression
11661 Returns the expression that should be tested. */
11663 static tree
11665 {
11666 cp_decl_specifier_seq type_specifiers;
11670 /* Try the declaration first. */
11672 /* New types are not allowed in the type-specifier-seq for a
11673 condition. */
11675 parser->type_definition_forbidden_message
11677 /* Parse the type-specifier-seq. */
11679 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11682 /* Restore the saved message. */
11688 /* If all is well, we might be looking at a declaration. */
11690 {
11691 tree decl;
11692 tree asm_specification;
11693 tree attributes;
11698 /* Parse the declarator. */
11704 /* Parse the attributes. */
11706 /* Parse the asm-specification. */
11708 /* If the next token is not an `=' or '{', then we might still be
11709 looking at an expression. For example:
11711 if (A(a).x)
11713 looks like a decl-specifier-seq and a declarator -- but then
11714 there is no `=', so this is an expression. */
11719 /* If we did see an `=' or '{', then we are looking at a declaration
11720 for sure. */
11722 {
11723 tree pushed_scope;
11730 /* Create the declaration. */
11736 /* Parse the initializer. */
11738 {
11742 }
11744 {
11745 /* Consume the `='. */
11749 }
11750 else
11751 {
11754 }
11758 /* Process the initializer. */
11761 asm_specification,
11762 flags);
11768 }
11769 }
11770 /* If we didn't even get past the declarator successfully, we are
11771 definitely not looking at a declaration. */
11772 else
11775 /* Otherwise, we are looking at an expression. */
11777 }
11779 /* Parses a for-statement or range-for-statement until the closing ')',
11780 not included. */
11782 static tree
11784 {
11788 /* Begin the for-statement. */
11791 /* Parse the initialization. */
11796 else
11798 }
11800 static tree
11803 {
11804 /* Normal for loop */
11807 tree stmt;
11810 /* The init-statement has already been parsed in
11811 cp_parser_init_statement, so no work is needed here. */
11814 /* If there's a condition, process it. */
11818 {
11822 }
11824 {
11828 }
11830 /* Look for the `;'. */
11833 /* If there's an expression, process it. */
11839 }
11841 /* Tries to parse a range-based for-statement:
11843 range-based-for:
11844 decl-specifier-seq declarator : expression
11846 The decl-specifier-seq declarator and the `:' are already parsed by
11847 cp_parser_init_statement. If processing_template_decl it returns a
11848 newly created RANGE_FOR_STMT; if not, it is converted to a
11849 regular FOR_STMT. */
11851 static tree
11854 {
11861 /* Get the range declaration momentarily out of the way so that
11862 the range expression doesn't clash with it. */
11864 {
11866 {
11868 /* For decomposition declaration get all of the corresponding
11869 declarations out of the way. */
11873 {
11879 {
11885 }
11886 }
11887 }
11889 {
11894 }
11895 }
11898 {
11901 }
11902 else
11905 /* Put the range declaration(s) back into scope. */
11907 {
11911 }
11913 /* If in template, STMT is converted to a normal for-statement
11914 at instantiation. If not, it is done just ahead. */
11916 {
11926 /* do_auto_deduction doesn't mess with template init-lists. */
11929 }
11930 else
11931 {
11935 unroll);
11936 }
11938 }
11940 /* Subroutine of cp_convert_range_for: given the initializer expression,
11941 builds up the range temporary. */
11943 static tree
11945 {
11948 /* Find out the type deduced by the declaration
11949 `auto &&__range = range_expr'. */
11954 /* Create the __range variable. */
11961 }
11963 /* Used by cp_parser_range_for in template context: we aren't going to
11964 do a full conversion yet, but we still need to resolve auto in the
11965 type of the for-range-declaration if present. This is basically
11966 a shortcut version of cp_convert_range_for. */
11968 static void
11970 {
11973 {
11976 iter_type = (cp_parser_perform_range_for_lookup
11979 {
11981 iter_type);
11983 RO_UNARY_STAR,
11984 tf_warning_or_error);
11987 }
11988 }
11989 }
11991 /* Converts a range-based for-statement into a normal
11992 for-statement, as per the definition.
11994 for (RANGE_DECL : RANGE_EXPR)
11995 BLOCK
11997 should be equivalent to:
11999 {
12000 auto &&__range = RANGE_EXPR;
12001 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
12002 __begin != __end;
12003 ++__begin)
12004 {
12005 RANGE_DECL = *__begin;
12006 BLOCK
12007 }
12008 }
12010 If RANGE_EXPR is an array:
12011 BEGIN_EXPR = __range
12012 END_EXPR = __range + ARRAY_SIZE(__range)
12013 Else if RANGE_EXPR has a member 'begin' or 'end':
12014 BEGIN_EXPR = __range.begin()
12015 END_EXPR = __range.end()
12016 Else:
12017 BEGIN_EXPR = begin(__range)
12018 END_EXPR = end(__range);
12020 If __range has a member 'begin' but not 'end', or vice versa, we must
12021 still use the second alternative (it will surely fail, however).
12022 When calling begin()/end() in the third alternative we must use
12023 argument dependent lookup, but always considering 'std' as an associated
12024 namespace. */
12026 tree
12030 {
12038 /* If an error happened previously do nothing or else a lot of
12039 unhelpful errors would be issued. */
12041 else
12042 {
12043 tree range_temp;
12047 /* Can't bind a reference to an array of runtime bound. */
12049 else
12050 {
12055 LOOKUP_ONLYCONVERTING);
12057 }
12060 }
12062 /* The new for initialization statement. */
12070 LOOKUP_ONLYCONVERTING);
12081 LOOKUP_ONLYCONVERTING);
12085 /* The new for condition. */
12092 /* The new increment expression. */
12095 tf_warning_or_error);
12101 /* The declaration is initialized with *__begin inside the loop body. */
12104 tf_warning_or_error),
12106 LOOKUP_ONLYCONVERTING);
12111 }
12113 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12114 We need to solve both at the same time because the method used
12115 depends on the existence of members begin or end.
12116 Returns the type deduced for the iterator expression. */
12118 static tree
12120 {
12122 {
12125 }
12128 {
12133 }
12135 {
12136 /* If RANGE is an array, we will use pointer arithmetic. */
12139 range,
12143 }
12144 else
12145 {
12146 /* If it is not an array, we must do a bit of magic. */
12156 tf_warning_or_error);
12159 tf_warning_or_error);
12162 {
12163 /* Use the member functions. */
12166 }
12167 else
12168 {
12169 /* Use global functions with ADL. */
12176 tf_warning_or_error);
12178 tf_warning_or_error);
12180 tf_warning_or_error);
12182 tf_warning_or_error);
12185 }
12187 /* Last common checks. */
12189 {
12190 /* If one of the expressions is an error do no more checks. */
12193 }
12196 /* Can happen, when, eg, in a template context, Koenig lookup
12197 can't resolve begin/end (c++/58503). */
12199 else
12200 {
12202 /* The unqualified type of the __begin and __end temporaries should
12203 be the same, as required by the multiple auto declaration. */
12205 {
12212 /* P0184R0 allows __begin and __end to have different types,
12213 but make sure they are comparable so we can give a better
12215 else
12219 }
12221 }
12222 }
12223 }
12225 /* Helper function for cp_parser_perform_range_for_lookup.
12226 Builds a tree for RANGE.IDENTIFIER(). */
12228 static tree
12230 {
12243 tf_warning_or_error);
12246 }
12248 /* Parse an iteration-statement.
12250 iteration-statement:
12251 while ( condition ) statement
12252 do statement while ( expression ) ;
12253 for ( init-statement condition [opt] ; expression [opt] )
12254 statement
12256 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12258 static tree
12261 {
12264 tree statement;
12266 token_indent_info guard_tinfo;
12268 /* Peek at the next token. */
12275 /* Remember whether or not we are already within an iteration
12276 statement. */
12279 /* See what kind of keyword it is. */
12282 {
12284 {
12285 tree condition;
12287 /* Begin the while-statement. */
12289 /* Look for the `('. */
12290 matching_parens parens;
12292 /* Parse the condition. */
12295 /* Look for the `)'. */
12297 /* Parse the dependent statement. */
12303 /* We're done with the while-statement. */
12305 }
12309 {
12310 tree expression;
12312 /* Begin the do-statement. */
12314 /* Parse the body of the do-statement. */
12321 /* Look for the `while' keyword. */
12323 /* Look for the `('. */
12324 matching_parens parens;
12326 /* Parse the expression. */
12328 /* We're done with the do-statement. */
12330 /* Look for the `)'. */
12332 /* Look for the `;'. */
12334 }
12338 {
12339 /* Look for the `('. */
12340 matching_parens parens;
12345 /* Look for the `)'. */
12348 /* Parse the body of the for-statement. */
12355 /* We're done with the for-statement. */
12357 }
12364 }
12367 }
12369 /* Parse a init-statement or the declarator of a range-based-for.
12370 Returns true if a range-based-for declaration is seen.
12372 init-statement:
12373 expression-statement
12374 simple-declaration */
12376 static bool
12378 {
12379 /* If the next token is a `;', then we have an empty
12380 expression-statement. Grammatically, this is also a
12381 simple-declaration, but an invalid one, because it does not
12382 declare anything. Therefore, if we did not handle this case
12383 specially, we would issue an error message about an invalid
12384 declaration. */
12386 {
12390 /* Try to parse the init-statement. */
12392 {
12393 tree dummy;
12395 /* Parse the declaration. */
12401 /* That didn't work, try to parse it as an expression-statement. */
12405 {
12407 "range-based %<for%> loops with initializer only "
12410 }
12411 }
12413 /* A colon is used in range-based for. */
12416 /* We're going to speculatively look for a declaration, falling back
12417 to an expression, if necessary. */
12419 /* Parse the declaration. */
12422 decl);
12425 {
12426 /* It is a range-for, consume the ':'. */
12431 "range-based %<for%> loops only available with "
12433 }
12434 else
12435 /* The ';' is not consumed yet because we told
12436 cp_parser_simple_declaration not to. */
12441 /* If the tentative parse failed, then we shall need to look for an
12442 expression-statement. */
12443 }
12444 /* If we are here, it is an expression-statement. */
12447 }
12449 /* Parse a jump-statement.
12451 jump-statement:
12452 break ;
12453 continue ;
12454 return expression [opt] ;
12455 return braced-init-list ;
12456 goto identifier ;
12458 GNU extension:
12460 jump-statement:
12461 goto * expression ;
12463 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12465 static tree
12467 {
12473 /* Peek at the next token. */
12478 /* See what kind of keyword it is. */
12481 {
12485 {
12502 }
12508 {
12512 /* Fall through. */
12522 }
12527 {
12528 tree expr;
12532 {
12536 }
12539 else
12540 /* If the next token is a `;', then there is no
12541 expression. */
12543 /* Build the return-statement. */
12546 else
12548 /* Look for the final `;'. */
12550 }
12556 {
12559 }
12561 /* Create the goto-statement. */
12563 {
12564 /* Issue a warning about this use of a GNU extension. */
12566 /* Consume the '*' token. */
12568 /* Parse the dependent expression. */
12570 }
12571 else
12573 /* Look for the final `;'. */
12580 }
12583 }
12585 /* Parse a declaration-statement.
12587 declaration-statement:
12588 block-declaration */
12590 static void
12592 {
12595 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12598 /* Parse the block-declaration. */
12601 /* Free any declarators allocated. */
12603 }
12605 /* Some dependent statements (like `if (cond) statement'), are
12606 implicitly in their own scope. In other words, if the statement is
12607 a single statement (as opposed to a compound-statement), it is
12608 none-the-less treated as if it were enclosed in braces. Any
12609 declarations appearing in the dependent statement are out of scope
12610 after control passes that point. This function parses a statement,
12611 but ensures that is in its own scope, even if it is not a
12612 compound-statement.
12614 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12615 is a (possibly labeled) if statement which is not enclosed in
12616 braces and has an else clause. This is used to implement
12617 -Wparentheses.
12619 CHAIN is a vector of if-else-if conditions. This is used to implement
12620 -Wduplicated-cond.
12622 Returns the new statement. */
12624 static tree
12628 {
12629 tree statement;
12632 token_indent_info body_tinfo
12638 /* Mark if () ; with a special NOP_EXPR. */
12640 {
12651 }
12652 /* if a compound is opened, we simply parse the statement directly. */
12655 /* If the token is not a `{', then we must take special action. */
12656 else
12657 {
12658 /* Create a compound-statement. */
12660 /* Parse the dependent-statement. */
12663 /* Finish the dummy compound-statement. */
12665 }
12667 token_indent_info next_tinfo
12676 /* Return the statement. */
12678 }
12680 /* For some dependent statements (like `while (cond) statement'), we
12681 have already created a scope. Therefore, even if the dependent
12682 statement is a compound-statement, we do not want to create another
12683 scope. */
12685 static void
12688 {
12689 /* If the token is a `{', then we must take special action. */
12691 {
12692 token_indent_info body_tinfo
12698 token_indent_info next_tinfo
12707 }
12708 else
12709 {
12710 /* Avoid calling cp_parser_compound_statement, so that we
12711 don't create a new scope. Do everything else by hand. */
12712 matching_braces braces;
12714 /* If the next keyword is `__label__' we have a label declaration. */
12717 /* Parse an (optional) statement-seq. */
12720 }
12721 }
12723 /* Declarations [gram.dcl.dcl] */
12725 /* Parse an optional declaration-sequence.
12727 declaration-seq:
12728 declaration
12729 declaration-seq declaration */
12731 static void
12733 {
12735 {
12746 {
12747 /* A declaration consisting of a single semicolon is
12748 invalid. Allow it unless we're being pedantic. */
12753 }
12755 /* If we're entering or exiting a region that's implicitly
12756 extern "C", modify the lang context appropriately. */
12758 {
12761 }
12763 {
12766 }
12769 {
12770 /* A top-level declaration can consist solely of a #pragma.
12771 A nested declaration cannot, so this is done here and not
12772 in cp_parser_declaration. (A #pragma at block scope is
12773 handled in cp_parser_statement.) */
12776 }
12778 /* Parse the declaration itself. */
12780 }
12781 }
12783 /* Parse a declaration.
12785 declaration:
12786 block-declaration
12787 function-definition
12788 template-declaration
12789 explicit-instantiation
12790 explicit-specialization
12791 linkage-specification
12792 namespace-definition
12794 C++17:
12795 deduction-guide
12797 GNU extension:
12799 declaration:
12800 __extension__ declaration */
12802 static void
12804 {
12805 cp_token token1;
12806 cp_token token2;
12811 /* Check for the `__extension__' keyword. */
12813 {
12814 /* Parse the qualified declaration. */
12816 /* Restore the PEDANTIC flag. */
12820 }
12822 /* Try to figure out what kind of declaration is present. */
12827 else
12828 {
12831 }
12833 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12836 /* If the next token is `extern' and the following token is a string
12837 literal, then we have a linkage specification. */
12841 /* If the next token is `template', then we have either a template
12842 declaration, an explicit instantiation, or an explicit
12843 specialization. */
12845 {
12846 /* `template <>' indicates a template specialization. */
12850 /* `template <' indicates a template declaration. */
12853 /* Anything else must be an explicit instantiation. */
12854 else
12856 }
12857 /* If the next token is `export', then we have a template
12858 declaration. */
12861 /* If the next token is `extern', 'static' or 'inline' and the one
12862 after that is `template', we have a GNU extended explicit
12863 instantiation directive. */
12870 /* If the next token is `namespace', check for a named or unnamed
12871 namespace definition. */
12880 /* An unnamed namespace definition. */
12884 /* An inline (associated) namespace definition. */
12888 /* Objective-C++ declaration/definition. */
12895 /* At this point we may have a template declared by a concept
12896 introduction. */
12901 else
12902 /* Try to parse a block-declaration, or a function-definition. */
12905 /* Free any declarators allocated. */
12907 }
12909 /* Parse a block-declaration.
12911 block-declaration:
12912 simple-declaration
12913 asm-definition
12914 namespace-alias-definition
12915 using-declaration
12916 using-directive
12918 GNU Extension:
12920 block-declaration:
12921 __extension__ block-declaration
12923 C++0x Extension:
12925 block-declaration:
12926 static_assert-declaration
12928 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12929 part of a declaration-statement. */
12931 static void
12934 {
12938 /* Check for the `__extension__' keyword. */
12940 {
12941 /* Parse the qualified declaration. */
12943 /* Restore the PEDANTIC flag. */
12947 }
12949 /* Peek at the next token to figure out which kind of declaration is
12950 present. */
12953 /* If the next keyword is `asm', we have an asm-definition. */
12955 {
12959 }
12960 /* If the next keyword is `namespace', we have a
12961 namespace-alias-definition. */
12964 /* If the next keyword is `using', we have a
12965 using-declaration, a using-directive, or an alias-declaration. */
12967 {
12972 /* If the token after `using' is `namespace', then we have a
12973 using-directive. */
12977 /* If the second token after 'using' is '=', then we have an
12978 alias-declaration. */
12984 /* Otherwise, it's a using-declaration. */
12985 else
12988 }
12989 /* If the next keyword is `__label__' we have a misplaced label
12990 declaration. */
12992 {
12996 /* If the next token is now a `;', consume it. */
12999 }
13000 /* If the next token is `static_assert' we have a static assertion. */
13003 /* Anything else must be a simple-declaration. */
13004 else
13007 }
13009 /* Parse a simple-declaration.
13011 simple-declaration:
13012 decl-specifier-seq [opt] init-declarator-list [opt] ;
13013 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13014 brace-or-equal-initializer ;
13016 init-declarator-list:
13017 init-declarator
13018 init-declarator-list , init-declarator
13020 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
13021 function-definition as a simple-declaration.
13023 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
13024 parsed declaration if it is an uninitialized single declarator not followed
13025 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
13026 if present, will not be consumed. */
13028 static void
13032 {
13033 cp_decl_specifier_seq decl_specifiers;
13042 /* Defer access checks until we know what is being declared; the
13043 checks for names appearing in the decl-specifier-seq should be
13044 done as if we were in the scope of the thing being declared. */
13047 /* Parse the decl-specifier-seq. We have to keep track of whether
13048 or not the decl-specifier-seq declares a named class or
13049 enumeration type, since that is the only case in which the
13050 init-declarator-list is allowed to be empty.
13052 [dcl.dcl]
13054 In a simple-declaration, the optional init-declarator-list can be
13055 omitted only when declaring a class or enumeration, that is when
13056 the decl-specifier-seq contains either a class-specifier, an
13057 elaborated-type-specifier, or an enum-specifier. */
13059 CP_PARSER_FLAGS_OPTIONAL,
13062 /* We no longer need to defer access checks. */
13065 /* In a block scope, a valid declaration must always have a
13066 decl-specifier-seq. By not trying to parse declarators, we can
13067 resolve the declaration/expression ambiguity more quickly. */
13070 {
13073 }
13075 /* If the next two tokens are both identifiers, the code is
13076 erroneous. The usual cause of this situation is code like:
13078 T t;
13080 where "T" should name a type -- but does not. */
13083 {
13084 /* If parsing tentatively, we should commit; we really are
13085 looking at a declaration. */
13087 /* Give up. */
13089 }
13094 /* Look for C++17 decomposition declaration. */
13102 {
13103 tree decl
13105 maybe_range_for_decl,
13108 /* The next token should be either a `,' or a `;'. */
13110 /* If it's a `;', we are done. */
13114 {
13118 }
13119 /* Anything else is an error. */
13120 else
13121 {
13122 /* If we have already issued an error message we don't need
13123 to issue another one. */
13128 /* Skip tokens until we reach the end of the statement. */
13130 /* If the next token is now a `;', consume it. */
13134 }
13135 }
13136 else
13139 tree last_type;
13141 /* NULL_TREE if both variable and function declaration are allowed,
13142 error_mark_node if function declaration are not allowed and
13143 a FUNCTION_DECL that should be diagnosed if it is followed by
13144 variable declarations. */
13145 tree auto_function_declaration;
13148 auto_specifier_p
13152 /* Keep going until we hit the `;' at the end of the simple
13153 declaration. */
13156 CPP_SEMICOLON))
13157 {
13160 tree decl;
13164 {
13165 /* If we are processing next declarator, comma is expected */
13170 {
13174 }
13175 }
13176 else
13179 /* Parse the init-declarator. */
13182 function_definition_allowed_p,
13184 declares_class_or_enum,
13186 maybe_range_for_decl,
13189 /* If an error occurred while parsing tentatively, exit quickly.
13190 (That usually happens when in the body of a function; each
13191 statement is treated as a declaration-statement until proven
13192 otherwise.) */
13197 {
13198 /* If the init-declarator-list contains more than one
13199 init-declarator, they shall all form declarations of
13200 variables. */
13202 auto_function_declaration
13206 {
13208 "non-variable %qD in declaration with more than one "
13213 }
13214 }
13218 {
13222 {
13223 /* If the list of declarators contains more than one declarator,
13224 the type of each declared variable is determined as described
13225 above. If the type deduced for the template parameter U is not
13226 the same in each deduction, the program is ill-formed. */
13231 }
13232 else
13234 }
13236 /* Handle function definitions specially. */
13238 {
13239 /* If the next token is a `,', then we are probably
13240 processing something like:
13242 void f() {}, *p;
13244 which is erroneous. */
13246 {
13249 "mixing"
13251 }
13252 /* Otherwise, we're done with the list of declarators. */
13253 else
13254 {
13257 }
13258 }
13261 /* The next token should be either a `,' or a `;'. */
13263 /* If it's a `,', there are more declarators to come. */
13266 /* If it's a `;', we are done. */
13270 {
13275 }
13276 /* Anything else is an error. */
13277 else
13278 {
13279 /* If we have already issued an error message we don't need
13280 to issue another one. */
13285 /* Skip tokens until we reach the end of the statement. */
13287 /* If the next token is now a `;', consume it. */
13291 }
13292 /* After the first time around, a function-definition is not
13293 allowed -- even if it was OK at first. For example:
13295 int i, f() {}
13297 is not valid. */
13299 }
13301 /* Issue an error message if no declarators are present, and the
13302 decl-specifier-seq does not itself declare a class or
13303 enumeration: [dcl.dcl]/3. */
13305 {
13307 {
13311 /* Ensure an error is issued anyway when finish_decltype_type,
13312 called via cp_parser_decl_specifier_seq, returns a class or
13313 an enumeration (c++/51786). */
13316 }
13317 /* Perform any deferred access checks. */
13319 }
13321 /* Consume the `;'. */
13322 finish:
13326 {
13332 }
13334 done:
13336 }
13338 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13339 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13340 initializer ; */
13342 static tree
13347 {
13352 /* Parse the identifier-list. */
13356 {
13364 }
13368 {
13374 else
13375 {
13378 }
13379 }
13385 tree pushed_scope;
13392 NULL_TREE);
13399 cp_expr e;
13400 cp_decl_specifier_seq decl_specs;
13405 {
13408 else
13411 tree elt_pushed_scope;
13417 {
13418 /* Ensure we've diagnosed redeclaration if we aren't creating
13419 a new VAR_DECL. */
13422 }
13423 else
13427 }
13430 {
13433 }
13437 {
13445 || (is_direct_init
13448 {
13452 }
13455 {
13460 }
13461 }
13463 {
13465 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13466 the underlying DECL. */
13468 }
13474 {
13477 }
13480 }
13482 /* Parse a decl-specifier-seq.
13484 decl-specifier-seq:
13485 decl-specifier-seq [opt] decl-specifier
13486 decl-specifier attribute-specifier-seq [opt] (C++11)
13488 decl-specifier:
13489 storage-class-specifier
13490 type-specifier
13491 function-specifier
13492 friend
13493 typedef
13495 GNU Extension:
13497 decl-specifier:
13498 attributes
13500 Concepts Extension:
13502 decl-specifier:
13503 concept
13505 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13507 The parser flags FLAGS is used to control type-specifier parsing.
13509 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13510 flags:
13512 1: one of the decl-specifiers is an elaborated-type-specifier
13513 (i.e., a type declaration)
13514 2: one of the decl-specifiers is an enum-specifier or a
13515 class-specifier (i.e., a type definition)
13517 */
13519 static void
13521 cp_parser_flags flags,
13524 {
13528 cp_decl_spec ds;
13530 /* Clear DECL_SPECS. */
13533 /* Assume no class or enumeration type is declared. */
13536 /* Keep reading specifiers until there are no more to read. */
13538 {
13543 /* Peek at the next token. */
13546 /* Save the first token of the decl spec list for error
13547 reporting. */
13550 /* Handle attributes. */
13552 {
13553 /* Parse the attributes. */
13556 /* In a sequence of declaration specifiers, c++11 attributes
13557 appertain to the type that precede them. In that case
13558 [dcl.spec]/1 says:
13560 The attribute-specifier-seq affects the type only for
13561 the declaration it appears in, not other declarations
13562 involving the same type.
13564 But for now let's force the user to position the
13565 attribute either at the beginning of the declaration or
13566 after the declarator-id, which would clearly mean that it
13567 applies to the declarator. */
13569 {
13571 /* The c++11 attribute is at the beginning of the
13572 declaration. It appertains to the entity being
13574 else
13575 {
13577 {
13578 /* This is an attribute following a
13579 class-specifier. */
13584 }
13585 else
13586 {
13587 decl_specs->std_attributes
13591 }
13593 }
13594 }
13596 decl_specs->attributes
13601 }
13602 /* Assume we will find a decl-specifier keyword. */
13604 /* If the next token is an appropriate keyword, we can simply
13605 add it to the list. */
13607 {
13608 /* decl-specifier:
13609 friend
13610 constexpr */
13613 {
13618 }
13619 else
13620 {
13622 /* Consume the token. */
13624 }
13637 /* function-specifier:
13638 inline
13639 virtual
13640 explicit */
13647 /* decl-specifier:
13648 typedef */
13651 /* Consume the token. */
13653 /* A constructor declarator cannot appear in a typedef. */
13655 /* The "typedef" keyword can only occur in a declaration; we
13656 may as well commit at this point. */
13663 /* storage-class-specifier:
13664 auto
13665 register
13666 static
13667 extern
13668 mutable
13670 GNU Extension:
13671 thread */
13674 {
13675 /* Consume the token. */
13678 /* Complain about `auto' as a storage specifier, if
13679 we're complaining about C++0x compatibility. */
13683 "%<auto%> changes meaning in C++11; "
13686 /* Set the storage class anyway. */
13688 token);
13689 }
13690 else
13691 /* C++0x auto type-specifier. */
13699 /* Consume the token. */
13702 token);
13705 /* Consume the token. */
13711 /* We did not yet find a decl-specifier yet. */
13714 }
13731 /* Constructors are a special case. The `S' in `S()' is not a
13732 decl-specifier; it is the beginning of the declarator. */
13733 constructor_p
13734 = (!found_decl_spec
13735 && constructor_possible_p
13736 && (cp_parser_constructor_declarator_p
13739 /* If we don't have a DECL_SPEC yet, then we must be looking at
13740 a type-specifier. */
13742 {
13745 tree type_spec;
13747 type_spec
13749 decl_specs,
13755 /* If this type-specifier referenced a user-defined type
13756 (a typedef, class-name, etc.), then we can't allow any
13757 more such type-specifiers henceforth.
13759 [dcl.spec]
13761 The longest sequence of decl-specifiers that could
13762 possibly be a type name is taken as the
13763 decl-specifier-seq of a declaration. The sequence shall
13764 be self-consistent as described below.
13766 [dcl.type]
13768 As a general rule, at most one type-specifier is allowed
13769 in the complete decl-specifier-seq of a declaration. The
13770 only exceptions are the following:
13772 -- const or volatile can be combined with any other
13773 type-specifier.
13775 -- signed or unsigned can be combined with char, long,
13776 short, or int.
13778 -- ..
13780 Example:
13782 typedef char* Pc;
13783 void g (const int Pc);
13785 Here, Pc is *not* part of the decl-specifier seq; it's
13786 the declarator. Therefore, once we see a type-specifier
13787 (other than a cv-qualifier), we forbid any additional
13788 user-defined types. We *do* still allow things like `int
13789 int' to be considered a decl-specifier-seq, and issue the
13790 error message later. */
13793 /* A constructor declarator cannot follow a type-specifier. */
13795 {
13800 }
13801 }
13803 /* If we still do not have a DECL_SPEC, then there are no more
13804 decl-specifiers. */
13809 /* After we see one decl-specifier, further decl-specifiers are
13810 always optional. */
13812 }
13814 /* Don't allow a friend specifier with a class definition. */
13819 }
13821 /* Parse an (optional) storage-class-specifier.
13823 storage-class-specifier:
13824 auto
13825 register
13826 static
13827 extern
13828 mutable
13830 GNU Extension:
13832 storage-class-specifier:
13833 thread
13835 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13837 static tree
13839 {
13841 {
13845 /* Fall through for C++98. */
13853 /* Consume the token. */
13858 }
13859 }
13861 /* Parse an (optional) function-specifier.
13863 function-specifier:
13864 inline
13865 virtual
13866 explicit
13868 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13869 Updates DECL_SPECS, if it is non-NULL. */
13871 static tree
13874 {
13877 {
13883 /* 14.5.2.3 [temp.mem]
13885 A member function template shall not be virtual. */
13889 else
13899 }
13901 /* Consume the token. */
13903 }
13905 /* Parse a linkage-specification.
13907 linkage-specification:
13908 extern string-literal { declaration-seq [opt] }
13909 extern string-literal declaration */
13911 static void
13913 {
13914 tree linkage;
13916 /* Look for the `extern' keyword. */
13917 cp_token *extern_token
13920 /* Look for the string-literal. */
13924 /* Transform the literal into an identifier. If the literal is a
13925 wide-character string, or contains embedded NULs, then we can't
13926 handle it as the user wants. */
13929 {
13931 /* Assume C++ linkage. */
13933 }
13934 else
13937 /* We're now using the new linkage. */
13940 /* Preserve the location of the the innermost linkage specification,
13941 tracking the locations of nested specifications via a local. */
13942 location_t saved_location
13944 /* Construct a location ranging from the start of the "extern" to
13945 the end of the string-literal, with the caret at the start, e.g.:
13946 extern "C" {
13947 ^~~~~~~~~~
13948 */
13949 parser->innermost_linkage_specification_location
13954 /* If the next token is a `{', then we're using the first
13955 production. */
13957 {
13961 /* Consume the `{' token. */
13962 matching_braces braces;
13964 /* Parse the declarations. */
13966 /* Look for the closing `}'. */
13968 }
13969 /* Otherwise, there's just one declaration. */
13970 else
13971 {
13974 saved_in_unbraced_linkage_specification_p
13978 parser->in_unbraced_linkage_specification_p
13980 }
13982 /* We're done with the linkage-specification. */
13985 /* Restore location of parent linkage specification, if any. */
13987 }
13989 /* Parse a static_assert-declaration.
13991 static_assert-declaration:
13992 static_assert ( constant-expression , string-literal ) ;
13993 static_assert ( constant-expression ) ; (C++17)
13995 If MEMBER_P, this static_assert is a class member. */
13997 static void
13999 {
14000 cp_expr condition;
14001 location_t token_loc;
14002 tree message;
14005 /* Peek at the `static_assert' token so we can keep track of exactly
14006 where the static assertion started. */
14009 /* Look for the `static_assert' keyword. */
14011 RT_STATIC_ASSERT))
14014 /* We know we are in a static assertion; commit to any tentative
14015 parse. */
14019 /* Parse the `(' starting the static assertion condition. */
14020 matching_parens parens;
14023 /* Parse the constant-expression. Allow a non-constant expression
14024 here in order to give better diagnostics in finish_static_assert. */
14025 condition =
14031 {
14034 "static_assert without a message "
14036 /* Eat the ')' */
14041 }
14042 else
14043 {
14044 /* Parse the separating `,'. */
14047 /* Parse the string-literal message. */
14052 /* A `)' completes the static assertion. */
14058 }
14060 /* A semicolon terminates the declaration. */
14063 /* Get the location for the static assertion. Use that of the
14064 condition if available, otherwise, use that of the "static_assert"
14065 token. */
14070 /* Complete the static assertion, which may mean either processing
14071 the static assert now or saving it for template instantiation. */
14073 }
14075 /* Parse the expression in decltype ( expression ). */
14077 static tree
14080 {
14082 tree expr;
14084 /* Since we're going to preserve any side-effects from this parse, set up a
14085 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14086 in the expression. */
14089 /* First, try parsing an id-expression. */
14100 {
14103 cp_id_kind idk;
14107 /* Lookup the name we got back from the id-expression. */
14112 /* A template without args is not a complete id-expression. */
14121 {
14122 /* Complete lookup of the id-expression. */
14123 expr = (finish_id_expression
14136 /* We found an id-expression, but it was something that we
14137 should not have found. This is an error, not something
14138 we can recover from, so note that we found an
14139 id-expression and we'll recover as gracefully as
14140 possible. */
14142 }
14147 /* We have an id-expression. */
14149 }
14152 {
14153 /* Abort the id-expression parse. */
14156 /* Parsing tentatively, again. */
14159 /* Parse a class member access. */
14167 /* We have an id-expression. */
14169 }
14172 /* We have parsed the complete id-expression or member access. */
14174 else
14175 {
14176 /* Abort our attempt to parse an id-expression or member access
14177 expression. */
14180 /* Commit to the tentative_firewall so we get syntax errors. */
14183 /* Parse a full expression. */
14186 }
14189 }
14191 /* Parse a `decltype' type. Returns the type.
14193 simple-type-specifier:
14194 decltype ( expression )
14195 C++14 proposal:
14196 decltype ( auto ) */
14198 static tree
14200 {
14205 {
14206 /* Already parsed. */
14209 }
14211 /* Look for the `decltype' token. */
14215 /* Parse the opening `('. */
14216 matching_parens parens;
14226 /* decltype (auto) */
14228 else
14229 {
14230 /* decltype (expression) */
14232 /* Types cannot be defined in a `decltype' expression. Save away the
14233 old message and set the new one. */
14235 parser->type_definition_forbidden_message
14238 /* The restrictions on constant-expressions do not apply inside
14239 decltype expressions. */
14240 bool saved_integral_constant_expression_p
14242 bool saved_non_integral_constant_expression_p
14246 /* Within a parenthesized expression, a `>' token is always
14247 the greater-than operator. */
14248 bool saved_greater_than_is_operator_p
14252 /* Do not actually evaluate the expression. */
14255 /* Do not warn about problems with the expression. */
14260 /* Go back to evaluating expressions. */
14264 /* The `>' token might be the end of a template-id or
14265 template-parameter-list now. */
14266 parser->greater_than_is_operator_p
14269 /* Restore the old message and the integral constant expression
14270 flags. */
14272 parser->integral_constant_expression_p
14274 parser->non_integral_constant_expression_p
14276 }
14278 /* Parse to the closing `)'. */
14280 {
14285 }
14288 {
14289 /* Build auto. */
14292 }
14293 else
14295 tf_warning_or_error);
14297 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14298 it again. */
14309 }
14311 /* Special member functions [gram.special] */
14313 /* Parse a conversion-function-id.
14315 conversion-function-id:
14316 operator conversion-type-id
14318 Returns an IDENTIFIER_NODE representing the operator. */
14320 static tree
14322 {
14323 tree type;
14324 tree saved_scope;
14325 tree saved_qualifying_scope;
14326 tree saved_object_scope;
14329 /* Look for the `operator' token. */
14332 /* When we parse the conversion-type-id, the current scope will be
14333 reset. However, we need that information in able to look up the
14334 conversion function later, so we save it here. */
14338 /* We must enter the scope of the class so that the names of
14339 entities declared within the class are available in the
14340 conversion-type-id. For example, consider:
14342 struct S {
14343 typedef int I;
14344 operator I();
14345 };
14347 S::operator I() { ... }
14349 In order to see that `I' is a type-name in the definition, we
14350 must be in the scope of `S'. */
14353 /* Parse the conversion-type-id. */
14355 /* Leave the scope of the class, if any. */
14358 /* Restore the saved scope. */
14362 /* If the TYPE is invalid, indicate failure. */
14366 }
14368 /* Parse a conversion-type-id:
14370 conversion-type-id:
14371 type-specifier-seq conversion-declarator [opt]
14373 Returns the TYPE specified. */
14375 static tree
14377 {
14378 tree attributes;
14379 cp_decl_specifier_seq type_specifiers;
14381 tree type_specified;
14384 /* Parse the attributes. */
14388 parser->type_definition_forbidden_message
14391 /* Parse the type-specifiers. */
14398 /* If that didn't work, stop. */
14401 /* Parse the conversion-declarator. */
14409 /* Don't give this error when parsing tentatively. This happens to
14410 work because we always parse this definitively once. */
14413 {
14415 {
14418 }
14422 }
14425 }
14427 /* Parse an (optional) conversion-declarator.
14429 conversion-declarator:
14430 ptr-operator conversion-declarator [opt]
14432 */
14436 {
14439 cp_cv_quals cv_quals;
14441 /* We don't know if there's a ptr-operator next, or not. */
14443 /* Try the ptr-operator. */
14446 /* If it worked, look for more conversion-declarators. */
14448 {
14451 /* Parse another optional declarator. */
14454 declarator = cp_parser_make_indirect_declarator
14458 }
14461 }
14463 /* Parse an (optional) ctor-initializer.
14465 ctor-initializer:
14466 : mem-initializer-list */
14468 static void
14470 {
14471 /* If the next token is not a `:', then there is no
14472 ctor-initializer. */
14474 {
14475 /* Do default initialization of any bases and members. */
14479 }
14481 /* Consume the `:' token. */
14483 /* And the mem-initializer-list. */
14485 }
14487 /* Parse a mem-initializer-list.
14489 mem-initializer-list:
14490 mem-initializer ... [opt]
14491 mem-initializer ... [opt] , mem-initializer-list */
14493 static void
14495 {
14500 /* Let the semantic analysis code know that we are starting the
14501 mem-initializer-list. */
14506 /* Loop through the list. */
14508 {
14509 tree mem_initializer;
14512 /* Parse the mem-initializer. */
14514 /* If the next token is a `...', we're expanding member initializers. */
14520 {
14521 /* Consume the `...'. */
14525 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14526 can be expanded but members cannot. */
14529 {
14534 }
14536 /* Construct the pack expansion type. */
14539 }
14542 {
14546 }
14547 /* Look for a target constructor. */
14551 {
14554 {
14558 }
14560 }
14561 /* Add it to the list, unless it was erroneous. */
14563 {
14566 }
14567 /* If the next token is not a `,', we're done. */
14570 /* Consume the `,' token. */
14572 }
14574 /* Perform semantic analysis. */
14577 }
14579 /* Parse a mem-initializer.
14581 mem-initializer:
14582 mem-initializer-id ( expression-list [opt] )
14583 mem-initializer-id braced-init-list
14585 GNU extension:
14587 mem-initializer:
14588 ( expression-list [opt] )
14590 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14591 class) or FIELD_DECL (for a non-static data member) to initialize;
14592 the TREE_VALUE is the expression-list. An empty initialization
14593 list is represented by void_list_node. */
14595 static tree
14597 {
14598 tree mem_initializer_id;
14599 tree expression_list;
14600 tree member;
14603 /* Find out what is being initialized. */
14605 {
14609 }
14610 else
14611 {
14615 }
14621 {
14628 }
14629 else
14630 {
14640 }
14650 }
14652 /* Parse a mem-initializer-id.
14654 mem-initializer-id:
14655 :: [opt] nested-name-specifier [opt] class-name
14656 decltype-specifier (C++11)
14657 identifier
14659 Returns a TYPE indicating the class to be initialized for the first
14660 production (and the second in C++11). Returns an IDENTIFIER_NODE
14661 indicating the data member to be initialized for the last production. */
14663 static tree
14665 {
14669 tree id;
14673 /* `typename' is not allowed in this context ([temp.res]). */
14675 {
14677 "keyword %<typename%> not allowed in this context (a qualified "
14680 }
14681 /* Look for the optional `::' operator. */
14682 global_scope_p
14686 /* Look for the optional nested-name-specifier. The simplest way to
14687 implement:
14689 [temp.res]
14691 The keyword `typename' is not permitted in a base-specifier or
14692 mem-initializer; in these contexts a qualified name that
14693 depends on a template-parameter is implicitly assumed to be a
14694 type name.
14696 is to assume that we have seen the `typename' keyword at this
14697 point. */
14698 nested_name_specifier_p
14707 /* If there is a `::' operator or a nested-name-specifier, then we
14708 are definitely looking for a class-name. */
14713 typename_type,
14717 /* Otherwise, we could also be looking for an ordinary identifier. */
14720 /* Try a decltype-specifier. */
14722 else
14723 /* Otherwise, try a class-name. */
14727 none_type,
14731 /* If we found one, we're done. */
14734 /* Otherwise, look for an ordinary identifier. */
14736 }
14738 /* Overloading [gram.over] */
14740 /* Parse an operator-function-id.
14742 operator-function-id:
14743 operator operator
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 {
14751 /* Look for the `operator' keyword. */
14754 /* And then the name of the operator itself. */
14756 }
14758 /* Return an identifier node for a user-defined literal operator.
14759 The suffix identifier is chained to the operator name identifier. */
14761 tree
14763 {
14764 tree identifier;
14771 }
14773 /* Parse an operator.
14775 operator:
14776 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14777 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14778 || ++ -- , ->* -> () []
14780 GNU Extensions:
14782 operator:
14783 <? >? <?= >?=
14785 Returns an IDENTIFIER_NODE for the operator which is a
14786 human-readable spelling of the identifier, e.g., `operator +'. */
14788 static cp_expr
14790 {
14795 /* Peek at the next token. */
14800 /* Figure out which operator we have. */
14805 {
14807 {
14808 /* The keyword should be either `new' or `delete'. */
14813 else
14816 /* Consume the `new' or `delete' token. */
14819 /* Peek at the next token. */
14821 /* If it's a `[' token then this is the array variant of the
14822 operator. */
14824 {
14825 /* Consume the `[' token. */
14827 /* Look for the `]' token. */
14832 }
14836 }
14994 {
14995 /* Consume the `('. */
14996 matching_parens parens;
14998 /* Look for the matching `)'. */
15003 }
15006 /* Consume the `['. */
15008 /* Look for the matching `]'. */
15017 /* FALLTHRU */
15026 {
15033 /* Consume the string. */
15039 {
15042 }
15043 else
15044 {
15046 /* Look for the suffix identifier. */
15051 {
15055 }
15056 else
15057 {
15060 }
15061 }
15066 {
15069 }
15072 {
15075 }
15077 {
15080 }
15082 }
15085 /* Anything else is an error. */
15087 }
15089 /* If we have selected an identifier, we need to consume the
15090 operator token. */
15092 {
15096 }
15097 /* Otherwise, no valid operator name was present. */
15098 else
15099 {
15102 }
15105 }
15107 /* Parse a template-declaration.
15109 template-declaration:
15110 export [opt] template < template-parameter-list > declaration
15112 If MEMBER_P is TRUE, this template-declaration occurs within a
15113 class-specifier.
15115 The grammar rule given by the standard isn't correct. What
15116 is really meant is:
15118 template-declaration:
15119 export [opt] template-parameter-list-seq
15120 decl-specifier-seq [opt] init-declarator [opt] ;
15121 export [opt] template-parameter-list-seq
15122 function-definition
15124 template-parameter-list-seq:
15125 template-parameter-list-seq [opt]
15126 template < template-parameter-list >
15128 Concept Extensions:
15130 template-parameter-list-seq:
15131 template < template-parameter-list > requires-clause [opt]
15133 requires-clause:
15134 requires logical-or-expression */
15136 static void
15138 {
15139 /* Check for `export'. */
15141 {
15142 /* Consume the `export' token. */
15144 /* Warn that we do not support `export'. */
15146 }
15149 }
15151 /* Parse a template-parameter-list.
15153 template-parameter-list:
15154 template-parameter
15155 template-parameter-list , template-parameter
15157 Returns a TREE_LIST. Each node represents a template parameter.
15158 The nodes are connected via their TREE_CHAINs. */
15160 static tree
15162 {
15167 /* The loop below parses the template parms. We first need to know
15168 the total number of template parms to be able to compute proper
15169 canonical types of each dependent type. So after the loop, when
15170 we know the total number of template parms,
15171 end_template_parm_list computes the proper canonical types and
15172 fixes up the dependent types accordingly. */
15174 {
15175 tree parameter;
15178 location_t parm_loc;
15180 /* Parse the template-parameter. */
15185 /* Add it to the list. */
15188 parm_loc,
15189 parameter,
15190 is_non_type,
15191 is_parameter_pack);
15192 else
15193 {
15196 }
15198 /* If the next token is not a `,', we're done. */
15201 /* Otherwise, consume the `,' token. */
15203 }
15206 }
15208 /* Parse a introduction-list.
15210 introduction-list:
15211 introduced-parameter
15212 introduction-list , introduced-parameter
15214 introduced-parameter:
15215 ...[opt] identifier
15217 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15218 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15219 WILDCARD_DECL will also have DECL_NAME set and token location in
15220 DECL_SOURCE_LOCATION. */
15222 static tree
15224 {
15228 {
15233 /* Build placeholder. */
15241 /* If the next token is not a `,', we're done. */
15244 /* Otherwise, consume the `,' token. */
15246 }
15248 /* Convert the vec into a TREE_VEC. */
15251 tree parm;
15257 }
15259 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15260 is an abstract declarator. */
15264 {
15269 }
15271 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15272 is an abstract declarator. */
15276 {
15280 else
15282 }
15284 /* Returns true if DECL represents a constrained-parameter. */
15288 {
15293 }
15295 /* Returns true if PARM declares a constrained-parameter. */
15299 {
15301 }
15303 /* Check that the type parameter is only a declarator-id, and that its
15304 type is not cv-qualified. */
15306 bool
15309 {
15314 {
15317 }
15319 /* Don't allow cv-qualified type parameters. */
15322 {
15325 }
15328 }
15330 /* Finish parsing/processing a template type parameter and checking
15331 various restrictions. */
15335 tree id,
15337 {
15340 else
15342 }
15344 static tree
15346 {
15347 /* FIXME: This should probably be copied, and we may need to adjust
15348 the template parameter depths. */
15358 }
15360 /* Finish parsing/processing a template template parameter by borrowing
15361 the template parameter list from the prototype parameter. */
15363 static tree
15365 tree proto,
15366 tree id,
15368 {
15372 }
15374 /* Create a new non-type template parameter from the given PARM
15375 declarator. */
15377 static tree
15380 {
15386 }
15388 /* Build a constrained template parameter based on the PARMDECL
15389 declarator. The type of PARMDECL is the constrained type, which
15390 refers to the prototype template parameter that ultimately
15391 specifies the type of the declared parameter. */
15393 static tree
15398 {
15404 /* A template parameter constrained by a variadic concept shall also
15405 be declared as a template parameter pack. */
15410 /* Build the parameter. Return an error if the declarator was invalid. */
15411 tree parm;
15416 parmdecl);
15417 else
15422 /* Finish the parameter decl and create a node attaching the
15423 default argument and constraint. */
15428 }
15430 /* Returns true if the parsed type actually represents the declaration
15431 of a type template-parameter. */
15435 {
15438 }
15441 /* Returns true if the parsed type actually represents the declaration of
15442 a template template-parameter. */
15444 static bool
15446 {
15449 }
15451 /* Parse a default argument for a type template-parameter.
15452 Note that diagnostics are handled in cp_parser_template_parameter. */
15454 static tree
15456 {
15459 /* Consume the `=' token. */
15464 /* Parse the default-argument. */
15470 {
15474 }
15477 }
15479 /* Parse a default argument for a template template-parameter. */
15481 static tree
15483 {
15488 /* Consume the `='. */
15490 /* Parse the id-expression. */
15492 /* save token before parsing the id-expression, for error
15493 reporting */
15495 tree default_argument
15503 /* If the id-expression was a template-id that refers to
15504 a template-class, we already have the declaration here,
15505 so no further lookup is needed. */
15506 ;
15507 else
15508 /* Look up the name. */
15509 default_argument
15511 none_type,
15517 /* See if the default argument is valid. */
15521 }
15523 /* Parse a template-parameter.
15525 template-parameter:
15526 type-parameter
15527 parameter-declaration
15529 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15530 the parameter. The TREE_PURPOSE is the default value, if any.
15531 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15532 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15533 set to true iff this parameter is a parameter pack. */
15535 static tree
15538 {
15541 tree parm;
15543 /* Assume it is a type parameter or a template parameter. */
15545 /* Assume it not a parameter pack. */
15547 /* Peek at the next token. */
15549 /* If it is `template', we have a type-parameter. */
15552 /* If it is `class' or `typename' we do not know yet whether it is a
15553 type parameter or a non-type parameter. Consider:
15555 template <typename T, typename T::X X> ...
15557 or:
15559 template <class C, class D*> ...
15561 Here, the first parameter is a type parameter, and the second is
15562 a non-type parameter. We can tell by looking at the token after
15563 the identifier -- if it is a `,', `=', or `>' then we have a type
15564 parameter. */
15566 {
15567 /* Peek at the token after `class' or `typename'. */
15569 /* If it's an ellipsis, we have a template type parameter
15570 pack. */
15573 /* If it's an identifier, skip it. */
15576 /* Now, see if the token looks like the end of a template
15577 parameter. */
15582 }
15584 /* Otherwise, it is a non-type parameter or a constrained parameter.
15586 [temp.param]
15588 When parsing a default template-argument for a non-type
15589 template-parameter, the first non-nested `>' is taken as the end
15590 of the template parameter-list rather than a greater-than
15591 operator. */
15592 parameter_declarator
15599 /* If the parameter declaration is marked as a parameter pack, set
15600 *IS_PARAMETER_PACK to notify the caller. */
15605 {
15606 /* Can happen in some cases of erroneous input (c++/34892). */
15608 /* Consume the `...' for better error recovery. */
15610 }
15612 // The parameter may have been constrained.
15615 parameter_declarator,
15616 is_non_type,
15617 is_parameter_pack);
15619 // Now we're sure that the parameter is a non-type parameter.
15630 }
15632 /* Parse a type-parameter.
15634 type-parameter:
15635 class identifier [opt]
15636 class identifier [opt] = type-id
15637 typename identifier [opt]
15638 typename identifier [opt] = type-id
15639 template < template-parameter-list > class identifier [opt]
15640 template < template-parameter-list > class identifier [opt]
15641 = id-expression
15643 GNU Extension (variadic templates):
15645 type-parameter:
15646 class ... identifier [opt]
15647 typename ... identifier [opt]
15649 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15650 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15651 the declaration of the parameter.
15653 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15655 static tree
15657 {
15659 tree parameter;
15661 /* Look for a keyword to tell us what kind of parameter this is. */
15667 {
15670 {
15671 tree identifier;
15672 tree default_argument;
15674 /* If the next token is an ellipsis, we have a template
15675 argument pack. */
15677 {
15678 /* Consume the `...' token. */
15683 }
15685 /* If the next token is an identifier, then it names the
15686 parameter. */
15689 else
15692 /* Create the parameter. */
15695 /* If the next token is an `=', we have a default argument. */
15697 {
15698 default_argument
15701 /* Template parameter packs cannot have default
15702 arguments. */
15704 {
15707 "template parameter pack %qD cannot have a "
15709 else
15711 "template parameter packs cannot have "
15714 }
15717 }
15718 else
15721 /* Create the combined representation of the parameter and the
15722 default argument. */
15724 }
15728 {
15729 tree identifier;
15730 tree default_argument;
15732 /* Look for the `<'. */
15734 /* Parse the template-parameter-list. */
15736 /* Look for the `>'. */
15739 // If template requirements are present, parse them.
15741 {
15746 }
15748 /* Look for the `class' or 'typename' keywords. */
15750 /* If the next token is an ellipsis, we have a template
15751 argument pack. */
15753 {
15754 /* Consume the `...' token. */
15759 }
15760 /* If the next token is an `=', then there is a
15761 default-argument. If the next token is a `>', we are at
15762 the end of the parameter-list. If the next token is a `,',
15763 then we are at the end of this parameter. */
15767 {
15769 /* Treat invalid names as if the parameter were nameless. */
15772 }
15773 else
15776 /* Create the template parameter. */
15778 identifier);
15780 /* If the next token is an `=', then there is a
15781 default-argument. */
15783 {
15784 default_argument
15787 /* Template parameter packs cannot have default
15788 arguments. */
15790 {
15793 "template parameter pack %qD cannot "
15795 identifier);
15796 else
15800 }
15801 }
15802 else
15805 /* Create the combined representation of the parameter and the
15806 default argument. */
15808 }
15814 }
15817 }
15819 /* Parse a template-id.
15821 template-id:
15822 template-name < template-argument-list [opt] >
15824 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15825 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15826 returned. Otherwise, if the template-name names a function, or set
15827 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15828 names a class, returns a TYPE_DECL for the specialization.
15830 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15831 uninstantiated templates. */
15833 static tree
15839 {
15840 tree templ;
15841 tree arguments;
15842 tree template_id;
15847 /* If the next token corresponds to a template-id, there is no need
15848 to reparse it. */
15851 {
15854 }
15856 /* Avoid performing name lookup if there is no possibility of
15857 finding a template-id. */
15860 && !cp_parser_nth_token_starts_template_argument_list_p
15862 {
15865 }
15867 /* Remember where the template-id starts. */
15873 /* Parse the template-name. */
15876 check_dependency_p,
15877 is_declaration,
15878 tag_type,
15881 {
15884 }
15886 /* Since we're going to preserve any side-effects from this parse, set up a
15887 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15888 in the template arguments. */
15891 /* If we find the sequence `[:' after a template-name, it's probably
15892 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15893 parse correctly the argument list. */
15900 {
15902 /* Change `:' into `::'. */
15904 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15905 CPP_LESS. */
15908 /* Parse the arguments. */
15911 {
15912 /* If we couldn't parse an argument list, then we revert our changes
15913 and return simply an error. Maybe this is not a template-id
15914 after all. */
15919 }
15920 /* Otherwise, emit an error about the invalid digraph, but continue
15921 parsing because we got our argument list. */
15924 {
15927 "%<<:%> is an alternate spelling for %<[%>."
15930 {
15932 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15935 }
15936 }
15937 }
15938 else
15939 {
15940 /* Look for the `<' that starts the template-argument-list. */
15942 {
15945 }
15946 /* Parse the arguments. */
15948 }
15950 /* Set the location to be of the form:
15951 template-name < template-argument-list [opt] >
15952 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15953 with caret == start at the start of the template-name,
15954 ranging until the closing '>'. */
15955 location_t finish_loc
15957 location_t combined_loc
15960 /* Check for concepts autos where they don't belong. We could
15961 identify types in some cases of idnetifier TEMPL, looking ahead
15962 for a CPP_SCOPE, but that would buy us nothing: we accept auto in
15963 types. We reject them in functions, but if what we have is an
15964 identifier, even with none_type we can't conclude it's NOT a
15965 type, we have to wait for template substitution. */
15968 /* Build a representation of the specialization. */
15971 TEMPLATE_ID_EXPR,
15975 {
15977 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15978 template (rather than some instantiation thereof) only if
15979 is not nested within some other construct. For example, in
15980 "template <typename T> void f(T) { A<T>::", A<T> is just an
15981 instantiation of A. */
15984 CPP_SCOPE));
15985 template_id
15987 }
15988 /* A template-like identifier may be a partial concept id. */
15994 {
15998 }
15999 else
16000 {
16001 /* If it's not a class-template or a template-template, it should be
16002 a function-template. */
16010 }
16012 /* If parsing tentatively, replace the sequence of tokens that makes
16013 up the template-id with a CPP_TEMPLATE_ID token. That way,
16014 should we re-parse the token stream, we will not have to repeat
16015 the effort required to do the parse, nor will we issue duplicate
16016 error messages about problems during instantiation of the
16017 template. */
16019 /* Don't do this if we had a parse error in a declarator; re-parsing
16020 might succeed if a name changes meaning (60361). */
16024 {
16025 /* Reset the contents of the START_OF_ID token. */
16029 /* Retrieve any deferred checks. Do not pop this access checks yet
16030 so the memory will not be reclaimed during token replacing below. */
16036 /* Purge all subsequent tokens. */
16039 /* ??? Can we actually assume that, if template_id ==
16040 error_mark_node, we will have issued a diagnostic to the
16041 user, as opposed to simply marking the tentative parse as
16042 failed? */
16045 }
16049 }
16051 /* Parse a template-name.
16053 template-name:
16054 identifier
16056 The standard should actually say:
16058 template-name:
16059 identifier
16060 operator-function-id
16062 A defect report has been filed about this issue.
16064 A conversion-function-id cannot be a template name because they cannot
16065 be part of a template-id. In fact, looking at this code:
16067 a.operator K<int>()
16069 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
16070 It is impossible to call a templated conversion-function-id with an
16071 explicit argument list, since the only allowed template parameter is
16072 the type to which it is converting.
16074 If TEMPLATE_KEYWORD_P is true, then we have just seen the
16075 `template' keyword, in a construction like:
16077 T::template f<3>()
16079 In that case `f' is taken to be a template-name, even though there
16080 is no way of knowing for sure.
16082 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
16083 name refers to a set of overloaded functions, at least one of which
16084 is a template, or an IDENTIFIER_NODE with the name of the template,
16085 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
16086 names are looked up inside uninstantiated templates. */
16088 static tree
16095 {
16096 tree identifier;
16097 tree decl;
16100 /* If the next token is `operator', then we have either an
16101 operator-function-id or a conversion-function-id. */
16103 {
16104 /* We don't know whether we're looking at an
16105 operator-function-id or a conversion-function-id. */
16107 /* Try an operator-function-id. */
16109 /* If that didn't work, try a conversion-function-id. */
16111 {
16114 }
16115 }
16116 /* Look for the identifier. */
16117 else
16120 /* If we didn't find an identifier, we don't have a template-id. */
16124 /* If the name immediately followed the `template' keyword, then it
16125 is a template-name. However, if the next token is not `<', then
16126 we do not treat it as a template-name, since it is not being used
16127 as part of a template-id. This enables us to handle constructs
16128 like:
16130 template <typename T> struct S { S(); };
16131 template <typename T> S<T>::S();
16133 correctly. We would treat `S' as a template -- if it were `S<T>'
16134 -- but we do not if there is no `<'. */
16138 {
16139 /* In a declaration, in a dependent context, we pretend that the
16140 "template" keyword was present in order to improve error
16141 recovery. For example, given:
16143 template <typename T> void f(T::X<int>);
16145 we want to treat "X<int>" as a template-id. */
16147 && !template_keyword_p
16149 && check_dependency_p
16151 /* Do not do this for dtors (or ctors), since they never
16152 need the template keyword before their name. */
16154 {
16157 /* Explain what went wrong. */
16159 identifier);
16162 /* If parsing tentatively, find the location of the "<" token. */
16165 /* Parse the template arguments so that we can issue error
16166 messages about them. */
16169 /* Skip tokens until we find a good place from which to
16170 continue parsing. */
16175 /* If parsing tentatively, permanently remove the
16176 template argument list. That will prevent duplicate
16177 error messages from being issued about the missing
16178 "template" keyword. */
16185 }
16187 /* If the "template" keyword is present, then there is generally
16188 no point in doing name-lookup, so we just return IDENTIFIER.
16189 But, if the qualifying scope is non-dependent then we can
16190 (and must) do name-lookup normally. */
16192 {
16198 {
16199 /* We're optimizing away the call to cp_parser_lookup_name, but
16200 we still need to do this. */
16203 }
16204 }
16205 }
16207 /* Look up the name. */
16209 tag_type,
16212 check_dependency_p,
16218 /* If DECL is a template, then the name was a template-name. */
16220 {
16224 }
16225 else
16226 {
16227 /* The standard does not explicitly indicate whether a name that
16228 names a set of overloaded declarations, some of which are
16229 templates, is a template-name. However, such a name should
16230 be a template-name; otherwise, there is no way to form a
16231 template-id for the overloaded templates. */
16240 {
16241 /* The name does not name a template. */
16244 }
16245 }
16247 /* If DECL is dependent, and refers to a function, then just return
16248 its name; we will look it up again during template instantiation. */
16250 {
16254 }
16257 }
16259 /* Parse a template-argument-list.
16261 template-argument-list:
16262 template-argument ... [opt]
16263 template-argument-list , template-argument ... [opt]
16265 Returns a TREE_VEC containing the arguments. */
16267 static tree
16269 {
16274 tree vec;
16281 /* Even if the template-id appears in an integral
16282 constant-expression, the contents of the argument list do
16283 not. */
16289 /* Parse the arguments. */
16290 do
16291 {
16292 tree argument;
16295 /* Consume the comma. */
16298 /* Parse the template-argument. */
16301 /* If the next token is an ellipsis, we're expanding a template
16302 argument pack. */
16304 {
16306 {
16310 }
16311 /* Consume the `...' token. */
16314 /* Make the argument into a TYPE_PACK_EXPANSION or
16315 EXPR_PACK_EXPANSION. */
16317 }
16320 {
16324 {
16327 }
16328 else
16330 }
16332 }
16348 }
16350 /* Parse a template-argument.
16352 template-argument:
16353 assignment-expression
16354 type-id
16355 id-expression
16357 The representation is that of an assignment-expression, type-id, or
16358 id-expression -- except that the qualified id-expression is
16359 evaluated, so that the value returned is either a DECL or an
16360 OVERLOAD.
16362 Although the standard says "assignment-expression", it forbids
16363 throw-expressions or assignments in the template argument.
16364 Therefore, we use "conditional-expression" instead. */
16366 static tree
16368 {
16369 tree argument;
16375 cp_id_kind idk;
16377 /* There's really no way to know what we're looking at, so we just
16378 try each alternative in order.
16380 [temp.arg]
16382 In a template-argument, an ambiguity between a type-id and an
16383 expression is resolved to a type-id, regardless of the form of
16384 the corresponding template-parameter.
16386 Therefore, we try a type-id first. */
16389 /* If there was no error parsing the type-id but the next token is a
16390 '>>', our behavior depends on which dialect of C++ we're
16391 parsing. In C++98, we probably found a typo for '> >'. But there
16392 are type-id which are also valid expressions. For instance:
16394 struct X { int operator >> (int); };
16395 template <int V> struct Foo {};
16396 Foo<X () >> 5> r;
16398 Here 'X()' is a valid type-id of a function type, but the user just
16399 wanted to write the expression "X() >> 5". Thus, we remember that we
16400 found a valid type-id, but we still try to parse the argument as an
16401 expression to see what happens.
16403 In C++0x, the '>>' will be considered two separate '>'
16404 tokens. */
16408 {
16411 }
16412 else
16413 {
16414 /* If the next token isn't a `,' or a `>', then this argument wasn't
16415 really finished. This means that the argument is not a valid
16416 type-id. */
16419 /* If that worked, we're done. */
16422 }
16423 /* We're still not sure what the argument will be. */
16425 /* Try a template. */
16433 /* If the next token isn't a `,' or a `>', then this argument wasn't
16434 really finished. */
16438 {
16439 /* Figure out what is being referred to. If the id-expression
16440 was for a class template specialization, then we will have a
16441 TYPE_DECL at this point. There is no need to do name lookup
16442 at this point in that case. */
16445 none_type,
16451 /* Handle a constrained-type-specifier for a non-type template
16452 parameter. */
16458 }
16460 {
16464 }
16465 /* It must be a non-type argument. In C++17 any constant-expression is
16466 allowed. */
16470 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16472 -- an integral constant-expression of integral or enumeration
16473 type; or
16475 -- the name of a non-type template-parameter; or
16477 -- the name of an object or function with external linkage...
16479 -- the address of an object or function with external linkage...
16481 -- a pointer to member... */
16482 /* Look for a non-type template parameter. */
16484 {
16496 }
16498 /* If the next token is "&", the argument must be the address of an
16499 object or function with external linkage. */
16502 {
16505 }
16506 /* See if we might have an id-expression. */
16513 {
16516 address_p,
16523 else
16524 {
16525 tree probe;
16528 {
16529 /* Strip the dereference temporarily. */
16532 }
16534 /* If we're in a template, we represent a qualified-id referring
16535 to a static data member as a SCOPE_REF even if the scope isn't
16536 dependent so that we can check access control later. */
16541 {
16542 /* A variable without external linkage might still be a
16543 valid constant-expression, so no error is issued here
16544 if the external-linkage check fails. */
16547 }
16549 /* All overloaded functions are allowed; if the external
16550 linkage test does not pass, an error will be issued
16551 later. */
16552 ;
16556 /* A pointer-to-member. */
16557 ;
16559 ;
16560 else
16564 {
16567 tf_warning_or_error);
16568 else
16571 }
16572 }
16573 }
16574 /* If the argument started with "&", there are no other valid
16575 alternatives at this point. */
16577 {
16580 }
16582 general_expr:
16583 /* If the argument wasn't successfully parsed as a type-id followed
16584 by '>>', the argument can only be a constant expression now.
16585 Otherwise, we try parsing the constant-expression tentatively,
16586 because the argument could really be a type-id. */
16592 else
16593 {
16594 /* With C++17 generalized non-type template arguments we need to handle
16595 lvalue constant expressions, too. */
16598 }
16606 /* We did our best to parse the argument as a non type-id, but that
16607 was the only alternative that matched (albeit with a '>' after
16608 it). We can assume it's just a typo from the user, and a
16609 diagnostic will then be issued. */
16611 }
16613 /* Parse an explicit-instantiation.
16615 explicit-instantiation:
16616 template declaration
16618 Although the standard says `declaration', what it really means is:
16620 explicit-instantiation:
16621 template decl-specifier-seq [opt] declarator [opt] ;
16623 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16624 supposed to be allowed. A defect report has been filed about this
16625 issue.
16627 GNU Extension:
16629 explicit-instantiation:
16630 storage-class-specifier template
16631 decl-specifier-seq [opt] declarator [opt] ;
16632 function-specifier template
16633 decl-specifier-seq [opt] declarator [opt] ; */
16635 static void
16637 {
16639 cp_decl_specifier_seq decl_specifiers;
16644 /* Look for an (optional) storage-class-specifier or
16645 function-specifier. */
16647 {
16648 extension_specifier
16651 extension_specifier
16654 }
16656 /* Look for the `template' keyword. */
16658 /* Let the front end know that we are processing an explicit
16659 instantiation. */
16661 /* [temp.explicit] says that we are supposed to ignore access
16662 control while processing explicit instantiation directives. */
16664 /* Parse a decl-specifier-seq. */
16666 CP_PARSER_FLAGS_OPTIONAL,
16669 /* If there was exactly one decl-specifier, and it declared a class,
16670 and there's no declarator, then we have an explicit type
16671 instantiation. */
16673 {
16674 tree type;
16678 /* Turn access control back on for names used during
16679 template instantiation. */
16684 }
16685 else
16686 {
16688 tree decl;
16690 /* Parse the declarator. */
16691 declarator
16702 {
16705 "explicit instantiation shall not use"
16709 "explicit instantiation shall not use"
16714 /* Turn access control back on for names used during
16715 template instantiation. */
16717 /* Do the explicit instantiation. */
16719 }
16720 else
16721 {
16723 /* Skip the body of the explicit instantiation. */
16725 }
16726 }
16727 /* We're done with the instantiation. */
16733 }
16735 /* Parse an explicit-specialization.
16737 explicit-specialization:
16738 template < > declaration
16740 Although the standard says `declaration', what it really means is:
16742 explicit-specialization:
16743 template <> decl-specifier [opt] init-declarator [opt] ;
16744 template <> function-definition
16745 template <> explicit-specialization
16746 template <> template-declaration */
16748 static void
16750 {
16754 /* Look for the `template' keyword. */
16756 /* Look for the `<'. */
16758 /* Look for the `>'. */
16760 /* We have processed another parameter list. */
16762 /* [temp]
16764 A template ... explicit specialization ... shall not have C
16765 linkage. */
16767 {
16770 /* Give it C++ linkage to avoid confusing other parts of the
16771 front end. */
16774 }
16775 else
16777 /* Let the front end know that we are beginning a specialization. */
16779 {
16782 }
16784 /* If the next keyword is `template', we need to figure out whether
16785 or not we're looking a template-declaration. */
16787 {
16792 else
16794 }
16795 else
16796 /* Parse the dependent declaration. */
16802 /* We're done with the specialization. */
16804 /* For the erroneous case of a template with C linkage, we pushed an
16805 implicit C++ linkage scope; exit that scope now. */
16808 /* We're done with this parameter list. */
16810 }
16812 /* Parse a type-specifier.
16814 type-specifier:
16815 simple-type-specifier
16816 class-specifier
16817 enum-specifier
16818 elaborated-type-specifier
16819 cv-qualifier
16821 GNU Extension:
16823 type-specifier:
16824 __complex__
16826 Returns a representation of the type-specifier. For a
16827 class-specifier, enum-specifier, or elaborated-type-specifier, a
16828 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16830 The parser flags FLAGS is used to control type-specifier parsing.
16832 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16833 in a decl-specifier-seq.
16835 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16836 class-specifier, enum-specifier, or elaborated-type-specifier, then
16837 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16838 if a type is declared; 2 if it is defined. Otherwise, it is set to
16839 zero.
16841 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16842 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16843 is set to FALSE. */
16845 static tree
16847 cp_parser_flags flags,
16852 {
16858 /* Assume this type-specifier does not declare a new type. */
16861 /* And that it does not specify a cv-qualifier. */
16864 /* Peek at the next token. */
16867 /* If we're looking at a keyword, we can use that to guide the
16868 production we choose. */
16871 {
16876 /* Look for the enum-specifier. */
16878 /* If that worked, we're done. */
16880 {
16885 type_spec,
16886 token,
16889 }
16890 else
16893 /* Any of these indicate either a class-specifier, or an
16894 elaborated-type-specifier. */
16901 /* Parse tentatively so that we can back up if we don't find a
16902 class-specifier. */
16904 /* Look for the class-specifier. */
16907 /* If that worked, we're done. */
16909 {
16914 type_spec,
16915 token,
16918 }
16920 /* Fall through. */
16921 elaborated_type_specifier:
16922 /* We're declaring (not defining) a class or enum. */
16926 /* Fall through. */
16928 /* Look for an elaborated-type-specifier. */
16929 type_spec
16930 = (cp_parser_elaborated_type_specifier
16933 is_declaration));
16936 type_spec,
16937 token,
16960 /* The `__complex__' keyword is a GNU extension. */
16966 }
16968 /* Handle simple keywords. */
16970 {
16972 {
16975 }
16977 }
16979 /* If we do not already have a type-specifier, assume we are looking
16980 at a simple-type-specifier. */
16982 decl_specs,
16983 flags);
16985 /* If we didn't find a type-specifier, and a type-specifier was not
16986 optional in this context, issue an error message. */
16988 {
16991 }
16994 }
16996 /* Parse a simple-type-specifier.
16998 simple-type-specifier:
16999 :: [opt] nested-name-specifier [opt] type-name
17000 :: [opt] nested-name-specifier template template-id
17001 char
17002 wchar_t
17003 bool
17004 short
17005 int
17006 long
17007 signed
17008 unsigned
17009 float
17010 double
17011 void
17013 C++11 Extension:
17015 simple-type-specifier:
17016 auto
17017 decltype ( expression )
17018 char16_t
17019 char32_t
17020 __underlying_type ( type-id )
17022 C++17 extension:
17024 nested-name-specifier(opt) template-name
17026 GNU Extension:
17028 simple-type-specifier:
17029 __int128
17030 __typeof__ unary-expression
17031 __typeof__ ( type-id )
17032 __typeof__ ( type-id ) { initializer-list , [opt] }
17034 Concepts Extension:
17036 simple-type-specifier:
17037 constrained-type-specifier
17039 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
17040 appropriately updated. */
17042 static tree
17045 cp_parser_flags flags)
17046 {
17051 /* Peek at the next token. */
17054 /* If we're looking at a keyword, things are easy. */
17056 {
17091 {
17094 }
17123 {
17124 /* The 'auto' might be the placeholder return type for a function decl
17125 with trailing return type. */
17134 {
17136 {
17143 }
17146 {
17149 }
17152 }
17156 {
17159 }
17162 {
17165 }
17166 else
17170 {
17173 "use of %<auto%> in lambda parameter declaration "
17174 "only available with "
17176 }
17179 "use of %<auto%> in parameter declaration "
17180 "only available with "
17184 "use of %<auto%> in parameter declaration "
17186 }
17187 else
17192 /* Since DR 743, decltype can either be a simple-type-specifier by
17193 itself or begin a nested-name-specifier. Parsing it will replace
17194 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17195 handling below decide what to do. */
17201 /* Consume the `typeof' token. */
17203 /* Parse the operand to `typeof'. */
17205 /* If it is not already a TYPE, take its type. */
17211 token,
17220 token,
17230 token,
17235 }
17237 /* If token is an already-parsed decltype not followed by ::,
17238 it's a simple-type-specifier. */
17241 {
17244 {
17246 token,
17248 /* Remember that we are handling a decltype in order to
17249 implement the resolution of DR 1510 when the argument
17250 isn't instantiation dependent. */
17252 }
17255 }
17257 /* If the type-specifier was for a built-in type, we're done. */
17259 {
17260 /* Record the type. */
17267 type,
17268 token,
17273 /* Consume the token. */
17279 /* There is no valid C++ program where a non-template type is
17280 followed by a "<". That usually indicates that the user thought
17281 that the type was a template. */
17286 }
17288 /* The type-specifier must be a user-defined type. */
17290 {
17294 /* Don't gobble tokens or issue error messages if this is an
17295 optional type-specifier. */
17301 /* Look for the optional `::' operator. */
17302 global_p
17306 /* Look for the nested-name specifier. */
17307 qualified_p
17314 /* If we have seen a nested-name-specifier, and the next token
17315 is `template', then we are using the template-id production. */
17318 {
17319 /* Look for the template-id. */
17323 none_type,
17325 /* If the template-id did not name a type, we are out of
17326 luck. */
17328 {
17331 }
17332 }
17333 /* Otherwise, look for a type-name. */
17334 else
17336 /* Keep track of all name-lookups performed in class scopes. */
17338 && !global_p
17339 && !qualified_p
17343 /* If it didn't work out, we don't have a TYPE. */
17348 {
17362 {
17364 none_type,
17374 else
17375 {
17380 }
17381 }
17382 else
17388 }
17391 token,
17393 }
17395 /* If we didn't get a type-name, issue an error message. */
17397 {
17400 }
17403 {
17404 /* See if TYPE is an Objective-C type, and if so, parse and
17405 accept any protocol references following it. Do this before
17406 the cp_parser_check_for_invalid_template_id() call, because
17407 Objective-C types can be followed by '<...>' which would
17408 enclose protocol names rather than template arguments, and so
17409 everything is fine. */
17412 {
17416 /* Clobber the "unqualified" type previously entered into
17417 DECL_SPECS with the new, improved protocol-qualified version. */
17422 }
17424 /* There is no valid C++ program where a non-template type is
17425 followed by a "<". That usually indicates that the user
17426 thought that the type was a template. */
17428 none_type,
17430 }
17433 }
17435 /* Parse a type-name.
17437 type-name:
17438 class-name
17439 enum-name
17440 typedef-name
17441 simple-template-id [in c++0x]
17443 enum-name:
17444 identifier
17446 typedef-name:
17447 identifier
17449 Concepts:
17451 type-name:
17452 concept-name
17453 partial-concept-id
17455 concept-name:
17456 identifier
17458 Returns a TYPE_DECL for the type. */
17460 static tree
17462 {
17464 }
17466 /* See above. */
17467 static tree
17469 {
17470 tree type_decl;
17472 /* We can't know yet whether it is a class-name or not. */
17474 /* Try a class-name. */
17476 typename_keyword_p,
17478 none_type,
17482 /* If it's not a class-name, keep looking. */
17484 {
17486 /* It must be a typedef-name or an enum-name. */
17490 /* It is either a simple-template-id representing an
17491 instantiation of an alias template... */
17495 none_type,
17497 /* Note that this must be an instantiation of an alias template
17498 because [temp.names]/6 says:
17500 A template-id that names an alias template specialization
17501 is a type-name.
17503 Whereas [temp.names]/7 says:
17505 A simple-template-id that names a class template
17506 specialization is a class-name.
17508 With concepts, this could also be a partial-concept-id that
17509 declares a non-type template parameter. */
17516 else
17520 /* ... Or a typedef-name or an enum-name. */
17522 }
17525 }
17527 /* Check if DECL and ARGS can form a constrained-type-specifier.
17528 If ARGS is non-null, we try to form a concept check of the
17529 form DECL<?, ARGS> where ? is a wildcard that matches any
17530 kind of template argument. If ARGS is NULL, then we try to
17531 form a concept check of the form DECL<?>. */
17533 static tree
17536 {
17539 /* If we a constrained-type-specifier cannot be deduced. */
17543 /* A constrained type specifier can only be found in an
17544 overload set or as a reference to a template declaration.
17546 FIXME: This might be masking a bug. It's possible that
17547 that the deduction below is causing template specializations
17548 to be formed with the wildcard as an argument. */
17552 /* Try to build a call expression that evaluates the
17553 concept. This can fail if the overload set refers
17554 only to non-templates. */
17560 /* Deduce the checked constraint and the prototype parameter.
17562 FIXME: In certain cases, failure to deduce should be a
17563 diagnosable error. */
17564 tree conc;
17565 tree proto;
17569 /* In template parameter scope, this results in a constrained
17570 parameter. Return a descriptor of that parm. */
17574 /* In a parameter-declaration-clause, constrained-type
17575 specifiers result in invented template parameters. */
17577 {
17580 }
17581 else
17582 {
17583 /* Otherwise, we're in a context where the constrained
17584 type name is deduced and the constraint applies
17585 after deduction. */
17587 }
17590 }
17592 /* If DECL refers to a concept, return a TYPE_DECL representing
17593 the result of using the constrained type specifier in the
17594 current context. DECL refers to a concept if
17596 - it is an overload set containing a function concept taking a single
17597 type argument, or
17599 - it is a variable concept taking a single type argument. */
17601 static tree
17603 {
17609 else
17611 }
17613 /* Check if DECL and ARGS form a partial-concept-id. If so,
17614 assign ID to the resulting constrained placeholder.
17616 Returns true if the partial-concept-id designates a placeholder
17617 and false otherwise. Note that *id is set to NULL_TREE in
17618 this case. */
17620 static tree
17622 {
17624 }
17626 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17627 or a concept-name.
17629 enum-name:
17630 identifier
17632 typedef-name:
17633 identifier
17635 concept-name:
17636 identifier
17638 Returns a TYPE_DECL for the type. */
17640 static tree
17642 {
17643 tree type_decl;
17644 tree identifier;
17651 /* Look up the type-name. */
17656 /* If we found an overload set, then it may refer to a concept-name. */
17662 {
17663 /* See if this is an Objective-C type. */
17668 }
17670 /* Issue an error if we did not find a type-name. */
17672 /* In Objective-C, we have the complication that class names are
17673 normally type names and start declarations (eg, the
17674 "NSObject" in "NSObject *object;"), but can be used in an
17675 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17676 is an expression. So, a classname followed by a dot is not a
17677 valid type-name. */
17680 {
17685 }
17686 /* Remember that the name was used in the definition of the
17687 current class so that we can check later to see if the
17688 meaning would have been different after the class was
17689 entirely defined. */
17695 }
17697 /* Parse an elaborated-type-specifier. Note that the grammar given
17698 here incorporates the resolution to DR68.
17700 elaborated-type-specifier:
17701 class-key :: [opt] nested-name-specifier [opt] identifier
17702 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17703 enum-key :: [opt] nested-name-specifier [opt] identifier
17704 typename :: [opt] nested-name-specifier identifier
17705 typename :: [opt] nested-name-specifier template [opt]
17706 template-id
17708 GNU extension:
17710 elaborated-type-specifier:
17711 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17712 class-key attributes :: [opt] nested-name-specifier [opt]
17713 template [opt] template-id
17714 enum attributes :: [opt] nested-name-specifier [opt] identifier
17716 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17717 declared `friend'. If IS_DECLARATION is TRUE, then this
17718 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17719 something is being declared.
17721 Returns the TYPE specified. */
17723 static tree
17727 {
17729 tree identifier;
17732 tree globalscope;
17735 /* See if we're looking at the `enum' keyword. */
17737 {
17738 /* Consume the `enum' token. */
17740 /* Remember that it's an enumeration type. */
17742 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17743 enums) is used here. */
17747 {
17754 /* Consume the `struct' or `class' and parse it anyway. */
17756 }
17757 /* Parse the attributes. */
17759 }
17760 /* Or, it might be `typename'. */
17762 RID_TYPENAME))
17763 {
17764 /* Consume the `typename' token. */
17766 /* Remember that it's a `typename' type. */
17768 }
17769 /* Otherwise it must be a class-key. */
17770 else
17771 {
17775 /* Parse the attributes. */
17777 }
17779 /* Look for the `::' operator. */
17782 /* Look for the nested-name-specifier. */
17783 tree nested_name_specifier;
17785 {
17786 nested_name_specifier
17791 is_declaration);
17794 }
17795 else
17796 /* Even though `typename' is not present, the proposed resolution
17797 to Core Issue 180 says that in `class A<T>::B', `B' should be
17798 considered a type-name, even if `A<T>' is dependent. */
17799 nested_name_specifier
17804 is_declaration);
17805 /* For everything but enumeration types, consider a template-id.
17806 For an enumeration type, consider only a plain identifier. */
17808 {
17810 tree decl;
17812 /* Allow the `template' keyword. */
17814 /* If we didn't see `template', we don't know if there's a
17815 template-id or not. */
17818 /* Parse the template-id. */
17822 tag_type,
17823 is_declaration);
17824 /* If we didn't find a template-id, look for an ordinary
17825 identifier. */
17827 ;
17828 /* We can get here when cp_parser_template_id, called by
17829 cp_parser_class_name with tag_type == none_type, succeeds
17830 and caches a BASELINK. Then, when called again here,
17831 instead of failing and returning an error_mark_node
17832 returns it (see template/typename17.C in C++11).
17833 ??? Could we diagnose this earlier? */
17835 {
17838 }
17839 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17840 in effect, then we must assume that, upon instantiation, the
17841 template will correspond to a class. */
17845 typename_type,
17847 /* If the `typename' keyword is in effect and DECL is not a type
17848 decl, then type is non existent. */
17850 ;
17852 {
17856 /* If the next token is a semicolon, this must be a specialization,
17857 instantiation, or friend declaration. Check the scope while we
17858 still know whether or not we had a nested-name-specifier. */
17863 }
17866 }
17869 {
17874 {
17877 }
17879 /* For a `typename', we needn't call xref_tag. */
17885 /* Template parameter lists apply only if we are not within a
17886 function parameter list. */
17887 bool template_parm_lists_apply
17896 /* Look up a qualified name in the usual way. */
17898 {
17899 tree decl;
17900 tree ambiguous_decls;
17903 tag_type,
17910 /* If the lookup was ambiguous, an error will already have been
17911 issued. */
17915 /* If we are parsing friend declaration, DECL may be a
17916 TEMPLATE_DECL tree node here. However, we need to check
17917 whether this TEMPLATE_DECL results in valid code. Consider
17918 the following example:
17920 namespace N {
17921 template <class T> class C {};
17922 }
17923 class X {
17924 template <class T> friend class N::C; // #1, valid code
17925 };
17926 template <class T> class Y {
17927 friend class N::C; // #2, invalid code
17928 };
17930 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17931 name lookup of `N::C'. We see that friend declaration must
17932 be template for the code to be valid. Note that
17933 processing_template_decl does not work here since it is
17934 always 1 for the above two cases. */
17936 decl = (cp_parser_maybe_treat_template_as_class
17941 {
17943 identifier,
17946 }
17949 {
17953 allow_template);
17957 }
17959 /* Forward declarations of nested types, such as
17961 class C1::C2;
17962 class C1::C2::C3;
17964 are invalid unless all components preceding the final '::'
17965 are complete. If all enclosing types are complete, these
17966 declarations become merely pointless.
17968 Invalid forward declarations of nested types are errors
17969 caught elsewhere in parsing. Those that are pointless arrive
17970 here. */
17977 }
17978 else
17979 {
17980 /* An elaborated-type-specifier sometimes introduces a new type and
17981 sometimes names an existing type. Normally, the rule is that it
17982 introduces a new type only if there is not an existing type of
17983 the same name already in scope. For example, given:
17985 struct S {};
17986 void f() { struct S s; }
17988 the `struct S' in the body of `f' is the same `struct S' as in
17989 the global scope; the existing definition is used. However, if
17990 there were no global declaration, this would introduce a new
17991 local class named `S'.
17993 An exception to this rule applies to the following code:
17995 namespace N { struct S; }
17997 Here, the elaborated-type-specifier names a new type
17998 unconditionally; even if there is already an `S' in the
17999 containing scope this declaration names a new type.
18000 This exception only applies if the elaborated-type-specifier
18001 forms the complete declaration:
18003 [class.name]
18005 A declaration consisting solely of `class-key identifier ;' is
18006 either a redeclaration of the name in the current scope or a
18007 forward declaration of the identifier as a class name. It
18008 introduces the name into the current scope.
18010 We are in this situation precisely when the next token is a `;'.
18012 An exception to the exception is that a `friend' declaration does
18013 *not* name a new type; i.e., given:
18015 struct S { friend struct T; };
18017 `T' is not a new type in the scope of `S'.
18019 Also, `new struct S' or `sizeof (struct S)' never results in the
18020 definition of a new type; a new type can only be declared in a
18021 declaration context. */
18023 tag_scope ts;
18027 /* Friends have special name lookup rules. */
18031 CPP_SEMICOLON))
18032 /* This is a `class-key identifier ;' */
18034 else
18037 template_p =
18038 (template_parm_lists_apply
18041 /* An unqualified name was used to reference this type, so
18042 there were no qualifying templates. */
18051 }
18052 }
18057 /* Allow attributes on forward declarations of classes. */
18059 {
18069 else
18072 }
18075 {
18076 /* Indicate whether this class was declared as a `class' or as a
18077 `struct'. */
18081 }
18083 /* A "<" cannot follow an elaborated type specifier. If that
18084 happens, the user was probably trying to form a template-id. */
18089 }
18091 /* Parse an enum-specifier.
18093 enum-specifier:
18094 enum-head { enumerator-list [opt] }
18095 enum-head { enumerator-list , } [C++0x]
18097 enum-head:
18098 enum-key identifier [opt] enum-base [opt]
18099 enum-key nested-name-specifier identifier enum-base [opt]
18101 enum-key:
18102 enum
18103 enum class [C++0x]
18104 enum struct [C++0x]
18106 enum-base: [C++0x]
18107 : type-specifier-seq
18109 opaque-enum-specifier:
18110 enum-key identifier enum-base [opt] ;
18112 GNU Extensions:
18113 enum-key attributes[opt] identifier [opt] enum-base [opt]
18114 { enumerator-list [opt] }attributes[opt]
18115 enum-key attributes[opt] identifier [opt] enum-base [opt]
18116 { enumerator-list, }attributes[opt] [C++0x]
18118 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18119 if the token stream isn't an enum-specifier after all. */
18121 static tree
18123 {
18124 tree identifier;
18126 tree prev_scope;
18128 tree attributes;
18141 /* Parse tentatively so that we can back up if we don't find a
18142 enum-specifier. */
18145 /* Caller guarantees that the current token is 'enum', an identifier
18146 possibly follows, and the token after that is an opening brace.
18147 If we don't have an identifier, fabricate an anonymous name for
18148 the enumeration being defined. */
18151 /* Parse the "class" or "struct", which indicates a scoped
18152 enumeration type in C++0x. */
18155 {
18159 /* Consume the `struct' or `class' token. */
18163 }
18167 /* Clear the qualification. */
18172 /* Figure out in what scope the declaration is being placed. */
18178 nested_name_specifier
18186 {
18187 tree name;
18191 enum_type,
18196 input_location);
18198 {
18201 {
18202 /* Are template enums allowed in ISO? */
18206 /* ignore a typename reference, for it will be solved by name
18207 in start_enum. */
18209 }
18210 }
18213 else
18214 {
18219 }
18220 }
18221 else
18222 {
18225 else
18226 {
18232 }
18233 }
18236 /* Check for the `:' that denotes a specified underlying type in C++0x.
18237 Note that a ':' could also indicate a bitfield width, however. */
18239 {
18240 cp_decl_specifier_seq type_specifiers;
18242 /* Consume the `:'. */
18245 /* Parse the type-specifier-seq. */
18250 /* At this point this is surely not elaborated type specifier. */
18259 /* If that didn't work, stop. */
18261 {
18267 }
18268 }
18270 /* Look for the `{' but don't consume it yet. */
18272 {
18274 {
18277 {
18280 }
18281 }
18282 /* An opaque-enum-specifier must have a ';' here. */
18285 {
18288 {
18291 }
18292 }
18293 }
18299 {
18301 {
18305 }
18307 {
18309 }
18310 }
18312 /* Issue an error message if type-definitions are forbidden here. */
18315 else
18316 /* Create the new type. We do this before consuming the opening
18317 brace so the enum will be recorded as being on the line of its
18318 tag (or the 'enum' keyword, if there is no tag). */
18322 /* If the next token is not '{' it is an opaque-enum-specifier or an
18323 elaborated-type-specifier. */
18325 {
18329 {
18330 /* The following catches invalid code such as:
18331 enum class S<int>::E { A, B, C }; */
18339 {
18343 nested_name_specifier);
18345 }
18348 {
18350 "%qT for enum declaration does not name a class "
18353 }
18354 /* If that scope does not contain the scope in which the
18355 class was originally declared, the program is invalid. */
18357 nested_name_specifier))
18358 {
18361 "declaration of %qD in namespace %qD which does not "
18364 else
18366 "declaration of %qD in %qD which does not "
18370 }
18371 /* If that scope is the scope where the declaration is being placed
18372 the program is invalid. */
18376 {
18380 }
18381 }
18386 /* Consume the opening brace. */
18387 matching_braces braces;
18394 {
18398 }
18399 else
18400 {
18406 }
18410 /* If the next token is not '}', then there are some enumerators. */
18412 {
18416 }
18417 else
18420 /* Consume the final '}'. */
18426 }
18427 else
18428 {
18429 /* If a ';' follows, then it is an opaque-enum-specifier
18430 and additional restrictions apply. */
18432 {
18439 }
18440 }
18442 /* Look for trailing attributes to apply to this enumeration, and
18443 apply them if appropriate. */
18445 {
18448 trailing_attr,
18450 }
18452 /* Finish up the enumeration. */
18454 {
18459 }
18462 {
18464 {
18467 }
18469 {
18471 }
18472 }
18473 out:
18476 }
18478 /* Parse an enumerator-list. The enumerators all have the indicated
18479 TYPE.
18481 enumerator-list:
18482 enumerator-definition
18483 enumerator-list , enumerator-definition */
18485 static void
18487 {
18489 {
18490 /* Parse an enumerator-definition. */
18493 /* If the next token is not a ',', we've reached the end of
18494 the list. */
18497 /* Otherwise, consume the `,' and keep going. */
18499 /* If the next token is a `}', there is a trailing comma. */
18501 {
18506 }
18507 }
18508 }
18510 /* Parse an enumerator-definition. The enumerator has the indicated
18511 TYPE.
18513 enumerator-definition:
18514 enumerator
18515 enumerator = constant-expression
18517 enumerator:
18518 identifier
18520 GNU Extensions:
18522 enumerator-definition:
18523 enumerator attributes [opt]
18524 enumerator attributes [opt] = constant-expression */
18526 static void
18528 {
18529 tree identifier;
18530 tree value;
18531 location_t loc;
18533 /* Save the input location because we are interested in the location
18534 of the identifier and not the location of the explicit value. */
18537 /* Look for the identifier. */
18542 /* Parse any specified attributes. */
18545 /* If the next token is an '=', then there is an explicit value. */
18547 {
18548 /* Consume the `=' token. */
18550 /* Parse the value. */
18552 }
18553 else
18556 /* If we are processing a template, make sure the initializer of the
18557 enumerator doesn't contain any bare template parameter pack. */
18561 /* Create the enumerator. */
18563 }
18565 /* Parse a namespace-name.
18567 namespace-name:
18568 original-namespace-name
18569 namespace-alias
18571 Returns the NAMESPACE_DECL for the namespace. */
18573 static tree
18575 {
18576 tree identifier;
18577 tree namespace_decl;
18581 /* Get the name of the namespace. */
18586 /* Look up the identifier in the currently active scope. Look only
18587 for namespaces, due to:
18589 [basic.lookup.udir]
18591 When looking up a namespace-name in a using-directive or alias
18592 definition, only namespace names are considered.
18594 And:
18596 [basic.lookup.qual]
18598 During the lookup of a name preceding the :: scope resolution
18599 operator, object, function, and enumerator names are ignored.
18601 (Note that cp_parser_qualifying_entity only calls this
18602 function if the token after the name is the scope resolution
18603 operator.) */
18605 none_type,
18611 /* If it's not a namespace, issue an error. */
18614 {
18616 {
18622 }
18625 }
18628 }
18630 /* Parse a namespace-definition.
18632 namespace-definition:
18633 named-namespace-definition
18634 unnamed-namespace-definition
18636 named-namespace-definition:
18637 original-namespace-definition
18638 extension-namespace-definition
18640 original-namespace-definition:
18641 namespace identifier { namespace-body }
18643 extension-namespace-definition:
18644 namespace original-namespace-name { namespace-body }
18646 unnamed-namespace-definition:
18647 namespace { namespace-body } */
18649 static void
18651 {
18652 tree identifier;
18661 {
18664 }
18666 /* Look for the `namespace' keyword. */
18667 cp_token* token
18670 /* Parse any specified attributes before the identifier. */
18674 {
18678 {
18683 "standard attributes on namespaces must precede "
18686 /* Parse any attributes specified after the identifier. */
18688 }
18695 "nested namespace definitions only available with "
18698 /* Nested namespace names can create new namespaces (unlike
18699 other qualified-ids). */
18702 else
18705 }
18717 /* Start the namespace. */
18724 /* Look for the `{' to validate starting the namespace. */
18725 matching_braces braces;
18727 {
18728 /* Parse the body of the namespace. */
18731 /* Look for the final `}'. */
18733 }
18738 /* Pop the nested namespace definitions. */
18741 }
18743 /* Parse a namespace-body.
18745 namespace-body:
18746 declaration-seq [opt] */
18748 static void
18750 {
18752 }
18754 /* Parse a namespace-alias-definition.
18756 namespace-alias-definition:
18757 namespace identifier = qualified-namespace-specifier ; */
18759 static void
18761 {
18762 tree identifier;
18763 tree namespace_specifier;
18767 /* Look for the `namespace' keyword. */
18769 /* Look for the identifier. */
18773 /* Look for the `=' token. */
18776 {
18778 /* Skip the definition. */
18783 }
18785 /* Look for the qualified-namespace-specifier. */
18786 namespace_specifier
18788 /* Look for the `;' token. */
18791 /* Register the alias in the symbol table. */
18793 }
18795 /* Parse a qualified-namespace-specifier.
18797 qualified-namespace-specifier:
18798 :: [opt] nested-name-specifier [opt] namespace-name
18800 Returns a NAMESPACE_DECL corresponding to the specified
18801 namespace. */
18803 static tree
18805 {
18806 /* Look for the optional `::'. */
18810 /* Look for the optional nested-name-specifier. */
18818 }
18820 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18821 access declaration.
18823 using-declaration:
18824 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18825 using :: unqualified-id ;
18827 access-declaration:
18828 qualified-id ;
18830 */
18832 static bool
18835 {
18839 tree decl;
18840 tree identifier;
18841 tree qscope;
18846 {
18849 }
18850 else
18851 {
18852 /* Look for the `using' keyword. */
18855 again:
18856 /* Peek at the next token. */
18858 /* See if it's `typename'. */
18860 {
18861 /* Remember that we've seen it. */
18863 /* Consume the `typename' token. */
18865 }
18866 }
18868 /* Look for the optional global scope qualification. */
18869 global_scope_p
18874 /* If we saw `typename', or didn't see `::', then there must be a
18875 nested-name-specifier present. */
18877 {
18883 {
18886 }
18887 }
18888 /* Otherwise, we could be in either of the two productions. In that
18889 case, treat the nested-name-specifier as optional. */
18890 else
18902 /* Something has already gone wrong; there's no need to parse
18903 further. Since an error has occurred, the return value of
18904 cp_parser_parse_definitely will be false, as required. */
18908 /* Parse the unqualified-id. */
18916 {
18921 }
18923 {
18928 "pack expansion in using-declaration only available "
18931 }
18933 /* The function we call to handle a using-declaration is different
18934 depending on what scope we are in. */
18936 ;
18939 /* [namespace.udecl]
18941 A using declaration shall not name a template-id. */
18944 else
18945 {
18947 {
18948 /* Create the USING_DECL. */
18955 {
18958 }
18959 else
18960 /* Add it to the list of members in this class. */
18962 }
18963 else
18964 {
18966 identifier,
18973 {
18976 }
18979 else
18981 }
18982 }
18986 {
18990 "comma-separated list in using-declaration only available "
18993 }
18995 /* Look for the final `;'. */
19000 "access declarations are deprecated "
19001 "in favour of using-declarations; "
19005 }
19007 /* Parse an alias-declaration.
19009 alias-declaration:
19010 using identifier attribute-specifier-seq [opt] = type-id */
19012 static tree
19014 {
19016 location_t id_location;
19018 cp_decl_specifier_seq decl_specs;
19022 /* Look for the `using' keyword. */
19023 cp_token *using_token
19045 /* Now we are going to parse the type-id of the declaration. */
19047 /*
19048 [dcl.type]/3 says:
19050 "A type-specifier-seq shall not define a class or enumeration
19051 unless it appears in the type-id of an alias-declaration (7.1.3) that
19052 is not the declaration of a template-declaration."
19054 In other words, if we currently are in an alias template, the
19055 type-id should not define a type.
19057 So let's set parser->type_definition_forbidden_message in that
19058 case; cp_parser_check_type_definition (called by
19059 cp_parser_class_specifier) will then emit an error if a type is
19060 defined in the type-id. */
19062 {
19066 }
19070 /* Restore the error message if need be. */
19076 {
19079 }
19081 /* A typedef-name can also be introduced by an alias-declaration. The
19082 identifier following the using keyword becomes a typedef-name. It has
19083 the same semantics as if it were introduced by the typedef
19084 specifier. In particular, it does not define a new type and it shall
19085 not appear in the type-id. */
19090 {
19093 ds_attribute,
19094 attrs_token);
19095 }
19097 ds_typedef,
19098 using_token);
19100 ds_alias,
19101 using_token);
19107 id_location,
19118 else
19124 // Attach constraints to the alias declaration.
19126 {
19130 }
19137 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19138 added into the symbol table; otherwise, return the TYPE_DECL. */
19142 {
19146 }
19149 }
19151 /* Parse a using-directive.
19153 using-directive:
19154 using namespace :: [opt] nested-name-specifier [opt]
19155 namespace-name ; */
19157 static void
19159 {
19160 tree namespace_decl;
19161 tree attribs;
19163 /* Look for the `using' keyword. */
19165 /* And the `namespace' keyword. */
19167 /* Look for the optional `::' operator. */
19169 /* And the optional nested-name-specifier. */
19175 /* Get the namespace being used. */
19177 /* And any specified attributes. */
19180 /* Update the symbol table. */
19183 else
19186 /* Look for the final `;'. */
19188 }
19190 /* Parse an asm-definition.
19192 asm-definition:
19193 asm ( string-literal ) ;
19195 GNU Extension:
19197 asm-definition:
19198 asm volatile [opt] ( string-literal ) ;
19199 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19200 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19201 : asm-operand-list [opt] ) ;
19202 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19203 : asm-operand-list [opt]
19204 : asm-clobber-list [opt] ) ;
19205 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19206 : asm-clobber-list [opt]
19207 : asm-goto-list ) ; */
19209 static void
19211 {
19212 tree string;
19217 tree asm_stmt;
19225 /* Look for the `asm' keyword. */
19230 {
19233 }
19235 /* See if the next token is `volatile'. */
19238 {
19239 /* Remember that we saw the `volatile' keyword. */
19241 /* Consume the token. */
19243 }
19247 {
19248 /* Remember that we saw the `goto' keyword. */
19250 /* Consume the token. */
19252 }
19253 /* Look for the opening `('. */
19256 /* Look for the string. */
19259 {
19263 }
19265 /* If we're allowing GNU extensions, check for the extended assembly
19266 syntax. Unfortunately, the `:' tokens need not be separated by
19267 a space in C, and so, for compatibility, we tolerate that here
19268 too. Doing that means that we have to treat the `::' operator as
19269 two `:' tokens. */
19274 {
19279 /* The extended syntax was used. */
19282 /* Look for outputs. */
19284 {
19285 /* Consume the `:'. */
19287 /* Parse the output-operands. */
19289 CPP_COLON)
19291 CPP_SCOPE)
19293 CPP_CLOSE_PAREN)
19295 {
19299 }
19300 }
19301 /* If the next token is `::', there are no outputs, and the
19302 next token is the beginning of the inputs. */
19304 /* The inputs are coming next. */
19307 /* Look for inputs. */
19310 {
19311 /* Consume the `:' or `::'. */
19313 /* Parse the output-operands. */
19315 CPP_COLON)
19317 CPP_SCOPE)
19319 CPP_CLOSE_PAREN))
19320 {
19324 }
19325 }
19327 /* The clobbers are coming next. */
19330 /* Look for clobbers. */
19333 {
19335 /* Consume the `:' or `::'. */
19337 /* Parse the clobbers. */
19339 CPP_COLON)
19341 CPP_CLOSE_PAREN))
19343 }
19346 /* The labels are coming next. */
19349 /* Look for labels. */
19352 {
19354 /* Consume the `:' or `::'. */
19356 /* Parse the labels. */
19358 }
19362 }
19366 /* Look for the closing `)'. */
19374 {
19375 /* Create the ASM_EXPR. */
19377 {
19380 /* If the extended syntax was not used, mark the ASM_EXPR. */
19382 {
19388 }
19389 }
19390 else
19392 }
19393 }
19395 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19396 type that comes from the decl-specifier-seq. */
19398 static tree
19400 {
19403 {
19416 }
19419 }
19421 /* Declarators [gram.dcl.decl] */
19423 /* Parse an init-declarator.
19425 init-declarator:
19426 declarator initializer [opt]
19428 GNU Extension:
19430 init-declarator:
19431 declarator asm-specification [opt] attributes [opt] initializer [opt]
19433 function-definition:
19434 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19435 function-body
19436 decl-specifier-seq [opt] declarator function-try-block
19438 GNU Extension:
19440 function-definition:
19441 __extension__ function-definition
19443 TM Extension:
19445 function-definition:
19446 decl-specifier-seq [opt] declarator function-transaction-block
19448 The DECL_SPECIFIERS apply to this declarator. Returns a
19449 representation of the entity declared. If MEMBER_P is TRUE, then
19450 this declarator appears in a class scope. The new DECL created by
19451 this declarator is returned.
19453 The CHECKS are access checks that should be performed once we know
19454 what entity is being declared (and, therefore, what classes have
19455 befriended it).
19457 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19458 for a function-definition here as well. If the declarator is a
19459 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19460 be TRUE upon return. By that point, the function-definition will
19461 have been completely parsed.
19463 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19464 is FALSE.
19466 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19467 parsed declaration if it is an uninitialized single declarator not followed
19468 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19469 if present, will not be consumed. If returned, this declarator will be
19470 created with SD_INITIALIZED but will not call cp_finish_decl.
19472 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19473 and there is an initializer, the pointed location_t is set to the
19474 location of the '=' or `(', or '{' in C++11 token introducing the
19475 initializer. */
19477 static tree
19488 {
19492 tree prefix_attributes;
19494 tree asm_specification;
19495 tree initializer;
19497 tree scope;
19499 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19500 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19501 "(...)". */
19512 /* Gather the attributes that were provided with the
19513 decl-specifiers. */
19516 /* Assume that this is not the declarator for a function
19517 definition. */
19521 /* Default arguments are only permitted for function parameters. */
19525 /* Defer access checks while parsing the declarator; we cannot know
19526 what names are accessible until we know what is being
19527 declared. */
19532 /* Parse the declarator. */
19533 declarator
19538 /* Gather up the deferred checks. */
19543 /* If the DECLARATOR was erroneous, there's no need to go
19544 further. */
19548 /* Check that the number of template-parameter-lists is OK. */
19558 /* Figure out what scope the entity declared by the DECLARATOR is
19559 located in. `grokdeclarator' sometimes changes the scope, so
19560 we compute it now. */
19563 /* Perform any lookups in the declared type which were thought to be
19564 dependent, but are not in the scope of the declarator. */
19565 decl_specifiers->type
19568 /* If we're allowing GNU extensions, look for an
19569 asm-specification. */
19571 {
19572 /* Look for an asm-specification. */
19575 }
19576 else
19579 /* Look for attributes. */
19583 /* Peek at the next token. */
19589 {
19590 /* Handle C++17 deduction guides. */
19594 {
19602 {
19606 }
19607 }
19609 /* Check to see if the token indicates the start of a
19610 function-definition. */
19612 {
19614 {
19615 /* If a function-definition should not appear here, issue an
19616 error message. */
19620 }
19622 location_t func_brace_location
19625 /* Neither attributes nor an asm-specification are allowed
19626 on a function-definition. */
19629 "an asm-specification is not allowed "
19633 "attributes are not allowed "
19635 /* This is a function-definition. */
19638 /* Parse the function definition. */
19641 decl_specifiers,
19642 declarator,
19643 prefix_attributes);
19644 else
19645 decl =
19646 (cp_parser_function_definition_from_specifiers_and_declarator
19650 {
19651 /* This is where the prologue starts... */
19654 }
19657 }
19658 }
19660 {
19661 /* A non-template declaration involving a function parameter list
19662 containing an implicit template parameter will be made into a
19663 template. If the resulting declaration is not going to be an
19664 actual function then finish the template scope here to prevent it.
19665 An error message will be issued once we have a decl to talk about.
19667 FIXME probably we should do type deduction rather than create an
19668 implicit template, but the standard currently doesn't allow it. */
19671 }
19673 /* [dcl.dcl]
19675 Only in function declarations for constructors, destructors, type
19676 conversions, and deduction guides can the decl-specifier-seq be omitted.
19678 We explicitly postpone this check past the point where we handle
19679 function-definitions because we tolerate function-definitions
19680 that are missing their return types in some modes. */
19682 {
19686 }
19688 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19692 {
19703 {
19709 }
19710 }
19711 else
19712 {
19713 /* If the init-declarator isn't initialized and isn't followed by a
19714 `,' or `;', it's not a valid init-declarator. */
19717 {
19720 else
19721 {
19725 }
19726 }
19729 }
19731 /* Because start_decl has side-effects, we should only call it if we
19732 know we're going ahead. By this point, we know that we cannot
19733 possibly be looking at any other construct. */
19736 /* Enter the newly declared entry in the symbol table. If we're
19737 processing a declaration in a class-specifier, we wait until
19738 after processing the initializer. */
19740 {
19748 /* Adjust location of decl if declarator->id_loc is more appropriate:
19749 set, and decl wasn't merged with another decl, in which case its
19750 location would be different from input_location, and more accurate. */
19755 }
19757 /* Enter the SCOPE. That way unqualified names appearing in the
19758 initializer will be looked up in SCOPE. */
19761 /* Perform deferred access control checks, now that we know in which
19762 SCOPE the declared entity resides. */
19764 {
19767 /* If the entity being declared is a function, pretend that we
19768 are in its scope. If it is a `friend', it may have access to
19769 things that would not otherwise be accessible. */
19771 {
19774 }
19776 /* Perform access checks for template parameters. */
19779 /* Perform the access control checks for the declarator and the
19780 decl-specifiers. */
19783 /* Restore the saved value. */
19786 }
19788 /* Parse the initializer. */
19793 {
19795 {
19798 else
19799 {
19800 /* If the declaration was erroneous, we don't really
19801 know what the user intended, so just silently
19802 consume the initializer. */
19809 }
19810 }
19811 else
19812 {
19813 /* We want to record the extra mangling scope for in-class
19814 initializers of class members and initializers of static data
19815 member templates. The former involves deferring
19816 parsing of the initializer until end of class as with default
19817 arguments. So right here we only handle the latter. */
19827 }
19828 }
19830 /* The old parser allows attributes to appear after a parenthesized
19831 initializer. Mark Mitchell proposed removing this functionality
19832 on the GCC mailing lists on 2002-08-13. This parser accepts the
19833 attributes -- but ignores them. Made a permerror in GCC 8. */
19839 {
19842 {
19846 }
19847 }
19849 /* And now complain about a non-function implicit template. */
19854 /* For an in-class declaration, use `grokfield' to create the
19855 declaration. */
19857 {
19859 {
19862 }
19871 }
19873 /* Finish processing the declaration. But, skip member
19874 declarations. */
19876 {
19879 asm_specification,
19880 /* If the initializer is in parentheses, then this is
19881 a direct-initialization, which means that an
19882 `explicit' constructor is OK. Otherwise, an
19883 `explicit' constructor cannot be used. */
19886 }
19889 /* Core issue #226 (C++0x only): A default template-argument
19890 shall not be specified in a friend class template
19891 declaration. */
19900 {
19903 else
19905 }
19912 }
19914 /* Parse a declarator.
19916 declarator:
19917 direct-declarator
19918 ptr-operator declarator
19920 abstract-declarator:
19921 ptr-operator abstract-declarator [opt]
19922 direct-abstract-declarator
19924 GNU Extensions:
19926 declarator:
19927 attributes [opt] direct-declarator
19928 attributes [opt] ptr-operator declarator
19930 abstract-declarator:
19931 attributes [opt] ptr-operator abstract-declarator [opt]
19932 attributes [opt] direct-abstract-declarator
19934 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19935 detect constructors, destructors, deduction guides, or conversion operators.
19936 It is set to -1 if the declarator is a name, and +1 if it is a
19937 function. Otherwise it is set to zero. Usually you just want to
19938 test for >0, but internally the negative value is used.
19940 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19941 a decl-specifier-seq unless it declares a constructor, destructor,
19942 or conversion. It might seem that we could check this condition in
19943 semantic analysis, rather than parsing, but that makes it difficult
19944 to handle something like `f()'. We want to notice that there are
19945 no decl-specifiers, and therefore realize that this is an
19946 expression, not a declaration.)
19948 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19949 the declarator is a direct-declarator of the form "(...)".
19951 MEMBER_P is true iff this declarator is a member-declarator.
19953 FRIEND_P is true iff this declarator is a friend. */
19957 cp_parser_declarator_kind dcl_kind,
19961 {
19964 cp_cv_quals cv_quals;
19965 tree class_type;
19968 /* Assume this is not a constructor, destructor, or type-conversion
19969 operator. */
19976 /* Check for the ptr-operator production. */
19978 /* Parse the ptr-operator. */
19984 /* If that worked, then we have a ptr-operator. */
19986 {
19987 /* If a ptr-operator was found, then this declarator was not
19988 parenthesized. */
19991 /* The dependent declarator is optional if we are parsing an
19992 abstract-declarator. */
19996 /* Parse the dependent declarator. */
20001 friend_p);
20003 /* If we are parsing an abstract-declarator, we must handle the
20004 case where the dependent declarator is absent. */
20009 declarator = cp_parser_make_indirect_declarator
20011 }
20012 /* Everything else is a direct-declarator. */
20013 else
20014 {
20017 CPP_OPEN_PAREN);
20019 ctor_dtor_or_conv_p,
20021 }
20026 }
20028 /* Parse a direct-declarator or direct-abstract-declarator.
20030 direct-declarator:
20031 declarator-id
20032 direct-declarator ( parameter-declaration-clause )
20033 cv-qualifier-seq [opt]
20034 ref-qualifier [opt]
20035 exception-specification [opt]
20036 direct-declarator [ constant-expression [opt] ]
20037 ( declarator )
20039 direct-abstract-declarator:
20040 direct-abstract-declarator [opt]
20041 ( parameter-declaration-clause )
20042 cv-qualifier-seq [opt]
20043 ref-qualifier [opt]
20044 exception-specification [opt]
20045 direct-abstract-declarator [opt] [ constant-expression [opt] ]
20046 ( abstract-declarator )
20048 Returns a representation of the declarator. DCL_KIND is
20049 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
20050 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
20051 we are parsing a direct-declarator. It is
20052 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
20053 of ambiguity we prefer an abstract declarator, as per
20054 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
20055 as for cp_parser_declarator. */
20059 cp_parser_declarator_kind dcl_kind,
20062 {
20073 {
20074 /* Peek at the next token. */
20077 {
20078 /* This is either a parameter-declaration-clause, or a
20079 parenthesized declarator. When we know we are parsing a
20080 named declarator, it must be a parenthesized declarator
20081 if FIRST is true. For instance, `(int)' is a
20082 parameter-declaration-clause, with an omitted
20083 direct-abstract-declarator. But `((*))', is a
20084 parenthesized abstract declarator. Finally, when T is a
20085 template parameter `(T)' is a
20086 parameter-declaration-clause, and not a parenthesized
20087 named declarator.
20089 We first try and parse a parameter-declaration-clause,
20090 and then try a nested declarator (if FIRST is true).
20092 It is not an error for it not to be a
20093 parameter-declaration-clause, even when FIRST is
20094 false. Consider,
20096 int i (int);
20097 int i (3);
20099 The first is the declaration of a function while the
20100 second is the definition of a variable, including its
20101 initializer.
20103 Having seen only the parenthesis, we cannot know which of
20104 these two alternatives should be selected. Even more
20105 complex are examples like:
20107 int i (int (a));
20108 int i (int (3));
20110 The former is a function-declaration; the latter is a
20111 variable initialization.
20113 Thus again, we try a parameter-declaration-clause, and if
20114 that fails, we back out and return. */
20117 {
20118 tree params;
20123 /* In a member-declarator, the only valid interpretation
20124 of a parenthesis is the start of a
20125 parameter-declaration-clause. (It is invalid to
20126 initialize a static data member with a parenthesized
20127 initializer; only the "=" form of initialization is
20128 permitted.) */
20132 /* Consume the `('. */
20133 matching_parens parens;
20136 {
20137 /* If this is going to be an abstract declarator, we're
20138 in a declarator and we can't have default args. */
20141 }
20145 /* Parse the parameter-declaration-clause. */
20148 /* Consume the `)'. */
20151 /* If all went well, parse the cv-qualifier-seq,
20152 ref-qualifier and the exception-specification. */
20154 {
20155 cp_cv_quals cv_quals;
20156 cp_virt_specifiers virt_specifiers;
20157 cp_ref_qualifier ref_qual;
20158 tree exception_specification;
20159 tree late_return;
20160 tree attrs;
20170 /* Parse the cv-qualifier-seq. */
20172 /* Parse the ref-qualifier. */
20174 /* Parse the tx-qualifier. */
20176 /* And the exception-specification. */
20177 exception_specification
20182 /* In here, we handle cases where attribute is used after
20183 the function declaration. For example:
20184 void func (int x) __attribute__((vector(..))); */
20187 late_return = (cp_parser_late_return_type_opt
20191 /* Parse the virt-specifier-seq. */
20194 /* Create the function-declarator. */
20196 params,
20197 cv_quals,
20198 virt_specifiers,
20199 ref_qual,
20200 tx_qual,
20201 exception_specification,
20202 late_return,
20203 requires_clause);
20206 /* Any subsequent parameter lists are to do with
20207 return type, so are not those of the declared
20208 function. */
20210 }
20212 /* Remove the function parms from scope. */
20216 /* Repeat the main loop. */
20218 }
20220 /* If this is the first, we can try a parenthesized
20221 declarator. */
20223 {
20230 /* Consume the `('. */
20231 matching_parens parens;
20233 /* Parse the nested declarator. */
20236 declarator
20242 /* Expect a `)'. */
20250 }
20251 /* Otherwise, we must be done. */
20252 else
20254 }
20258 {
20259 /* Parse an array-declarator. */
20269 /* Consume the `['. */
20271 /* Peek at the next token. */
20273 /* If the next token is `]', then there is no
20274 constant-expression. */
20276 {
20278 bounds
20288 {
20289 /* Normally, the array bound must be an integral constant
20290 expression. However, as an extension, we allow VLAs
20291 in function scopes as long as they aren't part of a
20292 parameter declaration. */
20296 }
20299 {
20300 /* Remember this wasn't a constant-expression. */
20303 }
20304 }
20305 else
20307 /* Look for the closing `]'. */
20309 {
20312 }
20317 }
20319 {
20320 {
20321 tree qualifying_scope;
20322 tree unqualified_name;
20323 tree attrs;
20324 special_function_kind sfk;
20329 /* Parse a declarator-id */
20332 {
20335 /* If we see an ellipsis, we should be looking at a
20336 parameter pack. */
20338 {
20339 /* Consume the `...' */
20343 }
20344 }
20347 unqualified_name
20351 {
20355 {
20356 /* Check whether an error occurred. */
20359 /* We already consumed the ellipsis to mark a
20360 parameter pack, but we have no way to report it,
20361 so abort the tentative parse. We will be exiting
20362 immediately anyway. */
20364 }
20365 else
20371 && (qualifying_scope
20373 {
20376 }
20377 }
20382 {
20387 }
20393 {
20394 /* In the declaration of a member of a template class
20395 outside of the class itself, the SCOPE will sometimes
20396 be a TYPENAME_TYPE. For example, given:
20398 template <typename T>
20399 int S<T>::R::i = 3;
20401 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20402 this context, we must resolve S<T>::R to an ordinary
20403 type, rather than a typename type.
20405 The reason we normally avoid resolving TYPENAME_TYPEs
20406 is that a specialization of `S' might render
20407 `S<T>::R' not a type. However, if `S' is
20408 specialized, then this `i' will not be used, so there
20409 is no harm in resolving the types here. */
20410 tree type;
20412 /* Resolve the TYPENAME_TYPE. */
20415 /* If that failed, the declarator is invalid. */
20417 {
20420 "cannot define member of dependent typedef "
20422 else
20427 }
20429 }
20434 {
20435 tree class_type;
20440 else
20444 {
20448 {
20449 /* We do not attempt to print the declarator
20450 here because we do not have enough
20451 information about its original syntactic
20452 form. */
20456 }
20459 {
20463 "use %<%T::%D%> instead of %<%T::%D%> to "
20465 class_type,
20470 }
20472 }
20475 {
20482 for an unnamed type, even if the type
20483 got a name for linkage purposes. */
20485 /* Handle correctly (c++/19200):
20487 struct S {
20488 struct T{};
20489 friend void S(T);
20490 };
20492 and also:
20494 namespace N {
20495 void S();
20496 }
20498 struct S {
20499 friend void N::S();
20500 }; */
20503 class_type))
20512 }
20513 }
20515 unqualified_name,
20516 sfk);
20523 }
20525 handle_declarator:;
20528 {
20529 /* Any names that appear after the declarator-id for a
20530 member are looked up in the containing scope. */
20532 {
20533 /* But declarations with qualified-ids can't appear in a
20534 function. */
20538 }
20540 }
20544 /* Default args are only allowed on function
20545 declarations. */
20547 else
20551 }
20552 /* We're done. */
20553 else
20555 }
20557 /* For an abstract declarator, we might wind up with nothing at this
20558 point. That's an error; the declarator is not optional. */
20562 {
20563 /* Record overly parenthesized declarator so we can give a
20564 diagnostic about confusing decl/expr disambiguation. */
20566 {
20567 /* If the open and close parens are on different lines, this
20568 is probably a formatting thing, so ignore. */
20573 }
20576 }
20578 /* If we entered a scope, we must exit it now. */
20586 }
20588 /* Parse a ptr-operator.
20590 ptr-operator:
20591 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20592 * cv-qualifier-seq [opt]
20593 &
20594 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20595 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20597 GNU Extension:
20599 ptr-operator:
20600 & cv-qualifier-seq [opt]
20602 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20603 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20604 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20605 filled in with the TYPE containing the member. *CV_QUALS is
20606 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20607 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20608 Note that the tree codes returned by this function have nothing
20609 to do with the types of trees that will be eventually be created
20610 to represent the pointer or reference type being parsed. They are
20611 just constants with suggestive names. */
20612 static enum tree_code
20617 {
20622 /* Assume that it's not a pointer-to-member. */
20624 /* And that there are no cv-qualifiers. */
20627 /* Peek at the next token. */
20630 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20640 {
20641 /* Consume the `*', `&' or `&&'. */
20644 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20645 `&', if we are allowing GNU extensions. (The only qualifier
20646 that can legally appear after `&' is `restrict', but that is
20647 enforced during semantic analysis. */
20655 }
20656 else
20657 {
20658 /* Try the pointer-to-member case. */
20660 /* Look for the optional `::' operator. */
20663 /* Look for the nested-name specifier. */
20670 /* If we found it, and the next token is a `*', then we are
20671 indeed looking at a pointer-to-member operator. */
20674 {
20675 /* Indicate that the `*' operator was used. */
20683 else
20684 {
20685 /* The type of which the member is a member is given by the
20686 current SCOPE. */
20688 /* The next name will not be qualified. */
20692 /* Look for optional c++11 attributes. */
20696 /* Look for the optional cv-qualifier-seq. */
20698 }
20699 }
20700 /* If that didn't work we don't have a ptr-operator. */
20703 }
20706 }
20708 /* Parse an (optional) cv-qualifier-seq.
20710 cv-qualifier-seq:
20711 cv-qualifier cv-qualifier-seq [opt]
20713 cv-qualifier:
20714 const
20715 volatile
20717 GNU Extension:
20719 cv-qualifier:
20720 __restrict__
20722 Returns a bitmask representing the cv-qualifiers. */
20724 static cp_cv_quals
20726 {
20730 {
20732 cp_cv_quals cv_qualifier;
20734 /* Peek at the next token. */
20736 /* See if it's a cv-qualifier. */
20738 {
20754 }
20760 {
20765 }
20766 else
20767 {
20770 }
20771 }
20774 }
20776 /* Parse an (optional) ref-qualifier
20778 ref-qualifier:
20779 &
20780 &&
20782 Returns cp_ref_qualifier representing ref-qualifier. */
20784 static cp_ref_qualifier
20786 {
20789 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20794 {
20799 {
20811 }
20816 {
20819 }
20820 else
20821 {
20824 }
20825 }
20828 }
20830 /* Parse an optional tx-qualifier.
20832 tx-qualifier:
20833 transaction_safe
20834 transaction_safe_dynamic */
20836 static tree
20838 {
20841 {
20846 {
20850 {
20853 {
20856 }
20857 else
20859 }
20860 }
20861 }
20863 }
20865 /* Parse an (optional) virt-specifier-seq.
20867 virt-specifier-seq:
20868 virt-specifier virt-specifier-seq [opt]
20870 virt-specifier:
20871 override
20872 final
20874 Returns a bitmask representing the virt-specifiers. */
20876 static cp_virt_specifiers
20878 {
20882 {
20884 cp_virt_specifiers virt_specifier;
20886 /* Peek at the next token. */
20888 /* See if it's a virt-specifier-qualifier. */
20892 {
20895 }
20897 {
20900 }
20902 {
20904 }
20905 else
20909 {
20914 }
20915 else
20916 {
20919 }
20920 }
20922 }
20924 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20925 is in scope even though it isn't real. */
20927 void
20929 {
20930 tree this_parm;
20933 {
20934 /* We don't clear this between NSDMIs. Is it already what we want? */
20941 }
20944 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20946 current_class_ref
20949 }
20951 /* Return true iff our current scope is a non-static data member
20952 initializer. */
20954 bool
20956 {
20957 /* We recognize NSDMI context by the context-less 'this' pointer set up
20958 by the function above. */
20964 }
20966 /* Parse a late-specified return type, if any. This is not a separate
20967 non-terminal, but part of a function declarator, which looks like
20969 -> trailing-type-specifier-seq abstract-declarator(opt)
20971 Returns the type indicated by the type-id.
20973 In addition to this, parse any queued up #pragma omp declare simd
20974 clauses, and #pragma acc routine clauses.
20976 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20977 function. */
20979 static tree
20982 {
20986 && declarator
20990 && declarator
20993 /* Peek at the next token. */
20995 /* A late-specified return type is indicated by an initial '->'. */
21006 {
21007 /* DR 1207: 'this' is in scope in the trailing return type. */
21009 }
21012 {
21013 /* Consume the ->. */
21017 }
21019 /* Function declarations may be followed by a trailing
21020 requires-clause. */
21024 declarator->attributes
21028 declarator->attributes
21033 {
21036 }
21039 }
21041 /* Parse a declarator-id.
21043 declarator-id:
21044 id-expression
21045 :: [opt] nested-name-specifier [opt] type-name
21047 In the `id-expression' case, the value returned is as for
21048 cp_parser_id_expression if the id-expression was an unqualified-id.
21049 If the id-expression was a qualified-id, then a SCOPE_REF is
21050 returned. The first operand is the scope (either a NAMESPACE_DECL
21051 or TREE_TYPE), but the second is still just a representation of an
21052 unqualified-id. */
21054 static tree
21056 {
21057 tree id;
21058 /* The expression must be an id-expression. Assume that qualified
21059 names are the names of types so that:
21061 template <class T>
21062 int S<T>::R::i = 3;
21064 will work; we must treat `S<T>::R' as the name of a type.
21065 Similarly, assume that qualified names are templates, where
21066 required, so that:
21068 template <class T>
21069 int S<T>::R<T>::i = 3;
21071 will work, too. */
21077 optional_p);
21081 }
21083 /* Parse a type-id.
21085 type-id:
21086 type-specifier-seq abstract-declarator [opt]
21088 Returns the TYPE specified. */
21090 static tree
21093 {
21094 cp_decl_specifier_seq type_specifier_seq;
21097 /* Parse the type-specifier-seq. */
21099 is_trailing_return,
21104 /* A bare template name as a template argument is a template template
21105 argument, not a placeholder, so fail parsing it as a type argument. */
21106 {
21110 }
21114 /* There might or might not be an abstract declarator. */
21116 /* Look for the declarator. */
21117 abstract_declarator
21122 /* Check to see if there really was a declarator. */
21127 /* The concepts TS allows 'auto' as a type-id. */
21129 /* None of the valid uses of 'auto' in C++14 involve the type-id
21130 nonterminal, but it is valid in a trailing-return-type. */
21133 {
21134 /* A type-id with type 'auto' is only ok if the abstract declarator
21135 is a function declarator with a late-specified return type.
21137 A type-id with 'auto' is also valid in a trailing-return-type
21138 in a compound-requirement. */
21145 else
21146 {
21149 {
21151 auto_node);
21153 tmpl);
21154 }
21155 else
21158 }
21159 }
21162 is_template_arg);
21163 }
21165 static tree
21167 {
21169 }
21171 static tree
21173 {
21174 tree r;
21176 parser->type_definition_forbidden_message
21181 {
21184 }
21186 }
21188 static tree
21190 {
21192 }
21194 /* Parse a type-specifier-seq.
21196 type-specifier-seq:
21197 type-specifier type-specifier-seq [opt]
21199 GNU extension:
21201 type-specifier-seq:
21202 attributes type-specifier-seq [opt]
21204 If IS_DECLARATION is true, we are at the start of a "condition" or
21205 exception-declaration, so we might be followed by a declarator-id.
21207 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21208 i.e. we've just seen "->".
21210 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21212 static void
21217 {
21222 /* Clear the TYPE_SPECIFIER_SEQ. */
21225 /* In the context of a trailing return type, enum E { } is an
21226 elaborated-type-specifier followed by a function-body, not an
21227 enum-specifier. */
21231 /* Parse the type-specifiers and attributes. */
21233 {
21234 tree type_specifier;
21237 /* Check for attributes first. */
21239 {
21240 type_specifier_seq->attributes
21244 }
21246 /* record the token of the beginning of the type specifier seq,
21247 for error reporting purposes*/
21251 /* Look for the type-specifier. */
21253 flags,
21254 type_specifier_seq,
21256 NULL,
21259 {
21260 /* If the first type-specifier could not be found, this is not a
21261 type-specifier-seq at all. */
21263 {
21264 /* Set in_declarator_p to avoid skipping to the semicolon. */
21276 }
21277 /* If subsequent type-specifiers could not be found, the
21278 type-specifier-seq is complete. */
21280 }
21283 /* The standard says that a condition can be:
21285 type-specifier-seq declarator = assignment-expression
21287 However, given:
21289 struct S {};
21290 if (int S = ...)
21292 we should treat the "S" as a declarator, not as a
21293 type-specifier. The standard doesn't say that explicitly for
21294 type-specifier-seq, but it does say that for
21295 decl-specifier-seq in an ordinary declaration. Perhaps it
21296 would be clearer just to allow a decl-specifier-seq here, and
21297 then add a semantic restriction that if any decl-specifiers
21298 that are not type-specifiers appear, the program is invalid. */
21301 }
21302 }
21304 /* Return whether the function currently being declared has an associated
21305 template parameter list. */
21307 static bool
21309 {
21322 }
21324 /* Parse a parameter-declaration-clause.
21326 parameter-declaration-clause:
21327 parameter-declaration-list [opt] ... [opt]
21328 parameter-declaration-list , ...
21330 Returns a representation for the parameter declarations. A return
21331 value of NULL indicates a parameter-declaration-clause consisting
21332 only of an ellipsis. */
21334 static tree
21336 {
21337 tree parameters;
21345 && !processing_template_parmlist
21346 && !processing_explicit_instantiation
21347 /* default_arg_ok_p tracks whether this is a parameter-clause for an
21348 actual function or a random abstract declarator. */
21354 /* Peek at the next token. */
21356 /* Check for trivial parameter-declaration-clauses. */
21358 {
21359 /* Consume the `...' token. */
21362 }
21364 /* There are no parameters. */
21365 {
21366 #ifdef SYSTEM_IMPLICIT_EXTERN_C
21371 else
21372 #endif
21374 }
21375 /* Check for `(void)', too, which is a special case. */
21379 {
21380 /* Consume the `void' token. */
21382 /* There are no parameters. */
21384 }
21386 /* Parse the parameter-declaration-list. */
21388 /* If a parse error occurred while parsing the
21389 parameter-declaration-list, then the entire
21390 parameter-declaration-clause is erroneous. */
21394 /* Peek at the next token. */
21396 /* If it's a `,', the clause should terminate with an ellipsis. */
21398 {
21399 /* Consume the `,'. */
21401 /* Expect an ellipsis. */
21402 ellipsis_p
21404 }
21405 /* It might also be `...' if the optional trailing `,' was
21406 omitted. */
21408 {
21409 /* Consume the `...' token. */
21411 /* And remember that we saw it. */
21413 }
21414 else
21417 /* Finish the parameter list. */
21422 }
21424 /* Parse a parameter-declaration-list.
21426 parameter-declaration-list:
21427 parameter-declaration
21428 parameter-declaration-list , parameter-declaration
21430 Returns a representation of the parameter-declaration-list, as for
21431 cp_parser_parameter_declaration_clause. However, the
21432 `void_list_node' is never appended to the list. */
21434 static tree
21436 {
21442 /* The special considerations that apply to a function within an
21443 unbraced linkage specifications do not apply to the parameters
21444 to the function. */
21445 saved_in_unbraced_linkage_specification_p
21449 /* Look for more parameters. */
21451 {
21456 /* Parse the parameter. */
21457 parameter
21462 /* We don't know yet if the enclosing context is deprecated, so wait
21463 and warn in grokparms if appropriate. */
21467 {
21470 PARM,
21475 }
21479 /* If a parse error occurred parsing the parameter declaration,
21480 then the entire parameter-declaration-list is erroneous. */
21482 {
21485 }
21495 {
21499 }
21501 /* Add the new parameter to the list. */
21505 /* Peek at the next token. */
21508 /* These are for Objective-C++ */
21511 /* The parameter-declaration-list is complete. */
21514 {
21517 /* Peek at the next token. */
21519 /* If it's an ellipsis, then the list is complete. */
21522 /* Otherwise, there must be more parameters. Consume the
21523 `,'. */
21525 /* When parsing something like:
21527 int i(float f, double d)
21529 we can tell after seeing the declaration for "f" that we
21530 are not looking at an initialization of a variable "i",
21531 but rather at the declaration of a function "i".
21533 Due to the fact that the parsing of template arguments
21534 (as specified to a template-id) requires backtracking we
21535 cannot use this technique when inside a template argument
21536 list. */
21540 /* However, a parameter-declaration of the form
21541 "float(f)" (which is a valid declaration of a
21542 parameter "f") can also be interpreted as an
21543 expression (the conversion of "f" to "float"). */
21546 }
21547 else
21548 {
21556 }
21557 }
21559 parser->in_unbraced_linkage_specification_p
21562 /* Reset implicit_template_scope if we are about to leave the function
21563 parameter list that introduced it. Note that for out-of-line member
21564 definitions, there will be one or more class scopes before we get to
21565 the template parameter scope. */
21569 {
21573 {
21576 }
21577 }
21580 }
21582 /* Parse a parameter declaration.
21584 parameter-declaration:
21585 decl-specifier-seq ... [opt] declarator
21586 decl-specifier-seq declarator = assignment-expression
21587 decl-specifier-seq ... [opt] abstract-declarator [opt]
21588 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21590 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21591 declares a template parameter. (In that case, a non-nested `>'
21592 token encountered during the parsing of the assignment-expression
21593 is not interpreted as a greater-than operator.)
21595 Returns a representation of the parameter, or NULL if an error
21596 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21597 true iff the declarator is of the form "(p)". */
21603 {
21605 cp_decl_specifier_seq decl_specifiers;
21607 tree default_argument;
21612 /* In a template parameter, `>' is not an operator.
21614 [temp.param]
21616 When parsing a default template-argument for a non-type
21617 template-parameter, the first non-nested `>' is taken as the end
21618 of the template parameter-list rather than a greater-than
21619 operator. */
21621 /* Type definitions may not appear in parameter types. */
21623 parser->type_definition_forbidden_message
21630 /* Parse the declaration-specifiers. */
21633 CP_PARSER_FLAGS_NONE,
21637 /* Complain about missing 'typename' or other invalid type names. */
21642 /* If an error occurred, there's no reason to attempt to parse the
21643 rest of the declaration. */
21645 {
21648 }
21650 /* Peek at the next token. */
21653 /* If the next token is a `)', `,', `=', `>', or `...', then there
21654 is no declarator. However, when variadic templates are enabled,
21655 there may be a declarator following `...'. */
21660 {
21664 }
21665 /* Otherwise, there should be a declarator. */
21666 else
21667 {
21671 /* After seeing a decl-specifier-seq, if the next token is not a
21672 "(", there is no possibility that the code is a valid
21673 expression. Therefore, if parsing tentatively, we commit at
21674 this point. */
21676 /* In an expression context, having seen:
21678 (int((char ...
21680 we cannot be sure whether we are looking at a
21681 function-type (taking a "char" as a parameter) or a cast
21682 of some object of type "char" to "int". */
21688 /* Parse the declarator. */
21691 CP_PARSER_DECLARATOR_EITHER,
21693 parenthesized_p,
21697 /* After the declarator, allow more attributes. */
21698 decl_specifiers.attributes
21702 /* If the declarator is a template parameter pack, remember that and
21703 clear the flag in the declarator itself so we don't get errors
21704 from grokdeclarator. */
21706 {
21709 }
21710 }
21712 /* If the next token is an ellipsis, and we have not seen a declarator
21713 name, and if either the type of the declarator contains parameter
21714 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21715 for, eg, abbreviated integral type names), then we actually have a
21716 parameter pack expansion expression. Otherwise, leave the ellipsis
21717 for a C-style variadic function. */
21720 /* If a function parameter pack was specified and an implicit template
21721 parameter was introduced during cp_parser_parameter_declaration,
21722 change any implicit parameters introduced into packs. */
21726 {
21734 }
21737 {
21748 {
21749 /* Consume the `...'. */
21753 /* Build a pack expansion type */
21758 else
21760 }
21761 }
21763 /* The restriction on defining new types applies only to the type
21764 of the parameter, not to the default argument. */
21767 /* If the next token is `=', then process a default argument. */
21769 {
21772 /* If we are defining a class, then the tokens that make up the
21773 default argument must be saved and processed later. */
21779 // A constrained-type-specifier may declare a type template-parameter.
21781 default_argument
21784 // A constrained-type-specifier may declare a template-template-parameter.
21786 default_argument
21789 /* Outside of a class definition, we can just parse the
21790 assignment-expression. */
21791 else
21792 default_argument
21796 {
21798 "default arguments are only "
21800 }
21802 || template_parameter_pack_p
21805 {
21806 /* Find the name of the parameter pack. */
21813 template_parm_p
21819 else
21821 template_parm_p
21828 }
21829 }
21830 else
21833 /* Generate a location for the parameter, ranging from the start of the
21834 initial token to the end of the final token (using input_location for
21835 the latter, set up by cp_lexer_set_source_position_from_token when
21836 consuming tokens).
21838 If we have a identifier, then use it for the caret location, e.g.
21840 extern int callee (int one, int (*two)(int, int), float three);
21841 ~~~~~~^~~~~~~~~~~~~~
21843 otherwise, reuse the start location for the caret location e.g.:
21845 extern int callee (int one, int (*)(int, int), float three);
21846 ^~~~~~~~~~~~~~~~~
21848 */
21854 input_location);
21857 declarator,
21858 default_argument,
21859 param_loc,
21860 template_parameter_pack_p);
21861 }
21863 /* Parse a default argument and return it.
21865 TEMPLATE_PARM_P is true if this is a default argument for a
21866 non-type template parameter. */
21867 static tree
21869 {
21875 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21876 set correctly. */
21879 /* Local variable names (and the `this' keyword) may not
21880 appear in a default argument. */
21883 /* Parse the assignment-expression. */
21888 /* The "this" pointer is not valid in a default argument. */
21890 {
21895 }
21896 default_argument
21898 /* Restore the "this" pointer. */
21900 {
21903 }
21912 }
21914 /* Parse a function-body.
21916 function-body:
21917 compound_statement */
21919 static void
21921 {
21925 }
21927 /* Parse a ctor-initializer-opt followed by a function-body. Return
21928 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21929 is true we are parsing a function-try-block. */
21931 static void
21934 {
21941 /* Begin the function body. */
21943 /* Parse the optional ctor-initializer. */
21946 /* If we're parsing a constexpr constructor definition, we need
21947 to check that the constructor body is indeed empty. However,
21948 before we get to cp_parser_function_body lot of junk has been
21949 generated, so we can't just check that we have an empty block.
21950 Rather we take a snapshot of the outermost block, and check whether
21951 cp_parser_function_body changed its state. */
21953 {
21957 }
21958 /* Parse the function-body. */
21962 /* Finish the function body. */
21964 }
21966 /* Parse an initializer.
21968 initializer:
21969 = initializer-clause
21970 ( expression-list )
21972 Returns an expression representing the initializer. If no
21973 initializer is present, NULL_TREE is returned.
21975 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21976 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21977 set to TRUE if there is no initializer present. If there is an
21978 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21979 is set to true; otherwise it is set to false. */
21981 static tree
21984 {
21986 tree init;
21988 /* Peek at the next token. */
21991 /* Let our caller know whether or not this initializer was
21992 parenthesized. */
21994 /* Assume that the initializer is constant. */
21998 {
21999 /* Consume the `='. */
22001 /* Parse the initializer-clause. */
22003 }
22005 {
22010 non_constant_p);
22015 }
22017 {
22022 }
22023 else
22024 {
22025 /* Anything else is an error. */
22028 }
22034 }
22036 /* Parse an initializer-clause.
22038 initializer-clause:
22039 assignment-expression
22040 braced-init-list
22042 Returns an expression representing the initializer.
22044 If the `assignment-expression' production is used the value
22045 returned is simply a representation for the expression.
22047 Otherwise, calls cp_parser_braced_list. */
22049 static cp_expr
22051 {
22052 cp_expr initializer;
22054 /* Assume the expression is constant. */
22057 /* If it is not a `{', then we are looking at an
22058 assignment-expression. */
22060 {
22061 initializer
22064 non_constant_p);
22065 }
22066 else
22070 }
22072 /* Parse a brace-enclosed initializer list.
22074 braced-init-list:
22075 { initializer-list , [opt] }
22076 { designated-initializer-list , [opt] }
22077 { }
22079 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
22080 the elements of the initializer-list (or NULL, if the last
22081 production is used). The TREE_TYPE for the CONSTRUCTOR will be
22082 NULL_TREE. There is no way to detect whether or not the optional
22083 trailing `,' was provided. NON_CONSTANT_P is as for
22084 cp_parser_initializer. */
22086 static cp_expr
22088 {
22089 tree initializer;
22092 /* Consume the `{' token. */
22093 matching_braces braces;
22095 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22097 /* If it's not a `}', then there is a non-trivial initializer. */
22099 {
22100 /* Parse the initializer list. */
22103 /* A trailing `,' token is allowed. */
22106 }
22107 else
22109 /* Now, there should be a trailing `}'. */
22115 /* Build a location of the form:
22116 { ... }
22117 ^~~~~~~
22118 with caret==start at the open brace, finish at the close brace. */
22122 }
22124 /* Consume tokens up to, and including, the next non-nested closing `]'.
22125 Returns true iff we found a closing `]'. */
22127 static bool
22129 {
22133 {
22137 {
22140 /* If we've run out of tokens, then there is no closing `]'. */
22149 {
22152 }
22157 }
22159 /* Consume the token. */
22161 }
22162 }
22164 /* Return true if we are looking at an array-designator, false otherwise. */
22166 static bool
22168 {
22169 /* Consume the `['. */
22174 /* Skip tokens until the next token is a closing square bracket.
22175 If we find the closing `]', and the next token is a `=', then
22176 we are looking at an array designator. */
22177 bool array_designator_p
22181 /* Roll back the tokens we skipped. */
22185 }
22187 /* Parse an initializer-list.
22189 initializer-list:
22190 initializer-clause ... [opt]
22191 initializer-list , initializer-clause ... [opt]
22193 C++2A Extension:
22195 designated-initializer-list:
22196 designated-initializer-clause
22197 designated-initializer-list , designated-initializer-clause
22199 designated-initializer-clause:
22200 designator brace-or-equal-initializer
22202 designator:
22203 . identifier
22205 GNU Extension:
22207 initializer-list:
22208 designation initializer-clause ...[opt]
22209 initializer-list , designation initializer-clause ...[opt]
22211 designation:
22212 . identifier =
22213 identifier :
22214 [ constant-expression ] =
22216 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22217 for the initializer. If the INDEX of the elt is non-NULL, it is the
22218 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22219 as for cp_parser_initializer. */
22223 {
22228 /* Assume all of the expressions are constant. */
22231 /* Parse the rest of the list. */
22233 {
22235 tree designator;
22236 tree initializer;
22240 /* Handle the C++2A syntax, '. id ='. */
22248 {
22251 "C++ designated initializers only available with "
22253 /* Consume the `.'. */
22255 /* Consume the identifier. */
22258 /* Consume the `='. */
22260 }
22261 /* Also, if the next token is an identifier and the following one is a
22262 colon, we are looking at the GNU designated-initializer
22263 syntax. */
22268 {
22269 /* Warn the user that they are using an extension. */
22272 /* Consume the identifier. */
22274 /* Consume the `:'. */
22276 }
22277 /* Also handle C99 array designators, '[ const ] ='. */
22281 {
22282 /* In C++11, [ could start a lambda-introducer. */
22288 {
22291 }
22292 else
22293 {
22298 }
22303 && (!require_potential_rvalue_constant_expression
22307 /* Warn the user that they are using an extension. */
22310 }
22311 else
22315 {
22318 }
22322 {
22326 }
22330 /* Parse the initializer. */
22333 /* If any clause is non-constant, so is the entire initializer. */
22337 /* If we have an ellipsis, this is an initializer pack
22338 expansion. */
22340 {
22343 /* Consume the `...'. */
22350 /* Turn the initializer into an initializer expansion. */
22352 }
22354 /* Add it to the vector. */
22357 /* If the next token is not a comma, we have reached the end of
22358 the list. */
22362 /* Peek at the next token. */
22364 /* If the next token is a `}', then we're still done. An
22365 initializer-clause can have a trailing `,' after the
22366 initializer-list and before the closing `}'. */
22370 /* Consume the `,' token. */
22372 }
22374 /* The same identifier shall not appear in multiple designators
22375 of a designated-initializer-list. */
22377 {
22382 {
22384 {
22386 "%<.%s%> designator used multiple times in "
22390 }
22391 else
22393 }
22397 }
22400 }
22402 /* Classes [gram.class] */
22404 /* Parse a class-name.
22406 class-name:
22407 identifier
22408 template-id
22410 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22411 to indicate that names looked up in dependent types should be
22412 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22413 keyword has been used to indicate that the name that appears next
22414 is a template. TAG_TYPE indicates the explicit tag given before
22415 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22416 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22417 is the class being defined in a class-head. If ENUM_OK is TRUE,
22418 enum-names are also accepted.
22420 Returns the TYPE_DECL representing the class. */
22422 static tree
22431 {
22432 tree decl;
22433 tree scope;
22438 /* All class-names start with an identifier. */
22441 {
22444 }
22446 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22447 to a template-id, so we save it here. */
22452 /* Any name names a type if we're following the `typename' keyword
22453 in a qualified name where the enclosing scope is type-dependent. */
22456 /* Handle the common case (an identifier, but not a template-id)
22457 efficiently. */
22460 {
22464 /* Look for the identifier. */
22468 /* If the next token isn't an identifier, we are certainly not
22469 looking at a class-name. */
22472 /* If we know this is a type-name, there's no need to look it
22473 up. */
22476 else
22477 {
22478 tree ambiguous_decls;
22479 /* If we already know that this lookup is ambiguous, then
22480 we've already issued an error message; there's no reason
22481 to check again. */
22483 {
22486 }
22487 /* If the next token is a `::', then the name must be a type
22488 name.
22490 [basic.lookup.qual]
22492 During the lookup for a name preceding the :: scope
22493 resolution operator, object, function, and enumerator
22494 names are ignored. */
22497 /* Look up the name. */
22499 tag_type,
22502 check_dependency_p,
22506 {
22510 }
22511 }
22512 }
22513 else
22514 {
22515 /* Try a template-id. */
22517 check_dependency_p,
22518 tag_type,
22519 is_declaration);
22522 }
22526 /* If this is a typename, create a TYPENAME_TYPE. */
22528 {
22533 }
22537 /* Check to see that it is really the name of a class. */
22541 /* Situations like this:
22543 template <typename T> struct A {
22544 typename T::template X<int>::I i;
22545 };
22547 are problematic. Is `T::template X<int>' a class-name? The
22548 standard does not seem to be definitive, but there is no other
22549 valid interpretation of the following `::'. Therefore, those
22550 names are considered class-names. */
22551 {
22555 }
22560 /* In Objective-C 2.0, a classname followed by '.' starts a
22561 dot-syntax expression, and it's not a type-name. */
22573 }
22575 /* Parse a class-specifier.
22577 class-specifier:
22578 class-head { member-specification [opt] }
22580 Returns the TREE_TYPE representing the class. */
22582 static tree
22584 {
22585 tree type;
22599 /* Parse the class-head. */
22602 /* If the class-head was a semantic disaster, skip the entire body
22603 of the class. */
22605 {
22609 }
22611 /* Look for the `{'. */
22612 matching_braces braces;
22614 {
22617 }
22622 /* Issue an error message if type-definitions are forbidden here. */
22624 /* Remember that we are defining one more class. */
22626 /* Inside the class, surrounding template-parameter-lists do not
22627 apply. */
22628 saved_num_template_parameter_lists
22631 /* We are not in a function body. */
22634 /* Or in a loop. */
22637 /* Or in a switch. */
22640 /* We are not immediately inside an extern "lang" block. */
22641 saved_in_unbraced_linkage_specification_p
22645 // Associate constraints with the type.
22649 /* Start the class. */
22651 {
22654 }
22658 /* If the type is erroneous, skip the entire body of the class. */
22660 else
22661 /* Parse the member-specification. */
22664 /* Look for the trailing `}'. */
22666 /* Look for trailing attributes to apply to this class. */
22674 /* We've finished a type definition. Check for the common syntax
22675 error of forgetting a semicolon after the definition. We need to
22676 be careful, as we can't just check for not-a-semicolon and be done
22677 with it; the user might have typed:
22679 class X { } c = ...;
22680 class X { } *p = ...;
22682 and so forth. Instead, enumerate all the possible tokens that
22683 might follow this production; if we don't see one of them, then
22684 complain and silently insert the semicolon. */
22685 {
22690 /* Don't try to parse c++11 attributes here. As per the
22691 grammar, that should be a task for
22692 cp_parser_decl_specifier_seq. */
22696 {
22707 /* While it's legal for type qualifiers and storage class
22708 specifiers to follow type definitions in the grammar, only
22709 compiler testsuites contain code like that. Assume that if
22710 we see such code, then what we're really seeing is a case
22711 like:
22713 class X { }
22714 const <type> var = ...;
22716 or
22718 class Y { }
22719 static <type> func (...) ...
22721 i.e. the qualifier or specifier applies to the next
22722 declaration. To do so, however, we need to look ahead one
22723 more token to see if *that* token is a type specifier.
22725 This code could be improved to handle:
22727 class Z { }
22728 static const <type> var = ...; */
22731 {
22734 /* Handling user-defined types here would be nice, but very
22735 tricky. */
22736 want_semicolon
22739 }
22743 }
22745 /* If we don't have a type, then something is very wrong and we
22746 shouldn't try to do anything clever. Likewise for not seeing the
22747 closing brace. */
22749 {
22750 /* Locate the closing brace. */
22751 cp_token_position prev
22756 /* We want to suggest insertion of a ';' immediately *after* the
22757 closing brace, so, if we can, offset the location by 1 column. */
22764 /* If we successfully offset the location, suggest the fix-it. */
22777 else
22780 /* Unget one token and smash it to look as though we encountered
22781 a semicolon in the input stream. */
22786 }
22787 }
22789 /* If this class is not itself within the scope of another class,
22790 then we need to parse the bodies of all of the queued function
22791 definitions. Note that the queued functions defined in a class
22792 are not always processed immediately following the
22793 class-specifier for that class. Consider:
22795 struct A {
22796 struct B { void f() { sizeof (A); } };
22797 };
22799 If `f' were processed before the processing of `A' were
22800 completed, there would be no way to compute the size of `A'.
22801 Note that the nesting we are interested in here is lexical --
22802 not the semantic nesting given by TYPE_CONTEXT. In particular,
22803 for:
22805 struct A { struct B; };
22806 struct A::B { void f() { } };
22808 there is no need to delay the parsing of `A::B::f'. */
22810 {
22811 tree decl;
22819 {
22820 /* Skip default arguments, NSDMIs, etc, in order to improve
22821 error recovery (c++/71169, c++/71832). */
22826 }
22828 /* In a first pass, parse default arguments to the functions.
22829 Then, in a second pass, parse the bodies of the functions.
22830 This two-phased approach handles cases like:
22832 struct S {
22833 void f() { g(); }
22834 void g(int i = 3);
22835 };
22837 */
22839 {
22841 /* If there are default arguments that have not yet been processed,
22842 take care of them now. */
22844 {
22849 }
22850 /* Make sure that any template parameters are in scope. */
22852 /* Parse the default argument expressions. */
22854 /* Remove any template parameters from the symbol table. */
22856 }
22858 /* Now parse any NSDMIs. */
22862 {
22864 {
22869 }
22872 }
22879 /* Now do some post-NSDMI bookkeeping. */
22885 /* Now parse the body of the functions. */
22887 {
22888 /* OpenMP UDRs need to be parsed before all other functions. */
22895 }
22896 else
22900 }
22901 else
22904 /* Put back any saved access checks. */
22907 /* Restore saved state. */
22911 parser->num_template_parameter_lists
22913 parser->in_unbraced_linkage_specification_p
22917 }
22919 static tree
22921 {
22922 tree ret;
22927 }
22929 /* Parse a class-head.
22931 class-head:
22932 class-key identifier [opt] base-clause [opt]
22933 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22934 class-key nested-name-specifier [opt] template-id
22935 base-clause [opt]
22937 class-virt-specifier:
22938 final
22940 GNU Extensions:
22941 class-key attributes identifier [opt] base-clause [opt]
22942 class-key attributes nested-name-specifier identifier base-clause [opt]
22943 class-key attributes nested-name-specifier [opt] template-id
22944 base-clause [opt]
22946 Upon return BASES is initialized to the list of base classes (or
22947 NULL, if there are none) in the same form returned by
22948 cp_parser_base_clause.
22950 Returns the TYPE of the indicated class. Sets
22951 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22952 involving a nested-name-specifier was used, and FALSE otherwise.
22954 Returns error_mark_node if this is not a class-head.
22956 Returns NULL_TREE if the class-head is syntactically valid, but
22957 semantically invalid in a way that means we should skip the entire
22958 body of the class. */
22960 static tree
22963 {
22964 tree nested_name_specifier;
22968 tree attributes;
22969 tree bases;
22979 /* Assume no nested-name-specifier will be present. */
22981 /* Assume no template parameter lists will be used in defining the
22982 type. */
22986 /* Look for the class-key. */
22993 /* Parse the attributes. */
22996 /* If the next token is `::', that is invalid -- but sometimes
22997 people do try to write:
22999 struct ::S {};
23001 Handle this gracefully by accepting the extra qualifier, and then
23002 issuing an error about it later if this really is a
23003 class-head. If it turns out just to be an elaborated type
23004 specifier, remain silent. */
23010 /* Determine the name of the class. Begin by looking for an
23011 optional nested-name-specifier. */
23013 nested_name_specifier
23019 /* If there was a nested-name-specifier, then there *must* be an
23020 identifier. */
23025 {
23027 /* Although the grammar says `identifier', it really means
23028 `class-name' or `template-name'. You are only allowed to
23029 define a class that has already been declared with this
23030 syntax.
23032 The proposed resolution for Core Issue 180 says that wherever
23033 you see `class T::X' you should treat `X' as a type-name.
23035 It is OK to define an inaccessible class; for example:
23037 class A { class B; };
23038 class A::B {};
23040 We do not know if we will see a class-name, or a
23041 template-name. We look for a class-name first, in case the
23042 class-name is a template-id; if we looked for the
23043 template-name first we would stop after the template-name. */
23050 class_type,
23054 /* If that didn't work, ignore the nested-name-specifier. */
23056 {
23062 }
23063 /* If we could not find a corresponding TYPE, treat this
23064 declaration like an unqualified declaration. */
23067 /* Otherwise, count the number of templates used in TYPE and its
23068 containing scopes. */
23069 else
23071 }
23072 /* Otherwise, the identifier is optional. */
23073 else
23074 {
23075 /* We don't know whether what comes next is a template-id,
23076 an identifier, or nothing at all. */
23078 /* Check for a template-id. */
23083 class_key,
23085 /* If that didn't work, it could still be an identifier. */
23087 {
23089 {
23092 }
23093 else
23095 }
23096 else
23097 {
23100 }
23101 }
23106 {
23108 class_key,
23110 }
23113 /* If it's not a `:' or a `{' then we can't really be looking at a
23114 class-head, since a class-head only appears as part of a
23115 class-specifier. We have to detect this situation before calling
23116 xref_tag, since that has irreversible side-effects. */
23118 {
23122 }
23124 /* At this point, we're going ahead with the class-specifier, even
23125 if some other problem occurs. */
23128 {
23133 }
23134 /* Issue the error about the overly-qualified name now. */
23136 {
23141 }
23143 {
23148 }
23150 {
23151 tree scope;
23154 /* [temp.names]: in a qualified-id formed by a class-head-name, the
23155 keyword template shall not appear at the top level. */
23159 /* Reject typedef-names in class heads. */
23161 {
23164 type);
23167 }
23169 /* Figure out in what scope the declaration is being placed. */
23171 /* If that scope does not contain the scope in which the
23172 class was originally declared, the program is invalid. */
23174 {
23177 "declaration of %qD in namespace %qD which does not "
23180 else
23186 }
23187 /* [dcl.meaning]
23189 A declarator-id shall not be qualified except for the
23190 definition of a ... nested class outside of its class
23191 ... [or] the definition or explicit instantiation of a
23192 class member of a namespace outside of its namespace. */
23194 {
23199 }
23200 }
23201 /* An explicit-specialization must be preceded by "template <>". If
23202 it is not, try to recover gracefully. */
23205 && !processing_template_parmlist
23207 {
23208 /* Build a location of this form:
23209 struct typename <ARGS>
23210 ^~~~~~~~~~~~~~~~~~~~~~
23211 with caret==start at the start token, and
23212 finishing at the end of the type. */
23213 location_t reported_loc
23215 class_head_start_location,
23221 "an explicit specialization must be preceded by"
23224 /* Take the same action that would have been taken by
23225 cp_parser_explicit_specialization. */
23228 }
23229 /* There must be no "return" statements between this point and the
23230 end of this function; set "type "to the correct return value and
23231 use "goto done;" to return. */
23232 /* Make sure that the right number of template parameters were
23233 present. */
23235 template_id_p,
23238 {
23239 /* If something went wrong, there is no point in even trying to
23240 process the class-definition. */
23243 }
23245 /* Look up the type. */
23247 {
23251 {
23255 }
23256 else
23257 {
23261 /* Check the scope while we still know whether or not we had a
23262 nested-name-specifier. */
23265 }
23268 }
23270 {
23271 tree class_type;
23273 /* Given:
23275 template <typename T> struct S { struct T };
23276 template <typename T> struct S<T>::T { };
23278 we will get a TYPENAME_TYPE when processing the definition of
23279 `S::T'. We need to resolve it to the actual type before we
23280 try to define it. */
23282 {
23287 else
23288 {
23291 }
23292 }
23296 {
23299 }
23302 /* Enter the scope indicated by the nested-name-specifier. */
23304 /* Get the canonical version of this type. */
23306 /* Call push_template_decl if it seems like we should be defining a
23307 template either from the template headers or the type we're
23308 defining, so that we diagnose both extra and missing headers. */
23312 {
23315 {
23318 }
23319 }
23323 }
23325 {
23326 /* If the class was unnamed, create a dummy name. */
23330 ? ts_within_enclosing_non_class
23334 }
23336 /* Indicate whether this class was declared as a `class' or as a
23337 `struct'. */
23342 /* If this type was already complete, and we see another definition,
23343 that's an error. */
23345 {
23347 type);
23349 type);
23352 }
23357 {
23358 /* Apply attributes now, before any use of the class as a template
23359 argument in its base list. */
23362 }
23364 /* We will have entered the scope containing the class; the names of
23365 base classes should be looked up in that context. For example:
23367 struct A { struct B {}; struct C; };
23368 struct A::C : B {};
23370 is valid. */
23372 /* Get the list of base-classes, if there is one. */
23374 {
23375 /* PR59482: enter the class scope so that base-specifiers are looked
23376 up correctly. */
23380 /* PR59482: get out of the previously pushed class scope so that the
23381 subsequent pops pop the right thing. */
23384 }
23385 else
23388 /* If we're really defining a class, process the base classes.
23389 If they're invalid, fail. */
23393 done:
23394 /* Leave the scope given by the nested-name-specifier. We will
23395 enter the class scope itself while processing the members. */
23400 {
23403 }
23409 out:
23412 }
23414 /* Parse a class-key.
23416 class-key:
23417 class
23418 struct
23419 union
23421 Returns the kind of class-key specified, or none_type to indicate
23422 error. */
23424 static enum tag_types
23426 {
23430 /* Look for the class-key. */
23435 /* Check to see if the TOKEN is a class-key. */
23440 }
23442 /* Parse a type-parameter-key.
23444 type-parameter-key:
23445 class
23446 typename
23447 */
23449 static void
23451 {
23452 /* Look for the type-parameter-key. */
23456 {
23459 /* typename is not allowed in a template template parameter
23460 by the standard until C++17. */
23462 "ISO C++ forbids typename key in template template parameter;"
23464 }
23465 else
23469 }
23471 /* Parse an (optional) member-specification.
23473 member-specification:
23474 member-declaration member-specification [opt]
23475 access-specifier : member-specification [opt] */
23477 static void
23479 {
23481 {
23485 /* Peek at the next token. */
23487 /* If it's a `}', or EOF then we've seen all the members. */
23493 /* See if this token is a keyword. */
23496 {
23500 /* Consume the access-specifier. */
23502 /* Remember which access-specifier is active. */
23504 /* Look for the `:'. */
23509 /* Accept #pragmas at class scope. */
23511 {
23514 }
23516 /* Otherwise, the next construction must be a
23517 member-declaration. */
23519 }
23520 }
23521 }
23523 /* Parse a member-declaration.
23525 member-declaration:
23526 decl-specifier-seq [opt] member-declarator-list [opt] ;
23527 function-definition ; [opt]
23528 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23529 using-declaration
23530 template-declaration
23531 alias-declaration
23533 member-declarator-list:
23534 member-declarator
23535 member-declarator-list , member-declarator
23537 member-declarator:
23538 declarator pure-specifier [opt]
23539 declarator constant-initializer [opt]
23540 identifier [opt] : constant-expression
23542 GNU Extensions:
23544 member-declaration:
23545 __extension__ member-declaration
23547 member-declarator:
23548 declarator attributes [opt] pure-specifier [opt]
23549 declarator attributes [opt] constant-initializer [opt]
23550 identifier [opt] attributes [opt] : constant-expression
23552 C++0x Extensions:
23554 member-declaration:
23555 static_assert-declaration */
23557 static void
23559 {
23560 cp_decl_specifier_seq decl_specifiers;
23561 tree prefix_attributes;
23562 tree decl;
23571 /* Check for the `__extension__' keyword. */
23573 {
23574 /* Recurse. */
23576 /* Restore the old value of the PEDANTIC flag. */
23580 }
23582 /* Check for a template-declaration. */
23584 {
23585 /* An explicit specialization here is an error condition, and we
23586 expect the specialization handler to detect and report this. */
23590 else
23594 }
23595 /* Check for a template introduction. */
23599 /* Check for a using-declaration. */
23601 {
23603 {
23604 /* Parse the using-declaration. */
23608 }
23609 else
23610 {
23611 tree decl;
23615 /* Note that if we actually see the '=' token after the
23616 identifier, cp_parser_alias_declaration commits the
23617 tentative parse. In that case, we really expect an
23618 alias-declaration. Otherwise, we expect a using
23619 declaration. */
23620 alias_decl_expected =
23626 else
23630 }
23631 }
23633 /* Check for @defs. */
23635 {
23640 {
23645 }
23647 }
23649 /* If the next token is `static_assert' we have a static assertion. */
23651 {
23654 }
23661 /* Parse the decl-specifier-seq. */
23664 CP_PARSER_FLAGS_OPTIONAL,
23667 /* Check for an invalid type-name. */
23671 /* If there is no declarator, then the decl-specifier-seq should
23672 specify a type. */
23674 {
23675 /* If there was no decl-specifier-seq, and the next token is a
23676 `;', then we have something like:
23678 struct S { ; };
23680 [class.mem]
23682 Each member-declaration shall declare at least one member
23683 name of the class. */
23685 {
23688 {
23692 }
23693 }
23694 else
23695 {
23696 tree type;
23698 /* See if this declaration is a friend. */
23700 /* If there were decl-specifiers, check to see if there was
23701 a class-declaration. */
23704 /* Nested classes have already been added to the class, but
23705 a `friend' needs to be explicitly registered. */
23707 {
23708 /* If the `friend' keyword was present, the friend must
23709 be introduced with a class-key. */
23712 "in C++03 a class-key must be used "
23714 /* In this case:
23716 template <typename T> struct A {
23717 friend struct A<T>::B;
23718 };
23720 A<T>::B will be represented by a TYPENAME_TYPE, and
23721 therefore not recognized by check_tag_decl. */
23723 {
23727 }
23730 "friend declaration does not name a class or "
23732 else
23735 }
23736 /* If there is no TYPE, an error message will already have
23737 been issued. */
23739 ;
23740 /* An anonymous aggregate has to be handled specially; such
23741 a declaration really declares a data member (with a
23742 particular type), as opposed to a nested class. */
23744 {
23745 /* C++11 9.5/6. */
23748 "a storage class on an anonymous aggregate "
23751 /* Remove constructors and such from TYPE, now that we
23752 know it is an anonymous aggregate. */
23754 /* And make the corresponding data member. */
23757 /* Add it to the class. */
23759 }
23760 else
23761 cp_parser_check_access_in_redeclaration
23764 }
23765 }
23766 else
23767 {
23770 /* Clear attributes from the decl_specifiers but keep them
23771 around as prefix attributes that apply them to the entity
23772 being declared. */
23776 /* See if these declarations will be friends. */
23779 /* Keep going until we hit the `;' at the end of the
23780 declaration. */
23782 {
23784 tree first_attribute;
23785 tree initializer;
23788 /* Peek at the next token. */
23791 /* The following code wants to know early if it is a bit-field
23792 or some other declaration. Attributes can appear before
23793 the `:' token. Skip over them without consuming any tokens
23794 to peek if they are followed by `:'. */
23799 {
23800 size_t n
23803 }
23805 /* Check for a bitfield declaration. */
23811 {
23812 tree identifier;
23813 tree width;
23818 else
23821 /* Look for attributes that apply to the bitfield. */
23824 /* Consume the `:' token. */
23827 /* Get the width of the bitfield. */
23831 /* In C++2A and as extension for C++11 and above we allow
23832 default member initializers for bit-fields. */
23837 CPP_OPEN_BRACE)))
23838 {
23839 location_t loc
23845 "default member initializers for bit-fields "
23846 "only available with -std=c++2a or "
23851 {
23855 }
23856 }
23857 else
23858 {
23859 /* Look for attributes that apply to the bitfield after
23860 the `:' token and width. This is where GCC used to
23861 parse attributes in the past, pedwarn if there is
23862 a std attribute. */
23865 "ISO C++ allows bit-field attributes only "
23869 }
23873 /* Remember which attributes are prefix attributes and
23874 which are not. */
23876 /* Combine the attributes. */
23879 /* Create the bitfield declaration. */
23882 identifier,
23883 sfk_none)
23887 attributes);
23888 }
23889 else
23890 {
23892 tree asm_specification;
23895 /* Parse the declarator. */
23896 declarator
23901 friend_p);
23903 /* If something went wrong parsing the declarator, make sure
23904 that we at least consume some tokens. */
23906 {
23907 /* Skip to the end of the statement. */
23909 /* If the next token is not a semicolon, that is
23910 probably because we just skipped over the body of
23911 a function. So, we consume a semicolon if
23912 present, but do not issue an error message if it
23913 is not present. */
23915 CPP_SEMICOLON))
23918 }
23921 cp_parser_check_for_definition_in_return_type
23925 /* Look for an asm-specification. */
23927 /* Look for attributes that apply to the declaration. */
23929 /* Remember which attributes are prefix attributes and
23930 which are not. */
23932 /* Combine the attributes. */
23935 /* If it's an `=', then we have a constant-initializer or a
23936 pure-specifier. It is not correct to parse the
23937 initializer before registering the member declaration
23938 since the member declaration should be in scope while
23939 its initializer is processed. However, the rest of the
23940 front end does not yet provide an interface that allows
23941 us to handle this correctly. */
23943 {
23944 /* In [class.mem]:
23946 A pure-specifier shall be used only in the declaration of
23947 a virtual function.
23949 A member-declarator can contain a constant-initializer
23950 only if it declares a static member of integral or
23951 enumeration type.
23953 Therefore, if the DECLARATOR is for a function, we look
23954 for a pure-specifier; otherwise, we look for a
23955 constant-initializer. When we call `grokfield', it will
23956 perform more stringent semantics checks. */
23968 {
23970 /* Don't require a constant rvalue in C++11, since we
23971 might want a reference constant. We'll enforce
23972 constancy later. */
23974 /* Parse the initializer. */
23977 }
23978 else
23979 /* Parse the initializer. */
23981 }
23984 {
23988 else
23990 }
23991 /* Otherwise, there is no initializer. */
23992 else
23995 /* See if we are probably looking at a function
23996 definition. We are certainly not looking at a
23997 member-declarator. Calling `grokfield' has
23998 side-effects, so we must not do it unless we are sure
23999 that we are looking at a member-declarator. */
24002 {
24003 /* The grammar does not allow a pure-specifier to be
24004 used when a member function is defined. (It is
24005 possible that this fact is an oversight in the
24006 standard, since a pure function may be defined
24007 outside of the class-specifier. */
24013 declarator,
24014 attributes);
24017 /* If the member was not a friend, declare it here. */
24020 /* Peek at the next token. */
24022 /* If the next token is a semicolon, consume it. */
24024 {
24025 location_t semicolon_loc
24030 "extra %<;%> after in-class "
24032 }
24034 }
24035 else
24038 /* Create the declaration. */
24043 {
24046 else
24048 }
24049 }
24054 /* Reset PREFIX_ATTRIBUTES. */
24056 {
24061 }
24063 /* If there is any qualification still in effect, clear it
24064 now; we will be starting fresh with the next declarator. */
24068 /* If it's a `,', then there are more declarators. */
24070 {
24073 {
24079 }
24080 }
24081 /* If the next token isn't a `;', then we have a parse error. */
24083 CPP_SEMICOLON))
24084 {
24085 /* The next token might be a ways away from where the
24086 actual semicolon is missing. Find the previous token
24087 and use that for our error position. */
24094 /* Assume that the user meant to provide a semicolon. If
24095 we were to cp_parser_skip_to_end_of_statement, we might
24096 skip to a semicolon inside a member function definition
24097 and issue nonsensical error messages. */
24099 }
24102 {
24103 /* Add DECL to the list of members. */
24105 /* Explicitly include, eg, NSDMIs, for better error
24106 recovery (c++/58650). */
24114 /* Add DECL to the queue of NSDMI to be parsed later. */
24116 }
24120 }
24121 }
24124 out:
24126 }
24128 /* Parse a pure-specifier.
24130 pure-specifier:
24131 = 0
24133 Returns INTEGER_ZERO_NODE if a pure specifier is found.
24134 Otherwise, ERROR_MARK_NODE is returned. */
24136 static tree
24138 {
24141 /* Look for the `=' token. */
24144 /* Look for the `0' token. */
24153 /* Accept = default or = delete in c++0x mode. */
24156 {
24159 }
24161 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24163 {
24168 }
24170 {
24173 }
24176 }
24178 /* Parse a constant-initializer.
24180 constant-initializer:
24181 = constant-expression
24183 Returns a representation of the constant-expression. */
24185 static tree
24187 {
24188 /* Look for the `=' token. */
24192 /* It is invalid to write:
24194 struct S { static const int i = { 7 }; };
24196 */
24198 {
24201 /* Consume the opening brace. */
24202 matching_braces braces;
24204 /* Skip the initializer. */
24206 /* Look for the trailing `}'. */
24210 }
24213 }
24215 /* Derived classes [gram.class.derived] */
24217 /* Parse a base-clause.
24219 base-clause:
24220 : base-specifier-list
24222 base-specifier-list:
24223 base-specifier ... [opt]
24224 base-specifier-list , base-specifier ... [opt]
24226 Returns a TREE_LIST representing the base-classes, in the order in
24227 which they were declared. The representation of each node is as
24228 described by cp_parser_base_specifier.
24230 In the case that no bases are specified, this function will return
24231 NULL_TREE, not ERROR_MARK_NODE. */
24233 static tree
24235 {
24238 /* Look for the `:' that begins the list. */
24241 /* Scan the base-specifier-list. */
24243 {
24245 tree base;
24248 /* Look for the base-specifier. */
24250 /* Look for the (optional) ellipsis. */
24252 {
24253 /* Consume the `...'. */
24257 }
24259 /* Add BASE to the front of the list. */
24261 {
24263 /* Make this a pack expansion type. */
24267 {
24270 }
24271 }
24272 /* Peek at the next token. */
24274 /* If it's not a comma, then the list is complete. */
24277 /* Consume the `,'. */
24279 }
24281 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24282 base class had a qualified name. However, the next name that
24283 appears is certainly not qualified. */
24289 }
24291 /* Parse a base-specifier.
24293 base-specifier:
24294 :: [opt] nested-name-specifier [opt] class-name
24295 virtual access-specifier [opt] :: [opt] nested-name-specifier
24296 [opt] class-name
24297 access-specifier virtual [opt] :: [opt] nested-name-specifier
24298 [opt] class-name
24300 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24301 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24302 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24303 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24305 static tree
24307 {
24315 tree type;
24317 /* Process the optional `virtual' and `access-specifier'. */
24319 {
24320 /* Peek at the next token. */
24322 /* Process `virtual'. */
24324 {
24326 /* If `virtual' appears more than once, issue an error. */
24328 {
24332 }
24336 /* Consume the `virtual' token. */
24344 /* If more than one access specifier appears, issue an
24345 error. */
24348 {
24352 }
24356 /* Consume the access-specifier. */
24364 }
24365 }
24366 /* It is not uncommon to see programs mechanically, erroneously, use
24367 the 'typename' keyword to denote (dependent) qualified types
24368 as base classes. */
24370 {
24375 else
24377 "keyword %<typename%> not allowed in this context "
24380 }
24382 /* Look for the optional `::' operator. */
24384 /* Look for the nested-name-specifier. The simplest way to
24385 implement:
24387 [temp.res]
24389 The keyword `typename' is not permitted in a base-specifier or
24390 mem-initializer; in these contexts a qualified name that
24391 depends on a template-parameter is implicitly assumed to be a
24392 type name.
24394 is to pretend that we have seen the `typename' keyword at this
24395 point. */
24401 /* If the base class is given by a qualified name, assume that names
24402 we see are type names or templates, as appropriate. */
24408 /* DR 950 allows decltype as a base-specifier. */
24410 else
24411 {
24412 /* Otherwise, look for the class-name. */
24414 class_scope_p,
24415 template_p,
24416 typename_type,
24421 }
24427 }
24429 /* Exception handling [gram.exception] */
24431 /* Parse an (optional) noexcept-specification.
24433 noexcept-specification:
24434 noexcept ( constant-expression ) [opt]
24436 If no noexcept-specification is present, returns NULL_TREE.
24437 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24438 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24439 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24440 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24441 in which case a boolean condition is returned instead. */
24443 static tree
24448 {
24452 /* Peek at the next token. */
24455 /* Is it a noexcept-specification? */
24457 {
24458 tree expr;
24462 {
24463 matching_parens parens;
24467 {
24468 /* Types may not be defined in an exception-specification. */
24470 parser->type_definition_forbidden_message
24475 /* Restore the saved message. */
24477 }
24478 else
24479 {
24482 }
24485 }
24486 else
24487 {
24491 }
24493 /* We cannot build a noexcept-spec right away because this will check
24494 that expr is a constexpr. */
24497 else
24499 }
24500 else
24502 }
24504 /* Parse an (optional) exception-specification.
24506 exception-specification:
24507 throw ( type-id-list [opt] )
24509 Returns a TREE_LIST representing the exception-specification. The
24510 TREE_VALUE of each node is a type. */
24512 static tree
24514 {
24516 tree type_id_list;
24519 /* Peek at the next token. */
24522 /* Is it a noexcept-specification? */
24528 /* If it's not `throw', then there's no exception-specification. */
24534 /* Consume the `throw'. */
24537 /* Look for the `('. */
24538 matching_parens parens;
24541 /* Peek at the next token. */
24543 /* If it's not a `)', then there is a type-id-list. */
24545 {
24546 /* Types may not be defined in an exception-specification. */
24548 parser->type_definition_forbidden_message
24550 /* Parse the type-id-list. */
24552 /* Restore the saved message. */
24556 {
24560 }
24563 "dynamic exception specifications are deprecated in "
24565 }
24566 /* In C++17, throw() is equivalent to noexcept (true). throw()
24567 is deprecated in C++11 and above as well, but is still widely used,
24568 so don't warn about it yet. */
24571 else
24574 /* Look for the `)'. */
24578 }
24580 /* Parse an (optional) type-id-list.
24582 type-id-list:
24583 type-id ... [opt]
24584 type-id-list , type-id ... [opt]
24586 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24587 in the order that the types were presented. */
24589 static tree
24591 {
24595 {
24597 tree type;
24601 /* Get the next type-id. */
24603 /* Check for invalid 'auto'. */
24605 {
24609 }
24610 /* Parse the optional ellipsis. */
24612 {
24613 /* Consume the `...'. */
24616 /* Turn the type into a pack expansion expression. */
24618 }
24619 /* Add it to the list. */
24621 /* Peek at the next token. */
24623 /* If it is not a `,', we are done. */
24626 /* Consume the `,'. */
24628 }
24631 }
24633 /* Parse a try-block.
24635 try-block:
24636 try compound-statement handler-seq */
24638 static tree
24640 {
24641 tree try_block;
24655 }
24657 /* Parse a function-try-block.
24659 function-try-block:
24660 try ctor-initializer [opt] function-body handler-seq */
24662 static void
24664 {
24665 tree compound_stmt;
24666 tree try_block;
24668 /* Look for the `try' keyword. */
24671 /* Let the rest of the front end know where we are. */
24673 /* Parse the function-body. */
24674 cp_parser_ctor_initializer_opt_and_function_body
24676 /* We're done with the `try' part. */
24678 /* Parse the handlers. */
24680 /* We're done with the handlers. */
24682 }
24684 /* Parse a handler-seq.
24686 handler-seq:
24687 handler handler-seq [opt] */
24689 static void
24691 {
24693 {
24696 /* Parse the handler. */
24698 /* Peek at the next token. */
24700 /* If it's not `catch' then there are no more handlers. */
24703 }
24704 }
24706 /* Parse a handler.
24708 handler:
24709 catch ( exception-declaration ) compound-statement */
24711 static void
24713 {
24714 tree handler;
24715 tree declaration;
24719 matching_parens parens;
24726 }
24728 /* Parse an exception-declaration.
24730 exception-declaration:
24731 type-specifier-seq declarator
24732 type-specifier-seq abstract-declarator
24733 type-specifier-seq
24734 ...
24736 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24737 ellipsis variant is used. */
24739 static tree
24741 {
24742 cp_decl_specifier_seq type_specifiers;
24746 /* If it's an ellipsis, it's easy to handle. */
24748 {
24749 /* Consume the `...' token. */
24752 }
24754 /* Types may not be defined in exception-declarations. */
24756 parser->type_definition_forbidden_message
24759 /* Parse the type-specifier-seq. */
24763 /* If it's a `)', then there is no declarator. */
24766 else
24773 /* Restore the saved message. */
24780 }
24782 /* Parse a throw-expression.
24784 throw-expression:
24785 throw assignment-expression [opt]
24787 Returns a THROW_EXPR representing the throw-expression. */
24789 static tree
24791 {
24792 tree expression;
24797 /* Figure out whether or not there is an assignment-expression
24798 following the "throw" keyword. */
24806 else
24810 }
24812 /* GNU Extensions */
24814 /* Parse an (optional) asm-specification.
24816 asm-specification:
24817 asm ( string-literal )
24819 If the asm-specification is present, returns a STRING_CST
24820 corresponding to the string-literal. Otherwise, returns
24821 NULL_TREE. */
24823 static tree
24825 {
24827 tree asm_specification;
24829 /* Peek at the next token. */
24831 /* If the next token isn't the `asm' keyword, then there's no
24832 asm-specification. */
24836 /* Consume the `asm' token. */
24838 /* Look for the `('. */
24839 matching_parens parens;
24842 /* Look for the string-literal. */
24845 /* Look for the `)'. */
24849 }
24851 /* Parse an asm-operand-list.
24853 asm-operand-list:
24854 asm-operand
24855 asm-operand-list , asm-operand
24857 asm-operand:
24858 string-literal ( expression )
24859 [ string-literal ] string-literal ( expression )
24861 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24862 each node is the expression. The TREE_PURPOSE is itself a
24863 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24864 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24865 is a STRING_CST for the string literal before the parenthesis. Returns
24866 ERROR_MARK_NODE if any of the operands are invalid. */
24868 static tree
24870 {
24875 {
24876 tree string_literal;
24877 tree expression;
24878 tree name;
24881 {
24882 /* Consume the `[' token. */
24884 /* Read the operand name. */
24889 /* Look for the closing `]'. */
24891 }
24892 else
24894 /* Look for the string-literal. */
24897 /* Look for the `('. */
24898 matching_parens parens;
24900 /* Parse the expression. */
24902 /* Look for the `)'. */
24910 /* Add this operand to the list. */
24912 expression,
24913 asm_operands);
24914 /* If the next token is not a `,', there are no more
24915 operands. */
24918 /* Consume the `,'. */
24920 }
24923 }
24925 /* Parse an asm-clobber-list.
24927 asm-clobber-list:
24928 string-literal
24929 asm-clobber-list , string-literal
24931 Returns a TREE_LIST, indicating the clobbers in the order that they
24932 appeared. The TREE_VALUE of each node is a STRING_CST. */
24934 static tree
24936 {
24940 {
24941 tree string_literal;
24943 /* Look for the string literal. */
24945 /* Add it to the list. */
24947 /* If the next token is not a `,', then the list is
24948 complete. */
24951 /* Consume the `,' token. */
24953 }
24956 }
24958 /* Parse an asm-label-list.
24960 asm-label-list:
24961 identifier
24962 asm-label-list , identifier
24964 Returns a TREE_LIST, indicating the labels in the order that they
24965 appeared. The TREE_VALUE of each node is a label. */
24967 static tree
24969 {
24973 {
24976 /* Look for the identifier. */
24979 {
24982 {
24988 }
24989 }
24990 /* If the next token is not a `,', then the list is
24991 complete. */
24994 /* Consume the `,' token. */
24996 }
24999 }
25001 /* Return TRUE iff the next tokens in the stream are possibly the
25002 beginning of a GNU extension attribute. */
25004 static bool
25006 {
25008 }
25010 /* Return TRUE iff the next tokens in the stream are possibly the
25011 beginning of a standard C++-11 attribute specifier. */
25013 static bool
25015 {
25017 }
25019 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25020 beginning of a standard C++-11 attribute specifier. */
25022 static bool
25024 {
25032 }
25034 /* Return TRUE iff the next Nth tokens in the stream are possibly the
25035 beginning of a GNU extension attribute. */
25037 static bool
25039 {
25043 }
25045 /* Return true iff the next tokens can be the beginning of either a
25046 GNU attribute list, or a standard C++11 attribute sequence. */
25048 static bool
25050 {
25053 }
25055 /* Return true iff the next Nth tokens can be the beginning of either
25056 a GNU attribute list, or a standard C++11 attribute sequence. */
25058 static bool
25060 {
25063 }
25065 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
25066 of GNU attributes, or return NULL. */
25068 static tree
25070 {
25074 }
25076 /* Parse an (optional) series of attributes.
25078 attributes:
25079 attributes attribute
25081 attribute:
25082 __attribute__ (( attribute-list [opt] ))
25084 The return value is as for cp_parser_gnu_attribute_list. */
25086 static tree
25088 {
25095 {
25097 tree attribute_list;
25100 /* Peek at the next token. */
25102 /* If it's not `__attribute__', then we're done. */
25106 /* Consume the `__attribute__' keyword. */
25108 /* Look for the two `(' tokens. */
25109 matching_parens outer_parens;
25111 matching_parens inner_parens;
25114 /* Peek at the next token. */
25117 /* Parse the attribute-list. */
25119 else
25120 /* If the next token is a `)', then there is no attribute
25121 list. */
25124 /* Look for the two `)' tokens. */
25132 /* Add these new attributes to the list. */
25134 }
25137 }
25139 /* Parse a GNU attribute-list.
25141 attribute-list:
25142 attribute
25143 attribute-list , attribute
25145 attribute:
25146 identifier
25147 identifier ( identifier )
25148 identifier ( identifier , expression-list )
25149 identifier ( expression-list )
25151 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25152 to an attribute. The TREE_PURPOSE of each node is the identifier
25153 indicating which attribute is in use. The TREE_VALUE represents
25154 the arguments, if any. */
25156 static tree
25158 {
25164 {
25166 tree identifier;
25167 tree attribute;
25169 /* Look for the identifier. We also allow keywords here; for
25170 example `__attribute__ ((const))' is legal. */
25174 {
25177 /* Consume the token, but save it since we need it for the
25178 SIMD enabled function parsing. */
25181 /* Save away the identifier that indicates which attribute
25182 this is. */
25184 /* For keywords, use the canonical spelling, not the
25185 parsed identifier. */
25192 /* Peek at the next token. */
25194 /* If it's an `(', then parse the attribute arguments. */
25196 {
25200 vec = cp_parser_parenthesized_expression_list
25206 else
25207 {
25210 }
25211 /* Save the arguments away. */
25213 }
25216 {
25217 /* Add this attribute to the list. */
25220 }
25223 }
25224 /* Now, look for more attributes. If the next token isn't a
25225 `,', we're done. */
25229 /* Consume the comma and keep going. */
25231 }
25234 /* We built up the list in reverse order. */
25236 }
25238 /* Parse a standard C++11 attribute.
25240 The returned representation is a TREE_LIST which TREE_PURPOSE is
25241 the scoped name of the attribute, and the TREE_VALUE is its
25242 arguments list.
25244 Note that the scoped name of the attribute is itself a TREE_LIST
25245 which TREE_PURPOSE is the namespace of the attribute, and
25246 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25247 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25248 and which TREE_PURPOSE is directly the attribute name.
25250 Clients of the attribute code should use get_attribute_namespace
25251 and get_attribute_name to get the actual namespace and name of
25252 attributes, regardless of their being GNU or C++11 attributes.
25254 attribute:
25255 attribute-token attribute-argument-clause [opt]
25257 attribute-token:
25258 identifier
25259 attribute-scoped-token
25261 attribute-scoped-token:
25262 attribute-namespace :: identifier
25264 attribute-namespace:
25265 identifier
25267 attribute-argument-clause:
25268 ( balanced-token-seq )
25270 balanced-token-seq:
25271 balanced-token [opt]
25272 balanced-token-seq balanced-token
25274 balanced-token:
25275 ( balanced-token-seq )
25276 [ balanced-token-seq ]
25277 { balanced-token-seq }. */
25279 static tree
25281 {
25288 /* First, parse name of the attribute, a.k.a attribute-token. */
25305 {
25306 /* We are seeing a scoped attribute token. */
25321 else
25322 {
25326 }
25330 NULL_TREE);
25332 }
25335 NULL_TREE);
25336 else
25337 {
25340 NULL_TREE);
25341 /* C++11 noreturn attribute is equivalent to GNU's. */
25344 /* C++14 deprecated attribute is equivalent to GNU's. */
25347 /* C++17 fallthrough attribute is equivalent to GNU's. */
25350 /* Transactional Memory TS optimize_for_synchronized attribute is
25351 equivalent to GNU transaction_callable. */
25355 /* Transactional Memory attributes are GNU attributes. */
25358 }
25360 /* Now parse the optional argument clause of the attribute. */
25365 {
25371 /* A GNU attribute that takes an identifier in parameter. */
25374 vec = cp_parser_parenthesized_expression_list
25380 else
25381 {
25384 }
25388 else
25390 }
25393 }
25395 /* Check that the attribute ATTRIBUTE appears at most once in the
25396 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25397 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25398 isn't implemented yet in GCC. */
25400 static void
25402 {
25404 {
25414 }
25415 }
25417 /* Parse a list of standard C++-11 attributes.
25419 attribute-list:
25420 attribute [opt]
25421 attribute-list , attribute[opt]
25422 attribute ...
25423 attribute-list , attribute ...
25424 */
25426 static tree
25428 {
25433 {
25438 {
25442 }
25445 {
25450 else
25451 {
25456 }
25458 }
25462 }
25465 }
25467 /* Parse a standard C++-11 attribute specifier.
25469 attribute-specifier:
25470 [ [ attribute-using-prefix [opt] attribute-list ] ]
25471 alignment-specifier
25473 attribute-using-prefix:
25474 using attribute-namespace :
25476 alignment-specifier:
25477 alignas ( type-id ... [opt] )
25478 alignas ( alignment-expression ... [opt] ). */
25480 static tree
25482 {
25488 {
25495 {
25506 {
25510 "attribute using prefix only available "
25516 }
25517 else
25519 }
25526 else
25527 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25528 when we are sure that we have actually parsed them. */
25530 }
25531 else
25532 {
25533 tree alignas_expr;
25535 /* Look for an alignment-specifier. */
25546 matching_parens parens;
25554 {
25561 }
25566 /* Handle alignas (pack...). */
25568 {
25571 }
25573 /* Something went wrong, so don't build the attribute. */
25580 /* Build the C++-11 representation of an 'aligned'
25581 attribute. */
25582 attributes =
25585 alignas_expr);
25586 }
25589 }
25591 /* Parse a standard C++-11 attribute-specifier-seq.
25593 attribute-specifier-seq:
25594 attribute-specifier-seq [opt] attribute-specifier
25595 */
25597 static tree
25599 {
25604 {
25613 else
25616 }
25619 }
25621 /* Skip a balanced-token starting at Nth token (with 1 as the next token),
25622 return index of the first token after balanced-token, or N on failure. */
25624 static size_t
25626 {
25629 do
25631 {
25634 /* Ran out of tokens. */
25656 }
25659 }
25661 /* Skip GNU attribute tokens starting at Nth token (with 1 as the next token),
25662 return index of the first token after the GNU attribute tokens, or N on
25663 failure. */
25665 static size_t
25667 {
25669 {
25681 }
25683 }
25685 /* Skip standard C++11 attribute tokens starting at Nth token (with 1 as the
25686 next token), return index of the first token after the standard C++11
25687 attribute tokens, or N on failure. */
25689 static size_t
25691 {
25693 {
25696 {
25703 }
25706 {
25711 }
25712 else
25714 }
25716 }
25718 /* Skip standard C++11 or GNU attribute tokens starting at Nth token (with 1
25719 as the next token), return index of the first token after the attribute
25720 tokens, or N on failure. */
25722 static size_t
25724 {
25728 }
25730 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25731 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25732 current value of the PEDANTIC flag, regardless of whether or not
25733 the `__extension__' keyword is present. The caller is responsible
25734 for restoring the value of the PEDANTIC flag. */
25736 static bool
25738 {
25739 /* Save the old value of the PEDANTIC flag. */
25743 {
25744 /* Consume the `__extension__' token. */
25746 /* We're not being pedantic while the `__extension__' keyword is
25747 in effect. */
25751 }
25754 }
25756 /* Parse a label declaration.
25758 label-declaration:
25759 __label__ label-declarator-seq ;
25761 label-declarator-seq:
25762 identifier , label-declarator-seq
25763 identifier */
25765 static void
25767 {
25768 /* Look for the `__label__' keyword. */
25772 {
25773 tree identifier;
25775 /* Look for an identifier. */
25777 /* If we failed, stop. */
25780 /* Declare it as a label. */
25782 /* If the next token is a `;', stop. */
25785 /* Look for the `,' separating the label declarations. */
25787 }
25789 /* Look for the final `;'. */
25791 }
25793 // -------------------------------------------------------------------------- //
25794 // Requires Clause
25796 // Parse a requires clause.
25797 //
25798 // requires-clause:
25799 // 'requires' logical-or-expression
25800 //
25801 // The required logical-or-expression must be a constant expression. Note
25802 // that we don't check that the expression is constepxr here. We defer until
25803 // we analyze constraints and then, we only check atomic constraints.
25804 static tree
25806 {
25807 // Parse the requires clause so that it is not automatically folded.
25815 }
25817 // Optionally parse a requires clause:
25818 static tree
25820 {
25823 {
25826 {
25829 /* Parse and discard the requires-clause. */
25832 }
25834 }
25837 }
25840 /*---------------------------------------------------------------------------
25841 Requires expressions
25842 ---------------------------------------------------------------------------*/
25844 /* Parse a requires expression
25846 requirement-expression:
25847 'requires' requirement-parameter-list [opt] requirement-body */
25848 static tree
25850 {
25854 /* A requires-expression shall appear only within a concept
25855 definition or a requires-clause.
25857 TODO: Implement this diagnostic correctly. */
25859 {
25863 }
25866 {
25867 /* Local parameters are delared as variables within the scope
25868 of the expression. They are not visible past the end of
25869 the expression. Expressions within the requires-expression
25870 are unevaluated. */
25871 struct scope_sentinel
25872 {
25874 {
25877 }
25880 {
25883 }
25886 /* Parse the optional parameter list. */
25888 {
25892 }
25893 else
25896 /* Parse the requirement body. */
25900 }
25902 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25903 the parm chain. */
25906 }
25908 /* Parse a parameterized requirement.
25910 requirement-parameter-list:
25911 '(' parameter-declaration-clause ')' */
25912 static tree
25914 {
25915 matching_parens parens;
25925 }
25927 /* Parse the body of a requirement.
25929 requirement-body:
25930 '{' requirement-list '}' */
25931 static tree
25933 {
25934 matching_braces braces;
25944 }
25946 /* Parse a list of requirements.
25948 requirement-list:
25949 requirement
25950 requirement-list ';' requirement[opt] */
25951 static tree
25953 {
25956 {
25963 /* If we see a semi-colon, consume it. */
25967 /* Stop processing at the end of the list. */
25970 }
25972 /* Reverse the order of requirements so they are analyzed in
25973 declaration order. */
25975 }
25977 /* Parse a syntactic requirement or type requirement.
25979 requirement:
25980 simple-requirement
25981 compound-requirement
25982 type-requirement
25983 nested-requirement */
25984 static tree
25986 {
25993 else
25995 }
25997 /* Parse a simple requirement.
25999 simple-requirement:
26000 expression ';' */
26001 static tree
26003 {
26012 }
26014 /* Parse a type requirement
26016 type-requirement
26017 nested-name-specifier [opt] required-type-name ';'
26019 required-type-name:
26020 type-name
26021 'template' [opt] simple-template-id */
26022 static tree
26024 {
26027 // Save the scope before parsing name specifiers.
26038 tree type;
26040 {
26049 }
26050 else
26069 }
26071 /* Parse a compound requirement
26073 compound-requirement:
26074 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
26075 static tree
26077 {
26078 /* Parse an expression enclosed in '{ }'s. */
26079 matching_braces braces;
26090 /* Parse the optional noexcept. */
26093 {
26096 }
26098 /* Parse the optional trailing return type. */
26101 {
26109 }
26112 }
26114 /* Parse a nested requirement. This is the same as a requires clause.
26116 nested-requirement:
26117 requires-clause */
26118 static tree
26120 {
26126 }
26128 /* Support Functions */
26130 /* Return the appropriate prefer_type argument for lookup_name_real based on
26131 tag_type and template_mem_access. */
26135 {
26136 /* DR 141: When looking in the current enclosing context for a template-name
26137 after -> or ., only consider class templates. */
26141 {
26145 }
26146 }
26148 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
26149 NAME should have one of the representations used for an
26150 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
26151 is returned. If PARSER->SCOPE is a dependent type, then a
26152 SCOPE_REF is returned.
26154 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
26155 returned; the name was already resolved when the TEMPLATE_ID_EXPR
26156 was formed. Abstractly, such entities should not be passed to this
26157 function, because they do not need to be looked up, but it is
26158 simpler to check for this special case here, rather than at the
26159 call-sites.
26161 In cases not explicitly covered above, this function returns a
26162 DECL, OVERLOAD, or baselink representing the result of the lookup.
26163 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
26164 is returned.
26166 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
26167 (e.g., "struct") that was used. In that case bindings that do not
26168 refer to types are ignored.
26170 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
26171 ignored.
26173 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
26174 are ignored.
26176 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
26177 types.
26179 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
26180 TREE_LIST of candidates if name-lookup results in an ambiguity, and
26181 NULL_TREE otherwise. */
26183 static cp_expr
26190 location_t name_location)
26191 {
26192 tree decl;
26195 /* Assume that the lookup will be unambiguous. */
26199 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
26200 no longer valid. Note that if we are parsing tentatively, and
26201 the parse fails, OBJECT_TYPE will be automatically restored. */
26207 /* A template-id has already been resolved; there is no lookup to
26208 do. */
26212 {
26216 }
26218 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26219 it should already have been checked to make sure that the name
26220 used matches the type being destroyed. */
26222 {
26223 tree type;
26225 /* Figure out to which type this destructor applies. */
26230 else
26232 /* If that's not a class type, there is no destructor. */
26243 }
26245 /* By this point, the NAME should be an ordinary identifier. If
26246 the id-expression was a qualified name, the qualifying scope is
26247 stored in PARSER->SCOPE at this point. */
26250 /* Perform the lookup. */
26252 {
26258 /* If the SCOPE is dependent, the lookup must be deferred until
26259 the template is instantiated -- unless we are explicitly
26260 looking up names in uninstantiated templates. Even then, we
26261 cannot look up the name if the scope is not a class type; it
26262 might, for example, be a template type parameter. */
26267 /* Defer lookup. */
26269 else
26270 {
26273 /* If PARSER->SCOPE is a dependent type, then it must be a
26274 class type, and we must not be checking dependencies;
26275 otherwise, we would have processed this lookup above. So
26276 that PARSER->SCOPE is not considered a dependent base by
26277 lookup_member, we must enter the scope here. */
26281 /* If the PARSER->SCOPE is a template specialization, it
26282 may be instantiated during name lookup. In that case,
26283 errors may be issued. Even if we rollback the current
26284 tentative parse, those errors are valid. */
26289 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26290 lookup result and the nested-name-specifier nominates a class C:
26291 * if the name specified after the nested-name-specifier, when
26292 looked up in C, is the injected-class-name of C (Clause 9), or
26293 * if the name specified after the nested-name-specifier is the
26294 same as the identifier or the simple-template-id's template-
26295 name in the last component of the nested-name-specifier,
26296 the name is instead considered to name the constructor of
26297 class C. [ Note: for example, the constructor is not an
26298 acceptable lookup result in an elaborated-type-specifier so
26299 the constructor would not be used in place of the
26300 injected-class-name. --end note ] Such a constructor name
26301 shall be used only in the declarator-id of a declaration that
26302 names a constructor or in a using-declaration. */
26310 /* If we have a single function from a using decl, pull it out. */
26317 }
26319 /* If the scope is a dependent type and either we deferred lookup or
26320 we did lookup but didn't find the name, rememeber the name. */
26323 {
26325 {
26326 tree type;
26328 /* The resolution to Core Issue 180 says that `struct
26329 A::B' should be considered a type-name, even if `A'
26330 is dependent. */
26335 }
26339 CPP_CLOSE_PAREN)))
26343 else
26346 is_template);
26347 }
26350 }
26352 {
26353 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26354 OBJECT_TYPE is not a class. */
26356 /* If the OBJECT_TYPE is a template specialization, it may
26357 be instantiated during name lookup. In that case, errors
26358 may be issued. Even if we rollback the current tentative
26359 parse, those errors are valid. */
26361 name,
26364 tf_warning_or_error);
26365 else
26369 /* Look it up in the enclosing context. DR 141: When looking for a
26370 template-name after -> or ., only consider class templates. */
26375 /* The object is type-dependent, so we can't look anything up; we used
26376 this to get the DR 141 behavior. */
26380 }
26381 else
26382 {
26388 }
26390 /* If the lookup failed, let our caller know. */
26394 /* Pull out the template from an injected-class-name (or multiple). */
26398 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26400 {
26403 /* The error message we have to print is too complicated for
26404 cp_parser_error, so we incorporate its actions directly. */
26406 {
26408 name);
26410 }
26412 }
26420 /* If we have resolved the name of a member declaration, check to
26421 see if the declaration is accessible. When the name resolves to
26422 set of overloaded functions, accessibility is checked when
26423 overload resolution is done.
26425 During an explicit instantiation, access is not checked at all,
26426 as per [temp.explicit]. */
26433 }
26435 /* Like cp_parser_lookup_name, but for use in the typical case where
26436 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26437 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26439 static tree
26441 {
26443 none_type,
26448 location);
26449 }
26451 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26452 the current context, return the TYPE_DECL. If TAG_NAME_P is
26453 true, the DECL indicates the class being defined in a class-head,
26454 or declared in an elaborated-type-specifier.
26456 Otherwise, return DECL. */
26458 static tree
26460 {
26461 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26462 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26464 struct A {
26465 template <typename T> struct B;
26466 };
26468 template <typename T> struct A::B {};
26470 Similarly, in an elaborated-type-specifier:
26472 namespace N { struct X{}; }
26474 struct A {
26475 template <typename T> friend struct N::X;
26476 };
26478 However, if the DECL refers to a class type, and we are in
26479 the scope of the class, then the name lookup automatically
26480 finds the TYPE_DECL created by build_self_reference rather
26481 than a TEMPLATE_DECL. For example, in:
26483 template <class T> struct S {
26484 S s;
26485 };
26487 there is no need to handle such case. */
26493 }
26495 /* If too many, or too few, template-parameter lists apply to the
26496 declarator, issue an error message. Returns TRUE if all went well,
26497 and FALSE otherwise. */
26499 static bool
26502 location_t declarator_location)
26503 {
26505 {
26507 {
26516 {
26517 /* If the DECLARATOR has the form `X<y>' then it uses one
26518 additional level of template parameters. */
26521 }
26523 return cp_parser_check_template_parameters
26525 declarator);
26526 }
26542 }
26544 }
26546 /* NUM_TEMPLATES were used in the current declaration. If that is
26547 invalid, return FALSE and issue an error messages. Otherwise,
26548 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26549 declarator and we can print more accurate diagnostics. */
26551 static bool
26555 location_t location,
26557 {
26558 /* If there are the same number of template classes and parameter
26559 lists, that's OK. */
26562 /* If there are more, but only one more, and the name ends in an identifier,
26563 then we are declaring a primary template. That's OK too. */
26567 /* If there are more template classes than parameter lists, we have
26568 something like:
26570 template <class T> void S<T>::R<T>::f (); */
26572 {
26582 else
26585 }
26586 /* Otherwise, there are too many template parameter lists. We have
26587 something like:
26589 template <class T> template <class U> void S::f(); */
26592 }
26594 /* Parse an optional `::' token indicating that the following name is
26595 from the global namespace. If so, PARSER->SCOPE is set to the
26596 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26597 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26598 Returns the new value of PARSER->SCOPE, if the `::' token is
26599 present, and NULL_TREE otherwise. */
26601 static tree
26603 {
26606 /* Peek at the next token. */
26608 /* If we're looking at a `::' token then we're starting from the
26609 global namespace, not our current location. */
26611 {
26612 /* Consume the `::' token. */
26614 /* Set the SCOPE so that we know where to start the lookup. */
26620 }
26622 {
26626 }
26629 }
26631 /* Returns TRUE if the upcoming token sequence is the start of a
26632 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26633 declarator is preceded by the `friend' specifier. */
26635 static bool
26637 {
26640 tree nested_name_specifier;
26643 /* The common case is that this is not a constructor declarator, so
26644 try to avoid doing lots of work if at all possible. It's not
26645 valid declare a constructor at function scope. */
26648 /* And only certain tokens can begin a constructor declarator. */
26656 /* Parse tentatively; we are going to roll back all of the tokens
26657 consumed here. */
26659 /* Assume that we are looking at a constructor declarator. */
26662 /* Look for the optional `::' operator. */
26665 /* Look for the nested-name-specifier. */
26666 nested_name_specifier
26677 /* Outside of a class-specifier, there must be a
26678 nested-name-specifier. Except in C++17 mode, where we
26679 might be declaring a guiding declaration. */
26686 /* If we have a class scope, this is easy; DR 147 says that S::S always
26687 names the constructor, and no other qualified name could. */
26690 {
26700 }
26701 /* If we still think that this might be a constructor-declarator,
26702 look for a class-name. */
26704 {
26705 /* If we have:
26707 template <typename T> struct S {
26708 S();
26709 };
26711 we must recognize that the nested `S' names a class. */
26715 tree type_decl;
26719 none_type,
26726 {
26732 none_type,
26737 else
26739 }
26741 /* If there was no class-name, then this is not a constructor.
26742 Otherwise, if we are in a class-specifier and we aren't
26743 handling a friend declaration, check that its type matches
26744 current_class_type (c++/38313). Note: error_mark_node
26745 is left alone for error recovery purposes. */
26747 && (outside_class_specifier_p
26753 /* If we're still considering a constructor, we have to see a `(',
26754 to begin the parameter-declaration-clause, followed by either a
26755 `)', an `...', or a decl-specifier. We need to check for a
26756 type-specifier to avoid being fooled into thinking that:
26758 S (f) (int);
26760 is a constructor. (It is actually a function named `f' that
26761 takes one parameter (of type `int') and returns a value of type
26762 `S'. */
26770 /* A parameter declaration begins with a decl-specifier,
26771 which is either the "attribute" keyword, a storage class
26772 specifier, or (usually) a type-specifier. */
26774 {
26775 tree type;
26779 /* Names appearing in the type-specifier should be looked up
26780 in the scope of the class. */
26784 {
26787 {
26791 {
26794 }
26795 }
26797 }
26799 /* Inside the constructor parameter list, surrounding
26800 template-parameter-lists do not apply. */
26801 saved_num_template_parameter_lists
26805 /* Look for the type-specifier. */
26807 CP_PARSER_FLAGS_NONE,
26813 parser->num_template_parameter_lists
26816 /* Leave the scope of the class. */
26821 }
26822 }
26824 /* We did not really want to consume any tokens. */
26828 }
26830 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26831 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26832 they must be performed once we are in the scope of the function.
26834 Returns the function defined. */
26836 static tree
26837 cp_parser_function_definition_from_specifiers_and_declarator
26840 tree attributes,
26842 {
26843 tree fn;
26846 /* Begin the function-definition. */
26849 /* The things we're about to see are not directly qualified by any
26850 template headers we've seen thus far. */
26853 /* If there were names looked up in the decl-specifier-seq that we
26854 did not check, check them now. We must wait until we are in the
26855 scope of the function to perform the checks, since the function
26856 might be a friend. */
26860 {
26865 }
26868 {
26869 /* Skip the entire function. */
26872 }
26874 {
26875 /* Seen already, skip it. An error message has already been output. */
26879 /* If this is a function from a class, pop the nested class. */
26882 }
26883 else
26884 {
26885 timevar_id_t tv;
26888 else
26894 }
26897 }
26899 /* Parse the part of a function-definition that follows the
26900 declarator. INLINE_P is TRUE iff this function is an inline
26901 function defined within a class-specifier.
26903 Returns the function defined. */
26905 static tree
26908 {
26909 tree fn;
26914 bool fully_implicit_function_template_p
26917 tree implicit_template_parms
26920 cp_binding_level* implicit_template_scope
26926 /* If the next token is `return', then the code may be trying to
26927 make use of the "named return value" extension that G++ used to
26928 support. */
26931 {
26932 /* Consume the `return' keyword. */
26934 /* Look for the identifier that indicates what value is to be
26935 returned. */
26937 /* Issue an error message. */
26940 /* Skip tokens until we reach the start of the function body. */
26942 {
26949 }
26950 }
26951 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26952 anything declared inside `f'. */
26953 saved_in_unbraced_linkage_specification_p
26956 /* Inside the function, surrounding template-parameter-lists do not
26957 apply. */
26958 saved_num_template_parameter_lists
26962 /* If the next token is `try', `__transaction_atomic', or
26963 `__transaction_relaxed`, then we are looking at either function-try-block
26964 or function-transaction-block. Note that all of these include the
26965 function-body. */
26969 RID_TRANSACTION_RELAXED))
26973 else
26974 cp_parser_ctor_initializer_opt_and_function_body
26977 /* Finish the function. */
26979 /* Generate code for it, if necessary. */
26981 /* Restore the saved values. */
26982 parser->in_unbraced_linkage_specification_p
26984 parser->num_template_parameter_lists
26988 parser->fully_implicit_function_template_p
26990 parser->implicit_template_parms
26992 parser->implicit_template_scope
26999 }
27001 /* Parse a template-declaration body (following argument list). */
27003 static void
27005 tree parameter_list,
27007 {
27011 /* We just processed one more parameter list. */
27014 /* Get the deferred access checks from the parameter list. These
27015 will be checked once we know what is being declared, as for a
27016 member template the checks must be performed in the scope of the
27017 class containing the member. */
27020 /* Tentatively parse for a new template parameter list, which can either be
27021 the template keyword or a template introduction. */
27027 else
27028 {
27029 /* There are no access checks when parsing a template, as we do not
27030 know if a specialization will be a friend. */
27034 checks,
27035 member_p,
27040 /* If this is a member template declaration, let the front
27041 end know. */
27043 {
27048 }
27053 }
27054 /* We are done with the current parameter list. */
27059 /* Finish up. */
27062 /* Check the template arguments for a literal operator template. */
27066 {
27070 else
27071 {
27074 {
27080 }
27082 {
27091 }
27092 else
27094 }
27096 {
27099 " Expected non-type template argument pack <char...>"
27101 decl);
27102 else
27105 decl);
27106 }
27107 }
27109 /* Register member declarations. */
27112 /* If DECL is a function template, we must return to parse it later.
27113 (Even though there is no definition, there might be default
27114 arguments that need handling.) */
27118 }
27120 /* Parse a template introduction header for a template-declaration. Returns
27121 false if tentative parse fails. */
27123 static bool
27125 {
27132 /* Look for the optional `::' operator. */
27135 /* Look for the nested-name-specifier. */
27145 /* Look up the concept for which we will be matching
27146 template parameters. */
27156 /* Look for opening brace for introduction. */
27157 matching_braces braces;
27165 /* Build vector of placeholder parameters and grab
27166 matching identifiers. */
27169 /* The introduction-list shall not be empty. */
27172 {
27175 }
27177 /* Look for closing brace for introduction. */
27182 {
27186 }
27188 /* Build and associate the constraint. */
27191 {
27193 member_p);
27195 }
27199 }
27201 /* Parse a normal template-declaration following the template keyword. */
27203 static void
27205 {
27206 tree parameter_list;
27210 /* Look for the `<' token. */
27214 {
27215 /* 14.5.2.2 [temp.mem]
27217 A local class shall not have member templates. */
27222 }
27223 /* [temp]
27225 A template ... shall not have C linkage. */
27227 {
27230 /* Give it C++ linkage to avoid confusing other parts of the
27231 front end. */
27234 }
27235 else
27238 /* We cannot perform access checks on the template parameter
27239 declarations until we know what is being declared, just as we
27240 cannot check the decl-specifier list. */
27243 /* If the next token is `>', then we have an invalid
27244 specialization. Rather than complain about an invalid template
27245 parameter, issue an error message here. */
27247 {
27251 }
27252 else
27253 {
27254 /* Parse the template parameters. */
27256 }
27258 /* Look for the `>'. */
27261 /* Manage template requirements */
27263 {
27268 }
27271 member_p);
27273 /* For the erroneous case of a template with C linkage, we pushed an
27274 implicit C++ linkage scope; exit that scope now. */
27277 }
27279 /* Parse a template-declaration, assuming that the `export' (and
27280 `extern') keywords, if present, has already been scanned. MEMBER_P
27281 is as for cp_parser_template_declaration. */
27283 static bool
27285 {
27287 {
27291 }
27296 }
27298 /* Perform the deferred access checks from a template-parameter-list.
27299 CHECKS is a TREE_LIST of access checks, as returned by
27300 get_deferred_access_checks. */
27302 static void
27303 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27304 {
27308 }
27310 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27311 `function-definition' sequence that follows a template header.
27312 If MEMBER_P is true, this declaration appears in a class scope.
27314 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27315 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27317 static tree
27323 {
27326 cp_decl_specifier_seq decl_specifiers;
27330 /* This function is only used when processing a template
27331 declaration. */
27335 /* Defer access checks until we know what is being declared. */
27338 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27339 alternative. */
27342 CP_PARSER_FLAGS_OPTIONAL,
27348 /* There are no template typedefs. */
27350 {
27354 }
27356 /* Gather up the access checks that occurred the
27357 decl-specifier-seq. */
27360 /* Check for the declaration of a template class. */
27362 {
27365 {
27366 // If this is a declaration, but not a definition, associate
27367 // any constraints with the type declaration. Constraints
27368 // are associated with definitions in cp_parser_class_specifier.
27374 /* In this case:
27376 struct C {
27377 friend template <typename T> struct A<T>::B;
27378 };
27380 A<T>::B will be represented by a TYPENAME_TYPE, and
27381 therefore not recognized by shadow_tag. */
27383 && !decl
27390 else
27393 /* Perform access checks for template parameters. */
27396 /* Give a helpful diagnostic for
27397 template <class T> struct A { } a;
27398 if we aren't already recovering from an error. */
27401 {
27403 "a class template declaration must not declare "
27407 }
27408 }
27409 }
27411 /* Complain about missing 'typename' or other invalid type names. */
27414 {
27415 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27416 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27417 the rest of this declaration. */
27420 }
27422 /* If it's not a template class, try for a template function. If
27423 the next token is a `;', then this declaration does not declare
27424 anything. But, if there were errors in the decl-specifiers, then
27425 the error might well have come from an attempted class-specifier.
27426 In that case, there's no need to warn about a missing declarator. */
27430 {
27433 checks,
27435 member_p,
27436 declares_class_or_enum,
27440 /* 7.1.1-1 [dcl.stc]
27442 A storage-class-specifier shall not be specified in an explicit
27443 specialization... */
27445 && explicit_specialization_p
27447 {
27451 }
27455 }
27457 /* Look for a trailing `;' after the declaration. */
27463 out:
27466 /* Clear any current qualification; whatever comes next is the start
27467 of something new. */
27473 }
27475 /* Parse a cast-expression that is not the operand of a unary "&". */
27477 static cp_expr
27479 {
27482 }
27484 /* Parse a functional cast to TYPE. Returns an expression
27485 representing the cast. */
27487 static cp_expr
27489 {
27491 tree expression_list;
27492 cp_expr cast;
27501 {
27511 /* Create a location of the form:
27512 type_name{i, f}
27513 ^~~~~~~~~~~~~~~
27514 with caret == start at the start of the type name,
27515 finishing at the closing brace. */
27516 location_t finish_loc
27519 finish_loc);
27522 }
27531 else
27532 {
27535 }
27538 tf_warning_or_error);
27539 /* [expr.const]/1: In an integral constant expression "only type
27540 conversions to integral or enumeration type can be used". */
27546 NIC_CONSTRUCTOR))
27549 /* Create a location of the form:
27550 float(i)
27551 ^~~~~~~~
27552 with caret == start at the start of the type name,
27553 finishing at the closing paren. */
27554 location_t finish_loc
27559 }
27561 /* Save the tokens that make up the body of a member function defined
27562 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27563 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27564 specifiers applied to the declaration. Returns the FUNCTION_DECL
27565 for the member function. */
27567 static tree
27571 tree attributes)
27572 {
27575 tree fn;
27578 /* Create the FUNCTION_DECL. */
27582 /* If something went badly wrong, bail out now. */
27584 {
27585 /* If there's a function-body, skip it. */
27590 }
27592 /* Remember it, if there default args to post process. */
27595 /* Save away the tokens that make up the body of the
27596 function. */
27602 RID_TRANSACTION_ATOMIC))
27603 {
27605 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27612 {
27618 }
27619 else
27622 {
27626 }
27627 }
27629 /* Handle function try blocks. */
27631 {
27634 }
27635 /* We can have braced-init-list mem-initializers before the fn body. */
27637 {
27640 {
27641 /* cache_group will stop after an un-nested { } pair, too. */
27645 /* variadic mem-inits have ... after the ')'. */
27648 }
27649 }
27651 /* Handle function try blocks. */
27657 /* Save away the inline definition; we will process it when the
27658 class is complete. */
27662 /* We need to know that this was defined in the class, so that
27663 friend templates are handled correctly. */
27666 /* Add FN to the queue of functions to be parsed later. */
27670 }
27672 /* Save the tokens that make up the in-class initializer for a non-static
27673 data member. Returns a DEFAULT_ARG. */
27675 static tree
27677 {
27679 }
27681 /* Parse a template-argument-list, as well as the trailing ">" (but
27682 not the opening "<"). See cp_parser_template_argument_list for the
27683 return value. */
27685 static tree
27687 {
27688 tree arguments;
27689 tree saved_scope;
27690 tree saved_qualifying_scope;
27691 tree saved_object_scope;
27696 /* [temp.names]
27698 When parsing a template-id, the first non-nested `>' is taken as
27699 the end of the template-argument-list rather than a greater-than
27700 operator. */
27701 saved_greater_than_is_operator_p
27704 /* Parsing the argument list may modify SCOPE, so we save it
27705 here. */
27709 /* We need to evaluate the template arguments, even though this
27710 template-id may be nested within a "sizeof". */
27715 /* Parse the template-argument-list itself. */
27719 else
27721 /* Look for the `>' that ends the template-argument-list. If we find
27722 a '>>' instead, it's probably just a typo. */
27724 {
27726 {
27727 /* In C++0x, a `>>' in a template argument list or cast
27728 expression is considered to be two separate `>'
27729 tokens. So, change the current token to a `>', but don't
27730 consume it: it will be consumed later when the outer
27731 template argument list (or cast expression) is parsed.
27732 Note that this replacement of `>' for `>>' is necessary
27733 even if we are parsing tentatively: in the tentative
27734 case, after calling
27735 cp_parser_enclosed_template_argument_list we will always
27736 throw away all of the template arguments and the first
27737 closing `>', either because the template argument list
27738 was erroneous or because we are replacing those tokens
27739 with a CPP_TEMPLATE_ID token. The second `>' (which will
27740 not have been thrown away) is needed either to close an
27741 outer template argument list or to complete a new-style
27742 cast. */
27745 }
27747 {
27748 /* If we're in a nested template argument list, the '>>' has
27749 to be a typo for '> >'. We emit the error message, but we
27750 continue parsing and we push a '>' as next token, so that
27751 the argument list will be parsed correctly. Note that the
27752 global source location is still on the token before the
27753 '>>', so we need to say explicitly where we want it. */
27761 }
27762 else
27763 {
27764 /* If this is not a nested template argument list, the '>>'
27765 is a typo for '>'. Emit an error message and continue.
27766 Same deal about the token location, but here we can get it
27767 right by consuming the '>>' before issuing the diagnostic. */
27770 "spurious %<>>%>, use %<>%> to terminate "
27772 }
27773 }
27774 else
27776 /* The `>' token might be a greater-than operator again now. */
27777 parser->greater_than_is_operator_p
27779 /* Restore the SAVED_SCOPE. */
27787 }
27789 /* MEMBER_FUNCTION is a member function, or a friend. If default
27790 arguments, or the body of the function have not yet been parsed,
27791 parse them now. */
27793 static void
27795 {
27797 /* If this member is a template, get the underlying
27798 FUNCTION_DECL. */
27802 /* There should not be any class definitions in progress at this
27803 point; the bodies of members are only parsed outside of all class
27804 definitions. */
27806 /* While we're parsing the member functions we might encounter more
27807 classes. We want to handle them right away, but we don't want
27808 them getting mixed up with functions that are currently in the
27809 queue. */
27812 /* Make sure that any template parameters are in scope. */
27815 /* If the body of the function has not yet been parsed, parse it
27816 now. */
27818 {
27819 tree function_scope;
27822 /* The function is no longer pending; we are processing it. */
27827 /* If this is a local class, enter the scope of the containing
27828 function. */
27833 /* Push the body of the function onto the lexer stack. */
27836 /* Let the front end know that we going to be defining this
27837 function. */
27841 /* Don't do access checking if it is a templated function. */
27845 /* #pragma omp declare reduction needs special parsing. */
27847 {
27852 }
27853 else
27854 /* Now, parse the body of the function. */
27861 /* Leave the scope of the containing function. */
27865 }
27867 /* Remove any template parameters from the symbol table. */
27870 /* Restore the queue. */
27873 }
27875 /* If DECL contains any default args, remember it on the unparsed
27876 functions queue. */
27878 static void
27880 {
27881 tree probe;
27884 probe;
27887 {
27891 }
27892 }
27894 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27895 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27896 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27897 from the parameter-type-list. */
27899 static tree
27902 {
27904 tree parsed_arg;
27910 /* Push the saved tokens for the default argument onto the parser's
27911 lexer stack. */
27917 /* Parse the default argument. */
27928 {
27929 /* In a non-template class, check conversions now. In a template,
27930 we'll wait and instantiate these as needed. */
27933 tf_warning_or_error);
27936 else
27938 }
27940 /* If the token stream has not been completely used up, then
27941 there was extra junk after the end of the default
27942 argument. */
27944 {
27947 else
27949 }
27951 /* Revert to the main lexer. */
27955 }
27957 /* FIELD is a non-static data member with an initializer which we saved for
27958 later; parse it now. */
27960 static void
27962 {
27963 tree def;
27970 NULL_TREE);
27976 }
27978 /* FN is a FUNCTION_DECL which may contains a parameter with an
27979 unparsed DEFAULT_ARG. Parse the default args now. This function
27980 assumes that the current scope is the scope in which the default
27981 argument should be processed. */
27983 static void
27985 {
27989 /* While we're parsing the default args, we might (due to the
27990 statement expression extension) encounter more classes. We want
27991 to handle them right away, but we don't want them getting mixed
27992 up with default args that are currently in the queue. */
27995 /* Local variable names (and the `this' keyword) may not appear
27996 in a default argument. */
28007 {
28009 tree parsed_arg;
28011 tree copy;
28018 /* This can happen for a friend declaration for a function
28019 already declared with default arguments. */
28022 parsed_arg
28024 default_arg,
28028 /* Update any instantiations we've already created. */
28032 }
28036 /* Make sure no default arg is missing. */
28039 /* Restore the state of local_variables_forbidden_p. */
28042 /* Restore the queue. */
28044 }
28046 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
28048 sizeof ... ( identifier )
28050 where the 'sizeof' token has already been consumed. */
28052 static tree
28054 {
28055 /* Consume the `...'. */
28059 matching_parens parens;
28063 else
28071 /* The name is not qualified. */
28090 }
28092 /* Parse the operand of `sizeof' (or a similar operator). Returns
28093 either a TYPE or an expression, depending on the form of the
28094 input. The KEYWORD indicates which kind of expression we have
28095 encountered. */
28097 static tree
28099 {
28106 /* If it's a `...', then we are computing the length of a parameter
28107 pack. */
28112 /* Types cannot be defined in a `sizeof' expression. Save away the
28113 old message. */
28115 /* And create the new one. */
28121 /* The restrictions on constant-expressions do not apply inside
28122 sizeof expressions. */
28123 saved_integral_constant_expression_p
28125 saved_non_integral_constant_expression_p
28129 /* Do not actually evaluate the expression. */
28132 /* If it's a `(', then we might be looking at the type-id
28133 construction. */
28135 {
28138 /* We can't be sure yet whether we're looking at a type-id or an
28139 expression. */
28142 matching_parens parens;
28145 /* Note: as a GNU Extension, compound literals are considered
28146 postfix-expressions as they are in C99, so they are valid
28147 arguments to sizeof. See comment in cp_parser_cast_expression
28148 for details. */
28151 else
28152 {
28155 /* Look for the type-id. */
28157 /* Look for the closing `)'. */
28160 }
28162 /* If all went well, then we're done. */
28164 {
28165 cp_decl_specifier_seq decl_specs;
28167 /* Build a trivial decl-specifier-seq. */
28171 /* Call grokdeclarator to figure out what type this is. */
28174 TYPENAME,
28177 }
28178 }
28180 /* If the type-id production did not work out, then we must be
28181 looking at the unary-expression production. */
28185 /* Go back to evaluating expressions. */
28189 /* Free the message we created. */
28191 /* And restore the old one. */
28193 parser->integral_constant_expression_p
28195 parser->non_integral_constant_expression_p
28199 }
28201 /* If the current declaration has no declarator, return true. */
28203 static bool
28205 {
28206 /* If the next token is a `;' or a `,' then there is no
28207 declarator. */
28210 }
28212 /* Update the DECL_SPECS to reflect the storage class indicated by
28213 KEYWORD. */
28215 static void
28220 {
28221 cp_storage_class storage_class;
28224 {
28228 }
28230 {
28233 }
28238 {
28241 }
28244 {
28262 }
28266 /* A storage class specifier cannot be applied alongside a typedef
28267 specifier. If there is a typedef specifier present then set
28268 conflicting_specifiers_p which will trigger an error later
28269 on in grokdeclarator. */
28272 }
28274 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28275 is true, the type is a class or enum definition. */
28277 static void
28279 tree type_spec,
28282 {
28285 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28286 (with, for example, in "typedef int wchar_t;") we remember that
28287 this is what happened. In system headers, we ignore these
28288 declarations so that G++ can work with system headers that are not
28289 C++-safe. */
28291 && !type_definition_p
28301 {
28304 ds_redefined_builtin_type_spec,
28305 token);
28307 {
28311 }
28312 }
28315 else
28316 {
28321 }
28322 }
28324 /* True iff TOKEN is the GNU keyword __thread. */
28326 static bool
28328 {
28331 }
28333 /* Set the location for a declarator specifier and check if it is
28334 duplicated.
28336 DECL_SPECS is the sequence of declarator specifiers onto which to
28337 set the location.
28339 DS is the single declarator specifier to set which location is to
28340 be set onto the existing sequence of declarators.
28342 LOCATION is the location for the declarator specifier to
28343 consider. */
28345 static void
28348 {
28357 {
28361 }
28362 else
28363 {
28365 {
28369 else
28370 {
28373 OPT_Wlong_long,
28375 }
28376 }
28378 {
28382 {
28386 }
28387 else
28388 {
28391 }
28392 }
28393 else
28394 {
28410 "__complex"
28411 };
28415 }
28416 }
28417 }
28419 /* Return true iff the declarator specifier DS is present in the
28420 sequence of declarator specifiers DECL_SPECS. */
28422 bool
28424 cp_decl_spec ds)
28425 {
28432 }
28434 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28435 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28437 static bool
28439 {
28441 }
28443 /* Issue an error message indicating that TOKEN_DESC was expected.
28444 If KEYWORD is true, it indicated this function is called by
28445 cp_parser_require_keword and the required token can only be
28446 a indicated keyword.
28448 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28449 within any error as the location of an "opening" token matching
28450 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28451 RT_CLOSE_PAREN). */
28453 static void
28455 required_token token_desc,
28457 location_t matching_location)
28458 {
28464 {
28533 }
28536 {
28538 {
28616 }
28617 }
28621 }
28624 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28625 issue an error message indicating that TOKEN_DESC was expected.
28627 Returns the token consumed, if the token had the appropriate type.
28628 Otherwise, returns NULL.
28630 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28631 within any error as the location of an "opening" token matching
28632 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28633 RT_CLOSE_PAREN). */
28638 required_token token_desc,
28639 location_t matching_location)
28640 {
28643 else
28644 {
28645 /* Output the MESSAGE -- unless we're parsing tentatively. */
28648 matching_location);
28650 }
28651 }
28653 /* An error message is produced if the next token is not '>'.
28654 All further tokens are skipped until the desired token is
28655 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28657 static void
28659 {
28660 /* Current level of '< ... >'. */
28662 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28665 /* Are we ready, yet? If not, issue error message. */
28669 /* Skip tokens until the desired token is found. */
28671 {
28672 /* Peek at the next token. */
28674 {
28682 /* C++0x views the `>>' operator as two `>' tokens, but
28683 C++98 does not. */
28686 {
28687 /* We've hit a `>>' where the first `>' closes the
28688 template argument list, and the second `>' is
28689 spurious. Just consume the `>>' and stop; we've
28690 already produced at least one error. */
28693 }
28694 /* Fall through for C++0x, so we handle the second `>' in
28695 the `>>'. */
28700 {
28701 /* We've reached the token we want, consume it and stop. */
28704 }
28723 /* The '>' was probably forgotten, don't look further. */
28728 }
28730 /* Consume this token. */
28732 }
28733 }
28735 /* If the next token is the indicated keyword, consume it. Otherwise,
28736 issue an error message indicating that TOKEN_DESC was expected.
28738 Returns the token consumed, if the token had the appropriate type.
28739 Otherwise, returns NULL. */
28744 required_token token_desc)
28745 {
28749 {
28751 UNKNOWN_LOCATION);
28753 }
28756 }
28758 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28759 function-definition. */
28761 static bool
28763 {
28766 /* A ctor-initializer begins with a `:'. */
28768 /* A function-try-block begins with `try'. */
28770 /* A function-transaction-block begins with `__transaction_atomic'
28771 or `__transaction_relaxed'. */
28774 /* The named return value extension begins with `return'. */
28776 }
28778 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28779 definition. */
28781 static bool
28783 {
28790 }
28792 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28793 C++0x) ending a template-argument. */
28795 static bool
28797 {
28805 }
28807 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28808 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28810 static bool
28813 {
28819 /* Check for the sequence `<::' in the original code. It would be lexed as
28820 `[:', where `[' is a digraph, and there is no whitespace before
28821 `:'. */
28823 {
28828 }
28830 }
28832 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28833 or none_type otherwise. */
28835 static enum tag_types
28837 {
28839 {
28849 }
28850 }
28852 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28853 or none_type otherwise or if the token is null. */
28855 static enum tag_types
28857 {
28862 {
28870 }
28871 }
28873 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28875 static void
28877 {
28881 {
28885 type))
28888 }
28889 }
28891 /* Issue an error message if DECL is redeclared with different
28892 access than its original declaration [class.access.spec/3].
28893 This applies to nested classes, nested class templates and
28894 enumerations [class.mem/1]. */
28896 static void
28898 {
28909 }
28911 /* Look for the `template' keyword, as a syntactic disambiguator.
28912 Return TRUE iff it is present, in which case it will be
28913 consumed. */
28915 static bool
28917 {
28919 {
28920 /* In C++98 the `template' keyword can only be used within templates;
28921 outside templates the parser can always figure out what is a
28922 template and what is not. In C++11, per the resolution of DR 468,
28923 `template' is allowed in cases where it is not strictly necessary. */
28926 {
28929 "in C++98 %<template%> (as a disambiguator) is only "
28931 /* If this part of the token stream is rescanned, the same
28932 error message would be generated. So, we purge the token
28933 from the stream. */
28936 }
28937 else
28938 {
28939 /* Consume the `template' keyword. */
28942 }
28943 }
28945 }
28947 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28948 set PARSER->SCOPE, and perform other related actions. */
28950 static void
28952 {
28955 /* Get the stored value. */
28957 /* Set the scope from the stored value. */
28961 }
28963 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28964 encounter the end of a block before what we were looking for. */
28966 static bool
28970 {
28972 {
28975 /* Abort a parenthesized expression if we encounter a semicolon. */
28979 /* If we've reached the end of the file, stop. */
28985 /* We've hit the end of an enclosing block, so there's been some
28986 kind of syntax error. */
28989 /* Consume the token. */
28991 /* See if it starts a new group. */
28993 {
28995 /* In theory this should probably check end == '}', but
28996 cp_parser_save_member_function_body needs it to exit
28997 after either '}' or ')' when called with ')'. */
29000 }
29002 {
29006 }
29011 }
29012 }
29014 /* Like above, for caching a default argument or NSDMI. Both of these are
29015 terminated by a non-nested comma, but it can be unclear whether or not a
29016 comma is nested in a template argument list unless we do more parsing.
29017 In order to handle this ambiguity, when we encounter a ',' after a '<'
29018 we try to parse what follows as a parameter-declaration-list (in the
29019 case of a default argument) or a member-declarator (in the case of an
29020 NSDMI). If that succeeds, then we stop caching. */
29022 static tree
29024 {
29029 tree default_argument;
29031 /* Add tokens until we have processed the entire default
29032 argument. We add the range [first_token, token). */
29035 {
29036 /* For list-initialization, this is straightforward. */
29039 }
29041 {
29044 /* Peek at the next token. */
29046 /* What we do depends on what token we have. */
29048 {
29049 /* In valid code, a default argument must be
29050 immediately followed by a `,' `)', or `...'. */
29053 {
29054 /* If we've seen a '<', we might be in a
29055 template-argument-list. Until Core issue 325 is
29056 resolved, we don't know how this situation ought
29057 to be handled, so try to DTRT. We check whether
29058 what comes after the comma is a valid parameter
29059 declaration list. If it is, then the comma ends
29060 the default argument; otherwise the default
29061 argument continues. */
29065 /* Set ITALP so cp_parser_parameter_declaration_list
29066 doesn't decide to commit to this parse. */
29073 {
29074 /* Parse declarators until we reach a non-comma or
29075 somthing that cannot be an initializer.
29076 Just checking whether we're looking at a single
29077 declarator is insufficient. Consider:
29078 int var = tuple<T,U>::x;
29079 The template parameter 'U' looks exactly like a
29080 declarator. */
29081 do
29082 {
29093 }
29095 /* If we met an '=' or ';' then the original comma
29096 was the end of the NSDMI. Otherwise assume
29097 we're still in the NSDMI. */
29100 }
29101 else
29102 {
29109 }
29116 }
29117 /* FALLTHRU */
29120 /* If we run into a non-nested `;', `}', or `]',
29121 then the code is invalid -- but the default
29122 argument is certainly over. */
29127 /* Handle correctly int n = sizeof ... ( p ); */
29130 /* Update DEPTH, if necessary. */
29145 /* This might be the comparison operator, or it might
29146 start a template argument list. */
29153 /* Fall through for C++0x, which treats the `>>'
29154 operator like two `>' tokens in certain
29155 cases. */
29160 {
29161 /* This might be an operator, or it might close a
29162 template argument list. But if a previous '<'
29163 started a template argument list, this will have
29164 closed it, so we can't be in one anymore. */
29168 }
29171 /* If we run out of tokens, issue an error message. */
29179 /* In these cases, we should look for template-ids.
29180 For example, if the default argument is
29181 `X<int, double>()', we need to do name lookup to
29182 figure out whether or not `X' is a template; if
29183 so, the `,' does not end the default argument.
29185 That is not yet done. */
29190 }
29192 /* If we've reached the end, stop. */
29196 /* Add the token to the token block. */
29198 }
29200 /* Create a DEFAULT_ARG to represent the unparsed default
29201 argument. */
29208 }
29210 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
29212 location_t
29214 {
29219 }
29221 /* Begin parsing tentatively. We always save tokens while parsing
29222 tentatively so that if the tentative parsing fails we can restore the
29223 tokens. */
29225 static void
29227 {
29228 /* Enter a new parsing context. */
29230 /* Begin saving tokens. */
29232 /* In order to avoid repetitive access control error messages,
29233 access checks are queued up until we are no longer parsing
29234 tentatively. */
29236 }
29238 /* Commit to the currently active tentative parse. */
29240 static void
29242 {
29246 /* Mark all of the levels as committed. */
29249 {
29256 }
29257 }
29259 /* Commit to the topmost currently active tentative parse.
29261 Note that this function shouldn't be called when there are
29262 irreversible side-effects while in a tentative state. For
29263 example, we shouldn't create a permanent entry in the symbol
29264 table, or issue an error message that might not apply if the
29265 tentative parse is aborted. */
29267 static void
29269 {
29274 {
29282 }
29283 }
29285 /* Abort the currently active tentative parse. All consumed tokens
29286 will be rolled back, and no diagnostics will be issued. */
29288 static void
29290 {
29294 /* Now, pretend that we want to see if the construct was
29295 successfully parsed. */
29297 }
29299 /* Stop parsing tentatively. If a parse error has occurred, restore the
29300 token stream. Otherwise, commit to the tokens we have consumed.
29301 Returns true if no error occurred; false otherwise. */
29303 static bool
29305 {
29309 /* Remember whether or not an error occurred, since we are about to
29310 destroy that information. */
29312 /* Remove the topmost context from the stack. */
29315 /* If no parse errors occurred, commit to the tentative parse. */
29317 {
29318 /* Commit to the tokens read tentatively, unless that was
29319 already done. */
29324 }
29325 /* Otherwise, if errors occurred, roll back our state so that things
29326 are just as they were before we began the tentative parse. */
29327 else
29328 {
29331 }
29332 /* Add the context to the front of the free list. */
29337 }
29339 /* Returns true if we are parsing tentatively and are not committed to
29340 this tentative parse. */
29342 static bool
29344 {
29347 }
29349 /* Returns nonzero iff an error has occurred during the most recent
29350 tentative parse. */
29352 static bool
29354 {
29357 }
29359 /* Returns nonzero if GNU extensions are allowed. */
29361 static bool
29363 {
29365 }
29366 \f
29367 /* Objective-C++ Productions */
29370 /* Parse an Objective-C expression, which feeds into a primary-expression
29371 above.
29373 objc-expression:
29374 objc-message-expression
29375 objc-string-literal
29376 objc-encode-expression
29377 objc-protocol-expression
29378 objc-selector-expression
29380 Returns a tree representation of the expression. */
29382 static cp_expr
29384 {
29385 /* Try to figure out what kind of declaration is present. */
29389 {
29399 {
29411 }
29412 /* FALLTHRU */
29418 }
29421 }
29423 /* Parse an Objective-C message expression.
29425 objc-message-expression:
29426 [ objc-message-receiver objc-message-args ]
29428 Returns a representation of an Objective-C message. */
29430 static tree
29432 {
29444 /* Construct a location e.g.
29445 [self func1:5]
29446 ^~~~~~~~~~~~~~
29447 ranging from the '[' to the ']', with the caret at the start. */
29452 }
29454 /* Parse an objc-message-receiver.
29456 objc-message-receiver:
29457 expression
29458 simple-type-specifier
29460 Returns a representation of the type or expression. */
29462 static tree
29464 {
29465 tree rcv;
29467 /* An Objective-C message receiver may be either (1) a type
29468 or (2) an expression. */
29472 /* If that worked out, fine. */
29479 CP_PARSER_FLAGS_NONE);
29486 }
29488 /* Parse the arguments and selectors comprising an Objective-C message.
29490 objc-message-args:
29491 objc-selector
29492 objc-selector-args
29493 objc-selector-args , objc-comma-args
29495 objc-selector-args:
29496 objc-selector [opt] : assignment-expression
29497 objc-selector-args objc-selector [opt] : assignment-expression
29499 objc-comma-args:
29500 assignment-expression
29501 objc-comma-args , assignment-expression
29503 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29504 selector arguments and TREE_VALUE containing a list of comma
29505 arguments. */
29507 static tree
29509 {
29515 {
29521 /* Detect if we have a unary selector. */
29530 sel_args
29535 }
29537 /* Handle non-selector arguments, if any. */
29539 {
29540 tree arg;
29545 addl_args
29550 }
29553 {
29556 }
29559 }
29561 /* Parse an Objective-C encode expression.
29563 objc-encode-expression:
29564 @encode objc-typename
29566 Returns an encoded representation of the type argument. */
29568 static cp_expr
29570 {
29571 tree type;
29576 matching_parens parens;
29583 {
29587 }
29589 /* This happens if we find @encode(T) (where T is a template
29590 typename or something dependent on a template typename) when
29591 parsing a template. In that case, we can't compile it
29592 immediately, but we rather create an AT_ENCODE_EXPR which will
29593 need to be instantiated when the template is used.
29594 */
29596 {
29600 }
29603 /* Build a location of the form:
29604 @encode(int)
29605 ^~~~~~~~~~~~
29606 with caret==start at the @ token, finishing at the close paren. */
29607 location_t combined_loc
29612 }
29614 /* Parse an Objective-C @defs expression. */
29616 static tree
29618 {
29619 tree name;
29622 matching_parens parens;
29628 }
29630 /* Parse an Objective-C protocol expression.
29632 objc-protocol-expression:
29633 @protocol ( identifier )
29635 Returns a representation of the protocol expression. */
29637 static tree
29639 {
29640 tree proto;
29644 matching_parens parens;
29649 /* Build a location of the form:
29650 @protocol(prot)
29651 ^~~~~~~~~~~~~~~
29652 with caret==start at the @ token, finishing at the close paren. */
29653 location_t combined_loc
29659 }
29661 /* Parse an Objective-C selector expression.
29663 objc-selector-expression:
29664 @selector ( objc-method-signature )
29666 objc-method-signature:
29667 objc-selector
29668 objc-selector-seq
29670 objc-selector-seq:
29671 objc-selector :
29672 objc-selector-seq objc-selector :
29674 Returns a representation of the method selector. */
29676 static tree
29678 {
29685 matching_parens parens;
29691 {
29700 {
29701 /* Detect if we have a unary selector. */
29703 {
29706 }
29707 else
29708 {
29710 }
29711 }
29716 {
29717 sel_seq
29720 sel_seq
29723 }
29724 else
29725 sel_seq
29730 }
29732 finish_selector:
29736 /* Build a location of the form:
29737 @selector(func)
29738 ^~~~~~~~~~~~~~~
29739 with caret==start at the @ token, finishing at the close paren. */
29740 location_t combined_loc
29744 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29747 }
29749 /* Parse a list of identifiers.
29751 objc-identifier-list:
29752 identifier
29753 objc-identifier-list , identifier
29755 Returns a TREE_LIST of identifier nodes. */
29757 static tree
29759 {
29760 tree identifier;
29761 tree list;
29772 {
29779 identifier));
29781 }
29784 }
29786 /* Parse an Objective-C alias declaration.
29788 objc-alias-declaration:
29789 @compatibility_alias identifier identifier ;
29791 This function registers the alias mapping with the Objective-C front end.
29792 It returns nothing. */
29794 static void
29796 {
29804 }
29806 /* Parse an Objective-C class forward-declaration.
29808 objc-class-declaration:
29809 @class objc-identifier-list ;
29811 The function registers the forward declarations with the Objective-C
29812 front end. It returns nothing. */
29814 static void
29816 {
29819 {
29820 tree id;
29830 else
29832 }
29834 }
29836 /* Parse a list of Objective-C protocol references.
29838 objc-protocol-refs-opt:
29839 objc-protocol-refs [opt]
29841 objc-protocol-refs:
29842 < objc-identifier-list >
29844 Returns a TREE_LIST of identifiers, if any. */
29846 static tree
29848 {
29852 {
29856 }
29859 }
29861 /* Parse a Objective-C visibility specification. */
29863 static void
29865 {
29869 {
29884 }
29886 /* Eat '@private'/'@protected'/'@public'. */
29888 }
29890 /* Parse an Objective-C method type. Return 'true' if it is a class
29891 (+) method, and 'false' if it is an instance (-) method. */
29895 {
29898 else
29900 }
29902 /* Parse an Objective-C protocol qualifier. */
29904 static tree
29906 {
29919 {
29924 }
29927 }
29929 /* Parse an Objective-C typename. */
29931 static tree
29933 {
29937 {
29940 matching_parens parens;
29944 /* An ObjC type name may consist of just protocol qualifiers, in which
29945 case the type shall default to 'id'. */
29947 {
29950 /* If the type could not be parsed, an error has already
29951 been produced. For error recovery, behave as if it had
29952 not been specified, which will use the default type
29953 'id'. */
29955 {
29957 /* We need to skip to the closing parenthesis as
29958 cp_parser_type_id() does not seem to do it for
29959 us. */
29964 }
29965 }
29969 }
29972 }
29974 /* Check to see if TYPE refers to an Objective-C selector name. */
29976 static bool
29978 {
29984 }
29986 /* Parse an Objective-C selector. */
29988 static tree
29990 {
29994 {
29997 }
29999 /* C++ operator names are allowed to appear in ObjC selectors. */
30001 {
30014 }
30015 }
30017 /* Parse an Objective-C params list. */
30019 static tree
30021 {
30027 {
30037 /* Detect if we have a unary selector. */
30040 {
30043 }
30047 {
30048 /* Something went quite wrong. There should be a colon
30049 here, but there is not. Stop parsing parameters. */
30051 }
30053 /* New ObjC allows attributes on parameters too. */
30058 params
30061 type_name,
30062 identifier,
30063 parm_attr));
30066 }
30069 {
30072 }
30074 /* We allow tail attributes for the method. */
30076 {
30084 }
30087 {
30090 }
30092 }
30094 /* Parse the non-keyword Objective-C params. */
30096 static tree
30099 {
30105 {
30107 tree parm;
30113 {
30118 }
30120 /* TODO: parse attributes for tail parameters. */
30129 }
30131 /* We allow tail attributes for the method. */
30133 {
30135 {
30140 }
30141 else
30142 /* We have an error, but parse the attributes, so that we can
30143 carry on. */
30149 }
30152 }
30154 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
30156 static void
30158 {
30161 /* If the next token is `extern' and the following token is a string
30162 literal, then we have a linkage specification. */
30164 && cp_parser_is_pure_string_literal
30167 /* Handle #pragma, if any. */
30170 /* Allow stray semicolons. */
30173 /* Mark methods as optional or required, when building protocols. */
30175 {
30178 }
30180 {
30183 }
30186 /* Other stray characters must generate errors. */
30188 {
30192 }
30193 /* Finally, try to parse a block-declaration, or a function-definition. */
30194 else
30196 }
30198 /* Parse a method signature. */
30200 static tree
30202 {
30218 }
30220 static bool
30222 {
30223 tree tattr;
30228 /* If the attributes are followed by a method introducer, this is not allowed.
30229 Dump the attributes and flag the situation. */
30234 /* Otherwise, the attributes introduce some interstitial code, possibly so
30235 rewind to allow that check. */
30238 }
30240 /* Parse an Objective-C method prototype list. */
30242 static void
30244 {
30248 {
30250 {
30255 else
30259 {
30263 }
30266 }
30272 OPT_Wattributes,
30274 else
30275 /* Allow for interspersed non-ObjC++ code. */
30279 }
30283 else
30287 }
30289 /* Parse an Objective-C method definition list. */
30291 static void
30293 {
30297 {
30298 tree meth;
30301 {
30307 else
30312 {
30316 }
30318 NULL_TREE);
30320 /* For historical reasons, we accept an optional semicolon. */
30327 {
30334 }
30335 }
30336 /* The following case will be removed once @synthesize is
30337 completely implemented. */
30348 else
30349 /* Allow for interspersed non-ObjC++ code. */
30353 }
30357 else
30361 }
30363 /* Parse Objective-C ivars. */
30365 static void
30367 {
30378 {
30379 cp_decl_specifier_seq declspecs;
30381 tree prefix_attributes;
30389 CP_PARSER_FLAGS_OPTIONAL,
30393 /* auto, register, static, extern, mutable. */
30395 {
30398 }
30400 /* thread_local. */
30402 {
30405 }
30407 /* typedef. */
30409 {
30412 }
30417 /* Keep going until we hit the `;' at the end of the
30418 declaration. */
30420 {
30425 /* Check for a (possibly unnamed) bitfield declaration. */
30433 {
30434 /* Get the name of the bitfield. */
30437 sfk_none);
30439 eat_colon:
30441 /* Get the width of the bitfield. */
30442 width
30444 }
30445 else
30446 {
30447 /* Parse the declarator. */
30448 declarator
30454 }
30456 /* Look for attributes that apply to the ivar. */
30458 /* Remember which attributes are prefix attributes and
30459 which are not. */
30461 /* Combine the attributes. */
30465 /* Create the bitfield declaration. */
30468 else
30473 /* Add the instance variable. */
30477 /* Reset PREFIX_ATTRIBUTES. */
30479 {
30484 }
30489 {
30492 }
30494 }
30498 }
30503 /* Do not consume the RID_AT_END, so it will be read again as terminating
30504 the @interface of @implementation. */
30508 /* For historical reasons, we accept an optional semicolon. */
30511 }
30513 /* Parse an Objective-C protocol declaration. */
30515 static void
30517 {
30523 {
30528 }
30530 /* See if we have a forward declaration or a definition. */
30533 /* Try a forward declaration first. */
30535 {
30537 {
30538 tree id;
30548 else
30550 }
30552 }
30554 /* Ok, we got a full-fledged definition (or at least should). */
30555 else
30556 {
30561 }
30562 }
30564 /* Parse an Objective-C superclass or category. */
30566 static void
30571 {
30577 {
30580 }
30582 {
30583 matching_parens parens;
30586 /* If there is no category name, and this is an @interface, we
30587 have a class extension. */
30589 {
30592 }
30593 else
30597 }
30598 }
30600 /* Parse an Objective-C class interface. */
30602 static void
30604 {
30611 {
30612 /* It's hard to recover because even if valid @interface stuff
30613 is to follow, we can't compile it (or validate it) if we
30614 don't even know which class it refers to. Let's assume this
30615 was a stray '@interface' token in the stream and skip it.
30616 */
30618 }
30623 /* We have either a class or a category on our hands. */
30626 else
30627 {
30629 /* Handle instance variable declarations, if any. */
30632 }
30635 }
30637 /* Parse an Objective-C class implementation. */
30639 static void
30641 {
30648 {
30649 /* It's hard to recover because even if valid @implementation
30650 stuff is to follow, we can't compile it (or validate it) if
30651 we don't even know which class it refers to. Let's assume
30652 this was a stray '@implementation' token in the stream and
30653 skip it.
30654 */
30656 }
30660 /* We have either a class or a category on our hands. */
30663 else
30664 {
30666 /* Handle instance variable declarations, if any. */
30669 }
30672 }
30674 /* Consume the @end token and finish off the implementation. */
30676 static void
30678 {
30681 }
30683 /* Parse an Objective-C declaration. */
30685 static void
30687 {
30688 /* Try to figure out what kind of declaration is present. */
30693 {
30709 }
30712 {
30735 }
30736 }
30738 /* Parse an Objective-C try-catch-finally statement.
30740 objc-try-catch-finally-stmt:
30741 @try compound-statement objc-catch-clause-seq [opt]
30742 objc-finally-clause [opt]
30744 objc-catch-clause-seq:
30745 objc-catch-clause objc-catch-clause-seq [opt]
30747 objc-catch-clause:
30748 @catch ( objc-exception-declaration ) compound-statement
30750 objc-finally-clause:
30751 @finally compound-statement
30753 objc-exception-declaration:
30754 parameter-declaration
30755 '...'
30757 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30759 Returns NULL_TREE.
30761 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30762 for C. Keep them in sync. */
30764 static tree
30766 {
30767 location_t location;
30768 tree stmt;
30773 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30774 node, lest it get absorbed into the surrounding block. */
30780 {
30784 matching_parens parens;
30790 {
30791 /* We have "@catch (...)" (where the '...' are literally
30792 what is in the code). Skip the '...'.
30793 parameter_declaration is set to NULL_TREE, and
30794 objc_being_catch_clauses() knows that that means
30795 '...'. */
30798 }
30799 else
30800 {
30801 /* We have "@catch (NSException *exception)" or something
30802 like that. Parse the parameter declaration. */
30806 else
30811 }
30814 else
30815 {
30816 /* If there was no open parenthesis, we are recovering from
30817 an error, and we are trying to figure out what mistake
30818 the user has made. */
30820 /* If there is an immediate closing parenthesis, the user
30821 probably forgot the opening one (ie, they typed "@catch
30822 NSException *e)". Parse the closing parenthesis and keep
30823 going. */
30827 /* If these is no immediate closing parenthesis, the user
30828 probably doesn't know that parenthesis are required at
30829 all (ie, they typed "@catch NSException *e"). So, just
30830 forget about the closing parenthesis and keep going. */
30831 }
30835 }
30837 {
30840 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30841 node, lest it get absorbed into the surrounding block. */
30845 }
30848 }
30850 /* Parse an Objective-C synchronized statement.
30852 objc-synchronized-stmt:
30853 @synchronized ( expression ) compound-statement
30855 Returns NULL_TREE. */
30857 static tree
30859 {
30860 location_t location;
30867 matching_parens parens;
30872 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30873 node, lest it get absorbed into the surrounding block. */
30878 }
30880 /* Parse an Objective-C throw statement.
30882 objc-throw-stmt:
30883 @throw assignment-expression [opt] ;
30885 Returns a constructed '@throw' statement. */
30887 static tree
30889 {
30901 }
30903 /* Parse an Objective-C statement. */
30905 static tree
30907 {
30908 /* Try to figure out what kind of declaration is present. */
30912 {
30923 }
30926 }
30928 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30929 look ahead to see if an objc keyword follows the attributes. This
30930 is to detect the use of prefix attributes on ObjC @interface and
30931 @protocol. */
30933 static bool
30935 {
30940 {
30943 }
30946 }
30948 /* This routine is a minimal replacement for
30949 c_parser_struct_declaration () used when parsing the list of
30950 types/names or ObjC++ properties. For example, when parsing the
30951 code
30953 @property (readonly) int a, b, c;
30955 this function is responsible for parsing "int a, int b, int c" and
30956 returning the declarations as CHAIN of DECLs.
30958 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30959 similar parsing. */
30960 static tree
30962 {
30964 cp_decl_specifier_seq declspecs;
30966 tree prefix_attributes;
30969 CP_PARSER_FLAGS_NONE,
30976 /* auto, register, static, extern, mutable. */
30978 {
30981 }
30983 /* thread_local. */
30985 {
30988 }
30990 /* typedef. */
30992 {
30995 }
31000 /* Keep going until we hit the `;' at the end of the declaration. */
31002 {
31007 /* Parse the declarator. */
31011 /* Look for attributes that apply to the ivar. */
31013 /* Remember which attributes are prefix attributes and
31014 which are not. */
31016 /* Combine the attributes. */
31026 /* Reset PREFIX_ATTRIBUTES. */
31028 {
31033 }
31040 {
31043 }
31044 else
31046 }
31048 }
31050 /* Parse an Objective-C @property declaration. The syntax is:
31052 objc-property-declaration:
31053 '@property' objc-property-attributes[opt] struct-declaration ;
31055 objc-property-attributes:
31056 '(' objc-property-attribute-list ')'
31058 objc-property-attribute-list:
31059 objc-property-attribute
31060 objc-property-attribute-list, objc-property-attribute
31062 objc-property-attribute
31063 'getter' = identifier
31064 'setter' = identifier
31065 'readonly'
31066 'readwrite'
31067 'assign'
31068 'retain'
31069 'copy'
31070 'nonatomic'
31072 For example:
31073 @property NSString *name;
31074 @property (readonly) id object;
31075 @property (retain, nonatomic, getter=getTheName) id name;
31076 @property int a, b, c;
31078 PS: This function is identical to
31079 c_parser_objc_at_property_declaration for C. Keep them in sync. */
31080 static void
31082 {
31083 /* The following variables hold the attributes of the properties as
31084 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
31085 seen. When we see an attribute, we set them to 'true' (if they
31086 are boolean properties) or to the identifier (if they have an
31087 argument, ie, for getter and setter). Note that here we only
31088 parse the list of attributes, check the syntax and accumulate the
31089 attributes that we find. objc_add_property_declaration() will
31090 then process the information. */
31100 /* 'properties' is the list of properties that we read. Usually a
31101 single one, but maybe more (eg, in "@property int a, b, c;" there
31102 are three). */
31103 tree properties;
31104 location_t loc;
31110 /* Parse the optional attribute list... */
31112 {
31113 /* Eat the '('. */
31114 matching_parens parens;
31118 {
31124 {
31127 }
31131 {
31142 {
31146 else
31151 }
31154 {
31158 }
31160 {
31162 {
31165 }
31166 else
31170 else
31172 }
31173 else
31174 {
31176 {
31179 }
31180 else
31182 }
31188 }
31195 else
31197 }
31199 /* FIXME: "@property (setter, assign);" will generate a spurious
31200 "error: expected ‘)’ before ‘,’ token". This is because
31201 cp_parser_require, unlike the C counterpart, will produce an
31202 error even if we are in error recovery. */
31204 {
31209 }
31210 }
31212 /* ... and the property declaration(s). */
31216 {
31218 /* If the next token is now a `;', consume it. */
31222 }
31226 else
31227 {
31228 /* Comma-separated properties are chained together in
31229 reverse order; add them one by one. */
31238 }
31241 }
31243 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31245 objc-synthesize-declaration:
31246 @synthesize objc-synthesize-identifier-list ;
31248 objc-synthesize-identifier-list:
31249 objc-synthesize-identifier
31250 objc-synthesize-identifier-list, objc-synthesize-identifier
31252 objc-synthesize-identifier
31253 identifier
31254 identifier = identifier
31256 For example:
31257 @synthesize MyProperty;
31258 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31260 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31261 for C. Keep them in sync.
31262 */
31263 static void
31265 {
31267 location_t loc;
31272 {
31276 {
31279 }
31281 {
31285 {
31288 }
31289 }
31290 else
31295 else
31297 }
31300 }
31302 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31304 objc-dynamic-declaration:
31305 @dynamic identifier-list ;
31307 For example:
31308 @dynamic MyProperty;
31309 @dynamic MyProperty, AnotherProperty;
31311 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31312 for C. Keep them in sync.
31313 */
31314 static void
31316 {
31318 location_t loc;
31323 {
31324 tree property;
31327 {
31330 }
31334 else
31336 }
31339 }
31341 \f
31342 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31344 /* Returns name of the next clause.
31345 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31346 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31347 returned and the token is consumed. */
31349 static pragma_omp_clause
31351 {
31367 {
31372 {
31553 }
31554 }
31560 }
31562 /* Validate that a clause of the given type does not already exist. */
31564 static void
31567 {
31568 tree c;
31572 {
31575 }
31576 }
31578 /* OpenMP 2.5:
31579 variable-list:
31580 identifier
31581 variable-list , identifier
31583 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31584 colon). An opening parenthesis will have been consumed by the caller.
31586 If KIND is nonzero, create the appropriate node and install the decl
31587 in OMP_CLAUSE_DECL and add the node to the head of the list.
31589 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31590 return the list created.
31592 COLON can be NULL if only closing parenthesis should end the list,
31593 or pointer to bool which will receive false if the list is terminated
31594 by closing parenthesis or true if the list is terminated by colon. */
31596 static tree
31599 {
31603 {
31606 }
31608 {
31613 && current_class_ptr
31615 {
31621 }
31622 else
31623 {
31634 else
31639 }
31641 ;
31643 {
31645 {
31647 /* The OpenACC cache directive explicitly only allows "array
31648 elements or subarrays". */
31650 {
31654 }
31655 /* FALLTHROUGH. */
31660 {
31661 location_t loc
31666 decl
31670 }
31671 /* FALLTHROUGH. */
31675 {
31683 parser->colon_corrects_to_scope_p
31687 else
31688 {
31689 /* Look for `:'. */
31693 CPP_CLOSE_SQUARE))
31695 }
31696 /* Look for the closing `]'. */
31698 RT_CLOSE_SQUARE))
31702 }
31706 }
31712 }
31713 else
31716 get_comma:
31720 }
31726 {
31730 }
31733 {
31736 /* Try to resync to an unnested comma. Copied from
31737 cp_parser_parenthesized_expression_list. */
31738 skip_comma:
31747 }
31750 }
31752 /* Similarly, but expect leading and trailing parenthesis. This is a very
31753 common case for omp clauses. */
31755 static tree
31757 {
31761 }
31763 /* OpenACC 2.0:
31764 copy ( variable-list )
31765 copyin ( variable-list )
31766 copyout ( variable-list )
31767 create ( variable-list )
31768 delete ( variable-list )
31769 present ( variable-list ) */
31771 static tree
31773 tree list)
31774 {
31777 {
31810 }
31818 }
31820 /* OpenACC 2.0:
31821 deviceptr ( variable-list ) */
31823 static tree
31825 {
31829 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31830 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31831 variable-list must only allow for pointer variables. */
31834 {
31841 }
31844 }
31846 /* OpenACC 2.5:
31847 auto
31848 finalize
31849 independent
31850 nohost
31851 seq */
31853 static tree
31857 {
31862 }
31864 /* OpenACC:
31865 num_gangs ( expression )
31866 num_workers ( expression )
31867 vector_length ( expression ) */
31869 static tree
31872 {
31875 matching_parens parens;
31883 {
31888 }
31896 }
31898 /* OpenACC:
31900 gang [( gang-arg-list )]
31901 worker [( [num:] int-expr )]
31902 vector [( [length:] int-expr )]
31904 where gang-arg is one of:
31906 [num:] int-expr
31907 static: size-expr
31909 and size-expr may be:
31911 *
31912 int-expr
31913 */
31915 static tree
31918 {
31928 {
31929 matching_parens parens;
31932 do
31933 {
31937 /* Gang static argument. */
31940 {
31948 {
31951 }
31953 /* Check for the '*' argument. */
31957 CPP_CLOSE_PAREN)))
31958 {
31963 {
31966 }
31968 }
31969 }
31970 /* Worker num: argument and vector length: arguments. */
31974 {
31977 }
31979 /* Now collect the actual argument. */
31981 {
31984 }
31996 {
31999 }
32001 }
32006 }
32020 cleanup_error:
32023 }
32025 /* OpenACC 2.0:
32026 tile ( size-expr-list ) */
32028 static tree
32030 {
32034 /* Collapse and tile are mutually exclusive. (The spec doesn't say
32035 so, but the spec authors never considered such a case and have
32036 differing opinions on what it might mean, including 'not
32037 allowed'.) */
32040 clause_loc);
32045 do
32046 {
32053 {
32056 }
32057 else
32061 }
32064 /* Consume the trailing ')'. */
32072 }
32074 /* OpenACC 2.0
32075 Parse wait clause or directive parameters. */
32077 static tree
32079 {
32089 {
32094 }
32101 {
32105 {
32108 else
32109 {
32116 }
32117 }
32118 }
32121 }
32123 /* OpenACC:
32124 wait ( int-expr-list ) */
32126 static tree
32128 {
32137 }
32139 /* OpenMP 3.0:
32140 collapse ( constant-expression ) */
32142 static tree
32144 {
32146 location_t loc;
32147 HOST_WIDE_INT n;
32150 matching_parens parens;
32168 {
32171 }
32180 }
32182 /* OpenMP 2.5:
32183 default ( none | shared )
32185 OpenACC:
32186 default ( none | present ) */
32188 static tree
32191 {
32193 tree c;
32195 matching_parens parens;
32199 {
32204 {
32225 }
32228 }
32229 else
32230 {
32231 invalid_kind:
32234 else
32236 }
32253 }
32255 /* OpenMP 3.1:
32256 final ( expression ) */
32258 static tree
32260 {
32263 matching_parens parens;
32282 }
32284 /* OpenMP 2.5:
32285 if ( expression )
32287 OpenMP 4.5:
32288 if ( directive-name-modifier : expression )
32290 directive-name-modifier:
32291 parallel | task | taskloop | target data | target | target update
32292 | target enter data | target exit data */
32294 static tree
32297 {
32301 matching_parens parens;
32306 {
32318 {
32321 {
32334 else
32335 {
32336 location_t loc
32341 }
32344 {
32346 {
32351 }
32353 {
32354 location_t loc
32358 }
32359 }
32360 }
32361 }
32363 {
32365 {
32368 }
32369 else
32370 {
32372 {
32373 location_t loc
32376 }
32378 }
32379 }
32380 }
32392 {
32395 {
32398 {
32408 }
32410 p);
32412 }
32414 {
32417 else
32420 }
32423 {
32427 }
32428 }
32436 }
32438 /* OpenMP 3.1:
32439 mergeable */
32441 static tree
32444 {
32445 tree c;
32448 location);
32453 }
32455 /* OpenMP 2.5:
32456 nowait */
32458 static tree
32461 {
32462 tree c;
32469 }
32471 /* OpenMP 2.5:
32472 num_threads ( expression ) */
32474 static tree
32476 location_t location)
32477 {
32480 matching_parens parens;
32500 }
32502 /* OpenMP 4.5:
32503 num_tasks ( expression ) */
32505 static tree
32507 location_t location)
32508 {
32511 matching_parens parens;
32531 }
32533 /* OpenMP 4.5:
32534 grainsize ( expression ) */
32536 static tree
32538 location_t location)
32539 {
32542 matching_parens parens;
32562 }
32564 /* OpenMP 4.5:
32565 priority ( expression ) */
32567 static tree
32569 location_t location)
32570 {
32573 matching_parens parens;
32593 }
32595 /* OpenMP 4.5:
32596 hint ( expression ) */
32598 static tree
32600 location_t location)
32601 {
32604 matching_parens parens;
32623 }
32625 /* OpenMP 4.5:
32626 defaultmap ( tofrom : scalar ) */
32628 static tree
32630 location_t location)
32631 {
32635 matching_parens parens;
32640 {
32643 }
32647 {
32650 }
32656 {
32659 }
32663 {
32666 }
32672 location);
32678 out_err:
32683 }
32685 /* OpenMP 2.5:
32686 ordered
32688 OpenMP 4.5:
32689 ordered ( constant-expression ) */
32691 static tree
32694 {
32696 HOST_WIDE_INT n;
32702 {
32703 matching_parens parens;
32720 {
32722 "ordered argument needs positive constant integer "
32725 }
32726 }
32732 }
32734 /* OpenMP 2.5:
32735 reduction ( reduction-operator : variable-list )
32737 reduction-operator:
32738 One of: + * - & ^ | && ||
32740 OpenMP 3.1:
32742 reduction-operator:
32743 One of: + * - & ^ | && || min max
32745 OpenMP 4.0:
32747 reduction-operator:
32748 One of: + * - & ^ | && ||
32749 id-expression */
32751 static tree
32753 {
32761 {
32771 }
32775 else
32776 {
32787 {
32817 }
32818 else
32819 {
32821 resync_fail:
32826 }
32827 }
32833 NULL);
32835 {
32838 }
32841 }
32843 /* OpenMP 2.5:
32844 schedule ( schedule-kind )
32845 schedule ( schedule-kind , expression )
32847 schedule-kind:
32848 static | dynamic | guided | runtime | auto
32850 OpenMP 4.5:
32851 schedule ( schedule-modifier : schedule-kind )
32852 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32854 schedule-modifier:
32855 simd
32856 monotonic
32857 nonmonotonic */
32859 static tree
32861 {
32865 matching_parens parens;
32872 {
32881 else
32887 else
32888 {
32891 }
32892 }
32895 {
32900 {
32921 }
32922 }
32927 else
32933 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32935 {
32939 }
32942 {
32957 else
32962 }
32974 invalid_kind:
32976 resync_fail:
32981 }
32983 /* OpenMP 3.0:
32984 untied */
32986 static tree
32989 {
32990 tree c;
32997 }
32999 /* OpenMP 4.0:
33000 inbranch
33001 notinbranch */
33003 static tree
33006 {
33011 }
33013 /* OpenMP 4.0:
33014 parallel
33015 for
33016 sections
33017 taskgroup */
33019 static tree
33023 {
33027 }
33029 /* OpenMP 4.5:
33030 nogroup */
33032 static tree
33035 {
33040 }
33042 /* OpenMP 4.5:
33043 simd
33044 threads */
33046 static tree
33050 {
33055 }
33057 /* OpenMP 4.0:
33058 num_teams ( expression ) */
33060 static tree
33062 location_t location)
33063 {
33066 matching_parens parens;
33086 }
33088 /* OpenMP 4.0:
33089 thread_limit ( expression ) */
33091 static tree
33093 location_t location)
33094 {
33097 matching_parens parens;
33117 }
33119 /* OpenMP 4.0:
33120 aligned ( variable-list )
33121 aligned ( variable-list : constant-expression ) */
33123 static tree
33125 {
33129 matching_parens parens;
33137 {
33147 }
33153 }
33155 /* OpenMP 4.0:
33156 linear ( variable-list )
33157 linear ( variable-list : expression )
33159 OpenMP 4.5:
33160 linear ( modifier ( variable-list ) )
33161 linear ( modifier ( variable-list ) : expression ) */
33163 static tree
33166 {
33171 matching_parens parens;
33176 {
33188 else
33190 }
33195 else
33196 {
33205 }
33208 {
33213 {
33224 {
33227 }
33230 }
33241 }
33244 {
33247 }
33250 }
33252 /* OpenMP 4.0:
33253 safelen ( constant-expression ) */
33255 static tree
33257 location_t location)
33258 {
33261 matching_parens parens;
33280 }
33282 /* OpenMP 4.0:
33283 simdlen ( constant-expression ) */
33285 static tree
33287 location_t location)
33288 {
33291 matching_parens parens;
33310 }
33312 /* OpenMP 4.5:
33313 vec:
33314 identifier [+/- integer]
33315 vec , identifier [+/- integer]
33316 */
33318 static tree
33320 tree list)
33321 {
33325 {
33328 }
33331 {
33338 else
33339 {
33340 t = cp_parser_lookup_name_simple
33345 id_loc);
33346 }
33352 {
33355 }
33359 {
33362 }
33366 {
33369 }
33372 add_to_vector:
33374 {
33378 }
33384 }
33387 {
33393 }
33395 }
33397 /* OpenMP 4.0:
33398 depend ( depend-kind : variable-list )
33400 depend-kind:
33401 in | out | inout
33403 OpenMP 4.5:
33404 depend ( source )
33406 depend ( sink : vec ) */
33408 static tree
33410 {
33414 matching_parens parens;
33419 {
33433 else
33435 }
33436 else
33442 {
33452 }
33459 else
33460 {
33466 }
33469 invalid_kind:
33471 resync_fail:
33476 }
33478 /* OpenMP 4.0:
33479 map ( map-kind : variable-list )
33480 map ( variable-list )
33482 map-kind:
33483 alloc | to | from | tofrom
33485 OpenMP 4.5:
33486 map-kind:
33487 alloc | to | from | tofrom | release | delete
33489 map ( always [,] map-kind: variable-list ) */
33491 static tree
33493 {
33502 {
33507 {
33510 nth++;
33516 {
33521 }
33522 }
33523 }
33527 {
33541 else
33542 {
33548 }
33551 }
33554 {
33558 }
33561 NULL);
33567 }
33569 /* OpenMP 4.0:
33570 device ( expression ) */
33572 static tree
33574 location_t location)
33575 {
33578 matching_parens parens;
33598 }
33600 /* OpenMP 4.0:
33601 dist_schedule ( static )
33602 dist_schedule ( static , expression ) */
33604 static tree
33606 location_t location)
33607 {
33610 matching_parens parens;
33621 {
33632 }
33637 location);
33641 invalid_kind:
33643 resync_fail:
33648 }
33650 /* OpenMP 4.0:
33651 proc_bind ( proc-bind-kind )
33653 proc-bind-kind:
33654 master | close | spread */
33656 static tree
33658 location_t location)
33659 {
33660 tree c;
33667 {
33677 else
33679 }
33680 else
33689 location);
33694 invalid_kind:
33696 resync_fail:
33701 }
33703 /* OpenACC:
33704 async [( int-expr )] */
33706 static tree
33708 {
33715 {
33716 matching_parens parens;
33725 }
33735 }
33737 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33738 is a bitmask in MASK. Return the list of clauses found. */
33740 static tree
33744 {
33749 {
33750 location_t here;
33751 pragma_omp_clause c_kind;
33752 omp_clause_code code;
33763 {
33820 clauses);
33838 OMP_CLAUSE_IF_PRESENT,
33844 OMP_CLAUSE_INDEPENDENT,
33856 clauses);
33862 clauses);
33870 clauses);
33888 clauses);
33900 clauses);
33914 }
33919 {
33920 /* Remove the invalid clause(s) from the list to avoid
33921 confusing the rest of the compiler. */
33924 }
33925 }
33927 saw_error:
33934 }
33936 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33937 is a bitmask in MASK. Return the list of clauses found; the result
33938 of clause default goes in *pdefault. */
33940 static tree
33944 {
33950 {
33951 pragma_omp_clause c_kind;
33962 {
33974 clauses);
33988 clauses);
34008 clauses);
34013 clauses);
34023 clauses);
34057 clauses);
34071 clauses);
34086 OMP_CLAUSE_NOTINBRANCH,
34095 {
34096 clause_not_first:
34100 }
34130 clauses);
34131 else
34141 clauses);
34159 {
34164 }
34207 clauses
34213 clauses
34221 }
34226 {
34227 /* Remove the invalid clause(s) from the list to avoid
34228 confusing the rest of the compiler. */
34231 }
34232 }
34233 saw_error:
34236 {
34239 else
34241 }
34243 }
34245 /* OpenMP 2.5:
34246 structured-block:
34247 statement
34249 In practice, we're also interested in adding the statement to an
34250 outer node. So it is convenient if we work around the fact that
34251 cp_parser_statement calls add_stmt. */
34253 static unsigned
34255 {
34258 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34259 This preserves the "not within loop or switch" style error messages
34260 for nonsense cases like
34261 void foo() {
34262 #pragma omp single
34263 break;
34264 }
34265 */
34270 }
34272 static void
34274 {
34276 }
34278 static tree
34280 {
34288 }
34290 /* OpenMP 2.5:
34291 # pragma omp atomic new-line
34292 expression-stmt
34294 expression-stmt:
34295 x binop= expr | x++ | ++x | x-- | --x
34296 binop:
34297 +, *, -, /, &, ^, |, <<, >>
34299 where x is an lvalue expression with scalar type.
34301 OpenMP 3.1:
34302 # pragma omp atomic new-line
34303 update-stmt
34305 # pragma omp atomic read new-line
34306 read-stmt
34308 # pragma omp atomic write new-line
34309 write-stmt
34311 # pragma omp atomic update new-line
34312 update-stmt
34314 # pragma omp atomic capture new-line
34315 capture-stmt
34317 # pragma omp atomic capture new-line
34318 capture-block
34320 read-stmt:
34321 v = x
34322 write-stmt:
34323 x = expr
34324 update-stmt:
34325 expression-stmt | x = x binop expr
34326 capture-stmt:
34327 v = expression-stmt
34328 capture-block:
34329 { v = x; update-stmt; } | { update-stmt; v = x; }
34331 OpenMP 4.0:
34332 update-stmt:
34333 expression-stmt | x = x binop expr | x = expr binop x
34334 capture-stmt:
34335 v = update-stmt
34336 capture-block:
34337 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34339 where x and v are lvalue expressions with scalar type. */
34341 static void
34343 {
34351 {
34356 {
34362 }
34363 }
34365 {
34377 else
34381 }
34383 {
34389 {
34394 {
34397 }
34398 }
34399 }
34403 {
34413 else
34418 {
34419 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34420 opcode. */
34425 }
34429 {
34432 }
34433 else
34434 {
34440 }
34443 }
34445 restart:
34449 {
34456 /* FALLTHROUGH */
34466 /* FALLTHROUGH */
34481 /* Undo effects of boolean_increment for post {in,de}crement. */
34483 /* FALLTHRU */
34487 {
34488 /* Undo effects of boolean_increment. */
34490 {
34491 /* This is pre or post increment. */
34496 && !structured_block
34500 }
34501 }
34502 /* FALLTHRU */
34505 {
34540 {
34544 }
34547 {
34553 {
34558 }
34560 {
34572 {
34574 {
34579 }
34580 else
34582 }
34586 }
34589 {
34596 }
34600 }
34604 {
34607 {
34615 }
34617 {
34622 }
34657 }
34668 /* FALLTHROUGH */
34673 }
34680 }
34681 stmt_done:
34683 {
34694 }
34696 {
34699 }
34700 done:
34706 saw_error:
34709 {
34713 {
34717 }
34718 }
34719 }
34722 /* OpenMP 2.5:
34723 # pragma omp barrier new-line */
34725 static void
34727 {
34730 }
34732 /* OpenMP 2.5:
34733 # pragma omp critical [(name)] new-line
34734 structured-block
34736 OpenMP 4.5:
34737 # pragma omp critical [(name) [hint(expression)]] new-line
34738 structured-block */
34740 #define OMP_CRITICAL_CLAUSE_MASK \
34741 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34743 static tree
34745 {
34749 {
34750 matching_parens parens;
34764 OMP_CRITICAL_CLAUSE_MASK,
34766 }
34767 else
34772 }
34774 /* OpenMP 2.5:
34775 # pragma omp flush flush-vars[opt] new-line
34777 flush-vars:
34778 ( variable-list ) */
34780 static void
34782 {
34788 }
34790 /* Helper function, to parse omp for increment expression. */
34792 static tree
34794 {
34799 {
34802 }
34805 {
34812 /* Fall through: OpenMP disallows NE_EXPR. */
34816 }
34818 /* If decl is an iterator, preserve LHS and RHS of the relational
34819 expr until finish_omp_for. */
34830 }
34832 /* Helper function, to parse omp for increment expression. */
34834 static tree
34836 {
34840 cp_id_kind idk;
34844 {
34853 }
34862 {
34867 }
34874 {
34878 }
34891 do
34892 {
34899 {
34901 {
34904 else
34906 tf_warning_or_error);
34907 }
34908 else
34911 }
34912 }
34916 {
34922 }
34923 else
34927 }
34929 /* Parse the initialization statement of an OpenMP for loop.
34931 Return true if the resulting construct should have an
34932 OMP_CLAUSE_PRIVATE added to it. */
34934 static tree
34942 {
34948 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34950 init-expr:
34951 var = lb
34952 integer-type var = lb
34953 random-access-iterator-type var = lb
34954 pointer-type var = lb
34955 */
34956 cp_decl_specifier_seq type_specifiers;
34958 /* First, try to parse as an initialized declaration. See
34959 cp_parser_condition, from whence the bulk of this is copied. */
34966 {
34967 /* If parsing a type specifier seq succeeded, then this
34968 MUST be a initialized declaration. */
34973 CP_PARSER_DECLARATOR_NAMED,
34984 else
34985 {
34995 {
34997 CPP_OPEN_PAREN))
35000 else
35001 /* Trigger an error. */
35006 }
35010 {
35018 {
35021 auto_node);
35026 }
35029 asm_specification,
35030 LOOKUP_ONLYCONVERTING);
35033 {
35036 }
35037 else
35038 {
35041 {
35043 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
35045 {
35049 {
35053 }
35055 }
35057 {
35062 }
35063 }
35064 }
35066 }
35067 else
35068 {
35069 /* Consume '='. */
35073 non_class:
35076 else
35079 asm_specification,
35080 LOOKUP_ONLYCONVERTING);
35081 }
35085 }
35086 }
35087 else
35088 {
35089 cp_id_kind idk;
35090 /* If parsing a type specifier sequence failed, then
35091 this MUST be a simple expression. */
35097 && decl
35100 {
35111 {
35116 }
35121 }
35123 && decl
35126 {
35127 tree rhs;
35135 rhs,
35136 tf_warning_or_error));
35139 }
35140 else
35141 {
35146 {
35150 }
35151 }
35152 }
35154 }
35156 /* Parse the restricted form of the for statement allowed by OpenMP. */
35158 static tree
35161 {
35165 location_t loc_first;
35176 {
35179 }
35182 {
35185 }
35188 {
35194 }
35196 {
35199 {
35201 "%<linear%> clause may not be specified together "
35204 }
35205 else
35207 }
35220 {
35223 location_t loc;
35226 {
35230 }
35233 matching_parens parens;
35240 add_private_clause
35246 {
35249 {
35255 }
35256 else
35258 }
35265 {
35270 {
35274 }
35277 {
35278 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35282 {
35285 }
35286 else
35287 {
35290 }
35292 }
35293 else
35294 {
35299 }
35300 }
35303 {
35304 tree c;
35306 {
35315 decl);
35319 decl);
35320 }
35322 {
35327 else
35332 {
35335 /* For linear, signal that we need to fill up
35336 the so far unknown linear step. */
35339 }
35340 }
35341 }
35350 {
35351 /* If decl is an iterator, preserve the operator on decl
35352 until finish_omp_for. */
35354 && ((processing_template_decl
35359 else
35363 }
35375 {
35378 }
35383 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35384 in between the collapsed for loops to be still considered perfectly
35385 nested. Hopefully the final version clarifies this.
35386 For now handle (multiple) {'s and empty statements. */
35389 {
35393 {
35395 bracecount++;
35396 }
35400 else
35401 {
35408 }
35409 }
35412 {
35415 }
35416 }
35421 /* Note that we saved the original contents of this flag when we entered
35422 the structured block, and so we don't need to re-save it here. */
35425 /* Note that the grammar doesn't call for a structured block here,
35426 though the loop as a whole is a structured block. */
35433 else
35438 {
35440 {
35442 nbraces--;
35443 }
35446 else
35447 {
35449 {
35452 }
35457 }
35458 }
35461 {
35465 else
35467 }
35471 }
35473 /* Helper function for OpenMP parsing, split clauses and call
35474 finish_omp_clauses on each of the set of clauses afterwards. */
35476 static void
35479 {
35485 }
35487 /* OpenMP 4.0:
35488 #pragma omp simd simd-clause[optseq] new-line
35489 for-loop */
35491 #define OMP_SIMD_CLAUSE_MASK \
35492 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35498 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35499 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35501 static tree
35505 {
35516 {
35520 OMP_CLAUSE_ORDERED);
35522 {
35524 "%<ordered%> clause with parameter may not be specified "
35527 }
35528 }
35539 }
35541 /* OpenMP 2.5:
35542 #pragma omp for for-clause[optseq] new-line
35543 for-loop
35545 OpenMP 4.0:
35546 #pragma omp for simd for-simd-clause[optseq] new-line
35547 for-loop */
35549 #define OMP_FOR_CLAUSE_MASK \
35550 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35551 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35552 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35553 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35557 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35560 static tree
35564 {
35571 /* parallel for{, simd} disallows nowait clause, but for
35572 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35575 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35580 {
35585 {
35609 }
35610 }
35612 {
35615 }
35617 /* Composite distribute parallel for disallows linear clause. */
35624 {
35627 }
35638 }
35640 /* OpenMP 2.5:
35641 # pragma omp master new-line
35642 structured-block */
35644 static tree
35646 {
35650 }
35652 /* OpenMP 2.5:
35653 # pragma omp ordered new-line
35654 structured-block
35656 OpenMP 4.5:
35657 # pragma omp ordered ordered-clauses new-line
35658 structured-block */
35660 #define OMP_ORDERED_CLAUSE_MASK \
35661 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35662 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35664 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35665 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35667 static bool
35670 {
35674 {
35679 {
35681 {
35684 }
35686 {
35688 "%<depend%> clause may only be used in compound "
35692 }
35693 tree clauses
35695 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35699 }
35700 }
35702 tree clauses
35713 }
35715 /* OpenMP 2.5:
35717 section-scope:
35718 { section-sequence }
35720 section-sequence:
35721 section-directive[opt] structured-block
35722 section-sequence section-directive structured-block */
35724 static tree
35726 {
35731 matching_braces braces;
35739 {
35743 }
35746 {
35754 {
35758 }
35760 {
35763 }
35768 }
35779 }
35781 /* OpenMP 2.5:
35782 # pragma omp sections sections-clause[optseq] newline
35783 sections-scope */
35785 #define OMP_SECTIONS_CLAUSE_MASK \
35786 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35790 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35792 static tree
35795 {
35807 {
35810 }
35817 }
35819 /* OpenMP 2.5:
35820 # pragma omp parallel parallel-clause[optseq] new-line
35821 structured-block
35822 # pragma omp parallel for parallel-for-clause[optseq] new-line
35823 structured-block
35824 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35825 structured-block
35827 OpenMP 4.0:
35828 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35829 structured-block */
35831 #define OMP_PARALLEL_CLAUSE_MASK \
35832 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35838 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35842 static tree
35846 {
35853 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35859 {
35867 if_p);
35871 if_p);
35874 block);
35879 }
35880 /* When combined with distribute, parallel has to be followed by for.
35881 #pragma omp target parallel is allowed though. */
35885 {
35889 }
35891 {
35894 }
35896 {
35900 {
35910 block);
35913 }
35914 }
35919 {
35922 }
35930 }
35932 /* OpenMP 2.5:
35933 # pragma omp single single-clause[optseq] new-line
35934 structured-block */
35936 #define OMP_SINGLE_CLAUSE_MASK \
35937 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35938 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35939 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35942 static tree
35944 {
35954 }
35956 /* OpenMP 3.0:
35957 # pragma omp task task-clause[optseq] new-line
35958 structured-block */
35960 #define OMP_TASK_CLAUSE_MASK \
35961 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35972 static tree
35974 {
35985 }
35987 /* OpenMP 3.0:
35988 # pragma omp taskwait new-line */
35990 static void
35992 {
35995 }
35997 /* OpenMP 3.1:
35998 # pragma omp taskyield new-line */
36000 static void
36002 {
36005 }
36007 /* OpenMP 4.0:
36008 # pragma omp taskgroup new-line
36009 structured-block */
36011 static tree
36013 {
36017 if_p));
36018 }
36021 /* OpenMP 2.5:
36022 # pragma omp threadprivate (variable-list) */
36024 static void
36026 {
36027 tree vars;
36033 }
36035 /* OpenMP 4.0:
36036 # pragma omp cancel cancel-clause[optseq] new-line */
36038 #define OMP_CANCEL_CLAUSE_MASK \
36039 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
36043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
36045 static void
36047 {
36051 }
36053 /* OpenMP 4.0:
36054 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
36056 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
36057 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
36058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
36059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
36060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
36062 static void
36065 {
36066 tree clauses;
36070 {
36075 {
36078 }
36079 }
36081 {
36085 }
36088 {
36093 else
36097 }
36100 OMP_CANCELLATION_POINT_CLAUSE_MASK,
36102 pragma_tok);
36104 }
36106 /* OpenMP 4.0:
36107 #pragma omp distribute distribute-clause[optseq] new-line
36108 for-loop */
36110 #define OMP_DISTRIBUTE_CLAUSE_MASK \
36111 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36112 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36113 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36114 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
36115 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
36117 static tree
36121 {
36130 {
36138 else
36141 {
36147 {
36151 else
36154 }
36160 else
36174 }
36175 }
36177 {
36180 }
36185 {
36188 }
36199 }
36201 /* OpenMP 4.0:
36202 # pragma omp teams teams-clause[optseq] new-line
36203 structured-block */
36205 #define OMP_TEAMS_CLAUSE_MASK \
36206 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36210 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36211 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36214 static tree
36218 {
36227 {
36231 {
36256 }
36257 }
36259 {
36262 }
36267 {
36270 }
36279 }
36281 /* OpenMP 4.0:
36282 # pragma omp target data target-data-clause[optseq] new-line
36283 structured-block */
36285 #define OMP_TARGET_DATA_CLAUSE_MASK \
36286 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36291 static tree
36293 {
36294 tree clauses
36299 {
36302 {
36319 "%<#pragma omp target data%> with map-type other "
36320 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36324 }
36326 }
36329 {
36332 "%<#pragma omp target data%> must contain at least "
36335 }
36346 }
36348 /* OpenMP 4.5:
36349 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36350 structured-block */
36352 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36353 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36359 static tree
36362 {
36365 {
36370 {
36373 }
36374 }
36376 {
36380 }
36383 {
36389 }
36391 tree clauses
36396 {
36399 {
36412 "%<#pragma omp target enter data%> with map-type other "
36416 }
36418 }
36421 {
36424 "%<#pragma omp target enter data%> must contain at least "
36427 }
36434 }
36436 /* OpenMP 4.5:
36437 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36438 structured-block */
36440 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36441 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36447 static tree
36450 {
36453 {
36458 {
36461 }
36462 }
36464 {
36468 }
36471 {
36477 }
36479 tree clauses
36484 {
36487 {
36501 "%<#pragma omp target exit data%> with map-type other "
36502 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36506 }
36508 }
36511 {
36514 "%<#pragma omp target exit data%> must contain at least "
36517 }
36524 }
36526 /* OpenMP 4.0:
36527 # pragma omp target update target-update-clause[optseq] new-line */
36529 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36530 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36531 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36537 static bool
36540 {
36542 {
36548 }
36550 tree clauses
36555 {
36557 "%<#pragma omp target update%> must contain at least one "
36560 }
36568 }
36570 /* OpenMP 4.0:
36571 # pragma omp target target-clause[optseq] new-line
36572 structured-block */
36574 #define OMP_TARGET_CLAUSE_MASK \
36575 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36576 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36577 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36578 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36579 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36580 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36581 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36585 static bool
36588 {
36592 {
36604 {
36612 {
36613 tree stmt;
36615 {
36618 OMP_TARGET_CLAUSE_MASK,
36623 OMP_TARGET_CLAUSE_MASK,
36628 OMP_TARGET_CLAUSE_MASK,
36633 }
36635 }
36640 {
36644 if_p);
36649 if_p);
36654 if_p);
36658 }
36664 {
36665 /* For combined target teams, ensure the num_teams and
36666 thread_limit clause expressions are evaluated on the host,
36667 before entering the target construct. */
36668 tree c;
36674 {
36683 OMP_CLAUSE_FIRSTPRIVATE);
36688 }
36689 }
36699 }
36701 {
36704 }
36706 {
36710 }
36712 {
36716 }
36718 {
36722 }
36724 {
36727 }
36728 }
36730 {
36733 }
36748 check_clauses:
36750 {
36753 {
36767 "%<#pragma omp target%> with map-type other "
36768 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36772 }
36774 }
36776 }
36778 /* OpenACC 2.0:
36779 # pragma acc cache (variable-list) new-line
36780 */
36782 static tree
36784 {
36799 }
36801 /* OpenACC 2.0:
36802 # pragma acc data oacc-data-clause[optseq] new-line
36803 structured-block */
36805 #define OACC_DATA_CLAUSE_MASK \
36806 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
36814 static tree
36816 {
36829 }
36831 /* OpenACC 2.0:
36832 # pragma acc host_data <clauses> new-line
36833 structured-block */
36835 #define OACC_HOST_DATA_CLAUSE_MASK \
36836 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36838 static tree
36840 {
36853 }
36855 /* OpenACC 2.0:
36856 # pragma acc declare oacc-data-clause[optseq] new-line
36857 */
36859 #define OACC_DECLARE_CLAUSE_MASK \
36860 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) )
36869 static tree
36871 {
36880 {
36884 }
36887 {
36891 {
36895 }
36898 {
36910 {
36912 "%qD must be a global variable in "
36914 decl);
36917 }
36922 {
36926 }
36928 {
36930 "invalid use of %<extern%> variable %qD "
36934 }
36936 {
36938 "invalid use of %<global%> variable %qD "
36942 }
36944 }
36949 {
36954 }
36957 {
36958 tree id;
36962 else
36968 {
36971 {
36974 {
36978 }
36979 }
36980 }
36981 }
36982 }
36995 }
36997 /* OpenACC 2.0:
36998 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
37000 or
37002 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
37004 LOC is the location of the #pragma token.
37005 */
37007 #define OACC_ENTER_DATA_CLAUSE_MASK \
37008 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37009 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37014 #define OACC_EXIT_DATA_CLAUSE_MASK \
37015 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
37019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FINALIZE) \
37020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37022 static tree
37025 {
37034 {
37039 }
37046 else
37051 {
37055 }
37063 }
37065 /* OpenACC 2.0:
37066 # pragma acc loop oacc-loop-clause[optseq] new-line
37067 structured-block */
37069 #define OACC_LOOP_CLAUSE_MASK \
37070 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
37071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
37077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
37078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
37079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
37081 static tree
37084 {
37093 {
37099 }
37108 }
37110 /* OpenACC 2.0:
37111 # pragma acc kernels oacc-kernels-clause[optseq] new-line
37112 structured-block
37114 or
37116 # pragma acc parallel oacc-parallel-clause[optseq] new-line
37117 structured-block
37118 */
37120 #define OACC_KERNELS_CLAUSE_MASK \
37121 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
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_PRIVATE) \
37149 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37150 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37151 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37153 static tree
37156 {
37157 omp_clause_mask mask;
37160 {
37173 }
37176 {
37180 {
37183 tree clauses;
37185 if_p);
37187 }
37188 }
37197 }
37199 /* OpenACC 2.0:
37200 # pragma acc update oacc-update-clause[optseq] new-line
37201 */
37203 #define OACC_UPDATE_CLAUSE_MASK \
37204 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37205 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37206 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF_PRESENT) \
37209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37211 static tree
37213 {
37220 {
37222 "%<#pragma acc update%> must contain at least one "
37225 }
37233 }
37235 /* OpenACC 2.0:
37236 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37238 LOC is the location of the #pragma token.
37239 */
37241 #define OACC_WAIT_CLAUSE_MASK \
37242 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37244 static tree
37246 {
37260 }
37262 /* OpenMP 4.0:
37263 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37265 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37266 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37273 static void
37276 {
37278 cp_omp_declare_simd_data data;
37280 {
37285 /* It is safe to take the address of a local variable; it will only be
37286 used while this scope is live. */
37288 }
37290 /* Store away all pragma tokens. */
37302 {
37306 {
37319 }
37324 "%<#pragma omp declare simd%> not immediately followed by "
37328 }
37329 }
37331 /* Finalize #pragma omp declare simd clauses after direct declarator has
37332 been parsed, and put that into "omp declare simd" attribute. */
37334 static tree
37336 {
37342 {
37346 }
37351 {
37369 }
37373 }
37376 /* OpenMP 4.0:
37377 # pragma omp declare target new-line
37378 declarations and definitions
37379 # pragma omp end declare target new-line
37381 OpenMP 4.5:
37382 # pragma omp declare target ( extended-list ) new-line
37384 # pragma omp declare target declare-target-clauses[seq] new-line */
37386 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37387 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37390 static void
37392 {
37395 clauses
37399 {
37401 clauses);
37404 }
37405 else
37406 {
37410 }
37413 "%<#pragma omp declare target%> with clauses in between "
37414 "%<#pragma omp declare target%> without clauses and "
37417 {
37423 {
37426 }
37427 else
37430 {
37432 "%qD specified both in declare target %<link%> and %<to%>"
37435 }
37437 {
37444 {
37447 {
37451 }
37452 }
37453 }
37454 }
37455 }
37457 static void
37459 {
37462 {
37465 }
37467 {
37471 {
37474 }
37477 else
37478 {
37482 }
37483 }
37484 else
37485 {
37489 }
37493 "%<#pragma omp end declare target%> without corresponding "
37495 else
37497 }
37499 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37500 expression and optional initializer clause of
37501 #pragma omp declare reduction. We store the expression(s) as
37502 either 3, 6 or 7 special statements inside of the artificial function's
37503 body. The first two statements are DECL_EXPRs for the artificial
37504 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37505 expression that uses those variables.
37506 If there was any INITIALIZER clause, this is followed by further statements,
37507 the fourth and fifth statements are DECL_EXPRs for the artificial
37508 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37509 constructor variant (first token after open paren is not omp_priv),
37510 then the sixth statement is a statement with the function call expression
37511 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37512 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37513 to initialize the OMP_PRIV artificial variable and there is seventh
37514 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37516 static bool
37518 {
37530 tree combiner;
37545 {
37548 }
37551 {
37553 matching_parens parens;
37559 {
37562 }
37578 {
37582 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37586 == CPP_CLOSE_PAREN
37589 {
37593 }
37598 }
37599 else
37600 {
37616 {
37621 }
37623 tree arg;
37636 }
37647 }
37651 UNKNOWN_LOCATION);
37654 }
37656 /* OpenMP 4.0
37657 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37658 initializer-clause[opt] new-line
37660 initializer-clause:
37661 initializer (omp_priv initializer)
37662 initializer (function-name (argument-list)) */
37664 static void
37667 {
37677 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37684 {
37716 }
37728 /* Types may not be defined in declare reduction type list. */
37731 parser->type_definition_forbidden_message
37737 saved_colon_doesnt_start_class_def_p
37742 {
37746 ;
37765 else
37770 else
37772 }
37774 /* Restore the saved message. */
37777 parser->colon_doesnt_start_class_def_p
37782 {
37783 fail:
37786 }
37792 {
37793 tree fntype
37796 NULL_TREE);
37816 {
37821 }
37823 {
37825 {
37834 }
37841 }
37842 else
37843 {
37846 }
37849 else
37852 {
37855 }
37857 {
37860 else
37865 }
37870 else
37871 {
37880 }
37887 }
37891 done:
37892 /* Free any declarators allocated. */
37894 }
37896 /* OpenMP 4.0
37897 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37898 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37899 initializer-clause[opt] new-line
37900 #pragma omp declare target new-line */
37902 static bool
37905 {
37907 {
37912 {
37915 context);
37917 }
37920 {
37923 context);
37925 }
37927 {
37930 }
37932 {
37936 }
37937 }
37942 }
37944 /* OpenMP 4.5:
37945 #pragma omp taskloop taskloop-clause[optseq] new-line
37946 for-loop
37948 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37949 for-loop */
37951 #define OMP_TASKLOOP_CLAUSE_MASK \
37952 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37953 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37954 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37955 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37956 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37957 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37958 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37965 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37967 static tree
37971 {
37980 {
37985 {
38009 }
38010 }
38012 {
38015 }
38020 {
38023 }
38029 if_p);
38035 }
38038 /* OpenACC 2.0:
38039 # pragma acc routine oacc-routine-clause[optseq] new-line
38040 function-definition
38042 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
38043 */
38045 #define OACC_ROUTINE_CLAUSE_MASK \
38046 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
38047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
38048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
38049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
38052 /* Parse the OpenACC routine pragma. This has an optional '( name )'
38053 component, which must resolve to a declared namespace-scope
38054 function. The clauses are either processed directly (for a named
38055 function), or defered until the immediatley following declaration
38056 is parsed. */
38058 static void
38061 {
38063 /* The checking for "another pragma following this one" in the "no optional
38064 '( name )'" case makes sure that we dont re-enter. */
38067 cp_oacc_routine_data data;
38073 /* It is safe to take the address of a local variable; it will only be
38074 used while this scope is live. */
38077 /* Look for optional '( name )'. */
38079 {
38080 matching_parens parens;
38083 /* We parse the name as an id-expression. If it resolves to
38084 anything other than a non-overloaded function at namespace
38085 scope, it's an error. */
38101 {
38105 }
38107 data.clauses
38115 {
38120 }
38122 /* Perhaps we should use the same rule as declarations in different
38123 namespaces? */
38125 {
38130 }
38133 {
38137 }
38141 }
38143 {
38144 /* Store away all pragma tokens. */
38155 /* Emit a helpful diagnostic if there's another pragma following this
38156 one. */
38158 {
38161 /* ..., and then just keep going. */
38163 }
38165 /* We only have to consider the pragma_external case here. */
38170 else
38173 }
38174 }
38176 /* Finalize #pragma acc routine clauses after direct declarator has
38177 been parsed. */
38179 static tree
38181 {
38186 {
38188 "%<#pragma acc routine%> not immediately followed by "
38191 }
38208 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38209 fndecl_seen. */
38212 }
38214 /* Apply any saved OpenACC routine clauses to a just-parsed
38215 declaration. */
38217 static void
38219 {
38221 {
38222 /* Keep going if we're in error reporting mode. */
38228 {
38230 "%<#pragma acc routine%> not immediately followed by"
38234 }
38236 {
38239 }
38242 {
38247 }
38250 {
38258 }
38260 /* Process the routine's dimension clauses. */
38264 /* Add an "omp declare target" attribute. */
38269 /* Don't unset parser->oacc_routine here: we may still need it to
38270 diagnose wrong usage. But, remember that we've used this "#pragma acc
38271 routine". */
38273 }
38274 }
38276 /* Main entry point to OpenMP statement pragmas. */
38278 static void
38280 {
38281 tree stmt;
38286 {
38309 if_p);
38314 if_p);
38331 if_p);
38336 if_p);
38344 if_p);
38353 if_p);
38367 if_p);
38372 if_p);
38376 }
38379 }
38380 \f
38381 /* Transactional Memory parsing routines. */
38383 /* Parse a transaction attribute.
38385 txn-attribute:
38386 attribute
38387 [ [ identifier ] ]
38389 We use this instead of cp_parser_attributes_opt for transactions to avoid
38390 the pedwarn in C++98 mode. */
38392 static tree
38394 {
38409 {
38413 /* For keywords, use the canonical spelling,
38414 not the parsed identifier. */
38418 }
38419 else
38423 error1:
38426 }
38428 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38430 transaction-statement:
38431 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38432 compound-statement
38433 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38434 */
38436 static tree
38438 {
38449 else
38450 {
38454 }
38456 /* Parse a noexcept specification. */
38460 {
38461 /* cancel-and-throw is unimplemented. */
38464 }
38465 else
38468 /* Keep track if we're in the lexical scope of an outer transaction. */
38480 }
38482 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38484 transaction-expression:
38485 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38486 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38487 */
38489 static tree
38491 {
38504 keyword == RID_TRANSACTION_RELAXED
38518 /* Set this early. This might mean that we allow transaction_cancel in
38519 an expression that we find out later actually has to be a constexpr.
38520 However, we expect that cxx_constant_value will be able to deal with
38521 this; also, if the noexcept has no constexpr, then what we parse next
38522 really is a transaction's body. */
38525 /* Parse a noexcept specification. */
38531 {
38532 matching_parens parens;
38539 }
38540 else
38541 {
38542 /* The only expression that is available got parsed for the noexcept
38543 already. noexcept is true then. */
38546 }
38555 }
38557 /* Parse a function-transaction-block.
38559 function-transaction-block:
38560 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38561 function-body
38562 __transaction_atomic txn-attribute[opt] function-try-block
38563 __transaction_relaxed ctor-initializer[opt] function-body
38564 __transaction_relaxed function-try-block
38565 */
38567 static void
38569 {
38584 else
38585 {
38589 }
38597 else
38598 cp_parser_ctor_initializer_opt_and_function_body
38604 }
38606 /* Parse a __transaction_cancel statement.
38608 cancel-statement:
38609 __transaction_cancel txn-attribute[opt] ;
38610 __transaction_cancel txn-attribute[opt] throw-expression ;
38612 ??? Cancel and throw is not yet implemented. */
38614 static tree
38616 {
38622 RT_TRANSACTION_CANCEL);
38629 /* ??? Parse cancel-and-throw here. */
38634 {
38638 }
38640 {
38644 }
38646 {
38649 {
38655 }
38656 }
38658 {
38662 }
38668 }
38669 \f
38670 /* The parser. */
38674 \f
38675 /* Special handling for the first token or line in the file. The first
38676 thing in the file might be #pragma GCC pch_preprocess, which loads a
38677 PCH file, which is a GC collection point. So we need to handle this
38678 first pragma without benefit of an existing lexer structure.
38680 Always returns one token to the caller in *FIRST_TOKEN. This is
38681 either the true first token of the file, or the first token after
38682 the initial pragma. */
38684 static void
38686 {
38695 {
38702 }
38703 else
38706 /* Skip to the end of the pragma. */
38710 /* Now actually load the PCH file. */
38714 /* Read one more token to return to our caller. We have to do this
38715 after reading the PCH file in, since its pointers have to be
38716 live. */
38718 }
38720 /* Parse a pragma GCC ivdep. */
38722 static bool
38724 {
38727 }
38729 /* Parse a pragma GCC unroll. */
38731 static unsigned short
38733 {
38743 {
38745 " assignment-expression that evaluates to a non-negative"
38748 }
38749 else
38750 {
38754 }
38757 }
38759 /* Normal parsing of a pragma token. Here we can (and must) use the
38760 regular lexer. */
38762 static bool
38764 {
38767 tree stmt;
38778 {
38786 {
38796 }
38801 {
38811 }
38816 {
38827 }
38832 {
38843 }
38848 {
38859 }
38879 {
38884 }
38892 {
38897 }
38905 {
38909 }
38915 {
38920 }
38928 {
38933 }
38988 "%<#pragma omp section%> may only be used in "
38993 {
38995 {
38999 }
39005 {
39009 }
39010 else
39016 {
39019 }
39022 }
39025 {
39027 {
39031 }
39032 const unsigned short unroll
39038 {
39042 }
39043 else
39049 {
39052 }
39055 }
39062 bad_stmt:
39065 }
39069 }
39071 /* The interface the pragma parsers have to the lexer. */
39073 enum cpp_ttype
39075 {
39087 else
39088 {
39092 }
39095 }
39097 \f
39098 /* External interface. */
39100 /* Parse one entire translation unit. */
39102 void
39104 {
39117 }
39119 /* Create an identifier for a generic parameter type (a synthesized
39120 template parameter implied by `auto' or a concept identifier). */
39123 static tree
39125 {
39129 }
39131 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39132 (creating a new template parameter list if necessary). Returns the newly
39133 created template type parm. */
39135 static tree
39137 {
39140 /* Before committing to modifying any scope, if we're in an
39141 implicit template scope, and we're trying to synthesize a
39142 constrained parameter, try to find a previous parameter with
39143 the same name. This is the same-type rule for abbreviated
39144 function templates.
39146 NOTE: We can generate implicit parameters when tentatively
39147 parsing a nested name specifier, only to reject that parse
39148 later. However, matching the same template-id as part of a
39149 direct-declarator should generate an identical template
39150 parameter, so this rule will merge them. */
39152 {
39155 {
39157 {
39160 /* Return the TEMPLATE_PARM_INDEX. */
39163 }
39165 }
39166 }
39168 /* We are either continuing a function template that already contains implicit
39169 template parameters, creating a new fully-implicit function template, or
39170 extending an existing explicit function template with implicit template
39171 parameters. */
39179 {
39183 }
39184 else
39185 {
39186 /* Roll back to the existing template parameter scope (in the case of
39187 extending an explicit function template) or introduce a new template
39188 parameter scope ahead of the function parameter scope (or class scope
39189 in the case of out-of-line member definitions). The function scope is
39190 added back after template parameter synthesis below. */
39195 {
39198 }
39200 {
39201 /* If not defining a class, then any class scope is a scope level in
39202 an out-of-line member definition. In this case simply wind back
39203 beyond the first such scope to inject the template parameter list.
39204 Otherwise wind back to the class being defined. The latter can
39205 occur in class member friend declarations such as:
39207 class A {
39208 void foo (auto);
39209 };
39210 class B {
39211 friend void A::foo (auto);
39212 };
39214 The template parameter list synthesized for the friend declaration
39215 must be injected in the scope of 'B'. This can also occur in
39216 erroneous cases such as:
39218 struct A {
39219 struct B {
39220 void foo (auto);
39221 };
39222 void B::foo (auto) {}
39223 };
39225 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39226 but, nevertheless, the template parameter list synthesized for the
39227 declarator should be injected into the scope of 'A' as if the
39228 ill-formed template was specified explicitly. */
39231 {
39234 }
39235 }
39241 {
39242 /* Introduce a new template parameter list for implicit template
39243 parameters. */
39247 parser->implicit_template_scope
39254 }
39255 else
39256 {
39257 /* Synthesize implicit template parameters at the end of the explicit
39258 template parameter list. */
39265 parser->implicit_template_parms
39267 }
39268 }
39270 /* Synthesize a new template parameter and track the current template
39271 parameter chain with implicit_template_parms. */
39275 tree synth_tmpl_parm;
39279 synth_tmpl_parm
39282 synth_tmpl_parm
39284 else
39285 {
39289 }
39291 // Attach the constraint to the parm before processing.
39294 tree new_parm
39296 input_location,
39297 node,
39301 // Chain the new parameter to the list of implicit parameters.
39303 parser->implicit_template_parms
39305 else
39310 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39313 /* If creating a fully implicit function template, start the new implicit
39314 template parameter list with this synthesized type, otherwise grow the
39315 current template parameter list. */
39318 {
39325 }
39326 else
39327 {
39332 }
39334 // If the new parameter was constrained, we need to add that to the
39335 // constraints in the template parameter list.
39337 {
39341 }
39346 }
39348 /* Finish the declaration of a fully implicit function template. Such a
39349 template has no explicit template parameter list so has not been through the
39350 normal template head and tail processing. synthesize_implicit_template_parm
39351 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39352 provided if the declaration is a class member such that its template
39353 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39354 form is returned. Otherwise NULL_TREE is returned. */
39356 static tree
39358 {
39363 {
39367 }
39379 }
39381 /* Like finish_fully_implicit_template, but to be used in error
39382 recovery, rearranging scopes so that we restore the state we had
39383 before synthesize_implicit_template_parm inserted the implement
39384 template parms scope. */
39386 static void
39388 {
39393 {
39402 }
39403 else
39409 }
39411 /* Helper function for diagnostics that have complained about things
39412 being used with 'extern "C"' linkage.
39414 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39416 void
39418 {
39422 }